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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : LCL688+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:32:12 EDT 2022

% Result   : Theorem 16.38s 3.38s
% Output   : CNFRefutation 16.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   32 (   5 unt;   2 nHn;  30 RR)
%            Number of literals    :  117 (   0 equ;  88 neg)
%            Maximal clause size   :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-3 aty)
%            Number of variables   :   69 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_19,negated_conjecture,
    ( p2(X1)
    | ~ p2(X2)
    | ~ p2(X3)
    | ~ r1(X3,X1)
    | ~ r1(X3,X4)
    | ~ r1(X5,X3)
    | ~ r1(esk1_0,X5)
    | ~ r1(esk5_3(X5,X3,X4),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8xhenjf3/input.p',i_0_19) ).

cnf(i_0_28,negated_conjecture,
    ( r1(X1,esk2_2(X2,X1))
    | ~ r1(X2,X1)
    | ~ r1(esk1_0,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8xhenjf3/input.p',i_0_28) ).

cnf(i_0_25,negated_conjecture,
    ( p2(esk2_2(X1,X2))
    | ~ r1(X1,X2)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8xhenjf3/input.p',i_0_25) ).

cnf(i_0_20,negated_conjecture,
    ( p2(X1)
    | r1(X2,esk5_3(X3,X4,X2))
    | ~ p2(X4)
    | ~ r1(X4,X1)
    | ~ r1(X4,X2)
    | ~ r1(X3,X4)
    | ~ r1(esk1_0,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8xhenjf3/input.p',i_0_20) ).

cnf(i_0_6,negated_conjecture,
    ( r1(X1,esk12_1(X1))
    | ~ r1(esk11_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8xhenjf3/input.p',i_0_6) ).

cnf(i_0_5,negated_conjecture,
    ( ~ p2(esk12_1(X1))
    | ~ r1(esk11_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8xhenjf3/input.p',i_0_5) ).

cnf(i_0_2,plain,
    ( r1(X1,X2)
    | ~ r1(X3,X2)
    | ~ r1(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8xhenjf3/input.p',i_0_2) ).

cnf(i_0_7,negated_conjecture,
    r1(esk1_0,esk11_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8xhenjf3/input.p',i_0_7) ).

cnf(i_0_1,plain,
    r1(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8xhenjf3/input.p',i_0_1) ).

cnf(c_0_38,negated_conjecture,
    ( p2(X1)
    | ~ p2(X2)
    | ~ p2(X3)
    | ~ r1(X3,X1)
    | ~ r1(X3,X4)
    | ~ r1(X5,X3)
    | ~ r1(esk1_0,X5)
    | ~ r1(esk5_3(X5,X3,X4),X2) ),
    i_0_19 ).

cnf(c_0_39,negated_conjecture,
    ( r1(X1,esk2_2(X2,X1))
    | ~ r1(X2,X1)
    | ~ r1(esk1_0,X2) ),
    i_0_28 ).

cnf(c_0_40,negated_conjecture,
    ( p2(esk2_2(X1,X2))
    | ~ r1(X1,X2)
    | ~ r1(esk1_0,X1) ),
    i_0_25 ).

cnf(c_0_41,negated_conjecture,
    ( p2(X1)
    | r1(X2,esk5_3(X3,X4,X2))
    | ~ p2(X4)
    | ~ r1(X4,X1)
    | ~ r1(X4,X2)
    | ~ r1(X3,X4)
    | ~ r1(esk1_0,X3) ),
    i_0_20 ).

cnf(c_0_42,negated_conjecture,
    ( r1(X1,esk12_1(X1))
    | ~ r1(esk11_0,X1) ),
    i_0_6 ).

cnf(c_0_43,negated_conjecture,
    ( ~ p2(esk12_1(X1))
    | ~ r1(esk11_0,X1) ),
    i_0_5 ).

cnf(c_0_44,plain,
    ( r1(X1,X2)
    | ~ r1(X3,X2)
    | ~ r1(X1,X3) ),
    i_0_2 ).

cnf(c_0_45,negated_conjecture,
    ( p2(X1)
    | ~ p2(X2)
    | ~ r1(X3,esk5_3(X4,X2,X5))
    | ~ r1(esk1_0,X4)
    | ~ r1(esk1_0,X3)
    | ~ r1(X4,X2)
    | ~ r1(X2,X5)
    | ~ r1(X2,X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).

cnf(c_0_46,negated_conjecture,
    ( r1(X1,esk5_3(X2,X3,X1))
    | ~ p2(X3)
    | ~ r1(esk1_0,X2)
    | ~ r1(esk11_0,X3)
    | ~ r1(X3,X1)
    | ~ r1(X2,X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).

cnf(c_0_47,negated_conjecture,
    r1(esk1_0,esk11_0),
    i_0_7 ).

cnf(c_0_48,negated_conjecture,
    ( r1(X1,esk12_1(X2))
    | ~ r1(esk11_0,X2)
    | ~ r1(X1,X2) ),
    inference(spm,[status(thm)],[c_0_44,c_0_42]) ).

cnf(c_0_49,negated_conjecture,
    ( p2(X1)
    | ~ p2(X2)
    | ~ r1(esk1_0,X3)
    | ~ r1(esk1_0,X4)
    | ~ r1(esk11_0,X2)
    | ~ r1(X3,X2)
    | ~ r1(X2,X4)
    | ~ r1(X2,X1) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_50,negated_conjecture,
    ( r1(X1,esk11_0)
    | ~ r1(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_44,c_0_47]) ).

cnf(c_0_51,plain,
    r1(X1,X1),
    i_0_1 ).

cnf(c_0_52,plain,
    ( r1(X1,esk12_1(X2))
    | ~ r1(esk11_0,X2)
    | ~ r1(X1,X3)
    | ~ r1(X3,X2) ),
    inference(spm,[status(thm)],[c_0_44,c_0_48]) ).

cnf(c_0_53,negated_conjecture,
    ( p2(X1)
    | ~ p2(X2)
    | ~ r1(esk1_0,X3)
    | ~ r1(esk11_0,X2)
    | ~ r1(X2,X3)
    | ~ r1(X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).

cnf(c_0_54,negated_conjecture,
    ( r1(esk1_0,esk12_1(X1))
    | ~ r1(esk11_0,X1) ),
    inference(spm,[status(thm)],[c_0_52,c_0_47]) ).

cnf(c_0_55,negated_conjecture,
    ( p2(X1)
    | ~ p2(X2)
    | ~ r1(X2,esk12_1(X3))
    | ~ r1(esk11_0,X2)
    | ~ r1(esk11_0,X3)
    | ~ r1(X2,X1) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_56,negated_conjecture,
    ( p2(X1)
    | ~ p2(X2)
    | ~ r1(esk11_0,X2)
    | ~ r1(X2,X1) ),
    inference(spm,[status(thm)],[c_0_55,c_0_42]) ).

cnf(c_0_57,negated_conjecture,
    ( ~ p2(X1)
    | ~ r1(esk11_0,X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_42]),c_0_43]) ).

cnf(c_0_58,negated_conjecture,
    ( ~ r1(esk11_0,esk2_2(X1,X2))
    | ~ r1(esk1_0,X1)
    | ~ r1(X1,X2) ),
    inference(spm,[status(thm)],[c_0_57,c_0_40]) ).

cnf(c_0_59,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ r1(X1,esk11_0) ),
    inference(spm,[status(thm)],[c_0_58,c_0_39]) ).

cnf(c_0_60,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_50]),c_0_51]),c_0_51])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : LCL688+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.32  % Computer : n016.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sun Jul  3 09:44:02 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.17/0.44  # ENIGMATIC: Selected complete mode:
% 16.38/3.38  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 16.38/3.38  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 85; version: 991; iters: 150)
% 16.38/3.38  # Preprocessing time       : 1.141 s
% 16.38/3.38  
% 16.38/3.38  # Proof found!
% 16.38/3.38  # SZS status Theorem
% 16.38/3.38  # SZS output start CNFRefutation
% See solution above
% 16.38/3.38  # Training examples: 0 positive, 0 negative
% 16.38/3.38  
% 16.38/3.38  # -------------------------------------------------
% 16.38/3.38  # User time                : 1.035 s
% 16.38/3.38  # System time              : 0.140 s
% 16.38/3.38  # Total time               : 1.175 s
% 16.38/3.38  # ...preprocessing         : 1.141 s
% 16.38/3.38  # ...main loop             : 0.034 s
% 16.38/3.38  # Maximum resident set size: 176728 pages
% 16.38/3.38  
%------------------------------------------------------------------------------