%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU307+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:38 EDT 2022
% Result : Theorem 8.60s 2.90s
% Output : CNFRefutation 8.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 14 unt; 0 nHn; 18 RR)
% Number of literals : 32 ( 12 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1522,negated_conjecture,
subset_intersection2(the_carrier(esk284_0),esk285_0,cast_as_carrier_subset(esk284_0)) != esk285_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qnaqm8zq/lgb.p',i_0_1522) ).
cnf(i_0_237,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qnaqm8zq/lgb.p',i_0_237) ).
cnf(i_0_1524,negated_conjecture,
one_sorted_str(esk284_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qnaqm8zq/lgb.p',i_0_1524) ).
cnf(i_0_675,plain,
( subset_intersection2(X1,X2,X3) = set_difference(X2,set_difference(X2,X3))
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qnaqm8zq/lgb.p',i_0_675) ).
cnf(i_0_390,plain,
element(X1,powerset(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qnaqm8zq/lgb.p',i_0_390) ).
cnf(i_0_1523,negated_conjecture,
element(esk285_0,powerset(the_carrier(esk284_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qnaqm8zq/lgb.p',i_0_1523) ).
cnf(i_0_561,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qnaqm8zq/lgb.p',i_0_561) ).
cnf(i_0_1634,plain,
set_difference(X1,empty_set) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qnaqm8zq/lgb.p',i_0_1634) ).
cnf(i_0_1637,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qnaqm8zq/lgb.p',i_0_1637) ).
cnf(c_0_1647,negated_conjecture,
subset_intersection2(the_carrier(esk284_0),esk285_0,cast_as_carrier_subset(esk284_0)) != esk285_0,
i_0_1522 ).
cnf(c_0_1648,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
i_0_237 ).
cnf(c_0_1649,negated_conjecture,
one_sorted_str(esk284_0),
i_0_1524 ).
cnf(c_0_1650,negated_conjecture,
subset_intersection2(the_carrier(esk284_0),esk285_0,the_carrier(esk284_0)) != esk285_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1647,c_0_1648]),c_0_1649])]) ).
cnf(c_0_1651,plain,
( subset_intersection2(X1,X2,X3) = set_difference(X2,set_difference(X2,X3))
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
i_0_675 ).
cnf(c_0_1652,plain,
element(X1,powerset(X1)),
i_0_390 ).
cnf(c_0_1653,negated_conjecture,
element(esk285_0,powerset(the_carrier(esk284_0))),
i_0_1523 ).
cnf(c_0_1654,plain,
set_difference(esk285_0,set_difference(esk285_0,the_carrier(esk284_0))) != esk285_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1650,c_0_1651]),c_0_1652]),c_0_1653])]) ).
cnf(c_0_1655,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
i_0_561 ).
cnf(c_0_1656,plain,
set_difference(X1,empty_set) = X1,
i_0_1634 ).
cnf(c_0_1657,lemma,
~ subset(esk285_0,the_carrier(esk284_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1654,c_0_1655]),c_0_1656])]) ).
cnf(c_0_1658,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
i_0_1637 ).
cnf(c_0_1659,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1657,c_0_1658]),c_0_1653])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU307+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 : Mon Jun 20 08:33:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox2/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
% 8.60/2.90 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.60/2.90 # No SInE strategy applied
% 8.60/2.90 # Trying AutoSched0 for 150 seconds
% 8.60/2.90 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.60/2.90 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.60/2.90 #
% 8.60/2.90 # Preprocessing time : 0.026 s
% 8.60/2.90
% 8.60/2.90 # Proof found!
% 8.60/2.90 # SZS status Theorem
% 8.60/2.90 # SZS output start CNFRefutation
% See solution above
% 8.60/2.90 # Training examples: 0 positive, 0 negative
% 8.60/2.90
% 8.60/2.90 # -------------------------------------------------
% 8.60/2.90 # User time : 0.032 s
% 8.60/2.90 # System time : 0.006 s
% 8.60/2.90 # Total time : 0.038 s
% 8.60/2.90 # Maximum resident set size: 7124 pages
% 8.60/2.90
%------------------------------------------------------------------------------