%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV169+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n014.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:16:35 PM UTC 2026
% Result : Theorem 3.78s 1.26s
% Output : CNFRefutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 13 unt; 1 def)
% Number of atoms : 144 ( 35 equ)
% Maximal formula atoms : 28 ( 6 avg)
% Number of connectives : 165 ( 49 ~; 42 |; 58 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-3 aty)
% Number of variables : 31 ( 0 sgn 31 !; 0 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( ! [X6] :
( ( leq(X6,n4)
& leq(n0,X6) )
=> a_select3(center_init,X6,n0) = init )
& ! [X4] :
( ( leq(X4,pred(pv10))
& leq(n0,X4) )
=> ! [X5] :
( ( leq(X5,n4)
& leq(n0,X5) )
=> a_select3(q_init,X4,X5) = init ) )
& ! [X2,X3] :
( ( leq(X3,n4)
& leq(X2,n135299)
& leq(n0,X3)
& leq(n0,X2) )
=> ( gt(pv10,X2)
=> a_select3(q_init,X2,X3) = init ) )
& ! [X0,X1] :
( ( leq(X1,n4)
& leq(X0,n135299)
& leq(n0,X1)
& leq(n0,X0) )
=> ( ( gt(pv11,X1)
& X0 = pv10 )
=> a_select3(q_init,X0,X1) = init ) )
& leq(pv65,n4)
& leq(pv11,n4)
& leq(pv10,n135299)
& leq(n0,pv65)
& leq(n0,pv11)
& leq(n0,pv10) )
=> a_select3(center_init,pv65,n0) = init ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0021) ).
fof(f54,negated_conjecture,
~ ( ( ! [X6] :
( ( leq(X6,n4)
& leq(n0,X6) )
=> a_select3(center_init,X6,n0) = init )
& ! [X4] :
( ( leq(X4,pred(pv10))
& leq(n0,X4) )
=> ! [X5] :
( ( leq(X5,n4)
& leq(n0,X5) )
=> a_select3(q_init,X4,X5) = init ) )
& ! [X2,X3] :
( ( leq(X3,n4)
& leq(X2,n135299)
& leq(n0,X3)
& leq(n0,X2) )
=> ( gt(pv10,X2)
=> a_select3(q_init,X2,X3) = init ) )
& ! [X0,X1] :
( ( leq(X1,n4)
& leq(X0,n135299)
& leq(n0,X1)
& leq(n0,X0) )
=> ( ( gt(pv11,X1)
& X0 = pv10 )
=> a_select3(q_init,X0,X1) = init ) )
& leq(pv65,n4)
& leq(pv11,n4)
& leq(pv10,n135299)
& leq(n0,pv65)
& leq(n0,pv11)
& leq(n0,pv10) )
=> a_select3(center_init,pv65,n0) = init ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f143,plain,
( ! [X6] :
( ~ leq(X6,n4)
| ~ leq(n0,X6)
| a_select3(center_init,X6,n0) = init )
& ! [X4] :
( ~ leq(X4,pred(pv10))
| ~ leq(n0,X4)
| ! [X5] :
( ~ leq(X5,n4)
| ~ leq(n0,X5)
| a_select3(q_init,X4,X5) = init ) )
& ! [X2,X3] :
( ~ leq(X3,n4)
| ~ leq(X2,n135299)
| ~ leq(n0,X3)
| ~ leq(n0,X2)
| ~ gt(pv10,X2)
| a_select3(q_init,X2,X3) = init )
& ! [X0,X1] :
( ~ leq(X1,n4)
| ~ leq(X0,n135299)
| ~ leq(n0,X1)
| ~ leq(n0,X0)
| ~ gt(pv11,X1)
| pv10 != X0
| a_select3(q_init,X0,X1) = init )
& leq(pv65,n4)
& leq(pv11,n4)
& leq(pv10,n135299)
& leq(n0,pv65)
& leq(n0,pv11)
& leq(n0,pv10)
& init != a_select3(center_init,pv65,n0) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
( ! [X6] :
( ~ leq(X6,n4)
| ~ leq(n0,X6)
| a_select3(center_init,X6,n0) = init )
& ! [X4] :
( ~ leq(X4,pred(pv10))
| ~ leq(n0,X4)
| ! [X5] :
( ~ leq(X5,n4)
| ~ leq(n0,X5)
| a_select3(q_init,X4,X5) = init ) )
& ! [X2,X3] :
( ~ leq(X3,n4)
| ~ leq(X2,n135299)
| ~ leq(n0,X3)
| ~ leq(n0,X2)
| ~ gt(pv10,X2)
| a_select3(q_init,X2,X3) = init )
& ! [X0,X1] :
( ~ leq(X1,n4)
| ~ leq(X0,n135299)
| ~ leq(n0,X1)
| ~ leq(n0,X0)
| ~ gt(pv11,X1)
| pv10 != X0
| a_select3(q_init,X0,X1) = init )
& leq(pv65,n4)
& leq(pv11,n4)
& leq(pv10,n135299)
& leq(n0,pv65)
& leq(n0,pv11)
& leq(n0,pv10)
& init != a_select3(center_init,pv65,n0) ),
inference(flattening,[],[f143]) ).
fof(f307,plain,
! [X6] :
( ~ leq(X6,n4)
| ~ leq(n0,X6)
| init = a_select3(center_init,X6,n0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f311,plain,
leq(pv65,n4),
inference(cnf_transformation,[],[f144]) ).
fof(f314,plain,
leq(n0,pv65),
inference(cnf_transformation,[],[f144]) ).
fof(f317,plain,
init != a_select3(center_init,pv65,n0),
inference(cnf_transformation,[],[f144]) ).
tcf(c_157,negated_conjecture,
a_select3(center_init,pv65,n0) != init,
inference(cnf_transformation,[],[f317]) ).
tcf(c_160,negated_conjecture,
leq(n0,pv65),
inference(cnf_transformation,[],[f314]) ).
tcf(c_163,negated_conjecture,
leq(pv65,n4),
inference(cnf_transformation,[],[f311]) ).
tcf(c_167,negated_conjecture,
! [X0: $i] :
( ( a_select3(center_init,X0,n0) = init )
| ~ leq(n0,X0)
| ~ leq(X0,n4) ),
inference(cnf_transformation,[],[f307]) ).
tcf(c_5923,definition,
iPr_def_11 = a_select3(center_init,pv65,n0),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_5925,negated_conjecture,
! [X0: $i] :
( ( a_select3(center_init,X0,n0) = init )
| ~ leq(n0,X0)
| ~ leq(X0,n4) ),
inference(demodulation,[status(thm)],[c_167]) ).
tcf(c_5928,negated_conjecture,
leq(pv65,n4),
inference(demodulation,[status(thm)],[c_163]) ).
tcf(c_5931,negated_conjecture,
leq(n0,pv65),
inference(demodulation,[status(thm)],[c_160]) ).
tcf(c_5934,negated_conjecture,
iPr_def_11 != init,
inference(demodulation,[status(thm)],[c_157,c_5923]) ).
tcf(c_8933,plain,
( ( a_select3(center_init,pv65,n0) = init )
| ~ leq(pv65,n4) ),
inference(superposition,[status(thm)],[c_5931,c_5925]) ).
tcf(c_8934,plain,
( ( init = iPr_def_11 )
| ~ leq(pv65,n4) ),
inference(light_normalisation,[status(thm)],[c_8933,c_5923]) ).
tcf(c_8935,plain,
init = iPr_def_11,
inference(forward_subsumption_resolution,[status(thm)],[c_8934,c_5928]) ).
tcf(c_8940,plain,
iPr_def_11 != iPr_def_11,
inference(demodulation,[status(thm)],[c_5934,c_8935]) ).
tcf(c_8941,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_8940]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV169+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n014.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 18:39:47 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 3.78/1.26 % SZS status Started for theBenchmark.p
% 3.78/1.26 % SZS status Theorem for theBenchmark.p
% 3.78/1.26
% 3.78/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.78/1.26
% 3.78/1.26 % ------ iProver source info
% 3.78/1.26
% 3.78/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 3.78/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.78/1.26 % git: non_committed_changes: false
% 3.78/1.26
% 3.78/1.26 % ------ Parsing...
% 3.78/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.78/1.26
% 3.78/1.26 % ------ Preprocessing... sup_sim: 15 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.78/1.26
% 3.78/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.78/1.26
% 3.78/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.78/1.26 % ------ Proving...
% 3.78/1.26 % ------ Problem Properties
% 3.78/1.26
% 3.78/1.26 %
% 3.78/1.26 % clauses 160
% 3.78/1.26 % conjectures 11
% 3.78/1.26 % EPR 50
% 3.78/1.26 % Horn 110
% 3.78/1.26 % unary 62
% 3.78/1.26 % binary 34
% 3.78/1.26 % lits 513
% 3.78/1.26 % lits eq 120
% 3.78/1.26 % fd_pure 0
% 3.78/1.26 % fd_pseudo 0
% 3.78/1.26 % fd_cond 6
% 3.78/1.26 % fd_pseudo_cond 4
% 3.78/1.26 % AC symbols 0
% 3.78/1.26
% 3.78/1.26 % ------ Schedule dynamic 5 is on
% 3.78/1.26
% 3.78/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.78/1.26
% 3.78/1.26
% 3.78/1.26 % ------
% 3.78/1.26 % Current options:
% 3.78/1.26 % ------
% 3.78/1.26
% 3.78/1.26
% 3.78/1.26 %
% 3.78/1.26
% 3.78/1.26 % ------ Proving...
% 3.78/1.26 %
% 3.78/1.26
% 3.78/1.26 % SZS status Theorem for theBenchmark.p
% 3.78/1.26
% 3.78/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.78/1.26
% 3.78/1.26
%------------------------------------------------------------------------------