TSTP Solution File: SEU319+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU319+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:40:46 EDT 2022
% Result : Theorem 9.33s 2.99s
% Output : CNFRefutation 9.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 31 ( 9 unt; 3 nHn; 29 RR)
% Number of literals : 71 ( 8 equ; 40 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_357,plain,
( closed_subset(X1,X2)
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ open_subset(subset_difference(the_carrier(X2),cast_as_carrier_subset(X2),X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzsg487o/lgb.p',i_0_357) ).
cnf(i_0_267,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzsg487o/lgb.p',i_0_267) ).
cnf(i_0_444,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzsg487o/lgb.p',i_0_444) ).
cnf(i_0_740,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-dzsg487o/lgb.p',i_0_740) ).
cnf(i_0_425,plain,
element(X1,powerset(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzsg487o/lgb.p',i_0_425) ).
cnf(i_0_1772,negated_conjecture,
( closed_subset(esk321_0,esk320_0)
| open_subset(subset_complement(the_carrier(esk320_0),esk321_0),esk320_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzsg487o/lgb.p',i_0_1772) ).
cnf(i_0_347,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzsg487o/lgb.p',i_0_347) ).
cnf(i_0_1774,negated_conjecture,
element(esk321_0,powerset(the_carrier(esk320_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzsg487o/lgb.p',i_0_1774) ).
cnf(i_0_1775,negated_conjecture,
top_str(esk320_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzsg487o/lgb.p',i_0_1775) ).
cnf(i_0_1773,negated_conjecture,
( ~ closed_subset(esk321_0,esk320_0)
| ~ open_subset(subset_complement(the_carrier(esk320_0),esk321_0),esk320_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzsg487o/lgb.p',i_0_1773) ).
cnf(i_0_358,plain,
( open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1)
| ~ top_str(X1)
| ~ closed_subset(X2,X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzsg487o/lgb.p',i_0_358) ).
cnf(i_0_1714,lemma,
( subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) = subset_complement(the_carrier(X1),X2)
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzsg487o/lgb.p',i_0_1714) ).
cnf(c_0_1788,plain,
( closed_subset(X1,X2)
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ open_subset(subset_difference(the_carrier(X2),cast_as_carrier_subset(X2),X1),X2) ),
i_0_357 ).
cnf(c_0_1789,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
i_0_267 ).
cnf(c_0_1790,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
i_0_444 ).
cnf(c_0_1791,plain,
( closed_subset(X1,X2)
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ open_subset(subset_difference(the_carrier(X2),the_carrier(X2),X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_1788,c_0_1789]),c_0_1790]) ).
cnf(c_0_1792,plain,
( subset_difference(X1,X2,X3) = set_difference(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
i_0_740 ).
cnf(c_0_1793,plain,
element(X1,powerset(X1)),
i_0_425 ).
cnf(c_0_1794,negated_conjecture,
( closed_subset(esk321_0,esk320_0)
| open_subset(subset_complement(the_carrier(esk320_0),esk321_0),esk320_0) ),
i_0_1772 ).
cnf(c_0_1795,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
i_0_347 ).
cnf(c_0_1796,negated_conjecture,
element(esk321_0,powerset(the_carrier(esk320_0))),
i_0_1774 ).
cnf(c_0_1797,plain,
( closed_subset(X1,X2)
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ open_subset(set_difference(the_carrier(X2),X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1791,c_0_1792]),c_0_1793])]) ).
cnf(c_0_1798,negated_conjecture,
( open_subset(set_difference(the_carrier(esk320_0),esk321_0),esk320_0)
| closed_subset(esk321_0,esk320_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1794,c_0_1795]),c_0_1796])]) ).
cnf(c_0_1799,negated_conjecture,
top_str(esk320_0),
i_0_1775 ).
cnf(c_0_1800,negated_conjecture,
( ~ closed_subset(esk321_0,esk320_0)
| ~ open_subset(subset_complement(the_carrier(esk320_0),esk321_0),esk320_0) ),
i_0_1773 ).
cnf(c_0_1801,negated_conjecture,
closed_subset(esk321_0,esk320_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_1796])]) ).
cnf(c_0_1802,plain,
( open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1)
| ~ top_str(X1)
| ~ closed_subset(X2,X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
i_0_358 ).
cnf(c_0_1803,lemma,
( subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) = subset_complement(the_carrier(X1),X2)
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
i_0_1714 ).
cnf(c_0_1804,negated_conjecture,
~ open_subset(subset_complement(the_carrier(esk320_0),esk321_0),esk320_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1800,c_0_1801])]) ).
cnf(c_0_1805,lemma,
( open_subset(subset_complement(the_carrier(X1),X2),X1)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ closed_subset(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_1802,c_0_1803]),c_0_1790]) ).
cnf(c_0_1806,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[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_1796]),c_0_1801])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU319+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 02:09:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.49 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.33/2.99 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.33/2.99 # No SInE strategy applied
% 9.33/2.99 # Trying AutoSched0 for 150 seconds
% 9.33/2.99 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 9.33/2.99 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.33/2.99 #
% 9.33/2.99 # Preprocessing time : 0.016 s
% 9.33/2.99
% 9.33/2.99 # Proof found!
% 9.33/2.99 # SZS status Theorem
% 9.33/2.99 # SZS output start CNFRefutation
% See solution above
% 9.33/2.99 # Training examples: 0 positive, 0 negative
% 9.33/2.99
% 9.33/2.99 # -------------------------------------------------
% 9.33/2.99 # User time : 0.021 s
% 9.33/2.99 # System time : 0.012 s
% 9.33/2.99 # Total time : 0.033 s
% 9.33/2.99 # Maximum resident set size: 7124 pages
% 9.33/2.99
%------------------------------------------------------------------------------