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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : LCL636+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n016.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:27:08 EDT 2022

% Result   : Theorem 7.72s 2.32s
% Output   : CNFRefutation 7.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   13 (   7 unt;   2 nHn;  13 RR)
%            Number of literals    :   23 (   0 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 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_16,negated_conjecture,
    ( p101(esk1_0)
    | r1(esk1_0,esk4_0)
    | ~ p100(esk1_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dqg4nxri/lgb.p',i_0_16) ).

cnf(i_0_1,negated_conjecture,
    p100(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dqg4nxri/lgb.p',i_0_1) ).

cnf(i_0_2,negated_conjecture,
    ~ p101(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dqg4nxri/lgb.p',i_0_2) ).

cnf(i_0_15,negated_conjecture,
    ( p101(esk1_0)
    | ~ p2(esk4_0)
    | ~ p100(esk1_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dqg4nxri/lgb.p',i_0_15) ).

cnf(i_0_31,negated_conjecture,
    ( p2(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dqg4nxri/lgb.p',i_0_31) ).

cnf(c_0_37,negated_conjecture,
    ( p101(esk1_0)
    | r1(esk1_0,esk4_0)
    | ~ p100(esk1_0) ),
    i_0_16 ).

cnf(c_0_38,negated_conjecture,
    p100(esk1_0),
    i_0_1 ).

cnf(c_0_39,negated_conjecture,
    ~ p101(esk1_0),
    i_0_2 ).

cnf(c_0_40,negated_conjecture,
    ( p101(esk1_0)
    | ~ p2(esk4_0)
    | ~ p100(esk1_0) ),
    i_0_15 ).

cnf(c_0_41,negated_conjecture,
    ( p2(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_31 ).

cnf(c_0_42,negated_conjecture,
    r1(esk1_0,esk4_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),c_0_39]) ).

cnf(c_0_43,negated_conjecture,
    ~ p2(esk4_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_38])]),c_0_39]) ).

cnf(c_0_44,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : LCL636+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n016.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 : Tue Jul  5 00:28:34 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.72/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.72/2.32  # No SInE strategy applied
% 7.72/2.32  # Trying AutoSched0 for 150 seconds
% 7.72/2.32  # AutoSched0-Mode selected heuristic G_E___107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S071I
% 7.72/2.32  # and selection function SelectCQArEqLast.
% 7.72/2.32  #
% 7.72/2.32  # Preprocessing time       : 0.023 s
% 7.72/2.32  # Presaturation interreduction done
% 7.72/2.32  
% 7.72/2.32  # Proof found!
% 7.72/2.32  # SZS status Theorem
% 7.72/2.32  # SZS output start CNFRefutation
% See solution above
% 7.72/2.32  # Training examples: 0 positive, 0 negative
% 7.72/2.32  
% 7.72/2.32  # -------------------------------------------------
% 7.72/2.32  # User time                : 0.027 s
% 7.72/2.32  # System time              : 0.004 s
% 7.72/2.32  # Total time               : 0.031 s
% 7.72/2.32  # Maximum resident set size: 7124 pages
% 7.72/2.32  
%------------------------------------------------------------------------------