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

% Computer : n005.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:09 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SWV065+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.13  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n005.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % 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 : Wed Jun 15 09:36:54 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.50  
% 0.20/0.50  SPASS V 3.9 
% 0.20/0.50  SPASS beiseite: Proof found.
% 0.20/0.50  % SZS status Theorem
% 0.20/0.50  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.50  SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 122 clauses.
% 0.20/0.50  SPASS allocated 85773 KBytes.
% 0.20/0.50  SPASS spent	0:00:00.15 on the problem.
% 0.20/0.50  		0:00:00.04 for the input.
% 0.20/0.50  		0:00:00.07 for the FLOTTER CNF translation.
% 0.20/0.50  		0:00:00.00 for inferences.
% 0.20/0.50  		0:00:00.00 for the backtracking.
% 0.20/0.50  		0:00:00.01 for the reduction.
% 0.20/0.50  
% 0.20/0.50  
% 0.20/0.50  Here is a proof with depth 0, length 11 :
% 0.20/0.50  % SZS output start Refutation
% 0.20/0.50  2[0:Inp] ||  -> leq(n0,pv10)*r.
% 0.20/0.50  3[0:Inp] ||  -> leq(n0,pv53)*r.
% 0.20/0.50  32[0:Inp] ||  -> leq(u,u)*.
% 0.20/0.50  38[0:Inp] ||  -> leq(pv10,minus(n135300,n1))*r.
% 0.20/0.50  39[0:Inp] ||  -> leq(pv53,minus(n5,n1))*r.
% 0.20/0.50  64[0:Inp] ||  -> equal(minus(u,n1),pred(u))**.
% 0.20/0.50  120[0:Inp] || leq(n0,n0) leq(n0,pv10) leq(n0,pv53) leq(pv10,minus(n135300,n1)) leq(pv53,minus(n5,n1))*r -> .
% 0.20/0.50  159[0:Rew:64.0,39.0] ||  -> leq(pv53,pred(n5))*r.
% 0.20/0.50  160[0:Rew:64.0,38.0] ||  -> leq(pv10,pred(n135300))*r.
% 0.20/0.50  161[0:Rew:64.0,120.4,64.0,120.3] || leq(n0,n0) leq(n0,pv10) leq(n0,pv53) leq(pv10,pred(n135300)) leq(pv53,pred(n5))*r -> .
% 0.20/0.50  162[0:MRR:161.0,161.1,161.2,161.3,161.4,32.0,2.0,3.0,160.0,159.0] ||  -> .
% 0.20/0.50  % SZS output end Refutation
% 0.20/0.50  Formulae used in the proof : cl5_nebula_array_0006 reflexivity_leq pred_minus_1
% 0.20/0.50  
%------------------------------------------------------------------------------