TSTP Solution File: SEU391+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU391+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:41:49 EDT 2022
% Result : Theorem 9.53s 3.48s
% Output : CNFRefutation 9.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 13 unt; 17 nHn; 34 RR)
% Number of literals : 104 ( 7 equ; 50 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1438,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(X3,a_2_1_yellow19(X2,X1))
| X4 != X3
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ is_eventually_in(X2,X1,X4)
| ~ element(X4,powerset(the_carrier(X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ril84n2y/lgb.p',i_0_1438) ).
cnf(i_0_3429,negated_conjecture,
( element(esk509_0,powerset(the_carrier(esk507_0)))
| in(esk509_0,filter_of_net_str(esk507_0,esk508_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ril84n2y/lgb.p',i_0_3429) ).
cnf(i_0_653,plain,
( a_2_1_yellow19(X1,X2) = filter_of_net_str(X1,X2)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ril84n2y/lgb.p',i_0_653) ).
cnf(i_0_3434,negated_conjecture,
one_sorted_str(esk507_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ril84n2y/lgb.p',i_0_3434) ).
cnf(i_0_3432,negated_conjecture,
net_str(esk508_0,esk507_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ril84n2y/lgb.p',i_0_3432) ).
cnf(i_0_3433,negated_conjecture,
~ empty_carrier(esk508_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ril84n2y/lgb.p',i_0_3433) ).
cnf(i_0_3435,negated_conjecture,
~ empty_carrier(esk507_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ril84n2y/lgb.p',i_0_3435) ).
cnf(i_0_3430,negated_conjecture,
( is_eventually_in(esk507_0,esk508_0,esk509_0)
| in(esk509_0,filter_of_net_str(esk507_0,esk508_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ril84n2y/lgb.p',i_0_3430) ).
cnf(i_0_1440,plain,
( esk167_3(X1,X2,X3) = X1
| empty_carrier(X3)
| empty_carrier(X2)
| ~ one_sorted_str(X2)
| ~ net_str(X3,X2)
| ~ in(X1,a_2_1_yellow19(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ril84n2y/lgb.p',i_0_1440) ).
cnf(i_0_1439,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X2,X1,esk167_3(X3,X2,X1))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ril84n2y/lgb.p',i_0_1439) ).
cnf(i_0_3431,negated_conjecture,
( ~ is_eventually_in(esk507_0,esk508_0,esk509_0)
| ~ element(esk509_0,powerset(the_carrier(esk507_0)))
| ~ in(esk509_0,filter_of_net_str(esk507_0,esk508_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ril84n2y/lgb.p',i_0_3431) ).
cnf(i_0_1441,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk167_3(X3,X2,X1),powerset(the_carrier(X2)))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ril84n2y/lgb.p',i_0_1441) ).
cnf(c_0_3448,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(X3,a_2_1_yellow19(X2,X1))
| X4 != X3
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ is_eventually_in(X2,X1,X4)
| ~ element(X4,powerset(the_carrier(X2))) ),
i_0_1438 ).
cnf(c_0_3449,negated_conjecture,
( element(esk509_0,powerset(the_carrier(esk507_0)))
| in(esk509_0,filter_of_net_str(esk507_0,esk508_0)) ),
i_0_3429 ).
cnf(c_0_3450,plain,
( a_2_1_yellow19(X1,X2) = filter_of_net_str(X1,X2)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
i_0_653 ).
cnf(c_0_3451,negated_conjecture,
one_sorted_str(esk507_0),
i_0_3434 ).
cnf(c_0_3452,negated_conjecture,
net_str(esk508_0,esk507_0),
i_0_3432 ).
cnf(c_0_3453,negated_conjecture,
~ empty_carrier(esk508_0),
i_0_3433 ).
cnf(c_0_3454,negated_conjecture,
~ empty_carrier(esk507_0),
i_0_3435 ).
cnf(c_0_3455,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(X3,a_2_1_yellow19(X1,X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ element(X3,powerset(the_carrier(X1)))
| ~ is_eventually_in(X1,X2,X3) ),
inference(er,[status(thm)],[c_0_3448]) ).
cnf(c_0_3456,negated_conjecture,
( is_eventually_in(esk507_0,esk508_0,esk509_0)
| in(esk509_0,filter_of_net_str(esk507_0,esk508_0)) ),
i_0_3430 ).
cnf(c_0_3457,negated_conjecture,
( element(esk509_0,powerset(the_carrier(esk507_0)))
| in(esk509_0,a_2_1_yellow19(esk507_0,esk508_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3449,c_0_3450]),c_0_3451]),c_0_3452])]),c_0_3453]),c_0_3454]) ).
cnf(c_0_3458,negated_conjecture,
( in(esk509_0,filter_of_net_str(esk507_0,esk508_0))
| in(esk509_0,a_2_1_yellow19(esk507_0,esk508_0)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3455,c_0_3456]),c_0_3451]),c_0_3452])]),c_0_3453]),c_0_3454]),c_0_3457]) ).
cnf(c_0_3459,plain,
( esk167_3(X1,X2,X3) = X1
| empty_carrier(X3)
| empty_carrier(X2)
| ~ one_sorted_str(X2)
| ~ net_str(X3,X2)
| ~ in(X1,a_2_1_yellow19(X2,X3)) ),
i_0_1440 ).
cnf(c_0_3460,plain,
in(esk509_0,a_2_1_yellow19(esk507_0,esk508_0)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3458,c_0_3450]),c_0_3451]),c_0_3452])]),c_0_3453]),c_0_3454]) ).
cnf(c_0_3461,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X2,X1,esk167_3(X3,X2,X1))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
i_0_1439 ).
cnf(c_0_3462,plain,
esk167_3(esk509_0,esk507_0,esk508_0) = esk509_0,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3459,c_0_3460]),c_0_3451]),c_0_3452])]),c_0_3453]),c_0_3454]) ).
cnf(c_0_3463,negated_conjecture,
( ~ is_eventually_in(esk507_0,esk508_0,esk509_0)
| ~ element(esk509_0,powerset(the_carrier(esk507_0)))
| ~ in(esk509_0,filter_of_net_str(esk507_0,esk508_0)) ),
i_0_3431 ).
cnf(c_0_3464,plain,
is_eventually_in(esk507_0,esk508_0,esk509_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3461,c_0_3462]),c_0_3451]),c_0_3452]),c_0_3460])]),c_0_3454]),c_0_3453]) ).
cnf(c_0_3465,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk167_3(X3,X2,X1),powerset(the_carrier(X2)))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
i_0_1441 ).
cnf(c_0_3466,negated_conjecture,
( ~ element(esk509_0,powerset(the_carrier(esk507_0)))
| ~ in(esk509_0,filter_of_net_str(esk507_0,esk508_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3463,c_0_3464])]) ).
cnf(c_0_3467,negated_conjecture,
( element(esk167_3(X1,esk507_0,esk508_0),powerset(the_carrier(esk507_0)))
| ~ in(X1,a_2_1_yellow19(esk507_0,esk508_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3465,c_0_3452]),c_0_3451])]),c_0_3454]),c_0_3453]) ).
cnf(c_0_3468,plain,
~ element(esk509_0,powerset(the_carrier(esk507_0))),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3466,c_0_3450]),c_0_3460]),c_0_3451]),c_0_3452])]),c_0_3453]),c_0_3454]) ).
cnf(c_0_3469,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3467,c_0_3462]),c_0_3460])]),c_0_3468]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU391+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 04:09:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.50 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.50 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.50 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.50 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.53/3.48 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.53/3.48 # No SInE strategy applied
% 9.53/3.48 # Trying AutoSched0 for 150 seconds
% 9.53/3.48 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 9.53/3.48 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.53/3.48 #
% 9.53/3.48 # Preprocessing time : 0.027 s
% 9.53/3.48 # Presaturation interreduction done
% 9.53/3.48
% 9.53/3.48 # Proof found!
% 9.53/3.48 # SZS status Theorem
% 9.53/3.48 # SZS output start CNFRefutation
% See solution above
% 9.53/3.48 # Training examples: 0 positive, 0 negative
% 9.53/3.48
% 9.53/3.48 # -------------------------------------------------
% 9.53/3.48 # User time : 0.081 s
% 9.53/3.48 # System time : 0.007 s
% 9.53/3.48 # Total time : 0.088 s
% 9.53/3.48 # Maximum resident set size: 7284 pages
% 9.53/3.48
%------------------------------------------------------------------------------