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

View Problem - Process Solution

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

% Computer : n020.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:41 EDT 2022

% Result   : Unsatisfiable 7.49s 2.32s
% Output   : CNFRefutation 7.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (   5 unt;   0 nHn;  22 RR)
%            Number of literals    :   41 (   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 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
    ( ~ cd(X1)
    | ~ ra_Px1(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r7zbpf1n/lgb.p',i_0_14) ).

cnf(i_0_16,plain,
    ( ra_Px1(X1,esk4_1(X1))
    | ~ cdxcomp(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r7zbpf1n/lgb.p',i_0_16) ).

cnf(i_0_10,plain,
    ( cdxcomp(X1)
    | ~ cc(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r7zbpf1n/lgb.p',i_0_10) ).

cnf(i_0_24,plain,
    ( cc(X1)
    | ~ ca_Ax3(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r7zbpf1n/lgb.p',i_0_24) ).

cnf(i_0_25,plain,
    ( cd(X1)
    | ~ ca_Ax3(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r7zbpf1n/lgb.p',i_0_25) ).

cnf(i_0_7,plain,
    ( ca_Ax3(X1)
    | ~ cUnsatisfiable(X2)
    | ~ rr(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r7zbpf1n/lgb.p',i_0_7) ).

cnf(i_0_9,plain,
    ( rr(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r7zbpf1n/lgb.p',i_0_9) ).

cnf(i_0_26,plain,
    cUnsatisfiable(i2003_11_14_17_22_10903),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r7zbpf1n/lgb.p',i_0_26) ).

cnf(c_0_35,plain,
    ( ~ cd(X1)
    | ~ ra_Px1(X1,X2) ),
    i_0_14 ).

cnf(c_0_36,plain,
    ( ra_Px1(X1,esk4_1(X1))
    | ~ cdxcomp(X1) ),
    i_0_16 ).

cnf(c_0_37,plain,
    ( ~ cd(X1)
    | ~ cdxcomp(X1) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_38,plain,
    ( cdxcomp(X1)
    | ~ cc(X1) ),
    i_0_10 ).

cnf(c_0_39,plain,
    ( ~ cc(X1)
    | ~ cd(X1) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_40,plain,
    ( cc(X1)
    | ~ ca_Ax3(X1) ),
    i_0_24 ).

cnf(c_0_41,plain,
    ( cd(X1)
    | ~ ca_Ax3(X1) ),
    i_0_25 ).

cnf(c_0_42,plain,
    ( ca_Ax3(X1)
    | ~ cUnsatisfiable(X2)
    | ~ rr(X2,X1) ),
    i_0_7 ).

cnf(c_0_43,plain,
    ~ ca_Ax3(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).

cnf(c_0_44,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ rr(X1,X2) ),
    inference(sr,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_45,plain,
    ( rr(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    i_0_9 ).

cnf(c_0_46,plain,
    cUnsatisfiable(i2003_11_14_17_22_10903),
    i_0_26 ).

cnf(c_0_47,plain,
    ~ cUnsatisfiable(X1),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_48,plain,
    $false,
    inference(sr,[status(thm)],[c_0_46,c_0_47]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KRS124+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n020.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 Jun  7 09:27:23 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.49/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.49/2.32  # No SInE strategy applied
% 7.49/2.32  # Trying AutoSched0 for 150 seconds
% 7.49/2.32  # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.49/2.32  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.49/2.32  #
% 7.49/2.32  # Preprocessing time       : 0.023 s
% 7.49/2.32  
% 7.49/2.32  # Proof found!
% 7.49/2.32  # SZS status Theorem
% 7.49/2.32  # SZS output start CNFRefutation
% See solution above
% 7.49/2.32  # Training examples: 0 positive, 0 negative
% 7.49/2.32  
% 7.49/2.32  # -------------------------------------------------
% 7.49/2.32  # User time                : 0.022 s
% 7.49/2.32  # System time              : 0.009 s
% 7.49/2.32  # Total time               : 0.031 s
% 7.49/2.32  # Maximum resident set size: 7120 pages
% 7.49/2.32  
%------------------------------------------------------------------------------