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

% Computer : n015.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 11.49s 11.66s
% Output   : Refutation 11.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   10 (   6 unt;   0 nHn;  10 RR)
%            Number of literals    :   17 (   0 equ;   9 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(1,axiom,
    less(n3,n2),
    file('NUM291+1.p',unknown),
    [] ).

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

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

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

cnf(223,axiom,
    ( ~ less(u,v)
    | ~ less(v,u) ),
    file('NUM291+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('NUM291+1.p',unknown),
    [] ).

cnf(408,plain,
    ~ less(n2,n3),
    inference(res,[status(thm),theory(equality)],[1,223]),
    [iquote('0:Res:1.0,223.0')] ).

cnf(1001,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(22009,plain,
    ( ~ rdn_positive_less(rdnn(n2),rdnn(n3))
    | less(n2,n3) ),
    inference(res,[status(thm),theory(equality)],[13,1001]),
    [iquote('0:Res:13.0,1001.1')] ).

cnf(22130,plain,
    $false,
    inference(mrr,[status(thm)],[22009,32,408]),
    [iquote('0:MRR:22009.0,22009.1,32.0,408.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : NUM291+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n015.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Tue Jul  5 13:07:47 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 11.49/11.66  
% 11.49/11.66  SPASS V 3.9 
% 11.49/11.66  SPASS beiseite: Proof found.
% 11.49/11.66  % SZS status Theorem
% 11.49/11.66  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 11.49/11.66  SPASS derived 21706 clauses, backtracked 0 clauses, performed 0 splits and kept 22099 clauses.
% 11.49/11.66  SPASS allocated 109851 KBytes.
% 11.49/11.66  SPASS spent	0:0:10.86 on the problem.
% 11.49/11.66  		0:00:00.04 for the input.
% 11.49/11.66  		0:00:00.11 for the FLOTTER CNF translation.
% 11.49/11.66  		0:00:00.17 for inferences.
% 11.49/11.66  		0:00:00.00 for the backtracking.
% 11.49/11.66  		0:00:08.99 for the reduction.
% 11.49/11.66  
% 11.49/11.66  
% 11.49/11.66  Here is a proof with depth 2, length 10 :
% 11.49/11.66  % SZS output start Refutation
% See solution above
% 11.49/11.66  Formulae used in the proof : n3_not_less_n2 rdn2 rdn3 rdn_positive_less23 less_property less_entry_point_pos_pos
% 11.49/11.66  
%------------------------------------------------------------------------------