%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWB006+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 03:04:21 PM UTC 2026
% Result : Theorem 3.26s 26.48s
% Output : CNFRefutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 19 unt; 0 def)
% Number of atoms : 35 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 19 ( 9 ~; 4 |; 5 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 8 !; 1 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f354,axiom,
! [X0,X1] :
( iext(uri_owl_sameAs,X0,X1)
<=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_eqdis_sameas) ).
fof(f559,conjecture,
iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
fof(f560,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(negated_conjecture,[status(cth)],[f559]) ).
fof(f561,axiom,
? [X0] :
( iext(uri_owl_sameAs,X0,uri_ex_w)
& iext(uri_owl_sameAs,X0,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
fof(f572,plain,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(flattening,[],[f560]) ).
fof(f1362,plain,
! [X0,X1] :
( ( ~ iext(uri_owl_sameAs,X0,X1)
| X0 = X1 )
& ( X0 != X1
| iext(uri_owl_sameAs,X0,X1) ) ),
inference(nnf_transformation,[],[f354]) ).
fof(f1460,plain,
( iext(uri_owl_sameAs,sK251,uri_ex_w)
& iext(uri_owl_sameAs,sK251,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK251]),skolemize(X0,sK251)],[f561]) ).
fof(f2397,plain,
! [X0,X1] :
( ~ iext(uri_owl_sameAs,X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f1362]) ).
fof(f2750,plain,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(cnf_transformation,[],[f572]) ).
fof(f2751,plain,
iext(uri_owl_sameAs,sK251,uri_ex_w),
inference(cnf_transformation,[],[f1460]) ).
fof(f2752,plain,
iext(uri_owl_sameAs,sK251,literal_plain(dat_str_abc)),
inference(cnf_transformation,[],[f1460]) ).
fof(f2753,plain,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
inference(cnf_transformation,[],[f1460]) ).
tcf(c_982,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ iext(uri_owl_sameAs,X0,X1) ),
inference(cnf_transformation,[],[f2397]) ).
tcf(c_1326,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(cnf_transformation,[],[f2750]) ).
tcf(c_1327,plain,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
inference(cnf_transformation,[],[f2753]) ).
tcf(c_1328,plain,
iext(uri_owl_sameAs,sK251,literal_plain(dat_str_abc)),
inference(cnf_transformation,[],[f2752]) ).
tcf(c_1329,plain,
iext(uri_owl_sameAs,sK251,uri_ex_w),
inference(cnf_transformation,[],[f2751]) ).
tcf(c_1489,plain,
literal_plain(dat_str_abc) = uri_ex_u,
inference(superposition,[status(thm)],[c_1327,c_982]) ).
tcf(c_1490,plain,
literal_plain(dat_str_abc) = sK251,
inference(superposition,[status(thm)],[c_1328,c_982]) ).
tcf(c_1491,plain,
uri_ex_w = sK251,
inference(superposition,[status(thm)],[c_1329,c_982]) ).
tcf(c_1492,plain,
iext(uri_owl_sameAs,uri_ex_u,uri_ex_u),
inference(demodulation,[status(thm)],[c_1327,c_1489]) ).
tcf(c_1498,plain,
literal_plain(dat_str_abc) = uri_ex_w,
inference(light_normalisation,[status(thm)],[c_1490,c_1491]) ).
tcf(c_1499,plain,
uri_ex_u = uri_ex_w,
inference(superposition,[status(thm)],[c_1498,c_1489]) ).
tcf(c_1504,plain,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_u),
inference(demodulation,[status(thm)],[c_1326,c_1499]) ).
tcf(c_1505,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1504,c_1492]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB006+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.28/25.65 % CPULimit : 300
% 0.28/25.65 % WCLimit : 300
% 0.28/25.65 % DateTime : Thu Sep 24 15:24:18 UTC 2026
% 0.28/25.65 % CPUTime :
% 0.28/25.65 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.28/25.68 Running first-order theorem proving
% 0.28/25.68 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.28/25.69
% 0.28/25.69 % ======== iProver multi-core TPTP/SMT =========
% 0.28/25.69
% 0.28/25.69 % Detected problem language: tptp
% 0.34/25.71 % Proving...
% 3.26/26.48 % SZS status Started for theBenchmark.p
% 3.26/26.48 % SZS status Theorem for theBenchmark.p
% 3.26/26.48
% 3.26/26.48 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.26/26.48
% 3.26/26.48 % ------ iProver source info
% 3.26/26.48
% 3.26/26.48 % git: date: 2026-07-19 20:42:38 +0200
% 3.26/26.48 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.26/26.48 % git: non_committed_changes: false
% 3.26/26.48
% 3.26/26.48 % ------ Parsing...
% 3.26/26.48 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.26/26.48 % ------ Proving...
% 3.26/26.48 % ------ Problem Properties
% 3.26/26.48
% 3.26/26.48 %
% 3.26/26.48 % clauses 1281
% 3.26/26.48 % conjectures 1
% 3.26/26.48 % EPR 818
% 3.26/26.48 % Horn 1006
% 3.26/26.48 % unary 210
% 3.26/26.48 % binary 547
% 3.26/26.48 % lits 4062
% 3.26/26.48 % lits eq 197
% 3.26/26.48 % fd_pure 0
% 3.26/26.48 % fd_pseudo 0
% 3.26/26.48 % fd_cond 0
% 3.26/26.48 % fd_pseudo_cond 66
% 3.26/26.48 % AC symbols 0
% 3.26/26.48
% 3.26/26.48 % ------ Input Options Time Limit: Unbounded
% 3.26/26.48
% 3.26/26.48
% 3.26/26.48 % ------
% 3.26/26.48 % Current options:
% 3.26/26.48 % ------
% 3.26/26.48
% 3.26/26.48
% 3.26/26.48 %
% 3.26/26.48
% 3.26/26.48 % ------ Proving...
% 3.26/26.48 %
% 3.26/26.48
% 3.26/26.48 % ------ Proving...
% 3.26/26.48 %
% 3.26/26.48
% 3.26/26.48 % ------ Proving...
% 3.26/26.48 %
% 3.26/26.48
% 3.26/26.48 % ------ Proving...
% 3.26/26.48 %
% 3.26/26.48
% 3.26/26.48 % ------ Proving...
% 3.26/26.48 %
% 3.26/26.48
% 3.26/26.48 % SZS status Theorem for theBenchmark.p
% 3.26/26.48
% 3.26/26.48 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.26/26.48
% 3.26/26.48
%------------------------------------------------------------------------------