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

% Computer : n003.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:39 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_10,negated_conjecture,
    ( set_union2(cartesian_product2(esk5_0,singleton(esk3_0)),cartesian_product2(esk5_0,singleton(esk4_0))) != cartesian_product2(esk5_0,set_union2(singleton(esk3_0),singleton(esk4_0)))
    | set_union2(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk5_0)) != cartesian_product2(set_union2(singleton(esk3_0),singleton(esk4_0)),esk5_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f13sl7j0/lgb.p',i_0_10) ).

cnf(i_0_8,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-f13sl7j0/lgb.p',i_0_8) ).

cnf(i_0_9,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-f13sl7j0/lgb.p',i_0_9) ).

cnf(c_0_14,negated_conjecture,
    ( set_union2(cartesian_product2(esk5_0,singleton(esk3_0)),cartesian_product2(esk5_0,singleton(esk4_0))) != cartesian_product2(esk5_0,set_union2(singleton(esk3_0),singleton(esk4_0)))
    | set_union2(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk5_0)) != cartesian_product2(set_union2(singleton(esk3_0),singleton(esk4_0)),esk5_0) ),
    i_0_10 ).

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

cnf(c_0_16,negated_conjecture,
    set_union2(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk5_0)) != cartesian_product2(set_union2(singleton(esk3_0),singleton(esk4_0)),esk5_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).

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

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET979+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 : n003.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 : Sat Jul  9 21:08:30 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.52/2.35  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.52/2.35  # No SInE strategy applied
% 7.52/2.35  # Trying AutoSched0 for 150 seconds
% 7.52/2.35  # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S04AN
% 7.52/2.35  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.52/2.35  #
% 7.52/2.35  # Preprocessing time       : 0.023 s
% 7.52/2.35  # Presaturation interreduction done
% 7.52/2.35  
% 7.52/2.35  # Proof found!
% 7.52/2.35  # SZS status Theorem
% 7.52/2.35  # SZS output start CNFRefutation
% See solution above
% 7.52/2.35  # Training examples: 0 positive, 0 negative
% 7.52/2.35  
% 7.52/2.35  # -------------------------------------------------
% 7.52/2.35  # User time                : 0.025 s
% 7.52/2.35  # System time              : 0.004 s
% 7.52/2.35  # Total time               : 0.029 s
% 7.52/2.35  # Maximum resident set size: 7124 pages
% 7.52/2.35  
%------------------------------------------------------------------------------