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

% Computer : n026.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:52:08 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ~ ? [X] : f(X)
   => ! [Y] :
        ( f(Y)
       => g(Y) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ( ~ ? [X] : f(X)
     => ! [Y] :
          ( f(Y)
         => g(Y) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ! [X] : ~ f(X)
    & ? [Y] :
        ( f(Y)
        & ~ g(Y) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f4,plain,
    ( ! [X] : ~ f(X)
    & f(sk0_0)
    & ~ g(sk0_0) ),
    inference(skolemization,[status(esa)],[f3]) ).

fof(f5,plain,
    ! [X0] : ~ f(X0),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f6,plain,
    f(sk0_0),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f8,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f6,f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SYN408+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.29  % Computer : n026.cluster.edu
% 0.08/0.29  % Model    : x86_64 x86_64
% 0.08/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29  % Memory   : 8042.1875MB
% 0.08/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29  % CPULimit : 300
% 0.08/0.29  % WCLimit  : 300
% 0.08/0.29  % DateTime : Mon Apr 29 22:21:04 EDT 2024
% 0.08/0.30  % 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.13/0.32  % Elapsed time: 0.010810 seconds
% 0.13/0.32  % CPU time: 0.016570 seconds
% 0.13/0.32  % Total memory used: 1.607 MB
% 0.13/0.32  % Net memory used: 1.440 MB
%------------------------------------------------------------------------------