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

% Computer : n025.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 : Thu Jul 21 04:49:10 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ( q
    | ~ p ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8exkm6ob/input.p',i_0_1) ).

cnf(i_0_5,negated_conjecture,
    p,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8exkm6ob/input.p',i_0_5) ).

cnf(i_0_2,negated_conjecture,
    ~ q,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8exkm6ob/input.p',i_0_2) ).

cnf(c_0_9,negated_conjecture,
    ( q
    | ~ p ),
    i_0_1 ).

cnf(c_0_10,negated_conjecture,
    p,
    i_0_5 ).

cnf(c_0_11,negated_conjecture,
    ~ q,
    i_0_2 ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SYN046+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n025.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 : Mon Jul 11 23:01:19 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 4.38/2.25  # ENIGMATIC: Solved by autoschedule:
% 4.38/2.25  # No SInE strategy applied
% 4.38/2.25  # Trying AutoSched0 for 150 seconds
% 4.38/2.25  # AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S0V
% 4.38/2.25  # and selection function PSelectComplexExceptRRHorn.
% 4.38/2.25  #
% 4.38/2.25  # Preprocessing time       : 0.012 s
% 4.38/2.25  
% 4.38/2.25  # Proof found!
% 4.38/2.25  # SZS status Theorem
% 4.38/2.25  # SZS output start CNFRefutation
% See solution above
% 4.38/2.25  # Training examples: 0 positive, 0 negative
% 4.38/2.25  
% 4.38/2.25  # -------------------------------------------------
% 4.38/2.25  # User time                : 0.013 s
% 4.38/2.25  # System time              : 0.002 s
% 4.38/2.25  # Total time               : 0.015 s
% 4.38/2.25  # Maximum resident set size: 7120 pages
% 4.38/2.25  
%------------------------------------------------------------------------------