%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWB006+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.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 : Thu Sep 24 09:00:53 AM UTC 2026
% Result : Theorem 0.11s 0.41s
% Output : Proof 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(owl_eqdis_sameas,axiom,
! [X,Y] :
( iext(uri_owl_sameAs,X,Y)
<=> X = Y ),
file('theBenchmark.p',owl_eqdis_sameas) ).
fof(testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,conjecture,
iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
file('theBenchmark.p',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
fof(testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,axiom,
? [BNODE_x] :
( iext(uri_owl_sameAs,BNODE_x,uri_ex_w)
& iext(uri_owl_sameAs,BNODE_x,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
file('theBenchmark.p',testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
fof(f_1_1,plain,
! [X,Y] :
( ( iext(uri_owl_sameAs,X,Y)
| X != Y )
& ( X = Y
| ~ iext(uri_owl_sameAs,X,Y) ) ),
inference(fof_nnf,[status(thm)],[owl_eqdis_sameas]) ).
fof(f_1_2,plain,
! [U_1,U_0] :
( ( iext(uri_owl_sameAs,U_1,U_0)
| U_1 != U_0 )
& ( U_1 = U_0
| ~ iext(uri_owl_sameAs,U_1,U_0) ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_5,U_3] :
( iext(uri_owl_sameAs,U_5,U_3)
| U_5 != U_3 )
& ! [U_4,U_2] :
( U_4 = U_2
| ~ iext(uri_owl_sameAs,U_4,U_2) ) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
( U_4 = U_2
| ~ iext(uri_owl_sameAs,U_4,U_2) ),
inference(clausify,[status(thm)],[f_1_3]) ).
cnf(f_1_5,plain,
( iext(uri_owl_sameAs,U_5,U_3)
| U_5 != U_3 ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(negate,[status(cth)],[testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes]) ).
fof(f_2_2,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(definitional_conversion,[status(esa)],[f_2_1]) ).
cnf(f_2_3,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,plain,
? [BNODE_x] :
( iext(uri_owl_sameAs,BNODE_x,uri_ex_w)
& iext(uri_owl_sameAs,BNODE_x,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
inference(fof_nnf,[status(thm)],[testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes]) ).
fof(f_3_2,plain,
? [U_6] :
( iext(uri_owl_sameAs,U_6,uri_ex_w)
& iext(uri_owl_sameAs,U_6,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( ? [U_6] :
( iext(uri_owl_sameAs,U_6,uri_ex_w)
& iext(uri_owl_sameAs,U_6,literal_plain(dat_str_abc)) )
& iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
inference(miniscope,[status(thm)],[f_3_2]) ).
fof(f_3_4,plain,
( iext(uri_owl_sameAs,sK1,uri_ex_w)
& iext(uri_owl_sameAs,sK1,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_6,sK1)],[f_3_3]) ).
cnf(f_3_5,plain,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_6,plain,
iext(uri_owl_sameAs,sK1,literal_plain(dat_str_abc)),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_7,plain,
iext(uri_owl_sameAs,sK1,uri_ex_w),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( literal_plain(Eq_x_0) = literal_plain(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( iext(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ iext(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB006+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n007.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 01:01:04 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.41 % SZS status Theorem for theBenchmark
% 0.11/0.41 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------