TSTP Solution File: SWC029-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC029-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:12 EDT 2022
% Result : Unsatisfiable 1.18s 1.35s
% Output : Refutation 1.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC029-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 23:51:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.18/1.35
% 1.18/1.35 SPASS V 3.9
% 1.18/1.35 SPASS beiseite: Proof found.
% 1.18/1.35 % SZS status Theorem
% 1.18/1.35 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.18/1.35 SPASS derived 2371 clauses, backtracked 1369 clauses, performed 41 splits and kept 2795 clauses.
% 1.18/1.35 SPASS allocated 78228 KBytes.
% 1.18/1.35 SPASS spent 0:00:01.00 on the problem.
% 1.18/1.35 0:00:00.05 for the input.
% 1.18/1.35 0:00:00.00 for the FLOTTER CNF translation.
% 1.18/1.35 0:00:00.01 for inferences.
% 1.18/1.35 0:00:00.02 for the backtracking.
% 1.18/1.35 0:00:00.68 for the reduction.
% 1.18/1.35
% 1.18/1.35
% 1.18/1.35 Here is a proof with depth 3, length 195 :
% 1.18/1.35 % SZS output start Refutation
% 1.18/1.35 1[0:Inp] || -> ssList(sk1)*.
% 1.18/1.35 4[0:Inp] || -> ssList(sk4)*.
% 1.18/1.35 5[0:Inp] || -> equal(sk2,sk4)**.
% 1.18/1.35 6[0:Inp] || -> equal(sk3,sk1)**.
% 1.18/1.35 7[0:Inp] || equal(nil,sk4)** -> equal(nil,sk3).
% 1.18/1.35 8[0:Inp] || neq(sk4,nil)* -> ssItem(sk5).
% 1.18/1.35 9[0:Inp] || neq(sk4,nil)* -> ssList(sk6).
% 1.18/1.35 10[0:Inp] || neq(sk4,nil) -> equal(app(cons(sk5,nil),sk6),sk4)**.
% 1.18/1.35 11[0:Inp] || neq(sk4,nil) -> equal(app(sk6,cons(sk5,nil)),sk3)**.
% 1.18/1.35 12[0:Inp] || -> equal(nil,sk2)** equal(nil,sk1).
% 1.18/1.35 15[0:Inp] || equal(nil,sk1) equal(nil,sk2)** -> .
% 1.18/1.35 16[0:Inp] || -> equalelemsP(nil)*.
% 1.18/1.35 17[0:Inp] || -> duplicatefreeP(nil)*.
% 1.18/1.35 18[0:Inp] || -> strictorderedP(nil)*.
% 1.18/1.35 19[0:Inp] || -> totalorderedP(nil)*.
% 1.18/1.35 20[0:Inp] || -> strictorderP(nil)*.
% 1.18/1.35 21[0:Inp] || -> totalorderP(nil)*.
% 1.18/1.35 22[0:Inp] || -> cyclefreeP(nil)*.
% 1.18/1.35 69[0:Inp] || equal(skac2,skac3)** -> .
% 1.18/1.35 79[0:Inp] ssItem(u) || -> equalelemsP(cons(u,nil))*.
% 1.18/1.35 80[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 1.18/1.35 81[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 1.18/1.35 82[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 1.18/1.35 83[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 1.18/1.35 84[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 1.18/1.35 85[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 1.18/1.35 86[0:Inp] ssItem(u) || memberP(nil,u)* -> .
% 1.18/1.35 87[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 1.18/1.35 88[0:Inp] ssList(u) || -> equal(app(u,nil),u)**.
% 1.18/1.35 89[0:Inp] ssList(u) || -> equal(app(nil,u),u)**.
% 1.18/1.35 101[0:Inp] ssList(u) ssItem(v) || -> ssList(cons(v,u))*.
% 1.18/1.35 112[0:Inp] ssList(u) ssItem(v) || -> equal(hd(cons(v,u)),v)**.
% 1.18/1.35 113[0:Inp] ssList(u) ssItem(v) || equal(cons(v,u),nil)** -> .
% 1.18/1.35 114[0:Inp] ssList(u) ssItem(v) || equal(cons(v,u),u)** -> .
% 1.18/1.35 115[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*.
% 1.18/1.35 117[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 1.18/1.35 131[0:Inp] ssList(u) ssItem(v) || equal(cons(v,nil),u)* -> singletonP(u)*.
% 1.18/1.35 134[0:Inp] ssList(u) ssList(v) || equal(app(u,v),nil)** -> equal(nil,v).
% 1.18/1.35 138[0:Inp] ssList(u) ssList(v) || -> equal(nil,u) equal(hd(app(u,v)),hd(u))**.
% 1.18/1.35 153[0:Inp] ssItem(u) ssItem(v) ssList(w) || equal(u,v) -> memberP(cons(v,w),u)*.
% 1.18/1.35 176[0:Inp] ssItem(u) ssItem(v) ssList(w) || memberP(cons(v,w),u)* -> equal(u,v) memberP(w,u).
% 1.18/1.35 203[0:Rew:5.0,12.0] || -> equal(nil,sk1) equal(nil,sk4)**.
% 1.18/1.35 204[0:Rew:6.0,7.1] || equal(nil,sk4)** -> equal(nil,sk1).
% 1.18/1.35 205[0:Rew:5.0,15.1] || equal(nil,sk4)** equal(nil,sk1) -> .
% 1.18/1.35 206[0:Rew:6.0,11.1] || neq(sk4,nil) -> equal(app(sk6,cons(sk5,nil)),sk1)**.
% 1.18/1.35 248[0:Res:4.0,153.0] ssItem(u) ssItem(v) || equal(u,v) -> memberP(cons(v,sk4),u)*.
% 1.18/1.35 292[0:Res:4.0,87.0] || -> ssItem(u)* duplicatefreeP(sk4)*.
% 1.18/1.35 346[0:Res:4.0,115.1] ssList(u) || -> equal(sk4,u) neq(sk4,u)*.
% 1.18/1.35 403[0:Res:1.0,176.0] ssItem(u) ssItem(v) || memberP(cons(v,sk1),u)* -> equal(u,v) memberP(sk1,u).
% 1.18/1.35 461[0:Res:1.0,88.0] || -> equal(app(sk1,nil),sk1)**.
% 1.18/1.35 507[0:Res:1.0,138.1] ssList(u) || -> equal(nil,sk1) equal(hd(app(sk1,u)),hd(sk1))**.
% 1.18/1.35 514[0:Res:1.0,112.1] ssItem(u) || -> equal(hd(cons(u,sk1)),u)**.
% 1.18/1.35 515[0:Res:1.0,113.1] ssItem(u) || equal(cons(u,sk1),nil)** -> .
% 1.18/1.35 516[0:Res:1.0,114.1] ssItem(u) || equal(cons(u,sk1),sk1)** -> .
% 1.18/1.35 519[0:Res:1.0,101.1] ssItem(u) || -> ssList(cons(u,sk1))*.
% 1.18/1.35 572[1:Spt:87.1] || -> ssItem(u)*.
% 1.18/1.35 575[1:MRR:519.0,572.0] || -> ssList(cons(u,sk1))*.
% 1.18/1.35 577[1:MRR:86.0,572.0] || memberP(nil,u)* -> .
% 1.18/1.35 578[1:MRR:85.0,572.0] || -> cyclefreeP(cons(u,nil))*.
% 1.18/1.35 579[1:MRR:84.0,572.0] || -> totalorderP(cons(u,nil))*.
% 1.18/1.35 580[1:MRR:83.0,572.0] || -> strictorderP(cons(u,nil))*.
% 1.18/1.35 581[1:MRR:82.0,572.0] || -> totalorderedP(cons(u,nil))*.
% 1.18/1.35 582[1:MRR:81.0,572.0] || -> strictorderedP(cons(u,nil))*.
% 1.18/1.35 583[1:MRR:80.0,572.0] || -> duplicatefreeP(cons(u,nil))*.
% 1.18/1.35 584[1:MRR:79.0,572.0] || -> equalelemsP(cons(u,nil))*.
% 1.18/1.35 586[1:MRR:516.0,572.0] || equal(cons(u,sk1),sk1)** -> .
% 1.18/1.35 588[1:MRR:514.0,572.0] || -> equal(hd(cons(u,sk1)),u)**.
% 1.18/1.35 602[1:MRR:117.1,117.0,572.0] || -> equal(u,v) neq(u,v)*.
% 1.18/1.35 633[1:MRR:248.1,248.0,572.0] || equal(u,v) -> memberP(cons(v,sk4),u)*.
% 1.18/1.35 646[1:MRR:403.1,403.0,572.0] || memberP(cons(u,sk1),v)* -> equal(v,u) memberP(sk1,v).
% 1.18/1.35 702[1:MRR:131.1,572.0] ssList(u) || equal(cons(v,nil),u)* -> singletonP(u)*.
% 1.18/1.35 768[2:Spt:507.0,507.2] ssList(u) || -> equal(hd(app(sk1,u)),hd(sk1))**.
% 1.18/1.35 776[3:Spt:203.0] || -> equal(nil,sk1)**.
% 1.18/1.35 859[3:Rew:776.0,89.1] ssList(u) || -> equal(app(sk1,u),u)**.
% 1.18/1.35 864[3:Rew:776.0,577.0] || memberP(sk1,u)* -> .
% 1.18/1.35 865[3:Rew:776.0,578.0] || -> cyclefreeP(cons(u,sk1))*.
% 1.18/1.35 866[3:Rew:776.0,579.0] || -> totalorderP(cons(u,sk1))*.
% 1.18/1.35 867[3:Rew:776.0,580.0] || -> strictorderP(cons(u,sk1))*.
% 1.18/1.35 868[3:Rew:776.0,581.0] || -> totalorderedP(cons(u,sk1))*.
% 1.18/1.35 869[3:Rew:776.0,582.0] || -> strictorderedP(cons(u,sk1))*.
% 1.18/1.35 870[3:Rew:776.0,583.0] || -> duplicatefreeP(cons(u,sk1))*.
% 1.18/1.35 871[3:Rew:776.0,584.0] || -> equalelemsP(cons(u,sk1))*.
% 1.18/1.35 890[3:MRR:646.2,864.0] || memberP(cons(u,sk1),v)* -> equal(v,u).
% 1.18/1.35 921[3:Rew:859.1,768.1] ssList(u) || -> equal(hd(u),hd(sk1))*.
% 1.18/1.35 1029[3:SpR:921.1,588.0] ssList(cons(u,sk1)) || -> equal(hd(sk1),u)*.
% 1.18/1.35 1035[3:SSi:1029.0,575.0,865.0,866.0,867.0,868.0,869.0,870.0,871.0] || -> equal(hd(sk1),u)*.
% 1.18/1.35 1276[3:Rew:1035.0,633.1] || equal(u,v)* -> memberP(hd(sk1),u)*.
% 1.18/1.35 1292[3:Rew:1035.0,890.0] || memberP(hd(sk1),u)* -> equal(u,v)*.
% 1.18/1.35 1306[3:AED:69.0,1276.0] || -> memberP(hd(sk1),u)*.
% 1.18/1.35 1308[3:AED:69.0,1292.1] || memberP(hd(sk1),u)* -> .
% 1.18/1.35 1309[3:MRR:1308.0,1306.0] || -> .
% 1.18/1.35 1557[3:Spt:1309.0,203.0,776.0] || equal(nil,sk1)** -> .
% 1.18/1.35 1558[3:Spt:1309.0,203.1] || -> equal(nil,sk4)**.
% 1.18/1.35 1582[3:Rew:1558.0,1557.0] || equal(sk4,sk1)** -> .
% 1.18/1.35 1603[3:Rew:1558.0,204.1,1558.0,204.0] || equal(sk4,sk4)* -> equal(sk4,sk1).
% 1.18/1.35 1604[3:Obv:1603.0] || -> equal(sk4,sk1)**.
% 1.18/1.35 1605[3:MRR:1604.0,1582.0] || -> .
% 1.18/1.35 1724[2:Spt:1605.0,507.1] || -> equal(nil,sk1)**.
% 1.18/1.35 1749[2:Rew:1724.0,584.0] || -> equalelemsP(cons(u,sk1))*.
% 1.18/1.35 1750[2:Rew:1724.0,583.0] || -> duplicatefreeP(cons(u,sk1))*.
% 1.18/1.35 1751[2:Rew:1724.0,582.0] || -> strictorderedP(cons(u,sk1))*.
% 1.18/1.35 1752[2:Rew:1724.0,581.0] || -> totalorderedP(cons(u,sk1))*.
% 1.18/1.35 1753[2:Rew:1724.0,580.0] || -> strictorderP(cons(u,sk1))*.
% 1.18/1.35 1754[2:Rew:1724.0,579.0] || -> totalorderP(cons(u,sk1))*.
% 1.18/1.35 1755[2:Rew:1724.0,578.0] || -> cyclefreeP(cons(u,sk1))*.
% 1.18/1.35 1783[2:Rew:1724.0,9.0] || neq(sk4,sk1)* -> ssList(sk6).
% 1.18/1.35 1823[2:Rew:1724.0,205.1,1724.0,205.0] || equal(sk4,sk1)** equal(sk1,sk1) -> .
% 1.18/1.35 1824[2:Obv:1823.1] || equal(sk4,sk1)** -> .
% 1.18/1.35 1852[2:Rew:1724.0,702.1] ssList(u) || equal(cons(v,sk1),u)*+ -> singletonP(u)*.
% 1.18/1.35 1855[2:Rew:1724.0,206.1,1724.0,206.0] || neq(sk4,sk1) -> equal(app(sk6,cons(sk5,sk1)),sk1)**.
% 1.18/1.35 1881[2:Rew:1724.0,134.3,1724.0,134.2] ssList(u) ssList(v) || equal(app(u,v),sk1)** -> equal(sk1,v).
% 1.18/1.35 2129[2:EqR:1852.1] ssList(cons(u,sk1)) || -> singletonP(cons(u,sk1))*.
% 1.18/1.35 2130[2:SSi:2129.0,1749.0,575.0,1750.0,1751.0,1752.0,1753.0,1754.0,1755.0] || -> singletonP(cons(u,sk1))*.
% 1.18/1.35 2501[3:Spt:1783.0] || neq(sk4,sk1)* -> .
% 1.18/1.35 2502[3:Res:602.1,2501.0] || -> equal(sk4,sk1)**.
% 1.18/1.35 2503[3:MRR:2502.0,1824.0] || -> .
% 1.18/1.35 2504[3:Spt:2503.0,1783.0,2501.0] || -> neq(sk4,sk1)*.
% 1.18/1.35 2505[3:Spt:2503.0,1783.1] || -> ssList(sk6)*.
% 1.18/1.35 2506[3:MRR:1855.0,2504.0] || -> equal(app(sk6,cons(sk5,sk1)),sk1)**.
% 1.18/1.35 2516[3:SpL:2506.0,1881.2] ssList(sk6) ssList(cons(sk5,sk1)) || equal(sk1,sk1) -> equal(cons(sk5,sk1),sk1)**.
% 1.18/1.35 2517[3:Obv:2516.2] ssList(sk6) ssList(cons(sk5,sk1)) || -> equal(cons(sk5,sk1),sk1)**.
% 1.18/1.35 2518[3:SSi:2517.1,2517.0,1749.0,575.0,1750.0,1751.0,1752.0,1753.0,1754.0,1755.0,2130.0,2505.0] || -> equal(cons(sk5,sk1),sk1)**.
% 1.18/1.35 2519[3:MRR:2518.0,586.0] || -> .
% 1.18/1.35 2520[1:Spt:2519.0,87.0,87.2] ssList(u) || -> duplicatefreeP(u)*.
% 1.18/1.35 2521[0:Rew:203.1,204.0] || equal(sk4,sk4) -> equal(nil,sk1)**.
% 1.18/1.35 2522[0:Obv:2521.0] || -> equal(nil,sk1)**.
% 1.18/1.35 2523[0:Rew:2522.0,16.0] || -> equalelemsP(sk1)*.
% 1.18/1.35 2524[0:Rew:2522.0,17.0] || -> duplicatefreeP(sk1)*.
% 1.18/1.35 2525[0:Rew:2522.0,18.0] || -> strictorderedP(sk1)*.
% 1.18/1.35 2526[0:Rew:2522.0,19.0] || -> totalorderedP(sk1)*.
% 1.21/1.37 2527[0:Rew:2522.0,20.0] || -> strictorderP(sk1)*.
% 1.21/1.37 2528[0:Rew:2522.0,21.0] || -> totalorderP(sk1)*.
% 1.21/1.37 2529[0:Rew:2522.0,22.0] || -> cyclefreeP(sk1)*.
% 1.21/1.37 2540[0:Rew:2522.0,461.0] || -> equal(app(sk1,sk1),sk1)**.
% 1.21/1.37 2545[0:Rew:2522.0,8.0] || neq(sk4,sk1)* -> ssItem(sk5).
% 1.21/1.37 2546[0:Rew:2522.0,9.0] || neq(sk4,sk1)* -> ssList(sk6).
% 1.21/1.37 2561[0:Rew:2522.0,79.1] ssItem(u) || -> equalelemsP(cons(u,sk1))*.
% 1.21/1.37 2562[0:Rew:2522.0,80.1] ssItem(u) || -> duplicatefreeP(cons(u,sk1))*.
% 1.21/1.37 2563[0:Rew:2522.0,81.1] ssItem(u) || -> strictorderedP(cons(u,sk1))*.
% 1.21/1.37 2564[0:Rew:2522.0,82.1] ssItem(u) || -> totalorderedP(cons(u,sk1))*.
% 1.21/1.37 2565[0:Rew:2522.0,83.1] ssItem(u) || -> strictorderP(cons(u,sk1))*.
% 1.21/1.37 2566[0:Rew:2522.0,84.1] ssItem(u) || -> totalorderP(cons(u,sk1))*.
% 1.21/1.37 2567[0:Rew:2522.0,85.1] ssItem(u) || -> cyclefreeP(cons(u,sk1))*.
% 1.21/1.37 2569[0:Rew:2522.0,88.1] ssList(u) || -> equal(app(u,sk1),u)**.
% 1.21/1.37 2573[0:Rew:2522.0,205.1,2522.0,205.0] || equal(sk4,sk1)** equal(sk1,sk1) -> .
% 1.21/1.37 2574[0:Obv:2573.1] || equal(sk4,sk1)** -> .
% 1.21/1.37 2585[0:Rew:2522.0,515.1] ssItem(u) || equal(cons(u,sk1),sk1)** -> .
% 1.21/1.37 2596[0:Rew:2522.0,206.1,2522.0,206.0] || neq(sk4,sk1) -> equal(app(sk6,cons(sk5,sk1)),sk1)**.
% 1.21/1.37 2597[0:Rew:2522.0,10.1,2522.0,10.0] || neq(sk4,sk1) -> equal(app(cons(sk5,sk1),sk6),sk4)**.
% 1.21/1.37 2626[0:Rew:2522.0,131.2] ssList(u) ssItem(v) || equal(cons(v,sk1),u)* -> singletonP(u)*.
% 1.21/1.37 2637[0:Rew:2522.0,134.3,2522.0,134.2] ssList(u) ssList(v) || equal(app(u,v),sk1)** -> equal(sk1,v).
% 1.21/1.37 2700[2:Spt:292.0] || -> ssItem(u)*.
% 1.21/1.37 2704[2:MRR:2561.0,2700.0] || -> equalelemsP(cons(u,sk1))*.
% 1.21/1.37 2705[2:MRR:2562.0,2700.0] || -> duplicatefreeP(cons(u,sk1))*.
% 1.21/1.37 2706[2:MRR:2563.0,2700.0] || -> strictorderedP(cons(u,sk1))*.
% 1.21/1.37 2707[2:MRR:2564.0,2700.0] || -> totalorderedP(cons(u,sk1))*.
% 1.21/1.37 2708[2:MRR:2565.0,2700.0] || -> strictorderP(cons(u,sk1))*.
% 1.21/1.37 2709[2:MRR:2566.0,2700.0] || -> totalorderP(cons(u,sk1))*.
% 1.21/1.37 2710[2:MRR:2567.0,2700.0] || -> cyclefreeP(cons(u,sk1))*.
% 1.21/1.37 2713[2:MRR:519.0,2700.0] || -> ssList(cons(u,sk1))*.
% 1.21/1.37 2720[2:MRR:2585.0,2700.0] || equal(cons(u,sk1),sk1)** -> .
% 1.21/1.37 2722[2:MRR:117.1,117.0,2700.0] || -> equal(u,v) neq(u,v)*.
% 1.21/1.37 2807[2:MRR:2626.1,2700.0] ssList(u) || equal(cons(v,sk1),u)*+ -> singletonP(u)*.
% 1.21/1.37 3123[2:EqR:2807.1] ssList(cons(u,sk1)) || -> singletonP(cons(u,sk1))*.
% 1.21/1.37 3124[2:SSi:3123.0,2704.0,2705.0,2706.0,2707.0,2708.0,2709.0,2710.0,2713.0] || -> singletonP(cons(u,sk1))*.
% 1.21/1.37 3463[3:Spt:2546.0] || neq(sk4,sk1)* -> .
% 1.21/1.37 3464[3:Res:2722.1,3463.0] || -> equal(sk4,sk1)**.
% 1.21/1.37 3465[3:MRR:3464.0,2574.0] || -> .
% 1.21/1.37 3466[3:Spt:3465.0,2546.0,3463.0] || -> neq(sk4,sk1)*.
% 1.21/1.37 3467[3:Spt:3465.0,2546.1] || -> ssList(sk6)*.
% 1.21/1.37 3468[3:MRR:2596.0,3466.0] || -> equal(app(sk6,cons(sk5,sk1)),sk1)**.
% 1.21/1.37 3479[3:SpL:3468.0,2637.2] ssList(sk6) ssList(cons(sk5,sk1)) || equal(sk1,sk1) -> equal(cons(sk5,sk1),sk1)**.
% 1.21/1.37 3480[3:Obv:3479.2] ssList(sk6) ssList(cons(sk5,sk1)) || -> equal(cons(sk5,sk1),sk1)**.
% 1.21/1.37 3481[3:SSi:3480.1,3480.0,2704.0,2705.0,2706.0,2707.0,2708.0,2709.0,2710.0,2713.0,3124.0,3467.0] || -> equal(cons(sk5,sk1),sk1)**.
% 1.21/1.37 3482[3:MRR:3481.0,2720.0] || -> .
% 1.21/1.37 3483[2:Spt:3482.0,292.1] || -> duplicatefreeP(sk4)*.
% 1.21/1.37 3497[3:Spt:2546.0] || neq(sk4,sk1)* -> .
% 1.21/1.37 3537[3:Res:346.2,3497.0] ssList(sk1) || -> equal(sk4,sk1)**.
% 1.21/1.37 3538[3:SSi:3537.0,1.0,2523.0,2524.0,2525.0,2526.0,2527.0,2528.0,2529.0] || -> equal(sk4,sk1)**.
% 1.21/1.37 3539[3:MRR:3538.0,2574.0] || -> .
% 1.21/1.37 3540[3:Spt:3539.0,2546.0,3497.0] || -> neq(sk4,sk1)*.
% 1.21/1.37 3541[3:Spt:3539.0,2546.1] || -> ssList(sk6)*.
% 1.21/1.37 3542[3:MRR:2545.0,3540.0] || -> ssItem(sk5)*.
% 1.21/1.37 3543[3:MRR:2596.0,3540.0] || -> equal(app(sk6,cons(sk5,sk1)),sk1)**.
% 1.21/1.37 3544[3:MRR:2597.0,3540.0] || -> equal(app(cons(sk5,sk1),sk6),sk4)**.
% 1.21/1.37 3550[3:SpL:3543.0,2637.2] ssList(sk6) ssList(cons(sk5,sk1)) || equal(sk1,sk1) -> equal(cons(sk5,sk1),sk1)**.
% 1.21/1.37 3551[3:Obv:3550.2] ssList(sk6) ssList(cons(sk5,sk1)) || -> equal(cons(sk5,sk1),sk1)**.
% 1.21/1.37 3552[3:SSi:3551.1,3551.0,519.0,3542.0,2567.1,3542.0,2566.1,3542.0,2565.1,3542.0,2564.1,3542.0,2563.1,3542.0,2562.1,3542.0,2561.1,3542.0,3541.1] || -> equal(cons(sk5,sk1),sk1)**.
% 1.21/1.37 3553[3:Rew:3552.0,3543.0] || -> equal(app(sk6,sk1),sk1)**.
% 1.21/1.37 3554[3:Rew:3552.0,3544.0] || -> equal(app(sk1,sk6),sk4)**.
% 1.21/1.37 3557[3:SpR:3553.0,2569.1] ssList(sk6) || -> equal(sk6,sk1)**.
% 1.21/1.37 3561[3:SSi:3557.0,3541.0] || -> equal(sk6,sk1)**.
% 1.21/1.37 3564[3:Rew:3561.0,3554.0] || -> equal(app(sk1,sk1),sk4)**.
% 1.21/1.37 3565[3:Rew:2540.0,3564.0] || -> equal(sk4,sk1)**.
% 1.21/1.37 3566[3:MRR:3565.0,2574.0] || -> .
% 1.21/1.37 % SZS output end Refutation
% 1.21/1.37 Formulae used in the proof : co1_1 co1_4 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_12 co1_15 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause54 clause64 clause65 clause66 clause67 clause68 clause69 clause70 clause71 clause72 clause73 clause74 clause86 clause97 clause98 clause99 clause100 clause102 clause116 clause119 clause123 clause138 clause161
% 1.21/1.37
%------------------------------------------------------------------------------