TSTP Solution File: SEU176+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU176+2 : TPTP v8.1.0. Released v3.3.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 08:39:13 EDT 2022
% Result : Theorem 11.69s 3.46s
% Output : CNFRefutation 11.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 41 ( 21 unt; 2 nHn; 39 RR)
% Number of literals : 67 ( 31 equ; 30 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_101,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_101) ).
cnf(i_0_200,negated_conjecture,
element(esk31_0,powerset(powerset(esk30_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_200) ).
cnf(i_0_98,plain,
( element(union_of_subsets(X1,X2),powerset(X1))
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_98) ).
cnf(i_0_112,plain,
( complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_112) ).
cnf(i_0_195,lemma,
( X1 = empty_set
| complements_of_subsets(X2,X1) != empty_set
| ~ element(X1,powerset(powerset(X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_195) ).
cnf(i_0_199,negated_conjecture,
esk31_0 != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_199) ).
cnf(i_0_73,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_73) ).
cnf(i_0_141,plain,
( subset_difference(X1,X2,X3) = set_difference(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_141) ).
cnf(i_0_197,lemma,
( X1 = empty_set
| subset_difference(X2,X2,union_of_subsets(X2,X1)) = meet_of_subsets(X2,complements_of_subsets(X2,X1))
| ~ element(X1,powerset(powerset(X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_197) ).
cnf(i_0_99,plain,
( element(meet_of_subsets(X1,X2),powerset(X1))
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_99) ).
cnf(i_0_111,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_111) ).
cnf(i_0_89,plain,
element(X1,powerset(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_89) ).
cnf(i_0_198,negated_conjecture,
subset_difference(esk30_0,esk30_0,meet_of_subsets(esk30_0,esk31_0)) != union_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2p7ioin9/lgb.p',i_0_198) ).
cnf(c_0_214,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
i_0_101 ).
cnf(c_0_215,negated_conjecture,
element(esk31_0,powerset(powerset(esk30_0))),
i_0_200 ).
cnf(c_0_216,plain,
( element(union_of_subsets(X1,X2),powerset(X1))
| ~ element(X2,powerset(powerset(X1))) ),
i_0_98 ).
cnf(c_0_217,negated_conjecture,
element(complements_of_subsets(esk30_0,esk31_0),powerset(powerset(esk30_0))),
inference(spm,[status(thm)],[c_0_214,c_0_215]) ).
cnf(c_0_218,plain,
( complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2
| ~ element(X2,powerset(powerset(X1))) ),
i_0_112 ).
cnf(c_0_219,lemma,
( X1 = empty_set
| complements_of_subsets(X2,X1) != empty_set
| ~ element(X1,powerset(powerset(X2))) ),
i_0_195 ).
cnf(c_0_220,negated_conjecture,
esk31_0 != empty_set,
i_0_199 ).
cnf(c_0_221,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
i_0_73 ).
cnf(c_0_222,plain,
element(union_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0)),powerset(esk30_0)),
inference(spm,[status(thm)],[c_0_216,c_0_217]) ).
cnf(c_0_223,plain,
( subset_difference(X1,X2,X3) = set_difference(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
i_0_141 ).
cnf(c_0_224,lemma,
( X1 = empty_set
| subset_difference(X2,X2,union_of_subsets(X2,X1)) = meet_of_subsets(X2,complements_of_subsets(X2,X1))
| ~ element(X1,powerset(powerset(X2))) ),
i_0_197 ).
cnf(c_0_225,negated_conjecture,
complements_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0)) = esk31_0,
inference(spm,[status(thm)],[c_0_218,c_0_215]) ).
cnf(c_0_226,negated_conjecture,
complements_of_subsets(esk30_0,esk31_0) != empty_set,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_215]),c_0_220]) ).
cnf(c_0_227,plain,
( element(meet_of_subsets(X1,X2),powerset(X1))
| ~ element(X2,powerset(powerset(X1))) ),
i_0_99 ).
cnf(c_0_228,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
i_0_111 ).
cnf(c_0_229,plain,
subset_complement(esk30_0,union_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0))) = set_difference(esk30_0,union_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0))),
inference(spm,[status(thm)],[c_0_221,c_0_222]) ).
cnf(c_0_230,plain,
( subset_difference(esk30_0,X1,union_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0))) = set_difference(X1,union_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0)))
| ~ element(X1,powerset(esk30_0)) ),
inference(spm,[status(thm)],[c_0_223,c_0_222]) ).
cnf(c_0_231,plain,
element(X1,powerset(X1)),
i_0_89 ).
cnf(c_0_232,negated_conjecture,
subset_difference(esk30_0,esk30_0,union_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0))) = meet_of_subsets(esk30_0,esk31_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_217]),c_0_225]),c_0_226]) ).
cnf(c_0_233,negated_conjecture,
element(meet_of_subsets(esk30_0,esk31_0),powerset(esk30_0)),
inference(spm,[status(thm)],[c_0_227,c_0_215]) ).
cnf(c_0_234,plain,
subset_complement(esk30_0,set_difference(esk30_0,union_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0)))) = union_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_222]),c_0_229]) ).
cnf(c_0_235,plain,
set_difference(esk30_0,union_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0))) = meet_of_subsets(esk30_0,esk31_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232]) ).
cnf(c_0_236,plain,
subset_complement(esk30_0,meet_of_subsets(esk30_0,esk31_0)) = set_difference(esk30_0,meet_of_subsets(esk30_0,esk31_0)),
inference(spm,[status(thm)],[c_0_221,c_0_233]) ).
cnf(c_0_237,negated_conjecture,
subset_difference(esk30_0,esk30_0,meet_of_subsets(esk30_0,esk31_0)) != union_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0)),
i_0_198 ).
cnf(c_0_238,plain,
union_of_subsets(esk30_0,complements_of_subsets(esk30_0,esk31_0)) = set_difference(esk30_0,meet_of_subsets(esk30_0,esk31_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_235]),c_0_236]) ).
cnf(c_0_239,negated_conjecture,
( subset_difference(esk30_0,X1,meet_of_subsets(esk30_0,esk31_0)) = set_difference(X1,meet_of_subsets(esk30_0,esk31_0))
| ~ element(X1,powerset(esk30_0)) ),
inference(spm,[status(thm)],[c_0_223,c_0_233]) ).
cnf(c_0_240,negated_conjecture,
subset_difference(esk30_0,esk30_0,meet_of_subsets(esk30_0,esk31_0)) != set_difference(esk30_0,meet_of_subsets(esk30_0,esk31_0)),
inference(rw,[status(thm)],[c_0_237,c_0_238]) ).
cnf(c_0_241,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_231]),c_0_240]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU176+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 17:12:31 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 11.69/3.46 # ENIGMATIC: Solved by autoschedule-lgb:
% 11.69/3.46 # No SInE strategy applied
% 11.69/3.46 # Trying AutoSched0 for 150 seconds
% 11.69/3.46 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02CN
% 11.69/3.46 # and selection function SelectAntiRROptimalLit.
% 11.69/3.46 #
% 11.69/3.46 # Preprocessing time : 0.019 s
% 11.69/3.46 # Presaturation interreduction done
% 11.69/3.46
% 11.69/3.46 # Proof found!
% 11.69/3.46 # SZS status Theorem
% 11.69/3.46 # SZS output start CNFRefutation
% See solution above
% 11.69/3.46 # Training examples: 0 positive, 0 negative
% 11.69/3.46
% 11.69/3.46 # -------------------------------------------------
% 11.69/3.46 # User time : 0.317 s
% 11.69/3.46 # System time : 0.027 s
% 11.69/3.46 # Total time : 0.344 s
% 11.69/3.46 # Maximum resident set size: 7124 pages
% 11.69/3.46
%------------------------------------------------------------------------------