TSTP Solution File: SEU326+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU326+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 14.41s 5.00s
% Output : CNFRefutation 14.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 9 unt; 6 nHn; 22 RR)
% Number of literals : 60 ( 21 equ; 33 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_216,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2u4sxw6/lgb.p',i_0_216) ).
cnf(i_0_415,plain,
( in(subset_complement(X1,X2),X3)
| X4 != complements_of_subsets(X1,X3)
| ~ in(X2,X4)
| ~ element(X2,powerset(X1))
| ~ element(X3,powerset(powerset(X1)))
| ~ element(X4,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2u4sxw6/lgb.p',i_0_415) ).
cnf(i_0_1888,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2u4sxw6/lgb.p',i_0_1888) ).
cnf(i_0_447,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2u4sxw6/lgb.p',i_0_447) ).
cnf(i_0_657,lemma,
( element(X1,powerset(X2))
| in(esk116_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2u4sxw6/lgb.p',i_0_657) ).
cnf(i_0_1879,lemma,
( X1 = empty_set
| complements_of_subsets(X2,X1) != empty_set
| ~ element(X1,powerset(powerset(X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2u4sxw6/lgb.p',i_0_1879) ).
cnf(i_0_1685,negated_conjecture,
( esk312_0 = empty_set
| complements_of_subsets(esk311_0,esk312_0) = empty_set ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2u4sxw6/lgb.p',i_0_1685) ).
cnf(i_0_1689,negated_conjecture,
element(esk312_0,powerset(powerset(esk311_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2u4sxw6/lgb.p',i_0_1689) ).
cnf(i_0_1688,negated_conjecture,
( esk312_0 != empty_set
| complements_of_subsets(esk311_0,esk312_0) != empty_set ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2u4sxw6/lgb.p',i_0_1688) ).
cnf(i_0_215,plain,
( X1 = empty_set
| in(esk40_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2u4sxw6/lgb.p',i_0_215) ).
cnf(c_0_1899,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_216 ).
cnf(c_0_1900,plain,
( in(subset_complement(X1,X2),X3)
| X4 != complements_of_subsets(X1,X3)
| ~ in(X2,X4)
| ~ element(X2,powerset(X1))
| ~ element(X3,powerset(powerset(X1)))
| ~ element(X4,powerset(powerset(X1))) ),
i_0_415 ).
cnf(c_0_1901,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
i_0_1888 ).
cnf(c_0_1902,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
i_0_447 ).
cnf(c_0_1903,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_1899]) ).
cnf(c_0_1904,lemma,
( element(X1,powerset(X2))
| in(esk116_2(X1,X2),X1) ),
i_0_657 ).
cnf(c_0_1905,lemma,
( X1 = empty_set
| complements_of_subsets(X2,X1) != empty_set
| ~ element(X1,powerset(powerset(X2))) ),
i_0_1879 ).
cnf(c_0_1906,negated_conjecture,
( esk312_0 = empty_set
| complements_of_subsets(esk311_0,esk312_0) = empty_set ),
i_0_1685 ).
cnf(c_0_1907,negated_conjecture,
element(esk312_0,powerset(powerset(esk311_0))),
i_0_1689 ).
cnf(c_0_1908,plain,
( in(subset_complement(X1,X2),X3)
| ~ in(X2,complements_of_subsets(X1,X3))
| ~ element(X3,powerset(powerset(X1))) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[c_0_1900,c_0_1901])]),c_0_1902]) ).
cnf(c_0_1909,plain,
element(empty_set,powerset(X1)),
inference(spm,[status(thm)],[c_0_1903,c_0_1904]) ).
cnf(c_0_1910,negated_conjecture,
( esk312_0 != empty_set
| complements_of_subsets(esk311_0,esk312_0) != empty_set ),
i_0_1688 ).
cnf(c_0_1911,negated_conjecture,
esk312_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1905,c_0_1906]),c_0_1907])]) ).
cnf(c_0_1912,plain,
~ in(X1,complements_of_subsets(X2,empty_set)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1903,c_0_1908]),c_0_1909])]) ).
cnf(c_0_1913,plain,
( X1 = empty_set
| in(esk40_1(X1),X1) ),
i_0_215 ).
cnf(c_0_1914,negated_conjecture,
complements_of_subsets(esk311_0,empty_set) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_1910,c_0_1911]),c_0_1911])]) ).
cnf(c_0_1915,plain,
complements_of_subsets(X1,empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_1912,c_0_1913]) ).
cnf(c_0_1916,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1914,c_0_1915])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU326+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 : n017.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 08:20:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.47 # ENIGMATIC: Selected SinE mode:
% 0.19/0.50 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.50 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.50 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.50 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 14.41/5.00 # ENIGMATIC: Solved by autoschedule-lgb:
% 14.41/5.00 # No SInE strategy applied
% 14.41/5.00 # Trying AutoSched0 for 150 seconds
% 14.41/5.00 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 14.41/5.00 # and selection function SelectComplexExceptUniqMaxHorn.
% 14.41/5.00 #
% 14.41/5.00 # Preprocessing time : 0.025 s
% 14.41/5.00 # Presaturation interreduction done
% 14.41/5.00
% 14.41/5.00 # Proof found!
% 14.41/5.00 # SZS status Theorem
% 14.41/5.00 # SZS output start CNFRefutation
% See solution above
% 14.41/5.00 # Training examples: 0 positive, 0 negative
% 14.41/5.00
% 14.41/5.00 # -------------------------------------------------
% 14.41/5.00 # User time : 0.038 s
% 14.41/5.00 # System time : 0.005 s
% 14.41/5.00 # Total time : 0.043 s
% 14.41/5.00 # Maximum resident set size: 7128 pages
% 14.41/5.00
%------------------------------------------------------------------------------