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

View Problem - Process Solution

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

% Computer : n017.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 10.72s 4.60s
% Output   : CNFRefutation 10.72s
% 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_2255,plain,
    ( k3_tarski(k2_tarski(X1,X2)) = X2
    | ~ r1_tarski(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q0jzpjlo/lgb.p',i_0_2255) ).

cnf(i_0_1928,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-q0jzpjlo/lgb.p',i_0_1928) ).

cnf(i_0_3126,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-q0jzpjlo/lgb.p',i_0_3126) ).

cnf(i_0_3324,negated_conjecture,
    k4_relset_2(k1_zfmisc_1(esk509_0),esk510_0,k6_relset_2(esk510_0,esk509_0,esk513_0),k8_eqrel_1(esk511_0,k6_relat_1(esk511_0))) = k1_xboole_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q0jzpjlo/lgb.p',i_0_3324) ).

cnf(i_0_3325,negated_conjecture,
    m1_subset_1(esk513_0,k1_zfmisc_1(k2_zfmisc_1(esk509_0,esk510_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q0jzpjlo/lgb.p',i_0_3325) ).

cnf(i_0_3327,negated_conjecture,
    m1_subset_1(esk511_0,k1_zfmisc_1(esk509_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q0jzpjlo/lgb.p',i_0_3327) ).

cnf(i_0_3326,negated_conjecture,
    m1_subset_1(esk512_0,k1_zfmisc_1(esk509_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q0jzpjlo/lgb.p',i_0_3326) ).

cnf(i_0_3323,negated_conjecture,
    k8_relset_2(esk509_0,esk510_0,k4_subset_1(esk509_0,esk511_0,esk512_0),esk513_0) != k8_relset_2(esk509_0,esk510_0,esk512_0,esk513_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q0jzpjlo/lgb.p',i_0_3323) ).

cnf(i_0_3622,plain,
    r1_tarski(k1_xboole_0,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q0jzpjlo/lgb.p',i_0_3622) ).

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

cnf(c_0_4505,plain,
    ( k3_tarski(k2_tarski(X1,X2)) = X2
    | ~ r1_tarski(X1,X2) ),
    i_0_2255 ).

cnf(c_0_4506,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_1928 ).

cnf(c_0_4507,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_3126 ).

cnf(c_0_4508,negated_conjecture,
    k4_relset_2(k1_zfmisc_1(esk509_0),esk510_0,k6_relset_2(esk510_0,esk509_0,esk513_0),k8_eqrel_1(esk511_0,k6_relat_1(esk511_0))) = k1_xboole_0,
    i_0_3324 ).

cnf(c_0_4509,negated_conjecture,
    m1_subset_1(esk513_0,k1_zfmisc_1(k2_zfmisc_1(esk509_0,esk510_0))),
    i_0_3325 ).

cnf(c_0_4510,negated_conjecture,
    m1_subset_1(esk511_0,k1_zfmisc_1(esk509_0)),
    i_0_3327 ).

cnf(c_0_4511,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_4505,c_0_4506]) ).

cnf(c_0_4512,negated_conjecture,
    m1_subset_1(esk512_0,k1_zfmisc_1(esk509_0)),
    i_0_3326 ).

cnf(c_0_4513,negated_conjecture,
    k8_relset_2(esk509_0,esk510_0,k4_subset_1(esk509_0,esk511_0,esk512_0),esk513_0) != k8_relset_2(esk509_0,esk510_0,esk512_0,esk513_0),
    i_0_3323 ).

cnf(c_0_4514,negated_conjecture,
    esk511_0 = k1_xboole_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4507,c_0_4508]),c_0_4509]),c_0_4510])]) ).

cnf(c_0_4515,negated_conjecture,
    ( k4_subset_1(esk509_0,X1,esk512_0) = esk512_0
    | ~ r1_tarski(X1,esk512_0)
    | ~ m1_subset_1(X1,k1_zfmisc_1(esk509_0)) ),
    inference(spm,[status(thm)],[c_0_4511,c_0_4512]) ).

cnf(c_0_4516,plain,
    r1_tarski(k1_xboole_0,X1),
    i_0_3622 ).

cnf(c_0_4517,plain,
    m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
    i_0_4494 ).

cnf(c_0_4518,negated_conjecture,
    k8_relset_2(esk509_0,esk510_0,k4_subset_1(esk509_0,k1_xboole_0,esk512_0),esk513_0) != k8_relset_2(esk509_0,esk510_0,esk512_0,esk513_0),
    inference(rw,[status(thm)],[c_0_4513,c_0_4514]) ).

cnf(c_0_4519,plain,
    k4_subset_1(esk509_0,k1_xboole_0,esk512_0) = esk512_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4515,c_0_4516]),c_0_4517])]) ).

cnf(c_0_4520,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4518,c_0_4519])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem  : SEU427+3 : TPTP v8.1.0. Released v3.4.0.
% 0.05/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n017.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Mon Jun 20 04:27:18 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.17/0.43  # ENIGMATIC: Selected SinE mode:
% 0.80/0.98  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.80/0.98  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.80/0.98  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.80/0.98  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 10.72/4.60  # ENIGMATIC: Solved by autoschedule-lgb:
% 10.72/4.60  # No SInE strategy applied
% 10.72/4.60  # Trying AutoSched0 for 149 seconds
% 10.72/4.60  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 10.72/4.60  # and selection function SelectComplexExceptUniqMaxHorn.
% 10.72/4.60  #
% 10.72/4.60  # Preprocessing time       : 0.023 s
% 10.72/4.60  # Presaturation interreduction done
% 10.72/4.60  
% 10.72/4.60  # Proof found!
% 10.72/4.60  # SZS status Theorem
% 10.72/4.60  # SZS output start CNFRefutation
% See solution above
% 10.72/4.60  # Training examples: 0 positive, 0 negative
% 10.72/4.60  
% 10.72/4.60  # -------------------------------------------------
% 10.72/4.60  # User time                : 0.029 s
% 10.72/4.60  # System time              : 0.006 s
% 10.72/4.60  # Total time               : 0.035 s
% 10.72/4.60  # Maximum resident set size: 7124 pages
% 10.72/4.60  
%------------------------------------------------------------------------------