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

% Computer : n001.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:46:39 EDT 2023

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

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

fof(f2,negated_conjecture,
    ~ ( ( ! [X] :
          ? [Y] :
            ( big_p(X)
           => ( big_r(X,g(h(Y)))
              & big_p(Y) ) )
        & ! [W] :
            ( big_p(W)
           => ( big_p(g(W))
              & big_p(h(W)) ) ) )
     => ! [X] :
          ( big_p(X)
         => ? [Y] :
              ( big_r(X,Y)
              & big_p(Y) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ! [X] :
      ? [Y] :
        ( ~ big_p(X)
        | ( big_r(X,g(h(Y)))
          & big_p(Y) ) )
    & ! [W] :
        ( ~ big_p(W)
        | ( big_p(g(W))
          & big_p(h(W)) ) )
    & ? [X] :
        ( big_p(X)
        & ! [Y] :
            ( ~ big_r(X,Y)
            | ~ big_p(Y) ) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f4,plain,
    ( ! [X] :
        ( ~ big_p(X)
        | ? [Y] :
            ( big_r(X,g(h(Y)))
            & big_p(Y) ) )
    & ! [W] :
        ( ~ big_p(W)
        | ( big_p(g(W))
          & big_p(h(W)) ) )
    & ? [X] :
        ( big_p(X)
        & ! [Y] :
            ( ~ big_r(X,Y)
            | ~ big_p(Y) ) ) ),
    inference(miniscoping,[status(esa)],[f3]) ).

fof(f5,plain,
    ( ! [X] :
        ( ~ big_p(X)
        | ( big_r(X,g(h(sk0_0(X))))
          & big_p(sk0_0(X)) ) )
    & ! [W] :
        ( ~ big_p(W)
        | ( big_p(g(W))
          & big_p(h(W)) ) )
    & big_p(sk0_1)
    & ! [Y] :
        ( ~ big_r(sk0_1,Y)
        | ~ big_p(Y) ) ),
    inference(skolemization,[status(esa)],[f4]) ).

fof(f6,plain,
    ! [X0] :
      ( ~ big_p(X0)
      | big_r(X0,g(h(sk0_0(X0)))) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f7,plain,
    ! [X0] :
      ( ~ big_p(X0)
      | big_p(sk0_0(X0)) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f8,plain,
    ! [X0] :
      ( ~ big_p(X0)
      | big_p(g(X0)) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f9,plain,
    ! [X0] :
      ( ~ big_p(X0)
      | big_p(h(X0)) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f10,plain,
    big_p(sk0_1),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f11,plain,
    ! [X0] :
      ( ~ big_r(sk0_1,X0)
      | ~ big_p(X0) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f12,plain,
    big_p(sk0_0(sk0_1)),
    inference(resolution,[status(thm)],[f7,f10]) ).

fof(f20,plain,
    big_r(sk0_1,g(h(sk0_0(sk0_1)))),
    inference(resolution,[status(thm)],[f6,f10]) ).

fof(f22,plain,
    big_p(h(sk0_0(sk0_1))),
    inference(resolution,[status(thm)],[f9,f12]) ).

fof(f50,plain,
    big_p(g(h(sk0_0(sk0_1)))),
    inference(resolution,[status(thm)],[f22,f8]) ).

fof(f56,plain,
    ~ big_p(g(h(sk0_0(sk0_1)))),
    inference(resolution,[status(thm)],[f20,f11]) ).

fof(f129,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f50,f56]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem  : SYN365+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.07  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.26  % Computer : n001.cluster.edu
% 0.06/0.26  % Model    : x86_64 x86_64
% 0.06/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26  % Memory   : 8042.1875MB
% 0.06/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26  % CPULimit : 300
% 0.06/0.26  % WCLimit  : 300
% 0.06/0.26  % DateTime : Tue May 30 10:54:00 EDT 2023
% 0.06/0.26  % CPUTime  : 
% 0.06/0.26  % Drodi V3.5.1
% 0.06/0.27  % Refutation found
% 0.06/0.27  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.06/0.27  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.48  % Elapsed time: 0.007968 seconds
% 0.11/0.48  % CPU time: 0.019003 seconds
% 0.11/0.48  % Memory used: 7.236 MB
%------------------------------------------------------------------------------