%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET010+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:07:54 EDT 2022
% Result : Theorem 7.72s 2.41s
% Output : CNFRefutation 7.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 45 ( 16 unt; 4 nHn; 30 RR)
% Number of literals : 85 ( 6 equ; 50 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 70 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,negated_conjecture,
union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)) != difference(esk3_0,intersection(esk4_0,esk5_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_26) ).
cnf(i_0_13,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_13) ).
cnf(i_0_10,plain,
( subset(union(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_10) ).
cnf(i_0_19,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_19) ).
cnf(i_0_11,plain,
subset(intersection(X1,X2),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_11) ).
cnf(i_0_17,plain,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_17) ).
cnf(i_0_18,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_18) ).
cnf(i_0_12,plain,
( subset(difference(X1,X2),difference(X1,X3))
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_12) ).
cnf(i_0_8,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_8) ).
cnf(i_0_1,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_1) ).
cnf(i_0_9,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_9) ).
cnf(i_0_4,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_4) ).
cnf(i_0_7,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_7) ).
cnf(i_0_2,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bc4m1jg_/lgb.p',i_0_2) ).
cnf(c_0_41,negated_conjecture,
union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)) != difference(esk3_0,intersection(esk4_0,esk5_0)),
i_0_26 ).
cnf(c_0_42,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_13 ).
cnf(c_0_43,negated_conjecture,
( ~ subset(union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,intersection(esk4_0,esk5_0)))
| ~ subset(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_44,plain,
( subset(union(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
i_0_10 ).
cnf(c_0_45,negated_conjecture,
( ~ subset(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)))
| ~ subset(difference(esk3_0,esk5_0),difference(esk3_0,intersection(esk4_0,esk5_0)))
| ~ subset(difference(esk3_0,esk4_0),difference(esk3_0,intersection(esk4_0,esk5_0))) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
i_0_19 ).
cnf(c_0_47,plain,
subset(intersection(X1,X2),X1),
i_0_11 ).
cnf(c_0_48,plain,
intersection(X1,X2) = intersection(X2,X1),
i_0_17 ).
cnf(c_0_49,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
i_0_18 ).
cnf(c_0_50,plain,
( member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),difference(esk3_0,intersection(esk4_0,esk5_0)))
| ~ subset(difference(esk3_0,esk5_0),difference(esk3_0,intersection(esk4_0,esk5_0)))
| ~ subset(difference(esk3_0,esk4_0),difference(esk3_0,intersection(esk4_0,esk5_0))) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
( subset(difference(X1,X2),difference(X1,X3))
| ~ subset(X3,X2) ),
i_0_12 ).
cnf(c_0_52,plain,
subset(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
( ~ subset(difference(esk3_0,esk5_0),difference(esk3_0,intersection(esk4_0,esk5_0)))
| ~ subset(difference(esk3_0,esk4_0),difference(esk3_0,intersection(esk4_0,esk5_0)))
| ~ member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))) ),
inference(spm,[status(thm)],[c_0_45,c_0_49]) ).
cnf(c_0_54,plain,
( member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),difference(esk3_0,intersection(esk4_0,esk5_0)))
| ~ subset(difference(esk3_0,esk4_0),difference(esk3_0,intersection(esk4_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_55,plain,
( ~ subset(difference(esk3_0,esk4_0),difference(esk3_0,intersection(esk4_0,esk5_0)))
| ~ member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_52])]) ).
cnf(c_0_56,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
i_0_8 ).
cnf(c_0_57,plain,
member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),difference(esk3_0,intersection(esk4_0,esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_51]),c_0_47])]) ).
cnf(c_0_58,plain,
~ member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_51]),c_0_47])]) ).
cnf(c_0_59,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
i_0_1 ).
cnf(c_0_60,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
i_0_9 ).
cnf(c_0_61,plain,
~ member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),intersection(esk4_0,esk5_0)),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
i_0_4 ).
cnf(c_0_63,plain,
~ member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),difference(esk3_0,esk5_0)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
i_0_7 ).
cnf(c_0_65,plain,
member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),esk3_0),
inference(spm,[status(thm)],[c_0_60,c_0_57]) ).
cnf(c_0_66,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
i_0_2 ).
cnf(c_0_67,plain,
( ~ member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),esk5_0)
| ~ member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),esk4_0) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,plain,
member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).
cnf(c_0_69,plain,
~ member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),difference(esk3_0,esk4_0)),
inference(spm,[status(thm)],[c_0_58,c_0_66]) ).
cnf(c_0_70,plain,
~ member(esk1_2(difference(esk3_0,intersection(esk4_0,esk5_0)),union(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_71,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_64]),c_0_65])]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET010+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n015.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 17:13:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.72/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.72/2.41 # No SInE strategy applied
% 7.72/2.41 # Trying AutoSched0 for 150 seconds
% 7.72/2.41 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S033A
% 7.72/2.41 # and selection function PSelectUnlessUniqMax.
% 7.72/2.41 #
% 7.72/2.41 # Preprocessing time : 0.013 s
% 7.72/2.41 # Presaturation interreduction done
% 7.72/2.41
% 7.72/2.41 # Proof found!
% 7.72/2.41 # SZS status Theorem
% 7.72/2.41 # SZS output start CNFRefutation
% See solution above
% 7.72/2.41 # Training examples: 0 positive, 0 negative
% 7.72/2.41
% 7.72/2.41 # -------------------------------------------------
% 7.72/2.41 # User time : 0.073 s
% 7.72/2.41 # System time : 0.005 s
% 7.72/2.41 # Total time : 0.078 s
% 7.72/2.41 # Maximum resident set size: 7124 pages
% 7.72/2.41
%------------------------------------------------------------------------------