%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET636+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:13:04 EDT 2022
% Result : Theorem 8.71s 2.54s
% Output : CNFRefutation 8.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 45 ( 10 unt; 9 nHn; 33 RR)
% Number of literals : 86 ( 12 equ; 43 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( ~ intersect(X1,X2)
| ~ disjoint(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_9) ).
cnf(i_0_25,negated_conjecture,
( intersection(esk5_0,esk6_0) = empty_set
| disjoint(esk5_0,esk6_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_25) ).
cnf(i_0_1,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_1) ).
cnf(i_0_7,plain,
~ member(X1,empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_7) ).
cnf(i_0_4,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_4) ).
cnf(i_0_2,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_2) ).
cnf(i_0_19,plain,
( empty(X1)
| member(esk3_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_19) ).
cnf(i_0_13,plain,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_13) ).
cnf(i_0_16,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_16) ).
cnf(i_0_20,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_20) ).
cnf(i_0_10,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_10) ).
cnf(i_0_5,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_5) ).
cnf(i_0_26,negated_conjecture,
( intersection(esk5_0,esk6_0) != empty_set
| ~ disjoint(esk5_0,esk6_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_26) ).
cnf(i_0_8,plain,
( intersect(X1,X2)
| disjoint(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_8) ).
cnf(i_0_6,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hwe53qcc/input.p',i_0_6) ).
cnf(c_0_42,plain,
( ~ intersect(X1,X2)
| ~ disjoint(X1,X2) ),
i_0_9 ).
cnf(c_0_43,negated_conjecture,
( intersection(esk5_0,esk6_0) = empty_set
| disjoint(esk5_0,esk6_0) ),
i_0_25 ).
cnf(c_0_44,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
i_0_1 ).
cnf(c_0_45,negated_conjecture,
( intersection(esk5_0,esk6_0) = empty_set
| ~ intersect(esk5_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
~ member(X1,empty_set),
i_0_7 ).
cnf(c_0_47,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
i_0_4 ).
cnf(c_0_48,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
i_0_2 ).
cnf(c_0_49,plain,
( empty(X1)
| member(esk3_1(X1),X1) ),
i_0_19 ).
cnf(c_0_50,plain,
( ~ member(X1,esk6_0)
| ~ member(X1,esk5_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47]) ).
cnf(c_0_51,plain,
( empty(intersection(X1,X2))
| member(esk3_1(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,plain,
( empty(intersection(X1,esk6_0))
| ~ member(esk3_1(intersection(X1,esk6_0)),esk5_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,plain,
intersection(X1,X2) = intersection(X2,X1),
i_0_13 ).
cnf(c_0_54,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
i_0_16 ).
cnf(c_0_55,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
i_0_20 ).
cnf(c_0_56,plain,
( empty(intersection(esk6_0,X1))
| ~ member(esk3_1(intersection(esk6_0,X1)),esk5_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_10 ).
cnf(c_0_58,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_46,c_0_54]) ).
cnf(c_0_59,plain,
( subset(X1,X2)
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_54]) ).
cnf(c_0_60,plain,
empty(intersection(esk5_0,esk6_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_51]),c_0_53]) ).
cnf(c_0_61,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
i_0_5 ).
cnf(c_0_62,negated_conjecture,
( intersection(esk5_0,esk6_0) != empty_set
| ~ disjoint(esk5_0,esk6_0) ),
i_0_26 ).
cnf(c_0_63,plain,
( intersect(X1,X2)
| disjoint(X1,X2) ),
i_0_8 ).
cnf(c_0_64,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,plain,
subset(intersection(esk5_0,esk6_0),X1),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,plain,
( ~ intersect(X1,esk6_0)
| ~ member(esk1_2(X1,esk6_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_61]) ).
cnf(c_0_67,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
i_0_6 ).
cnf(c_0_68,negated_conjecture,
( intersect(esk5_0,esk6_0)
| intersection(esk5_0,esk6_0) != empty_set ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,plain,
intersection(esk5_0,esk6_0) = empty_set,
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,plain,
~ intersect(esk5_0,esk6_0),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET636+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 : n009.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 : Mon Jul 11 04:09:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.71/2.54 # ENIGMATIC: Solved by autoschedule:
% 8.71/2.54 # No SInE strategy applied
% 8.71/2.54 # Trying AutoSched0 for 150 seconds
% 8.71/2.54 # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 8.71/2.54 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.71/2.54 #
% 8.71/2.54 # Preprocessing time : 0.023 s
% 8.71/2.54
% 8.71/2.54 # Proof found!
% 8.71/2.54 # SZS status Theorem
% 8.71/2.54 # SZS output start CNFRefutation
% See solution above
% 8.71/2.54 # Training examples: 0 positive, 0 negative
% 8.71/2.54
% 8.71/2.54 # -------------------------------------------------
% 8.71/2.54 # User time : 0.028 s
% 8.71/2.54 # System time : 0.003 s
% 8.71/2.54 # Total time : 0.031 s
% 8.71/2.54 # Maximum resident set size: 7120 pages
% 8.71/2.54
%------------------------------------------------------------------------------