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

% Computer : n013.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:40:49 EDT 2022

% Result   : Theorem 8.26s 2.48s
% Output   : CNFRefutation 8.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   48 (  27 unt;   2 nHn;  40 RR)
%            Number of literals    :   84 (  17 equ;  44 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   3 con; 0-3 aty)
%            Number of variables   :   50 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_96,plain,
    ( X1 = empty_set
    | ~ empty(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_96) ).

cnf(i_0_77,plain,
    empty(esk8_1(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_77) ).

cnf(i_0_83,plain,
    ( union_of_subsets(X1,X2) = union(X2)
    | ~ element(X2,powerset(powerset(X1))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_83) ).

cnf(i_0_49,plain,
    ( union_of_subsets(the_carrier(X1),X2) = cast_as_carrier_subset(X1)
    | ~ one_sorted_str(X1)
    | ~ is_a_cover_of_carrier(X1,X2)
    | ~ element(X2,powerset(powerset(the_carrier(X1)))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_49) ).

cnf(i_0_93,negated_conjecture,
    element(esk12_0,powerset(powerset(the_carrier(esk11_0)))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_93) ).

cnf(i_0_91,negated_conjecture,
    esk12_0 = empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_91) ).

cnf(i_0_92,negated_conjecture,
    is_a_cover_of_carrier(esk11_0,esk12_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_92) ).

cnf(i_0_78,plain,
    element(esk8_1(X1),powerset(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_78) ).

cnf(i_0_94,negated_conjecture,
    one_sorted_str(esk11_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_94) ).

cnf(i_0_90,plain,
    ( ~ empty(X1)
    | ~ in(X2,X3)
    | ~ element(X3,powerset(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_90) ).

cnf(i_0_41,plain,
    ( cast_as_carrier_subset(X1) = the_carrier(X1)
    | ~ one_sorted_str(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_41) ).

cnf(i_0_46,plain,
    ( in(esk1_3(X1,X2,X3),X1)
    | X2 != union(X1)
    | ~ in(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_46) ).

cnf(i_0_95,negated_conjecture,
    ~ empty_carrier(esk11_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_95) ).

cnf(i_0_60,plain,
    ( empty_carrier(X1)
    | ~ one_sorted_str(X1)
    | ~ empty(the_carrier(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_60) ).

cnf(i_0_86,plain,
    ( empty(X1)
    | in(X2,X1)
    | ~ element(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_86) ).

cnf(i_0_59,plain,
    element(esk5_1(X1),X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_59) ).

cnf(i_0_68,plain,
    empty(empty_set),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ieiautkc/lgb.p',i_0_68) ).

cnf(c_0_114,plain,
    ( X1 = empty_set
    | ~ empty(X1) ),
    i_0_96 ).

cnf(c_0_115,plain,
    empty(esk8_1(X1)),
    i_0_77 ).

cnf(c_0_116,plain,
    ( union_of_subsets(X1,X2) = union(X2)
    | ~ element(X2,powerset(powerset(X1))) ),
    i_0_83 ).

cnf(c_0_117,plain,
    ( union_of_subsets(the_carrier(X1),X2) = cast_as_carrier_subset(X1)
    | ~ one_sorted_str(X1)
    | ~ is_a_cover_of_carrier(X1,X2)
    | ~ element(X2,powerset(powerset(the_carrier(X1)))) ),
    i_0_49 ).

cnf(c_0_118,negated_conjecture,
    element(esk12_0,powerset(powerset(the_carrier(esk11_0)))),
    i_0_93 ).

cnf(c_0_119,negated_conjecture,
    esk12_0 = empty_set,
    i_0_91 ).

cnf(c_0_120,negated_conjecture,
    is_a_cover_of_carrier(esk11_0,esk12_0),
    i_0_92 ).

cnf(c_0_121,plain,
    element(esk8_1(X1),powerset(X1)),
    i_0_78 ).

cnf(c_0_122,plain,
    esk8_1(X1) = empty_set,
    inference(spm,[status(thm)],[c_0_114,c_0_115]) ).

cnf(c_0_123,plain,
    ( cast_as_carrier_subset(X1) = union(X2)
    | ~ one_sorted_str(X1)
    | ~ is_a_cover_of_carrier(X1,X2)
    | ~ element(X2,powerset(powerset(the_carrier(X1)))) ),
    inference(spm,[status(thm)],[c_0_116,c_0_117]) ).

cnf(c_0_124,negated_conjecture,
    element(empty_set,powerset(powerset(the_carrier(esk11_0)))),
    inference(rw,[status(thm)],[c_0_118,c_0_119]) ).

cnf(c_0_125,negated_conjecture,
    one_sorted_str(esk11_0),
    i_0_94 ).

cnf(c_0_126,negated_conjecture,
    is_a_cover_of_carrier(esk11_0,empty_set),
    inference(rw,[status(thm)],[c_0_120,c_0_119]) ).

cnf(c_0_127,plain,
    ( ~ empty(X1)
    | ~ in(X2,X3)
    | ~ element(X3,powerset(X1)) ),
    i_0_90 ).

cnf(c_0_128,plain,
    element(empty_set,powerset(X1)),
    inference(rw,[status(thm)],[c_0_121,c_0_122]) ).

cnf(c_0_129,plain,
    ( cast_as_carrier_subset(X1) = the_carrier(X1)
    | ~ one_sorted_str(X1) ),
    i_0_41 ).

cnf(c_0_130,negated_conjecture,
    cast_as_carrier_subset(esk11_0) = union(empty_set),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125]),c_0_126])]) ).

cnf(c_0_131,plain,
    ( ~ in(X1,empty_set)
    | ~ empty(X2) ),
    inference(spm,[status(thm)],[c_0_127,c_0_128]) ).

cnf(c_0_132,plain,
    ( in(esk1_3(X1,X2,X3),X1)
    | X2 != union(X1)
    | ~ in(X3,X2) ),
    i_0_46 ).

cnf(c_0_133,plain,
    union(empty_set) = the_carrier(esk11_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_125])]) ).

cnf(c_0_134,plain,
    ( X1 != the_carrier(esk11_0)
    | ~ in(X2,X1)
    | ~ empty(X3) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133]) ).

cnf(c_0_135,negated_conjecture,
    ~ empty_carrier(esk11_0),
    i_0_95 ).

cnf(c_0_136,plain,
    ( empty_carrier(X1)
    | ~ one_sorted_str(X1)
    | ~ empty(the_carrier(X1)) ),
    i_0_60 ).

cnf(c_0_137,plain,
    ( ~ in(X1,the_carrier(esk11_0))
    | ~ empty(X2) ),
    inference(er,[status(thm)],[c_0_134]) ).

cnf(c_0_138,plain,
    ( empty(X1)
    | in(X2,X1)
    | ~ element(X2,X1) ),
    i_0_86 ).

cnf(c_0_139,negated_conjecture,
    ~ empty(the_carrier(esk11_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_125])]) ).

cnf(c_0_140,plain,
    ( ~ empty(X1)
    | ~ element(X2,the_carrier(esk11_0)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_139]) ).

cnf(c_0_141,plain,
    element(esk5_1(X1),X1),
    i_0_59 ).

cnf(c_0_142,plain,
    empty(empty_set),
    i_0_68 ).

cnf(c_0_143,plain,
    ~ empty(X1),
    inference(spm,[status(thm)],[c_0_140,c_0_141]) ).

cnf(c_0_144,plain,
    $false,
    inference(sr,[status(thm)],[c_0_142,c_0_143]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU325+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n013.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jun 19 09:55:00 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  # ENIGMATIC: Selected complete mode:
% 8.26/2.48  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.26/2.48  # No SInE strategy applied
% 8.26/2.48  # Trying AutoSched0 for 150 seconds
% 8.26/2.48  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.26/2.48  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.26/2.48  #
% 8.26/2.48  # Preprocessing time       : 0.013 s
% 8.26/2.48  
% 8.26/2.48  # Proof found!
% 8.26/2.48  # SZS status Theorem
% 8.26/2.48  # SZS output start CNFRefutation
% See solution above
% 8.26/2.48  # Training examples: 0 positive, 0 negative
% 8.26/2.48  
% 8.26/2.48  # -------------------------------------------------
% 8.26/2.48  # User time                : 0.017 s
% 8.26/2.48  # System time              : 0.003 s
% 8.26/2.48  # Total time               : 0.020 s
% 8.26/2.48  # Maximum resident set size: 7124 pages
% 8.26/2.48  
%------------------------------------------------------------------------------