%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM892_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 : n008.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:11 PM UTC 2026
% Result : Theorem 0.39s 1.17s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f16ERROR: Could not build tree for root c_173ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_1,type,
$bool: $tType ).
tff(func_def_4,type,
sK0: $int ).
tff(func_def_5,type,
sK1: $int ).
tff(f17,plain,
? [X0: $int,X1: $int] :
( ( ~ $less(X1,X0)
| ( X0 = X1 )
| $less(X0,X1) )
& ( $less(X1,X0)
| ( ( X0 != X1 )
& ~ $less(X0,X1) ) ) ),
inference(nnf_transformation,[],[f16]) ).
tff(f18,plain,
? [X0: $int,X1: $int] :
( ( ~ $less(X1,X0)
| ( X0 = X1 )
| $less(X0,X1) )
& ( $less(X1,X0)
| ( ( X0 != X1 )
& ~ $less(X0,X1) ) ) ),
inference(flattening,[],[f17]) ).
tff(f19,plain,
( ( ~ $less(sK1,sK0)
| ( sK0 = sK1 )
| $less(sK0,sK1) )
& ( $less(sK1,sK0)
| ( ( sK0 != sK1 )
& ~ $less(sK0,sK1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f18]) ).
tff(f20,plain,
( ~ $less(sK1,sK0)
| ( sK0 = sK1 )
| $less(sK0,sK1) ),
inference(cnf_transformation,[],[f19]) ).
tff(f22,plain,
( $less(sK1,sK0)
| ~ $less(sK0,sK1) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_50,negated_conjecture,
! [X0_int: $int] : $uminus($uminus(X0_int)) = X0_int,
inference(cnf_transformation,[],[f14]) ).
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,[],[f11]) ).
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_61,negated_conjecture,
( $less(sK1,sK0)
| ~ $less(sK0,sK1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_63,negated_conjecture,
( $less(sK0,sK1)
| ( sK0 = sK1 )
| ~ $less(sK1,sK0) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_64,plain,
$less(0,1),
theory(arith) ).
tcf(c_80,plain,
( $less(sK1,sK0)
| ~ $less(sK0,sK1) ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
tcf(c_158,plain,
( $less(sK0,sK1)
| ( sK0 = sK1 ) ),
inference(backward_subsumption_resolution,[status(thm)],[c_63,c_53]) ).
tcf(c_173,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_158,c_64,c_80,c_58,c_56,c_55,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM892_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.09/0.37 % Computer : n008.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 05:38:58 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.40 Running TFA theorem proving
% 0.09/0.40 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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 0.39/1.17 % SZS status Started for theBenchmark.p
% 0.39/1.17 ERROR - "ProverProcess:heur/schedule_none:304.99997901916504" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 0.39/1.17 Fatal error: exception Failure("undefined enum value")
% 0.39/1.17 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_pnj6po5t/vhj117_g 2>> /export/starexec/sandbox2/tmp/iprover_out_pnj6po5t/vhj117_g_error
% 0.39/1.17 % SZS status Theorem for theBenchmark.p
% 0.39/1.17
% 0.39/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.39/1.17
% 0.39/1.17 % ------ iProver source info
% 0.39/1.17
% 0.39/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 0.39/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.39/1.17 % git: non_committed_changes: false
% 0.39/1.17
% 0.39/1.17 % ------ Parsing...
% 0.39/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.39/1.17
% 0.39/1.17 % ------ Preprocessing...%
% 0.39/1.17
% 0.39/1.17 % SZS status Theorem for theBenchmark.p
% 0.39/1.17
% 0.39/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.39/1.17
% 0.39/1.17
%------------------------------------------------------------------------------