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

% Computer : n012.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:25 EDT 2022

% Result   : Theorem 0.20s 0.53s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SWV141+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.04/0.14  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n012.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.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue Jun 14 23:50:55 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.53  
% 0.20/0.53  SPASS V 3.9 
% 0.20/0.53  SPASS beiseite: Proof found.
% 0.20/0.53  % SZS status Theorem
% 0.20/0.53  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.53  SPASS derived 128 clauses, backtracked 0 clauses, performed 0 splits and kept 153 clauses.
% 0.20/0.53  SPASS allocated 85751 KBytes.
% 0.20/0.53  SPASS spent	0:00:00.17 on the problem.
% 0.20/0.53  		0:00:00.03 for the input.
% 0.20/0.53  		0:00:00.08 for the FLOTTER CNF translation.
% 0.20/0.53  		0:00:00.00 for inferences.
% 0.20/0.53  		0:00:00.00 for the backtracking.
% 0.20/0.53  		0:00:00.02 for the reduction.
% 0.20/0.53  
% 0.20/0.53  
% 0.20/0.53  Here is a proof with depth 1, length 9 :
% 0.20/0.53  % SZS output start Refutation
% 0.20/0.53  3[0:Inp] ||  -> leq(n1,loopcounter)*r.
% 0.20/0.53  26[0:Inp] || leq(n0,s_worst7)*r -> .
% 0.20/0.53  27[0:Inp] ||  -> equal(succ(n0),n1)**.
% 0.20/0.53  60[0:Inp] || gt(loopcounter,n0) -> leq(n0,s_worst7)*r.
% 0.20/0.53  88[0:Inp] || leq(succ(u),v)* -> gt(v,u).
% 0.20/0.53  156[0:MRR:60.1,26.0] || gt(loopcounter,n0)*r -> .
% 0.20/0.53  281[0:Res:88.1,156.0] || leq(succ(n0),loopcounter)*l -> .
% 0.20/0.53  285[0:Rew:27.0,281.0] || leq(n1,loopcounter)*r -> .
% 0.20/0.53  286[0:MRR:285.0,3.0] ||  -> .
% 0.20/0.53  % SZS output end Refutation
% 0.20/0.53  Formulae used in the proof : gauss_array_0011 successor_1 leq_succ_gt
% 0.20/0.53  
%------------------------------------------------------------------------------