%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWB002+1 : 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 : n018.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:51 AM UTC 2026
% Result : Theorem 30.24s 30.50s
% Output : Proof 30.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 23 ( 11 ~; 5 |; 7 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 15 ( 0 sgn 6 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_002_Existential_Blank_Nodes,conjecture,
? [BNODE_x,BNODE_y] :
( iext(uri_ex_q,BNODE_y,BNODE_x)
& iext(uri_ex_p,BNODE_x,BNODE_y) ),
file('theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).
fof(testcase_premise_fullish_002_Existential_Blank_Nodes,axiom,
? [BNODE_o] :
( iext(uri_ex_q,BNODE_o,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,BNODE_o) ),
file('theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).
fof(f_559_1,negated_conjecture,
~ ? [BNODE_x,BNODE_y] :
( iext(uri_ex_q,BNODE_y,BNODE_x)
& iext(uri_ex_p,BNODE_x,BNODE_y) ),
inference(negate,[status(cth)],[testcase_conclusion_fullish_002_Existential_Blank_Nodes]) ).
fof(f_559_2,negated_conjecture,
! [BNODE_x,BNODE_y] :
( ~ iext(uri_ex_q,BNODE_y,BNODE_x)
| ~ iext(uri_ex_p,BNODE_x,BNODE_y) ),
inference(fof_nnf,[status(thm)],[f_559_1]) ).
fof(f_559_3,negated_conjecture,
! [U_1426,U_1425] :
( ~ iext(uri_ex_q,U_1425,U_1426)
| ~ iext(uri_ex_p,U_1426,U_1425) ),
inference(variable_rename,[status(thm)],[f_559_2]) ).
fof(f_559_4,negated_conjecture,
! [U_1425,U_1426] :
( ~ iext(uri_ex_q,U_1425,U_1426)
| ~ iext(uri_ex_p,U_1426,U_1425) ),
inference(definitional_conversion,[status(esa)],[f_559_3]) ).
cnf(f_559_5,negated_conjecture,
( ~ iext(uri_ex_q,U_1425,U_1426)
| ~ iext(uri_ex_p,U_1426,U_1425) ),
inference(clausify,[status(thm)],[f_559_4]) ).
fof(f_560_1,plain,
? [BNODE_o] :
( iext(uri_ex_q,BNODE_o,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,BNODE_o) ),
inference(fof_nnf,[status(thm)],[testcase_premise_fullish_002_Existential_Blank_Nodes]) ).
fof(f_560_2,plain,
? [U_1427] :
( iext(uri_ex_q,U_1427,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,U_1427) ),
inference(variable_rename,[status(thm)],[f_560_1]) ).
fof(f_560_3,plain,
( iext(uri_ex_q,sK218,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,sK218) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK218]),skolemize(U_1427,sK218)],[f_560_2]) ).
fof(f_560_4,plain,
( iext(uri_ex_q,sK218,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,sK218) ),
inference(definitional_conversion,[status(esa)],[f_560_3]) ).
cnf(f_560_5,plain,
iext(uri_ex_p,uri_ex_s,sK218),
inference(clausify,[status(thm)],[f_560_4]) ).
cnf(f_560_6,plain,
iext(uri_ex_q,sK218,uri_ex_s),
inference(clausify,[status(thm)],[f_560_4]) ).
cnf(t1,plain,
( ~ iext(uri_ex_q,sK218,uri_ex_s)
| ~ iext(uri_ex_p,uri_ex_s,sK218) ),
inference(start,[status(thm),parent(0:0)],[f_559_5]) ).
cnf(t2,plain,
iext(uri_ex_p,uri_ex_s,sK218),
inference(extension,[status(thm),parent(t1:1)],[f_560_5]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
iext(uri_ex_q,sK218,uri_ex_s),
inference(extension,[status(thm),parent(t1:2)],[f_560_6]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB002+1 : 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.08/0.36 % Computer : n018.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 20 01:05:13 UTC 2026
% 0.08/0.36 % CPUTime :
% 30.24/30.50 % SZS status Theorem for theBenchmark
% 30.24/30.50 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------