%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n027.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:40:54 EDT 2022

% Result   : Unsatisfiable 0.19s 0.41s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun 16 06:27:35 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.41  
% 0.19/0.41  SPASS V 3.9 
% 0.19/0.41  SPASS beiseite: Proof found.
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.41  SPASS derived 20 clauses, backtracked 0 clauses, performed 0 splits and kept 33 clauses.
% 0.19/0.41  SPASS allocated 63115 KBytes.
% 0.19/0.41  SPASS spent	0:00:00.06 on the problem.
% 0.19/0.41  		0:00:00.03 for the input.
% 0.19/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.41  		0:00:00.00 for inferences.
% 0.19/0.41  		0:00:00.00 for the backtracking.
% 0.19/0.41  		0:00:00.00 for the reduction.
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Here is a proof with depth 1, length 8 :
% 0.19/0.41  % SZS output start Refutation
% 0.19/0.41  1[0:Inp] || less_than(n,k)*r -> .
% 0.19/0.41  2[0:Inp] || less_than(k,l)*r -> .
% 0.19/0.41  5[0:Inp] ||  -> less_than(one,l)*l.
% 0.19/0.41  6[0:Inp] ||  -> less_than(a(k),a(predecessor(l)))*r.
% 0.19/0.41  8[0:Inp] || less_than(one,l) less_than(a(u),a(predecessor(l)))* -> less_than(u,l) less_than(n,u).
% 0.19/0.41  22[0:MRR:8.0,5.0] || less_than(a(u),a(predecessor(l)))* -> less_than(u,l) less_than(n,u).
% 0.19/0.41  38[0:Res:22.1,2.0] || less_than(a(k),a(predecessor(l)))*r -> less_than(n,k).
% 0.19/0.41  43[0:MRR:38.0,38.1,6.0,1.0] ||  -> .
% 0.19/0.41  % SZS output end Refutation
% 0.19/0.41  Formulae used in the proof : clause_1 clause_2 clause_5 clause_6 clause_8
% 0.19/0.41  
%------------------------------------------------------------------------------