%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET947+1 : TPTP v8.1.0. Released v3.2.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 00:15:27 EDT 2022

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

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

cnf(i_0_6,plain,
    ( subset(X1,X2)
    | ~ in(esk2_2(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_wiwfcoc/lgb.p',i_0_6) ).

cnf(i_0_9,plain,
    ( subset(X1,union(X2))
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_wiwfcoc/lgb.p',i_0_9) ).

cnf(i_0_7,plain,
    ( subset(X1,X2)
    | in(esk2_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_wiwfcoc/lgb.p',i_0_7) ).

cnf(i_0_13,negated_conjecture,
    ~ subset(esk5_0,powerset(union(esk5_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_wiwfcoc/lgb.p',i_0_13) ).

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

cnf(c_0_20,plain,
    ( subset(X1,X2)
    | ~ in(esk2_2(X1,X2),X2) ),
    i_0_6 ).

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

cnf(c_0_22,plain,
    ( subset(X1,powerset(X2))
    | ~ subset(esk2_2(X1,powerset(X2)),X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_23,plain,
    ( subset(X1,union(X2))
    | ~ in(X1,X2) ),
    i_0_9 ).

cnf(c_0_24,plain,
    ( subset(X1,powerset(union(X2)))
    | ~ in(esk2_2(X1,powerset(union(X2))),X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_25,plain,
    ( subset(X1,X2)
    | in(esk2_2(X1,X2),X1) ),
    i_0_7 ).

cnf(c_0_26,negated_conjecture,
    ~ subset(esk5_0,powerset(union(esk5_0))),
    i_0_13 ).

cnf(c_0_27,plain,
    subset(X1,powerset(union(X1))),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET947+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n013.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 Jul 11 01:10:46 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 8.65/2.47  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.65/2.47  # No SInE strategy applied
% 8.65/2.47  # Trying AutoSched0 for 150 seconds
% 8.65/2.47  # AutoSched0-Mode selected heuristic G_____0010_evo
% 8.65/2.47  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.65/2.47  #
% 8.65/2.47  # Preprocessing time       : 0.022 s
% 8.65/2.47  
% 8.65/2.47  # Proof found!
% 8.65/2.47  # SZS status Theorem
% 8.65/2.47  # SZS output start CNFRefutation
% See solution above
% 8.65/2.47  # Training examples: 0 positive, 0 negative
% 8.65/2.47  
% 8.65/2.47  # -------------------------------------------------
% 8.65/2.47  # User time                : 0.027 s
% 8.65/2.47  # System time              : 0.002 s
% 8.65/2.47  # Total time               : 0.029 s
% 8.65/2.47  # Maximum resident set size: 7128 pages
% 8.65/2.47  
%------------------------------------------------------------------------------