%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM905_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:12 PM UTC 2026
% Result : Theorem 1.44s 1.25s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 29 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 52 ( 34 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 33 ( 10 ~; 18 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 111 ( 17 atm; 39 fun; 18 num; 37 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 : 37 ( 0 sgn 35 !; 2 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_1,type,
$bool: $tType ).
tff(func_def_4,type,
sK0: $rat ).
tff(f1,conjecture,
! [X0: $rat] :
( ( X0 = $uminus(X0) )
<=> ( X0 = 0/1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rat_uminus_problem_9) ).
tff(f2,negated_conjecture,
~ ! [X0: $rat] :
( ( X0 = $uminus(X0) )
<=> ( X0 = 0/1 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
! [X0: $rat,X1: $rat] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(definition,[],[tha_commutativity]) ).
tff(f4,plain,
! [X2: $rat,X0: $rat,X1: $rat] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
introduced(definition,[],[tha_associativity]) ).
tff(f5,plain,
! [X0: $rat] : ( $sum(X0,0/1) = X0 ),
introduced(definition,[],[tha_right_identity]) ).
tff(f6,plain,
! [X0: $rat,X1: $rat] : ( $uminus($sum(X0,X1)) = $sum($uminus(X1),$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_op_inverses]) ).
tff(f7,plain,
! [X0: $rat] : ( 0/1 = $sum(X0,$uminus(X0)) ),
introduced(definition,[],[tha_inverse_op_unit]) ).
tff(f8,plain,
! [X0: $rat] : ~ $less(X0,X0),
introduced(definition,[],[tha_non-reflexivity]) ).
tff(f9,plain,
! [X2: $rat,X0: $rat,X1: $rat] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_transitivity]) ).
tff(f10,plain,
! [X0: $rat,X1: $rat] :
( ( X0 = X1 )
| $less(X1,X0)
| $less(X0,X1) ),
introduced(definition,[],[tha_order_totality]) ).
tff(f11,plain,
! [X2: $rat,X0: $rat,X1: $rat] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(definition,[],[tha_order_monotonicity]) ).
tff(f12,plain,
! [X0: $rat,X1: $rat] :
( $less(X1,$sum(X0,1/1))
| $less(X0,X1) ),
introduced(definition,[],[tha_order_plus_one_dichotomy]) ).
tff(f13,plain,
! [X0: $rat] : ( $uminus($uminus(X0)) = X0 ),
introduced(definition,[],[tha_minus_minus_x]) ).
tff(f14,plain,
? [X0: $rat] :
( ( X0 = $uminus(X0) )
<~> ( X0 = 0/1 ) ),
inference(ennf_transformation,[],[f2]) ).
tff(f15,plain,
? [X0: $rat] :
( ( ( X0 = $uminus(X0) )
| ( X0 = 0/1 ) )
& ( ( $uminus(X0) != X0 )
| ( 0/1 != X0 ) ) ),
inference(nnf_transformation,[],[f14]) ).
tff(f16,plain,
( ( ( sK0 = $uminus(sK0) )
| ( 0/1 = sK0 ) )
& ( ( sK0 != $uminus(sK0) )
| ( 0/1 != sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f15]) ).
tff(f17,plain,
( ( sK0 = $uminus(sK0) )
| ( 0/1 = sK0 ) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_49,negated_conjecture,
! [X0_rat: $rat] : $uminus($uminus(X0_rat)) = X0_rat,
inference(cnf_transformation,[],[f13]) ).
tcf(c_50,negated_conjecture,
! [X0_rat: $rat,X1_rat: $rat] :
( $less(X1_rat,X0_rat)
| $less(X0_rat,$sum(X1_rat,1/1)) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_52,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,[],[f10]) ).
tcf(c_54,negated_conjecture,
! [X0_rat: $rat] : ~ $less(X0_rat,X0_rat),
inference(cnf_transformation,[],[f8]) ).
tcf(c_55,negated_conjecture,
! [X0_rat: $rat] : $sum(X0_rat,$uminus(X0_rat)) = 0/1,
inference(cnf_transformation,[],[f7]) ).
tcf(c_57,negated_conjecture,
! [X0_rat: $rat] : $sum(X0_rat,0/1) = X0_rat,
inference(cnf_transformation,[],[f5]) ).
tcf(c_59,negated_conjecture,
! [X0_rat: $rat,X1_rat: $rat] : $sum(X0_rat,X1_rat) = $sum(X1_rat,X0_rat),
inference(cnf_transformation,[],[f3]) ).
tcf(c_61,negated_conjecture,
( ( sK0 = 0/1 )
| ( $uminus(sK0) = sK0 ) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_73,plain,
( ( $uminus(sK0) = sK0 )
| ( sK0 = 0/1 ) ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
tcf(c_74,plain,
( ( sK0 = 0/1 )
| ( $uminus(sK0) = sK0 ) ),
inference(renaming,[status(thm)],[c_73]) ).
tcf(c_77,plain,
! [X0_rat: $rat,X1_rat: $rat] :
( $less(X1_rat,X0_rat)
| $less(X0_rat,$sum(X1_rat,1/1)) ),
inference(prop_impl_just,[status(thm)],[c_50]) ).
tcf(c_153,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_74,c_59,c_57,c_55,c_54,c_52,c_77,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM905_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:43:13 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.38 Running TFA theorem proving
% 0.04/0.38 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.40
% 0.04/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.04/0.40
% 0.04/0.40 % Detected problem language: tptp
% 0.04/0.41 % Proving...
% 1.44/1.25 % SZS status Started for theBenchmark.p
% 1.44/1.25 ERROR - "ProverProcess:heur/schedule_none:304.99997997283936" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.44/1.25 Fatal error: exception Failure("undefined enum value")
% 1.44/1.25 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_zdn4j3gg/wvx1t_g1 2>> /export/starexec/sandbox/tmp/iprover_out_zdn4j3gg/wvx1t_g1_error
% 1.44/1.25 % SZS status Theorem for theBenchmark.p
% 1.44/1.25
% 1.44/1.25 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.44/1.25
% 1.44/1.25 % ------ iProver source info
% 1.44/1.25
% 1.44/1.25 % git: date: 2026-07-19 20:42:38 +0200
% 1.44/1.25 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.44/1.25 % git: non_committed_changes: false
% 1.44/1.25
% 1.44/1.25 % ------ Parsing...
% 1.44/1.25 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.44/1.25
% 1.44/1.25 % ------ Preprocessing...%
% 1.44/1.25
% 1.44/1.25 % SZS status Theorem for theBenchmark.p
% 1.44/1.25
% 1.44/1.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.44/1.25
% 1.44/1.25
%------------------------------------------------------------------------------