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

View Problem - Process Solution

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

% Computer : n011.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:09 EDT 2022

% Result   : Theorem 7.72s 2.44s
% Output   : CNFRefutation 7.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (   6 unt;   3 nHn;  17 RR)
%            Number of literals    :   46 (   0 equ;  26 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   18 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_9,negated_conjecture,
    ( p1(X1)
    | ~ p2(X1)
    | ~ r1(X2,X1)
    | ~ r1(esk4_0,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-75g61032/lgb.p',i_0_9) ).

cnf(i_0_1,plain,
    r1(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-75g61032/lgb.p',i_0_1) ).

cnf(i_0_4,negated_conjecture,
    ( p1(esk7_1(X1))
    | p2(esk7_1(X1))
    | ~ r1(esk4_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-75g61032/lgb.p',i_0_4) ).

cnf(i_0_5,negated_conjecture,
    ( r1(X1,esk7_1(X1))
    | ~ r1(esk4_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-75g61032/lgb.p',i_0_5) ).

cnf(i_0_8,negated_conjecture,
    ( p2(X1)
    | ~ p1(X1)
    | ~ r1(X2,X1)
    | ~ r1(esk4_0,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-75g61032/lgb.p',i_0_8) ).

cnf(i_0_3,negated_conjecture,
    ( ~ p1(esk7_1(X1))
    | ~ p2(esk7_1(X1))
    | ~ r1(esk4_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-75g61032/lgb.p',i_0_3) ).

cnf(c_0_16,negated_conjecture,
    ( p1(X1)
    | ~ p2(X1)
    | ~ r1(X2,X1)
    | ~ r1(esk4_0,X2) ),
    i_0_9 ).

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

cnf(c_0_18,negated_conjecture,
    ( p1(esk7_1(X1))
    | p2(esk7_1(X1))
    | ~ r1(esk4_0,X1) ),
    i_0_4 ).

cnf(c_0_19,negated_conjecture,
    ( r1(X1,esk7_1(X1))
    | ~ r1(esk4_0,X1) ),
    i_0_5 ).

cnf(c_0_20,negated_conjecture,
    ( p2(X1)
    | ~ p1(X1)
    | ~ r1(X2,X1)
    | ~ r1(esk4_0,X2) ),
    i_0_8 ).

cnf(c_0_21,plain,
    ( p1(X1)
    | ~ r1(esk4_0,X1)
    | ~ p2(X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,plain,
    ( p2(esk7_1(esk4_0))
    | p1(esk7_1(esk4_0)) ),
    inference(spm,[status(thm)],[c_0_18,c_0_17]) ).

cnf(c_0_23,plain,
    r1(esk4_0,esk7_1(esk4_0)),
    inference(spm,[status(thm)],[c_0_19,c_0_17]) ).

cnf(c_0_24,plain,
    ( p2(X1)
    | ~ r1(esk4_0,X1)
    | ~ p1(X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_17]) ).

cnf(c_0_25,plain,
    p1(esk7_1(esk4_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ p1(esk7_1(X1))
    | ~ p2(esk7_1(X1))
    | ~ r1(esk4_0,X1) ),
    i_0_3 ).

cnf(c_0_27,plain,
    p2(esk7_1(esk4_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23])]) ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_17]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL686+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n011.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jul  5 00:11:08 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 7.72/2.44  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.72/2.44  # No SInE strategy applied
% 7.72/2.44  # Trying AutoSched0 for 150 seconds
% 7.72/2.44  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0a
% 7.72/2.44  # and selection function SelectNegativeLiterals.
% 7.72/2.44  #
% 7.72/2.44  # Preprocessing time       : 0.023 s
% 7.72/2.44  
% 7.72/2.44  # Proof found!
% 7.72/2.44  # SZS status Theorem
% 7.72/2.44  # SZS output start CNFRefutation
% See solution above
% 7.72/2.44  # Training examples: 0 positive, 0 negative
% 7.72/2.44  
% 7.72/2.44  # -------------------------------------------------
% 7.72/2.44  # User time                : 0.026 s
% 7.72/2.44  # System time              : 0.006 s
% 7.72/2.44  # Total time               : 0.032 s
% 7.72/2.44  # Maximum resident set size: 7128 pages
% 7.72/2.44  
%------------------------------------------------------------------------------