%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ARI658_1 : TPTP v9.3.1. Released v6.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n014.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:33 PM UTC 2026
% Result : Theorem 0.44s 1.29s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of formulae : 51 ( 24 unt; 0 typ; 0 def)
% Number of atoms : 95 ( 24 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 89 ( 45 ~; 32 |; 8 &)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 264 ( 70 atm; 68 fun; 65 num; 61 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 : 5 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 1 usr; 5 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 61 !; 0 ?; 61 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
a: $int ).
tff(type_def_1,type,
$bool: $tType ).
tff(f1,conjecture,
( $greatereq(3,$product(a,a))
<=> ( $greatereq(a,-1)
& $lesseq(a,1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(f2,negated_conjecture,
~ ( $greatereq(3,$product(a,a))
<=> ( $greatereq(a,-1)
& $lesseq(a,1) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ ( ~ $less(3,$product(a,a))
<=> ( ~ $less(a,-1)
& ~ $less(1,a) ) ),
inference(theory_normalization,[],[f2]) ).
tff(f4,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f5,plain,
! [X2: $int,X0: $int,X1: $int] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
introduced(definition,[],[tha_associativity]) ).
tff(f6,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(definition,[],[tha_right_identity]) ).
tff(f7,plain,
! [X0: $int,X1: $int] : ( $uminus($sum(X0,X1)) = $sum($uminus(X1),$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_op_inverses]) ).
tff(f8,plain,
! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_unit]) ).
tff(f9,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(definition,[],[tha_non-reflexivity]) ).
tff(f10,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_transitivity]) ).
tff(f11,plain,
! [X0: $int,X1: $int] :
( ( X0 = X1 )
| $less(X1,X0)
| $less(X0,X1) ),
introduced(definition,[],[tha_order_totality]) ).
tff(f12,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_order_monotonicity]) ).
tff(f13,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(definition,[],[tha_order_plus_one_dichotomy]) ).
tff(f14,plain,
! [X0: $int] : ( $uminus($uminus(X0)) = X0 ),
introduced(definition,[],[tha_minus_minus_x]) ).
tff(f15,plain,
! [X0: $int,X1: $int] : ( $product(X0,X1) = $product(X1,X0) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f16,plain,
! [X2: $int,X0: $int,X1: $int] : ( $product(X0,$product(X1,X2)) = $product($product(X0,X1),X2) ),
introduced(definition,[],[tha_associativity]) ).
tff(f17,plain,
! [X0: $int] : ( $product(X0,1) = X0 ),
introduced(definition,[],[tha_right_identity]) ).
tff(f18,plain,
! [X0: $int] : ( 0 = $product(X0,0) ),
introduced(definition,[],[tha_times_zero]) ).
tff(f19,plain,
! [X2: $int,X0: $int,X1: $int] : ( $product(X0,$sum(X1,X2)) = $sum($product(X0,X1),$product(X0,X2)) ),
introduced(definition,[],[tha_distributivity]) ).
tff(f20,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(f21,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_extra_integer_ordering]) ).
tff(f22,plain,
( ~ $less(3,$product(a,a))
<~> ( ~ $less(a,-1)
& ~ $less(1,a) ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f23,plain,
( ( ~ $less(3,$product(a,a))
| ( ~ $less(a,-1)
& ~ $less(1,a) ) )
& ( $less(3,$product(a,a))
| $less(a,-1)
| $less(1,a) ) ),
inference(nnf_transformation,[],[f22]) ).
tff(f24,plain,
( ( ~ $less(3,$product(a,a))
| ( ~ $less(a,-1)
& ~ $less(1,a) ) )
& ( $less(3,$product(a,a))
| $less(a,-1)
| $less(1,a) ) ),
inference(flattening,[],[f23]) ).
tff(f25,plain,
( ~ $less(3,$product(a,a))
| ~ $less(a,-1) ),
inference(cnf_transformation,[],[f24]) ).
tff(f26,plain,
( ~ $less(3,$product(a,a))
| ~ $less(1,a) ),
inference(cnf_transformation,[],[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,[],[f21]) ).
tcf(c_52,negated_conjecture,
! [X0_int: $int] : $product(X0_int,0) = 0,
inference(cnf_transformation,[],[f18]) ).
tcf(c_53,negated_conjecture,
! [X0_int: $int] : $product(X0_int,1) = X0_int,
inference(cnf_transformation,[],[f17]) ).
tcf(c_55,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $product(X0_int,X1_int) = $product(X1_int,X0_int),
inference(cnf_transformation,[],[f15]) ).
tcf(c_56,negated_conjecture,
! [X0_int: $int] : $uminus($uminus(X0_int)) = X0_int,
inference(cnf_transformation,[],[f14]) ).
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,[],[f13]) ).
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,[],[f11]) ).
tcf(c_61,negated_conjecture,
! [X0_int: $int] : ~ $less(X0_int,X0_int),
inference(cnf_transformation,[],[f9]) ).
tcf(c_62,negated_conjecture,
! [X0_int: $int] : $sum(X0_int,$uminus(X0_int)) = 0,
inference(cnf_transformation,[],[f8]) ).
tcf(c_64,negated_conjecture,
! [X0_int: $int] : $sum(X0_int,0) = X0_int,
inference(cnf_transformation,[],[f6]) ).
tcf(c_66,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $sum(X0_int,X1_int) = $sum(X1_int,X0_int),
inference(cnf_transformation,[],[f4]) ).
tcf(c_68,negated_conjecture,
( ~ $less(1,a)
| ~ $less(3,$product(a,a)) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_69,negated_conjecture,
( ~ $less(a,-1)
| ~ $less(3,$product(a,a)) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_70,plain,
$less(-1,0),
theory(arith) ).
tcf(c_71,plain,
$less(0,1),
theory(arith) ).
tcf(c_72,plain,
$less(1,3),
theory(arith) ).
tcf(c_88,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_89,plain,
! [X0_int: $int,X1_int: $int] :
( ~ $less(X1_int,X0_int)
| ~ $less(X0_int,$sum(X1_int,1)) ),
inference(renaming,[status(thm)],[c_88]) ).
tcf(c_90,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_91,plain,
! [X0_int: $int,X1_int: $int] :
( $less(X1_int,X0_int)
| $less(X0_int,$sum(X1_int,1)) ),
inference(renaming,[status(thm)],[c_90]) ).
tcf(c_94,plain,
( ~ $less(3,$product(a,a))
| ~ $less(1,a) ),
inference(prop_impl_just,[status(thm)],[c_68]) ).
tcf(c_95,plain,
( ~ $less(1,a)
| ~ $less(3,$product(a,a)) ),
inference(renaming,[status(thm)],[c_94]) ).
tcf(c_96,plain,
( ~ $less(3,$product(a,a))
| ~ $less(a,-1) ),
inference(prop_impl_just,[status(thm)],[c_69]) ).
tcf(c_97,plain,
( ~ $less(a,-1)
| ~ $less(3,$product(a,a)) ),
inference(renaming,[status(thm)],[c_96]) ).
tcf(c_226,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_72,c_71,c_70,c_97,c_95,c_66,c_64,c_62,c_61,c_59,c_91,c_56,c_55,c_53,c_52,c_89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ARI658_1 : TPTP v9.3.1. Released v6.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.38 % Computer : n014.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 06:19:32 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...
% 0.44/1.29 % SZS status Started for theBenchmark.p
% 0.44/1.29 ERROR - "ProverProcess:heur/schedule_none:304.9999735355377" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 0.44/1.29 Fatal error: exception Failure("undefined enum value")
% 0.44/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/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_w2_nu8q0/ko32wo8l 2>> /export/starexec/sandbox2/tmp/iprover_out_w2_nu8q0/ko32wo8l_error
% 0.44/1.29 % SZS status Theorem for theBenchmark.p
% 0.44/1.29
% 0.44/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.44/1.29
% 0.44/1.29 % ------ iProver source info
% 0.44/1.29
% 0.44/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.44/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.44/1.29 % git: non_committed_changes: false
% 0.44/1.29
% 0.44/1.29 % ------ Parsing...
% 0.44/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.44/1.29
% 0.44/1.29 % ------ Preprocessing...%
% 0.44/1.29
% 0.44/1.29 % SZS status Theorem for theBenchmark.p
% 0.44/1.29
% 0.44/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.30
% 0.44/1.30
%------------------------------------------------------------------------------