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

% Computer : n027.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:35 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
    ( cd1(X1)
    | ~ cc1(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fpuuxfr9/input.p',i_0_9) ).

cnf(i_0_8,plain,
    ( ~ cc1(X1)
    | ~ cd1(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fpuuxfr9/input.p',i_0_8) ).

cnf(i_0_6,plain,
    ( cc1(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fpuuxfr9/input.p',i_0_6) ).

cnf(i_0_12,plain,
    cUnsatisfiable(i2003_11_14_17_20_11330),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fpuuxfr9/input.p',i_0_12) ).

cnf(c_0_17,plain,
    ( cd1(X1)
    | ~ cc1(X1) ),
    i_0_9 ).

cnf(c_0_18,plain,
    ( ~ cc1(X1)
    | ~ cd1(X1) ),
    i_0_8 ).

cnf(c_0_19,plain,
    ( cc1(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_6 ).

cnf(c_0_20,plain,
    cUnsatisfiable(i2003_11_14_17_20_11330),
    i_0_12 ).

cnf(c_0_21,plain,
    ~ cc1(X1),
    inference(csr,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : KRS094+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.31  % Computer : n027.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 600
% 0.11/0.31  % DateTime : Tue Jun  7 20:09:42 EDT 2022
% 0.11/0.31  % CPUTime  : 
% 0.16/0.42  # ENIGMATIC: Selected complete mode:
% 4.43/2.12  # ENIGMATIC: Solved by autoschedule:
% 4.43/2.12  # No SInE strategy applied
% 4.43/2.12  # Trying AutoSched0 for 150 seconds
% 4.43/2.12  # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 4.43/2.12  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.43/2.12  #
% 4.43/2.12  # Preprocessing time       : 0.023 s
% 4.43/2.12  
% 4.43/2.12  # Proof found!
% 4.43/2.12  # SZS status Theorem
% 4.43/2.12  # SZS output start CNFRefutation
% See solution above
% 4.43/2.12  # Training examples: 0 positive, 0 negative
% 4.43/2.12  
% 4.43/2.12  # -------------------------------------------------
% 4.43/2.12  # User time                : 0.022 s
% 4.43/2.12  # System time              : 0.007 s
% 4.43/2.12  # Total time               : 0.029 s
% 4.43/2.12  # Maximum resident set size: 7120 pages
% 4.43/2.12  
%------------------------------------------------------------------------------