%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ARI341_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 12:58:09 PM UTC 2026
% Result : Theorem 0.55s 1.28s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 18
% Syntax : Number of formulae : 35 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 25 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 28 ( 13 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 185 ( 24 atm; 71 fun; 33 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 : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 0 usr; 7 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 57 !; 0 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_1,type,
p: $rat > $o ).
tff(f1,conjecture,
$less($product(-2/5,$difference(145/2,569/5)),$sum($uminus(76/25),271/10)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rat_combined_problem_7) ).
tff(f2,negated_conjecture,
~ $less($product(-2/5,$difference(145/2,569/5)),$sum($uminus(76/25),271/10)),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ $less($product(-2/5,$sum(145/2,$uminus(569/5))),$sum($uminus(76/25),271/10)),
inference(theory_normalization,[],[f2]) ).
tff(f4,plain,
! [X0: $rat,X1: $rat] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f5,plain,
! [X2: $rat,X0: $rat,X1: $rat] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
introduced(definition,[],[tha_associativity]) ).
tff(f6,plain,
! [X0: $rat] : ( $sum(X0,0/1) = X0 ),
introduced(definition,[],[tha_right_identity]) ).
tff(f7,plain,
! [X0: $rat,X1: $rat] : ( $uminus($sum(X0,X1)) = $sum($uminus(X1),$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_op_inverses]) ).
tff(f8,plain,
! [X0: $rat] : ( 0/1 = $sum(X0,$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_unit]) ).
tff(f9,plain,
! [X0: $rat] : ~ $less(X0,X0),
introduced(definition,[],[tha_non-reflexivity]) ).
tff(f10,plain,
! [X2: $rat,X0: $rat,X1: $rat] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_transitivity]) ).
tff(f11,plain,
! [X0: $rat,X1: $rat] :
( ( X0 = X1 )
| $less(X1,X0)
| $less(X0,X1) ),
introduced(definition,[],[tha_order_totality]) ).
tff(f12,plain,
! [X2: $rat,X0: $rat,X1: $rat] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_order_monotonicity]) ).
tff(f13,plain,
! [X0: $rat,X1: $rat] :
( $less(X1,$sum(X0,1/1))
| $less(X0,X1) ),
introduced(definition,[],[tha_order_plus_one_dichotomy]) ).
tff(f14,plain,
! [X0: $rat] : ( $uminus($uminus(X0)) = X0 ),
introduced(definition,[],[tha_minus_minus_x]) ).
tff(f15,plain,
! [X0: $rat,X1: $rat] : ( $product(X0,X1) = $product(X1,X0) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f16,plain,
! [X2: $rat,X0: $rat,X1: $rat] : ( $product(X0,$product(X1,X2)) = $product($product(X0,X1),X2) ),
introduced(definition,[],[tha_associativity]) ).
tff(f17,plain,
! [X0: $rat] : ( $product(X0,1/1) = X0 ),
introduced(definition,[],[tha_right_identity]) ).
tff(f18,plain,
! [X0: $rat] : ( 0/1 = $product(X0,0/1) ),
introduced(definition,[],[tha_times_zero]) ).
tff(f19,plain,
! [X2: $rat,X0: $rat,X1: $rat] : ( $product(X0,$sum(X1,X2)) = $sum($product(X0,X1),$product(X0,X2)) ),
introduced(definition,[],[tha_distributivity]) ).
tff(f20,plain,
! [X2: $rat,X3: $rat,X0: $rat,X1: $rat] :
( ( X2 = X3 )
| ( $product(X0,X3) != X1 )
| ( $product(X0,X2) != X1 )
| ( 0/1 = X0 ) ),
introduced(definition,[],[tha_divisibility]) ).
tff(f21,plain,
~ $less($product(-2/5,$sum(145/2,$uminus(569/5))),$sum($uminus(76/25),271/10)),
inference(flattening,[],[f3]) ).
tcf(c_51,negated_conjecture,
! [X0_rat: $rat] : $product(X0_rat,0/1) = 0/1,
inference(cnf_transformation,[],[f18]) ).
tcf(c_52,negated_conjecture,
! [X0_rat: $rat] : $product(X0_rat,1/1) = X0_rat,
inference(cnf_transformation,[],[f17]) ).
tcf(c_54,negated_conjecture,
! [X0_rat: $rat,X1_rat: $rat] : $product(X0_rat,X1_rat) = $product(X1_rat,X0_rat),
inference(cnf_transformation,[],[f15]) ).
tcf(c_55,negated_conjecture,
! [X0_rat: $rat] : $uminus($uminus(X0_rat)) = X0_rat,
inference(cnf_transformation,[],[f14]) ).
tcf(c_56,negated_conjecture,
! [X0_rat: $rat,X1_rat: $rat] :
( $less(X1_rat,X0_rat)
| $less(X0_rat,$sum(X1_rat,1/1)) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_57,plain,
! [X0_rat: $rat,X1_rat: $rat,X2_rat: $rat] :
( $less($sum(X0_rat,X2_rat),$sum(X1_rat,X2_rat))
| ~ $less(X0_rat,X1_rat) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_58,negated_conjecture,
! [X0_rat: $rat,X1_rat: $rat] :
( $less(X1_rat,X0_rat)
| $less(X0_rat,X1_rat)
| ( X0_rat = X1_rat ) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_59,plain,
! [X0_rat: $rat,X1_rat: $rat,X2_rat: $rat] :
( $less(X0_rat,X2_rat)
| ~ $less(X1_rat,X2_rat)
| ~ $less(X0_rat,X1_rat) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_60,negated_conjecture,
! [X0_rat: $rat] : ~ $less(X0_rat,X0_rat),
inference(cnf_transformation,[],[f9]) ).
tcf(c_61,negated_conjecture,
! [X0_rat: $rat] : $sum(X0_rat,$uminus(X0_rat)) = 0/1,
inference(cnf_transformation,[],[f8]) ).
tcf(c_62,negated_conjecture,
! [X0_rat: $rat,X1_rat: $rat] : $sum($uminus(X0_rat),$uminus(X1_rat)) = $uminus($sum(X1_rat,X0_rat)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_63,negated_conjecture,
! [X0_rat: $rat] : $sum(X0_rat,0/1) = X0_rat,
inference(cnf_transformation,[],[f6]) ).
tcf(c_65,negated_conjecture,
! [X0_rat: $rat,X1_rat: $rat] : $sum(X0_rat,X1_rat) = $sum(X1_rat,X0_rat),
inference(cnf_transformation,[],[f4]) ).
tcf(c_143,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_65,c_63,c_62,c_61,c_60,c_59,c_58,c_57,c_56,c_55,c_54,c_52,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ARI341_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.35 % Computer : n016.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.36 % DateTime : Fri Sep 25 06:14:28 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.39 Running TFA theorem proving
% 0.16/0.39 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.16/0.40
% 0.16/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.16/0.40
% 0.16/0.41 % Detected problem language: tptp
% 0.16/0.42 % Proving...
% 0.55/1.28 % SZS status Started for theBenchmark.p
% 0.55/1.28 ERROR - "ProverProcess:heur/schedule_none:304.99997544288635" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 0.55/1.28 Fatal error: exception Failure("undefined enum value")
% 0.55/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_xn99qkgq/yso2ggp2 2>> /export/starexec/sandbox2/tmp/iprover_out_xn99qkgq/yso2ggp2_error
% 0.55/1.28 % SZS status Theorem for theBenchmark.p
% 0.55/1.28
% 0.55/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.55/1.28
% 0.55/1.28 % ------ iProver source info
% 0.55/1.28
% 0.55/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.55/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.55/1.28 % git: non_committed_changes: false
% 0.55/1.28
% 0.55/1.28 % ------ Parsing...
% 0.55/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.55/1.28
% 0.55/1.28 % ------ Preprocessing...%
% 0.55/1.28
% 0.55/1.28 % SZS status Theorem for theBenchmark.p
% 0.55/1.28
% 0.55/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.55/1.28
% 0.55/1.28
%------------------------------------------------------------------------------