TSTP Solution File: SWC078-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC078-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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 : Tue Jul 19 22:01:34 EDT 2022
% Result : Unsatisfiable 163.71s 163.99s
% Output : Refutation 195.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SWC078-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.09 % Command : run_spass %d %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Sun Jun 12 09:12:55 EDT 2022
% 0.09/0.29 % CPUTime :
% 163.71/163.99
% 163.71/163.99 SPASS V 3.9
% 163.71/163.99 SPASS beiseite: Proof found.
% 163.71/163.99 % SZS status Theorem
% 163.71/163.99 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 163.71/163.99 SPASS derived 43813 clauses, backtracked 27999 clauses, performed 142 splits and kept 37791 clauses.
% 163.71/163.99 SPASS allocated 136126 KBytes.
% 163.71/163.99 SPASS spent 0:2:43.58 on the problem.
% 163.71/163.99 0:00:00.03 for the input.
% 163.71/163.99 0:00:00.00 for the FLOTTER CNF translation.
% 163.71/163.99 0:00:00.76 for inferences.
% 163.71/163.99 0:00:08.76 for the backtracking.
% 163.71/163.99 0:2:33.22 for the reduction.
% 163.71/163.99
% 163.71/163.99
% 163.71/163.99 Here is a proof with depth 3, length 117 :
% 163.71/163.99 % SZS output start Refutation
% 163.71/163.99 1[0:Inp] || -> ssList(sk1)*.
% 163.71/163.99 2[0:Inp] || -> ssList(sk2)*.
% 163.71/163.99 5[0:Inp] || -> equal(sk4,sk2)**.
% 163.71/163.99 6[0:Inp] || -> equal(sk3,sk1)**.
% 163.71/163.99 7[0:Inp] ssList(u) || neq(u,nil) segmentP(sk1,u) segmentP(sk2,u)* -> .
% 163.71/163.99 8[0:Inp] || equal(nil,sk1) equal(nil,sk2)** -> .
% 163.71/163.99 11[0:Inp] || -> equal(cons(sk5,nil),sk3)** equal(nil,sk4).
% 163.71/163.99 13[0:Inp] || -> equal(cons(sk5,nil),sk3)** equal(nil,sk3).
% 163.71/163.99 14[0:Inp] || -> memberP(sk4,sk5)* equal(nil,sk3).
% 163.71/163.99 26[0:Inp] || -> ssItem(skaf83(u))*.
% 163.71/163.99 66[0:Inp] || -> ssList(skaf43(u,v))*.
% 163.71/164.00 67[0:Inp] || -> ssList(skaf42(u,v))*.
% 163.71/164.00 71[0:Inp] ssList(u) || -> segmentP(u,u)*.
% 163.71/164.00 78[0:Inp] ssItem(u) || -> equalelemsP(cons(u,nil))*.
% 163.71/164.00 79[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 163.71/164.00 80[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 163.71/164.00 81[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 163.71/164.00 82[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 163.71/164.00 83[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 163.71/164.00 84[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 163.71/164.00 85[0:Inp] ssItem(u) || memberP(nil,u)* -> .
% 163.71/164.00 86[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 163.71/164.00 99[0:Inp] ssList(u) ssList(v) || -> ssList(app(u,v))*.
% 163.71/164.00 100[0:Inp] ssList(u) ssItem(v) || -> ssList(cons(v,u))*.
% 163.71/164.00 113[0:Inp] ssList(u) ssItem(v) || equal(cons(v,u),u)** -> .
% 163.71/164.00 116[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 163.71/164.00 130[0:Inp] ssList(u) ssItem(v) || equal(cons(v,nil),u)*+ -> singletonP(u)*.
% 163.71/164.00 134[0:Inp] ssList(u) ssItem(v) || -> equal(app(cons(v,nil),u),cons(v,u))**.
% 163.71/164.00 163[0:Inp] ssList(u) ssList(v) ssList(w) || -> equal(app(app(u,v),w),app(u,app(v,w)))**.
% 163.71/164.00 171[0:Inp] ssList(u) ssList(v) ssItem(w) || -> equal(app(cons(w,v),u),cons(w,app(v,u)))**.
% 163.71/164.00 177[0:Inp] ssList(u) || -> strictorderedP(u) equal(app(app(skaf71(u),cons(skaf69(u),skaf72(u))),cons(skaf70(u),skaf73(u))),u)**.
% 163.71/164.00 178[0:Inp] ssList(u) || -> totalorderedP(u) equal(app(app(skaf66(u),cons(skaf64(u),skaf67(u))),cons(skaf65(u),skaf68(u))),u)**.
% 163.71/164.00 183[0:Inp] ssList(u) ssItem(v) || memberP(u,v) -> equal(app(skaf42(u,v),cons(v,skaf43(v,u))),u)**.
% 163.71/164.00 186[0:Inp] ssList(u) ssList(v) ssList(w) ssList(x) || segmentP(x,w) -> segmentP(app(app(v,x),u),w)*.
% 163.71/164.00 191[0:Inp] ssList(u) ssList(v) || equal(hd(v),hd(u))* equal(tl(v),tl(u)) -> equal(v,u) equal(nil,v) equal(nil,u).
% 163.71/164.00 193[0:Inp] ssList(u) duplicatefreeP(u) ssItem(v) ssList(w) ssList(x) ssList(y) || equal(app(app(w,cons(v,x)),cons(v,y)),u)* -> .
% 163.71/164.00 204[0:Rew:6.0,14.1,5.0,14.0] || -> equal(nil,sk1) memberP(sk2,sk5)*.
% 163.71/164.00 206[0:Rew:6.0,13.1,6.0,13.0] || -> equal(nil,sk1) equal(cons(sk5,nil),sk1)**.
% 163.71/164.00 207[0:Rew:206.1,11.1,5.0,11.1,6.0,11.0] || -> equal(sk2,sk1) equal(cons(sk5,nil),sk1)**.
% 163.71/164.00 210[0:Rew:163.3,186.5] ssList(u) ssList(v) ssList(w) ssList(x) || segmentP(u,v) -> segmentP(app(w,app(u,x)),v)*.
% 163.71/164.00 309[0:Res:2.0,191.1] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u) equal(nil,sk2).
% 163.71/164.00 315[0:Res:2.0,183.1] ssItem(u) || memberP(sk2,u) -> equal(app(skaf42(sk2,u),cons(u,skaf43(u,sk2))),sk2)**.
% 163.71/164.00 350[0:Res:2.0,100.1] ssItem(u) || -> ssList(cons(u,sk2))*.
% 163.71/164.00 402[0:Res:1.0,178.0] || -> totalorderedP(sk1) equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1)**.
% 163.71/164.00 403[0:Res:1.0,177.0] || -> strictorderedP(sk1) equal(app(app(skaf71(sk1),cons(skaf69(sk1),skaf72(sk1))),cons(skaf70(sk1),skaf73(sk1))),sk1)**.
% 163.71/164.00 468[0:Res:1.0,71.0] || -> segmentP(sk1,sk1)*.
% 163.71/164.00 481[0:Res:1.0,191.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1).
% 163.71/164.00 515[0:Res:1.0,130.1] ssItem(u) || equal(cons(u,nil),sk1)** -> singletonP(sk1).
% 163.71/164.00 519[0:Res:1.0,113.1] ssItem(u) || equal(cons(u,sk1),sk1)** -> .
% 163.71/164.00 546[0:Res:1.0,210.3] ssList(u) ssList(v) ssList(w) || segmentP(sk1,u) -> segmentP(app(v,app(sk1,w)),u)*.
% 163.71/164.00 562[1:Spt:86.1] || -> ssItem(u)*.
% 163.71/164.00 567[1:MRR:85.0,562.0] || memberP(nil,u)* -> .
% 163.71/164.00 568[1:MRR:84.0,562.0] || -> cyclefreeP(cons(u,nil))*.
% 163.71/164.00 569[1:MRR:83.0,562.0] || -> totalorderP(cons(u,nil))*.
% 163.71/164.00 570[1:MRR:82.0,562.0] || -> strictorderP(cons(u,nil))*.
% 163.71/164.00 571[1:MRR:81.0,562.0] || -> totalorderedP(cons(u,nil))*.
% 163.71/164.00 572[1:MRR:80.0,562.0] || -> strictorderedP(cons(u,nil))*.
% 163.71/164.00 573[1:MRR:79.0,562.0] || -> duplicatefreeP(cons(u,nil))*.
% 163.71/164.00 574[1:MRR:78.0,562.0] || -> equalelemsP(cons(u,nil))*.
% 163.71/164.00 576[1:MRR:519.0,562.0] || equal(cons(u,sk1),sk1)** -> .
% 163.71/164.00 584[1:MRR:515.0,562.0] || equal(cons(u,nil),sk1)** -> singletonP(sk1).
% 163.71/164.00 592[1:MRR:116.1,116.0,562.0] || -> equal(u,v) neq(u,v)*.
% 163.71/164.00 638[1:MRR:315.0,562.0] || memberP(sk2,u) -> equal(app(skaf42(sk2,u),cons(u,skaf43(u,sk2))),sk2)**.
% 163.71/164.00 693[1:MRR:134.1,562.0] ssList(u) || -> equal(app(cons(v,nil),u),cons(v,u))**.
% 163.71/164.00 766[2:Spt:481.5] || -> equal(nil,sk1)**.
% 163.71/164.00 771[2:Rew:766.0,8.0] || equal(sk1,sk1) equal(nil,sk2)** -> .
% 163.71/164.00 775[2:Rew:766.0,207.1] || -> equal(sk2,sk1) equal(cons(sk5,sk1),sk1)**.
% 163.71/164.00 912[2:Obv:771.0] || equal(nil,sk2)** -> .
% 163.71/164.00 913[2:Rew:766.0,912.0] || equal(sk2,sk1)** -> .
% 163.71/164.00 919[2:MRR:775.0,775.1,913.0,576.0] || -> .
% 163.71/164.00 984[2:Spt:919.0,481.5,766.0] || equal(nil,sk1)** -> .
% 163.71/164.00 985[2:Spt:919.0,481.0,481.1,481.2,481.3,481.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 163.71/164.00 987[2:MRR:204.0,984.0] || -> memberP(sk2,sk5)*.
% 163.71/164.00 991[2:MRR:206.0,984.0] || -> equal(cons(sk5,nil),sk1)**.
% 163.71/164.00 1003[3:Spt:309.5] || -> equal(nil,sk2)**.
% 163.71/164.00 1031[3:Rew:1003.0,567.0] || memberP(sk2,u)* -> .
% 163.71/164.00 1103[3:UnC:1031.0,987.0] || -> .
% 163.71/164.00 1180[3:Spt:1103.0,309.5,1003.0] || equal(nil,sk2)** -> .
% 163.71/164.00 1181[3:Spt:1103.0,309.0,309.1,309.2,309.3,309.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 163.71/164.00 1196[4:Spt:402.0] || -> totalorderedP(sk1)*.
% 163.71/164.00 1200[5:Spt:403.0] || -> strictorderedP(sk1)*.
% 163.71/164.00 1220[2:SpR:991.0,568.0] || -> cyclefreeP(sk1)*.
% 163.71/164.00 1221[2:SpR:991.0,569.0] || -> totalorderP(sk1)*.
% 163.71/164.00 1222[2:SpR:991.0,570.0] || -> strictorderP(sk1)*.
% 163.71/164.00 1223[2:SpR:991.0,571.0] || -> totalorderedP(sk1)*.
% 163.71/164.00 1224[2:SpR:991.0,572.0] || -> strictorderedP(sk1)*.
% 163.71/164.00 1225[2:SpR:991.0,573.0] || -> duplicatefreeP(sk1)*.
% 163.71/164.00 1226[2:SpR:991.0,574.0] || -> equalelemsP(sk1)*.
% 163.71/164.00 1267[2:SpL:991.0,584.0] || equal(sk1,sk1) -> singletonP(sk1)*.
% 163.71/164.00 1268[2:Obv:1267.0] || -> singletonP(sk1)*.
% 163.71/164.00 1661[2:SpR:991.0,693.1] ssList(u) || -> equal(app(sk1,u),cons(sk5,u))**.
% 163.71/164.00 1676[2:Rew:1661.1,546.4] ssList(u) ssList(v) ssList(w) || segmentP(sk1,u) -> segmentP(app(v,cons(sk5,w)),u)*.
% 163.71/164.00 40045[2:SpR:638.1,1676.4] ssList(u) ssList(skaf42(sk2,sk5)) ssList(skaf43(sk5,sk2)) || memberP(sk2,sk5)* segmentP(sk1,u) -> segmentP(sk2,u)*.
% 163.71/164.00 50007[2:SSi:40045.2,40045.1,66.0,2.0,67.0,2.0] ssList(u) || memberP(sk2,sk5)* segmentP(sk1,u) -> segmentP(sk2,u)*.
% 163.71/164.00 50008[2:MRR:50007.1,987.0] ssList(u) || segmentP(sk1,u) -> segmentP(sk2,u)*.
% 163.71/164.00 50009[2:MRR:7.3,50008.2] ssList(u) || neq(u,nil) segmentP(sk1,u)* -> .
% 163.71/164.00 50739[2:Res:468.0,50009.2] ssList(sk1) || neq(sk1,nil)* -> .
% 163.71/164.00 50743[5:SSi:50739.0,1196.0,1.0,1200.0,1225.0,1226.0,1268.0,1222.0,1221.0,1220.0] || neq(sk1,nil)* -> .
% 163.71/164.00 50767[5:Res:592.1,50743.0] || -> equal(nil,sk1)**.
% 163.71/164.00 50768[5:MRR:50767.0,984.0] || -> .
% 163.71/164.00 50769[5:Spt:50768.0,403.0,1200.0] || strictorderedP(sk1)* -> .
% 163.71/164.00 50770[5:Spt:50768.0,403.1] || -> equal(app(app(skaf71(sk1),cons(skaf69(sk1),skaf72(sk1))),cons(skaf70(sk1),skaf73(sk1))),sk1)**.
% 163.71/164.00 50771[5:MRR:50769.0,1224.0] || -> .
% 163.71/164.00 51253[4:Spt:50771.0,402.0,1196.0] || totalorderedP(sk1)* -> .
% 163.71/164.00 51254[4:Spt:50771.0,402.1] || -> equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1)**.
% 163.71/164.00 51255[4:MRR:51253.0,1223.0] || -> .
% 163.71/164.00 51697[1:Spt:51255.0,86.0,86.2] ssList(u) || -> duplicatefreeP(u)*.
% 163.71/164.00 51895[1:MRR:193.1,51697.1] ssList(u) ssItem(v) ssList(w) ssList(x) ssList(y) || equal(app(app(w,cons(v,x)),cons(v,y)),u)* -> .
% 163.71/164.00 74470[0:SpR:171.3,99.2] ssList(u) ssList(v) ssItem(w) ssList(cons(w,v)) ssList(u) || -> ssList(cons(w,app(v,u)))*.
% 163.71/164.00 74522[0:Obv:74470.0] ssList(u) ssItem(v) ssList(cons(v,u)) ssList(w) || -> ssList(cons(v,app(u,w)))*.
% 195.99/196.25 74523[0:SSi:74522.2,100.2] ssList(u) ssItem(v) ssList(w) || -> ssList(cons(v,app(u,w)))*.
% 195.99/196.25 77087[1:EqR:51895.5] ssList(app(app(u,cons(v,w)),cons(v,x))) ssItem(v) ssList(u) ssList(w) ssList(x) || -> .
% 195.99/196.25 77112[1:SSi:77087.0,99.2,99.2,100.2,100.2] ssItem(u) ssList(v) ssList(w) ssList(x) || -> .
% 195.99/196.25 77113[1:MRR:74523.3,77112.1] ssList(u) ssItem(v) ssList(w) || -> .
% 195.99/196.25 77116[1:Con:77113.2] ssList(u) ssItem(v) || -> .
% 195.99/196.25 77118[1:MRR:350.1,77116.0] ssItem(u) || -> .
% 195.99/196.25 77128[1:UnC:77118.0,26.0] || -> .
% 195.99/196.25 % SZS output end Refutation
% 195.99/196.25 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_11 co1_13 co1_14 clause12 clause52 clause53 clause57 clause64 clause65 clause66 clause67 clause68 clause69 clause70 clause71 clause72 clause85 clause86 clause99 clause102 clause116 clause120 clause149 clause157 clause163 clause164 clause169 clause172 clause177 clause179
% 195.99/196.25
%------------------------------------------------------------------------------