%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV184+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n011.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:37 PM UTC 2026
% Result : Theorem 1.86s 16.40s
% Output : CNFRefutation 1.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 28 ( 15 unt; 1 def)
% Number of atoms : 204 ( 55 equ)
% Maximal formula atoms : 27 ( 7 avg)
% Number of connectives : 261 ( 91 ~; 82 |; 64 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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 : 15 ( 15 usr; 13 con; 0-3 aty)
% Number of variables : 52 ( 0 sgn 49 !; 3 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( ( gt(loopcounter,n1)
=> ! [X6] :
( ( leq(X6,n4)
& leq(n0,X6) )
=> a_select2(sigmaold_init,X6) = init ) )
& ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(X5,n4)
& leq(n0,X5) )
=> a_select2(rhoold_init,X5) = init ) )
& ( gt(loopcounter,n1)
=> ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select2(muold_init,X4) = init ) )
& ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> a_select3(center_init,X3,n0) = init )
& ! [X2] :
( ( leq(X2,n4)
& leq(n0,X2) )
=> a_select2(rho_init,X2) = init )
& ! [X0] :
( ( leq(X0,n135299)
& leq(n0,X0) )
=> ! [X1] :
( ( leq(X1,n4)
& leq(n0,X1) )
=> a_select3(q_init,X0,X1) = init ) )
& gt(loopcounter,n1) )
=> ! [X7] :
( ( leq(X7,n4)
& leq(n0,X7) )
=> a_select2(sigmaold_init,X7) = init ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0096) ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n1)
=> ! [X6] :
( ( leq(X6,n4)
& leq(n0,X6) )
=> a_select2(sigmaold_init,X6) = init ) )
& ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(X5,n4)
& leq(n0,X5) )
=> a_select2(rhoold_init,X5) = init ) )
& ( gt(loopcounter,n1)
=> ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select2(muold_init,X4) = init ) )
& ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> a_select3(center_init,X3,n0) = init )
& ! [X2] :
( ( leq(X2,n4)
& leq(n0,X2) )
=> a_select2(rho_init,X2) = init )
& ! [X0] :
( ( leq(X0,n135299)
& leq(n0,X0) )
=> ! [X1] :
( ( leq(X1,n4)
& leq(n0,X1) )
=> a_select3(q_init,X0,X1) = init ) )
& gt(loopcounter,n1) )
=> ! [X7] :
( ( leq(X7,n4)
& leq(n0,X7) )
=> a_select2(sigmaold_init,X7) = init ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f143,plain,
( ( ~ gt(loopcounter,n1)
| ! [X6] :
( ~ leq(X6,n4)
| ~ leq(n0,X6)
| a_select2(sigmaold_init,X6) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [X5] :
( ~ leq(X5,n4)
| ~ leq(n0,X5)
| a_select2(rhoold_init,X5) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [X4] :
( ~ leq(X4,n4)
| ~ leq(n0,X4)
| a_select2(muold_init,X4) = init ) )
& ! [X3] :
( ~ leq(X3,n4)
| ~ leq(n0,X3)
| a_select3(center_init,X3,n0) = init )
& ! [X2] :
( ~ leq(X2,n4)
| ~ leq(n0,X2)
| a_select2(rho_init,X2) = init )
& ! [X0] :
( ~ leq(X0,n135299)
| ~ leq(n0,X0)
| ! [X1] :
( ~ leq(X1,n4)
| ~ leq(n0,X1)
| a_select3(q_init,X0,X1) = init ) )
& gt(loopcounter,n1)
& ? [X7] :
( leq(X7,n4)
& leq(n0,X7)
& init != a_select2(sigmaold_init,X7) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
( ( ~ gt(loopcounter,n1)
| ! [X6] :
( ~ leq(X6,n4)
| ~ leq(n0,X6)
| a_select2(sigmaold_init,X6) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [X5] :
( ~ leq(X5,n4)
| ~ leq(n0,X5)
| a_select2(rhoold_init,X5) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [X4] :
( ~ leq(X4,n4)
| ~ leq(n0,X4)
| a_select2(muold_init,X4) = init ) )
& ! [X3] :
( ~ leq(X3,n4)
| ~ leq(n0,X3)
| a_select3(center_init,X3,n0) = init )
& ! [X2] :
( ~ leq(X2,n4)
| ~ leq(n0,X2)
| a_select2(rho_init,X2) = init )
& ! [X0] :
( ~ leq(X0,n135299)
| ~ leq(n0,X0)
| ! [X1] :
( ~ leq(X1,n4)
| ~ leq(n0,X1)
| a_select3(q_init,X0,X1) = init ) )
& gt(loopcounter,n1)
& ? [X7] :
( leq(X7,n4)
& leq(n0,X7)
& init != a_select2(sigmaold_init,X7) ) ),
inference(flattening,[],[f143]) ).
fof(f197,plain,
( ( ~ gt(loopcounter,n1)
| ! [X7] :
( ~ leq(X7,n4)
| ~ leq(n0,X7)
| init = a_select2(sigmaold_init,X7) ) )
& ( ~ gt(loopcounter,n1)
| ! [X6] :
( ~ leq(X6,n4)
| ~ leq(n0,X6)
| init = a_select2(rhoold_init,X6) ) )
& ( ~ gt(loopcounter,n1)
| ! [X5] :
( ~ leq(X5,n4)
| ~ leq(n0,X5)
| init = a_select2(muold_init,X5) ) )
& ! [X4] :
( ~ leq(X4,n4)
| ~ leq(n0,X4)
| init = a_select3(center_init,X4,n0) )
& ! [X3] :
( ~ leq(X3,n4)
| ~ leq(n0,X3)
| init = a_select2(rho_init,X3) )
& ! [X1] :
( ~ leq(X1,n135299)
| ~ leq(n0,X1)
| ! [X2] :
( ~ leq(X2,n4)
| ~ leq(n0,X2)
| init = a_select3(q_init,X1,X2) ) )
& gt(loopcounter,n1)
& ? [X0] :
( leq(X0,n4)
& leq(n0,X0)
& init != a_select2(sigmaold_init,X0) ) ),
inference(rectify,[],[f144]) ).
fof(f198,plain,
( ( ~ gt(loopcounter,n1)
| ! [X7] :
( ~ leq(X7,n4)
| ~ leq(n0,X7)
| init = a_select2(sigmaold_init,X7) ) )
& ( ~ gt(loopcounter,n1)
| ! [X6] :
( ~ leq(X6,n4)
| ~ leq(n0,X6)
| init = a_select2(rhoold_init,X6) ) )
& ( ~ gt(loopcounter,n1)
| ! [X5] :
( ~ leq(X5,n4)
| ~ leq(n0,X5)
| init = a_select2(muold_init,X5) ) )
& ! [X4] :
( ~ leq(X4,n4)
| ~ leq(n0,X4)
| init = a_select3(center_init,X4,n0) )
& ! [X3] :
( ~ leq(X3,n4)
| ~ leq(n0,X3)
| init = a_select2(rho_init,X3) )
& ! [X1] :
( ~ leq(X1,n135299)
| ~ leq(n0,X1)
| ! [X2] :
( ~ leq(X2,n4)
| ~ leq(n0,X2)
| init = a_select3(q_init,X1,X2) ) )
& gt(loopcounter,n1)
& leq(sK31,n4)
& leq(n0,sK31)
& init != a_select2(sigmaold_init,sK31) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31]),skolemize(X0,sK31)],[f197]) ).
fof(f309,plain,
! [X7] :
( ~ gt(loopcounter,n1)
| ~ leq(X7,n4)
| ~ leq(n0,X7)
| init = a_select2(sigmaold_init,X7) ),
inference(cnf_transformation,[],[f198]) ).
fof(f315,plain,
gt(loopcounter,n1),
inference(cnf_transformation,[],[f198]) ).
fof(f316,plain,
leq(sK31,n4),
inference(cnf_transformation,[],[f198]) ).
fof(f317,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f198]) ).
fof(f318,plain,
init != a_select2(sigmaold_init,sK31),
inference(cnf_transformation,[],[f198]) ).
tcf(c_157,negated_conjecture,
a_select2(sigmaold_init,sK31) != init,
inference(cnf_transformation,[],[f318]) ).
tcf(c_158,negated_conjecture,
leq(n0,sK31),
inference(cnf_transformation,[],[f317]) ).
tcf(c_159,negated_conjecture,
leq(sK31,n4),
inference(cnf_transformation,[],[f316]) ).
tcf(c_160,negated_conjecture,
gt(loopcounter,n1),
inference(cnf_transformation,[],[f315]) ).
tcf(c_166,negated_conjecture,
! [X0: $i] :
( ( a_select2(sigmaold_init,X0) = init )
| ~ gt(loopcounter,n1)
| ~ leq(n0,X0)
| ~ leq(X0,n4) ),
inference(cnf_transformation,[],[f309]) ).
tcf(c_302,plain,
! [X0: $i] :
( ( a_select2(sigmaold_init,X0) = init )
| ~ leq(X0,n4)
| ~ leq(n0,X0) ),
inference(global_subsumption_just,[status(thm)],[c_166,c_160,c_166]) ).
tcf(c_303,negated_conjecture,
! [X0: $i] :
( ( a_select2(sigmaold_init,X0) = init )
| ~ leq(n0,X0)
| ~ leq(X0,n4) ),
inference(renaming,[status(thm)],[c_302]) ).
tcf(c_5928,definition,
iPr_def_10 = a_select2(sigmaold_init,sK31),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_5931,negated_conjecture,
! [X0: $i] :
( ( a_select2(sigmaold_init,X0) = init )
| ~ leq(n0,X0)
| ~ leq(X0,n4) ),
inference(demodulation,[status(thm)],[c_303]) ).
tcf(c_5936,negated_conjecture,
leq(sK31,n4),
inference(demodulation,[status(thm)],[c_159]) ).
tcf(c_5937,negated_conjecture,
leq(n0,sK31),
inference(demodulation,[status(thm)],[c_158]) ).
tcf(c_5938,negated_conjecture,
iPr_def_10 != init,
inference(demodulation,[status(thm)],[c_157,c_5928]) ).
tcf(c_8934,plain,
( ( a_select2(sigmaold_init,sK31) = init )
| ~ leq(sK31,n4) ),
inference(superposition,[status(thm)],[c_5937,c_5931]) ).
tcf(c_8935,plain,
( ( init = iPr_def_10 )
| ~ leq(sK31,n4) ),
inference(light_normalisation,[status(thm)],[c_8934,c_5928]) ).
tcf(c_8936,plain,
init = iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_8935,c_5936]) ).
tcf(c_8940,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_5938,c_8936]) ).
tcf(c_8941,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_8940]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV184+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/15.58 % CPULimit : 300
% 0.08/15.58 % WCLimit : 300
% 0.08/15.58 % DateTime : Thu Sep 24 18:42:48 UTC 2026
% 0.08/15.59 % CPUTime :
% 0.08/15.59 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.33/15.62 Running first-order theorem proving
% 0.33/15.62 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.33/15.64
% 0.33/15.64 % ======== iProver multi-core TPTP/SMT =========
% 0.33/15.64
% 0.33/15.64 % Detected problem language: tptp
% 0.33/15.65 % Proving...
% 1.86/16.40 % SZS status Started for theBenchmark.p
% 1.86/16.40 % SZS status Theorem for theBenchmark.p
% 1.86/16.40
% 1.86/16.40 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.86/16.40
% 1.86/16.40 % ------ iProver source info
% 1.86/16.40
% 1.86/16.40 % git: date: 2026-07-19 20:42:38 +0200
% 1.86/16.40 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.86/16.40 % git: non_committed_changes: false
% 1.86/16.40
% 1.86/16.40 % ------ Parsing...
% 1.86/16.40 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.86/16.40
% 1.86/16.40 % ------ Preprocessing... sup_sim: 15 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.86/16.40
% 1.86/16.40 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.86/16.40
% 1.86/16.40 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.86/16.40 % ------ Proving...
% 1.86/16.40 % ------ Problem Properties
% 1.86/16.40
% 1.86/16.40 %
% 1.86/16.40 % clauses 158
% 1.86/16.40 % conjectures 10
% 1.86/16.40 % EPR 47
% 1.86/16.40 % Horn 108
% 1.86/16.40 % unary 58
% 1.86/16.40 % binary 34
% 1.86/16.40 % lits 511
% 1.86/16.40 % lits eq 121
% 1.86/16.40 % fd_pure 0
% 1.86/16.40 % fd_pseudo 0
% 1.86/16.40 % fd_cond 6
% 1.86/16.40 % fd_pseudo_cond 4
% 1.86/16.40 % AC symbols 0
% 1.86/16.40
% 1.86/16.40 % ------ Schedule dynamic 5 is on
% 1.86/16.40
% 1.86/16.40 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.86/16.40
% 1.86/16.40
% 1.86/16.40 % ------
% 1.86/16.40 % Current options:
% 1.86/16.40 % ------
% 1.86/16.40
% 1.86/16.40
% 1.86/16.40 %
% 1.86/16.40
% 1.86/16.40 % ------ Proving...
% 1.86/16.40 %
% 1.86/16.40
% 1.86/16.40 % SZS status Theorem for theBenchmark.p
% 1.86/16.40
% 1.86/16.40 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.86/16.40
%------------------------------------------------------------------------------