%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET612+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:47 EDT 2022
% Result : Theorem 7.71s 2.36s
% Output : CNFRefutation 7.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 45 ( 16 unt; 6 nHn; 34 RR)
% Number of literals : 84 ( 6 equ; 44 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,
intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)) != difference(esk3_0,union(esk4_0,esk5_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_26) ).
cnf(i_0_13,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_13) ).
cnf(i_0_19,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_19) ).
cnf(i_0_11,plain,
( subset(X1,intersection(X2,X3))
| ~ subset(X1,X3)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_11) ).
cnf(i_0_10,plain,
subset(X1,union(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_10) ).
cnf(i_0_16,plain,
union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_16) ).
cnf(i_0_18,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_18) ).
cnf(i_0_12,plain,
( subset(difference(X1,X2),difference(X1,X3))
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_12) ).
cnf(i_0_5,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_5) ).
cnf(i_0_9,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_9) ).
cnf(i_0_6,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_6) ).
cnf(i_0_7,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_7) ).
cnf(i_0_8,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_8) ).
cnf(i_0_3,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9abmrgov/input.p',i_0_3) ).
cnf(c_0_41,negated_conjecture,
intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)) != difference(esk3_0,union(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(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0)))
| ~ subset(difference(esk3_0,union(esk4_0,esk5_0)),intersection(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(X1,X2)
| member(esk1_2(X1,X2),X1) ),
i_0_19 ).
cnf(c_0_45,plain,
( member(esk1_2(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)))
| ~ subset(difference(esk3_0,union(esk4_0,esk5_0)),intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
( subset(X1,intersection(X2,X3))
| ~ subset(X1,X3)
| ~ subset(X1,X2) ),
i_0_11 ).
cnf(c_0_47,plain,
subset(X1,union(X1,X2)),
i_0_10 ).
cnf(c_0_48,plain,
union(X1,X2) = union(X2,X1),
i_0_16 ).
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(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)))
| ~ subset(difference(esk3_0,union(esk4_0,esk5_0)),difference(esk3_0,esk5_0))
| ~ subset(difference(esk3_0,union(esk4_0,esk5_0)),difference(esk3_0,esk4_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(X1,union(X2,X1)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
( ~ member(esk1_2(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),difference(esk3_0,union(esk4_0,esk5_0)))
| ~ subset(difference(esk3_0,union(esk4_0,esk5_0)),intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0))) ),
inference(spm,[status(thm)],[c_0_43,c_0_49]) ).
cnf(c_0_54,plain,
( member(esk1_2(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)))
| ~ subset(difference(esk3_0,union(esk4_0,esk5_0)),difference(esk3_0,esk4_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,
( ~ member(esk1_2(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),difference(esk3_0,union(esk4_0,esk5_0)))
| ~ subset(difference(esk3_0,union(esk4_0,esk5_0)),difference(esk3_0,esk5_0))
| ~ subset(difference(esk3_0,union(esk4_0,esk5_0)),difference(esk3_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_53,c_0_46]) ).
cnf(c_0_56,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
i_0_5 ).
cnf(c_0_57,plain,
member(esk1_2(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),intersection(difference(esk3_0,esk4_0),difference(esk3_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(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),difference(esk3_0,union(esk4_0,esk5_0)))
| ~ subset(difference(esk3_0,union(esk4_0,esk5_0)),difference(esk3_0,esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_51]),c_0_52])]) ).
cnf(c_0_59,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
i_0_9 ).
cnf(c_0_60,plain,
member(esk1_2(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),difference(esk3_0,esk5_0)),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
i_0_6 ).
cnf(c_0_62,plain,
~ member(esk1_2(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),difference(esk3_0,union(esk4_0,esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_51]),c_0_47])]) ).
cnf(c_0_63,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
i_0_7 ).
cnf(c_0_64,plain,
member(esk1_2(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),esk3_0),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
i_0_8 ).
cnf(c_0_66,plain,
member(esk1_2(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),difference(esk3_0,esk4_0)),
inference(spm,[status(thm)],[c_0_61,c_0_57]) ).
cnf(c_0_67,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
i_0_3 ).
cnf(c_0_68,plain,
member(esk1_2(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),union(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_69,plain,
~ member(esk1_2(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),esk4_0),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,plain,
~ member(esk1_2(intersection(difference(esk3_0,esk4_0),difference(esk3_0,esk5_0)),difference(esk3_0,union(esk4_0,esk5_0))),esk5_0),
inference(spm,[status(thm)],[c_0_65,c_0_60]) ).
cnf(c_0_71,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET612+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 06:45:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.71/2.36 # ENIGMATIC: Solved by autoschedule:
% 7.71/2.36 # No SInE strategy applied
% 7.71/2.36 # Trying AutoSched0 for 150 seconds
% 7.71/2.36 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S033A
% 7.71/2.36 # and selection function PSelectUnlessUniqMax.
% 7.71/2.36 #
% 7.71/2.36 # Preprocessing time : 0.012 s
% 7.71/2.36 # Presaturation interreduction done
% 7.71/2.36
% 7.71/2.36 # Proof found!
% 7.71/2.36 # SZS status Theorem
% 7.71/2.36 # SZS output start CNFRefutation
% See solution above
% 7.71/2.36 # Training examples: 0 positive, 0 negative
% 7.71/2.36
% 7.71/2.36 # -------------------------------------------------
% 7.71/2.36 # User time : 0.124 s
% 7.71/2.36 # System time : 0.007 s
% 7.71/2.36 # Total time : 0.131 s
% 7.71/2.36 # Maximum resident set size: 7116 pages
% 7.71/2.36
%------------------------------------------------------------------------------