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

% Computer : n017.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:07:56 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ~ likes(esk2_0,esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xzx1b3l/lgb.p',i_0_1) ).

cnf(i_0_9,negated_conjecture,
    ( likes(esk2_0,X1)
    | ~ food(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xzx1b3l/lgb.p',i_0_9) ).

cnf(i_0_6,negated_conjecture,
    ( food(X1)
    | ~ eats(X2,X1)
    | ~ not_killed_by(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xzx1b3l/lgb.p',i_0_6) ).

cnf(i_0_5,negated_conjecture,
    eats(esk3_0,esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xzx1b3l/lgb.p',i_0_5) ).

cnf(i_0_2,negated_conjecture,
    ( not_killed_by(X1,X2)
    | ~ alive(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xzx1b3l/lgb.p',i_0_2) ).

cnf(i_0_4,negated_conjecture,
    alive(esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xzx1b3l/lgb.p',i_0_4) ).

cnf(c_0_16,negated_conjecture,
    ~ likes(esk2_0,esk1_0),
    i_0_1 ).

cnf(c_0_17,negated_conjecture,
    ( likes(esk2_0,X1)
    | ~ food(X1) ),
    i_0_9 ).

cnf(c_0_18,negated_conjecture,
    ( food(X1)
    | ~ eats(X2,X1)
    | ~ not_killed_by(X2,X1) ),
    i_0_6 ).

cnf(c_0_19,negated_conjecture,
    eats(esk3_0,esk1_0),
    i_0_5 ).

cnf(c_0_20,negated_conjecture,
    ~ food(esk1_0),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    ~ not_killed_by(esk3_0,esk1_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_22,negated_conjecture,
    ( not_killed_by(X1,X2)
    | ~ alive(X1) ),
    i_0_2 ).

cnf(c_0_23,negated_conjecture,
    alive(esk3_0),
    i_0_4 ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PUZ060+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n017.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:22:41 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.25/2.23  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.25/2.23  # No SInE strategy applied
% 7.25/2.23  # Trying AutoSched0 for 150 seconds
% 7.25/2.23  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 7.25/2.23  # and selection function SelectCQPrecWNTNp.
% 7.25/2.23  #
% 7.25/2.23  # Preprocessing time       : 0.021 s
% 7.25/2.23  
% 7.25/2.23  # Proof found!
% 7.25/2.23  # SZS status Theorem
% 7.25/2.23  # SZS output start CNFRefutation
% See solution above
% 7.25/2.23  # Training examples: 0 positive, 0 negative
% 7.25/2.23  
% 7.25/2.23  # -------------------------------------------------
% 7.25/2.23  # User time                : 0.021 s
% 7.25/2.23  # System time              : 0.005 s
% 7.25/2.23  # Total time               : 0.026 s
% 7.25/2.23  # Maximum resident set size: 7124 pages
% 7.25/2.23  
%------------------------------------------------------------------------------