TSTP Solution File: SEU374+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU374+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:39 EDT 2022
% Result : Theorem 11.10s 3.33s
% Output : CNFRefutation 11.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of clauses : 40 ( 29 unt; 0 nHn; 40 RR)
% Number of literals : 90 ( 8 equ; 53 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3156,lemma,
( related(X1,X2,X3)
| X3 != X4
| X2 != X5
| ~ rel_str(X1)
| ~ subrelstr(X6,X1)
| ~ related(X6,X5,X4)
| ~ element(X4,the_carrier(X6))
| ~ element(X5,the_carrier(X6))
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_3156) ).
cnf(i_0_2927,negated_conjecture,
related(esk465_0,esk468_0,esk469_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_2927) ).
cnf(i_0_2929,negated_conjecture,
esk468_0 = esk466_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_2929) ).
cnf(i_0_2931,negated_conjecture,
element(esk468_0,the_carrier(esk465_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_2931) ).
cnf(i_0_640,plain,
( subrelstr(X1,X2)
| ~ one_sorted_str(X3)
| ~ net_str(X2,X3)
| ~ net_str(X1,X3)
| ~ subnetstr(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_640) ).
cnf(i_0_741,plain,
( net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ net_str(X3,X2)
| ~ subnetstr(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_741) ).
cnf(i_0_2930,negated_conjecture,
element(esk469_0,the_carrier(esk465_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_2930) ).
cnf(i_0_2932,negated_conjecture,
element(esk467_0,the_carrier(esk464_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_2932) ).
cnf(i_0_2928,negated_conjecture,
esk467_0 = esk469_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_2928) ).
cnf(i_0_735,plain,
( rel_str(X1)
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_735) ).
cnf(i_0_2935,negated_conjecture,
net_str(esk464_0,esk463_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_2935) ).
cnf(i_0_2936,negated_conjecture,
one_sorted_str(esk463_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_2936) ).
cnf(i_0_2934,negated_conjecture,
subnetstr(esk465_0,esk463_0,esk464_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_2934) ).
cnf(i_0_2926,negated_conjecture,
~ related(esk464_0,esk466_0,esk467_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_2926) ).
cnf(i_0_2933,negated_conjecture,
element(esk466_0,the_carrier(esk464_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-er7dasn5/lgb.p',i_0_2933) ).
cnf(c_0_3172,lemma,
( related(X1,X2,X3)
| X3 != X4
| X2 != X5
| ~ rel_str(X1)
| ~ subrelstr(X6,X1)
| ~ related(X6,X5,X4)
| ~ element(X4,the_carrier(X6))
| ~ element(X5,the_carrier(X6))
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
i_0_3156 ).
cnf(c_0_3173,negated_conjecture,
related(esk465_0,esk468_0,esk469_0),
i_0_2927 ).
cnf(c_0_3174,negated_conjecture,
esk468_0 = esk466_0,
i_0_2929 ).
cnf(c_0_3175,negated_conjecture,
element(esk468_0,the_carrier(esk465_0)),
i_0_2931 ).
cnf(c_0_3176,plain,
( subrelstr(X1,X2)
| ~ one_sorted_str(X3)
| ~ net_str(X2,X3)
| ~ net_str(X1,X3)
| ~ subnetstr(X1,X3,X2) ),
i_0_640 ).
cnf(c_0_3177,plain,
( net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ net_str(X3,X2)
| ~ subnetstr(X1,X2,X3) ),
i_0_741 ).
cnf(c_0_3178,lemma,
( related(X1,X2,X3)
| ~ rel_str(X1)
| ~ subrelstr(X4,X1)
| ~ related(X4,X2,X3)
| ~ element(X2,the_carrier(X4))
| ~ element(X3,the_carrier(X4))
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_3172])]) ).
cnf(c_0_3179,negated_conjecture,
related(esk465_0,esk466_0,esk469_0),
inference(rw,[status(thm)],[c_0_3173,c_0_3174]) ).
cnf(c_0_3180,negated_conjecture,
element(esk466_0,the_carrier(esk465_0)),
inference(rw,[status(thm)],[c_0_3175,c_0_3174]) ).
cnf(c_0_3181,negated_conjecture,
element(esk469_0,the_carrier(esk465_0)),
i_0_2930 ).
cnf(c_0_3182,negated_conjecture,
element(esk467_0,the_carrier(esk464_0)),
i_0_2932 ).
cnf(c_0_3183,negated_conjecture,
esk467_0 = esk469_0,
i_0_2928 ).
cnf(c_0_3184,plain,
( rel_str(X1)
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2) ),
i_0_735 ).
cnf(c_0_3185,negated_conjecture,
net_str(esk464_0,esk463_0),
i_0_2935 ).
cnf(c_0_3186,negated_conjecture,
one_sorted_str(esk463_0),
i_0_2936 ).
cnf(c_0_3187,plain,
( subrelstr(X1,X2)
| ~ one_sorted_str(X3)
| ~ net_str(X2,X3)
| ~ subnetstr(X1,X3,X2) ),
inference(csr,[status(thm)],[c_0_3176,c_0_3177]) ).
cnf(c_0_3188,negated_conjecture,
subnetstr(esk465_0,esk463_0,esk464_0),
i_0_2934 ).
cnf(c_0_3189,negated_conjecture,
~ related(esk464_0,esk466_0,esk467_0),
i_0_2926 ).
cnf(c_0_3190,negated_conjecture,
( related(X1,esk466_0,esk469_0)
| ~ rel_str(X1)
| ~ subrelstr(esk465_0,X1)
| ~ element(esk469_0,the_carrier(X1))
| ~ element(esk466_0,the_carrier(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3178,c_0_3179]),c_0_3180]),c_0_3181])]) ).
cnf(c_0_3191,negated_conjecture,
element(esk469_0,the_carrier(esk464_0)),
inference(rw,[status(thm)],[c_0_3182,c_0_3183]) ).
cnf(c_0_3192,negated_conjecture,
rel_str(esk464_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3184,c_0_3185]),c_0_3186])]) ).
cnf(c_0_3193,negated_conjecture,
subrelstr(esk465_0,esk464_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3187,c_0_3188]),c_0_3186]),c_0_3185])]) ).
cnf(c_0_3194,negated_conjecture,
element(esk466_0,the_carrier(esk464_0)),
i_0_2933 ).
cnf(c_0_3195,negated_conjecture,
~ related(esk464_0,esk466_0,esk469_0),
inference(rw,[status(thm)],[c_0_3189,c_0_3183]) ).
cnf(c_0_3196,negated_conjecture,
$false,
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_3190,c_0_3191]),c_0_3192]),c_0_3193]),c_0_3194])]),c_0_3195]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU374+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 : n014.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 : Sun Jun 19 10:23:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.49 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.10/3.33 # ENIGMATIC: Solved by autoschedule-lgb:
% 11.10/3.33 # No SInE strategy applied
% 11.10/3.33 # Trying AutoSched0 for 150 seconds
% 11.10/3.33 # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S2q
% 11.10/3.33 # and selection function SelectCQArNTNp.
% 11.10/3.33 #
% 11.10/3.33 # Preprocessing time : 0.025 s
% 11.10/3.33 # Presaturation interreduction done
% 11.10/3.33
% 11.10/3.33 # Proof found!
% 11.10/3.33 # SZS status Theorem
% 11.10/3.33 # SZS output start CNFRefutation
% See solution above
% 11.10/3.33 # Training examples: 0 positive, 0 negative
% 11.10/3.33
% 11.10/3.33 # -------------------------------------------------
% 11.10/3.33 # User time : 0.044 s
% 11.10/3.33 # System time : 0.004 s
% 11.10/3.33 # Total time : 0.048 s
% 11.10/3.33 # Maximum resident set size: 7220 pages
% 11.10/3.33
%------------------------------------------------------------------------------