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

% Computer : n015.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 : Tue Jul 19 08:42:16 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_49,plain,
    ( v1_xboole_0(X1)
    | m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2)))
    | ~ m2_relset_1(X4,X1,X2)
    | ~ m1_subset_1(X3,k1_zfmisc_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nhbal1pp/input.p',i_0_49) ).

cnf(i_0_3,negated_conjecture,
    m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nhbal1pp/input.p',i_0_3) ).

cnf(i_0_4,negated_conjecture,
    ~ v1_xboole_0(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nhbal1pp/input.p',i_0_4) ).

cnf(i_0_1,negated_conjecture,
    ~ m1_subset_1(a_4_0_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nhbal1pp/input.p',i_0_1) ).

cnf(i_0_2,negated_conjecture,
    m2_relset_1(esk4_0,esk1_0,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nhbal1pp/input.p',i_0_2) ).

cnf(c_0_55,plain,
    ( v1_xboole_0(X1)
    | m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2)))
    | ~ m2_relset_1(X4,X1,X2)
    | ~ m1_subset_1(X3,k1_zfmisc_1(X1)) ),
    i_0_49 ).

cnf(c_0_56,negated_conjecture,
    m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
    i_0_3 ).

cnf(c_0_57,negated_conjecture,
    ~ v1_xboole_0(esk1_0),
    i_0_4 ).

cnf(c_0_58,negated_conjecture,
    ~ m1_subset_1(a_4_0_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0))),
    i_0_1 ).

cnf(c_0_59,negated_conjecture,
    ( m1_subset_1(a_4_0_relset_2(esk1_0,X1,esk3_0,X2),k1_zfmisc_1(k1_zfmisc_1(X1)))
    | ~ m2_relset_1(X2,esk1_0,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).

cnf(c_0_60,negated_conjecture,
    m2_relset_1(esk4_0,esk1_0,esk2_0),
    i_0_2 ).

cnf(c_0_61,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SEU424+1 : TPTP v8.1.0. Released v3.4.0.
% 0.15/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.15/0.36  % Computer : n015.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Mon Jun 20 13:42:47 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.22/0.47  # ENIGMATIC: Selected complete mode:
% 7.30/2.43  # ENIGMATIC: Solved by autoschedule:
% 7.30/2.43  # No SInE strategy applied
% 7.30/2.43  # Trying AutoSched0 for 150 seconds
% 7.30/2.43  # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S04BN
% 7.30/2.43  # and selection function PSelectComplexExceptUniqMaxHorn.
% 7.30/2.43  #
% 7.30/2.43  # Preprocessing time       : 0.025 s
% 7.30/2.43  
% 7.30/2.43  # Proof found!
% 7.30/2.43  # SZS status Theorem
% 7.30/2.43  # SZS output start CNFRefutation
% See solution above
% 7.30/2.43  # Training examples: 0 positive, 0 negative
% 7.30/2.43  
% 7.30/2.43  # -------------------------------------------------
% 7.30/2.43  # User time                : 0.031 s
% 7.30/2.43  # System time              : 0.006 s
% 7.30/2.43  # Total time               : 0.037 s
% 7.30/2.43  # Maximum resident set size: 7120 pages
% 7.30/2.43  
%------------------------------------------------------------------------------