0.06/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : iproveropt_run.sh %d %s 0.13/0.33 % Computer : n016.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 960 0.13/0.33 % WCLimit : 120 0.13/0.33 % DateTime : Wed Jul 1 17:21:50 EDT 2020 0.13/0.33 % CPUTime : 0.13/0.33 % Running in FOF mode 2.70/0.99 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p 2.70/0.99 2.70/0.99 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 2.70/0.99 2.70/0.99 ------ iProver source info 2.70/0.99 2.70/0.99 git: date: 2020-06-30 10:37:57 +0100 2.70/0.99 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 2.70/0.99 git: non_committed_changes: false 2.70/0.99 git: last_make_outside_of_git: false 2.70/0.99 2.70/0.99 ------ 2.70/0.99 2.70/0.99 ------ Input Options 2.70/0.99 2.70/0.99 --out_options all 2.70/0.99 --tptp_safe_out true 2.70/0.99 --problem_path "" 2.70/0.99 --include_path "" 2.70/0.99 --clausifier res/vclausify_rel 2.70/0.99 --clausifier_options --mode clausify 2.70/0.99 --stdin false 2.70/0.99 --stats_out all 2.70/0.99 2.70/0.99 ------ General Options 2.70/0.99 2.70/0.99 --fof false 2.70/0.99 --time_out_real 125. 2.70/0.99 --time_out_virtual -1. 2.70/0.99 --symbol_type_check false 2.70/0.99 --clausify_out false 2.70/0.99 --sig_cnt_out false 2.70/0.99 --trig_cnt_out false 2.70/0.99 --trig_cnt_out_tolerance 1. 2.70/0.99 --trig_cnt_out_sk_spl false 2.70/0.99 --abstr_cl_out false 2.70/0.99 2.70/0.99 ------ Global Options 2.70/0.99 2.70/0.99 --schedule default 2.70/0.99 --add_important_lit false 2.70/0.99 --prop_solver_per_cl 1000 2.70/0.99 --min_unsat_core false 2.70/0.99 --soft_assumptions false 2.70/0.99 --soft_lemma_size 3 2.70/0.99 --prop_impl_unit_size 0 2.70/0.99 --prop_impl_unit [] 2.70/0.99 --share_sel_clauses true 2.70/0.99 --reset_solvers false 2.70/0.99 --bc_imp_inh [conj_cone] 2.70/0.99 --conj_cone_tolerance 3. 2.70/0.99 --extra_neg_conj none 2.70/0.99 --large_theory_mode true 2.70/0.99 --prolific_symb_bound 200 2.70/0.99 --lt_threshold 2000 2.70/0.99 --clause_weak_htbl true 2.70/0.99 --gc_record_bc_elim false 2.70/0.99 2.70/0.99 ------ Preprocessing Options 2.70/0.99 2.70/0.99 --preprocessing_flag true 2.70/0.99 --time_out_prep_mult 0.1 2.70/0.99 --splitting_mode input 2.70/0.99 --splitting_grd true 2.70/0.99 --splitting_cvd false 2.70/0.99 --splitting_cvd_svl false 2.70/0.99 --splitting_nvd 32 2.70/0.99 --sub_typing true 2.70/0.99 --prep_gs_sim true 2.70/0.99 --prep_unflatten true 2.70/0.99 --prep_res_sim true 2.70/0.99 --prep_upred true 2.70/0.99 --prep_sem_filter exhaustive 2.70/0.99 --prep_sem_filter_out false 2.70/0.99 --pred_elim true 2.70/0.99 --res_sim_input true 2.70/0.99 --eq_ax_congr_red true 2.70/0.99 --pure_diseq_elim true 2.70/0.99 --brand_transform false 2.70/0.99 --non_eq_to_eq false 2.70/0.99 --prep_def_merge true 2.70/0.99 --prep_def_merge_prop_impl false 2.70/0.99 --prep_def_merge_mbd true 2.70/0.99 --prep_def_merge_tr_red false 2.70/0.99 --prep_def_merge_tr_cl false 2.70/0.99 --smt_preprocessing true 2.70/0.99 --smt_ac_axioms fast 2.70/0.99 --preprocessed_out false 2.70/0.99 --preprocessed_stats false 2.70/0.99 2.70/0.99 ------ Abstraction refinement Options 2.70/0.99 2.70/0.99 --abstr_ref [] 2.70/0.99 --abstr_ref_prep false 2.70/0.99 --abstr_ref_until_sat false 2.70/0.99 --abstr_ref_sig_restrict funpre 2.70/0.99 --abstr_ref_af_restrict_to_split_sk false 2.70/0.99 --abstr_ref_under [] 2.70/0.99 2.70/0.99 ------ SAT Options 2.70/0.99 2.70/0.99 --sat_mode false 2.70/0.99 --sat_fm_restart_options "" 2.70/0.99 --sat_gr_def false 2.70/0.99 --sat_epr_types true 2.70/0.99 --sat_non_cyclic_types false 2.70/0.99 --sat_finite_models false 2.70/0.99 --sat_fm_lemmas false 2.70/0.99 --sat_fm_prep false 2.70/0.99 --sat_fm_uc_incr true 2.70/0.99 --sat_out_model small 2.70/0.99 --sat_out_clauses false 2.70/0.99 2.70/0.99 ------ QBF Options 2.70/0.99 2.70/0.99 --qbf_mode false 2.70/0.99 --qbf_elim_univ false 2.70/0.99 --qbf_dom_inst none 2.70/0.99 --qbf_dom_pre_inst false 2.70/0.99 --qbf_sk_in false 2.70/0.99 --qbf_pred_elim true 2.70/0.99 --qbf_split 512 2.70/0.99 2.70/0.99 ------ BMC1 Options 2.70/0.99 2.70/0.99 --bmc1_incremental false 2.70/0.99 --bmc1_axioms reachable_all 2.70/0.99 --bmc1_min_bound 0 2.70/0.99 --bmc1_max_bound -1 2.70/0.99 --bmc1_max_bound_default -1 2.70/0.99 --bmc1_symbol_reachability true 2.70/0.99 --bmc1_property_lemmas false 2.70/0.99 --bmc1_k_induction false 2.70/0.99 --bmc1_non_equiv_states false 2.70/0.99 --bmc1_deadlock false 2.70/0.99 --bmc1_ucm false 2.70/0.99 --bmc1_add_unsat_core none 2.70/0.99 --bmc1_unsat_core_children false 2.70/0.99 --bmc1_unsat_core_extrapolate_axioms false 2.70/0.99 --bmc1_out_stat full 2.70/0.99 --bmc1_ground_init false 2.70/0.99 --bmc1_pre_inst_next_state false 2.70/0.99 --bmc1_pre_inst_state false 2.70/0.99 --bmc1_pre_inst_reach_state false 2.70/0.99 --bmc1_out_unsat_core false 2.70/0.99 --bmc1_aig_witness_out false 2.70/0.99 --bmc1_verbose false 2.70/0.99 --bmc1_dump_clauses_tptp false 2.70/0.99 --bmc1_dump_unsat_core_tptp false 2.70/0.99 --bmc1_dump_file - 2.70/0.99 --bmc1_ucm_expand_uc_limit 128 2.70/0.99 --bmc1_ucm_n_expand_iterations 6 2.70/0.99 --bmc1_ucm_extend_mode 1 2.70/0.99 --bmc1_ucm_init_mode 2 2.70/0.99 --bmc1_ucm_cone_mode none 2.70/0.99 --bmc1_ucm_reduced_relation_type 0 2.70/0.99 --bmc1_ucm_relax_model 4 2.70/0.99 --bmc1_ucm_full_tr_after_sat true 2.70/0.99 --bmc1_ucm_expand_neg_assumptions false 2.70/0.99 --bmc1_ucm_layered_model none 2.70/0.99 --bmc1_ucm_max_lemma_size 10 2.70/0.99 2.70/0.99 ------ AIG Options 2.70/0.99 2.70/0.99 --aig_mode false 2.70/0.99 2.70/0.99 ------ Instantiation Options 2.70/0.99 2.70/0.99 --instantiation_flag true 2.70/0.99 --inst_sos_flag false 2.70/0.99 --inst_sos_phase true 2.70/0.99 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 2.70/0.99 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 2.70/0.99 --inst_lit_sel_side num_symb 2.70/0.99 --inst_solver_per_active 1400 2.70/0.99 --inst_solver_calls_frac 1. 2.70/0.99 --inst_passive_queue_type priority_queues 2.70/0.99 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 2.70/0.99 --inst_passive_queues_freq [25;2] 2.70/0.99 --inst_dismatching true 2.70/0.99 --inst_eager_unprocessed_to_passive true 2.70/0.99 --inst_prop_sim_given true 2.70/0.99 --inst_prop_sim_new false 2.70/0.99 --inst_subs_new false 2.70/0.99 --inst_eq_res_simp false 2.70/0.99 --inst_subs_given false 2.70/0.99 --inst_orphan_elimination true 2.70/0.99 --inst_learning_loop_flag true 2.70/0.99 --inst_learning_start 3000 2.70/0.99 --inst_learning_factor 2 2.70/0.99 --inst_start_prop_sim_after_learn 3 2.70/0.99 --inst_sel_renew solver 2.70/0.99 --inst_lit_activity_flag true 2.70/0.99 --inst_restr_to_given false 2.70/0.99 --inst_activity_threshold 500 2.70/0.99 --inst_out_proof true 2.70/0.99 2.70/0.99 ------ Resolution Options 2.70/0.99 2.70/0.99 --resolution_flag true 2.70/0.99 --res_lit_sel adaptive 2.70/0.99 --res_lit_sel_side none 2.70/0.99 --res_ordering kbo 2.70/0.99 --res_to_prop_solver active 2.70/0.99 --res_prop_simpl_new false 2.70/0.99 --res_prop_simpl_given true 2.70/0.99 --res_passive_queue_type priority_queues 2.70/0.99 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 2.70/0.99 --res_passive_queues_freq [15;5] 2.70/0.99 --res_forward_subs full 2.70/0.99 --res_backward_subs full 2.70/0.99 --res_forward_subs_resolution true 2.70/0.99 --res_backward_subs_resolution true 2.70/0.99 --res_orphan_elimination true 2.70/0.99 --res_time_limit 2. 2.70/0.99 --res_out_proof true 2.70/0.99 2.70/0.99 ------ Superposition Options 2.70/0.99 2.70/0.99 --superposition_flag true 2.70/0.99 --sup_passive_queue_type priority_queues 2.70/0.99 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 2.70/0.99 --sup_passive_queues_freq [8;1;4] 2.70/0.99 --demod_completeness_check fast 2.70/0.99 --demod_use_ground true 2.70/0.99 --sup_to_prop_solver passive 2.70/0.99 --sup_prop_simpl_new true 2.70/0.99 --sup_prop_simpl_given true 2.70/0.99 --sup_fun_splitting false 2.70/0.99 --sup_smt_interval 50000 2.70/0.99 2.70/0.99 ------ Superposition Simplification Setup 2.70/0.99 2.70/0.99 --sup_indices_passive [] 2.70/0.99 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 2.70/0.99 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 2.70/0.99 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 2.70/0.99 --sup_full_triv [TrivRules;PropSubs] 2.70/0.99 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 2.70/0.99 --sup_full_bw [BwDemod] 2.70/0.99 --sup_immed_triv [TrivRules] 2.70/0.99 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 2.70/0.99 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 2.70/0.99 --sup_immed_bw_main [] 2.70/0.99 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 2.70/0.99 --sup_input_triv [Unflattening;TrivRules] 2.70/0.99 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 2.70/0.99 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 2.70/0.99 2.70/0.99 ------ Combination Options 2.70/0.99 2.70/0.99 --comb_res_mult 3 2.70/0.99 --comb_sup_mult 2 2.70/0.99 --comb_inst_mult 10 2.70/0.99 2.70/0.99 ------ Debug Options 2.70/0.99 2.70/0.99 --dbg_backtrace false 2.70/0.99 --dbg_dump_prop_clauses false 2.70/0.99 --dbg_dump_prop_clauses_file - 2.70/0.99 --dbg_out_stat false 2.70/0.99 ------ Parsing... 2.70/0.99 ------ Clausification by vclausify_rel & Parsing by iProver... 2.70/0.99 2.70/0.99 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sf_s rm: 5 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 6 0s sf_e pe_s pe_e 2.70/0.99 2.70/0.99 ------ Preprocessing... gs_s sp: 6 0s gs_e snvd_s sp: 0 0s snvd_e 2.70/0.99 2.70/0.99 ------ Preprocessing... sf_s rm: 2 0s sf_e sf_s rm: 0 0s sf_e 2.70/0.99 ------ Proving... 2.70/0.99 ------ Problem Properties 2.70/0.99 2.70/0.99 2.70/0.99 clauses 30 2.70/0.99 conjectures 4 2.70/0.99 EPR 12 2.70/0.99 Horn 20 2.70/0.99 unary 8 2.70/0.99 binary 14 2.70/0.99 lits 60 2.70/0.99 lits eq 18 2.70/0.99 fd_pure 0 2.70/0.99 fd_pseudo 0 2.70/0.99 fd_cond 0 2.70/0.99 fd_pseudo_cond 1 2.70/0.99 AC symbols 0 2.70/0.99 2.70/0.99 ------ Schedule dynamic 5 is on 2.70/0.99 2.70/0.99 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 2.70/0.99 2.70/0.99 2.70/0.99 ------ 2.70/0.99 Current options: 2.70/0.99 ------ 2.70/0.99 2.70/0.99 ------ Input Options 2.70/0.99 2.70/0.99 --out_options all 2.70/0.99 --tptp_safe_out true 2.70/0.99 --problem_path "" 2.70/0.99 --include_path "" 2.70/0.99 --clausifier res/vclausify_rel 2.70/0.99 --clausifier_options --mode clausify 2.70/0.99 --stdin false 2.70/0.99 --stats_out all 2.70/0.99 2.70/0.99 ------ General Options 2.70/0.99 2.70/0.99 --fof false 2.70/0.99 --time_out_real 125. 2.70/0.99 --time_out_virtual -1. 2.70/0.99 --symbol_type_check false 2.70/0.99 --clausify_out false 2.70/0.99 --sig_cnt_out false 2.70/0.99 --trig_cnt_out false 2.70/0.99 --trig_cnt_out_tolerance 1. 2.70/0.99 --trig_cnt_out_sk_spl false 2.70/0.99 --abstr_cl_out false 2.70/0.99 2.70/0.99 ------ Global Options 2.70/0.99 2.70/0.99 --schedule default 2.70/0.99 --add_important_lit false 2.70/0.99 --prop_solver_per_cl 1000 2.70/0.99 --min_unsat_core false 2.70/0.99 --soft_assumptions false 2.70/0.99 --soft_lemma_size 3 2.70/0.99 --prop_impl_unit_size 0 2.70/0.99 --prop_impl_unit [] 2.70/0.99 --share_sel_clauses true 2.70/0.99 --reset_solvers false 2.70/0.99 --bc_imp_inh [conj_cone] 2.70/0.99 --conj_cone_tolerance 3. 2.70/0.99 --extra_neg_conj none 2.70/0.99 --large_theory_mode true 2.70/0.99 --prolific_symb_bound 200 2.70/0.99 --lt_threshold 2000 2.70/0.99 --clause_weak_htbl true 2.70/0.99 --gc_record_bc_elim false 2.70/0.99 2.70/0.99 ------ Preprocessing Options 2.70/0.99 2.70/0.99 --preprocessing_flag true 2.70/0.99 --time_out_prep_mult 0.1 2.70/0.99 --splitting_mode input 2.70/0.99 --splitting_grd true 2.70/0.99 --splitting_cvd false 2.70/0.99 --splitting_cvd_svl false 2.70/0.99 --splitting_nvd 32 2.70/0.99 --sub_typing true 2.70/0.99 --prep_gs_sim true 2.70/0.99 --prep_unflatten true 2.70/0.99 --prep_res_sim true 2.70/0.99 --prep_upred true 2.70/0.99 --prep_sem_filter exhaustive 2.70/0.99 --prep_sem_filter_out false 2.70/0.99 --pred_elim true 2.70/0.99 --res_sim_input true 2.70/0.99 --eq_ax_congr_red true 2.70/0.99 --pure_diseq_elim true 2.70/0.99 --brand_transform false 2.70/0.99 --non_eq_to_eq false 2.70/0.99 --prep_def_merge true 2.70/0.99 --prep_def_merge_prop_impl false 2.70/0.99 --prep_def_merge_mbd true 2.70/0.99 --prep_def_merge_tr_red false 2.70/0.99 --prep_def_merge_tr_cl false 2.70/0.99 --smt_preprocessing true 2.70/0.99 --smt_ac_axioms fast 2.70/0.99 --preprocessed_out false 2.70/0.99 --preprocessed_stats false 2.70/0.99 2.70/0.99 ------ Abstraction refinement Options 2.70/0.99 2.70/0.99 --abstr_ref [] 2.70/0.99 --abstr_ref_prep false 2.70/0.99 --abstr_ref_until_sat false 2.70/0.99 --abstr_ref_sig_restrict funpre 2.70/0.99 --abstr_ref_af_restrict_to_split_sk false 2.70/0.99 --abstr_ref_under [] 2.70/0.99 2.70/0.99 ------ SAT Options 2.70/0.99 2.70/0.99 --sat_mode false 2.70/0.99 --sat_fm_restart_options "" 2.70/0.99 --sat_gr_def false 2.70/0.99 --sat_epr_types true 2.70/0.99 --sat_non_cyclic_types false 2.70/0.99 --sat_finite_models false 2.70/0.99 --sat_fm_lemmas false 2.70/0.99 --sat_fm_prep false 2.70/0.99 --sat_fm_uc_incr true 2.70/0.99 --sat_out_model small 2.70/0.99 --sat_out_clauses false 2.70/0.99 2.70/0.99 ------ QBF Options 2.70/0.99 2.70/0.99 --qbf_mode false 2.70/0.99 --qbf_elim_univ false 2.70/0.99 --qbf_dom_inst none 2.70/0.99 --qbf_dom_pre_inst false 2.70/0.99 --qbf_sk_in false 2.70/0.99 --qbf_pred_elim true 2.70/0.99 --qbf_split 512 2.70/0.99 2.70/0.99 ------ BMC1 Options 2.70/0.99 2.70/0.99 --bmc1_incremental false 2.70/0.99 --bmc1_axioms reachable_all 2.70/0.99 --bmc1_min_bound 0 2.70/0.99 --bmc1_max_bound -1 2.70/0.99 --bmc1_max_bound_default -1 2.70/0.99 --bmc1_symbol_reachability true 2.70/0.99 --bmc1_property_lemmas false 2.70/0.99 --bmc1_k_induction false 2.70/0.99 --bmc1_non_equiv_states false 2.70/0.99 --bmc1_deadlock false 2.70/0.99 --bmc1_ucm false 2.70/0.99 --bmc1_add_unsat_core none 2.70/0.99 --bmc1_unsat_core_children false 2.70/0.99 --bmc1_unsat_core_extrapolate_axioms false 2.70/0.99 --bmc1_out_stat full 2.70/0.99 --bmc1_ground_init false 2.70/0.99 --bmc1_pre_inst_next_state false 2.70/0.99 --bmc1_pre_inst_state false 2.70/0.99 --bmc1_pre_inst_reach_state false 2.70/0.99 --bmc1_out_unsat_core false 2.70/0.99 --bmc1_aig_witness_out false 2.70/0.99 --bmc1_verbose false 2.70/0.99 --bmc1_dump_clauses_tptp false 2.70/0.99 --bmc1_dump_unsat_core_tptp false 2.70/0.99 --bmc1_dump_file - 2.70/0.99 --bmc1_ucm_expand_uc_limit 128 2.70/0.99 --bmc1_ucm_n_expand_iterations 6 2.70/0.99 --bmc1_ucm_extend_mode 1 2.70/0.99 --bmc1_ucm_init_mode 2 2.70/0.99 --bmc1_ucm_cone_mode none 2.70/0.99 --bmc1_ucm_reduced_relation_type 0 2.70/0.99 --bmc1_ucm_relax_model 4 2.70/0.99 --bmc1_ucm_full_tr_after_sat true 2.70/0.99 --bmc1_ucm_expand_neg_assumptions false 2.70/0.99 --bmc1_ucm_layered_model none 2.70/0.99 --bmc1_ucm_max_lemma_size 10 2.70/0.99 2.70/0.99 ------ AIG Options 2.70/0.99 2.70/0.99 --aig_mode false 2.70/0.99 2.70/0.99 ------ Instantiation Options 2.70/0.99 2.70/0.99 --instantiation_flag true 2.70/0.99 --inst_sos_flag false 2.70/0.99 --inst_sos_phase true 2.70/0.99 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 2.70/0.99 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 2.70/0.99 --inst_lit_sel_side none 2.70/0.99 --inst_solver_per_active 1400 2.70/0.99 --inst_solver_calls_frac 1. 2.70/0.99 --inst_passive_queue_type priority_queues 2.70/0.99 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 2.70/0.99 --inst_passive_queues_freq [25;2] 2.70/0.99 --inst_dismatching true 2.70/0.99 --inst_eager_unprocessed_to_passive true 2.70/0.99 --inst_prop_sim_given true 2.70/0.99 --inst_prop_sim_new false 2.70/0.99 --inst_subs_new false 2.70/0.99 --inst_eq_res_simp false 2.70/0.99 --inst_subs_given false 2.70/0.99 --inst_orphan_elimination true 2.70/0.99 --inst_learning_loop_flag true 2.70/0.99 --inst_learning_start 3000 2.70/0.99 --inst_learning_factor 2 2.70/0.99 --inst_start_prop_sim_after_learn 3 2.70/0.99 --inst_sel_renew solver 2.70/0.99 --inst_lit_activity_flag true 2.70/0.99 --inst_restr_to_given false 2.70/0.99 --inst_activity_threshold 500 2.70/0.99 --inst_out_proof true 2.70/0.99 2.70/0.99 ------ Resolution Options 2.70/0.99 2.70/0.99 --resolution_flag false 2.70/0.99 --res_lit_sel adaptive 2.70/0.99 --res_lit_sel_side none 2.70/0.99 --res_ordering kbo 2.70/0.99 --res_to_prop_solver active 2.70/0.99 --res_prop_simpl_new false 2.70/0.99 --res_prop_simpl_given true 2.70/0.99 --res_passive_queue_type priority_queues 2.70/0.99 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 2.70/0.99 --res_passive_queues_freq [15;5] 2.70/0.99 --res_forward_subs full 2.70/0.99 --res_backward_subs full 2.70/0.99 --res_forward_subs_resolution true 2.70/0.99 --res_backward_subs_resolution true 2.70/0.99 --res_orphan_elimination true 2.70/0.99 --res_time_limit 2. 2.70/0.99 --res_out_proof true 2.70/0.99 2.70/0.99 ------ Superposition Options 2.70/0.99 2.70/0.99 --superposition_flag true 2.70/0.99 --sup_passive_queue_type priority_queues 2.70/0.99 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 2.70/0.99 --sup_passive_queues_freq [8;1;4] 2.70/0.99 --demod_completeness_check fast 2.70/0.99 --demod_use_ground true 2.70/0.99 --sup_to_prop_solver passive 2.70/0.99 --sup_prop_simpl_new true 2.70/0.99 --sup_prop_simpl_given true 2.70/0.99 --sup_fun_splitting false 2.70/0.99 --sup_smt_interval 50000 2.70/0.99 2.70/0.99 ------ Superposition Simplification Setup 2.70/0.99 2.70/0.99 --sup_indices_passive [] 2.70/0.99 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 2.70/0.99 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 2.70/0.99 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 2.70/0.99 --sup_full_triv [TrivRules;PropSubs] 2.70/0.99 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 2.70/0.99 --sup_full_bw [BwDemod] 2.70/0.99 --sup_immed_triv [TrivRules] 2.70/0.99 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 2.70/0.99 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 2.70/0.99 --sup_immed_bw_main [] 2.70/0.99 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 2.70/0.99 --sup_input_triv [Unflattening;TrivRules] 2.70/0.99 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 2.70/0.99 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 2.70/0.99 2.70/0.99 ------ Combination Options 2.70/0.99 2.70/0.99 --comb_res_mult 3 2.70/0.99 --comb_sup_mult 2 2.70/0.99 --comb_inst_mult 10 2.70/0.99 2.70/0.99 ------ Debug Options 2.70/0.99 2.70/0.99 --dbg_backtrace false 2.70/0.99 --dbg_dump_prop_clauses false 2.70/0.99 --dbg_dump_prop_clauses_file - 2.70/0.99 --dbg_out_stat false 2.70/0.99 2.70/0.99 2.70/0.99 2.70/0.99 2.70/0.99 ------ Proving... 2.70/0.99 2.70/0.99 2.70/0.99 % SZS status Theorem for theBenchmark.p 2.70/0.99 2.70/0.99 % SZS output start CNFRefutation for theBenchmark.p 2.70/0.99 2.70/0.99 fof(f10,conjecture,( 2.70/0.99 ! [X0,X4,X5,X6] : ((organization(X0) & fragile_position(X0) & ~has_endowment(X0) & zero = age(X0,X4) & smaller_or_equal(age(X0,X5),sigma) & greater(age(X0,X6),sigma) & greater(sigma,zero)) => (hazard_of_mortality(X0,X4) = hazard_of_mortality(X0,X5) & greater(hazard_of_mortality(X0,X6),hazard_of_mortality(X0,X5))))), 2.70/0.99 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 2.70/0.99 2.70/0.99 fof(f11,negated_conjecture,( 2.70/0.99 ~! [X0,X4,X5,X6] : ((organization(X0) & fragile_position(X0) & ~has_endowment(X0) & zero = age(X0,X4) & smaller_or_equal(age(X0,X5),sigma) & greater(age(X0,X6),sigma) & greater(sigma,zero)) => (hazard_of_mortality(X0,X4) = hazard_of_mortality(X0,X5) & greater(hazard_of_mortality(X0,X6),hazard_of_mortality(X0,X5))))), 2.70/0.99 inference(negated_conjecture,[],[f10])). 2.70/0.99 2.70/0.99 fof(f21,plain,( 2.70/0.99 ~! [X0,X1,X2,X3] : ((organization(X0) & fragile_position(X0) & ~has_endowment(X0) & zero = age(X0,X1) & smaller_or_equal(age(X0,X2),sigma) & greater(age(X0,X3),sigma) & greater(sigma,zero)) => (hazard_of_mortality(X0,X1) = hazard_of_mortality(X0,X2) & greater(hazard_of_mortality(X0,X3),hazard_of_mortality(X0,X2))))), 2.70/0.99 inference(rectify,[],[f11])). 2.70/0.99 2.70/0.99 fof(f33,plain,( 2.70/0.99 ? [X0,X1,X2,X3] : ((hazard_of_mortality(X0,X1) != hazard_of_mortality(X0,X2) | ~greater(hazard_of_mortality(X0,X3),hazard_of_mortality(X0,X2))) & (organization(X0) & fragile_position(X0) & ~has_endowment(X0) & zero = age(X0,X1) & smaller_or_equal(age(X0,X2),sigma) & greater(age(X0,X3),sigma) & greater(sigma,zero)))), 2.70/0.99 inference(ennf_transformation,[],[f21])). 2.70/0.99 2.70/0.99 fof(f34,plain,( 2.70/0.99 ? [X0,X1,X2,X3] : ((hazard_of_mortality(X0,X1) != hazard_of_mortality(X0,X2) | ~greater(hazard_of_mortality(X0,X3),hazard_of_mortality(X0,X2))) & organization(X0) & fragile_position(X0) & ~has_endowment(X0) & zero = age(X0,X1) & smaller_or_equal(age(X0,X2),sigma) & greater(age(X0,X3),sigma) & greater(sigma,zero))), 2.70/0.99 inference(flattening,[],[f33])). 2.70/0.99 2.70/0.99 fof(f46,plain,( 2.70/0.99 ? [X0,X1,X2,X3] : ((hazard_of_mortality(X0,X1) != hazard_of_mortality(X0,X2) | ~greater(hazard_of_mortality(X0,X3),hazard_of_mortality(X0,X2))) & organization(X0) & fragile_position(X0) & ~has_endowment(X0) & zero = age(X0,X1) & smaller_or_equal(age(X0,X2),sigma) & greater(age(X0,X3),sigma) & greater(sigma,zero)) => ((hazard_of_mortality(sK0,sK1) != hazard_of_mortality(sK0,sK2) | ~greater(hazard_of_mortality(sK0,sK3),hazard_of_mortality(sK0,sK2))) & organization(sK0) & fragile_position(sK0) & ~has_endowment(sK0) & zero = age(sK0,sK1) & smaller_or_equal(age(sK0,sK2),sigma) & greater(age(sK0,sK3),sigma) & greater(sigma,zero))), 2.70/0.99 introduced(choice_axiom,[])). 2.70/0.99 2.70/0.99 fof(f47,plain,( 2.70/0.99 (hazard_of_mortality(sK0,sK1) != hazard_of_mortality(sK0,sK2) | ~greater(hazard_of_mortality(sK0,sK3),hazard_of_mortality(sK0,sK2))) & organization(sK0) & fragile_position(sK0) & ~has_endowment(sK0) & zero = age(sK0,sK1) & smaller_or_equal(age(sK0,sK2),sigma) & greater(age(sK0,sK3),sigma) & greater(sigma,zero)), 2.70/0.99 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f34,f46])). 2.70/0.99 2.70/0.99 fof(f64,plain,( 2.70/0.99 smaller_or_equal(age(sK0,sK2),sigma)), 2.70/0.99 inference(cnf_transformation,[],[f47])). 2.70/0.99 2.70/0.99 fof(f67,plain,( 2.70/0.99 fragile_position(sK0)), 2.70/0.99 inference(cnf_transformation,[],[f47])). 2.70/0.99 2.70/0.99 fof(f17,axiom,( 2.70/0.99 ! [X0] : (fragile_position(X0) <=> ! [X3] : ((greater(age(X0,X3),sigma) => ~positional_advantage(X0,X3)) & (smaller_or_equal(age(X0,X3),sigma) => positional_advantage(X0,X3))))), 2.70/0.99 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 2.70/0.99 2.70/0.99 fof(f24,plain,( 2.70/0.99 ! [X0] : (fragile_position(X0) <=> ! [X1] : ((greater(age(X0,X1),sigma) => ~positional_advantage(X0,X1)) & (smaller_or_equal(age(X0,X1),sigma) => positional_advantage(X0,X1))))), 2.70/0.99 inference(rectify,[],[f17])). 2.70/0.99 2.70/0.99 fof(f27,plain,( 2.70/0.99 ! [X0] : (fragile_position(X0) => ! [X1] : ((greater(age(X0,X1),sigma) => ~positional_advantage(X0,X1)) & (smaller_or_equal(age(X0,X1),sigma) => positional_advantage(X0,X1))))), 2.70/0.99 inference(unused_predicate_definition_removal,[],[f24])). 2.70/0.99 2.70/0.99 fof(f38,plain,( 2.70/0.99 ! [X0] : (! [X1] : ((~positional_advantage(X0,X1) | ~greater(age(X0,X1),sigma)) & (positional_advantage(X0,X1) | ~smaller_or_equal(age(X0,X1),sigma))) | ~fragile_position(X0))), 2.70/0.99 inference(ennf_transformation,[],[f27])). 2.70/0.99 2.70/0.99 fof(f80,plain,( 2.70/0.99 ( ! [X0,X1] : (positional_advantage(X0,X1) | ~smaller_or_equal(age(X0,X1),sigma) | ~fragile_position(X0)) )), 2.70/0.99 inference(cnf_transformation,[],[f38])). 2.70/0.99 2.70/0.99 fof(f13,axiom,( 2.70/0.99 ! [X0,X4,X3] : ((organization(X0) & ~(is_aligned(X0,X3) <=> is_aligned(X0,X4))) <=> dissimilar(X0,X4,X3))), 2.70/0.99 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 2.70/0.99 2.70/0.99 fof(f22,plain,( 2.70/0.99 ! [X0,X1,X2] : ((organization(X0) & ~(is_aligned(X0,X2) <=> is_aligned(X0,X1))) <=> dissimilar(X0,X1,X2))), 2.70/0.99 inference(rectify,[],[f13])). 2.70/0.99 2.70/0.99 fof(f35,plain,( 2.70/0.99 ! [X0,X1,X2] : ((organization(X0) & (is_aligned(X0,X2) <~> is_aligned(X0,X1))) <=> dissimilar(X0,X1,X2))), 2.70/0.99 inference(ennf_transformation,[],[f22])). 2.70/0.99 2.70/0.99 fof(f48,plain,( 2.70/0.99 ! [X0,X1,X2] : (((organization(X0) & ((~is_aligned(X0,X1) | ~is_aligned(X0,X2)) & (is_aligned(X0,X1) | is_aligned(X0,X2)))) | ~dissimilar(X0,X1,X2)) & (dissimilar(X0,X1,X2) | (~organization(X0) | ((is_aligned(X0,X2) | ~is_aligned(X0,X1)) & (is_aligned(X0,X1) | ~is_aligned(X0,X2))))))), 2.70/0.99 inference(nnf_transformation,[],[f35])). 2.70/0.99 2.70/0.99 fof(f49,plain,( 2.70/0.99 ! [X0,X1,X2] : (((organization(X0) & (~is_aligned(X0,X1) | ~is_aligned(X0,X2)) & (is_aligned(X0,X1) | is_aligned(X0,X2))) | ~dissimilar(X0,X1,X2)) & (dissimilar(X0,X1,X2) | ~organization(X0) | ((is_aligned(X0,X2) | ~is_aligned(X0,X1)) & (is_aligned(X0,X1) | ~is_aligned(X0,X2)))))), 2.70/0.99 inference(flattening,[],[f48])). 2.70/0.99 2.70/0.99 fof(f72,plain,( 2.70/0.99 ( ! [X2,X0,X1] : (dissimilar(X0,X1,X2) | ~organization(X0) | is_aligned(X0,X2) | ~is_aligned(X0,X1)) )), 2.70/0.99 inference(cnf_transformation,[],[f49])). 2.70/0.99 2.70/0.99 fof(f15,axiom,( 2.70/0.99 ! [X0,X4,X3] : ((organization(X0) & zero = age(X0,X4)) => (greater(age(X0,X3),sigma) <=> dissimilar(X0,X4,X3)))), 2.70/0.99 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 2.70/0.99 2.70/0.99 fof(f23,plain,( 2.70/0.99 ! [X0,X1,X2] : ((organization(X0) & zero = age(X0,X1)) => (greater(age(X0,X2),sigma) <=> dissimilar(X0,X1,X2)))), 2.70/0.99 inference(rectify,[],[f15])). 2.70/0.99 2.70/0.99 fof(f36,plain,( 2.70/0.99 ! [X0,X1,X2] : ((greater(age(X0,X2),sigma) <=> dissimilar(X0,X1,X2)) | (~organization(X0) | zero != age(X0,X1)))), 2.70/0.99 inference(ennf_transformation,[],[f23])). 2.70/0.99 2.70/0.99 fof(f37,plain,( 2.70/0.99 ! [X0,X1,X2] : ((greater(age(X0,X2),sigma) <=> dissimilar(X0,X1,X2)) | ~organization(X0) | zero != age(X0,X1))), 2.70/0.99 inference(flattening,[],[f36])). 2.70/0.99 2.70/0.99 fof(f50,plain,( 2.70/0.99 ! [X0,X1,X2] : (((greater(age(X0,X2),sigma) | ~dissimilar(X0,X1,X2)) & (dissimilar(X0,X1,X2) | ~greater(age(X0,X2),sigma))) | ~organization(X0) | zero != age(X0,X1))), 2.70/0.99 inference(nnf_transformation,[],[f37])). 2.70/0.99 2.70/0.99 fof(f78,plain,( 2.70/0.99 ( ! [X2,X0,X1] : (greater(age(X0,X2),sigma) | ~dissimilar(X0,X1,X2) | ~organization(X0) | zero != age(X0,X1)) )), 2.70/0.99 inference(cnf_transformation,[],[f50])). 2.70/0.99 2.70/0.99 fof(f75,plain,( 2.70/0.99 ( ! [X2,X0,X1] : (organization(X0) | ~dissimilar(X0,X1,X2)) )), 2.70/0.99 inference(cnf_transformation,[],[f49])). 2.70/0.99 2.70/0.99 fof(f19,axiom,( 2.70/0.99 ! [X0,X3] : ((organization(X0) & zero = age(X0,X3)) => is_aligned(X0,X3))), 2.70/0.99 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 2.70/0.99 2.70/0.99 fof(f26,plain,( 2.70/0.99 ! [X0,X1] : ((organization(X0) & zero = age(X0,X1)) => is_aligned(X0,X1))), 2.70/0.99 inference(rectify,[],[f19])). 2.70/0.99 2.70/0.99 fof(f41,plain,( 2.70/0.99 ! [X0,X1] : (is_aligned(X0,X1) | (~organization(X0) | zero != age(X0,X1)))), 2.70/0.99 inference(ennf_transformation,[],[f26])). 2.70/0.99 2.70/0.99 fof(f42,plain,( 2.70/0.99 ! [X0,X1] : (is_aligned(X0,X1) | ~organization(X0) | zero != age(X0,X1))), 2.70/0.99 inference(flattening,[],[f41])). 2.70/0.99 2.70/0.99 fof(f87,plain,( 2.70/0.99 ( ! [X0,X1] : (is_aligned(X0,X1) | ~organization(X0) | zero != age(X0,X1)) )), 2.70/0.99 inference(cnf_transformation,[],[f42])). 2.70/0.99 2.70/0.99 fof(f68,plain,( 2.70/0.99 organization(sK0)), 2.70/0.99 inference(cnf_transformation,[],[f47])). 2.70/0.99 2.70/0.99 fof(f81,plain,( 2.70/0.99 ( ! [X0,X1] : (~positional_advantage(X0,X1) | ~greater(age(X0,X1),sigma) | ~fragile_position(X0)) )), 2.70/0.99 inference(cnf_transformation,[],[f38])). 2.70/0.99 2.70/0.99 fof(f18,axiom,( 2.70/0.99 ! [X0,X3] : (organization(X0) => ((has_immunity(X0,X3) => hazard_of_mortality(X0,X3) = very_low) & (~has_immunity(X0,X3) => (((positional_advantage(X0,X3) & is_aligned(X0,X3)) => low = hazard_of_mortality(X0,X3)) & ((~is_aligned(X0,X3) & positional_advantage(X0,X3)) => mod1 = hazard_of_mortality(X0,X3)) & ((~is_aligned(X0,X3) & ~positional_advantage(X0,X3)) => high = hazard_of_mortality(X0,X3)) & ((~positional_advantage(X0,X3) & is_aligned(X0,X3)) => mod2 = hazard_of_mortality(X0,X3))))))), 2.70/0.99 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 2.70/0.99 2.70/0.99 fof(f25,plain,( 2.70/0.99 ! [X0,X1] : (organization(X0) => ((has_immunity(X0,X1) => hazard_of_mortality(X0,X1) = very_low) & (~has_immunity(X0,X1) => (((positional_advantage(X0,X1) & is_aligned(X0,X1)) => low = hazard_of_mortality(X0,X1)) & ((~is_aligned(X0,X1) & positional_advantage(X0,X1)) => mod1 = hazard_of_mortality(X0,X1)) & ((~is_aligned(X0,X1) & ~positional_advantage(X0,X1)) => high = hazard_of_mortality(X0,X1)) & ((~positional_advantage(X0,X1) & is_aligned(X0,X1)) => mod2 = hazard_of_mortality(X0,X1))))))), 2.70/0.99 inference(rectify,[],[f18])). 2.70/0.99 2.70/0.99 fof(f39,plain,( 2.70/0.99 ! [X0,X1] : (((hazard_of_mortality(X0,X1) = very_low | ~has_immunity(X0,X1)) & (((low = hazard_of_mortality(X0,X1) | (~positional_advantage(X0,X1) | ~is_aligned(X0,X1))) & (mod1 = hazard_of_mortality(X0,X1) | (is_aligned(X0,X1) | ~positional_advantage(X0,X1))) & (high = hazard_of_mortality(X0,X1) | (is_aligned(X0,X1) | positional_advantage(X0,X1))) & (mod2 = hazard_of_mortality(X0,X1) | (positional_advantage(X0,X1) | ~is_aligned(X0,X1)))) | has_immunity(X0,X1))) | ~organization(X0))), 2.70/0.99 inference(ennf_transformation,[],[f25])). 2.70/0.99 2.70/0.99 fof(f40,plain,( 2.70/0.99 ! [X0,X1] : (((hazard_of_mortality(X0,X1) = very_low | ~has_immunity(X0,X1)) & (((low = hazard_of_mortality(X0,X1) | ~positional_advantage(X0,X1) | ~is_aligned(X0,X1)) & (mod1 = hazard_of_mortality(X0,X1) | is_aligned(X0,X1) | ~positional_advantage(X0,X1)) & (high = hazard_of_mortality(X0,X1) | is_aligned(X0,X1) | positional_advantage(X0,X1)) & (mod2 = hazard_of_mortality(X0,X1) | positional_advantage(X0,X1) | ~is_aligned(X0,X1))) | has_immunity(X0,X1))) | ~organization(X0))), 2.70/0.99 inference(flattening,[],[f39])). 2.70/0.99 2.70/0.99 fof(f85,plain,( 2.70/0.99 ( ! [X0,X1] : (low = hazard_of_mortality(X0,X1) | ~positional_advantage(X0,X1) | ~is_aligned(X0,X1) | has_immunity(X0,X1) | ~organization(X0)) )), 2.70/0.99 inference(cnf_transformation,[],[f40])). 2.70/0.99 2.70/0.99 fof(f7,axiom,( 2.70/0.99 ! [X0,X3] : ((~has_endowment(X0) & organization(X0)) => ~has_immunity(X0,X3))), 2.70/0.99 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 2.70/0.99 2.70/0.99 fof(f20,plain,( 2.70/0.99 ! [X0,X1] : ((~has_endowment(X0) & organization(X0)) => ~has_immunity(X0,X1))), 2.70/0.99 inference(rectify,[],[f7])). 2.70/0.99 2.70/0.99 fof(f31,plain,( 2.70/0.99 ! [X0,X1] : (~has_immunity(X0,X1) | (has_endowment(X0) | ~organization(X0)))), 2.70/0.99 inference(ennf_transformation,[],[f20])). 2.70/0.99 2.70/0.99 fof(f32,plain,( 2.70/0.99 ! [X0,X1] : (~has_immunity(X0,X1) | has_endowment(X0) | ~organization(X0))), 2.70/0.99 inference(flattening,[],[f31])). 2.70/0.99 2.70/0.99 fof(f59,plain,( 2.70/0.99 ( ! [X0,X1] : (~has_immunity(X0,X1) | has_endowment(X0) | ~organization(X0)) )), 2.70/0.99 inference(cnf_transformation,[],[f32])). 2.70/0.99 2.70/0.99 fof(f66,plain,( 2.70/0.99 ~has_endowment(sK0)), 2.70/0.99 inference(cnf_transformation,[],[f47])). 2.70/0.99 2.70/0.99 fof(f65,plain,( 2.70/0.99 zero = age(sK0,sK1)), 2.70/0.99 inference(cnf_transformation,[],[f47])). 2.70/0.99 2.70/0.99 fof(f83,plain,( 2.70/0.99 ( ! [X0,X1] : (high = hazard_of_mortality(X0,X1) | is_aligned(X0,X1) | positional_advantage(X0,X1) | has_immunity(X0,X1) | ~organization(X0)) )), 2.70/0.99 inference(cnf_transformation,[],[f40])). 2.70/0.99 2.70/0.99 fof(f77,plain,( 2.70/0.99 ( ! [X2,X0,X1] : (dissimilar(X0,X1,X2) | ~greater(age(X0,X2),sigma) | ~organization(X0) | zero != age(X0,X1)) )), 2.70/0.99 inference(cnf_transformation,[],[f50])). 2.70/0.99 2.70/0.99 fof(f74,plain,( 2.70/0.99 ( ! [X2,X0,X1] : (~is_aligned(X0,X1) | ~is_aligned(X0,X2) | ~dissimilar(X0,X1,X2)) )), 2.70/0.99 inference(cnf_transformation,[],[f49])). 2.70/0.99 2.70/0.99 fof(f5,axiom,( 2.70/0.99 ! [X0,X1] : ((smaller(X0,X1) | X0 = X1) <=> smaller_or_equal(X0,X1))), 2.70/0.99 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 2.70/0.99 2.70/0.99 fof(f44,plain,( 2.70/0.99 ! [X0,X1] : (((smaller(X0,X1) | X0 = X1) | ~smaller_or_equal(X0,X1)) & (smaller_or_equal(X0,X1) | (~smaller(X0,X1) & X0 != X1)))), 2.70/0.99 inference(nnf_transformation,[],[f5])). 2.70/0.99 2.70/0.99 fof(f45,plain,( 2.70/0.99 ! [X0,X1] : ((smaller(X0,X1) | X0 = X1 | ~smaller_or_equal(X0,X1)) & (smaller_or_equal(X0,X1) | (~smaller(X0,X1) & X0 != X1)))), 2.70/0.99 inference(flattening,[],[f44])). 2.70/0.99 2.70/0.99 fof(f56,plain,( 2.70/0.99 ( ! [X0,X1] : (smaller_or_equal(X0,X1) | X0 != X1) )), 2.70/0.99 inference(cnf_transformation,[],[f45])). 2.70/0.99 2.70/0.99 fof(f88,plain,( 2.70/0.99 ( ! [X1] : (smaller_or_equal(X1,X1)) )), 2.70/0.99 inference(equality_resolution,[],[f56])). 2.70/0.99 2.70/0.99 fof(f3,axiom,( 2.70/0.99 ! [X0,X1] : (smaller(X0,X1) | X0 = X1 | greater(X0,X1))), 2.70/0.99 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 2.70/0.99 2.70/0.99 fof(f54,plain,( 2.70/0.99 ( ! [X0,X1] : (smaller(X0,X1) | X0 = X1 | greater(X0,X1)) )), 2.70/0.99 inference(cnf_transformation,[],[f3])). 2.70/0.99 2.70/0.99 fof(f57,plain,( 2.70/0.99 ( ! [X0,X1] : (smaller_or_equal(X0,X1) | ~smaller(X0,X1)) )), 2.70/0.99 inference(cnf_transformation,[],[f45])). 2.70/0.99 2.70/0.99 fof(f63,plain,( 2.70/0.99 greater(age(sK0,sK3),sigma)), 2.70/0.99 inference(cnf_transformation,[],[f47])). 2.70/0.99 2.70/0.99 fof(f69,plain,( 2.70/0.99 hazard_of_mortality(sK0,sK1) != hazard_of_mortality(sK0,sK2) | ~greater(hazard_of_mortality(sK0,sK3),hazard_of_mortality(sK0,sK2))), 2.70/0.99 inference(cnf_transformation,[],[f47])). 2.70/0.99 2.70/0.99 fof(f4,axiom,( 2.70/0.99 ! [X0,X1,X2] : ((greater(X1,X2) & greater(X0,X1)) => greater(X0,X2))), 2.70/0.99 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 2.70/0.99 2.70/0.99 fof(f29,plain,( 2.70/0.99 ! [X0,X1,X2] : (greater(X0,X2) | (~greater(X1,X2) | ~greater(X0,X1)))), 2.70/0.99 inference(ennf_transformation,[],[f4])). 2.70/0.99 2.70/0.99 fof(f30,plain,( 2.70/0.99 ! [X0,X1,X2] : (greater(X0,X2) | ~greater(X1,X2) | ~greater(X0,X1))), 2.70/0.99 inference(flattening,[],[f29])). 2.70/0.99 2.70/0.99 fof(f55,plain,( 2.70/0.99 ( ! [X2,X0,X1] : (greater(X0,X2) | ~greater(X1,X2) | ~greater(X0,X1)) )), 2.70/0.99 inference(cnf_transformation,[],[f30])). 2.70/0.99 2.70/0.99 fof(f8,axiom,( 2.70/0.99 greater(high,mod2)), 2.70/0.99 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 2.70/0.99 2.70/0.99 fof(f60,plain,( 2.70/0.99 greater(high,mod2)), 2.70/0.99 inference(cnf_transformation,[],[f8])). 2.70/0.99 2.70/0.99 fof(f14,axiom,( 2.70/0.99 greater(mod2,low)), 2.70/0.99 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 2.70/0.99 2.70/0.99 fof(f76,plain,( 2.70/0.99 greater(mod2,low)), 2.70/0.99 inference(cnf_transformation,[],[f14])). 2.70/0.99 2.70/0.99 cnf(c_16,negated_conjecture, 2.70/0.99 ( smaller_or_equal(age(sK0,sK2),sigma) ), 2.70/0.99 inference(cnf_transformation,[],[f64]) ). 2.70/0.99 2.70/0.99 cnf(c_13,negated_conjecture, 2.70/0.99 ( fragile_position(sK0) ), 2.70/0.99 inference(cnf_transformation,[],[f67]) ). 2.70/0.99 2.70/0.99 cnf(c_30,plain, 2.70/0.99 ( positional_advantage(X0,X1) 2.70/0.99 | ~ smaller_or_equal(age(X0,X1),sigma) 2.70/0.99 | ~ fragile_position(X0) ), 2.70/0.99 inference(cnf_transformation,[],[f80]) ). 2.70/0.99 2.70/0.99 cnf(c_457,plain, 2.70/0.99 ( positional_advantage(X0,X1) 2.70/0.99 | ~ smaller_or_equal(age(X0,X1),sigma) 2.70/0.99 | sK0 != X0 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_13,c_30]) ). 2.70/0.99 2.70/0.99 cnf(c_458,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | ~ smaller_or_equal(age(sK0,X0),sigma) ), 2.70/0.99 inference(unflattening,[status(thm)],[c_457]) ). 2.70/0.99 2.70/0.99 cnf(c_524,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | age(sK0,X0) != age(sK0,sK2) 2.70/0.99 | sigma != sigma ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_16,c_458]) ). 2.70/0.99 2.70/0.99 cnf(c_1456,plain, 2.70/0.99 ( positional_advantage(sK0,X0) | age(sK0,X0) != age(sK0,sK2) ), 2.70/0.99 inference(equality_resolution_simp,[status(thm)],[c_524]) ). 2.70/0.99 2.70/0.99 cnf(c_3073,plain, 2.70/0.99 ( age(sK0,X0) != age(sK0,sK2) 2.70/0.99 | positional_advantage(sK0,X0) = iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_1456]) ). 2.70/0.99 2.70/0.99 cnf(c_3576,plain, 2.70/0.99 ( positional_advantage(sK0,sK2) = iProver_top ), 2.70/0.99 inference(equality_resolution,[status(thm)],[c_3073]) ). 2.70/0.99 2.70/0.99 cnf(c_23,plain, 2.70/0.99 ( dissimilar(X0,X1,X2) 2.70/0.99 | ~ is_aligned(X0,X1) 2.70/0.99 | is_aligned(X0,X2) 2.70/0.99 | ~ organization(X0) ), 2.70/0.99 inference(cnf_transformation,[],[f72]) ). 2.70/0.99 2.70/0.99 cnf(c_26,plain, 2.70/0.99 ( ~ dissimilar(X0,X1,X2) 2.70/0.99 | greater(age(X0,X2),sigma) 2.70/0.99 | ~ organization(X0) 2.70/0.99 | age(X0,X1) != zero ), 2.70/0.99 inference(cnf_transformation,[],[f78]) ). 2.70/0.99 2.70/0.99 cnf(c_20,plain, 2.70/0.99 ( ~ dissimilar(X0,X1,X2) | organization(X0) ), 2.70/0.99 inference(cnf_transformation,[],[f75]) ). 2.70/0.99 2.70/0.99 cnf(c_199,plain, 2.70/0.99 ( greater(age(X0,X2),sigma) 2.70/0.99 | ~ dissimilar(X0,X1,X2) 2.70/0.99 | age(X0,X1) != zero ), 2.70/0.99 inference(global_propositional_subsumption, 2.70/0.99 [status(thm)], 2.70/0.99 [c_26,c_20]) ). 2.70/0.99 2.70/0.99 cnf(c_200,plain, 2.70/0.99 ( ~ dissimilar(X0,X1,X2) 2.70/0.99 | greater(age(X0,X2),sigma) 2.70/0.99 | age(X0,X1) != zero ), 2.70/0.99 inference(renaming,[status(thm)],[c_199]) ). 2.70/0.99 2.70/0.99 cnf(c_860,plain, 2.70/0.99 ( ~ is_aligned(X0,X1) 2.70/0.99 | is_aligned(X0,X2) 2.70/0.99 | greater(age(X0,X2),sigma) 2.70/0.99 | ~ organization(X0) 2.70/0.99 | age(X0,X1) != zero ), 2.70/0.99 inference(resolution,[status(thm)],[c_23,c_200]) ). 2.70/0.99 2.70/0.99 cnf(c_36,plain, 2.70/0.99 ( is_aligned(X0,X1) | ~ organization(X0) | age(X0,X1) != zero ), 2.70/0.99 inference(cnf_transformation,[],[f87]) ). 2.70/0.99 2.70/0.99 cnf(c_862,plain, 2.70/0.99 ( is_aligned(X0,X2) 2.70/0.99 | greater(age(X0,X2),sigma) 2.70/0.99 | ~ organization(X0) 2.70/0.99 | age(X0,X1) != zero ), 2.70/0.99 inference(global_propositional_subsumption, 2.70/0.99 [status(thm)], 2.70/0.99 [c_860,c_36]) ). 2.70/0.99 2.70/0.99 cnf(c_863,plain, 2.70/0.99 ( is_aligned(X0,X1) 2.70/0.99 | greater(age(X0,X1),sigma) 2.70/0.99 | ~ organization(X0) 2.70/0.99 | age(X0,X2) != zero ), 2.70/0.99 inference(renaming,[status(thm)],[c_862]) ). 2.70/0.99 2.70/0.99 cnf(c_12,negated_conjecture, 2.70/0.99 ( organization(sK0) ), 2.70/0.99 inference(cnf_transformation,[],[f68]) ). 2.70/0.99 2.70/0.99 cnf(c_892,plain, 2.70/0.99 ( is_aligned(X0,X1) 2.70/0.99 | greater(age(X0,X1),sigma) 2.70/0.99 | age(X0,X2) != zero 2.70/0.99 | sK0 != X0 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_863,c_12]) ). 2.70/0.99 2.70/0.99 cnf(c_893,plain, 2.70/0.99 ( is_aligned(sK0,X0) 2.70/0.99 | greater(age(sK0,X0),sigma) 2.70/0.99 | age(sK0,X1) != zero ), 2.70/0.99 inference(unflattening,[status(thm)],[c_892]) ). 2.70/0.99 2.70/0.99 cnf(c_29,plain, 2.70/0.99 ( ~ positional_advantage(X0,X1) 2.70/0.99 | ~ greater(age(X0,X1),sigma) 2.70/0.99 | ~ fragile_position(X0) ), 2.70/0.99 inference(cnf_transformation,[],[f81]) ). 2.70/0.99 2.70/0.99 cnf(c_469,plain, 2.70/0.99 ( ~ positional_advantage(X0,X1) 2.70/0.99 | ~ greater(age(X0,X1),sigma) 2.70/0.99 | sK0 != X0 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_13,c_29]) ). 2.70/0.99 2.70/0.99 cnf(c_470,plain, 2.70/0.99 ( ~ positional_advantage(sK0,X0) | ~ greater(age(sK0,X0),sigma) ), 2.70/0.99 inference(unflattening,[status(thm)],[c_469]) ). 2.70/0.99 2.70/0.99 cnf(c_1505,plain, 2.70/0.99 ( ~ positional_advantage(sK0,X0) | ~ greater(age(sK0,X0),sigma) ), 2.70/0.99 inference(prop_impl,[status(thm)],[c_470]) ). 2.70/0.99 2.70/0.99 cnf(c_1545,plain, 2.70/0.99 ( ~ positional_advantage(sK0,X0) 2.70/0.99 | is_aligned(sK0,X0) 2.70/0.99 | age(sK0,X1) != zero ), 2.70/0.99 inference(bin_hyper_res,[status(thm)],[c_893,c_1505]) ). 2.70/0.99 2.70/0.99 cnf(c_32,plain, 2.70/0.99 ( ~ positional_advantage(X0,X1) 2.70/0.99 | ~ is_aligned(X0,X1) 2.70/0.99 | has_immunity(X0,X1) 2.70/0.99 | ~ organization(X0) 2.70/0.99 | hazard_of_mortality(X0,X1) = low ), 2.70/0.99 inference(cnf_transformation,[],[f85]) ). 2.70/0.99 2.70/0.99 cnf(c_990,plain, 2.70/0.99 ( ~ positional_advantage(X0,X1) 2.70/0.99 | ~ is_aligned(X0,X1) 2.70/0.99 | has_immunity(X0,X1) 2.70/0.99 | hazard_of_mortality(X0,X1) = low 2.70/0.99 | sK0 != X0 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_32,c_12]) ). 2.70/0.99 2.70/0.99 cnf(c_991,plain, 2.70/0.99 ( ~ positional_advantage(sK0,X0) 2.70/0.99 | ~ is_aligned(sK0,X0) 2.70/0.99 | has_immunity(sK0,X0) 2.70/0.99 | hazard_of_mortality(sK0,X0) = low ), 2.70/0.99 inference(unflattening,[status(thm)],[c_990]) ). 2.70/0.99 2.70/0.99 cnf(c_8,plain, 2.70/0.99 ( ~ has_immunity(X0,X1) | ~ organization(X0) | has_endowment(X0) ), 2.70/0.99 inference(cnf_transformation,[],[f59]) ). 2.70/0.99 2.70/0.99 cnf(c_14,negated_conjecture, 2.70/0.99 ( ~ has_endowment(sK0) ), 2.70/0.99 inference(cnf_transformation,[],[f66]) ). 2.70/0.99 2.70/0.99 cnf(c_440,plain, 2.70/0.99 ( ~ has_immunity(X0,X1) | ~ organization(X0) | sK0 != X0 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_8,c_14]) ). 2.70/0.99 2.70/0.99 cnf(c_441,plain, 2.70/0.99 ( ~ has_immunity(sK0,X0) | ~ organization(sK0) ), 2.70/0.99 inference(unflattening,[status(thm)],[c_440]) ). 2.70/0.99 2.70/0.99 cnf(c_445,plain, 2.70/0.99 ( ~ has_immunity(sK0,X0) ), 2.70/0.99 inference(global_propositional_subsumption, 2.70/0.99 [status(thm)], 2.70/0.99 [c_441,c_12]) ). 2.70/0.99 2.70/0.99 cnf(c_769,plain, 2.70/0.99 ( ~ positional_advantage(X0,X1) 2.70/0.99 | ~ is_aligned(X0,X1) 2.70/0.99 | ~ organization(X0) 2.70/0.99 | X2 != X1 2.70/0.99 | hazard_of_mortality(X0,X1) = low 2.70/0.99 | sK0 != X0 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_32,c_445]) ). 2.70/0.99 2.70/0.99 cnf(c_770,plain, 2.70/0.99 ( ~ positional_advantage(sK0,X0) 2.70/0.99 | ~ is_aligned(sK0,X0) 2.70/0.99 | ~ organization(sK0) 2.70/0.99 | hazard_of_mortality(sK0,X0) = low ), 2.70/0.99 inference(unflattening,[status(thm)],[c_769]) ). 2.70/0.99 2.70/0.99 cnf(c_774,plain, 2.70/0.99 ( ~ is_aligned(sK0,X0) 2.70/0.99 | ~ positional_advantage(sK0,X0) 2.70/0.99 | hazard_of_mortality(sK0,X0) = low ), 2.70/0.99 inference(global_propositional_subsumption, 2.70/0.99 [status(thm)], 2.70/0.99 [c_770,c_12]) ). 2.70/0.99 2.70/0.99 cnf(c_775,plain, 2.70/0.99 ( ~ positional_advantage(sK0,X0) 2.70/0.99 | ~ is_aligned(sK0,X0) 2.70/0.99 | hazard_of_mortality(sK0,X0) = low ), 2.70/0.99 inference(renaming,[status(thm)],[c_774]) ). 2.70/0.99 2.70/0.99 cnf(c_995,plain, 2.70/0.99 ( ~ is_aligned(sK0,X0) 2.70/0.99 | ~ positional_advantage(sK0,X0) 2.70/0.99 | hazard_of_mortality(sK0,X0) = low ), 2.70/0.99 inference(global_propositional_subsumption, 2.70/0.99 [status(thm)], 2.70/0.99 [c_991,c_12,c_770]) ). 2.70/0.99 2.70/0.99 cnf(c_996,plain, 2.70/0.99 ( ~ positional_advantage(sK0,X0) 2.70/0.99 | ~ is_aligned(sK0,X0) 2.70/0.99 | hazard_of_mortality(sK0,X0) = low ), 2.70/0.99 inference(renaming,[status(thm)],[c_995]) ). 2.70/0.99 2.70/0.99 cnf(c_1630,plain, 2.70/0.99 ( ~ positional_advantage(sK0,X0) 2.70/0.99 | age(sK0,X1) != zero 2.70/0.99 | hazard_of_mortality(sK0,X0) = low ), 2.70/0.99 inference(resolution,[status(thm)],[c_1545,c_996]) ). 2.70/0.99 2.70/0.99 cnf(c_2507,plain, 2.70/0.99 ( ~ positional_advantage(sK0,X0) 2.70/0.99 | hazard_of_mortality(sK0,X0) = low 2.70/0.99 | ~ sP3_iProver_split ), 2.70/0.99 inference(splitting, 2.70/0.99 [splitting(split),new_symbols(definition,[sP3_iProver_split])], 2.70/0.99 [c_1630]) ). 2.70/0.99 2.70/0.99 cnf(c_3071,plain, 2.70/0.99 ( hazard_of_mortality(sK0,X0) = low 2.70/0.99 | positional_advantage(sK0,X0) != iProver_top 2.70/0.99 | sP3_iProver_split != iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_2507]) ). 2.70/0.99 2.70/0.99 cnf(c_2508,plain, 2.70/0.99 ( sP3_iProver_split | sP0_iProver_split ), 2.70/0.99 inference(splitting, 2.70/0.99 [splitting(split),new_symbols(definition,[])], 2.70/0.99 [c_1630]) ). 2.70/0.99 2.70/0.99 cnf(c_2532,plain, 2.70/0.99 ( sP3_iProver_split = iProver_top 2.70/0.99 | sP0_iProver_split = iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_2508]) ). 2.70/0.99 2.70/0.99 cnf(c_2533,plain, 2.70/0.99 ( hazard_of_mortality(sK0,X0) = low 2.70/0.99 | positional_advantage(sK0,X0) != iProver_top 2.70/0.99 | sP3_iProver_split != iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_2507]) ). 2.70/0.99 2.70/0.99 cnf(c_15,negated_conjecture, 2.70/0.99 ( zero = age(sK0,sK1) ), 2.70/0.99 inference(cnf_transformation,[],[f65]) ). 2.70/0.99 2.70/0.99 cnf(c_34,plain, 2.70/0.99 ( positional_advantage(X0,X1) 2.70/0.99 | is_aligned(X0,X1) 2.70/0.99 | has_immunity(X0,X1) 2.70/0.99 | ~ organization(X0) 2.70/0.99 | hazard_of_mortality(X0,X1) = high ), 2.70/0.99 inference(cnf_transformation,[],[f83]) ). 2.70/0.99 2.70/0.99 cnf(c_952,plain, 2.70/0.99 ( positional_advantage(X0,X1) 2.70/0.99 | is_aligned(X0,X1) 2.70/0.99 | has_immunity(X0,X1) 2.70/0.99 | hazard_of_mortality(X0,X1) = high 2.70/0.99 | sK0 != X0 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_34,c_12]) ). 2.70/0.99 2.70/0.99 cnf(c_953,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | is_aligned(sK0,X0) 2.70/0.99 | has_immunity(sK0,X0) 2.70/0.99 | hazard_of_mortality(sK0,X0) = high ), 2.70/0.99 inference(unflattening,[status(thm)],[c_952]) ). 2.70/0.99 2.70/0.99 cnf(c_727,plain, 2.70/0.99 ( positional_advantage(X0,X1) 2.70/0.99 | is_aligned(X0,X1) 2.70/0.99 | ~ organization(X0) 2.70/0.99 | X2 != X1 2.70/0.99 | hazard_of_mortality(X0,X1) = high 2.70/0.99 | sK0 != X0 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_34,c_445]) ). 2.70/0.99 2.70/0.99 cnf(c_728,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | is_aligned(sK0,X0) 2.70/0.99 | ~ organization(sK0) 2.70/0.99 | hazard_of_mortality(sK0,X0) = high ), 2.70/0.99 inference(unflattening,[status(thm)],[c_727]) ). 2.70/0.99 2.70/0.99 cnf(c_957,plain, 2.70/0.99 ( is_aligned(sK0,X0) 2.70/0.99 | positional_advantage(sK0,X0) 2.70/0.99 | hazard_of_mortality(sK0,X0) = high ), 2.70/0.99 inference(global_propositional_subsumption, 2.70/0.99 [status(thm)], 2.70/0.99 [c_953,c_12,c_728]) ). 2.70/0.99 2.70/0.99 cnf(c_958,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | is_aligned(sK0,X0) 2.70/0.99 | hazard_of_mortality(sK0,X0) = high ), 2.70/0.99 inference(renaming,[status(thm)],[c_957]) ). 2.70/0.99 2.70/0.99 cnf(c_27,plain, 2.70/0.99 ( dissimilar(X0,X1,X2) 2.70/0.99 | ~ greater(age(X0,X2),sigma) 2.70/0.99 | ~ organization(X0) 2.70/0.99 | age(X0,X1) != zero ), 2.70/0.99 inference(cnf_transformation,[],[f77]) ). 2.70/0.99 2.70/0.99 cnf(c_21,plain, 2.70/0.99 ( ~ dissimilar(X0,X1,X2) 2.70/0.99 | ~ is_aligned(X0,X1) 2.70/0.99 | ~ is_aligned(X0,X2) ), 2.70/0.99 inference(cnf_transformation,[],[f74]) ). 2.70/0.99 2.70/0.99 cnf(c_829,plain, 2.70/0.99 ( ~ is_aligned(X0,X1) 2.70/0.99 | ~ is_aligned(X0,X2) 2.70/0.99 | ~ greater(age(X0,X2),sigma) 2.70/0.99 | ~ organization(X0) 2.70/0.99 | age(X0,X1) != zero ), 2.70/0.99 inference(resolution,[status(thm)],[c_27,c_21]) ). 2.70/0.99 2.70/0.99 cnf(c_833,plain, 2.70/0.99 ( ~ is_aligned(X0,X2) 2.70/0.99 | ~ greater(age(X0,X2),sigma) 2.70/0.99 | ~ organization(X0) 2.70/0.99 | age(X0,X1) != zero ), 2.70/0.99 inference(global_propositional_subsumption, 2.70/0.99 [status(thm)], 2.70/0.99 [c_829,c_36]) ). 2.70/0.99 2.70/0.99 cnf(c_834,plain, 2.70/0.99 ( ~ is_aligned(X0,X1) 2.70/0.99 | ~ greater(age(X0,X1),sigma) 2.70/0.99 | ~ organization(X0) 2.70/0.99 | age(X0,X2) != zero ), 2.70/0.99 inference(renaming,[status(thm)],[c_833]) ). 2.70/0.99 2.70/0.99 cnf(c_907,plain, 2.70/0.99 ( ~ is_aligned(X0,X1) 2.70/0.99 | ~ greater(age(X0,X1),sigma) 2.70/0.99 | age(X0,X2) != zero 2.70/0.99 | sK0 != X0 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_834,c_12]) ). 2.70/0.99 2.70/0.99 cnf(c_908,plain, 2.70/0.99 ( ~ is_aligned(sK0,X0) 2.70/0.99 | ~ greater(age(sK0,X0),sigma) 2.70/0.99 | age(sK0,X1) != zero ), 2.70/0.99 inference(unflattening,[status(thm)],[c_907]) ). 2.70/0.99 2.70/0.99 cnf(c_7,plain, 2.70/0.99 ( smaller_or_equal(X0,X0) ), 2.70/0.99 inference(cnf_transformation,[],[f88]) ). 2.70/0.99 2.70/0.99 cnf(c_512,plain, 2.70/0.99 ( positional_advantage(sK0,X0) | age(sK0,X0) != X1 | sigma != X1 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_7,c_458]) ). 2.70/0.99 2.70/0.99 cnf(c_513,plain, 2.70/0.99 ( positional_advantage(sK0,X0) | sigma != age(sK0,X0) ), 2.70/0.99 inference(unflattening,[status(thm)],[c_512]) ). 2.70/0.99 2.70/0.99 cnf(c_3,plain, 2.70/0.99 ( greater(X0,X1) | smaller(X0,X1) | X1 = X0 ), 2.70/0.99 inference(cnf_transformation,[],[f54]) ). 2.70/0.99 2.70/0.99 cnf(c_6,plain, 2.70/0.99 ( smaller_or_equal(X0,X1) | ~ smaller(X0,X1) ), 2.70/0.99 inference(cnf_transformation,[],[f57]) ). 2.70/0.99 2.70/0.99 cnf(c_500,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | ~ smaller(X1,X2) 2.70/0.99 | age(sK0,X0) != X1 2.70/0.99 | sigma != X2 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_6,c_458]) ). 2.70/0.99 2.70/0.99 cnf(c_501,plain, 2.70/0.99 ( positional_advantage(sK0,X0) | ~ smaller(age(sK0,X0),sigma) ), 2.70/0.99 inference(unflattening,[status(thm)],[c_500]) ). 2.70/0.99 2.70/0.99 cnf(c_567,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | greater(X1,X2) 2.70/0.99 | X2 = X1 2.70/0.99 | age(sK0,X0) != X1 2.70/0.99 | sigma != X2 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_3,c_501]) ). 2.70/0.99 2.70/0.99 cnf(c_568,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | greater(age(sK0,X0),sigma) 2.70/0.99 | sigma = age(sK0,X0) ), 2.70/0.99 inference(unflattening,[status(thm)],[c_567]) ). 2.70/0.99 2.70/0.99 cnf(c_1507,plain, 2.70/0.99 ( positional_advantage(sK0,X0) | greater(age(sK0,X0),sigma) ), 2.70/0.99 inference(prop_impl,[status(thm)],[c_513,c_568]) ). 2.70/0.99 2.70/0.99 cnf(c_1546,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | ~ is_aligned(sK0,X0) 2.70/0.99 | age(sK0,X1) != zero ), 2.70/0.99 inference(bin_hyper_res,[status(thm)],[c_908,c_1507]) ). 2.70/0.99 2.70/0.99 cnf(c_1685,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | age(sK0,X1) != zero 2.70/0.99 | hazard_of_mortality(sK0,X0) = high ), 2.70/0.99 inference(resolution,[status(thm)],[c_958,c_1546]) ). 2.70/0.99 2.70/0.99 cnf(c_2502,plain, 2.70/0.99 ( age(sK0,X0) != zero | ~ sP0_iProver_split ), 2.70/0.99 inference(splitting, 2.70/0.99 [splitting(split),new_symbols(definition,[sP0_iProver_split])], 2.70/0.99 [c_1685]) ). 2.70/0.99 2.70/0.99 cnf(c_3066,plain, 2.70/0.99 ( age(sK0,X0) != zero | sP0_iProver_split != iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_2502]) ). 2.70/0.99 2.70/0.99 cnf(c_3371,plain, 2.70/0.99 ( sP0_iProver_split != iProver_top ), 2.70/0.99 inference(superposition,[status(thm)],[c_15,c_3066]) ). 2.70/0.99 2.70/0.99 cnf(c_3734,plain, 2.70/0.99 ( positional_advantage(sK0,X0) != iProver_top 2.70/0.99 | hazard_of_mortality(sK0,X0) = low ), 2.70/0.99 inference(global_propositional_subsumption, 2.70/0.99 [status(thm)], 2.70/0.99 [c_3071,c_2532,c_2533,c_3371]) ). 2.70/0.99 2.70/0.99 cnf(c_3735,plain, 2.70/0.99 ( hazard_of_mortality(sK0,X0) = low 2.70/0.99 | positional_advantage(sK0,X0) != iProver_top ), 2.70/0.99 inference(renaming,[status(thm)],[c_3734]) ). 2.70/0.99 2.70/0.99 cnf(c_5251,plain, 2.70/0.99 ( hazard_of_mortality(sK0,sK2) = low ), 2.70/0.99 inference(superposition,[status(thm)],[c_3576,c_3735]) ). 2.70/0.99 2.70/0.99 cnf(c_2503,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | hazard_of_mortality(sK0,X0) = high 2.70/0.99 | ~ sP1_iProver_split ), 2.70/0.99 inference(splitting, 2.70/0.99 [splitting(split),new_symbols(definition,[sP1_iProver_split])], 2.70/0.99 [c_1685]) ). 2.70/0.99 2.70/0.99 cnf(c_3065,plain, 2.70/0.99 ( hazard_of_mortality(sK0,X0) = high 2.70/0.99 | positional_advantage(sK0,X0) = iProver_top 2.70/0.99 | sP1_iProver_split != iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_2503]) ). 2.70/0.99 2.70/0.99 cnf(c_2504,plain, 2.70/0.99 ( sP1_iProver_split | sP0_iProver_split ), 2.70/0.99 inference(splitting, 2.70/0.99 [splitting(split),new_symbols(definition,[])], 2.70/0.99 [c_1685]) ). 2.70/0.99 2.70/0.99 cnf(c_2522,plain, 2.70/0.99 ( sP1_iProver_split = iProver_top 2.70/0.99 | sP0_iProver_split = iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_2504]) ). 2.70/0.99 2.70/0.99 cnf(c_2523,plain, 2.70/0.99 ( hazard_of_mortality(sK0,X0) = high 2.70/0.99 | positional_advantage(sK0,X0) = iProver_top 2.70/0.99 | sP1_iProver_split != iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_2503]) ). 2.70/0.99 2.70/0.99 cnf(c_3500,plain, 2.70/0.99 ( positional_advantage(sK0,X0) = iProver_top 2.70/0.99 | hazard_of_mortality(sK0,X0) = high ), 2.70/0.99 inference(global_propositional_subsumption, 2.70/0.99 [status(thm)], 2.70/0.99 [c_3065,c_2522,c_2523,c_3371]) ). 2.70/0.99 2.70/0.99 cnf(c_3501,plain, 2.70/0.99 ( hazard_of_mortality(sK0,X0) = high 2.70/0.99 | positional_advantage(sK0,X0) = iProver_top ), 2.70/0.99 inference(renaming,[status(thm)],[c_3500]) ). 2.70/0.99 2.70/0.99 cnf(c_17,negated_conjecture, 2.70/0.99 ( greater(age(sK0,sK3),sigma) ), 2.70/0.99 inference(cnf_transformation,[],[f63]) ). 2.70/0.99 2.70/0.99 cnf(c_3087,plain, 2.70/0.99 ( greater(age(sK0,sK3),sigma) = iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_17]) ). 2.70/0.99 2.70/0.99 cnf(c_2109,plain, 2.70/0.99 ( ~ positional_advantage(sK0,X0) | ~ greater(age(sK0,X0),sigma) ), 2.70/0.99 inference(prop_impl,[status(thm)],[c_470]) ). 2.70/0.99 2.70/0.99 cnf(c_3082,plain, 2.70/0.99 ( positional_advantage(sK0,X0) != iProver_top 2.70/0.99 | greater(age(sK0,X0),sigma) != iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_2109]) ). 2.70/0.99 2.70/0.99 cnf(c_4126,plain, 2.70/0.99 ( positional_advantage(sK0,sK3) != iProver_top ), 2.70/0.99 inference(superposition,[status(thm)],[c_3087,c_3082]) ). 2.70/0.99 2.70/0.99 cnf(c_4234,plain, 2.70/0.99 ( hazard_of_mortality(sK0,sK3) = high ), 2.70/0.99 inference(superposition,[status(thm)],[c_3501,c_4126]) ). 2.70/0.99 2.70/0.99 cnf(c_922,plain, 2.70/0.99 ( is_aligned(X0,X1) | age(X0,X1) != zero | sK0 != X0 ), 2.70/0.99 inference(resolution_lifted,[status(thm)],[c_36,c_12]) ). 2.70/0.99 2.70/0.99 cnf(c_923,plain, 2.70/0.99 ( is_aligned(sK0,X0) | age(sK0,X0) != zero ), 2.70/0.99 inference(unflattening,[status(thm)],[c_922]) ). 2.70/0.99 2.70/0.99 cnf(c_1643,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | age(sK0,X1) != zero 2.70/0.99 | age(sK0,X0) != zero ), 2.70/0.99 inference(resolution,[status(thm)],[c_923,c_1546]) ). 2.70/0.99 2.70/0.99 cnf(c_2505,plain, 2.70/0.99 ( positional_advantage(sK0,X0) 2.70/0.99 | age(sK0,X0) != zero 2.70/0.99 | ~ sP2_iProver_split ), 2.70/0.99 inference(splitting, 2.70/0.99 [splitting(split),new_symbols(definition,[sP2_iProver_split])], 2.70/0.99 [c_1643]) ). 2.70/0.99 2.70/0.99 cnf(c_3068,plain, 2.70/0.99 ( age(sK0,X0) != zero 2.70/0.99 | positional_advantage(sK0,X0) = iProver_top 2.70/0.99 | sP2_iProver_split != iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_2505]) ). 2.70/0.99 2.70/0.99 cnf(c_2506,plain, 2.70/0.99 ( sP2_iProver_split | sP0_iProver_split ), 2.70/0.99 inference(splitting, 2.70/0.99 [splitting(split),new_symbols(definition,[])], 2.70/0.99 [c_1643]) ). 2.70/0.99 2.70/0.99 cnf(c_2529,plain, 2.70/0.99 ( sP2_iProver_split = iProver_top 2.70/0.99 | sP0_iProver_split = iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_2506]) ). 2.70/0.99 2.70/0.99 cnf(c_2530,plain, 2.70/0.99 ( age(sK0,X0) != zero 2.70/0.99 | positional_advantage(sK0,X0) = iProver_top 2.70/0.99 | sP2_iProver_split != iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_2505]) ). 2.70/0.99 2.70/0.99 cnf(c_3675,plain, 2.70/0.99 ( positional_advantage(sK0,X0) = iProver_top 2.70/0.99 | age(sK0,X0) != zero ), 2.70/0.99 inference(global_propositional_subsumption, 2.70/0.99 [status(thm)], 2.70/0.99 [c_3068,c_2529,c_2530,c_3371]) ). 2.70/0.99 2.70/0.99 cnf(c_3676,plain, 2.70/0.99 ( age(sK0,X0) != zero 2.70/0.99 | positional_advantage(sK0,X0) = iProver_top ), 2.70/0.99 inference(renaming,[status(thm)],[c_3675]) ). 2.70/0.99 2.70/0.99 cnf(c_3681,plain, 2.70/0.99 ( positional_advantage(sK0,sK1) = iProver_top ), 2.70/0.99 inference(superposition,[status(thm)],[c_15,c_3676]) ). 2.70/0.99 2.70/0.99 cnf(c_3743,plain, 2.70/0.99 ( hazard_of_mortality(sK0,sK1) = low ), 2.70/0.99 inference(superposition,[status(thm)],[c_3681,c_3735]) ). 2.70/0.99 2.70/0.99 cnf(c_11,negated_conjecture, 2.70/0.99 ( ~ greater(hazard_of_mortality(sK0,sK3),hazard_of_mortality(sK0,sK2)) 2.70/0.99 | hazard_of_mortality(sK0,sK1) != hazard_of_mortality(sK0,sK2) ), 2.70/0.99 inference(cnf_transformation,[],[f69]) ). 2.70/0.99 2.70/0.99 cnf(c_3088,plain, 2.70/0.99 ( hazard_of_mortality(sK0,sK1) != hazard_of_mortality(sK0,sK2) 2.70/0.99 | greater(hazard_of_mortality(sK0,sK3),hazard_of_mortality(sK0,sK2)) != iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_11]) ). 2.70/0.99 2.70/0.99 cnf(c_3752,plain, 2.70/0.99 ( hazard_of_mortality(sK0,sK2) != low 2.70/0.99 | greater(hazard_of_mortality(sK0,sK3),hazard_of_mortality(sK0,sK2)) != iProver_top ), 2.70/0.99 inference(demodulation,[status(thm)],[c_3743,c_3088]) ). 2.70/0.99 2.70/0.99 cnf(c_4394,plain, 2.70/0.99 ( hazard_of_mortality(sK0,sK2) != low 2.70/0.99 | greater(high,hazard_of_mortality(sK0,sK2)) != iProver_top ), 2.70/0.99 inference(demodulation,[status(thm)],[c_4234,c_3752]) ). 2.70/0.99 2.70/0.99 cnf(c_5326,plain, 2.70/0.99 ( low != low | greater(high,low) != iProver_top ), 2.70/0.99 inference(demodulation,[status(thm)],[c_5251,c_4394]) ). 2.70/0.99 2.70/0.99 cnf(c_2510,plain,( X0 = X0 ),theory(equality) ). 2.70/0.99 2.70/0.99 cnf(c_3602,plain, 2.70/0.99 ( low = low ), 2.70/0.99 inference(instantiation,[status(thm)],[c_2510]) ). 2.70/0.99 2.70/0.99 cnf(c_4,plain, 2.70/0.99 ( ~ greater(X0,X1) | ~ greater(X1,X2) | greater(X0,X2) ), 2.70/0.99 inference(cnf_transformation,[],[f55]) ). 2.70/0.99 2.70/0.99 cnf(c_3291,plain, 2.70/0.99 ( ~ greater(mod2,X0) | greater(high,X0) | ~ greater(high,mod2) ), 2.70/0.99 inference(instantiation,[status(thm)],[c_4]) ). 2.70/0.99 2.70/0.99 cnf(c_3559,plain, 2.70/0.99 ( ~ greater(mod2,low) | greater(high,low) | ~ greater(high,mod2) ), 2.70/0.99 inference(instantiation,[status(thm)],[c_3291]) ). 2.70/0.99 2.70/0.99 cnf(c_3560,plain, 2.70/0.99 ( greater(mod2,low) != iProver_top 2.70/0.99 | greater(high,low) = iProver_top 2.70/0.99 | greater(high,mod2) != iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_3559]) ). 2.70/0.99 2.70/0.99 cnf(c_9,plain, 2.70/0.99 ( greater(high,mod2) ), 2.70/0.99 inference(cnf_transformation,[],[f60]) ). 2.70/0.99 2.70/0.99 cnf(c_87,plain, 2.70/0.99 ( greater(high,mod2) = iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_9]) ). 2.70/0.99 2.70/0.99 cnf(c_25,plain, 2.70/0.99 ( greater(mod2,low) ), 2.70/0.99 inference(cnf_transformation,[],[f76]) ). 2.70/0.99 2.70/0.99 cnf(c_75,plain, 2.70/0.99 ( greater(mod2,low) = iProver_top ), 2.70/0.99 inference(predicate_to_equality,[status(thm)],[c_25]) ). 2.70/0.99 2.70/0.99 cnf(contradiction,plain, 2.70/0.99 ( $false ), 2.70/0.99 inference(minisat,[status(thm)],[c_5326,c_3602,c_3560,c_87,c_75]) ). 2.70/0.99 2.70/0.99 2.70/0.99 % SZS output end CNFRefutation for theBenchmark.p 2.70/0.99 2.70/0.99 ------ Statistics 2.70/0.99 2.70/0.99 ------ General 2.70/0.99 2.70/0.99 abstr_ref_over_cycles: 0 2.70/0.99 abstr_ref_under_cycles: 0 2.70/0.99 gc_basic_clause_elim: 0 2.70/0.99 forced_gc_time: 0 2.70/0.99 parsing_time: 0.009 2.70/0.99 unif_index_cands_time: 0. 2.70/0.99 unif_index_add_time: 0. 2.70/0.99 orderings_time: 0. 2.70/0.99 out_proof_time: 0.01 2.70/0.99 total_time: 0.14 2.70/0.99 num_of_symbols: 58 2.70/0.99 num_of_terms: 1697 2.70/0.99 2.70/0.99 ------ Preprocessing 2.70/0.99 2.70/0.99 num_of_splits: 6 2.70/0.99 num_of_split_atoms: 4 2.70/0.99 num_of_reused_defs: 2 2.70/0.99 num_eq_ax_congr_red: 15 2.70/0.99 num_of_sem_filtered_clauses: 2 2.70/0.99 num_of_subtypes: 0 2.70/0.99 monotx_restored_types: 0 2.70/0.99 sat_num_of_epr_types: 0 2.70/0.99 sat_num_of_non_cyclic_types: 0 2.70/0.99 sat_guarded_non_collapsed_types: 0 2.70/0.99 num_pure_diseq_elim: 0 2.70/0.99 simp_replaced_by: 0 2.70/0.99 res_preprocessed: 152 2.70/0.99 prep_upred: 0 2.70/0.99 prep_unflattend: 34 2.70/0.99 smt_new_axioms: 0 2.70/0.99 pred_elim_cands: 2 2.70/0.99 pred_elim: 8 2.70/0.99 pred_elim_cl: 13 2.70/0.99 pred_elim_cycles: 13 2.70/0.99 merged_defs: 10 2.70/0.99 merged_defs_ncl: 0 2.70/0.99 bin_hyper_res: 12 2.70/0.99 prep_cycles: 5 2.70/0.99 pred_elim_time: 0.027 2.70/0.99 splitting_time: 0. 2.70/0.99 sem_filter_time: 0. 2.70/0.99 monotx_time: 0. 2.70/0.99 subtype_inf_time: 0. 2.70/0.99 2.70/0.99 ------ Problem properties 2.70/0.99 2.70/0.99 clauses: 30 2.70/0.99 conjectures: 4 2.70/0.99 epr: 12 2.70/0.99 horn: 20 2.70/0.99 ground: 13 2.70/0.99 unary: 8 2.70/0.99 binary: 14 2.70/0.99 lits: 60 2.70/0.99 lits_eq: 18 2.70/0.99 fd_pure: 0 2.70/0.99 fd_pseudo: 0 2.70/0.99 fd_cond: 0 2.70/0.99 fd_pseudo_cond: 1 2.70/0.99 ac_symbols: 0 2.70/0.99 2.70/0.99 ------ Propositional Solver 2.70/0.99 2.70/0.99 prop_solver_calls: 32 2.70/0.99 prop_fast_solver_calls: 1181 2.70/0.99 smt_solver_calls: 0 2.70/0.99 smt_fast_solver_calls: 0 2.70/0.99 prop_num_of_clauses: 1448 2.70/0.99 prop_preprocess_simplified: 5556 2.70/0.99 prop_fo_subsumed: 41 2.70/0.99 prop_solver_time: 0. 2.70/0.99 smt_solver_time: 0. 2.70/0.99 smt_fast_solver_time: 0. 2.70/0.99 prop_fast_solver_time: 0. 2.70/0.99 prop_unsat_core_time: 0. 2.70/0.99 2.70/0.99 ------ QBF 2.70/0.99 2.70/0.99 qbf_q_res: 0 2.70/0.99 qbf_num_tautologies: 0 2.70/0.99 qbf_prep_cycles: 0 2.70/0.99 2.70/0.99 ------ BMC1 2.70/0.99 2.70/0.99 bmc1_current_bound: -1 2.70/0.99 bmc1_last_solved_bound: -1 2.70/0.99 bmc1_unsat_core_size: -1 2.70/0.99 bmc1_unsat_core_parents_size: -1 2.70/0.99 bmc1_merge_next_fun: 0 2.70/0.99 bmc1_unsat_core_clauses_time: 0. 2.70/0.99 2.70/0.99 ------ Instantiation 2.70/0.99 2.70/0.99 inst_num_of_clauses: 389 2.70/0.99 inst_num_in_passive: 111 2.70/0.99 inst_num_in_active: 174 2.70/0.99 inst_num_in_unprocessed: 104 2.70/0.99 inst_num_of_loops: 220 2.70/0.99 inst_num_of_learning_restarts: 0 2.70/0.99 inst_num_moves_active_passive: 43 2.70/0.99 inst_lit_activity: 0 2.70/0.99 inst_lit_activity_moves: 0 2.70/0.99 inst_num_tautologies: 0 2.70/0.99 inst_num_prop_implied: 0 2.70/0.99 inst_num_existing_simplified: 0 2.70/0.99 inst_num_eq_res_simplified: 0 2.70/0.99 inst_num_child_elim: 0 2.70/0.99 inst_num_of_dismatching_blockings: 54 2.70/0.99 inst_num_of_non_proper_insts: 318 2.70/0.99 inst_num_of_duplicates: 0 2.70/0.99 inst_inst_num_from_inst_to_res: 0 2.70/0.99 inst_dismatching_checking_time: 0. 2.70/0.99 2.70/0.99 ------ Resolution 2.70/0.99 2.70/0.99 res_num_of_clauses: 0 2.70/0.99 res_num_in_passive: 0 2.70/0.99 res_num_in_active: 0 2.70/0.99 res_num_of_loops: 157 2.70/0.99 res_forward_subset_subsumed: 79 2.70/0.99 res_backward_subset_subsumed: 0 2.70/0.99 res_forward_subsumed: 11 2.70/0.99 res_backward_subsumed: 2 2.70/0.99 res_forward_subsumption_resolution: 0 2.70/0.99 res_backward_subsumption_resolution: 0 2.70/0.99 res_clause_to_clause_subsumption: 171 2.70/0.99 res_orphan_elimination: 0 2.70/0.99 res_tautology_del: 64 2.70/0.99 res_num_eq_res_simplified: 1 2.70/0.99 res_num_sel_changes: 0 2.70/0.99 res_moves_from_active_to_pass: 0 2.70/0.99 2.70/0.99 ------ Superposition 2.70/0.99 2.70/0.99 sup_time_total: 0. 2.70/0.99 sup_time_generating: 0. 2.70/0.99 sup_time_sim_full: 0. 2.70/0.99 sup_time_sim_immed: 0. 2.70/0.99 2.70/0.99 sup_num_of_clauses: 60 2.70/0.99 sup_num_in_active: 39 2.70/0.99 sup_num_in_passive: 21 2.70/0.99 sup_num_of_loops: 42 2.70/0.99 sup_fw_superposition: 38 2.70/0.99 sup_bw_superposition: 5 2.70/0.99 sup_immediate_simplified: 6 2.70/0.99 sup_given_eliminated: 0 2.70/0.99 comparisons_done: 0 2.70/0.99 comparisons_avoided: 0 2.70/0.99 2.70/0.99 ------ Simplifications 2.70/0.99 2.70/0.99 2.70/0.99 sim_fw_subset_subsumed: 6 2.70/0.99 sim_bw_subset_subsumed: 0 2.70/0.99 sim_fw_subsumed: 0 2.70/0.99 sim_bw_subsumed: 0 2.70/0.99 sim_fw_subsumption_res: 0 2.70/0.99 sim_bw_subsumption_res: 0 2.70/0.99 sim_tautology_del: 1 2.70/0.99 sim_eq_tautology_del: 0 2.70/0.99 sim_eq_res_simp: 0 2.70/0.99 sim_fw_demodulated: 0 2.70/0.99 sim_bw_demodulated: 3 2.70/0.99 sim_light_normalised: 0 2.70/0.99 sim_joinable_taut: 0 2.70/0.99 sim_joinable_simp: 0 2.70/0.99 sim_ac_normalised: 0 2.70/0.99 sim_smt_subsumption: 0 2.70/0.99 2.70/1.00 EOF