TSTP Solution File: SWB097+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWB097+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:31 EDT 2022
% Result : Theorem 251.65s 33.99s
% Output : CNFRefutation 251.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 15 unt; 0 nHn; 24 RR)
% Number of literals : 47 ( 0 equ; 25 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 11 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1045,plain,
( icext(X1,X2)
| ~ icext(X3,X4)
| ~ iext(X5,X2,X4)
| ~ iext(uri_owl_onClass,X1,X3)
| ~ iext(uri_owl_onProperty,X1,X5)
| ~ iext(uri_owl_minQualifiedCardinality,X1,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-atfuv8ur/input.p',i_0_1045) ).
cnf(i_0_1071,plain,
iext(uri_owl_minQualifiedCardinality,uri_ex_z,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-atfuv8ur/input.p',i_0_1071) ).
cnf(i_0_1069,plain,
iext(uri_owl_onClass,uri_ex_z,uri_ex_c),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-atfuv8ur/input.p',i_0_1069) ).
cnf(i_0_1070,plain,
iext(uri_owl_onProperty,uri_ex_z,uri_ex_p),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-atfuv8ur/input.p',i_0_1070) ).
cnf(i_0_1091,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_type,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-atfuv8ur/input.p',i_0_1091) ).
cnf(i_0_1068,plain,
iext(uri_rdf_type,uri_ex_x,uri_ex_c),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-atfuv8ur/input.p',i_0_1068) ).
cnf(i_0_1067,plain,
iext(uri_ex_p,uri_ex_w,uri_ex_x),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-atfuv8ur/input.p',i_0_1067) ).
cnf(i_0_1090,plain,
( iext(uri_rdf_type,X1,X2)
| ~ icext(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-atfuv8ur/input.p',i_0_1090) ).
cnf(i_0_1,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_w,uri_ex_z),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-atfuv8ur/input.p',i_0_1) ).
cnf(c_0_1101,plain,
( icext(X1,X2)
| ~ icext(X3,X4)
| ~ iext(X5,X2,X4)
| ~ iext(uri_owl_onClass,X1,X3)
| ~ iext(uri_owl_onProperty,X1,X5)
| ~ iext(uri_owl_minQualifiedCardinality,X1,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)) ),
i_0_1045 ).
cnf(c_0_1102,plain,
iext(uri_owl_minQualifiedCardinality,uri_ex_z,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)),
i_0_1071 ).
cnf(c_0_1103,plain,
( icext(uri_ex_z,X1)
| ~ iext(uri_owl_onClass,uri_ex_z,X2)
| ~ iext(uri_owl_onProperty,uri_ex_z,X3)
| ~ iext(X3,X1,X4)
| ~ icext(X2,X4) ),
inference(spm,[status(thm)],[c_0_1101,c_0_1102]) ).
cnf(c_0_1104,plain,
iext(uri_owl_onClass,uri_ex_z,uri_ex_c),
i_0_1069 ).
cnf(c_0_1105,plain,
( icext(uri_ex_z,X1)
| ~ iext(uri_owl_onProperty,uri_ex_z,X2)
| ~ iext(X2,X1,X3)
| ~ icext(uri_ex_c,X3) ),
inference(spm,[status(thm)],[c_0_1103,c_0_1104]) ).
cnf(c_0_1106,plain,
iext(uri_owl_onProperty,uri_ex_z,uri_ex_p),
i_0_1070 ).
cnf(c_0_1107,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_type,X2,X1) ),
i_0_1091 ).
cnf(c_0_1108,plain,
iext(uri_rdf_type,uri_ex_x,uri_ex_c),
i_0_1068 ).
cnf(c_0_1109,plain,
( icext(uri_ex_z,X1)
| ~ iext(uri_ex_p,X1,X2)
| ~ icext(uri_ex_c,X2) ),
inference(spm,[status(thm)],[c_0_1105,c_0_1106]) ).
cnf(c_0_1110,plain,
iext(uri_ex_p,uri_ex_w,uri_ex_x),
i_0_1067 ).
cnf(c_0_1111,plain,
icext(uri_ex_c,uri_ex_x),
inference(spm,[status(thm)],[c_0_1107,c_0_1108]) ).
cnf(c_0_1112,plain,
( iext(uri_rdf_type,X1,X2)
| ~ icext(X2,X1) ),
i_0_1090 ).
cnf(c_0_1113,plain,
icext(uri_ex_z,uri_ex_w),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1109,c_0_1110]),c_0_1111])]) ).
cnf(c_0_1114,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_w,uri_ex_z),
i_0_1 ).
cnf(c_0_1115,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1112,c_0_1113]),c_0_1114]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWB097+1 : TPTP v8.1.0. Released v5.2.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 1 14:59:22 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.20/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 249.36/33.63 eprover: CPU time limit exceeded, terminating
% 251.65/33.99 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l4800-e0.15+coop-paramils157:
% 251.65/33.99 # SinE strategy is GSinE(CountFormulas,hypos,5.0,,3,500,1.0)
% 251.65/33.99 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l4800-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 17; version: 991; iters: 150)
% 251.65/33.99 # Preprocessing time : 0.792 s
% 251.65/33.99
% 251.65/33.99 # Proof found!
% 251.65/33.99 # SZS status Theorem
% 251.65/33.99 # SZS output start CNFRefutation
% See solution above
% 251.65/33.99 # Training examples: 0 positive, 0 negative
% 251.65/33.99
% 251.65/33.99 # -------------------------------------------------
% 251.65/33.99 # User time : 0.854 s
% 251.65/33.99 # System time : 0.096 s
% 251.65/33.99 # Total time : 0.950 s
% 251.65/33.99 # ...preprocessing : 0.792 s
% 251.65/33.99 # ...main loop : 0.158 s
% 251.65/33.99 # Maximum resident set size: 157784 pages
% 251.65/33.99
%------------------------------------------------------------------------------