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

View Problem - Process Solution

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

% Computer : n019.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:31 EDT 2022

% Result   : Unsatisfiable 6.66s 2.34s
% Output   : CNFRefutation 6.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   15 (   4 unt;   2 nHn;  13 RR)
%            Number of literals    :   28 (   0 equ;  14 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   14 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    ( cc(X1)
    | ~ cc(X2)
    | ~ rr(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-opfob5uo/lgb.p',i_0_7) ).

cnf(i_0_10,plain,
    ( cd(X1)
    | rr(X1,esk1_1(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-opfob5uo/lgb.p',i_0_10) ).

cnf(i_0_9,plain,
    ( cd(X1)
    | ~ cc(esk1_1(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-opfob5uo/lgb.p',i_0_9) ).

cnf(i_0_6,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ cd(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-opfob5uo/lgb.p',i_0_6) ).

cnf(i_0_5,plain,
    ( cc(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-opfob5uo/lgb.p',i_0_5) ).

cnf(i_0_8,plain,
    cUnsatisfiable(i2003_11_14_17_18_23845),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-opfob5uo/lgb.p',i_0_8) ).

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

cnf(c_0_18,plain,
    ( cd(X1)
    | rr(X1,esk1_1(X1)) ),
    i_0_10 ).

cnf(c_0_19,plain,
    ( cd(X1)
    | ~ cc(esk1_1(X1)) ),
    i_0_9 ).

cnf(c_0_20,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ cd(X1) ),
    i_0_6 ).

cnf(c_0_21,plain,
    ( cd(X1)
    | ~ cc(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_22,plain,
    ( cc(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_5 ).

cnf(c_0_23,plain,
    cUnsatisfiable(i2003_11_14_17_18_23845),
    i_0_8 ).

cnf(c_0_24,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

cnf(c_0_25,plain,
    $false,
    inference(sr,[status(thm)],[c_0_23,c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : KRS068+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n019.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue Jun  7 13:33:11 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected complete mode:
% 6.66/2.34  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.66/2.34  # No SInE strategy applied
% 6.66/2.34  # Trying AutoSched0 for 150 seconds
% 6.66/2.34  # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 6.66/2.34  # and selection function SelectMaxLComplexAvoidPosPred.
% 6.66/2.34  #
% 6.66/2.34  # Preprocessing time       : 0.023 s
% 6.66/2.34  
% 6.66/2.34  # Proof found!
% 6.66/2.34  # SZS status Theorem
% 6.66/2.34  # SZS output start CNFRefutation
% See solution above
% 6.66/2.34  # Training examples: 0 positive, 0 negative
% 6.66/2.34  
% 6.66/2.34  # -------------------------------------------------
% 6.66/2.34  # User time                : 0.023 s
% 6.66/2.34  # System time              : 0.006 s
% 6.66/2.34  # Total time               : 0.029 s
% 6.66/2.34  # Maximum resident set size: 7128 pages
% 6.66/2.34  
%------------------------------------------------------------------------------