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

% Computer : n017.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:45:53 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X] :
      ( big_f(X)
     => ( ? [Y] :
            ( big_g(Y)
            & big_h(X,Y) )
        & ? [Y1] :
            ( big_g(Y1)
            & ~ big_h(X,Y1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,axiom,
    ? [X] :
      ( big_j(X)
      & ! [Y] :
          ( big_g(Y)
         => big_h(X,Y) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,conjecture,
    ? [X] :
      ( big_j(X)
      & ~ big_f(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    ~ ? [X] :
        ( big_j(X)
        & ~ big_f(X) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

fof(f5,plain,
    ! [X] :
      ( ~ big_f(X)
      | ( ? [Y] :
            ( big_g(Y)
            & big_h(X,Y) )
        & ? [Y1] :
            ( big_g(Y1)
            & ~ big_h(X,Y1) ) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f1]) ).

fof(f6,plain,
    ! [X] :
      ( ~ big_f(X)
      | ( big_g(sk0_0(X))
        & big_h(X,sk0_0(X))
        & big_g(sk0_1(X))
        & ~ big_h(X,sk0_1(X)) ) ),
    inference(skolemization,[status(esa)],[f5]) ).

fof(f9,plain,
    ! [X0] :
      ( ~ big_f(X0)
      | big_g(sk0_1(X0)) ),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f10,plain,
    ! [X0] :
      ( ~ big_f(X0)
      | ~ big_h(X0,sk0_1(X0)) ),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f11,plain,
    ? [X] :
      ( big_j(X)
      & ! [Y] :
          ( ~ big_g(Y)
          | big_h(X,Y) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f12,plain,
    ( big_j(sk0_2)
    & ! [Y] :
        ( ~ big_g(Y)
        | big_h(sk0_2,Y) ) ),
    inference(skolemization,[status(esa)],[f11]) ).

fof(f13,plain,
    big_j(sk0_2),
    inference(cnf_transformation,[status(esa)],[f12]) ).

fof(f14,plain,
    ! [X0] :
      ( ~ big_g(X0)
      | big_h(sk0_2,X0) ),
    inference(cnf_transformation,[status(esa)],[f12]) ).

fof(f15,plain,
    ! [X] :
      ( ~ big_j(X)
      | big_f(X) ),
    inference(pre_NNF_transformation,[status(esa)],[f4]) ).

fof(f16,plain,
    ! [X0] :
      ( ~ big_j(X0)
      | big_f(X0) ),
    inference(cnf_transformation,[status(esa)],[f15]) ).

fof(f17,plain,
    big_f(sk0_2),
    inference(resolution,[status(thm)],[f13,f16]) ).

fof(f18,plain,
    ( spl0_0
  <=> big_f(sk0_2) ),
    introduced(split_symbol_definition) ).

fof(f20,plain,
    ( ~ big_f(sk0_2)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f18]) ).

fof(f21,plain,
    ( spl0_1
  <=> big_g(sk0_1(sk0_2)) ),
    introduced(split_symbol_definition) ).

fof(f23,plain,
    ( ~ big_g(sk0_1(sk0_2))
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f21]) ).

fof(f24,plain,
    ( ~ big_f(sk0_2)
    | ~ big_g(sk0_1(sk0_2)) ),
    inference(resolution,[status(thm)],[f10,f14]) ).

fof(f25,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f24,f18,f21]) ).

fof(f26,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f20,f17]) ).

fof(f27,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f26]) ).

fof(f28,plain,
    ( ~ big_f(sk0_2)
    | spl0_1 ),
    inference(resolution,[status(thm)],[f23,f9]) ).

fof(f29,plain,
    ( ~ spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f28,f18,f21]) ).

fof(f30,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f25,f27,f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN068+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue May 30 09:54:25 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % Drodi V3.5.1
% 0.21/0.62  % Refutation found
% 0.21/0.62  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.62  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.62  % Elapsed time: 0.056999 seconds
% 0.21/0.62  % CPU time: 0.021372 seconds
% 0.21/0.62  % Memory used: 1.774 MB
%------------------------------------------------------------------------------