%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV174+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 : 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:36 PM UTC 2026
% Result : Theorem 4.18s 1.30s
% Output : CNFRefutation 4.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 27 ( 11 unt; 0 def)
% Number of atoms : 141 ( 26 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 167 ( 53 ~; 46 |; 55 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-3 aty)
% Number of variables : 44 ( 0 sgn 38 !; 6 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(f53,conjecture,
( ( ! [X2] :
( ( leq(X2,n4)
& leq(n0,X2) )
=> a_select3(center_init,X2,n0) = init )
& ! [X0] :
( ( leq(X0,pred(pv10))
& leq(n0,X0) )
=> ! [X1] :
( ( leq(X1,n4)
& leq(n0,X1) )
=> a_select3(q_init,X0,X1) = init ) )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X3,X4] :
( ( leq(X4,n4)
& leq(X3,n135299)
& leq(n0,X4)
& leq(n0,X3) )
=> ( gt(pv10,X3)
=> a_select3(q_init,X3,X4) = init ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0046) ).
fof(f54,negated_conjecture,
~ ( ( ! [X2] :
( ( leq(X2,n4)
& leq(n0,X2) )
=> a_select3(center_init,X2,n0) = init )
& ! [X0] :
( ( leq(X0,pred(pv10))
& leq(n0,X0) )
=> ! [X1] :
( ( leq(X1,n4)
& leq(n0,X1) )
=> a_select3(q_init,X0,X1) = init ) )
& leq(pv10,n135299)
& leq(n0,pv10) )
=> ! [X3,X4] :
( ( leq(X4,n4)
& leq(X3,n135299)
& leq(n0,X4)
& leq(n0,X3) )
=> ( gt(pv10,X3)
=> a_select3(q_init,X3,X4) = init ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f94,plain,
( ! [X2] :
( ~ leq(X2,n4)
| ~ leq(n0,X2)
| a_select3(center_init,X2,n0) = init )
& ! [X0] :
( ~ leq(X0,pred(pv10))
| ~ leq(n0,X0)
| ! [X1] :
( ~ leq(X1,n4)
| ~ leq(n0,X1)
| a_select3(q_init,X0,X1) = init ) )
& leq(pv10,n135299)
& leq(n0,pv10)
& ? [X3,X4] :
( leq(X4,n4)
& leq(X3,n135299)
& leq(n0,X4)
& leq(n0,X3)
& gt(pv10,X3)
& init != a_select3(q_init,X3,X4) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f95,plain,
( ! [X2] :
( ~ leq(X2,n4)
| ~ leq(n0,X2)
| a_select3(center_init,X2,n0) = init )
& ! [X0] :
( ~ leq(X0,pred(pv10))
| ~ leq(n0,X0)
| ! [X1] :
( ~ leq(X1,n4)
| ~ leq(n0,X1)
| a_select3(q_init,X0,X1) = init ) )
& leq(pv10,n135299)
& leq(n0,pv10)
& ? [X3,X4] :
( leq(X4,n4)
& leq(X3,n135299)
& leq(n0,X4)
& leq(n0,X3)
& gt(pv10,X3)
& init != a_select3(q_init,X3,X4) ) ),
inference(flattening,[],[f94]) ).
fof(f117,plain,
( ! [X4] :
( ~ leq(X4,n4)
| ~ leq(n0,X4)
| init = a_select3(center_init,X4,n0) )
& ! [X2] :
( ~ leq(X2,pred(pv10))
| ~ leq(n0,X2)
| ! [X3] :
( ~ leq(X3,n4)
| ~ leq(n0,X3)
| init = a_select3(q_init,X2,X3) ) )
& leq(pv10,n135299)
& leq(n0,pv10)
& ? [X0,X1] :
( leq(X1,n4)
& leq(X0,n135299)
& leq(n0,X1)
& leq(n0,X0)
& gt(pv10,X0)
& a_select3(q_init,X0,X1) != init ) ),
inference(rectify,[],[f95]) ).
fof(f118,plain,
( ! [X4] :
( ~ leq(X4,n4)
| ~ leq(n0,X4)
| init = a_select3(center_init,X4,n0) )
& ! [X2] :
( ~ leq(X2,pred(pv10))
| ~ leq(n0,X2)
| ! [X3] :
( ~ leq(X3,n4)
| ~ leq(n0,X3)
| init = a_select3(q_init,X2,X3) ) )
& leq(pv10,n135299)
& leq(n0,pv10)
& leq(sK1,n4)
& leq(sK0,n135299)
& leq(n0,sK1)
& leq(n0,sK0)
& gt(pv10,sK0)
& init != a_select3(q_init,sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f117]) ).
fof(f119,plain,
! [X0,X1] :
( ( ~ leq(X0,pred(X1))
| gt(X1,X0) )
& ( ~ gt(X1,X0)
| leq(X0,pred(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f123,plain,
! [X2,X3] :
( ~ leq(X2,pred(pv10))
| ~ leq(n0,X2)
| ~ leq(X3,n4)
| ~ leq(n0,X3)
| init = a_select3(q_init,X2,X3) ),
inference(cnf_transformation,[],[f118]) ).
fof(f126,plain,
leq(sK1,n4),
inference(cnf_transformation,[],[f118]) ).
fof(f128,plain,
leq(n0,sK1),
inference(cnf_transformation,[],[f118]) ).
fof(f129,plain,
leq(n0,sK0),
inference(cnf_transformation,[],[f118]) ).
fof(f130,plain,
gt(pv10,sK0),
inference(cnf_transformation,[],[f118]) ).
fof(f131,plain,
init != a_select3(q_init,sK0,sK1),
inference(cnf_transformation,[],[f118]) ).
fof(f138,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,pred(X1)) ),
inference(cnf_transformation,[],[f119]) ).
tcf(c_49,negated_conjecture,
a_select3(q_init,sK0,sK1) != init,
inference(cnf_transformation,[],[f131]) ).
tcf(c_50,negated_conjecture,
gt(pv10,sK0),
inference(cnf_transformation,[],[f130]) ).
tcf(c_51,negated_conjecture,
leq(n0,sK0),
inference(cnf_transformation,[],[f129]) ).
tcf(c_52,negated_conjecture,
leq(n0,sK1),
inference(cnf_transformation,[],[f128]) ).
tcf(c_54,negated_conjecture,
leq(sK1,n4),
inference(cnf_transformation,[],[f126]) ).
tcf(c_57,negated_conjecture,
! [X0: $i,X1: $i] :
( ( a_select3(q_init,X0,X1) = init )
| ~ leq(n0,X1)
| ~ leq(n0,X0)
| ~ leq(X1,n4)
| ~ leq(X0,pred(pv10)) ),
inference(cnf_transformation,[],[f123]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( leq(X1,pred(X0))
| ~ gt(X0,X1) ),
inference(cnf_transformation,[],[f138]) ).
tcf(c_1711,plain,
! [X0: $i,X1: $i] :
( ( a_select3(q_init,X0,X1) = init )
| ~ leq(n0,X1)
| ~ leq(n0,X0)
| ~ leq(X1,n4)
| ~ gt(pv10,X0) ),
inference(superposition,[status(thm)],[c_64,c_57]) ).
tcf(c_1784,plain,
! [X0: $i] :
( ( a_select3(q_init,X0,sK1) = init )
| ~ leq(sK1,n4)
| ~ leq(n0,X0)
| ~ gt(pv10,X0) ),
inference(superposition,[status(thm)],[c_52,c_1711]) ).
tcf(c_1796,plain,
! [X0: $i] :
( ( a_select3(q_init,X0,sK1) = init )
| ~ leq(n0,X0)
| ~ gt(pv10,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1784,c_54]) ).
tcf(c_1820,plain,
( ( a_select3(q_init,sK0,sK1) = init )
| ~ gt(pv10,sK0) ),
inference(superposition,[status(thm)],[c_51,c_1796]) ).
tcf(c_1829,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1820,c_49,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV174+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/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:45:43 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.41 % Detected problem language: tptp
% 0.09/0.42 % Proving...
% 4.18/1.30 % SZS status Started for theBenchmark.p
% 4.18/1.30 % SZS status Theorem for theBenchmark.p
% 4.18/1.30
% 4.18/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.18/1.30
% 4.18/1.30 % ------ iProver source info
% 4.18/1.30
% 4.18/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.18/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.18/1.30 % git: non_committed_changes: false
% 4.18/1.30
% 4.18/1.30 % ------ Parsing...
% 4.18/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.18/1.30
% 4.18/1.30 % ------ Preprocessing... sup_sim: 10 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.18/1.30
% 4.18/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.18/1.30
% 4.18/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.18/1.30 % ------ Proving...
% 4.18/1.30 % ------ Problem Properties
% 4.18/1.30
% 4.18/1.30 %
% 4.18/1.30 % clauses 77
% 4.18/1.30 % conjectures 10
% 4.18/1.30 % EPR 48
% 4.18/1.30 % Horn 70
% 4.18/1.30 % unary 56
% 4.18/1.30 % binary 9
% 4.18/1.30 % lits 127
% 4.18/1.30 % lits eq 43
% 4.18/1.30 % fd_pure 0
% 4.18/1.30 % fd_pseudo 0
% 4.18/1.30 % fd_cond 6
% 4.18/1.30 % fd_pseudo_cond 2
% 4.18/1.30 % AC symbols 0
% 4.18/1.30
% 4.18/1.30 % ------ Schedule dynamic 5 is on
% 4.18/1.30
% 4.18/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.18/1.30
% 4.18/1.30
% 4.18/1.30 % ------
% 4.18/1.30 % Current options:
% 4.18/1.30 % ------
% 4.18/1.30
% 4.18/1.30
% 4.18/1.30 %
% 4.18/1.30
% 4.18/1.30 % ------ Proving...
% 4.18/1.30 %
% 4.18/1.30
% 4.18/1.30 % SZS status Theorem for theBenchmark.p
% 4.18/1.30
% 4.18/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.18/1.30
% 4.18/1.30
%------------------------------------------------------------------------------