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

View Problem - Process Solution

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

% Computer : n004.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 : Sun Jul 17 09:26:23 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_48,plain,
    ( or_2
    | ~ is_a_theorem(implies(esk39_0,or(esk38_0,esk39_0))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k7ak9zc/lgb.p',i_0_48) ).

cnf(i_0_22,negated_conjecture,
    ~ or_2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k7ak9zc/lgb.p',i_0_22) ).

cnf(i_0_64,plain,
    ( is_a_theorem(implies(X1,or(X2,X1)))
    | ~ r2 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k7ak9zc/lgb.p',i_0_64) ).

cnf(i_0_57,plain,
    r2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k7ak9zc/lgb.p',i_0_57) ).

cnf(c_0_69,plain,
    ( or_2
    | ~ is_a_theorem(implies(esk39_0,or(esk38_0,esk39_0))) ),
    i_0_48 ).

cnf(c_0_70,negated_conjecture,
    ~ or_2,
    i_0_22 ).

cnf(c_0_71,plain,
    ( is_a_theorem(implies(X1,or(X2,X1)))
    | ~ r2 ),
    i_0_64 ).

cnf(c_0_72,plain,
    r2,
    i_0_57 ).

cnf(c_0_73,plain,
    ~ is_a_theorem(implies(esk39_0,or(esk38_0,esk39_0))),
    inference(sr,[status(thm)],[c_0_69,c_0_70]) ).

cnf(c_0_74,plain,
    is_a_theorem(implies(X1,or(X2,X1))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]) ).

cnf(c_0_75,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL491+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n004.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 : Sat Jul  2 23:17:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.58/2.54  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.58/2.54  # No SInE strategy applied
% 8.58/2.54  # Trying AutoSched0 for 150 seconds
% 8.58/2.54  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 8.58/2.54  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.58/2.54  #
% 8.58/2.54  # Preprocessing time       : 0.016 s
% 8.58/2.54  # Presaturation interreduction done
% 8.58/2.54  
% 8.58/2.54  # Proof found!
% 8.58/2.54  # SZS status Theorem
% 8.58/2.54  # SZS output start CNFRefutation
% See solution above
% 8.58/2.54  # Training examples: 0 positive, 0 negative
% 8.58/2.54  
% 8.58/2.54  # -------------------------------------------------
% 8.58/2.54  # User time                : 0.012 s
% 8.58/2.54  # System time              : 0.010 s
% 8.58/2.54  # Total time               : 0.023 s
% 8.58/2.54  # Maximum resident set size: 7128 pages
% 8.58/2.54  
%------------------------------------------------------------------------------