TSTP Solution File: SWV039+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV039+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:04 EDT 2022
% Result : Theorem 0.80s 0.98s
% Output : Refutation 0.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV039+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 21:04:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.80/0.98
% 0.80/0.98 SPASS V 3.9
% 0.80/0.98 SPASS beiseite: Proof found.
% 0.80/0.98 % SZS status Theorem
% 0.80/0.98 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.80/0.98 SPASS derived 2170 clauses, backtracked 104 clauses, performed 5 splits and kept 1007 clauses.
% 0.80/0.98 SPASS allocated 87696 KBytes.
% 0.80/0.98 SPASS spent 0:00:00.61 on the problem.
% 0.80/0.98 0:00:00.04 for the input.
% 0.80/0.98 0:00:00.08 for the FLOTTER CNF translation.
% 0.80/0.98 0:00:00.02 for inferences.
% 0.80/0.98 0:00:00.01 for the backtracking.
% 0.80/0.98 0:00:00.30 for the reduction.
% 0.80/0.98
% 0.80/0.98
% 0.80/0.98 Here is a proof with depth 2, length 55 :
% 0.80/0.98 % SZS output start Refutation
% 0.80/0.98 1[0:Inp] || -> SkC0*.
% 0.80/0.98 2[0:Inp] || -> SkC1*.
% 0.80/0.98 3[0:Inp] || -> SkC2*.
% 0.80/0.98 5[0:Inp] || -> leq(n0,skc9)*r.
% 0.80/0.98 10[0:Inp] || -> equal(init,s_best7_init)**.
% 0.80/0.98 11[0:Inp] || -> equal(init,s_sworst7_init)**.
% 0.80/0.98 12[0:Inp] || -> equal(init,s_worst7_init)**.
% 0.80/0.98 13[0:Inp] || -> leq(n0,s_best7)*r.
% 0.80/0.98 14[0:Inp] || -> leq(n0,s_sworst7)*r.
% 0.80/0.98 15[0:Inp] || -> leq(n0,s_worst7)*r.
% 0.80/0.98 16[0:Inp] || -> leq(s_best7,n3)*r.
% 0.80/0.98 17[0:Inp] || -> leq(s_sworst7,n3)*r.
% 0.80/0.98 18[0:Inp] || -> leq(s_worst7,n3)*r.
% 0.80/0.98 42[0:Inp] || gt(u,u)* -> .
% 0.80/0.98 44[0:Inp] || -> equal(succ(tptp_minus_1),n0)**.
% 0.80/0.98 63[0:Inp] || -> equal(pred(succ(u)),u)**.
% 0.80/0.98 65[0:Inp] || -> leq(skc9,minus(n0,n1))*r SkC3.
% 0.80/0.98 71[0:Inp] || -> equal(minus(u,n1),pred(u))**.
% 0.80/0.98 73[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1400_init)**.
% 0.80/0.98 74[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1401_init)**.
% 0.80/0.98 75[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1402_init)**.
% 0.80/0.98 91[0:Inp] || leq(u,v)*+ -> gt(succ(v),u)*.
% 0.80/0.98 117[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*.
% 0.80/0.98 156[0:Inp] || 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(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC0* SkC1 SkC2 SkC3 -> gt(loopcounter,n1).
% 0.80/0.98 159[0:Inp] || 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(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC0* SkC1 SkC2 SkC3 -> .
% 0.80/0.98 161[0:Rew:12.0,11.0] || -> equal(s_worst7_init,s_sworst7_init)**.
% 0.80/0.98 162[0:Rew:161.0,12.0] || -> equal(init,s_sworst7_init)**.
% 0.80/0.98 163[0:Rew:10.0,162.0] || -> equal(s_sworst7_init,s_best7_init)**.
% 0.80/0.98 164[0:Rew:163.0,161.0] || -> equal(s_worst7_init,s_best7_init)**.
% 0.80/0.98 179[0:Rew:71.0,65.0] || -> SkC3 leq(skc9,pred(n0))*r.
% 0.80/0.98 180[0:Rew:10.0,75.1] || gt(loopcounter,n1) -> equal(pvar1402_init,s_best7_init)**.
% 0.80/0.98 181[0:Rew:10.0,74.1] || gt(loopcounter,n1) -> equal(pvar1401_init,s_best7_init)**.
% 0.80/0.98 182[0:Rew:10.0,73.1] || gt(loopcounter,n1) -> equal(pvar1400_init,s_best7_init)**.
% 0.80/0.98 189[0:Rew:10.0,156.2,164.0,156.2,10.0,156.1,163.0,156.1,10.0,156.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(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC0* SkC1 SkC2 SkC3 -> gt(loopcounter,n1).
% 0.80/0.98 190[0:Obv:189.2] || leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC0* SkC1 SkC2 SkC3 -> gt(loopcounter,n1).
% 0.80/0.98 191[0:MRR:190.0,190.1,190.2,190.3,190.4,190.5,190.6,190.7,190.8,13.0,14.0,15.0,16.0,17.0,18.0,1.0,2.0,3.0] || SkC3* -> gt(loopcounter,n1).
% 0.80/0.98 192[0:Rew:10.0,159.5,164.0,159.5,10.0,159.4,163.0,159.4,10.0,159.3,10.0,159.2,10.0,159.1,10.0,159.0] || equal(pvar1400_init,s_best7_init) equal(pvar1401_init,s_best7_init) equal(pvar1402_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(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC0* SkC1 SkC2 SkC3 -> .
% 0.80/0.98 193[0:Obv:192.5] || equal(pvar1400_init,s_best7_init) equal(pvar1401_init,s_best7_init) equal(pvar1402_init,s_best7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC0* SkC1 SkC2 SkC3 -> .
% 0.80/0.98 194[0:MRR:193.3,193.4,193.5,193.6,193.7,193.8,193.9,193.10,193.11,13.0,14.0,15.0,16.0,17.0,18.0,1.0,2.0,3.0] || SkC3* equal(pvar1402_init,s_best7_init) equal(pvar1401_init,s_best7_init) equal(pvar1400_init,s_best7_init) -> .
% 0.80/0.98 706[1:Spt:191.0] || SkC3* -> .
% 0.80/0.98 708[1:MRR:179.0,706.0] || -> leq(skc9,pred(n0))*r.
% 0.80/0.98 726[0:SpR:44.0,63.0] || -> equal(pred(n0),tptp_minus_1)**.
% 0.80/0.98 733[1:Rew:726.0,708.0] || -> leq(skc9,tptp_minus_1)*l.
% 0.80/0.98 861[1:OCh:117.1,117.0,733.0,5.0] || -> leq(n0,tptp_minus_1)*r.
% 0.80/0.98 3230[1:Res:861.0,91.0] || -> gt(succ(tptp_minus_1),n0)*l.
% 0.80/0.98 3334[1:Rew:44.0,3230.0] || -> gt(n0,n0)*.
% 0.80/0.98 3335[1:MRR:3334.0,42.0] || -> .
% 0.80/0.98 3345[1:Spt:3335.0,191.0,706.0] || -> SkC3*.
% 0.80/0.98 3346[1:Spt:3335.0,191.1] || -> gt(loopcounter,n1)*r.
% 0.80/0.98 3347[1:MRR:181.0,3346.0] || -> equal(pvar1401_init,s_best7_init)**.
% 0.80/0.98 3348[1:MRR:182.0,3346.0] || -> equal(pvar1400_init,s_best7_init)**.
% 0.80/0.98 3349[1:MRR:180.0,3346.0] || -> equal(pvar1402_init,s_best7_init)**.
% 0.80/0.98 3350[1:Rew:3348.0,194.3,3347.0,194.2,3349.0,194.1] || SkC3* equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) -> .
% 0.80/0.98 3351[1:Obv:3350.3] || SkC3* -> .
% 0.80/0.98 3352[1:MRR:3351.0,3345.0] || -> .
% 0.80/0.98 % SZS output end Refutation
% 0.80/0.98 Formulae used in the proof : gauss_init_0069 reflexivity_leq leq_succ_succ irreflexivity_gt succ_tptp_minus_1 pred_succ pred_minus_1 leq_succ_gt_equiv transitivity_leq
% 0.80/0.98
%------------------------------------------------------------------------------