TSTP Solution File: SEU325+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU325+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:50 EDT 2022
% Result : Theorem 9.34s 2.96s
% Output : CNFRefutation 9.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 39 ( 25 unt; 0 nHn; 29 RR)
% Number of literals : 59 ( 16 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1940,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_1940) ).
cnf(i_0_723,plain,
empty(esk134_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_723) ).
cnf(i_0_724,plain,
element(esk134_1(X1),powerset(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_724) ).
cnf(i_0_440,plain,
( element(union_of_subsets(X1,X2),powerset(X1))
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_440) ).
cnf(i_0_1837,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_1837) ).
cnf(i_0_1842,lemma,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_1842) ).
cnf(i_0_755,plain,
( union_of_subsets(X1,X2) = union(X2)
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_755) ).
cnf(i_0_1917,negated_conjecture,
is_a_cover_of_carrier(esk339_0,esk340_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_1917) ).
cnf(i_0_1916,negated_conjecture,
esk340_0 = empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_1916) ).
cnf(i_0_397,plain,
( union_of_subsets(the_carrier(X1),X2) = cast_as_carrier_subset(X1)
| ~ one_sorted_str(X1)
| ~ is_a_cover_of_carrier(X1,X2)
| ~ element(X2,powerset(powerset(the_carrier(X1)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_397) ).
cnf(i_0_1919,negated_conjecture,
one_sorted_str(esk339_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_1919) ).
cnf(i_0_526,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(cast_as_carrier_subset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_526) ).
cnf(i_0_600,plain,
empty(empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_600) ).
cnf(i_0_1920,negated_conjecture,
~ empty_carrier(esk339_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-do7i5jfo/lgb.p',i_0_1920) ).
cnf(c_0_1955,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_1940 ).
cnf(c_0_1956,plain,
empty(esk134_1(X1)),
i_0_723 ).
cnf(c_0_1957,plain,
element(esk134_1(X1),powerset(X1)),
i_0_724 ).
cnf(c_0_1958,plain,
esk134_1(X1) = empty_set,
inference(spm,[status(thm)],[c_0_1955,c_0_1956]) ).
cnf(c_0_1959,plain,
( element(union_of_subsets(X1,X2),powerset(X1))
| ~ element(X2,powerset(powerset(X1))) ),
i_0_440 ).
cnf(c_0_1960,plain,
element(empty_set,powerset(X1)),
inference(rw,[status(thm)],[c_0_1957,c_0_1958]) ).
cnf(c_0_1961,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
i_0_1837 ).
cnf(c_0_1962,plain,
element(union_of_subsets(X1,empty_set),powerset(X1)),
inference(spm,[status(thm)],[c_0_1959,c_0_1960]) ).
cnf(c_0_1963,lemma,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
i_0_1842 ).
cnf(c_0_1964,plain,
subset(union_of_subsets(X1,empty_set),X1),
inference(spm,[status(thm)],[c_0_1961,c_0_1962]) ).
cnf(c_0_1965,plain,
( union_of_subsets(X1,X2) = union(X2)
| ~ element(X2,powerset(powerset(X1))) ),
i_0_755 ).
cnf(c_0_1966,lemma,
union_of_subsets(empty_set,empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_1963,c_0_1964]) ).
cnf(c_0_1967,plain,
union_of_subsets(X1,empty_set) = union(empty_set),
inference(spm,[status(thm)],[c_0_1965,c_0_1960]) ).
cnf(c_0_1968,negated_conjecture,
is_a_cover_of_carrier(esk339_0,esk340_0),
i_0_1917 ).
cnf(c_0_1969,negated_conjecture,
esk340_0 = empty_set,
i_0_1916 ).
cnf(c_0_1970,lemma,
union(empty_set) = empty_set,
inference(rw,[status(thm)],[c_0_1966,c_0_1967]) ).
cnf(c_0_1971,plain,
( union_of_subsets(the_carrier(X1),X2) = cast_as_carrier_subset(X1)
| ~ one_sorted_str(X1)
| ~ is_a_cover_of_carrier(X1,X2)
| ~ element(X2,powerset(powerset(the_carrier(X1)))) ),
i_0_397 ).
cnf(c_0_1972,negated_conjecture,
is_a_cover_of_carrier(esk339_0,empty_set),
inference(rw,[status(thm)],[c_0_1968,c_0_1969]) ).
cnf(c_0_1973,plain,
union_of_subsets(X1,empty_set) = empty_set,
inference(rw,[status(thm)],[c_0_1967,c_0_1970]) ).
cnf(c_0_1974,negated_conjecture,
one_sorted_str(esk339_0),
i_0_1919 ).
cnf(c_0_1975,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(cast_as_carrier_subset(X1)) ),
i_0_526 ).
cnf(c_0_1976,negated_conjecture,
cast_as_carrier_subset(esk339_0) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1971,c_0_1972]),c_0_1973]),c_0_1974]),c_0_1960])]) ).
cnf(c_0_1977,plain,
empty(empty_set),
i_0_600 ).
cnf(c_0_1978,negated_conjecture,
~ empty_carrier(esk339_0),
i_0_1920 ).
cnf(c_0_1979,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1975,c_0_1976]),c_0_1974]),c_0_1977])]),c_0_1978]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU325+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n006.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 : Sun Jun 19 18:26:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.48 # Parsing /export/starexec/sandbox/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.34/2.96 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.34/2.96 # No SInE strategy applied
% 9.34/2.96 # Trying AutoSched0 for 150 seconds
% 9.34/2.96 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 9.34/2.96 # and selection function SelectCQIPrecWNTNp.
% 9.34/2.96 #
% 9.34/2.96 # Preprocessing time : 0.028 s
% 9.34/2.96 # Presaturation interreduction done
% 9.34/2.96
% 9.34/2.96 # Proof found!
% 9.34/2.96 # SZS status Theorem
% 9.34/2.96 # SZS output start CNFRefutation
% See solution above
% 9.34/2.96 # Training examples: 0 positive, 0 negative
% 9.34/2.96
% 9.34/2.96 # -------------------------------------------------
% 9.34/2.96 # User time : 0.080 s
% 9.34/2.96 # System time : 0.013 s
% 9.34/2.96 # Total time : 0.093 s
% 9.34/2.96 # Maximum resident set size: 7124 pages
% 9.34/2.96
%------------------------------------------------------------------------------