TSTP Solution File: SEU367+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU367+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:41:34 EDT 2022
% Result : Theorem 39.98s 7.21s
% Output : CNFRefutation 39.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 20
% Syntax : Number of clauses : 56 ( 13 unt; 32 nHn; 50 RR)
% Number of literals : 266 ( 0 equ; 146 neg)
% Maximal clause size : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-4 aty)
% Number of variables : 112 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_156,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X1,X2,X3)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ element(X4,the_carrier(X2))
| ~ in(apply_netmap(X1,X2,X4),X3)
| ~ related(X2,esk14_3(X1,X2,X3),X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_156) ).
cnf(i_0_159,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| related(X2,X3,esk13_4(X1,X2,X4,X3))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_often_in(X1,X2,X4)
| ~ element(X3,the_carrier(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_159) ).
cnf(i_0_395,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_395) ).
cnf(i_0_2928,negated_conjecture,
subset(esk483_0,esk484_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_2928) ).
cnf(i_0_158,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X2,X1,esk13_4(X2,X1,X3,X4)),X3)
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ is_often_in(X2,X1,X3)
| ~ element(X4,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_158) ).
cnf(i_0_160,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk13_4(X2,X1,X3,X4),the_carrier(X1))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ is_often_in(X2,X1,X3)
| ~ element(X4,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_160) ).
cnf(i_0_134,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X2,X1,X3)
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ element(X4,the_carrier(X1))
| ~ in(apply_netmap(X2,X1,esk7_4(X2,X1,X3,X4)),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_134) ).
cnf(i_0_137,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X1,X2,X3),X4)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X4)
| ~ element(X3,the_carrier(X2))
| ~ related(X2,esk6_3(X1,X2,X4),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_137) ).
cnf(i_0_135,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X1,X2,X3)
| related(X2,X4,esk7_4(X1,X2,X3,X4))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ element(X4,the_carrier(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_135) ).
cnf(i_0_157,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X2,X1,X3)
| element(esk14_3(X2,X1,X3),the_carrier(X1))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_157) ).
cnf(i_0_2924,negated_conjecture,
( ~ is_eventually_in(esk481_0,esk482_0,esk484_0)
| ~ is_often_in(esk481_0,esk482_0,esk484_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_2924) ).
cnf(i_0_2929,negated_conjecture,
net_str(esk482_0,esk481_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_2929) ).
cnf(i_0_2931,negated_conjecture,
one_sorted_str(esk481_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_2931) ).
cnf(i_0_2930,negated_conjecture,
~ empty_carrier(esk482_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_2930) ).
cnf(i_0_2932,negated_conjecture,
~ empty_carrier(esk481_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_2932) ).
cnf(i_0_136,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X2,X1,X3)
| element(esk7_4(X2,X1,X3,X4),the_carrier(X1))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ element(X4,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_136) ).
cnf(i_0_2926,negated_conjecture,
( is_eventually_in(esk481_0,esk482_0,esk483_0)
| ~ is_often_in(esk481_0,esk482_0,esk484_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_2926) ).
cnf(i_0_2925,negated_conjecture,
( is_often_in(esk481_0,esk482_0,esk483_0)
| ~ is_eventually_in(esk481_0,esk482_0,esk484_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_2925) ).
cnf(i_0_138,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk6_3(X2,X1,X3),the_carrier(X1))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ is_eventually_in(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_138) ).
cnf(i_0_2927,negated_conjecture,
( is_eventually_in(esk481_0,esk482_0,esk483_0)
| is_often_in(esk481_0,esk482_0,esk483_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4jd2a990/input.p',i_0_2927) ).
cnf(c_0_2953,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X1,X2,X3)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ element(X4,the_carrier(X2))
| ~ in(apply_netmap(X1,X2,X4),X3)
| ~ related(X2,esk14_3(X1,X2,X3),X4) ),
i_0_156 ).
cnf(c_0_2954,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| related(X2,X3,esk13_4(X1,X2,X4,X3))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_often_in(X1,X2,X4)
| ~ element(X3,the_carrier(X2)) ),
i_0_159 ).
cnf(c_0_2955,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_395 ).
cnf(c_0_2956,negated_conjecture,
subset(esk483_0,esk484_0),
i_0_2928 ).
cnf(c_0_2957,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| empty_carrier(X4)
| ~ is_often_in(X4,X2,X5)
| ~ element(esk13_4(X4,X2,X5,esk14_3(X1,X2,X3)),the_carrier(X2))
| ~ element(esk14_3(X1,X2,X3),the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk13_4(X4,X2,X5,esk14_3(X1,X2,X3))),X3)
| ~ net_str(X2,X1)
| ~ net_str(X2,X4)
| ~ one_sorted_str(X1)
| ~ one_sorted_str(X4) ),
inference(spm,[status(thm)],[c_0_2953,c_0_2954]) ).
cnf(c_0_2958,negated_conjecture,
( in(X1,esk484_0)
| ~ in(X1,esk483_0) ),
inference(spm,[status(thm)],[c_0_2955,c_0_2956]) ).
cnf(c_0_2959,negated_conjecture,
( is_often_in(X1,X2,esk484_0)
| empty_carrier(X2)
| empty_carrier(X1)
| empty_carrier(X3)
| ~ is_often_in(X3,X2,X4)
| ~ element(esk13_4(X3,X2,X4,esk14_3(X1,X2,esk484_0)),the_carrier(X2))
| ~ element(esk14_3(X1,X2,esk484_0),the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk13_4(X3,X2,X4,esk14_3(X1,X2,esk484_0))),esk483_0)
| ~ net_str(X2,X1)
| ~ net_str(X2,X3)
| ~ one_sorted_str(X1)
| ~ one_sorted_str(X3) ),
inference(spm,[status(thm)],[c_0_2957,c_0_2958]) ).
cnf(c_0_2960,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X2,X1,esk13_4(X2,X1,X3,X4)),X3)
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ is_often_in(X2,X1,X3)
| ~ element(X4,the_carrier(X1)) ),
i_0_158 ).
cnf(c_0_2961,plain,
( is_often_in(X1,X2,esk484_0)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ is_often_in(X1,X2,esk483_0)
| ~ element(esk13_4(X1,X2,esk483_0,esk14_3(X1,X2,esk484_0)),the_carrier(X2))
| ~ element(esk14_3(X1,X2,esk484_0),the_carrier(X2))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_2959,c_0_2960]) ).
cnf(c_0_2962,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk13_4(X2,X1,X3,X4),the_carrier(X1))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ is_often_in(X2,X1,X3)
| ~ element(X4,the_carrier(X1)) ),
i_0_160 ).
cnf(c_0_2963,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X2,X1,X3)
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ element(X4,the_carrier(X1))
| ~ in(apply_netmap(X2,X1,esk7_4(X2,X1,X3,X4)),X3) ),
i_0_134 ).
cnf(c_0_2964,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X1,X2,X3),X4)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X4)
| ~ element(X3,the_carrier(X2))
| ~ related(X2,esk6_3(X1,X2,X4),X3) ),
i_0_137 ).
cnf(c_0_2965,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X1,X2,X3)
| related(X2,X4,esk7_4(X1,X2,X3,X4))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ element(X4,the_carrier(X2)) ),
i_0_135 ).
cnf(c_0_2966,plain,
( is_often_in(X1,X2,esk484_0)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ is_often_in(X1,X2,esk483_0)
| ~ element(esk14_3(X1,X2,esk484_0),the_carrier(X2))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_2961,c_0_2962]) ).
cnf(c_0_2967,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X2,X1,X3)
| element(esk14_3(X2,X1,X3),the_carrier(X1))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2) ),
i_0_157 ).
cnf(c_0_2968,plain,
( is_eventually_in(X1,X2,esk484_0)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ element(X3,the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk7_4(X1,X2,esk484_0,X3)),esk483_0)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_2963,c_0_2958]) ).
cnf(c_0_2969,plain,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X4)
| empty_carrier(X1)
| in(apply_netmap(X4,X2,esk7_4(X1,X2,X3,esk6_3(X4,X2,X5))),X5)
| ~ is_eventually_in(X4,X2,X5)
| ~ element(esk7_4(X1,X2,X3,esk6_3(X4,X2,X5)),the_carrier(X2))
| ~ element(esk6_3(X4,X2,X5),the_carrier(X2))
| ~ net_str(X2,X4)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X4)
| ~ one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_2964,c_0_2965]) ).
cnf(c_0_2970,negated_conjecture,
( ~ is_eventually_in(esk481_0,esk482_0,esk484_0)
| ~ is_often_in(esk481_0,esk482_0,esk484_0) ),
i_0_2924 ).
cnf(c_0_2971,plain,
( is_often_in(X1,X2,esk484_0)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ is_often_in(X1,X2,esk483_0)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_2966,c_0_2967]) ).
cnf(c_0_2972,negated_conjecture,
net_str(esk482_0,esk481_0),
i_0_2929 ).
cnf(c_0_2973,negated_conjecture,
one_sorted_str(esk481_0),
i_0_2931 ).
cnf(c_0_2974,negated_conjecture,
~ empty_carrier(esk482_0),
i_0_2930 ).
cnf(c_0_2975,negated_conjecture,
~ empty_carrier(esk481_0),
i_0_2932 ).
cnf(c_0_2976,plain,
( is_eventually_in(X1,X2,esk484_0)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ is_eventually_in(X1,X2,esk483_0)
| ~ element(esk7_4(X1,X2,esk484_0,esk6_3(X1,X2,esk483_0)),the_carrier(X2))
| ~ element(esk6_3(X1,X2,esk483_0),the_carrier(X2))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_2968,c_0_2969]) ).
cnf(c_0_2977,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X2,X1,X3)
| element(esk7_4(X2,X1,X3,X4),the_carrier(X1))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ element(X4,the_carrier(X1)) ),
i_0_136 ).
cnf(c_0_2978,negated_conjecture,
( is_eventually_in(esk481_0,esk482_0,esk483_0)
| ~ is_often_in(esk481_0,esk482_0,esk484_0) ),
i_0_2926 ).
cnf(c_0_2979,negated_conjecture,
( ~ is_often_in(esk481_0,esk482_0,esk483_0)
| ~ is_eventually_in(esk481_0,esk482_0,esk484_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_2970,c_0_2971]),c_0_2972]),c_0_2973])]),c_0_2974]),c_0_2975]) ).
cnf(c_0_2980,negated_conjecture,
( is_often_in(esk481_0,esk482_0,esk483_0)
| ~ is_eventually_in(esk481_0,esk482_0,esk484_0) ),
i_0_2925 ).
cnf(c_0_2981,plain,
( is_eventually_in(X1,X2,esk484_0)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ is_eventually_in(X1,X2,esk483_0)
| ~ element(esk6_3(X1,X2,esk483_0),the_carrier(X2))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_2976,c_0_2977]) ).
cnf(c_0_2982,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk6_3(X2,X1,X3),the_carrier(X1))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ is_eventually_in(X2,X1,X3) ),
i_0_138 ).
cnf(c_0_2983,negated_conjecture,
( is_eventually_in(esk481_0,esk482_0,esk483_0)
| ~ is_often_in(esk481_0,esk482_0,esk483_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_2978,c_0_2971]),c_0_2972]),c_0_2973])]),c_0_2974]),c_0_2975]) ).
cnf(c_0_2984,negated_conjecture,
( is_eventually_in(esk481_0,esk482_0,esk483_0)
| is_often_in(esk481_0,esk482_0,esk483_0) ),
i_0_2927 ).
cnf(c_0_2985,negated_conjecture,
~ is_eventually_in(esk481_0,esk482_0,esk484_0),
inference(spm,[status(thm)],[c_0_2979,c_0_2980]) ).
cnf(c_0_2986,plain,
( is_eventually_in(X1,X2,esk484_0)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ is_eventually_in(X1,X2,esk483_0)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_2981,c_0_2982]) ).
cnf(c_0_2987,negated_conjecture,
is_eventually_in(esk481_0,esk482_0,esk483_0),
inference(spm,[status(thm)],[c_0_2983,c_0_2984]) ).
cnf(c_0_2988,plain,
$false,
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_2985,c_0_2986]),c_0_2987]),c_0_2972]),c_0_2973])]),c_0_2975]),c_0_2974]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU367+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 13:23:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.50 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.50 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.50 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 39.98/7.21 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 39.98/7.21 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 35; version: 991; iters: 150)
% 39.98/7.21 # Preprocessing time : 2.250 s
% 39.98/7.21 # Presaturation interreduction done
% 39.98/7.21
% 39.98/7.21 # Proof found!
% 39.98/7.21 # SZS status Theorem
% 39.98/7.21 # SZS output start CNFRefutation
% See solution above
% 39.98/7.21 # Training examples: 0 positive, 0 negative
% 39.98/7.21
% 39.98/7.21 # -------------------------------------------------
% 39.98/7.21 # User time : 3.708 s
% 39.98/7.21 # System time : 0.156 s
% 39.98/7.21 # Total time : 3.864 s
% 39.98/7.21 # ...preprocessing : 2.250 s
% 39.98/7.21 # ...main loop : 1.613 s
% 39.98/7.21 # Maximum resident set size: 195312 pages
% 39.98/7.21
%------------------------------------------------------------------------------