%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU321+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:47 EDT 2022
% Result : Theorem 8.05s 2.84s
% Output : CNFRefutation 8.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of clauses : 30 ( 15 unt; 5 nHn; 28 RR)
% Number of literals : 57 ( 7 equ; 28 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_233,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g8h17tgf/lgb.p',i_0_233) ).
cnf(i_0_632,negated_conjecture,
element(esk116_0,the_carrier(esk114_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g8h17tgf/lgb.p',i_0_632) ).
cnf(i_0_1892,lemma,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ in(X1,subset_complement(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g8h17tgf/lgb.p',i_0_1892) ).
cnf(i_0_630,negated_conjecture,
( in(esk116_0,subset_complement(the_carrier(esk114_0),esk115_0))
| ~ in(esk116_0,esk115_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g8h17tgf/lgb.p',i_0_630) ).
cnf(i_0_633,negated_conjecture,
element(esk115_0,powerset(the_carrier(esk114_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g8h17tgf/lgb.p',i_0_633) ).
cnf(i_0_497,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g8h17tgf/lgb.p',i_0_497) ).
cnf(i_0_634,negated_conjecture,
one_sorted_str(esk114_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g8h17tgf/lgb.p',i_0_634) ).
cnf(i_0_635,negated_conjecture,
~ empty_carrier(esk114_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g8h17tgf/lgb.p',i_0_635) ).
cnf(i_0_631,negated_conjecture,
( in(esk116_0,esk115_0)
| ~ in(esk116_0,subset_complement(the_carrier(esk114_0),esk115_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g8h17tgf/lgb.p',i_0_631) ).
cnf(i_0_1874,lemma,
( X1 = empty_set
| in(X2,X3)
| in(X2,subset_complement(X1,X3))
| ~ element(X2,X1)
| ~ element(X3,powerset(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g8h17tgf/lgb.p',i_0_1874) ).
cnf(i_0_1913,lemma,
( set_difference(X1,unordered_pair(X2,X2)) != X1
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g8h17tgf/lgb.p',i_0_1913) ).
cnf(i_0_1869,plain,
set_difference(empty_set,X1) = empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g8h17tgf/lgb.p',i_0_1869) ).
cnf(c_0_1926,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_233 ).
cnf(c_0_1927,negated_conjecture,
element(esk116_0,the_carrier(esk114_0)),
i_0_632 ).
cnf(c_0_1928,lemma,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ in(X1,subset_complement(X3,X2)) ),
i_0_1892 ).
cnf(c_0_1929,negated_conjecture,
( in(esk116_0,subset_complement(the_carrier(esk114_0),esk115_0))
| ~ in(esk116_0,esk115_0) ),
i_0_630 ).
cnf(c_0_1930,negated_conjecture,
element(esk115_0,powerset(the_carrier(esk114_0))),
i_0_633 ).
cnf(c_0_1931,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(the_carrier(X1)) ),
i_0_497 ).
cnf(c_0_1932,negated_conjecture,
( empty(the_carrier(esk114_0))
| in(esk116_0,the_carrier(esk114_0)) ),
inference(spm,[status(thm)],[c_0_1926,c_0_1927]) ).
cnf(c_0_1933,negated_conjecture,
one_sorted_str(esk114_0),
i_0_634 ).
cnf(c_0_1934,negated_conjecture,
~ empty_carrier(esk114_0),
i_0_635 ).
cnf(c_0_1935,negated_conjecture,
( in(esk116_0,esk115_0)
| ~ in(esk116_0,subset_complement(the_carrier(esk114_0),esk115_0)) ),
i_0_631 ).
cnf(c_0_1936,lemma,
( X1 = empty_set
| in(X2,X3)
| in(X2,subset_complement(X1,X3))
| ~ element(X2,X1)
| ~ element(X3,powerset(X1)) ),
i_0_1874 ).
cnf(c_0_1937,negated_conjecture,
~ in(esk116_0,esk115_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1928,c_0_1929]),c_0_1930])]) ).
cnf(c_0_1938,lemma,
( set_difference(X1,unordered_pair(X2,X2)) != X1
| ~ in(X2,X1) ),
i_0_1913 ).
cnf(c_0_1939,plain,
set_difference(empty_set,X1) = empty_set,
i_0_1869 ).
cnf(c_0_1940,plain,
in(esk116_0,the_carrier(esk114_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1931,c_0_1932]),c_0_1933])]),c_0_1934]) ).
cnf(c_0_1941,negated_conjecture,
the_carrier(esk114_0) = empty_set,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1935,c_0_1936]),c_0_1930]),c_0_1927])]),c_0_1937]) ).
cnf(c_0_1942,lemma,
~ in(X1,empty_set),
inference(spm,[status(thm)],[c_0_1938,c_0_1939]) ).
cnf(c_0_1943,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_1940,c_0_1941]),c_0_1942]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU321+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 : n005.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 07:09:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.05/2.84 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.05/2.84 # No SInE strategy applied
% 8.05/2.84 # Trying AutoSched0 for 150 seconds
% 8.05/2.84 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.05/2.84 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.05/2.84 #
% 8.05/2.84 # Preprocessing time : 0.023 s
% 8.05/2.84
% 8.05/2.84 # Proof found!
% 8.05/2.84 # SZS status Theorem
% 8.05/2.84 # SZS output start CNFRefutation
% See solution above
% 8.05/2.84 # Training examples: 0 positive, 0 negative
% 8.05/2.84
% 8.05/2.84 # -------------------------------------------------
% 8.05/2.84 # User time : 0.031 s
% 8.05/2.84 # System time : 0.005 s
% 8.05/2.84 # Total time : 0.036 s
% 8.05/2.84 # Maximum resident set size: 7124 pages
% 8.05/2.84
%------------------------------------------------------------------------------