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

% Computer : n006.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:48:31 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [A] :
      ( ( ( f
          | g )
        & ! [X] :
            ( p(X)
            & q(X) ) )
     => q(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ! [A] :
        ( ( ( f
            | g )
          & ! [X] :
              ( p(X)
              & q(X) ) )
       => q(A) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

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

fof(f4,plain,
    ( ( f
      | g )
    & ! [X] : p(X)
    & ! [X] : q(X)
    & ? [A] : ~ q(A) ),
    inference(miniscoping,[status(esa)],[f3]) ).

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

fof(f8,plain,
    ! [X0] : q(X0),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f9,plain,
    ~ q(sk0_0),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f17,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f9,f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem  : SYN976+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.09  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.29  % Computer : n006.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 : Tue May 30 10:23:17 EDT 2023
% 0.08/0.29  % CPUTime  : 
% 0.08/0.29  % Drodi V3.5.1
% 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.14/0.51  % Elapsed time: 0.006881 seconds
% 0.14/0.51  % CPU time: 0.007830 seconds
% 0.14/0.51  % Memory used: 463.841 KB
%------------------------------------------------------------------------------