TSTP Solution File: SEU309+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU309+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:40 EDT 2022
% Result : Theorem 8.63s 2.96s
% Output : CNFRefutation 8.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 9 unt; 0 nHn; 16 RR)
% Number of literals : 25 ( 8 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1576,negated_conjecture,
subset_difference(the_carrier(esk286_0),cast_as_carrier_subset(esk286_0),subset_difference(the_carrier(esk286_0),cast_as_carrier_subset(esk286_0),esk287_0)) != esk287_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nfqr__bb/lgb.p',i_0_1576) ).
cnf(i_0_1551,lemma,
( subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) = subset_complement(the_carrier(X1),X2)
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nfqr__bb/lgb.p',i_0_1551) ).
cnf(i_0_1578,negated_conjecture,
one_sorted_str(esk286_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nfqr__bb/lgb.p',i_0_1578) ).
cnf(i_0_1577,negated_conjecture,
element(esk287_0,powerset(the_carrier(esk286_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nfqr__bb/lgb.p',i_0_1577) ).
cnf(i_0_556,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nfqr__bb/lgb.p',i_0_556) ).
cnf(i_0_393,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nfqr__bb/lgb.p',i_0_393) ).
cnf(c_0_1585,negated_conjecture,
subset_difference(the_carrier(esk286_0),cast_as_carrier_subset(esk286_0),subset_difference(the_carrier(esk286_0),cast_as_carrier_subset(esk286_0),esk287_0)) != esk287_0,
i_0_1576 ).
cnf(c_0_1586,lemma,
( subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) = subset_complement(the_carrier(X1),X2)
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
i_0_1551 ).
cnf(c_0_1587,negated_conjecture,
one_sorted_str(esk286_0),
i_0_1578 ).
cnf(c_0_1588,negated_conjecture,
element(esk287_0,powerset(the_carrier(esk286_0))),
i_0_1577 ).
cnf(c_0_1589,negated_conjecture,
subset_difference(the_carrier(esk286_0),cast_as_carrier_subset(esk286_0),subset_complement(the_carrier(esk286_0),esk287_0)) != esk287_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1585,c_0_1586]),c_0_1587]),c_0_1588])]) ).
cnf(c_0_1590,lemma,
( subset_complement(the_carrier(esk286_0),subset_complement(the_carrier(esk286_0),esk287_0)) != esk287_0
| ~ element(subset_complement(the_carrier(esk286_0),esk287_0),powerset(the_carrier(esk286_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1589,c_0_1586]),c_0_1587])]) ).
cnf(c_0_1591,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
i_0_556 ).
cnf(c_0_1592,plain,
~ element(subset_complement(the_carrier(esk286_0),esk287_0),powerset(the_carrier(esk286_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1590,c_0_1591]),c_0_1588])]) ).
cnf(c_0_1593,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
i_0_393 ).
cnf(c_0_1594,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1592,c_0_1593]),c_0_1588])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU309+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 19 03:41:09 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.20/0.49 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.63/2.96 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.63/2.96 # No SInE strategy applied
% 8.63/2.96 # Trying AutoSched0 for 150 seconds
% 8.63/2.96 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.63/2.96 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.63/2.96 #
% 8.63/2.96 # Preprocessing time : 0.032 s
% 8.63/2.96
% 8.63/2.96 # Proof found!
% 8.63/2.96 # SZS status Theorem
% 8.63/2.96 # SZS output start CNFRefutation
% See solution above
% 8.63/2.96 # Training examples: 0 positive, 0 negative
% 8.63/2.96
% 8.63/2.96 # -------------------------------------------------
% 8.63/2.96 # User time : 0.041 s
% 8.63/2.96 # System time : 0.010 s
% 8.63/2.96 # Total time : 0.052 s
% 8.63/2.96 # Maximum resident set size: 7128 pages
% 8.63/2.96
%------------------------------------------------------------------------------