%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : LCL506+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 : n011.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:43 EDT 2022

% Result   : Theorem 0.13s 0.38s
% Output   : CNFRefutation 0.13s
% 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_and_1,conjecture,
    and_1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_1) ).

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

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

fof(rosser_kn2,axiom,
    kn2,
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).

fof(c_0_4,negated_conjecture,
    ~ and_1,
    inference(assume_negation,[status(cth)],[hilbert_and_1]) ).

fof(c_0_5,plain,
    ! [X33,X34] :
      ( ( ~ and_1
        | is_a_theorem(implies(and(X33,X34),X33)) )
      & ( ~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0))
        | and_1 ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_1])])])]) ).

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

fof(c_0_7,plain,
    ! [X73,X74] :
      ( ( ~ kn2
        | is_a_theorem(implies(and(X73,X74),X73)) )
      & ( ~ is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0))
        | kn2 ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn2])])])]) ).

cnf(c_0_8,plain,
    ( and_1
    | ~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

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

cnf(c_0_11,plain,
    kn2,
    inference(split_conjunct,[status(thm)],[rosser_kn2]) ).

cnf(c_0_12,plain,
    ~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0)),
    inference(sr,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    is_a_theorem(implies(and(X1,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.10/0.12  % Problem  : LCL506+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34  % Computer : n011.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 : Mon Jul  4 21:34:07 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.38  # No SInE strategy applied
% 0.13/0.38  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.13/0.38  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38  #
% 0.13/0.38  # Presaturation interreduction done
% 0.13/0.38  
% 0.13/0.38  # Proof found!
% 0.13/0.38  # SZS status Theorem
% 0.13/0.38  # SZS output start CNFRefutation
% See solution above
% 0.13/0.38  # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------