TSTP Solution File: NUM298+1 by Drodi---3.5.1

View Problem - Process Solution

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

% Computer : n009.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 : Wed May 31 12:24:48 EDT 2023

% Result   : Theorem 0.21s 0.59s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (  10 unt;   0 def)
%            Number of atoms       :   41 (   5 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   43 (  21   ~;  14   |;   6   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-1 aty)
%            Number of variables   :   28 (;  28   !;   0   ?)

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

fof(f130,axiom,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    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,
    ~ less(n2,nn2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f403,negated_conjecture,
    ~ ~ less(n2,nn2),
    inference(negated_conjecture,[status(cth)],[f402]) ).

fof(f406,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f533,plain,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    inference(cnf_transformation,[status(esa)],[f130]) ).

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(f705,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | ~ less(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f704]) ).

fof(f861,plain,
    less(n2,nn2),
    inference(cnf_transformation,[status(esa)],[f403]) ).

fof(f864,plain,
    ~ less(nn2,n2),
    inference(resolution,[status(thm)],[f705,f861]) ).

fof(f875,plain,
    ! [X0,X1] :
      ( ~ rdn_translate(X0,rdn_pos(X1))
      | less(nn2,X0) ),
    inference(resolution,[status(thm)],[f699,f533]) ).

fof(f876,plain,
    less(nn2,n2),
    inference(resolution,[status(thm)],[f875,f406]) ).

fof(f877,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f876,f864]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM298+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33  % Computer : n009.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  : 300
% 0.12/0.33  % DateTime : Tue May 30 09:56:01 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.36  % Drodi V3.5.1
% 0.21/0.59  % Refutation found
% 0.21/0.59  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.59  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.59  % Elapsed time: 0.033113 seconds
% 0.21/0.59  % CPU time: 0.041792 seconds
% 0.21/0.59  % Memory used: 5.754 MB
%------------------------------------------------------------------------------