TSTP Solution File: SEU320+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU320+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:40:46 EDT 2022
% Result : Theorem 9.13s 3.07s
% Output : CNFRefutation 9.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 7 unt; 2 nHn; 21 RR)
% Number of literals : 47 ( 2 equ; 27 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1772,lemma,
( closed_subset(X1,X2)
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ open_subset(subset_complement(the_carrier(X2),X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3a66o6x5/lgb.p',i_0_1772) ).
cnf(i_0_602,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3a66o6x5/lgb.p',i_0_602) ).
cnf(i_0_428,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3a66o6x5/lgb.p',i_0_428) ).
cnf(i_0_1783,negated_conjecture,
( ~ open_subset(esk322_0,esk321_0)
| ~ closed_subset(subset_complement(the_carrier(esk321_0),esk322_0),esk321_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3a66o6x5/lgb.p',i_0_1783) ).
cnf(i_0_1785,negated_conjecture,
top_str(esk321_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3a66o6x5/lgb.p',i_0_1785) ).
cnf(i_0_1784,negated_conjecture,
element(esk322_0,powerset(the_carrier(esk321_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3a66o6x5/lgb.p',i_0_1784) ).
cnf(i_0_1773,lemma,
( open_subset(subset_complement(the_carrier(X1),X2),X1)
| ~ top_str(X1)
| ~ closed_subset(X2,X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3a66o6x5/lgb.p',i_0_1773) ).
cnf(i_0_1782,negated_conjecture,
( open_subset(esk322_0,esk321_0)
| closed_subset(subset_complement(the_carrier(esk321_0),esk322_0),esk321_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3a66o6x5/lgb.p',i_0_1782) ).
cnf(c_0_1794,lemma,
( closed_subset(X1,X2)
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ open_subset(subset_complement(the_carrier(X2),X1),X2) ),
i_0_1772 ).
cnf(c_0_1795,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
i_0_602 ).
cnf(c_0_1796,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
i_0_428 ).
cnf(c_0_1797,negated_conjecture,
( ~ open_subset(esk322_0,esk321_0)
| ~ closed_subset(subset_complement(the_carrier(esk321_0),esk322_0),esk321_0) ),
i_0_1783 ).
cnf(c_0_1798,lemma,
( closed_subset(subset_complement(the_carrier(X1),X2),X1)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ open_subset(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_1794,c_0_1795]),c_0_1796]) ).
cnf(c_0_1799,negated_conjecture,
top_str(esk321_0),
i_0_1785 ).
cnf(c_0_1800,negated_conjecture,
element(esk322_0,powerset(the_carrier(esk321_0))),
i_0_1784 ).
cnf(c_0_1801,lemma,
( open_subset(subset_complement(the_carrier(X1),X2),X1)
| ~ top_str(X1)
| ~ closed_subset(X2,X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
i_0_1773 ).
cnf(c_0_1802,negated_conjecture,
( open_subset(esk322_0,esk321_0)
| closed_subset(subset_complement(the_carrier(esk321_0),esk322_0),esk321_0) ),
i_0_1782 ).
cnf(c_0_1803,negated_conjecture,
~ open_subset(esk322_0,esk321_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1797,c_0_1798]),c_0_1799]),c_0_1800])]) ).
cnf(c_0_1804,plain,
( open_subset(X1,X2)
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ closed_subset(subset_complement(the_carrier(X2),X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_1801,c_0_1795]),c_0_1796]) ).
cnf(c_0_1805,negated_conjecture,
closed_subset(subset_complement(the_carrier(esk321_0),esk322_0),esk321_0),
inference(sr,[status(thm)],[c_0_1802,c_0_1803]) ).
cnf(c_0_1806,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1804,c_0_1805]),c_0_1799]),c_0_1800])]),c_0_1803]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU320+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n016.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 Jun 20 06:38:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.13/3.07 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.13/3.07 # No SInE strategy applied
% 9.13/3.07 # Trying AutoSched0 for 150 seconds
% 9.13/3.07 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 9.13/3.07 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.13/3.07 #
% 9.13/3.07 # Preprocessing time : 0.025 s
% 9.13/3.07
% 9.13/3.07 # Proof found!
% 9.13/3.07 # SZS status Theorem
% 9.13/3.07 # SZS output start CNFRefutation
% See solution above
% 9.13/3.07 # Training examples: 0 positive, 0 negative
% 9.13/3.07
% 9.13/3.07 # -------------------------------------------------
% 9.13/3.07 # User time : 0.049 s
% 9.13/3.07 # System time : 0.006 s
% 9.13/3.07 # Total time : 0.055 s
% 9.13/3.07 # Maximum resident set size: 7128 pages
% 9.13/3.07
%------------------------------------------------------------------------------