%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : LCL491+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s

% Computer : n019.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 10:22:38 EDT 2022

% Result   : Theorem 0.12s 0.37s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   15 (   9 unt;   0 def)
%            Number of atoms       :   25 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   20 (  10   ~;   6   |;   2   &)
%                                         (   2 <=>;   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   :   12 (   2 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(hilbert_or_2,conjecture,
    or_2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_or_2) ).

fof(or_2,axiom,
    ( or_2
  <=> ! [X1,X2] : is_a_theorem(implies(X2,or(X1,X2))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_2) ).

fof(r2,axiom,
    ( r2
  <=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r2) ).

fof(principia_r2,axiom,
    r2,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r2) ).

fof(c_0_4,negated_conjecture,
    ~ or_2,
    inference(assume_negation,[status(cth)],[hilbert_or_2]) ).

fof(c_0_5,plain,
    ! [X49,X50] :
      ( ( ~ or_2
        | is_a_theorem(implies(X50,or(X49,X50))) )
      & ( ~ is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0)))
        | or_2 ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[or_2])])])]) ).

fof(c_0_6,negated_conjecture,
    ~ or_2,
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_7,plain,
    ! [X97,X98] :
      ( ( ~ r2
        | is_a_theorem(implies(X98,or(X97,X98))) )
      & ( ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))
        | r2 ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r2])])])]) ).

cnf(c_0_8,plain,
    ( or_2
    | ~ is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ~ or_2,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( is_a_theorem(implies(X1,or(X2,X1)))
    | ~ r2 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    r2,
    inference(split_conjunct,[status(thm)],[principia_r2]) ).

cnf(c_0_12,plain,
    ~ is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))),
    inference(sr,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    is_a_theorem(implies(X1,or(X2,X1))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).

cnf(c_0_14,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL491+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34  % Computer : n019.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  : 600
% 0.12/0.34  % DateTime : Sat Jul  2 23:24:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.37  # No SInE strategy applied
% 0.12/0.37  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.12/0.37  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37  #
% 0.12/0.37  # Presaturation interreduction done
% 0.12/0.37  
% 0.12/0.37  # Proof found!
% 0.12/0.37  # SZS status Theorem
% 0.12/0.37  # SZS output start CNFRefutation
% See solution above
% 0.12/0.37  # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------