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

% Computer : n018.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:47 EDT 2022

% Result   : Theorem 7.45s 2.38s
% Output   : CNFRefutation 7.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   39 (  17 unt;   7 nHn;  39 RR)
%            Number of literals    :   75 (   7 equ;  34 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   32 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_49,plain,
    ( empty(X1)
    | in(X2,X1)
    | ~ element(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48hlou38/lgb.p',i_0_49) ).

cnf(i_0_79,negated_conjecture,
    element(esk8_0,the_carrier(esk6_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48hlou38/lgb.p',i_0_79) ).

cnf(i_0_83,plain,
    ( X1 = empty_set
    | in(X2,X3)
    | in(X2,subset_complement(X1,X3))
    | ~ element(X2,X1)
    | ~ element(X3,powerset(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48hlou38/lgb.p',i_0_83) ).

cnf(i_0_58,plain,
    ( element(subset_complement(X1,X2),powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48hlou38/lgb.p',i_0_58) ).

cnf(i_0_80,negated_conjecture,
    element(esk7_0,powerset(the_carrier(esk6_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48hlou38/lgb.p',i_0_80) ).

cnf(i_0_52,plain,
    ( subset_complement(X1,subset_complement(X1,X2)) = X2
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48hlou38/lgb.p',i_0_52) ).

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

cnf(i_0_81,negated_conjecture,
    one_sorted_str(esk6_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48hlou38/lgb.p',i_0_81) ).

cnf(i_0_82,negated_conjecture,
    ~ empty_carrier(esk6_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48hlou38/lgb.p',i_0_82) ).

cnf(i_0_77,negated_conjecture,
    ( in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0))
    | ~ in(esk8_0,esk7_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48hlou38/lgb.p',i_0_77) ).

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

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

cnf(i_0_84,plain,
    ( ~ in(X1,X2)
    | ~ element(X2,powerset(X3))
    | ~ in(X1,subset_complement(X3,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48hlou38/lgb.p',i_0_84) ).

cnf(i_0_78,negated_conjecture,
    ( in(esk8_0,esk7_0)
    | ~ in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48hlou38/lgb.p',i_0_78) ).

cnf(c_0_99,plain,
    ( empty(X1)
    | in(X2,X1)
    | ~ element(X2,X1) ),
    i_0_49 ).

cnf(c_0_100,negated_conjecture,
    element(esk8_0,the_carrier(esk6_0)),
    i_0_79 ).

cnf(c_0_101,plain,
    ( X1 = empty_set
    | in(X2,X3)
    | in(X2,subset_complement(X1,X3))
    | ~ element(X2,X1)
    | ~ element(X3,powerset(X1)) ),
    i_0_83 ).

cnf(c_0_102,plain,
    ( element(subset_complement(X1,X2),powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    i_0_58 ).

cnf(c_0_103,negated_conjecture,
    element(esk7_0,powerset(the_carrier(esk6_0))),
    i_0_80 ).

cnf(c_0_104,plain,
    ( subset_complement(X1,subset_complement(X1,X2)) = X2
    | ~ element(X2,powerset(X1)) ),
    i_0_52 ).

cnf(c_0_105,plain,
    ( empty_carrier(X1)
    | ~ one_sorted_str(X1)
    | ~ empty(the_carrier(X1)) ),
    i_0_64 ).

cnf(c_0_106,negated_conjecture,
    ( empty(the_carrier(esk6_0))
    | in(esk8_0,the_carrier(esk6_0)) ),
    inference(spm,[status(thm)],[c_0_99,c_0_100]) ).

cnf(c_0_107,negated_conjecture,
    one_sorted_str(esk6_0),
    i_0_81 ).

cnf(c_0_108,negated_conjecture,
    ~ empty_carrier(esk6_0),
    i_0_82 ).

cnf(c_0_109,negated_conjecture,
    ( empty_set = the_carrier(esk6_0)
    | in(esk8_0,subset_complement(the_carrier(esk6_0),X1))
    | in(esk8_0,X1)
    | ~ element(X1,powerset(the_carrier(esk6_0))) ),
    inference(spm,[status(thm)],[c_0_101,c_0_100]) ).

cnf(c_0_110,negated_conjecture,
    element(subset_complement(the_carrier(esk6_0),esk7_0),powerset(the_carrier(esk6_0))),
    inference(spm,[status(thm)],[c_0_102,c_0_103]) ).

cnf(c_0_111,negated_conjecture,
    subset_complement(the_carrier(esk6_0),subset_complement(the_carrier(esk6_0),esk7_0)) = esk7_0,
    inference(spm,[status(thm)],[c_0_104,c_0_103]) ).

cnf(c_0_112,negated_conjecture,
    ( in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0))
    | ~ in(esk8_0,esk7_0) ),
    i_0_77 ).

cnf(c_0_113,plain,
    ( ~ empty(X1)
    | ~ in(X2,X1) ),
    i_0_76 ).

cnf(c_0_114,plain,
    in(esk8_0,the_carrier(esk6_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_107])]),c_0_108]) ).

cnf(c_0_115,plain,
    empty(empty_set),
    i_0_70 ).

cnf(c_0_116,negated_conjecture,
    ( empty_set = the_carrier(esk6_0)
    | in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0)) ),
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]),c_0_112]) ).

cnf(c_0_117,plain,
    ~ empty(the_carrier(esk6_0)),
    inference(spm,[status(thm)],[c_0_113,c_0_114]) ).

cnf(c_0_118,plain,
    ( ~ in(X1,X2)
    | ~ element(X2,powerset(X3))
    | ~ in(X1,subset_complement(X3,X2)) ),
    i_0_84 ).

cnf(c_0_119,negated_conjecture,
    ( in(esk8_0,esk7_0)
    | ~ in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0)) ),
    i_0_78 ).

cnf(c_0_120,plain,
    in(esk8_0,subset_complement(the_carrier(esk6_0),esk7_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_117]) ).

cnf(c_0_121,negated_conjecture,
    ( ~ in(X1,subset_complement(the_carrier(esk6_0),esk7_0))
    | ~ in(X1,esk7_0) ),
    inference(spm,[status(thm)],[c_0_118,c_0_103]) ).

cnf(c_0_122,negated_conjecture,
    in(esk8_0,esk7_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_120])]) ).

cnf(c_0_123,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_120])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU321+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n018.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 : Mon Jun 20 06:32:07 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected complete mode:
% 7.45/2.38  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.45/2.38  # No SInE strategy applied
% 7.45/2.38  # Trying AutoSched0 for 150 seconds
% 7.45/2.38  # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S2q
% 7.45/2.38  # and selection function SelectCQArNTNp.
% 7.45/2.38  #
% 7.45/2.38  # Preprocessing time       : 0.023 s
% 7.45/2.38  # Presaturation interreduction done
% 7.45/2.38  
% 7.45/2.38  # Proof found!
% 7.45/2.38  # SZS status Theorem
% 7.45/2.38  # SZS output start CNFRefutation
% See solution above
% 7.45/2.38  # Training examples: 0 positive, 0 negative
% 7.45/2.38  
% 7.45/2.38  # -------------------------------------------------
% 7.45/2.38  # User time                : 0.032 s
% 7.45/2.38  # System time              : 0.009 s
% 7.45/2.38  # Total time               : 0.041 s
% 7.45/2.38  # Maximum resident set size: 7120 pages
% 7.45/2.38  
%------------------------------------------------------------------------------