TSTP Solution File: SEU439+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n007.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:32 EDT 2022

% Result   : Theorem 15.85s 3.52s
% Output   : CNFRefutation 15.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   30 (  10 unt;   9 nHn;  22 RR)
%            Number of literals    :   86 (  10 equ;  51 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   5 con; 0-4 aty)
%            Number of variables   :   81 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
    ( r2_hidden(X1,X2)
    | X2 != k9_relat_1(X3,X4)
    | ~ v1_relat_1(X3)
    | ~ r2_hidden(X5,X4)
    | ~ r2_hidden(k2_tarski(k2_tarski(X5,X1),k1_tarski(X5)),X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fn6zgdpf/input.p',i_0_12) ).

cnf(i_0_87,plain,
    ( r2_hidden(k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),X3)
    | ~ v1_relat_1(X3)
    | ~ r2_hidden(X2,k9_relat_1(X3,k1_tarski(X1))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fn6zgdpf/input.p',i_0_87) ).

cnf(i_0_77,plain,
    ( r2_hidden(X1,k9_relat_1(X2,k1_tarski(X3)))
    | ~ r2_hidden(X3,X4)
    | ~ m1_subset_1(X4,k1_zfmisc_1(X5))
    | ~ m1_subset_1(X2,k1_zfmisc_1(k2_zfmisc_1(X5,X6)))
    | ~ r2_hidden(X1,k8_relset_2(X5,X6,X4,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fn6zgdpf/input.p',i_0_77) ).

cnf(i_0_18,plain,
    ( r1_tarski(X1,X2)
    | r2_hidden(esk9_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fn6zgdpf/input.p',i_0_18) ).

cnf(i_0_7,plain,
    ( v1_relat_1(X1)
    | ~ m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fn6zgdpf/input.p',i_0_7) ).

cnf(i_0_15,plain,
    ( X1 = k1_xboole_0
    | r2_hidden(esk8_1(X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fn6zgdpf/input.p',i_0_15) ).

cnf(i_0_17,plain,
    ( r1_tarski(X1,X2)
    | ~ r2_hidden(esk9_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fn6zgdpf/input.p',i_0_17) ).

cnf(i_0_1,negated_conjecture,
    ~ r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k9_relat_1(esk4_0,esk3_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fn6zgdpf/input.p',i_0_1) ).

cnf(i_0_3,negated_conjecture,
    m1_subset_1(esk4_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fn6zgdpf/input.p',i_0_3) ).

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

cnf(i_0_2,negated_conjecture,
    esk3_0 != k1_xboole_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fn6zgdpf/input.p',i_0_2) ).

cnf(c_0_99,plain,
    ( r2_hidden(X1,X2)
    | X2 != k9_relat_1(X3,X4)
    | ~ v1_relat_1(X3)
    | ~ r2_hidden(X5,X4)
    | ~ r2_hidden(k2_tarski(k2_tarski(X5,X1),k1_tarski(X5)),X3) ),
    i_0_12 ).

cnf(c_0_100,plain,
    ( r2_hidden(k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),X3)
    | ~ v1_relat_1(X3)
    | ~ r2_hidden(X2,k9_relat_1(X3,k1_tarski(X1))) ),
    i_0_87 ).

cnf(c_0_101,plain,
    ( r2_hidden(X1,k9_relat_1(X2,k1_tarski(X3)))
    | ~ r2_hidden(X3,X4)
    | ~ m1_subset_1(X4,k1_zfmisc_1(X5))
    | ~ m1_subset_1(X2,k1_zfmisc_1(k2_zfmisc_1(X5,X6)))
    | ~ r2_hidden(X1,k8_relset_2(X5,X6,X4,X2)) ),
    i_0_77 ).

cnf(c_0_102,plain,
    ( r1_tarski(X1,X2)
    | r2_hidden(esk9_2(X1,X2),X1) ),
    i_0_18 ).

cnf(c_0_103,plain,
    ( r2_hidden(X1,X2)
    | X2 != k9_relat_1(X3,X4)
    | ~ r2_hidden(X1,k9_relat_1(X3,k1_tarski(X5)))
    | ~ r2_hidden(X5,X4)
    | ~ v1_relat_1(X3) ),
    inference(spm,[status(thm)],[c_0_99,c_0_100]) ).

cnf(c_0_104,plain,
    ( r2_hidden(esk9_2(k8_relset_2(X1,X2,X3,X4),X5),k9_relat_1(X4,k1_tarski(X6)))
    | r1_tarski(k8_relset_2(X1,X2,X3,X4),X5)
    | ~ r2_hidden(X6,X3)
    | ~ m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
    | ~ m1_subset_1(X3,k1_zfmisc_1(X1)) ),
    inference(spm,[status(thm)],[c_0_101,c_0_102]) ).

cnf(c_0_105,plain,
    ( v1_relat_1(X1)
    | ~ m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))) ),
    i_0_7 ).

cnf(c_0_106,plain,
    ( r2_hidden(esk9_2(k8_relset_2(X1,X2,X3,X4),X5),X6)
    | r1_tarski(k8_relset_2(X1,X2,X3,X4),X5)
    | X6 != k9_relat_1(X4,X7)
    | ~ r2_hidden(X8,X7)
    | ~ r2_hidden(X8,X3)
    | ~ m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
    | ~ m1_subset_1(X3,k1_zfmisc_1(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105]) ).

cnf(c_0_107,plain,
    ( r2_hidden(esk9_2(k8_relset_2(X1,X2,X3,X4),X5),k9_relat_1(X4,X6))
    | r1_tarski(k8_relset_2(X1,X2,X3,X4),X5)
    | ~ r2_hidden(X7,X6)
    | ~ r2_hidden(X7,X3)
    | ~ m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
    | ~ m1_subset_1(X3,k1_zfmisc_1(X1)) ),
    inference(er,[status(thm)],[c_0_106]) ).

cnf(c_0_108,plain,
    ( X1 = k1_xboole_0
    | r2_hidden(esk8_1(X1),X1) ),
    i_0_15 ).

cnf(c_0_109,plain,
    ( r1_tarski(X1,X2)
    | ~ r2_hidden(esk9_2(X1,X2),X2) ),
    i_0_17 ).

cnf(c_0_110,plain,
    ( X1 = k1_xboole_0
    | r2_hidden(esk9_2(k8_relset_2(X2,X3,X4,X5),X6),k9_relat_1(X5,X1))
    | r1_tarski(k8_relset_2(X2,X3,X4,X5),X6)
    | ~ r2_hidden(esk8_1(X1),X4)
    | ~ m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
    | ~ m1_subset_1(X4,k1_zfmisc_1(X2)) ),
    inference(spm,[status(thm)],[c_0_107,c_0_108]) ).

cnf(c_0_111,negated_conjecture,
    ~ r1_tarski(k8_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k9_relat_1(esk4_0,esk3_0)),
    i_0_1 ).

cnf(c_0_112,plain,
    ( X1 = k1_xboole_0
    | r1_tarski(k8_relset_2(X2,X3,X4,X5),k9_relat_1(X5,X1))
    | ~ r2_hidden(esk8_1(X1),X4)
    | ~ m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
    | ~ m1_subset_1(X4,k1_zfmisc_1(X2)) ),
    inference(spm,[status(thm)],[c_0_109,c_0_110]) ).

cnf(c_0_113,negated_conjecture,
    m1_subset_1(esk4_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))),
    i_0_3 ).

cnf(c_0_114,negated_conjecture,
    m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
    i_0_4 ).

cnf(c_0_115,negated_conjecture,
    esk3_0 != k1_xboole_0,
    i_0_2 ).

cnf(c_0_116,negated_conjecture,
    ~ r2_hidden(esk8_1(esk3_0),esk3_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]),c_0_114])]),c_0_115]) ).

cnf(c_0_117,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_108]),c_0_115]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU439+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n007.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 22:52:16 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 15.85/3.52  # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 15.85/3.52  # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 49; version: 991; iters: 150)
% 15.85/3.52  # Preprocessing time       : 0.858 s
% 15.85/3.52  
% 15.85/3.52  # Proof found!
% 15.85/3.52  # SZS status Theorem
% 15.85/3.52  # SZS output start CNFRefutation
% See solution above
% 15.85/3.52  # Training examples: 0 positive, 0 negative
% 15.85/3.52  
% 15.85/3.52  # -------------------------------------------------
% 15.85/3.52  # User time                : 0.910 s
% 15.85/3.52  # System time              : 0.103 s
% 15.85/3.52  # Total time               : 1.013 s
% 15.85/3.52  # ...preprocessing         : 0.858 s
% 15.85/3.52  # ...main loop             : 0.155 s
% 15.85/3.52  # Maximum resident set size: 167308 pages
% 15.85/3.52  
%------------------------------------------------------------------------------