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

% Computer : n005.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:28 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_15,negated_conjecture,
    unordered_pair(unordered_pair(X1,X2),singleton(X1)) != esk8_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cu303f_v/lgb.p',i_0_15) ).

cnf(i_0_2,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cu303f_v/lgb.p',i_0_2) ).

cnf(i_0_8,plain,
    ( unordered_pair(unordered_pair(esk1_4(X1,X2,X3,X4),esk2_4(X1,X2,X3,X4)),singleton(esk1_4(X1,X2,X3,X4))) = X4
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cu303f_v/lgb.p',i_0_8) ).

cnf(i_0_16,negated_conjecture,
    in(esk8_0,cartesian_product2(esk9_0,esk10_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cu303f_v/lgb.p',i_0_16) ).

cnf(c_0_21,negated_conjecture,
    unordered_pair(unordered_pair(X1,X2),singleton(X1)) != esk8_0,
    i_0_15 ).

cnf(c_0_22,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_2 ).

cnf(c_0_23,plain,
    ( unordered_pair(unordered_pair(esk1_4(X1,X2,X3,X4),esk2_4(X1,X2,X3,X4)),singleton(esk1_4(X1,X2,X3,X4))) = X4
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    i_0_8 ).

cnf(c_0_24,plain,
    unordered_pair(singleton(X1),unordered_pair(X1,X2)) != esk8_0,
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_25,plain,
    ( unordered_pair(singleton(esk1_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),esk2_4(X1,X2,cartesian_product2(X1,X2),X3))) = X3
    | ~ in(X3,cartesian_product2(X1,X2)) ),
    inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_22])]) ).

cnf(c_0_26,negated_conjecture,
    in(esk8_0,cartesian_product2(esk9_0,esk10_0)),
    i_0_16 ).

cnf(c_0_27,plain,
    ~ in(esk8_0,cartesian_product2(X1,X2)),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25])]) ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_26,c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SET949+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n005.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 Jul 10 13:18:38 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.34/2.34  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.34/2.34  # No SInE strategy applied
% 7.34/2.34  # Trying AutoSched0 for 150 seconds
% 7.34/2.34  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.34/2.34  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.34/2.34  #
% 7.34/2.34  # Preprocessing time       : 0.022 s
% 7.34/2.34  # Presaturation interreduction done
% 7.34/2.34  
% 7.34/2.34  # Proof found!
% 7.34/2.34  # SZS status Theorem
% 7.34/2.34  # SZS output start CNFRefutation
% See solution above
% 7.34/2.34  # Training examples: 0 positive, 0 negative
% 7.34/2.34  
% 7.34/2.34  # -------------------------------------------------
% 7.34/2.34  # User time                : 0.023 s
% 7.34/2.34  # System time              : 0.005 s
% 7.34/2.34  # Total time               : 0.028 s
% 7.34/2.34  # Maximum resident set size: 7128 pages
% 7.34/2.34  
%------------------------------------------------------------------------------