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

% Computer : n028.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:40:14 EDT 2022

% Result   : Theorem 4.63s 2.26s
% Output   : CNFRefutation 4.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   12 (   4 unt;   0 nHn;  10 RR)
%            Number of literals    :   28 (  27 equ;  19 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 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   :   36 (  17 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_20,plain,
    ( X1 = X2
    | X1 != pair_first(X3)
    | X3 != ordered_pair(X4,X5)
    | X3 != ordered_pair(X2,X6) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3fbr3dvz/lgb.p',i_0_20) ).

cnf(i_0_23,plain,
    ( X1 = X2
    | X1 != pair_second(X3)
    | X3 != ordered_pair(X4,X5)
    | X3 != ordered_pair(X6,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3fbr3dvz/lgb.p',i_0_23) ).

cnf(i_0_17,negated_conjecture,
    ( pair_first(ordered_pair(esk4_0,esk5_0)) != esk4_0
    | pair_second(ordered_pair(esk4_0,esk5_0)) != esk5_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3fbr3dvz/lgb.p',i_0_17) ).

cnf(c_0_27,plain,
    ( X1 = X2
    | X1 != pair_first(X3)
    | X3 != ordered_pair(X4,X5)
    | X3 != ordered_pair(X2,X6) ),
    i_0_20 ).

cnf(c_0_28,plain,
    ( pair_first(ordered_pair(X1,X2)) = X3
    | ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_27])]) ).

cnf(c_0_29,plain,
    ( X1 = X2
    | X1 != pair_second(X3)
    | X3 != ordered_pair(X4,X5)
    | X3 != ordered_pair(X6,X2) ),
    i_0_23 ).

cnf(c_0_30,negated_conjecture,
    ( pair_first(ordered_pair(esk4_0,esk5_0)) != esk4_0
    | pair_second(ordered_pair(esk4_0,esk5_0)) != esk5_0 ),
    i_0_17 ).

cnf(c_0_31,plain,
    pair_first(ordered_pair(X1,X2)) = X1,
    inference(er,[status(thm)],[c_0_28]) ).

cnf(c_0_32,plain,
    ( pair_second(ordered_pair(X1,X2)) = X2
    | ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_29])]) ).

cnf(c_0_33,negated_conjecture,
    pair_second(ordered_pair(esk4_0,esk5_0)) != esk5_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).

cnf(c_0_34,plain,
    pair_second(ordered_pair(X1,X2)) = X2,
    inference(er,[status(thm)],[c_0_32]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SEU267+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n028.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Sun Jun 19 10:11:02 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.17/0.43  # ENIGMATIC: Selected complete mode:
% 4.63/2.26  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.63/2.26  # No SInE strategy applied
% 4.63/2.26  # Trying AutoSched0 for 150 seconds
% 4.63/2.26  # AutoSched0-Mode selected heuristic G_____0010_evo
% 4.63/2.26  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.63/2.26  #
% 4.63/2.26  # Preprocessing time       : 0.023 s
% 4.63/2.26  
% 4.63/2.26  # Proof found!
% 4.63/2.26  # SZS status Theorem
% 4.63/2.26  # SZS output start CNFRefutation
% See solution above
% 4.63/2.26  # Training examples: 0 positive, 0 negative
% 4.63/2.26  
% 4.63/2.26  # -------------------------------------------------
% 4.63/2.26  # User time                : 0.023 s
% 4.63/2.26  # System time              : 0.006 s
% 4.63/2.26  # Total time               : 0.029 s
% 4.63/2.26  # Maximum resident set size: 7120 pages
% 4.63/2.26  
%------------------------------------------------------------------------------