%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU328+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:51 EDT 2022
% Result : Theorem 7.59s 2.84s
% Output : CNFRefutation 7.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 11 unt; 2 nHn; 18 RR)
% Number of literals : 33 ( 14 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1885,lemma,
( X1 = empty_set
| subset_difference(X2,X2,meet_of_subsets(X2,X1)) = union_of_subsets(X2,complements_of_subsets(X2,X1))
| ~ element(X1,powerset(powerset(X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1bjef572/lgb.p',i_0_1885) ).
cnf(i_0_1704,negated_conjecture,
element(esk312_0,powerset(powerset(esk311_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1bjef572/lgb.p',i_0_1704) ).
cnf(i_0_1703,negated_conjecture,
esk312_0 != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1bjef572/lgb.p',i_0_1703) ).
cnf(i_0_1702,negated_conjecture,
union_of_subsets(esk311_0,complements_of_subsets(esk311_0,esk312_0)) != subset_complement(esk311_0,meet_of_subsets(esk311_0,esk312_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1bjef572/lgb.p',i_0_1702) ).
cnf(i_0_350,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1bjef572/lgb.p',i_0_350) ).
cnf(i_0_758,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-1bjef572/lgb.p',i_0_758) ).
cnf(i_0_431,plain,
element(X1,powerset(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1bjef572/lgb.p',i_0_431) ).
cnf(i_0_444,plain,
( element(meet_of_subsets(X1,X2),powerset(X1))
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1bjef572/lgb.p',i_0_444) ).
cnf(c_0_1894,lemma,
( X1 = empty_set
| subset_difference(X2,X2,meet_of_subsets(X2,X1)) = union_of_subsets(X2,complements_of_subsets(X2,X1))
| ~ element(X1,powerset(powerset(X2))) ),
i_0_1885 ).
cnf(c_0_1895,negated_conjecture,
element(esk312_0,powerset(powerset(esk311_0))),
i_0_1704 ).
cnf(c_0_1896,negated_conjecture,
esk312_0 != empty_set,
i_0_1703 ).
cnf(c_0_1897,negated_conjecture,
union_of_subsets(esk311_0,complements_of_subsets(esk311_0,esk312_0)) != subset_complement(esk311_0,meet_of_subsets(esk311_0,esk312_0)),
i_0_1702 ).
cnf(c_0_1898,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
i_0_350 ).
cnf(c_0_1899,plain,
( subset_difference(X1,X2,X3) = set_difference(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
i_0_758 ).
cnf(c_0_1900,negated_conjecture,
subset_difference(esk311_0,esk311_0,meet_of_subsets(esk311_0,esk312_0)) = union_of_subsets(esk311_0,complements_of_subsets(esk311_0,esk312_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1894,c_0_1895]),c_0_1896]) ).
cnf(c_0_1901,plain,
element(X1,powerset(X1)),
i_0_431 ).
cnf(c_0_1902,negated_conjecture,
( union_of_subsets(esk311_0,complements_of_subsets(esk311_0,esk312_0)) != set_difference(esk311_0,meet_of_subsets(esk311_0,esk312_0))
| ~ element(meet_of_subsets(esk311_0,esk312_0),powerset(esk311_0)) ),
inference(spm,[status(thm)],[c_0_1897,c_0_1898]) ).
cnf(c_0_1903,plain,
~ element(meet_of_subsets(esk311_0,esk312_0),powerset(esk311_0)),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1899,c_0_1900]),c_0_1901])]),c_0_1902]) ).
cnf(c_0_1904,plain,
( element(meet_of_subsets(X1,X2),powerset(X1))
| ~ element(X2,powerset(powerset(X1))) ),
i_0_444 ).
cnf(c_0_1905,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1903,c_0_1904]),c_0_1895])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU328+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 : n014.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 : Sat Jun 18 21:13:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.59/2.84 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.59/2.84 # No SInE strategy applied
% 7.59/2.84 # Trying AutoSched0 for 150 seconds
% 7.59/2.84 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.59/2.84 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.59/2.84 #
% 7.59/2.84 # Preprocessing time : 0.024 s
% 7.59/2.84 # Presaturation interreduction done
% 7.59/2.84
% 7.59/2.84 # Proof found!
% 7.59/2.84 # SZS status Theorem
% 7.59/2.84 # SZS output start CNFRefutation
% See solution above
% 7.59/2.84 # Training examples: 0 positive, 0 negative
% 7.59/2.84
% 7.59/2.84 # -------------------------------------------------
% 7.59/2.84 # User time : 0.033 s
% 7.59/2.84 # System time : 0.005 s
% 7.59/2.84 # Total time : 0.038 s
% 7.59/2.84 # Maximum resident set size: 7128 pages
% 7.59/2.84
%------------------------------------------------------------------------------