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

% Computer : n010.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:13 EDT 2022

% Result   : Theorem 149.21s 149.43s
% Output   : Refutation 149.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   13 (   8 unt;   0 nHn;  13 RR)
%            Number of literals    :   22 (   0 equ;  12 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    :   11 (  11 usr;   9 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

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

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

cnf(24,axiom,
    rdn_translate(nn4,rdn_neg(rdnn(n4))),
    file('NUM297+1.p',unknown),
    [] ).

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

cnf(33,axiom,
    rdn_positive_less(rdnn(n3),rdnn(n4)),
    file('NUM297+1.p',unknown),
    [] ).

cnf(394,axiom,
    ( ~ rdn_positive_less(rdnn(u),rdnn(v))
    | ~ rdn_positive_less(rdnn(w),rdnn(u))
    | rdn_positive_less(rdnn(w),rdnn(v)) ),
    file('NUM297+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('NUM297+1.p',unknown),
    [] ).

cnf(856,plain,
    ( ~ rdn_positive_less(rdnn(u),rdnn(n3))
    | rdn_positive_less(rdnn(u),rdnn(n4)) ),
    inference(res,[status(thm),theory(equality)],[33,394]),
    [iquote('0:Res:33.0,394.0')] ).

cnf(73575,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(73748,plain,
    ( ~ rdn_positive_less(rdnn(n2),rdnn(n4))
    | less(nn4,nn2) ),
    inference(res,[status(thm),theory(equality)],[24,73575]),
    [iquote('0:Res:24.0,73575.1')] ).

cnf(73871,plain,
    ~ rdn_positive_less(rdnn(n2),rdnn(n4)),
    inference(mrr,[status(thm)],[73748,10]),
    [iquote('0:MRR:73748.1,10.0')] ).

cnf(74625,plain,
    ~ rdn_positive_less(rdnn(n2),rdnn(n3)),
    inference(res,[status(thm),theory(equality)],[856,73871]),
    [iquote('0:Res:856.1,73871.0')] ).

cnf(74626,plain,
    $false,
    inference(mrr,[status(thm)],[74625,32]),
    [iquote('0:MRR:74625.0,32.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM297+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n010.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 : Fri Jul  8 00:02:01 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 149.21/149.43  
% 149.21/149.43  SPASS V 3.9 
% 149.21/149.43  SPASS beiseite: Proof found.
% 149.21/149.43  % SZS status Theorem
% 149.21/149.43  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 149.21/149.43  SPASS derived 73529 clauses, backtracked 16 clauses, performed 1 splits and kept 73926 clauses.
% 149.21/149.43  SPASS allocated 145570 KBytes.
% 149.21/149.43  SPASS spent	0:2:23.64 on the problem.
% 149.21/149.43  		0:00:00.04 for the input.
% 149.21/149.43  		0:00:00.11 for the FLOTTER CNF translation.
% 149.21/149.43  		0:00:02.93 for inferences.
% 149.21/149.43  		0:00:00.08 for the backtracking.
% 149.21/149.43  		0:1:45.13 for the reduction.
% 149.21/149.43  
% 149.21/149.43  
% 149.21/149.43  Here is a proof with depth 3, length 13 :
% 149.21/149.43  % SZS output start Refutation
% See solution above
% 149.21/149.43  Formulae used in the proof : nn4_less_nn2 rdnn2 rdnn4 rdn_positive_less23 rdn_positive_less34 rdn_positive_less_transitivity less_entry_point_neg_neg
% 149.21/149.43  
%------------------------------------------------------------------------------