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

% Computer : n018.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 : Sun Jul 17 12:52:39 EDT 2022

% Result   : Theorem 0.19s 0.40s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (  12 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   29 (  15   ~;   8   |;   2   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   18 (   2 sgn  10   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(or_2,axiom,
    ( or_2
  <=> ! [X,Y] : is_a_theorem(implies(Y,or(X,Y))) ) ).

fof(r2,axiom,
    ( r2
  <=> ! [P,Q] : is_a_theorem(implies(Q,or(P,Q))) ) ).

fof(principia_r2,axiom,
    r2 ).

fof(hilbert_or_2,conjecture,
    or_2 ).

fof(subgoal_0,plain,
    or_2,
    inference(strip,[],[hilbert_or_2]) ).

fof(negate_0_0,plain,
    ~ or_2,
    inference(negate,[],[subgoal_0]) ).

fof(normalize_0_0,plain,
    ( ~ or_2
  <=> ? [X,Y] : ~ is_a_theorem(implies(Y,or(X,Y))) ),
    inference(canonicalize,[],[or_2]) ).

fof(normalize_0_1,plain,
    ! [X,Y] :
      ( ( ~ is_a_theorem(implies(skolemFOFtoCNF_Y_10,or(skolemFOFtoCNF_X_10,skolemFOFtoCNF_Y_10)))
        | or_2 )
      & ( ~ or_2
        | is_a_theorem(implies(Y,or(X,Y))) ) ),
    inference(clausify,[],[normalize_0_0]) ).

fof(normalize_0_2,plain,
    ( ~ is_a_theorem(implies(skolemFOFtoCNF_Y_10,or(skolemFOFtoCNF_X_10,skolemFOFtoCNF_Y_10)))
    | or_2 ),
    inference(conjunct,[],[normalize_0_1]) ).

fof(normalize_0_3,plain,
    ( ~ r2
  <=> ? [P,Q] : ~ is_a_theorem(implies(Q,or(P,Q))) ),
    inference(canonicalize,[],[r2]) ).

fof(normalize_0_4,plain,
    ! [P,Q] :
      ( ( ~ is_a_theorem(implies(skolemFOFtoCNF_Q_4,or(skolemFOFtoCNF_P_7,skolemFOFtoCNF_Q_4)))
        | r2 )
      & ( ~ r2
        | is_a_theorem(implies(Q,or(P,Q))) ) ),
    inference(clausify,[],[normalize_0_3]) ).

fof(normalize_0_5,plain,
    ! [P,Q] :
      ( ~ r2
      | is_a_theorem(implies(Q,or(P,Q))) ),
    inference(conjunct,[],[normalize_0_4]) ).

fof(normalize_0_6,plain,
    r2,
    inference(canonicalize,[],[principia_r2]) ).

fof(normalize_0_7,plain,
    ~ or_2,
    inference(canonicalize,[],[negate_0_0]) ).

cnf(refute_0_0,plain,
    ( ~ is_a_theorem(implies(skolemFOFtoCNF_Y_10,or(skolemFOFtoCNF_X_10,skolemFOFtoCNF_Y_10)))
    | or_2 ),
    inference(canonicalize,[],[normalize_0_2]) ).

cnf(refute_0_1,plain,
    ( ~ r2
    | is_a_theorem(implies(Q,or(P,Q))) ),
    inference(canonicalize,[],[normalize_0_5]) ).

cnf(refute_0_2,plain,
    r2,
    inference(canonicalize,[],[normalize_0_6]) ).

cnf(refute_0_3,plain,
    is_a_theorem(implies(Q,or(P,Q))),
    inference(resolve,[$cnf( r2 )],[refute_0_2,refute_0_1]) ).

cnf(refute_0_4,plain,
    is_a_theorem(implies(skolemFOFtoCNF_Y_10,or(skolemFOFtoCNF_X_10,skolemFOFtoCNF_Y_10))),
    inference(subst,[],[refute_0_3:[bind(P,$fot(skolemFOFtoCNF_X_10)),bind(Q,$fot(skolemFOFtoCNF_Y_10))]]) ).

cnf(refute_0_5,plain,
    or_2,
    inference(resolve,[$cnf( is_a_theorem(implies(skolemFOFtoCNF_Y_10,or(skolemFOFtoCNF_X_10,skolemFOFtoCNF_Y_10))) )],[refute_0_4,refute_0_0]) ).

cnf(refute_0_6,plain,
    ~ or_2,
    inference(canonicalize,[],[normalize_0_7]) ).

cnf(refute_0_7,plain,
    $false,
    inference(resolve,[$cnf( or_2 )],[refute_0_5,refute_0_6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : LCL491+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13  % Command  : metis --show proof --show saturation %s
% 0.13/0.34  % Computer : n018.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jul  2 23:24:34 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.34  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.19/0.40  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.40  
% 0.19/0.40  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.19/0.40  
%------------------------------------------------------------------------------