%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWB002+3 : 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 : n016.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:20 PM UTC 2026
% Result : Theorem 3.30s 1.17s
% Output : CNFRefutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 5 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 13 ( 0 sgn 8 !; 5 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f139,conjecture,
? [X0,X1] :
( iext(uri_ex_q,X1,X0)
& iext(uri_ex_p,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).
fof(f140,negated_conjecture,
~ ? [X0,X1] :
( iext(uri_ex_q,X1,X0)
& iext(uri_ex_p,X0,X1) ),
inference(negated_conjecture,[status(cth)],[f139]) ).
fof(f141,axiom,
? [X0] :
( iext(uri_ex_q,X0,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).
fof(f211,plain,
! [X0,X1] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(ennf_transformation,[],[f140]) ).
fof(f300,plain,
( iext(uri_ex_q,sK26,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,sK26) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK26]),skolemize(X0,sK26)],[f141]) ).
fof(f555,plain,
! [X0,X1] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(cnf_transformation,[],[f211]) ).
fof(f556,plain,
iext(uri_ex_q,sK26,uri_ex_s),
inference(cnf_transformation,[],[f300]) ).
fof(f557,plain,
iext(uri_ex_p,uri_ex_s,sK26),
inference(cnf_transformation,[],[f300]) ).
tcf(c_303,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(cnf_transformation,[],[f555]) ).
tcf(c_304,plain,
iext(uri_ex_p,uri_ex_s,sK26),
inference(cnf_transformation,[],[f557]) ).
tcf(c_305,plain,
iext(uri_ex_q,sK26,uri_ex_s),
inference(cnf_transformation,[],[f556]) ).
tcf(c_9897,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(demodulation,[status(thm)],[c_303]) ).
tcf(c_9898,plain,
( ~ iext(uri_ex_q,sK26,uri_ex_s)
| ~ iext(uri_ex_p,uri_ex_s,sK26) ),
inference(instantiation,[status(thm)],[c_9897]) ).
tcf(c_9899,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_9898,c_304,c_305]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB002+3 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n016.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 15:23:15 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 3.30/1.17 % SZS status Started for theBenchmark.p
% 3.30/1.17 % SZS status Theorem for theBenchmark.p
% 3.30/1.17
% 3.30/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.30/1.17
% 3.30/1.17 % ------ iProver source info
% 3.30/1.17
% 3.30/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 3.30/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.30/1.17 % git: non_committed_changes: false
% 3.30/1.17
% 3.30/1.17 % ------ Parsing...
% 3.30/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.30/1.17
% 3.30/1.17 % ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.30/1.17
% 3.30/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.30/1.17 % ------ Proving...
% 3.30/1.17 % ------ Problem Properties
% 3.30/1.17
% 3.30/1.17 %
% 3.30/1.17 % clauses 214
% 3.30/1.17 % conjectures 1
% 3.30/1.17 % EPR 182
% 3.30/1.17 % Horn 196
% 3.30/1.17 % unary 74
% 3.30/1.17 % binary 60
% 3.30/1.17 % lits 551
% 3.30/1.17 % lits eq 0
% 3.30/1.17 % fd_pure 0
% 3.30/1.17 % fd_pseudo 0
% 3.30/1.17 % fd_cond 0
% 3.30/1.17 % fd_pseudo_cond 0
% 3.30/1.17 % AC symbols 0
% 3.30/1.17
% 3.30/1.17 % ------ Schedule dynamic 5 is on
% 3.30/1.17
% 3.30/1.17 % ------ no equalities: superposition off
% 3.30/1.17
% 3.30/1.17 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.30/1.17
% 3.30/1.17
% 3.30/1.17 % ------
% 3.30/1.17 % Current options:
% 3.30/1.17 % ------
% 3.30/1.17
% 3.30/1.17
% 3.30/1.17 %
% 3.30/1.17
% 3.30/1.17 % ------ Proving...
% 3.30/1.17 %
% 3.30/1.17
% 3.30/1.17 % SZS status Theorem for theBenchmark.p
% 3.30/1.17
% 3.30/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.30/1.17
% 3.30/1.17
%------------------------------------------------------------------------------