TSTP Solution File: SWC060+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC060+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:27 EDT 2022
% Result : Theorem 0.83s 1.01s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC060+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 21:45:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.83/1.01
% 0.83/1.01 SPASS V 3.9
% 0.83/1.01 SPASS beiseite: Proof found.
% 0.83/1.01 % SZS status Theorem
% 0.83/1.01 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.83/1.01 SPASS derived 896 clauses, backtracked 588 clauses, performed 31 splits and kept 1342 clauses.
% 0.83/1.01 SPASS allocated 99142 KBytes.
% 0.83/1.01 SPASS spent 0:00:00.66 on the problem.
% 0.83/1.01 0:00:00.04 for the input.
% 0.83/1.01 0:00:00.07 for the FLOTTER CNF translation.
% 0.83/1.01 0:00:00.00 for inferences.
% 0.83/1.01 0:00:00.00 for the backtracking.
% 0.83/1.01 0:00:00.38 for the reduction.
% 0.83/1.01
% 0.83/1.01
% 0.83/1.01 Here is a proof with depth 2, length 76 :
% 0.83/1.01 % SZS output start Refutation
% 0.83/1.01 1[0:Inp] || -> ssList(skc5)*.
% 0.83/1.01 2[0:Inp] || -> ssList(skc4)*.
% 0.83/1.01 58[0:Inp] || -> SkP0(u,v)* equal(nil,v).
% 0.83/1.01 59[0:Inp] || -> SkP1(u,v)* equal(nil,v).
% 0.83/1.01 60[0:Inp] || -> SkP1(u,v)* equal(nil,u).
% 0.83/1.01 66[0:Inp] ssList(u) || -> segmentP(u,u)*.
% 0.83/1.01 67[0:Inp] ssList(u) || -> segmentP(u,nil)*.
% 0.83/1.01 69[0:Inp] || SkP0(skc4,skc5) -> neq(skc5,nil)*.
% 0.83/1.01 70[0:Inp] || SkP1(skc4,skc5) -> neq(skc4,nil)*.
% 0.83/1.01 71[0:Inp] || SkP1(skc4,skc5) -> segmentP(skc5,skc4)*.
% 0.83/1.01 72[0:Inp] || equal(nil,u) -> SkP0(u,v)*.
% 0.83/1.01 97[0:Inp] ssList(u) || segmentP(nil,u)* -> equal(nil,u).
% 0.83/1.01 155[0:Inp] ssList(u) || neq(u,nil) segmentP(skc4,u) segmentP(skc5,u)* SkP0(skc4,skc5) -> .
% 0.83/1.01 188[0:Inp] ssList(u) ssList(v) || equal(tl(u),tl(v))* equal(hd(u),hd(v)) -> equal(u,v) equal(nil,v) equal(nil,u).
% 0.83/1.01 232[0:Res:2.0,155.0] || neq(skc4,nil) segmentP(skc5,skc4)* segmentP(skc4,skc4) SkP0(skc4,skc5) -> .
% 0.83/1.01 274[0:Res:2.0,97.0] || segmentP(nil,skc4)* -> equal(skc4,nil).
% 0.83/1.01 284[0:Res:2.0,66.0] || -> segmentP(skc4,skc4)*.
% 0.83/1.01 285[0:Res:2.0,67.0] || -> segmentP(skc4,nil)*.
% 0.83/1.01 286[0:Res:2.0,188.1] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u) equal(skc4,nil).
% 0.83/1.01 404[0:Res:1.0,155.0] || neq(skc5,nil) segmentP(skc5,skc5)* segmentP(skc4,skc5) SkP0(skc4,skc5) -> .
% 0.83/1.01 456[0:Res:1.0,66.0] || -> segmentP(skc5,skc5)*.
% 0.83/1.01 457[0:Res:1.0,67.0] || -> segmentP(skc5,nil)*.
% 0.83/1.01 458[0:Res:1.0,188.1] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u) equal(skc5,nil).
% 0.83/1.01 546[0:MRR:232.2,284.0] || SkP0(skc4,skc5) segmentP(skc5,skc4)* neq(skc4,nil) -> .
% 0.83/1.01 547[0:MRR:404.0,404.1,69.1,456.0] || SkP0(skc4,skc5) segmentP(skc4,skc5)* -> .
% 0.83/1.01 556[1:Spt:286.5] || -> equal(skc4,nil)**.
% 0.83/1.01 559[1:Rew:556.0,70.0] || SkP1(nil,skc5) -> neq(skc4,nil)*.
% 0.83/1.01 561[1:Rew:556.0,546.1] || SkP0(skc4,skc5) segmentP(skc5,nil)* neq(skc4,nil) -> .
% 0.83/1.01 563[1:Rew:556.0,547.0] || SkP0(nil,skc5) segmentP(skc4,skc5)* -> .
% 0.83/1.01 564[1:Rew:556.0,69.0] || SkP0(nil,skc5) -> neq(skc5,nil)*.
% 0.83/1.01 666[1:Rew:556.0,285.0] || -> segmentP(nil,nil)*.
% 0.83/1.01 713[1:Rew:556.0,559.1] || SkP1(nil,skc5) -> neq(nil,nil)*.
% 0.83/1.01 725[1:Rew:556.0,563.1] || SkP0(nil,skc5) segmentP(nil,skc5)* -> .
% 0.83/1.01 744[1:Rew:556.0,561.2,556.0,561.0] || SkP0(nil,skc5) segmentP(skc5,nil)* neq(nil,nil) -> .
% 0.83/1.01 745[1:MRR:744.1,457.0] || SkP0(nil,skc5) neq(nil,nil)* -> .
% 0.83/1.01 823[2:Spt:458.5] || -> equal(skc5,nil)**.
% 0.83/1.01 863[2:Rew:823.0,725.1] || SkP0(nil,skc5) segmentP(nil,nil)* -> .
% 0.83/1.01 990[2:Rew:823.0,863.0] || SkP0(nil,nil) segmentP(nil,nil)* -> .
% 0.83/1.01 991[2:MRR:990.1,666.0] || SkP0(nil,nil)* -> .
% 0.83/1.01 1078[2:Res:72.1,991.0] || equal(nil,nil)* -> .
% 0.83/1.01 1079[2:Obv:1078.0] || -> .
% 0.83/1.01 1080[2:Spt:1079.0,458.5,823.0] || equal(skc5,nil)** -> .
% 0.83/1.01 1081[2:Spt:1079.0,458.0,458.1,458.2,458.3,458.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u).
% 0.83/1.01 1107[3:Spt:564.0] || SkP0(nil,skc5)* -> .
% 0.83/1.01 1108[3:Res:72.1,1107.0] || equal(nil,nil)* -> .
% 0.83/1.01 1111[3:Obv:1108.0] || -> .
% 0.83/1.01 1112[3:Spt:1111.0,564.0,1107.0] || -> SkP0(nil,skc5)*.
% 0.83/1.01 1113[3:Spt:1111.0,564.1] || -> neq(skc5,nil)*.
% 0.83/1.01 1114[3:MRR:745.0,1112.0] || neq(nil,nil)* -> .
% 0.83/1.01 1115[3:MRR:713.1,1114.0] || SkP1(nil,skc5)* -> .
% 0.83/1.01 1117[3:Res:59.0,1115.0] || -> equal(skc5,nil)**.
% 0.83/1.01 1119[3:MRR:1117.0,1080.0] || -> .
% 0.83/1.01 1120[1:Spt:1119.0,286.5,556.0] || equal(skc4,nil)** -> .
% 0.83/1.01 1121[1:Spt:1119.0,286.0,286.1,286.2,286.3,286.4] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u).
% 0.83/1.01 1124[1:MRR:274.1,1120.0] || segmentP(nil,skc4)* -> .
% 0.83/1.01 1136[2:Spt:458.5] || -> equal(skc5,nil)**.
% 0.83/1.01 1282[2:Rew:1136.0,71.0] || SkP1(skc4,nil) -> segmentP(skc5,skc4)*.
% 0.83/1.01 1302[2:Rew:1136.0,1282.1] || SkP1(skc4,nil) -> segmentP(nil,skc4)*.
% 0.83/1.01 1303[2:MRR:1302.1,1124.0] || SkP1(skc4,nil)* -> .
% 0.83/1.01 1409[2:Res:60.0,1303.0] || -> equal(skc4,nil)**.
% 0.83/1.01 1410[2:MRR:1409.0,1120.0] || -> .
% 0.83/1.01 1411[2:Spt:1410.0,458.5,1136.0] || equal(skc5,nil)** -> .
% 0.83/1.01 1412[2:Spt:1410.0,458.0,458.1,458.2,458.3,458.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u).
% 0.83/1.01 1453[3:Spt:69.0] || SkP0(skc4,skc5)* -> .
% 0.83/1.01 1455[3:Res:58.0,1453.0] || -> equal(skc5,nil)**.
% 0.83/1.01 1456[3:MRR:1455.0,1411.0] || -> .
% 0.83/1.01 1457[3:Spt:1456.0,69.0,1453.0] || -> SkP0(skc4,skc5)*.
% 0.83/1.01 1458[3:Spt:1456.0,69.1] || -> neq(skc5,nil)*.
% 0.83/1.01 1460[3:MRR:546.0,1457.0] || segmentP(skc5,skc4)* neq(skc4,nil) -> .
% 0.83/1.01 1467[4:Spt:71.0] || SkP1(skc4,skc5)* -> .
% 0.83/1.01 1469[4:Res:60.0,1467.0] || -> equal(skc4,nil)**.
% 0.83/1.01 1471[4:MRR:1469.0,1120.0] || -> .
% 0.83/1.01 1472[4:Spt:1471.0,71.0,1467.0] || -> SkP1(skc4,skc5)*.
% 0.83/1.01 1473[4:Spt:1471.0,71.1] || -> segmentP(skc5,skc4)*.
% 0.83/1.01 1474[4:MRR:1460.0,1473.0] || neq(skc4,nil)* -> .
% 0.83/1.01 1475[4:MRR:70.0,70.1,1472.0,1474.0] || -> .
% 0.83/1.01 % SZS output end Refutation
% 0.83/1.01 Formulae used in the proof : co1 ax55 ax57 ax58 ax77
% 0.83/1.01
%------------------------------------------------------------------------------