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

View Problem - Process Solution

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

% Computer : n006.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:20 EDT 2022

% Result   : Theorem 14.29s 7.67s
% Output   : CNFRefutation 14.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   26 (  18 unt;   0 nHn;  22 RR)
%            Number of literals    :   43 (  17 equ;  20 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   6 con; 0-4 aty)
%            Number of variables   :   26 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1792,plain,
    ( k3_tarski(k2_tarski(X1,X2)) = X2
    | ~ r1_tarski(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4r8enscd/lgb.p',i_0_1792) ).

cnf(i_0_1408,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/sandbox/tmp/enigma-theBenchmark.p-4r8enscd/lgb.p',i_0_1408) ).

cnf(i_0_3056,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/sandbox/tmp/enigma-theBenchmark.p-4r8enscd/lgb.p',i_0_3056) ).

cnf(i_0_3295,negated_conjecture,
    k4_relset_2(k1_zfmisc_1(esk498_0),esk499_0,k6_relset_2(esk499_0,esk498_0,esk502_0),k8_eqrel_1(esk500_0,k6_relat_1(esk500_0))) = k1_xboole_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4r8enscd/lgb.p',i_0_3295) ).

cnf(i_0_3296,negated_conjecture,
    m1_subset_1(esk502_0,k1_zfmisc_1(k2_zfmisc_1(esk498_0,esk499_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4r8enscd/lgb.p',i_0_3296) ).

cnf(i_0_3298,negated_conjecture,
    m1_subset_1(esk500_0,k1_zfmisc_1(esk498_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4r8enscd/lgb.p',i_0_3298) ).

cnf(i_0_3297,negated_conjecture,
    m1_subset_1(esk501_0,k1_zfmisc_1(esk498_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4r8enscd/lgb.p',i_0_3297) ).

cnf(i_0_3294,negated_conjecture,
    k8_relset_2(esk498_0,esk499_0,k4_subset_1(esk498_0,esk500_0,esk501_0),esk502_0) != k8_relset_2(esk498_0,esk499_0,esk501_0,esk502_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4r8enscd/lgb.p',i_0_3294) ).

cnf(i_0_3729,plain,
    r1_tarski(k1_xboole_0,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4r8enscd/lgb.p',i_0_3729) ).

cnf(i_0_4881,plain,
    m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4r8enscd/lgb.p',i_0_4881) ).

cnf(c_0_4892,plain,
    ( k3_tarski(k2_tarski(X1,X2)) = X2
    | ~ r1_tarski(X1,X2) ),
    i_0_1792 ).

cnf(c_0_4893,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_1408 ).

cnf(c_0_4894,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_3056 ).

cnf(c_0_4895,negated_conjecture,
    k4_relset_2(k1_zfmisc_1(esk498_0),esk499_0,k6_relset_2(esk499_0,esk498_0,esk502_0),k8_eqrel_1(esk500_0,k6_relat_1(esk500_0))) = k1_xboole_0,
    i_0_3295 ).

cnf(c_0_4896,negated_conjecture,
    m1_subset_1(esk502_0,k1_zfmisc_1(k2_zfmisc_1(esk498_0,esk499_0))),
    i_0_3296 ).

cnf(c_0_4897,negated_conjecture,
    m1_subset_1(esk500_0,k1_zfmisc_1(esk498_0)),
    i_0_3298 ).

cnf(c_0_4898,plain,
    ( k4_subset_1(X1,X2,X3) = X3
    | ~ r1_tarski(X2,X3)
    | ~ m1_subset_1(X3,k1_zfmisc_1(X1))
    | ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
    inference(spm,[status(thm)],[c_0_4892,c_0_4893]) ).

cnf(c_0_4899,negated_conjecture,
    m1_subset_1(esk501_0,k1_zfmisc_1(esk498_0)),
    i_0_3297 ).

cnf(c_0_4900,negated_conjecture,
    k8_relset_2(esk498_0,esk499_0,k4_subset_1(esk498_0,esk500_0,esk501_0),esk502_0) != k8_relset_2(esk498_0,esk499_0,esk501_0,esk502_0),
    i_0_3294 ).

cnf(c_0_4901,negated_conjecture,
    esk500_0 = k1_xboole_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4894,c_0_4895]),c_0_4896]),c_0_4897])]) ).

cnf(c_0_4902,negated_conjecture,
    ( k4_subset_1(esk498_0,X1,esk501_0) = esk501_0
    | ~ r1_tarski(X1,esk501_0)
    | ~ m1_subset_1(X1,k1_zfmisc_1(esk498_0)) ),
    inference(spm,[status(thm)],[c_0_4898,c_0_4899]) ).

cnf(c_0_4903,plain,
    r1_tarski(k1_xboole_0,X1),
    i_0_3729 ).

cnf(c_0_4904,plain,
    m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
    i_0_4881 ).

cnf(c_0_4905,negated_conjecture,
    k8_relset_2(esk498_0,esk499_0,k4_subset_1(esk498_0,k1_xboole_0,esk501_0),esk502_0) != k8_relset_2(esk498_0,esk499_0,esk501_0,esk502_0),
    inference(rw,[status(thm)],[c_0_4900,c_0_4901]) ).

cnf(c_0_4906,plain,
    k4_subset_1(esk498_0,k1_xboole_0,esk501_0) = esk501_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4902,c_0_4903]),c_0_4904])]) ).

cnf(c_0_4907,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4905,c_0_4906])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU427+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 : n006.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 02:21:39 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 2.96/3.16  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.96/3.16  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 2.96/3.16  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 2.96/3.16  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 14.29/7.67  # ENIGMATIC: Solved by autoschedule-lgb:
% 14.29/7.67  # No SInE strategy applied
% 14.29/7.67  # Trying AutoSched0 for 148 seconds
% 14.29/7.67  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 14.29/7.67  # and selection function SelectComplexExceptUniqMaxHorn.
% 14.29/7.67  #
% 14.29/7.67  # Preprocessing time       : 0.024 s
% 14.29/7.67  # Presaturation interreduction done
% 14.29/7.67  
% 14.29/7.67  # Proof found!
% 14.29/7.67  # SZS status Theorem
% 14.29/7.67  # SZS output start CNFRefutation
% See solution above
% 14.29/7.67  # Training examples: 0 positive, 0 negative
% 14.29/7.67  
% 14.29/7.67  # -------------------------------------------------
% 14.29/7.67  # User time                : 0.028 s
% 14.29/7.67  # System time              : 0.009 s
% 14.29/7.67  # Total time               : 0.037 s
% 14.29/7.67  # Maximum resident set size: 7128 pages
% 14.29/7.67  
%------------------------------------------------------------------------------