TSTP Solution File: SET619+3 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n018.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:52 EDT 2022

% Result   : Theorem 6.45s 2.20s
% Output   : CNFRefutation 6.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   18 (  18 unt;   0 nHn;   4 RR)
%            Number of literals    :   18 (  17 equ;   3 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   :   32 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
    union(union(X1,X2),X3) = union(X1,union(X2,X3)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ggyp_uqi/lgb.p',i_0_2) ).

cnf(i_0_3,plain,
    union(X1,intersection(X1,X2)) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ggyp_uqi/lgb.p',i_0_3) ).

cnf(i_0_4,plain,
    union(intersection(X1,X2),difference(X1,X2)) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ggyp_uqi/lgb.p',i_0_4) ).

cnf(i_0_15,plain,
    intersection(X1,X2) = intersection(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ggyp_uqi/lgb.p',i_0_15) ).

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

cnf(i_0_14,plain,
    union(X1,X2) = union(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ggyp_uqi/lgb.p',i_0_14) ).

cnf(c_0_32,plain,
    union(union(X1,X2),X3) = union(X1,union(X2,X3)),
    i_0_2 ).

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

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

cnf(c_0_35,plain,
    intersection(X1,X2) = intersection(X2,X1),
    i_0_15 ).

cnf(c_0_36,negated_conjecture,
    union(union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)),intersection(esk3_0,esk4_0)) != union(esk3_0,esk4_0),
    i_0_25 ).

cnf(c_0_37,plain,
    union(X1,X2) = union(X2,X1),
    i_0_14 ).

cnf(c_0_38,plain,
    union(X1,union(intersection(X1,X2),X3)) = union(X1,X3),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

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

cnf(c_0_40,negated_conjecture,
    union(intersection(esk3_0,esk4_0),union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))) != union(esk3_0,esk4_0),
    inference(rw,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_41,plain,
    union(intersection(X1,X2),union(difference(X1,X2),X3)) = union(X1,X3),
    inference(spm,[status(thm)],[c_0_32,c_0_34]) ).

cnf(c_0_42,plain,
    union(X1,difference(X2,X1)) = union(X1,X2),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET619+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n018.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 : Sun Jul 10 20:54:45 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 6.45/2.20  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.45/2.20  # No SInE strategy applied
% 6.45/2.20  # Trying AutoSched0 for 150 seconds
% 6.45/2.20  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.45/2.20  # and selection function SelectComplexExceptUniqMaxHorn.
% 6.45/2.20  #
% 6.45/2.20  # Preprocessing time       : 0.012 s
% 6.45/2.20  # Presaturation interreduction done
% 6.45/2.20  
% 6.45/2.20  # Proof found!
% 6.45/2.20  # SZS status Theorem
% 6.45/2.20  # SZS output start CNFRefutation
% See solution above
% 6.45/2.20  # Training examples: 0 positive, 0 negative
% 6.45/2.20  
% 6.45/2.20  # -------------------------------------------------
% 6.45/2.20  # User time                : 0.019 s
% 6.45/2.20  # System time              : 0.004 s
% 6.45/2.20  # Total time               : 0.023 s
% 6.45/2.20  # Maximum resident set size: 7124 pages
% 6.45/2.20  
%------------------------------------------------------------------------------