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

View Problem - Process Solution

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

% Computer : n029.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:44:14 EDT 2022

% Result   : Theorem 8.10s 2.31s
% Output   : CNFRefutation 8.10s
% 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_24,plain,
    op(e0,unit) = e0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vw_bguco/lgb.p',i_0_24) ).

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

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

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

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

cnf(c_0_124,plain,
    op(e0,unit) = e0,
    i_0_24 ).

cnf(c_0_125,plain,
    unit = e0,
    i_0_58 ).

cnf(c_0_126,negated_conjecture,
    ( op(e0,e0) = e3
    | epred1_0 ),
    i_0_116 ).

cnf(c_0_127,plain,
    op(e0,e0) = e0,
    inference(rw,[status(thm)],[c_0_124,c_0_125]) ).

cnf(c_0_128,plain,
    e3 != e0,
    i_0_110 ).

cnf(c_0_129,negated_conjecture,
    ~ epred1_0,
    i_0_118 ).

cnf(c_0_130,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_127]),c_0_128]),c_0_129]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : ALG036+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n029.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 : Thu Jun  9 04:29:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected complete mode:
% 8.10/2.31  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.10/2.31  # No SInE strategy applied
% 8.10/2.31  # Trying AutoSched0 for 150 seconds
% 8.10/2.31  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S068N
% 8.10/2.31  # and selection function PSelectNewComplexAHP.
% 8.10/2.31  #
% 8.10/2.31  # Preprocessing time       : 0.021 s
% 8.10/2.31  # Presaturation interreduction done
% 8.10/2.31  
% 8.10/2.31  # Proof found!
% 8.10/2.31  # SZS status Theorem
% 8.10/2.31  # SZS output start CNFRefutation
% See solution above
% 8.10/2.31  # Training examples: 0 positive, 0 negative
% 8.10/2.31  
% 8.10/2.31  # -------------------------------------------------
% 8.10/2.31  # User time                : 0.019 s
% 8.10/2.31  # System time              : 0.008 s
% 8.10/2.31  # Total time               : 0.027 s
% 8.10/2.31  # Maximum resident set size: 7124 pages
% 8.10/2.31  
%------------------------------------------------------------------------------