TSTP Solution File: SEU387+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU387+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:41:46 EDT 2022
% Result : Theorem 10.01s 3.66s
% Output : CNFRefutation 10.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 17
% Syntax : Number of clauses : 42 ( 33 unt; 2 nHn; 28 RR)
% Number of literals : 88 ( 7 equ; 49 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-1 aty)
% Number of variables : 32 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3695,lemma,
( empty_carrier(X1)
| empty(X2)
| ~ rel_str(X1)
| ~ reflexive_relstr(X1)
| ~ transitive_relstr(X1)
| ~ antisymmetric_relstr(X1)
| ~ lower_bounded_relstr(X1)
| ~ filtered_subset(X2,X1)
| ~ upper_relstr_subset(X2,X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ proper_element(X2,powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_3695) ).
cnf(i_0_3675,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_3675) ).
cnf(i_0_3401,lemma,
the_carrier(incl_POSet(X1)) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_3401) ).
cnf(i_0_1295,plain,
antisymmetric_relstr(incl_POSet(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_1295) ).
cnf(i_0_1296,plain,
transitive_relstr(incl_POSet(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_1296) ).
cnf(i_0_1297,plain,
reflexive_relstr(incl_POSet(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_1297) ).
cnf(i_0_893,plain,
rel_str(incl_POSet(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_893) ).
cnf(i_0_3659,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_3659) ).
cnf(i_0_3470,negated_conjecture,
empty(esk515_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_3470) ).
cnf(i_0_3381,lemma,
bottom_of_relstr(incl_POSet(powerset(X1))) = empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_3381) ).
cnf(i_0_1358,plain,
lower_bounded_relstr(incl_POSet(powerset(X1))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_1358) ).
cnf(i_0_1366,plain,
~ empty_carrier(incl_POSet(powerset(X1))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_1366) ).
cnf(i_0_3471,negated_conjecture,
in(esk515_0,esk514_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_3471) ).
cnf(i_0_3472,negated_conjecture,
element(esk514_0,powerset(the_carrier(incl_POSet(powerset(esk513_0))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_3472) ).
cnf(i_0_3473,negated_conjecture,
proper_element(esk514_0,powerset(the_carrier(incl_POSet(powerset(esk513_0))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_3473) ).
cnf(i_0_3474,negated_conjecture,
upper_relstr_subset(esk514_0,incl_POSet(powerset(esk513_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_3474) ).
cnf(i_0_3475,negated_conjecture,
filtered_subset(esk514_0,incl_POSet(powerset(esk513_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i419nnyw/lgb.p',i_0_3475) ).
cnf(c_0_3713,lemma,
( empty_carrier(X1)
| empty(X2)
| ~ rel_str(X1)
| ~ reflexive_relstr(X1)
| ~ transitive_relstr(X1)
| ~ antisymmetric_relstr(X1)
| ~ lower_bounded_relstr(X1)
| ~ filtered_subset(X2,X1)
| ~ upper_relstr_subset(X2,X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ proper_element(X2,powerset(the_carrier(X1))) ),
i_0_3695 ).
cnf(c_0_3714,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
i_0_3675 ).
cnf(c_0_3715,lemma,
( empty_carrier(X1)
| ~ lower_bounded_relstr(X1)
| ~ antisymmetric_relstr(X1)
| ~ transitive_relstr(X1)
| ~ reflexive_relstr(X1)
| ~ rel_str(X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ proper_element(X2,powerset(the_carrier(X1)))
| ~ upper_relstr_subset(X2,X1)
| ~ filtered_subset(X2,X1) ),
inference(csr,[status(thm)],[c_0_3713,c_0_3714]) ).
cnf(c_0_3716,lemma,
the_carrier(incl_POSet(X1)) = X1,
i_0_3401 ).
cnf(c_0_3717,plain,
antisymmetric_relstr(incl_POSet(X1)),
i_0_1295 ).
cnf(c_0_3718,plain,
transitive_relstr(incl_POSet(X1)),
i_0_1296 ).
cnf(c_0_3719,plain,
reflexive_relstr(incl_POSet(X1)),
i_0_1297 ).
cnf(c_0_3720,plain,
rel_str(incl_POSet(X1)),
i_0_893 ).
cnf(c_0_3721,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_3659 ).
cnf(c_0_3722,negated_conjecture,
empty(esk515_0),
i_0_3470 ).
cnf(c_0_3723,lemma,
( empty_carrier(incl_POSet(X1))
| ~ lower_bounded_relstr(incl_POSet(X1))
| ~ in(bottom_of_relstr(incl_POSet(X1)),X2)
| ~ element(X2,powerset(X1))
| ~ proper_element(X2,powerset(X1))
| ~ upper_relstr_subset(X2,incl_POSet(X1))
| ~ filtered_subset(X2,incl_POSet(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3715,c_0_3716]),c_0_3717]),c_0_3718]),c_0_3719]),c_0_3720])]) ).
cnf(c_0_3724,lemma,
bottom_of_relstr(incl_POSet(powerset(X1))) = empty_set,
i_0_3381 ).
cnf(c_0_3725,plain,
lower_bounded_relstr(incl_POSet(powerset(X1))),
i_0_1358 ).
cnf(c_0_3726,plain,
~ empty_carrier(incl_POSet(powerset(X1))),
i_0_1366 ).
cnf(c_0_3727,negated_conjecture,
in(esk515_0,esk514_0),
i_0_3471 ).
cnf(c_0_3728,negated_conjecture,
esk515_0 = empty_set,
inference(spm,[status(thm)],[c_0_3721,c_0_3722]) ).
cnf(c_0_3729,negated_conjecture,
element(esk514_0,powerset(the_carrier(incl_POSet(powerset(esk513_0))))),
i_0_3472 ).
cnf(c_0_3730,negated_conjecture,
proper_element(esk514_0,powerset(the_carrier(incl_POSet(powerset(esk513_0))))),
i_0_3473 ).
cnf(c_0_3731,lemma,
( ~ in(empty_set,X1)
| ~ element(X1,powerset(powerset(X2)))
| ~ proper_element(X1,powerset(powerset(X2)))
| ~ upper_relstr_subset(X1,incl_POSet(powerset(X2)))
| ~ filtered_subset(X1,incl_POSet(powerset(X2))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3723,c_0_3724]),c_0_3725])]),c_0_3726]) ).
cnf(c_0_3732,negated_conjecture,
upper_relstr_subset(esk514_0,incl_POSet(powerset(esk513_0))),
i_0_3474 ).
cnf(c_0_3733,negated_conjecture,
in(empty_set,esk514_0),
inference(rw,[status(thm)],[c_0_3727,c_0_3728]) ).
cnf(c_0_3734,negated_conjecture,
element(esk514_0,powerset(powerset(esk513_0))),
inference(rw,[status(thm)],[c_0_3729,c_0_3716]) ).
cnf(c_0_3735,negated_conjecture,
proper_element(esk514_0,powerset(powerset(esk513_0))),
inference(rw,[status(thm)],[c_0_3730,c_0_3716]) ).
cnf(c_0_3736,negated_conjecture,
filtered_subset(esk514_0,incl_POSet(powerset(esk513_0))),
i_0_3475 ).
cnf(c_0_3737,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3731,c_0_3732]),c_0_3733]),c_0_3734]),c_0_3735]),c_0_3736])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU387+2 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n020.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 20 11:45:50 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.50 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.50 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.50 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.50 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.01/3.66 # ENIGMATIC: Solved by autoschedule-lgb:
% 10.01/3.66 # No SInE strategy applied
% 10.01/3.66 # Trying AutoSched0 for 150 seconds
% 10.01/3.66 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 10.01/3.66 # and selection function SelectMaxLComplexAvoidPosPred.
% 10.01/3.66 #
% 10.01/3.66 # Preprocessing time : 0.016 s
% 10.01/3.66
% 10.01/3.66 # Proof found!
% 10.01/3.66 # SZS status Theorem
% 10.01/3.66 # SZS output start CNFRefutation
% See solution above
% 10.01/3.66 # Training examples: 0 positive, 0 negative
% 10.01/3.66
% 10.01/3.66 # -------------------------------------------------
% 10.01/3.66 # User time : 0.042 s
% 10.01/3.66 # System time : 0.006 s
% 10.01/3.66 # Total time : 0.048 s
% 10.01/3.66 # Maximum resident set size: 7268 pages
% 10.01/3.66
%------------------------------------------------------------------------------