TSTP Solution File: SWC369-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC369-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:03:37 EDT 2022
% Result : Unsatisfiable 1.31s 1.46s
% Output : Refutation 1.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWC369-1 : TPTP v8.1.0. Released v2.4.0.
% 0.09/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n016.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 10:42:42 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.31/1.46
% 1.31/1.46 SPASS V 3.9
% 1.31/1.46 SPASS beiseite: Proof found.
% 1.31/1.46 % SZS status Theorem
% 1.31/1.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.31/1.46 SPASS derived 1761 clauses, backtracked 1640 clauses, performed 55 splits and kept 3269 clauses.
% 1.31/1.46 SPASS allocated 77476 KBytes.
% 1.31/1.46 SPASS spent 0:00:01.11 on the problem.
% 1.31/1.46 0:00:00.04 for the input.
% 1.31/1.46 0:00:00.00 for the FLOTTER CNF translation.
% 1.31/1.46 0:00:00.01 for inferences.
% 1.31/1.46 0:00:00.02 for the backtracking.
% 1.31/1.46 0:00:00.88 for the reduction.
% 1.31/1.46
% 1.31/1.46
% 1.31/1.46 Here is a proof with depth 2, length 70 :
% 1.31/1.46 % SZS output start Refutation
% 1.31/1.46 1[0:Inp] || -> ssList(sk1)*.
% 1.31/1.46 2[0:Inp] || -> ssList(sk2)*.
% 1.31/1.46 5[0:Inp] || -> equal(sk4,sk2)**.
% 1.31/1.46 6[0:Inp] || -> equal(sk3,sk1)**.
% 1.31/1.46 7[0:Inp] || segmentP(sk2,sk1)* -> .
% 1.31/1.46 8[0:Inp] || equal(nil,sk4)** -> equal(nil,sk3).
% 1.31/1.46 10[0:Inp] || neq(sk4,nil) -> segmentP(sk4,sk3)*.
% 1.31/1.46 11[0:Inp] || -> equalelemsP(nil)*.
% 1.31/1.46 12[0:Inp] || -> duplicatefreeP(nil)*.
% 1.31/1.46 13[0:Inp] || -> strictorderedP(nil)*.
% 1.31/1.46 14[0:Inp] || -> totalorderedP(nil)*.
% 1.31/1.46 15[0:Inp] || -> strictorderP(nil)*.
% 1.31/1.46 16[0:Inp] || -> totalorderP(nil)*.
% 1.31/1.46 17[0:Inp] || -> cyclefreeP(nil)*.
% 1.31/1.46 18[0:Inp] || -> ssList(nil)*.
% 1.31/1.46 66[0:Inp] ssList(u) || -> segmentP(u,nil)*.
% 1.31/1.46 82[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 1.31/1.46 110[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*.
% 1.31/1.46 112[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 1.31/1.46 187[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.31/1.46 198[0:Rew:5.0,10.1,6.0,10.1,5.0,10.0] || neq(sk2,nil) -> segmentP(sk2,sk1)*.
% 1.31/1.46 199[0:MRR:198.1,7.0] || neq(sk2,nil)* -> .
% 1.31/1.46 201[0:Rew:6.0,8.1,5.0,8.0] || equal(nil,sk2)** -> equal(nil,sk1).
% 1.31/1.46 287[0:Res:2.0,82.0] || -> ssItem(u)* duplicatefreeP(sk2)*.
% 1.31/1.46 288[0:Res:2.0,66.0] || -> segmentP(sk2,nil)*.
% 1.31/1.46 341[0:Res:2.0,110.1] ssList(u) || -> equal(sk2,u) neq(sk2,u)*.
% 1.31/1.46 458[0:Res:1.0,82.0] || -> ssItem(u)* duplicatefreeP(sk1)*.
% 1.31/1.46 473[0:Res:1.0,187.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1).
% 1.31/1.46 557[1:Spt:82.1] || -> ssItem(u)*.
% 1.31/1.46 587[1:MRR:112.1,112.0,557.0] || -> equal(u,v) neq(u,v)*.
% 1.31/1.46 761[2:Spt:473.5] || -> equal(nil,sk1)**.
% 1.31/1.46 831[2:Rew:761.0,288.0] || -> segmentP(sk2,sk1)*.
% 1.31/1.46 872[2:MRR:831.0,7.0] || -> .
% 1.31/1.46 957[2:Spt:872.0,473.5,761.0] || equal(nil,sk1)** -> .
% 1.31/1.46 958[2:Spt:872.0,473.0,473.1,473.2,473.3,473.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.31/1.46 963[2:MRR:201.1,957.0] || equal(nil,sk2)** -> .
% 1.31/1.46 1029[1:Res:587.1,199.0] || -> equal(nil,sk2)**.
% 1.31/1.46 1030[2:MRR:1029.0,963.0] || -> .
% 1.31/1.46 1031[1:Spt:1030.0,82.0,82.2] ssList(u) || -> duplicatefreeP(u)*.
% 1.31/1.46 1049[2:Spt:458.0] || -> ssItem(u)*.
% 1.31/1.46 1077[2:MRR:112.1,112.0,1049.0] || -> equal(u,v) neq(u,v)*.
% 1.31/1.46 1247[3:Spt:473.5] || -> equal(nil,sk1)**.
% 1.31/1.46 1257[3:Rew:1247.0,288.0] || -> segmentP(sk2,sk1)*.
% 1.31/1.46 1357[3:MRR:1257.0,7.0] || -> .
% 1.31/1.46 1442[3:Spt:1357.0,473.5,1247.0] || equal(nil,sk1)** -> .
% 1.31/1.46 1443[3:Spt:1357.0,473.0,473.1,473.2,473.3,473.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.31/1.46 1448[3:MRR:201.1,1442.0] || equal(nil,sk2)** -> .
% 1.31/1.46 1512[2:Res:1077.1,199.0] || -> equal(nil,sk2)**.
% 1.31/1.46 1513[3:MRR:1512.0,1448.0] || -> .
% 1.31/1.46 1514[2:Spt:1513.0,458.1] || -> duplicatefreeP(sk1)*.
% 1.31/1.46 1517[3:Spt:287.0] || -> ssItem(u)*.
% 1.31/1.46 1547[3:MRR:112.1,112.0,1517.0] || -> equal(u,v) neq(u,v)*.
% 1.31/1.46 1713[4:Spt:473.5] || -> equal(nil,sk1)**.
% 1.31/1.46 1728[4:Rew:1713.0,288.0] || -> segmentP(sk2,sk1)*.
% 1.31/1.46 1823[4:MRR:1728.0,7.0] || -> .
% 1.31/1.46 1908[4:Spt:1823.0,473.5,1713.0] || equal(nil,sk1)** -> .
% 1.31/1.46 1909[4:Spt:1823.0,473.0,473.1,473.2,473.3,473.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.31/1.46 1914[4:MRR:201.1,1908.0] || equal(nil,sk2)** -> .
% 1.31/1.46 1978[3:Res:1547.1,199.0] || -> equal(nil,sk2)**.
% 1.31/1.46 1979[4:MRR:1978.0,1914.0] || -> .
% 1.31/1.46 1980[3:Spt:1979.0,287.1] || -> duplicatefreeP(sk2)*.
% 1.31/1.46 1981[4:Spt:473.5] || -> equal(nil,sk1)**.
% 1.31/1.46 1990[4:Rew:1981.0,288.0] || -> segmentP(sk2,sk1)*.
% 1.31/1.46 2093[4:MRR:1990.0,7.0] || -> .
% 1.31/1.46 2177[4:Spt:2093.0,473.5,1981.0] || equal(nil,sk1)** -> .
% 1.31/1.46 2178[4:Spt:2093.0,473.0,473.1,473.2,473.3,473.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.31/1.46 2184[4:MRR:201.1,2177.0] || equal(nil,sk2)** -> .
% 1.31/1.46 2297[0:Res:341.2,199.0] ssList(nil) || -> equal(nil,sk2)**.
% 1.31/1.46 2298[0:SSi:2297.0,18.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0] || -> equal(nil,sk2)**.
% 1.31/1.46 2299[4:MRR:2298.0,2184.0] || -> .
% 1.31/1.46 % SZS output end Refutation
% 1.31/1.46 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_10 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause56 clause72 clause100 clause102 clause177
% 1.31/1.46
%------------------------------------------------------------------------------