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

% Computer : n011.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.91s 1.07s
% Output   : Refutation 0.91s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM024-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n011.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Wed Jul  6 08:14:38 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.91/1.07  
% 0.91/1.07  SPASS V 3.9 
% 0.91/1.07  SPASS beiseite: Proof found.
% 0.91/1.07  % SZS status Theorem
% 0.91/1.07  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.91/1.07  SPASS derived 3126 clauses, backtracked 0 clauses, performed 0 splits and kept 1841 clauses.
% 0.91/1.07  SPASS allocated 65791 KBytes.
% 0.91/1.07  SPASS spent	0:00:00.71 on the problem.
% 0.91/1.07  		0:00:00.03 for the input.
% 0.91/1.07  		0:00:00.00 for the FLOTTER CNF translation.
% 0.91/1.07  		0:00:00.04 for inferences.
% 0.91/1.07  		0:00:00.00 for the backtracking.
% 0.91/1.07  		0:00:00.61 for the reduction.
% 0.91/1.07  
% 0.91/1.07  
% 0.91/1.07  Here is a proof with depth 3, length 14 :
% 0.91/1.07  % SZS output start Refutation
% 0.91/1.07  2[0:Inp] || equalish(u,v)* -> equalish(v,u).
% 0.91/1.07  3[0:Inp] || equalish(u,v)* equalish(v,w)* -> equalish(u,w)*.
% 0.91/1.07  4[0:Inp] || equalish(add(u,v),add(w,v))* -> equalish(u,w).
% 0.91/1.07  5[0:Inp] ||  -> equalish(add(u,v),add(v,u))*.
% 0.91/1.07  6[0:Inp] ||  -> less(a,a)*.
% 0.91/1.07  7[0:Inp] || equalish(successor(u),n0)*l -> .
% 0.91/1.07  8[0:Inp] ||  -> equalish(add(u,n0),u)*l.
% 0.91/1.07  16[0:Inp] || less(u,v) -> equalish(add(successor(predecessor_of_1st_minus_2nd(v,u)),u),v)*l.
% 0.91/1.07  21[0:OCh:3.1,3.0,5.0,8.0] ||  -> equalish(add(n0,u),u)*l.
% 0.91/1.07  32[0:Res:21.0,2.0] ||  -> equalish(u,add(n0,u))*r.
% 0.91/1.07  188[0:NCh:3.2,3.0,16.1,4.0] || less(u,v) equalish(v,add(w,u))*+ -> equalish(successor(predecessor_of_1st_minus_2nd(v,u)),w)*.
% 0.91/1.07  3037[0:Res:32.0,188.1] || less(u,u) -> equalish(successor(predecessor_of_1st_minus_2nd(u,u)),n0)*l.
% 0.91/1.07  3159[0:MRR:3037.1,7.0] || less(u,u)* -> .
% 0.91/1.07  3160[0:UnC:3159.0,6.0] ||  -> .
% 0.91/1.07  % SZS output end Refutation
% 0.91/1.07  Formulae used in the proof : symmetry transitivity plus_substitution commutativity_of_plus impossible_a_is_less_than_itself prove_a_contradiction adding_zero less_lemma
% 0.91/1.07  
%------------------------------------------------------------------------------