TSTP Solution File: NUM840+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n008.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:29 EDT 2022

% Result   : Theorem 7.69s 2.35s
% Output   : CNFRefutation 7.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (   9 unt;   3 nHn;  18 RR)
%            Number of literals    :   40 (   6 equ;  21 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   31 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
    ( ~ less(X1,X2)
    | ~ greater(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-992a8pia/lgb.p',i_0_12) ).

cnf(i_0_8,plain,
    ( greater(X1,X2)
    | ~ less(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-992a8pia/lgb.p',i_0_8) ).

cnf(i_0_2,plain,
    less(vplus(vd328,vd330),vplus(vd329,vd330)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-992a8pia/lgb.p',i_0_2) ).

cnf(i_0_5,plain,
    ( less(vplus(X1,X2),vplus(X3,X2))
    | ~ less(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-992a8pia/lgb.p',i_0_5) ).

cnf(i_0_9,plain,
    ( less(X1,X2)
    | ~ greater(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-992a8pia/lgb.p',i_0_9) ).

cnf(i_0_10,plain,
    ( X1 = X2
    | less(X1,X2)
    | greater(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-992a8pia/lgb.p',i_0_10) ).

cnf(i_0_1,negated_conjecture,
    ~ less(vd328,vd329),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-992a8pia/lgb.p',i_0_1) ).

cnf(i_0_11,plain,
    ( X1 != X2
    | ~ less(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-992a8pia/lgb.p',i_0_11) ).

cnf(c_0_21,plain,
    ( ~ less(X1,X2)
    | ~ greater(X1,X2) ),
    i_0_12 ).

cnf(c_0_22,plain,
    ( greater(X1,X2)
    | ~ less(X2,X1) ),
    i_0_8 ).

cnf(c_0_23,plain,
    ( ~ less(X1,X2)
    | ~ less(X2,X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_24,plain,
    less(vplus(vd328,vd330),vplus(vd329,vd330)),
    i_0_2 ).

cnf(c_0_25,plain,
    ~ less(vplus(vd329,vd330),vplus(vd328,vd330)),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_26,plain,
    ( less(vplus(X1,X2),vplus(X3,X2))
    | ~ less(X1,X3) ),
    i_0_5 ).

cnf(c_0_27,plain,
    ( less(X1,X2)
    | ~ greater(X2,X1) ),
    i_0_9 ).

cnf(c_0_28,plain,
    ( X1 = X2
    | less(X1,X2)
    | greater(X1,X2) ),
    i_0_10 ).

cnf(c_0_29,plain,
    ~ less(vd329,vd328),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    ( X1 = X2
    | less(X1,X2)
    | less(X2,X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    ~ less(vd328,vd329),
    i_0_1 ).

cnf(c_0_32,plain,
    ( X1 != X2
    | ~ less(X1,X2) ),
    i_0_11 ).

cnf(c_0_33,plain,
    vd329 = vd328,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).

cnf(c_0_34,plain,
    ~ less(X1,X1),
    inference(er,[status(thm)],[c_0_32]) ).

cnf(c_0_35,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_33]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NUM840+2 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n008.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 : Tue Jul  5 05:54:40 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.69/2.35  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.69/2.35  # No SInE strategy applied
% 7.69/2.35  # Trying AutoSched0 for 150 seconds
% 7.69/2.35  # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
% 7.69/2.35  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.69/2.35  #
% 7.69/2.35  # Preprocessing time       : 0.023 s
% 7.69/2.35  
% 7.69/2.35  # Proof found!
% 7.69/2.35  # SZS status Theorem
% 7.69/2.35  # SZS output start CNFRefutation
% See solution above
% 7.69/2.35  # Training examples: 0 positive, 0 negative
% 7.69/2.35  
% 7.69/2.35  # -------------------------------------------------
% 7.69/2.35  # User time                : 0.025 s
% 7.69/2.35  # System time              : 0.005 s
% 7.69/2.35  # Total time               : 0.030 s
% 7.69/2.35  # Maximum resident set size: 7128 pages
% 7.69/2.35  
%------------------------------------------------------------------------------