TSTP Solution File: SWC110-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC110-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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:47 EDT 2022
% Result : Unsatisfiable 50.99s 51.22s
% Output : Refutation 64.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC110-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n010.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 : Mon Jun 13 00:36:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 50.99/51.22
% 50.99/51.22 SPASS V 3.9
% 50.99/51.22 SPASS beiseite: Proof found.
% 50.99/51.22 % SZS status Theorem
% 50.99/51.22 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 50.99/51.22 SPASS derived 33349 clauses, backtracked 18520 clauses, performed 199 splits and kept 26061 clauses.
% 50.99/51.22 SPASS allocated 116648 KBytes.
% 50.99/51.22 SPASS spent 0:0:50.82 on the problem.
% 50.99/51.22 0:00:00.04 for the input.
% 50.99/51.22 0:00:00.00 for the FLOTTER CNF translation.
% 50.99/51.22 0:00:00.44 for inferences.
% 50.99/51.22 0:00:02.09 for the backtracking.
% 50.99/51.22 0:0:47.71 for the reduction.
% 50.99/51.22
% 50.99/51.22
% 50.99/51.22 Here is a proof with depth 3, length 213 :
% 50.99/51.22 % SZS output start Refutation
% 50.99/51.22 1[0:Inp] || -> ssList(sk1)*.
% 50.99/51.22 2[0:Inp] || -> ssList(sk2)*.
% 50.99/51.22 5[0:Inp] || -> equal(sk4,sk2)**.
% 50.99/51.22 6[0:Inp] || -> equal(sk3,sk1)**.
% 50.99/51.22 7[0:Inp] || -> ssList(sk5)*.
% 50.99/51.22 8[0:Inp] || -> equal(app(sk3,sk5),sk4)**.
% 50.99/51.22 9[0:Inp] || -> equalelemsP(sk3)*.
% 50.99/51.22 11[0:Inp] || equal(nil,sk3)** -> equal(nil,sk4).
% 50.99/51.22 12[0:Inp] || -> neq(sk2,nil)* equal(nil,sk2).
% 50.99/51.22 13[0:Inp] || segmentP(sk2,sk1)* neq(sk1,nil) -> equal(nil,sk2).
% 50.99/51.22 14[0:Inp] || equal(nil,sk1) -> neq(sk2,nil)*.
% 50.99/51.22 15[0:Inp] || equal(nil,sk1) neq(sk1,nil) segmentP(sk2,sk1)* -> .
% 50.99/51.22 16[0:Inp] || -> equalelemsP(nil)*.
% 50.99/51.22 17[0:Inp] || -> duplicatefreeP(nil)*.
% 50.99/51.22 18[0:Inp] || -> strictorderedP(nil)*.
% 50.99/51.22 19[0:Inp] || -> totalorderedP(nil)*.
% 50.99/51.22 20[0:Inp] || -> strictorderP(nil)*.
% 50.99/51.22 21[0:Inp] || -> totalorderP(nil)*.
% 50.99/51.22 22[0:Inp] || -> cyclefreeP(nil)*.
% 50.99/51.22 23[0:Inp] || -> ssList(nil)*.
% 50.99/51.22 28[0:Inp] || -> ssList(skaf82(u))*.
% 50.99/51.22 69[0:Inp] || equal(skac2,skac3)** -> .
% 50.99/51.22 72[0:Inp] ssList(u) || -> segmentP(u,u)*.
% 50.99/51.22 74[0:Inp] ssList(u) || -> rearsegP(u,u)*.
% 50.99/51.22 79[0:Inp] ssItem(u) || -> equalelemsP(cons(u,nil))*.
% 50.99/51.22 80[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 50.99/51.22 81[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 50.99/51.22 82[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 50.99/51.22 83[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 50.99/51.22 84[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 50.99/51.22 85[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 50.99/51.22 87[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 50.99/51.22 88[0:Inp] ssList(u) || -> equal(app(u,nil),u)**.
% 50.99/51.22 89[0:Inp] ssList(u) || -> equal(app(nil,u),u)**.
% 50.99/51.22 97[0:Inp] ssList(u) || rearsegP(nil,u)* -> equal(nil,u).
% 50.99/51.22 98[0:Inp] ssList(u) || equal(nil,u) -> frontsegP(nil,u)*.
% 50.99/51.22 100[0:Inp] ssList(u) ssList(v) || -> ssList(app(u,v))*.
% 50.99/51.22 101[0:Inp] ssList(u) ssItem(v) || -> ssList(cons(v,u))*.
% 50.99/51.22 112[0:Inp] ssList(u) ssItem(v) || -> equal(hd(cons(v,u)),v)**.
% 50.99/51.22 115[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*.
% 50.99/51.22 117[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 50.99/51.22 133[0:Inp] ssList(u) ssList(v) || equal(app(u,v),nil)** -> equal(nil,u).
% 50.99/51.22 134[0:Inp] ssList(u) ssList(v) || equal(app(u,v),nil)** -> equal(nil,v).
% 50.99/51.22 135[0:Inp] ssList(u) ssItem(v) || -> equal(app(cons(v,nil),u),cons(v,u))**.
% 50.99/51.22 138[0:Inp] ssList(u) ssList(v) || -> equal(nil,u) equal(hd(app(u,v)),hd(u))**.
% 50.99/51.22 144[0:Inp] ssList(u) ssList(v) || frontsegP(u,v)*+ frontsegP(v,u)* -> equal(u,v).
% 50.99/51.22 149[0:Inp] ssItem(u) ssList(v) || strictorderedP(cons(u,v)) -> lt(u,hd(v))* equal(nil,v).
% 50.99/51.22 151[0:Inp] ssList(u) ssList(v) ssList(w) || rearsegP(u,v) -> rearsegP(app(w,u),v)*.
% 50.99/51.22 159[0:Inp] ssList(u) ssList(v) ssList(w) || equal(app(v,w),u)*+ -> frontsegP(u,v)*.
% 50.99/51.22 164[0:Inp] ssList(u) ssList(v) ssList(w) || -> equal(app(app(u,v),w),app(u,app(v,w)))**.
% 50.99/51.22 165[0:Inp] ssList(u) ssList(v) ssList(w) || equal(app(v,w),app(v,u))* -> equal(w,u).
% 50.99/51.22 166[0:Inp] ssList(u) ssList(v) ssList(w) || equal(app(w,v),app(u,v))* -> equal(w,u).
% 50.99/51.22 185[0:Inp] ssList(u) ssList(v) ssItem(w) ssItem(x) || equal(cons(w,u),cons(x,v))* -> equal(w,x).
% 50.99/51.22 188[0:Inp] ssList(u) ssList(v) ssList(w) ssList(x) || equal(app(app(v,w),u),x)* -> segmentP(x,w)*.
% 50.99/51.22 192[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).
% 50.99/51.22 201[0:Rew:6.0,9.0] || -> equalelemsP(sk1)*.
% 50.99/51.22 204[0:Rew:6.0,8.0,5.0,8.0] || -> equal(app(sk1,sk5),sk2)**.
% 50.99/51.22 205[0:Rew:12.0,14.0] || equal(sk2,sk1) -> neq(sk2,nil)*.
% 50.99/51.22 206[0:Rew:5.0,11.1,6.0,11.0] || equal(nil,sk1)** -> equal(nil,sk2).
% 50.99/51.22 207[0:Rew:13.2,15.0] || segmentP(sk2,sk1)* neq(sk1,nil) equal(sk2,sk1) -> .
% 50.99/51.22 211[0:Rew:164.3,188.4] ssList(u) ssList(v) ssList(w) ssList(x) || equal(app(w,app(v,x)),u)*+ -> segmentP(u,v)*.
% 50.99/51.22 246[0:Res:7.0,149.0] ssItem(u) || strictorderedP(cons(u,sk5)) -> lt(u,hd(sk5))* equal(nil,sk5).
% 50.99/51.22 284[0:Res:7.0,97.0] || rearsegP(nil,sk5)* -> equal(nil,sk5).
% 50.99/51.22 298[0:Res:7.0,74.0] || -> rearsegP(sk5,sk5)*.
% 50.99/51.22 416[0:Res:2.0,164.0] ssList(u) ssList(v) || -> equal(app(app(u,v),sk2),app(u,app(v,sk2)))**.
% 50.99/51.22 458[0:Res:2.0,98.0] || equal(nil,sk2) -> frontsegP(nil,sk2)*.
% 50.99/51.22 466[0:Res:2.0,89.0] || -> equal(app(nil,sk2),sk2)**.
% 50.99/51.22 469[0:Res:2.0,72.0] || -> segmentP(sk2,sk2)*.
% 50.99/51.22 482[0:Res:2.0,192.1] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u) equal(nil,sk2).
% 50.99/51.22 512[0:Res:2.0,138.1] ssList(u) || -> equal(nil,sk2) equal(hd(app(sk2,u)),hd(sk2))**.
% 50.99/51.22 519[0:Res:2.0,112.1] ssItem(u) || -> equal(hd(cons(u,sk2)),u)**.
% 50.99/51.22 524[0:Res:2.0,101.1] ssItem(u) || -> ssList(cons(u,sk2))*.
% 50.99/51.22 563[1:Spt:87.1] || -> ssItem(u)*.
% 50.99/51.22 566[1:MRR:524.0,563.0] || -> ssList(cons(u,sk2))*.
% 50.99/51.22 569[1:MRR:85.0,563.0] || -> cyclefreeP(cons(u,nil))*.
% 50.99/51.22 570[1:MRR:84.0,563.0] || -> totalorderP(cons(u,nil))*.
% 50.99/51.22 571[1:MRR:83.0,563.0] || -> strictorderP(cons(u,nil))*.
% 50.99/51.22 572[1:MRR:82.0,563.0] || -> totalorderedP(cons(u,nil))*.
% 50.99/51.22 573[1:MRR:81.0,563.0] || -> strictorderedP(cons(u,nil))*.
% 50.99/51.22 574[1:MRR:80.0,563.0] || -> duplicatefreeP(cons(u,nil))*.
% 50.99/51.22 575[1:MRR:79.0,563.0] || -> equalelemsP(cons(u,nil))*.
% 50.99/51.22 579[1:MRR:519.0,563.0] || -> equal(hd(cons(u,sk2)),u)**.
% 50.99/51.22 593[1:MRR:117.1,117.0,563.0] || -> equal(u,v) neq(u,v)*.
% 50.99/51.22 694[1:MRR:135.1,563.0] ssList(u) || -> equal(app(cons(v,nil),u),cons(v,u))**.
% 50.99/51.22 762[1:MRR:185.3,185.2,563.0] ssList(u) ssList(v) || equal(cons(w,u),cons(x,v))* -> equal(w,x).
% 50.99/51.22 763[2:Spt:512.0,512.2] ssList(u) || -> equal(hd(app(sk2,u)),hd(sk2))**.
% 50.99/51.22 771[3:Spt:482.5] || -> equal(nil,sk2)**.
% 50.99/51.22 852[3:Rew:771.0,89.1] ssList(u) || -> equal(app(sk2,u),u)**.
% 50.99/51.22 853[3:Rew:771.0,88.1] ssList(u) || -> equal(app(u,sk2),u)**.
% 50.99/51.22 858[3:Rew:771.0,569.0] || -> cyclefreeP(cons(u,sk2))*.
% 50.99/51.22 859[3:Rew:771.0,570.0] || -> totalorderP(cons(u,sk2))*.
% 50.99/51.22 860[3:Rew:771.0,571.0] || -> strictorderP(cons(u,sk2))*.
% 50.99/51.22 861[3:Rew:771.0,572.0] || -> totalorderedP(cons(u,sk2))*.
% 50.99/51.22 862[3:Rew:771.0,573.0] || -> strictorderedP(cons(u,sk2))*.
% 50.99/51.22 863[3:Rew:771.0,574.0] || -> duplicatefreeP(cons(u,sk2))*.
% 50.99/51.22 864[3:Rew:771.0,575.0] || -> equalelemsP(cons(u,sk2))*.
% 50.99/51.22 873[3:Rew:771.0,694.1] ssList(u) || -> equal(app(cons(v,sk2),u),cons(v,u))**.
% 50.99/51.22 918[3:Rew:852.1,763.1] ssList(u) || -> equal(hd(u),hd(sk2))*.
% 50.99/51.22 931[3:Rew:853.1,416.2] ssList(u) ssList(v) || -> equal(app(app(u,v),sk2),app(u,v))**.
% 50.99/51.22 1218[3:SpR:918.1,579.0] ssList(cons(u,sk2)) || -> equal(hd(sk2),u)*.
% 50.99/51.22 1223[3:SSi:1218.0,566.0,858.0,859.0,860.0,861.0,862.0,863.0,864.0] || -> equal(hd(sk2),u)*.
% 50.99/51.22 1286[3:Rew:1223.0,762.2] ssList(u) ssList(v) || equal(cons(w,u),hd(sk2))** -> equal(w,x)*.
% 50.99/51.22 1306[3:Rew:1223.0,873.1] ssList(u) || -> equal(app(hd(sk2),u),cons(v,u))*.
% 50.99/51.22 1331[3:Rew:1223.0,931.2] ssList(u) ssList(v) || -> equal(app(u,v),hd(sk2))**.
% 50.99/51.22 1336[3:Rew:1223.0,164.3] ssList(u) ssList(v) ssList(w) || -> equal(app(app(u,v),w),hd(sk2))**.
% 50.99/51.22 1414[3:Con:1286.1] ssList(u) || equal(cons(v,u),hd(sk2))** -> equal(v,w)*.
% 50.99/51.22 1415[3:AED:69.0,1414.2] ssList(u) || equal(cons(v,u),hd(sk2))** -> .
% 50.99/51.22 1420[3:Rew:1331.2,1336.3] ssList(u) ssList(v) ssList(w) || -> equal(app(hd(sk2),w),hd(sk2))**.
% 50.99/51.22 1421[3:Con:1420.0] ssList(u) || -> equal(app(hd(sk2),u),hd(sk2))**.
% 50.99/51.22 1422[3:Rew:1421.1,1306.1] ssList(u) || -> equal(cons(v,u),hd(sk2))**.
% 50.99/51.22 1423[3:MRR:1422.1,1415.1] ssList(u) || -> .
% 50.99/51.22 1424[3:UnC:1423.0,28.0] || -> .
% 50.99/51.22 1470[3:Spt:1424.0,482.5,771.0] || equal(nil,sk2)** -> .
% 50.99/51.22 1471[3:Spt:1424.0,482.0,482.1,482.2,482.3,482.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 50.99/51.22 1476[3:MRR:206.1,1470.0] || equal(nil,sk1)** -> .
% 50.99/51.22 1481[3:MRR:13.2,1470.0] || segmentP(sk2,sk1)* neq(sk1,nil) -> .
% 50.99/51.22 2736[0:SpL:204.0,134.2] ssList(sk1) ssList(sk5) || equal(nil,sk2)** -> equal(nil,sk5).
% 50.99/51.22 2754[0:SpL:204.0,133.2] ssList(sk1) ssList(sk5) || equal(nil,sk2)** -> equal(nil,sk1).
% 50.99/51.22 3677[0:SpR:204.0,151.4] ssList(sk5) ssList(u) ssList(sk1) || rearsegP(sk5,u)* -> rearsegP(sk2,u).
% 50.99/51.22 4207[0:EqR:159.3] ssList(app(u,v)) ssList(u) ssList(v) || -> frontsegP(app(u,v),u)*.
% 50.99/51.22 4220[0:SSi:4207.0,100.2] ssList(u) ssList(v) || -> frontsegP(app(u,v),u)*.
% 64.27/64.49 4796[0:SpL:88.1,165.3] ssList(u) ssList(nil) ssList(u) ssList(v) || equal(app(u,v),u)** -> equal(v,nil).
% 64.27/64.49 4816[0:Obv:4796.0] ssList(nil) ssList(u) ssList(v) || equal(app(u,v),u)** -> equal(v,nil).
% 64.27/64.49 4817[0:SSi:4816.0,23.0,22.0,21.0,20.0,19.0,18.0,17.0,16.0] ssList(u) ssList(v) || equal(app(u,v),u)** -> equal(v,nil).
% 64.27/64.49 4981[0:SpL:89.1,166.3] ssList(u) ssList(nil) ssList(u) ssList(v) || equal(app(v,u),u)** -> equal(v,nil).
% 64.27/64.49 4997[0:Obv:4981.0] ssList(nil) ssList(u) ssList(v) || equal(app(v,u),u)** -> equal(v,nil).
% 64.27/64.49 4998[0:SSi:4997.0,23.0,22.0,21.0,20.0,19.0,18.0,17.0,16.0] ssList(u) ssList(v) || equal(app(v,u),u)** -> equal(v,nil).
% 64.27/64.49 5970[0:SSi:3677.2,201.0,1.0] ssList(sk5) ssList(u) || rearsegP(sk5,u)* -> rearsegP(sk2,u).
% 64.27/64.49 5971[0:MRR:5970.0,7.0] ssList(u) || rearsegP(sk5,u)* -> rearsegP(sk2,u).
% 64.27/64.49 6372[0:EqR:211.4] ssList(app(u,app(v,w))) ssList(v) ssList(u) ssList(w) || -> segmentP(app(u,app(v,w)),v)*.
% 64.27/64.49 6406[0:SSi:6372.0,100.2,100.2] ssList(u) ssList(v) ssList(w) || -> segmentP(app(v,app(u,w)),u)*.
% 64.27/64.49 7686[0:Res:298.0,5971.1] ssList(sk5) || -> rearsegP(sk2,sk5)*.
% 64.27/64.49 8401[0:SpR:204.0,4220.2] ssList(sk1) ssList(sk5) || -> frontsegP(sk2,sk1)*.
% 64.27/64.49 16898[0:SpL:204.0,4817.2] ssList(sk1) ssList(sk5) || equal(sk2,sk1) -> equal(nil,sk5)**.
% 64.27/64.49 17014[0:SpL:204.0,4998.2] ssList(sk5) ssList(sk1) || equal(sk5,sk2) -> equal(nil,sk1)**.
% 64.27/64.49 35626[0:SpR:204.0,6406.3] ssList(sk1) ssList(u) ssList(sk5) || -> segmentP(app(u,sk2),sk1)*.
% 64.27/64.49 39485[0:SSi:7686.0,7.0] || -> rearsegP(sk2,sk5)*.
% 64.27/64.49 39501[0:SSi:8401.1,8401.0,7.0,201.0,1.0] || -> frontsegP(sk2,sk1)*.
% 64.27/64.49 39529[0:SSi:16898.1,16898.0,7.0,201.0,1.0] || equal(sk2,sk1) -> equal(nil,sk5)**.
% 64.27/64.49 39531[0:SSi:17014.1,17014.0,201.0,1.0,7.0] || equal(sk5,sk2) -> equal(nil,sk1)**.
% 64.27/64.49 39548[0:SSi:35626.2,35626.0,7.0,201.0,1.0] ssList(u) || -> segmentP(app(u,sk2),sk1)*.
% 64.27/64.49 40087[0:Res:39501.0,144.2] ssList(sk2) ssList(sk1) || frontsegP(sk1,sk2)* -> equal(sk2,sk1).
% 64.27/64.49 42698[0:SpR:466.0,39548.1] ssList(nil) || -> segmentP(sk2,sk1)*.
% 64.27/64.49 42715[0:SSi:42698.0,23.0,22.0,21.0,20.0,19.0,18.0,17.0,16.0] || -> segmentP(sk2,sk1)*.
% 64.27/64.49 42716[3:MRR:1481.0,42715.0] || neq(sk1,nil)* -> .
% 64.27/64.49 42739[3:Res:593.1,42716.0] || -> equal(nil,sk1)**.
% 64.27/64.49 42740[3:MRR:42739.0,1476.0] || -> .
% 64.27/64.49 42741[2:Spt:42740.0,512.1] || -> equal(nil,sk2)**.
% 64.27/64.49 43506[2:Rew:42741.0,284.1,42741.0,284.0] || rearsegP(sk2,sk5)* -> equal(sk5,sk2).
% 64.27/64.49 43507[2:MRR:43506.0,39485.0] || -> equal(sk5,sk2)**.
% 64.27/64.49 43908[2:Rew:42741.0,205.1] || equal(sk2,sk1) -> neq(sk2,sk2)*.
% 64.27/64.49 43915[2:Rew:42741.0,39531.1,43507.0,39531.0] || equal(sk2,sk2)* -> equal(sk2,sk1).
% 64.27/64.49 43916[2:Obv:43915.0] || -> equal(sk2,sk1)**.
% 64.27/64.49 43924[2:Rew:43916.0,469.0] || -> segmentP(sk1,sk1)*.
% 64.27/64.49 44160[2:Rew:43916.0,42741.0] || -> equal(nil,sk1)**.
% 64.27/64.49 44182[2:Rew:43916.0,43908.0] || equal(sk1,sk1) -> neq(sk2,sk2)*.
% 64.27/64.49 44188[2:Obv:44182.0] || -> neq(sk2,sk2)*.
% 64.27/64.49 44189[2:Rew:43916.0,44188.0] || -> neq(sk1,sk1)*.
% 64.27/64.49 44457[2:Rew:43916.0,207.2,44160.0,207.1,43916.0,207.0] || segmentP(sk1,sk1)* neq(sk1,sk1) equal(sk1,sk1) -> .
% 64.27/64.49 44458[2:Obv:44457.2] || segmentP(sk1,sk1)* neq(sk1,sk1) -> .
% 64.27/64.49 44459[2:MRR:44458.0,44458.1,43924.0,44189.0] || -> .
% 64.27/64.49 46844[1:Spt:44459.0,87.0,87.2] ssList(u) || -> duplicatefreeP(u)*.
% 64.27/64.49 46845[0:Rew:39529.1,205.1] || equal(sk2,sk1) -> neq(sk2,sk5)*.
% 64.27/64.49 46848[0:MRR:13.0,42715.0] || neq(sk1,nil)* -> equal(nil,sk2).
% 64.27/64.49 46849[0:Rew:39529.1,207.1] || segmentP(sk2,sk1)* neq(sk1,sk5) equal(sk2,sk1) -> .
% 64.27/64.49 46850[0:MRR:46849.0,42715.0] || neq(sk1,sk5)* equal(sk2,sk1) -> .
% 64.27/64.49 46861[0:SSi:40087.1,201.0,1.0] ssList(sk2) || frontsegP(sk1,sk2)* -> equal(sk2,sk1).
% 64.27/64.49 46862[0:MRR:46861.0,2.0] || frontsegP(sk1,sk2)* -> equal(sk2,sk1).
% 64.27/64.49 46872[0:SSi:2736.0,201.0,1.0] ssList(sk5) || equal(nil,sk2)** -> equal(nil,sk5).
% 64.27/64.49 46873[0:MRR:46872.0,7.0] || equal(nil,sk2)** -> equal(nil,sk5).
% 64.27/64.49 46874[0:Rew:46873.1,458.1] || equal(nil,sk2) -> frontsegP(sk5,sk2)*.
% 64.27/64.49 46878[0:Rew:46873.1,2754.3] ssList(sk1) ssList(sk5) || equal(nil,sk2)** -> equal(sk5,sk1).
% 64.27/64.49 46879[0:SSi:46878.0,201.0,1.0] ssList(sk5) || equal(nil,sk2)** -> equal(sk5,sk1).
% 64.27/64.49 46880[0:MRR:46879.0,7.0] || equal(nil,sk2)** -> equal(sk5,sk1).
% 64.27/64.49 46881[0:Rew:46880.1,46873.1] || equal(nil,sk2)** -> equal(nil,sk1).
% 64.27/64.49 46885[0:Rew:46880.1,46874.1] || equal(nil,sk2) -> frontsegP(sk1,sk2)*.
% 64.27/64.49 53273[2:Spt:246.3] || -> equal(nil,sk5)**.
% 64.27/64.49 53362[2:Rew:53273.0,88.1] ssList(u) || -> equal(app(u,sk5),u)**.
% 64.27/64.49 53545[2:Rew:53273.0,46881.0] || equal(sk5,sk2) -> equal(nil,sk1)**.
% 64.27/64.49 53547[2:Rew:53273.0,46848.1] || neq(sk1,nil)* -> equal(sk5,sk2).
% 64.27/64.49 53552[2:Rew:53273.0,12.1] || -> neq(sk2,nil)* equal(sk5,sk2).
% 64.27/64.49 53661[2:Rew:53273.0,53552.0] || -> neq(sk2,sk5)* equal(sk5,sk2).
% 64.27/64.49 53668[2:Rew:53273.0,53545.1] || equal(sk5,sk2)** -> equal(sk5,sk1).
% 64.27/64.49 53676[2:Rew:53273.0,53547.0] || neq(sk1,sk5)* -> equal(sk5,sk2).
% 64.27/64.49 54176[3:Spt:53661.1] || -> equal(sk5,sk2)**.
% 64.27/64.49 54201[3:Rew:54176.0,46845.1] || equal(sk2,sk1) -> neq(sk2,sk2)*.
% 64.27/64.49 54203[3:Rew:54176.0,46850.0] || neq(sk1,sk2)* equal(sk2,sk1) -> .
% 64.27/64.49 54391[3:Rew:54176.0,53668.0] || equal(sk2,sk2) -> equal(sk5,sk1)**.
% 64.27/64.49 54625[3:Obv:54391.0] || -> equal(sk5,sk1)**.
% 64.27/64.49 54626[3:Rew:54176.0,54625.0] || -> equal(sk2,sk1)**.
% 64.27/64.49 54636[3:Rew:54626.0,54201.0] || equal(sk1,sk1) -> neq(sk2,sk2)*.
% 64.27/64.49 54883[3:Obv:54636.0] || -> neq(sk2,sk2)*.
% 64.27/64.49 54884[3:Rew:54626.0,54883.0] || -> neq(sk1,sk1)*.
% 64.27/64.49 54885[3:Rew:54626.0,54203.1,54626.0,54203.0] || neq(sk1,sk1)* equal(sk1,sk1) -> .
% 64.27/64.49 54886[3:Obv:54885.1] || neq(sk1,sk1)* -> .
% 64.27/64.49 54887[3:MRR:54886.0,54884.0] || -> .
% 64.27/64.49 55528[3:Spt:54887.0,53661.1,54176.0] || equal(sk5,sk2)** -> .
% 64.27/64.49 55529[3:Spt:54887.0,53661.0] || -> neq(sk2,sk5)*.
% 64.27/64.49 55533[3:MRR:53676.1,55528.0] || neq(sk1,sk5)* -> .
% 64.27/64.49 55590[2:SpR:53362.1,204.0] ssList(sk1) || -> equal(sk2,sk1)**.
% 64.27/64.49 55595[2:SSi:55590.0,201.0,1.0] || -> equal(sk2,sk1)**.
% 64.27/64.49 55596[3:Rew:55595.0,55529.0] || -> neq(sk1,sk5)*.
% 64.27/64.49 55989[3:MRR:55596.0,55533.0] || -> .
% 64.27/64.49 56198[2:Spt:55989.0,246.3,53273.0] || equal(nil,sk5)** -> .
% 64.27/64.49 56199[2:Spt:55989.0,246.0,246.1,246.2] ssItem(u) || strictorderedP(cons(u,sk5)) -> lt(u,hd(sk5))*.
% 64.27/64.49 56205[2:MRR:39529.1,56198.0] || equal(sk2,sk1)** -> .
% 64.27/64.49 56206[2:MRR:46862.1,56205.0] || frontsegP(sk1,sk2)* -> .
% 64.27/64.49 56207[2:MRR:46885.1,56206.0] || equal(nil,sk2)** -> .
% 64.27/64.49 56214[2:MRR:206.1,56207.0] || equal(nil,sk1)** -> .
% 64.27/64.49 56215[2:MRR:46848.1,56207.0] || neq(sk1,nil)* -> .
% 64.27/64.49 56507[2:Res:115.3,56215.0] ssList(sk1) ssList(nil) || -> equal(nil,sk1)**.
% 64.27/64.49 56508[2:SSi:56507.1,56507.0,23.0,22.0,21.0,20.0,19.0,18.0,17.0,16.0,201.0,1.0] || -> equal(nil,sk1)**.
% 64.27/64.49 56509[2:MRR:56508.0,56214.0] || -> .
% 64.27/64.49 % SZS output end Refutation
% 64.27/64.49 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_11 co1_12 co1_13 co1_14 co1_15 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause13 clause54 clause57 clause59 clause64 clause65 clause66 clause67 clause68 clause69 clause70 clause72 clause73 clause74 clause82 clause83 clause85 clause86 clause97 clause100 clause102 clause118 clause119 clause120 clause123 clause129 clause134 clause136 clause144 clause149 clause150 clause151 clause170 clause173 clause177
% 64.27/64.49
%------------------------------------------------------------------------------