TSTP Solution File: SWC218-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC218-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:02:33 EDT 2022
% Result : Unsatisfiable 1.33s 1.51s
% Output : Refutation 1.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SWC218-1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.09 % Command : run_spass %d %s
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Sun Jun 12 07:43:55 EDT 2022
% 0.08/0.28 % CPUTime :
% 1.33/1.51
% 1.33/1.51 SPASS V 3.9
% 1.33/1.51 SPASS beiseite: Proof found.
% 1.33/1.51 % SZS status Theorem
% 1.33/1.51 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.33/1.51 SPASS derived 3699 clauses, backtracked 1572 clauses, performed 15 splits and kept 3802 clauses.
% 1.33/1.51 SPASS allocated 79268 KBytes.
% 1.33/1.51 SPASS spent 0:00:01.23 on the problem.
% 1.33/1.51 0:00:00.03 for the input.
% 1.33/1.51 0:00:00.00 for the FLOTTER CNF translation.
% 1.33/1.51 0:00:00.03 for inferences.
% 1.33/1.51 0:00:00.02 for the backtracking.
% 1.33/1.51 0:00:01.01 for the reduction.
% 1.33/1.51
% 1.33/1.51
% 1.33/1.51 Here is a proof with depth 4, length 348 :
% 1.33/1.51 % SZS output start Refutation
% 1.33/1.51 1[0:Inp] || -> ssList(sk1)*.
% 1.33/1.51 2[0:Inp] || -> ssList(sk2)*.
% 1.33/1.51 5[0:Inp] || -> equal(sk4,sk2)**.
% 1.33/1.51 6[0:Inp] || -> equal(sk3,sk1)**.
% 1.33/1.51 7[0:Inp] || -> ssList(sk5)*.
% 1.33/1.51 8[0:Inp] || -> ssList(sk6)*.
% 1.33/1.51 9[0:Inp] || -> equal(app(sk5,sk6),sk4)**.
% 1.33/1.51 10[0:Inp] || -> ssItem(sk7)*.
% 1.33/1.51 11[0:Inp] || -> equal(app(app(sk5,cons(sk7,nil)),sk6),sk3)**.
% 1.33/1.51 12[0:Inp] || neq(sk1,nil)* -> .
% 1.33/1.51 13[0:Inp] || -> equalelemsP(nil)*.
% 1.33/1.51 14[0:Inp] || -> duplicatefreeP(nil)*.
% 1.33/1.51 15[0:Inp] || -> strictorderedP(nil)*.
% 1.33/1.51 16[0:Inp] || -> totalorderedP(nil)*.
% 1.33/1.51 17[0:Inp] || -> strictorderP(nil)*.
% 1.33/1.51 18[0:Inp] || -> totalorderP(nil)*.
% 1.33/1.51 19[0:Inp] || -> cyclefreeP(nil)*.
% 1.33/1.51 20[0:Inp] || -> ssList(nil)*.
% 1.33/1.51 21[0:Inp] || -> ssItem(skac3)*.
% 1.33/1.51 22[0:Inp] || -> ssItem(skac2)*.
% 1.33/1.51 24[0:Inp] || -> ssItem(skaf83(u))*.
% 1.33/1.51 25[0:Inp] || -> ssList(skaf82(u))*.
% 1.33/1.51 59[0:Inp] || -> ssItem(skaf44(u))*.
% 1.33/1.51 66[0:Inp] || equal(skac2,skac3)** -> .
% 1.33/1.51 72[0:Inp] ssList(u) || -> frontsegP(u,nil)*.
% 1.33/1.51 76[0:Inp] ssItem(u) || -> equalelemsP(cons(u,nil))*.
% 1.33/1.51 77[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 1.33/1.51 78[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 1.33/1.51 79[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 1.33/1.51 80[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 1.33/1.51 81[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 1.33/1.51 82[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 1.33/1.51 84[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 1.33/1.51 85[0:Inp] ssList(u) || -> equal(app(u,nil),u)**.
% 1.33/1.51 86[0:Inp] ssList(u) || -> equal(app(nil,u),u)**.
% 1.33/1.51 89[0:Inp] ssList(u) || -> ssList(tl(u))* equal(nil,u).
% 1.33/1.51 97[0:Inp] ssList(u) ssList(v) || -> ssList(app(u,v))*.
% 1.33/1.51 98[0:Inp] ssList(u) ssItem(v) || -> ssList(cons(v,u))*.
% 1.33/1.51 108[0:Inp] ssList(u) ssItem(v) || -> equal(tl(cons(v,u)),u)**.
% 1.33/1.51 109[0:Inp] ssList(u) ssItem(v) || -> equal(hd(cons(v,u)),v)**.
% 1.33/1.51 110[0:Inp] ssList(u) ssItem(v) || equal(cons(v,u),nil)** -> .
% 1.33/1.51 112[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*.
% 1.33/1.51 113[0:Inp] ssList(u) singletonP(u) || -> equal(cons(skaf44(u),nil),u)**.
% 1.33/1.51 114[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 1.33/1.51 121[0:Inp] ssList(u) || -> equal(nil,u) equal(cons(skaf83(u),skaf82(u)),u)**.
% 1.33/1.51 128[0:Inp] ssList(u) ssItem(v) || equal(cons(v,nil),u)* -> singletonP(u)*.
% 1.33/1.51 130[0:Inp] ssList(u) ssList(v) || equal(app(u,v),nil)** -> equal(nil,u).
% 1.33/1.51 131[0:Inp] ssList(u) ssList(v) || equal(app(u,v),nil)** -> equal(nil,v).
% 1.33/1.51 135[0:Inp] ssList(u) ssList(v) || -> equal(nil,u) equal(hd(app(u,v)),hd(u))**.
% 1.33/1.51 147[0:Inp] ssItem(u) ssList(v) || totalorderedP(cons(u,v)) -> leq(u,hd(v))* equal(nil,v).
% 1.33/1.51 169[0:Inp] ssList(u) ssList(v) ssItem(w) || -> equal(app(cons(w,v),u),cons(w,app(v,u)))**.
% 1.33/1.51 182[0:Inp] ssList(u) ssList(v) ssItem(w) ssItem(x) || equal(cons(w,u),cons(x,v))* -> equal(w,x).
% 1.33/1.51 188[0:Inp] ssItem(u) ssItem(v) ssList(w) ssList(x) || frontsegP(cons(u,w),cons(v,x))* -> equal(u,v).
% 1.33/1.51 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).
% 1.33/1.51 190[0:Inp] ssItem(u) ssItem(v) ssList(w) ssList(x) || equal(u,v) frontsegP(w,x) -> frontsegP(cons(u,w),cons(v,x))*.
% 1.33/1.51 200[0:Rew:5.0,9.0] || -> equal(app(sk5,sk6),sk2)**.
% 1.33/1.51 201[0:Rew:6.0,11.0] || -> equal(app(app(sk5,cons(sk7,nil)),sk6),sk1)**.
% 1.33/1.51 222[0:Res:10.0,128.0] ssList(u) || equal(cons(sk7,nil),u)*+ -> singletonP(u)*.
% 1.33/1.51 230[0:Res:10.0,109.0] ssList(u) || -> equal(hd(cons(sk7,u)),sk7)**.
% 1.33/1.51 234[0:Res:10.0,98.0] ssList(u) || -> ssList(cons(sk7,u))*.
% 1.33/1.51 236[0:Res:10.0,76.0] || -> equalelemsP(cons(sk7,nil))*.
% 1.33/1.51 237[0:Res:10.0,77.0] || -> duplicatefreeP(cons(sk7,nil))*.
% 1.33/1.51 238[0:Res:10.0,78.0] || -> strictorderedP(cons(sk7,nil))*.
% 1.33/1.51 239[0:Res:10.0,79.0] || -> totalorderedP(cons(sk7,nil))*.
% 1.33/1.51 240[0:Res:10.0,80.0] || -> strictorderP(cons(sk7,nil))*.
% 1.33/1.51 241[0:Res:10.0,81.0] || -> totalorderP(cons(sk7,nil))*.
% 1.33/1.51 242[0:Res:10.0,82.0] || -> cyclefreeP(cons(sk7,nil))*.
% 1.33/1.51 315[0:Res:8.0,190.0] ssItem(u) ssItem(v) ssList(w) || equal(u,v) frontsegP(w,sk6) -> frontsegP(cons(u,w),cons(v,sk6))*.
% 1.33/1.51 317[0:Res:8.0,188.0] ssItem(u) ssItem(v) ssList(w) || frontsegP(cons(u,w),cons(v,sk6))* -> equal(u,v).
% 1.33/1.51 342[0:Res:8.0,147.0] ssItem(u) || totalorderedP(cons(u,sk6)) -> leq(u,hd(sk6))* equal(nil,sk6).
% 1.33/1.51 361[0:Res:8.0,131.0] ssList(u) || equal(app(u,sk6),nil)** -> equal(nil,sk6).
% 1.33/1.51 385[0:Res:8.0,89.0] || -> ssList(tl(sk6))* equal(nil,sk6).
% 1.33/1.51 389[0:Res:8.0,84.0] || -> ssItem(u)* duplicatefreeP(sk6)*.
% 1.33/1.51 404[0:Res:8.0,189.1] ssList(u) || equal(hd(u),hd(sk6))* equal(tl(u),tl(sk6)) -> equal(u,sk6) equal(nil,u) equal(nil,sk6).
% 1.33/1.51 433[0:Res:8.0,135.1] ssList(u) || -> equal(nil,sk6) equal(hd(app(sk6,u)),hd(sk6))**.
% 1.33/1.51 439[0:Res:8.0,108.1] ssItem(u) || -> equal(tl(cons(u,sk6)),sk6)**.
% 1.33/1.51 440[0:Res:8.0,109.1] ssItem(u) || -> equal(hd(cons(u,sk6)),u)**.
% 1.33/1.51 441[0:Res:8.0,110.1] ssItem(u) || equal(cons(u,sk6),nil)** -> .
% 1.33/1.51 445[0:Res:8.0,98.1] ssItem(u) || -> ssList(cons(u,sk6))*.
% 1.33/1.51 456[0:Res:8.0,169.2] ssList(u) ssItem(v) || -> equal(app(cons(v,u),sk6),cons(v,app(u,sk6)))**.
% 1.33/1.51 481[1:Spt:84.1] || -> ssItem(u)*.
% 1.33/1.51 484[1:MRR:445.0,481.0] || -> ssList(cons(u,sk6))*.
% 1.33/1.51 486[1:MRR:82.0,481.0] || -> cyclefreeP(cons(u,nil))*.
% 1.33/1.51 487[1:MRR:81.0,481.0] || -> totalorderP(cons(u,nil))*.
% 1.33/1.51 488[1:MRR:80.0,481.0] || -> strictorderP(cons(u,nil))*.
% 1.33/1.51 489[1:MRR:79.0,481.0] || -> totalorderedP(cons(u,nil))*.
% 1.33/1.51 490[1:MRR:78.0,481.0] || -> strictorderedP(cons(u,nil))*.
% 1.33/1.51 491[1:MRR:77.0,481.0] || -> duplicatefreeP(cons(u,nil))*.
% 1.33/1.51 492[1:MRR:76.0,481.0] || -> equalelemsP(cons(u,nil))*.
% 1.33/1.51 495[1:MRR:441.0,481.0] || equal(cons(u,sk6),nil)** -> .
% 1.33/1.51 496[1:MRR:440.0,481.0] || -> equal(hd(cons(u,sk6)),u)**.
% 1.33/1.51 520[1:MRR:114.1,114.0,481.0] || -> equal(u,v) neq(u,v)*.
% 1.33/1.51 590[1:MRR:317.1,317.0,481.0] ssList(u) || frontsegP(cons(v,u),cons(w,sk6))* -> equal(v,w).
% 1.33/1.51 606[1:MRR:315.1,315.0,481.0] ssList(u) || equal(v,w) frontsegP(u,sk6) -> frontsegP(cons(v,u),cons(w,sk6))*.
% 1.33/1.51 616[1:MRR:98.1,481.0] ssList(u) || -> ssList(cons(v,u))*.
% 1.33/1.51 621[1:MRR:128.1,481.0] ssList(u) || equal(cons(v,nil),u)* -> singletonP(u)*.
% 1.33/1.51 675[2:Spt:433.0,433.2] ssList(u) || -> equal(hd(app(sk6,u)),hd(sk6))**.
% 1.33/1.51 679[3:Spt:404.5] || -> equal(nil,sk6)**.
% 1.33/1.51 725[3:Rew:679.0,12.0] || neq(sk1,sk6)* -> .
% 1.33/1.51 728[3:Rew:679.0,72.1] ssList(u) || -> frontsegP(u,sk6)*.
% 1.33/1.51 731[3:Rew:679.0,86.1] ssList(u) || -> equal(app(sk6,u),u)**.
% 1.33/1.51 736[3:Rew:679.0,486.0] || -> cyclefreeP(cons(u,sk6))*.
% 1.33/1.51 737[3:Rew:679.0,487.0] || -> totalorderP(cons(u,sk6))*.
% 1.33/1.51 738[3:Rew:679.0,488.0] || -> strictorderP(cons(u,sk6))*.
% 1.33/1.51 739[3:Rew:679.0,489.0] || -> totalorderedP(cons(u,sk6))*.
% 1.33/1.51 740[3:Rew:679.0,490.0] || -> strictorderedP(cons(u,sk6))*.
% 1.33/1.51 741[3:Rew:679.0,491.0] || -> duplicatefreeP(cons(u,sk6))*.
% 1.33/1.51 742[3:Rew:679.0,492.0] || -> equalelemsP(cons(u,sk6))*.
% 1.33/1.51 766[3:MRR:606.2,728.1] ssList(u) || equal(v,w) -> frontsegP(cons(v,u),cons(w,sk6))*.
% 1.33/1.51 783[3:Rew:731.1,675.1] ssList(u) || -> equal(hd(u),hd(sk6))*.
% 1.33/1.51 841[3:Res:520.1,725.0] || -> equal(sk6,sk1)**.
% 1.33/1.51 856[3:Rew:841.0,484.0] || -> ssList(cons(u,sk1))*.
% 1.33/1.51 857[3:Rew:841.0,736.0] || -> cyclefreeP(cons(u,sk1))*.
% 1.33/1.51 858[3:Rew:841.0,737.0] || -> totalorderP(cons(u,sk1))*.
% 1.33/1.51 859[3:Rew:841.0,738.0] || -> strictorderP(cons(u,sk1))*.
% 1.33/1.51 860[3:Rew:841.0,739.0] || -> totalorderedP(cons(u,sk1))*.
% 1.33/1.51 861[3:Rew:841.0,740.0] || -> strictorderedP(cons(u,sk1))*.
% 1.33/1.51 862[3:Rew:841.0,741.0] || -> duplicatefreeP(cons(u,sk1))*.
% 1.33/1.51 863[3:Rew:841.0,742.0] || -> equalelemsP(cons(u,sk1))*.
% 1.33/1.51 864[3:Rew:841.0,496.0] || -> equal(hd(cons(u,sk1)),u)**.
% 1.33/1.51 905[3:Rew:841.0,766.2] ssList(u) || equal(v,w) -> frontsegP(cons(v,u),cons(w,sk1))*.
% 1.33/1.51 906[3:Rew:841.0,590.1] ssList(u) || frontsegP(cons(v,u),cons(w,sk1))* -> equal(v,w).
% 1.33/1.51 931[3:Rew:841.0,783.1] ssList(u) || -> equal(hd(u),hd(sk1))*.
% 1.33/1.51 1001[3:SpR:931.1,864.0] ssList(cons(u,sk1)) || -> equal(hd(sk1),u)*.
% 1.33/1.51 1006[3:SSi:1001.0,856.0,857.0,858.0,859.0,860.0,861.0,862.0,863.0] || -> equal(hd(sk1),u)*.
% 1.33/1.51 1046[3:Rew:1006.0,906.1] ssList(u) || frontsegP(cons(v,u),hd(sk1))* -> equal(v,w)*.
% 1.33/1.51 1047[3:Rew:1006.0,905.2] ssList(u) || equal(v,w)* -> frontsegP(cons(v,u),hd(sk1))*.
% 1.33/1.51 1170[3:AED:66.0,1046.2] ssList(u) || frontsegP(cons(v,u),hd(sk1))* -> .
% 1.33/1.51 1171[3:AED:66.0,1047.1] ssList(u) || -> frontsegP(cons(v,u),hd(sk1))*.
% 1.33/1.51 1172[3:MRR:1171.1,1170.1] ssList(u) || -> .
% 1.33/1.51 1173[3:UnC:1172.0,25.0] || -> .
% 1.33/1.51 1246[3:Spt:1173.0,404.5,679.0] || equal(nil,sk6)** -> .
% 1.33/1.51 1247[3:Spt:1173.0,404.0,404.1,404.2,404.3,404.4] ssList(u) || equal(hd(u),hd(sk6))* equal(tl(u),tl(sk6)) -> equal(u,sk6) equal(nil,u).
% 1.33/1.51 1257[3:MRR:361.2,1246.0] ssList(u) || equal(app(u,sk6),nil)** -> .
% 1.33/1.51 1272[1:Res:520.1,12.0] || -> equal(nil,sk1)**.
% 1.33/1.51 1274[1:Rew:1272.0,13.0] || -> equalelemsP(sk1)*.
% 1.33/1.51 1275[1:Rew:1272.0,14.0] || -> duplicatefreeP(sk1)*.
% 1.33/1.51 1276[1:Rew:1272.0,15.0] || -> strictorderedP(sk1)*.
% 1.33/1.51 1277[1:Rew:1272.0,16.0] || -> totalorderedP(sk1)*.
% 1.33/1.51 1278[1:Rew:1272.0,17.0] || -> strictorderP(sk1)*.
% 1.33/1.51 1279[1:Rew:1272.0,18.0] || -> totalorderP(sk1)*.
% 1.33/1.51 1280[1:Rew:1272.0,19.0] || -> cyclefreeP(sk1)*.
% 1.33/1.51 1287[1:Rew:1272.0,492.0] || -> equalelemsP(cons(u,sk1))*.
% 1.33/1.51 1288[1:Rew:1272.0,491.0] || -> duplicatefreeP(cons(u,sk1))*.
% 1.33/1.51 1289[1:Rew:1272.0,490.0] || -> strictorderedP(cons(u,sk1))*.
% 1.33/1.51 1290[1:Rew:1272.0,489.0] || -> totalorderedP(cons(u,sk1))*.
% 1.33/1.51 1291[1:Rew:1272.0,488.0] || -> strictorderP(cons(u,sk1))*.
% 1.33/1.51 1292[1:Rew:1272.0,487.0] || -> totalorderP(cons(u,sk1))*.
% 1.33/1.51 1293[1:Rew:1272.0,486.0] || -> cyclefreeP(cons(u,sk1))*.
% 1.33/1.51 1300[1:Rew:1272.0,495.0] || equal(cons(u,sk6),sk1)** -> .
% 1.33/1.51 1307[1:Rew:1272.0,85.1] ssList(u) || -> equal(app(u,sk1),u)**.
% 1.33/1.51 1308[1:Rew:1272.0,86.1] ssList(u) || -> equal(app(sk1,u),u)**.
% 1.33/1.51 1311[1:Rew:1272.0,201.0] || -> equal(app(app(sk5,cons(sk7,sk1)),sk6),sk1)**.
% 1.33/1.51 1318[1:Rew:1272.0,130.3] ssList(u) ssList(v) || equal(app(u,v),nil)** -> equal(sk1,u).
% 1.33/1.51 1334[1:Rew:1272.0,621.1] ssList(u) || equal(cons(v,sk1),u)*+ -> singletonP(u)*.
% 1.33/1.51 1337[3:Rew:1272.0,1257.1] ssList(u) || equal(app(u,sk6),sk1)** -> .
% 1.33/1.51 1346[1:Rew:1272.0,1318.2] ssList(u) ssList(v) || equal(app(u,v),sk1)** -> equal(sk1,u).
% 1.33/1.51 1394[3:SpL:1311.0,1337.1] ssList(app(sk5,cons(sk7,sk1))) || equal(sk1,sk1)* -> .
% 1.33/1.51 1398[3:Obv:1394.1] ssList(app(sk5,cons(sk7,sk1))) || -> .
% 1.33/1.51 1474[3:SoR:1398.0,97.2] ssList(cons(sk7,sk1)) ssList(sk5) || -> .
% 1.33/1.51 1482[3:SSi:1474.1,1474.0,7.0,616.0,1.0,1274.0,1275.0,1276.0,1277.0,1278.0,1279.0,1280.0,1287.0,1288.0,1289.0,1290.0,1291.0,1292.1,1293.0] || -> .
% 1.33/1.51 1483[2:Spt:1482.0,433.1] || -> equal(nil,sk6)**.
% 1.33/1.51 1484[2:Rew:1272.0,1483.0] || -> equal(sk6,sk1)**.
% 1.33/1.51 1492[2:Rew:1484.0,484.0] || -> ssList(cons(u,sk1))*.
% 1.33/1.51 1493[2:Rew:1484.0,1300.0] || equal(cons(u,sk1),sk1)** -> .
% 1.33/1.51 1495[2:Rew:1484.0,200.0] || -> equal(app(sk5,sk1),sk2)**.
% 1.33/1.51 1504[2:Rew:1484.0,1311.0] || -> equal(app(app(sk5,cons(sk7,sk1)),sk1),sk1)**.
% 1.33/1.51 1741[2:SpR:1495.0,1307.1] ssList(sk5) || -> equal(sk5,sk2)**.
% 1.33/1.51 1744[2:SSi:1741.0,7.0] || -> equal(sk5,sk2)**.
% 1.33/1.51 1747[2:Rew:1744.0,1504.0] || -> equal(app(app(sk2,cons(sk7,sk1)),sk1),sk1)**.
% 1.33/1.51 1760[2:SpR:1747.0,1307.1] ssList(app(sk2,cons(sk7,sk1))) || -> equal(app(sk2,cons(sk7,sk1)),sk1)**.
% 1.33/1.51 1763[2:SSi:1760.0,97.0,2.0,1287.0,1288.0,1289.0,1290.0,1291.0,1292.0,1293.0,1492.2] || -> equal(app(sk2,cons(sk7,sk1)),sk1)**.
% 1.33/1.51 1834[1:EqR:1334.1] ssList(cons(u,sk1)) || -> singletonP(cons(u,sk1))*.
% 1.33/1.51 1836[2:SSi:1834.0,1287.0,1288.0,1289.0,1290.0,1291.0,1292.0,1293.0,1492.0] || -> singletonP(cons(u,sk1))*.
% 1.33/1.51 2213[2:SpL:1763.0,1346.2] ssList(sk2) ssList(cons(sk7,sk1)) || equal(sk1,sk1) -> equal(sk2,sk1)**.
% 1.33/1.51 2214[2:Obv:2213.2] ssList(sk2) ssList(cons(sk7,sk1)) || -> equal(sk2,sk1)**.
% 1.33/1.51 2215[2:SSi:2214.1,2214.0,1287.0,1288.0,1289.0,1290.0,1291.0,1292.0,1293.0,1492.0,1836.0,2.0] || -> equal(sk2,sk1)**.
% 1.33/1.51 2220[2:Rew:2215.0,1763.0] || -> equal(app(sk1,cons(sk7,sk1)),sk1)**.
% 1.33/1.51 2234[2:SpR:2220.0,1308.1] ssList(cons(sk7,sk1)) || -> equal(cons(sk7,sk1),sk1)**.
% 1.33/1.51 2238[2:SSi:2234.0,1287.0,1288.0,1289.0,1290.0,1291.0,1292.0,1293.0,1492.0,1836.0] || -> equal(cons(sk7,sk1),sk1)**.
% 1.33/1.51 2239[2:MRR:2238.0,1493.0] || -> .
% 1.33/1.51 2240[1:Spt:2239.0,84.0,84.2] ssList(u) || -> duplicatefreeP(u)*.
% 1.33/1.51 2246[2:Spt:433.0,433.2] ssList(u) || -> equal(hd(app(sk6,u)),hd(sk6))**.
% 1.33/1.51 2248[3:Spt:389.0] || -> ssItem(u)*.
% 1.33/1.51 2252[3:MRR:76.0,2248.0] || -> equalelemsP(cons(u,nil))*.
% 1.33/1.51 2253[3:MRR:77.0,2248.0] || -> duplicatefreeP(cons(u,nil))*.
% 1.33/1.51 2254[3:MRR:78.0,2248.0] || -> strictorderedP(cons(u,nil))*.
% 1.33/1.51 2255[3:MRR:79.0,2248.0] || -> totalorderedP(cons(u,nil))*.
% 1.33/1.51 2256[3:MRR:80.0,2248.0] || -> strictorderP(cons(u,nil))*.
% 1.33/1.51 2257[3:MRR:81.0,2248.0] || -> totalorderP(cons(u,nil))*.
% 1.33/1.51 2258[3:MRR:82.0,2248.0] || -> cyclefreeP(cons(u,nil))*.
% 1.33/1.51 2260[3:MRR:445.0,2248.0] || -> ssList(cons(u,sk6))*.
% 1.33/1.51 2264[3:MRR:440.0,2248.0] || -> equal(hd(cons(u,sk6)),u)**.
% 1.33/1.51 2286[3:MRR:114.1,114.0,2248.0] || -> equal(u,v) neq(u,v)*.
% 1.33/1.51 2383[3:MRR:98.1,2248.0] ssList(u) || -> ssList(cons(v,u))*.
% 1.33/1.51 2391[3:MRR:456.1,2248.0] ssList(u) || -> equal(app(cons(v,u),sk6),cons(v,app(u,sk6)))**.
% 1.33/1.51 2441[3:MRR:182.3,182.2,2248.0] ssList(u) ssList(v) || equal(cons(w,u),cons(x,v))* -> equal(w,x).
% 1.33/1.51 2450[4:Spt:385.1] || -> equal(nil,sk6)**.
% 1.33/1.51 2463[4:Rew:2450.0,12.0] || neq(sk1,sk6)* -> .
% 1.33/1.51 2464[4:Rew:2450.0,2252.0] || -> equalelemsP(cons(u,sk6))*.
% 1.33/1.51 2465[4:Rew:2450.0,2253.0] || -> duplicatefreeP(cons(u,sk6))*.
% 1.33/1.51 2466[4:Rew:2450.0,2254.0] || -> strictorderedP(cons(u,sk6))*.
% 1.33/1.51 2467[4:Rew:2450.0,2255.0] || -> totalorderedP(cons(u,sk6))*.
% 1.33/1.51 2468[4:Rew:2450.0,2256.0] || -> strictorderP(cons(u,sk6))*.
% 1.33/1.51 2469[4:Rew:2450.0,2257.0] || -> totalorderP(cons(u,sk6))*.
% 1.33/1.51 2470[4:Rew:2450.0,2258.0] || -> cyclefreeP(cons(u,sk6))*.
% 1.33/1.51 2485[4:Rew:2450.0,86.1] ssList(u) || -> equal(app(sk6,u),u)**.
% 1.33/1.51 2486[4:Rew:2450.0,85.1] ssList(u) || -> equal(app(u,sk6),u)**.
% 1.33/1.51 2554[4:Rew:2485.1,2246.1] ssList(u) || -> equal(hd(u),hd(sk6))*.
% 1.33/1.51 2576[4:Rew:2486.1,2391.1] ssList(u) || -> equal(app(cons(v,u),sk6),cons(v,u))**.
% 1.33/1.51 2609[4:Res:2286.1,2463.0] || -> equal(sk6,sk1)**.
% 1.33/1.51 2614[4:Rew:2609.0,2260.0] || -> ssList(cons(u,sk1))*.
% 1.33/1.51 2615[4:Rew:2609.0,2464.0] || -> equalelemsP(cons(u,sk1))*.
% 1.33/1.51 2616[4:Rew:2609.0,2465.0] || -> duplicatefreeP(cons(u,sk1))*.
% 1.33/1.51 2617[4:Rew:2609.0,2466.0] || -> strictorderedP(cons(u,sk1))*.
% 1.33/1.51 2618[4:Rew:2609.0,2467.0] || -> totalorderedP(cons(u,sk1))*.
% 1.33/1.51 2619[4:Rew:2609.0,2468.0] || -> strictorderP(cons(u,sk1))*.
% 1.33/1.51 2620[4:Rew:2609.0,2469.0] || -> totalorderP(cons(u,sk1))*.
% 1.33/1.51 2621[4:Rew:2609.0,2470.0] || -> cyclefreeP(cons(u,sk1))*.
% 1.33/1.51 2622[4:Rew:2609.0,2264.0] || -> equal(hd(cons(u,sk1)),u)**.
% 1.33/1.51 2699[4:Rew:2609.0,2554.1] ssList(u) || -> equal(hd(u),hd(sk1))*.
% 1.33/1.51 2723[4:Rew:2609.0,2576.1] ssList(u) || -> equal(app(cons(v,u),sk1),cons(v,u))**.
% 1.33/1.51 2776[4:SpR:2699.1,2622.0] ssList(cons(u,sk1)) || -> equal(hd(sk1),u)*.
% 1.33/1.51 2781[4:SSi:2776.0,2614.0,2615.0,2616.0,2617.0,2618.0,2619.0,2620.0,2621.0] || -> equal(hd(sk1),u)*.
% 1.33/1.51 2822[4:Rew:2781.0,2723.1] ssList(u) || -> equal(cons(v,u),hd(sk1))**.
% 1.33/1.51 2913[4:Rew:2781.0,2441.2] ssList(u) ssList(v) || equal(cons(w,u),hd(sk1))** -> equal(w,x)*.
% 1.33/1.51 2981[4:Con:2913.1] ssList(u) || equal(cons(v,u),hd(sk1))** -> equal(v,w)*.
% 1.33/1.51 2982[4:AED:66.0,2981.2] ssList(u) || equal(cons(v,u),hd(sk1))** -> .
% 1.33/1.51 2983[4:Rew:2822.1,2982.1] ssList(u) || equal(hd(sk1),hd(sk1))* -> .
% 1.33/1.51 2984[4:Obv:2983.1] ssList(u) || -> .
% 1.33/1.51 2985[4:UnC:2984.0,2.0] || -> .
% 1.33/1.51 3057[4:Spt:2985.0,385.1,2450.0] || equal(nil,sk6)** -> .
% 1.33/1.51 3058[4:Spt:2985.0,385.0] || -> ssList(tl(sk6))*.
% 1.33/1.51 3067[4:MRR:361.2,3057.0] ssList(u) || equal(app(u,sk6),nil)** -> .
% 1.33/1.51 3072[3:Res:2286.1,12.0] || -> equal(nil,sk1)**.
% 1.33/1.51 3073[3:Rew:3072.0,13.0] || -> equalelemsP(sk1)*.
% 1.33/1.51 3074[3:Rew:3072.0,14.0] || -> duplicatefreeP(sk1)*.
% 1.33/1.51 3075[3:Rew:3072.0,15.0] || -> strictorderedP(sk1)*.
% 1.33/1.51 3076[3:Rew:3072.0,16.0] || -> totalorderedP(sk1)*.
% 1.33/1.51 3077[3:Rew:3072.0,17.0] || -> strictorderP(sk1)*.
% 1.33/1.51 3078[3:Rew:3072.0,18.0] || -> totalorderP(sk1)*.
% 1.33/1.51 3079[3:Rew:3072.0,19.0] || -> cyclefreeP(sk1)*.
% 1.33/1.51 3087[3:Rew:3072.0,2258.0] || -> cyclefreeP(cons(u,sk1))*.
% 1.33/1.51 3088[3:Rew:3072.0,2257.0] || -> totalorderP(cons(u,sk1))*.
% 1.33/1.51 3089[3:Rew:3072.0,2256.0] || -> strictorderP(cons(u,sk1))*.
% 1.33/1.51 3090[3:Rew:3072.0,2255.0] || -> totalorderedP(cons(u,sk1))*.
% 1.33/1.51 3091[3:Rew:3072.0,2254.0] || -> strictorderedP(cons(u,sk1))*.
% 1.33/1.51 3092[3:Rew:3072.0,2253.0] || -> duplicatefreeP(cons(u,sk1))*.
% 1.33/1.51 3093[3:Rew:3072.0,2252.0] || -> equalelemsP(cons(u,sk1))*.
% 1.33/1.51 3133[3:Rew:3072.0,201.0] || -> equal(app(app(sk5,cons(sk7,sk1)),sk6),sk1)**.
% 1.33/1.51 3137[4:Rew:3072.0,3067.1] ssList(u) || equal(app(u,sk6),sk1)** -> .
% 1.36/1.56 3195[4:SpL:3133.0,3137.1] ssList(app(sk5,cons(sk7,sk1))) || equal(sk1,sk1)* -> .
% 1.36/1.56 3199[4:Obv:3195.1] ssList(app(sk5,cons(sk7,sk1))) || -> .
% 1.36/1.56 3267[4:SoR:3199.0,97.2] ssList(cons(sk7,sk1)) ssList(sk5) || -> .
% 1.36/1.56 3275[4:SSi:3267.1,3267.0,7.0,2383.0,1.0,3073.0,3074.0,3075.0,3076.0,3077.0,3078.0,3079.0,3087.0,3088.0,3089.0,3090.0,3091.0,3092.1,3093.0] || -> .
% 1.36/1.56 3276[3:Spt:3275.0,389.1] || -> duplicatefreeP(sk6)*.
% 1.36/1.56 3278[4:Spt:342.3] || -> equal(nil,sk6)**.
% 1.36/1.56 3316[4:Rew:3278.0,82.1] ssItem(u) || -> cyclefreeP(cons(u,sk6))*.
% 1.36/1.56 3317[4:Rew:3278.0,81.1] ssItem(u) || -> totalorderP(cons(u,sk6))*.
% 1.36/1.56 3318[4:Rew:3278.0,80.1] ssItem(u) || -> strictorderP(cons(u,sk6))*.
% 1.36/1.56 3319[4:Rew:3278.0,79.1] ssItem(u) || -> totalorderedP(cons(u,sk6))*.
% 1.36/1.56 3320[4:Rew:3278.0,78.1] ssItem(u) || -> strictorderedP(cons(u,sk6))*.
% 1.36/1.56 3321[4:Rew:3278.0,77.1] ssItem(u) || -> duplicatefreeP(cons(u,sk6))*.
% 1.36/1.56 3322[4:Rew:3278.0,76.1] ssItem(u) || -> equalelemsP(cons(u,sk6))*.
% 1.36/1.56 3325[4:Rew:3278.0,86.1] ssList(u) || -> equal(app(sk6,u),u)**.
% 1.36/1.57 3407[4:Rew:3325.1,2246.1] ssList(u) || -> equal(hd(u),hd(sk6))*.
% 1.36/1.57 3483[4:SpR:230.1,3407.1] ssList(u) ssList(cons(sk7,u)) || -> equal(hd(sk6),sk7)**.
% 1.36/1.57 3485[4:SSi:3483.1,234.1] ssList(u) || -> equal(hd(sk6),sk7)**.
% 1.36/1.57 3486[4:Rew:3485.1,3407.1] ssList(u) || -> equal(hd(u),sk7)**.
% 1.36/1.57 3546[4:SpR:440.1,3486.1] ssItem(u) ssList(cons(u,sk6)) || -> equal(u,sk7)*.
% 1.36/1.57 3547[4:SSi:3546.1,445.1,3316.1,3317.1,3318.1,3319.1,3320.1,3321.1,3322.1] ssItem(u) || -> equal(u,sk7)*.
% 1.36/1.57 3564[4:EmS:3547.0,21.0] || -> equal(skac3,sk7)**.
% 1.36/1.57 3565[4:EmS:3547.0,22.0] || -> equal(skac2,sk7)**.
% 1.36/1.57 3566[4:Rew:3564.0,66.0] || equal(skac2,sk7)** -> .
% 1.36/1.57 3602[4:Rew:3565.0,3566.0] || equal(sk7,sk7)* -> .
% 1.36/1.57 3603[4:Obv:3602.0] || -> .
% 1.36/1.57 3641[4:Spt:3603.0,342.3,3278.0] || equal(nil,sk6)** -> .
% 1.36/1.57 3642[4:Spt:3603.0,342.0,342.1,342.2] ssItem(u) || totalorderedP(cons(u,sk6)) -> leq(u,hd(sk6))*.
% 1.36/1.57 3651[4:MRR:361.2,3641.0] ssList(u) || equal(app(u,sk6),nil)** -> .
% 1.36/1.57 3688[4:SpL:201.0,3651.1] ssList(app(sk5,cons(sk7,nil))) || equal(nil,sk1)** -> .
% 1.36/1.57 3691[4:SSi:3688.0,97.0,7.1,234.0,13.1,14.0,15.1,16.0,17.1,18.0,19.1,20.0,76.1,10.0,77.1,10.0,78.0,10.0,79.0,10.0,80.0,10.0,81.0,10.1,82.0,10.2] || equal(nil,sk1)** -> .
% 1.36/1.57 3749[0:EqR:222.1] ssList(cons(sk7,nil)) || -> singletonP(cons(sk7,nil))*.
% 1.36/1.57 3750[0:SSi:3749.0,234.0,13.1,14.0,15.1,16.0,17.1,18.0,19.1,20.0,76.1,10.0,77.1,10.0,78.1,10.0,79.0,10.0,80.0,10.0,81.0,10.0,82.0,10.1] || -> singletonP(cons(sk7,nil))*.
% 1.36/1.57 3794[0:SpL:113.2,110.2] ssList(u) singletonP(u) ssList(nil) ssItem(skaf44(u)) || equal(u,nil)* -> .
% 1.36/1.57 3795[0:SSi:3794.3,3794.2,59.0,13.0,14.0,15.0,16.0,17.0,18.0,19.0,20.0] ssList(u) singletonP(u) || equal(u,nil)* -> .
% 1.36/1.57 3884[0:EmS:3795.0,3795.1,25.0,222.2] ssList(skaf82(u)) || equal(skaf82(u),nil) equal(cons(sk7,nil),skaf82(u))* -> .
% 1.36/1.57 3908[0:SSi:3884.0,25.0] || equal(skaf82(u),nil) equal(cons(sk7,nil),skaf82(u))* -> .
% 1.36/1.57 3949[0:Res:112.3,12.0] ssList(sk1) ssList(nil) || -> equal(nil,sk1)**.
% 1.36/1.57 3954[0:SSi:3949.1,3949.0,13.0,14.0,15.0,16.0,17.0,18.0,19.0,20.0,1.0] || -> equal(nil,sk1)**.
% 1.36/1.57 3955[4:MRR:3954.0,3691.0] || -> .
% 1.36/1.57 3956[2:Spt:3955.0,433.1] || -> equal(nil,sk6)**.
% 1.36/1.57 3957[0:Rew:3954.0,13.0] || -> equalelemsP(sk1)*.
% 1.36/1.57 3958[0:Rew:3954.0,14.0] || -> duplicatefreeP(sk1)*.
% 1.36/1.57 3959[0:Rew:3954.0,15.0] || -> strictorderedP(sk1)*.
% 1.36/1.57 3960[0:Rew:3954.0,16.0] || -> totalorderedP(sk1)*.
% 1.36/1.57 3961[0:Rew:3954.0,17.0] || -> strictorderP(sk1)*.
% 1.36/1.57 3962[0:Rew:3954.0,18.0] || -> totalorderP(sk1)*.
% 1.36/1.57 3963[0:Rew:3954.0,19.0] || -> cyclefreeP(sk1)*.
% 1.36/1.57 3971[0:Rew:3954.0,242.0] || -> cyclefreeP(cons(sk7,sk1))*.
% 1.36/1.57 3972[0:Rew:3954.0,241.0] || -> totalorderP(cons(sk7,sk1))*.
% 1.36/1.57 3973[0:Rew:3954.0,240.0] || -> strictorderP(cons(sk7,sk1))*.
% 1.36/1.57 3974[0:Rew:3954.0,239.0] || -> totalorderedP(cons(sk7,sk1))*.
% 1.36/1.57 3975[0:Rew:3954.0,238.0] || -> strictorderedP(cons(sk7,sk1))*.
% 1.36/1.57 3976[0:Rew:3954.0,237.0] || -> duplicatefreeP(cons(sk7,sk1))*.
% 1.36/1.57 3977[0:Rew:3954.0,236.0] || -> equalelemsP(cons(sk7,sk1))*.
% 1.36/1.57 3978[0:Rew:3954.0,201.0] || -> equal(app(app(sk5,cons(sk7,sk1)),sk6),sk1)**.
% 1.36/1.57 3980[0:Rew:3954.0,3750.0] || -> singletonP(cons(sk7,sk1))*.
% 1.36/1.57 3987[0:Rew:3954.0,76.1] ssItem(u) || -> equalelemsP(cons(u,sk1))*.
% 1.36/1.57 3988[0:Rew:3954.0,77.1] ssItem(u) || -> duplicatefreeP(cons(u,sk1))*.
% 1.36/1.57 3989[0:Rew:3954.0,78.1] ssItem(u) || -> strictorderedP(cons(u,sk1))*.
% 1.36/1.57 3990[0:Rew:3954.0,79.1] ssItem(u) || -> totalorderedP(cons(u,sk1))*.
% 1.36/1.57 3991[0:Rew:3954.0,80.1] ssItem(u) || -> strictorderP(cons(u,sk1))*.
% 1.36/1.57 3992[0:Rew:3954.0,81.1] ssItem(u) || -> totalorderP(cons(u,sk1))*.
% 1.36/1.57 3993[0:Rew:3954.0,82.1] ssItem(u) || -> cyclefreeP(cons(u,sk1))*.
% 1.36/1.57 3996[0:Rew:3954.0,85.1] ssList(u) || -> equal(app(u,sk1),u)**.
% 1.36/1.57 3997[0:Rew:3954.0,86.1] ssList(u) || -> equal(app(sk1,u),u)**.
% 1.36/1.57 4010[0:Rew:3954.0,441.1] ssItem(u) || equal(cons(u,sk6),sk1)** -> .
% 1.36/1.57 4016[0:Rew:3954.0,3908.1] || equal(skaf82(u),nil) equal(cons(sk7,sk1),skaf82(u))* -> .
% 1.36/1.57 4051[0:Rew:3954.0,130.3] ssList(u) ssList(v) || equal(app(u,v),nil)** -> equal(sk1,u).
% 1.36/1.57 4056[0:Rew:3954.0,121.1] ssList(u) || -> equal(sk1,u) equal(cons(skaf83(u),skaf82(u)),u)**.
% 1.36/1.57 4070[2:Rew:3954.0,3956.0] || -> equal(sk6,sk1)**.
% 1.36/1.57 4078[2:Rew:4070.0,439.1] ssItem(u) || -> equal(tl(cons(u,sk1)),sk1)**.
% 1.36/1.57 4079[2:Rew:4070.0,200.0] || -> equal(app(sk5,sk1),sk2)**.
% 1.36/1.57 4221[2:Rew:4070.0,3978.0] || -> equal(app(app(sk5,cons(sk7,sk1)),sk1),sk1)**.
% 1.36/1.57 4223[2:Rew:4070.0,4010.1] ssItem(u) || equal(cons(u,sk1),sk1)** -> .
% 1.36/1.57 4247[0:Rew:3954.0,4016.0] || equal(skaf82(u),sk1) equal(cons(sk7,sk1),skaf82(u))* -> .
% 1.36/1.57 4299[0:Rew:3954.0,4051.2] ssList(u) ssList(v) || equal(app(u,v),sk1)** -> equal(sk1,u).
% 1.36/1.57 4380[2:SpR:3996.1,4079.0] ssList(sk5) || -> equal(sk5,sk2)**.
% 1.36/1.57 4383[2:SSi:4380.0,7.0] || -> equal(sk5,sk2)**.
% 1.36/1.57 4386[2:Rew:4383.0,4221.0] || -> equal(app(app(sk2,cons(sk7,sk1)),sk1),sk1)**.
% 1.36/1.57 4398[2:SpR:4386.0,3996.1] ssList(app(sk2,cons(sk7,sk1))) || -> equal(app(sk2,cons(sk7,sk1)),sk1)**.
% 1.36/1.57 4400[2:SSi:4398.0,97.0,2.0,3971.0,3972.0,3973.0,3974.0,3975.0,3976.0,3977.1,3980.0,234.0,1.0,3957.0,3958.0,3959.0,3960.0,3961.0,3962.0,3963.2] || -> equal(app(sk2,cons(sk7,sk1)),sk1)**.
% 1.36/1.57 4609[0:SpR:4056.2,108.2] ssList(u) ssList(skaf82(u)) ssItem(skaf83(u)) || -> equal(sk1,u) equal(tl(u),skaf82(u))**.
% 1.36/1.57 4622[0:SSi:4609.2,4609.1,24.0,25.0] ssList(u) || -> equal(sk1,u) equal(tl(u),skaf82(u))**.
% 1.36/1.57 4660[2:SpR:4622.2,4078.1] ssList(cons(u,sk1)) ssItem(u) || -> equal(cons(u,sk1),sk1) equal(skaf82(cons(u,sk1)),sk1)**.
% 1.36/1.57 4667[2:SSi:4660.0,3987.0,3988.0,3989.0,3990.0,3991.0,3992.0,3993.0,98.0,1.2,3957.1,3958.1,3959.1,3960.1,3961.1,3962.1,3963.1] ssItem(u) || -> equal(cons(u,sk1),sk1) equal(skaf82(cons(u,sk1)),sk1)**.
% 1.36/1.57 4668[2:MRR:4667.1,4223.1] ssItem(u) || -> equal(skaf82(cons(u,sk1)),sk1)**.
% 1.36/1.57 4740[2:SpL:4668.1,4247.1] ssItem(u) || equal(skaf82(cons(u,sk1)),sk1)** equal(cons(sk7,sk1),sk1) -> .
% 1.36/1.57 4742[2:Rew:4668.1,4740.1] ssItem(u) || equal(sk1,sk1) equal(cons(sk7,sk1),sk1)** -> .
% 1.36/1.57 4743[2:Obv:4742.1] ssItem(u) || equal(cons(sk7,sk1),sk1)** -> .
% 1.36/1.57 4753[2:EmS:4743.0,59.0] || equal(cons(sk7,sk1),sk1)** -> .
% 1.36/1.57 5019[2:SpL:4400.0,4299.2] ssList(sk2) ssList(cons(sk7,sk1)) || equal(sk1,sk1) -> equal(sk2,sk1)**.
% 1.36/1.57 5020[2:Obv:5019.2] ssList(sk2) ssList(cons(sk7,sk1)) || -> equal(sk2,sk1)**.
% 1.36/1.57 5021[2:SSi:5020.1,5020.0,3971.0,3972.0,3973.0,3974.0,3975.0,3976.0,3977.0,3980.0,234.0,1.1,3957.0,3958.0,3959.0,3960.0,3961.0,3962.0,3963.0,2.0] || -> equal(sk2,sk1)**.
% 1.36/1.57 5026[2:Rew:5021.0,4400.0] || -> equal(app(sk1,cons(sk7,sk1)),sk1)**.
% 1.36/1.57 5043[2:SpR:5026.0,3997.1] ssList(cons(sk7,sk1)) || -> equal(cons(sk7,sk1),sk1)**.
% 1.36/1.57 5047[2:SSi:5043.0,3971.0,3972.0,3973.0,3974.0,3975.0,3976.0,3977.0,3980.0,234.1,1.0,3957.0,3958.0,3959.0,3960.0,3961.0,3962.0,3963.0] || -> equal(cons(sk7,sk1),sk1)**.
% 1.36/1.57 5048[2:MRR:5047.0,4753.0] || -> .
% 1.36/1.57 % SZS output end Refutation
% 1.36/1.57 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_12 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause9 clause10 clause12 clause13 clause47 clause54 clause60 clause64 clause65 clause66 clause67 clause68 clause69 clause70 clause72 clause73 clause74 clause77 clause85 clause86 clause96 clause97 clause98 clause100 clause101 clause102 clause109 clause116 clause118 clause119 clause123 clause135 clause157 clause170 clause176 clause177 clause178
% 1.36/1.57
%------------------------------------------------------------------------------