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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV166+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n024.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 : Wed Jul 20 21:41:30 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV166+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n024.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 : Wed Jun 15 20:38:33 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.52  
% 0.19/0.52  SPASS V 3.9 
% 0.19/0.52  SPASS beiseite: Proof found.
% 0.19/0.52  % SZS status Theorem
% 0.19/0.52  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.52  SPASS derived 155 clauses, backtracked 0 clauses, performed 0 splits and kept 174 clauses.
% 0.19/0.52  SPASS allocated 85810 KBytes.
% 0.19/0.52  SPASS spent	0:00:00.17 on the problem.
% 0.19/0.52  		0:00:00.04 for the input.
% 0.19/0.52  		0:00:00.07 for the FLOTTER CNF translation.
% 0.19/0.52  		0:00:00.00 for inferences.
% 0.19/0.52  		0:00:00.00 for the backtracking.
% 0.19/0.52  		0:00:00.02 for the reduction.
% 0.19/0.52  
% 0.19/0.52  
% 0.19/0.52  Here is a proof with depth 1, length 8 :
% 0.19/0.52  % SZS output start Refutation
% 0.19/0.52  2[0:Inp] ||  -> leq(n0,skc1)*r.
% 0.19/0.52  5[0:Inp] ||  -> gt(loopcounter,n1)*r.
% 0.19/0.52  6[0:Inp] ||  -> leq(skc1,n4)*l.
% 0.19/0.52  61[0:Inp] || equal(a_select2(rhoold_init,skc1),init)** -> .
% 0.19/0.52  120[0:Inp] || gt(loopcounter,n1) leq(n0,u) leq(u,n4) -> equal(a_select2(rhoold_init,u),init)**.
% 0.19/0.52  170[0:MRR:120.0,5.0] || leq(u,n4) leq(n0,u) -> equal(a_select2(rhoold_init,u),init)**.
% 0.19/0.52  198[0:Res:6.0,170.1] || leq(n0,skc1) -> equal(a_select2(rhoold_init,skc1),init)**.
% 0.19/0.52  335[0:MRR:198.0,198.1,2.0,61.0] ||  -> .
% 0.19/0.52  % SZS output end Refutation
% 0.19/0.52  Formulae used in the proof : cl5_nebula_init_0006
% 0.19/0.52  
%------------------------------------------------------------------------------