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

% Computer : n022.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:10 EDT 2022

% Result   : Theorem 7.34s 2.49s
% Output   : CNFRefutation 7.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (   8 unt;   0 nHn;  14 RR)
%            Number of literals    :   22 (   5 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   16 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_62,plain,
    ( X1 != set_difference(X2,X3)
    | ~ in(X4,X1)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qp0hxasl/lgb.p',i_0_62) ).

cnf(i_0_64,plain,
    ( subset_complement(X1,X2) = set_difference(X1,X2)
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qp0hxasl/lgb.p',i_0_64) ).

cnf(i_0_173,negated_conjecture,
    element(esk28_0,powerset(esk26_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qp0hxasl/lgb.p',i_0_173) ).

cnf(i_0_172,negated_conjecture,
    in(esk27_0,subset_complement(esk26_0,esk28_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qp0hxasl/lgb.p',i_0_172) ).

cnf(i_0_171,negated_conjecture,
    in(esk27_0,esk28_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qp0hxasl/lgb.p',i_0_171) ).

cnf(c_0_179,plain,
    ( X1 != set_difference(X2,X3)
    | ~ in(X4,X1)
    | ~ in(X4,X3) ),
    i_0_62 ).

cnf(c_0_180,plain,
    ( subset_complement(X1,X2) = set_difference(X1,X2)
    | ~ element(X2,powerset(X1)) ),
    i_0_64 ).

cnf(c_0_181,negated_conjecture,
    element(esk28_0,powerset(esk26_0)),
    i_0_173 ).

cnf(c_0_182,plain,
    ( ~ in(X1,set_difference(X2,X3))
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[c_0_179]) ).

cnf(c_0_183,negated_conjecture,
    set_difference(esk26_0,esk28_0) = subset_complement(esk26_0,esk28_0),
    inference(spm,[status(thm)],[c_0_180,c_0_181]) ).

cnf(c_0_184,plain,
    ( ~ in(X1,subset_complement(esk26_0,esk28_0))
    | ~ in(X1,esk28_0) ),
    inference(spm,[status(thm)],[c_0_182,c_0_183]) ).

cnf(c_0_185,negated_conjecture,
    in(esk27_0,subset_complement(esk26_0,esk28_0)),
    i_0_172 ).

cnf(c_0_186,negated_conjecture,
    in(esk27_0,esk28_0),
    i_0_171 ).

cnf(c_0_187,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_184,c_0_185]),c_0_186])]),
    [proof] ).

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