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

% Computer : n009.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:25:11 EDT 2022

% Result   : Theorem 16.05s 16.22s
% Output   : Refutation 16.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    8 (   5 unt;   0 nHn;   8 RR)
%            Number of literals    :   14 (   0 equ;   7 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(10,axiom,
    ~ less(n2,n3),
    file('NUM290+1.p',unknown),
    [] ).

cnf(13,axiom,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('NUM290+1.p',unknown),
    [] ).

cnf(14,axiom,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    file('NUM290+1.p',unknown),
    [] ).

cnf(32,axiom,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    file('NUM290+1.p',unknown),
    [] ).

cnf(395,axiom,
    ( ~ rdn_positive_less(u,v)
    | ~ rdn_translate(w,rdn_pos(v))
    | ~ rdn_translate(x,rdn_pos(u))
    | less(x,w) ),
    file('NUM290+1.p',unknown),
    [] ).

cnf(22247,plain,
    ( ~ rdn_positive_less(u,rdnn(n3))
    | ~ rdn_translate(v,rdn_pos(u))
    | less(v,n3) ),
    inference(res,[status(thm),theory(equality)],[14,395]),
    [iquote('0:Res:14.0,395.1')] ).

cnf(29075,plain,
    ( ~ rdn_positive_less(rdnn(n2),rdnn(n3))
    | less(n2,n3) ),
    inference(res,[status(thm),theory(equality)],[13,22247]),
    [iquote('0:Res:13.0,22247.1')] ).

cnf(29197,plain,
    $false,
    inference(mrr,[status(thm)],[29075,32,10]),
    [iquote('0:MRR:29075.0,29075.1,32.0,10.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM290+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n009.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.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Wed Jul  6 04:43:22 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 16.05/16.22  
% 16.05/16.22  SPASS V 3.9 
% 16.05/16.22  SPASS beiseite: Proof found.
% 16.05/16.22  % SZS status Theorem
% 16.05/16.22  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 16.05/16.22  SPASS derived 28760 clauses, backtracked 85 clauses, performed 1 splits and kept 29231 clauses.
% 16.05/16.22  SPASS allocated 113785 KBytes.
% 16.05/16.22  SPASS spent	0:0:15.35 on the problem.
% 16.05/16.22  		0:00:00.04 for the input.
% 16.05/16.22  		0:00:00.11 for the FLOTTER CNF translation.
% 16.05/16.22  		0:00:00.21 for inferences.
% 16.05/16.22  		0:00:00.81 for the backtracking.
% 16.05/16.22  		0:0:11.96 for the reduction.
% 16.05/16.22  
% 16.05/16.22  
% 16.05/16.22  Here is a proof with depth 2, length 8 :
% 16.05/16.22  % SZS output start Refutation
% See solution above
% 16.05/16.22  Formulae used in the proof : n2_less_n3 rdn2 rdn3 rdn_positive_less23 less_entry_point_pos_pos
% 16.05/16.22  
%------------------------------------------------------------------------------