TSTP Solution File: SWV042+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV042+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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.97s 1.15s
% Output : Refutation 0.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV042+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 15 13:38:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.97/1.15
% 0.97/1.15 SPASS V 3.9
% 0.97/1.15 SPASS beiseite: Proof found.
% 0.97/1.15 % SZS status Theorem
% 0.97/1.15 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.97/1.15 SPASS derived 4000 clauses, backtracked 25 clauses, performed 5 splits and kept 1923 clauses.
% 0.97/1.15 SPASS allocated 88970 KBytes.
% 0.97/1.15 SPASS spent 0:00:00.80 on the problem.
% 0.97/1.15 0:00:00.04 for the input.
% 0.97/1.15 0:00:00.08 for the FLOTTER CNF translation.
% 0.97/1.15 0:00:00.03 for inferences.
% 0.97/1.15 0:00:00.01 for the backtracking.
% 0.97/1.15 0:00:00.50 for the reduction.
% 0.97/1.15
% 0.97/1.15
% 0.97/1.15 Here is a proof with depth 1, length 51 :
% 0.97/1.15 % SZS output start Refutation
% 0.97/1.15 1[0:Inp] || -> SkC0*.
% 0.97/1.15 2[0:Inp] || -> SkC1*.
% 0.97/1.15 4[0:Inp] || -> leq(n0,skc7)*r.
% 0.97/1.15 30[0:Inp] || -> SkC2* leq(skc7,n2).
% 0.97/1.15 53[0:Inp] || -> equal(pred(succ(u)),u)**.
% 0.97/1.15 58[0:Inp] || -> equal(plus(u,n1),succ(u))**.
% 0.97/1.15 60[0:Inp] || -> equal(minus(u,n1),pred(u))**.
% 0.97/1.15 62[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1400_init)**.
% 0.97/1.15 63[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1401_init)**.
% 0.97/1.15 64[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1402_init)**.
% 0.97/1.15 65[0:Inp] || equal(a_select2(s_center7_init,skc7),init)** -> SkC2.
% 0.97/1.15 72[0:Inp] || -> equal(succ(succ(u)),plus(u,n2))**.
% 0.97/1.15 73[0:Inp] || -> equal(succ(succ(u)),plus(n2,u))**.
% 0.97/1.15 92[0:Inp] || SkC0* SkC1 SkC2 -> gt(loopcounter,n1).
% 0.97/1.15 114[0:Inp] || leq(n0,u) leq(u,minus(plus(n1,n2),n1))* -> equal(a_select2(s_center7_init,u),init)**.
% 0.97/1.15 117[0:Inp] || equal(init,pvar1400_init) equal(init,pvar1401_init) equal(init,pvar1402_init) SkC0* SkC1 SkC2 -> .
% 0.97/1.15 154[0:Rew:73.0,72.0] || -> equal(plus(n2,u),plus(u,n2))*.
% 0.97/1.15 163[0:Rew:64.1,63.1] || gt(loopcounter,n1) -> equal(pvar1402_init,pvar1401_init)**.
% 0.97/1.15 164[0:Rew:163.1,64.1] || gt(loopcounter,n1) -> equal(init,pvar1401_init)**.
% 0.97/1.15 165[0:Rew:62.1,164.1] || gt(loopcounter,n1) -> equal(pvar1401_init,pvar1400_init)**.
% 0.97/1.15 166[0:Rew:165.1,163.1] || gt(loopcounter,n1) -> equal(pvar1402_init,pvar1400_init)**.
% 0.97/1.15 167[0:MRR:92.0,92.1,1.0,2.0] || SkC2* -> gt(loopcounter,n1).
% 0.97/1.15 168[0:MRR:117.3,117.4,1.0,2.0] || SkC2* equal(init,pvar1402_init) equal(init,pvar1401_init) equal(init,pvar1400_init) -> .
% 0.97/1.15 170[0:Rew:53.0,114.1,58.0,114.1,154.0,114.1,60.0,114.1] || leq(u,n2) leq(n0,u) -> equal(a_select2(s_center7_init,u),init)**.
% 0.97/1.15 760[1:Spt:62.1] || -> equal(init,pvar1400_init)**.
% 0.97/1.15 761[1:Rew:760.0,168.3] || SkC2* equal(init,pvar1402_init) equal(init,pvar1401_init) equal(pvar1400_init,pvar1400_init) -> .
% 0.97/1.15 762[1:Rew:760.0,65.0] || equal(a_select2(s_center7_init,skc7),pvar1400_init)** -> SkC2.
% 0.97/1.15 763[1:Rew:760.0,170.2] || leq(u,n2) leq(n0,u) -> equal(a_select2(s_center7_init,u),pvar1400_init)**.
% 0.97/1.15 770[1:Obv:761.3] || SkC2* equal(init,pvar1402_init) equal(init,pvar1401_init) -> .
% 0.97/1.15 771[1:Rew:760.0,770.2,760.0,770.1] || SkC2* equal(pvar1402_init,pvar1400_init) equal(pvar1401_init,pvar1400_init) -> .
% 0.97/1.15 773[2:Spt:167.0] || SkC2* -> .
% 0.97/1.15 774[2:MRR:30.0,773.0] || -> leq(skc7,n2)*l.
% 0.97/1.15 775[2:MRR:762.1,773.0] || equal(a_select2(s_center7_init,skc7),pvar1400_init)** -> .
% 0.97/1.15 5434[2:SpL:763.2,775.0] || leq(skc7,n2)*l leq(n0,skc7) equal(pvar1400_init,pvar1400_init) -> .
% 0.97/1.15 5435[2:Obv:5434.2] || leq(skc7,n2)*l leq(n0,skc7) -> .
% 0.97/1.15 5436[2:MRR:5435.0,5435.1,774.0,4.0] || -> .
% 0.97/1.15 5437[2:Spt:5436.0,167.0,773.0] || -> SkC2*.
% 0.97/1.15 5438[2:Spt:5436.0,167.1] || -> gt(loopcounter,n1)*l.
% 0.97/1.15 5439[2:MRR:771.0,5437.0] || equal(pvar1402_init,pvar1400_init)** equal(pvar1401_init,pvar1400_init) -> .
% 0.97/1.15 5440[2:MRR:166.0,5438.0] || -> equal(pvar1402_init,pvar1400_init)**.
% 0.97/1.15 5441[2:Rew:5440.0,5439.0] || equal(pvar1400_init,pvar1400_init) equal(pvar1401_init,pvar1400_init)** -> .
% 0.97/1.15 5442[2:Obv:5441.0] || equal(pvar1401_init,pvar1400_init)** -> .
% 0.97/1.15 5443[2:MRR:165.0,165.1,5438.0,5442.0] || -> .
% 0.97/1.15 5444[1:Spt:5443.0,62.1,760.0] || equal(init,pvar1400_init)** -> .
% 0.97/1.15 5445[1:Spt:5443.0,62.0] || gt(loopcounter,n1)*l -> .
% 0.97/1.15 5446[1:MRR:167.1,5445.0] || SkC2* -> .
% 0.97/1.15 5447[1:MRR:65.1,5446.0] || equal(a_select2(s_center7_init,skc7),init)** -> .
% 0.97/1.15 5448[1:MRR:30.0,5446.0] || -> leq(skc7,n2)*l.
% 0.97/1.15 5500[1:SpL:170.2,5447.0] || leq(skc7,n2) leq(n0,skc7) equal(init,init)* -> .
% 0.97/1.15 5501[1:Obv:5500.2] || leq(skc7,n2)*l leq(n0,skc7) -> .
% 0.97/1.15 5502[1:MRR:5501.0,5501.1,5448.0,4.0] || -> .
% 0.97/1.15 % SZS output end Refutation
% 0.97/1.15 Formulae used in the proof : gauss_init_0081 reflexivity_leq leq_succ_succ pred_succ succ_plus_1_r pred_minus_1 succ_plus_2_r succ_plus_2_l
% 0.97/1.15
%------------------------------------------------------------------------------