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

% Computer : n020.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:07 EDT 2022

% Result   : Theorem 0.13s 0.35s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   27 (  18 unt;   0 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   43 (  20   ~;   0   |;   8   &)
%                                         (  10 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   27 (   4 sgn  21   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(kalish223,conjecture,
    ( ! [X] :
        ( f(X)
      <=> p )
   => ( ! [Y] : f(Y)
    <=> p ) ) ).

fof(subgoal_0,plain,
    ( ( ! [X] :
          ( f(X)
        <=> p )
      & ! [Y] : f(Y) )
   => p ),
    inference(strip,[],[kalish223]) ).

fof(subgoal_1,plain,
    ( ( ! [X] :
          ( f(X)
        <=> p )
      & p )
   => ! [Y] : f(Y) ),
    inference(strip,[],[kalish223]) ).

fof(negate_0_0,plain,
    ~ ( ( ! [X] :
            ( f(X)
          <=> p )
        & ! [Y] : f(Y) )
     => p ),
    inference(negate,[],[subgoal_0]) ).

fof(normalize_0_0,plain,
    ( ~ p
    & ! [X] :
        ( ~ f(X)
      <=> ~ p )
    & ! [Y] : f(Y) ),
    inference(canonicalize,[],[negate_0_0]) ).

fof(normalize_0_1,plain,
    ! [Y] : f(Y),
    inference(conjunct,[],[normalize_0_0]) ).

fof(normalize_0_2,plain,
    ! [Y] : f(Y),
    inference(specialize,[],[normalize_0_1]) ).

fof(normalize_0_3,plain,
    ! [X] :
      ( ~ f(X)
    <=> ~ p ),
    inference(conjunct,[],[normalize_0_0]) ).

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

fof(normalize_0_5,plain,
    ! [X] : ~ f(X),
    inference(simplify,[],[normalize_0_3,normalize_0_4]) ).

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

cnf(refute_0_0,plain,
    f(Y),
    inference(canonicalize,[],[normalize_0_2]) ).

cnf(refute_0_1,plain,
    ~ f(X),
    inference(canonicalize,[],[normalize_0_6]) ).

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

cnf(refute_0_3,plain,
    $false,
    inference(resolve,[$cnf( f(Y) )],[refute_0_0,refute_0_2]) ).

fof(negate_1_0,plain,
    ~ ( ( ! [X] :
            ( f(X)
          <=> p )
        & p )
     => ! [Y] : f(Y) ),
    inference(negate,[],[subgoal_1]) ).

fof(normalize_1_0,plain,
    ( p
    & ? [Y] : ~ f(Y)
    & ! [X] :
        ( ~ f(X)
      <=> ~ p ) ),
    inference(canonicalize,[],[negate_1_0]) ).

fof(normalize_1_1,plain,
    ? [Y] : ~ f(Y),
    inference(conjunct,[],[normalize_1_0]) ).

fof(normalize_1_2,plain,
    ~ f(skolemFOFtoCNF_Y),
    inference(skolemize,[],[normalize_1_1]) ).

fof(normalize_1_3,plain,
    ! [X] :
      ( ~ f(X)
    <=> ~ p ),
    inference(conjunct,[],[normalize_1_0]) ).

fof(normalize_1_4,plain,
    p,
    inference(conjunct,[],[normalize_1_0]) ).

fof(normalize_1_5,plain,
    ! [X] : f(X),
    inference(simplify,[],[normalize_1_3,normalize_1_4]) ).

fof(normalize_1_6,plain,
    ! [X] : f(X),
    inference(specialize,[],[normalize_1_5]) ).

cnf(refute_1_0,plain,
    ~ f(skolemFOFtoCNF_Y),
    inference(canonicalize,[],[normalize_1_2]) ).

cnf(refute_1_1,plain,
    f(X),
    inference(canonicalize,[],[normalize_1_6]) ).

cnf(refute_1_2,plain,
    f(skolemFOFtoCNF_Y),
    inference(subst,[],[refute_1_1:[bind(X,$fot(skolemFOFtoCNF_Y))]]) ).

cnf(refute_1_3,plain,
    $false,
    inference(resolve,[$cnf( f(skolemFOFtoCNF_Y) )],[refute_1_2,refute_1_0]) ).

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