TSTP Solution File: SWC116-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC116-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:49 EDT 2022
% Result : Unsatisfiable 1.36s 1.54s
% Output : Refutation 1.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC116-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 21:30:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.36/1.54
% 1.36/1.54 SPASS V 3.9
% 1.36/1.54 SPASS beiseite: Proof found.
% 1.36/1.54 % SZS status Theorem
% 1.36/1.54 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.36/1.54 SPASS derived 1910 clauses, backtracked 1779 clauses, performed 75 splits and kept 3397 clauses.
% 1.36/1.54 SPASS allocated 77518 KBytes.
% 1.36/1.54 SPASS spent 0:00:01.18 on the problem.
% 1.36/1.54 0:00:00.04 for the input.
% 1.36/1.54 0:00:00.00 for the FLOTTER CNF translation.
% 1.36/1.54 0:00:00.01 for inferences.
% 1.36/1.54 0:00:00.02 for the backtracking.
% 1.36/1.54 0:00:00.92 for the reduction.
% 1.36/1.54
% 1.36/1.54
% 1.36/1.54 Here is a proof with depth 2, length 120 :
% 1.36/1.54 % SZS output start Refutation
% 1.36/1.54 1[0:Inp] || -> ssList(sk1)*.
% 1.36/1.54 2[0:Inp] || -> ssList(sk2)*.
% 1.36/1.54 5[0:Inp] || -> equal(sk4,sk2)**.
% 1.36/1.54 6[0:Inp] || -> equal(sk3,sk1)**.
% 1.36/1.54 7[0:Inp] || equal(nil,sk4)** -> equal(nil,sk3).
% 1.36/1.54 8[0:Inp] || equal(nil,sk2)** equal(nil,sk1) -> .
% 1.36/1.54 9[0:Inp] || segmentP(sk2,sk1)* neq(sk1,nil) -> .
% 1.36/1.54 10[0:Inp] || neq(sk4,nil)* -> neq(sk3,nil).
% 1.36/1.54 11[0:Inp] || neq(sk4,nil) -> segmentP(sk4,sk3)*.
% 1.36/1.54 12[0:Inp] || -> equalelemsP(nil)*.
% 1.36/1.54 13[0:Inp] || -> duplicatefreeP(nil)*.
% 1.36/1.54 14[0:Inp] || -> strictorderedP(nil)*.
% 1.36/1.54 15[0:Inp] || -> totalorderedP(nil)*.
% 1.36/1.54 16[0:Inp] || -> strictorderP(nil)*.
% 1.36/1.54 17[0:Inp] || -> totalorderP(nil)*.
% 1.36/1.54 18[0:Inp] || -> cyclefreeP(nil)*.
% 1.36/1.54 19[0:Inp] || -> ssList(nil)*.
% 1.36/1.54 67[0:Inp] ssList(u) || -> segmentP(u,nil)*.
% 1.36/1.54 83[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 1.36/1.54 111[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*.
% 1.36/1.54 113[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 1.36/1.54 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.36/1.54 199[0:Rew:5.0,11.1,6.0,11.1,5.0,11.0] || neq(sk2,nil) -> segmentP(sk2,sk1)*.
% 1.36/1.54 200[0:Rew:6.0,10.1,5.0,10.0] || neq(sk2,nil)* -> neq(sk1,nil).
% 1.36/1.54 201[0:Rew:6.0,7.1,5.0,7.0] || equal(nil,sk2)** -> equal(nil,sk1).
% 1.36/1.54 202[0:Rew:201.1,8.1] || equal(nil,sk2)** equal(sk1,sk1) -> .
% 1.36/1.54 203[0:Obv:202.1] || equal(nil,sk2)** -> .
% 1.36/1.54 289[0:Res:2.0,83.0] || -> ssItem(u)* duplicatefreeP(sk2)*.
% 1.36/1.54 290[0:Res:2.0,67.0] || -> segmentP(sk2,nil)*.
% 1.36/1.54 343[0:Res:2.0,111.1] ssList(u) || -> equal(sk2,u) neq(sk2,u)*.
% 1.36/1.54 438[0:Res:1.0,111.0] ssList(u) || -> equal(u,sk1) neq(u,sk1)*.
% 1.36/1.54 460[0:Res:1.0,83.0] || -> ssItem(u)* duplicatefreeP(sk1)*.
% 1.36/1.54 475[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.36/1.54 568[1:Spt:83.1] || -> ssItem(u)*.
% 1.36/1.54 600[1:MRR:113.1,113.0,568.0] || -> equal(u,v) neq(u,v)*.
% 1.36/1.54 766[2:Spt:475.5] || -> equal(nil,sk1)**.
% 1.36/1.54 767[2:Rew:766.0,200.0] || neq(sk2,sk1)* -> neq(sk1,nil).
% 1.36/1.54 769[2:Rew:766.0,9.1] || segmentP(sk2,sk1)* neq(sk1,sk1) -> .
% 1.36/1.54 818[2:Rew:766.0,290.0] || -> segmentP(sk2,sk1)*.
% 1.36/1.54 823[2:Rew:766.0,203.0] || equal(sk2,sk1)** -> .
% 1.36/1.54 881[2:Rew:766.0,767.1] || neq(sk2,sk1)* -> neq(sk1,sk1).
% 1.36/1.54 888[2:MRR:769.0,818.0] || neq(sk1,sk1)* -> .
% 1.36/1.54 889[2:MRR:881.1,888.0] || neq(sk2,sk1)* -> .
% 1.36/1.54 965[2:Res:600.1,889.0] || -> equal(sk2,sk1)**.
% 1.36/1.54 966[2:MRR:965.0,823.0] || -> .
% 1.36/1.54 967[2:Spt:966.0,475.5,766.0] || equal(nil,sk1)** -> .
% 1.36/1.54 968[2:Spt:966.0,475.0,475.1,475.2,475.3,475.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.36/1.54 1018[3:Spt:199.0] || neq(sk2,nil)* -> .
% 1.36/1.54 1019[3:Res:600.1,1018.0] || -> equal(nil,sk2)**.
% 1.36/1.54 1020[3:MRR:1019.0,203.0] || -> .
% 1.36/1.54 1021[3:Spt:1020.0,199.0,1018.0] || -> neq(sk2,nil)*.
% 1.36/1.54 1022[3:Spt:1020.0,199.1] || -> segmentP(sk2,sk1)*.
% 1.36/1.54 1023[3:MRR:9.0,1022.0] || neq(sk1,nil)* -> .
% 1.36/1.54 1024[3:MRR:200.0,200.1,1021.0,1023.0] || -> .
% 1.36/1.54 1025[1:Spt:1024.0,83.0,83.2] ssList(u) || -> duplicatefreeP(u)*.
% 1.36/1.54 1038[2:Spt:460.0] || -> ssItem(u)*.
% 1.36/1.54 1066[2:MRR:113.1,113.0,1038.0] || -> equal(u,v) neq(u,v)*.
% 1.36/1.54 1234[3:Spt:475.5] || -> equal(nil,sk1)**.
% 1.36/1.54 1244[3:Rew:1234.0,290.0] || -> segmentP(sk2,sk1)*.
% 1.36/1.54 1247[3:Rew:1234.0,203.0] || equal(sk2,sk1)** -> .
% 1.36/1.54 1302[3:Rew:1234.0,200.0] || neq(sk2,sk1)* -> neq(sk1,nil).
% 1.36/1.54 1303[3:Rew:1234.0,9.1] || segmentP(sk2,sk1)* neq(sk1,sk1) -> .
% 1.36/1.54 1354[3:Rew:1234.0,1302.1] || neq(sk2,sk1)* -> neq(sk1,sk1).
% 1.36/1.54 1381[3:MRR:1303.0,1244.0] || neq(sk1,sk1)* -> .
% 1.36/1.54 1382[3:MRR:1354.1,1381.0] || neq(sk2,sk1)* -> .
% 1.36/1.54 1430[3:Res:1066.1,1382.0] || -> equal(sk2,sk1)**.
% 1.36/1.54 1431[3:MRR:1430.0,1247.0] || -> .
% 1.36/1.54 1432[3:Spt:1431.0,475.5,1234.0] || equal(nil,sk1)** -> .
% 1.36/1.54 1433[3:Spt:1431.0,475.0,475.1,475.2,475.3,475.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.36/1.54 1483[4:Spt:200.0] || neq(sk2,nil)* -> .
% 1.36/1.54 1484[4:Res:1066.1,1483.0] || -> equal(nil,sk2)**.
% 1.36/1.54 1485[4:MRR:1484.0,203.0] || -> .
% 1.36/1.54 1486[4:Spt:1485.0,200.0,1483.0] || -> neq(sk2,nil)*.
% 1.36/1.54 1487[4:Spt:1485.0,200.1] || -> neq(sk1,nil)*.
% 1.36/1.54 1488[4:MRR:9.1,1487.0] || segmentP(sk2,sk1)* -> .
% 1.36/1.54 1489[4:MRR:199.0,199.1,1486.0,1488.0] || -> .
% 1.36/1.54 1490[2:Spt:1489.0,460.1] || -> duplicatefreeP(sk1)*.
% 1.36/1.54 1493[3:Spt:289.0] || -> ssItem(u)*.
% 1.36/1.54 1525[3:MRR:113.1,113.0,1493.0] || -> equal(u,v) neq(u,v)*.
% 1.36/1.54 1687[4:Spt:475.5] || -> equal(nil,sk1)**.
% 1.36/1.54 1702[4:Rew:1687.0,203.0] || equal(sk2,sk1)** -> .
% 1.36/1.54 1703[4:Rew:1687.0,290.0] || -> segmentP(sk2,sk1)*.
% 1.36/1.54 1754[4:Rew:1687.0,200.0] || neq(sk2,sk1)* -> neq(sk1,nil).
% 1.36/1.54 1756[4:Rew:1687.0,9.1] || segmentP(sk2,sk1)* neq(sk1,sk1) -> .
% 1.36/1.54 1807[4:Rew:1687.0,1754.1] || neq(sk2,sk1)* -> neq(sk1,sk1).
% 1.36/1.54 1834[4:MRR:1756.0,1703.0] || neq(sk1,sk1)* -> .
% 1.36/1.54 1835[4:MRR:1807.1,1834.0] || neq(sk2,sk1)* -> .
% 1.36/1.54 1883[4:Res:1525.1,1835.0] || -> equal(sk2,sk1)**.
% 1.36/1.54 1884[4:MRR:1883.0,1702.0] || -> .
% 1.36/1.54 1885[4:Spt:1884.0,475.5,1687.0] || equal(nil,sk1)** -> .
% 1.36/1.54 1886[4:Spt:1884.0,475.0,475.1,475.2,475.3,475.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.36/1.54 1935[5:Spt:199.0] || neq(sk2,nil)* -> .
% 1.36/1.54 1936[5:Res:1525.1,1935.0] || -> equal(nil,sk2)**.
% 1.36/1.54 1937[5:MRR:1936.0,203.0] || -> .
% 1.36/1.54 1938[5:Spt:1937.0,199.0,1935.0] || -> neq(sk2,nil)*.
% 1.36/1.54 1939[5:Spt:1937.0,199.1] || -> segmentP(sk2,sk1)*.
% 1.36/1.54 1940[5:MRR:9.0,1939.0] || neq(sk1,nil)* -> .
% 1.36/1.54 1941[5:MRR:200.0,200.1,1938.0,1940.0] || -> .
% 1.36/1.54 1942[3:Spt:1941.0,289.1] || -> duplicatefreeP(sk2)*.
% 1.36/1.54 1943[4:Spt:475.5] || -> equal(nil,sk1)**.
% 1.36/1.54 1952[4:Rew:1943.0,290.0] || -> segmentP(sk2,sk1)*.
% 1.36/1.54 1960[4:Rew:1943.0,203.0] || equal(sk2,sk1)** -> .
% 1.36/1.54 2012[4:Rew:1943.0,200.0] || neq(sk2,sk1)* -> neq(sk1,nil).
% 1.36/1.54 2013[4:Rew:1943.0,9.1] || segmentP(sk2,sk1)* neq(sk1,sk1) -> .
% 1.36/1.54 2060[4:Rew:1943.0,2012.1] || neq(sk2,sk1)* -> neq(sk1,sk1).
% 1.36/1.54 2089[4:MRR:2013.0,1952.0] || neq(sk1,sk1)* -> .
% 1.36/1.54 2090[4:MRR:2060.1,2089.0] || neq(sk2,sk1)* -> .
% 1.36/1.54 2303[4:Res:438.2,2090.0] ssList(sk2) || -> equal(sk2,sk1)**.
% 1.36/1.54 2342[4:SSi:2303.0,2.0,1942.0] || -> equal(sk2,sk1)**.
% 1.36/1.54 2343[4:MRR:2342.0,1960.0] || -> .
% 1.36/1.54 2348[4:Spt:2343.0,475.5,1943.0] || equal(nil,sk1)** -> .
% 1.36/1.54 2349[4:Spt:2343.0,475.0,475.1,475.2,475.3,475.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.36/1.54 2405[5:Spt:200.0] || neq(sk2,nil)* -> .
% 1.36/1.54 2437[5:Res:343.2,2405.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.36/1.54 2438[5:SSi:2437.0,19.0,18.0,17.0,16.0,15.0,14.0,13.0,12.0] || -> equal(nil,sk2)**.
% 1.36/1.54 2439[5:MRR:2438.0,203.0] || -> .
% 1.36/1.54 2440[5:Spt:2439.0,200.0,2405.0] || -> neq(sk2,nil)*.
% 1.36/1.54 2441[5:Spt:2439.0,200.1] || -> neq(sk1,nil)*.
% 1.36/1.54 2442[5:MRR:9.1,2441.0] || segmentP(sk2,sk1)* -> .
% 1.36/1.54 2443[5:MRR:199.0,199.1,2440.0,2442.0] || -> .
% 1.36/1.54 % SZS output end Refutation
% 1.36/1.54 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 clause56 clause72 clause100 clause102 clause177
% 1.36/1.54
%------------------------------------------------------------------------------