TSTP Solution File: SWC277-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC277-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:00 EDT 2022
% Result : Unsatisfiable 1.81s 2.02s
% Output : Refutation 1.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC277-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.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 : Sun Jun 12 02:15:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.81/2.02
% 1.81/2.02 SPASS V 3.9
% 1.81/2.02 SPASS beiseite: Proof found.
% 1.81/2.02 % SZS status Theorem
% 1.81/2.02 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.81/2.02 SPASS derived 2973 clauses, backtracked 3072 clauses, performed 87 splits and kept 5156 clauses.
% 1.81/2.02 SPASS allocated 78392 KBytes.
% 1.81/2.02 SPASS spent 0:00:01.67 on the problem.
% 1.81/2.02 0:00:00.04 for the input.
% 1.81/2.02 0:00:00.00 for the FLOTTER CNF translation.
% 1.81/2.02 0:00:00.01 for inferences.
% 1.81/2.02 0:00:00.02 for the backtracking.
% 1.81/2.02 0:00:01.42 for the reduction.
% 1.81/2.02
% 1.81/2.02
% 1.81/2.02 Here is a proof with depth 2, length 252 :
% 1.81/2.02 % SZS output start Refutation
% 1.81/2.02 1[0:Inp] || -> ssList(sk1)*.
% 1.81/2.02 2[0:Inp] || -> ssList(sk2)*.
% 1.81/2.02 5[0:Inp] || -> equal(sk4,sk2)**.
% 1.81/2.02 6[0:Inp] || -> equal(sk3,sk1)**.
% 1.81/2.02 7[0:Inp] || -> segmentP(sk4,sk3)*.
% 1.81/2.02 8[0:Inp] || totalorderedP(sk1)* -> .
% 1.81/2.02 9[0:Inp] || neq(sk4,nil)* -> singletonP(sk3).
% 1.81/2.02 10[0:Inp] || -> equalelemsP(nil)*.
% 1.81/2.02 11[0:Inp] || -> duplicatefreeP(nil)*.
% 1.81/2.02 12[0:Inp] || -> strictorderedP(nil)*.
% 1.81/2.02 13[0:Inp] || -> totalorderedP(nil)*.
% 1.81/2.02 14[0:Inp] || -> strictorderP(nil)*.
% 1.81/2.02 15[0:Inp] || -> totalorderP(nil)*.
% 1.81/2.02 16[0:Inp] || -> cyclefreeP(nil)*.
% 1.81/2.02 17[0:Inp] || -> ssList(nil)*.
% 1.81/2.02 56[0:Inp] || -> ssItem(skaf44(u))*.
% 1.81/2.02 76[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 1.81/2.02 77[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 1.81/2.02 78[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 1.81/2.02 79[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 1.81/2.02 81[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 1.81/2.02 89[0:Inp] ssList(u) || segmentP(nil,u)* -> equal(nil,u).
% 1.81/2.02 96[0:Inp] ssList(u) || -> cyclefreeP(u) leq(skaf50(u),skaf49(u))*.
% 1.81/2.02 97[0:Inp] ssList(u) || -> cyclefreeP(u) leq(skaf49(u),skaf50(u))*.
% 1.81/2.02 109[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*.
% 1.81/2.02 110[0:Inp] ssList(u) singletonP(u) || -> equal(cons(skaf44(u),nil),u)**.
% 1.81/2.02 111[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 1.81/2.02 172[0:Inp] ssList(u) || -> strictorderedP(u) equal(app(app(skaf71(u),cons(skaf69(u),skaf72(u))),cons(skaf70(u),skaf73(u))),u)**.
% 1.81/2.02 174[0:Inp] ssList(u) || -> strictorderP(u) equal(app(app(skaf61(u),cons(skaf59(u),skaf62(u))),cons(skaf60(u),skaf63(u))),u)**.
% 1.81/2.02 175[0:Inp] ssList(u) || -> totalorderP(u) equal(app(app(skaf56(u),cons(skaf54(u),skaf57(u))),cons(skaf55(u),skaf58(u))),u)**.
% 1.81/2.02 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.81/2.02 196[0:Rew:6.0,7.0] || -> segmentP(sk4,sk1)*.
% 1.81/2.02 198[0:Rew:5.0,196.0] || -> segmentP(sk2,sk1)*.
% 1.81/2.02 199[0:Rew:6.0,9.1,5.0,9.0] || neq(sk2,nil)* -> singletonP(sk1).
% 1.81/2.02 285[0:Res:2.0,81.0] || -> ssItem(u)* duplicatefreeP(sk2)*.
% 1.81/2.02 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.81/2.02 339[0:Res:2.0,109.1] ssList(u) || -> equal(sk2,u) neq(sk2,u)*.
% 1.81/2.02 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.81/2.02 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.81/2.02 394[0:Res:1.0,172.0] || -> strictorderedP(sk1) equal(app(app(skaf71(sk1),cons(skaf69(sk1),skaf72(sk1))),cons(skaf70(sk1),skaf73(sk1))),sk1)**.
% 1.81/2.02 435[0:Res:1.0,110.1] singletonP(sk1) || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.81/2.02 444[0:Res:1.0,89.0] || segmentP(nil,sk1)* -> equal(nil,sk1).
% 1.81/2.02 450[0:Res:1.0,96.0] || -> cyclefreeP(sk1) leq(skaf50(sk1),skaf49(sk1))*.
% 1.81/2.02 451[0:Res:1.0,97.0] || -> cyclefreeP(sk1) leq(skaf49(sk1),skaf50(sk1))*.
% 1.81/2.02 456[0:Res:1.0,81.0] || -> ssItem(u)* duplicatefreeP(sk1)*.
% 1.81/2.02 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.81/2.02 553[1:Spt:81.1] || -> ssItem(u)*.
% 1.81/2.02 562[1:MRR:76.0,553.0] || -> totalorderedP(cons(u,nil))*.
% 1.81/2.02 584[1:MRR:111.1,111.0,553.0] || -> equal(u,v) neq(u,v)*.
% 1.81/2.02 756[2:Spt:300.5] || -> equal(nil,sk2)**.
% 1.81/2.02 802[2:Rew:756.0,444.1] || segmentP(nil,sk1)* -> equal(sk2,sk1).
% 1.81/2.02 816[2:Rew:756.0,13.0] || -> totalorderedP(sk2)*.
% 1.81/2.02 890[2:Rew:756.0,802.0] || segmentP(sk2,sk1)* -> equal(sk2,sk1).
% 1.81/2.02 891[2:MRR:890.0,198.0] || -> equal(sk2,sk1)**.
% 1.81/2.02 977[2:Rew:891.0,816.0] || -> totalorderedP(sk1)*.
% 1.81/2.02 997[2:MRR:977.0,8.0] || -> .
% 1.81/2.02 1173[2:Spt:997.0,300.5,756.0] || equal(nil,sk2)** -> .
% 1.81/2.02 1174[2:Spt:997.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.81/2.02 1188[3:Spt:471.5] || -> equal(nil,sk1)**.
% 1.81/2.02 1193[3:Rew:1188.0,13.0] || -> totalorderedP(sk1)*.
% 1.81/2.02 1279[3:MRR:1193.0,8.0] || -> .
% 1.81/2.02 1359[3:Spt:1279.0,471.5,1188.0] || equal(nil,sk1)** -> .
% 1.81/2.02 1360[3:Spt:1279.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.81/2.02 1396[4:Spt:199.0] || neq(sk2,nil)* -> .
% 1.81/2.02 1412[4:Res:584.1,1396.0] || -> equal(nil,sk2)**.
% 1.81/2.02 1413[4:MRR:1412.0,1173.0] || -> .
% 1.81/2.02 1414[4:Spt:1413.0,199.0,1396.0] || -> neq(sk2,nil)*.
% 1.81/2.02 1415[4:Spt:1413.0,199.1] || -> singletonP(sk1)*.
% 1.81/2.02 1416[4:MRR:435.0,1415.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.81/2.02 1420[4:SpR:1416.0,562.0] || -> totalorderedP(sk1)*.
% 1.81/2.02 1425[4:MRR:1420.0,8.0] || -> .
% 1.81/2.02 1428[1:Spt:1425.0,81.0,81.2] ssList(u) || -> duplicatefreeP(u)*.
% 1.81/2.02 1446[2:Spt:456.0] || -> ssItem(u)*.
% 1.81/2.02 1453[2:MRR:76.0,1446.0] || -> totalorderedP(cons(u,nil))*.
% 1.81/2.02 1475[2:MRR:111.1,111.0,1446.0] || -> equal(u,v) neq(u,v)*.
% 1.81/2.02 1643[3:Spt:300.5] || -> equal(nil,sk2)**.
% 1.81/2.02 1648[3:Rew:1643.0,13.0] || -> totalorderedP(sk2)*.
% 1.81/2.02 1713[3:Rew:1643.0,444.1] || segmentP(nil,sk1)* -> equal(sk2,sk1).
% 1.81/2.02 1772[3:Rew:1643.0,1713.0] || segmentP(sk2,sk1)* -> equal(sk2,sk1).
% 1.81/2.02 1773[3:MRR:1772.0,198.0] || -> equal(sk2,sk1)**.
% 1.81/2.02 1860[3:Rew:1773.0,1648.0] || -> totalorderedP(sk1)*.
% 1.81/2.02 1882[3:MRR:1860.0,8.0] || -> .
% 1.81/2.02 2062[3:Spt:1882.0,300.5,1643.0] || equal(nil,sk2)** -> .
% 1.81/2.02 2063[3:Spt:1882.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.81/2.02 2077[4:Spt:471.5] || -> equal(nil,sk1)**.
% 1.81/2.02 2082[4:Rew:2077.0,13.0] || -> totalorderedP(sk1)*.
% 1.81/2.02 2167[4:MRR:2082.0,8.0] || -> .
% 1.81/2.02 2247[4:Spt:2167.0,471.5,2077.0] || equal(nil,sk1)** -> .
% 1.81/2.02 2248[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.81/2.02 2285[5:Spt:199.0] || neq(sk2,nil)* -> .
% 1.81/2.02 2299[5:Res:1475.1,2285.0] || -> equal(nil,sk2)**.
% 1.81/2.02 2300[5:MRR:2299.0,2062.0] || -> .
% 1.81/2.02 2301[5:Spt:2300.0,199.0,2285.0] || -> neq(sk2,nil)*.
% 1.81/2.02 2302[5:Spt:2300.0,199.1] || -> singletonP(sk1)*.
% 1.81/2.02 2303[5:MRR:435.0,2302.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.81/2.02 2307[5:SpR:2303.0,1453.0] || -> totalorderedP(sk1)*.
% 1.81/2.02 2313[5:MRR:2307.0,8.0] || -> .
% 1.81/2.02 2314[2:Spt:2313.0,456.1] || -> duplicatefreeP(sk1)*.
% 1.81/2.02 2317[3:Spt:285.0] || -> ssItem(u)*.
% 1.81/2.02 2326[3:MRR:76.0,2317.0] || -> totalorderedP(cons(u,nil))*.
% 1.81/2.02 2348[3:MRR:111.1,111.0,2317.0] || -> equal(u,v) neq(u,v)*.
% 1.81/2.02 2512[4:Spt:300.5] || -> equal(nil,sk2)**.
% 1.81/2.02 2517[4:Rew:2512.0,13.0] || -> totalorderedP(sk2)*.
% 1.81/2.02 2582[4:Rew:2512.0,444.1] || segmentP(nil,sk1)* -> equal(sk2,sk1).
% 1.81/2.02 2641[4:Rew:2512.0,2582.0] || segmentP(sk2,sk1)* -> equal(sk2,sk1).
% 1.81/2.02 2642[4:MRR:2641.0,198.0] || -> equal(sk2,sk1)**.
% 1.81/2.02 2729[4:Rew:2642.0,2517.0] || -> totalorderedP(sk1)*.
% 1.81/2.02 2751[4:MRR:2729.0,8.0] || -> .
% 1.81/2.02 2931[4:Spt:2751.0,300.5,2512.0] || equal(nil,sk2)** -> .
% 1.81/2.02 2932[4:Spt:2751.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.81/2.02 2946[5:Spt:471.5] || -> equal(nil,sk1)**.
% 1.81/2.02 2951[5:Rew:2946.0,13.0] || -> totalorderedP(sk1)*.
% 1.81/2.02 3036[5:MRR:2951.0,8.0] || -> .
% 1.81/2.02 3116[5:Spt:3036.0,471.5,2946.0] || equal(nil,sk1)** -> .
% 1.81/2.02 3117[5:Spt:3036.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.81/2.02 3155[6:Spt:199.0] || neq(sk2,nil)* -> .
% 1.81/2.02 3168[6:Res:2348.1,3155.0] || -> equal(nil,sk2)**.
% 1.81/2.02 3169[6:MRR:3168.0,2931.0] || -> .
% 1.81/2.02 3170[6:Spt:3169.0,199.0,3155.0] || -> neq(sk2,nil)*.
% 1.81/2.02 3171[6:Spt:3169.0,199.1] || -> singletonP(sk1)*.
% 1.81/2.02 3172[6:MRR:435.0,3171.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.81/2.02 3176[6:SpR:3172.0,2326.0] || -> totalorderedP(sk1)*.
% 1.81/2.02 3182[6:MRR:3176.0,8.0] || -> .
% 1.81/2.02 3184[3:Spt:3182.0,285.1] || -> duplicatefreeP(sk2)*.
% 1.81/2.02 3185[4:Spt:300.5] || -> equal(nil,sk2)**.
% 1.81/2.02 3190[4:Rew:3185.0,13.0] || -> totalorderedP(sk2)*.
% 1.81/2.02 3256[4:Rew:3185.0,444.1] || segmentP(nil,sk1)* -> equal(sk2,sk1).
% 1.81/2.02 3312[4:Rew:3185.0,3256.0] || segmentP(sk2,sk1)* -> equal(sk2,sk1).
% 1.89/2.05 3313[4:MRR:3312.0,198.0] || -> equal(sk2,sk1)**.
% 1.89/2.05 3406[4:Rew:3313.0,3190.0] || -> totalorderedP(sk1)*.
% 1.89/2.05 3425[4:MRR:3406.0,8.0] || -> .
% 1.89/2.05 3620[4:Spt:3425.0,300.5,3185.0] || equal(nil,sk2)** -> .
% 1.89/2.05 3621[4:Spt:3425.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.05 3636[5:Spt:471.5] || -> equal(nil,sk1)**.
% 1.89/2.05 3641[5:Rew:3636.0,13.0] || -> totalorderedP(sk1)*.
% 1.89/2.05 3727[5:MRR:3641.0,8.0] || -> .
% 1.89/2.05 3806[5:Spt:3727.0,471.5,3636.0] || equal(nil,sk1)** -> .
% 1.89/2.05 3807[5:Spt:3727.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.05 3829[6:Spt:394.0] || -> strictorderedP(sk1)*.
% 1.89/2.05 3834[7:Spt:450.0] || -> cyclefreeP(sk1)*.
% 1.89/2.05 3838[8:Spt:392.0] || -> strictorderP(sk1)*.
% 1.89/2.05 3839[9:Spt:391.0] || -> totalorderP(sk1)*.
% 1.89/2.05 3842[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.05 3895[10:Res:339.2,3842.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.05 3896[10:SSi:3895.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.05 3897[10:MRR:3896.0,3620.0] || -> .
% 1.89/2.05 3898[10:Spt:3897.0,199.0,3842.0] || -> neq(sk2,nil)*.
% 1.89/2.05 3899[10:Spt:3897.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.05 3900[10:MRR:435.0,3899.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.05 3904[10:SpR:3900.0,76.1] ssItem(skaf44(sk1)) || -> totalorderedP(sk1)*.
% 1.89/2.05 3911[10:SSi:3904.0,56.0,1.0,2314.0,3829.0,3834.0,3838.0,3839.0,3899.0] || -> totalorderedP(sk1)*.
% 1.89/2.05 3912[10:MRR:3911.0,8.0] || -> .
% 1.89/2.05 3913[9:Spt:3912.0,391.0,3839.0] || totalorderP(sk1)* -> .
% 1.89/2.05 3914[9:Spt:3912.0,391.1] || -> equal(app(app(skaf56(sk1),cons(skaf54(sk1),skaf57(sk1))),cons(skaf55(sk1),skaf58(sk1))),sk1)**.
% 1.89/2.05 3918[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.05 3919[10:Res:339.2,3918.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.05 3920[10:SSi:3919.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.05 3921[10:MRR:3920.0,3620.0] || -> .
% 1.89/2.05 3922[10:Spt:3921.0,199.0,3918.0] || -> neq(sk2,nil)*.
% 1.89/2.05 3923[10:Spt:3921.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.05 3924[10:MRR:435.0,3923.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.05 3932[10:SpR:3924.0,78.1] ssItem(skaf44(sk1)) || -> totalorderP(sk1)*.
% 1.89/2.05 3939[10:SSi:3932.0,56.0,1.0,2314.0,3829.0,3834.0,3838.0,3923.0] || -> totalorderP(sk1)*.
% 1.89/2.05 3940[10:MRR:3939.0,3913.0] || -> .
% 1.89/2.05 3941[8:Spt:3940.0,392.0,3838.0] || strictorderP(sk1)* -> .
% 1.89/2.05 3942[8:Spt:3940.0,392.1] || -> equal(app(app(skaf61(sk1),cons(skaf59(sk1),skaf62(sk1))),cons(skaf60(sk1),skaf63(sk1))),sk1)**.
% 1.89/2.05 3946[9:Spt:391.0] || -> totalorderP(sk1)*.
% 1.89/2.05 3948[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.05 3949[10:Res:339.2,3948.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.05 3950[10:SSi:3949.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.05 3951[10:MRR:3950.0,3620.0] || -> .
% 1.89/2.05 3952[10:Spt:3951.0,199.0,3948.0] || -> neq(sk2,nil)*.
% 1.89/2.05 3953[10:Spt:3951.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.05 3954[10:MRR:435.0,3953.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.05 3962[10:SpR:3954.0,77.1] ssItem(skaf44(sk1)) || -> strictorderP(sk1)*.
% 1.89/2.05 3970[10:SSi:3962.0,56.0,1.0,2314.0,3829.0,3834.0,3946.0,3953.0] || -> strictorderP(sk1)*.
% 1.89/2.05 3971[10:MRR:3970.0,3941.0] || -> .
% 1.89/2.05 3972[9:Spt:3971.0,391.0,3946.0] || totalorderP(sk1)* -> .
% 1.89/2.05 3973[9:Spt:3971.0,391.1] || -> equal(app(app(skaf56(sk1),cons(skaf54(sk1),skaf57(sk1))),cons(skaf55(sk1),skaf58(sk1))),sk1)**.
% 1.89/2.05 3977[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.05 3978[10:Res:339.2,3977.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.05 3979[10:SSi:3978.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.05 3980[10:MRR:3979.0,3620.0] || -> .
% 1.89/2.05 3981[10:Spt:3980.0,199.0,3977.0] || -> neq(sk2,nil)*.
% 1.89/2.05 3982[10:Spt:3980.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.05 3983[10:MRR:435.0,3982.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.05 3989[10:SpR:3983.0,78.1] ssItem(skaf44(sk1)) || -> totalorderP(sk1)*.
% 1.89/2.05 3998[10:SSi:3989.0,56.0,1.0,2314.0,3829.0,3834.0,3982.0] || -> totalorderP(sk1)*.
% 1.89/2.05 3999[10:MRR:3998.0,3972.0] || -> .
% 1.89/2.05 4000[7:Spt:3999.0,450.0,3834.0] || cyclefreeP(sk1)* -> .
% 1.89/2.05 4001[7:Spt:3999.0,450.1] || -> leq(skaf50(sk1),skaf49(sk1))*.
% 1.89/2.05 4004[8:Spt:391.0] || -> totalorderP(sk1)*.
% 1.89/2.05 4006[9:Spt:392.0] || -> strictorderP(sk1)*.
% 1.89/2.05 4008[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.05 4009[10:Res:339.2,4008.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.05 4010[10:SSi:4009.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.05 4011[10:MRR:4010.0,3620.0] || -> .
% 1.89/2.05 4012[10:Spt:4011.0,199.0,4008.0] || -> neq(sk2,nil)*.
% 1.89/2.05 4013[10:Spt:4011.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.05 4014[10:MRR:435.0,4013.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.05 4022[10:SpR:4014.0,79.1] ssItem(skaf44(sk1)) || -> cyclefreeP(sk1)*.
% 1.89/2.05 4028[10:SSi:4022.0,56.0,1.0,2314.0,3829.0,4004.0,4006.0,4013.0] || -> cyclefreeP(sk1)*.
% 1.89/2.05 4029[10:MRR:4028.0,4000.0] || -> .
% 1.89/2.05 4030[9:Spt:4029.0,392.0,4006.0] || strictorderP(sk1)* -> .
% 1.89/2.05 4031[9:Spt:4029.0,392.1] || -> equal(app(app(skaf61(sk1),cons(skaf59(sk1),skaf62(sk1))),cons(skaf60(sk1),skaf63(sk1))),sk1)**.
% 1.89/2.05 4037[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.05 4038[10:Res:339.2,4037.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.05 4039[10:SSi:4038.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.05 4040[10:MRR:4039.0,3620.0] || -> .
% 1.89/2.05 4041[10:Spt:4040.0,199.0,4037.0] || -> neq(sk2,nil)*.
% 1.89/2.05 4042[10:Spt:4040.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.05 4043[10:MRR:435.0,4042.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.05 4052[10:SpR:4043.0,79.1] ssItem(skaf44(sk1)) || -> cyclefreeP(sk1)*.
% 1.89/2.05 4060[10:SSi:4052.0,56.0,1.0,2314.0,3829.0,4004.0,4042.0] || -> cyclefreeP(sk1)*.
% 1.89/2.05 4061[10:MRR:4060.0,4000.0] || -> .
% 1.89/2.05 4062[8:Spt:4061.0,391.0,4004.0] || totalorderP(sk1)* -> .
% 1.89/2.05 4063[8:Spt:4061.0,391.1] || -> equal(app(app(skaf56(sk1),cons(skaf54(sk1),skaf57(sk1))),cons(skaf55(sk1),skaf58(sk1))),sk1)**.
% 1.89/2.05 4069[9:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.05 4070[9:Res:339.2,4069.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.05 4071[9:SSi:4070.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.05 4072[9:MRR:4071.0,3620.0] || -> .
% 1.89/2.05 4073[9:Spt:4072.0,199.0,4069.0] || -> neq(sk2,nil)*.
% 1.89/2.05 4074[9:Spt:4072.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.05 4075[9:MRR:435.0,4074.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.05 4086[9:SpR:4075.0,79.1] ssItem(skaf44(sk1)) || -> cyclefreeP(sk1)*.
% 1.89/2.05 4105[9:SSi:4086.0,56.0,1.0,2314.0,3829.0,4074.0] || -> cyclefreeP(sk1)*.
% 1.89/2.05 4106[9:MRR:4105.0,4000.0] || -> .
% 1.89/2.05 4110[6:Spt:4106.0,394.0,3829.0] || strictorderedP(sk1)* -> .
% 1.89/2.05 4111[6:Spt:4106.0,394.1] || -> equal(app(app(skaf71(sk1),cons(skaf69(sk1),skaf72(sk1))),cons(skaf70(sk1),skaf73(sk1))),sk1)**.
% 1.89/2.05 4116[7:Spt:451.0] || -> cyclefreeP(sk1)*.
% 1.89/2.05 4120[8:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.05 4121[8:Res:339.2,4120.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.05 4122[8:SSi:4121.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.05 4123[8:MRR:4122.0,3620.0] || -> .
% 1.89/2.05 4124[8:Spt:4123.0,199.0,4120.0] || -> neq(sk2,nil)*.
% 1.89/2.05 4125[8:Spt:4123.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.05 4126[8:MRR:435.0,4125.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.05 4134[8:SpR:4126.0,76.1] ssItem(skaf44(sk1)) || -> totalorderedP(sk1)*.
% 1.89/2.05 4152[8:SSi:4134.0,56.0,1.0,2314.0,4116.0,4125.0] || -> totalorderedP(sk1)*.
% 1.89/2.05 4153[8:MRR:4152.0,8.0] || -> .
% 1.89/2.05 4161[7:Spt:4153.0,451.0,4116.0] || cyclefreeP(sk1)* -> .
% 1.89/2.05 4162[7:Spt:4153.0,451.1] || -> leq(skaf49(sk1),skaf50(sk1))*.
% 1.89/2.05 4168[8:Spt:199.0] || neq(sk2,nil)* -> .
% 1.89/2.05 4169[8:Res:339.2,4168.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.89/2.05 4170[8:SSi:4169.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.89/2.05 4171[8:MRR:4170.0,3620.0] || -> .
% 1.89/2.05 4172[8:Spt:4171.0,199.0,4168.0] || -> neq(sk2,nil)*.
% 1.89/2.05 4173[8:Spt:4171.0,199.1] || -> singletonP(sk1)*.
% 1.89/2.05 4174[8:MRR:435.0,4173.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.89/2.05 4186[8:SpR:4174.0,79.1] ssItem(skaf44(sk1)) || -> cyclefreeP(sk1)*.
% 1.89/2.05 4221[8:SSi:4186.0,56.0,1.0,2314.0,4173.0] || -> cyclefreeP(sk1)*.
% 1.89/2.05 4222[8:MRR:4221.0,4161.0] || -> .
% 1.89/2.05 % SZS output end Refutation
% 1.89/2.05 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 clause67 clause68 clause69 clause70 clause72 clause80 clause87 clause88 clause100 clause101 clause102 clause163 clause165 clause166 clause177
% 1.89/2.05
%------------------------------------------------------------------------------