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

% Computer : n003.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:45 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_mbixo5/input.p',i_0_2) ).

cnf(i_0_11,negated_conjecture,
    subset(esk1_0,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_mbixo5/input.p',i_0_11) ).

cnf(i_0_7,plain,
    ( subset(X1,X2)
    | ~ proper_subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_mbixo5/input.p',i_0_7) ).

cnf(i_0_10,negated_conjecture,
    proper_subset(esk2_0,esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_mbixo5/input.p',i_0_10) ).

cnf(i_0_8,plain,
    ~ proper_subset(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_mbixo5/input.p',i_0_8) ).

cnf(c_0_17,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    i_0_2 ).

cnf(c_0_18,negated_conjecture,
    subset(esk1_0,esk2_0),
    i_0_11 ).

cnf(c_0_19,plain,
    ( subset(X1,X2)
    | ~ proper_subset(X1,X2) ),
    i_0_7 ).

cnf(c_0_20,negated_conjecture,
    proper_subset(esk2_0,esk1_0),
    i_0_10 ).

cnf(c_0_21,negated_conjecture,
    ( esk1_0 = esk2_0
    | ~ subset(esk2_0,esk1_0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    subset(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    esk1_0 = esk2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).

cnf(c_0_24,plain,
    ~ proper_subset(X1,X1),
    i_0_8 ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_23]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU139+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n003.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 : Sun Jun 19 13:40:00 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.71/2.30  # ENIGMATIC: Solved by autoschedule:
% 7.71/2.30  # No SInE strategy applied
% 7.71/2.30  # Trying AutoSched0 for 150 seconds
% 7.71/2.30  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 7.71/2.30  # and selection function SelectNewComplexAHP.
% 7.71/2.30  #
% 7.71/2.30  # Preprocessing time       : 0.018 s
% 7.71/2.30  # Presaturation interreduction done
% 7.71/2.30  
% 7.71/2.30  # Proof found!
% 7.71/2.30  # SZS status Theorem
% 7.71/2.30  # SZS output start CNFRefutation
% See solution above
% 7.71/2.30  # Training examples: 0 positive, 0 negative
% 7.71/2.30  
% 7.71/2.30  # -------------------------------------------------
% 7.71/2.30  # User time                : 0.019 s
% 7.71/2.30  # System time              : 0.005 s
% 7.71/2.30  # Total time               : 0.024 s
% 7.71/2.30  # Maximum resident set size: 7116 pages
% 7.71/2.30  
%------------------------------------------------------------------------------