TSTP Solution File: SWB006+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% 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 19:20:56 EDT 2022
% Result : Theorem 0.18s 0.42s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 10 unt; 0 nHn; 12 RR)
% Number of literals : 14 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
iext(uri_owl_sameAs,skc1,uri_ex_w),
file('SWB006+2.p',unknown),
[] ).
cnf(2,axiom,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
file('SWB006+2.p',unknown),
[] ).
cnf(3,axiom,
iext(uri_owl_sameAs,skc1,literal_plain(dat_str_abc)),
file('SWB006+2.p',unknown),
[] ).
cnf(4,axiom,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
file('SWB006+2.p',unknown),
[] ).
cnf(5,axiom,
( ~ iext(uri_owl_sameAs,u,v)
| equal(u,v) ),
file('SWB006+2.p',unknown),
[] ).
cnf(6,axiom,
( ~ equal(u,v)
| iext(uri_owl_sameAs,u,v) ),
file('SWB006+2.p',unknown),
[] ).
cnf(7,plain,
~ equal(uri_ex_w,uri_ex_u),
inference(res,[status(thm),theory(equality)],[6,2]),
[iquote('0:Res:6.1,2.0')] ).
cnf(9,plain,
equal(skc1,uri_ex_w),
inference(res,[status(thm),theory(equality)],[1,5]),
[iquote('0:Res:1.0,5.0')] ).
cnf(10,plain,
equal(literal_plain(dat_str_abc),uri_ex_u),
inference(res,[status(thm),theory(equality)],[4,5]),
[iquote('0:Res:4.0,5.0')] ).
cnf(11,plain,
equal(literal_plain(dat_str_abc),skc1),
inference(res,[status(thm),theory(equality)],[3,5]),
[iquote('0:Res:3.0,5.0')] ).
cnf(16,plain,
equal(uri_ex_w,uri_ex_u),
inference(rew,[status(thm),theory(equality)],[10,11,9]),
[iquote('0:Rew:10.0,11.0,9.0,11.0')] ).
cnf(17,plain,
$false,
inference(mrr,[status(thm)],[16,7]),
[iquote('0:MRR:16.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : run_spass %d %s
% 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 06:24:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.42
% 0.18/0.42 SPASS V 3.9
% 0.18/0.42 SPASS beiseite: Proof found.
% 0.18/0.42 % SZS status Theorem
% 0.18/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.42 SPASS derived 9 clauses, backtracked 0 clauses, performed 0 splits and kept 13 clauses.
% 0.18/0.42 SPASS allocated 85089 KBytes.
% 0.18/0.42 SPASS spent 0:00:00.08 on the problem.
% 0.18/0.42 0:00:00.03 for the input.
% 0.18/0.42 0:00:00.02 for the FLOTTER CNF translation.
% 0.18/0.42 0:00:00.00 for inferences.
% 0.18/0.42 0:00:00.00 for the backtracking.
% 0.18/0.42 0:00:00.00 for the reduction.
% 0.18/0.42
% 0.18/0.42
% 0.18/0.42 Here is a proof with depth 1, length 12 :
% 0.18/0.42 % SZS output start Refutation
% See solution above
% 0.18/0.42 Formulae used in the proof : testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes owl_eqdis_sameas
% 0.18/0.42
%------------------------------------------------------------------------------