%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM891_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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:10 PM UTC 2026
% Result : Theorem 0.40s 1.15s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 35 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 63 ( 34 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 46 ( 18 ~; 23 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 144 ( 28 atm; 44 fun; 25 num; 47 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 : 5 ( 1 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 45 !; 2 ?; 47 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_1,type,
$bool: $tType ).
tff(func_def_4,type,
sK0: $int ).
tff(f1,conjecture,
! [X0: $int] :
( ( X0 = $uminus(X0) )
<=> ( X0 = 0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',uminus_equal) ).
tff(f2,negated_conjecture,
~ ! [X0: $int] :
( ( X0 = $uminus(X0) )
<=> ( X0 = 0 ) ),
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] :
( ( X0 = $uminus(X0) )
<~> ( X0 = 0 ) ),
inference(ennf_transformation,[],[f2]) ).
tff(f16,plain,
? [X0: $int] :
( ( ( X0 = $uminus(X0) )
| ( X0 = 0 ) )
& ( ( $uminus(X0) != X0 )
| ( 0 != X0 ) ) ),
inference(nnf_transformation,[],[f15]) ).
tff(f17,plain,
( ( ( sK0 = $uminus(sK0) )
| ( 0 = sK0 ) )
& ( ( sK0 != $uminus(sK0) )
| ( 0 != sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f16]) ).
tff(f18,plain,
( ( sK0 = $uminus(sK0) )
| ( 0 = sK0 ) ),
inference(cnf_transformation,[],[f17]) ).
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,[],[f14]) ).
tcf(c_50,negated_conjecture,
! [X0_int: $int] : $uminus($uminus(X0_int)) = X0_int,
inference(cnf_transformation,[],[f13]) ).
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,[],[f12]) ).
tcf(c_53,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,[],[f10]) ).
tcf(c_55,negated_conjecture,
! [X0_int: $int] : ~ $less(X0_int,X0_int),
inference(cnf_transformation,[],[f8]) ).
tcf(c_56,negated_conjecture,
! [X0_int: $int] : $sum(X0_int,$uminus(X0_int)) = 0,
inference(cnf_transformation,[],[f7]) ).
tcf(c_58,negated_conjecture,
! [X0_int: $int] : $sum(X0_int,0) = X0_int,
inference(cnf_transformation,[],[f5]) ).
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_62,negated_conjecture,
( ( sK0 = 0 )
| ( $uminus(sK0) = sK0 ) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_63,plain,
$less(0,1),
theory(arith) ).
tcf(c_73,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_74,plain,
! [X0_int: $int,X1_int: $int] :
( ~ $less(X1_int,X0_int)
| ~ $less(X0_int,$sum(X1_int,1)) ),
inference(renaming,[status(thm)],[c_73]) ).
tcf(c_75,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_76,plain,
! [X0_int: $int,X1_int: $int] :
( $less(X1_int,X0_int)
| $less(X0_int,$sum(X1_int,1)) ),
inference(renaming,[status(thm)],[c_75]) ).
tcf(c_79,plain,
( ( $uminus(sK0) = sK0 )
| ( sK0 = 0 ) ),
inference(prop_impl_just,[status(thm)],[c_62]) ).
tcf(c_80,plain,
( ( sK0 = 0 )
| ( $uminus(sK0) = sK0 ) ),
inference(renaming,[status(thm)],[c_79]) ).
tcf(c_168,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_63,c_80,c_60,c_58,c_56,c_55,c_53,c_76,c_50,c_74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM891_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35 % Computer : n016.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Thu Sep 24 05:42:59 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.39 Running TFA theorem proving
% 0.09/0.39 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.09/0.40
% 0.09/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.40
% 0.09/0.40 % Detected problem language: tptp
% 0.09/0.41 % Proving...
% 0.40/1.15 % SZS status Started for theBenchmark.p
% 0.40/1.15 ERROR - "ProverProcess:heur/schedule_none:304.99997901916504" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 0.40/1.15 Fatal error: exception Failure("undefined enum value")
% 0.40/1.15 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_4u96i2u_/choq2n9t 2>> /export/starexec/sandbox/tmp/iprover_out_4u96i2u_/choq2n9t_error
% 0.40/1.15 % SZS status Theorem for theBenchmark.p
% 0.40/1.15
% 0.40/1.15 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.40/1.15
% 0.40/1.15 % ------ iProver source info
% 0.40/1.15
% 0.40/1.15 % git: date: 2026-07-19 20:42:38 +0200
% 0.40/1.15 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.40/1.15 % git: non_committed_changes: false
% 0.40/1.15
% 0.40/1.15 % ------ Parsing...
% 0.40/1.15 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.40/1.15
% 0.40/1.15 % ------ Preprocessing...%
% 0.40/1.15
% 0.40/1.15 % SZS status Theorem for theBenchmark.p
% 0.40/1.15
% 0.40/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.40/1.15
% 0.40/1.15
%------------------------------------------------------------------------------