TSTP Solution File: SWC294-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC294-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n009.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:03:07 EDT 2022
% Result : Unsatisfiable 1.88s 2.07s
% Output : Refutation 1.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC294-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n009.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 : Sun Jun 12 14:17:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.88/2.07
% 1.88/2.07 SPASS V 3.9
% 1.88/2.07 SPASS beiseite: Proof found.
% 1.88/2.07 % SZS status Theorem
% 1.88/2.07 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.88/2.07 SPASS derived 2977 clauses, backtracked 3073 clauses, performed 87 splits and kept 5161 clauses.
% 1.88/2.07 SPASS allocated 78398 KBytes.
% 1.88/2.07 SPASS spent 0:00:01.71 on the problem.
% 1.88/2.07 0:00:00.04 for the input.
% 1.88/2.07 0:00:00.00 for the FLOTTER CNF translation.
% 1.88/2.07 0:00:00.01 for inferences.
% 1.88/2.07 0:00:00.02 for the backtracking.
% 1.88/2.07 0:00:01.45 for the reduction.
% 1.88/2.07
% 1.88/2.07
% 1.88/2.07 Here is a proof with depth 2, length 253 :
% 1.88/2.07 % SZS output start Refutation
% 1.88/2.07 1[0:Inp] || -> ssList(sk1)*.
% 1.88/2.07 2[0:Inp] || -> ssList(sk2)*.
% 1.88/2.07 5[0:Inp] || -> equal(sk4,sk2)**.
% 1.88/2.07 6[0:Inp] || -> equal(sk3,sk1)**.
% 1.88/2.07 7[0:Inp] || -> segmentP(sk4,sk3)*.
% 1.88/2.07 8[0:Inp] || strictorderedP(sk1)* -> .
% 1.88/2.07 9[0:Inp] || neq(sk4,nil)* -> singletonP(sk3).
% 1.88/2.07 10[0:Inp] || -> equalelemsP(nil)*.
% 1.88/2.07 11[0:Inp] || -> duplicatefreeP(nil)*.
% 1.88/2.07 12[0:Inp] || -> strictorderedP(nil)*.
% 1.88/2.07 13[0:Inp] || -> totalorderedP(nil)*.
% 1.88/2.07 14[0:Inp] || -> strictorderP(nil)*.
% 1.88/2.07 15[0:Inp] || -> totalorderP(nil)*.
% 1.88/2.07 16[0:Inp] || -> cyclefreeP(nil)*.
% 1.88/2.07 17[0:Inp] || -> ssList(nil)*.
% 1.88/2.07 56[0:Inp] || -> ssItem(skaf44(u))*.
% 1.88/2.07 75[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 1.88/2.07 76[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 1.88/2.07 77[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 1.88/2.07 78[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 1.88/2.07 79[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 1.88/2.07 81[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 1.88/2.07 89[0:Inp] ssList(u) || segmentP(nil,u)* -> equal(nil,u).
% 1.88/2.07 96[0:Inp] ssList(u) || -> cyclefreeP(u) leq(skaf50(u),skaf49(u))*.
% 1.88/2.07 97[0:Inp] ssList(u) || -> cyclefreeP(u) leq(skaf49(u),skaf50(u))*.
% 1.88/2.07 109[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*.
% 1.88/2.07 110[0:Inp] ssList(u) singletonP(u) || -> equal(cons(skaf44(u),nil),u)**.
% 1.88/2.07 111[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 1.88/2.07 173[0:Inp] ssList(u) || -> totalorderedP(u) equal(app(app(skaf66(u),cons(skaf64(u),skaf67(u))),cons(skaf65(u),skaf68(u))),u)**.
% 1.88/2.07 174[0:Inp] ssList(u) || -> strictorderP(u) equal(app(app(skaf61(u),cons(skaf59(u),skaf62(u))),cons(skaf60(u),skaf63(u))),u)**.
% 1.88/2.07 175[0:Inp] ssList(u) || -> totalorderP(u) equal(app(app(skaf56(u),cons(skaf54(u),skaf57(u))),cons(skaf55(u),skaf58(u))),u)**.
% 1.88/2.07 186[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.88/2.07 196[0:Rew:6.0,7.0] || -> segmentP(sk4,sk1)*.
% 1.88/2.07 198[0:Rew:5.0,196.0] || -> segmentP(sk2,sk1)*.
% 1.88/2.07 199[0:Rew:6.0,9.1,5.0,9.0] || neq(sk2,nil)* -> singletonP(sk1).
% 1.88/2.07 285[0:Res:2.0,81.0] || -> ssItem(u)* duplicatefreeP(sk2)*.
% 1.88/2.07 300[0:Res:2.0,186.1] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u) equal(nil,sk2).
% 1.88/2.07 339[0:Res:2.0,109.1] ssList(u) || -> equal(sk2,u) neq(sk2,u)*.
% 1.88/2.07 391[0:Res:1.0,175.0] || -> totalorderP(sk1) equal(app(app(skaf56(sk1),cons(skaf54(sk1),skaf57(sk1))),cons(skaf55(sk1),skaf58(sk1))),sk1)**.
% 1.88/2.07 392[0:Res:1.0,174.0] || -> strictorderP(sk1) equal(app(app(skaf61(sk1),cons(skaf59(sk1),skaf62(sk1))),cons(skaf60(sk1),skaf63(sk1))),sk1)**.
% 1.88/2.07 393[0:Res:1.0,173.0] || -> totalorderedP(sk1) equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1)**.
% 1.88/2.07 435[0:Res:1.0,110.1] singletonP(sk1) || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.88/2.07 444[0:Res:1.0,89.0] || segmentP(nil,sk1)* -> equal(nil,sk1).
% 1.88/2.07 450[0:Res:1.0,96.0] || -> cyclefreeP(sk1) leq(skaf50(sk1),skaf49(sk1))*.
% 1.88/2.07 451[0:Res:1.0,97.0] || -> cyclefreeP(sk1) leq(skaf49(sk1),skaf50(sk1))*.
% 1.88/2.07 456[0:Res:1.0,81.0] || -> ssItem(u)* duplicatefreeP(sk1)*.
% 1.88/2.07 471[0:Res:1.0,186.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1).
% 1.88/2.07 553[1:Spt:81.1] || -> ssItem(u)*.
% 1.88/2.07 563[1:MRR:75.0,553.0] || -> strictorderedP(cons(u,nil))*.
% 1.88/2.07 584[1:MRR:111.1,111.0,553.0] || -> equal(u,v) neq(u,v)*.
% 1.88/2.07 756[2:Spt:300.5] || -> equal(nil,sk2)**.
% 1.88/2.07 802[2:Rew:756.0,444.1] || segmentP(nil,sk1)* -> equal(sk2,sk1).
% 1.88/2.07 817[2:Rew:756.0,12.0] || -> strictorderedP(sk2)*.
% 1.88/2.07 890[2:Rew:756.0,802.0] || segmentP(sk2,sk1)* -> equal(sk2,sk1).
% 1.88/2.07 891[2:MRR:890.0,198.0] || -> equal(sk2,sk1)**.
% 1.88/2.07 978[2:Rew:891.0,817.0] || -> strictorderedP(sk1)*.
% 1.88/2.07 999[2:MRR:978.0,8.0] || -> .
% 1.88/2.07 1173[2:Spt:999.0,300.5,756.0] || equal(nil,sk2)** -> .
% 1.88/2.07 1174[2:Spt:999.0,300.0,300.1,300.2,300.3,300.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 1.88/2.07 1188[3:Spt:471.5] || -> equal(nil,sk1)**.
% 1.88/2.07 1192[3:Rew:1188.0,12.0] || -> strictorderedP(sk1)*.
% 1.88/2.07 1277[3:MRR:1192.0,8.0] || -> .
% 1.88/2.07 1360[3:Spt:1277.0,471.5,1188.0] || equal(nil,sk1)** -> .
% 1.88/2.07 1361[3:Spt:1277.0,471.0,471.1,471.2,471.3,471.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.88/2.07 1398[4:Spt:199.0] || neq(sk2,nil)* -> .
% 1.88/2.07 1414[4:Res:584.1,1398.0] || -> equal(nil,sk2)**.
% 1.88/2.07 1415[4:MRR:1414.0,1173.0] || -> .
% 1.88/2.07 1416[4:Spt:1415.0,199.0,1398.0] || -> neq(sk2,nil)*.
% 1.88/2.07 1417[4:Spt:1415.0,199.1] || -> singletonP(sk1)*.
% 1.88/2.07 1418[4:MRR:435.0,1417.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.88/2.07 1423[4:SpR:1418.0,563.0] || -> strictorderedP(sk1)*.
% 1.88/2.07 1427[4:MRR:1423.0,8.0] || -> .
% 1.88/2.07 1430[1:Spt:1427.0,81.0,81.2] ssList(u) || -> duplicatefreeP(u)*.
% 1.88/2.07 1448[2:Spt:456.0] || -> ssItem(u)*.
% 1.88/2.07 1454[2:MRR:75.0,1448.0] || -> strictorderedP(cons(u,nil))*.
% 1.88/2.07 1477[2:MRR:111.1,111.0,1448.0] || -> equal(u,v) neq(u,v)*.
% 1.88/2.07 1645[3:Spt:300.5] || -> equal(nil,sk2)**.
% 1.88/2.07 1651[3:Rew:1645.0,12.0] || -> strictorderedP(sk2)*.
% 1.88/2.07 1715[3:Rew:1645.0,444.1] || segmentP(nil,sk1)* -> equal(sk2,sk1).
% 1.88/2.07 1774[3:Rew:1645.0,1715.0] || segmentP(sk2,sk1)* -> equal(sk2,sk1).
% 1.88/2.07 1775[3:MRR:1774.0,198.0] || -> equal(sk2,sk1)**.
% 1.88/2.07 1863[3:Rew:1775.0,1651.0] || -> strictorderedP(sk1)*.
% 1.88/2.07 1886[3:MRR:1863.0,8.0] || -> .
% 1.88/2.07 2064[3:Spt:1886.0,300.5,1645.0] || equal(nil,sk2)** -> .
% 1.88/2.07 2065[3:Spt:1886.0,300.0,300.1,300.2,300.3,300.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 1.88/2.07 2079[4:Spt:471.5] || -> equal(nil,sk1)**.
% 1.88/2.07 2083[4:Rew:2079.0,12.0] || -> strictorderedP(sk1)*.
% 1.88/2.07 2167[4:MRR:2083.0,8.0] || -> .
% 1.88/2.07 2250[4:Spt:2167.0,471.5,2079.0] || equal(nil,sk1)** -> .
% 1.88/2.07 2251[4:Spt:2167.0,471.0,471.1,471.2,471.3,471.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.88/2.07 2289[5:Spt:199.0] || neq(sk2,nil)* -> .
% 1.88/2.07 2303[5:Res:1477.1,2289.0] || -> equal(nil,sk2)**.
% 1.88/2.07 2304[5:MRR:2303.0,2064.0] || -> .
% 1.88/2.07 2305[5:Spt:2304.0,199.0,2289.0] || -> neq(sk2,nil)*.
% 1.88/2.07 2306[5:Spt:2304.0,199.1] || -> singletonP(sk1)*.
% 1.88/2.07 2307[5:MRR:435.0,2306.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.88/2.07 2310[5:SpR:2307.0,1454.0] || -> strictorderedP(sk1)*.
% 1.88/2.07 2317[5:MRR:2310.0,8.0] || -> .
% 1.88/2.07 2318[2:Spt:2317.0,456.1] || -> duplicatefreeP(sk1)*.
% 1.88/2.07 2321[3:Spt:285.0] || -> ssItem(u)*.
% 1.88/2.07 2331[3:MRR:75.0,2321.0] || -> strictorderedP(cons(u,nil))*.
% 1.88/2.07 2352[3:MRR:111.1,111.0,2321.0] || -> equal(u,v) neq(u,v)*.
% 1.88/2.07 2516[4:Spt:300.5] || -> equal(nil,sk2)**.
% 1.88/2.07 2522[4:Rew:2516.0,12.0] || -> strictorderedP(sk2)*.
% 1.88/2.07 2586[4:Rew:2516.0,444.1] || segmentP(nil,sk1)* -> equal(sk2,sk1).
% 1.88/2.07 2645[4:Rew:2516.0,2586.0] || segmentP(sk2,sk1)* -> equal(sk2,sk1).
% 1.88/2.07 2646[4:MRR:2645.0,198.0] || -> equal(sk2,sk1)**.
% 1.88/2.07 2734[4:Rew:2646.0,2522.0] || -> strictorderedP(sk1)*.
% 1.88/2.07 2757[4:MRR:2734.0,8.0] || -> .
% 1.88/2.07 2935[4:Spt:2757.0,300.5,2516.0] || equal(nil,sk2)** -> .
% 1.88/2.07 2936[4:Spt:2757.0,300.0,300.1,300.2,300.3,300.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 1.88/2.07 2950[5:Spt:471.5] || -> equal(nil,sk1)**.
% 1.88/2.07 2954[5:Rew:2950.0,12.0] || -> strictorderedP(sk1)*.
% 1.88/2.07 3038[5:MRR:2954.0,8.0] || -> .
% 1.88/2.07 3121[5:Spt:3038.0,471.5,2950.0] || equal(nil,sk1)** -> .
% 1.88/2.07 3122[5:Spt:3038.0,471.0,471.1,471.2,471.3,471.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.88/2.07 3161[6:Spt:199.0] || neq(sk2,nil)* -> .
% 1.88/2.07 3174[6:Res:2352.1,3161.0] || -> equal(nil,sk2)**.
% 1.88/2.07 3175[6:MRR:3174.0,2935.0] || -> .
% 1.88/2.07 3176[6:Spt:3175.0,199.0,3161.0] || -> neq(sk2,nil)*.
% 1.88/2.07 3177[6:Spt:3175.0,199.1] || -> singletonP(sk1)*.
% 1.88/2.07 3178[6:MRR:435.0,3177.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.88/2.07 3183[6:SpR:3178.0,2331.0] || -> strictorderedP(sk1)*.
% 1.88/2.07 3188[6:MRR:3183.0,8.0] || -> .
% 1.88/2.07 3190[3:Spt:3188.0,285.1] || -> duplicatefreeP(sk2)*.
% 1.88/2.07 3191[4:Spt:300.5] || -> equal(nil,sk2)**.
% 1.88/2.07 3197[4:Rew:3191.0,12.0] || -> strictorderedP(sk2)*.
% 1.88/2.07 3262[4:Rew:3191.0,444.1] || segmentP(nil,sk1)* -> equal(sk2,sk1).
% 1.89/2.09 3318[4:Rew:3191.0,3262.0] || segmentP(sk2,sk1)* -> equal(sk2,sk1).
% 1.89/2.09 3319[4:MRR:3318.0,198.0] || -> equal(sk2,sk1)**.
% 1.89/2.09 3413[4:Rew:3319.0,3197.0] || -> strictorderedP(sk1)*.
% 1.89/2.09 3433[4:MRR:3413.0,8.0] || -> .
% 1.89/2.09 3626[4:Spt:3433.0,300.5,3191.0] || equal(nil,sk2)** -> .
% 1.89/2.09 3627[4:Spt:3433.0,300.0,300.1,300.2,300.3,300.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 1.89/2.09 3642[5:Spt:471.5] || -> equal(nil,sk1)**.
% 1.89/2.09 3646[5:Rew:3642.0,12.0] || -> strictorderedP(sk1)*.
% 1.89/2.09 3731[5:MRR:3646.0,8.0] || -> .
% 1.89/2.09 3813[5:Spt:3731.0,471.5,3642.0] || equal(nil,sk1)** -> .
% 1.89/2.09 3814[5:Spt:3731.0,471.0,471.1,471.2,471.3,471.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.89/2.09 3836[6:Spt:393.0] || -> totalorderedP(sk1)*.
% 1.89/2.09 3842[7:Spt:450.0] || -> cyclefreeP(sk1)*.
% 1.89/2.09 3846[8:Spt:392.0] || -> strictorderP(sk1)*.
% 1.89/2.09 3848[9:Spt:391.0] || -> totalorderP(sk1)*.
% 1.89/2.09 3850[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.09 3903[10:Res:339.2,3850.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.09 3904[10:SSi:3903.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.09 3905[10:MRR:3904.0,3626.0] || -> .
% 1.89/2.09 3906[10:Spt:3905.0,199.0,3850.0] || -> neq(sk2,nil)*.
% 1.89/2.09 3907[10:Spt:3905.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.09 3908[10:MRR:435.0,3907.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.09 3911[10:SpR:3908.0,75.1] ssItem(skaf44(sk1)) || -> strictorderedP(sk1)*.
% 1.89/2.09 3919[10:SSi:3911.0,56.0,1.0,2318.0,3836.0,3842.0,3846.0,3848.0,3907.0] || -> strictorderedP(sk1)*.
% 1.89/2.09 3920[10:MRR:3919.0,8.0] || -> .
% 1.89/2.09 3921[9:Spt:3920.0,391.0,3848.0] || totalorderP(sk1)* -> .
% 1.89/2.09 3922[9:Spt:3920.0,391.1] || -> equal(app(app(skaf56(sk1),cons(skaf54(sk1),skaf57(sk1))),cons(skaf55(sk1),skaf58(sk1))),sk1)**.
% 1.89/2.09 3926[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.09 3927[10:Res:339.2,3926.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.09 3928[10:SSi:3927.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.09 3929[10:MRR:3928.0,3626.0] || -> .
% 1.89/2.09 3930[10:Spt:3929.0,199.0,3926.0] || -> neq(sk2,nil)*.
% 1.89/2.09 3931[10:Spt:3929.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.09 3932[10:MRR:435.0,3931.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.09 3940[10:SpR:3932.0,78.1] ssItem(skaf44(sk1)) || -> totalorderP(sk1)*.
% 1.89/2.09 3947[10:SSi:3940.0,56.0,1.0,2318.0,3836.0,3842.0,3846.0,3931.0] || -> totalorderP(sk1)*.
% 1.89/2.09 3948[10:MRR:3947.0,3921.0] || -> .
% 1.89/2.09 3949[8:Spt:3948.0,392.0,3846.0] || strictorderP(sk1)* -> .
% 1.89/2.09 3950[8:Spt:3948.0,392.1] || -> equal(app(app(skaf61(sk1),cons(skaf59(sk1),skaf62(sk1))),cons(skaf60(sk1),skaf63(sk1))),sk1)**.
% 1.89/2.09 3954[9:Spt:391.0] || -> totalorderP(sk1)*.
% 1.89/2.09 3955[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.09 3956[10:Res:339.2,3955.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.09 3957[10:SSi:3956.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.09 3958[10:MRR:3957.0,3626.0] || -> .
% 1.89/2.09 3959[10:Spt:3958.0,199.0,3955.0] || -> neq(sk2,nil)*.
% 1.89/2.09 3960[10:Spt:3958.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.09 3961[10:MRR:435.0,3960.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.09 3969[10:SpR:3961.0,77.1] ssItem(skaf44(sk1)) || -> strictorderP(sk1)*.
% 1.89/2.09 3977[10:SSi:3969.0,56.0,1.0,2318.0,3836.0,3842.0,3954.0,3960.0] || -> strictorderP(sk1)*.
% 1.89/2.09 3978[10:MRR:3977.0,3949.0] || -> .
% 1.89/2.09 3979[9:Spt:3978.0,391.0,3954.0] || totalorderP(sk1)* -> .
% 1.89/2.09 3980[9:Spt:3978.0,391.1] || -> equal(app(app(skaf56(sk1),cons(skaf54(sk1),skaf57(sk1))),cons(skaf55(sk1),skaf58(sk1))),sk1)**.
% 1.89/2.09 3984[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.09 3985[10:Res:339.2,3984.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.09 3986[10:SSi:3985.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.09 3987[10:MRR:3986.0,3626.0] || -> .
% 1.89/2.09 3988[10:Spt:3987.0,199.0,3984.0] || -> neq(sk2,nil)*.
% 1.89/2.09 3989[10:Spt:3987.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.09 3990[10:MRR:435.0,3989.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.09 3996[10:SpR:3990.0,78.1] ssItem(skaf44(sk1)) || -> totalorderP(sk1)*.
% 1.89/2.09 4005[10:SSi:3996.0,56.0,1.0,2318.0,3836.0,3842.0,3989.0] || -> totalorderP(sk1)*.
% 1.89/2.09 4006[10:MRR:4005.0,3979.0] || -> .
% 1.89/2.09 4007[7:Spt:4006.0,450.0,3842.0] || cyclefreeP(sk1)* -> .
% 1.89/2.09 4008[7:Spt:4006.0,450.1] || -> leq(skaf50(sk1),skaf49(sk1))*.
% 1.89/2.09 4011[8:Spt:391.0] || -> totalorderP(sk1)*.
% 1.89/2.09 4012[9:Spt:392.0] || -> strictorderP(sk1)*.
% 1.89/2.09 4015[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.09 4016[10:Res:339.2,4015.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.09 4017[10:SSi:4016.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.09 4018[10:MRR:4017.0,3626.0] || -> .
% 1.89/2.09 4019[10:Spt:4018.0,199.0,4015.0] || -> neq(sk2,nil)*.
% 1.89/2.09 4020[10:Spt:4018.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.09 4021[10:MRR:435.0,4020.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.09 4029[10:SpR:4021.0,79.1] ssItem(skaf44(sk1)) || -> cyclefreeP(sk1)*.
% 1.89/2.09 4035[10:SSi:4029.0,56.0,1.0,2318.0,3836.0,4011.0,4012.0,4020.0] || -> cyclefreeP(sk1)*.
% 1.89/2.09 4036[10:MRR:4035.0,4007.0] || -> .
% 1.89/2.09 4037[9:Spt:4036.0,392.0,4012.0] || strictorderP(sk1)* -> .
% 1.89/2.09 4038[9:Spt:4036.0,392.1] || -> equal(app(app(skaf61(sk1),cons(skaf59(sk1),skaf62(sk1))),cons(skaf60(sk1),skaf63(sk1))),sk1)**.
% 1.89/2.09 4044[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.09 4045[10:Res:339.2,4044.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.09 4046[10:SSi:4045.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.09 4047[10:MRR:4046.0,3626.0] || -> .
% 1.89/2.09 4048[10:Spt:4047.0,199.0,4044.0] || -> neq(sk2,nil)*.
% 1.89/2.09 4049[10:Spt:4047.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.09 4050[10:MRR:435.0,4049.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.09 4059[10:SpR:4050.0,79.1] ssItem(skaf44(sk1)) || -> cyclefreeP(sk1)*.
% 1.89/2.09 4067[10:SSi:4059.0,56.0,1.0,2318.0,3836.0,4011.0,4049.0] || -> cyclefreeP(sk1)*.
% 1.89/2.09 4068[10:MRR:4067.0,4007.0] || -> .
% 1.89/2.09 4069[8:Spt:4068.0,391.0,4011.0] || totalorderP(sk1)* -> .
% 1.89/2.09 4070[8:Spt:4068.0,391.1] || -> equal(app(app(skaf56(sk1),cons(skaf54(sk1),skaf57(sk1))),cons(skaf55(sk1),skaf58(sk1))),sk1)**.
% 1.89/2.09 4076[9:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.09 4077[9:Res:339.2,4076.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.09 4078[9:SSi:4077.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.09 4079[9:MRR:4078.0,3626.0] || -> .
% 1.89/2.09 4080[9:Spt:4079.0,199.0,4076.0] || -> neq(sk2,nil)*.
% 1.89/2.09 4081[9:Spt:4079.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.09 4082[9:MRR:435.0,4081.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.09 4094[9:SpR:4082.0,79.1] ssItem(skaf44(sk1)) || -> cyclefreeP(sk1)*.
% 1.89/2.09 4113[9:SSi:4094.0,56.0,1.0,2318.0,3836.0,4081.0] || -> cyclefreeP(sk1)*.
% 1.89/2.09 4114[9:MRR:4113.0,4007.0] || -> .
% 1.89/2.09 4118[6:Spt:4114.0,393.0,3836.0] || totalorderedP(sk1)* -> .
% 1.89/2.09 4119[6:Spt:4114.0,393.1] || -> equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1)**.
% 1.89/2.09 4124[7:Spt:451.0] || -> cyclefreeP(sk1)*.
% 1.89/2.09 4128[8:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.09 4129[8:Res:339.2,4128.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.09 4130[8:SSi:4129.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.09 4131[8:MRR:4130.0,3626.0] || -> .
% 1.89/2.09 4132[8:Spt:4131.0,199.0,4128.0] || -> neq(sk2,nil)*.
% 1.89/2.09 4133[8:Spt:4131.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.09 4134[8:MRR:435.0,4133.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.09 4142[8:SpR:4134.0,76.1] ssItem(skaf44(sk1)) || -> totalorderedP(sk1)*.
% 1.89/2.09 4160[8:SSi:4142.0,56.0,1.0,2318.0,4124.0,4133.0] || -> totalorderedP(sk1)*.
% 1.89/2.09 4161[8:MRR:4160.0,4118.0] || -> .
% 1.89/2.09 4169[7:Spt:4161.0,451.0,4124.0] || cyclefreeP(sk1)* -> .
% 1.89/2.09 4170[7:Spt:4161.0,451.1] || -> leq(skaf49(sk1),skaf50(sk1))*.
% 1.89/2.09 4176[8:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.09 4177[8:Res:339.2,4176.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.09 4178[8:SSi:4177.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.09 4179[8:MRR:4178.0,3626.0] || -> .
% 1.89/2.09 4180[8:Spt:4179.0,199.0,4176.0] || -> neq(sk2,nil)*.
% 1.89/2.09 4181[8:Spt:4179.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.09 4182[8:MRR:435.0,4181.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.09 4194[8:SpR:4182.0,79.1] ssItem(skaf44(sk1)) || -> cyclefreeP(sk1)*.
% 1.89/2.09 4229[8:SSi:4194.0,56.0,1.0,2318.0,4181.0] || -> cyclefreeP(sk1)*.
% 1.89/2.09 4230[8:MRR:4229.0,4169.0] || -> .
% 1.89/2.09 % SZS output end Refutation
% 1.89/2.09 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause47 clause66 clause67 clause68 clause69 clause70 clause72 clause80 clause87 clause88 clause100 clause101 clause102 clause164 clause165 clause166 clause177
% 1.89/2.09
%------------------------------------------------------------------------------