TSTP Solution File: SEU337+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU337+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:56 EDT 2022
% Result : Theorem 9.24s 3.11s
% Output : CNFRefutation 9.24s
% 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 : 4 ( 2 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_2147,lemma,
( open_subsets(complements_of_subsets(the_carrier(X1),X2),X1)
| ~ top_str(X1)
| ~ closed_subsets(X2,X1)
| ~ element(X2,powerset(powerset(the_carrier(X1)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m6evww0/lgb.p',i_0_2147) ).
cnf(i_0_623,plain,
( complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m6evww0/lgb.p',i_0_623) ).
cnf(i_0_455,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m6evww0/lgb.p',i_0_455) ).
cnf(i_0_2155,negated_conjecture,
( open_subsets(esk383_0,esk382_0)
| closed_subsets(complements_of_subsets(the_carrier(esk382_0),esk383_0),esk382_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m6evww0/lgb.p',i_0_2155) ).
cnf(i_0_2158,negated_conjecture,
top_str(esk382_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m6evww0/lgb.p',i_0_2158) ).
cnf(i_0_2157,negated_conjecture,
element(esk383_0,powerset(powerset(the_carrier(esk382_0)))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m6evww0/lgb.p',i_0_2157) ).
cnf(i_0_2156,negated_conjecture,
( ~ open_subsets(esk383_0,esk382_0)
| ~ closed_subsets(complements_of_subsets(the_carrier(esk382_0),esk383_0),esk382_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m6evww0/lgb.p',i_0_2156) ).
cnf(i_0_2146,lemma,
( closed_subsets(X1,X2)
| ~ top_str(X2)
| ~ open_subsets(complements_of_subsets(the_carrier(X2),X1),X2)
| ~ element(X1,powerset(powerset(the_carrier(X2)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4m6evww0/lgb.p',i_0_2146) ).
cnf(c_0_2167,lemma,
( open_subsets(complements_of_subsets(the_carrier(X1),X2),X1)
| ~ top_str(X1)
| ~ closed_subsets(X2,X1)
| ~ element(X2,powerset(powerset(the_carrier(X1)))) ),
i_0_2147 ).
cnf(c_0_2168,plain,
( complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2
| ~ element(X2,powerset(powerset(X1))) ),
i_0_623 ).
cnf(c_0_2169,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
i_0_455 ).
cnf(c_0_2170,plain,
( open_subsets(X1,X2)
| ~ top_str(X2)
| ~ element(X1,powerset(powerset(the_carrier(X2))))
| ~ closed_subsets(complements_of_subsets(the_carrier(X2),X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_2167,c_0_2168]),c_0_2169]) ).
cnf(c_0_2171,negated_conjecture,
( open_subsets(esk383_0,esk382_0)
| closed_subsets(complements_of_subsets(the_carrier(esk382_0),esk383_0),esk382_0) ),
i_0_2155 ).
cnf(c_0_2172,negated_conjecture,
top_str(esk382_0),
i_0_2158 ).
cnf(c_0_2173,negated_conjecture,
element(esk383_0,powerset(powerset(the_carrier(esk382_0)))),
i_0_2157 ).
cnf(c_0_2174,negated_conjecture,
( ~ open_subsets(esk383_0,esk382_0)
| ~ closed_subsets(complements_of_subsets(the_carrier(esk382_0),esk383_0),esk382_0) ),
i_0_2156 ).
cnf(c_0_2175,negated_conjecture,
open_subsets(esk383_0,esk382_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2170,c_0_2171]),c_0_2172]),c_0_2173])]) ).
cnf(c_0_2176,lemma,
( closed_subsets(X1,X2)
| ~ top_str(X2)
| ~ open_subsets(complements_of_subsets(the_carrier(X2),X1),X2)
| ~ element(X1,powerset(powerset(the_carrier(X2)))) ),
i_0_2146 ).
cnf(c_0_2177,negated_conjecture,
~ closed_subsets(complements_of_subsets(the_carrier(esk382_0),esk383_0),esk382_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2174,c_0_2175])]) ).
cnf(c_0_2178,lemma,
( closed_subsets(complements_of_subsets(the_carrier(X1),X2),X1)
| ~ top_str(X1)
| ~ element(X2,powerset(powerset(the_carrier(X1))))
| ~ open_subsets(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_2176,c_0_2168]),c_0_2169]) ).
cnf(c_0_2179,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_2177,c_0_2178]),c_0_2172]),c_0_2173]),c_0_2175])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU337+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 04:37:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.24/3.11 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.24/3.11 # No SInE strategy applied
% 9.24/3.11 # Trying AutoSched0 for 150 seconds
% 9.24/3.11 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 9.24/3.11 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.24/3.11 #
% 9.24/3.11 # Preprocessing time : 0.026 s
% 9.24/3.11
% 9.24/3.11 # Proof found!
% 9.24/3.11 # SZS status Theorem
% 9.24/3.11 # SZS output start CNFRefutation
% See solution above
% 9.24/3.11 # Training examples: 0 positive, 0 negative
% 9.24/3.11
% 9.24/3.11 # -------------------------------------------------
% 9.24/3.11 # User time : 0.037 s
% 9.24/3.11 # System time : 0.006 s
% 9.24/3.11 # Total time : 0.043 s
% 9.24/3.11 # Maximum resident set size: 7120 pages
% 9.24/3.11
%------------------------------------------------------------------------------