%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : DAT076_1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n013.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 2.16s 1.30s
% Output : CNFRefutation 2.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 62 ( 22 ~; 10 |; 21 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 70 ( 34 atm; 0 fun; 10 num; 26 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 : 7 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 11 ( 10 usr; 1 con; 0-3 aty)
% Number of variables : 44 ( 0 sgn 40 !; 4 ?; 44 :)
% 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(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/sandbox2/benchmark/theBenchmark.p',sorted1) ).
tff(f10,conjecture,
~ ! [X0: array,X1: $int] :
( sorted(X0,X1)
=> ~ sorted(rev(X0,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c4) ).
tff(f11,negated_conjecture,
~ ~ ! [X0: array,X1: $int] :
( sorted(X0,X1)
=> ~ sorted(rev(X0,X1),X1) ),
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: array,X1: $int] :
( sorted(X0,X1)
=> ~ sorted(rev(X0,X1),X1) ),
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(f38,plain,
! [X0: array,X1: $int] :
( ~ sorted(X0,X1)
| ~ sorted(rev(X0,X1),X1) ),
inference(ennf_transformation,[],[f30]) ).
tff(f41,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(f52,plain,
! [X0: array,X1: $int] :
( $less(sK2(X0,X1),X1)
| sorted(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
tff(f53,plain,
! [X0: array,X1: $int] :
( ~ $less(sK2(X0,X1),0)
| sorted(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
tff(f58,plain,
! [X0: array,X1: $int] :
( ~ sorted(X0,X1)
| ~ sorted(rev(X0,X1),X1) ),
inference(cnf_transformation,[],[f38]) ).
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,plain,
! [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,X0_array: array] :
( ~ sorted(X0_array,X0_int)
| ~ sorted(rev(X0_array,X0_int),X0_int) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_184,plain,
! [X0_array: array] : sorted(X0_array,0),
inference(resolution,[status(thm)],[c_69,c_70]) ).
tcf(c_196,plain,
! [X0_array: array] : ~ sorted(X0_array,0),
inference(resolution,[status(thm)],[c_76,c_184]) ).
tcf(c_197,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_196,c_184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT076_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.38 % Computer : n013.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Fri Sep 25 10:23:06 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.42 Running TFA theorem proving
% 0.13/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.43
% 0.13/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43
% 0.13/0.43 % Detected problem language: tptp
% 0.13/0.44 % Proving...
% 2.16/1.30 % SZS status Started for theBenchmark.p
% 2.16/1.30 ERROR - "ProverProcess:heur/schedule_none:304.9999761581421" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 2.16/1.30 Fatal error: exception Failure("undefined enum value")
% 2.16/1.30 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/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_se51fv09/oivhl9o1 2>> /export/starexec/sandbox2/tmp/iprover_out_se51fv09/oivhl9o1_error
% 2.16/1.30 % SZS status Theorem for theBenchmark.p
% 2.16/1.30
% 2.16/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.16/1.30
% 2.16/1.30 % ------ iProver source info
% 2.16/1.30
% 2.16/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.16/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.16/1.30 % git: non_committed_changes: false
% 2.16/1.30
% 2.16/1.30 % ------ Parsing...
% 2.16/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.16/1.30 % ------ Proving...
% 2.16/1.30 % ------ Problem Properties
% 2.16/1.30
% 2.16/1.30 %
% 2.16/1.30 % clauses 29
% 2.16/1.30 % conjectures 3
% 2.16/1.30 % EPR 4
% 2.16/1.30 % Horn 17
% 2.16/1.30 % unary 10
% 2.16/1.30 % binary 11
% 2.16/1.30 % lits 60
% 2.16/1.30 % lits eq 22
% 2.16/1.30 % fd_pure 0
% 2.16/1.30 % fd_pseudo 0
% 2.16/1.30 % fd_cond 0
% 2.16/1.30 % fd_pseudo_cond 6
% 2.16/1.30 % AC symbols 1
% 2.16/1.30
% 2.16/1.30 % ------ Input Options Time Limit: Unbounded
% 2.16/1.30
% 2.16/1.30
% 2.16/1.30 % ------
% 2.16/1.30 % Current options:
% 2.16/1.30 % ------
% 2.16/1.30
% 2.16/1.30
% 2.16/1.30 %
% 2.16/1.30
% 2.16/1.30 % ------ Proving...
% 2.16/1.30 %
% 2.16/1.30
% 2.16/1.30 % SZS status Theorem for theBenchmark.p
% 2.16/1.30
% 2.16/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.16/1.30
% 2.16/1.30
%------------------------------------------------------------------------------