%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWB002+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n013.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:19 PM UTC 2026
% Result : Theorem 2.83s 1.72s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 6 unt; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 3 |; 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 : 11 ( 0 sgn 6 !; 5 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f559,conjecture,
? [X0,X1] :
( iext(uri_ex_q,X1,X0)
& iext(uri_ex_p,X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).
fof(f560,negated_conjecture,
~ ? [X0,X1] :
( iext(uri_ex_q,X1,X0)
& iext(uri_ex_p,X0,X1) ),
inference(negated_conjecture,[status(cth)],[f559]) ).
fof(f561,axiom,
? [X0] :
( iext(uri_ex_q,X0,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).
fof(f980,plain,
! [X0,X1] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(ennf_transformation,[],[f560]) ).
fof(f1460,plain,
( iext(uri_ex_q,sK251,uri_ex_s)
& iext(uri_ex_p,uri_ex_s,sK251) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK251]),skolemize(X0,sK251)],[f561]) ).
fof(f2750,plain,
! [X0,X1] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(cnf_transformation,[],[f980]) ).
fof(f2751,plain,
iext(uri_ex_q,sK251,uri_ex_s),
inference(cnf_transformation,[],[f1460]) ).
fof(f2752,plain,
iext(uri_ex_p,uri_ex_s,sK251),
inference(cnf_transformation,[],[f1460]) ).
tcf(c_1326,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ iext(uri_ex_q,X1,X0)
| ~ iext(uri_ex_p,X0,X1) ),
inference(cnf_transformation,[],[f2750]) ).
tcf(c_1327,plain,
iext(uri_ex_p,uri_ex_s,sK251),
inference(cnf_transformation,[],[f2752]) ).
tcf(c_1328,plain,
iext(uri_ex_q,sK251,uri_ex_s),
inference(cnf_transformation,[],[f2751]) ).
tcf(c_4536,plain,
~ iext(uri_ex_q,sK251,uri_ex_s),
inference(superposition,[status(thm)],[c_1327,c_1326]) ).
tcf(c_4537,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1328,c_4536]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWB002+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35 % Computer : n013.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Thu Sep 24 15:17:22 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 2.83/1.72 % SZS status Started for theBenchmark.p
% 2.83/1.72 % SZS status Theorem for theBenchmark.p
% 2.83/1.72
% 2.83/1.72 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.83/1.72
% 2.83/1.72 % ------ iProver source info
% 2.83/1.72
% 2.83/1.72 % git: date: 2026-07-19 20:42:38 +0200
% 2.83/1.72 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.83/1.72 % git: non_committed_changes: false
% 2.83/1.72
% 2.83/1.72 % ------ Parsing...
% 2.83/1.72 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.83/1.72 % ------ Proving...
% 2.83/1.72 % ------ Problem Properties
% 2.83/1.72
% 2.83/1.72 %
% 2.83/1.72 % clauses 1280
% 2.83/1.72 % conjectures 1
% 2.83/1.72 % EPR 819
% 2.83/1.72 % Horn 1005
% 2.83/1.72 % unary 208
% 2.83/1.72 % binary 548
% 2.83/1.72 % lits 4062
% 2.83/1.72 % lits eq 197
% 2.83/1.72 % fd_pure 0
% 2.83/1.72 % fd_pseudo 0
% 2.83/1.72 % fd_cond 0
% 2.83/1.72 % fd_pseudo_cond 66
% 2.83/1.72 % AC symbols 0
% 2.83/1.72
% 2.83/1.72 % ------ Input Options Time Limit: Unbounded
% 2.83/1.72
% 2.83/1.72
% 2.83/1.72 % ------
% 2.83/1.72 % Current options:
% 2.83/1.72 % ------
% 2.83/1.72
% 2.83/1.72
% 2.83/1.72 %
% 2.83/1.72
% 2.83/1.72 % ------ Proving...
% 2.83/1.72 %
% 2.83/1.72
% 2.83/1.72 % ------ Proving...
% 2.83/1.72 %
% 2.83/1.72
% 2.83/1.72 % ------ Proving...
% 2.83/1.72 %
% 2.83/1.72
% 2.83/1.72 % SZS status Theorem for theBenchmark.p
% 2.83/1.72
% 2.83/1.72 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.83/1.72
% 2.83/1.72
%------------------------------------------------------------------------------