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

% Computer : n004.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:35 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_9,negated_conjecture,
    set_union2(set_union2(set_union2(cartesian_product2(esk3_0,esk5_0),cartesian_product2(esk3_0,esk6_0)),cartesian_product2(esk4_0,esk5_0)),cartesian_product2(esk4_0,esk6_0)) != cartesian_product2(set_union2(esk3_0,esk4_0),set_union2(esk5_0,esk6_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fp9937ca/input.p',i_0_9) ).

cnf(i_0_10,plain,
    set_union2(set_union2(X1,X2),X3) = set_union2(X1,set_union2(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fp9937ca/input.p',i_0_10) ).

cnf(i_0_1,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fp9937ca/input.p',i_0_1) ).

cnf(i_0_7,plain,
    set_union2(cartesian_product2(X1,X2),cartesian_product2(X1,X3)) = cartesian_product2(X1,set_union2(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fp9937ca/input.p',i_0_7) ).

cnf(i_0_8,plain,
    set_union2(cartesian_product2(X1,X2),cartesian_product2(X3,X2)) = cartesian_product2(set_union2(X1,X3),X2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fp9937ca/input.p',i_0_8) ).

cnf(c_0_16,negated_conjecture,
    set_union2(set_union2(set_union2(cartesian_product2(esk3_0,esk5_0),cartesian_product2(esk3_0,esk6_0)),cartesian_product2(esk4_0,esk5_0)),cartesian_product2(esk4_0,esk6_0)) != cartesian_product2(set_union2(esk3_0,esk4_0),set_union2(esk5_0,esk6_0)),
    i_0_9 ).

cnf(c_0_17,plain,
    set_union2(set_union2(X1,X2),X3) = set_union2(X1,set_union2(X2,X3)),
    i_0_10 ).

cnf(c_0_18,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    i_0_1 ).

cnf(c_0_19,negated_conjecture,
    cartesian_product2(set_union2(esk3_0,esk4_0),set_union2(esk5_0,esk6_0)) != set_union2(cartesian_product2(esk3_0,esk5_0),set_union2(cartesian_product2(esk3_0,esk6_0),set_union2(cartesian_product2(esk4_0,esk5_0),cartesian_product2(esk4_0,esk6_0)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).

cnf(c_0_20,plain,
    set_union2(cartesian_product2(X1,X2),cartesian_product2(X1,X3)) = cartesian_product2(X1,set_union2(X2,X3)),
    i_0_7 ).

cnf(c_0_21,plain,
    set_union2(cartesian_product2(X1,X2),cartesian_product2(X3,X2)) = cartesian_product2(set_union2(X1,X3),X2),
    i_0_8 ).

cnf(c_0_22,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    c_0_18 ).

cnf(c_0_23,plain,
    set_union2(set_union2(X1,X2),X3) = set_union2(X1,set_union2(X2,X3)),
    c_0_17 ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(ar,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_21]),c_0_17]),c_0_22,c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET968+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n004.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 : Mon Jul 11 02:43:54 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 4.37/2.16  # ENIGMATIC: Solved by autoschedule:
% 4.37/2.16  # No SInE strategy applied
% 4.37/2.16  # Trying AutoSched0 for 150 seconds
% 4.37/2.16  # AutoSched0-Mode selected heuristic H_____042_B03_F1_AE_Q4_SP_S2S
% 4.37/2.16  # and selection function SelectNewComplexAHP.
% 4.37/2.16  #
% 4.37/2.16  # Preprocessing time       : 0.023 s
% 4.37/2.16  
% 4.37/2.16  # Proof found!
% 4.37/2.16  # SZS status Theorem
% 4.37/2.16  # SZS output start CNFRefutation
% See solution above
% 4.37/2.16  # Training examples: 0 positive, 0 negative
% 4.37/2.16  
% 4.37/2.16  # -------------------------------------------------
% 4.37/2.16  # User time                : 0.024 s
% 4.37/2.16  # System time              : 0.006 s
% 4.37/2.16  # Total time               : 0.029 s
% 4.37/2.16  # Maximum resident set size: 7124 pages
% 4.37/2.16  
%------------------------------------------------------------------------------