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

% 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 22:39:44 EDT 2022

% Result   : Theorem 8.18s 2.45s
% Output   : CNFRefutation 8.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   17 (   6 unt;   5 nHn;  11 RR)
%            Number of literals    :   36 (   0 equ;  19 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-1 aty)
%            Number of variables   :   23 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
    ( goal
    | ~ p(X1)
    | ~ p(X2)
    | ~ less(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fh5dg37/lgb.p',i_0_1) ).

cnf(i_0_6,negated_conjecture,
    ~ goal,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fh5dg37/lgb.p',i_0_6) ).

cnf(i_0_4,plain,
    ( less(X1,X2)
    | ~ less(X3,X2)
    | ~ less(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fh5dg37/lgb.p',i_0_4) ).

cnf(i_0_3,plain,
    ( p(X1)
    | less(X1,esk1_1(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fh5dg37/lgb.p',i_0_3) ).

cnf(i_0_2,plain,
    ( p(X1)
    | p(esk1_1(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fh5dg37/lgb.p',i_0_2) ).

cnf(i_0_5,plain,
    less(X1,esk2_1(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2fh5dg37/lgb.p',i_0_5) ).

cnf(c_0_13,plain,
    ( goal
    | ~ p(X1)
    | ~ p(X2)
    | ~ less(X2,X1) ),
    i_0_1 ).

cnf(c_0_14,negated_conjecture,
    ~ goal,
    i_0_6 ).

cnf(c_0_15,plain,
    ( less(X1,X2)
    | ~ less(X3,X2)
    | ~ less(X1,X3) ),
    i_0_4 ).

cnf(c_0_16,plain,
    ( p(X1)
    | less(X1,esk1_1(X1)) ),
    i_0_3 ).

cnf(c_0_17,plain,
    ( ~ p(X1)
    | ~ p(X2)
    | ~ less(X1,X2) ),
    inference(sr,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    ( p(X1)
    | less(X2,esk1_1(X1))
    | ~ less(X2,X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( p(X1)
    | p(esk1_1(X1)) ),
    i_0_2 ).

cnf(c_0_20,plain,
    ( ~ p(X1)
    | ~ less(X1,X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_17]) ).

cnf(c_0_21,plain,
    less(X1,esk2_1(X1)),
    i_0_5 ).

cnf(c_0_22,plain,
    ~ p(X1),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_23,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_19,c_0_22]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n011.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jul  1 16:40:20 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 8.18/2.45  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.18/2.45  # No SInE strategy applied
% 8.18/2.45  # Trying AutoSched0 for 150 seconds
% 8.18/2.45  # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 8.18/2.45  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.18/2.45  #
% 8.18/2.45  # Preprocessing time       : 0.023 s
% 8.18/2.45  
% 8.18/2.45  # Proof found!
% 8.18/2.45  # SZS status Theorem
% 8.18/2.45  # SZS output start CNFRefutation
% See solution above
% 8.18/2.45  # Training examples: 0 positive, 0 negative
% 8.18/2.45  
% 8.18/2.45  # -------------------------------------------------
% 8.18/2.45  # User time                : 0.023 s
% 8.18/2.45  # System time              : 0.007 s
% 8.18/2.45  # Total time               : 0.031 s
% 8.18/2.45  # Maximum resident set size: 7124 pages
% 8.18/2.45  
%------------------------------------------------------------------------------