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

% Computer : n005.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:53:41 EDT 2024

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

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

fof(f2,negated_conjecture,
    ~ ( ( ! [X] : p(X)
        & ? [Y] : q(Y) )
     => ? [Z] :
        ! [Y] :
          ( p(Y)
          | r(Z) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ! [X] : p(X)
    & ? [Y] : q(Y)
    & ! [Z] :
      ? [Y] :
        ( ~ p(Y)
        & ~ r(Z) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f4,plain,
    ( ! [X] : p(X)
    & ? [Y] : q(Y)
    & ? [Y] : ~ p(Y)
    & ! [Z] : ~ r(Z) ),
    inference(miniscoping,[status(esa)],[f3]) ).

fof(f5,plain,
    ( ! [X] : p(X)
    & q(sk0_0)
    & ~ p(sk0_1)
    & ! [Z] : ~ r(Z) ),
    inference(skolemization,[status(esa)],[f4]) ).

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

fof(f8,plain,
    ~ p(sk0_1),
    inference(cnf_transformation,[status(esa)],[f5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07  % Problem  : SYN946+1 : TPTP v8.1.2. Released v3.1.0.
% 0.04/0.07  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.26  % Computer : n005.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit : 300
% 0.07/0.26  % WCLimit  : 300
% 0.07/0.26  % DateTime : Mon Apr 29 21:54:41 EDT 2024
% 0.07/0.26  % CPUTime  : 
% 0.07/0.27  % Drodi V3.6.0
% 0.07/0.27  % Refutation found
% 0.07/0.27  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.07/0.27  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.07/0.28  % Elapsed time: 0.010311 seconds
% 0.07/0.28  % CPU time: 0.017216 seconds
% 0.07/0.28  % Total memory used: 1.887 MB
% 0.07/0.28  % Net memory used: 1.690 MB
%------------------------------------------------------------------------------