%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV025+1 : TPTP v8.1.0. Bugfixed v3.3.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n010.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Wed Jul 20 21:41:01 EDT 2022 % Result : Theorem 0.20s 0.53s % Output : Refutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SWV025+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.07/0.14 % Command : run_spass %d %s % 0.13/0.35 % Computer : n010.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Wed Jun 15 08:13:39 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.53 % 0.20/0.53 SPASS V 3.9 % 0.20/0.53 SPASS beiseite: Proof found. % 0.20/0.53 % SZS status Theorem % 0.20/0.53 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.53 SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 185 clauses. % 0.20/0.53 SPASS allocated 85905 KBytes. % 0.20/0.53 SPASS spent 0:00:00.17 on the problem. % 0.20/0.53 0:00:00.04 for the input. % 0.20/0.53 0:00:00.08 for the FLOTTER CNF translation. % 0.20/0.53 0:00:00.00 for inferences. % 0.20/0.53 0:00:00.00 for the backtracking. % 0.20/0.53 0:00:00.02 for the reduction. % 0.20/0.53 % 0.20/0.53 % 0.20/0.53 Here is a proof with depth 0, length 43 : % 0.20/0.53 % SZS output start Refutation % 0.20/0.53 1[0:Inp] || -> SkC0*. % 0.20/0.53 2[0:Inp] || -> SkC1*. % 0.20/0.53 3[0:Inp] || -> SkC2*. % 0.20/0.53 4[0:Inp] || -> SkC3*. % 0.20/0.53 12[0:Inp] || -> equal(init,s_best7_init)**. % 0.20/0.53 13[0:Inp] || -> equal(init,s_sworst7_init)**. % 0.20/0.53 14[0:Inp] || -> equal(init,s_worst7_init)**. % 0.20/0.53 15[0:Inp] || -> leq(n0,s_best7)*r. % 0.20/0.53 16[0:Inp] || -> leq(n0,s_sworst7)*r. % 0.20/0.53 17[0:Inp] || -> leq(n0,s_worst7)*r. % 0.20/0.53 19[0:Inp] || -> leq(n0,pv19)*r. % 0.20/0.53 20[0:Inp] || -> leq(n0,pv20)*r. % 0.20/0.53 21[0:Inp] || -> leq(s_best7,n3)*r. % 0.20/0.53 22[0:Inp] || -> leq(s_sworst7,n3)*r. % 0.20/0.53 23[0:Inp] || -> leq(s_worst7,n3)*r. % 0.20/0.53 67[0:Inp] || -> leq(pv19,minus(n410,n1))*r. % 0.20/0.53 68[0:Inp] || -> leq(pv20,minus(n330,n1))*r. % 0.20/0.53 93[0:Inp] || -> equal(minus(u,n1),pred(u))**. % 0.20/0.53 95[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1400_init)**. % 0.20/0.53 96[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1401_init)**. % 0.20/0.53 97[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1402_init)**. % 0.20/0.53 181[0:Inp] || equal(init,init) equal(init,s_best7_init) equal(init,s_sworst7_init) equal(init,s_worst7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,minus(n410,n1)) leq(pv20,minus(n330,n1))*r SkC0 SkC1 SkC2 SkC3 -> gt(loopcounter,n1). % 0.20/0.53 182[0:Inp] || equal(init,pvar1400_init) equal(init,pvar1401_init) equal(init,pvar1402_init) equal(init,init) equal(init,s_best7_init) equal(init,s_sworst7_init) equal(init,s_worst7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,minus(n410,n1)) leq(pv20,minus(n330,n1))*r SkC0 SkC1 SkC2 SkC3 -> . % 0.20/0.53 183[0:Rew:14.0,13.0] || -> equal(s_worst7_init,s_sworst7_init)**. % 0.20/0.53 184[0:Rew:183.0,14.0] || -> equal(init,s_sworst7_init)**. % 0.20/0.53 185[0:Rew:12.0,184.0] || -> equal(s_sworst7_init,s_best7_init)**. % 0.20/0.53 186[0:Rew:185.0,183.0] || -> equal(s_worst7_init,s_best7_init)**. % 0.20/0.53 200[0:Rew:93.0,68.0] || -> leq(pv20,pred(n330))*r. % 0.20/0.53 201[0:Rew:93.0,67.0] || -> leq(pv19,pred(n410))*r. % 0.20/0.53 203[0:Rew:12.0,97.1] || gt(loopcounter,n1) -> equal(pvar1402_init,s_best7_init)**. % 0.20/0.53 204[0:Rew:12.0,96.1] || gt(loopcounter,n1) -> equal(pvar1401_init,s_best7_init)**. % 0.20/0.53 205[0:Rew:12.0,95.1] || gt(loopcounter,n1) -> equal(pvar1400_init,s_best7_init)**. % 0.20/0.53 214[0:Obv:181.0] || equal(init,s_best7_init) equal(init,s_sworst7_init) equal(init,s_worst7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,minus(n410,n1)) leq(pv20,minus(n330,n1))*r SkC0 SkC1 SkC2 SkC3 -> gt(loopcounter,n1). % 0.20/0.53 215[0:Rew:93.0,214.12,93.0,214.11,12.0,214.2,186.0,214.2,12.0,214.1,185.0,214.1,12.0,214.0] || equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,pred(n410)) leq(pv20,pred(n330))*r SkC0 SkC1 SkC2 SkC3 -> gt(loopcounter,n1). % 0.20/0.53 216[0:Obv:215.2] || leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,pred(n410)) leq(pv20,pred(n330))*r SkC0 SkC1 SkC2 SkC3 -> gt(loopcounter,n1). % 0.20/0.53 217[0:MRR:216.0,216.1,216.2,216.3,216.4,216.5,216.6,216.7,216.8,216.9,216.10,216.11,216.12,216.13,15.0,16.0,17.0,19.0,20.0,21.0,22.0,23.0,201.0,200.0,1.0,2.0,3.0,4.0] || -> gt(loopcounter,n1)*l. % 0.20/0.53 218[0:MRR:203.0,217.0] || -> equal(pvar1402_init,s_best7_init)**. % 0.20/0.53 219[0:MRR:204.0,217.0] || -> equal(pvar1401_init,s_best7_init)**. % 0.20/0.53 220[0:MRR:205.0,217.0] || -> equal(pvar1400_init,s_best7_init)**. % 0.20/0.53 221[0:Obv:182.3] || equal(init,pvar1400_init) equal(init,pvar1401_init) equal(init,pvar1402_init) equal(init,s_best7_init) equal(init,s_sworst7_init) equal(init,s_worst7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,minus(n410,n1)) leq(pv20,minus(n330,n1))*r SkC0 SkC1 SkC2 SkC3 -> . % 0.20/0.53 222[0:Rew:93.0,221.15,93.0,221.14,12.0,221.5,186.0,221.5,12.0,221.4,185.0,221.4,12.0,221.3,12.0,221.2,218.0,221.2,12.0,221.1,219.0,221.1,12.0,221.0,220.0,221.0] || equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,pred(n410)) leq(pv20,pred(n330))*r SkC0 SkC1 SkC2 SkC3 -> . % 0.20/0.53 223[0:Obv:222.5] || leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,pred(n410)) leq(pv20,pred(n330))*r SkC0 SkC1 SkC2 SkC3 -> . % 0.20/0.53 224[0:MRR:223.0,223.1,223.2,223.3,223.4,223.5,223.6,223.7,223.8,223.9,223.10,223.11,223.12,223.13,15.0,16.0,17.0,19.0,20.0,21.0,22.0,23.0,201.0,200.0,1.0,2.0,3.0,4.0] || -> . % 0.20/0.53 % SZS output end Refutation % 0.20/0.53 Formulae used in the proof : gauss_init_0013 reflexivity_leq pred_minus_1 % 0.20/0.53 %------------------------------------------------------------------------------