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

View Problem - Process Solution

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

% Computer : n017.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 : Thu Jul 14 14:42:01 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_88,plain,
    op(e0,unit) = e0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dl3wxvxi/lgb.p',i_0_88) ).

cnf(i_0_102,plain,
    unit = e0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dl3wxvxi/lgb.p',i_0_102) ).

cnf(i_0_183,negated_conjecture,
    ( op(e0,e0) = e3
    | epred1_0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dl3wxvxi/lgb.p',i_0_183) ).

cnf(i_0_177,plain,
    e3 != e0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dl3wxvxi/lgb.p',i_0_177) ).

cnf(i_0_185,negated_conjecture,
    ~ epred1_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dl3wxvxi/lgb.p',i_0_185) ).

cnf(c_0_191,plain,
    op(e0,unit) = e0,
    i_0_88 ).

cnf(c_0_192,plain,
    unit = e0,
    i_0_102 ).

cnf(c_0_193,negated_conjecture,
    ( op(e0,e0) = e3
    | epred1_0 ),
    i_0_183 ).

cnf(c_0_194,plain,
    op(e0,e0) = e0,
    inference(rw,[status(thm)],[c_0_191,c_0_192]) ).

cnf(c_0_195,plain,
    e3 != e0,
    i_0_177 ).

cnf(c_0_196,negated_conjecture,
    ~ epred1_0,
    i_0_185 ).

cnf(c_0_197,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_193,c_0_194]),c_0_195]),c_0_196]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : ALG014+1 : TPTP v8.1.0. Released v2.7.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n017.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 : Wed Jun  8 01:58:49 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 4.54/2.28  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.54/2.28  # No SInE strategy applied
% 4.54/2.28  # Trying AutoSched0 for 150 seconds
% 4.54/2.28  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S068N
% 4.54/2.28  # and selection function PSelectNewComplexAHP.
% 4.54/2.28  #
% 4.54/2.28  # Preprocessing time       : 0.023 s
% 4.54/2.28  # Presaturation interreduction done
% 4.54/2.28  
% 4.54/2.28  # Proof found!
% 4.54/2.28  # SZS status Theorem
% 4.54/2.28  # SZS output start CNFRefutation
% See solution above
% 4.54/2.28  # Training examples: 0 positive, 0 negative
% 4.54/2.28  
% 4.54/2.28  # -------------------------------------------------
% 4.54/2.28  # User time                : 0.024 s
% 4.54/2.28  # System time              : 0.004 s
% 4.54/2.28  # Total time               : 0.028 s
% 4.54/2.28  # Maximum resident set size: 7128 pages
% 4.54/2.28  
%------------------------------------------------------------------------------