TSTP Solution File: NUM841+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM841+1 : 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 8.52s 2.43s
% Output   : CNFRefutation 8.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (  15 unt;   0 nHn;  22 RR)
%            Number of literals    :   31 (   4 equ;  11 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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_28,plain,
    ( less(X1,X2)
    | ~ greater(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3u4g8wil/lgb.p',i_0_28) ).

cnf(i_0_5,plain,
    greater(vplus(vd344,vd347),vplus(vd345,vd347)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3u4g8wil/lgb.p',i_0_5) ).

cnf(i_0_3,plain,
    greater(vplus(vd347,vd345),vplus(vd348,vd345)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3u4g8wil/lgb.p',i_0_3) ).

cnf(i_0_4,plain,
    vplus(vd347,vd345) = vplus(vd345,vd347),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3u4g8wil/lgb.p',i_0_4) ).

cnf(i_0_2,plain,
    vplus(vd348,vd345) = vplus(vd345,vd348),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3u4g8wil/lgb.p',i_0_2) ).

cnf(i_0_18,plain,
    ( less(X1,X2)
    | ~ less(X1,X3)
    | ~ less(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3u4g8wil/lgb.p',i_0_18) ).

cnf(i_0_27,plain,
    ( greater(X1,X2)
    | ~ less(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3u4g8wil/lgb.p',i_0_27) ).

cnf(i_0_1,negated_conjecture,
    ~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3u4g8wil/lgb.p',i_0_1) ).

cnf(c_0_37,plain,
    ( less(X1,X2)
    | ~ greater(X2,X1) ),
    i_0_28 ).

cnf(c_0_38,plain,
    greater(vplus(vd344,vd347),vplus(vd345,vd347)),
    i_0_5 ).

cnf(c_0_39,plain,
    greater(vplus(vd347,vd345),vplus(vd348,vd345)),
    i_0_3 ).

cnf(c_0_40,plain,
    vplus(vd347,vd345) = vplus(vd345,vd347),
    i_0_4 ).

cnf(c_0_41,plain,
    vplus(vd348,vd345) = vplus(vd345,vd348),
    i_0_2 ).

cnf(c_0_42,plain,
    ( less(X1,X2)
    | ~ less(X1,X3)
    | ~ less(X3,X2) ),
    i_0_18 ).

cnf(c_0_43,plain,
    less(vplus(vd345,vd347),vplus(vd344,vd347)),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_44,plain,
    greater(vplus(vd345,vd347),vplus(vd345,vd348)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).

cnf(c_0_45,plain,
    ( less(X1,vplus(vd344,vd347))
    | ~ less(X1,vplus(vd345,vd347)) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_46,plain,
    less(vplus(vd345,vd348),vplus(vd345,vd347)),
    inference(spm,[status(thm)],[c_0_37,c_0_44]) ).

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

cnf(c_0_48,plain,
    less(vplus(vd345,vd348),vplus(vd344,vd347)),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_49,negated_conjecture,
    ~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
    i_0_1 ).

cnf(c_0_50,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM841+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n008.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jul  7 22:56:40 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 8.52/2.43  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.52/2.43  # No SInE strategy applied
% 8.52/2.43  # Trying AutoSched0 for 150 seconds
% 8.52/2.43  # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S00EN
% 8.52/2.43  # and selection function PSelectSmallestOrientable.
% 8.52/2.43  #
% 8.52/2.43  # Preprocessing time       : 0.013 s
% 8.52/2.43  # Presaturation interreduction done
% 8.52/2.43  
% 8.52/2.43  # Proof found!
% 8.52/2.43  # SZS status Theorem
% 8.52/2.43  # SZS output start CNFRefutation
% See solution above
% 8.52/2.43  # Training examples: 0 positive, 0 negative
% 8.52/2.43  
% 8.52/2.43  # -------------------------------------------------
% 8.52/2.43  # User time                : 0.044 s
% 8.52/2.43  # System time              : 0.005 s
% 8.52/2.43  # Total time               : 0.049 s
% 8.52/2.43  # Maximum resident set size: 7124 pages
% 8.52/2.43  
%------------------------------------------------------------------------------