%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWB002+3 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n010.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:03:39 PM UTC 2026
% Result : Theorem 4.35s 6.43s
% Output : Proof 4.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 4 unt; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 3 |; 5 &)
% ( 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 : 12 ( 0 sgn 4 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f139,axiom,
? [BNODE_o] :
( iext(uri_ex_q,BNODE_o,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,BNODE_o) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).
fof(f139_nnf,plain,
? [BNODE_o] :
( iext(uri_ex_q,BNODE_o,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,BNODE_o) ),
inference(nnf_transformation,[status(thm)],[f139]) ).
fof(f139_sk,plain,
( iext(uri_ex_q,sk18,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,sk18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk18])],[f139_nnf]) ).
cnf(c268,plain,
iext(uri_ex_q,sk18,uri_ex_s),
inference(cnf_transformation,[status(esa)],[f139_sk]) ).
cnf(c267,plain,
iext(uri_ex_p,uri_ex_s,sk18),
inference(cnf_transformation,[status(esa)],[f139_sk]) ).
fof(f138,conjecture,
? [BNODE_x,BNODE_y] :
( iext(uri_ex_q,BNODE_y,BNODE_x)
& iext(uri_ex_p,BNODE_x,BNODE_y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).
fof(f138_neg,negated_conjecture,
~ ? [BNODE_x,BNODE_y] :
( iext(uri_ex_q,BNODE_y,BNODE_x)
& iext(uri_ex_p,BNODE_x,BNODE_y) ),
inference(negated_conjecture,[status(cth)],[f138]) ).
fof(f138_nnf,plain,
! [BNODE_x,BNODE_y] :
( ~ iext(uri_ex_q,BNODE_y,BNODE_x)
| ~ iext(uri_ex_p,BNODE_x,BNODE_y) ),
inference(nnf_transformation,[status(thm)],[f138_neg]) ).
fof(f138_sk,plain,
! [BNODE_x,BNODE_y] :
( ~ iext(uri_ex_q,BNODE_y,BNODE_x)
| ~ iext(uri_ex_p,BNODE_x,BNODE_y) ),
inference(skolemisation,[status(esa)],[f138_nnf]) ).
cnf(c266,plain,
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(cnf_transformation,[status(esa)],[f138_sk]) ).
cnf(p269,plain,
~ iext(uri_ex_q,sk18,uri_ex_s),
inference(resolution,[status(thm)],[c267,c266]) ).
cnf(p270,plain,
$false,
inference(resolution,[status(thm)],[c268,p269]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB002+3 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/5.60 % Computer : n010.cluster.edu
% 0.10/5.60 % Model : x86_64 x86_64
% 0.10/5.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.60 % Memory : 8046.5625MB
% 0.10/5.60 % OS : Linux 6.8.0-71-generic
% 0.10/5.60 % CPULimit : 300
% 0.10/5.60 % WCLimit : 300
% 0.10/5.60 % DateTime : Thu Sep 24 15:18:36 UTC 2026
% 0.10/5.60 % CPUTime :
% 0.10/5.60 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.35/6.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.35/6.43 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------