TSTP Solution File: KRS090+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n032.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 02:55:34 EDT 2022

% Result   : Unsatisfiable 4.25s 2.16s
% Output   : CNFRefutation 4.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   27 (   4 unt;   2 nHn;  27 RR)
%            Number of literals    :   61 (   0 equ;  37 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   26 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    ( cA(X1)
    | ~ cC2(X1)
    | ~ cB(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nbdg696/lgb.p',i_0_7) ).

cnf(i_0_6,plain,
    ( cB(X1)
    | cA(X1)
    | ~ cC2(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nbdg696/lgb.p',i_0_6) ).

cnf(i_0_9,plain,
    ( ~ cB(X1)
    | ~ cA(X1)
    | ~ cC3(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nbdg696/lgb.p',i_0_9) ).

cnf(i_0_8,plain,
    ( cB(X1)
    | ~ cA(X1)
    | ~ cC3(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nbdg696/lgb.p',i_0_8) ).

cnf(i_0_12,plain,
    ( cC3(X1)
    | ~ cC5(X2)
    | ~ rR(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nbdg696/lgb.p',i_0_12) ).

cnf(i_0_11,plain,
    ( rR(X1,esk1_1(X1))
    | ~ cC4(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nbdg696/lgb.p',i_0_11) ).

cnf(i_0_10,plain,
    ( cC2(esk1_1(X1))
    | ~ cC4(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nbdg696/lgb.p',i_0_10) ).

cnf(i_0_13,plain,
    ( cC5(X1)
    | ~ cTEST(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nbdg696/lgb.p',i_0_13) ).

cnf(i_0_15,plain,
    ( cC4(X1)
    | ~ cTEST(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nbdg696/lgb.p',i_0_15) ).

cnf(i_0_16,plain,
    cTEST(i2003_11_14_17_19_57994),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nbdg696/lgb.p',i_0_16) ).

cnf(c_0_27,plain,
    ( cA(X1)
    | ~ cC2(X1)
    | ~ cB(X1) ),
    i_0_7 ).

cnf(c_0_28,plain,
    ( cB(X1)
    | cA(X1)
    | ~ cC2(X1) ),
    i_0_6 ).

cnf(c_0_29,plain,
    ( ~ cB(X1)
    | ~ cA(X1)
    | ~ cC3(X1) ),
    i_0_9 ).

cnf(c_0_30,plain,
    ( cB(X1)
    | ~ cA(X1)
    | ~ cC3(X1) ),
    i_0_8 ).

cnf(c_0_31,plain,
    ( cC3(X1)
    | ~ cC5(X2)
    | ~ rR(X2,X1) ),
    i_0_12 ).

cnf(c_0_32,plain,
    ( rR(X1,esk1_1(X1))
    | ~ cC4(X1) ),
    i_0_11 ).

cnf(c_0_33,plain,
    ( cA(X1)
    | ~ cC2(X1) ),
    inference(csr,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_34,plain,
    ( cC2(esk1_1(X1))
    | ~ cC4(X1) ),
    i_0_10 ).

cnf(c_0_35,plain,
    ( ~ cA(X1)
    | ~ cC3(X1) ),
    inference(csr,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_36,plain,
    ( cC3(esk1_1(X1))
    | ~ cC5(X1)
    | ~ cC4(X1) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_37,plain,
    ( cA(esk1_1(X1))
    | ~ cC4(X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,plain,
    ( ~ cC5(X1)
    | ~ cC4(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).

cnf(c_0_39,plain,
    ( cC5(X1)
    | ~ cTEST(X1) ),
    i_0_13 ).

cnf(c_0_40,plain,
    ( cC4(X1)
    | ~ cTEST(X1) ),
    i_0_15 ).

cnf(c_0_41,plain,
    cTEST(i2003_11_14_17_19_57994),
    i_0_16 ).

cnf(c_0_42,plain,
    ~ cTEST(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : KRS090+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Tue Jun  7 07:48:52 EDT 2022
% 0.10/0.29  % CPUTime  : 
% 0.14/0.38  # ENIGMATIC: Selected complete mode:
% 4.25/2.16  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.25/2.16  # No SInE strategy applied
% 4.25/2.16  # Trying AutoSched0 for 150 seconds
% 4.25/2.16  # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 4.25/2.16  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.25/2.16  #
% 4.25/2.16  # Preprocessing time       : 0.013 s
% 4.25/2.16  
% 4.25/2.16  # Proof found!
% 4.25/2.16  # SZS status Theorem
% 4.25/2.16  # SZS output start CNFRefutation
% See solution above
% 4.25/2.16  # Training examples: 0 positive, 0 negative
% 4.25/2.16  
% 4.25/2.16  # -------------------------------------------------
% 4.25/2.16  # User time                : 0.012 s
% 4.25/2.16  # System time              : 0.005 s
% 4.25/2.16  # Total time               : 0.017 s
% 4.25/2.16  # Maximum resident set size: 7128 pages
% 4.25/2.16  
%------------------------------------------------------------------------------