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

View Problem - Process Solution

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

% Computer : n022.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:45 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC105+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n022.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 09:12:48 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.81/1.02  
% 0.81/1.02  SPASS V 3.9 
% 0.81/1.02  SPASS beiseite: Proof found.
% 0.81/1.02  % SZS status Theorem
% 0.81/1.02  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.81/1.02  SPASS derived 882 clauses, backtracked 577 clauses, performed 29 splits and kept 1323 clauses.
% 0.81/1.02  SPASS allocated 99124 KBytes.
% 0.81/1.02  SPASS spent	0:00:00.67 on the problem.
% 0.81/1.02  		0:00:00.04 for the input.
% 0.81/1.02  		0:00:00.07 for the FLOTTER CNF translation.
% 0.81/1.02  		0:00:00.00 for inferences.
% 0.81/1.02  		0:00:00.01 for the backtracking.
% 0.81/1.02  		0:00:00.39 for the reduction.
% 0.81/1.02  
% 0.81/1.02  
% 0.81/1.02  Here is a proof with depth 2, length 62 :
% 0.81/1.02  % SZS output start Refutation
% 0.81/1.02  1[0:Inp] ||  -> ssList(skc5)*.
% 0.81/1.02  2[0:Inp] ||  -> ssList(skc4)*.
% 0.81/1.02  58[0:Inp] ||  -> SkP0(u,v)* equal(nil,v).
% 0.81/1.02  59[0:Inp] ||  -> SkP1(u,v)* equal(nil,v).
% 0.81/1.02  60[0:Inp] ||  -> SkP1(u,v)* equal(nil,u).
% 0.81/1.02  65[0:Inp] ssList(u) ||  -> rearsegP(u,nil)*.
% 0.81/1.02  69[0:Inp] || SkP0(skc4,skc5) -> neq(skc5,nil)*.
% 0.81/1.02  70[0:Inp] || SkP1(skc4,skc5) -> neq(skc4,nil)*.
% 0.81/1.02  71[0:Inp] || SkP1(skc4,skc5) -> rearsegP(skc5,skc4)*.
% 0.81/1.02  72[0:Inp] || equal(nil,u) -> SkP0(u,v)*.
% 0.81/1.02  95[0:Inp] ssList(u) || rearsegP(nil,u)* -> equal(nil,u).
% 0.81/1.02  106[0:Inp] || SkP0(skc4,skc5) rearsegP(skc5,skc4)* neq(skc4,nil) -> .
% 0.81/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.81/1.02  271[0:Res:2.0,95.0] || rearsegP(nil,skc4)* -> equal(skc4,nil).
% 0.81/1.02  285[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.81/1.02  453[0:Res:1.0,65.0] ||  -> rearsegP(skc5,nil)*.
% 0.81/1.02  456[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.81/1.02  552[1:Spt:285.5] ||  -> equal(skc4,nil)**.
% 0.81/1.02  555[1:Rew:552.0,70.0] || SkP1(nil,skc5) -> neq(skc4,nil)*.
% 0.81/1.02  557[1:Rew:552.0,106.1] || SkP0(skc4,skc5) rearsegP(skc5,nil)* neq(skc4,nil) -> .
% 0.81/1.02  558[1:Rew:552.0,69.0] || SkP0(nil,skc5) -> neq(skc5,nil)*.
% 0.81/1.02  707[1:Rew:552.0,555.1] || SkP1(nil,skc5) -> neq(nil,nil)*.
% 0.81/1.02  737[1:Rew:552.0,557.2,552.0,557.0] || SkP0(nil,skc5) rearsegP(skc5,nil)* neq(nil,nil) -> .
% 0.81/1.02  738[1:MRR:737.1,453.0] || SkP0(nil,skc5) neq(nil,nil)* -> .
% 0.81/1.02  815[2:Spt:456.5] ||  -> equal(skc5,nil)**.
% 0.81/1.02  967[2:Rew:815.0,738.0] || SkP0(nil,nil) neq(nil,nil)* -> .
% 0.81/1.02  968[2:Rew:815.0,558.0] || SkP0(nil,nil) -> neq(skc5,nil)*.
% 0.81/1.02  979[2:Rew:815.0,968.1] || SkP0(nil,nil) -> neq(nil,nil)*.
% 0.81/1.02  987[2:MRR:967.1,979.1] || SkP0(nil,nil)* -> .
% 0.81/1.02  1065[2:Res:72.1,987.0] || equal(nil,nil)* -> .
% 0.81/1.02  1066[2:Obv:1065.0] ||  -> .
% 0.81/1.02  1067[2:Spt:1066.0,456.5,815.0] || equal(skc5,nil)** -> .
% 0.81/1.02  1068[2:Spt:1066.0,456.0,456.1,456.2,456.3,456.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u).
% 0.81/1.02  1095[3:Spt:738.0] || SkP0(nil,skc5)* -> .
% 0.81/1.02  1096[3:Res:72.1,1095.0] || equal(nil,nil)* -> .
% 0.81/1.02  1099[3:Obv:1096.0] ||  -> .
% 0.81/1.02  1100[3:Spt:1099.0,738.0,1095.0] ||  -> SkP0(nil,skc5)*.
% 0.81/1.02  1101[3:Spt:1099.0,738.1] || neq(nil,nil)* -> .
% 0.81/1.02  1102[3:MRR:707.1,1101.0] || SkP1(nil,skc5)* -> .
% 0.81/1.02  1104[3:Res:59.0,1102.0] ||  -> equal(skc5,nil)**.
% 0.81/1.02  1106[3:MRR:1104.0,1067.0] ||  -> .
% 0.81/1.02  1107[1:Spt:1106.0,285.5,552.0] || equal(skc4,nil)** -> .
% 0.81/1.02  1108[1:Spt:1106.0,285.0,285.1,285.2,285.3,285.4] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u).
% 0.81/1.02  1112[1:MRR:271.1,1107.0] || rearsegP(nil,skc4)* -> .
% 0.81/1.02  1123[2:Spt:456.5] ||  -> equal(skc5,nil)**.
% 0.81/1.02  1267[2:Rew:1123.0,71.0] || SkP1(skc4,nil) -> rearsegP(skc5,skc4)*.
% 0.81/1.02  1287[2:Rew:1123.0,1267.1] || SkP1(skc4,nil) -> rearsegP(nil,skc4)*.
% 0.81/1.02  1288[2:MRR:1287.1,1112.0] || SkP1(skc4,nil)* -> .
% 0.81/1.02  1392[2:Res:60.0,1288.0] ||  -> equal(skc4,nil)**.
% 0.81/1.02  1393[2:MRR:1392.0,1107.0] ||  -> .
% 0.81/1.02  1394[2:Spt:1393.0,456.5,1123.0] || equal(skc5,nil)** -> .
% 0.81/1.02  1395[2:Spt:1393.0,456.0,456.1,456.2,456.3,456.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u).
% 0.81/1.02  1432[3:Spt:71.0] || SkP1(skc4,skc5)* -> .
% 0.81/1.02  1434[3:Res:60.0,1432.0] ||  -> equal(skc4,nil)**.
% 0.81/1.02  1436[3:MRR:1434.0,1107.0] ||  -> .
% 0.81/1.02  1437[3:Spt:1436.0,71.0,1432.0] ||  -> SkP1(skc4,skc5)*.
% 0.81/1.02  1438[3:Spt:1436.0,71.1] ||  -> rearsegP(skc5,skc4)*.
% 0.81/1.02  1439[3:MRR:106.1,1438.0] || SkP0(skc4,skc5) neq(skc4,nil)* -> .
% 0.81/1.02  1440[3:MRR:70.0,1437.0] ||  -> neq(skc4,nil)*.
% 0.81/1.02  1441[3:MRR:1439.1,1440.0] || SkP0(skc4,skc5)* -> .
% 0.81/1.02  1443[3:Res:58.0,1441.0] ||  -> equal(skc5,nil)**.
% 0.81/1.02  1444[3:MRR:1443.0,1394.0] ||  -> .
% 0.81/1.02  % SZS output end Refutation
% 0.81/1.02  Formulae used in the proof : co1 ax51 ax52 ax77
% 0.81/1.02  
%------------------------------------------------------------------------------