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

% Computer : n028.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:12 EDT 2022

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

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

cnf(29,axiom,
    rdn_translate(nn9,rdn_neg(rdnn(n9))),
    file('NUM293+1.p',unknown),
    [] ).

cnf(45,axiom,
    rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
    file('NUM293+1.p',unknown),
    [] ).

cnf(389,axiom,
    ( ~ rdn_translate(u,rdn_neg(v))
    | ~ rdn_translate(w,rdn_pos(x))
    | less(u,w) ),
    file('NUM293+1.p',unknown),
    [] ).

cnf(413,plain,
    ( ~ rdn_translate(u,rdn_neg(v))
    | ~ rdn_translate(n13,rdn_pos(w)) ),
    inference(res,[status(thm),theory(equality)],[389,10]),
    [iquote('0:Res:389.2,10.0')] ).

cnf(430,plain,
    ~ rdn_translate(n13,rdn_pos(u)),
    inference(res,[status(thm),theory(equality)],[29,413]),
    [iquote('0:Res:29.0,413.0')] ).

cnf(529,plain,
    $false,
    inference(unc,[status(thm)],[430,45]),
    [iquote('0:UnC:430.0,45.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM293+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n028.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.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jul  5 18:08:06 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.37/0.60  
% 0.37/0.60  SPASS V 3.9 
% 0.37/0.60  SPASS beiseite: Proof found.
% 0.37/0.60  % SZS status Theorem
% 0.37/0.60  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.37/0.60  SPASS derived 120 clauses, backtracked 0 clauses, performed 0 splits and kept 512 clauses.
% 0.37/0.60  SPASS allocated 98720 KBytes.
% 0.37/0.60  SPASS spent	0:00:00.26 on the problem.
% 0.37/0.60  		0:00:00.04 for the input.
% 0.37/0.60  		0:00:00.11 for the FLOTTER CNF translation.
% 0.37/0.60  		0:00:00.01 for inferences.
% 0.37/0.60  		0:00:00.00 for the backtracking.
% 0.37/0.60  		0:00:00.03 for the reduction.
% 0.37/0.60  
% 0.37/0.60  
% 0.37/0.60  Here is a proof with depth 2, length 7 :
% 0.37/0.60  % SZS output start Refutation
% See solution above
% 0.37/0.60  Formulae used in the proof : something_less_n13 rdnn9 rdn13 less_entry_point_neg_pos
% 0.37/0.60  
%------------------------------------------------------------------------------