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

% Computer : n022.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:39:05 EDT 2022

% Result   : Theorem 19.69s 3.89s
% Output   : CNFRefutation 19.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   37 (   7 unt;   2 nHn;  31 RR)
%            Number of literals    :   85 (  11 equ;  48 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-4 aty)
%            Number of variables   :   93 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_96,lemma,
    ( in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),cartesian_product2(X3,X4))
    | ~ in(X2,X4)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e60mfqg3/input.p',i_0_96) ).

cnf(i_0_3,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e60mfqg3/input.p',i_0_3) ).

cnf(i_0_36,plain,
    ( unordered_pair(unordered_pair(esk6_4(X1,X2,X3,X4),esk7_4(X1,X2,X3,X4)),unordered_pair(esk6_4(X1,X2,X3,X4),esk6_4(X1,X2,X3,X4))) = X4
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e60mfqg3/input.p',i_0_36) ).

cnf(i_0_37,plain,
    ( in(esk7_4(X1,X2,X3,X4),X2)
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e60mfqg3/input.p',i_0_37) ).

cnf(i_0_41,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e60mfqg3/input.p',i_0_41) ).

cnf(i_0_108,negated_conjecture,
    subset(esk19_0,esk20_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e60mfqg3/input.p',i_0_108) ).

cnf(i_0_38,plain,
    ( in(esk6_4(X1,X2,X3,X4),X1)
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e60mfqg3/input.p',i_0_38) ).

cnf(i_0_39,plain,
    ( subset(X1,X2)
    | ~ in(esk11_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e60mfqg3/input.p',i_0_39) ).

cnf(i_0_40,plain,
    ( subset(X1,X2)
    | in(esk11_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e60mfqg3/input.p',i_0_40) ).

cnf(i_0_107,negated_conjecture,
    ( ~ subset(cartesian_product2(esk19_0,esk21_0),cartesian_product2(esk20_0,esk21_0))
    | ~ subset(cartesian_product2(esk21_0,esk19_0),cartesian_product2(esk21_0,esk20_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e60mfqg3/input.p',i_0_107) ).

cnf(c_0_119,lemma,
    ( in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),cartesian_product2(X3,X4))
    | ~ in(X2,X4)
    | ~ in(X1,X3) ),
    i_0_96 ).

cnf(c_0_120,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_3 ).

cnf(c_0_121,plain,
    ( unordered_pair(unordered_pair(esk6_4(X1,X2,X3,X4),esk7_4(X1,X2,X3,X4)),unordered_pair(esk6_4(X1,X2,X3,X4),esk6_4(X1,X2,X3,X4))) = X4
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    i_0_36 ).

cnf(c_0_122,plain,
    ( in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))
    | ~ in(X2,X4)
    | ~ in(X1,X3) ),
    inference(spm,[status(thm)],[c_0_119,c_0_120]) ).

cnf(c_0_123,plain,
    ( unordered_pair(unordered_pair(esk6_4(X1,X2,cartesian_product2(X1,X2),X3),esk6_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk6_4(X1,X2,cartesian_product2(X1,X2),X3),esk7_4(X1,X2,cartesian_product2(X1,X2),X3))) = X3
    | ~ in(X3,cartesian_product2(X1,X2)) ),
    inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_120])]) ).

cnf(c_0_124,plain,
    ( in(esk7_4(X1,X2,X3,X4),X2)
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    i_0_37 ).

cnf(c_0_125,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_41 ).

cnf(c_0_126,negated_conjecture,
    subset(esk19_0,esk20_0),
    i_0_108 ).

cnf(c_0_127,plain,
    ( in(X1,cartesian_product2(X2,X3))
    | ~ in(esk7_4(X4,X5,cartesian_product2(X4,X5),X1),X3)
    | ~ in(esk6_4(X4,X5,cartesian_product2(X4,X5),X1),X2)
    | ~ in(X1,cartesian_product2(X4,X5)) ),
    inference(spm,[status(thm)],[c_0_122,c_0_123]) ).

cnf(c_0_128,plain,
    ( in(esk7_4(X1,X2,cartesian_product2(X1,X2),X3),X2)
    | ~ in(X3,cartesian_product2(X1,X2)) ),
    inference(er,[status(thm)],[c_0_124]) ).

cnf(c_0_129,negated_conjecture,
    ( in(X1,esk20_0)
    | ~ in(X1,esk19_0) ),
    inference(spm,[status(thm)],[c_0_125,c_0_126]) ).

cnf(c_0_130,plain,
    ( in(X1,cartesian_product2(X2,X3))
    | ~ in(esk6_4(X4,X3,cartesian_product2(X4,X3),X1),X2)
    | ~ in(X1,cartesian_product2(X4,X3)) ),
    inference(spm,[status(thm)],[c_0_127,c_0_128]) ).

cnf(c_0_131,plain,
    ( in(esk6_4(X1,X2,X3,X4),X1)
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    i_0_38 ).

cnf(c_0_132,plain,
    ( in(X1,cartesian_product2(X2,esk20_0))
    | ~ in(esk7_4(X3,X4,cartesian_product2(X3,X4),X1),esk19_0)
    | ~ in(esk6_4(X3,X4,cartesian_product2(X3,X4),X1),X2)
    | ~ in(X1,cartesian_product2(X3,X4)) ),
    inference(spm,[status(thm)],[c_0_127,c_0_129]) ).

cnf(c_0_133,plain,
    ( in(X1,cartesian_product2(esk20_0,X2))
    | ~ in(esk6_4(X3,X2,cartesian_product2(X3,X2),X1),esk19_0)
    | ~ in(X1,cartesian_product2(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_130,c_0_129]) ).

cnf(c_0_134,plain,
    ( in(esk6_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
    | ~ in(X3,cartesian_product2(X1,X2)) ),
    inference(er,[status(thm)],[c_0_131]) ).

cnf(c_0_135,plain,
    ( in(X1,cartesian_product2(X2,esk20_0))
    | ~ in(esk6_4(X3,esk19_0,cartesian_product2(X3,esk19_0),X1),X2)
    | ~ in(X1,cartesian_product2(X3,esk19_0)) ),
    inference(spm,[status(thm)],[c_0_132,c_0_128]) ).

cnf(c_0_136,plain,
    ( subset(X1,X2)
    | ~ in(esk11_2(X1,X2),X2) ),
    i_0_39 ).

cnf(c_0_137,plain,
    ( in(X1,cartesian_product2(esk20_0,X2))
    | ~ in(X1,cartesian_product2(esk19_0,X2)) ),
    inference(spm,[status(thm)],[c_0_133,c_0_134]) ).

cnf(c_0_138,plain,
    ( in(X1,cartesian_product2(X2,esk20_0))
    | ~ in(X1,cartesian_product2(X2,esk19_0)) ),
    inference(spm,[status(thm)],[c_0_135,c_0_134]) ).

cnf(c_0_139,plain,
    ( subset(X1,cartesian_product2(esk20_0,X2))
    | ~ in(esk11_2(X1,cartesian_product2(esk20_0,X2)),cartesian_product2(esk19_0,X2)) ),
    inference(spm,[status(thm)],[c_0_136,c_0_137]) ).

cnf(c_0_140,plain,
    ( subset(X1,X2)
    | in(esk11_2(X1,X2),X1) ),
    i_0_40 ).

cnf(c_0_141,plain,
    ( subset(X1,cartesian_product2(X2,esk20_0))
    | ~ in(esk11_2(X1,cartesian_product2(X2,esk20_0)),cartesian_product2(X2,esk19_0)) ),
    inference(spm,[status(thm)],[c_0_136,c_0_138]) ).

cnf(c_0_142,negated_conjecture,
    ( ~ subset(cartesian_product2(esk19_0,esk21_0),cartesian_product2(esk20_0,esk21_0))
    | ~ subset(cartesian_product2(esk21_0,esk19_0),cartesian_product2(esk21_0,esk20_0)) ),
    i_0_107 ).

cnf(c_0_143,plain,
    subset(cartesian_product2(esk19_0,X1),cartesian_product2(esk20_0,X1)),
    inference(spm,[status(thm)],[c_0_139,c_0_140]) ).

cnf(c_0_144,plain,
    subset(cartesian_product2(X1,esk19_0),cartesian_product2(X1,esk20_0)),
    inference(spm,[status(thm)],[c_0_141,c_0_140]) ).

cnf(c_0_145,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_143])]),c_0_144])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU166+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jun 20 12:26:03 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 19.69/3.89  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 19.69/3.89  # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 28; version: 991; iters: 150)
% 19.69/3.89  # Preprocessing time       : 1.275 s
% 19.69/3.89  # Presaturation interreduction done
% 19.69/3.89  
% 19.69/3.89  # Proof found!
% 19.69/3.89  # SZS status Theorem
% 19.69/3.89  # SZS output start CNFRefutation
% See solution above
% 19.69/3.89  # Training examples: 0 positive, 0 negative
% 19.69/3.89  
% 19.69/3.89  # -------------------------------------------------
% 19.69/3.89  # User time                : 1.468 s
% 19.69/3.89  # System time              : 0.139 s
% 19.69/3.89  # Total time               : 1.607 s
% 19.69/3.89  # ...preprocessing         : 1.275 s
% 19.69/3.89  # ...main loop             : 0.332 s
% 19.69/3.89  # Maximum resident set size: 185948 pages
% 19.69/3.89  
%------------------------------------------------------------------------------