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

% Computer : n024.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 7.13s 2.25s
% Output   : CNFRefutation 7.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   39 (   8 unt;   2 nHn;  33 RR)
%            Number of literals    :   93 (  15 equ;  55 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-4 aty)
%            Number of variables   :  101 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    ( in(X1,X2)
    | X2 != cartesian_product2(X3,X4)
    | X1 != unordered_pair(unordered_pair(X5,X6),singleton(X5))
    | ~ in(X6,X4)
    | ~ in(X5,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hohyyhyj/lgb.p',i_0_7) ).

cnf(i_0_2,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hohyyhyj/lgb.p',i_0_2) ).

cnf(i_0_8,plain,
    ( unordered_pair(unordered_pair(esk1_4(X1,X2,X3,X4),esk2_4(X1,X2,X3,X4)),singleton(esk1_4(X1,X2,X3,X4))) = X4
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hohyyhyj/lgb.p',i_0_8) ).

cnf(i_0_9,plain,
    ( in(esk2_4(X1,X2,X3,X4),X2)
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hohyyhyj/lgb.p',i_0_9) ).

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

cnf(i_0_24,negated_conjecture,
    subset(esk9_0,esk10_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hohyyhyj/lgb.p',i_0_24) ).

cnf(i_0_10,plain,
    ( in(esk1_4(X1,X2,X3,X4),X1)
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hohyyhyj/lgb.p',i_0_10) ).

cnf(i_0_11,plain,
    ( subset(X1,X2)
    | ~ in(esk6_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hohyyhyj/lgb.p',i_0_11) ).

cnf(i_0_12,plain,
    ( subset(X1,X2)
    | in(esk6_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hohyyhyj/lgb.p',i_0_12) ).

cnf(i_0_23,negated_conjecture,
    ( ~ subset(cartesian_product2(esk9_0,esk11_0),cartesian_product2(esk10_0,esk11_0))
    | ~ subset(cartesian_product2(esk11_0,esk9_0),cartesian_product2(esk11_0,esk10_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hohyyhyj/lgb.p',i_0_23) ).

cnf(c_0_35,plain,
    ( in(X1,X2)
    | X2 != cartesian_product2(X3,X4)
    | X1 != unordered_pair(unordered_pair(X5,X6),singleton(X5))
    | ~ in(X6,X4)
    | ~ in(X5,X3) ),
    i_0_7 ).

cnf(c_0_36,plain,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
    | ~ in(X2,X4)
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_35])]) ).

cnf(c_0_37,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_2 ).

cnf(c_0_38,plain,
    ( unordered_pair(unordered_pair(esk1_4(X1,X2,X3,X4),esk2_4(X1,X2,X3,X4)),singleton(esk1_4(X1,X2,X3,X4))) = X4
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    i_0_8 ).

cnf(c_0_39,plain,
    ( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))
    | ~ in(X2,X4)
    | ~ in(X1,X3) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_40,plain,
    ( unordered_pair(singleton(esk1_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),esk2_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_38,c_0_37])]) ).

cnf(c_0_41,plain,
    ( in(esk2_4(X1,X2,X3,X4),X2)
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    i_0_9 ).

cnf(c_0_42,plain,
    ( in(X1,cartesian_product2(X2,X3))
    | ~ in(esk2_4(X4,X5,cartesian_product2(X4,X5),X1),X3)
    | ~ in(esk1_4(X4,X5,cartesian_product2(X4,X5),X1),X2)
    | ~ in(X1,cartesian_product2(X4,X5)) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_43,plain,
    ( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X2)
    | ~ in(X3,cartesian_product2(X1,X2)) ),
    inference(er,[status(thm)],[c_0_41]) ).

cnf(c_0_44,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_13 ).

cnf(c_0_45,negated_conjecture,
    subset(esk9_0,esk10_0),
    i_0_24 ).

cnf(c_0_46,plain,
    ( in(X1,cartesian_product2(X2,X3))
    | ~ in(esk1_4(X4,X3,cartesian_product2(X4,X3),X1),X2)
    | ~ in(X1,cartesian_product2(X4,X3)) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_47,negated_conjecture,
    ( in(X1,esk10_0)
    | ~ in(X1,esk9_0) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_48,plain,
    ( in(esk1_4(X1,X2,X3,X4),X1)
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    i_0_10 ).

cnf(c_0_49,negated_conjecture,
    ( in(X1,cartesian_product2(esk10_0,X2))
    | ~ in(esk1_4(X3,X2,cartesian_product2(X3,X2),X1),esk9_0)
    | ~ in(X1,cartesian_product2(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_50,plain,
    ( in(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
    | ~ in(X3,cartesian_product2(X1,X2)) ),
    inference(er,[status(thm)],[c_0_48]) ).

cnf(c_0_51,negated_conjecture,
    ( in(X1,cartesian_product2(X2,esk10_0))
    | ~ in(esk2_4(X3,X4,cartesian_product2(X3,X4),X1),esk9_0)
    | ~ in(esk1_4(X3,X4,cartesian_product2(X3,X4),X1),X2)
    | ~ in(X1,cartesian_product2(X3,X4)) ),
    inference(spm,[status(thm)],[c_0_42,c_0_47]) ).

cnf(c_0_52,plain,
    ( subset(X1,X2)
    | ~ in(esk6_2(X1,X2),X2) ),
    i_0_11 ).

cnf(c_0_53,plain,
    ( in(X1,cartesian_product2(esk10_0,X2))
    | ~ in(X1,cartesian_product2(esk9_0,X2)) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_54,plain,
    ( in(X1,cartesian_product2(X2,esk10_0))
    | ~ in(esk1_4(X3,esk9_0,cartesian_product2(X3,esk9_0),X1),X2)
    | ~ in(X1,cartesian_product2(X3,esk9_0)) ),
    inference(spm,[status(thm)],[c_0_51,c_0_43]) ).

cnf(c_0_55,plain,
    ( subset(X1,cartesian_product2(esk10_0,X2))
    | ~ in(esk6_2(X1,cartesian_product2(esk10_0,X2)),cartesian_product2(esk9_0,X2)) ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_56,plain,
    ( subset(X1,X2)
    | in(esk6_2(X1,X2),X1) ),
    i_0_12 ).

cnf(c_0_57,plain,
    ( in(X1,cartesian_product2(X2,esk10_0))
    | ~ in(X1,cartesian_product2(X2,esk9_0)) ),
    inference(spm,[status(thm)],[c_0_54,c_0_50]) ).

cnf(c_0_58,negated_conjecture,
    ( ~ subset(cartesian_product2(esk9_0,esk11_0),cartesian_product2(esk10_0,esk11_0))
    | ~ subset(cartesian_product2(esk11_0,esk9_0),cartesian_product2(esk11_0,esk10_0)) ),
    i_0_23 ).

cnf(c_0_59,plain,
    subset(cartesian_product2(esk9_0,X1),cartesian_product2(esk10_0,X1)),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_60,plain,
    ( subset(X1,cartesian_product2(X2,esk10_0))
    | ~ in(esk6_2(X1,cartesian_product2(X2,esk10_0)),cartesian_product2(X2,esk9_0)) ),
    inference(spm,[status(thm)],[c_0_52,c_0_57]) ).

cnf(c_0_61,negated_conjecture,
    ~ subset(cartesian_product2(esk11_0,esk9_0),cartesian_product2(esk11_0,esk10_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).

cnf(c_0_62,plain,
    subset(cartesian_product2(X1,esk9_0),cartesian_product2(X1,esk10_0)),
    inference(spm,[status(thm)],[c_0_60,c_0_56]) ).

cnf(c_0_63,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU166+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n024.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 06:06:49 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.13/2.25  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.13/2.25  # No SInE strategy applied
% 7.13/2.25  # Trying AutoSched0 for 150 seconds
% 7.13/2.25  # AutoSched0-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y
% 7.13/2.25  # and selection function SelectMaxLComplexAPPNTNp.
% 7.13/2.25  #
% 7.13/2.25  # Preprocessing time       : 0.023 s
% 7.13/2.25  
% 7.13/2.25  # Proof found!
% 7.13/2.25  # SZS status Theorem
% 7.13/2.25  # SZS output start CNFRefutation
% See solution above
% 7.13/2.25  # Training examples: 0 positive, 0 negative
% 7.13/2.25  
% 7.13/2.25  # -------------------------------------------------
% 7.13/2.25  # User time                : 0.025 s
% 7.13/2.25  # System time              : 0.008 s
% 7.13/2.25  # Total time               : 0.033 s
% 7.13/2.25  # Maximum resident set size: 7124 pages
% 7.13/2.25  
%------------------------------------------------------------------------------