%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM298+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:14 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    less(n2,nn2),
    file('NUM298+1.p',unknown),
    [] ).

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

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

cnf(223,axiom,
    ( ~ less(u,v)
    | ~ less(v,u) ),
    file('NUM298+1.p',unknown),
    [] ).

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

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

cnf(435,plain,
    ( ~ rdn_translate(u,rdn_pos(v))
    | less(nn2,u) ),
    inference(res,[status(thm),theory(equality)],[22,389]),
    [iquote('0:Res:22.0,389.0')] ).

cnf(2525,plain,
    less(nn2,n2),
    inference(res,[status(thm),theory(equality)],[13,435]),
    [iquote('0:Res:13.0,435.0')] ).

cnf(2646,plain,
    $false,
    inference(mrr,[status(thm)],[2525,408]),
    [iquote('0:MRR:2525.0,408.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM298+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % 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 01:51:25 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.55/1.73  
% 1.55/1.73  SPASS V 3.9 
% 1.55/1.73  SPASS beiseite: Proof found.
% 1.55/1.73  % SZS status Theorem
% 1.55/1.73  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 1.55/1.73  SPASS derived 2237 clauses, backtracked 0 clauses, performed 0 splits and kept 2630 clauses.
% 1.55/1.73  SPASS allocated 99734 KBytes.
% 1.55/1.73  SPASS spent	0:00:01.35 on the problem.
% 1.55/1.73  		0:00:00.04 for the input.
% 1.55/1.73  		0:00:00.11 for the FLOTTER CNF translation.
% 1.55/1.73  		0:00:00.04 for inferences.
% 1.55/1.73  		0:00:00.00 for the backtracking.
% 1.55/1.73  		0:00:01.05 for the reduction.
% 1.55/1.73  
% 1.55/1.73  
% 1.55/1.73  Here is a proof with depth 2, length 9 :
% 1.55/1.73  % SZS output start Refutation
% See solution above
% 1.55/1.73  Formulae used in the proof : n2_not_less_nn2 rdn2 rdnn2 less_property less_entry_point_neg_pos
% 1.55/1.73  
%------------------------------------------------------------------------------