0.00/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : python3 prover_driver.py --schedule_mode external --schedule tfa_schedule --no_cores 8 --problem_version tff /export/starexec/sandbox2/benchmark/theBenchmark.p 120 --prover /export/starexec/sandbox2/solver/bin/res/iproveropt_z3 0.13/0.34 % Computer : n007.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Aug 9 01:52:12 EDT 2022 0.13/0.34 % CPUTime : 2.95/1.50 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p 2.95/1.50 2.95/1.50 %---------------- iProver v3.6 (pre CASC-J11 2022) ----------------% 2.95/1.50 2.95/1.50 ------ iProver source info 2.95/1.50 2.95/1.50 git: date: 2022-07-26 19:47:37 +0300 2.95/1.50 git: sha1: 69e283425f6c8ae3fb9e67f2058d741e849b12e1 2.95/1.50 git: non_committed_changes: false 2.95/1.50 git: last_make_outside_of_git: false 2.95/1.50 2.95/1.50 ------ Parsing... 2.95/1.50 ------ Clausification by vclausify_rel & Parsing by iProver... 2.95/1.50 2.95/1.50 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e 2.95/1.50 2.95/1.50 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 2.95/1.50 2.95/1.50 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 2.95/1.50 ------ Proving... 2.95/1.50 ------ Problem Properties 2.95/1.50 2.95/1.50 2.95/1.50 clauses 19 2.95/1.50 conjectures 6 2.95/1.50 EPR 4 2.95/1.50 Horn 16 2.95/1.50 unary 12 2.95/1.50 binary 5 2.95/1.50 lits 28 2.95/1.50 lits eq 10 2.95/1.50 fd_pure 0 2.95/1.50 fd_pseudo 0 2.95/1.50 fd_cond 0 2.95/1.50 fd_pseudo_cond 1 2.95/1.50 AC symbols 1 2.95/1.50 2.95/1.50 ------ Input Options Time Limit: Unbounded 2.95/1.50 2.95/1.50 2.95/1.50 ------ 2.95/1.50 Current options: 2.95/1.50 ------ 2.95/1.50 2.95/1.50 ------ Input Options 2.95/1.50 2.95/1.50 --out_options all 2.95/1.50 --tptp_safe_out true 2.95/1.50 --problem_path "" 2.95/1.50 --include_path "" 2.95/1.50 --clausifier res/vclausify_rel 2.95/1.50 --clausifier_options --mode tclausify -t 124.99997019767761 --show_fool true 2.95/1.50 --stdin false 2.95/1.50 --suppress_sat_res false 2.95/1.50 --suppress_unsat_res false 2.95/1.50 --stats_out none 2.95/1.50 --stats_mem false 2.95/1.50 --theory_stats_out false 2.95/1.50 2.95/1.50 ------ General Options 2.95/1.50 2.95/1.50 --fof false 2.95/1.50 --time_out_real 125. 2.95/1.50 --time_out_virtual -1. 2.95/1.50 --rnd_seed 13 2.95/1.50 --symbol_type_check false 2.95/1.50 --clausify_out false 2.95/1.50 --sig_cnt_out false 2.95/1.50 --trig_cnt_out false 2.95/1.50 --trig_cnt_out_tolerance 1. 2.95/1.50 --trig_cnt_out_sk_spl false 2.95/1.50 --abstr_cl_out false 2.95/1.50 2.95/1.50 ------ Global Options 2.95/1.50 2.95/1.50 --schedule none 2.95/1.50 --add_important_lit false 2.95/1.50 --prop_solver_per_cl 500 2.95/1.50 --subs_bck_mult 8 2.95/1.50 --min_unsat_core false 2.95/1.50 --soft_assumptions false 2.95/1.50 --soft_lemma_size 3 2.95/1.50 --prop_impl_unit_size 0 2.95/1.50 --prop_impl_unit [] 2.95/1.50 --share_sel_clauses true 2.95/1.50 --reset_solvers false 2.95/1.50 --bc_imp_inh [conj_cone] 2.95/1.50 --conj_cone_tolerance 3. 2.95/1.50 --extra_neg_conj none 2.95/1.50 --large_theory_mode true 2.95/1.50 --prolific_symb_bound 200 2.95/1.50 --lt_threshold 2000 2.95/1.50 --clause_weak_htbl true 2.95/1.50 --gc_record_bc_elim false 2.95/1.50 2.95/1.50 ------ Preprocessing Options 2.95/1.50 2.95/1.50 --preprocessing_flag true 2.95/1.50 --time_out_prep_mult 0.1 2.95/1.50 --splitting_mode input 2.95/1.50 --splitting_grd true 2.95/1.50 --splitting_cvd false 2.95/1.50 --splitting_cvd_svl false 2.95/1.50 --splitting_nvd 32 2.95/1.50 --sub_typing false 2.95/1.50 --prep_gs_sim true 2.95/1.50 --prep_unflatten true 2.95/1.50 --prep_res_sim true 2.95/1.50 --prep_sup_sim_all true 2.95/1.50 --prep_sup_sim_sup false 2.95/1.50 --prep_upred true 2.95/1.50 --prep_well_definedness true 2.95/1.50 --prep_sem_filter exhaustive 2.95/1.50 --prep_sem_filter_out false 2.95/1.50 --pred_elim true 2.95/1.50 --res_sim_input true 2.95/1.50 --eq_ax_congr_red true 2.95/1.50 --pure_diseq_elim true 2.95/1.50 --brand_transform false 2.95/1.50 --non_eq_to_eq false 2.95/1.50 --prep_def_merge true 2.95/1.50 --prep_def_merge_prop_impl false 2.95/1.50 --prep_def_merge_mbd true 2.95/1.50 --prep_def_merge_tr_red false 2.95/1.50 --prep_def_merge_tr_cl false 2.95/1.50 --smt_preprocessing false 2.95/1.50 --smt_ac_axioms fast 2.95/1.50 --preprocessed_out false 2.95/1.50 --preprocessed_stats false 2.95/1.50 2.95/1.50 ------ Abstraction refinement Options 2.95/1.50 2.95/1.50 --abstr_ref [] 2.95/1.50 --abstr_ref_prep false 2.95/1.50 --abstr_ref_until_sat false 2.95/1.50 --abstr_ref_sig_restrict funpre 2.95/1.50 --abstr_ref_af_restrict_to_split_sk false 2.95/1.50 --abstr_ref_under [] 2.95/1.50 2.95/1.50 ------ SAT Options 2.95/1.50 2.95/1.50 --sat_mode false 2.95/1.50 --sat_fm_restart_options "" 2.95/1.50 --sat_gr_def false 2.95/1.50 --sat_epr_types true 2.95/1.50 --sat_non_cyclic_types false 2.95/1.50 --sat_finite_models false 2.95/1.50 --sat_fm_lemmas false 2.95/1.50 --sat_fm_prep false 2.95/1.50 --sat_fm_uc_incr true 2.95/1.50 --sat_out_model small 2.95/1.50 --sat_out_clauses false 2.95/1.50 2.95/1.50 ------ QBF Options 2.95/1.50 2.95/1.50 --qbf_mode false 2.95/1.50 --qbf_elim_univ false 2.95/1.50 --qbf_dom_inst none 2.95/1.50 --qbf_dom_pre_inst false 2.95/1.50 --qbf_sk_in false 2.95/1.50 --qbf_pred_elim true 2.95/1.50 --qbf_split 512 2.95/1.50 2.95/1.50 ------ BMC1 Options 2.95/1.50 2.95/1.50 --bmc1_incremental false 2.95/1.50 --bmc1_axioms reachable_all 2.95/1.50 --bmc1_min_bound 0 2.95/1.50 --bmc1_max_bound -1 2.95/1.50 --bmc1_max_bound_default -1 2.95/1.50 --bmc1_symbol_reachability true 2.95/1.50 --bmc1_property_lemmas false 2.95/1.50 --bmc1_k_induction false 2.95/1.50 --bmc1_non_equiv_states false 2.95/1.50 --bmc1_deadlock false 2.95/1.50 --bmc1_ucm false 2.95/1.50 --bmc1_add_unsat_core none 2.95/1.50 --bmc1_unsat_core_children false 2.95/1.50 --bmc1_unsat_core_extrapolate_axioms false 2.95/1.50 --bmc1_out_stat full 2.95/1.50 --bmc1_ground_init false 2.95/1.50 --bmc1_pre_inst_next_state false 2.95/1.50 --bmc1_pre_inst_state false 2.95/1.50 --bmc1_pre_inst_reach_state false 2.95/1.50 --bmc1_out_unsat_core false 2.95/1.50 --bmc1_aig_witness_out false 2.95/1.50 --bmc1_verbose false 2.95/1.50 --bmc1_dump_clauses_tptp false 2.95/1.50 --bmc1_dump_unsat_core_tptp false 2.95/1.50 --bmc1_dump_file - 2.95/1.50 --bmc1_ucm_expand_uc_limit 128 2.95/1.50 --bmc1_ucm_n_expand_iterations 6 2.95/1.50 --bmc1_ucm_extend_mode 1 2.95/1.50 --bmc1_ucm_init_mode 2 2.95/1.50 --bmc1_ucm_cone_mode none 2.95/1.50 --bmc1_ucm_reduced_relation_type 0 2.95/1.50 --bmc1_ucm_relax_model 4 2.95/1.50 --bmc1_ucm_full_tr_after_sat true 2.95/1.50 --bmc1_ucm_expand_neg_assumptions false 2.95/1.50 --bmc1_ucm_layered_model none 2.95/1.50 --bmc1_ucm_max_lemma_size 10 2.95/1.50 2.95/1.50 ------ AIG Options 2.95/1.50 2.95/1.50 --aig_mode false 2.95/1.50 2.95/1.50 ------ Instantiation Options 2.95/1.50 2.95/1.50 --instantiation_flag true 2.95/1.50 --inst_sos_flag false 2.95/1.50 --inst_sos_phase true 2.95/1.50 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 2.95/1.50 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 2.95/1.50 --inst_lit_sel_side num_symb 2.95/1.50 --inst_solver_per_active 1400 2.95/1.50 --inst_solver_calls_frac 1. 2.95/1.50 --inst_passive_queue_type priority_queues 2.95/1.50 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 2.95/1.50 --inst_passive_queues_freq [25;2] 2.95/1.50 --inst_dismatching true 2.95/1.50 --inst_eager_unprocessed_to_passive true 2.95/1.50 --inst_prop_sim_given true 2.95/1.50 --inst_prop_sim_new false 2.95/1.50 --inst_subs_new false 2.95/1.50 --inst_eq_res_simp false 2.95/1.50 --inst_subs_given false 2.95/1.50 --inst_orphan_elimination true 2.95/1.50 --inst_learning_loop_flag true 2.95/1.50 --inst_learning_start 3000 2.95/1.50 --inst_learning_factor 2 2.95/1.50 --inst_start_prop_sim_after_learn 3 2.95/1.50 --inst_sel_renew solver 2.95/1.50 --inst_lit_activity_flag true 2.95/1.50 --inst_restr_to_given false 2.95/1.50 --inst_activity_threshold 500 2.95/1.50 --inst_out_proof true 2.95/1.50 2.95/1.50 ------ Resolution Options 2.95/1.50 2.95/1.50 --resolution_flag true 2.95/1.50 --res_lit_sel adaptive 2.95/1.50 --res_lit_sel_side none 2.95/1.50 --res_ordering kbo 2.95/1.50 --res_to_prop_solver active 2.95/1.50 --res_prop_simpl_new false 2.95/1.50 --res_prop_simpl_given true 2.95/1.50 --res_passive_queue_type priority_queues 2.95/1.50 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 2.95/1.50 --res_passive_queues_freq [15;5] 2.95/1.50 --res_forward_subs full 2.95/1.50 --res_backward_subs full 2.95/1.50 --res_forward_subs_resolution true 2.95/1.50 --res_backward_subs_resolution true 2.95/1.50 --res_orphan_elimination true 2.95/1.50 --res_time_limit 300. 2.95/1.50 --res_out_proof true 2.95/1.50 2.95/1.50 ------ Superposition Options 2.95/1.50 2.95/1.50 --superposition_flag true 2.95/1.50 --sup_passive_queue_type priority_queues 2.95/1.50 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]] 2.95/1.50 --sup_passive_queues_freq [8;1;4;4] 2.95/1.50 --demod_completeness_check fast 2.95/1.50 --demod_use_ground true 2.95/1.50 --sup_to_prop_solver passive 2.95/1.50 --sup_prop_simpl_new true 2.95/1.50 --sup_prop_simpl_given true 2.95/1.50 --sup_fun_splitting false 2.95/1.50 --sup_iter_deepening 2 2.95/1.50 --sup_restarts_mult 12 2.95/1.50 --sup_score sim_d_gen 2.95/1.50 --sup_share_score_frac 0.2 2.95/1.50 --sup_share_max_num_cl 500 2.95/1.50 --sup_ordering kbo 2.95/1.50 --sup_symb_ordering invfreq 2.95/1.50 --sup_term_weight default 2.95/1.50 2.95/1.50 ------ Superposition Simplification Setup 2.95/1.50 2.95/1.50 --sup_indices_passive [] 2.95/1.50 --sup_full_triv [SMTSimplify;PropSubs] 2.95/1.50 --sup_full_fw [ACNormalisation;FwDemod;FwGroundJoinability;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes] 2.95/1.50 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 2.95/1.50 --sup_immed_triv [] 2.95/1.50 --sup_immed_fw_main [] 2.95/1.50 --sup_immed_fw_immed [] 2.95/1.50 --sup_immed_bw_main [] 2.95/1.50 --sup_immed_bw_immed [] 2.95/1.50 --sup_input_triv [] 2.95/1.50 --sup_input_fw [FwACDemod;ACNormalisation;FwDemod;FwGroundJoinability;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes] 2.95/1.50 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 2.95/1.50 --sup_full_fixpoint true 2.95/1.50 --sup_main_fixpoint true 2.95/1.50 --sup_immed_fixpoint false 2.95/1.50 --sup_input_fixpoint true 2.95/1.50 --sup_cache_sim none 2.95/1.50 --sup_smt_interval 500 2.95/1.50 --sup_bw_gjoin_interval 0 2.95/1.50 2.95/1.50 ------ Combination Options 2.95/1.50 2.95/1.50 --comb_mode clause_based 2.95/1.50 --comb_inst_mult 5 2.95/1.50 --comb_res_mult 1 2.95/1.50 --comb_sup_mult 8 2.95/1.50 --comb_sup_deep_mult 2 2.95/1.50 2.95/1.50 ------ Debug Options 2.95/1.50 2.95/1.50 --dbg_backtrace false 2.95/1.50 --dbg_dump_prop_clauses false 2.95/1.50 --dbg_dump_prop_clauses_file - 2.95/1.50 --dbg_out_stat false 2.95/1.50 --dbg_just_parse false 2.95/1.50 2.95/1.50 2.95/1.50 2.95/1.50 2.95/1.50 ------ Proving... 2.95/1.50 2.95/1.50 2.95/1.50 % SZS status Theorem for theBenchmark.p 2.95/1.50 2.95/1.50 % SZS output start CNFRefutation for theBenchmark.p 2.95/1.50 2.95/1.50 tff(f11,plain,( 2.95/1.50 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )), 2.95/1.50 introduced(theory_axiom_152,[])). 2.95/1.50 2.95/1.50 tff(f1,conjecture,( 2.95/1.50 (! [X0 : $int] : ($lesseq(0,g(X0)) & (g(X0) = $uminus(X0) | g(X0) = X0)) & ! [X0 : $int] : (($lesseq(f(X0),X0) | $lesseq(f(X0),$uminus(X0))) & $lesseq($uminus(X0),f(X0)) & $lesseq(X0,f(X0)))) => ! [X0 : $int] : f(X0) = g(X0)), 2.95/1.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absolute_value_defs)). 2.95/1.50 2.95/1.50 tff(f2,negated_conjecture,( 2.95/1.50 ~((! [X0 : $int] : ($lesseq(0,g(X0)) & (g(X0) = $uminus(X0) | g(X0) = X0)) & ! [X0 : $int] : (($lesseq(f(X0),X0) | $lesseq(f(X0),$uminus(X0))) & $lesseq($uminus(X0),f(X0)) & $lesseq(X0,f(X0)))) => ! [X0 : $int] : f(X0) = g(X0))), 2.95/1.50 inference(negated_conjecture,[],[f1])). 2.95/1.50 2.95/1.50 tff(f3,plain,( 2.95/1.50 ~((! [X0 : $int] : (~$less(g(X0),0) & (g(X0) = $uminus(X0) | g(X0) = X0)) & ! [X0 : $int] : ((~$less(X0,f(X0)) | ~$less($uminus(X0),f(X0))) & ~$less(f(X0),$uminus(X0)) & ~$less(f(X0),X0))) => ! [X0 : $int] : f(X0) = g(X0))), 2.95/1.50 inference(theory_normalization,[],[f2])). 2.95/1.50 2.95/1.50 tff(f16,plain,( 2.95/1.50 ~((! [X0 : $int] : (~$less(g(X0),0) & (g(X0) = $uminus(X0) | g(X0) = X0)) & ! [X1 : $int] : ((~$less(X1,f(X1)) | ~$less($uminus(X1),f(X1))) & ~$less(f(X1),$uminus(X1)) & ~$less(f(X1),X1))) => ! [X2 : $int] : f(X2) = g(X2))), 2.95/1.50 inference(rectify,[],[f3])). 2.95/1.50 2.95/1.50 tff(f17,plain,( 2.95/1.50 ? [X2 : $int] : f(X2) != g(X2) & (! [X0 : $int] : (~$less(g(X0),0) & (g(X0) = $uminus(X0) | g(X0) = X0)) & ! [X1 : $int] : ((~$less(X1,f(X1)) | ~$less($uminus(X1),f(X1))) & ~$less(f(X1),$uminus(X1)) & ~$less(f(X1),X1)))), 2.95/1.50 inference(ennf_transformation,[],[f16])). 2.95/1.50 2.95/1.50 tff(f18,plain,( 2.95/1.50 ? [X2 : $int] : f(X2) != g(X2) & ! [X0 : $int] : (~$less(g(X0),0) & (g(X0) = $uminus(X0) | g(X0) = X0)) & ! [X1 : $int] : ((~$less(X1,f(X1)) | ~$less($uminus(X1),f(X1))) & ~$less(f(X1),$uminus(X1)) & ~$less(f(X1),X1))), 2.95/1.50 inference(flattening,[],[f17])). 2.95/1.50 2.95/1.50 tff(f19,plain,( 2.95/1.50 ? [X0 : $int] : f(X0) != g(X0) & ! [X1 : $int] : (~$less(g(X1),0) & ($uminus(X1) = g(X1) | g(X1) = X1)) & ! [X2 : $int] : ((~$less(X2,f(X2)) | ~$less($uminus(X2),f(X2))) & ~$less(f(X2),$uminus(X2)) & ~$less(f(X2),X2))), 2.95/1.50 inference(rectify,[],[f18])). 2.95/1.50 2.95/1.50 tff(f20,plain,( 2.95/1.50 ? [X0 : $int] : f(X0) != g(X0) => f(sK0) != g(sK0)), 2.95/1.50 introduced(choice_axiom,[])). 2.95/1.50 2.95/1.50 tff(f21,plain,( 2.95/1.50 f(sK0) != g(sK0) & ! [X1 : $int] : (~$less(g(X1),0) & ($uminus(X1) = g(X1) | g(X1) = X1)) & ! [X2 : $int] : ((~$less(X2,f(X2)) | ~$less($uminus(X2),f(X2))) & ~$less(f(X2),$uminus(X2)) & ~$less(f(X2),X2))), 2.95/1.50 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f19,f20])). 2.95/1.50 2.95/1.50 tff(f22,plain,( 2.95/1.50 ( ! [X2 : $int] : (~$less(f(X2),X2)) )), 2.95/1.50 inference(cnf_transformation,[],[f21])). 2.95/1.50 2.95/1.50 tff(f23,plain,( 2.95/1.50 ( ! [X2 : $int] : (~$less(f(X2),$uminus(X2))) )), 2.95/1.50 inference(cnf_transformation,[],[f21])). 2.95/1.50 2.95/1.50 tff(f24,plain,( 2.95/1.50 ( ! [X2 : $int] : (~$less(X2,f(X2)) | ~$less($uminus(X2),f(X2))) )), 2.95/1.50 inference(cnf_transformation,[],[f21])). 2.95/1.50 2.95/1.50 tff(f25,plain,( 2.95/1.50 ( ! [X1 : $int] : ($uminus(X1) = g(X1) | g(X1) = X1) )), 2.95/1.50 inference(cnf_transformation,[],[f21])). 2.95/1.50 2.95/1.50 tff(f27,plain,( 2.95/1.50 f(sK0) != g(sK0)), 2.95/1.50 inference(cnf_transformation,[],[f21])). 2.95/1.50 2.95/1.50 tff(f26,plain,( 2.95/1.50 ( ! [X1 : $int] : (~$less(g(X1),0)) )), 2.95/1.50 inference(cnf_transformation,[],[f21])). 2.95/1.50 2.95/1.50 cnf(c_53,plain, 2.95/1.50 ( X0_3 = X1_3 | $less_int(X0_3,X1_3) | $less_int(X1_3,X0_3) ), 2.95/1.50 inference(cnf_transformation,[],[f11]) ). 2.95/1.50 2.95/1.50 cnf(c_66,negated_conjecture, 2.95/1.50 ( ~ $less_int(f(X0_3),X0_3) ), 2.95/1.50 inference(cnf_transformation,[],[f22]) ). 2.95/1.50 2.95/1.50 cnf(c_684,plain, 2.95/1.50 ( f(X0_3) = X0_3 | $less_int(X0_3,f(X0_3)) ), 2.95/1.50 inference(superposition,[status(thm)],[c_53,c_66]) ). 2.95/1.50 2.95/1.50 cnf(c_65,negated_conjecture, 2.95/1.50 ( ~ $less_int(f(X0_3),$uminus_int(X0_3)) ), 2.95/1.50 inference(cnf_transformation,[],[f23]) ). 2.95/1.50 2.95/1.50 cnf(c_683,plain, 2.95/1.50 ( $uminus_int(X0_3) = f(X0_3) 2.95/1.50 | $less_int($uminus_int(X0_3),f(X0_3)) ), 2.95/1.50 inference(superposition,[status(thm)],[c_53,c_65]) ). 2.95/1.50 2.95/1.50 cnf(c_64,negated_conjecture, 2.95/1.50 ( ~ $less_int($uminus_int(X0_3),f(X0_3)) 2.95/1.50 | ~ $less_int(X0_3,f(X0_3)) ), 2.95/1.50 inference(cnf_transformation,[],[f24]) ). 2.95/1.50 2.95/1.50 cnf(c_754,plain, 2.95/1.50 ( ~ $less_int(X0_3,f(X0_3)) | $uminus_int(X0_3) = f(X0_3) ), 2.95/1.50 inference(superposition,[status(thm)],[c_683,c_64]) ). 2.95/1.50 2.95/1.50 cnf(c_765,plain, 2.95/1.50 ( $uminus_int(X0_3) = f(X0_3) | f(X0_3) = X0_3 ), 2.95/1.50 inference(superposition,[status(thm)],[c_684,c_754]) ). 2.95/1.50 2.95/1.50 cnf(c_63,negated_conjecture, 2.95/1.50 ( $uminus_int(X0_3) = g(X0_3) | g(X0_3) = X0_3 ), 2.95/1.50 inference(cnf_transformation,[],[f25]) ). 2.95/1.50 2.95/1.50 cnf(c_61,negated_conjecture, 2.95/1.50 ( f(sK0) != g(sK0) ), 2.95/1.50 inference(cnf_transformation,[],[f27]) ). 2.95/1.50 2.95/1.50 cnf(c_555,plain, 2.95/1.50 ( $uminus_int(sK0) != f(sK0) | g(sK0) = sK0 ), 2.95/1.50 inference(superposition,[status(thm)],[c_63,c_61]) ). 2.95/1.50 2.95/1.50 cnf(c_2557,plain, 2.95/1.50 ( f(sK0) = sK0 | g(sK0) = sK0 ), 2.95/1.50 inference(superposition,[status(thm)],[c_765,c_555]) ). 2.95/1.50 2.95/1.50 cnf(c_2563,plain, 2.95/1.50 ( f(X0_3) = X0_3 | $less_int(X0_3,$uminus_int(X0_3)) ), 2.95/1.50 inference(superposition,[status(thm)],[c_765,c_684]) ). 2.95/1.50 2.95/1.50 cnf(c_2866,plain, 2.95/1.50 ( f(X0_3) = X0_3 | $less_int(X0_3,0) ), 2.95/1.50 inference(smt_theory_normalisation,[status(thm)],[c_2563]) ). 2.95/1.50 2.95/1.50 cnf(c_62,negated_conjecture, 2.95/1.50 ( ~ $less_int(g(X0_3),0) ), 2.95/1.50 inference(cnf_transformation,[],[f26]) ). 2.95/1.50 2.95/1.50 cnf(c_2873,plain, 2.95/1.50 ( f(g(X0_3)) = g(X0_3) ), 2.95/1.50 inference(superposition,[status(thm)],[c_2866,c_62]) ). 2.95/1.50 2.95/1.50 cnf(c_5111,plain, 2.95/1.50 ( f(sK0) = sK0 ), 2.95/1.50 inference(superposition,[status(thm)],[c_2557,c_2873]) ). 2.95/1.50 2.95/1.50 cnf(c_5136,plain, 2.95/1.50 ( ~ $less_int(sK0,$uminus_int(sK0)) ), 2.95/1.50 inference(superposition,[status(thm)],[c_5111,c_65]) ). 2.95/1.50 2.95/1.50 cnf(c_5170,plain, 2.95/1.50 ( ~ $less_int(sK0,0) ), 2.95/1.50 inference(smt_theory_normalisation,[status(thm)],[c_5136]) ). 2.95/1.50 2.95/1.50 cnf(c_5171,plain, 2.95/1.50 ( sK0 = 0 | $less_int(0,sK0) ), 2.95/1.50 inference(superposition,[status(thm)],[c_53,c_5170]) ). 2.95/1.50 2.95/1.50 cnf(c_222,plain, 2.95/1.50 ( X0_3 != X1_3 | X2_3 != X1_3 | X2_3 = X0_3 ), 2.95/1.50 theory(equality) ). 2.95/1.50 2.95/1.50 cnf(c_757,plain, 2.95/1.50 ( f(sK0) != X0_3 | g(sK0) != X0_3 | f(sK0) = g(sK0) ), 2.95/1.50 inference(instantiation,[status(thm)],[c_222]) ). 2.95/1.50 2.95/1.50 cnf(c_840,plain, 2.95/1.50 ( f(sK0) != f(sK0) | g(sK0) != f(sK0) | f(sK0) = g(sK0) ), 2.95/1.50 inference(instantiation,[status(thm)],[c_757]) ). 2.95/1.50 2.95/1.50 cnf(c_221,plain,( X0_3 = X0_3 ),theory(equality) ). 2.95/1.50 2.95/1.50 cnf(c_841,plain, 2.95/1.50 ( f(sK0) = f(sK0) ), 2.95/1.50 inference(instantiation,[status(thm)],[c_221]) ). 2.95/1.50 2.95/1.50 cnf(c_919,plain, 2.95/1.50 ( f(sK0) != X0_3 | g(sK0) != X0_3 | g(sK0) = f(sK0) ), 2.95/1.50 inference(instantiation,[status(thm)],[c_222]) ). 2.95/1.50 2.95/1.50 cnf(c_920,plain, 2.95/1.50 ( f(sK0) != 0 | g(sK0) != 0 | g(sK0) = f(sK0) ), 2.95/1.50 inference(instantiation,[status(thm)],[c_919]) ). 2.95/1.50 2.95/1.50 cnf(c_923,plain, 2.95/1.50 ( f(sK0) != sK0 | g(sK0) != sK0 | f(sK0) = g(sK0) ), 2.95/1.50 inference(instantiation,[status(thm)],[c_757]) ). 2.95/1.50 2.95/1.50 cnf(c_4379,plain, 2.95/1.50 ( X0_3 = sK0 | $less_int(X0_3,sK0) | $less_int(sK0,X0_3) ), 2.95/1.50 inference(instantiation,[status(thm)],[c_53]) ). 2.95/1.50 2.95/1.50 cnf(c_4380,plain, 2.95/1.50 ( 0 = sK0 | $less_int(sK0,0) | $less_int(0,sK0) ), 2.95/1.50 inference(instantiation,[status(thm)],[c_4379]) ). 2.95/1.50 2.95/1.50 cnf(c_842,plain, 2.95/1.50 ( f(sK0) != X0_3 | X1_3 != X0_3 | f(sK0) = X1_3 ), 2.95/1.50 inference(instantiation,[status(thm)],[c_222]) ). 2.95/1.50 2.95/1.50 cnf(c_4916,plain, 2.95/1.50 ( f(sK0) != sK0 | X0_3 != sK0 | f(sK0) = X0_3 ), 2.95/1.50 inference(instantiation,[status(thm)],[c_842]) ). 2.95/1.50 2.95/1.50 cnf(c_4918,plain, 2.95/1.50 ( f(sK0) != sK0 | 0 != sK0 | f(sK0) = 0 ), 2.95/1.50 inference(instantiation,[status(thm)],[c_4916]) ). 2.95/1.50 2.95/1.50 cnf(c_681,plain, 2.95/1.50 ( g(X0_3) = 0 | $less_int(0,g(X0_3)) ), 2.95/1.50 inference(superposition,[status(thm)],[c_53,c_62]) ). 2.95/1.50 2.95/1.50 cnf(c_736,plain, 2.95/1.50 ( g(X0_3) = X0_3 | g(X0_3) = 0 | $less_int(0,$uminus_int(X0_3)) ), 2.95/1.50 inference(superposition,[status(thm)],[c_63,c_681]) ). 2.95/1.50 2.95/1.50 cnf(c_771,plain, 2.95/1.50 ( g(X0_3) = X0_3 | g(X0_3) = 0 | $less_int(X0_3,0) ), 2.95/1.50 inference(smt_theory_normalisation,[status(thm)],[c_736]) ). 2.95/1.50 2.95/1.50 cnf(c_5176,plain, 2.95/1.50 ( g(sK0) = sK0 | g(sK0) = 0 ), 2.95/1.50 inference(superposition,[status(thm)],[c_771,c_5170]) ). 2.95/1.50 2.95/1.50 cnf(c_5280,plain, 2.95/1.50 ( $less_int(0,sK0) ), 2.95/1.50 inference(global_propositional_subsumption, 2.95/1.50 [status(thm)], 2.95/1.50 [c_5171,c_61,c_840,c_841,c_920,c_923,c_4380,c_4918, 2.95/1.50 c_5111,c_5170,c_5176]) ). 2.95/1.50 2.95/1.50 cnf(c_556,plain, 2.95/1.50 ( ~ $less_int($uminus_int(X0_3),0) | g(X0_3) = X0_3 ), 2.95/1.50 inference(superposition,[status(thm)],[c_63,c_62]) ). 2.95/1.50 2.95/1.50 cnf(c_562,plain, 2.95/1.50 ( ~ $less_int(0,X0_3) | g(X0_3) = X0_3 ), 2.95/1.50 inference(smt_theory_normalisation,[status(thm)],[c_556]) ). 2.95/1.50 2.95/1.50 cnf(c_5285,plain, 2.95/1.50 ( g(sK0) = sK0 ), 2.95/1.50 inference(superposition,[status(thm)],[c_5280,c_562]) ). 2.95/1.50 2.95/1.50 cnf(contradiction,plain, 2.95/1.50 ( $false ), 2.95/1.50 inference(minisat,[status(thm)],[c_5285,c_5111,c_923,c_61]) ). 2.95/1.50 2.95/1.50 2.95/1.50 % SZS output end CNFRefutation for theBenchmark.p 2.95/1.50 2.95/1.50 2.95/1.53 EOF