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

% Computer : n018.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 : Mon Jul 18 18:08:47 EDT 2022

% Result   : Theorem 4.34s 2.09s
% Output   : CNFRefutation 4.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   18 (  14 unt;   0 nHn;  18 RR)
%            Number of literals    :   26 (   0 equ;  10 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    6 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,negated_conjecture,
    ( patricide(X1)
    | ~ patricide(X2)
    | ~ parent_of(X2,X1)
    | ~ parent_of(iokaste,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb_qqnam/input.p',i_0_7) ).

cnf(i_0_1,plain,
    parent_of(iokaste,oedipus),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb_qqnam/input.p',i_0_1) ).

cnf(i_0_5,plain,
    patricide(oedipus),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb_qqnam/input.p',i_0_5) ).

cnf(i_0_3,plain,
    parent_of(oedipus,polyneikes),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb_qqnam/input.p',i_0_3) ).

cnf(i_0_2,plain,
    parent_of(iokaste,polyneikes),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb_qqnam/input.p',i_0_2) ).

cnf(i_0_4,plain,
    parent_of(polyneikes,thersandros),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb_qqnam/input.p',i_0_4) ).

cnf(i_0_6,plain,
    ~ patricide(thersandros),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb_qqnam/input.p',i_0_6) ).

cnf(c_0_15,negated_conjecture,
    ( patricide(X1)
    | ~ patricide(X2)
    | ~ parent_of(X2,X1)
    | ~ parent_of(iokaste,X2) ),
    i_0_7 ).

cnf(c_0_16,plain,
    parent_of(iokaste,oedipus),
    i_0_1 ).

cnf(c_0_17,plain,
    patricide(oedipus),
    i_0_5 ).

cnf(c_0_18,plain,
    ( patricide(X1)
    | ~ parent_of(oedipus,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).

cnf(c_0_19,plain,
    parent_of(oedipus,polyneikes),
    i_0_3 ).

cnf(c_0_20,plain,
    parent_of(iokaste,polyneikes),
    i_0_2 ).

cnf(c_0_21,plain,
    patricide(polyneikes),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    ( patricide(X1)
    | ~ parent_of(polyneikes,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_21])]) ).

cnf(c_0_23,plain,
    parent_of(polyneikes,thersandros),
    i_0_4 ).

cnf(c_0_24,plain,
    ~ patricide(thersandros),
    i_0_6 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PUZ128+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n018.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 : Sun May 29 00:03:12 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 4.34/2.09  # ENIGMATIC: Solved by autoschedule:
% 4.34/2.09  # No SInE strategy applied
% 4.34/2.09  # Trying AutoSched0 for 150 seconds
% 4.34/2.09  # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 4.34/2.09  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.34/2.09  #
% 4.34/2.09  # Preprocessing time       : 0.023 s
% 4.34/2.09  
% 4.34/2.09  # Proof found!
% 4.34/2.09  # SZS status Theorem
% 4.34/2.09  # SZS output start CNFRefutation
% See solution above
% 4.34/2.09  # Training examples: 0 positive, 0 negative
% 4.34/2.09  
% 4.34/2.09  # -------------------------------------------------
% 4.34/2.09  # User time                : 0.022 s
% 4.34/2.09  # System time              : 0.006 s
% 4.34/2.09  # Total time               : 0.028 s
% 4.34/2.09  # Maximum resident set size: 7120 pages
% 4.34/2.09  
%------------------------------------------------------------------------------