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

% Computer : n018.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:52 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_22,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xh15qr95/lgb.p',i_0_22) ).

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

cnf(i_0_117,negated_conjecture,
    unordered_pair(esk14_0,esk14_0) = unordered_pair(esk15_0,esk16_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xh15qr95/lgb.p',i_0_117) ).

cnf(i_0_3,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xh15qr95/lgb.p',i_0_3) ).

cnf(i_0_116,negated_conjecture,
    esk14_0 != esk15_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xh15qr95/lgb.p',i_0_116) ).

cnf(c_0_123,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X4,X3) ),
    i_0_22 ).

cnf(c_0_124,plain,
    ( X1 = X2
    | X3 != unordered_pair(X2,X2)
    | ~ in(X1,X3) ),
    i_0_12 ).

cnf(c_0_125,plain,
    in(X1,unordered_pair(X2,X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_123])]) ).

cnf(c_0_126,negated_conjecture,
    unordered_pair(esk14_0,esk14_0) = unordered_pair(esk15_0,esk16_0),
    i_0_117 ).

cnf(c_0_127,plain,
    ( X1 = X2
    | ~ in(X1,unordered_pair(X2,X2)) ),
    inference(er,[status(thm)],[c_0_124]) ).

cnf(c_0_128,negated_conjecture,
    in(esk16_0,unordered_pair(esk14_0,esk14_0)),
    inference(spm,[status(thm)],[c_0_125,c_0_126]) ).

cnf(c_0_129,plain,
    esk16_0 = esk14_0,
    inference(spm,[status(thm)],[c_0_127,c_0_128]) ).

cnf(c_0_130,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_3 ).

cnf(c_0_131,negated_conjecture,
    unordered_pair(esk14_0,esk15_0) = unordered_pair(esk14_0,esk14_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_129]),c_0_130]) ).

cnf(c_0_132,plain,
    in(esk15_0,unordered_pair(esk14_0,esk14_0)),
    inference(spm,[status(thm)],[c_0_125,c_0_131]) ).

cnf(c_0_133,negated_conjecture,
    esk14_0 != esk15_0,
    i_0_116 ).

cnf(c_0_134,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_132]),c_0_133]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SEU149+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n018.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun Jun 19 07:19:05 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected complete mode:
% 7.86/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.86/2.32  # No SInE strategy applied
% 7.86/2.32  # Trying AutoSched0 for 150 seconds
% 7.86/2.32  # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 7.86/2.32  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.86/2.32  #
% 7.86/2.32  # Preprocessing time       : 0.024 s
% 7.86/2.32  # Presaturation interreduction done
% 7.86/2.32  
% 7.86/2.32  # Proof found!
% 7.86/2.32  # SZS status Theorem
% 7.86/2.32  # SZS output start CNFRefutation
% See solution above
% 7.86/2.32  # Training examples: 0 positive, 0 negative
% 7.86/2.32  
% 7.86/2.32  # -------------------------------------------------
% 7.86/2.32  # User time                : 0.029 s
% 7.86/2.32  # System time              : 0.006 s
% 7.86/2.32  # Total time               : 0.035 s
% 7.86/2.32  # Maximum resident set size: 7124 pages
% 7.86/2.32  
%------------------------------------------------------------------------------