TSTP Solution File: LCL656+1.005 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n018.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:52 EDT 2022

% Result   : Theorem 8.09s 2.49s
% Output   : CNFRefutation 8.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   35 (  14 unt;   6 nHn;  33 RR)
%            Number of literals    :  104 (   0 equ;  67 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   51 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
    ( epred1_1(X1)
    | ~ r1(X2,X1)
    | ~ r1(X3,X2)
    | ~ r1(X4,X3)
    | ~ r1(X5,X4)
    | ~ r1(esk1_0,X5) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4ps071dy/input.p',i_0_4) ).

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

cnf(i_0_5,negated_conjecture,
    ( p3(X1)
    | ~ r1(X2,X1)
    | ~ r1(X3,X2)
    | ~ r1(X4,X3)
    | ~ r1(X5,X4)
    | ~ r1(esk1_0,X5) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4ps071dy/input.p',i_0_5) ).

cnf(i_0_31,plain,
    ( p101(X1)
    | r1(X1,esk10_1(X1))
    | ~ p100(X1)
    | ~ epred1_1(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4ps071dy/input.p',i_0_31) ).

cnf(i_0_2,negated_conjecture,
    p100(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4ps071dy/input.p',i_0_2) ).

cnf(i_0_3,negated_conjecture,
    ~ p101(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4ps071dy/input.p',i_0_3) ).

cnf(i_0_28,plain,
    ( p101(X1)
    | p101(esk10_1(X1))
    | ~ p100(X1)
    | ~ epred1_1(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4ps071dy/input.p',i_0_28) ).

cnf(i_0_29,plain,
    ( p101(X1)
    | ~ p100(X1)
    | ~ epred1_1(X1)
    | ~ p102(esk10_1(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4ps071dy/input.p',i_0_29) ).

cnf(i_0_39,plain,
    ( p102(X1)
    | r1(X1,esk8_1(X1))
    | ~ p101(X1)
    | ~ epred1_1(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4ps071dy/input.p',i_0_39) ).

cnf(i_0_38,plain,
    ( p102(X1)
    | ~ p101(X1)
    | ~ epred1_1(X1)
    | ~ p3(esk8_1(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4ps071dy/input.p',i_0_38) ).

cnf(c_0_50,negated_conjecture,
    ( epred1_1(X1)
    | ~ r1(X2,X1)
    | ~ r1(X3,X2)
    | ~ r1(X4,X3)
    | ~ r1(X5,X4)
    | ~ r1(esk1_0,X5) ),
    i_0_4 ).

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

cnf(c_0_52,plain,
    ( epred1_1(X1)
    | ~ r1(esk1_0,X2)
    | ~ r1(X2,X3)
    | ~ r1(X3,X4)
    | ~ r1(X4,X1) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_53,plain,
    ( epred1_1(X1)
    | ~ r1(esk1_0,X2)
    | ~ r1(X2,X3)
    | ~ r1(X3,X1) ),
    inference(spm,[status(thm)],[c_0_52,c_0_51]) ).

cnf(c_0_54,plain,
    ( epred1_1(X1)
    | ~ r1(esk1_0,X2)
    | ~ r1(X2,X1) ),
    inference(spm,[status(thm)],[c_0_53,c_0_51]) ).

cnf(c_0_55,plain,
    ( epred1_1(X1)
    | ~ r1(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_54,c_0_51]) ).

cnf(c_0_56,negated_conjecture,
    ( p3(X1)
    | ~ r1(X2,X1)
    | ~ r1(X3,X2)
    | ~ r1(X4,X3)
    | ~ r1(X5,X4)
    | ~ r1(esk1_0,X5) ),
    i_0_5 ).

cnf(c_0_57,plain,
    ( p101(X1)
    | r1(X1,esk10_1(X1))
    | ~ p100(X1)
    | ~ epred1_1(X1) ),
    i_0_31 ).

cnf(c_0_58,plain,
    epred1_1(esk1_0),
    inference(spm,[status(thm)],[c_0_55,c_0_51]) ).

cnf(c_0_59,negated_conjecture,
    p100(esk1_0),
    i_0_2 ).

cnf(c_0_60,negated_conjecture,
    ~ p101(esk1_0),
    i_0_3 ).

cnf(c_0_61,plain,
    ( p3(X1)
    | ~ r1(esk1_0,X2)
    | ~ r1(X2,X3)
    | ~ r1(X3,X4)
    | ~ r1(X4,X1) ),
    inference(spm,[status(thm)],[c_0_56,c_0_51]) ).

cnf(c_0_62,plain,
    r1(esk1_0,esk10_1(esk1_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),c_0_60]) ).

cnf(c_0_63,plain,
    ( p101(X1)
    | p101(esk10_1(X1))
    | ~ p100(X1)
    | ~ epred1_1(X1) ),
    i_0_28 ).

cnf(c_0_64,plain,
    ( p101(X1)
    | ~ p100(X1)
    | ~ epred1_1(X1)
    | ~ p102(esk10_1(X1)) ),
    i_0_29 ).

cnf(c_0_65,plain,
    ( p3(X1)
    | ~ r1(esk1_0,X2)
    | ~ r1(X2,X3)
    | ~ r1(X3,X1) ),
    inference(spm,[status(thm)],[c_0_61,c_0_51]) ).

cnf(c_0_66,plain,
    ( p102(X1)
    | r1(X1,esk8_1(X1))
    | ~ p101(X1)
    | ~ epred1_1(X1) ),
    i_0_39 ).

cnf(c_0_67,plain,
    epred1_1(esk10_1(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_62]),c_0_51])]) ).

cnf(c_0_68,plain,
    p101(esk10_1(esk1_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_58]),c_0_59])]),c_0_60]) ).

cnf(c_0_69,plain,
    ~ p102(esk10_1(esk1_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_58]),c_0_59])]),c_0_60]) ).

cnf(c_0_70,plain,
    ( p102(X1)
    | ~ p101(X1)
    | ~ epred1_1(X1)
    | ~ p3(esk8_1(X1)) ),
    i_0_38 ).

cnf(c_0_71,plain,
    ( p3(X1)
    | ~ r1(esk1_0,X2)
    | ~ r1(X2,X1) ),
    inference(spm,[status(thm)],[c_0_65,c_0_51]) ).

cnf(c_0_72,plain,
    r1(esk10_1(esk1_0),esk8_1(esk10_1(esk1_0))),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]),c_0_69]) ).

cnf(c_0_73,plain,
    ~ p3(esk8_1(esk10_1(esk1_0))),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_67]),c_0_68])]),c_0_69]) ).

cnf(c_0_74,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_62])]),c_0_73]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL656+1.005 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n018.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul  4 18:57:08 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 8.09/2.49  # ENIGMATIC: Solved by autoschedule:
% 8.09/2.49  # No SInE strategy applied
% 8.09/2.49  # Trying AutoSched0 for 150 seconds
% 8.09/2.49  # AutoSched0-Mode selected heuristic G_E___107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S071I
% 8.09/2.49  # and selection function SelectCQArEqLast.
% 8.09/2.49  #
% 8.09/2.49  # Preprocessing time       : 0.024 s
% 8.09/2.49  # Presaturation interreduction done
% 8.09/2.49  
% 8.09/2.49  # Proof found!
% 8.09/2.49  # SZS status Theorem
% 8.09/2.49  # SZS output start CNFRefutation
% See solution above
% 8.09/2.49  # Training examples: 0 positive, 0 negative
% 8.09/2.49  
% 8.09/2.49  # -------------------------------------------------
% 8.09/2.49  # User time                : 0.038 s
% 8.09/2.49  # System time              : 0.006 s
% 8.09/2.49  # Total time               : 0.044 s
% 8.09/2.49  # Maximum resident set size: 7124 pages
% 8.09/2.49  
%------------------------------------------------------------------------------