TSTP Solution File: SWB006+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:17 EDT 2022
% Result : Theorem 7.64s 2.38s
% Output : CNFRefutation 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 15 unt; 0 nHn; 18 RR)
% Number of literals : 23 ( 7 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
( X1 = X2
| ~ iext(uri_owl_sameAs,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j49d7q64/input.p',i_0_2) ).
cnf(i_0_6,plain,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j49d7q64/input.p',i_0_6) ).
cnf(i_0_4,plain,
iext(uri_owl_sameAs,esk1_0,uri_ex_w),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j49d7q64/input.p',i_0_4) ).
cnf(i_0_5,plain,
iext(uri_owl_sameAs,esk1_0,literal_plain(dat_str_abc)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j49d7q64/input.p',i_0_5) ).
cnf(i_0_3,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j49d7q64/input.p',i_0_3) ).
cnf(i_0_1,plain,
( iext(uri_owl_sameAs,X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j49d7q64/input.p',i_0_1) ).
cnf(c_0_13,plain,
( X1 = X2
| ~ iext(uri_owl_sameAs,X1,X2) ),
i_0_2 ).
cnf(c_0_14,plain,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
i_0_6 ).
cnf(c_0_15,plain,
iext(uri_owl_sameAs,esk1_0,uri_ex_w),
i_0_4 ).
cnf(c_0_16,plain,
iext(uri_owl_sameAs,esk1_0,literal_plain(dat_str_abc)),
i_0_5 ).
cnf(c_0_17,plain,
literal_plain(dat_str_abc) = uri_ex_u,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
i_0_3 ).
cnf(c_0_19,plain,
uri_ex_w = esk1_0,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_20,plain,
iext(uri_owl_sameAs,esk1_0,uri_ex_u),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( iext(uri_owl_sameAs,X1,X2)
| X1 != X2 ),
i_0_1 ).
cnf(c_0_22,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,esk1_0),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
uri_ex_u = esk1_0,
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_24,plain,
iext(uri_owl_sameAs,X1,X1),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.32 % Computer : n023.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Wed Jun 1 06:42:58 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 7.64/2.38 # ENIGMATIC: Solved by autoschedule:
% 7.64/2.38 # No SInE strategy applied
% 7.64/2.38 # Trying AutoSched0 for 150 seconds
% 7.64/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S086N
% 7.64/2.38 # and selection function SelectCQIArNp.
% 7.64/2.38 #
% 7.64/2.38 # Preprocessing time : 0.012 s
% 7.64/2.38 # Presaturation interreduction done
% 7.64/2.38
% 7.64/2.38 # Proof found!
% 7.64/2.38 # SZS status Theorem
% 7.64/2.38 # SZS output start CNFRefutation
% See solution above
% 7.64/2.38 # Training examples: 0 positive, 0 negative
% 7.64/2.38
% 7.64/2.38 # -------------------------------------------------
% 7.64/2.38 # User time : 0.012 s
% 7.64/2.38 # System time : 0.006 s
% 7.64/2.38 # Total time : 0.018 s
% 7.64/2.38 # Maximum resident set size: 7120 pages
% 7.64/2.38
%------------------------------------------------------------------------------