%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n003.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:14 PM UTC 2026
% Result : Unsatisfiable 0.40s 1.27s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 17 unt; 2 def)
% Number of atoms : 145 ( 6 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 105 ( 43 ~; 62 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( in_array_bounds(array,X0)
| less_than(upper_bound,X0)
| less_than(X0,lower_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_bounds) ).
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| ~ less_than(successor(X0),successor(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',predecessor_less) ).
fof(f3,axiom,
! [X2,X0,X1] :
( less_than(X0,X2)
| ~ less_than(X1,X2)
| ~ less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less) ).
fof(f4,axiom,
! [X0] : less_than(X0,successor(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_greater) ).
fof(f5,axiom,
( maximal_value = array_value_at(array,index_of_maximal)
| ~ in_array_bounds(array,index_of_maximal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',this_is_maximal) ).
fof(f6,axiom,
less_than(index_of_maximal,an_index),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_before_somewhere) ).
fof(f7,axiom,
~ less_than(an_index,lower_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_above_lower_bound) ).
fof(f8,axiom,
~ less_than(upper_bound,an_index),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_below_upper_bound) ).
fof(f9,axiom,
~ less_than(index_of_maximal,lower_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_above_lower_bound) ).
fof(f10,negated_conjecture,
( maximal_value != array_value_at(array,index_of_maximal)
| ~ in_array_bounds(array,index_of_maximal)
| ~ less_than(index_of_maximal,successor(an_index))
| less_than(index_of_maximal,lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(successor(an_index),lower_bound)
| ~ in_array_bounds(array,an_index) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tcf(c_59,plain,
! [X0: $i] :
( in_array_bounds(array,X0)
| less_than(upper_bound,X0)
| less_than(X0,lower_bound) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( less_than(X0,X1)
| ~ less_than(successor(X0),successor(X1)) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_than(X2,X1)
| ~ less_than(X2,X0)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_62,plain,
! [X0: $i] : less_than(X0,successor(X0)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_63,plain,
( ( array_value_at(array,index_of_maximal) = maximal_value )
| ~ in_array_bounds(array,index_of_maximal) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_64,plain,
less_than(index_of_maximal,an_index),
inference(cnf_transformation,[],[f6]) ).
tcf(c_65,plain,
~ less_than(an_index,lower_bound),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,plain,
~ less_than(upper_bound,an_index),
inference(cnf_transformation,[],[f8]) ).
tcf(c_67,plain,
~ less_than(index_of_maximal,lower_bound),
inference(cnf_transformation,[],[f9]) ).
tcf(c_68,negated_conjecture,
( less_than(index_of_maximal,lower_bound)
| less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| ~ in_array_bounds(array,an_index)
| ~ in_array_bounds(array,index_of_maximal)
| ~ less_than(index_of_maximal,successor(an_index))
| ( array_value_at(array,index_of_maximal) != maximal_value ) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_72,plain,
( ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| ~ in_array_bounds(array,an_index)
| less_than(successor(upper_bound),successor(an_index))
| less_than(successor(an_index),lower_bound) ),
inference(global_subsumption_just,[status(thm)],[c_68,c_67,c_63,c_68]) ).
tcf(c_73,negated_conjecture,
( less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| ~ in_array_bounds(array,an_index)
| ~ in_array_bounds(array,index_of_maximal)
| ~ less_than(index_of_maximal,successor(an_index)) ),
inference(renaming,[status(thm)],[c_72]) ).
tcf(c_149,definition,
iPr_def_10 = successor(an_index),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_150,definition,
iPr_def_11 = successor(upper_bound),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_151,negated_conjecture,
( less_than(iPr_def_11,iPr_def_10)
| less_than(iPr_def_10,lower_bound)
| ~ in_array_bounds(array,an_index)
| ~ in_array_bounds(array,index_of_maximal)
| ~ less_than(index_of_maximal,iPr_def_10) ),
inference(demodulation,[status(thm)],[c_73,c_150,c_149]) ).
tcf(c_326,plain,
less_than(an_index,iPr_def_10),
inference(superposition,[status(thm)],[c_149,c_62]) ).
tcf(c_347,plain,
! [X0: $i] :
( less_than(upper_bound,X0)
| ~ less_than(iPr_def_11,successor(X0)) ),
inference(superposition,[status(thm)],[c_150,c_60]) ).
tcf(c_376,plain,
! [X0: $i] :
( less_than(X0,an_index)
| ~ less_than(X0,index_of_maximal) ),
inference(superposition,[status(thm)],[c_64,c_61]) ).
tcf(c_377,plain,
! [X0: $i] :
( less_than(X0,iPr_def_10)
| ~ less_than(X0,an_index) ),
inference(superposition,[status(thm)],[c_326,c_61]) ).
tcf(c_384,plain,
( less_than(index_of_maximal,iPr_def_10)
| ~ less_than(index_of_maximal,an_index) ),
inference(instantiation,[status(thm)],[c_377]) ).
tcf(c_397,plain,
less_than(index_of_maximal,iPr_def_10),
inference(superposition,[status(thm)],[c_64,c_377]) ).
tcf(c_398,plain,
( less_than(iPr_def_11,iPr_def_10)
| less_than(iPr_def_10,lower_bound)
| ~ in_array_bounds(array,an_index)
| ~ in_array_bounds(array,index_of_maximal) ),
inference(backward_subsumption_resolution,[status(thm)],[c_151,c_397]) ).
tcf(c_414,plain,
( less_than(iPr_def_11,iPr_def_10)
| less_than(iPr_def_10,lower_bound)
| less_than(index_of_maximal,lower_bound)
| less_than(upper_bound,index_of_maximal)
| ~ in_array_bounds(array,an_index) ),
inference(superposition,[status(thm)],[c_59,c_398]) ).
tcf(c_415,plain,
( less_than(iPr_def_11,iPr_def_10)
| less_than(iPr_def_10,lower_bound)
| less_than(upper_bound,index_of_maximal)
| ~ in_array_bounds(array,an_index) ),
inference(forward_subsumption_resolution,[status(thm)],[c_414,c_67]) ).
tcf(c_430,plain,
( less_than(iPr_def_11,iPr_def_10)
| less_than(iPr_def_10,lower_bound)
| less_than(an_index,lower_bound)
| less_than(upper_bound,an_index)
| less_than(upper_bound,index_of_maximal) ),
inference(superposition,[status(thm)],[c_59,c_415]) ).
tcf(c_431,plain,
( less_than(iPr_def_11,iPr_def_10)
| less_than(iPr_def_10,lower_bound)
| less_than(upper_bound,index_of_maximal) ),
inference(forward_subsumption_resolution,[status(thm)],[c_430,c_65,c_66]) ).
tcf(c_445,plain,
( less_than(iPr_def_11,iPr_def_10)
| less_than(iPr_def_10,lower_bound)
| less_than(upper_bound,an_index) ),
inference(superposition,[status(thm)],[c_431,c_376]) ).
tcf(c_446,plain,
( less_than(iPr_def_11,iPr_def_10)
| less_than(iPr_def_10,lower_bound) ),
inference(forward_subsumption_resolution,[status(thm)],[c_445,c_66]) ).
tcf(c_515,plain,
( less_than(upper_bound,an_index)
| ~ less_than(iPr_def_11,iPr_def_10) ),
inference(superposition,[status(thm)],[c_149,c_347]) ).
tcf(c_519,plain,
~ less_than(iPr_def_11,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_515,c_66]) ).
tcf(c_520,plain,
less_than(iPr_def_10,lower_bound),
inference(backward_subsumption_resolution,[status(thm)],[c_446,c_519]) ).
tcf(c_521,plain,
! [X0: $i] :
( less_than(X0,lower_bound)
| ~ less_than(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_520,c_61]) ).
tcf(c_524,plain,
( less_than(index_of_maximal,lower_bound)
| ~ less_than(index_of_maximal,iPr_def_10) ),
inference(instantiation,[status(thm)],[c_521]) ).
tcf(c_525,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_524,c_384,c_67,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.35 % Computer : n003.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.36 % CPULimit : 300
% 0.07/0.36 % WCLimit : 300
% 0.07/0.36 % DateTime : Thu Sep 24 18:19:21 UTC 2026
% 0.07/0.36 % CPUTime :
% 0.07/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...
% 0.40/1.27 % SZS status Started for theBenchmark.p
% 0.40/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 0.40/1.27
% 0.40/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.40/1.27
% 0.40/1.27 % ------ iProver source info
% 0.40/1.27
% 0.40/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 0.40/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.40/1.27 % git: non_committed_changes: false
% 0.40/1.27
% 0.40/1.27 % ------ Parsing...% successful
% 0.40/1.27
% 0.40/1.27
% 0.40/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.40/1.27
% 0.40/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.40/1.27
% 0.40/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.40/1.27
% 0.40/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.40/1.27 % ------ Proving...
% 0.40/1.27 % ------ Problem Properties
% 0.40/1.27
% 0.40/1.27 %
% 0.40/1.27 % clauses 12
% 0.40/1.27 % conjectures 1
% 0.40/1.27 % EPR 7
% 0.40/1.27 % Horn 10
% 0.40/1.27 % unary 7
% 0.40/1.27 % binary 2
% 0.40/1.27 % lits 22
% 0.40/1.27 % lits eq 3
% 0.40/1.27 % fd_pure 0
% 0.40/1.27 % fd_pseudo 0
% 0.40/1.27 % fd_cond 0
% 0.40/1.27 % fd_pseudo_cond 0
% 0.40/1.27 % AC symbols 0
% 0.40/1.27
% 0.40/1.27 % ------ Schedule dynamic 5 is on
% 0.40/1.27
% 0.40/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.40/1.27
% 0.40/1.27
% 0.40/1.27 % ------
% 0.40/1.27 % Current options:
% 0.40/1.27 % ------
% 0.40/1.27
% 0.40/1.27
% 0.40/1.27 %
% 0.40/1.27
% 0.40/1.27 % ------ Proving...
% 0.40/1.27 %
% 0.40/1.27
% 0.40/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 0.40/1.27
% 0.40/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.40/1.27
% 0.40/1.27
%------------------------------------------------------------------------------