TSTP Solution File: SWB017+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWB017+2 : 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:58:38 EDT 2022
% Result : Theorem 7.77s 2.38s
% Output : CNFRefutation 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 11 unt; 2 nHn; 14 RR)
% Number of literals : 23 ( 3 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,negated_conjecture,
~ iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n9ph8bh4/lgb.p',i_0_8) ).
cnf(i_0_1,plain,
( X1 = X2
| iext(uri_owl_differentFrom,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n9ph8bh4/lgb.p',i_0_1) ).
cnf(i_0_5,plain,
( ~ iext(X1,X2,X3)
| ~ iext(X4,X2,X3)
| ~ iext(uri_owl_propertyDisjointWith,X4,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n9ph8bh4/lgb.p',i_0_5) ).
cnf(i_0_11,plain,
iext(uri_owl_propertyDisjointWith,uri_ex_notInstanceOf,uri_rdf_type),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n9ph8bh4/lgb.p',i_0_11) ).
cnf(i_0_10,plain,
iext(uri_rdf_type,uri_ex_w,uri_ex_c),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n9ph8bh4/lgb.p',i_0_10) ).
cnf(i_0_9,plain,
iext(uri_ex_notInstanceOf,uri_ex_u,uri_ex_c),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n9ph8bh4/lgb.p',i_0_9) ).
cnf(c_0_18,negated_conjecture,
~ iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u),
i_0_8 ).
cnf(c_0_19,plain,
( X1 = X2
| iext(uri_owl_differentFrom,X1,X2) ),
i_0_1 ).
cnf(c_0_20,plain,
( ~ iext(X1,X2,X3)
| ~ iext(X4,X2,X3)
| ~ iext(uri_owl_propertyDisjointWith,X4,X1) ),
i_0_5 ).
cnf(c_0_21,plain,
iext(uri_owl_propertyDisjointWith,uri_ex_notInstanceOf,uri_rdf_type),
i_0_11 ).
cnf(c_0_22,plain,
iext(uri_rdf_type,uri_ex_w,uri_ex_c),
i_0_10 ).
cnf(c_0_23,negated_conjecture,
uri_ex_w = uri_ex_u,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ iext(uri_ex_notInstanceOf,X1,X2)
| ~ iext(uri_rdf_type,X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
iext(uri_ex_notInstanceOf,uri_ex_u,uri_ex_c),
i_0_9 ).
cnf(c_0_26,plain,
iext(uri_rdf_type,uri_ex_u,uri_ex_c),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWB017+2 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.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 : Wed Jun 1 11:24:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.77/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.77/2.38 # No SInE strategy applied
% 7.77/2.38 # Trying AutoSched0 for 150 seconds
% 7.77/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S039I
% 7.77/2.38 # and selection function PSelectUnlessUniqMaxPos.
% 7.77/2.38 #
% 7.77/2.38 # Preprocessing time : 0.020 s
% 7.77/2.38 # Presaturation interreduction done
% 7.77/2.38
% 7.77/2.38 # Proof found!
% 7.77/2.38 # SZS status Theorem
% 7.77/2.38 # SZS output start CNFRefutation
% See solution above
% 7.77/2.38 # Training examples: 0 positive, 0 negative
% 7.77/2.38
% 7.77/2.38 # -------------------------------------------------
% 7.77/2.38 # User time : 0.021 s
% 7.77/2.38 # System time : 0.007 s
% 7.77/2.38 # Total time : 0.028 s
% 7.77/2.38 # Maximum resident set size: 7120 pages
% 7.77/2.38
%------------------------------------------------------------------------------