TSTP Solution File: SEU430+4 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n016.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:23 EDT 2022

% Result   : Theorem 16.37s 7.52s
% Output   : CNFRefutation 16.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (   6 unt;   5 nHn;  21 RR)
%            Number of literals    :   44 (  29 equ;  20 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3585,negated_conjecture,
    ( X1 = k1_xboole_0
    | k5_setfam_1(esk578_0,esk579_0) = k1_xboole_0
    | ~ r2_hidden(X1,esk579_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddk6l316/lgb.p',i_0_3585) ).

cnf(i_0_5694,plain,
    ( k3_tarski(X1) = k1_xboole_0
    | r2_hidden(esk847_1(X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddk6l316/lgb.p',i_0_5694) ).

cnf(i_0_5695,plain,
    ( k3_tarski(X1) = k1_xboole_0
    | esk847_1(X1) != k1_xboole_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddk6l316/lgb.p',i_0_5695) ).

cnf(i_0_3587,negated_conjecture,
    ( r2_hidden(esk580_0,esk579_0)
    | k5_setfam_1(esk578_0,esk579_0) != k1_xboole_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddk6l316/lgb.p',i_0_3587) ).

cnf(i_0_1587,plain,
    ( k5_setfam_1(X1,X2) = k3_tarski(X2)
    | ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddk6l316/lgb.p',i_0_1587) ).

cnf(i_0_3588,negated_conjecture,
    m1_subset_1(esk579_0,k1_zfmisc_1(k1_zfmisc_1(esk578_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddk6l316/lgb.p',i_0_3588) ).

cnf(i_0_3586,negated_conjecture,
    ( esk580_0 != k1_xboole_0
    | k5_setfam_1(esk578_0,esk579_0) != k1_xboole_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddk6l316/lgb.p',i_0_3586) ).

cnf(i_0_5696,plain,
    ( X1 = k1_xboole_0
    | k3_tarski(X2) != k1_xboole_0
    | ~ r2_hidden(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddk6l316/lgb.p',i_0_5696) ).

cnf(c_0_5705,negated_conjecture,
    ( X1 = k1_xboole_0
    | k5_setfam_1(esk578_0,esk579_0) = k1_xboole_0
    | ~ r2_hidden(X1,esk579_0) ),
    i_0_3585 ).

cnf(c_0_5706,plain,
    ( k3_tarski(X1) = k1_xboole_0
    | r2_hidden(esk847_1(X1),X1) ),
    i_0_5694 ).

cnf(c_0_5707,plain,
    ( k3_tarski(X1) = k1_xboole_0
    | esk847_1(X1) != k1_xboole_0 ),
    i_0_5695 ).

cnf(c_0_5708,negated_conjecture,
    ( r2_hidden(esk580_0,esk579_0)
    | k5_setfam_1(esk578_0,esk579_0) != k1_xboole_0 ),
    i_0_3587 ).

cnf(c_0_5709,plain,
    ( k5_setfam_1(X1,X2) = k3_tarski(X2)
    | ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
    i_0_1587 ).

cnf(c_0_5710,negated_conjecture,
    m1_subset_1(esk579_0,k1_zfmisc_1(k1_zfmisc_1(esk578_0))),
    i_0_3588 ).

cnf(c_0_5711,negated_conjecture,
    ( k5_setfam_1(esk578_0,esk579_0) = k1_xboole_0
    | k3_tarski(esk579_0) = k1_xboole_0 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5705,c_0_5706]),c_0_5707]) ).

cnf(c_0_5712,negated_conjecture,
    ( esk580_0 != k1_xboole_0
    | k5_setfam_1(esk578_0,esk579_0) != k1_xboole_0 ),
    i_0_3586 ).

cnf(c_0_5713,negated_conjecture,
    ( r2_hidden(esk580_0,esk579_0)
    | k3_tarski(esk579_0) != k1_xboole_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5708,c_0_5709]),c_0_5710])]) ).

cnf(c_0_5714,plain,
    k3_tarski(esk579_0) = k1_xboole_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5709,c_0_5711]),c_0_5710])]) ).

cnf(c_0_5715,negated_conjecture,
    ( k3_tarski(esk579_0) != k1_xboole_0
    | esk580_0 != k1_xboole_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5712,c_0_5709]),c_0_5710])]) ).

cnf(c_0_5716,plain,
    ( X1 = k1_xboole_0
    | k3_tarski(X2) != k1_xboole_0
    | ~ r2_hidden(X1,X2) ),
    i_0_5696 ).

cnf(c_0_5717,negated_conjecture,
    r2_hidden(esk580_0,esk579_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5713,c_0_5714])]) ).

cnf(c_0_5718,negated_conjecture,
    esk580_0 != k1_xboole_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5715,c_0_5714])]) ).

cnf(c_0_5719,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5716,c_0_5717]),c_0_5714])]),c_0_5718]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU430+4 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n016.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 Jun 19 16:58:21 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 2.92/3.16  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.92/3.16  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 2.92/3.16  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 2.92/3.16  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 16.37/7.52  # ENIGMATIC: Solved by autoschedule-lgb:
% 16.37/7.52  # No SInE strategy applied
% 16.37/7.52  # Trying AutoSched0 for 148 seconds
% 16.37/7.52  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 16.37/7.52  # and selection function SelectComplexExceptUniqMaxHorn.
% 16.37/7.52  #
% 16.37/7.52  # Preprocessing time       : 0.048 s
% 16.37/7.52  # Presaturation interreduction done
% 16.37/7.52  
% 16.37/7.52  # Proof found!
% 16.37/7.52  # SZS status Theorem
% 16.37/7.52  # SZS output start CNFRefutation
% See solution above
% 16.37/7.52  # Training examples: 0 positive, 0 negative
% 16.37/7.52  
% 16.37/7.52  # -------------------------------------------------
% 16.37/7.52  # User time                : 0.361 s
% 16.37/7.52  # System time              : 0.017 s
% 16.37/7.52  # Total time               : 0.378 s
% 16.37/7.52  # Maximum resident set size: 7124 pages
% 16.37/7.52  
%------------------------------------------------------------------------------