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

View Problem - Process Solution

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

% Computer : n027.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:31 EDT 2022

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

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

cnf(i_0_31,plain,
    ( X1 = X2
    | greater(X1,X2)
    | less(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q7rdulwd/input.p',i_0_31) ).

cnf(i_0_2,plain,
    ~ leq(vd390,vd391),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q7rdulwd/input.p',i_0_2) ).

cnf(i_0_1,negated_conjecture,
    ~ greater(vd390,vd391),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q7rdulwd/input.p',i_0_1) ).

cnf(i_0_23,plain,
    ( leq(X1,X2)
    | X1 != X2 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q7rdulwd/input.p',i_0_23) ).

cnf(c_0_37,plain,
    ( leq(X1,X2)
    | ~ less(X1,X2) ),
    i_0_24 ).

cnf(c_0_38,plain,
    ( X1 = X2
    | greater(X1,X2)
    | less(X1,X2) ),
    i_0_31 ).

cnf(c_0_39,plain,
    ~ leq(vd390,vd391),
    i_0_2 ).

cnf(c_0_40,plain,
    ( X1 = X2
    | leq(X1,X2)
    | greater(X1,X2) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_41,negated_conjecture,
    ~ greater(vd390,vd391),
    i_0_1 ).

cnf(c_0_42,plain,
    ( leq(X1,X2)
    | X1 != X2 ),
    i_0_23 ).

cnf(c_0_43,plain,
    vd391 = vd390,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).

cnf(c_0_44,plain,
    leq(X1,X1),
    inference(er,[status(thm)],[c_0_42]) ).

cnf(c_0_45,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_43]),c_0_44])]),
    [proof] ).

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