%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM865_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/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 02:27:08 PM UTC 2026
% Result : Theorem 1.51s 1.28s
% Output : CNFRefutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 31 ( 21 unt; 0 typ; 0 def)
% Number of atoms : 58 ( 43 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 40 ( 13 ~; 7 |; 18 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 130 ( 14 atm; 53 fun; 6 num; 57 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 : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 7 usr; 9 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 43 !; 14 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_1,type,
$bool: $tType ).
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(func_def_9,type,
sK5: $int ).
tff(func_def_10,type,
sK6: $int ).
tff(f1,conjecture,
! [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
( ( ( $sum(X0,X5) = X6 )
& ( $sum(X1,X2) = X5 )
& ( $sum(X3,X2) = X4 )
& ( $sum(X0,X1) = X3 ) )
=> ( X4 = X6 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associative_sum_forall) ).
tff(f2,negated_conjecture,
~ ! [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
( ( ( $sum(X0,X5) = X6 )
& ( $sum(X1,X2) = X5 )
& ( $sum(X3,X2) = X4 )
& ( $sum(X0,X1) = X3 ) )
=> ( X4 = X6 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f4,plain,
! [X2: $int,X0: $int,X1: $int] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
introduced(definition,[],[tha_associativity]) ).
tff(f5,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(definition,[],[tha_right_identity]) ).
tff(f6,plain,
! [X0: $int,X1: $int] : ( $uminus($sum(X0,X1)) = $sum($uminus(X1),$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_op_inverses]) ).
tff(f7,plain,
! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_unit]) ).
tff(f8,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(definition,[],[tha_non-reflexivity]) ).
tff(f9,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_transitivity]) ).
tff(f10,plain,
! [X0: $int,X1: $int] :
( ( X0 = X1 )
| $less(X1,X0)
| $less(X0,X1) ),
introduced(definition,[],[tha_order_totality]) ).
tff(f11,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_order_monotonicity]) ).
tff(f12,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(definition,[],[tha_order_plus_one_dichotomy]) ).
tff(f13,plain,
! [X0: $int] : ( $uminus($uminus(X0)) = X0 ),
introduced(definition,[],[tha_minus_minus_x]) ).
tff(f14,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_extra_integer_ordering]) ).
tff(f15,plain,
? [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
( ( $sum(X0,X5) = X6 )
& ( $sum(X1,X2) = X5 )
& ( $sum(X3,X2) = X4 )
& ( $sum(X0,X1) = X3 )
& ( X4 != X6 ) ),
inference(ennf_transformation,[],[f2]) ).
tff(f16,plain,
? [X0: $int,X1: $int,X2: $int,X3: $int,X4: $int,X5: $int,X6: $int] :
( ( $sum(X0,X5) = X6 )
& ( $sum(X1,X2) = X5 )
& ( $sum(X3,X2) = X4 )
& ( $sum(X0,X1) = X3 )
& ( X4 != X6 ) ),
inference(flattening,[],[f15]) ).
tff(f17,plain,
( ( sK6 = $sum(sK0,sK5) )
& ( sK5 = $sum(sK1,sK2) )
& ( sK4 = $sum(sK3,sK2) )
& ( sK3 = $sum(sK0,sK1) )
& ( sK4 != sK6 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6)],[f16]) ).
tff(f18,plain,
sK6 = $sum(sK0,sK5),
inference(cnf_transformation,[],[f17]) ).
tff(f19,plain,
sK5 = $sum(sK1,sK2),
inference(cnf_transformation,[],[f17]) ).
tff(f20,plain,
sK4 = $sum(sK3,sK2),
inference(cnf_transformation,[],[f17]) ).
tff(f22,plain,
sK4 != sK6,
inference(cnf_transformation,[],[f17]) ).
tcf(c_55,negated_conjecture,
! [X0_int: $int] : ~ $less(X0_int,X0_int),
inference(cnf_transformation,[],[f8]) ).
tcf(c_59,negated_conjecture,
! [X0_int: $int,X1_int: $int,X2_int: $int] : $sum($sum(X0_int,X1_int),X2_int) = $sum(X0_int,$sum(X1_int,X2_int)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_60,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $sum(X0_int,X1_int) = $sum(X1_int,X0_int),
inference(cnf_transformation,[],[f3]) ).
tcf(c_61,negated_conjecture,
sK4 != sK6,
inference(cnf_transformation,[],[f22]) ).
tcf(c_63,negated_conjecture,
$sum(sK3,sK2) = sK4,
inference(cnf_transformation,[],[f20]) ).
tcf(c_64,negated_conjecture,
$sum(sK1,sK2) = sK5,
inference(cnf_transformation,[],[f19]) ).
tcf(c_65,negated_conjecture,
$sum(sK0,sK5) = sK6,
inference(cnf_transformation,[],[f18]) ).
tcf(c_66,plain,
$less(0,1),
theory(arith) ).
tcf(c_76,negated_conjecture,
$sum(sK2,sK3) = sK4,
inference(theory_normalisation,[status(thm)],[c_63,c_59,c_60]) ).
tcf(c_160,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_76,c_66,c_65,c_64,c_61,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM865_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n016.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Thu Sep 24 05:40:56 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running TFA theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 1.51/1.28 % SZS status Started for theBenchmark.p
% 1.51/1.28 ERROR - "ProverProcess:heur/schedule_none:304.99997067451477" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.51/1.28 Fatal error: exception Failure("undefined enum value")
% 1.51/1.28 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_fkx52h9s/s25jrdr2 2>> /export/starexec/sandbox2/tmp/iprover_out_fkx52h9s/s25jrdr2_error
% 1.51/1.28 % SZS status Theorem for theBenchmark.p
% 1.51/1.28
% 1.51/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.51/1.28
% 1.51/1.28 % ------ iProver source info
% 1.51/1.28
% 1.51/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.51/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.51/1.28 % git: non_committed_changes: false
% 1.51/1.28
% 1.51/1.28 % ------ Parsing...
% 1.51/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.51/1.28
% 1.51/1.28 % ------ Preprocessing...%
% 1.51/1.28
% 1.51/1.28 % SZS status Theorem for theBenchmark.p
% 1.51/1.28
% 1.51/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.51/1.28
% 1.51/1.28
%------------------------------------------------------------------------------