↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC054+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n011.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:24 EDT 2022

% Result   : Theorem 0.82s 1.03s
% Output   : Refutation 0.82s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWC054+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n011.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:52:17 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.82/1.03  
% 0.82/1.03  SPASS V 3.9 
% 0.82/1.03  SPASS beiseite: Proof found.
% 0.82/1.03  % SZS status Theorem
% 0.82/1.03  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.82/1.03  SPASS derived 1039 clauses, backtracked 679 clauses, performed 35 splits and kept 1543 clauses.
% 0.82/1.03  SPASS allocated 99161 KBytes.
% 0.82/1.03  SPASS spent	0:00:00.68 on the problem.
% 0.82/1.03  		0:00:00.04 for the input.
% 0.82/1.03  		0:00:00.07 for the FLOTTER CNF translation.
% 0.82/1.03  		0:00:00.00 for inferences.
% 0.82/1.03  		0:00:00.01 for the backtracking.
% 0.82/1.03  		0:00:00.40 for the reduction.
% 0.82/1.03  
% 0.82/1.03  
% 0.82/1.03  Here is a proof with depth 2, length 78 :
% 0.82/1.03  % SZS output start Refutation
% 0.82/1.03  1[0:Inp] ||  -> ssList(skc7)*.
% 0.82/1.03  2[0:Inp] ||  -> ssList(skc6)*.
% 0.82/1.03  3[0:Inp] ||  -> ssList(skc5)*.
% 0.82/1.03  59[0:Inp] ||  -> SkP0(u,v)* equal(nil,v).
% 0.82/1.03  65[0:Inp] ssList(u) ||  -> segmentP(u,u)*.
% 0.82/1.03  66[0:Inp] ssList(u) ||  -> segmentP(u,nil)*.
% 0.82/1.03  68[0:Inp] || equal(skc6,nil)** -> equal(nil,skc5).
% 0.82/1.03  69[0:Inp] || neq(skc6,nil) -> neq(skc7,nil)*.
% 0.82/1.03  70[0:Inp] || neq(skc6,nil) -> segmentP(skc6,skc7)*.
% 0.82/1.03  71[0:Inp] || neq(skc6,nil) -> segmentP(skc5,skc7)*.
% 0.82/1.03  72[0:Inp] || SkP0(skc5,skc6) -> neq(skc6,nil)*.
% 0.82/1.03  73[0:Inp] || equal(nil,u) -> SkP0(u,v)*.
% 0.82/1.03  98[0:Inp] ssList(u) || segmentP(nil,u)* -> equal(nil,u).
% 0.82/1.03  156[0:Inp] ssList(u) || neq(u,nil) segmentP(skc5,u) segmentP(skc6,u)* SkP0(skc5,skc6) -> .
% 0.82/1.03  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.82/1.03  233[0:Res:3.0,156.0] || neq(skc5,nil) segmentP(skc6,skc5)* segmentP(skc5,skc5) SkP0(skc5,skc6) -> .
% 0.82/1.03  285[0:Res:3.0,65.0] ||  -> segmentP(skc5,skc5)*.
% 0.82/1.03  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.82/1.03  405[0:Res:2.0,156.0] || neq(skc6,nil) segmentP(skc6,skc6)* segmentP(skc5,skc6) SkP0(skc5,skc6) -> .
% 0.82/1.03  457[0:Res:2.0,65.0] ||  -> segmentP(skc6,skc6)*.
% 0.82/1.03  458[0:Res:2.0,66.0] ||  -> segmentP(skc6,nil)*.
% 0.82/1.03  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.82/1.03  552[0:MRR:233.2,285.0] || SkP0(skc5,skc6) segmentP(skc6,skc5)* neq(skc5,nil) -> .
% 0.82/1.03  553[0:MRR:405.0,405.1,72.1,457.0] || SkP0(skc5,skc6) segmentP(skc5,skc6)* -> .
% 0.82/1.03  564[1:Spt:459.5] ||  -> equal(skc6,nil)**.
% 0.82/1.03  569[1:Rew:564.0,553.0] || SkP0(skc5,nil) segmentP(skc5,skc6)* -> .
% 0.82/1.03  578[1:Rew:564.0,68.0] || equal(nil,nil)* -> equal(nil,skc5).
% 0.82/1.03  725[1:Obv:578.0] ||  -> equal(nil,skc5)**.
% 0.82/1.03  749[1:Rew:725.0,73.0] || equal(skc5,u) -> SkP0(u,v)*.
% 0.82/1.03  796[1:Rew:725.0,564.0] ||  -> equal(skc6,skc5)**.
% 0.82/1.03  852[1:Rew:796.0,569.1,725.0,569.0] || SkP0(skc5,skc5) segmentP(skc5,skc5)* -> .
% 0.82/1.03  853[1:MRR:852.1,285.0] || SkP0(skc5,skc5)* -> .
% 0.82/1.03  1049[1:Res:749.1,853.0] || equal(skc5,skc5)* -> .
% 0.82/1.03  1050[1:Obv:1049.0] ||  -> .
% 0.82/1.03  1051[1:Spt:1050.0,459.5,564.0] || equal(skc6,nil)** -> .
% 0.82/1.03  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.82/1.03  1067[2:Spt:287.5] ||  -> equal(nil,skc5)**.
% 0.82/1.03  1079[2:Rew:1067.0,458.0] ||  -> segmentP(skc6,skc5)*.
% 0.82/1.03  1084[2:Rew:1067.0,1051.0] || equal(skc6,skc5)** -> .
% 0.82/1.03  1104[2:Rew:1067.0,59.1] ||  -> SkP0(u,v)* equal(skc5,v).
% 0.82/1.03  1108[2:Rew:1067.0,72.1] || SkP0(skc5,skc6) -> neq(skc6,skc5)*.
% 0.82/1.03  1109[2:Rew:1067.0,69.0] || neq(skc6,skc5) -> neq(skc7,nil)*.
% 0.82/1.03  1111[2:Rew:1067.0,71.0] || neq(skc6,skc5) -> segmentP(skc5,skc7)*.
% 0.82/1.03  1142[2:Rew:1067.0,98.2] ssList(u) || segmentP(nil,u)* -> equal(skc5,u).
% 0.82/1.03  1155[2:Rew:1067.0,552.2] || SkP0(skc5,skc6) segmentP(skc6,skc5)* neq(skc5,skc5) -> .
% 0.82/1.03  1190[2:Rew:1067.0,1109.1] || neq(skc6,skc5) -> neq(skc7,skc5)*.
% 0.82/1.03  1223[2:Rew:1067.0,1142.1] ssList(u) || segmentP(skc5,u)* -> equal(skc5,u).
% 0.82/1.03  1227[2:MRR:1155.1,1079.0] || SkP0(skc5,skc6) neq(skc5,skc5)* -> .
% 0.82/1.03  1265[3:Spt:1108.0] || SkP0(skc5,skc6)* -> .
% 0.82/1.03  1266[3:Res:1104.0,1265.0] ||  -> equal(skc6,skc5)**.
% 0.82/1.03  1267[3:MRR:1266.0,1084.0] ||  -> .
% 0.82/1.03  1268[3:Spt:1267.0,1108.0,1265.0] ||  -> SkP0(skc5,skc6)*.
% 0.82/1.03  1269[3:Spt:1267.0,1108.1] ||  -> neq(skc6,skc5)*.
% 0.82/1.03  1270[3:MRR:1190.0,1269.0] ||  -> neq(skc7,skc5)*.
% 0.82/1.03  1272[3:MRR:1111.0,1269.0] ||  -> segmentP(skc5,skc7)*.
% 0.82/1.03  1273[3:MRR:1227.0,1268.0] || neq(skc5,skc5)* -> .
% 0.82/1.03  1429[3:Res:1272.0,1223.1] ssList(skc7) ||  -> equal(skc7,skc5)**.
% 0.82/1.03  1432[3:SSi:1429.0,1.0] ||  -> equal(skc7,skc5)**.
% 0.82/1.03  1434[3:Rew:1432.0,1270.0] ||  -> neq(skc5,skc5)*.
% 0.82/1.03  1437[3:MRR:1434.0,1273.0] ||  -> .
% 0.82/1.03  1438[2:Spt:1437.0,287.5,1067.0] || equal(nil,skc5)** -> .
% 0.82/1.03  1439[2:Spt:1437.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.82/1.03  1463[3:Spt:156.0,156.1,156.2,156.3] ssList(u) || neq(u,nil) segmentP(skc5,u) segmentP(skc6,u)* -> .
% 0.82/1.03  1468[4:Spt:72.1] ||  -> neq(skc6,nil)*.
% 0.82/1.03  1469[4:MRR:71.0,1468.0] ||  -> segmentP(skc5,skc7)*.
% 0.82/1.03  1470[4:MRR:70.0,1468.0] ||  -> segmentP(skc6,skc7)*.
% 0.82/1.03  1471[4:MRR:69.0,1468.0] ||  -> neq(skc7,nil)*.
% 0.82/1.03  1498[4:Res:1470.0,1463.3] ssList(skc7) || neq(skc7,nil) segmentP(skc5,skc7)* -> .
% 0.82/1.03  1499[4:SSi:1498.0,1.0] || neq(skc7,nil) segmentP(skc5,skc7)* -> .
% 0.82/1.03  1500[4:MRR:1499.1,1469.0] || neq(skc7,nil)* -> .
% 0.82/1.03  1501[4:MRR:1500.0,1471.0] ||  -> .
% 0.82/1.03  1502[4:Spt:1501.0,72.1,1468.0] || neq(skc6,nil)* -> .
% 0.82/1.03  1503[4:Spt:1501.0,72.0] || SkP0(skc5,skc6)* -> .
% 0.82/1.03  1533[4:Res:59.0,1503.0] ||  -> equal(skc6,nil)**.
% 0.82/1.03  1534[4:MRR:1533.0,1051.0] ||  -> .
% 0.82/1.03  1535[3:Spt:1534.0,156.4] || SkP0(skc5,skc6)* -> .
% 0.82/1.03  1536[3:Res:59.0,1535.0] ||  -> equal(skc6,nil)**.
% 0.82/1.03  1537[3:MRR:1536.0,1051.0] ||  -> .
% 0.82/1.03  % SZS output end Refutation
% 0.82/1.03  Formulae used in the proof : co1 ax17 ax55 ax57 ax58 ax77
% 0.82/1.03  
%------------------------------------------------------------------------------