%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ARI571_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 : n007.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:25 PM UTC 2026
% Result : Theorem 0.42s 1.38s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 31 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 46 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 11 ~; 10 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 148 ( 34 atm; 46 fun; 25 num; 43 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 : 9 ( 2 usr; 6 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 41 !; 2 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_1,type,
$bool: $tType ).
tff(func_def_7,type,
sK0: $int ).
tff(func_def_8,type,
sK1: $int ).
tff(f1,conjecture,
! [X0: $int,X1: $int] :
( $less(X1,X0)
=> $less($difference(2,X0),$difference(5,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',neg_weakening_ineq) ).
tff(f2,negated_conjecture,
~ ! [X0: $int,X1: $int] :
( $less(X1,X0)
=> $less($difference(2,X0),$difference(5,X1)) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ ! [X0: $int,X1: $int] :
( $less(X1,X0)
=> $less($sum(2,$uminus(X0)),$sum(5,$uminus(X1))) ),
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] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_extra_integer_ordering]) ).
tff(f16,plain,
? [X0: $int,X1: $int] :
( $less(X1,X0)
& ~ $less($sum(2,$uminus(X0)),$sum(5,$uminus(X1))) ),
inference(ennf_transformation,[],[f3]) ).
tff(f17,plain,
( $less(sK1,sK0)
& ~ $less($sum(2,$uminus(sK0)),$sum(5,$uminus(sK1))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f16]) ).
tff(f18,plain,
$less(sK1,sK0),
inference(cnf_transformation,[],[f17]) ).
tcf(c_50,negated_conjecture,
! [X0_int: $int] : $uminus($uminus(X0_int)) = X0_int,
inference(cnf_transformation,[],[f14]) ).
tcf(c_51,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_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_60,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $sum(X0_int,X1_int) = $sum(X1_int,X0_int),
inference(cnf_transformation,[],[f4]) ).
tcf(c_62,negated_conjecture,
$less(sK1,sK0),
inference(cnf_transformation,[],[f18]) ).
tcf(c_63,plain,
$less(0,1),
theory(arith) ).
tcf(c_64,plain,
$less(1,2),
theory(arith) ).
tcf(c_65,plain,
$less(2,5),
theory(arith) ).
tcf(c_77,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_51]) ).
tcf(c_78,plain,
! [X0_int: $int,X1_int: $int] :
( $less(X1_int,X0_int)
| $less(X0_int,$sum(X1_int,1)) ),
inference(renaming,[status(thm)],[c_77]) ).
tcf(c_155,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_65,c_64,c_63,c_62,c_60,c_58,c_56,c_55,c_78,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ARI571_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.12/0.57 % Computer : n007.cluster.edu
% 0.12/0.57 % Model : x86_64 x86_64
% 0.12/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.57 % Memory : 8046.5625MB
% 0.12/0.57 % OS : Linux 6.8.0-71-generic
% 0.12/0.57 % CPULimit : 300
% 0.12/0.57 % WCLimit : 300
% 0.12/0.57 % DateTime : Fri Sep 25 06:14:24 UTC 2026
% 0.04/0.58 % CPUTime :
% 0.04/0.58 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.61 Running TFA theorem proving
% 0.04/0.61 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.04/0.62
% 0.04/0.62 % ======== iProver multi-core TPTP/SMT =========
% 0.04/0.62
% 0.04/0.62 % Detected problem language: tptp
% 0.16/0.64 % Proving...
% 0.42/1.38 % SZS status Started for theBenchmark.p
% 0.42/1.38 ERROR - "ProverProcess:heur/schedule_none:304.99997997283936" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 0.42/1.38 Fatal error: exception Failure("undefined enum value")
% 0.42/1.38 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_hdg6aetv/hyhlqro_ 2>> /export/starexec/sandbox/tmp/iprover_out_hdg6aetv/hyhlqro__error
% 0.42/1.38 % SZS status Theorem for theBenchmark.p
% 0.42/1.38
% 0.42/1.38 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.42/1.38
% 0.42/1.38 % ------ iProver source info
% 0.42/1.38
% 0.42/1.38 % git: date: 2026-07-19 20:42:38 +0200
% 0.42/1.38 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.42/1.38 % git: non_committed_changes: false
% 0.42/1.38
% 0.42/1.38 % ------ Parsing...
% 0.42/1.38 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.42/1.38
% 0.42/1.38 % ------ Preprocessing...%
% 0.42/1.38
% 0.42/1.38 % SZS status Theorem for theBenchmark.p
% 0.42/1.38
% 0.42/1.38 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/1.38
% 0.42/1.38
%------------------------------------------------------------------------------