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

% Computer : n012.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:12:14 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ( ? [X] :
        ( p(X)
        & q(X) )
   => ( ? [X] : p(X)
      & ? [X] : q(X) ) ) ).

fof(subgoal_0,plain,
    ( ? [X] :
        ( p(X)
        & q(X) )
   => ? [X] : p(X) ),
    inference(strip,[],[prove_this]) ).

fof(subgoal_1,plain,
    ( ( ? [X] :
          ( p(X)
          & q(X) )
      & ? [X] : p(X) )
   => ? [X] : q(X) ),
    inference(strip,[],[prove_this]) ).

fof(negate_0_0,plain,
    ~ ( ? [X] :
          ( p(X)
          & q(X) )
     => ? [X] : p(X) ),
    inference(negate,[],[subgoal_0]) ).

fof(normalize_0_0,plain,
    ( ? [X] :
        ( p(X)
        & q(X) )
    & ! [X] : ~ p(X) ),
    inference(canonicalize,[],[negate_0_0]) ).

fof(normalize_0_1,plain,
    ? [X] :
      ( p(X)
      & q(X) ),
    inference(conjunct,[],[normalize_0_0]) ).

fof(normalize_0_2,plain,
    ( p(skolemFOFtoCNF_X)
    & q(skolemFOFtoCNF_X) ),
    inference(skolemize,[],[normalize_0_1]) ).

fof(normalize_0_3,plain,
    p(skolemFOFtoCNF_X),
    inference(conjunct,[],[normalize_0_2]) ).

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

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

cnf(refute_0_0,plain,
    p(skolemFOFtoCNF_X),
    inference(canonicalize,[],[normalize_0_3]) ).

cnf(refute_0_1,plain,
    ~ p(X),
    inference(canonicalize,[],[normalize_0_5]) ).

cnf(refute_0_2,plain,
    ~ p(skolemFOFtoCNF_X),
    inference(subst,[],[refute_0_1:[bind(X,$fot(skolemFOFtoCNF_X))]]) ).

cnf(refute_0_3,plain,
    $false,
    inference(resolve,[$cnf( p(skolemFOFtoCNF_X) )],[refute_0_0,refute_0_2]) ).

fof(negate_1_0,plain,
    ~ ( ( ? [X] :
            ( p(X)
            & q(X) )
        & ? [X] : p(X) )
     => ? [X] : q(X) ),
    inference(negate,[],[subgoal_1]) ).

fof(normalize_1_0,plain,
    ( ? [X] : p(X)
    & ? [X] :
        ( p(X)
        & q(X) )
    & ! [X] : ~ q(X) ),
    inference(canonicalize,[],[negate_1_0]) ).

fof(normalize_1_1,plain,
    ? [X] :
      ( p(X)
      & q(X) ),
    inference(conjunct,[],[normalize_1_0]) ).

fof(normalize_1_2,plain,
    ( p(skolemFOFtoCNF_X_2)
    & q(skolemFOFtoCNF_X_2) ),
    inference(skolemize,[],[normalize_1_1]) ).

fof(normalize_1_3,plain,
    q(skolemFOFtoCNF_X_2),
    inference(conjunct,[],[normalize_1_2]) ).

fof(normalize_1_4,plain,
    ! [X] : ~ q(X),
    inference(conjunct,[],[normalize_1_0]) ).

fof(normalize_1_5,plain,
    ! [X] : ~ q(X),
    inference(specialize,[],[normalize_1_4]) ).

cnf(refute_1_0,plain,
    q(skolemFOFtoCNF_X_2),
    inference(canonicalize,[],[normalize_1_3]) ).

cnf(refute_1_1,plain,
    ~ q(X),
    inference(canonicalize,[],[normalize_1_5]) ).

cnf(refute_1_2,plain,
    ~ q(skolemFOFtoCNF_X_2),
    inference(subst,[],[refute_1_1:[bind(X,$fot(skolemFOFtoCNF_X_2))]]) ).

cnf(refute_1_3,plain,
    $false,
    inference(resolve,[$cnf( q(skolemFOFtoCNF_X_2) )],[refute_1_0,refute_1_2]) ).

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