TSTP Solution File: SWC049-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC049-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:01:22 EDT 2022
% Result : Unsatisfiable 1.39s 1.62s
% Output : Refutation 1.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC049-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n026.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 12:44:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.39/1.62
% 1.39/1.62 SPASS V 3.9
% 1.39/1.62 SPASS beiseite: Proof found.
% 1.39/1.62 % SZS status Theorem
% 1.39/1.62 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.39/1.62 SPASS derived 1882 clauses, backtracked 1765 clauses, performed 60 splits and kept 3370 clauses.
% 1.39/1.62 SPASS allocated 77516 KBytes.
% 1.39/1.62 SPASS spent 0:00:01.25 on the problem.
% 1.39/1.62 0:00:00.04 for the input.
% 1.39/1.62 0:00:00.00 for the FLOTTER CNF translation.
% 1.39/1.62 0:00:00.01 for inferences.
% 1.39/1.62 0:00:00.02 for the backtracking.
% 1.39/1.62 0:00:00.95 for the reduction.
% 1.39/1.62
% 1.39/1.62
% 1.39/1.62 Here is a proof with depth 2, length 124 :
% 1.39/1.62 % SZS output start Refutation
% 1.39/1.62 1[0:Inp] || -> ssList(sk1)*.
% 1.39/1.62 2[0:Inp] || -> ssList(sk2)*.
% 1.39/1.62 5[0:Inp] || -> equal(sk4,sk2)**.
% 1.39/1.62 6[0:Inp] || -> equal(sk3,sk1)**.
% 1.39/1.62 7[0:Inp] ssList(u) || neq(u,nil) rearsegP(sk1,u) rearsegP(sk2,u)* -> .
% 1.39/1.62 8[0:Inp] || equal(nil,sk4)** -> equal(nil,sk3).
% 1.39/1.62 9[0:Inp] || equal(nil,sk2)** equal(nil,sk1) -> .
% 1.39/1.62 10[0:Inp] || neq(sk4,nil)* -> neq(sk3,nil).
% 1.39/1.62 11[0:Inp] || neq(sk4,nil) -> rearsegP(sk4,sk3)*.
% 1.39/1.62 12[0:Inp] || -> equalelemsP(nil)*.
% 1.39/1.62 13[0:Inp] || -> duplicatefreeP(nil)*.
% 1.39/1.62 14[0:Inp] || -> strictorderedP(nil)*.
% 1.39/1.62 15[0:Inp] || -> totalorderedP(nil)*.
% 1.39/1.62 16[0:Inp] || -> strictorderP(nil)*.
% 1.39/1.62 17[0:Inp] || -> totalorderP(nil)*.
% 1.39/1.62 18[0:Inp] || -> cyclefreeP(nil)*.
% 1.39/1.62 19[0:Inp] || -> ssList(nil)*.
% 1.39/1.62 69[0:Inp] ssList(u) || -> rearsegP(u,nil)*.
% 1.39/1.62 70[0:Inp] ssList(u) || -> rearsegP(u,u)*.
% 1.39/1.62 83[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 1.39/1.62 111[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*.
% 1.39/1.62 113[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 1.39/1.62 188[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.39/1.62 199[0:Rew:5.0,11.1,6.0,11.1,5.0,11.0] || neq(sk2,nil) -> rearsegP(sk2,sk1)*.
% 1.39/1.62 200[0:Rew:6.0,10.1,5.0,10.0] || neq(sk2,nil)* -> neq(sk1,nil).
% 1.39/1.62 201[0:Rew:6.0,8.1,5.0,8.0] || equal(nil,sk2)** -> equal(nil,sk1).
% 1.39/1.62 202[0:Rew:201.1,9.1] || equal(nil,sk2)** equal(sk1,sk1) -> .
% 1.39/1.62 203[0:Obv:202.1] || equal(nil,sk2)** -> .
% 1.39/1.62 290[0:Res:2.0,83.0] || -> ssItem(u)* duplicatefreeP(sk2)*.
% 1.39/1.62 293[0:Res:2.0,69.0] || -> rearsegP(sk2,nil)*.
% 1.39/1.62 344[0:Res:2.0,111.1] ssList(u) || -> equal(sk2,u) neq(sk2,u)*.
% 1.39/1.62 432[0:Res:1.0,7.0] || neq(sk1,nil) rearsegP(sk2,sk1)* rearsegP(sk1,sk1) -> .
% 1.39/1.62 440[0:Res:1.0,111.0] ssList(u) || -> equal(u,sk1) neq(u,sk1)*.
% 1.39/1.62 462[0:Res:1.0,83.0] || -> ssItem(u)* duplicatefreeP(sk1)*.
% 1.39/1.62 466[0:Res:1.0,70.0] || -> rearsegP(sk1,sk1)*.
% 1.39/1.62 477[0:Res:1.0,188.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1).
% 1.39/1.62 562[0:MRR:432.2,466.0] || rearsegP(sk2,sk1)* neq(sk1,nil) -> .
% 1.39/1.62 572[1:Spt:83.1] || -> ssItem(u)*.
% 1.39/1.62 604[1:MRR:113.1,113.0,572.0] || -> equal(u,v) neq(u,v)*.
% 1.39/1.62 770[2:Spt:477.5] || -> equal(nil,sk1)**.
% 1.39/1.62 772[2:Rew:770.0,200.0] || neq(sk2,sk1)* -> neq(sk1,nil).
% 1.39/1.62 774[2:Rew:770.0,562.1] || rearsegP(sk2,sk1)* neq(sk1,sk1) -> .
% 1.39/1.62 822[2:Rew:770.0,293.0] || -> rearsegP(sk2,sk1)*.
% 1.39/1.62 828[2:Rew:770.0,203.0] || equal(sk2,sk1)** -> .
% 1.39/1.62 887[2:Rew:770.0,772.1] || neq(sk2,sk1)* -> neq(sk1,sk1).
% 1.39/1.62 894[2:MRR:774.0,822.0] || neq(sk1,sk1)* -> .
% 1.39/1.62 895[2:MRR:887.1,894.0] || neq(sk2,sk1)* -> .
% 1.39/1.62 971[2:Res:604.1,895.0] || -> equal(sk2,sk1)**.
% 1.39/1.62 972[2:MRR:971.0,828.0] || -> .
% 1.39/1.62 973[2:Spt:972.0,477.5,770.0] || equal(nil,sk1)** -> .
% 1.39/1.62 974[2:Spt:972.0,477.0,477.1,477.2,477.3,477.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.39/1.62 1013[3:Spt:199.0] || neq(sk2,nil)* -> .
% 1.39/1.62 1014[3:Res:604.1,1013.0] || -> equal(nil,sk2)**.
% 1.39/1.62 1015[3:MRR:1014.0,203.0] || -> .
% 1.39/1.62 1016[3:Spt:1015.0,199.0,1013.0] || -> neq(sk2,nil)*.
% 1.39/1.62 1017[3:Spt:1015.0,199.1] || -> rearsegP(sk2,sk1)*.
% 1.39/1.62 1018[3:MRR:562.0,1017.0] || neq(sk1,nil)* -> .
% 1.39/1.62 1019[3:MRR:200.0,200.1,1016.0,1018.0] || -> .
% 1.39/1.62 1021[1:Spt:1019.0,83.0,83.2] ssList(u) || -> duplicatefreeP(u)*.
% 1.39/1.62 1033[2:Spt:462.0] || -> ssItem(u)*.
% 1.39/1.62 1061[2:MRR:113.1,113.0,1033.0] || -> equal(u,v) neq(u,v)*.
% 1.39/1.62 1229[3:Spt:477.5] || -> equal(nil,sk1)**.
% 1.39/1.62 1240[3:Rew:1229.0,293.0] || -> rearsegP(sk2,sk1)*.
% 1.39/1.62 1245[3:Rew:1229.0,203.0] || equal(sk2,sk1)** -> .
% 1.39/1.62 1299[3:Rew:1229.0,200.0] || neq(sk2,sk1)* -> neq(sk1,nil).
% 1.39/1.62 1300[3:Rew:1229.0,562.1] || rearsegP(sk2,sk1)* neq(sk1,sk1) -> .
% 1.39/1.62 1351[3:Rew:1229.0,1299.1] || neq(sk2,sk1)* -> neq(sk1,sk1).
% 1.39/1.62 1378[3:MRR:1300.0,1240.0] || neq(sk1,sk1)* -> .
% 1.39/1.62 1379[3:MRR:1351.1,1378.0] || neq(sk2,sk1)* -> .
% 1.39/1.62 1426[3:Res:1061.1,1379.0] || -> equal(sk2,sk1)**.
% 1.39/1.62 1428[3:MRR:1426.0,1245.0] || -> .
% 1.39/1.62 1429[3:Spt:1428.0,477.5,1229.0] || equal(nil,sk1)** -> .
% 1.39/1.62 1430[3:Spt:1428.0,477.0,477.1,477.2,477.3,477.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.39/1.62 1469[4:Spt:200.0] || neq(sk2,nil)* -> .
% 1.39/1.62 1470[4:Res:1061.1,1469.0] || -> equal(nil,sk2)**.
% 1.39/1.62 1471[4:MRR:1470.0,203.0] || -> .
% 1.39/1.62 1472[4:Spt:1471.0,200.0,1469.0] || -> neq(sk2,nil)*.
% 1.39/1.62 1473[4:Spt:1471.0,200.1] || -> neq(sk1,nil)*.
% 1.39/1.62 1474[4:MRR:562.1,1473.0] || rearsegP(sk2,sk1)* -> .
% 1.39/1.62 1475[4:MRR:199.0,199.1,1472.0,1474.0] || -> .
% 1.39/1.62 1477[2:Spt:1475.0,462.1] || -> duplicatefreeP(sk1)*.
% 1.39/1.62 1480[3:Spt:290.0] || -> ssItem(u)*.
% 1.39/1.62 1512[3:MRR:113.1,113.0,1480.0] || -> equal(u,v) neq(u,v)*.
% 1.39/1.62 1674[4:Spt:477.5] || -> equal(nil,sk1)**.
% 1.39/1.62 1687[4:Rew:1674.0,293.0] || -> rearsegP(sk2,sk1)*.
% 1.39/1.62 1693[4:Rew:1674.0,203.0] || equal(sk2,sk1)** -> .
% 1.39/1.62 1743[4:Rew:1674.0,200.0] || neq(sk2,sk1)* -> neq(sk1,nil).
% 1.39/1.62 1745[4:Rew:1674.0,562.1] || rearsegP(sk2,sk1)* neq(sk1,sk1) -> .
% 1.39/1.62 1796[4:Rew:1674.0,1743.1] || neq(sk2,sk1)* -> neq(sk1,sk1).
% 1.39/1.62 1823[4:MRR:1745.0,1687.0] || neq(sk1,sk1)* -> .
% 1.39/1.62 1824[4:MRR:1796.1,1823.0] || neq(sk2,sk1)* -> .
% 1.39/1.62 1871[4:Res:1512.1,1824.0] || -> equal(sk2,sk1)**.
% 1.39/1.62 1873[4:MRR:1871.0,1693.0] || -> .
% 1.39/1.62 1874[4:Spt:1873.0,477.5,1674.0] || equal(nil,sk1)** -> .
% 1.39/1.62 1875[4:Spt:1873.0,477.0,477.1,477.2,477.3,477.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.39/1.62 1914[5:Spt:199.0] || neq(sk2,nil)* -> .
% 1.39/1.62 1915[5:Res:1512.1,1914.0] || -> equal(nil,sk2)**.
% 1.39/1.62 1916[5:MRR:1915.0,203.0] || -> .
% 1.39/1.62 1917[5:Spt:1916.0,199.0,1914.0] || -> neq(sk2,nil)*.
% 1.39/1.62 1918[5:Spt:1916.0,199.1] || -> rearsegP(sk2,sk1)*.
% 1.39/1.62 1919[5:MRR:562.0,1918.0] || neq(sk1,nil)* -> .
% 1.39/1.62 1920[5:MRR:200.0,200.1,1917.0,1919.0] || -> .
% 1.39/1.62 1922[3:Spt:1920.0,290.1] || -> duplicatefreeP(sk2)*.
% 1.39/1.62 1923[4:Spt:477.5] || -> equal(nil,sk1)**.
% 1.39/1.62 1934[4:Rew:1923.0,293.0] || -> rearsegP(sk2,sk1)*.
% 1.39/1.62 1939[4:Rew:1923.0,203.0] || equal(sk2,sk1)** -> .
% 1.39/1.62 1994[4:Rew:1923.0,200.0] || neq(sk2,sk1)* -> neq(sk1,nil).
% 1.39/1.62 1995[4:Rew:1923.0,562.1] || rearsegP(sk2,sk1)* neq(sk1,sk1) -> .
% 1.39/1.62 2042[4:Rew:1923.0,1994.1] || neq(sk2,sk1)* -> neq(sk1,sk1).
% 1.39/1.62 2071[4:MRR:1995.0,1934.0] || neq(sk1,sk1)* -> .
% 1.39/1.62 2072[4:MRR:2042.1,2071.0] || neq(sk2,sk1)* -> .
% 1.39/1.62 2281[4:Res:440.2,2072.0] ssList(sk2) || -> equal(sk2,sk1)**.
% 1.39/1.62 2320[4:SSi:2281.0,2.0,1922.0] || -> equal(sk2,sk1)**.
% 1.39/1.62 2321[4:MRR:2320.0,1939.0] || -> .
% 1.39/1.62 2326[4:Spt:2321.0,477.5,1923.0] || equal(nil,sk1)** -> .
% 1.39/1.62 2327[4:Spt:2321.0,477.0,477.1,477.2,477.3,477.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.39/1.62 2367[5:Spt:200.0] || neq(sk2,nil)* -> .
% 1.39/1.62 2413[5:Res:344.2,2367.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.39/1.62 2414[5:SSi:2413.0,16.0,15.0,14.0,13.0,12.0,19.0,18.0,17.0] || -> equal(nil,sk2)**.
% 1.39/1.62 2415[5:MRR:2414.0,203.0] || -> .
% 1.39/1.62 2416[5:Spt:2415.0,200.0,2367.0] || -> neq(sk2,nil)*.
% 1.39/1.62 2417[5:Spt:2415.0,200.1] || -> neq(sk1,nil)*.
% 1.39/1.62 2418[5:MRR:562.1,2417.0] || rearsegP(sk2,sk1)* -> .
% 1.39/1.62 2419[5:MRR:199.0,199.1,2416.0,2418.0] || -> .
% 1.39/1.62 % SZS output end Refutation
% 1.39/1.62 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause58 clause59 clause72 clause100 clause102 clause177
% 1.39/1.62
%------------------------------------------------------------------------------