TSTP Solution File: LCL648+1.001 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : LCL648+1.001 : TPTP v8.1.0. Released v4.0.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:29:34 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
    ( ~ p201(X1)
    | ~ p101(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-armo1yp3/lgb.p',i_0_4) ).

cnf(i_0_3,negated_conjecture,
    r1(esk1_0,esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-armo1yp3/lgb.p',i_0_3) ).

cnf(i_0_1,negated_conjecture,
    p101(esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-armo1yp3/lgb.p',i_0_1) ).

cnf(i_0_2,negated_conjecture,
    p201(esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-armo1yp3/lgb.p',i_0_2) ).

cnf(c_0_9,negated_conjecture,
    ( ~ p201(X1)
    | ~ p101(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_4 ).

cnf(c_0_10,negated_conjecture,
    r1(esk1_0,esk2_0),
    i_0_3 ).

cnf(c_0_11,negated_conjecture,
    p101(esk2_0),
    i_0_1 ).

cnf(c_0_12,negated_conjecture,
    p201(esk2_0),
    i_0_2 ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem  : LCL648+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.05/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.30  % Computer : n004.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Sun Jul  3 23:47:09 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.15/0.39  # ENIGMATIC: Selected complete mode:
% 11.79/3.77  # ENIGMATIC: Solved by autoschedule-lgb:
% 11.79/3.77  # No SInE strategy applied
% 11.79/3.77  # Trying AutoSched0 for 150 seconds
% 11.79/3.77  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S059I
% 11.79/3.77  # and selection function SelectComplexExceptUniqMaxPosHorn.
% 11.79/3.77  #
% 11.79/3.77  # Preprocessing time       : 0.022 s
% 11.79/3.77  # Presaturation interreduction done
% 11.79/3.77  
% 11.79/3.77  # Proof found!
% 11.79/3.77  # SZS status Theorem
% 11.79/3.77  # SZS output start CNFRefutation
% See solution above
% 11.79/3.77  # Training examples: 0 positive, 0 negative
% 11.79/3.77  
% 11.79/3.77  # -------------------------------------------------
% 11.79/3.77  # User time                : 0.022 s
% 11.79/3.77  # System time              : 0.005 s
% 11.79/3.77  # Total time               : 0.027 s
% 11.79/3.77  # Maximum resident set size: 7128 pages
% 11.79/3.77  
%------------------------------------------------------------------------------