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

% Computer : n009.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:53 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    ( X1 = X2
    | singleton(X1) != unordered_pair(X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eedo56of/input.p',i_0_4) ).

cnf(i_0_6,negated_conjecture,
    unordered_pair(esk2_0,esk3_0) = singleton(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eedo56of/input.p',i_0_6) ).

cnf(i_0_1,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eedo56of/input.p',i_0_1) ).

cnf(i_0_5,negated_conjecture,
    esk3_0 != esk2_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eedo56of/input.p',i_0_5) ).

cnf(c_0_11,plain,
    ( X1 = X2
    | singleton(X1) != unordered_pair(X2,X3) ),
    i_0_4 ).

cnf(c_0_12,negated_conjecture,
    unordered_pair(esk2_0,esk3_0) = singleton(esk1_0),
    i_0_6 ).

cnf(c_0_13,negated_conjecture,
    ( esk1_0 = X1
    | unordered_pair(esk2_0,esk3_0) != unordered_pair(X1,X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_1 ).

cnf(c_0_15,negated_conjecture,
    esk1_0 = esk2_0,
    inference(er,[status(thm)],[c_0_13]) ).

cnf(c_0_16,plain,
    ( X1 = X2
    | singleton(X1) != unordered_pair(X3,X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    singleton(esk2_0) = unordered_pair(esk2_0,esk3_0),
    inference(rw,[status(thm)],[c_0_12,c_0_15]) ).

cnf(c_0_18,plain,
    ( esk2_0 = X1
    | unordered_pair(esk2_0,esk3_0) != unordered_pair(X2,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_19,negated_conjecture,
    esk3_0 != esk2_0,
    i_0_5 ).

cnf(c_0_20,plain,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_18]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU150+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 : n009.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 11:41:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.20/0.44  # ENIGMATIC: Selected complete mode:
% 4.54/2.27  # ENIGMATIC: Solved by autoschedule:
% 4.54/2.27  # No SInE strategy applied
% 4.54/2.27  # Trying AutoSched0 for 150 seconds
% 4.54/2.27  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S07CA
% 4.54/2.27  # and selection function SelectCQIArNTEqFirst.
% 4.54/2.27  #
% 4.54/2.27  # Preprocessing time       : 0.013 s
% 4.54/2.27  # Presaturation interreduction done
% 4.54/2.27  
% 4.54/2.27  # Proof found!
% 4.54/2.27  # SZS status Theorem
% 4.54/2.27  # SZS output start CNFRefutation
% See solution above
% 4.54/2.27  # Training examples: 0 positive, 0 negative
% 4.54/2.27  
% 4.54/2.27  # -------------------------------------------------
% 4.54/2.27  # User time                : 0.012 s
% 4.54/2.27  # System time              : 0.005 s
% 4.54/2.27  # Total time               : 0.017 s
% 4.54/2.27  # Maximum resident set size: 7116 pages
% 4.54/2.27  
%------------------------------------------------------------------------------