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

% Computer : n029.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 00:15:23 EDT 2022

% Result   : Theorem 9.52s 2.63s
% Output   : CNFRefutation 9.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   34 (  12 unt;   6 nHn;  21 RR)
%            Number of literals    :   67 (   8 equ;  31 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   69 (   9 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
    ( in(X1,X2)
    | X2 != powerset(X3)
    | ~ subset(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3ezgou97/lgb.p',i_0_5) ).

cnf(i_0_22,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3ezgou97/lgb.p',i_0_22) ).

cnf(i_0_23,plain,
    subset(X1,set_union2(X1,X2)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3ezgou97/lgb.p',i_0_23) ).

cnf(i_0_2,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3ezgou97/lgb.p',i_0_2) ).

cnf(i_0_6,plain,
    ( subset(X1,X2)
    | X3 != powerset(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3ezgou97/lgb.p',i_0_6) ).

cnf(i_0_12,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | X4 != set_union2(X3,X2)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3ezgou97/lgb.p',i_0_12) ).

cnf(i_0_24,negated_conjecture,
    ~ subset(set_union2(powerset(esk6_0),powerset(esk7_0)),powerset(set_union2(esk6_0,esk7_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3ezgou97/lgb.p',i_0_24) ).

cnf(i_0_14,plain,
    ( subset(X1,X2)
    | in(esk3_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3ezgou97/lgb.p',i_0_14) ).

cnf(i_0_13,plain,
    ( subset(X1,X2)
    | ~ in(esk3_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3ezgou97/lgb.p',i_0_13) ).

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

cnf(c_0_35,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3) ),
    i_0_22 ).

cnf(c_0_36,plain,
    subset(X1,set_union2(X1,X2)),
    i_0_23 ).

cnf(c_0_37,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    i_0_2 ).

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

cnf(c_0_39,plain,
    ( subset(X1,set_union2(X2,X3))
    | ~ subset(X1,X2) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

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

cnf(c_0_41,plain,
    subset(X1,set_union2(X2,X1)),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | X4 != set_union2(X3,X2)
    | ~ in(X1,X4) ),
    i_0_12 ).

cnf(c_0_43,negated_conjecture,
    ~ subset(set_union2(powerset(esk6_0),powerset(esk7_0)),powerset(set_union2(esk6_0,esk7_0))),
    i_0_24 ).

cnf(c_0_44,plain,
    ( subset(X1,X2)
    | in(esk3_2(X1,X2),X1) ),
    i_0_14 ).

cnf(c_0_45,plain,
    ( subset(X1,X2)
    | ~ in(esk3_2(X1,X2),X2) ),
    i_0_13 ).

cnf(c_0_46,plain,
    ( in(X1,powerset(set_union2(X2,X3)))
    | ~ subset(X1,X2) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

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

cnf(c_0_48,plain,
    ( subset(X1,set_union2(X2,X3))
    | ~ subset(X1,X3) ),
    inference(spm,[status(thm)],[c_0_35,c_0_41]) ).

cnf(c_0_49,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | ~ in(X1,set_union2(X2,X3)) ),
    inference(er,[status(thm)],[c_0_42]) ).

cnf(c_0_50,plain,
    in(esk3_2(set_union2(powerset(esk6_0),powerset(esk7_0)),powerset(set_union2(esk6_0,esk7_0))),set_union2(powerset(esk6_0),powerset(esk7_0))),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_51,plain,
    ~ in(esk3_2(set_union2(powerset(esk6_0),powerset(esk7_0)),powerset(set_union2(esk6_0,esk7_0))),powerset(set_union2(esk6_0,esk7_0))),
    inference(spm,[status(thm)],[c_0_43,c_0_45]) ).

cnf(c_0_52,plain,
    ( in(X1,powerset(set_union2(X2,X3)))
    | ~ in(X1,powerset(X2)) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_53,plain,
    ( in(X1,powerset(set_union2(X2,X3)))
    | ~ subset(X1,X3) ),
    inference(spm,[status(thm)],[c_0_38,c_0_48]) ).

cnf(c_0_54,plain,
    ( in(esk3_2(set_union2(powerset(esk6_0),powerset(esk7_0)),powerset(set_union2(esk6_0,esk7_0))),powerset(esk6_0))
    | in(esk3_2(set_union2(powerset(esk6_0),powerset(esk7_0)),powerset(set_union2(esk6_0,esk7_0))),powerset(esk7_0)) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_55,plain,
    ~ in(esk3_2(set_union2(powerset(esk6_0),powerset(esk7_0)),powerset(set_union2(esk6_0,esk7_0))),powerset(esk6_0)),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_56,plain,
    ( in(X1,powerset(set_union2(X2,X3)))
    | ~ in(X1,powerset(X3)) ),
    inference(spm,[status(thm)],[c_0_53,c_0_47]) ).

cnf(c_0_57,plain,
    in(esk3_2(set_union2(powerset(esk6_0),powerset(esk7_0)),powerset(set_union2(esk6_0,esk7_0))),powerset(esk7_0)),
    inference(sr,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_58,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_56]),c_0_57])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET934+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n029.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 10:37:18 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected complete mode:
% 9.52/2.63  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.52/2.63  # No SInE strategy applied
% 9.52/2.63  # Trying AutoSched0 for 150 seconds
% 9.52/2.63  # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 9.52/2.63  # and selection function SelectMaxLComplexAvoidPosPred.
% 9.52/2.63  #
% 9.52/2.63  # Preprocessing time       : 0.023 s
% 9.52/2.63  # Presaturation interreduction done
% 9.52/2.63  
% 9.52/2.63  # Proof found!
% 9.52/2.63  # SZS status Theorem
% 9.52/2.63  # SZS output start CNFRefutation
% See solution above
% 9.52/2.63  # Training examples: 0 positive, 0 negative
% 9.52/2.63  
% 9.52/2.63  # -------------------------------------------------
% 9.52/2.63  # User time                : 0.094 s
% 9.52/2.63  # System time              : 0.010 s
% 9.52/2.63  # Total time               : 0.104 s
% 9.52/2.63  # Maximum resident set size: 7120 pages
% 9.52/2.63  
%------------------------------------------------------------------------------