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

% Computer : n010.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:38:50 EDT 2022

% Result   : Theorem 9.47s 2.43s
% Output   : CNFRefutation 9.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   36 (  15 unt;   5 nHn;  26 RR)
%            Number of literals    :   65 (  18 equ;  29 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    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   57 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
    ( in(X1,X2)
    | X2 != powerset(X3)
    | ~ subset(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2ur_lvou/lgb.p',i_0_17) ).

cnf(i_0_88,lemma,
    subset(empty_set,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2ur_lvou/lgb.p',i_0_88) ).

cnf(i_0_65,lemma,
    ( subset(unordered_pair(X1,X1),X2)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2ur_lvou/lgb.p',i_0_65) ).

cnf(i_0_48,plain,
    ( X1 = X2
    | proper_subset(X1,X2)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2ur_lvou/lgb.p',i_0_48) ).

cnf(i_0_82,negated_conjecture,
    unordered_pair(empty_set,empty_set) != powerset(empty_set),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2ur_lvou/lgb.p',i_0_82) ).

cnf(i_0_105,lemma,
    ( ~ proper_subset(X1,X2)
    | ~ subset(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2ur_lvou/lgb.p',i_0_105) ).

cnf(i_0_18,plain,
    ( subset(X1,X2)
    | X3 != powerset(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2ur_lvou/lgb.p',i_0_18) ).

cnf(i_0_32,plain,
    ( subset(X1,X2)
    | in(esk6_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2ur_lvou/lgb.p',i_0_32) ).

cnf(i_0_91,lemma,
    ( set_difference(X1,X2) = empty_set
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2ur_lvou/lgb.p',i_0_91) ).

cnf(i_0_94,plain,
    set_difference(X1,empty_set) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2ur_lvou/lgb.p',i_0_94) ).

cnf(i_0_23,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2ur_lvou/lgb.p',i_0_23) ).

cnf(i_0_31,plain,
    ( subset(X1,X2)
    | ~ in(esk6_2(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2ur_lvou/lgb.p',i_0_31) ).

cnf(c_0_118,plain,
    ( in(X1,X2)
    | X2 != powerset(X3)
    | ~ subset(X1,X3) ),
    i_0_17 ).

cnf(c_0_119,plain,
    ( in(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    inference(er,[status(thm)],[c_0_118]) ).

cnf(c_0_120,lemma,
    subset(empty_set,X1),
    i_0_88 ).

cnf(c_0_121,lemma,
    ( subset(unordered_pair(X1,X1),X2)
    | ~ in(X1,X2) ),
    i_0_65 ).

cnf(c_0_122,lemma,
    in(empty_set,powerset(X1)),
    inference(spm,[status(thm)],[c_0_119,c_0_120]) ).

cnf(c_0_123,plain,
    ( X1 = X2
    | proper_subset(X1,X2)
    | ~ subset(X1,X2) ),
    i_0_48 ).

cnf(c_0_124,lemma,
    subset(unordered_pair(empty_set,empty_set),powerset(X1)),
    inference(spm,[status(thm)],[c_0_121,c_0_122]) ).

cnf(c_0_125,negated_conjecture,
    unordered_pair(empty_set,empty_set) != powerset(empty_set),
    i_0_82 ).

cnf(c_0_126,plain,
    ( powerset(X1) = unordered_pair(empty_set,empty_set)
    | proper_subset(unordered_pair(empty_set,empty_set),powerset(X1)) ),
    inference(spm,[status(thm)],[c_0_123,c_0_124]) ).

cnf(c_0_127,lemma,
    ( ~ proper_subset(X1,X2)
    | ~ subset(X2,X1) ),
    i_0_105 ).

cnf(c_0_128,negated_conjecture,
    proper_subset(unordered_pair(empty_set,empty_set),powerset(empty_set)),
    inference(spm,[status(thm)],[c_0_125,c_0_126]) ).

cnf(c_0_129,plain,
    ( subset(X1,X2)
    | X3 != powerset(X2)
    | ~ in(X1,X3) ),
    i_0_18 ).

cnf(c_0_130,lemma,
    ~ subset(powerset(empty_set),unordered_pair(empty_set,empty_set)),
    inference(spm,[status(thm)],[c_0_127,c_0_128]) ).

cnf(c_0_131,plain,
    ( subset(X1,X2)
    | in(esk6_2(X1,X2),X1) ),
    i_0_32 ).

cnf(c_0_132,plain,
    ( subset(X1,X2)
    | ~ in(X1,powerset(X2)) ),
    inference(er,[status(thm)],[c_0_129]) ).

cnf(c_0_133,plain,
    in(esk6_2(powerset(empty_set),unordered_pair(empty_set,empty_set)),powerset(empty_set)),
    inference(spm,[status(thm)],[c_0_130,c_0_131]) ).

cnf(c_0_134,lemma,
    ( set_difference(X1,X2) = empty_set
    | ~ subset(X1,X2) ),
    i_0_91 ).

cnf(c_0_135,plain,
    subset(esk6_2(powerset(empty_set),unordered_pair(empty_set,empty_set)),empty_set),
    inference(spm,[status(thm)],[c_0_132,c_0_133]) ).

cnf(c_0_136,plain,
    set_difference(X1,empty_set) = X1,
    i_0_94 ).

cnf(c_0_137,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    i_0_23 ).

cnf(c_0_138,plain,
    ( subset(X1,X2)
    | ~ in(esk6_2(X1,X2),X2) ),
    i_0_31 ).

cnf(c_0_139,lemma,
    esk6_2(powerset(empty_set),unordered_pair(empty_set,empty_set)) = empty_set,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]) ).

cnf(c_0_140,plain,
    in(X1,unordered_pair(X1,X2)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_137])]) ).

cnf(c_0_141,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140])]),c_0_130]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU147+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n010.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jun 20 04:54:24 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 9.47/2.43  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.47/2.43  # No SInE strategy applied
% 9.47/2.43  # Trying AutoSched0 for 150 seconds
% 9.47/2.43  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S006A
% 9.47/2.43  # and selection function SelectLargestNegLit.
% 9.47/2.43  #
% 9.47/2.43  # Preprocessing time       : 0.024 s
% 9.47/2.43  # Presaturation interreduction done
% 9.47/2.43  
% 9.47/2.43  # Proof found!
% 9.47/2.43  # SZS status Theorem
% 9.47/2.43  # SZS output start CNFRefutation
% See solution above
% 9.47/2.43  # Training examples: 0 positive, 0 negative
% 9.47/2.43  
% 9.47/2.43  # -------------------------------------------------
% 9.47/2.43  # User time                : 0.087 s
% 9.47/2.43  # System time              : 0.004 s
% 9.47/2.43  # Total time               : 0.091 s
% 9.47/2.43  # Maximum resident set size: 7128 pages
% 9.47/2.43  
%------------------------------------------------------------------------------