%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ARI616_1 : TPTP v9.3.1. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n006.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 12:58:29 PM UTC 2026
% Result : Theorem 1.79s 1.30s
% Output : CNFRefutation 1.79s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f16ERROR: Could not build tree for root c_321ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_1,type,
p: ( $int * ( $int * $int ) ) > $o ).
tff(func_def_4,type,
sK0: $int ).
tff(func_def_5,type,
sK1: $int ).
tff(func_def_6,type,
sK2: $int ).
tff(func_def_7,type,
sK3: $int ).
tff(func_def_8,type,
sK4: $int ).
tff(f17,plain,
( ! [X0: $int,X1: $int,X2: $int] :
( ( ~ $less($sum(X1,X2),X0)
& ~ $less(X0,$sum(X1,$uminus(X2))) )
<=> p(X0,X1,X2) )
& ? [X3: $int,X4: $int,X5: $int,X6: $int] :
( ? [X7: $int] :
( p(X7,X5,X6)
& p(X7,X3,X4) )
& $less($sum(X4,X6),$sum(X3,$uminus(X5))) ) ),
inference(ennf_transformation,[],[f16]) ).
tff(f18,plain,
( ! [X0: $int,X1: $int,X2: $int] :
( ( $less($sum(X1,X2),X0)
| $less(X0,$sum(X1,$uminus(X2)))
| p(X0,X1,X2) )
& ( ~ p(X0,X1,X2)
| ( ~ $less($sum(X1,X2),X0)
& ~ $less(X0,$sum(X1,$uminus(X2))) ) ) )
& ? [X3: $int,X4: $int,X5: $int,X6: $int] :
( ? [X7: $int] :
( p(X7,X5,X6)
& p(X7,X3,X4) )
& $less($sum(X4,X6),$sum(X3,$uminus(X5))) ) ),
inference(nnf_transformation,[],[f17]) ).
tff(f19,plain,
( ! [X0: $int,X1: $int,X2: $int] :
( ( $less($sum(X1,X2),X0)
| $less(X0,$sum(X1,$uminus(X2)))
| p(X0,X1,X2) )
& ( ~ p(X0,X1,X2)
| ( ~ $less($sum(X1,X2),X0)
& ~ $less(X0,$sum(X1,$uminus(X2))) ) ) )
& ? [X3: $int,X4: $int,X5: $int,X6: $int] :
( ? [X7: $int] :
( p(X7,X5,X6)
& p(X7,X3,X4) )
& $less($sum(X4,X6),$sum(X3,$uminus(X5))) ) ),
inference(flattening,[],[f18]) ).
tff(f20,plain,
( ! [X5: $int,X6: $int,X7: $int] :
( ( $less($sum(X6,X7),X5)
| $less(X5,$sum(X6,$uminus(X7)))
| p(X5,X6,X7) )
& ( ~ p(X5,X6,X7)
| ( ~ $less($sum(X6,X7),X5)
& ~ $less(X5,$sum(X6,$uminus(X7))) ) ) )
& ? [X0: $int,X1: $int,X2: $int,X3: $int] :
( ? [X4: $int] :
( p(X4,X2,X3)
& p(X4,X0,X1) )
& $less($sum(X1,X3),$sum(X0,$uminus(X2))) ) ),
inference(rectify,[],[f19]) ).
tff(f21,plain,
( ! [X5: $int,X6: $int,X7: $int] :
( ( $less($sum(X6,X7),X5)
| $less(X5,$sum(X6,$uminus(X7)))
| p(X5,X6,X7) )
& ( ~ p(X5,X6,X7)
| ( ~ $less($sum(X6,X7),X5)
& ~ $less(X5,$sum(X6,$uminus(X7))) ) ) )
& p(sK4,sK2,sK3)
& p(sK4,sK0,sK1)
& $less($sum(sK1,sK3),$sum(sK0,$uminus(sK2))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f20]) ).
tff(f23,plain,
! [X6: $int,X7: $int,X5: $int] :
( ~ p(X5,X6,X7)
| ~ $less($sum(X6,X7),X5) ),
inference(cnf_transformation,[],[f21]) ).
tff(f24,plain,
! [X6: $int,X7: $int,X5: $int] :
( ~ p(X5,X6,X7)
| ~ $less(X5,$sum(X6,$uminus(X7))) ),
inference(cnf_transformation,[],[f21]) ).
tff(f25,plain,
p(sK4,sK2,sK3),
inference(cnf_transformation,[],[f21]) ).
tff(f26,plain,
p(sK4,sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
tcf(c_50,negated_conjecture,
! [X0_int: $int] : $uminus($uminus(X0_int)) = X0_int,
inference(cnf_transformation,[],[f14]) ).
tcf(c_55,negated_conjecture,
! [X0_int: $int] : ~ $less(X0_int,X0_int),
inference(cnf_transformation,[],[f9]) ).
tcf(c_56,negated_conjecture,
! [X0_int: $int] : $sum(X0_int,$uminus(X0_int)) = 0,
inference(cnf_transformation,[],[f8]) ).
tcf(c_58,negated_conjecture,
! [X0_int: $int] : $sum(X0_int,0) = X0_int,
inference(cnf_transformation,[],[f6]) ).
tcf(c_62,negated_conjecture,
p(sK4,sK0,sK1),
inference(cnf_transformation,[],[f26]) ).
tcf(c_63,negated_conjecture,
p(sK4,sK2,sK3),
inference(cnf_transformation,[],[f25]) ).
tcf(c_64,negated_conjecture,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( ~ p(X0_int,X1_int,X2_int)
| ~ $less(X0_int,$sum(X1_int,$uminus(X2_int))) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_65,negated_conjecture,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( ~ p(X2_int,X0_int,X1_int)
| ~ $less($sum(X0_int,X1_int),X2_int) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_67,plain,
$less(0,1),
theory(arith) ).
tcf(c_86,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( ~ p(X0_int,X1_int,X2_int)
| ~ $less(X0_int,$sum(X1_int,$uminus(X2_int))) ),
inference(prop_impl_just,[status(thm)],[c_64]) ).
tcf(c_90,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( ~ p(X2_int,X0_int,X1_int)
| ~ $less($sum(X0_int,X1_int),X2_int) ),
inference(prop_impl_just,[status(thm)],[c_65]) ).
tcf(c_212,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( ~ $less(X2_int,$sum(X0_int,$uminus(X1_int)))
| ( X2_int != sK4 )
| ( X1_int != sK1 )
| ( X0_int != sK0 ) ),
inference(resolution_lifted,[status(thm)],[c_62,c_86]) ).
tcf(c_213,plain,
~ $less(sK4,$sum(sK0,$uminus(sK1))),
inference(unflattening,[status(thm)],[c_212]) ).
tcf(c_217,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( ~ $less($sum(X0_int,X1_int),X2_int)
| ( X2_int != sK4 )
| ( X1_int != sK1 )
| ( X0_int != sK0 ) ),
inference(resolution_lifted,[status(thm)],[c_62,c_90]) ).
tcf(c_218,plain,
~ $less($sum(sK0,sK1),sK4),
inference(unflattening,[status(thm)],[c_217]) ).
tcf(c_222,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( ~ $less(X2_int,$sum(X0_int,$uminus(X1_int)))
| ( X2_int != sK4 )
| ( X1_int != sK3 )
| ( X0_int != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_63,c_86]) ).
tcf(c_223,plain,
~ $less(sK4,$sum(sK2,$uminus(sK3))),
inference(unflattening,[status(thm)],[c_222]) ).
tcf(c_227,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( ~ $less($sum(X0_int,X1_int),X2_int)
| ( X2_int != sK4 )
| ( X1_int != sK3 )
| ( X0_int != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_63,c_90]) ).
tcf(c_228,plain,
~ $less($sum(sK2,sK3),sK4),
inference(unflattening,[status(thm)],[c_227]) ).
tcf(c_321,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_228,c_223,c_218,c_213,c_67,c_58,c_56,c_55,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ARI616_1 : TPTP v9.3.1. Released v5.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n006.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Fri Sep 25 06:17:40 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running TFA theorem proving
% 0.10/0.41 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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 1.79/1.30 % SZS status Started for theBenchmark.p
% 1.79/1.30 ERROR - "ProverProcess:heur/schedule_none:304.9999725818634" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.79/1.30 Fatal error: exception Failure("undefined enum value")
% 1.79/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/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_m71s2st6/8_yp1r3c 2>> /export/starexec/sandbox/tmp/iprover_out_m71s2st6/8_yp1r3c_error
% 1.79/1.30 % SZS status Theorem for theBenchmark.p
% 1.79/1.30
% 1.79/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.79/1.30
% 1.79/1.30 % ------ iProver source info
% 1.79/1.30
% 1.79/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.79/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.79/1.30 % git: non_committed_changes: false
% 1.79/1.30
% 1.79/1.30 % ------ Parsing...
% 1.79/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.79/1.30
% 1.79/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e %
% 1.79/1.30
% 1.79/1.30 % SZS status Theorem for theBenchmark.p
% 1.79/1.30
% 1.79/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.79/1.30
% 1.79/1.30
%------------------------------------------------------------------------------