TSTP Solution File: SWC256-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC256-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:52 EDT 2022
% Result : Unsatisfiable 1.63s 1.83s
% Output : Refutation 1.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC256-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n016.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 15:53:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.63/1.83
% 1.63/1.83 SPASS V 3.9
% 1.63/1.83 SPASS beiseite: Proof found.
% 1.63/1.83 % SZS status Theorem
% 1.63/1.83 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.63/1.83 SPASS derived 3363 clauses, backtracked 2608 clauses, performed 33 splits and kept 4419 clauses.
% 1.63/1.83 SPASS allocated 79195 KBytes.
% 1.63/1.83 SPASS spent 0:00:01.48 on the problem.
% 1.63/1.83 0:00:00.04 for the input.
% 1.63/1.83 0:00:00.00 for the FLOTTER CNF translation.
% 1.63/1.83 0:00:00.01 for inferences.
% 1.63/1.83 0:00:00.02 for the backtracking.
% 1.63/1.83 0:00:01.23 for the reduction.
% 1.63/1.83
% 1.63/1.83
% 1.63/1.83 Here is a proof with depth 6, length 197 :
% 1.63/1.83 % SZS output start Refutation
% 1.63/1.83 1[0:Inp] || -> ssList(sk1)*.
% 1.63/1.83 2[0:Inp] || -> ssList(sk2)*.
% 1.63/1.83 5[0:Inp] || -> equal(sk4,sk2)**.
% 1.63/1.83 6[0:Inp] || -> equal(sk3,sk1)**.
% 1.63/1.83 7[0:Inp] || -> neq(sk2,nil)*.
% 1.63/1.83 8[0:Inp] || singletonP(sk1)* -> .
% 1.63/1.83 9[0:Inp] || -> ssItem(sk5)* equal(nil,sk4).
% 1.63/1.83 10[0:Inp] || -> ssItem(sk5)* equal(nil,sk3).
% 1.63/1.83 11[0:Inp] || -> equal(cons(sk5,nil),sk3)** equal(nil,sk4).
% 1.63/1.83 13[0:Inp] || -> equal(cons(sk5,nil),sk3)** equal(nil,sk3).
% 1.63/1.83 15[0:Inp] || -> equalelemsP(nil)*.
% 1.63/1.83 16[0:Inp] || -> duplicatefreeP(nil)*.
% 1.63/1.83 17[0:Inp] || -> strictorderedP(nil)*.
% 1.63/1.83 18[0:Inp] || -> totalorderedP(nil)*.
% 1.63/1.83 19[0:Inp] || -> strictorderP(nil)*.
% 1.63/1.83 20[0:Inp] || -> totalorderP(nil)*.
% 1.63/1.83 21[0:Inp] || -> cyclefreeP(nil)*.
% 1.63/1.83 23[0:Inp] || -> ssItem(skac3)*.
% 1.63/1.83 24[0:Inp] || -> ssItem(skac2)*.
% 1.63/1.83 27[0:Inp] || -> ssList(skaf82(u))*.
% 1.63/1.83 68[0:Inp] || equal(skac2,skac3)** -> .
% 1.63/1.83 74[0:Inp] ssList(u) || -> frontsegP(u,nil)*.
% 1.63/1.83 78[0:Inp] ssItem(u) || -> equalelemsP(cons(u,nil))*.
% 1.63/1.83 79[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 1.63/1.83 80[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 1.63/1.83 81[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 1.63/1.83 82[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 1.63/1.83 83[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 1.63/1.83 84[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 1.63/1.83 86[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 1.63/1.83 87[0:Inp] ssList(u) || -> equal(app(u,nil),u)**.
% 1.63/1.83 88[0:Inp] ssList(u) || -> equal(app(nil,u),u)**.
% 1.63/1.83 100[0:Inp] ssList(u) ssItem(v) || -> ssList(cons(v,u))*.
% 1.63/1.83 111[0:Inp] ssList(u) ssItem(v) || -> equal(hd(cons(v,u)),v)**.
% 1.63/1.83 113[0:Inp] ssList(u) ssItem(v) || equal(cons(v,u),u)** -> .
% 1.63/1.83 129[0:Inp] ssList(u) ssList(v) || neq(u,v)* equal(u,v) -> .
% 1.63/1.83 130[0:Inp] ssList(u) ssItem(v) || equal(cons(v,nil),u)* -> singletonP(u)*.
% 1.63/1.83 131[0:Inp] ssItem(u) ssItem(v) || neq(u,v)* equal(u,v) -> .
% 1.63/1.83 137[0:Inp] ssList(u) ssList(v) || -> equal(nil,u) equal(hd(app(u,v)),hd(u))**.
% 1.63/1.83 171[0:Inp] ssList(u) ssList(v) ssItem(w) || -> equal(app(cons(w,v),u),cons(w,app(v,u)))**.
% 1.63/1.83 184[0:Inp] ssList(u) ssList(v) ssItem(w) ssItem(x) || equal(cons(w,u),cons(x,v))* -> equal(w,x).
% 1.63/1.83 190[0:Inp] ssItem(u) ssItem(v) ssList(w) ssList(x) || frontsegP(cons(u,w),cons(v,x))* -> equal(u,v).
% 1.63/1.83 191[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.63/1.83 192[0:Inp] ssItem(u) ssItem(v) ssList(w) ssList(x) || equal(u,v) frontsegP(w,x) -> frontsegP(cons(u,w),cons(v,x))*.
% 1.63/1.83 202[0:Rew:6.0,10.1] || -> ssItem(sk5)* equal(nil,sk1).
% 1.63/1.83 203[0:Rew:202.1,9.1,5.0,9.1] || -> ssItem(sk5)* equal(sk2,sk1).
% 1.63/1.83 206[0:Rew:6.0,13.1,6.0,13.0] || -> equal(nil,sk1) equal(cons(sk5,nil),sk1)**.
% 1.63/1.83 207[0:Rew:206.1,11.1,5.0,11.1,6.0,11.0] || -> equal(sk2,sk1) equal(cons(sk5,nil),sk1)**.
% 1.63/1.83 219[0:Res:2.0,192.0] ssItem(u) ssItem(v) ssList(w) || equal(u,v) frontsegP(w,sk2) -> frontsegP(cons(u,w),cons(v,sk2))*.
% 1.63/1.83 221[0:Res:2.0,190.0] ssItem(u) ssItem(v) ssList(w) || frontsegP(cons(u,w),cons(v,sk2))* -> equal(u,v).
% 1.63/1.83 293[0:Res:2.0,86.0] || -> ssItem(u)* duplicatefreeP(sk2)*.
% 1.63/1.83 360[0:Res:2.0,171.2] ssList(u) ssItem(v) || -> equal(app(cons(v,u),sk2),cons(v,app(u,sk2)))**.
% 1.63/1.83 439[0:Res:1.0,129.0] ssList(u) || neq(u,sk1)* equal(u,sk1) -> .
% 1.63/1.83 464[0:Res:1.0,86.0] || -> ssItem(u)* duplicatefreeP(sk1)*.
% 1.63/1.83 479[0:Res:1.0,191.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1).
% 1.63/1.83 508[0:Res:1.0,137.1] ssList(u) || -> equal(nil,sk1) equal(hd(app(sk1,u)),hd(sk1))**.
% 1.63/1.83 513[0:Res:1.0,130.1] ssItem(u) || equal(cons(u,nil),sk1)** -> singletonP(sk1).
% 1.63/1.83 515[0:Res:1.0,111.1] ssItem(u) || -> equal(hd(cons(u,sk1)),u)**.
% 1.63/1.83 517[0:Res:1.0,113.1] ssItem(u) || equal(cons(u,sk1),sk1)** -> .
% 1.63/1.83 520[0:Res:1.0,100.1] ssItem(u) || -> ssList(cons(u,sk1))*.
% 1.63/1.83 554[0:MRR:513.2,8.0] ssItem(u) || equal(cons(u,nil),sk1)** -> .
% 1.63/1.83 559[1:Spt:86.1] || -> ssItem(u)*.
% 1.63/1.83 573[1:MRR:554.0,559.0] || equal(cons(u,nil),sk1)** -> .
% 1.63/1.83 599[1:MRR:131.1,131.0,559.0] || neq(u,v)* equal(u,v) -> .
% 1.63/1.83 755[1:MRR:206.1,573.0] || -> equal(nil,sk1)**.
% 1.63/1.83 756[1:MRR:207.1,573.0] || -> equal(sk2,sk1)**.
% 1.63/1.83 817[1:Rew:755.0,7.0] || -> neq(sk2,sk1)*.
% 1.63/1.83 914[1:Rew:756.0,817.0] || -> neq(sk1,sk1)*.
% 1.63/1.83 1150[1:Res:914.0,599.0] || equal(sk1,sk1)* -> .
% 1.63/1.83 1152[1:Obv:1150.0] || -> .
% 1.63/1.83 1153[1:Spt:1152.0,86.0,86.2] ssList(u) || -> duplicatefreeP(u)*.
% 1.63/1.83 1161[2:Spt:508.0,508.2] ssList(u) || -> equal(hd(app(sk1,u)),hd(sk1))**.
% 1.63/1.83 1169[3:Spt:464.0] || -> ssItem(u)*.
% 1.63/1.83 1173[3:MRR:78.0,1169.0] || -> equalelemsP(cons(u,nil))*.
% 1.63/1.83 1174[3:MRR:79.0,1169.0] || -> duplicatefreeP(cons(u,nil))*.
% 1.63/1.83 1175[3:MRR:80.0,1169.0] || -> strictorderedP(cons(u,nil))*.
% 1.63/1.83 1176[3:MRR:81.0,1169.0] || -> totalorderedP(cons(u,nil))*.
% 1.63/1.83 1177[3:MRR:82.0,1169.0] || -> strictorderP(cons(u,nil))*.
% 1.63/1.83 1178[3:MRR:83.0,1169.0] || -> totalorderP(cons(u,nil))*.
% 1.63/1.83 1179[3:MRR:84.0,1169.0] || -> cyclefreeP(cons(u,nil))*.
% 1.63/1.83 1182[3:MRR:520.0,1169.0] || -> ssList(cons(u,sk1))*.
% 1.63/1.83 1188[3:MRR:515.0,1169.0] || -> equal(hd(cons(u,sk1)),u)**.
% 1.63/1.83 1191[3:MRR:554.0,1169.0] || equal(cons(u,nil),sk1)** -> .
% 1.63/1.83 1302[3:MRR:360.1,1169.0] ssList(u) || -> equal(app(cons(v,u),sk2),cons(v,app(u,sk2)))**.
% 1.63/1.83 1364[3:MRR:184.3,184.2,1169.0] ssList(u) ssList(v) || equal(cons(w,u),cons(x,v))* -> equal(w,x).
% 1.63/1.83 1365[3:MRR:207.1,1191.0] || -> equal(sk2,sk1)**.
% 1.63/1.83 1366[3:MRR:206.1,1191.0] || -> equal(nil,sk1)**.
% 1.63/1.83 1495[3:Rew:1366.0,87.1] ssList(u) || -> equal(app(u,sk1),u)**.
% 1.63/1.83 1496[3:Rew:1366.0,88.1] ssList(u) || -> equal(app(sk1,u),u)**.
% 1.63/1.83 1517[3:Rew:1366.0,1173.0] || -> equalelemsP(cons(u,sk1))*.
% 1.63/1.83 1518[3:Rew:1366.0,1174.0] || -> duplicatefreeP(cons(u,sk1))*.
% 1.63/1.83 1519[3:Rew:1366.0,1175.0] || -> strictorderedP(cons(u,sk1))*.
% 1.63/1.83 1520[3:Rew:1366.0,1176.0] || -> totalorderedP(cons(u,sk1))*.
% 1.63/1.83 1521[3:Rew:1366.0,1177.0] || -> strictorderP(cons(u,sk1))*.
% 1.63/1.83 1522[3:Rew:1366.0,1178.0] || -> totalorderP(cons(u,sk1))*.
% 1.63/1.83 1523[3:Rew:1366.0,1179.0] || -> cyclefreeP(cons(u,sk1))*.
% 1.63/1.83 1580[3:Rew:1496.1,1161.1] ssList(u) || -> equal(hd(u),hd(sk1))*.
% 1.63/1.83 1640[3:Rew:1495.1,1302.1,1365.0,1302.1] ssList(u) || -> equal(app(cons(v,u),sk1),cons(v,u))**.
% 1.63/1.83 1760[3:SpR:1580.1,1188.0] ssList(cons(u,sk1)) || -> equal(hd(sk1),u)*.
% 1.63/1.83 1765[3:SSi:1760.0,1517.0,1182.0,1518.0,1519.0,1520.0,1521.0,1522.0,1523.0] || -> equal(hd(sk1),u)*.
% 1.63/1.83 1794[3:Rew:1765.0,1640.1] ssList(u) || -> equal(cons(v,u),hd(sk1))**.
% 1.63/1.83 1883[3:Rew:1765.0,1364.2] ssList(u) ssList(v) || equal(cons(w,u),hd(sk1))** -> equal(w,x)*.
% 1.63/1.83 1956[3:Con:1883.1] ssList(u) || equal(cons(v,u),hd(sk1))** -> equal(v,w)*.
% 1.63/1.83 1957[3:AED:68.0,1956.2] ssList(u) || equal(cons(v,u),hd(sk1))** -> .
% 1.63/1.83 1958[3:Rew:1794.1,1957.1] ssList(u) || equal(hd(sk1),hd(sk1))* -> .
% 1.63/1.83 1959[3:Obv:1958.1] ssList(u) || -> .
% 1.63/1.83 1960[3:UnC:1959.0,27.0] || -> .
% 1.63/1.83 2058[3:Spt:1960.0,464.1] || -> duplicatefreeP(sk1)*.
% 1.63/1.83 2060[4:Spt:293.0] || -> ssItem(u)*.
% 1.63/1.83 2063[4:MRR:520.0,2060.0] || -> ssList(cons(u,sk1))*.
% 1.63/1.83 2066[4:MRR:84.0,2060.0] || -> cyclefreeP(cons(u,nil))*.
% 1.63/1.83 2067[4:MRR:83.0,2060.0] || -> totalorderP(cons(u,nil))*.
% 1.63/1.83 2068[4:MRR:82.0,2060.0] || -> strictorderP(cons(u,nil))*.
% 1.63/1.83 2069[4:MRR:81.0,2060.0] || -> totalorderedP(cons(u,nil))*.
% 1.63/1.83 2070[4:MRR:80.0,2060.0] || -> strictorderedP(cons(u,nil))*.
% 1.63/1.83 2071[4:MRR:79.0,2060.0] || -> duplicatefreeP(cons(u,nil))*.
% 1.63/1.83 2072[4:MRR:78.0,2060.0] || -> equalelemsP(cons(u,nil))*.
% 1.63/1.83 2074[4:MRR:554.0,2060.0] || equal(cons(u,nil),sk1)** -> .
% 1.63/1.83 2077[4:MRR:515.0,2060.0] || -> equal(hd(cons(u,sk1)),u)**.
% 1.63/1.83 2147[4:MRR:221.1,221.0,2060.0] ssList(u) || frontsegP(cons(v,u),cons(w,sk2))* -> equal(v,w).
% 1.63/1.83 2166[4:MRR:219.1,219.0,2060.0] ssList(u) || equal(v,w) frontsegP(u,sk2) -> frontsegP(cons(v,u),cons(w,sk2))*.
% 1.63/1.83 2256[4:MRR:206.1,2074.0] || -> equal(nil,sk1)**.
% 1.63/1.83 2257[4:MRR:207.1,2074.0] || -> equal(sk2,sk1)**.
% 1.63/1.83 2298[4:Rew:2256.0,74.1] ssList(u) || -> frontsegP(u,sk1)*.
% 1.63/1.83 2301[4:Rew:2256.0,88.1] ssList(u) || -> equal(app(sk1,u),u)**.
% 1.63/1.83 2329[4:Rew:2256.0,2066.0] || -> cyclefreeP(cons(u,sk1))*.
% 1.66/1.89 2330[4:Rew:2256.0,2067.0] || -> totalorderP(cons(u,sk1))*.
% 1.66/1.89 2331[4:Rew:2256.0,2068.0] || -> strictorderP(cons(u,sk1))*.
% 1.66/1.89 2332[4:Rew:2256.0,2069.0] || -> totalorderedP(cons(u,sk1))*.
% 1.66/1.89 2333[4:Rew:2256.0,2070.0] || -> strictorderedP(cons(u,sk1))*.
% 1.66/1.89 2334[4:Rew:2256.0,2071.0] || -> duplicatefreeP(cons(u,sk1))*.
% 1.66/1.89 2335[4:Rew:2256.0,2072.0] || -> equalelemsP(cons(u,sk1))*.
% 1.66/1.89 2459[4:Rew:2301.1,1161.1] ssList(u) || -> equal(hd(u),hd(sk1))*.
% 1.66/1.89 2524[4:Rew:2257.0,2147.1] ssList(u) || frontsegP(cons(v,u),cons(w,sk1))* -> equal(v,w).
% 1.66/1.89 2592[4:Rew:2257.0,2166.3,2257.0,2166.2] ssList(u) || equal(v,w) frontsegP(u,sk1) -> frontsegP(cons(v,u),cons(w,sk1))*.
% 1.66/1.89 2593[4:MRR:2592.2,2298.1] ssList(u) || equal(v,w) -> frontsegP(cons(v,u),cons(w,sk1))*.
% 1.66/1.89 2647[4:SpR:2459.1,2077.0] ssList(cons(u,sk1)) || -> equal(hd(sk1),u)*.
% 1.66/1.89 2652[4:SSi:2647.0,2063.0,2329.0,2330.0,2331.0,2332.0,2333.0,2334.0,2335.0] || -> equal(hd(sk1),u)*.
% 1.66/1.89 2738[4:Rew:2652.0,2593.2] ssList(u) || equal(v,w)* -> frontsegP(hd(sk1),cons(w,sk1))*.
% 1.66/1.89 2739[4:Rew:2652.0,2524.1] ssList(u) || frontsegP(hd(sk1),cons(v,sk1))* -> equal(w,v)*.
% 1.66/1.89 2815[4:AED:68.0,2738.1] ssList(u) || -> frontsegP(hd(sk1),cons(v,sk1))*.
% 1.66/1.89 2816[4:AED:68.0,2739.2] ssList(u) || frontsegP(hd(sk1),cons(v,sk1))* -> .
% 1.66/1.89 2817[4:MRR:2816.1,2815.1] ssList(u) || -> .
% 1.66/1.89 2818[4:UnC:2817.0,27.0] || -> .
% 1.66/1.89 2898[4:Spt:2818.0,293.1] || -> duplicatefreeP(sk2)*.
% 1.66/1.89 2900[5:Spt:479.5] || -> equal(nil,sk1)**.
% 1.66/1.89 2952[5:Rew:2900.0,78.1] ssItem(u) || -> equalelemsP(cons(u,sk1))*.
% 1.66/1.89 2953[5:Rew:2900.0,79.1] ssItem(u) || -> duplicatefreeP(cons(u,sk1))*.
% 1.66/1.89 2954[5:Rew:2900.0,80.1] ssItem(u) || -> strictorderedP(cons(u,sk1))*.
% 1.66/1.89 2955[5:Rew:2900.0,81.1] ssItem(u) || -> totalorderedP(cons(u,sk1))*.
% 1.66/1.89 2956[5:Rew:2900.0,82.1] ssItem(u) || -> strictorderP(cons(u,sk1))*.
% 1.66/1.89 2957[5:Rew:2900.0,83.1] ssItem(u) || -> totalorderP(cons(u,sk1))*.
% 1.66/1.89 2958[5:Rew:2900.0,84.1] ssItem(u) || -> cyclefreeP(cons(u,sk1))*.
% 1.66/1.89 2966[5:Rew:2900.0,88.1] ssList(u) || -> equal(app(sk1,u),u)**.
% 1.66/1.89 3061[5:Rew:2966.1,1161.1] ssList(u) || -> equal(hd(u),hd(sk1))*.
% 1.66/1.89 3459[5:SpR:515.1,3061.1] ssItem(u) ssList(cons(u,sk1)) || -> equal(u,hd(sk1))*.
% 1.66/1.89 3462[5:SSi:3459.1,520.1,2952.1,2953.1,2954.1,2955.1,2956.1,2957.1,2958.1] ssItem(u) || -> equal(u,hd(sk1))*.
% 1.66/1.89 3528[5:SpR:3462.1,3462.1] ssItem(u) ssItem(v) || -> equal(v,u)*.
% 1.66/1.89 3569[5:EmS:3528.0,23.0] ssItem(u) || -> equal(u,skac3)*.
% 1.66/1.89 3589[5:EmS:3569.0,24.0] || -> equal(skac2,skac3)**.
% 1.66/1.89 3590[5:MRR:3589.0,68.0] || -> .
% 1.66/1.89 3722[5:Spt:3590.0,479.5,2900.0] || equal(nil,sk1)** -> .
% 1.66/1.89 3723[5:Spt:3590.0,479.0,479.1,479.2,479.3,479.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.66/1.89 3724[5:MRR:202.1,3722.0] || -> ssItem(sk5)*.
% 1.66/1.89 3731[5:MRR:206.0,3722.0] || -> equal(cons(sk5,nil),sk1)**.
% 1.66/1.89 4020[5:SpL:3731.0,554.1] ssItem(sk5) || equal(sk1,sk1)* -> .
% 1.66/1.89 4021[5:Obv:4020.1] ssItem(sk5) || -> .
% 1.66/1.89 4022[5:SSi:4021.0,3724.0] || -> .
% 1.66/1.89 4023[2:Spt:4022.0,508.1] || -> equal(nil,sk1)**.
% 1.66/1.89 4026[2:Rew:4023.0,15.0] || -> equalelemsP(sk1)*.
% 1.66/1.89 4027[2:Rew:4023.0,16.0] || -> duplicatefreeP(sk1)*.
% 1.66/1.89 4028[2:Rew:4023.0,17.0] || -> strictorderedP(sk1)*.
% 1.66/1.89 4029[2:Rew:4023.0,18.0] || -> totalorderedP(sk1)*.
% 1.66/1.89 4030[2:Rew:4023.0,19.0] || -> strictorderP(sk1)*.
% 1.66/1.89 4031[2:Rew:4023.0,20.0] || -> totalorderP(sk1)*.
% 1.66/1.89 4032[2:Rew:4023.0,21.0] || -> cyclefreeP(sk1)*.
% 1.66/1.89 4035[2:Rew:4023.0,7.0] || -> neq(sk2,sk1)*.
% 1.66/1.89 4126[2:Rew:4023.0,207.1] || -> equal(sk2,sk1) equal(cons(sk5,sk1),sk1)**.
% 1.66/1.89 4197[3:Spt:293.0] || -> ssItem(u)*.
% 1.66/1.89 4203[3:MRR:517.0,4197.0] || equal(cons(u,sk1),sk1)** -> .
% 1.66/1.89 4216[3:MRR:131.1,131.0,4197.0] || neq(u,v)* equal(u,v) -> .
% 1.66/1.89 4371[3:MRR:4126.1,4203.0] || -> equal(sk2,sk1)**.
% 1.66/1.89 4436[3:Rew:4371.0,4035.0] || -> neq(sk1,sk1)*.
% 1.66/1.89 4602[3:Res:4436.0,4216.0] || equal(sk1,sk1)* -> .
% 1.66/1.89 4604[3:Obv:4602.0] || -> .
% 1.66/1.89 4605[3:Spt:4604.0,293.1] || -> duplicatefreeP(sk2)*.
% 1.66/1.89 4606[4:Spt:203.1] || -> equal(sk2,sk1)**.
% 1.66/1.89 4616[4:Rew:4606.0,4035.0] || -> neq(sk1,sk1)*.
% 1.66/1.89 4917[4:Res:4616.0,439.1] ssList(sk1) || equal(sk1,sk1)* -> .
% 1.66/1.89 4920[4:Obv:4917.1] ssList(sk1) || -> .
% 1.66/1.89 4921[4:SSi:4920.0,1.0,4026.0,4027.0,4028.0,4029.0,4030.0,4031.0,4032.0] || -> .
% 1.66/1.89 4922[4:Spt:4921.0,203.1,4606.0] || equal(sk2,sk1)** -> .
% 1.66/1.89 4923[4:Spt:4921.0,203.0] || -> ssItem(sk5)*.
% 1.66/1.89 4930[4:MRR:4126.0,4922.0] || -> equal(cons(sk5,sk1),sk1)**.
% 1.66/1.89 4975[4:SpL:4930.0,517.1] ssItem(sk5) || equal(sk1,sk1)* -> .
% 1.66/1.89 4978[4:Obv:4975.1] ssItem(sk5) || -> .
% 1.66/1.89 4979[4:SSi:4978.0,4923.0] || -> .
% 1.66/1.89 % SZS output end Refutation
% 1.66/1.89 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_13 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause9 clause10 clause13 clause54 clause60 clause64 clause65 clause66 clause67 clause68 clause69 clause70 clause72 clause73 clause74 clause86 clause97 clause99 clause115 clause116 clause117 clause123 clause157 clause170 clause176 clause177 clause178
% 1.66/1.89
%------------------------------------------------------------------------------