TSTP Solution File: SEU427+2 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU427+2 : 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:19 EDT 2022

% Result   : Theorem 9.68s 3.66s
% Output   : CNFRefutation 9.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   28 (  21 unt;   0 nHn;  20 RR)
%            Number of literals    :   41 (  19 equ;  16 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   6 con; 0-4 aty)
%            Number of variables   :   28 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2187,plain,
    ( k4_subset_1(X1,X2,k3_subset_1(X1,X2)) = X1
    | ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mpcsq3dp/lgb.p',i_0_2187) ).

cnf(i_0_2095,plain,
    k3_subset_1(X1,k1_xboole_0) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mpcsq3dp/lgb.p',i_0_2095) ).

cnf(i_0_614,plain,
    m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mpcsq3dp/lgb.p',i_0_614) ).

cnf(i_0_2116,plain,
    ( X1 = k1_xboole_0
    | k4_relset_2(k1_zfmisc_1(X2),X3,k6_relset_2(X3,X2,X4),k8_eqrel_1(X1,k6_relat_1(X1))) != k1_xboole_0
    | ~ m1_subset_1(X1,k1_zfmisc_1(X2))
    | ~ m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X2,X3))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mpcsq3dp/lgb.p',i_0_2116) ).

cnf(i_0_2215,negated_conjecture,
    k4_relset_2(k1_zfmisc_1(esk346_0),esk347_0,k6_relset_2(esk347_0,esk346_0,esk350_0),k8_eqrel_1(esk348_0,k6_relat_1(esk348_0))) = k1_xboole_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mpcsq3dp/lgb.p',i_0_2215) ).

cnf(i_0_2216,negated_conjecture,
    m1_subset_1(esk350_0,k1_zfmisc_1(k2_zfmisc_1(esk346_0,esk347_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mpcsq3dp/lgb.p',i_0_2216) ).

cnf(i_0_2218,negated_conjecture,
    m1_subset_1(esk348_0,k1_zfmisc_1(esk346_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mpcsq3dp/lgb.p',i_0_2218) ).

cnf(i_0_1174,plain,
    ( k4_subset_1(X1,X2,X3) = k3_tarski(k2_tarski(X2,X3))
    | ~ m1_subset_1(X3,k1_zfmisc_1(X1))
    | ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mpcsq3dp/lgb.p',i_0_1174) ).

cnf(i_0_624,plain,
    m1_subset_1(X1,k1_zfmisc_1(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mpcsq3dp/lgb.p',i_0_624) ).

cnf(i_0_2214,negated_conjecture,
    k8_relset_2(esk346_0,esk347_0,k4_subset_1(esk346_0,esk348_0,esk349_0),esk350_0) != k8_relset_2(esk346_0,esk347_0,esk349_0,esk350_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mpcsq3dp/lgb.p',i_0_2214) ).

cnf(i_0_2217,negated_conjecture,
    m1_subset_1(esk349_0,k1_zfmisc_1(esk346_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mpcsq3dp/lgb.p',i_0_2217) ).

cnf(c_0_2230,plain,
    ( k4_subset_1(X1,X2,k3_subset_1(X1,X2)) = X1
    | ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
    i_0_2187 ).

cnf(c_0_2231,plain,
    k3_subset_1(X1,k1_xboole_0) = X1,
    i_0_2095 ).

cnf(c_0_2232,plain,
    m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
    i_0_614 ).

cnf(c_0_2233,plain,
    ( X1 = k1_xboole_0
    | k4_relset_2(k1_zfmisc_1(X2),X3,k6_relset_2(X3,X2,X4),k8_eqrel_1(X1,k6_relat_1(X1))) != k1_xboole_0
    | ~ m1_subset_1(X1,k1_zfmisc_1(X2))
    | ~ m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X2,X3))) ),
    i_0_2116 ).

cnf(c_0_2234,negated_conjecture,
    k4_relset_2(k1_zfmisc_1(esk346_0),esk347_0,k6_relset_2(esk347_0,esk346_0,esk350_0),k8_eqrel_1(esk348_0,k6_relat_1(esk348_0))) = k1_xboole_0,
    i_0_2215 ).

cnf(c_0_2235,negated_conjecture,
    m1_subset_1(esk350_0,k1_zfmisc_1(k2_zfmisc_1(esk346_0,esk347_0))),
    i_0_2216 ).

cnf(c_0_2236,negated_conjecture,
    m1_subset_1(esk348_0,k1_zfmisc_1(esk346_0)),
    i_0_2218 ).

cnf(c_0_2237,plain,
    k4_subset_1(X1,k1_xboole_0,X1) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2230,c_0_2231]),c_0_2232])]) ).

cnf(c_0_2238,plain,
    ( k4_subset_1(X1,X2,X3) = k3_tarski(k2_tarski(X2,X3))
    | ~ m1_subset_1(X3,k1_zfmisc_1(X1))
    | ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
    i_0_1174 ).

cnf(c_0_2239,plain,
    m1_subset_1(X1,k1_zfmisc_1(X1)),
    i_0_624 ).

cnf(c_0_2240,negated_conjecture,
    k8_relset_2(esk346_0,esk347_0,k4_subset_1(esk346_0,esk348_0,esk349_0),esk350_0) != k8_relset_2(esk346_0,esk347_0,esk349_0,esk350_0),
    i_0_2214 ).

cnf(c_0_2241,negated_conjecture,
    esk348_0 = k1_xboole_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2233,c_0_2234]),c_0_2235]),c_0_2236])]) ).

cnf(c_0_2242,plain,
    k3_tarski(k2_tarski(k1_xboole_0,X1)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2237,c_0_2238]),c_0_2239]),c_0_2232])]) ).

cnf(c_0_2243,negated_conjecture,
    k8_relset_2(esk346_0,esk347_0,k4_subset_1(esk346_0,k1_xboole_0,esk349_0),esk350_0) != k8_relset_2(esk346_0,esk347_0,esk349_0,esk350_0),
    inference(rw,[status(thm)],[c_0_2240,c_0_2241]) ).

cnf(c_0_2244,plain,
    ( k4_subset_1(X1,k1_xboole_0,X2) = X2
    | ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2238,c_0_2242]),c_0_2232])]) ).

cnf(c_0_2245,negated_conjecture,
    m1_subset_1(esk349_0,k1_zfmisc_1(esk346_0)),
    i_0_2217 ).

cnf(c_0_2246,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2243,c_0_2244]),c_0_2245])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU427+2 : TPTP v8.1.0. Released v3.4.0.
% 0.03/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 : Mon Jun 20 10:17:42 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected SinE mode:
% 0.37/0.61  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.61  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.37/0.61  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.37/0.61  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.68/3.66  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.68/3.66  # No SInE strategy applied
% 9.68/3.66  # Trying AutoSched0 for 150 seconds
% 9.68/3.66  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.68/3.66  # and selection function SelectComplexExceptUniqMaxHorn.
% 9.68/3.66  #
% 9.68/3.66  # Preprocessing time       : 0.022 s
% 9.68/3.66  # Presaturation interreduction done
% 9.68/3.66  
% 9.68/3.66  # Proof found!
% 9.68/3.66  # SZS status Theorem
% 9.68/3.66  # SZS output start CNFRefutation
% See solution above
% 9.68/3.66  # Training examples: 0 positive, 0 negative
% 9.68/3.66  
% 9.68/3.66  # -------------------------------------------------
% 9.68/3.66  # User time                : 0.027 s
% 9.68/3.66  # System time              : 0.005 s
% 9.68/3.66  # Total time               : 0.032 s
% 9.68/3.66  # Maximum resident set size: 7124 pages
% 9.68/3.66  
%------------------------------------------------------------------------------