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

View Problem - Process Solution

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

% Computer : n008.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:06 EDT 2022

% Result   : Theorem 0.84s 1.08s
% Output   : Refutation 0.84s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWC016+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n008.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 04:27:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.84/1.08  
% 0.84/1.08  SPASS V 3.9 
% 0.84/1.08  SPASS beiseite: Proof found.
% 0.84/1.08  % SZS status Theorem
% 0.84/1.08  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.84/1.08  SPASS derived 922 clauses, backtracked 659 clauses, performed 35 splits and kept 1453 clauses.
% 0.84/1.08  SPASS allocated 99056 KBytes.
% 0.84/1.08  SPASS spent	0:00:00.73 on the problem.
% 0.84/1.08  		0:00:00.04 for the input.
% 0.84/1.08  		0:00:00.06 for the FLOTTER CNF translation.
% 0.84/1.08  		0:00:00.00 for inferences.
% 0.84/1.08  		0:00:00.01 for the backtracking.
% 0.84/1.08  		0:00:00.43 for the reduction.
% 0.84/1.08  
% 0.84/1.08  
% 0.84/1.08  Here is a proof with depth 2, length 78 :
% 0.84/1.08  % SZS output start Refutation
% 0.84/1.08  1[0:Inp] ||  -> ssList(skc7)*.
% 0.84/1.08  2[0:Inp] ||  -> ssList(skc6)*.
% 0.84/1.08  3[0:Inp] ||  -> ssList(skc5)*.
% 0.84/1.08  59[0:Inp] ||  -> SkP0(u,v)* equal(nil,v).
% 0.84/1.08  61[0:Inp] ssList(u) ||  -> frontsegP(u,u)*.
% 0.84/1.08  62[0:Inp] ssList(u) ||  -> frontsegP(u,nil)*.
% 0.84/1.08  68[0:Inp] || equal(skc6,nil)** -> equal(nil,skc5).
% 0.84/1.08  69[0:Inp] || neq(skc6,nil) -> neq(skc7,nil)*.
% 0.84/1.08  70[0:Inp] || neq(skc6,nil) -> frontsegP(skc6,skc7)*.
% 0.84/1.08  71[0:Inp] || neq(skc6,nil) -> frontsegP(skc5,skc7)*.
% 0.84/1.08  72[0:Inp] || SkP0(skc5,skc6) -> neq(skc6,nil)*.
% 0.84/1.08  73[0:Inp] || equal(nil,u) -> SkP0(u,v)*.
% 0.84/1.08  94[0:Inp] ssList(u) || frontsegP(nil,u)* -> equal(nil,u).
% 0.84/1.08  156[0:Inp] ssList(u) || neq(u,nil) frontsegP(skc5,u) frontsegP(skc6,u)* SkP0(skc5,skc6) -> .
% 0.84/1.08  189[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.84/1.08  233[0:Res:3.0,156.0] || neq(skc5,nil) frontsegP(skc6,skc5)* frontsegP(skc5,skc5) SkP0(skc5,skc6) -> .
% 0.84/1.08  281[0:Res:3.0,61.0] ||  -> frontsegP(skc5,skc5)*.
% 0.84/1.08  287[0:Res:3.0,189.1] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u) equal(nil,skc5).
% 0.84/1.08  405[0:Res:2.0,156.0] || neq(skc6,nil) frontsegP(skc6,skc6)* frontsegP(skc5,skc6) SkP0(skc5,skc6) -> .
% 0.84/1.08  453[0:Res:2.0,61.0] ||  -> frontsegP(skc6,skc6)*.
% 0.84/1.08  454[0:Res:2.0,62.0] ||  -> frontsegP(skc6,nil)*.
% 0.84/1.08  459[0:Res:2.0,189.1] ssList(u) || equal(tl(skc6),tl(u))* equal(hd(skc6),hd(u)) -> equal(nil,u) equal(skc6,u) equal(skc6,nil).
% 0.84/1.08  552[0:MRR:233.2,281.0] || SkP0(skc5,skc6) frontsegP(skc6,skc5)* neq(skc5,nil) -> .
% 0.84/1.08  553[0:MRR:405.0,405.1,72.1,453.0] || SkP0(skc5,skc6) frontsegP(skc5,skc6)* -> .
% 0.84/1.08  564[1:Spt:459.5] ||  -> equal(skc6,nil)**.
% 0.84/1.08  569[1:Rew:564.0,553.0] || SkP0(skc5,nil) frontsegP(skc5,skc6)* -> .
% 0.84/1.08  578[1:Rew:564.0,68.0] || equal(nil,nil)* -> equal(nil,skc5).
% 0.84/1.08  725[1:Obv:578.0] ||  -> equal(nil,skc5)**.
% 0.84/1.08  749[1:Rew:725.0,73.0] || equal(skc5,u) -> SkP0(u,v)*.
% 0.84/1.08  796[1:Rew:725.0,564.0] ||  -> equal(skc6,skc5)**.
% 0.84/1.08  852[1:Rew:796.0,569.1,725.0,569.0] || SkP0(skc5,skc5) frontsegP(skc5,skc5)* -> .
% 0.84/1.08  853[1:MRR:852.1,281.0] || SkP0(skc5,skc5)* -> .
% 0.84/1.08  1049[1:Res:749.1,853.0] || equal(skc5,skc5)* -> .
% 0.84/1.08  1050[1:Obv:1049.0] ||  -> .
% 0.84/1.08  1051[1:Spt:1050.0,459.5,564.0] || equal(skc6,nil)** -> .
% 0.84/1.08  1052[1:Spt:1050.0,459.0,459.1,459.2,459.3,459.4] ssList(u) || equal(tl(skc6),tl(u))* equal(hd(skc6),hd(u)) -> equal(nil,u) equal(skc6,u).
% 0.84/1.08  1067[2:Spt:287.5] ||  -> equal(nil,skc5)**.
% 0.84/1.08  1077[2:Rew:1067.0,454.0] ||  -> frontsegP(skc6,skc5)*.
% 0.84/1.08  1084[2:Rew:1067.0,1051.0] || equal(skc6,skc5)** -> .
% 0.84/1.08  1104[2:Rew:1067.0,59.1] ||  -> SkP0(u,v)* equal(skc5,v).
% 0.84/1.08  1108[2:Rew:1067.0,72.1] || SkP0(skc5,skc6) -> neq(skc6,skc5)*.
% 0.84/1.08  1109[2:Rew:1067.0,69.0] || neq(skc6,skc5) -> neq(skc7,nil)*.
% 0.84/1.08  1111[2:Rew:1067.0,71.0] || neq(skc6,skc5) -> frontsegP(skc5,skc7)*.
% 0.84/1.08  1138[2:Rew:1067.0,94.2] ssList(u) || frontsegP(nil,u)* -> equal(skc5,u).
% 0.84/1.08  1155[2:Rew:1067.0,552.2] || SkP0(skc5,skc6) frontsegP(skc6,skc5)* neq(skc5,skc5) -> .
% 0.84/1.08  1190[2:Rew:1067.0,1109.1] || neq(skc6,skc5) -> neq(skc7,skc5)*.
% 0.84/1.08  1219[2:Rew:1067.0,1138.1] ssList(u) || frontsegP(skc5,u)* -> equal(skc5,u).
% 0.84/1.08  1227[2:MRR:1155.1,1077.0] || SkP0(skc5,skc6) neq(skc5,skc5)* -> .
% 0.84/1.08  1265[3:Spt:1108.0] || SkP0(skc5,skc6)* -> .
% 0.84/1.08  1266[3:Res:1104.0,1265.0] ||  -> equal(skc6,skc5)**.
% 0.84/1.08  1267[3:MRR:1266.0,1084.0] ||  -> .
% 0.84/1.08  1268[3:Spt:1267.0,1108.0,1265.0] ||  -> SkP0(skc5,skc6)*.
% 0.84/1.08  1269[3:Spt:1267.0,1108.1] ||  -> neq(skc6,skc5)*.
% 0.84/1.08  1270[3:MRR:1190.0,1269.0] ||  -> neq(skc7,skc5)*.
% 0.84/1.08  1272[3:MRR:1111.0,1269.0] ||  -> frontsegP(skc5,skc7)*.
% 0.84/1.08  1273[3:MRR:1227.0,1268.0] || neq(skc5,skc5)* -> .
% 0.84/1.08  1309[3:Res:1272.0,1219.1] ssList(skc7) ||  -> equal(skc7,skc5)**.
% 0.84/1.08  1312[3:SSi:1309.0,1.0] ||  -> equal(skc7,skc5)**.
% 0.84/1.08  1314[3:Rew:1312.0,1270.0] ||  -> neq(skc5,skc5)*.
% 0.84/1.08  1317[3:MRR:1314.0,1273.0] ||  -> .
% 0.84/1.08  1318[2:Spt:1317.0,287.5,1067.0] || equal(nil,skc5)** -> .
% 0.84/1.08  1319[2:Spt:1317.0,287.0,287.1,287.2,287.3,287.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u).
% 0.84/1.08  1343[3:Spt:156.0,156.1,156.2,156.3] ssList(u) || neq(u,nil) frontsegP(skc5,u) frontsegP(skc6,u)* -> .
% 0.84/1.08  1348[4:Spt:72.1] ||  -> neq(skc6,nil)*.
% 0.84/1.08  1349[4:MRR:71.0,1348.0] ||  -> frontsegP(skc5,skc7)*.
% 0.84/1.08  1350[4:MRR:70.0,1348.0] ||  -> frontsegP(skc6,skc7)*.
% 0.84/1.08  1351[4:MRR:69.0,1348.0] ||  -> neq(skc7,nil)*.
% 0.84/1.08  1378[4:Res:1350.0,1343.3] ssList(skc7) || neq(skc7,nil) frontsegP(skc5,skc7)* -> .
% 0.84/1.08  1379[4:SSi:1378.0,1.0] || neq(skc7,nil) frontsegP(skc5,skc7)* -> .
% 0.84/1.08  1380[4:MRR:1379.1,1349.0] || neq(skc7,nil)* -> .
% 0.84/1.08  1381[4:MRR:1380.0,1351.0] ||  -> .
% 0.84/1.08  1382[4:Spt:1381.0,72.1,1348.0] || neq(skc6,nil)* -> .
% 0.84/1.08  1383[4:Spt:1381.0,72.0] || SkP0(skc5,skc6)* -> .
% 0.84/1.08  1413[4:Res:59.0,1383.0] ||  -> equal(skc6,nil)**.
% 0.84/1.08  1414[4:MRR:1413.0,1051.0] ||  -> .
% 0.84/1.08  1415[3:Spt:1414.0,156.4] || SkP0(skc5,skc6)* -> .
% 0.84/1.08  1416[3:Res:59.0,1415.0] ||  -> equal(skc6,nil)**.
% 0.84/1.08  1417[3:MRR:1416.0,1051.0] ||  -> .
% 0.84/1.08  % SZS output end Refutation
% 0.84/1.08  Formulae used in the proof : co1 ax17 ax42 ax45 ax46 ax77
% 0.84/1.08  
%------------------------------------------------------------------------------