%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV185+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 : 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:16:37 PM UTC 2026
% Result : Theorem 3.89s 1.27s
% Output : CNFRefutation 3.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 223 ( 61 equ)
% Maximal formula atoms : 33 ( 11 avg)
% Number of connectives : 305 ( 102 ~; 95 |; 80 &)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 15 con; 0-3 aty)
% Number of variables : 63 ( 0 sgn 60 !; 3 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(X8,n4)
& leq(n0,X8) )
=> a_select2(sigmaold_init,X8) = init ) )
& ( gt(loopcounter,n1)
=> ! [X7] :
( ( leq(X7,n4)
& leq(n0,X7) )
=> a_select2(rhoold_init,X7) = init ) )
& ( gt(loopcounter,n1)
=> ! [X6] :
( ( leq(X6,n4)
& leq(n0,X6) )
=> a_select2(muold_init,X6) = init ) )
& ! [X5] :
( ( leq(X5,n4)
& leq(n0,X5) )
=> a_select3(center_init,X5,n0) = init )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select2(sigma_init,X4) = init )
& ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> a_select2(mu_init,X3) = 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) )
=> ! [X9] :
( ( leq(X9,n4)
& leq(n0,X9) )
=> a_select2(rhoold_init,X9) = init ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0101) ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(X8,n4)
& leq(n0,X8) )
=> a_select2(sigmaold_init,X8) = init ) )
& ( gt(loopcounter,n1)
=> ! [X7] :
( ( leq(X7,n4)
& leq(n0,X7) )
=> a_select2(rhoold_init,X7) = init ) )
& ( gt(loopcounter,n1)
=> ! [X6] :
( ( leq(X6,n4)
& leq(n0,X6) )
=> a_select2(muold_init,X6) = init ) )
& ! [X5] :
( ( leq(X5,n4)
& leq(n0,X5) )
=> a_select3(center_init,X5,n0) = init )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select2(sigma_init,X4) = init )
& ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> a_select2(mu_init,X3) = 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) )
=> ! [X9] :
( ( leq(X9,n4)
& leq(n0,X9) )
=> a_select2(rhoold_init,X9) = init ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f94,plain,
( ( ~ gt(loopcounter,n1)
| ! [X8] :
( ~ leq(X8,n4)
| ~ leq(n0,X8)
| a_select2(sigmaold_init,X8) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [X7] :
( ~ leq(X7,n4)
| ~ leq(n0,X7)
| a_select2(rhoold_init,X7) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [X6] :
( ~ leq(X6,n4)
| ~ leq(n0,X6)
| a_select2(muold_init,X6) = init ) )
& ! [X5] :
( ~ leq(X5,n4)
| ~ leq(n0,X5)
| a_select3(center_init,X5,n0) = init )
& ! [X4] :
( ~ leq(X4,n4)
| ~ leq(n0,X4)
| a_select2(sigma_init,X4) = init )
& ! [X3] :
( ~ leq(X3,n4)
| ~ leq(n0,X3)
| a_select2(mu_init,X3) = 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)
& ? [X9] :
( leq(X9,n4)
& leq(n0,X9)
& init != a_select2(rhoold_init,X9) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f95,plain,
( ( ~ gt(loopcounter,n1)
| ! [X8] :
( ~ leq(X8,n4)
| ~ leq(n0,X8)
| a_select2(sigmaold_init,X8) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [X7] :
( ~ leq(X7,n4)
| ~ leq(n0,X7)
| a_select2(rhoold_init,X7) = init ) )
& ( ~ gt(loopcounter,n1)
| ! [X6] :
( ~ leq(X6,n4)
| ~ leq(n0,X6)
| a_select2(muold_init,X6) = init ) )
& ! [X5] :
( ~ leq(X5,n4)
| ~ leq(n0,X5)
| a_select3(center_init,X5,n0) = init )
& ! [X4] :
( ~ leq(X4,n4)
| ~ leq(n0,X4)
| a_select2(sigma_init,X4) = init )
& ! [X3] :
( ~ leq(X3,n4)
| ~ leq(n0,X3)
| a_select2(mu_init,X3) = 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)
& ? [X9] :
( leq(X9,n4)
& leq(n0,X9)
& init != a_select2(rhoold_init,X9) ) ),
inference(flattening,[],[f94]) ).
fof(f117,plain,
( ( ~ gt(loopcounter,n1)
| ! [X9] :
( ~ leq(X9,n4)
| ~ leq(n0,X9)
| init = a_select2(sigmaold_init,X9) ) )
& ( ~ gt(loopcounter,n1)
| ! [X8] :
( ~ leq(X8,n4)
| ~ leq(n0,X8)
| init = a_select2(rhoold_init,X8) ) )
& ( ~ gt(loopcounter,n1)
| ! [X7] :
( ~ leq(X7,n4)
| ~ leq(n0,X7)
| init = a_select2(muold_init,X7) ) )
& ! [X6] :
( ~ leq(X6,n4)
| ~ leq(n0,X6)
| init = a_select3(center_init,X6,n0) )
& ! [X5] :
( ~ leq(X5,n4)
| ~ leq(n0,X5)
| init = a_select2(sigma_init,X5) )
& ! [X4] :
( ~ leq(X4,n4)
| ~ leq(n0,X4)
| init = a_select2(mu_init,X4) )
& ! [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(rhoold_init,X0) ) ),
inference(rectify,[],[f95]) ).
fof(f118,plain,
( ( ~ gt(loopcounter,n1)
| ! [X9] :
( ~ leq(X9,n4)
| ~ leq(n0,X9)
| init = a_select2(sigmaold_init,X9) ) )
& ( ~ gt(loopcounter,n1)
| ! [X8] :
( ~ leq(X8,n4)
| ~ leq(n0,X8)
| init = a_select2(rhoold_init,X8) ) )
& ( ~ gt(loopcounter,n1)
| ! [X7] :
( ~ leq(X7,n4)
| ~ leq(n0,X7)
| init = a_select2(muold_init,X7) ) )
& ! [X6] :
( ~ leq(X6,n4)
| ~ leq(n0,X6)
| init = a_select3(center_init,X6,n0) )
& ! [X5] :
( ~ leq(X5,n4)
| ~ leq(n0,X5)
| init = a_select2(sigma_init,X5) )
& ! [X4] :
( ~ leq(X4,n4)
| ~ leq(n0,X4)
| init = a_select2(mu_init,X4) )
& ! [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(sK0,n4)
& leq(n0,sK0)
& init != a_select2(rhoold_init,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f117]) ).
fof(f122,plain,
! [X8] :
( ~ gt(loopcounter,n1)
| ~ leq(X8,n4)
| ~ leq(n0,X8)
| init = a_select2(rhoold_init,X8) ),
inference(cnf_transformation,[],[f118]) ).
fof(f129,plain,
gt(loopcounter,n1),
inference(cnf_transformation,[],[f118]) ).
fof(f130,plain,
leq(sK0,n4),
inference(cnf_transformation,[],[f118]) ).
fof(f131,plain,
leq(n0,sK0),
inference(cnf_transformation,[],[f118]) ).
fof(f132,plain,
init != a_select2(rhoold_init,sK0),
inference(cnf_transformation,[],[f118]) ).
tcf(c_49,negated_conjecture,
a_select2(rhoold_init,sK0) != init,
inference(cnf_transformation,[],[f132]) ).
tcf(c_50,negated_conjecture,
leq(n0,sK0),
inference(cnf_transformation,[],[f131]) ).
tcf(c_51,negated_conjecture,
leq(sK0,n4),
inference(cnf_transformation,[],[f130]) ).
tcf(c_52,negated_conjecture,
gt(loopcounter,n1),
inference(cnf_transformation,[],[f129]) ).
tcf(c_59,negated_conjecture,
! [X0: $i] :
( ( a_select2(rhoold_init,X0) = init )
| ~ gt(loopcounter,n1)
| ~ leq(n0,X0)
| ~ leq(X0,n4) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_157,plain,
! [X0: $i] :
( ( a_select2(rhoold_init,X0) = init )
| ~ leq(X0,n4)
| ~ leq(n0,X0) ),
inference(global_subsumption_just,[status(thm)],[c_59,c_52,c_59]) ).
tcf(c_158,negated_conjecture,
! [X0: $i] :
( ( a_select2(rhoold_init,X0) = init )
| ~ leq(n0,X0)
| ~ leq(X0,n4) ),
inference(renaming,[status(thm)],[c_157]) ).
tcf(c_1686,plain,
( ( a_select2(rhoold_init,sK0) = init )
| ~ leq(sK0,n4) ),
inference(superposition,[status(thm)],[c_50,c_158]) ).
tcf(c_1690,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1686,c_49,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV185+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.09/0.36 % Computer : n016.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 18:47:12 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 3.89/1.27 % SZS status Started for theBenchmark.p
% 3.89/1.27 % SZS status Theorem for theBenchmark.p
% 3.89/1.27
% 3.89/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.89/1.27
% 3.89/1.27 % ------ iProver source info
% 3.89/1.27
% 3.89/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.89/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.89/1.27 % git: non_committed_changes: false
% 3.89/1.27
% 3.89/1.27 % ------ Parsing...
% 3.89/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.89/1.27
% 3.89/1.27 % ------ Preprocessing... sup_sim: 10 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.89/1.27
% 3.89/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.89/1.27
% 3.89/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.89/1.27 % ------ Proving...
% 3.89/1.27 % ------ Problem Properties
% 3.89/1.27
% 3.89/1.27 %
% 3.89/1.27 % clauses 75
% 3.89/1.27 % conjectures 12
% 3.89/1.27 % EPR 44
% 3.89/1.27 % Horn 68
% 3.89/1.27 % unary 50
% 3.89/1.27 % binary 7
% 3.89/1.27 % lits 135
% 3.89/1.27 % lits eq 47
% 3.89/1.27 % fd_pure 0
% 3.89/1.27 % fd_pseudo 0
% 3.89/1.27 % fd_cond 6
% 3.89/1.27 % fd_pseudo_cond 2
% 3.89/1.27 % AC symbols 0
% 3.89/1.27
% 3.89/1.27 % ------ Schedule dynamic 5 is on
% 3.89/1.27
% 3.89/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.89/1.27
% 3.89/1.27
% 3.89/1.27 % ------
% 3.89/1.27 % Current options:
% 3.89/1.27 % ------
% 3.89/1.27
% 3.89/1.27
% 3.89/1.27 %
% 3.89/1.27
% 3.89/1.27 % ------ Proving...
% 3.89/1.27 %
% 3.89/1.27
% 3.89/1.27 % SZS status Theorem for theBenchmark.p
% 3.89/1.27
% 3.89/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.89/1.27
% 3.89/1.27
%------------------------------------------------------------------------------