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

% Computer : n006.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:12:53 EDT 2022

% Result   : Theorem 8.25s 2.50s
% Output   : CNFRefutation 8.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (  14 unt;   0 nHn;   3 RR)
%            Number of literals    :   14 (  13 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   2 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   :   25 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
    union(difference(X1,X2),difference(X3,X2)) = difference(union(X1,X3),X2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u3jmxq9z/lgb.p',i_0_3) ).

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

cnf(i_0_16,plain,
    union(X1,X2) = union(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u3jmxq9z/lgb.p',i_0_16) ).

cnf(i_0_17,plain,
    intersection(X1,X2) = intersection(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u3jmxq9z/lgb.p',i_0_17) ).

cnf(i_0_27,negated_conjecture,
    difference(union(esk3_0,esk4_0),intersection(esk3_0,esk4_0)) != union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u3jmxq9z/lgb.p',i_0_27) ).

cnf(c_0_33,plain,
    union(difference(X1,X2),difference(X3,X2)) = difference(union(X1,X3),X2),
    i_0_3 ).

cnf(c_0_34,plain,
    difference(X1,intersection(X1,X2)) = difference(X1,X2),
    i_0_2 ).

cnf(c_0_35,plain,
    union(X1,X2) = union(X2,X1),
    i_0_16 ).

cnf(c_0_36,plain,
    intersection(X1,X2) = intersection(X2,X1),
    i_0_17 ).

cnf(c_0_37,plain,
    union(difference(X1,X2),difference(X3,intersection(X1,X2))) = difference(union(X3,X1),intersection(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).

cnf(c_0_38,plain,
    difference(X1,intersection(X2,X1)) = difference(X1,X2),
    inference(spm,[status(thm)],[c_0_34,c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    difference(union(esk3_0,esk4_0),intersection(esk3_0,esk4_0)) != union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)),
    i_0_27 ).

cnf(c_0_40,plain,
    union(difference(X1,X2),difference(X2,X1)) = difference(union(X2,X1),intersection(X1,X2)),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_41,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_35])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET620+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n006.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 05:49:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 8.25/2.50  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.25/2.50  # No SInE strategy applied
% 8.25/2.50  # Trying AutoSched0 for 150 seconds
% 8.25/2.50  # AutoSched0-Mode selected heuristic C12_02_nc_SAT001_MinMin_rr
% 8.25/2.50  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.25/2.50  #
% 8.25/2.50  # Preprocessing time       : 0.023 s
% 8.25/2.50  # Presaturation interreduction done
% 8.25/2.50  
% 8.25/2.50  # Proof found!
% 8.25/2.50  # SZS status Theorem
% 8.25/2.50  # SZS output start CNFRefutation
% See solution above
% 8.25/2.50  # Training examples: 0 positive, 0 negative
% 8.25/2.50  
% 8.25/2.50  # -------------------------------------------------
% 8.25/2.50  # User time                : 0.053 s
% 8.25/2.50  # System time              : 0.006 s
% 8.25/2.50  # Total time               : 0.059 s
% 8.25/2.50  # Maximum resident set size: 7124 pages
% 8.25/2.50  
%------------------------------------------------------------------------------