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

% Computer : n006.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:40:28 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_27,plain,
    ( less(X1,X2)
    | ~ greater(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ip1zrlqp/input.p',i_0_27) ).

cnf(i_0_2,plain,
    greater(vd301,vd302),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ip1zrlqp/input.p',i_0_2) ).

cnf(i_0_4,plain,
    ( greater(vplus(X1,X2),vplus(X3,X2))
    | ~ less(X3,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ip1zrlqp/input.p',i_0_4) ).

cnf(i_0_1,negated_conjecture,
    ~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ip1zrlqp/input.p',i_0_1) ).

cnf(c_0_32,plain,
    ( less(X1,X2)
    | ~ greater(X2,X1) ),
    i_0_27 ).

cnf(c_0_33,plain,
    greater(vd301,vd302),
    i_0_2 ).

cnf(c_0_34,plain,
    ( greater(vplus(X1,X2),vplus(X3,X2))
    | ~ less(X3,X1) ),
    i_0_4 ).

cnf(c_0_35,plain,
    less(vd302,vd301),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    ~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
    i_0_1 ).

cnf(c_0_37,plain,
    greater(vplus(vd301,X1),vplus(vd302,X1)),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : NUM838+1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n006.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Thu Jul  7 08:37:38 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.17/0.44  # ENIGMATIC: Selected complete mode:
% 7.46/2.27  # ENIGMATIC: Solved by autoschedule:
% 7.46/2.27  # No SInE strategy applied
% 7.46/2.27  # Trying AutoSched0 for 150 seconds
% 7.46/2.27  # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 7.46/2.27  # and selection function SelectCQArEqLast.
% 7.46/2.27  #
% 7.46/2.27  # Preprocessing time       : 0.023 s
% 7.46/2.27  # Presaturation interreduction done
% 7.46/2.27  
% 7.46/2.27  # Proof found!
% 7.46/2.27  # SZS status Theorem
% 7.46/2.27  # SZS output start CNFRefutation
% See solution above
% 7.46/2.27  # Training examples: 0 positive, 0 negative
% 7.46/2.27  
% 7.46/2.27  # -------------------------------------------------
% 7.46/2.27  # User time                : 0.043 s
% 7.46/2.27  # System time              : 0.007 s
% 7.46/2.27  # Total time               : 0.050 s
% 7.46/2.27  # Maximum resident set size: 7124 pages
% 7.46/2.27  
%------------------------------------------------------------------------------