%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : SYN406+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n013.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  : 600s
% DateTime : Thu Jul 21 09:02:10 EDT 2022

% Result   : Theorem 0.12s 0.34s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   21 (   7 unt;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   47 (  17   ~;  10   |;  14   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   19 (   0 sgn   9   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(kalish240,conjecture,
    ( ( ! [X] :
          ( f(X)
         => g(X) )
      & ? [Y] :
          ( f(Y)
          & h(Y) ) )
   => ? [Z] :
        ( g(Z)
        & h(Z) ) ) ).

fof(subgoal_0,plain,
    ( ( ! [X] :
          ( f(X)
         => g(X) )
      & ? [Y] :
          ( f(Y)
          & h(Y) ) )
   => ? [Z] :
        ( g(Z)
        & h(Z) ) ),
    inference(strip,[],[kalish240]) ).

fof(negate_0_0,plain,
    ~ ( ( ! [X] :
            ( f(X)
           => g(X) )
        & ? [Y] :
            ( f(Y)
            & h(Y) ) )
     => ? [Z] :
          ( g(Z)
          & h(Z) ) ),
    inference(negate,[],[subgoal_0]) ).

fof(normalize_0_0,plain,
    ( ? [Y] :
        ( f(Y)
        & h(Y) )
    & ! [X] :
        ( ~ f(X)
        | g(X) )
    & ! [Z] :
        ( ~ g(Z)
        | ~ h(Z) ) ),
    inference(canonicalize,[],[negate_0_0]) ).

fof(normalize_0_1,plain,
    ? [Y] :
      ( f(Y)
      & h(Y) ),
    inference(conjunct,[],[normalize_0_0]) ).

fof(normalize_0_2,plain,
    ( f(skolemFOFtoCNF_Y)
    & h(skolemFOFtoCNF_Y) ),
    inference(skolemize,[],[normalize_0_1]) ).

fof(normalize_0_3,plain,
    f(skolemFOFtoCNF_Y),
    inference(conjunct,[],[normalize_0_2]) ).

fof(normalize_0_4,plain,
    ! [X] :
      ( ~ f(X)
      | g(X) ),
    inference(conjunct,[],[normalize_0_0]) ).

fof(normalize_0_5,plain,
    ! [X] :
      ( ~ f(X)
      | g(X) ),
    inference(specialize,[],[normalize_0_4]) ).

fof(normalize_0_6,plain,
    h(skolemFOFtoCNF_Y),
    inference(conjunct,[],[normalize_0_2]) ).

fof(normalize_0_7,plain,
    ! [Z] :
      ( ~ g(Z)
      | ~ h(Z) ),
    inference(conjunct,[],[normalize_0_0]) ).

fof(normalize_0_8,plain,
    ! [Z] :
      ( ~ g(Z)
      | ~ h(Z) ),
    inference(specialize,[],[normalize_0_7]) ).

cnf(refute_0_0,plain,
    f(skolemFOFtoCNF_Y),
    inference(canonicalize,[],[normalize_0_3]) ).

cnf(refute_0_1,plain,
    ( ~ f(X)
    | g(X) ),
    inference(canonicalize,[],[normalize_0_5]) ).

cnf(refute_0_2,plain,
    ( ~ f(skolemFOFtoCNF_Y)
    | g(skolemFOFtoCNF_Y) ),
    inference(subst,[],[refute_0_1:[bind(X,$fot(skolemFOFtoCNF_Y))]]) ).

cnf(refute_0_3,plain,
    g(skolemFOFtoCNF_Y),
    inference(resolve,[$cnf( f(skolemFOFtoCNF_Y) )],[refute_0_0,refute_0_2]) ).

cnf(refute_0_4,plain,
    h(skolemFOFtoCNF_Y),
    inference(canonicalize,[],[normalize_0_6]) ).

cnf(refute_0_5,plain,
    ( ~ g(Z)
    | ~ h(Z) ),
    inference(canonicalize,[],[normalize_0_8]) ).

cnf(refute_0_6,plain,
    ( ~ g(skolemFOFtoCNF_Y)
    | ~ h(skolemFOFtoCNF_Y) ),
    inference(subst,[],[refute_0_5:[bind(Z,$fot(skolemFOFtoCNF_Y))]]) ).

cnf(refute_0_7,plain,
    ~ g(skolemFOFtoCNF_Y),
    inference(resolve,[$cnf( h(skolemFOFtoCNF_Y) )],[refute_0_4,refute_0_6]) ).

cnf(refute_0_8,plain,
    $false,
    inference(resolve,[$cnf( g(skolemFOFtoCNF_Y) )],[refute_0_3,refute_0_7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN406+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12  % Command  : metis --show proof --show saturation %s
% 0.12/0.33  % Computer : n013.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jul 11 15:53:14 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.34  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.34  
% 0.12/0.34  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.12/0.34  
%------------------------------------------------------------------------------