TSTP Solution File: SEU170+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU170+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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 08:39:09 EDT 2022
% Result : Theorem 15.08s 3.41s
% Output : CNFRefutation 15.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 24
% Syntax : Number of clauses : 73 ( 41 unt; 6 nHn; 53 RR)
% Number of literals : 113 ( 38 equ; 40 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 87 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_64,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_64) ).
cnf(i_0_164,negated_conjecture,
element(esk27_0,powerset(esk25_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_164) ).
cnf(i_0_77,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_77) ).
cnf(i_0_91,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_91) ).
cnf(i_0_5,plain,
set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_5) ).
cnf(i_0_137,plain,
set_difference(X1,set_difference(X1,empty_set)) = empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_137) ).
cnf(i_0_156,plain,
set_difference(X1,empty_set) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_156) ).
cnf(i_0_66,plain,
( disjoint(X1,X2)
| set_difference(X1,set_difference(X1,X2)) != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_66) ).
cnf(i_0_117,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_117) ).
cnf(i_0_182,lemma,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_182) ).
cnf(i_0_99,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_99) ).
cnf(i_0_144,lemma,
subset(set_difference(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_144) ).
cnf(i_0_161,lemma,
set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_161) ).
cnf(i_0_152,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_152) ).
cnf(i_0_132,plain,
set_union2(X1,empty_set) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_132) ).
cnf(i_0_4,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_4) ).
cnf(i_0_173,lemma,
( disjoint(X1,X2)
| ~ subset(X1,X3)
| ~ disjoint(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_173) ).
cnf(i_0_162,negated_conjecture,
( disjoint(esk26_0,esk27_0)
| subset(esk26_0,subset_complement(esk25_0,esk27_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_162) ).
cnf(i_0_22,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_22) ).
cnf(i_0_165,negated_conjecture,
element(esk26_0,powerset(esk25_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_165) ).
cnf(i_0_84,plain,
~ empty(powerset(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_84) ).
cnf(i_0_163,negated_conjecture,
( ~ disjoint(esk26_0,esk27_0)
| ~ subset(esk26_0,subset_complement(esk25_0,esk27_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_163) ).
cnf(i_0_18,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_18) ).
cnf(i_0_141,lemma,
( subset(set_difference(X1,X2),set_difference(X3,X2))
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dc4p__02/input.p',i_0_141) ).
cnf(c_0_207,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
i_0_64 ).
cnf(c_0_208,negated_conjecture,
element(esk27_0,powerset(esk25_0)),
i_0_164 ).
cnf(c_0_209,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
i_0_77 ).
cnf(c_0_210,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
i_0_91 ).
cnf(c_0_211,negated_conjecture,
subset_complement(esk25_0,esk27_0) = set_difference(esk25_0,esk27_0),
inference(spm,[status(thm)],[c_0_207,c_0_208]) ).
cnf(c_0_212,plain,
( subset_complement(X1,subset_complement(X1,X2)) = set_difference(X1,subset_complement(X1,X2))
| ~ element(X2,powerset(X1)) ),
inference(spm,[status(thm)],[c_0_207,c_0_209]) ).
cnf(c_0_213,plain,
subset_complement(esk25_0,set_difference(esk25_0,esk27_0)) = esk27_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_210,c_0_211]),c_0_208])]) ).
cnf(c_0_214,plain,
set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
i_0_5 ).
cnf(c_0_215,plain,
set_difference(X1,set_difference(X1,empty_set)) = empty_set,
i_0_137 ).
cnf(c_0_216,plain,
set_difference(X1,empty_set) = X1,
i_0_156 ).
cnf(c_0_217,plain,
( disjoint(X1,X2)
| set_difference(X1,set_difference(X1,X2)) != empty_set ),
i_0_66 ).
cnf(c_0_218,negated_conjecture,
set_difference(esk27_0,set_difference(esk27_0,esk25_0)) = esk27_0,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_212,c_0_211]),c_0_213]),c_0_208])]),c_0_214]) ).
cnf(c_0_219,plain,
set_difference(X1,X1) = empty_set,
inference(rw,[status(thm)],[c_0_215,c_0_216]) ).
cnf(c_0_220,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
i_0_117 ).
cnf(c_0_221,plain,
disjoint(esk27_0,set_difference(esk27_0,esk25_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_218]),c_0_219])]) ).
cnf(c_0_222,lemma,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
i_0_182 ).
cnf(c_0_223,plain,
disjoint(set_difference(esk27_0,esk25_0),esk27_0),
inference(spm,[status(thm)],[c_0_220,c_0_221]) ).
cnf(c_0_224,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
i_0_99 ).
cnf(c_0_225,lemma,
set_difference(set_difference(esk27_0,esk25_0),esk27_0) = set_difference(esk27_0,esk25_0),
inference(spm,[status(thm)],[c_0_222,c_0_223]) ).
cnf(c_0_226,lemma,
subset(set_difference(X1,X2),X1),
i_0_144 ).
cnf(c_0_227,lemma,
set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
i_0_161 ).
cnf(c_0_228,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
i_0_152 ).
cnf(c_0_229,lemma,
set_difference(esk27_0,esk25_0) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_226])]) ).
cnf(c_0_230,plain,
set_union2(X1,empty_set) = X1,
i_0_132 ).
cnf(c_0_231,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_4 ).
cnf(c_0_232,lemma,
set_difference(set_union2(X1,X2),set_difference(X2,X1)) = set_difference(X1,set_difference(X2,X1)),
inference(spm,[status(thm)],[c_0_227,c_0_228]) ).
cnf(c_0_233,lemma,
set_union2(esk27_0,esk25_0) = esk25_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_230]),c_0_231]) ).
cnf(c_0_234,lemma,
( disjoint(X1,X2)
| ~ subset(X1,X3)
| ~ disjoint(X3,X2) ),
i_0_173 ).
cnf(c_0_235,negated_conjecture,
( disjoint(esk26_0,esk27_0)
| subset(esk26_0,subset_complement(esk25_0,esk27_0)) ),
i_0_162 ).
cnf(c_0_236,lemma,
set_difference(esk27_0,set_difference(esk25_0,esk27_0)) = esk27_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_214]),c_0_229]),c_0_216]) ).
cnf(c_0_237,negated_conjecture,
( disjoint(esk26_0,esk27_0)
| disjoint(esk26_0,X1)
| ~ disjoint(subset_complement(esk25_0,esk27_0),X1) ),
inference(spm,[status(thm)],[c_0_234,c_0_235]) ).
cnf(c_0_238,plain,
disjoint(esk27_0,set_difference(esk25_0,esk27_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_236]),c_0_219])]) ).
cnf(c_0_239,negated_conjecture,
( disjoint(esk26_0,esk27_0)
| disjoint(esk26_0,X1)
| ~ disjoint(set_difference(esk25_0,esk27_0),X1) ),
inference(rw,[status(thm)],[c_0_237,c_0_211]) ).
cnf(c_0_240,plain,
disjoint(set_difference(esk25_0,esk27_0),esk27_0),
inference(spm,[status(thm)],[c_0_220,c_0_238]) ).
cnf(c_0_241,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_22 ).
cnf(c_0_242,negated_conjecture,
element(esk26_0,powerset(esk25_0)),
i_0_165 ).
cnf(c_0_243,plain,
~ empty(powerset(X1)),
i_0_84 ).
cnf(c_0_244,negated_conjecture,
( ~ disjoint(esk26_0,esk27_0)
| ~ subset(esk26_0,subset_complement(esk25_0,esk27_0)) ),
i_0_163 ).
cnf(c_0_245,negated_conjecture,
disjoint(esk26_0,esk27_0),
inference(spm,[status(thm)],[c_0_239,c_0_240]) ).
cnf(c_0_246,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
i_0_18 ).
cnf(c_0_247,negated_conjecture,
in(esk26_0,powerset(esk25_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_243]) ).
cnf(c_0_248,negated_conjecture,
( ~ disjoint(esk26_0,esk27_0)
| ~ subset(esk26_0,set_difference(esk25_0,esk27_0)) ),
inference(rw,[status(thm)],[c_0_244,c_0_211]) ).
cnf(c_0_249,lemma,
( subset(set_difference(X1,X2),set_difference(X3,X2))
| ~ subset(X1,X3) ),
i_0_141 ).
cnf(c_0_250,lemma,
set_difference(esk26_0,esk27_0) = esk26_0,
inference(spm,[status(thm)],[c_0_222,c_0_245]) ).
cnf(c_0_251,plain,
( subset(esk26_0,X1)
| powerset(esk25_0) != powerset(X1) ),
inference(spm,[status(thm)],[c_0_246,c_0_247]) ).
cnf(c_0_252,negated_conjecture,
~ subset(esk26_0,set_difference(esk25_0,esk27_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_248,c_0_245])]) ).
cnf(c_0_253,lemma,
( subset(esk26_0,set_difference(X1,esk27_0))
| ~ subset(esk26_0,X1) ),
inference(spm,[status(thm)],[c_0_249,c_0_250]) ).
cnf(c_0_254,plain,
subset(esk26_0,esk25_0),
inference(er,[status(thm)],[c_0_251]) ).
cnf(c_0_255,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_253]),c_0_254])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SEU170+2 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 21:28:41 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected complete mode:
% 15.08/3.41 # ENIGMATIC: Solved by autoschedule:
% 15.08/3.41 # No SInE strategy applied
% 15.08/3.41 # Trying AutoSched0 for 150 seconds
% 15.08/3.41 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y
% 15.08/3.41 # and selection function SelectMaxLComplexAvoidPosPred.
% 15.08/3.41 #
% 15.08/3.41 # Preprocessing time : 0.028 s
% 15.08/3.41
% 15.08/3.41 # Proof found!
% 15.08/3.41 # SZS status Theorem
% 15.08/3.41 # SZS output start CNFRefutation
% See solution above
% 15.08/3.41 # Training examples: 0 positive, 0 negative
% 15.08/3.41
% 15.08/3.41 # -------------------------------------------------
% 15.08/3.41 # User time : 0.796 s
% 15.08/3.41 # System time : 0.026 s
% 15.08/3.41 # Total time : 0.822 s
% 15.08/3.41 # Maximum resident set size: 7120 pages
% 15.08/3.41
%------------------------------------------------------------------------------