TSTP Solution File: SEU171+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU171+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:10 EDT 2022
% Result : Theorem 8.42s 2.46s
% Output : CNFRefutation 8.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 24
% Syntax : Number of clauses : 71 ( 34 unt; 12 nHn; 54 RR)
% Number of literals : 121 ( 31 equ; 56 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 104 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_22,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_22) ).
cnf(i_0_173,negated_conjecture,
element(esk27_0,powerset(esk26_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_173) ).
cnf(i_0_84,plain,
~ empty(powerset(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_84) ).
cnf(i_0_97,lemma,
( subset(unordered_pair(X1,X1),X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_97) ).
cnf(i_0_32,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_32) ).
cnf(i_0_45,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_45) ).
cnf(i_0_13,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_13) ).
cnf(i_0_93,lemma,
unordered_pair(X1,X1) != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_93) ).
cnf(i_0_182,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_182) ).
cnf(i_0_164,lemma,
( set_union2(X1,set_difference(X2,X1)) = X2
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_164) ).
cnf(i_0_152,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_152) ).
cnf(i_0_189,lemma,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_189) ).
cnf(i_0_190,lemma,
union(powerset(X1)) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_190) ).
cnf(i_0_64,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_64) ).
cnf(i_0_4,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_4) ).
cnf(i_0_170,negated_conjecture,
~ in(esk28_0,subset_complement(esk26_0,esk27_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_170) ).
cnf(i_0_172,negated_conjecture,
element(esk28_0,esk26_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_172) ).
cnf(i_0_174,negated_conjecture,
esk26_0 != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_174) ).
cnf(i_0_62,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_62) ).
cnf(i_0_177,lemma,
( set_difference(X1,unordered_pair(X2,X2)) = X1
| in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_177) ).
cnf(i_0_61,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_61) ).
cnf(i_0_151,lemma,
( in(X1,X2)
| ~ subset(unordered_pair(X1,X3),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_151) ).
cnf(i_0_116,plain,
subset(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_116) ).
cnf(i_0_171,negated_conjecture,
~ in(esk28_0,esk27_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3iuavynk/lgb.p',i_0_171) ).
cnf(c_0_215,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_22 ).
cnf(c_0_216,negated_conjecture,
element(esk27_0,powerset(esk26_0)),
i_0_173 ).
cnf(c_0_217,plain,
~ empty(powerset(X1)),
i_0_84 ).
cnf(c_0_218,lemma,
( subset(unordered_pair(X1,X1),X2)
| ~ in(X1,X2) ),
i_0_97 ).
cnf(c_0_219,negated_conjecture,
in(esk27_0,powerset(esk26_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_215,c_0_216]),c_0_217]) ).
cnf(c_0_220,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
i_0_32 ).
cnf(c_0_221,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_45 ).
cnf(c_0_222,lemma,
subset(unordered_pair(esk27_0,esk27_0),powerset(esk26_0)),
inference(spm,[status(thm)],[c_0_218,c_0_219]) ).
cnf(c_0_223,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_220]) ).
cnf(c_0_224,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
i_0_13 ).
cnf(c_0_225,plain,
( in(X1,powerset(esk26_0))
| ~ in(X1,unordered_pair(esk27_0,esk27_0)) ),
inference(spm,[status(thm)],[c_0_221,c_0_222]) ).
cnf(c_0_226,lemma,
unordered_pair(X1,X1) != empty_set,
i_0_93 ).
cnf(c_0_227,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
i_0_182 ).
cnf(c_0_228,plain,
( X1 = empty_set
| in(esk2_1(X1),set_union2(X2,X1)) ),
inference(spm,[status(thm)],[c_0_223,c_0_224]) ).
cnf(c_0_229,lemma,
( set_union2(X1,set_difference(X2,X1)) = X2
| ~ subset(X1,X2) ),
i_0_164 ).
cnf(c_0_230,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
i_0_152 ).
cnf(c_0_231,lemma,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
i_0_189 ).
cnf(c_0_232,plain,
in(esk2_1(unordered_pair(esk27_0,esk27_0)),powerset(esk26_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_224]),c_0_226]) ).
cnf(c_0_233,lemma,
union(powerset(X1)) = X1,
i_0_190 ).
cnf(c_0_234,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
i_0_64 ).
cnf(c_0_235,plain,
( X1 = empty_set
| ~ empty(set_union2(X2,X1)) ),
inference(spm,[status(thm)],[c_0_227,c_0_228]) ).
cnf(c_0_236,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_4 ).
cnf(c_0_237,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(rw,[status(thm)],[c_0_229,c_0_230]) ).
cnf(c_0_238,lemma,
subset(esk2_1(unordered_pair(esk27_0,esk27_0)),esk26_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_233]) ).
cnf(c_0_239,negated_conjecture,
~ in(esk28_0,subset_complement(esk26_0,esk27_0)),
i_0_170 ).
cnf(c_0_240,negated_conjecture,
subset_complement(esk26_0,esk27_0) = set_difference(esk26_0,esk27_0),
inference(spm,[status(thm)],[c_0_234,c_0_216]) ).
cnf(c_0_241,negated_conjecture,
element(esk28_0,esk26_0),
i_0_172 ).
cnf(c_0_242,plain,
( X1 = empty_set
| ~ empty(set_union2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_235,c_0_236]) ).
cnf(c_0_243,lemma,
set_union2(esk26_0,esk2_1(unordered_pair(esk27_0,esk27_0))) = esk26_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_236]) ).
cnf(c_0_244,negated_conjecture,
esk26_0 != empty_set,
i_0_174 ).
cnf(c_0_245,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
i_0_62 ).
cnf(c_0_246,negated_conjecture,
~ in(esk28_0,set_difference(esk26_0,esk27_0)),
inference(rw,[status(thm)],[c_0_239,c_0_240]) ).
cnf(c_0_247,lemma,
( set_difference(X1,unordered_pair(X2,X2)) = X1
| in(X2,X1) ),
i_0_177 ).
cnf(c_0_248,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
i_0_61 ).
cnf(c_0_249,negated_conjecture,
( empty(esk26_0)
| in(esk28_0,esk26_0) ),
inference(spm,[status(thm)],[c_0_215,c_0_241]) ).
cnf(c_0_250,lemma,
~ empty(esk26_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_242,c_0_243]),c_0_244]) ).
cnf(c_0_251,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_245]) ).
cnf(c_0_252,lemma,
set_difference(set_difference(esk26_0,esk27_0),unordered_pair(esk28_0,esk28_0)) = set_difference(esk26_0,esk27_0),
inference(spm,[status(thm)],[c_0_246,c_0_247]) ).
cnf(c_0_253,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_248]) ).
cnf(c_0_254,negated_conjecture,
in(esk28_0,esk26_0),
inference(sr,[status(thm)],[c_0_249,c_0_250]) ).
cnf(c_0_255,lemma,
( in(X1,X2)
| ~ subset(unordered_pair(X1,X3),X2) ),
i_0_151 ).
cnf(c_0_256,plain,
subset(X1,X1),
i_0_116 ).
cnf(c_0_257,plain,
( ~ in(X1,set_difference(esk26_0,esk27_0))
| ~ in(X1,unordered_pair(esk28_0,esk28_0)) ),
inference(spm,[status(thm)],[c_0_251,c_0_252]) ).
cnf(c_0_258,plain,
( in(esk28_0,set_difference(esk26_0,X1))
| in(esk28_0,X1) ),
inference(spm,[status(thm)],[c_0_253,c_0_254]) ).
cnf(c_0_259,plain,
in(X1,unordered_pair(X1,X2)),
inference(spm,[status(thm)],[c_0_255,c_0_256]) ).
cnf(c_0_260,negated_conjecture,
~ in(esk28_0,esk27_0),
i_0_171 ).
cnf(c_0_261,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_258]),c_0_259])]),c_0_260]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU171+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n006.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 19 01:58:42 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected complete mode:
% 8.42/2.46 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.42/2.46 # No SInE strategy applied
% 8.42/2.46 # Trying AutoSched0 for 150 seconds
% 8.42/2.46 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 8.42/2.46 # and selection function SelectComplexG.
% 8.42/2.46 #
% 8.42/2.46 # Preprocessing time : 0.024 s
% 8.42/2.46
% 8.42/2.46 # Proof found!
% 8.42/2.46 # SZS status Theorem
% 8.42/2.46 # SZS output start CNFRefutation
% See solution above
% 8.42/2.46 # Training examples: 0 positive, 0 negative
% 8.42/2.46
% 8.42/2.46 # -------------------------------------------------
% 8.42/2.46 # User time : 0.076 s
% 8.42/2.46 # System time : 0.009 s
% 8.42/2.46 # Total time : 0.085 s
% 8.42/2.46 # Maximum resident set size: 7124 pages
% 8.42/2.46
%------------------------------------------------------------------------------