TSTP Solution File: SWC056-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC056-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:25 EDT 2022
% Result : Unsatisfiable 146.88s 147.07s
% Output : Refutation 176.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWC056-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n012.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 : Sun Jun 12 13:57:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 146.88/147.07
% 146.88/147.07 SPASS V 3.9
% 146.88/147.07 SPASS beiseite: Proof found.
% 146.88/147.07 % SZS status Theorem
% 146.88/147.07 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 146.88/147.07 SPASS derived 43576 clauses, backtracked 26221 clauses, performed 155 splits and kept 36998 clauses.
% 146.88/147.07 SPASS allocated 135247 KBytes.
% 146.88/147.07 SPASS spent 0:2:26.62 on the problem.
% 146.88/147.07 0:00:00.04 for the input.
% 146.88/147.07 0:00:00.00 for the FLOTTER CNF translation.
% 146.88/147.07 0:00:00.66 for inferences.
% 146.88/147.07 0:00:07.98 for the backtracking.
% 146.88/147.07 0:2:17.19 for the reduction.
% 146.88/147.07
% 146.88/147.07
% 146.88/147.07 Here is a proof with depth 3, length 121 :
% 146.88/147.07 % SZS output start Refutation
% 146.88/147.07 1[0:Inp] || -> ssList(sk1)*.
% 146.88/147.07 2[0:Inp] || -> ssList(sk2)*.
% 146.88/147.07 5[0:Inp] || -> equal(sk4,sk2)**.
% 146.88/147.07 6[0:Inp] || -> equal(sk3,sk1)**.
% 146.88/147.07 9[0:Inp] || -> equal(cons(sk5,nil),sk3)** equal(nil,sk4).
% 146.88/147.07 12[0:Inp] || -> equal(cons(sk5,nil),sk3)** equal(nil,sk3).
% 146.88/147.07 13[0:Inp] || -> memberP(sk4,sk5)* equal(nil,sk3).
% 146.88/147.07 15[0:Inp] || -> neq(sk2,nil)* equal(nil,sk2).
% 146.88/147.07 16[0:Inp] ssList(u) || neq(u,nil) segmentP(sk1,u) segmentP(sk2,u)* -> equal(nil,sk2).
% 146.88/147.07 17[0:Inp] || equal(nil,sk1) -> neq(sk2,nil)*.
% 146.88/147.07 30[0:Inp] || -> ssItem(skaf83(u))*.
% 146.88/147.07 70[0:Inp] || -> ssList(skaf43(u,v))*.
% 146.88/147.07 71[0:Inp] || -> ssList(skaf42(u,v))*.
% 146.88/147.07 75[0:Inp] ssList(u) || -> segmentP(u,u)*.
% 146.88/147.07 82[0:Inp] ssItem(u) || -> equalelemsP(cons(u,nil))*.
% 146.88/147.07 83[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 146.88/147.07 84[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 146.88/147.07 85[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 146.88/147.07 86[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 146.88/147.07 87[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 146.88/147.07 88[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 146.88/147.07 89[0:Inp] ssItem(u) || memberP(nil,u)* -> .
% 146.88/147.07 90[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 146.88/147.07 103[0:Inp] ssList(u) ssList(v) || -> ssList(app(u,v))*.
% 146.88/147.07 104[0:Inp] ssList(u) ssItem(v) || -> ssList(cons(v,u))*.
% 146.88/147.07 117[0:Inp] ssList(u) ssItem(v) || equal(cons(v,u),u)** -> .
% 146.88/147.07 120[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 146.88/147.07 134[0:Inp] ssList(u) ssItem(v) || equal(cons(v,nil),u)*+ -> singletonP(u)*.
% 146.88/147.07 135[0:Inp] ssItem(u) ssItem(v) || neq(u,v)* equal(u,v) -> .
% 146.88/147.07 138[0:Inp] ssList(u) ssItem(v) || -> equal(app(cons(v,nil),u),cons(v,u))**.
% 146.88/147.07 167[0:Inp] ssList(u) ssList(v) ssList(w) || -> equal(app(app(u,v),w),app(u,app(v,w)))**.
% 146.88/147.07 175[0:Inp] ssList(u) ssList(v) ssItem(w) || -> equal(app(cons(w,v),u),cons(w,app(v,u)))**.
% 146.88/147.07 181[0:Inp] ssList(u) || -> strictorderedP(u) equal(app(app(skaf71(u),cons(skaf69(u),skaf72(u))),cons(skaf70(u),skaf73(u))),u)**.
% 146.88/147.07 182[0:Inp] ssList(u) || -> totalorderedP(u) equal(app(app(skaf66(u),cons(skaf64(u),skaf67(u))),cons(skaf65(u),skaf68(u))),u)**.
% 146.88/147.07 187[0:Inp] ssList(u) ssItem(v) || memberP(u,v) -> equal(app(skaf42(u,v),cons(v,skaf43(v,u))),u)**.
% 146.88/147.07 190[0:Inp] ssList(u) ssList(v) ssList(w) ssList(x) || segmentP(x,w) -> segmentP(app(app(v,x),u),w)*.
% 146.88/147.07 195[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).
% 146.88/147.07 197[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)* -> .
% 146.88/147.07 208[0:Rew:6.0,13.1,5.0,13.0] || -> equal(nil,sk1) memberP(sk2,sk5)*.
% 146.88/147.07 210[0:Rew:15.0,17.0] || equal(sk2,sk1) -> neq(sk2,nil)*.
% 146.88/147.07 211[0:Rew:6.0,12.1,6.0,12.0] || -> equal(nil,sk1) equal(cons(sk5,nil),sk1)**.
% 146.88/147.07 212[0:Rew:211.1,9.1,5.0,9.1,6.0,9.0] || -> equal(sk2,sk1) equal(cons(sk5,nil),sk1)**.
% 146.88/147.07 218[0:Rew:167.3,190.5] ssList(u) ssList(v) ssList(w) ssList(x) || segmentP(u,v) -> segmentP(app(w,app(u,x)),v)*.
% 146.88/147.07 318[0:Res:2.0,195.1] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u) equal(nil,sk2).
% 146.88/147.07 324[0:Res:2.0,187.1] ssItem(u) || memberP(sk2,u) -> equal(app(skaf42(sk2,u),cons(u,skaf43(u,sk2))),sk2)**.
% 146.88/147.07 359[0:Res:2.0,104.1] ssItem(u) || -> ssList(cons(u,sk2))*.
% 146.88/147.07 411[0:Res:1.0,182.0] || -> totalorderedP(sk1) equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1)**.
% 146.88/147.07 412[0:Res:1.0,181.0] || -> strictorderedP(sk1) equal(app(app(skaf71(sk1),cons(skaf69(sk1),skaf72(sk1))),cons(skaf70(sk1),skaf73(sk1))),sk1)**.
% 146.88/147.07 478[0:Res:1.0,75.0] || -> segmentP(sk1,sk1)*.
% 146.88/147.07 491[0:Res:1.0,195.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1).
% 146.88/147.07 525[0:Res:1.0,134.1] ssItem(u) || equal(cons(u,nil),sk1)** -> singletonP(sk1).
% 146.88/147.07 529[0:Res:1.0,117.1] ssItem(u) || equal(cons(u,sk1),sk1)** -> .
% 146.88/147.07 556[0:Res:1.0,218.3] ssList(u) ssList(v) ssList(w) || segmentP(sk1,u) -> segmentP(app(v,app(sk1,w)),u)*.
% 146.88/147.07 575[1:Spt:90.1] || -> ssItem(u)*.
% 146.88/147.07 580[1:MRR:89.0,575.0] || memberP(nil,u)* -> .
% 146.88/147.07 581[1:MRR:88.0,575.0] || -> cyclefreeP(cons(u,nil))*.
% 146.88/147.07 582[1:MRR:87.0,575.0] || -> totalorderP(cons(u,nil))*.
% 146.88/147.07 583[1:MRR:86.0,575.0] || -> strictorderP(cons(u,nil))*.
% 146.88/147.07 584[1:MRR:85.0,575.0] || -> totalorderedP(cons(u,nil))*.
% 146.88/147.07 585[1:MRR:84.0,575.0] || -> strictorderedP(cons(u,nil))*.
% 146.88/147.07 586[1:MRR:83.0,575.0] || -> duplicatefreeP(cons(u,nil))*.
% 146.88/147.07 587[1:MRR:82.0,575.0] || -> equalelemsP(cons(u,nil))*.
% 146.88/147.07 589[1:MRR:529.0,575.0] || equal(cons(u,sk1),sk1)** -> .
% 146.88/147.07 597[1:MRR:525.0,575.0] || equal(cons(u,nil),sk1)** -> singletonP(sk1).
% 146.88/147.07 605[1:MRR:120.1,120.0,575.0] || -> equal(u,v) neq(u,v)*.
% 146.88/147.07 615[1:MRR:135.1,135.0,575.0] || neq(u,v)* equal(u,v) -> .
% 146.88/147.07 653[1:MRR:324.0,575.0] || memberP(sk2,u) -> equal(app(skaf42(sk2,u),cons(u,skaf43(u,sk2))),sk2)**.
% 146.88/147.07 708[1:MRR:138.1,575.0] ssList(u) || -> equal(app(cons(v,nil),u),cons(v,u))**.
% 146.88/147.07 781[2:Spt:491.5] || -> equal(nil,sk1)**.
% 146.88/147.07 812[2:Rew:781.0,210.1] || equal(sk2,sk1) -> neq(sk2,sk1)*.
% 146.88/147.07 813[2:Rew:781.0,212.1] || -> equal(sk2,sk1) equal(cons(sk5,sk1),sk1)**.
% 146.88/147.07 928[2:MRR:812.1,615.0] || equal(sk2,sk1)** -> .
% 146.88/147.07 937[2:MRR:813.0,813.1,928.0,589.0] || -> .
% 146.88/147.07 1005[2:Spt:937.0,491.5,781.0] || equal(nil,sk1)** -> .
% 146.88/147.07 1006[2:Spt:937.0,491.0,491.1,491.2,491.3,491.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 146.88/147.07 1008[2:MRR:208.0,1005.0] || -> memberP(sk2,sk5)*.
% 146.88/147.07 1012[2:MRR:211.0,1005.0] || -> equal(cons(sk5,nil),sk1)**.
% 146.88/147.07 1025[3:Spt:318.5] || -> equal(nil,sk2)**.
% 146.88/147.07 1053[3:Rew:1025.0,580.0] || memberP(sk2,u)* -> .
% 146.88/147.07 1126[3:UnC:1053.0,1008.0] || -> .
% 146.88/147.07 1202[3:Spt:1126.0,318.5,1025.0] || equal(nil,sk2)** -> .
% 146.88/147.07 1203[3:Spt:1126.0,318.0,318.1,318.2,318.3,318.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 146.88/147.07 1218[3:MRR:16.4,1202.0] ssList(u) || neq(u,nil) segmentP(sk1,u) segmentP(sk2,u)* -> .
% 146.88/147.07 1222[4:Spt:411.0] || -> totalorderedP(sk1)*.
% 146.88/147.07 1226[5:Spt:412.0] || -> strictorderedP(sk1)*.
% 146.88/147.07 1246[2:SpR:1012.0,581.0] || -> cyclefreeP(sk1)*.
% 146.88/147.07 1247[2:SpR:1012.0,582.0] || -> totalorderP(sk1)*.
% 146.88/147.07 1248[2:SpR:1012.0,583.0] || -> strictorderP(sk1)*.
% 146.88/147.07 1249[2:SpR:1012.0,584.0] || -> totalorderedP(sk1)*.
% 146.88/147.07 1250[2:SpR:1012.0,585.0] || -> strictorderedP(sk1)*.
% 146.88/147.07 1251[2:SpR:1012.0,586.0] || -> duplicatefreeP(sk1)*.
% 146.88/147.07 1252[2:SpR:1012.0,587.0] || -> equalelemsP(sk1)*.
% 146.88/147.07 1293[2:SpL:1012.0,597.0] || equal(sk1,sk1) -> singletonP(sk1)*.
% 146.88/147.07 1294[2:Obv:1293.0] || -> singletonP(sk1)*.
% 146.88/147.07 1609[2:SpR:1012.0,708.1] ssList(u) || -> equal(app(sk1,u),cons(sk5,u))**.
% 146.88/147.07 1623[2:Rew:1609.1,556.4] ssList(u) ssList(v) ssList(w) || segmentP(sk1,u) -> segmentP(app(v,cons(sk5,w)),u)*.
% 146.88/147.07 39648[2:SpR:653.1,1623.4] ssList(u) ssList(skaf42(sk2,sk5)) ssList(skaf43(sk5,sk2)) || memberP(sk2,sk5)* segmentP(sk1,u) -> segmentP(sk2,u)*.
% 146.88/147.07 48148[2:SSi:39648.2,39648.1,70.0,2.0,71.0,2.0] ssList(u) || memberP(sk2,sk5)* segmentP(sk1,u) -> segmentP(sk2,u)*.
% 146.88/147.07 48149[2:MRR:48148.1,1008.0] ssList(u) || segmentP(sk1,u) -> segmentP(sk2,u)*.
% 146.88/147.07 48150[3:MRR:1218.3,48149.2] ssList(u) || neq(u,nil) segmentP(sk1,u)* -> .
% 146.88/147.07 48764[3:Res:478.0,48150.2] ssList(sk1) || neq(sk1,nil)* -> .
% 146.88/147.07 48768[5:SSi:48764.0,1.0,1222.0,1226.0,1251.0,1252.0,1294.0,1248.0,1247.0,1246.0] || neq(sk1,nil)* -> .
% 146.88/147.07 48772[5:Res:605.1,48768.0] || -> equal(nil,sk1)**.
% 146.88/147.07 48773[5:MRR:48772.0,1005.0] || -> .
% 146.88/147.07 48774[5:Spt:48773.0,412.0,1226.0] || strictorderedP(sk1)* -> .
% 146.88/147.07 48775[5:Spt:48773.0,412.1] || -> equal(app(app(skaf71(sk1),cons(skaf69(sk1),skaf72(sk1))),cons(skaf70(sk1),skaf73(sk1))),sk1)**.
% 146.88/147.07 48776[5:MRR:48774.0,1250.0] || -> .
% 146.88/147.07 49233[4:Spt:48776.0,411.0,1222.0] || totalorderedP(sk1)* -> .
% 146.88/147.07 49234[4:Spt:48776.0,411.1] || -> equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1)**.
% 146.88/147.07 49235[4:MRR:49233.0,1249.0] || -> .
% 146.88/147.07 49680[1:Spt:49235.0,90.0,90.2] ssList(u) || -> duplicatefreeP(u)*.
% 176.98/177.17 49891[1:MRR:197.1,49680.1] ssList(u) ssItem(v) ssList(w) ssList(x) ssList(y) || equal(app(app(w,cons(v,x)),cons(v,y)),u)* -> .
% 176.98/177.17 72511[0:SpR:175.3,103.2] ssList(u) ssList(v) ssItem(w) ssList(cons(w,v)) ssList(u) || -> ssList(cons(w,app(v,u)))*.
% 176.98/177.17 72563[0:Obv:72511.0] ssList(u) ssItem(v) ssList(cons(v,u)) ssList(w) || -> ssList(cons(v,app(u,w)))*.
% 176.98/177.17 72564[0:SSi:72563.2,104.2] ssList(u) ssItem(v) ssList(w) || -> ssList(cons(v,app(u,w)))*.
% 176.98/177.17 75297[1:EqR:49891.5] ssList(app(app(u,cons(v,w)),cons(v,x))) ssItem(v) ssList(u) ssList(w) ssList(x) || -> .
% 176.98/177.17 75322[1:SSi:75297.0,103.2,103.2,104.2,104.2] ssItem(u) ssList(v) ssList(w) ssList(x) || -> .
% 176.98/177.17 75323[1:MRR:72564.3,75322.1] ssList(u) ssItem(v) ssList(w) || -> .
% 176.98/177.17 75326[1:Con:75323.2] ssList(u) ssItem(v) || -> .
% 176.98/177.17 75328[1:MRR:359.1,75326.0] ssItem(u) || -> .
% 176.98/177.17 75338[1:UnC:75328.0,30.0] || -> .
% 176.98/177.17 % SZS output end Refutation
% 176.98/177.17 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_9 co1_12 co1_13 co1_15 co1_16 co1_17 clause12 clause52 clause53 clause57 clause64 clause65 clause66 clause67 clause68 clause69 clause70 clause71 clause72 clause85 clause86 clause99 clause102 clause116 clause117 clause120 clause149 clause157 clause163 clause164 clause169 clause172 clause177 clause179
% 176.98/177.17
%------------------------------------------------------------------------------