%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ARI687_1 : TPTP v9.3.1. Released v6.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n001.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:37 PM UTC 2026
% Result : Theorem 0.50s 1.29s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 27
% Syntax : Number of formulae : 60 ( 42 unt; 0 typ; 0 def)
% Number of atoms : 86 ( 44 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 52 ( 26 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number arithmetic : 389 ( 41 atm; 184 fun; 77 num; 87 var)
% Number of types : 1 ( 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 : 13 ( 2 usr; 10 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn 87 !; 0 ?; 87 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
x: $int ).
tff(func_def_1,type,
y: $int ).
tff(f1,axiom,
$sum($sum($sum($product($product($product(x,x),x),y),$product($product(x,x),y)),$product($product($product(3,x),x),x)),$product($product(2,x),x)) = 0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',eq1) ).
tff(f4,conjecture,
$sum($product(2,$product($product(x,x),x)),$product(-1,$sum($product(5,x),$product(5,$product(x,x))))) = 0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
tff(f5,negated_conjecture,
( ( ~ $sum($product(2,$product($product(x,x),x)),$product(-1,$sum($product(5,x),$product(5,$product(x,x))))) ) = 0 ),
inference(negated_conjecture,[status(cth)],[f4]) ).
tff(f8,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f9,plain,
! [X2: $int,X0: $int,X1: $int] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
introduced(definition,[],[tha_associativity]) ).
tff(f10,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(definition,[],[tha_right_identity]) ).
tff(f11,plain,
! [X0: $int,X1: $int] : ( $uminus($sum(X0,X1)) = $sum($uminus(X1),$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_op_inverses]) ).
tff(f12,plain,
! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_unit]) ).
tff(f13,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(definition,[],[tha_non-reflexivity]) ).
tff(f14,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_transitivity]) ).
tff(f15,plain,
! [X0: $int,X1: $int] :
( ( X0 = X1 )
| $less(X1,X0)
| $less(X0,X1) ),
introduced(definition,[],[tha_order_totality]) ).
tff(f16,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_order_monotonicity]) ).
tff(f17,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(definition,[],[tha_order_plus_one_dichotomy]) ).
tff(f18,plain,
! [X0: $int] : ( $uminus($uminus(X0)) = X0 ),
introduced(definition,[],[tha_minus_minus_x]) ).
tff(f19,plain,
! [X0: $int,X1: $int] : ( $product(X0,X1) = $product(X1,X0) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f20,plain,
! [X2: $int,X0: $int,X1: $int] : ( $product(X0,$product(X1,X2)) = $product($product(X0,X1),X2) ),
introduced(definition,[],[tha_associativity]) ).
tff(f21,plain,
! [X0: $int] : ( $product(X0,1) = X0 ),
introduced(definition,[],[tha_right_identity]) ).
tff(f22,plain,
! [X0: $int] : ( 0 = $product(X0,0) ),
introduced(definition,[],[tha_times_zero]) ).
tff(f23,plain,
! [X2: $int,X0: $int,X1: $int] : ( $product(X0,$sum(X1,X2)) = $sum($product(X0,X1),$product(X0,X2)) ),
introduced(definition,[],[tha_distributivity]) ).
tff(f24,plain,
! [X2: $int,X3: $int,X0: $int,X1: $int] :
( ( X2 = X3 )
| ( $product(X0,X3) != X1 )
| ( $product(X0,X2) != X1 )
| ( 0 = X0 ) ),
introduced(definition,[],[tha_divisibility]) ).
tff(f25,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_extra_integer_ordering]) ).
tff(f26,plain,
0 != $sum($product(2,$product($product(x,x),x)),$product(-1,$sum($product(5,x),$product(5,$product(x,x))))),
inference(flattening,[],[f5]) ).
tff(f27,plain,
$sum($sum($sum($product($product($product(x,x),x),y),$product($product(x,x),y)),$product($product($product(3,x),x),x)),$product($product(2,x),x)) = 0,
inference(cnf_transformation,[],[f1]) ).
tff(f30,plain,
0 != $sum($product(2,$product($product(x,x),x)),$product(-1,$sum($product(5,x),$product(5,$product(x,x))))),
inference(cnf_transformation,[],[f26]) ).
tff(f31,plain,
! [X2: $int,X3: $int,X0: $int] :
( ( X2 = X3 )
| ( $product(X0,X2) != $product(X0,X3) )
| ( 0 = X0 ) ),
inference(equality_resolution,[],[f24]) ).
tcf(c_49,negated_conjecture,
! [X0_int: $int,X1_int: $int] :
( ~ $less(X1_int,X0_int)
| ~ $less(X0_int,$sum(X1_int,1)) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_50,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( ( X1_int = X2_int )
| ( X0_int = 0 )
| ( $product(X0_int,X1_int) != $product(X0_int,X2_int) ) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_51,negated_conjecture,
! [X0_int: $int,X1_int: $int,X2_int: $int] : $sum($product(X0_int,X1_int),$product(X0_int,X2_int)) = $product(X0_int,$sum(X1_int,X2_int)),
inference(cnf_transformation,[],[f23]) ).
tcf(c_52,negated_conjecture,
! [X0_int: $int] : $product(X0_int,0) = 0,
inference(cnf_transformation,[],[f22]) ).
tcf(c_53,negated_conjecture,
! [X0_int: $int] : $product(X0_int,1) = X0_int,
inference(cnf_transformation,[],[f21]) ).
tcf(c_54,negated_conjecture,
! [X0_int: $int,X1_int: $int,X2_int: $int] : $product($product(X0_int,X1_int),X2_int) = $product(X0_int,$product(X1_int,X2_int)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_55,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $product(X0_int,X1_int) = $product(X1_int,X0_int),
inference(cnf_transformation,[],[f19]) ).
tcf(c_56,negated_conjecture,
! [X0_int: $int] : $uminus($uminus(X0_int)) = X0_int,
inference(cnf_transformation,[],[f18]) ).
tcf(c_57,negated_conjecture,
! [X0_int: $int,X1_int: $int] :
( $less(X1_int,X0_int)
| $less(X0_int,$sum(X1_int,1)) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_58,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( $less($sum(X0_int,X2_int),$sum(X1_int,X2_int))
| ~ $less(X0_int,X1_int) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_59,negated_conjecture,
! [X0_int: $int,X1_int: $int] :
( $less(X1_int,X0_int)
| $less(X0_int,X1_int)
| ( X0_int = X1_int ) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_60,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( $less(X0_int,X2_int)
| ~ $less(X1_int,X2_int)
| ~ $less(X0_int,X1_int) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_61,negated_conjecture,
! [X0_int: $int] : ~ $less(X0_int,X0_int),
inference(cnf_transformation,[],[f13]) ).
tcf(c_62,negated_conjecture,
! [X0_int: $int] : $sum(X0_int,$uminus(X0_int)) = 0,
inference(cnf_transformation,[],[f12]) ).
tcf(c_63,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $sum($uminus(X0_int),$uminus(X1_int)) = $uminus($sum(X1_int,X0_int)),
inference(cnf_transformation,[],[f11]) ).
tcf(c_64,negated_conjecture,
! [X0_int: $int] : $sum(X0_int,0) = X0_int,
inference(cnf_transformation,[],[f10]) ).
tcf(c_65,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,[],[f9]) ).
tcf(c_66,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $sum(X0_int,X1_int) = $sum(X1_int,X0_int),
inference(cnf_transformation,[],[f8]) ).
tcf(c_67,negated_conjecture,
$sum($sum($sum($product($product($product(x,x),x),y),$product($product(x,x),y)),$product($product($product(3,x),x),x)),$product($product(2,x),x)) = 0,
inference(cnf_transformation,[],[f27]) ).
tcf(c_70,negated_conjecture,
$sum($product(2,$product($product(x,x),x)),$product(-1,$sum($product(5,x),$product(5,$product(x,x))))) != 0,
inference(cnf_transformation,[],[f30]) ).
tcf(c_71,plain,
$less(-1,0),
theory(arith) ).
tcf(c_72,plain,
$less(0,1),
theory(arith) ).
tcf(c_73,plain,
$less(1,2),
theory(arith) ).
tcf(c_74,plain,
$less(2,3),
theory(arith) ).
tcf(c_75,plain,
$less(3,5),
theory(arith) ).
tcf(c_76,plain,
$less(5,6),
theory(arith) ).
tcf(c_77,plain,
$less(6,9),
theory(arith) ).
tcf(c_93,negated_conjecture,
$sum($product(x,$product(x,y)),$sum($product(x,$product(x,2)),$sum($product(x,$product(x,$product(x,y))),$product(x,$product(x,$product(x,3)))))) = 0,
inference(theory_normalisation,[status(thm)],[c_67,c_54,c_55,c_65,c_66]) ).
tcf(c_96,negated_conjecture,
$sum($product(x,$product(x,$product(x,2))),$product(-1,$sum($product(x,5),$product(x,$product(x,5))))) != 0,
inference(theory_normalisation,[status(thm)],[c_70,c_54,c_55,c_65,c_66]) ).
tcf(c_97,plain,
! [X0_int: $int,X1_int: $int] :
( ~ $less(X0_int,$sum(X1_int,1))
| ~ $less(X1_int,X0_int) ),
inference(prop_impl_just,[status(thm)],[c_49]) ).
tcf(c_98,plain,
! [X0_int: $int,X1_int: $int] :
( ~ $less(X1_int,X0_int)
| ~ $less(X0_int,$sum(X1_int,1)) ),
inference(renaming,[status(thm)],[c_97]) ).
tcf(c_99,plain,
! [X0_int: $int,X1_int: $int] :
( $less(X0_int,$sum(X1_int,1))
| $less(X1_int,X0_int) ),
inference(prop_impl_just,[status(thm)],[c_57]) ).
tcf(c_100,plain,
! [X0_int: $int,X1_int: $int] :
( $less(X1_int,X0_int)
| $less(X0_int,$sum(X1_int,1)) ),
inference(renaming,[status(thm)],[c_99]) ).
tcf(c_101,plain,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( $less($sum(X0_int,X2_int),$sum(X1_int,X2_int))
| ~ $less(X0_int,X1_int) ),
inference(prop_impl_just,[status(thm)],[c_58]) ).
tcf(c_232,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_96,c_93,c_77,c_76,c_75,c_74,c_73,c_72,c_71,c_66,c_65,c_64,c_63,c_62,c_61,c_60,c_59,c_101,c_100,c_56,c_55,c_54,c_53,c_52,c_51,c_50,c_98]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ARI687_1 : TPTP v9.3.1. Released v6.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n001.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Fri Sep 25 06:27:10 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.41 Running TFA theorem proving
% 0.12/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.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.42 % Detected problem language: tptp
% 0.12/0.43 % Proving...
% 0.50/1.29 % SZS status Started for theBenchmark.p
% 0.50/1.29 ERROR - "ProverProcess:heur/schedule_none:304.99997639656067" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 0.50/1.29 Fatal error: exception Failure("undefined enum value")
% 0.50/1.29 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_6hm_dhtj/v_sfch79 2>> /export/starexec/sandbox/tmp/iprover_out_6hm_dhtj/v_sfch79_error
% 0.50/1.29 % SZS status Theorem for theBenchmark.p
% 0.50/1.29
% 0.50/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.50/1.29
% 0.50/1.29 % ------ iProver source info
% 0.50/1.29
% 0.50/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.50/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.50/1.29 % git: non_committed_changes: false
% 0.50/1.29
% 0.50/1.29 % ------ Parsing...
% 0.50/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.50/1.29
% 0.50/1.29 % ------ Preprocessing...%
% 0.50/1.29
% 0.50/1.29 % SZS status Theorem for theBenchmark.p
% 0.50/1.29
% 0.50/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.50/1.29
% 0.50/1.29
%------------------------------------------------------------------------------