%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : DAT077_1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n026.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 01:13:58 PM UTC 2026
% Result : Theorem 1.58s 1.27s
% Output : CNFRefutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 67 ( 4 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 67 ( 26 ~; 14 |; 21 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 100 ( 43 atm; 0 fun; 19 num; 38 var)
% Number of types : 2 ( 0 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 12 ( 11 usr; 1 con; 0-3 aty)
% Number of variables : 53 ( 0 sgn 46 !; 7 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
read: ( $int * array ) > $int ).
tff(func_def_1,type,
write: ( $int * ( $int * array ) ) > array ).
tff(func_def_2,type,
init: $int > array ).
tff(func_def_3,type,
max: ( $int * array ) > $int ).
tff(pred_def_4,type,
sorted: ( $int * array ) > $o ).
tff(func_def_5,type,
rev: ( $int * array ) > array ).
tff(pred_def_6,type,
inRange: ( $int * ( $int * array ) ) > $o ).
tff(pred_def_7,type,
distinct: ( $int * array ) > $o ).
tff(func_def_10,type,
sK0: ( array * array ) > $int ).
tff(func_def_11,type,
sK1: ( $int * ( $int * array ) ) > $int ).
tff(func_def_12,type,
sK2: ( $int * array ) > $int ).
tff(func_def_13,type,
sK3: ( $int * array ) > $int ).
tff(func_def_14,type,
sK4: ( $int * ( array * array ) ) > $int ).
tff(func_def_15,type,
sK5: $int > $int ).
tff(f6,axiom,
! [X0: array,X1: $int] :
( sorted(X0,X1)
<=> ! [X2: $int,X3: $int] :
( ( $less(X3,X1)
& $less(X2,X3)
& $less(X2,X1)
& $lesseq(0,X2) )
=> $lesseq(read(X0,X2),read(X0,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sorted1) ).
tff(f10,conjecture,
~ ! [X0: $int] :
? [X1: $int] : ~ sorted(rev(init(X1),X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c5) ).
tff(f11,negated_conjecture,
~ ~ ! [X0: $int] :
? [X1: $int] : ~ sorted(rev(init(X1),X0),X0),
inference(negated_conjecture,[status(cth)],[f10]) ).
tff(f13,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
<=> ! [X2: $int,X3: $int] :
( ( $less(X3,X1)
& $less(X2,X3)
& $less(X2,X1)
& ~ $less(X2,0) )
=> ~ $less(read(X0,X3),read(X0,X2)) ) ),
inference(theory_normalization,[],[f6]) ).
tff(f30,plain,
! [X0: $int] :
? [X1: $int] : ~ sorted(rev(init(X1),X0),X0),
inference(flattening,[],[f11]) ).
tff(f31,plain,
! [X0: array,X1: $int] :
( ! [X2: $int,X3: $int] :
( ( $less(X3,X1)
& $less(X2,X3)
& $less(X2,X1)
& ~ $less(X2,0) )
=> ~ $less(read(X0,X3),read(X0,X2)) )
=> sorted(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
tff(f35,plain,
! [X0: array,X1: $int] :
( ? [X2: $int,X3: $int] :
( $less(X3,X1)
& $less(X2,X3)
& $less(X2,X1)
& ~ $less(X2,0)
& $less(read(X0,X3),read(X0,X2)) )
| sorted(X0,X1) ),
inference(ennf_transformation,[],[f31]) ).
tff(f36,plain,
! [X0: array,X1: $int] :
( ? [X2: $int,X3: $int] :
( $less(X3,X1)
& $less(X2,X3)
& $less(X2,X1)
& ~ $less(X2,0)
& $less(read(X0,X3),read(X0,X2)) )
| sorted(X0,X1) ),
inference(flattening,[],[f35]) ).
tff(f40,plain,
! [X0: array,X1: $int] :
( ( $less(sK3(X0,X1),X1)
& $less(sK2(X0,X1),sK3(X0,X1))
& $less(sK2(X0,X1),X1)
& ~ $less(sK2(X0,X1),0)
& $less(read(X0,sK3(X0,X1)),read(X0,sK2(X0,X1))) )
| sorted(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X2,sK2(X0,X1)),skolemize(X3,sK3(X0,X1))],[f36]) ).
tff(f42,plain,
! [X0: $int] : ~ sorted(rev(init(sK5(X0)),X0),X0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X1,sK5(X0))],[f30]) ).
tff(f52,plain,
! [X0: array,X1: $int] :
( $less(sK2(X0,X1),X1)
| sorted(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
tff(f53,plain,
! [X0: array,X1: $int] :
( ~ $less(sK2(X0,X1),0)
| sorted(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
tff(f58,plain,
! [X0: $int] : ~ sorted(rev(init(sK5(X0)),X0),X0),
inference(cnf_transformation,[],[f42]) ).
tcf(c_69,plain,
! [X0_int: $int,X0_array: array] :
( sorted(X0_array,X0_int)
| ~ $less(sK2(X0_array,X0_int),0) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_70,negated_conjecture,
! [X0_int: $int,X0_array: array] :
( sorted(X0_array,X0_int)
| $less(sK2(X0_array,X0_int),X0_int) ),
inference(cnf_transformation,[],[f52]) ).
tcf(c_76,negated_conjecture,
! [X0_int: $int] : ~ sorted(rev(init(sK5(X0_int)),X0_int),X0_int),
inference(cnf_transformation,[],[f58]) ).
tcf(c_108,plain,
! [X0_int: $int,X0_array: array] :
( sorted(X0_array,X0_int)
| ~ $less(sK2(X0_array,X0_int),0) ),
inference(prop_impl_just,[status(thm)],[c_69]) ).
tcf(c_116,plain,
! [X0_int: $int,X0_array: array] :
( $less(sK2(X0_array,X0_int),X0_int)
| sorted(X0_array,X0_int) ),
inference(prop_impl_just,[status(thm)],[c_70]) ).
tcf(c_117,plain,
! [X0_int: $int,X0_array: array] :
( sorted(X0_array,X0_int)
| $less(sK2(X0_array,X0_int),X0_int) ),
inference(renaming,[status(thm)],[c_116]) ).
tcf(c_372,plain,
! [X0_int: $int,X0_array: array,X1_int: $int] :
( $less(sK2(X0_array,X0_int),X0_int)
| ( X0_int != X1_int )
| ( rev(init(sK5(X1_int)),X1_int) != X0_array ) ),
inference(resolution_lifted,[status(thm)],[c_117,c_76]) ).
tcf(c_373,plain,
! [X0_int: $int] : $less(sK2(rev(init(sK5(X0_int)),X0_int),X0_int),X0_int),
inference(unflattening,[status(thm)],[c_372]) ).
tcf(c_374,plain,
$less(sK2(rev(init(sK5(0)),0),0),0),
inference(instantiation,[status(thm)],[c_373]) ).
tcf(c_378,plain,
! [X0_int: $int,X0_array: array,X1_int: $int] :
( ~ $less(sK2(X0_array,X0_int),0)
| ( X0_int != X1_int )
| ( rev(init(sK5(X1_int)),X1_int) != X0_array ) ),
inference(resolution_lifted,[status(thm)],[c_108,c_76]) ).
tcf(c_379,plain,
! [X0_int: $int] : ~ $less(sK2(rev(init(sK5(X0_int)),X0_int),X0_int),0),
inference(unflattening,[status(thm)],[c_378]) ).
tcf(c_380,plain,
~ $less(sK2(rev(init(sK5(0)),0),0),0),
inference(instantiation,[status(thm)],[c_379]) ).
tcf(c_381,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_380,c_374]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT077_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n026.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 10:26:09 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.39 Running TFA theorem proving
% 0.09/0.39 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40
% 0.14/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.40
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 1.58/1.27 % SZS status Started for theBenchmark.p
% 1.58/1.27 ERROR - "ProverProcess:heur/schedule_none:304.9999785423279" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.58/1.27 Fatal error: exception Failure("undefined enum value")
% 1.58/1.27 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --schedule none --sub_typing false --suppress_sat_res true --tptp_safe_out true --stats_out none --out_options none --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 101.67 --show_fool true" --time_out_real 305.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_t4eavttz/wwwx27t1 2>> /export/starexec/sandbox/tmp/iprover_out_t4eavttz/wwwx27t1_error
% 1.58/1.27 % SZS status Theorem for theBenchmark.p
% 1.58/1.27
% 1.58/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.58/1.27
% 1.58/1.27 % ------ iProver source info
% 1.58/1.27
% 1.58/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.58/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.58/1.27 % git: non_committed_changes: false
% 1.58/1.27
% 1.58/1.27 % ------ Parsing...
% 1.58/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.58/1.27
% 1.58/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s %
% 1.58/1.27
% 1.58/1.27 % SZS status Theorem for theBenchmark.p
% 1.58/1.27
% 1.58/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.58/1.27
% 1.58/1.27
%------------------------------------------------------------------------------