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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC288+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:03:05 EDT 2022

% Result   : Theorem 0.97s 1.15s
% Output   : Refutation 0.97s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC288+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n018.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 12 03:07:26 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.97/1.15  
% 0.97/1.15  SPASS V 3.9 
% 0.97/1.15  SPASS beiseite: Proof found.
% 0.97/1.15  % SZS status Theorem
% 0.97/1.15  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.97/1.15  SPASS derived 1356 clauses, backtracked 783 clauses, performed 24 splits and kept 1823 clauses.
% 0.97/1.15  SPASS allocated 99263 KBytes.
% 0.97/1.15  SPASS spent	0:00:00.78 on the problem.
% 0.97/1.15  		0:00:00.04 for the input.
% 0.97/1.15  		0:00:00.07 for the FLOTTER CNF translation.
% 0.97/1.15  		0:00:00.01 for inferences.
% 0.97/1.15  		0:00:00.01 for the backtracking.
% 0.97/1.15  		0:00:00.48 for the reduction.
% 0.97/1.15  
% 0.97/1.15  
% 0.97/1.15  Here is a proof with depth 2, length 38 :
% 0.97/1.15  % SZS output start Refutation
% 0.97/1.15  1[0:Inp] ||  -> ssList(skc5)*.
% 0.97/1.15  2[0:Inp] ||  -> ssList(skc4)*.
% 0.97/1.15  10[0:Inp] ||  -> strictorderedP(nil)*.
% 0.97/1.15  13[0:Inp] || strictorderedP(skc4)* -> .
% 0.97/1.15  54[0:Inp] ||  -> ssItem(skf46(u,v))*.
% 0.97/1.15  70[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc5).
% 0.97/1.15  71[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc4).
% 0.97/1.15  77[0:Inp] ssItem(u) ||  -> strictorderedP(cons(u,nil))*.
% 0.97/1.15  87[0:Inp] ||  -> SkP0(u,v) equal(cons(skf46(u,v),nil),v)**.
% 0.97/1.15  190[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.97/1.15  199[0:Rew:71.1,70.1] || SkP0(skc5,skc4)* -> equal(skc5,skc4).
% 0.97/1.15  288[0:Res:2.0,190.1] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u) equal(nil,skc4).
% 0.97/1.15  459[0:Res:1.0,190.1] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u) equal(nil,skc5).
% 0.97/1.15  562[1:Spt:459.5] ||  -> equal(nil,skc5)**.
% 0.97/1.15  565[1:Rew:562.0,77.1] ssItem(u) ||  -> strictorderedP(cons(u,skc5))*.
% 0.97/1.15  636[1:Rew:562.0,10.0] ||  -> strictorderedP(skc5)*.
% 0.97/1.15  663[1:Rew:562.0,87.1] ||  -> SkP0(u,v) equal(cons(skf46(u,v),skc5),v)**.
% 0.97/1.15  762[2:Spt:199.1] ||  -> equal(skc5,skc4)**.
% 0.97/1.15  865[2:Rew:762.0,636.0] ||  -> strictorderedP(skc4)*.
% 0.97/1.15  914[2:MRR:865.0,13.0] ||  -> .
% 0.97/1.15  1012[2:Spt:914.0,199.1,762.0] || equal(skc5,skc4)** -> .
% 0.97/1.15  1013[2:Spt:914.0,199.0] || SkP0(skc5,skc4)* -> .
% 0.97/1.15  1483[1:SpR:663.1,565.1] ssItem(skf46(u,v)) ||  -> SkP0(u,v)* strictorderedP(v).
% 0.97/1.15  1496[1:SSi:1483.0,54.0] ||  -> SkP0(u,v)* strictorderedP(v).
% 0.97/1.15  1509[2:Res:1496.0,1013.0] ||  -> strictorderedP(skc4)*.
% 0.97/1.15  1510[2:MRR:1509.0,13.0] ||  -> .
% 0.97/1.15  1511[1:Spt:1510.0,459.5,562.0] || equal(nil,skc5)** -> .
% 0.97/1.15  1512[1:Spt:1510.0,459.0,459.1,459.2,459.3,459.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u).
% 0.97/1.15  1536[2:Spt:288.5] ||  -> equal(nil,skc4)**.
% 0.97/1.15  1543[2:Rew:1536.0,10.0] ||  -> strictorderedP(skc4)*.
% 0.97/1.15  1629[2:MRR:1543.0,13.0] ||  -> .
% 0.97/1.15  1708[2:Spt:1629.0,288.5,1536.0] || equal(nil,skc4)** -> .
% 0.97/1.15  1709[2:Spt:1629.0,288.0,288.1,288.2,288.3,288.4] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u).
% 0.97/1.15  1715[2:MRR:71.1,1708.0] || SkP0(skc5,skc4)* -> .
% 0.97/1.15  1830[0:SpR:87.1,77.1] ssItem(skf46(u,v)) ||  -> SkP0(u,v)* strictorderedP(v).
% 0.97/1.15  1838[0:SSi:1830.0,54.0] ||  -> SkP0(u,v)* strictorderedP(v).
% 0.97/1.15  1847[2:Res:1838.0,1715.0] ||  -> strictorderedP(skc4)*.
% 0.97/1.15  1848[2:MRR:1847.0,13.0] ||  -> .
% 0.97/1.15  % SZS output end Refutation
% 0.97/1.15  Formulae used in the proof : co1 ax2 ax17 ax69 ax68 ax77
% 0.97/1.15  
%------------------------------------------------------------------------------