%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWX084_1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n019.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 03:32:39 PM UTC 2026
% Result : Theorem 1.31s 6.17s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 49 ( 21 ~; 12 |; 9 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 112 ( 32 atm; 0 fun; 32 num; 48 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 : 13 ( 9 usr; 3 prp; 0-4 aty)
% Number of functors : 22 ( 21 usr; 3 con; 0-4 aty)
% Number of variables : 48 ( 0 sgn 30 !; 18 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
f__integer__: $int > general ).
tff(pred_def_1,type,
p__is_integer__: general > $o ).
tff(pred_def_2,type,
p__is_symbolic__: general > $o ).
tff(pred_def_3,type,
p__less_equal__: ( general * general ) > $o ).
tff(pred_def_4,type,
p__less__: ( general * general ) > $o ).
tff(pred_def_5,type,
p__greater_equal__: ( general * general ) > $o ).
tff(pred_def_6,type,
p__greater__: ( general * general ) > $o ).
tff(pred_def_8,type,
div: ( general * ( general * ( general * general ) ) ) > $o ).
tff(func_def_10,type,
sK0: general > $int ).
tff(func_def_11,type,
sK1: general > symbol ).
tff(func_def_12,type,
sK2: ( general * ( general * ( general * general ) ) ) > general ).
tff(func_def_13,type,
sK3: ( general * ( general * ( general * general ) ) ) > general ).
tff(func_def_14,type,
sK4: ( general * ( general * ( general * general ) ) ) > general ).
tff(func_def_15,type,
sK5: ( general * ( general * ( general * general ) ) ) > general ).
tff(func_def_16,type,
sK6: ( general * ( general * ( general * general ) ) ) > general ).
tff(func_def_17,type,
sK7: ( general * ( general * ( general * general ) ) ) > general ).
tff(func_def_18,type,
sK8: ( general * ( general * ( general * general ) ) ) > $int ).
tff(func_def_19,type,
sK9: ( general * ( general * ( general * general ) ) ) > $int ).
tff(func_def_20,type,
sK10: ( general * ( general * ( general * general ) ) ) > $int ).
tff(func_def_21,type,
sK11: ( general * ( general * ( general * general ) ) ) > $int ).
tff(func_def_22,type,
sK12: ( general * ( general * ( general * general ) ) ) > general ).
tff(func_def_23,type,
sK13: ( general * ( general * ( general * general ) ) ) > general ).
tff(func_def_24,type,
sK14: ( general * ( general * ( general * general ) ) ) > general ).
tff(func_def_25,type,
sK15: ( general * ( general * ( general * general ) ) ) > general ).
tff(func_def_26,type,
sK16: ( $int * $int ) > $int ).
tff(func_def_27,type,
sK17: ( $int * $int ) > $int ).
tff(func_def_28,type,
sK18: $int ).
tff(func_def_29,type,
sK19: $int ).
tff(f19,axiom,
! [X0: $int,X1: $int] :
( $greatereq(X1,0)
=> ( $greater(X0,0)
=> ? [X2: $int,X3: $int] : div(f__integer__(X1),f__integer__(X0),f__integer__(X2),f__integer__(X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_3_unnamed_formula) ).
tff(f20,conjecture,
! [X0: $int,X1: $int] :
( ( $greater(X1,0)
& $greatereq(X0,0) )
=> ? [X2: $int,X3: $int] : div(f__integer__(X0),f__integer__(X1),f__integer__(X2),f__integer__(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_4_unnamed_formula) ).
tff(f21,negated_conjecture,
~ ! [X0: $int,X1: $int] :
( ( $greater(X1,0)
& $greatereq(X0,0) )
=> ? [X2: $int,X3: $int] : div(f__integer__(X0),f__integer__(X1),f__integer__(X2),f__integer__(X3)) ),
inference(negated_conjecture,[status(cth)],[f20]) ).
tff(f25,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,0)
=> ( $less(0,X0)
=> ? [X2: $int,X3: $int] : div(f__integer__(X1),f__integer__(X0),f__integer__(X2),f__integer__(X3)) ) ),
inference(theory_normalization,[],[f19]) ).
tff(f26,plain,
~ ! [X0: $int,X1: $int] :
( ( $less(0,X1)
& ~ $less(X0,0) )
=> ? [X2: $int,X3: $int] : div(f__integer__(X0),f__integer__(X1),f__integer__(X2),f__integer__(X3)) ),
inference(theory_normalization,[],[f21]) ).
tff(f57,plain,
! [X0: $int,X1: $int] :
( $less(X1,0)
| ~ $less(0,X0)
| ? [X2: $int,X3: $int] : div(f__integer__(X1),f__integer__(X0),f__integer__(X2),f__integer__(X3)) ),
inference(ennf_transformation,[],[f25]) ).
tff(f58,plain,
! [X0: $int,X1: $int] :
( $less(X1,0)
| ~ $less(0,X0)
| ? [X2: $int,X3: $int] : div(f__integer__(X1),f__integer__(X0),f__integer__(X2),f__integer__(X3)) ),
inference(flattening,[],[f57]) ).
tff(f59,plain,
? [X0: $int,X1: $int] :
( $less(0,X1)
& ~ $less(X0,0)
& ! [X2: $int,X3: $int] : ~ div(f__integer__(X0),f__integer__(X1),f__integer__(X2),f__integer__(X3)) ),
inference(ennf_transformation,[],[f26]) ).
tff(f60,plain,
? [X0: $int,X1: $int] :
( $less(0,X1)
& ~ $less(X0,0)
& ! [X2: $int,X3: $int] : ~ div(f__integer__(X0),f__integer__(X1),f__integer__(X2),f__integer__(X3)) ),
inference(flattening,[],[f59]) ).
tff(f71,plain,
! [X0: $int,X1: $int] :
( $less(X1,0)
| ~ $less(0,X0)
| div(f__integer__(X1),f__integer__(X0),f__integer__(sK16(X0,X1)),f__integer__(sK17(X0,X1))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16,sK17]),skolemize(X2,sK16(X0,X1)),skolemize(X3,sK17(X0,X1))],[f58]) ).
tff(f72,plain,
( $less(0,sK19)
& ~ $less(sK18,0)
& ! [X2: $int,X3: $int] : ~ div(f__integer__(sK18),f__integer__(sK19),f__integer__(X2),f__integer__(X3)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK18,sK19]),skolemize(X0,sK18),skolemize(X1,sK19)],[f60]) ).
tff(f111,plain,
! [X0: $int,X1: $int] :
( $less(X1,0)
| ~ $less(0,X0)
| div(f__integer__(X1),f__integer__(X0),f__integer__(sK16(X0,X1)),f__integer__(sK17(X0,X1))) ),
inference(cnf_transformation,[],[f71]) ).
tff(f112,plain,
$less(0,sK19),
inference(cnf_transformation,[],[f72]) ).
tff(f113,plain,
~ $less(sK18,0),
inference(cnf_transformation,[],[f72]) ).
tff(f114,plain,
! [X2: $int,X3: $int] : ~ div(f__integer__(sK18),f__integer__(sK19),f__integer__(X2),f__integer__(X3)),
inference(cnf_transformation,[],[f72]) ).
tcf(c_103,plain,
! [X0_int: $int,X1_int: $int] :
( $less(X1_int,0)
| div(f__integer__(X1_int),f__integer__(X0_int),f__integer__(sK16(X0_int,X1_int)),f__integer__(sK17(X0_int,X1_int)))
| ~ $less(0,X0_int) ),
inference(cnf_transformation,[],[f111]) ).
tcf(c_104,negated_conjecture,
! [X0_int: $int,X1_int: $int] : ~ div(f__integer__(sK18),f__integer__(sK19),f__integer__(X0_int),f__integer__(X1_int)),
inference(cnf_transformation,[],[f114]) ).
tcf(c_105,negated_conjecture,
~ $less(sK18,0),
inference(cnf_transformation,[],[f113]) ).
tcf(c_106,negated_conjecture,
$less(0,sK19),
inference(cnf_transformation,[],[f112]) ).
tcf(c_177,plain,
~ div(f__integer__(sK18),f__integer__(sK19),f__integer__(sK16(sK19,sK18)),f__integer__(sK17(sK19,sK18))),
inference(instantiation,[status(thm)],[c_104]) ).
tcf(c_184,plain,
( $less(sK18,0)
| div(f__integer__(sK18),f__integer__(sK19),f__integer__(sK16(sK19,sK18)),f__integer__(sK17(sK19,sK18)))
| ~ $less(0,sK19) ),
inference(instantiation,[status(thm)],[c_103]) ).
tcf(c_185,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_184,c_177,c_105,c_106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX084_1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/5.37 % Computer : n019.cluster.edu
% 0.08/5.37 % Model : x86_64 x86_64
% 0.08/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.37 % Memory : 8046.5625MB
% 0.08/5.37 % OS : Linux 6.8.0-71-generic
% 0.08/5.37 % CPULimit : 300
% 0.08/5.37 % WCLimit : 300
% 0.08/5.37 % DateTime : Thu Sep 24 23:24:55 UTC 2026
% 0.08/5.37 % CPUTime :
% 0.08/5.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/5.41 Running TFA theorem proving
% 0.12/5.41 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.12/5.42
% 0.12/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/5.42
% 0.12/5.42 % Detected problem language: tptp
% 0.12/5.43 % Proving...
% 1.31/6.17 % SZS status Started for theBenchmark.p
% 1.31/6.17 ERROR - "ProverProcess:heur/schedule_none:304.9999792575836" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.31/6.17 Fatal error: exception Failure("undefined enum value")
% 1.31/6.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/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_fx_y8dw3/1b04rerb 2>> /export/starexec/sandbox/tmp/iprover_out_fx_y8dw3/1b04rerb_error
% 1.31/6.17 ERROR - "ProverProcess:heur/vip_65520:11.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.31/6.17 Fatal error: exception Failure("undefined enum value")
% 1.31/6.17 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_mode time_based --comb_res_mult 6 --comb_sup_deep_mult 0 --comb_sup_mult 6 --conj_cone_tolerance 1.8969679945890683 --demod_completeness_check fullold --demod_use_ground false --extra_neg_conj all_neg --instantiation_flag false --out_options none --preprocessed_out false --preprocessing_flag false --prolific_symb_bound 1024 --proof_out true --prop_solver_per_cl 512 --res_to_smt_solver false --resolution_flag true --schedule none --share_sel_clauses true --stats_out none --subs_bck_mult 16 --sup_bw_gjoin_interval 100 --sup_cache_sim none --sup_full_bw "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_full_fixpoint false --sup_full_fw "[]" --sup_fun_splitting false --sup_immed_bw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes;FullSubsAndRes;Demod;ACDemod]" --sup_immed_fixpoint false --sup_immed_fw_immed "[Subsumption;SubsumptionRes;FullSubsAndRes;Demod;LightNorm;ACDemod]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;FullSubsAndRes;Demod;LightNorm;ACNormalisation;GroundJoinability;Connectedness]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_fixpoint false --sup_main_fixpoint true --sup_ordering lpo --sup_passive_queue_type priority_queues --sup_passive_queues "[[+has_eq;-has_eq];[-num_var;-num_var];[+conj_dist;+ground;-max_atom_input_occur]]" --sup_passive_queues_freq "[1;4;4]" --sup_prop_simpl_given false --sup_prop_simpl_new false --sup_score sim_d_gen --sup_share_max_num_cl 10 --sup_share_score_frac 0.2 --sup_smt_interval 32 --sup_symb_ordering invfreq_arity --sup_term_weight default --sup_to_prop_solver passive --sup_unprocessed_bound 10 --superposition_flag true --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 3.67 --show_fool true" --time_out_real 11.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_fx_y8dw3/a5etcfec 2>> /export/starexec/sandbox/tmp/iprover_out_fx_y8dw3/a5etcfec_error
% 1.31/6.17 ERROR - "ProverProcess:heur/vip_65097:3.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.31/6.17 Fatal error: exception Failure("undefined enum value")
% 1.31/6.17 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 3 --comb_sup_deep_mult 0 --comb_sup_mult 0 --conj_cone_tolerance 4.0357851670394345 --extra_neg_conj none --inst_activity_threshold 512 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp true --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 2048 --inst_lit_activity_flag true --inst_lit_sel "[+split;-sign;-depth]" --inst_lit_sel_side none --inst_orphan_elimination true --inst_passive_queue_type queue --inst_passive_queues "[[+age;+num_lits;-age];[-age;-min_def_symb;+bc_imp_inh]]" --inst_passive_queues_freq "[2;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given true --inst_sel_renew solver --inst_solver_calls_frac 1.0 --inst_solver_per_active 1024 --inst_sos_flag true --inst_sos_phase false --inst_sos_sth_lit_sel "[+split;-ground;-depth]" --inst_start_prop_sim_after_learn 3 --inst_subs_given true --inst_subs_new false --instantiation_flag true --out_options none --prep_sup_sim_all true --prep_sup_sim_sup false --preprocessed_out false --preprocessing_flag true --prolific_symb_bound 256 --proof_out true --prop_solver_per_cl 16384 --resolution_flag true --schedule none --share_sel_clauses false --stats_out none --subs_bck_mult 8 --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 1.00 --show_fool true" --time_out_real 3.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_fx_y8dw3/tgxklj4i 2>> /export/starexec/sandbox/tmp/iprover_out_fx_y8dw3/tgxklj4i_error
% 1.31/6.17 ERROR - "ProverProcess:heur/vip_65080:40.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.31/6.17 Fatal error: exception Failure("undefined enum value")
% 1.31/6.17 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_mode time_based --comb_res_mult 6 --comb_sup_deep_mult 4 --comb_sup_mult 6 --conj_cone_tolerance 1.895766803319499 --demod_completeness_check fullold --demod_use_ground false --extra_neg_conj all_pos_neg --instantiation_flag false --out_options none --preprocessed_out false --preprocessing_flag false --prolific_symb_bound 1024 --proof_out true --prop_solver_per_cl 128 --res_to_smt_solver false --resolution_flag true --schedule none --share_sel_clauses true --stats_out none --subs_bck_mult 16 --sup_bw_gjoin_interval 100 --sup_cache_sim none --sup_full_bw "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_full_fixpoint false --sup_full_fw "[]" --sup_fun_splitting false --sup_immed_bw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes;FullSubsAndRes;Demod;ACDemod]" --sup_immed_fixpoint false --sup_immed_fw_immed "[Subsumption;SubsumptionRes;FullSubsAndRes;Demod;LightNorm;ACDemod]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;FullSubsAndRes;Demod;LightNorm;ACNormalisation;GroundJoinability;Connectedness]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_fixpoint false --sup_iter_deepening 2 --sup_main_fixpoint true --sup_ordering lpo --sup_passive_queue_type priority_queues --sup_passive_queues "[[+has_eq;-has_eq];[-num_var;-num_var];[+conj_dist;+ground;-max_atom_input_occur]]" --sup_passive_queues_freq "[1;4;4]" --sup_prop_simpl_given false --sup_prop_simpl_new false --sup_restarts_mult 4 --sup_score sim_d_gen --sup_share_max_num_cl 10 --sup_share_score_frac 0.2 --sup_smt_interval 32 --sup_symb_ordering invfreq_arity --sup_term_weight default --sup_to_prop_solver passive --sup_unprocessed_bound 10 --superposition_flag true --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 13.33 --show_fool true" --time_out_real 40.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_fx_y8dw3/kul7bahv 2>> /export/starexec/sandbox/tmp/iprover_out_fx_y8dw3/kul7bahv_error
% 1.31/6.17 % SZS status Theorem for theBenchmark.p
% 1.31/6.17
% 1.31/6.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.31/6.17
% 1.31/6.17 % ------ iProver source info
% 1.31/6.17
% 1.31/6.17 % git: date: 2026-07-19 20:42:38 +0200
% 1.31/6.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.31/6.17 % git: non_committed_changes: false
% 1.31/6.17
% 1.31/6.17 % ------ Parsing...
% 1.31/6.17 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.31/6.17 % ------ Proving...
% 1.31/6.17 % ------ Problem Properties
% 1.31/6.17
% 1.31/6.17 %
% 1.31/6.17 % clauses 59
% 1.31/6.17 % conjectures 3
% 1.31/6.17 % EPR 13
% 1.31/6.17 % Horn 51
% 1.31/6.17 % unary 20
% 1.31/6.17 % binary 29
% 1.31/6.17 % lits 109
% 1.31/6.17 % lits eq 40
% 1.31/6.17 % fd_pure 0
% 1.31/6.17 % fd_pseudo 0
% 1.31/6.17 % fd_cond 1
% 1.31/6.17 % fd_pseudo_cond 6
% 1.31/6.17 % AC symbols 2
% 1.31/6.17
% 1.31/6.17 % ------ Input Options Time Limit: Unbounded
% 1.31/6.17
% 1.31/6.17
% 1.31/6.17 % ------
% 1.31/6.17 % Current options:
% 1.31/6.17 % ------
% 1.31/6.17
% 1.31/6.17
% 1.31/6.17 %
% 1.31/6.17
% 1.31/6.17 % ------ Proving...
% 1.31/6.17 %
% 1.31/6.17
% 1.31/6.17 % SZS status Theorem for theBenchmark.p
% 1.31/6.17
% 1.31/6.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.31/6.17
% 1.31/6.17
%------------------------------------------------------------------------------