%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM405+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n004.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 : Mon Jul 18 08:35:42 EDT 2022

% Result   : Theorem 8.41s 2.57s
% Output   : CNFRefutation 8.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (   4 unt;   2 nHn;   9 RR)
%            Number of literals    :   26 (   0 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   17 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_65,plain,
    ( ordinal(X1)
    | ~ in(X1,esk15_1(X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wg0aezbt/lgb.p',i_0_65) ).

cnf(i_0_69,plain,
    ( ordinal(esk16_1(X1))
    | in(esk16_1(X1),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wg0aezbt/lgb.p',i_0_69) ).

cnf(i_0_71,negated_conjecture,
    ( in(X1,esk17_0)
    | ~ ordinal(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wg0aezbt/lgb.p',i_0_71) ).

cnf(i_0_64,plain,
    ( in(X1,esk15_1(X2))
    | ~ ordinal(X1)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wg0aezbt/lgb.p',i_0_64) ).

cnf(i_0_70,plain,
    ( ~ ordinal(esk16_1(X1))
    | ~ in(esk16_1(X1),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wg0aezbt/lgb.p',i_0_70) ).

cnf(c_0_77,plain,
    ( ordinal(X1)
    | ~ in(X1,esk15_1(X2)) ),
    i_0_65 ).

cnf(c_0_78,plain,
    ( ordinal(esk16_1(X1))
    | in(esk16_1(X1),X1) ),
    i_0_69 ).

cnf(c_0_79,negated_conjecture,
    ( in(X1,esk17_0)
    | ~ ordinal(X1) ),
    i_0_71 ).

cnf(c_0_80,plain,
    ordinal(esk16_1(esk15_1(X1))),
    inference(spm,[status(thm)],[c_0_77,c_0_78]) ).

cnf(c_0_81,plain,
    ( in(X1,esk15_1(X2))
    | ~ ordinal(X1)
    | ~ in(X1,X2) ),
    i_0_64 ).

cnf(c_0_82,negated_conjecture,
    in(esk16_1(esk15_1(X1)),esk17_0),
    inference(spm,[status(thm)],[c_0_79,c_0_80]) ).

cnf(c_0_83,plain,
    ( ~ ordinal(esk16_1(X1))
    | ~ in(esk16_1(X1),X1) ),
    i_0_70 ).

cnf(c_0_84,plain,
    in(esk16_1(esk15_1(X1)),esk15_1(esk17_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_80])]) ).

cnf(c_0_85,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_80])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : NUM405+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.36  % Computer : n004.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Wed Jul  6 12:25:54 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.22/0.48  # ENIGMATIC: Selected complete mode:
% 8.41/2.57  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.41/2.57  # No SInE strategy applied
% 8.41/2.57  # Trying AutoSched0 for 150 seconds
% 8.41/2.57  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 8.41/2.57  # and selection function SelectCQPrecWNTNp.
% 8.41/2.57  #
% 8.41/2.57  # Preprocessing time       : 0.023 s
% 8.41/2.57  
% 8.41/2.57  # Proof found!
% 8.41/2.57  # SZS status Theorem
% 8.41/2.57  # SZS output start CNFRefutation
% See solution above
% 8.41/2.57  # Training examples: 0 positive, 0 negative
% 8.41/2.57  
% 8.41/2.57  # -------------------------------------------------
% 8.41/2.57  # User time                : 0.024 s
% 8.41/2.57  # System time              : 0.010 s
% 8.41/2.57  # Total time               : 0.034 s
% 8.41/2.57  # Maximum resident set size: 7128 pages
% 8.41/2.57  
%------------------------------------------------------------------------------