TSTP Solution File: SWC093-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC093-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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:39 EDT 2022
% Result : Unsatisfiable 160.64s 160.81s
% Output : Refutation 160.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC093-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 12:43:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 160.64/160.81
% 160.64/160.81 SPASS V 3.9
% 160.64/160.81 SPASS beiseite: Proof found.
% 160.64/160.81 % SZS status Theorem
% 160.64/160.81 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 160.64/160.81 SPASS derived 39744 clauses, backtracked 23033 clauses, performed 130 splits and kept 31507 clauses.
% 160.64/160.81 SPASS allocated 131846 KBytes.
% 160.64/160.81 SPASS spent 0:2:16.03 on the problem.
% 160.64/160.81 0:00:00.04 for the input.
% 160.64/160.81 0:00:00.00 for the FLOTTER CNF translation.
% 160.64/160.81 0:00:00.67 for inferences.
% 160.64/160.81 0:00:07.14 for the backtracking.
% 160.64/160.81 0:02:07.46 for the reduction.
% 160.64/160.81
% 160.64/160.81
% 160.64/160.81 Here is a proof with depth 3, length 92 :
% 160.64/160.81 % SZS output start Refutation
% 160.64/160.81 1[0:Inp] || -> ssList(sk1)*.
% 160.64/160.81 2[0:Inp] || -> ssList(sk2)*.
% 160.64/160.81 5[0:Inp] || -> equal(sk4,sk2)**.
% 160.64/160.81 6[0:Inp] || -> equal(sk3,sk1)**.
% 160.64/160.81 7[0:Inp] || -> neq(sk2,nil)*.
% 160.64/160.81 8[0:Inp] ssList(u) || neq(u,nil) segmentP(sk1,u) segmentP(sk2,u)* -> .
% 160.64/160.81 11[0:Inp] || neq(sk4,nil) -> equal(cons(sk5,nil),sk3)**.
% 160.64/160.81 12[0:Inp] || neq(sk4,nil) -> memberP(sk4,sk5)*.
% 160.64/160.81 24[0:Inp] || -> ssItem(skaf83(u))*.
% 160.64/160.81 64[0:Inp] || -> ssList(skaf43(u,v))*.
% 160.64/160.81 65[0:Inp] || -> ssList(skaf42(u,v))*.
% 160.64/160.81 69[0:Inp] ssList(u) || -> segmentP(u,u)*.
% 160.64/160.81 76[0:Inp] ssItem(u) || -> equalelemsP(cons(u,nil))*.
% 160.64/160.81 77[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 160.64/160.81 78[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 160.64/160.81 79[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 160.64/160.81 80[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 160.64/160.81 81[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 160.64/160.81 82[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 160.64/160.81 84[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 160.64/160.81 97[0:Inp] ssList(u) ssList(v) || -> ssList(app(u,v))*.
% 160.64/160.81 98[0:Inp] ssList(u) ssItem(v) || -> ssList(cons(v,u))*.
% 160.64/160.81 111[0:Inp] ssList(u) ssItem(v) || equal(cons(v,u),u)** -> .
% 160.64/160.81 114[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 160.64/160.81 128[0:Inp] ssList(u) ssItem(v) || equal(cons(v,nil),u)*+ -> singletonP(u)*.
% 160.64/160.81 132[0:Inp] ssList(u) ssItem(v) || -> equal(app(cons(v,nil),u),cons(v,u))**.
% 160.64/160.81 161[0:Inp] ssList(u) ssList(v) ssList(w) || -> equal(app(app(u,v),w),app(u,app(v,w)))**.
% 160.64/160.81 169[0:Inp] ssList(u) ssList(v) ssItem(w) || -> equal(app(cons(w,v),u),cons(w,app(v,u)))**.
% 160.64/160.81 181[0:Inp] ssList(u) ssItem(v) || memberP(u,v) -> equal(app(skaf42(u,v),cons(v,skaf43(v,u))),u)**.
% 160.64/160.81 184[0:Inp] ssList(u) ssList(v) ssList(w) ssList(x) || segmentP(x,w) -> segmentP(app(app(v,x),u),w)*.
% 160.64/160.81 189[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).
% 160.64/160.81 191[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)* -> .
% 160.64/160.81 202[0:Rew:5.0,12.1,5.0,12.0] || neq(sk2,nil) -> memberP(sk2,sk5)*.
% 160.64/160.81 203[0:MRR:202.0,7.0] || -> memberP(sk2,sk5)*.
% 160.64/160.81 205[0:Rew:6.0,11.1,5.0,11.0] || neq(sk2,nil) -> equal(cons(sk5,nil),sk1)**.
% 160.64/160.81 206[0:MRR:205.0,7.0] || -> equal(cons(sk5,nil),sk1)**.
% 160.64/160.81 209[0:Rew:161.3,184.5] ssList(u) ssList(v) ssList(w) ssList(x) || segmentP(u,v) -> segmentP(app(w,app(u,x)),v)*.
% 160.64/160.81 314[0:Res:2.0,181.1] ssItem(u) || memberP(sk2,u) -> equal(app(skaf42(sk2,u),cons(u,skaf43(u,sk2))),sk2)**.
% 160.64/160.81 349[0:Res:2.0,98.1] ssItem(u) || -> ssList(cons(u,sk2))*.
% 160.64/160.81 467[0:Res:1.0,69.0] || -> segmentP(sk1,sk1)*.
% 160.64/160.81 480[0:Res:1.0,189.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1).
% 160.64/160.81 514[0:Res:1.0,128.1] ssItem(u) || equal(cons(u,nil),sk1)** -> singletonP(sk1).
% 160.64/160.81 518[0:Res:1.0,111.1] ssItem(u) || equal(cons(u,sk1),sk1)** -> .
% 160.64/160.81 545[0:Res:1.0,209.3] ssList(u) ssList(v) ssList(w) || segmentP(sk1,u) -> segmentP(app(v,app(sk1,w)),u)*.
% 160.64/160.81 579[1:Spt:84.1] || -> ssItem(u)*.
% 160.64/160.81 585[1:MRR:82.0,579.0] || -> cyclefreeP(cons(u,nil))*.
% 160.64/160.81 586[1:MRR:81.0,579.0] || -> totalorderP(cons(u,nil))*.
% 160.64/160.81 587[1:MRR:80.0,579.0] || -> strictorderP(cons(u,nil))*.
% 160.64/160.81 588[1:MRR:79.0,579.0] || -> totalorderedP(cons(u,nil))*.
% 160.64/160.81 589[1:MRR:78.0,579.0] || -> strictorderedP(cons(u,nil))*.
% 160.64/160.81 590[1:MRR:77.0,579.0] || -> duplicatefreeP(cons(u,nil))*.
% 160.64/160.81 591[1:MRR:76.0,579.0] || -> equalelemsP(cons(u,nil))*.
% 160.64/160.81 593[1:MRR:518.0,579.0] || equal(cons(u,sk1),sk1)** -> .
% 160.64/160.81 603[1:MRR:514.0,579.0] || equal(cons(u,nil),sk1)** -> singletonP(sk1).
% 160.64/160.81 611[1:MRR:114.1,114.0,579.0] || -> equal(u,v) neq(u,v)*.
% 160.64/160.81 653[1:MRR:314.0,579.0] || memberP(sk2,u) -> equal(app(skaf42(sk2,u),cons(u,skaf43(u,sk2))),sk2)**.
% 160.64/160.81 708[1:MRR:132.1,579.0] ssList(u) || -> equal(app(cons(v,nil),u),cons(v,u))**.
% 160.64/160.81 777[2:Spt:480.5] || -> equal(nil,sk1)**.
% 160.64/160.81 837[2:Rew:777.0,206.0] || -> equal(cons(sk5,sk1),sk1)**.
% 160.64/160.81 880[2:MRR:837.0,593.0] || -> .
% 160.64/160.81 954[2:Spt:880.0,480.5,777.0] || equal(nil,sk1)** -> .
% 160.64/160.81 955[2:Spt:880.0,480.0,480.1,480.2,480.3,480.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 160.64/160.81 993[1:SpR:206.0,591.0] || -> equalelemsP(sk1)*.
% 160.64/160.81 994[1:SpR:206.0,590.0] || -> duplicatefreeP(sk1)*.
% 160.64/160.81 995[1:SpR:206.0,589.0] || -> strictorderedP(sk1)*.
% 160.64/160.81 996[1:SpR:206.0,588.0] || -> totalorderedP(sk1)*.
% 160.64/160.81 997[1:SpR:206.0,587.0] || -> strictorderP(sk1)*.
% 160.64/160.81 998[1:SpR:206.0,586.0] || -> totalorderP(sk1)*.
% 160.64/160.81 999[1:SpR:206.0,585.0] || -> cyclefreeP(sk1)*.
% 160.64/160.81 1041[1:SpL:206.0,603.0] || equal(sk1,sk1) -> singletonP(sk1)*.
% 160.64/160.81 1042[1:Obv:1041.0] || -> singletonP(sk1)*.
% 160.64/160.81 1443[1:SpR:206.0,708.1] ssList(u) || -> equal(app(sk1,u),cons(sk5,u))**.
% 160.64/160.81 1458[1:Rew:1443.1,545.4] ssList(u) ssList(v) ssList(w) || segmentP(sk1,u) -> segmentP(app(v,cons(sk5,w)),u)*.
% 160.64/160.81 39869[1:SpR:653.1,1458.4] ssList(u) ssList(skaf42(sk2,sk5)) ssList(skaf43(sk5,sk2)) || memberP(sk2,sk5)* segmentP(sk1,u) -> segmentP(sk2,u)*.
% 160.64/160.81 49977[1:SSi:39869.2,39869.1,64.0,2.0,65.0,2.0] ssList(u) || memberP(sk2,sk5)* segmentP(sk1,u) -> segmentP(sk2,u)*.
% 160.64/160.81 49978[1:MRR:49977.1,203.0] ssList(u) || segmentP(sk1,u) -> segmentP(sk2,u)*.
% 160.64/160.81 49979[1:MRR:8.3,49978.2] ssList(u) || neq(u,nil) segmentP(sk1,u)* -> .
% 160.64/160.81 50640[1:Res:467.0,49979.2] ssList(sk1) || neq(sk1,nil)* -> .
% 160.64/160.81 50644[1:SSi:50640.0,1.0,993.0,994.0,1042.0,997.0,998.0,999.0,995.0,996.0] || neq(sk1,nil)* -> .
% 160.64/160.81 50806[1:Res:611.1,50644.0] || -> equal(nil,sk1)**.
% 160.64/160.81 50807[2:MRR:50806.0,954.0] || -> .
% 160.64/160.81 50808[1:Spt:50807.0,84.0,84.2] ssList(u) || -> duplicatefreeP(u)*.
% 160.64/160.81 50977[1:MRR:191.1,50808.1] ssList(u) ssItem(v) ssList(w) ssList(x) ssList(y) || equal(app(app(w,cons(v,x)),cons(v,y)),u)* -> .
% 160.64/160.81 68980[0:SpR:169.3,97.2] ssList(u) ssList(v) ssItem(w) ssList(cons(w,v)) ssList(u) || -> ssList(cons(w,app(v,u)))*.
% 160.64/160.81 69033[0:Obv:68980.0] ssList(u) ssItem(v) ssList(cons(v,u)) ssList(w) || -> ssList(cons(v,app(u,w)))*.
% 160.64/160.81 69034[0:SSi:69033.2,98.2] ssList(u) ssItem(v) ssList(w) || -> ssList(cons(v,app(u,w)))*.
% 160.64/160.81 71378[1:EqR:50977.5] ssList(app(app(u,cons(v,w)),cons(v,x))) ssItem(v) ssList(u) ssList(w) ssList(x) || -> .
% 160.64/160.81 71405[1:SSi:71378.0,97.2,97.2,98.2,98.2] ssItem(u) ssList(v) ssList(w) ssList(x) || -> .
% 160.64/160.81 71406[1:MRR:69034.3,71405.1] ssList(u) ssItem(v) ssList(w) || -> .
% 160.64/160.81 71409[1:Con:71406.2] ssList(u) ssItem(v) || -> .
% 160.64/160.81 71411[1:MRR:349.1,71409.0] ssItem(u) || -> .
% 160.64/160.81 71413[1:UnC:71411.0,24.0] || -> .
% 160.64/160.81 % SZS output end Refutation
% 160.64/160.81 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_11 co1_12 clause12 clause52 clause53 clause57 clause64 clause65 clause66 clause67 clause68 clause69 clause70 clause72 clause85 clause86 clause99 clause102 clause116 clause120 clause149 clause157 clause169 clause172 clause177 clause179
% 160.64/160.81
%------------------------------------------------------------------------------