TSTP Solution File: SWC048+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC048+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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 : Theorem 0.92s 1.14s
% Output : Refutation 0.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC048+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 12 23:53:42 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.92/1.14
% 0.92/1.14 SPASS V 3.9
% 0.92/1.14 SPASS beiseite: Proof found.
% 0.92/1.14 % SZS status Theorem
% 0.92/1.14 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.92/1.14 SPASS derived 896 clauses, backtracked 588 clauses, performed 31 splits and kept 1342 clauses.
% 0.92/1.14 SPASS allocated 99142 KBytes.
% 0.92/1.14 SPASS spent 0:00:00.77 on the problem.
% 0.92/1.14 0:00:00.04 for the input.
% 0.92/1.14 0:00:00.07 for the FLOTTER CNF translation.
% 0.92/1.14 0:00:00.00 for inferences.
% 0.92/1.14 0:00:00.01 for the backtracking.
% 0.92/1.14 0:00:00.43 for the reduction.
% 0.92/1.14
% 0.92/1.14
% 0.92/1.14 Here is a proof with depth 2, length 76 :
% 0.92/1.14 % SZS output start Refutation
% 0.92/1.14 1[0:Inp] || -> ssList(skc5)*.
% 0.92/1.14 2[0:Inp] || -> ssList(skc4)*.
% 0.92/1.14 58[0:Inp] || -> SkP0(u,v)* equal(nil,v).
% 0.92/1.14 59[0:Inp] || -> SkP1(u,v)* equal(nil,v).
% 0.92/1.14 60[0:Inp] || -> SkP1(u,v)* equal(nil,u).
% 0.92/1.14 64[0:Inp] ssList(u) || -> rearsegP(u,u)*.
% 0.92/1.14 65[0:Inp] ssList(u) || -> rearsegP(u,nil)*.
% 0.92/1.14 69[0:Inp] || SkP0(skc4,skc5) -> neq(skc5,nil)*.
% 0.92/1.14 70[0:Inp] || SkP1(skc4,skc5) -> neq(skc4,nil)*.
% 0.92/1.14 71[0:Inp] || SkP1(skc4,skc5) -> rearsegP(skc5,skc4)*.
% 0.92/1.14 72[0:Inp] || equal(nil,u) -> SkP0(u,v)*.
% 0.92/1.14 95[0:Inp] ssList(u) || rearsegP(nil,u)* -> equal(nil,u).
% 0.92/1.14 155[0:Inp] ssList(u) || neq(u,nil) rearsegP(skc4,u) rearsegP(skc5,u)* SkP0(skc4,skc5) -> .
% 0.92/1.14 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.92/1.14 232[0:Res:2.0,155.0] || neq(skc4,nil) rearsegP(skc5,skc4)* rearsegP(skc4,skc4) SkP0(skc4,skc5) -> .
% 0.92/1.14 272[0:Res:2.0,95.0] || rearsegP(nil,skc4)* -> equal(skc4,nil).
% 0.92/1.14 282[0:Res:2.0,64.0] || -> rearsegP(skc4,skc4)*.
% 0.92/1.14 283[0:Res:2.0,65.0] || -> rearsegP(skc4,nil)*.
% 0.92/1.14 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.92/1.14 404[0:Res:1.0,155.0] || neq(skc5,nil) rearsegP(skc5,skc5)* rearsegP(skc4,skc5) SkP0(skc4,skc5) -> .
% 0.92/1.14 454[0:Res:1.0,64.0] || -> rearsegP(skc5,skc5)*.
% 0.92/1.14 455[0:Res:1.0,65.0] || -> rearsegP(skc5,nil)*.
% 0.92/1.14 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.92/1.14 546[0:MRR:232.2,282.0] || SkP0(skc4,skc5) rearsegP(skc5,skc4)* neq(skc4,nil) -> .
% 0.92/1.14 547[0:MRR:404.0,404.1,69.1,454.0] || SkP0(skc4,skc5) rearsegP(skc4,skc5)* -> .
% 0.92/1.14 556[1:Spt:286.5] || -> equal(skc4,nil)**.
% 0.92/1.14 559[1:Rew:556.0,70.0] || SkP1(nil,skc5) -> neq(skc4,nil)*.
% 0.92/1.14 561[1:Rew:556.0,546.1] || SkP0(skc4,skc5) rearsegP(skc5,nil)* neq(skc4,nil) -> .
% 0.92/1.14 563[1:Rew:556.0,547.0] || SkP0(nil,skc5) rearsegP(skc4,skc5)* -> .
% 0.92/1.14 564[1:Rew:556.0,69.0] || SkP0(nil,skc5) -> neq(skc5,nil)*.
% 0.92/1.14 668[1:Rew:556.0,283.0] || -> rearsegP(nil,nil)*.
% 0.92/1.14 713[1:Rew:556.0,559.1] || SkP1(nil,skc5) -> neq(nil,nil)*.
% 0.92/1.14 725[1:Rew:556.0,563.1] || SkP0(nil,skc5) rearsegP(nil,skc5)* -> .
% 0.92/1.14 744[1:Rew:556.0,561.2,556.0,561.0] || SkP0(nil,skc5) rearsegP(skc5,nil)* neq(nil,nil) -> .
% 0.92/1.14 745[1:MRR:744.1,455.0] || SkP0(nil,skc5) neq(nil,nil)* -> .
% 0.92/1.14 823[2:Spt:458.5] || -> equal(skc5,nil)**.
% 0.92/1.14 863[2:Rew:823.0,725.1] || SkP0(nil,skc5) rearsegP(nil,nil)* -> .
% 0.92/1.14 990[2:Rew:823.0,863.0] || SkP0(nil,nil) rearsegP(nil,nil)* -> .
% 0.92/1.14 991[2:MRR:990.1,668.0] || SkP0(nil,nil)* -> .
% 0.92/1.14 1078[2:Res:72.1,991.0] || equal(nil,nil)* -> .
% 0.92/1.14 1079[2:Obv:1078.0] || -> .
% 0.92/1.14 1080[2:Spt:1079.0,458.5,823.0] || equal(skc5,nil)** -> .
% 0.92/1.14 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.92/1.14 1107[3:Spt:564.0] || SkP0(nil,skc5)* -> .
% 0.92/1.14 1108[3:Res:72.1,1107.0] || equal(nil,nil)* -> .
% 0.92/1.14 1111[3:Obv:1108.0] || -> .
% 0.92/1.14 1112[3:Spt:1111.0,564.0,1107.0] || -> SkP0(nil,skc5)*.
% 0.92/1.14 1113[3:Spt:1111.0,564.1] || -> neq(skc5,nil)*.
% 0.92/1.14 1114[3:MRR:745.0,1112.0] || neq(nil,nil)* -> .
% 0.92/1.14 1115[3:MRR:713.1,1114.0] || SkP1(nil,skc5)* -> .
% 0.92/1.14 1117[3:Res:59.0,1115.0] || -> equal(skc5,nil)**.
% 0.92/1.14 1119[3:MRR:1117.0,1080.0] || -> .
% 0.92/1.14 1120[1:Spt:1119.0,286.5,556.0] || equal(skc4,nil)** -> .
% 0.92/1.14 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.92/1.14 1125[1:MRR:272.1,1120.0] || rearsegP(nil,skc4)* -> .
% 0.92/1.14 1136[2:Spt:458.5] || -> equal(skc5,nil)**.
% 0.92/1.14 1282[2:Rew:1136.0,71.0] || SkP1(skc4,nil) -> rearsegP(skc5,skc4)*.
% 0.92/1.14 1302[2:Rew:1136.0,1282.1] || SkP1(skc4,nil) -> rearsegP(nil,skc4)*.
% 0.92/1.14 1303[2:MRR:1302.1,1125.0] || SkP1(skc4,nil)* -> .
% 0.92/1.14 1409[2:Res:60.0,1303.0] || -> equal(skc4,nil)**.
% 0.92/1.14 1410[2:MRR:1409.0,1120.0] || -> .
% 0.92/1.14 1411[2:Spt:1410.0,458.5,1136.0] || equal(skc5,nil)** -> .
% 0.92/1.14 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.92/1.14 1452[3:Spt:69.0] || SkP0(skc4,skc5)* -> .
% 0.92/1.14 1454[3:Res:58.0,1452.0] || -> equal(skc5,nil)**.
% 0.92/1.14 1455[3:MRR:1454.0,1411.0] || -> .
% 0.92/1.14 1456[3:Spt:1455.0,69.0,1452.0] || -> SkP0(skc4,skc5)*.
% 0.92/1.14 1457[3:Spt:1455.0,69.1] || -> neq(skc5,nil)*.
% 0.92/1.14 1459[3:MRR:546.0,1456.0] || rearsegP(skc5,skc4)* neq(skc4,nil) -> .
% 0.92/1.14 1467[4:Spt:71.0] || SkP1(skc4,skc5)* -> .
% 0.92/1.14 1469[4:Res:60.0,1467.0] || -> equal(skc4,nil)**.
% 0.92/1.14 1471[4:MRR:1469.0,1120.0] || -> .
% 0.92/1.14 1472[4:Spt:1471.0,71.0,1467.0] || -> SkP1(skc4,skc5)*.
% 0.92/1.14 1473[4:Spt:1471.0,71.1] || -> rearsegP(skc5,skc4)*.
% 0.92/1.14 1474[4:MRR:1459.0,1473.0] || neq(skc4,nil)* -> .
% 0.92/1.14 1475[4:MRR:70.0,70.1,1472.0,1474.0] || -> .
% 0.92/1.14 % SZS output end Refutation
% 0.92/1.14 Formulae used in the proof : co1 ax49 ax51 ax52 ax77
% 0.92/1.14
%------------------------------------------------------------------------------