%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : KRS141+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:54 EDT 2022

% Result   : Theorem 7.43s 2.30s
% Output   : CNFRefutation 7.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (  10 unt;   6 nHn;  20 RR)
%            Number of literals    :   46 (   0 equ;  23 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   10 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_11,negated_conjecture,
    ( cowlNothing(esk1_0)
    | xsd_integer(esk2_0)
    | ~ xsd_string(esk2_0)
    | ~ cc(io) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rct7_r68/input.p',i_0_11) ).

cnf(i_0_1,plain,
    ~ cowlNothing(X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rct7_r68/input.p',i_0_1) ).

cnf(i_0_5,plain,
    ( cc(X1)
    | ~ cr(X2)
    | ~ rp(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rct7_r68/input.p',i_0_5) ).

cnf(i_0_8,plain,
    rp(ii,io),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rct7_r68/input.p',i_0_8) ).

cnf(i_0_6,plain,
    cr(ii),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rct7_r68/input.p',i_0_6) ).

cnf(i_0_3,plain,
    ( xsd_string(X1)
    | xsd_integer(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rct7_r68/input.p',i_0_3) ).

cnf(i_0_10,negated_conjecture,
    ( cowlNothing(esk1_0)
    | xsd_string(esk2_0)
    | ~ xsd_integer(esk2_0)
    | ~ cc(io) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rct7_r68/input.p',i_0_10) ).

cnf(i_0_4,plain,
    ( ~ xsd_string(X1)
    | ~ xsd_integer(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rct7_r68/input.p',i_0_4) ).

cnf(c_0_20,negated_conjecture,
    ( cowlNothing(esk1_0)
    | xsd_integer(esk2_0)
    | ~ xsd_string(esk2_0)
    | ~ cc(io) ),
    i_0_11 ).

cnf(c_0_21,plain,
    ~ cowlNothing(X1),
    i_0_1 ).

cnf(c_0_22,plain,
    ( cc(X1)
    | ~ cr(X2)
    | ~ rp(X2,X1) ),
    i_0_5 ).

cnf(c_0_23,plain,
    rp(ii,io),
    i_0_8 ).

cnf(c_0_24,plain,
    cr(ii),
    i_0_6 ).

cnf(c_0_25,negated_conjecture,
    ( xsd_integer(esk2_0)
    | ~ cc(io)
    | ~ xsd_string(esk2_0) ),
    inference(sr,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,plain,
    cc(io),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).

cnf(c_0_27,plain,
    ( xsd_string(X1)
    | xsd_integer(X1) ),
    i_0_3 ).

cnf(c_0_28,negated_conjecture,
    ( cowlNothing(esk1_0)
    | xsd_string(esk2_0)
    | ~ xsd_integer(esk2_0)
    | ~ cc(io) ),
    i_0_10 ).

cnf(c_0_29,plain,
    ( ~ xsd_string(X1)
    | ~ xsd_integer(X1) ),
    i_0_4 ).

cnf(c_0_30,negated_conjecture,
    xsd_integer(esk2_0),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ( xsd_string(esk2_0)
    | ~ cc(io)
    | ~ xsd_integer(esk2_0) ),
    inference(sr,[status(thm)],[c_0_28,c_0_21]) ).

cnf(c_0_32,plain,
    ~ xsd_string(esk2_0),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_26])]),c_0_30])]),c_0_32]),
    [proof] ).

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