TSTP Solution File: SWC017+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC017+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n005.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:07 EDT 2022

% Result   : Theorem 0.79s 1.02s
% Output   : Refutation 0.79s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SWC017+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n005.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jun 12 06:47:39 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.79/1.02  
% 0.79/1.02  SPASS V 3.9 
% 0.79/1.02  SPASS beiseite: Proof found.
% 0.79/1.02  % SZS status Theorem
% 0.79/1.02  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.79/1.02  SPASS derived 896 clauses, backtracked 588 clauses, performed 31 splits and kept 1342 clauses.
% 0.79/1.02  SPASS allocated 99141 KBytes.
% 0.79/1.02  SPASS spent	0:00:00.65 on the problem.
% 0.79/1.02  		0:00:00.04 for the input.
% 0.79/1.02  		0:00:00.07 for the FLOTTER CNF translation.
% 0.79/1.02  		0:00:00.00 for inferences.
% 0.79/1.02  		0:00:00.01 for the backtracking.
% 0.79/1.02  		0:00:00.38 for the reduction.
% 0.79/1.02  
% 0.79/1.02  
% 0.79/1.02  Here is a proof with depth 2, length 76 :
% 0.79/1.02  % SZS output start Refutation
% 0.79/1.02  1[0:Inp] ||  -> ssList(skc5)*.
% 0.79/1.02  2[0:Inp] ||  -> ssList(skc4)*.
% 0.79/1.02  58[0:Inp] ||  -> SkP0(u,v)* equal(nil,v).
% 0.79/1.02  59[0:Inp] ||  -> SkP1(u,v)* equal(nil,v).
% 0.79/1.02  60[0:Inp] ||  -> SkP1(u,v)* equal(nil,u).
% 0.79/1.02  62[0:Inp] ssList(u) ||  -> frontsegP(u,u)*.
% 0.79/1.02  63[0:Inp] ssList(u) ||  -> frontsegP(u,nil)*.
% 0.79/1.02  69[0:Inp] || SkP0(skc4,skc5) -> neq(skc5,nil)*.
% 0.79/1.02  70[0:Inp] || SkP1(skc4,skc5) -> neq(skc4,nil)*.
% 0.79/1.02  71[0:Inp] || SkP1(skc4,skc5) -> frontsegP(skc5,skc4)*.
% 0.79/1.02  72[0:Inp] || equal(nil,u) -> SkP0(u,v)*.
% 0.79/1.02  93[0:Inp] ssList(u) || frontsegP(nil,u)* -> equal(nil,u).
% 0.79/1.02  155[0:Inp] ssList(u) || neq(u,nil) frontsegP(skc4,u) frontsegP(skc5,u)* SkP0(skc4,skc5) -> .
% 0.79/1.02  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.79/1.02  232[0:Res:2.0,155.0] || neq(skc4,nil) frontsegP(skc5,skc4)* frontsegP(skc4,skc4) SkP0(skc4,skc5) -> .
% 0.79/1.02  270[0:Res:2.0,93.0] || frontsegP(nil,skc4)* -> equal(skc4,nil).
% 0.79/1.02  280[0:Res:2.0,62.0] ||  -> frontsegP(skc4,skc4)*.
% 0.79/1.02  281[0:Res:2.0,63.0] ||  -> frontsegP(skc4,nil)*.
% 0.79/1.02  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.79/1.02  404[0:Res:1.0,155.0] || neq(skc5,nil) frontsegP(skc5,skc5)* frontsegP(skc4,skc5) SkP0(skc4,skc5) -> .
% 0.79/1.02  452[0:Res:1.0,62.0] ||  -> frontsegP(skc5,skc5)*.
% 0.79/1.02  453[0:Res:1.0,63.0] ||  -> frontsegP(skc5,nil)*.
% 0.79/1.02  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.79/1.02  546[0:MRR:232.2,280.0] || SkP0(skc4,skc5) frontsegP(skc5,skc4)* neq(skc4,nil) -> .
% 0.79/1.02  547[0:MRR:404.0,404.1,69.1,452.0] || SkP0(skc4,skc5) frontsegP(skc4,skc5)* -> .
% 0.79/1.02  556[1:Spt:286.5] ||  -> equal(skc4,nil)**.
% 0.79/1.02  559[1:Rew:556.0,70.0] || SkP1(nil,skc5) -> neq(skc4,nil)*.
% 0.79/1.02  561[1:Rew:556.0,546.1] || SkP0(skc4,skc5) frontsegP(skc5,nil)* neq(skc4,nil) -> .
% 0.79/1.02  563[1:Rew:556.0,547.0] || SkP0(nil,skc5) frontsegP(skc4,skc5)* -> .
% 0.79/1.02  564[1:Rew:556.0,69.0] || SkP0(nil,skc5) -> neq(skc5,nil)*.
% 0.79/1.02  670[1:Rew:556.0,281.0] ||  -> frontsegP(nil,nil)*.
% 0.79/1.02  713[1:Rew:556.0,559.1] || SkP1(nil,skc5) -> neq(nil,nil)*.
% 0.79/1.02  725[1:Rew:556.0,563.1] || SkP0(nil,skc5) frontsegP(nil,skc5)* -> .
% 0.79/1.02  744[1:Rew:556.0,561.2,556.0,561.0] || SkP0(nil,skc5) frontsegP(skc5,nil)* neq(nil,nil) -> .
% 0.79/1.02  745[1:MRR:744.1,453.0] || SkP0(nil,skc5) neq(nil,nil)* -> .
% 0.79/1.02  823[2:Spt:458.5] ||  -> equal(skc5,nil)**.
% 0.79/1.02  865[2:Rew:823.0,725.1] || SkP0(nil,skc5) frontsegP(nil,nil)* -> .
% 0.79/1.02  990[2:Rew:823.0,865.0] || SkP0(nil,nil) frontsegP(nil,nil)* -> .
% 0.79/1.02  991[2:MRR:990.1,670.0] || SkP0(nil,nil)* -> .
% 0.79/1.02  1078[2:Res:72.1,991.0] || equal(nil,nil)* -> .
% 0.79/1.02  1079[2:Obv:1078.0] ||  -> .
% 0.79/1.02  1080[2:Spt:1079.0,458.5,823.0] || equal(skc5,nil)** -> .
% 0.79/1.02  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.79/1.02  1107[3:Spt:564.0] || SkP0(nil,skc5)* -> .
% 0.79/1.02  1108[3:Res:72.1,1107.0] || equal(nil,nil)* -> .
% 0.79/1.02  1111[3:Obv:1108.0] ||  -> .
% 0.79/1.02  1112[3:Spt:1111.0,564.0,1107.0] ||  -> SkP0(nil,skc5)*.
% 0.79/1.02  1113[3:Spt:1111.0,564.1] ||  -> neq(skc5,nil)*.
% 0.79/1.02  1114[3:MRR:745.0,1112.0] || neq(nil,nil)* -> .
% 0.79/1.02  1115[3:MRR:713.1,1114.0] || SkP1(nil,skc5)* -> .
% 0.79/1.02  1117[3:Res:59.0,1115.0] ||  -> equal(skc5,nil)**.
% 0.79/1.02  1119[3:MRR:1117.0,1080.0] ||  -> .
% 0.79/1.02  1120[1:Spt:1119.0,286.5,556.0] || equal(skc4,nil)** -> .
% 0.79/1.02  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.79/1.02  1126[1:MRR:270.1,1120.0] || frontsegP(nil,skc4)* -> .
% 0.79/1.02  1136[2:Spt:458.5] ||  -> equal(skc5,nil)**.
% 0.79/1.02  1282[2:Rew:1136.0,71.0] || SkP1(skc4,nil) -> frontsegP(skc5,skc4)*.
% 0.79/1.02  1302[2:Rew:1136.0,1282.1] || SkP1(skc4,nil) -> frontsegP(nil,skc4)*.
% 0.79/1.02  1303[2:MRR:1302.1,1126.0] || SkP1(skc4,nil)* -> .
% 0.79/1.02  1409[2:Res:60.0,1303.0] ||  -> equal(skc4,nil)**.
% 0.79/1.02  1410[2:MRR:1409.0,1120.0] ||  -> .
% 0.79/1.02  1411[2:Spt:1410.0,458.5,1136.0] || equal(skc5,nil)** -> .
% 0.79/1.02  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.79/1.02  1451[3:Spt:69.0] || SkP0(skc4,skc5)* -> .
% 0.79/1.02  1453[3:Res:58.0,1451.0] ||  -> equal(skc5,nil)**.
% 0.79/1.02  1454[3:MRR:1453.0,1411.0] ||  -> .
% 0.79/1.02  1455[3:Spt:1454.0,69.0,1451.0] ||  -> SkP0(skc4,skc5)*.
% 0.79/1.02  1456[3:Spt:1454.0,69.1] ||  -> neq(skc5,nil)*.
% 0.79/1.02  1458[3:MRR:546.0,1455.0] || frontsegP(skc5,skc4)* neq(skc4,nil) -> .
% 0.79/1.02  1467[4:Spt:71.0] || SkP1(skc4,skc5)* -> .
% 0.79/1.02  1469[4:Res:60.0,1467.0] ||  -> equal(skc4,nil)**.
% 0.79/1.02  1471[4:MRR:1469.0,1120.0] ||  -> .
% 0.79/1.02  1472[4:Spt:1471.0,71.0,1467.0] ||  -> SkP1(skc4,skc5)*.
% 0.79/1.02  1473[4:Spt:1471.0,71.1] ||  -> frontsegP(skc5,skc4)*.
% 0.79/1.02  1474[4:MRR:1458.0,1473.0] || neq(skc4,nil)* -> .
% 0.79/1.02  1475[4:MRR:70.0,70.1,1472.0,1474.0] ||  -> .
% 0.79/1.02  % SZS output end Refutation
% 0.79/1.02  Formulae used in the proof : co1 ax42 ax45 ax46 ax77
% 0.79/1.02  
%------------------------------------------------------------------------------