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

% Computer : n025.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:03 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_9,negated_conjecture,
    union(unordered_pair(singleton(esk3_0),singleton(esk4_0))) != unordered_pair(esk3_0,esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ey46ioig/input.p',i_0_9) ).

cnf(i_0_10,plain,
    union(unordered_pair(singleton(X1),singleton(X2))) = unordered_pair(X1,X2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ey46ioig/input.p',i_0_10) ).

cnf(c_0_13,negated_conjecture,
    union(unordered_pair(singleton(esk3_0),singleton(esk4_0))) != unordered_pair(esk3_0,esk4_0),
    i_0_9 ).

cnf(c_0_14,plain,
    union(unordered_pair(singleton(X1),singleton(X2))) = unordered_pair(X1,X2),
    i_0_10 ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET891+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n025.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 Jul 10 16:04:18 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.74/2.32  # ENIGMATIC: Solved by autoschedule:
% 7.74/2.32  # No SInE strategy applied
% 7.74/2.32  # Trying AutoSched0 for 150 seconds
% 7.74/2.32  # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.74/2.32  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.74/2.32  #
% 7.74/2.32  # Preprocessing time       : 0.023 s
% 7.74/2.32  
% 7.74/2.32  # Proof found!
% 7.74/2.32  # SZS status Theorem
% 7.74/2.32  # SZS output start CNFRefutation
% See solution above
% 7.74/2.32  # Training examples: 0 positive, 0 negative
% 7.74/2.32  
% 7.74/2.32  # -------------------------------------------------
% 7.74/2.32  # User time                : 0.024 s
% 7.74/2.32  # System time              : 0.004 s
% 7.74/2.32  # Total time               : 0.028 s
% 7.74/2.32  # Maximum resident set size: 7124 pages
% 7.74/2.32  
%------------------------------------------------------------------------------