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

% Computer : n018.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 : Sat Jul 16 02:28:39 EDT 2022

% Result   : Unsatisfiable 0.18s 0.40s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : FLD071-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n018.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun  6 14:23:49 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.40  
% 0.18/0.40  SPASS V 3.9 
% 0.18/0.40  SPASS beiseite: Proof found.
% 0.18/0.40  % SZS status Theorem
% 0.18/0.40  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.40  SPASS derived 16 clauses, backtracked 0 clauses, performed 0 splits and kept 39 clauses.
% 0.18/0.40  SPASS allocated 75633 KBytes.
% 0.18/0.40  SPASS spent	0:00:00.06 on the problem.
% 0.18/0.40  		0:00:00.03 for the input.
% 0.18/0.40  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.40  		0:00:00.00 for inferences.
% 0.18/0.40  		0:00:00.00 for the backtracking.
% 0.18/0.40  		0:00:00.00 for the reduction.
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  Here is a proof with depth 1, length 6 :
% 0.18/0.40  % SZS output start Refutation
% 0.18/0.40  3[0:Inp] ||  -> less_or_equal(additive_identity,a)*r.
% 0.18/0.40  4[0:Inp] ||  -> less_or_equal(additive_identity,b)*r.
% 0.18/0.40  5[0:Inp] || less_or_equal(additive_identity,multiply(a,b))*r -> .
% 0.18/0.40  25[0:Inp] || less_or_equal(additive_identity,u) less_or_equal(additive_identity,v) -> less_or_equal(additive_identity,multiply(v,u))*r.
% 0.18/0.40  45[0:Res:25.2,5.0] || less_or_equal(additive_identity,a)*r less_or_equal(additive_identity,b) -> .
% 0.18/0.40  49[0:MRR:45.0,45.1,3.0,4.0] ||  -> .
% 0.18/0.40  % SZS output end Refutation
% 0.18/0.40  Formulae used in the proof : less_or_equal_3 less_or_equal_4 not_less_or_equal_5 compatibility_of_order_relation_and_multiplication
% 0.18/0.40  
%------------------------------------------------------------------------------