%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SYN931+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 : Thu Jul 21 04:58:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
    ( ~ c
    | ~ p(X1)
    | ~ p(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yo12ztv/lgb.p',i_0_5) ).

cnf(i_0_1,negated_conjecture,
    c,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yo12ztv/lgb.p',i_0_1) ).

cnf(i_0_4,negated_conjecture,
    ( p(esk1_0)
    | p(esk2_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2yo12ztv/lgb.p',i_0_4) ).

cnf(c_0_9,negated_conjecture,
    ( ~ c
    | ~ p(X1)
    | ~ p(X2) ),
    i_0_5 ).

cnf(c_0_10,negated_conjecture,
    c,
    i_0_1 ).

cnf(c_0_11,negated_conjecture,
    ( ~ p(X1)
    | ~ p(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_12,negated_conjecture,
    ( p(esk1_0)
    | p(esk2_0) ),
    i_0_4 ).

cnf(c_0_13,negated_conjecture,
    ~ p(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_12,c_0_13]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN931+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n017.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul 11 15:23:06 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 4.43/2.15  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.43/2.15  # No SInE strategy applied
% 4.43/2.15  # Trying AutoSched0 for 150 seconds
% 4.43/2.15  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
% 4.43/2.15  # and selection function SelectCQIPrecW.
% 4.43/2.15  #
% 4.43/2.15  # Preprocessing time       : 0.022 s
% 4.43/2.15  # Presaturation interreduction done
% 4.43/2.15  
% 4.43/2.15  # Proof found!
% 4.43/2.15  # SZS status Theorem
% 4.43/2.15  # SZS output start CNFRefutation
% See solution above
% 4.43/2.15  # Training examples: 0 positive, 0 negative
% 4.43/2.15  
% 4.43/2.15  # -------------------------------------------------
% 4.43/2.15  # User time                : 0.024 s
% 4.43/2.15  # System time              : 0.004 s
% 4.43/2.15  # Total time               : 0.028 s
% 4.43/2.15  # Maximum resident set size: 7124 pages
% 4.43/2.15  
%------------------------------------------------------------------------------