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

% Computer : n019.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:15 EDT 2022

% Result   : Theorem 8.65s 2.45s
% Output   : CNFRefutation 8.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   34 (  20 unt;   0 nHn;  27 RR)
%            Number of literals    :   56 (   7 equ;  25 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   42 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_86,plain,
    ( set_union2(relation_dom(X1),relation_rng(X1)) = relation_field(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5w2guc3g/lgb.p',i_0_86) ).

cnf(i_0_197,negated_conjecture,
    relation(esk41_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5w2guc3g/lgb.p',i_0_197) ).

cnf(i_0_244,lemma,
    subset(X1,set_union2(X1,X2)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5w2guc3g/lgb.p',i_0_244) ).

cnf(i_0_184,lemma,
    ( in(X1,relation_dom(X2))
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1)),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5w2guc3g/lgb.p',i_0_184) ).

cnf(i_0_3,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5w2guc3g/lgb.p',i_0_3) ).

cnf(i_0_196,negated_conjecture,
    in(unordered_pair(unordered_pair(esk39_0,esk40_0),unordered_pair(esk39_0,esk39_0)),esk41_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5w2guc3g/lgb.p',i_0_196) ).

cnf(i_0_4,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5w2guc3g/lgb.p',i_0_4) ).

cnf(i_0_56,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5w2guc3g/lgb.p',i_0_56) ).

cnf(i_0_183,lemma,
    ( in(X1,relation_rng(X2))
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5w2guc3g/lgb.p',i_0_183) ).

cnf(i_0_195,negated_conjecture,
    ( ~ in(esk39_0,relation_field(esk41_0))
    | ~ in(esk40_0,relation_field(esk41_0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5w2guc3g/lgb.p',i_0_195) ).

cnf(c_0_255,plain,
    ( set_union2(relation_dom(X1),relation_rng(X1)) = relation_field(X1)
    | ~ relation(X1) ),
    i_0_86 ).

cnf(c_0_256,negated_conjecture,
    relation(esk41_0),
    i_0_197 ).

cnf(c_0_257,lemma,
    subset(X1,set_union2(X1,X2)),
    i_0_244 ).

cnf(c_0_258,negated_conjecture,
    set_union2(relation_dom(esk41_0),relation_rng(esk41_0)) = relation_field(esk41_0),
    inference(spm,[status(thm)],[c_0_255,c_0_256]) ).

cnf(c_0_259,lemma,
    ( in(X1,relation_dom(X2))
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1)),X2) ),
    i_0_184 ).

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

cnf(c_0_261,negated_conjecture,
    in(unordered_pair(unordered_pair(esk39_0,esk40_0),unordered_pair(esk39_0,esk39_0)),esk41_0),
    i_0_196 ).

cnf(c_0_262,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    i_0_4 ).

cnf(c_0_263,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_56 ).

cnf(c_0_264,lemma,
    subset(relation_dom(esk41_0),relation_field(esk41_0)),
    inference(spm,[status(thm)],[c_0_257,c_0_258]) ).

cnf(c_0_265,plain,
    ( in(X1,relation_dom(X2))
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_259,c_0_260]) ).

cnf(c_0_266,negated_conjecture,
    in(unordered_pair(unordered_pair(esk39_0,esk39_0),unordered_pair(esk39_0,esk40_0)),esk41_0),
    inference(rw,[status(thm)],[c_0_261,c_0_260]) ).

cnf(c_0_267,plain,
    subset(X1,set_union2(X2,X1)),
    inference(spm,[status(thm)],[c_0_257,c_0_262]) ).

cnf(c_0_268,lemma,
    ( in(X1,relation_rng(X2))
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),X2) ),
    i_0_183 ).

cnf(c_0_269,plain,
    ( in(X1,relation_field(esk41_0))
    | ~ in(X1,relation_dom(esk41_0)) ),
    inference(spm,[status(thm)],[c_0_263,c_0_264]) ).

cnf(c_0_270,negated_conjecture,
    in(esk39_0,relation_dom(esk41_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_265,c_0_266]),c_0_256])]) ).

cnf(c_0_271,plain,
    subset(relation_rng(esk41_0),relation_field(esk41_0)),
    inference(spm,[status(thm)],[c_0_267,c_0_258]) ).

cnf(c_0_272,plain,
    ( in(X1,relation_rng(X2))
    | ~ relation(X2)
    | ~ in(unordered_pair(unordered_pair(X3,X3),unordered_pair(X3,X1)),X2) ),
    inference(spm,[status(thm)],[c_0_268,c_0_260]) ).

cnf(c_0_273,negated_conjecture,
    ( ~ in(esk39_0,relation_field(esk41_0))
    | ~ in(esk40_0,relation_field(esk41_0)) ),
    i_0_195 ).

cnf(c_0_274,plain,
    in(esk39_0,relation_field(esk41_0)),
    inference(spm,[status(thm)],[c_0_269,c_0_270]) ).

cnf(c_0_275,plain,
    ( in(X1,relation_field(esk41_0))
    | ~ in(X1,relation_rng(esk41_0)) ),
    inference(spm,[status(thm)],[c_0_263,c_0_271]) ).

cnf(c_0_276,negated_conjecture,
    in(esk40_0,relation_rng(esk41_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_272,c_0_266]),c_0_256])]) ).

cnf(c_0_277,negated_conjecture,
    ~ in(esk40_0,relation_field(esk41_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_273,c_0_274])]) ).

cnf(c_0_278,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_275,c_0_276]),c_0_277]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU180+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n019.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jun 19 14:07:56 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 8.65/2.45  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.65/2.45  # No SInE strategy applied
% 8.65/2.45  # Trying AutoSched0 for 150 seconds
% 8.65/2.45  # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 8.65/2.45  # and selection function SelectComplexG.
% 8.65/2.45  #
% 8.65/2.45  # Preprocessing time       : 0.013 s
% 8.65/2.45  
% 8.65/2.45  # Proof found!
% 8.65/2.45  # SZS status Theorem
% 8.65/2.45  # SZS output start CNFRefutation
% See solution above
% 8.65/2.45  # Training examples: 0 positive, 0 negative
% 8.65/2.45  
% 8.65/2.45  # -------------------------------------------------
% 8.65/2.45  # User time                : 0.034 s
% 8.65/2.45  # System time              : 0.007 s
% 8.65/2.45  # Total time               : 0.041 s
% 8.65/2.45  # Maximum resident set size: 7124 pages
% 8.65/2.45  
%------------------------------------------------------------------------------