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

View Problem - Process Solution

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

% Computer : n024.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:37 EDT 2022

% Result   : Unsatisfiable 7.61s 2.33s
% Output   : CNFRefutation 7.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   25 (   5 unt;   2 nHn;  23 RR)
%            Number of literals    :   47 (   0 equ;  26 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   24 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
    ( ~ cd(X1)
    | ~ ra_Px1(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-10ldxun6/input.p',i_0_9) ).

cnf(i_0_11,plain,
    ( ra_Px1(X1,esk2_1(X1))
    | ~ cdxcomp(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-10ldxun6/input.p',i_0_11) ).

cnf(i_0_5,plain,
    ( cdxcomp(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-10ldxun6/input.p',i_0_5) ).

cnf(i_0_15,plain,
    ( cd(X1)
    | ~ ca_Ax2(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-10ldxun6/input.p',i_0_15) ).

cnf(i_0_16,plain,
    cUnsatisfiable(i2003_11_14_17_20_53634),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-10ldxun6/input.p',i_0_16) ).

cnf(i_0_7,plain,
    ( cc(X1)
    | ~ cc(X2)
    | ~ rr(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-10ldxun6/input.p',i_0_7) ).

cnf(i_0_13,plain,
    ( ca_Ax2(X1)
    | rr(X1,esk3_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-10ldxun6/input.p',i_0_13) ).

cnf(i_0_12,plain,
    ( ca_Ax2(X1)
    | ~ cc(esk3_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-10ldxun6/input.p',i_0_12) ).

cnf(i_0_6,plain,
    ( cc(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-10ldxun6/input.p',i_0_6) ).

cnf(c_0_26,plain,
    ( ~ cd(X1)
    | ~ ra_Px1(X1,X2) ),
    i_0_9 ).

cnf(c_0_27,plain,
    ( ra_Px1(X1,esk2_1(X1))
    | ~ cdxcomp(X1) ),
    i_0_11 ).

cnf(c_0_28,plain,
    ( ~ cd(X1)
    | ~ cdxcomp(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_29,plain,
    ( cdxcomp(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_5 ).

cnf(c_0_30,plain,
    ( ~ cd(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_31,plain,
    ( cd(X1)
    | ~ ca_Ax2(X1) ),
    i_0_15 ).

cnf(c_0_32,plain,
    ( ~ ca_Ax2(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_33,plain,
    cUnsatisfiable(i2003_11_14_17_20_53634),
    i_0_16 ).

cnf(c_0_34,plain,
    ( cc(X1)
    | ~ cc(X2)
    | ~ rr(X2,X1) ),
    i_0_7 ).

cnf(c_0_35,plain,
    ( ca_Ax2(X1)
    | rr(X1,esk3_1(X1)) ),
    i_0_13 ).

cnf(c_0_36,plain,
    ( ca_Ax2(X1)
    | ~ cc(esk3_1(X1)) ),
    i_0_12 ).

cnf(c_0_37,plain,
    ( cc(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_6 ).

cnf(c_0_38,plain,
    ~ ca_Ax2(i2003_11_14_17_20_53634),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_39,plain,
    ( ca_Ax2(X1)
    | ~ cc(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).

cnf(c_0_40,plain,
    cc(i2003_11_14_17_20_53634),
    inference(spm,[status(thm)],[c_0_37,c_0_33]) ).

cnf(c_0_41,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : KRS105+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jun  7 17:31:36 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.61/2.33  # ENIGMATIC: Solved by autoschedule:
% 7.61/2.33  # No SInE strategy applied
% 7.61/2.33  # Trying AutoSched0 for 150 seconds
% 7.61/2.33  # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.61/2.33  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.61/2.33  #
% 7.61/2.33  # Preprocessing time       : 0.012 s
% 7.61/2.33  
% 7.61/2.33  # Proof found!
% 7.61/2.33  # SZS status Theorem
% 7.61/2.33  # SZS output start CNFRefutation
% See solution above
% 7.61/2.33  # Training examples: 0 positive, 0 negative
% 7.61/2.33  
% 7.61/2.33  # -------------------------------------------------
% 7.61/2.33  # User time                : 0.012 s
% 7.61/2.33  # System time              : 0.006 s
% 7.61/2.33  # Total time               : 0.018 s
% 7.61/2.33  # Maximum resident set size: 7120 pages
% 7.61/2.33  
%------------------------------------------------------------------------------