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

% Computer : n007.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:15 EDT 2022

% Result   : Theorem 8.61s 8.83s
% Output   : Refutation 8.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    9 (   6 unt;   0 nHn;   9 RR)
%            Number of literals    :   15 (   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    :   10 (  10 usr;   8 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(10,axiom,
    ~ less(u,nn2),
    file('NUM301+1.p',unknown),
    [] ).

cnf(22,axiom,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    file('NUM301+1.p',unknown),
    [] ).

cnf(23,axiom,
    rdn_translate(nn3,rdn_neg(rdnn(n3))),
    file('NUM301+1.p',unknown),
    [] ).

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

cnf(396,axiom,
    ( ~ rdn_positive_less(u,v)
    | ~ rdn_translate(w,rdn_neg(u))
    | ~ rdn_translate(x,rdn_neg(v))
    | less(x,w) ),
    file('NUM301+1.p',unknown),
    [] ).

cnf(969,plain,
    ( ~ rdn_positive_less(rdnn(n2),u)
    | ~ rdn_translate(v,rdn_neg(u))
    | less(v,nn2) ),
    inference(res,[status(thm),theory(equality)],[22,396]),
    [iquote('0:Res:22.0,396.1')] ).

cnf(1090,plain,
    ( ~ rdn_positive_less(rdnn(n2),u)
    | ~ rdn_translate(v,rdn_neg(u)) ),
    inference(mrr,[status(thm)],[969,10]),
    [iquote('0:MRR:969.2,10.0')] ).

cnf(19165,plain,
    ~ rdn_positive_less(rdnn(n2),rdnn(n3)),
    inference(res,[status(thm),theory(equality)],[23,1090]),
    [iquote('0:Res:23.0,1090.1')] ).

cnf(19287,plain,
    $false,
    inference(mrr,[status(thm)],[19165,32]),
    [iquote('0:MRR:19165.0,32.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM301+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n007.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Fri Jul  8 02:02:15 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 8.61/8.83  
% 8.61/8.83  SPASS V 3.9 
% 8.61/8.83  SPASS beiseite: Proof found.
% 8.61/8.83  % SZS status Theorem
% 8.61/8.83  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 8.61/8.83  SPASS derived 18877 clauses, backtracked 0 clauses, performed 0 splits and kept 19169 clauses.
% 8.61/8.83  SPASS allocated 107714 KBytes.
% 8.61/8.83  SPASS spent	0:00:08.17 on the problem.
% 8.61/8.83  		0:00:00.04 for the input.
% 8.61/8.83  		0:00:00.10 for the FLOTTER CNF translation.
% 8.61/8.83  		0:00:00.12 for inferences.
% 8.61/8.83  		0:00:00.00 for the backtracking.
% 8.61/8.83  		0:00:07.19 for the reduction.
% 8.61/8.83  
% 8.61/8.83  
% 8.61/8.83  Here is a proof with depth 2, length 9 :
% 8.61/8.83  % SZS output start Refutation
% See solution above
% 8.61/8.83  Formulae used in the proof : something_less_nn2 rdnn2 rdnn3 rdn_positive_less23 less_entry_point_neg_neg
% 8.61/8.83  
%------------------------------------------------------------------------------