%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWB002+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n002.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 : Sun Sep 27 08:51:25 AM UTC 2026
% Result : Theorem 0.15s 10.62s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 4 ~; 1 |; 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 : 8 ( 0 sgn 0 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
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(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_conclusion_fullish_002_Existential_Blank_Nodes_neg,negated_conjecture,
~ ? [BNODE_x,BNODE_y] :
( iext(uri_ex_q,BNODE_y,BNODE_x)
& iext(uri_ex_p,BNODE_x,BNODE_y) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_002_Existential_Blank_Nodes]) ).
fof(nnf_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(sk_testcase_premise_fullish_002_Existential_Blank_Nodes,plain,
( iext(uri_ex_q,sK0,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(BNODE_o,sK0)],[nnf_1]) ).
cnf(c_1588,plain,
iext(uri_ex_p,uri_ex_s,sK0),
inference(split_conjunct,[status(thm)],[sk_testcase_premise_fullish_002_Existential_Blank_Nodes]) ).
cnf(c_1589,plain,
iext(uri_ex_q,sK0,uri_ex_s),
inference(split_conjunct,[status(thm)],[sk_testcase_premise_fullish_002_Existential_Blank_Nodes]) ).
cnf(c_1590,negated_conjecture,
( ~ iext(uri_ex_q,B,A)
| ~ iext(uri_ex_p,A,B) ),
inference(clausify,[status(thm)],[testcase_conclusion_fullish_002_Existential_Blank_Nodes_neg]) ).
cnf(c_1756,negated_conjecture,
~ iext(uri_ex_q,sK0,uri_ex_s),
inference(resolve,[status(thm)],[c_1590,c_1588]) ).
cnf(c_1755,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_1589,c_1756]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB002+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/10.38 % Computer : n002.cluster.edu
% 0.12/10.38 % Model : x86_64 x86_64
% 0.12/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.38 % Memory : 8046.5625MB
% 0.12/10.38 % OS : Linux 6.8.0-71-generic
% 0.12/10.38 % CPULimit : 300
% 0.12/10.38 % WCLimit : 300
% 0.12/10.38 % DateTime : Sat Sep 26 11:41:06 UTC 2026
% 0.12/10.39 % CPUTime :
% 0.12/10.39 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/10.39 % Process 1627167 was started by sandbox2 on n002,
% 0.12/10.39 % Sat Sep 26 11:41:06 2026
% 0.12/10.39 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/10.47
% 0.15/10.47 % From the command line: assign(max_seconds, 300).
% 0.15/10.47
% 0.15/10.47 % SInE: 1 to sos, 558 to usable, of 559 axioms (tolerance 2.00, depth 0 fixpoint).
% 0.15/10.62
% 0.15/10.62 % SZS status Theorem for theBenchmark
% 0.15/10.62
% 0.15/10.62 % Proof 1 at 0.08 (+ 0.03) seconds.
% 0.15/10.62 % Length of proof is 6.
% 0.15/10.62 % Level of proof is 2.
% 0.15/10.62 % Maximum clause weight is 10.000.
% 0.15/10.62 % Given clauses 5.
% 0.15/10.62
% 0.15/10.62 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------