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

% Computer : n014.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:34 EDT 2022

% Result   : Theorem 17.19s 3.58s
% Output   : CNFRefutation 17.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   30 (  12 unt;   2 nHn;  26 RR)
%            Number of literals    :   75 (  22 equ;  50 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   55 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_37,plain,
    ( in(X1,X2)
    | X2 != relation_inverse_image(X3,X4)
    | ~ relation(X3)
    | ~ in(X5,X4)
    | ~ in(unordered_pair(unordered_pair(X1,X5),unordered_pair(X1,X1)),X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ve5_hmtp/input.p',i_0_37) ).

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

cnf(i_0_121,plain,
    ( in(unordered_pair(unordered_pair(esk42_3(X1,X2,X3),X3),unordered_pair(esk42_3(X1,X2,X3),esk42_3(X1,X2,X3))),X1)
    | X2 != relation_rng(X1)
    | ~ relation(X1)
    | ~ in(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ve5_hmtp/input.p',i_0_121) ).

cnf(i_0_269,negated_conjecture,
    relation_inverse_image(esk64_0,esk63_0) = empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ve5_hmtp/input.p',i_0_269) ).

cnf(i_0_272,negated_conjecture,
    relation(esk64_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ve5_hmtp/input.p',i_0_272) ).

cnf(i_0_56,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ve5_hmtp/input.p',i_0_56) ).

cnf(i_0_55,plain,
    ( X1 = empty_set
    | in(esk20_1(X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ve5_hmtp/input.p',i_0_55) ).

cnf(i_0_271,negated_conjecture,
    esk63_0 != empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ve5_hmtp/input.p',i_0_271) ).

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

cnf(i_0_270,negated_conjecture,
    subset(esk63_0,relation_rng(esk64_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ve5_hmtp/input.p',i_0_270) ).

cnf(c_0_283,plain,
    ( in(X1,X2)
    | X2 != relation_inverse_image(X3,X4)
    | ~ relation(X3)
    | ~ in(X5,X4)
    | ~ in(unordered_pair(unordered_pair(X1,X5),unordered_pair(X1,X1)),X3) ),
    i_0_37 ).

cnf(c_0_284,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_4 ).

cnf(c_0_285,plain,
    ( in(unordered_pair(unordered_pair(esk42_3(X1,X2,X3),X3),unordered_pair(esk42_3(X1,X2,X3),esk42_3(X1,X2,X3))),X1)
    | X2 != relation_rng(X1)
    | ~ relation(X1)
    | ~ in(X3,X2) ),
    i_0_121 ).

cnf(c_0_286,plain,
    ( in(X1,X2)
    | X2 != relation_inverse_image(X3,X4)
    | ~ in(unordered_pair(unordered_pair(X5,X1),unordered_pair(X1,X1)),X3)
    | ~ in(X5,X4)
    | ~ relation(X3) ),
    inference(spm,[status(thm)],[c_0_283,c_0_284]) ).

cnf(c_0_287,plain,
    ( in(unordered_pair(unordered_pair(X1,esk42_3(X2,X3,X1)),unordered_pair(esk42_3(X2,X3,X1),esk42_3(X2,X3,X1))),X2)
    | X3 != relation_rng(X2)
    | ~ in(X1,X3)
    | ~ relation(X2) ),
    inference(rw,[status(thm)],[c_0_285,c_0_284]) ).

cnf(c_0_288,plain,
    ( in(esk42_3(X1,X2,X3),X4)
    | X4 != relation_inverse_image(X1,X5)
    | X2 != relation_rng(X1)
    | ~ in(X3,X5)
    | ~ in(X3,X2)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_286,c_0_287]) ).

cnf(c_0_289,plain,
    ( in(esk42_3(X1,X2,X3),relation_inverse_image(X1,X4))
    | X2 != relation_rng(X1)
    | ~ in(X3,X4)
    | ~ in(X3,X2)
    | ~ relation(X1) ),
    inference(er,[status(thm)],[c_0_288]) ).

cnf(c_0_290,negated_conjecture,
    relation_inverse_image(esk64_0,esk63_0) = empty_set,
    i_0_269 ).

cnf(c_0_291,negated_conjecture,
    relation(esk64_0),
    i_0_272 ).

cnf(c_0_292,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    i_0_56 ).

cnf(c_0_293,negated_conjecture,
    ( in(esk42_3(esk64_0,X1,X2),empty_set)
    | X1 != relation_rng(esk64_0)
    | ~ in(X2,esk63_0)
    | ~ in(X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_289,c_0_290]),c_0_291])]) ).

cnf(c_0_294,plain,
    ( X1 != relation_rng(esk64_0)
    | ~ in(X2,esk63_0)
    | ~ in(X2,X1) ),
    inference(spm,[status(thm)],[c_0_292,c_0_293]) ).

cnf(c_0_295,plain,
    ( X1 = empty_set
    | in(esk20_1(X1),X1) ),
    i_0_55 ).

cnf(c_0_296,negated_conjecture,
    esk63_0 != empty_set,
    i_0_271 ).

cnf(c_0_297,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_94 ).

cnf(c_0_298,negated_conjecture,
    subset(esk63_0,relation_rng(esk64_0)),
    i_0_270 ).

cnf(c_0_299,plain,
    ( X1 != relation_rng(esk64_0)
    | ~ in(esk20_1(esk63_0),X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_294,c_0_295]),c_0_296]) ).

cnf(c_0_300,negated_conjecture,
    ( in(X1,relation_rng(esk64_0))
    | ~ in(X1,esk63_0) ),
    inference(spm,[status(thm)],[c_0_297,c_0_298]) ).

cnf(c_0_301,negated_conjecture,
    ~ in(esk20_1(esk63_0),esk63_0),
    inference(spm,[status(thm)],[c_0_299,c_0_300]) ).

cnf(c_0_302,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_301,c_0_295]),c_0_296]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU210+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n014.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun Jun 19 03:04:05 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 17.19/3.58  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 17.19/3.58  # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 44; version: 991; iters: 150)
% 17.19/3.58  # Preprocessing time       : 1.152 s
% 17.19/3.58  
% 17.19/3.58  # Proof found!
% 17.19/3.58  # SZS status Theorem
% 17.19/3.58  # SZS output start CNFRefutation
% See solution above
% 17.19/3.58  # Training examples: 0 positive, 0 negative
% 17.19/3.58  
% 17.19/3.58  # -------------------------------------------------
% 17.19/3.58  # User time                : 1.052 s
% 17.19/3.58  # System time              : 0.132 s
% 17.19/3.58  # Total time               : 1.184 s
% 17.19/3.58  # ...preprocessing         : 1.152 s
% 17.19/3.58  # ...main loop             : 0.032 s
% 17.19/3.58  # Maximum resident set size: 177408 pages
% 17.19/3.58  
%------------------------------------------------------------------------------