TSTP Solution File: SWB029+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWB029+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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 18:59:14 EDT 2022
% Result : Theorem 102.48s 14.70s
% Output : CNFRefutation 102.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 34 ( 16 unt; 0 nHn; 34 RR)
% Number of literals : 91 ( 0 equ; 62 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 12 con; 0-0 aty)
% Number of variables : 62 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
( icext(X1,X2)
| ~ icext(X3,X2)
| ~ iext(uri_owl_intersectionOf,X3,X4)
| ~ iext(uri_rdf_first,X5,X1)
| ~ iext(uri_rdf_first,X4,X6)
| ~ iext(uri_rdf_rest,X4,X5)
| ~ iext(uri_rdf_rest,X5,uri_rdf_nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v1yqx/input.p',i_0_23) ).
cnf(i_0_1160,plain,
iext(uri_rdf_rest,esk194_0,uri_rdf_nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v1yqx/input.p',i_0_1160) ).
cnf(i_0_1164,plain,
iext(uri_owl_intersectionOf,esk191_0,esk193_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v1yqx/input.p',i_0_1164) ).
cnf(i_0_1162,plain,
iext(uri_rdf_rest,esk193_0,esk194_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v1yqx/input.p',i_0_1162) ).
cnf(i_0_24,plain,
( icext(X1,X2)
| ~ icext(X3,X2)
| ~ iext(uri_owl_intersectionOf,X3,X4)
| ~ iext(uri_rdf_first,X5,X6)
| ~ iext(uri_rdf_first,X4,X1)
| ~ iext(uri_rdf_rest,X4,X5)
| ~ iext(uri_rdf_rest,X5,uri_rdf_nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v1yqx/input.p',i_0_24) ).
cnf(i_0_1163,plain,
iext(uri_rdf_first,esk193_0,uri_ex_A),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v1yqx/input.p',i_0_1163) ).
cnf(i_0_1161,plain,
iext(uri_rdf_first,esk194_0,esk192_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v1yqx/input.p',i_0_1161) ).
cnf(i_0_2,plain,
( ~ icext(X1,X2)
| ~ icext(X3,X2)
| ~ iext(uri_owl_complementOf,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v1yqx/input.p',i_0_2) ).
cnf(i_0_1159,plain,
iext(uri_owl_complementOf,esk192_0,uri_ex_A),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v1yqx/input.p',i_0_1159) ).
cnf(i_0_1088,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_type,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v1yqx/input.p',i_0_1088) ).
cnf(i_0_1165,plain,
iext(uri_rdf_type,uri_ex_w,esk191_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9m2v1yqx/input.p',i_0_1165) ).
cnf(c_0_1177,plain,
( icext(X1,X2)
| ~ icext(X3,X2)
| ~ iext(uri_owl_intersectionOf,X3,X4)
| ~ iext(uri_rdf_first,X5,X1)
| ~ iext(uri_rdf_first,X4,X6)
| ~ iext(uri_rdf_rest,X4,X5)
| ~ iext(uri_rdf_rest,X5,uri_rdf_nil) ),
i_0_23 ).
cnf(c_0_1178,plain,
iext(uri_rdf_rest,esk194_0,uri_rdf_nil),
i_0_1160 ).
cnf(c_0_1179,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_first,esk194_0,X1)
| ~ iext(uri_rdf_rest,X3,esk194_0)
| ~ iext(uri_owl_intersectionOf,X4,X3)
| ~ iext(uri_rdf_first,X3,X5)
| ~ icext(X4,X2) ),
inference(spm,[status(thm)],[c_0_1177,c_0_1178]) ).
cnf(c_0_1180,plain,
iext(uri_owl_intersectionOf,esk191_0,esk193_0),
i_0_1164 ).
cnf(c_0_1181,plain,
iext(uri_rdf_rest,esk193_0,esk194_0),
i_0_1162 ).
cnf(c_0_1182,plain,
( icext(X1,X2)
| ~ icext(X3,X2)
| ~ iext(uri_owl_intersectionOf,X3,X4)
| ~ iext(uri_rdf_first,X5,X6)
| ~ iext(uri_rdf_first,X4,X1)
| ~ iext(uri_rdf_rest,X4,X5)
| ~ iext(uri_rdf_rest,X5,uri_rdf_nil) ),
i_0_24 ).
cnf(c_0_1183,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_first,esk194_0,X1)
| ~ iext(uri_rdf_first,esk193_0,X3)
| ~ icext(esk191_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1179,c_0_1180]),c_0_1181])]) ).
cnf(c_0_1184,plain,
iext(uri_rdf_first,esk193_0,uri_ex_A),
i_0_1163 ).
cnf(c_0_1185,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_first,esk194_0,X3)
| ~ iext(uri_rdf_rest,X4,esk194_0)
| ~ iext(uri_owl_intersectionOf,X5,X4)
| ~ iext(uri_rdf_first,X4,X1)
| ~ icext(X5,X2) ),
inference(spm,[status(thm)],[c_0_1182,c_0_1178]) ).
cnf(c_0_1186,plain,
iext(uri_rdf_first,esk194_0,esk192_0),
i_0_1161 ).
cnf(c_0_1187,plain,
( ~ icext(X1,X2)
| ~ icext(X3,X2)
| ~ iext(uri_owl_complementOf,X3,X1) ),
i_0_2 ).
cnf(c_0_1188,plain,
iext(uri_owl_complementOf,esk192_0,uri_ex_A),
i_0_1159 ).
cnf(c_0_1189,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_first,esk194_0,X1)
| ~ icext(esk191_0,X2) ),
inference(spm,[status(thm)],[c_0_1183,c_0_1184]) ).
cnf(c_0_1190,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_type,X2,X1) ),
i_0_1088 ).
cnf(c_0_1191,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_rest,X3,esk194_0)
| ~ iext(uri_owl_intersectionOf,X4,X3)
| ~ iext(uri_rdf_first,X3,X1)
| ~ icext(X4,X2) ),
inference(spm,[status(thm)],[c_0_1185,c_0_1186]) ).
cnf(c_0_1192,plain,
( ~ icext(esk192_0,X1)
| ~ icext(uri_ex_A,X1) ),
inference(spm,[status(thm)],[c_0_1187,c_0_1188]) ).
cnf(c_0_1193,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_first,esk194_0,X1)
| ~ iext(uri_rdf_type,X2,esk191_0) ),
inference(spm,[status(thm)],[c_0_1189,c_0_1190]) ).
cnf(c_0_1194,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_first,esk193_0,X1)
| ~ icext(esk191_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1191,c_0_1180]),c_0_1181])]) ).
cnf(c_0_1195,plain,
( ~ iext(uri_rdf_type,X1,esk191_0)
| ~ icext(uri_ex_A,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1192,c_0_1193]),c_0_1186])]) ).
cnf(c_0_1196,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_first,esk193_0,X1)
| ~ iext(uri_rdf_type,X2,esk191_0) ),
inference(spm,[status(thm)],[c_0_1194,c_0_1190]) ).
cnf(c_0_1197,plain,
iext(uri_rdf_type,uri_ex_w,esk191_0),
i_0_1165 ).
cnf(c_0_1198,plain,
~ iext(uri_rdf_type,X1,esk191_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1195,c_0_1196]),c_0_1184])]) ).
cnf(c_0_1199,plain,
$false,
inference(sr,[status(thm)],[c_0_1197,c_0_1198]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWB029+1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n027.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 : Wed Jun 1 06:27:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # 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
% 102.48/14.70 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 102.48/14.70 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 17; version: 991; iters: 150)
% 102.48/14.70 # Preprocessing time : 1.368 s
% 102.48/14.70
% 102.48/14.70 # Proof found!
% 102.48/14.70 # SZS status Theorem
% 102.48/14.70 # SZS output start CNFRefutation
% See solution above
% 102.48/14.70 # Training examples: 0 positive, 0 negative
% 102.48/14.70
% 102.48/14.70 # -------------------------------------------------
% 102.48/14.70 # User time : 11.678 s
% 102.48/14.70 # System time : 0.222 s
% 102.48/14.70 # Total time : 11.900 s
% 102.48/14.70 # ...preprocessing : 1.368 s
% 102.48/14.70 # ...main loop : 10.532 s
% 102.48/14.70 # Maximum resident set size: 177028 pages
% 102.48/14.70
%------------------------------------------------------------------------------