%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM025-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n016.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 : Mon Jul 18 14:23:44 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.07/0.12  % Problem  : NUM025-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n016.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 : Tue Jul  5 14:19:33 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/sandbox/benchmark/theBenchmark.p 
% 0.19/0.41  SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 16 clauses.
% 0.19/0.41  SPASS allocated 63093 KBytes.
% 0.19/0.41  SPASS spent	0:00:00.06 on the problem.
% 0.19/0.41  		0:00:00.04 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 6 :
% 0.19/0.41  % SZS output start Refutation
% 0.19/0.41  5[0:Inp] || less(u,u)* -> .
% 0.19/0.41  6[0:Inp] ||  -> less(a,b)*l.
% 0.19/0.41  7[0:Inp] ||  -> less(b,a)*r.
% 0.19/0.41  14[0:Inp] || less(u,v)* less(v,w)* -> less(u,w)*.
% 0.19/0.41  18[0:OCh:14.1,14.0,6.0,7.0] ||  -> less(b,b)*.
% 0.19/0.41  19[0:MRR:18.0,5.0] ||  -> .
% 0.19/0.41  % SZS output end Refutation
% 0.19/0.41  Formulae used in the proof : no_number_less_than_itself a_less_than_b prove_b_not_less_than_a transitivity_of_less
% 0.19/0.41  
%------------------------------------------------------------------------------