%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : NUM295+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n032.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  : 300s
% DateTime : Tue Apr 30 20:30:32 EDT 2024

% Result   : Theorem 0.08s 0.30s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (  11 unt;   0 def)
%            Number of atoms       :   45 (   8 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   44 (  20   ~;  16   |;   6   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   47 (  43   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    rdn_translate(n0,rdn_pos(rdnn(n0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f282,axiom,
    ! [X,Y,RDN_X,RDN_Y] :
      ( ( rdn_translate(X,rdn_neg(RDN_X))
        & rdn_translate(Y,rdn_pos(RDN_Y)) )
     => less(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f284,axiom,
    ! [X,Y] :
      ( less(X,Y)
    <=> ( ~ less(Y,X)
        & Y != X ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f402,conjecture,
    ? [X,Y] : less(X,Y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f403,negated_conjecture,
    ~ ? [X,Y] : less(X,Y),
    inference(negated_conjecture,[status(cth)],[f402]) ).

fof(f404,plain,
    rdn_translate(n0,rdn_pos(rdnn(n0))),
    inference(cnf_transformation,[status(esa)],[f1]) ).

fof(f697,plain,
    ! [X,Y,RDN_X,RDN_Y] :
      ( ~ rdn_translate(X,rdn_neg(RDN_X))
      | ~ rdn_translate(Y,rdn_pos(RDN_Y))
      | less(X,Y) ),
    inference(pre_NNF_transformation,[status(esa)],[f282]) ).

fof(f698,plain,
    ! [X,Y] :
      ( ! [RDN_X] : ~ rdn_translate(X,rdn_neg(RDN_X))
      | ! [RDN_Y] : ~ rdn_translate(Y,rdn_pos(RDN_Y))
      | less(X,Y) ),
    inference(miniscoping,[status(esa)],[f697]) ).

fof(f699,plain,
    ! [X0,X1,X2,X3] :
      ( ~ rdn_translate(X0,rdn_neg(X1))
      | ~ rdn_translate(X2,rdn_pos(X3))
      | less(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f698]) ).

fof(f703,plain,
    ! [X,Y] :
      ( ( ~ less(X,Y)
        | ( ~ less(Y,X)
          & Y != X ) )
      & ( less(X,Y)
        | less(Y,X)
        | Y = X ) ),
    inference(NNF_transformation,[status(esa)],[f284]) ).

fof(f704,plain,
    ( ! [X,Y] :
        ( ~ less(X,Y)
        | ( ~ less(Y,X)
          & Y != X ) )
    & ! [X,Y] :
        ( less(X,Y)
        | less(Y,X)
        | Y = X ) ),
    inference(miniscoping,[status(esa)],[f703]) ).

fof(f707,plain,
    ! [X0,X1] :
      ( less(X0,X1)
      | less(X1,X0)
      | X1 = X0 ),
    inference(cnf_transformation,[status(esa)],[f704]) ).

fof(f861,plain,
    ! [X,Y] : ~ less(X,Y),
    inference(pre_NNF_transformation,[status(esa)],[f403]) ).

fof(f862,plain,
    ! [X0,X1] : ~ less(X0,X1),
    inference(cnf_transformation,[status(esa)],[f861]) ).

fof(f865,plain,
    ! [X0,X1] :
      ( less(X0,X1)
      | X0 = X1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f707,f862]) ).

fof(f866,plain,
    ! [X0,X1] : X0 = X1,
    inference(resolution,[status(thm)],[f865,f862]) ).

fof(f868,plain,
    ! [X0,X1,X2,X3] :
      ( ~ rdn_translate(X0,rdn_neg(X1))
      | ~ rdn_translate(X2,rdn_pos(X3)) ),
    inference(forward_subsumption_resolution,[status(thm)],[f699,f862]) ).

fof(f884,plain,
    ! [X0] : rdn_translate(X0,rdn_pos(rdnn(n0))),
    inference(paramodulation,[status(thm)],[f866,f404]) ).

fof(f892,plain,
    ! [X0,X1] : rdn_translate(X0,X1),
    inference(paramodulation,[status(thm)],[f866,f884]) ).

fof(f900,plain,
    ! [X0,X1] : ~ rdn_translate(X0,rdn_pos(X1)),
    inference(backward_subsumption_resolution,[status(thm)],[f868,f892]) ).

fof(f901,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f900,f892]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08  % Problem  : NUM295+1 : TPTP v8.1.2. Released v3.1.0.
% 0.05/0.09  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.28  % Computer : n032.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 300
% 0.08/0.28  % DateTime : Mon Apr 29 20:59:20 EDT 2024
% 0.08/0.28  % CPUTime  : 
% 0.08/0.30  % Drodi V3.6.0
% 0.08/0.30  % Refutation found
% 0.08/0.30  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/0.30  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.31  % Elapsed time: 0.026664 seconds
% 0.12/0.31  % CPU time: 0.037280 seconds
% 0.12/0.31  % Total memory used: 14.685 MB
% 0.12/0.31  % Net memory used: 14.672 MB
%------------------------------------------------------------------------------