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

% Computer : n009.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:51:51 EDT 2022

% Result   : Theorem 7.37s 2.28s
% Output   : CNFRefutation 7.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (   8 unt;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   15 (   9   ~;   4   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   12 (   7 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
    ( big_p(esk1_0,X1)
    | big_q(esk2_1(X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-s576929n/lgb.p',i_0_3) ).

cnf(i_0_2,negated_conjecture,
    ~ big_p(X1,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-s576929n/lgb.p',i_0_2) ).

cnf(i_0_1,negated_conjecture,
    ~ big_q(X1,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-s576929n/lgb.p',i_0_1) ).

fof(c_0_7,plain,
    ( ~ epred2_0
  <=> ! [X1] : big_p(esk1_0,X1) ),
    introduced(definition) ).

fof(c_0_8,plain,
    ( ~ epred1_0
  <=> ! [X2] : big_q(esk2_1(X2),X2) ),
    introduced(definition) ).

cnf(c_0_9,negated_conjecture,
    ( big_p(esk1_0,X1)
    | big_q(esk2_1(X2),X2) ),
    i_0_3 ).

cnf(c_0_10,negated_conjecture,
    ~ big_p(X1,esk3_0),
    i_0_2 ).

cnf(c_0_11,negated_conjecture,
    ( epred2_0
    | big_p(esk1_0,X1) ),
    inference(split_equiv,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ epred2_0
    | ~ epred1_0 ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_8]),c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    epred2_0,
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ~ epred1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).

cnf(c_0_15,negated_conjecture,
    ~ big_q(X1,esk3_0),
    i_0_1 ).

cnf(c_0_16,negated_conjecture,
    big_q(esk2_1(X1),X1),
    inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_8]),c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_15,c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN382+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.33  % Computer : n009.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 600
% 0.14/0.33  % DateTime : Mon Jul 11 17:21:23 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.37/2.28  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.37/2.28  # No SInE strategy applied
% 7.37/2.28  # Trying AutoSched0 for 150 seconds
% 7.37/2.28  # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 7.37/2.28  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.37/2.28  #
% 7.37/2.28  # Preprocessing time       : 0.022 s
% 7.37/2.28  
% 7.37/2.28  # Proof found!
% 7.37/2.28  # SZS status Theorem
% 7.37/2.28  # SZS output start CNFRefutation
% See solution above
% 7.37/2.28  # Training examples: 0 positive, 0 negative
% 7.37/2.28  
% 7.37/2.28  # -------------------------------------------------
% 7.37/2.28  # User time                : 0.019 s
% 7.37/2.28  # System time              : 0.009 s
% 7.37/2.28  # Total time               : 0.029 s
% 7.37/2.28  # Maximum resident set size: 7120 pages
% 7.37/2.28  
%------------------------------------------------------------------------------