TSTP Solution File: SWC348-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC348-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.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:28 EDT 2022
% Result : Unsatisfiable 1.75s 1.94s
% Output : Refutation 1.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC348-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n008.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:53:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.75/1.94
% 1.75/1.94 SPASS V 3.9
% 1.75/1.94 SPASS beiseite: Proof found.
% 1.75/1.94 % SZS status Theorem
% 1.75/1.94 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.75/1.94 SPASS derived 2977 clauses, backtracked 3073 clauses, performed 87 splits and kept 5161 clauses.
% 1.75/1.94 SPASS allocated 78398 KBytes.
% 1.75/1.94 SPASS spent 0:00:01.58 on the problem.
% 1.75/1.94 0:00:00.04 for the input.
% 1.75/1.94 0:00:00.00 for the FLOTTER CNF translation.
% 1.75/1.94 0:00:00.01 for inferences.
% 1.75/1.94 0:00:00.02 for the backtracking.
% 1.75/1.94 0:00:01.33 for the reduction.
% 1.75/1.94
% 1.75/1.94
% 1.75/1.94 Here is a proof with depth 2, length 254 :
% 1.75/1.94 % SZS output start Refutation
% 1.75/1.94 1[0:Inp] || -> ssList(sk1)*.
% 1.75/1.94 2[0:Inp] || -> ssList(sk2)*.
% 1.75/1.94 5[0:Inp] || -> equal(sk4,sk2)**.
% 1.75/1.94 6[0:Inp] || -> equal(sk3,sk1)**.
% 1.75/1.94 7[0:Inp] || -> segmentP(sk4,sk3)*.
% 1.75/1.94 8[0:Inp] || neq(sk4,nil)* -> singletonP(sk3).
% 1.75/1.94 9[0:Inp] || segmentP(sk2,sk1)* strictorderedP(sk1) -> .
% 1.75/1.94 10[0:Inp] || -> equalelemsP(nil)*.
% 1.75/1.94 11[0:Inp] || -> duplicatefreeP(nil)*.
% 1.75/1.94 12[0:Inp] || -> strictorderedP(nil)*.
% 1.75/1.94 13[0:Inp] || -> totalorderedP(nil)*.
% 1.75/1.94 14[0:Inp] || -> strictorderP(nil)*.
% 1.75/1.94 15[0:Inp] || -> totalorderP(nil)*.
% 1.75/1.94 16[0:Inp] || -> cyclefreeP(nil)*.
% 1.75/1.94 17[0:Inp] || -> ssList(nil)*.
% 1.75/1.94 56[0:Inp] || -> ssItem(skaf44(u))*.
% 1.75/1.94 75[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 1.75/1.94 76[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 1.75/1.94 77[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 1.75/1.94 78[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 1.75/1.94 79[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 1.75/1.94 81[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 1.75/1.94 89[0:Inp] ssList(u) || segmentP(nil,u)* -> equal(nil,u).
% 1.75/1.94 96[0:Inp] ssList(u) || -> cyclefreeP(u) leq(skaf50(u),skaf49(u))*.
% 1.75/1.94 97[0:Inp] ssList(u) || -> cyclefreeP(u) leq(skaf49(u),skaf50(u))*.
% 1.75/1.94 109[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*.
% 1.75/1.94 110[0:Inp] ssList(u) singletonP(u) || -> equal(cons(skaf44(u),nil),u)**.
% 1.75/1.94 111[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 1.75/1.94 173[0:Inp] ssList(u) || -> totalorderedP(u) equal(app(app(skaf66(u),cons(skaf64(u),skaf67(u))),cons(skaf65(u),skaf68(u))),u)**.
% 1.75/1.94 174[0:Inp] ssList(u) || -> strictorderP(u) equal(app(app(skaf61(u),cons(skaf59(u),skaf62(u))),cons(skaf60(u),skaf63(u))),u)**.
% 1.75/1.94 175[0:Inp] ssList(u) || -> totalorderP(u) equal(app(app(skaf56(u),cons(skaf54(u),skaf57(u))),cons(skaf55(u),skaf58(u))),u)**.
% 1.75/1.94 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.75/1.94 196[0:Rew:6.0,7.0] || -> segmentP(sk4,sk1)*.
% 1.75/1.94 198[0:Rew:5.0,196.0] || -> segmentP(sk2,sk1)*.
% 1.75/1.94 199[0:Rew:6.0,8.1,5.0,8.0] || neq(sk2,nil)* -> singletonP(sk1).
% 1.75/1.94 200[0:MRR:9.0,198.0] || strictorderedP(sk1)* -> .
% 1.75/1.94 286[0:Res:2.0,81.0] || -> ssItem(u)* duplicatefreeP(sk2)*.
% 1.75/1.94 301[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.75/1.94 340[0:Res:2.0,109.1] ssList(u) || -> equal(sk2,u) neq(sk2,u)*.
% 1.75/1.94 392[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.75/1.94 393[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.75/1.94 394[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.75/1.94 436[0:Res:1.0,110.1] singletonP(sk1) || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.94 445[0:Res:1.0,89.0] || segmentP(nil,sk1)* -> equal(nil,sk1).
% 1.75/1.94 451[0:Res:1.0,96.0] || -> cyclefreeP(sk1) leq(skaf50(sk1),skaf49(sk1))*.
% 1.75/1.94 452[0:Res:1.0,97.0] || -> cyclefreeP(sk1) leq(skaf49(sk1),skaf50(sk1))*.
% 1.75/1.94 457[0:Res:1.0,81.0] || -> ssItem(u)* duplicatefreeP(sk1)*.
% 1.75/1.94 472[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.75/1.94 554[1:Spt:81.1] || -> ssItem(u)*.
% 1.75/1.94 564[1:MRR:75.0,554.0] || -> strictorderedP(cons(u,nil))*.
% 1.75/1.94 585[1:MRR:111.1,111.0,554.0] || -> equal(u,v) neq(u,v)*.
% 1.75/1.94 757[2:Spt:301.5] || -> equal(nil,sk2)**.
% 1.75/1.94 803[2:Rew:757.0,445.1] || segmentP(nil,sk1)* -> equal(sk2,sk1).
% 1.75/1.94 818[2:Rew:757.0,12.0] || -> strictorderedP(sk2)*.
% 1.75/1.94 891[2:Rew:757.0,803.0] || segmentP(sk2,sk1)* -> equal(sk2,sk1).
% 1.75/1.94 892[2:MRR:891.0,198.0] || -> equal(sk2,sk1)**.
% 1.75/1.94 979[2:Rew:892.0,818.0] || -> strictorderedP(sk1)*.
% 1.75/1.94 1000[2:MRR:979.0,200.0] || -> .
% 1.75/1.94 1174[2:Spt:1000.0,301.5,757.0] || equal(nil,sk2)** -> .
% 1.75/1.94 1175[2:Spt:1000.0,301.0,301.1,301.2,301.3,301.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 1.75/1.94 1189[3:Spt:472.5] || -> equal(nil,sk1)**.
% 1.75/1.94 1193[3:Rew:1189.0,12.0] || -> strictorderedP(sk1)*.
% 1.75/1.94 1278[3:MRR:1193.0,200.0] || -> .
% 1.75/1.94 1361[3:Spt:1278.0,472.5,1189.0] || equal(nil,sk1)** -> .
% 1.75/1.94 1362[3:Spt:1278.0,472.0,472.1,472.2,472.3,472.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.75/1.94 1399[4:Spt:199.0] || neq(sk2,nil)* -> .
% 1.75/1.94 1415[4:Res:585.1,1399.0] || -> equal(nil,sk2)**.
% 1.75/1.94 1416[4:MRR:1415.0,1174.0] || -> .
% 1.75/1.94 1417[4:Spt:1416.0,199.0,1399.0] || -> neq(sk2,nil)*.
% 1.75/1.94 1418[4:Spt:1416.0,199.1] || -> singletonP(sk1)*.
% 1.75/1.94 1419[4:MRR:436.0,1418.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.94 1424[4:SpR:1419.0,564.0] || -> strictorderedP(sk1)*.
% 1.75/1.94 1428[4:MRR:1424.0,200.0] || -> .
% 1.75/1.94 1431[1:Spt:1428.0,81.0,81.2] ssList(u) || -> duplicatefreeP(u)*.
% 1.75/1.94 1449[2:Spt:457.0] || -> ssItem(u)*.
% 1.75/1.94 1455[2:MRR:75.0,1449.0] || -> strictorderedP(cons(u,nil))*.
% 1.75/1.94 1478[2:MRR:111.1,111.0,1449.0] || -> equal(u,v) neq(u,v)*.
% 1.75/1.94 1646[3:Spt:301.5] || -> equal(nil,sk2)**.
% 1.75/1.94 1652[3:Rew:1646.0,12.0] || -> strictorderedP(sk2)*.
% 1.75/1.94 1716[3:Rew:1646.0,445.1] || segmentP(nil,sk1)* -> equal(sk2,sk1).
% 1.75/1.94 1775[3:Rew:1646.0,1716.0] || segmentP(sk2,sk1)* -> equal(sk2,sk1).
% 1.75/1.94 1776[3:MRR:1775.0,198.0] || -> equal(sk2,sk1)**.
% 1.75/1.94 1864[3:Rew:1776.0,1652.0] || -> strictorderedP(sk1)*.
% 1.75/1.94 1887[3:MRR:1864.0,200.0] || -> .
% 1.75/1.94 2065[3:Spt:1887.0,301.5,1646.0] || equal(nil,sk2)** -> .
% 1.75/1.94 2066[3:Spt:1887.0,301.0,301.1,301.2,301.3,301.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 1.75/1.94 2080[4:Spt:472.5] || -> equal(nil,sk1)**.
% 1.75/1.94 2084[4:Rew:2080.0,12.0] || -> strictorderedP(sk1)*.
% 1.75/1.94 2168[4:MRR:2084.0,200.0] || -> .
% 1.75/1.94 2251[4:Spt:2168.0,472.5,2080.0] || equal(nil,sk1)** -> .
% 1.75/1.94 2252[4:Spt:2168.0,472.0,472.1,472.2,472.3,472.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.75/1.94 2290[5:Spt:199.0] || neq(sk2,nil)* -> .
% 1.75/1.94 2304[5:Res:1478.1,2290.0] || -> equal(nil,sk2)**.
% 1.75/1.94 2305[5:MRR:2304.0,2065.0] || -> .
% 1.75/1.94 2306[5:Spt:2305.0,199.0,2290.0] || -> neq(sk2,nil)*.
% 1.75/1.94 2307[5:Spt:2305.0,199.1] || -> singletonP(sk1)*.
% 1.75/1.94 2308[5:MRR:436.0,2307.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.94 2311[5:SpR:2308.0,1455.0] || -> strictorderedP(sk1)*.
% 1.75/1.94 2318[5:MRR:2311.0,200.0] || -> .
% 1.75/1.94 2319[2:Spt:2318.0,457.1] || -> duplicatefreeP(sk1)*.
% 1.75/1.94 2322[3:Spt:286.0] || -> ssItem(u)*.
% 1.75/1.94 2332[3:MRR:75.0,2322.0] || -> strictorderedP(cons(u,nil))*.
% 1.75/1.94 2353[3:MRR:111.1,111.0,2322.0] || -> equal(u,v) neq(u,v)*.
% 1.75/1.94 2517[4:Spt:301.5] || -> equal(nil,sk2)**.
% 1.75/1.94 2523[4:Rew:2517.0,12.0] || -> strictorderedP(sk2)*.
% 1.75/1.94 2587[4:Rew:2517.0,445.1] || segmentP(nil,sk1)* -> equal(sk2,sk1).
% 1.75/1.94 2646[4:Rew:2517.0,2587.0] || segmentP(sk2,sk1)* -> equal(sk2,sk1).
% 1.75/1.94 2647[4:MRR:2646.0,198.0] || -> equal(sk2,sk1)**.
% 1.75/1.94 2735[4:Rew:2647.0,2523.0] || -> strictorderedP(sk1)*.
% 1.75/1.94 2758[4:MRR:2735.0,200.0] || -> .
% 1.75/1.94 2936[4:Spt:2758.0,301.5,2517.0] || equal(nil,sk2)** -> .
% 1.75/1.94 2937[4:Spt:2758.0,301.0,301.1,301.2,301.3,301.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 1.75/1.94 2951[5:Spt:472.5] || -> equal(nil,sk1)**.
% 1.75/1.94 2955[5:Rew:2951.0,12.0] || -> strictorderedP(sk1)*.
% 1.75/1.94 3039[5:MRR:2955.0,200.0] || -> .
% 1.75/1.94 3122[5:Spt:3039.0,472.5,2951.0] || equal(nil,sk1)** -> .
% 1.75/1.94 3123[5:Spt:3039.0,472.0,472.1,472.2,472.3,472.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.75/1.94 3162[6:Spt:199.0] || neq(sk2,nil)* -> .
% 1.75/1.94 3175[6:Res:2353.1,3162.0] || -> equal(nil,sk2)**.
% 1.75/1.94 3176[6:MRR:3175.0,2936.0] || -> .
% 1.75/1.94 3177[6:Spt:3176.0,199.0,3162.0] || -> neq(sk2,nil)*.
% 1.75/1.94 3178[6:Spt:3176.0,199.1] || -> singletonP(sk1)*.
% 1.75/1.94 3179[6:MRR:436.0,3178.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.94 3184[6:SpR:3179.0,2332.0] || -> strictorderedP(sk1)*.
% 1.75/1.94 3189[6:MRR:3184.0,200.0] || -> .
% 1.75/1.94 3191[3:Spt:3189.0,286.1] || -> duplicatefreeP(sk2)*.
% 1.75/1.94 3192[4:Spt:301.5] || -> equal(nil,sk2)**.
% 1.75/1.94 3198[4:Rew:3192.0,12.0] || -> strictorderedP(sk2)*.
% 1.75/1.97 3263[4:Rew:3192.0,445.1] || segmentP(nil,sk1)* -> equal(sk2,sk1).
% 1.75/1.97 3319[4:Rew:3192.0,3263.0] || segmentP(sk2,sk1)* -> equal(sk2,sk1).
% 1.75/1.97 3320[4:MRR:3319.0,198.0] || -> equal(sk2,sk1)**.
% 1.75/1.97 3414[4:Rew:3320.0,3198.0] || -> strictorderedP(sk1)*.
% 1.75/1.97 3434[4:MRR:3414.0,200.0] || -> .
% 1.75/1.97 3627[4:Spt:3434.0,301.5,3192.0] || equal(nil,sk2)** -> .
% 1.75/1.97 3628[4:Spt:3434.0,301.0,301.1,301.2,301.3,301.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 1.75/1.97 3643[5:Spt:472.5] || -> equal(nil,sk1)**.
% 1.75/1.97 3647[5:Rew:3643.0,12.0] || -> strictorderedP(sk1)*.
% 1.75/1.97 3732[5:MRR:3647.0,200.0] || -> .
% 1.75/1.97 3814[5:Spt:3732.0,472.5,3643.0] || equal(nil,sk1)** -> .
% 1.75/1.97 3815[5:Spt:3732.0,472.0,472.1,472.2,472.3,472.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.75/1.97 3837[6:Spt:394.0] || -> totalorderedP(sk1)*.
% 1.75/1.97 3843[7:Spt:451.0] || -> cyclefreeP(sk1)*.
% 1.75/1.97 3847[8:Spt:393.0] || -> strictorderP(sk1)*.
% 1.75/1.97 3849[9:Spt:392.0] || -> totalorderP(sk1)*.
% 1.75/1.97 3851[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.75/1.97 3904[10:Res:340.2,3851.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.75/1.97 3905[10:SSi:3904.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.75/1.97 3906[10:MRR:3905.0,3627.0] || -> .
% 1.75/1.97 3907[10:Spt:3906.0,199.0,3851.0] || -> neq(sk2,nil)*.
% 1.75/1.97 3908[10:Spt:3906.0,199.1] || -> singletonP(sk1)*.
% 1.75/1.97 3909[10:MRR:436.0,3908.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.97 3912[10:SpR:3909.0,75.1] ssItem(skaf44(sk1)) || -> strictorderedP(sk1)*.
% 1.75/1.97 3920[10:SSi:3912.0,56.0,1.0,2319.0,3837.0,3843.0,3847.0,3849.0,3908.0] || -> strictorderedP(sk1)*.
% 1.75/1.97 3921[10:MRR:3920.0,200.0] || -> .
% 1.75/1.97 3922[9:Spt:3921.0,392.0,3849.0] || totalorderP(sk1)* -> .
% 1.75/1.97 3923[9:Spt:3921.0,392.1] || -> equal(app(app(skaf56(sk1),cons(skaf54(sk1),skaf57(sk1))),cons(skaf55(sk1),skaf58(sk1))),sk1)**.
% 1.75/1.97 3927[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.75/1.97 3928[10:Res:340.2,3927.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.75/1.97 3929[10:SSi:3928.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.75/1.97 3930[10:MRR:3929.0,3627.0] || -> .
% 1.75/1.97 3931[10:Spt:3930.0,199.0,3927.0] || -> neq(sk2,nil)*.
% 1.75/1.97 3932[10:Spt:3930.0,199.1] || -> singletonP(sk1)*.
% 1.75/1.97 3933[10:MRR:436.0,3932.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.97 3941[10:SpR:3933.0,78.1] ssItem(skaf44(sk1)) || -> totalorderP(sk1)*.
% 1.75/1.97 3948[10:SSi:3941.0,56.0,1.0,2319.0,3837.0,3843.0,3847.0,3932.0] || -> totalorderP(sk1)*.
% 1.75/1.97 3949[10:MRR:3948.0,3922.0] || -> .
% 1.75/1.97 3950[8:Spt:3949.0,393.0,3847.0] || strictorderP(sk1)* -> .
% 1.75/1.97 3951[8:Spt:3949.0,393.1] || -> equal(app(app(skaf61(sk1),cons(skaf59(sk1),skaf62(sk1))),cons(skaf60(sk1),skaf63(sk1))),sk1)**.
% 1.75/1.97 3955[9:Spt:392.0] || -> totalorderP(sk1)*.
% 1.75/1.97 3956[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.75/1.97 3957[10:Res:340.2,3956.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.75/1.97 3958[10:SSi:3957.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.75/1.97 3959[10:MRR:3958.0,3627.0] || -> .
% 1.75/1.97 3960[10:Spt:3959.0,199.0,3956.0] || -> neq(sk2,nil)*.
% 1.75/1.97 3961[10:Spt:3959.0,199.1] || -> singletonP(sk1)*.
% 1.75/1.97 3962[10:MRR:436.0,3961.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.97 3970[10:SpR:3962.0,77.1] ssItem(skaf44(sk1)) || -> strictorderP(sk1)*.
% 1.75/1.97 3978[10:SSi:3970.0,56.0,1.0,2319.0,3837.0,3843.0,3955.0,3961.0] || -> strictorderP(sk1)*.
% 1.75/1.97 3979[10:MRR:3978.0,3950.0] || -> .
% 1.75/1.97 3980[9:Spt:3979.0,392.0,3955.0] || totalorderP(sk1)* -> .
% 1.75/1.97 3981[9:Spt:3979.0,392.1] || -> equal(app(app(skaf56(sk1),cons(skaf54(sk1),skaf57(sk1))),cons(skaf55(sk1),skaf58(sk1))),sk1)**.
% 1.75/1.97 3985[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.75/1.97 3986[10:Res:340.2,3985.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.75/1.97 3987[10:SSi:3986.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.75/1.97 3988[10:MRR:3987.0,3627.0] || -> .
% 1.75/1.97 3989[10:Spt:3988.0,199.0,3985.0] || -> neq(sk2,nil)*.
% 1.75/1.97 3990[10:Spt:3988.0,199.1] || -> singletonP(sk1)*.
% 1.75/1.97 3991[10:MRR:436.0,3990.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.97 3997[10:SpR:3991.0,78.1] ssItem(skaf44(sk1)) || -> totalorderP(sk1)*.
% 1.75/1.97 4006[10:SSi:3997.0,56.0,1.0,2319.0,3837.0,3843.0,3990.0] || -> totalorderP(sk1)*.
% 1.75/1.97 4007[10:MRR:4006.0,3980.0] || -> .
% 1.75/1.97 4008[7:Spt:4007.0,451.0,3843.0] || cyclefreeP(sk1)* -> .
% 1.75/1.97 4009[7:Spt:4007.0,451.1] || -> leq(skaf50(sk1),skaf49(sk1))*.
% 1.75/1.97 4012[8:Spt:392.0] || -> totalorderP(sk1)*.
% 1.75/1.97 4013[9:Spt:393.0] || -> strictorderP(sk1)*.
% 1.75/1.97 4016[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.75/1.97 4017[10:Res:340.2,4016.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.75/1.97 4018[10:SSi:4017.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.75/1.97 4019[10:MRR:4018.0,3627.0] || -> .
% 1.75/1.97 4020[10:Spt:4019.0,199.0,4016.0] || -> neq(sk2,nil)*.
% 1.75/1.97 4021[10:Spt:4019.0,199.1] || -> singletonP(sk1)*.
% 1.75/1.97 4022[10:MRR:436.0,4021.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.97 4030[10:SpR:4022.0,79.1] ssItem(skaf44(sk1)) || -> cyclefreeP(sk1)*.
% 1.75/1.97 4036[10:SSi:4030.0,56.0,1.0,2319.0,3837.0,4012.0,4013.0,4021.0] || -> cyclefreeP(sk1)*.
% 1.75/1.97 4037[10:MRR:4036.0,4008.0] || -> .
% 1.75/1.97 4038[9:Spt:4037.0,393.0,4013.0] || strictorderP(sk1)* -> .
% 1.75/1.97 4039[9:Spt:4037.0,393.1] || -> equal(app(app(skaf61(sk1),cons(skaf59(sk1),skaf62(sk1))),cons(skaf60(sk1),skaf63(sk1))),sk1)**.
% 1.75/1.97 4045[10:Spt:199.0] || neq(sk2,nil)* -> .
% 1.75/1.97 4046[10:Res:340.2,4045.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.75/1.97 4047[10:SSi:4046.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.75/1.97 4048[10:MRR:4047.0,3627.0] || -> .
% 1.75/1.97 4049[10:Spt:4048.0,199.0,4045.0] || -> neq(sk2,nil)*.
% 1.75/1.97 4050[10:Spt:4048.0,199.1] || -> singletonP(sk1)*.
% 1.75/1.97 4051[10:MRR:436.0,4050.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.97 4060[10:SpR:4051.0,79.1] ssItem(skaf44(sk1)) || -> cyclefreeP(sk1)*.
% 1.75/1.97 4068[10:SSi:4060.0,56.0,1.0,2319.0,3837.0,4012.0,4050.0] || -> cyclefreeP(sk1)*.
% 1.75/1.97 4069[10:MRR:4068.0,4008.0] || -> .
% 1.75/1.97 4070[8:Spt:4069.0,392.0,4012.0] || totalorderP(sk1)* -> .
% 1.75/1.97 4071[8:Spt:4069.0,392.1] || -> equal(app(app(skaf56(sk1),cons(skaf54(sk1),skaf57(sk1))),cons(skaf55(sk1),skaf58(sk1))),sk1)**.
% 1.75/1.97 4077[9:Spt:199.0] || neq(sk2,nil)* -> .
% 1.75/1.97 4078[9:Res:340.2,4077.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.75/1.97 4079[9:SSi:4078.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.75/1.97 4080[9:MRR:4079.0,3627.0] || -> .
% 1.75/1.97 4081[9:Spt:4080.0,199.0,4077.0] || -> neq(sk2,nil)*.
% 1.75/1.97 4082[9:Spt:4080.0,199.1] || -> singletonP(sk1)*.
% 1.75/1.97 4083[9:MRR:436.0,4082.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.97 4095[9:SpR:4083.0,79.1] ssItem(skaf44(sk1)) || -> cyclefreeP(sk1)*.
% 1.75/1.97 4114[9:SSi:4095.0,56.0,1.0,2319.0,3837.0,4082.0] || -> cyclefreeP(sk1)*.
% 1.75/1.97 4115[9:MRR:4114.0,4008.0] || -> .
% 1.75/1.97 4119[6:Spt:4115.0,394.0,3837.0] || totalorderedP(sk1)* -> .
% 1.75/1.97 4120[6:Spt:4115.0,394.1] || -> equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1)**.
% 1.75/1.97 4125[7:Spt:452.0] || -> cyclefreeP(sk1)*.
% 1.75/1.97 4129[8:Spt:199.0] || neq(sk2,nil)* -> .
% 1.75/1.97 4130[8:Res:340.2,4129.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.75/1.97 4131[8:SSi:4130.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.75/1.97 4132[8:MRR:4131.0,3627.0] || -> .
% 1.75/1.97 4133[8:Spt:4132.0,199.0,4129.0] || -> neq(sk2,nil)*.
% 1.75/1.97 4134[8:Spt:4132.0,199.1] || -> singletonP(sk1)*.
% 1.75/1.97 4135[8:MRR:436.0,4134.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.97 4143[8:SpR:4135.0,76.1] ssItem(skaf44(sk1)) || -> totalorderedP(sk1)*.
% 1.75/1.97 4161[8:SSi:4143.0,56.0,1.0,2319.0,4125.0,4134.0] || -> totalorderedP(sk1)*.
% 1.75/1.97 4162[8:MRR:4161.0,4119.0] || -> .
% 1.75/1.97 4170[7:Spt:4162.0,452.0,4125.0] || cyclefreeP(sk1)* -> .
% 1.75/1.97 4171[7:Spt:4162.0,452.1] || -> leq(skaf49(sk1),skaf50(sk1))*.
% 1.75/1.97 4177[8:Spt:199.0] || neq(sk2,nil)* -> .
% 1.75/1.97 4178[8:Res:340.2,4177.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.75/1.97 4179[8:SSi:4178.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0] || -> equal(nil,sk2)**.
% 1.75/1.97 4180[8:MRR:4179.0,3627.0] || -> .
% 1.75/1.97 4181[8:Spt:4180.0,199.0,4177.0] || -> neq(sk2,nil)*.
% 1.75/1.97 4182[8:Spt:4180.0,199.1] || -> singletonP(sk1)*.
% 1.75/1.97 4183[8:MRR:436.0,4182.0] || -> equal(cons(skaf44(sk1),nil),sk1)**.
% 1.75/1.97 4195[8:SpR:4183.0,79.1] ssItem(skaf44(sk1)) || -> cyclefreeP(sk1)*.
% 1.75/1.97 4230[8:SSi:4195.0,56.0,1.0,2319.0,4182.0] || -> cyclefreeP(sk1)*.
% 1.75/1.97 4231[8:MRR:4230.0,4170.0] || -> .
% 1.75/1.97 % SZS output end Refutation
% 1.75/1.97 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.75/1.97
%------------------------------------------------------------------------------