0.07/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.14 % Command : iproveropt_run.sh %d %s 0.13/0.35 % Computer : n019.cluster.edu 0.13/0.35 % Model : x86_64 x86_64 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.35 % Memory : 8042.1875MB 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 960 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Thu Jul 2 07:02:57 EDT 2020 0.13/0.36 % CPUTime : 0.13/0.36 % Running in FOF mode 1.20/1.01 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p 1.20/1.01 1.20/1.01 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 1.20/1.01 1.20/1.01 ------ iProver source info 1.20/1.01 1.20/1.01 git: date: 2020-06-30 10:37:57 +0100 1.20/1.01 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 1.20/1.01 git: non_committed_changes: false 1.20/1.01 git: last_make_outside_of_git: false 1.20/1.01 1.20/1.01 ------ 1.20/1.01 1.20/1.01 ------ Input Options 1.20/1.01 1.20/1.01 --out_options all 1.20/1.01 --tptp_safe_out true 1.20/1.01 --problem_path "" 1.20/1.01 --include_path "" 1.20/1.01 --clausifier res/vclausify_rel 1.20/1.01 --clausifier_options --mode clausify 1.20/1.01 --stdin false 1.20/1.01 --stats_out all 1.20/1.01 1.20/1.01 ------ General Options 1.20/1.01 1.20/1.01 --fof false 1.20/1.01 --time_out_real 125. 1.20/1.01 --time_out_virtual -1. 1.20/1.01 --symbol_type_check false 1.20/1.01 --clausify_out false 1.20/1.01 --sig_cnt_out false 1.20/1.01 --trig_cnt_out false 1.20/1.01 --trig_cnt_out_tolerance 1. 1.20/1.01 --trig_cnt_out_sk_spl false 1.20/1.01 --abstr_cl_out false 1.20/1.01 1.20/1.01 ------ Global Options 1.20/1.01 1.20/1.01 --schedule default 1.20/1.01 --add_important_lit false 1.20/1.01 --prop_solver_per_cl 1000 1.20/1.01 --min_unsat_core false 1.20/1.01 --soft_assumptions false 1.20/1.01 --soft_lemma_size 3 1.20/1.01 --prop_impl_unit_size 0 1.20/1.01 --prop_impl_unit [] 1.20/1.01 --share_sel_clauses true 1.20/1.01 --reset_solvers false 1.20/1.01 --bc_imp_inh [conj_cone] 1.20/1.01 --conj_cone_tolerance 3. 1.20/1.01 --extra_neg_conj none 1.20/1.01 --large_theory_mode true 1.20/1.01 --prolific_symb_bound 200 1.20/1.01 --lt_threshold 2000 1.20/1.01 --clause_weak_htbl true 1.20/1.01 --gc_record_bc_elim false 1.20/1.01 1.20/1.01 ------ Preprocessing Options 1.20/1.01 1.20/1.01 --preprocessing_flag true 1.20/1.01 --time_out_prep_mult 0.1 1.20/1.01 --splitting_mode input 1.20/1.01 --splitting_grd true 1.20/1.01 --splitting_cvd false 1.20/1.01 --splitting_cvd_svl false 1.20/1.01 --splitting_nvd 32 1.20/1.01 --sub_typing true 1.20/1.01 --prep_gs_sim true 1.20/1.01 --prep_unflatten true 1.20/1.01 --prep_res_sim true 1.20/1.01 --prep_upred true 1.20/1.01 --prep_sem_filter exhaustive 1.20/1.01 --prep_sem_filter_out false 1.20/1.01 --pred_elim true 1.20/1.01 --res_sim_input true 1.20/1.01 --eq_ax_congr_red true 1.20/1.01 --pure_diseq_elim true 1.20/1.01 --brand_transform false 1.20/1.01 --non_eq_to_eq false 1.20/1.01 --prep_def_merge true 1.20/1.01 --prep_def_merge_prop_impl false 1.20/1.01 --prep_def_merge_mbd true 1.20/1.01 --prep_def_merge_tr_red false 1.20/1.01 --prep_def_merge_tr_cl false 1.20/1.01 --smt_preprocessing true 1.20/1.01 --smt_ac_axioms fast 1.20/1.01 --preprocessed_out false 1.20/1.01 --preprocessed_stats false 1.20/1.01 1.20/1.01 ------ Abstraction refinement Options 1.20/1.01 1.20/1.01 --abstr_ref [] 1.20/1.01 --abstr_ref_prep false 1.20/1.01 --abstr_ref_until_sat false 1.20/1.01 --abstr_ref_sig_restrict funpre 1.20/1.01 --abstr_ref_af_restrict_to_split_sk false 1.20/1.01 --abstr_ref_under [] 1.20/1.01 1.20/1.01 ------ SAT Options 1.20/1.01 1.20/1.01 --sat_mode false 1.20/1.01 --sat_fm_restart_options "" 1.20/1.01 --sat_gr_def false 1.20/1.01 --sat_epr_types true 1.20/1.01 --sat_non_cyclic_types false 1.20/1.01 --sat_finite_models false 1.20/1.01 --sat_fm_lemmas false 1.20/1.01 --sat_fm_prep false 1.20/1.01 --sat_fm_uc_incr true 1.20/1.01 --sat_out_model small 1.20/1.01 --sat_out_clauses false 1.20/1.01 1.20/1.01 ------ QBF Options 1.20/1.01 1.20/1.01 --qbf_mode false 1.20/1.01 --qbf_elim_univ false 1.20/1.01 --qbf_dom_inst none 1.20/1.01 --qbf_dom_pre_inst false 1.20/1.01 --qbf_sk_in false 1.20/1.01 --qbf_pred_elim true 1.20/1.01 --qbf_split 512 1.20/1.01 1.20/1.01 ------ BMC1 Options 1.20/1.01 1.20/1.01 --bmc1_incremental false 1.20/1.01 --bmc1_axioms reachable_all 1.20/1.01 --bmc1_min_bound 0 1.20/1.01 --bmc1_max_bound -1 1.20/1.01 --bmc1_max_bound_default -1 1.20/1.01 --bmc1_symbol_reachability true 1.20/1.01 --bmc1_property_lemmas false 1.20/1.01 --bmc1_k_induction false 1.20/1.01 --bmc1_non_equiv_states false 1.20/1.01 --bmc1_deadlock false 1.20/1.01 --bmc1_ucm false 1.20/1.01 --bmc1_add_unsat_core none 1.20/1.01 --bmc1_unsat_core_children false 1.20/1.01 --bmc1_unsat_core_extrapolate_axioms false 1.20/1.01 --bmc1_out_stat full 1.20/1.01 --bmc1_ground_init false 1.20/1.01 --bmc1_pre_inst_next_state false 1.20/1.01 --bmc1_pre_inst_state false 1.20/1.01 --bmc1_pre_inst_reach_state false 1.20/1.01 --bmc1_out_unsat_core false 1.20/1.01 --bmc1_aig_witness_out false 1.20/1.01 --bmc1_verbose false 1.20/1.01 --bmc1_dump_clauses_tptp false 1.20/1.01 --bmc1_dump_unsat_core_tptp false 1.20/1.01 --bmc1_dump_file - 1.20/1.01 --bmc1_ucm_expand_uc_limit 128 1.20/1.01 --bmc1_ucm_n_expand_iterations 6 1.20/1.01 --bmc1_ucm_extend_mode 1 1.20/1.01 --bmc1_ucm_init_mode 2 1.20/1.01 --bmc1_ucm_cone_mode none 1.20/1.01 --bmc1_ucm_reduced_relation_type 0 1.20/1.01 --bmc1_ucm_relax_model 4 1.20/1.01 --bmc1_ucm_full_tr_after_sat true 1.20/1.01 --bmc1_ucm_expand_neg_assumptions false 1.20/1.01 --bmc1_ucm_layered_model none 1.20/1.01 --bmc1_ucm_max_lemma_size 10 1.20/1.01 1.20/1.01 ------ AIG Options 1.20/1.01 1.20/1.01 --aig_mode false 1.20/1.01 1.20/1.01 ------ Instantiation Options 1.20/1.01 1.20/1.01 --instantiation_flag true 1.20/1.01 --inst_sos_flag false 1.20/1.01 --inst_sos_phase true 1.20/1.01 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 1.20/1.01 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 1.20/1.01 --inst_lit_sel_side num_symb 1.20/1.01 --inst_solver_per_active 1400 1.20/1.01 --inst_solver_calls_frac 1. 1.20/1.01 --inst_passive_queue_type priority_queues 1.20/1.01 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 1.20/1.01 --inst_passive_queues_freq [25;2] 1.20/1.01 --inst_dismatching true 1.20/1.01 --inst_eager_unprocessed_to_passive true 1.20/1.01 --inst_prop_sim_given true 1.20/1.01 --inst_prop_sim_new false 1.20/1.01 --inst_subs_new false 1.20/1.01 --inst_eq_res_simp false 1.20/1.01 --inst_subs_given false 1.20/1.01 --inst_orphan_elimination true 1.20/1.01 --inst_learning_loop_flag true 1.20/1.01 --inst_learning_start 3000 1.20/1.01 --inst_learning_factor 2 1.20/1.01 --inst_start_prop_sim_after_learn 3 1.20/1.01 --inst_sel_renew solver 1.20/1.01 --inst_lit_activity_flag true 1.20/1.01 --inst_restr_to_given false 1.20/1.01 --inst_activity_threshold 500 1.20/1.01 --inst_out_proof true 1.20/1.01 1.20/1.01 ------ Resolution Options 1.20/1.01 1.20/1.01 --resolution_flag true 1.20/1.01 --res_lit_sel adaptive 1.20/1.01 --res_lit_sel_side none 1.20/1.01 --res_ordering kbo 1.20/1.01 --res_to_prop_solver active 1.20/1.01 --res_prop_simpl_new false 1.20/1.01 --res_prop_simpl_given true 1.20/1.01 --res_passive_queue_type priority_queues 1.20/1.01 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 1.20/1.01 --res_passive_queues_freq [15;5] 1.20/1.01 --res_forward_subs full 1.20/1.01 --res_backward_subs full 1.20/1.01 --res_forward_subs_resolution true 1.20/1.01 --res_backward_subs_resolution true 1.20/1.01 --res_orphan_elimination true 1.20/1.01 --res_time_limit 2. 1.20/1.01 --res_out_proof true 1.20/1.01 1.20/1.01 ------ Superposition Options 1.20/1.01 1.20/1.01 --superposition_flag true 1.20/1.01 --sup_passive_queue_type priority_queues 1.20/1.01 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 1.20/1.01 --sup_passive_queues_freq [8;1;4] 1.20/1.01 --demod_completeness_check fast 1.20/1.01 --demod_use_ground true 1.20/1.01 --sup_to_prop_solver passive 1.20/1.01 --sup_prop_simpl_new true 1.20/1.01 --sup_prop_simpl_given true 1.20/1.01 --sup_fun_splitting false 1.20/1.01 --sup_smt_interval 50000 1.20/1.01 1.20/1.01 ------ Superposition Simplification Setup 1.20/1.01 1.20/1.01 --sup_indices_passive [] 1.20/1.01 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 1.20/1.01 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 1.20/1.01 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 1.20/1.01 --sup_full_triv [TrivRules;PropSubs] 1.20/1.01 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 1.20/1.01 --sup_full_bw [BwDemod] 1.20/1.01 --sup_immed_triv [TrivRules] 1.20/1.01 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 1.20/1.01 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 1.20/1.01 --sup_immed_bw_main [] 1.20/1.01 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 1.20/1.01 --sup_input_triv [Unflattening;TrivRules] 1.20/1.01 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 1.20/1.01 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 1.20/1.01 1.20/1.01 ------ Combination Options 1.20/1.01 1.20/1.01 --comb_res_mult 3 1.20/1.01 --comb_sup_mult 2 1.20/1.01 --comb_inst_mult 10 1.20/1.01 1.20/1.01 ------ Debug Options 1.20/1.01 1.20/1.01 --dbg_backtrace false 1.20/1.01 --dbg_dump_prop_clauses false 1.20/1.01 --dbg_dump_prop_clauses_file - 1.20/1.01 --dbg_out_stat false 1.20/1.01 ------ Parsing... 1.20/1.01 ------ Clausification by vclausify_rel & Parsing by iProver... 1.20/1.01 1.20/1.01 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 4 0s sf_e pe_s pe_e 1.20/1.01 1.20/1.01 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 1.20/1.01 1.20/1.01 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 1.20/1.01 ------ Proving... 1.20/1.01 ------ Problem Properties 1.20/1.01 1.20/1.01 1.20/1.01 clauses 12 1.20/1.01 conjectures 1 1.20/1.01 EPR 6 1.20/1.01 Horn 9 1.20/1.01 unary 5 1.20/1.01 binary 6 1.20/1.01 lits 20 1.20/1.01 lits eq 6 1.20/1.01 fd_pure 0 1.20/1.01 fd_pseudo 0 1.20/1.01 fd_cond 1 1.20/1.01 fd_pseudo_cond 0 1.20/1.01 AC symbols 0 1.20/1.01 1.20/1.01 ------ Schedule dynamic 5 is on 1.20/1.01 1.20/1.01 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 1.20/1.01 1.20/1.01 1.20/1.01 ------ 1.20/1.01 Current options: 1.20/1.01 ------ 1.20/1.01 1.20/1.01 ------ Input Options 1.20/1.01 1.20/1.01 --out_options all 1.20/1.01 --tptp_safe_out true 1.20/1.01 --problem_path "" 1.20/1.01 --include_path "" 1.20/1.01 --clausifier res/vclausify_rel 1.20/1.01 --clausifier_options --mode clausify 1.20/1.01 --stdin false 1.20/1.01 --stats_out all 1.20/1.01 1.20/1.01 ------ General Options 1.20/1.01 1.20/1.01 --fof false 1.20/1.01 --time_out_real 125. 1.20/1.01 --time_out_virtual -1. 1.20/1.01 --symbol_type_check false 1.20/1.01 --clausify_out false 1.20/1.01 --sig_cnt_out false 1.20/1.01 --trig_cnt_out false 1.20/1.01 --trig_cnt_out_tolerance 1. 1.20/1.01 --trig_cnt_out_sk_spl false 1.20/1.01 --abstr_cl_out false 1.20/1.01 1.20/1.01 ------ Global Options 1.20/1.01 1.20/1.01 --schedule default 1.20/1.01 --add_important_lit false 1.20/1.01 --prop_solver_per_cl 1000 1.20/1.01 --min_unsat_core false 1.20/1.01 --soft_assumptions false 1.20/1.01 --soft_lemma_size 3 1.20/1.01 --prop_impl_unit_size 0 1.20/1.01 --prop_impl_unit [] 1.20/1.01 --share_sel_clauses true 1.20/1.01 --reset_solvers false 1.20/1.01 --bc_imp_inh [conj_cone] 1.20/1.01 --conj_cone_tolerance 3. 1.20/1.01 --extra_neg_conj none 1.20/1.01 --large_theory_mode true 1.20/1.01 --prolific_symb_bound 200 1.20/1.01 --lt_threshold 2000 1.20/1.01 --clause_weak_htbl true 1.20/1.01 --gc_record_bc_elim false 1.20/1.01 1.20/1.01 ------ Preprocessing Options 1.20/1.01 1.20/1.01 --preprocessing_flag true 1.20/1.01 --time_out_prep_mult 0.1 1.20/1.01 --splitting_mode input 1.20/1.01 --splitting_grd true 1.20/1.01 --splitting_cvd false 1.20/1.01 --splitting_cvd_svl false 1.20/1.01 --splitting_nvd 32 1.20/1.01 --sub_typing true 1.20/1.01 --prep_gs_sim true 1.20/1.01 --prep_unflatten true 1.20/1.01 --prep_res_sim true 1.20/1.01 --prep_upred true 1.20/1.01 --prep_sem_filter exhaustive 1.20/1.01 --prep_sem_filter_out false 1.20/1.01 --pred_elim true 1.20/1.01 --res_sim_input true 1.20/1.02 --eq_ax_congr_red true 1.20/1.02 --pure_diseq_elim true 1.20/1.02 --brand_transform false 1.20/1.02 --non_eq_to_eq false 1.20/1.02 --prep_def_merge true 1.20/1.02 --prep_def_merge_prop_impl false 1.20/1.02 --prep_def_merge_mbd true 1.20/1.02 --prep_def_merge_tr_red false 1.20/1.02 --prep_def_merge_tr_cl false 1.20/1.02 --smt_preprocessing true 1.20/1.02 --smt_ac_axioms fast 1.20/1.02 --preprocessed_out false 1.20/1.02 --preprocessed_stats false 1.20/1.02 1.20/1.02 ------ Abstraction refinement Options 1.20/1.02 1.20/1.02 --abstr_ref [] 1.20/1.02 --abstr_ref_prep false 1.20/1.02 --abstr_ref_until_sat false 1.20/1.02 --abstr_ref_sig_restrict funpre 1.20/1.02 --abstr_ref_af_restrict_to_split_sk false 1.20/1.02 --abstr_ref_under [] 1.20/1.02 1.20/1.02 ------ SAT Options 1.20/1.02 1.20/1.02 --sat_mode false 1.20/1.02 --sat_fm_restart_options "" 1.20/1.02 --sat_gr_def false 1.20/1.02 --sat_epr_types true 1.20/1.02 --sat_non_cyclic_types false 1.20/1.02 --sat_finite_models false 1.20/1.02 --sat_fm_lemmas false 1.20/1.02 --sat_fm_prep false 1.20/1.02 --sat_fm_uc_incr true 1.20/1.02 --sat_out_model small 1.20/1.02 --sat_out_clauses false 1.20/1.02 1.20/1.02 ------ QBF Options 1.20/1.02 1.20/1.02 --qbf_mode false 1.20/1.02 --qbf_elim_univ false 1.20/1.02 --qbf_dom_inst none 1.20/1.02 --qbf_dom_pre_inst false 1.20/1.02 --qbf_sk_in false 1.20/1.02 --qbf_pred_elim true 1.20/1.02 --qbf_split 512 1.20/1.02 1.20/1.02 ------ BMC1 Options 1.20/1.02 1.20/1.02 --bmc1_incremental false 1.20/1.02 --bmc1_axioms reachable_all 1.20/1.02 --bmc1_min_bound 0 1.20/1.02 --bmc1_max_bound -1 1.20/1.02 --bmc1_max_bound_default -1 1.20/1.02 --bmc1_symbol_reachability true 1.20/1.02 --bmc1_property_lemmas false 1.20/1.02 --bmc1_k_induction false 1.20/1.02 --bmc1_non_equiv_states false 1.20/1.02 --bmc1_deadlock false 1.20/1.02 --bmc1_ucm false 1.20/1.02 --bmc1_add_unsat_core none 1.20/1.02 --bmc1_unsat_core_children false 1.20/1.02 --bmc1_unsat_core_extrapolate_axioms false 1.20/1.02 --bmc1_out_stat full 1.20/1.02 --bmc1_ground_init false 1.20/1.02 --bmc1_pre_inst_next_state false 1.20/1.02 --bmc1_pre_inst_state false 1.20/1.02 --bmc1_pre_inst_reach_state false 1.20/1.02 --bmc1_out_unsat_core false 1.20/1.02 --bmc1_aig_witness_out false 1.20/1.02 --bmc1_verbose false 1.20/1.02 --bmc1_dump_clauses_tptp false 1.20/1.02 --bmc1_dump_unsat_core_tptp false 1.20/1.02 --bmc1_dump_file - 1.20/1.02 --bmc1_ucm_expand_uc_limit 128 1.20/1.02 --bmc1_ucm_n_expand_iterations 6 1.20/1.02 --bmc1_ucm_extend_mode 1 1.20/1.02 --bmc1_ucm_init_mode 2 1.20/1.02 --bmc1_ucm_cone_mode none 1.20/1.02 --bmc1_ucm_reduced_relation_type 0 1.20/1.02 --bmc1_ucm_relax_model 4 1.20/1.02 --bmc1_ucm_full_tr_after_sat true 1.20/1.02 --bmc1_ucm_expand_neg_assumptions false 1.20/1.02 --bmc1_ucm_layered_model none 1.20/1.02 --bmc1_ucm_max_lemma_size 10 1.20/1.02 1.20/1.02 ------ AIG Options 1.20/1.02 1.20/1.02 --aig_mode false 1.20/1.02 1.20/1.02 ------ Instantiation Options 1.20/1.02 1.20/1.02 --instantiation_flag true 1.20/1.02 --inst_sos_flag false 1.20/1.02 --inst_sos_phase true 1.20/1.02 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 1.20/1.02 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 1.20/1.02 --inst_lit_sel_side none 1.20/1.02 --inst_solver_per_active 1400 1.20/1.02 --inst_solver_calls_frac 1. 1.20/1.02 --inst_passive_queue_type priority_queues 1.20/1.02 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 1.20/1.02 --inst_passive_queues_freq [25;2] 1.20/1.02 --inst_dismatching true 1.20/1.02 --inst_eager_unprocessed_to_passive true 1.20/1.02 --inst_prop_sim_given true 1.20/1.02 --inst_prop_sim_new false 1.20/1.02 --inst_subs_new false 1.20/1.02 --inst_eq_res_simp false 1.20/1.02 --inst_subs_given false 1.20/1.02 --inst_orphan_elimination true 1.20/1.02 --inst_learning_loop_flag true 1.20/1.02 --inst_learning_start 3000 1.20/1.02 --inst_learning_factor 2 1.20/1.02 --inst_start_prop_sim_after_learn 3 1.20/1.02 --inst_sel_renew solver 1.20/1.02 --inst_lit_activity_flag true 1.20/1.02 --inst_restr_to_given false 1.20/1.02 --inst_activity_threshold 500 1.20/1.02 --inst_out_proof true 1.20/1.02 1.20/1.02 ------ Resolution Options 1.20/1.02 1.20/1.02 --resolution_flag false 1.20/1.02 --res_lit_sel adaptive 1.20/1.02 --res_lit_sel_side none 1.20/1.02 --res_ordering kbo 1.20/1.02 --res_to_prop_solver active 1.20/1.02 --res_prop_simpl_new false 1.20/1.02 --res_prop_simpl_given true 1.20/1.02 --res_passive_queue_type priority_queues 1.20/1.02 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 1.20/1.02 --res_passive_queues_freq [15;5] 1.20/1.02 --res_forward_subs full 1.20/1.02 --res_backward_subs full 1.20/1.02 --res_forward_subs_resolution true 1.20/1.02 --res_backward_subs_resolution true 1.20/1.02 --res_orphan_elimination true 1.20/1.02 --res_time_limit 2. 1.20/1.02 --res_out_proof true 1.20/1.02 1.20/1.02 ------ Superposition Options 1.20/1.02 1.20/1.02 --superposition_flag true 1.20/1.02 --sup_passive_queue_type priority_queues 1.20/1.02 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 1.20/1.02 --sup_passive_queues_freq [8;1;4] 1.20/1.02 --demod_completeness_check fast 1.20/1.02 --demod_use_ground true 1.20/1.02 --sup_to_prop_solver passive 1.20/1.02 --sup_prop_simpl_new true 1.20/1.02 --sup_prop_simpl_given true 1.20/1.02 --sup_fun_splitting false 1.20/1.02 --sup_smt_interval 50000 1.20/1.02 1.20/1.02 ------ Superposition Simplification Setup 1.20/1.02 1.20/1.02 --sup_indices_passive [] 1.20/1.02 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 1.20/1.02 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 1.20/1.02 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 1.20/1.02 --sup_full_triv [TrivRules;PropSubs] 1.20/1.02 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 1.20/1.02 --sup_full_bw [BwDemod] 1.20/1.02 --sup_immed_triv [TrivRules] 1.20/1.02 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 1.20/1.02 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 1.20/1.02 --sup_immed_bw_main [] 1.20/1.02 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 1.20/1.02 --sup_input_triv [Unflattening;TrivRules] 1.20/1.02 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 1.20/1.02 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 1.20/1.02 1.20/1.02 ------ Combination Options 1.20/1.02 1.20/1.02 --comb_res_mult 3 1.20/1.02 --comb_sup_mult 2 1.20/1.02 --comb_inst_mult 10 1.20/1.02 1.20/1.02 ------ Debug Options 1.20/1.02 1.20/1.02 --dbg_backtrace false 1.20/1.02 --dbg_dump_prop_clauses false 1.20/1.02 --dbg_dump_prop_clauses_file - 1.20/1.02 --dbg_out_stat false 1.20/1.02 1.20/1.02 1.20/1.02 1.20/1.02 1.20/1.02 ------ Proving... 1.20/1.02 1.20/1.02 1.20/1.02 % SZS status Theorem for theBenchmark.p 1.20/1.02 1.20/1.02 % SZS output start CNFRefutation for theBenchmark.p 1.20/1.02 1.20/1.02 fof(f1,conjecture,( 1.20/1.02 ? [X0] : predicate2(X0,kill,'AuntAgatha','AuntAgatha')), 1.20/1.02 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 1.20/1.02 1.20/1.02 fof(f2,negated_conjecture,( 1.20/1.02 ~? [X0] : predicate2(X0,kill,'AuntAgatha','AuntAgatha')), 1.20/1.02 inference(negated_conjecture,[],[f1])). 1.20/1.02 1.20/1.02 fof(f7,plain,( 1.20/1.02 ! [X0] : ~predicate2(X0,kill,'AuntAgatha','AuntAgatha')), 1.20/1.02 inference(ennf_transformation,[],[f2])). 1.20/1.02 1.20/1.02 fof(f19,plain,( 1.20/1.02 ( ! [X0] : (~predicate2(X0,kill,'AuntAgatha','AuntAgatha')) )), 1.20/1.02 inference(cnf_transformation,[],[f7])). 1.20/1.02 1.20/1.02 fof(f3,axiom,( 1.20/1.02 ? [X0,X1,X2] : ($true & predicate1(X1,live,X0) & modifier_pp(X1,in,'DreadburyMansion') & ! [X26,X27] : ((modifier_pp(X27,in,'DreadburyMansion') & predicate1(X27,live,X26) & $true) => ('AuntAgatha' = X26 | 'Charles' = X26 | 'Butler' = X26)) & 'AuntAgatha' != 'Butler' & ! [X23] : ($true => ~! [X24] : ($true => ? [X25] : predicate2(X25,hate,X23,X24))) & ! [X20,X21] : ((predicate2(X21,hate,'AuntAgatha',X20) & $true) => ? [X22] : predicate2(X22,hate,'Butler',X20)) & ! [X17] : ((~? [X19] : (property2(X19,rich,comp_than,'AuntAgatha') & X17 = X19) & $true) => ? [X18] : predicate2(X18,hate,'Butler',X17)) & ! [X15] : (($true & 'Butler' != X15) => ? [X16] : predicate2(X16,hate,'AuntAgatha',X15)) & ~? [X14] : predicate2(X14,hate,'AuntAgatha','Butler') & ! [X11,X12] : ((predicate2(X12,hate,'AuntAgatha',X11) & $true) => ~? [X13] : predicate2(X13,hate,'Charles',X11)) & ! [X7] : ($true => ~? [X8,X9,X10] : ($true & X7 = X10 & property2(X10,rich,comp_than,X8) & predicate2(X9,kill,X7,X8))) & ! [X3] : ($true => ! [X4,X5] : ((predicate2(X5,kill,X3,X4) & $true) => ? [X6] : predicate2(X6,hate,X3,X4))) & predicate2(X2,kill,X0,'AuntAgatha'))), 1.20/1.02 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 1.20/1.02 1.20/1.02 fof(f4,plain,( 1.20/1.02 ? [X0,X1,X2] : ($true & predicate1(X1,live,X0) & modifier_pp(X1,in,'DreadburyMansion') & ! [X3,X4] : ((modifier_pp(X4,in,'DreadburyMansion') & predicate1(X4,live,X3) & $true) => ('AuntAgatha' = X3 | 'Charles' = X3 | 'Butler' = X3)) & 'AuntAgatha' != 'Butler' & ! [X5] : ($true => ~! [X6] : ($true => ? [X7] : predicate2(X7,hate,X5,X6))) & ! [X8,X9] : ((predicate2(X9,hate,'AuntAgatha',X8) & $true) => ? [X10] : predicate2(X10,hate,'Butler',X8)) & ! [X11] : ((~? [X12] : (property2(X12,rich,comp_than,'AuntAgatha') & X11 = X12) & $true) => ? [X13] : predicate2(X13,hate,'Butler',X11)) & ! [X14] : (($true & 'Butler' != X14) => ? [X15] : predicate2(X15,hate,'AuntAgatha',X14)) & ~? [X16] : predicate2(X16,hate,'AuntAgatha','Butler') & ! [X17,X18] : ((predicate2(X18,hate,'AuntAgatha',X17) & $true) => ~? [X19] : predicate2(X19,hate,'Charles',X17)) & ! [X20] : ($true => ~? [X21,X22,X23] : ($true & X20 = X23 & property2(X23,rich,comp_than,X21) & predicate2(X22,kill,X20,X21))) & ! [X24] : ($true => ! [X25,X26] : ((predicate2(X26,kill,X24,X25) & $true) => ? [X27] : predicate2(X27,hate,X24,X25))) & predicate2(X2,kill,X0,'AuntAgatha'))), 1.20/1.02 inference(rectify,[],[f3])). 1.20/1.02 1.20/1.02 fof(f5,plain,( 1.20/1.02 ? [X0,X1,X2] : (predicate1(X1,live,X0) & modifier_pp(X1,in,'DreadburyMansion') & ! [X3,X4] : ((modifier_pp(X4,in,'DreadburyMansion') & predicate1(X4,live,X3)) => ('AuntAgatha' = X3 | 'Charles' = X3 | 'Butler' = X3)) & 'AuntAgatha' != 'Butler' & ! [X5] : ~! [X6] : ? [X7] : predicate2(X7,hate,X5,X6) & ! [X8,X9] : (predicate2(X9,hate,'AuntAgatha',X8) => ? [X10] : predicate2(X10,hate,'Butler',X8)) & ! [X11] : (~? [X12] : (property2(X12,rich,comp_than,'AuntAgatha') & X11 = X12) => ? [X13] : predicate2(X13,hate,'Butler',X11)) & ! [X14] : ('Butler' != X14 => ? [X15] : predicate2(X15,hate,'AuntAgatha',X14)) & ~? [X16] : predicate2(X16,hate,'AuntAgatha','Butler') & ! [X17,X18] : (predicate2(X18,hate,'AuntAgatha',X17) => ~? [X19] : predicate2(X19,hate,'Charles',X17)) & ! [X20] : ~? [X21,X22,X23] : (X20 = X23 & property2(X23,rich,comp_than,X21) & predicate2(X22,kill,X20,X21)) & ! [X24] : ! [X25,X26] : (predicate2(X26,kill,X24,X25) => ? [X27] : predicate2(X27,hate,X24,X25)) & predicate2(X2,kill,X0,'AuntAgatha'))), 1.20/1.02 inference(true_and_false_elimination,[],[f4])). 1.20/1.02 1.20/1.02 fof(f6,plain,( 1.20/1.02 ? [X0,X1,X2] : (predicate1(X1,live,X0) & modifier_pp(X1,in,'DreadburyMansion') & ! [X3,X4] : ((modifier_pp(X4,in,'DreadburyMansion') & predicate1(X4,live,X3)) => ('AuntAgatha' = X3 | 'Charles' = X3 | 'Butler' = X3)) & 'AuntAgatha' != 'Butler' & ! [X5] : ~! [X6] : ? [X7] : predicate2(X7,hate,X5,X6) & ! [X8,X9] : (predicate2(X9,hate,'AuntAgatha',X8) => ? [X10] : predicate2(X10,hate,'Butler',X8)) & ! [X11] : (~? [X12] : (property2(X12,rich,comp_than,'AuntAgatha') & X11 = X12) => ? [X13] : predicate2(X13,hate,'Butler',X11)) & ! [X14] : ('Butler' != X14 => ? [X15] : predicate2(X15,hate,'AuntAgatha',X14)) & ~? [X16] : predicate2(X16,hate,'AuntAgatha','Butler') & ! [X17,X18] : (predicate2(X18,hate,'AuntAgatha',X17) => ~? [X19] : predicate2(X19,hate,'Charles',X17)) & ! [X20] : ~? [X21,X22,X23] : (X20 = X23 & property2(X23,rich,comp_than,X21) & predicate2(X22,kill,X20,X21)) & ! [X24,X25,X26] : (predicate2(X26,kill,X24,X25) => ? [X27] : predicate2(X27,hate,X24,X25)) & predicate2(X2,kill,X0,'AuntAgatha'))), 1.20/1.02 inference(flattening,[],[f5])). 1.20/1.02 1.20/1.02 fof(f8,plain,( 1.20/1.02 ? [X0,X1,X2] : (predicate1(X1,live,X0) & modifier_pp(X1,in,'DreadburyMansion') & ! [X3,X4] : (('AuntAgatha' = X3 | 'Charles' = X3 | 'Butler' = X3) | (~modifier_pp(X4,in,'DreadburyMansion') | ~predicate1(X4,live,X3))) & 'AuntAgatha' != 'Butler' & ! [X5] : ? [X6] : ! [X7] : ~predicate2(X7,hate,X5,X6) & ! [X8,X9] : (? [X10] : predicate2(X10,hate,'Butler',X8) | ~predicate2(X9,hate,'AuntAgatha',X8)) & ! [X11] : (? [X13] : predicate2(X13,hate,'Butler',X11) | ? [X12] : (property2(X12,rich,comp_than,'AuntAgatha') & X11 = X12)) & ! [X14] : (? [X15] : predicate2(X15,hate,'AuntAgatha',X14) | 'Butler' = X14) & ! [X16] : ~predicate2(X16,hate,'AuntAgatha','Butler') & ! [X17,X18] : (! [X19] : ~predicate2(X19,hate,'Charles',X17) | ~predicate2(X18,hate,'AuntAgatha',X17)) & ! [X20] : ! [X21,X22,X23] : (X20 != X23 | ~property2(X23,rich,comp_than,X21) | ~predicate2(X22,kill,X20,X21)) & ! [X24,X25,X26] : (? [X27] : predicate2(X27,hate,X24,X25) | ~predicate2(X26,kill,X24,X25)) & predicate2(X2,kill,X0,'AuntAgatha'))), 1.20/1.02 inference(ennf_transformation,[],[f6])). 1.20/1.02 1.20/1.02 fof(f9,plain,( 1.20/1.02 ? [X0,X1,X2] : (predicate1(X1,live,X0) & modifier_pp(X1,in,'DreadburyMansion') & ! [X3,X4] : ('AuntAgatha' = X3 | 'Charles' = X3 | 'Butler' = X3 | ~modifier_pp(X4,in,'DreadburyMansion') | ~predicate1(X4,live,X3)) & 'AuntAgatha' != 'Butler' & ! [X5] : ? [X6] : ! [X7] : ~predicate2(X7,hate,X5,X6) & ! [X8,X9] : (? [X10] : predicate2(X10,hate,'Butler',X8) | ~predicate2(X9,hate,'AuntAgatha',X8)) & ! [X11] : (? [X13] : predicate2(X13,hate,'Butler',X11) | ? [X12] : (property2(X12,rich,comp_than,'AuntAgatha') & X11 = X12)) & ! [X14] : (? [X15] : predicate2(X15,hate,'AuntAgatha',X14) | 'Butler' = X14) & ! [X16] : ~predicate2(X16,hate,'AuntAgatha','Butler') & ! [X17,X18] : (! [X19] : ~predicate2(X19,hate,'Charles',X17) | ~predicate2(X18,hate,'AuntAgatha',X17)) & ! [X20,X21,X22,X23] : (X20 != X23 | ~property2(X23,rich,comp_than,X21) | ~predicate2(X22,kill,X20,X21)) & ! [X24,X25,X26] : (? [X27] : predicate2(X27,hate,X24,X25) | ~predicate2(X26,kill,X24,X25)) & predicate2(X2,kill,X0,'AuntAgatha'))), 1.20/1.02 inference(flattening,[],[f8])). 1.20/1.02 1.20/1.02 fof(f10,plain,( 1.20/1.02 ? [X0,X1,X2] : (predicate1(X1,live,X0) & modifier_pp(X1,in,'DreadburyMansion') & ! [X3,X4] : ('AuntAgatha' = X3 | 'Charles' = X3 | 'Butler' = X3 | ~modifier_pp(X4,in,'DreadburyMansion') | ~predicate1(X4,live,X3)) & 'AuntAgatha' != 'Butler' & ! [X5] : ? [X6] : ! [X7] : ~predicate2(X7,hate,X5,X6) & ! [X8,X9] : (? [X10] : predicate2(X10,hate,'Butler',X8) | ~predicate2(X9,hate,'AuntAgatha',X8)) & ! [X11] : (? [X12] : predicate2(X12,hate,'Butler',X11) | ? [X13] : (property2(X13,rich,comp_than,'AuntAgatha') & X11 = X13)) & ! [X14] : (? [X15] : predicate2(X15,hate,'AuntAgatha',X14) | 'Butler' = X14) & ! [X16] : ~predicate2(X16,hate,'AuntAgatha','Butler') & ! [X17,X18] : (! [X19] : ~predicate2(X19,hate,'Charles',X17) | ~predicate2(X18,hate,'AuntAgatha',X17)) & ! [X20,X21,X22,X23] : (X20 != X23 | ~property2(X23,rich,comp_than,X21) | ~predicate2(X22,kill,X20,X21)) & ! [X24,X25,X26] : (? [X27] : predicate2(X27,hate,X24,X25) | ~predicate2(X26,kill,X24,X25)) & predicate2(X2,kill,X0,'AuntAgatha'))), 1.20/1.02 inference(rectify,[],[f9])). 1.20/1.02 1.20/1.02 fof(f17,plain,( 1.20/1.02 ! [X25,X24] : (? [X27] : predicate2(X27,hate,X24,X25) => predicate2(sK8(X24,X25),hate,X24,X25))), 1.20/1.02 introduced(choice_axiom,[])). 1.20/1.02 1.20/1.02 fof(f16,plain,( 1.20/1.02 ! [X14] : (? [X15] : predicate2(X15,hate,'AuntAgatha',X14) => predicate2(sK7(X14),hate,'AuntAgatha',X14))), 1.20/1.02 introduced(choice_axiom,[])). 1.20/1.02 1.20/1.02 fof(f15,plain,( 1.20/1.02 ! [X11] : (? [X13] : (property2(X13,rich,comp_than,'AuntAgatha') & X11 = X13) => (property2(sK6(X11),rich,comp_than,'AuntAgatha') & sK6(X11) = X11))), 1.20/1.02 introduced(choice_axiom,[])). 1.20/1.02 1.20/1.02 fof(f14,plain,( 1.20/1.02 ! [X11] : (? [X12] : predicate2(X12,hate,'Butler',X11) => predicate2(sK5(X11),hate,'Butler',X11))), 1.20/1.02 introduced(choice_axiom,[])). 1.20/1.02 1.20/1.02 fof(f13,plain,( 1.20/1.02 ! [X8] : (? [X10] : predicate2(X10,hate,'Butler',X8) => predicate2(sK4(X8),hate,'Butler',X8))), 1.20/1.02 introduced(choice_axiom,[])). 1.20/1.02 1.20/1.02 fof(f12,plain,( 1.20/1.02 ! [X5] : (? [X6] : ! [X7] : ~predicate2(X7,hate,X5,X6) => ! [X7] : ~predicate2(X7,hate,X5,sK3(X5)))), 1.20/1.02 introduced(choice_axiom,[])). 1.20/1.02 1.20/1.02 fof(f11,plain,( 1.20/1.02 ? [X0,X1,X2] : (predicate1(X1,live,X0) & modifier_pp(X1,in,'DreadburyMansion') & ! [X3,X4] : ('AuntAgatha' = X3 | 'Charles' = X3 | 'Butler' = X3 | ~modifier_pp(X4,in,'DreadburyMansion') | ~predicate1(X4,live,X3)) & 'AuntAgatha' != 'Butler' & ! [X5] : ? [X6] : ! [X7] : ~predicate2(X7,hate,X5,X6) & ! [X8,X9] : (? [X10] : predicate2(X10,hate,'Butler',X8) | ~predicate2(X9,hate,'AuntAgatha',X8)) & ! [X11] : (? [X12] : predicate2(X12,hate,'Butler',X11) | ? [X13] : (property2(X13,rich,comp_than,'AuntAgatha') & X11 = X13)) & ! [X14] : (? [X15] : predicate2(X15,hate,'AuntAgatha',X14) | 'Butler' = X14) & ! [X16] : ~predicate2(X16,hate,'AuntAgatha','Butler') & ! [X17,X18] : (! [X19] : ~predicate2(X19,hate,'Charles',X17) | ~predicate2(X18,hate,'AuntAgatha',X17)) & ! [X20,X21,X22,X23] : (X20 != X23 | ~property2(X23,rich,comp_than,X21) | ~predicate2(X22,kill,X20,X21)) & ! [X24,X25,X26] : (? [X27] : predicate2(X27,hate,X24,X25) | ~predicate2(X26,kill,X24,X25)) & predicate2(X2,kill,X0,'AuntAgatha')) => (predicate1(sK1,live,sK0) & modifier_pp(sK1,in,'DreadburyMansion') & ! [X3,X4] : ('AuntAgatha' = X3 | 'Charles' = X3 | 'Butler' = X3 | ~modifier_pp(X4,in,'DreadburyMansion') | ~predicate1(X4,live,X3)) & 'AuntAgatha' != 'Butler' & ! [X5] : ? [X6] : ! [X7] : ~predicate2(X7,hate,X5,X6) & ! [X8,X9] : (? [X10] : predicate2(X10,hate,'Butler',X8) | ~predicate2(X9,hate,'AuntAgatha',X8)) & ! [X11] : (? [X12] : predicate2(X12,hate,'Butler',X11) | ? [X13] : (property2(X13,rich,comp_than,'AuntAgatha') & X11 = X13)) & ! [X14] : (? [X15] : predicate2(X15,hate,'AuntAgatha',X14) | 'Butler' = X14) & ! [X16] : ~predicate2(X16,hate,'AuntAgatha','Butler') & ! [X17,X18] : (! [X19] : ~predicate2(X19,hate,'Charles',X17) | ~predicate2(X18,hate,'AuntAgatha',X17)) & ! [X20,X21,X22,X23] : (X20 != X23 | ~property2(X23,rich,comp_than,X21) | ~predicate2(X22,kill,X20,X21)) & ! [X24,X25,X26] : (? [X27] : predicate2(X27,hate,X24,X25) | ~predicate2(X26,kill,X24,X25)) & predicate2(sK2,kill,sK0,'AuntAgatha'))), 1.20/1.02 introduced(choice_axiom,[])). 1.20/1.02 1.20/1.02 fof(f18,plain,( 1.20/1.02 predicate1(sK1,live,sK0) & modifier_pp(sK1,in,'DreadburyMansion') & ! [X3,X4] : ('AuntAgatha' = X3 | 'Charles' = X3 | 'Butler' = X3 | ~modifier_pp(X4,in,'DreadburyMansion') | ~predicate1(X4,live,X3)) & 'AuntAgatha' != 'Butler' & ! [X5] : ! [X7] : ~predicate2(X7,hate,X5,sK3(X5)) & ! [X8,X9] : (predicate2(sK4(X8),hate,'Butler',X8) | ~predicate2(X9,hate,'AuntAgatha',X8)) & ! [X11] : (predicate2(sK5(X11),hate,'Butler',X11) | (property2(sK6(X11),rich,comp_than,'AuntAgatha') & sK6(X11) = X11)) & ! [X14] : (predicate2(sK7(X14),hate,'AuntAgatha',X14) | 'Butler' = X14) & ! [X16] : ~predicate2(X16,hate,'AuntAgatha','Butler') & ! [X17,X18] : (! [X19] : ~predicate2(X19,hate,'Charles',X17) | ~predicate2(X18,hate,'AuntAgatha',X17)) & ! [X20,X21,X22,X23] : (X20 != X23 | ~property2(X23,rich,comp_than,X21) | ~predicate2(X22,kill,X20,X21)) & ! [X24,X25,X26] : (predicate2(sK8(X24,X25),hate,X24,X25) | ~predicate2(X26,kill,X24,X25)) & predicate2(sK2,kill,sK0,'AuntAgatha')), 1.20/1.02 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f10,f17,f16,f15,f14,f13,f12,f11])). 1.20/1.02 1.20/1.02 fof(f20,plain,( 1.20/1.02 predicate2(sK2,kill,sK0,'AuntAgatha')), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 fof(f21,plain,( 1.20/1.02 ( ! [X26,X24,X25] : (predicate2(sK8(X24,X25),hate,X24,X25) | ~predicate2(X26,kill,X24,X25)) )), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 fof(f25,plain,( 1.20/1.02 ( ! [X14] : (predicate2(sK7(X14),hate,'AuntAgatha',X14) | 'Butler' = X14) )), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 fof(f33,plain,( 1.20/1.02 predicate1(sK1,live,sK0)), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 fof(f31,plain,( 1.20/1.02 ( ! [X4,X3] : ('AuntAgatha' = X3 | 'Charles' = X3 | 'Butler' = X3 | ~modifier_pp(X4,in,'DreadburyMansion') | ~predicate1(X4,live,X3)) )), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 fof(f32,plain,( 1.20/1.02 modifier_pp(sK1,in,'DreadburyMansion')), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 fof(f28,plain,( 1.20/1.02 ( ! [X8,X9] : (predicate2(sK4(X8),hate,'Butler',X8) | ~predicate2(X9,hate,'AuntAgatha',X8)) )), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 fof(f29,plain,( 1.20/1.02 ( ! [X7,X5] : (~predicate2(X7,hate,X5,sK3(X5))) )), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 fof(f26,plain,( 1.20/1.02 ( ! [X11] : (predicate2(sK5(X11),hate,'Butler',X11) | sK6(X11) = X11) )), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 fof(f27,plain,( 1.20/1.02 ( ! [X11] : (predicate2(sK5(X11),hate,'Butler',X11) | property2(sK6(X11),rich,comp_than,'AuntAgatha')) )), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 fof(f22,plain,( 1.20/1.02 ( ! [X23,X21,X22,X20] : (X20 != X23 | ~property2(X23,rich,comp_than,X21) | ~predicate2(X22,kill,X20,X21)) )), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 fof(f34,plain,( 1.20/1.02 ( ! [X23,X21,X22] : (~property2(X23,rich,comp_than,X21) | ~predicate2(X22,kill,X23,X21)) )), 1.20/1.02 inference(equality_resolution,[],[f22])). 1.20/1.02 1.20/1.02 fof(f23,plain,( 1.20/1.02 ( ! [X19,X17,X18] : (~predicate2(X19,hate,'Charles',X17) | ~predicate2(X18,hate,'AuntAgatha',X17)) )), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 fof(f30,plain,( 1.20/1.02 'AuntAgatha' != 'Butler'), 1.20/1.02 inference(cnf_transformation,[],[f18])). 1.20/1.02 1.20/1.02 cnf(c_0,negated_conjecture, 1.20/1.02 ( ~ predicate2(X0,kill,AuntAgatha,AuntAgatha) ), 1.20/1.02 inference(cnf_transformation,[],[f19]) ). 1.20/1.02 1.20/1.02 cnf(c_1501,plain, 1.20/1.02 ( ~ predicate2(sK2,kill,AuntAgatha,AuntAgatha) ), 1.20/1.02 inference(instantiation,[status(thm)],[c_0]) ). 1.20/1.02 1.20/1.02 cnf(c_14,plain, 1.20/1.02 ( predicate2(sK2,kill,sK0,AuntAgatha) ), 1.20/1.02 inference(cnf_transformation,[],[f20]) ). 1.20/1.02 1.20/1.02 cnf(c_434,plain, 1.20/1.02 ( predicate2(sK2,kill,sK0,AuntAgatha) = iProver_top ), 1.20/1.02 inference(predicate_to_equality,[status(thm)],[c_14]) ). 1.20/1.02 1.20/1.02 cnf(c_13,plain, 1.20/1.02 ( ~ predicate2(X0,kill,X1,X2) | predicate2(sK8(X1,X2),hate,X1,X2) ), 1.20/1.02 inference(cnf_transformation,[],[f21]) ). 1.20/1.02 1.20/1.02 cnf(c_435,plain, 1.20/1.02 ( predicate2(X0,kill,X1,X2) != iProver_top 1.20/1.02 | predicate2(sK8(X1,X2),hate,X1,X2) = iProver_top ), 1.20/1.02 inference(predicate_to_equality,[status(thm)],[c_13]) ). 1.20/1.02 1.20/1.02 cnf(c_773,plain, 1.20/1.02 ( predicate2(sK8(sK0,AuntAgatha),hate,sK0,AuntAgatha) = iProver_top ), 1.20/1.02 inference(superposition,[status(thm)],[c_434,c_435]) ). 1.20/1.02 1.20/1.02 cnf(c_9,plain, 1.20/1.02 ( predicate2(sK7(X0),hate,AuntAgatha,X0) | Butler = X0 ), 1.20/1.02 inference(cnf_transformation,[],[f25]) ). 1.20/1.02 1.20/1.02 cnf(c_438,plain, 1.20/1.02 ( Butler = X0 1.20/1.02 | predicate2(sK7(X0),hate,AuntAgatha,X0) = iProver_top ), 1.20/1.02 inference(predicate_to_equality,[status(thm)],[c_9]) ). 1.20/1.02 1.20/1.02 cnf(c_1,plain, 1.20/1.02 ( predicate1(sK1,live,sK0) ), 1.20/1.02 inference(cnf_transformation,[],[f33]) ). 1.20/1.02 1.20/1.02 cnf(c_3,plain, 1.20/1.02 ( ~ modifier_pp(X0,in,DreadburyMansion) 1.20/1.02 | ~ predicate1(X0,live,X1) 1.20/1.02 | Butler = X1 1.20/1.02 | Charles = X1 1.20/1.02 | AuntAgatha = X1 ), 1.20/1.02 inference(cnf_transformation,[],[f31]) ). 1.20/1.02 1.20/1.02 cnf(c_174,plain, 1.20/1.02 ( ~ modifier_pp(X0,in,DreadburyMansion) 1.20/1.02 | Butler = X1 1.20/1.02 | Charles = X1 1.20/1.02 | sK0 != X1 1.20/1.02 | live != live 1.20/1.02 | sK1 != X0 1.20/1.02 | AuntAgatha = X1 ), 1.20/1.02 inference(resolution_lifted,[status(thm)],[c_1,c_3]) ). 1.20/1.02 1.20/1.02 cnf(c_175,plain, 1.20/1.02 ( ~ modifier_pp(sK1,in,DreadburyMansion) 1.20/1.02 | Butler = sK0 1.20/1.02 | Charles = sK0 1.20/1.02 | AuntAgatha = sK0 ), 1.20/1.02 inference(unflattening,[status(thm)],[c_174]) ). 1.20/1.02 1.20/1.02 cnf(c_2,plain, 1.20/1.02 ( modifier_pp(sK1,in,DreadburyMansion) ), 1.20/1.02 inference(cnf_transformation,[],[f32]) ). 1.20/1.02 1.20/1.02 cnf(c_177,plain, 1.20/1.02 ( Butler = sK0 | Charles = sK0 | AuntAgatha = sK0 ), 1.20/1.02 inference(global_propositional_subsumption, 1.20/1.02 [status(thm)], 1.20/1.02 [c_175,c_2]) ). 1.20/1.02 1.20/1.02 cnf(c_6,plain, 1.20/1.02 ( ~ predicate2(X0,hate,AuntAgatha,X1) 1.20/1.02 | predicate2(sK4(X1),hate,Butler,X1) ), 1.20/1.02 inference(cnf_transformation,[],[f28]) ). 1.20/1.02 1.20/1.02 cnf(c_440,plain, 1.20/1.02 ( predicate2(X0,hate,AuntAgatha,X1) != iProver_top 1.20/1.02 | predicate2(sK4(X1),hate,Butler,X1) = iProver_top ), 1.20/1.02 inference(predicate_to_equality,[status(thm)],[c_6]) ). 1.20/1.02 1.20/1.02 cnf(c_715,plain, 1.20/1.02 ( Butler = X0 | predicate2(sK4(X0),hate,Butler,X0) = iProver_top ), 1.20/1.02 inference(superposition,[status(thm)],[c_438,c_440]) ). 1.20/1.02 1.20/1.02 cnf(c_5,plain, 1.20/1.02 ( ~ predicate2(X0,hate,X1,sK3(X1)) ), 1.20/1.02 inference(cnf_transformation,[],[f29]) ). 1.20/1.02 1.20/1.02 cnf(c_441,plain, 1.20/1.02 ( predicate2(X0,hate,X1,sK3(X1)) != iProver_top ), 1.20/1.02 inference(predicate_to_equality,[status(thm)],[c_5]) ). 1.20/1.02 1.20/1.02 cnf(c_983,plain, 1.20/1.02 ( sK3(Butler) = Butler ), 1.20/1.02 inference(superposition,[status(thm)],[c_715,c_441]) ). 1.20/1.02 1.20/1.02 cnf(c_8,plain, 1.20/1.02 ( predicate2(sK5(X0),hate,Butler,X0) | sK6(X0) = X0 ), 1.20/1.02 inference(cnf_transformation,[],[f26]) ). 1.20/1.02 1.20/1.02 cnf(c_439,plain, 1.20/1.02 ( sK6(X0) = X0 | predicate2(sK5(X0),hate,Butler,X0) = iProver_top ), 1.20/1.02 inference(predicate_to_equality,[status(thm)],[c_8]) ). 1.20/1.02 1.20/1.02 cnf(c_756,plain, 1.20/1.02 ( sK6(sK3(Butler)) = sK3(Butler) ), 1.20/1.02 inference(superposition,[status(thm)],[c_439,c_441]) ). 1.20/1.02 1.20/1.02 cnf(c_7,plain, 1.20/1.02 ( property2(sK6(X0),rich,comp_than,AuntAgatha) 1.20/1.02 | predicate2(sK5(X0),hate,Butler,X0) ), 1.20/1.02 inference(cnf_transformation,[],[f27]) ). 1.20/1.02 1.20/1.02 cnf(c_12,plain, 1.20/1.02 ( ~ property2(X0,rich,comp_than,X1) | ~ predicate2(X2,kill,X0,X1) ), 1.20/1.02 inference(cnf_transformation,[],[f34]) ). 1.20/1.02 1.20/1.02 cnf(c_159,plain, 1.20/1.02 ( ~ predicate2(X0,kill,X1,X2) 1.20/1.02 | predicate2(sK5(X3),hate,Butler,X3) 1.20/1.02 | sK6(X3) != X1 1.20/1.02 | comp_than != comp_than 1.20/1.02 | rich != rich 1.20/1.02 | AuntAgatha != X2 ), 1.20/1.02 inference(resolution_lifted,[status(thm)],[c_7,c_12]) ). 1.20/1.02 1.20/1.02 cnf(c_160,plain, 1.20/1.02 ( ~ predicate2(X0,kill,sK6(X1),AuntAgatha) 1.20/1.02 | predicate2(sK5(X1),hate,Butler,X1) ), 1.20/1.02 inference(unflattening,[status(thm)],[c_159]) ). 1.20/1.02 1.20/1.02 cnf(c_433,plain, 1.20/1.02 ( predicate2(X0,kill,sK6(X1),AuntAgatha) != iProver_top 1.20/1.02 | predicate2(sK5(X1),hate,Butler,X1) = iProver_top ), 1.20/1.02 inference(predicate_to_equality,[status(thm)],[c_160]) ). 1.20/1.02 1.20/1.02 cnf(c_832,plain, 1.20/1.02 ( predicate2(X0,kill,sK3(Butler),AuntAgatha) != iProver_top 1.20/1.02 | predicate2(sK5(sK3(Butler)),hate,Butler,sK3(Butler)) = iProver_top ), 1.20/1.02 inference(superposition,[status(thm)],[c_756,c_433]) ). 1.20/1.02 1.20/1.02 cnf(c_522,plain, 1.20/1.02 ( ~ predicate2(sK5(sK3(Butler)),hate,Butler,sK3(Butler)) ), 1.20/1.02 inference(instantiation,[status(thm)],[c_5]) ). 1.20/1.02 1.20/1.02 cnf(c_525,plain, 1.20/1.02 ( predicate2(sK5(sK3(Butler)),hate,Butler,sK3(Butler)) != iProver_top ), 1.20/1.02 inference(predicate_to_equality,[status(thm)],[c_522]) ). 1.20/1.02 1.20/1.02 cnf(c_890,plain, 1.20/1.02 ( predicate2(X0,kill,sK3(Butler),AuntAgatha) != iProver_top ), 1.20/1.02 inference(global_propositional_subsumption, 1.20/1.02 [status(thm)], 1.20/1.02 [c_832,c_525]) ). 1.20/1.02 1.20/1.02 cnf(c_998,plain, 1.20/1.02 ( predicate2(X0,kill,Butler,AuntAgatha) != iProver_top ), 1.20/1.02 inference(demodulation,[status(thm)],[c_983,c_890]) ). 1.20/1.02 1.20/1.02 cnf(c_1069,plain, 1.20/1.02 ( Charles = sK0 1.20/1.02 | sK0 = AuntAgatha 1.20/1.02 | predicate2(X0,kill,sK0,AuntAgatha) != iProver_top ), 1.20/1.02 inference(superposition,[status(thm)],[c_177,c_998]) ). 1.20/1.02 1.20/1.02 cnf(c_1414,plain, 1.20/1.02 ( Charles = sK0 | sK0 = AuntAgatha ), 1.20/1.02 inference(superposition,[status(thm)],[c_434,c_1069]) ). 1.20/1.02 1.20/1.02 cnf(c_11,plain, 1.20/1.02 ( ~ predicate2(X0,hate,Charles,X1) 1.20/1.02 | ~ predicate2(X2,hate,AuntAgatha,X1) ), 1.20/1.02 inference(cnf_transformation,[],[f23]) ). 1.20/1.02 1.20/1.02 cnf(c_436,plain, 1.20/1.02 ( predicate2(X0,hate,Charles,X1) != iProver_top 1.20/1.02 | predicate2(X2,hate,AuntAgatha,X1) != iProver_top ), 1.20/1.02 inference(predicate_to_equality,[status(thm)],[c_11]) ). 1.20/1.02 1.20/1.02 cnf(c_1417,plain, 1.20/1.02 ( sK0 = AuntAgatha 1.20/1.02 | predicate2(X0,hate,sK0,X1) != iProver_top 1.20/1.02 | predicate2(X2,hate,AuntAgatha,X1) != iProver_top ), 1.20/1.02 inference(superposition,[status(thm)],[c_1414,c_436]) ). 1.20/1.02 1.20/1.02 cnf(c_1466,plain, 1.20/1.02 ( Butler = X0 1.20/1.02 | sK0 = AuntAgatha 1.20/1.02 | predicate2(X1,hate,sK0,X0) != iProver_top ), 1.20/1.02 inference(superposition,[status(thm)],[c_438,c_1417]) ). 1.20/1.02 1.20/1.02 cnf(c_1474,plain, 1.20/1.02 ( Butler = AuntAgatha | sK0 = AuntAgatha ), 1.20/1.02 inference(superposition,[status(thm)],[c_773,c_1466]) ). 1.20/1.02 1.20/1.02 cnf(c_264,plain, 1.20/1.02 ( ~ predicate2(X0,X1,X2,X3) 1.20/1.02 | predicate2(X4,X5,X6,X7) 1.20/1.02 | X4 != X0 1.20/1.02 | X5 != X1 1.20/1.02 | X6 != X2 1.20/1.02 | X7 != X3 ), 1.20/1.02 theory(equality) ). 1.20/1.02 1.20/1.02 cnf(c_545,plain, 1.20/1.02 ( predicate2(X0,X1,X2,X3) 1.20/1.02 | ~ predicate2(sK2,kill,sK0,AuntAgatha) 1.20/1.02 | X0 != sK2 1.20/1.02 | X2 != sK0 1.20/1.02 | X3 != AuntAgatha 1.20/1.02 | X1 != kill ), 1.20/1.02 inference(instantiation,[status(thm)],[c_264]) ). 1.20/1.02 1.20/1.02 cnf(c_591,plain, 1.20/1.02 ( predicate2(sK2,X0,X1,X2) 1.20/1.02 | ~ predicate2(sK2,kill,sK0,AuntAgatha) 1.20/1.02 | X1 != sK0 1.20/1.02 | X2 != AuntAgatha 1.20/1.02 | X0 != kill 1.20/1.02 | sK2 != sK2 ), 1.20/1.02 inference(instantiation,[status(thm)],[c_545]) ). 1.20/1.02 1.20/1.02 cnf(c_1124,plain, 1.20/1.02 ( predicate2(sK2,kill,X0,X1) 1.20/1.02 | ~ predicate2(sK2,kill,sK0,AuntAgatha) 1.20/1.02 | X0 != sK0 1.20/1.02 | X1 != AuntAgatha 1.20/1.02 | sK2 != sK2 1.20/1.02 | kill != kill ), 1.20/1.02 inference(instantiation,[status(thm)],[c_591]) ). 1.20/1.02 1.20/1.02 cnf(c_1126,plain, 1.20/1.02 ( ~ predicate2(sK2,kill,sK0,AuntAgatha) 1.20/1.02 | predicate2(sK2,kill,AuntAgatha,AuntAgatha) 1.20/1.02 | sK2 != sK2 1.20/1.02 | AuntAgatha != sK0 1.20/1.02 | AuntAgatha != AuntAgatha 1.20/1.02 | kill != kill ), 1.20/1.02 inference(instantiation,[status(thm)],[c_1124]) ). 1.20/1.02 1.20/1.02 cnf(c_262,plain,( X0 = X0 ),theory(equality) ). 1.20/1.02 1.20/1.02 cnf(c_782,plain, 1.20/1.02 ( kill = kill ), 1.20/1.02 inference(instantiation,[status(thm)],[c_262]) ). 1.20/1.02 1.20/1.02 cnf(c_592,plain, 1.20/1.02 ( sK2 = sK2 ), 1.20/1.02 inference(instantiation,[status(thm)],[c_262]) ). 1.20/1.02 1.20/1.02 cnf(c_263,plain,( X0 != X1 | X2 != X1 | X2 = X0 ),theory(equality) ). 1.20/1.02 1.20/1.02 cnf(c_578,plain, 1.20/1.02 ( sK0 != X0 | AuntAgatha != X0 | AuntAgatha = sK0 ), 1.20/1.02 inference(instantiation,[status(thm)],[c_263]) ). 1.20/1.02 1.20/1.02 cnf(c_579,plain, 1.20/1.02 ( sK0 != AuntAgatha | AuntAgatha = sK0 | AuntAgatha != AuntAgatha ), 1.20/1.02 inference(instantiation,[status(thm)],[c_578]) ). 1.20/1.02 1.20/1.02 cnf(c_267,plain, 1.20/1.02 ( AuntAgatha = AuntAgatha ), 1.20/1.02 inference(instantiation,[status(thm)],[c_262]) ). 1.20/1.02 1.20/1.02 cnf(c_4,plain, 1.20/1.02 ( Butler != AuntAgatha ), 1.20/1.02 inference(cnf_transformation,[],[f30]) ). 1.20/1.02 1.20/1.02 cnf(contradiction,plain, 1.20/1.02 ( $false ), 1.20/1.02 inference(minisat, 1.20/1.02 [status(thm)], 1.20/1.02 [c_1501,c_1474,c_1126,c_782,c_592,c_579,c_267,c_4,c_14]) ). 1.20/1.02 1.20/1.02 1.20/1.02 % SZS output end CNFRefutation for theBenchmark.p 1.20/1.02 1.20/1.02 ------ Statistics 1.20/1.02 1.20/1.02 ------ General 1.20/1.02 1.20/1.02 abstr_ref_over_cycles: 0 1.20/1.02 abstr_ref_under_cycles: 0 1.20/1.02 gc_basic_clause_elim: 0 1.20/1.02 forced_gc_time: 0 1.20/1.02 parsing_time: 0.008 1.20/1.02 unif_index_cands_time: 0. 1.20/1.02 unif_index_add_time: 0. 1.20/1.02 orderings_time: 0. 1.20/1.02 out_proof_time: 0.006 1.20/1.02 total_time: 0.109 1.20/1.02 num_of_symbols: 54 1.20/1.02 num_of_terms: 1308 1.20/1.02 1.20/1.02 ------ Preprocessing 1.20/1.02 1.20/1.02 num_of_splits: 0 1.20/1.02 num_of_split_atoms: 0 1.20/1.02 num_of_reused_defs: 0 1.20/1.02 num_eq_ax_congr_red: 21 1.20/1.02 num_of_sem_filtered_clauses: 1 1.20/1.02 num_of_subtypes: 0 1.20/1.02 monotx_restored_types: 0 1.20/1.02 sat_num_of_epr_types: 0 1.20/1.02 sat_num_of_non_cyclic_types: 0 1.20/1.02 sat_guarded_non_collapsed_types: 0 1.20/1.02 num_pure_diseq_elim: 0 1.20/1.02 simp_replaced_by: 0 1.20/1.02 res_preprocessed: 58 1.20/1.02 prep_upred: 0 1.20/1.02 prep_unflattend: 4 1.20/1.02 smt_new_axioms: 0 1.20/1.02 pred_elim_cands: 1 1.20/1.02 pred_elim: 3 1.20/1.02 pred_elim_cl: 3 1.20/1.02 pred_elim_cycles: 5 1.20/1.02 merged_defs: 0 1.20/1.02 merged_defs_ncl: 0 1.20/1.02 bin_hyper_res: 0 1.20/1.02 prep_cycles: 4 1.20/1.02 pred_elim_time: 0.001 1.20/1.02 splitting_time: 0. 1.20/1.02 sem_filter_time: 0. 1.20/1.02 monotx_time: 0.013 1.20/1.02 subtype_inf_time: 0. 1.20/1.02 1.20/1.02 ------ Problem properties 1.20/1.02 1.20/1.02 clauses: 12 1.20/1.02 conjectures: 1 1.20/1.02 epr: 6 1.20/1.02 horn: 9 1.20/1.02 ground: 3 1.20/1.02 unary: 5 1.20/1.02 binary: 6 1.20/1.02 lits: 20 1.20/1.02 lits_eq: 6 1.20/1.02 fd_pure: 0 1.20/1.02 fd_pseudo: 0 1.20/1.02 fd_cond: 1 1.20/1.02 fd_pseudo_cond: 0 1.20/1.02 ac_symbols: 0 1.20/1.02 1.20/1.02 ------ Propositional Solver 1.20/1.02 1.20/1.02 prop_solver_calls: 30 1.20/1.02 prop_fast_solver_calls: 291 1.20/1.02 smt_solver_calls: 0 1.20/1.02 smt_fast_solver_calls: 0 1.20/1.02 prop_num_of_clauses: 520 1.20/1.02 prop_preprocess_simplified: 2202 1.20/1.02 prop_fo_subsumed: 2 1.20/1.02 prop_solver_time: 0. 1.20/1.02 smt_solver_time: 0. 1.20/1.02 smt_fast_solver_time: 0. 1.20/1.02 prop_fast_solver_time: 0. 1.20/1.02 prop_unsat_core_time: 0. 1.20/1.02 1.20/1.02 ------ QBF 1.20/1.02 1.20/1.02 qbf_q_res: 0 1.20/1.02 qbf_num_tautologies: 0 1.20/1.02 qbf_prep_cycles: 0 1.20/1.02 1.20/1.02 ------ BMC1 1.20/1.02 1.20/1.02 bmc1_current_bound: -1 1.20/1.02 bmc1_last_solved_bound: -1 1.20/1.02 bmc1_unsat_core_size: -1 1.20/1.02 bmc1_unsat_core_parents_size: -1 1.20/1.02 bmc1_merge_next_fun: 0 1.20/1.02 bmc1_unsat_core_clauses_time: 0. 1.20/1.02 1.20/1.02 ------ Instantiation 1.20/1.02 1.20/1.02 inst_num_of_clauses: 208 1.20/1.02 inst_num_in_passive: 49 1.20/1.02 inst_num_in_active: 145 1.20/1.02 inst_num_in_unprocessed: 13 1.20/1.02 inst_num_of_loops: 167 1.20/1.02 inst_num_of_learning_restarts: 0 1.20/1.02 inst_num_moves_active_passive: 15 1.20/1.02 inst_lit_activity: 0 1.20/1.02 inst_lit_activity_moves: 0 1.20/1.02 inst_num_tautologies: 0 1.20/1.02 inst_num_prop_implied: 0 1.20/1.02 inst_num_existing_simplified: 0 1.20/1.02 inst_num_eq_res_simplified: 0 1.20/1.02 inst_num_child_elim: 0 1.20/1.02 inst_num_of_dismatching_blockings: 12 1.20/1.02 inst_num_of_non_proper_insts: 212 1.20/1.02 inst_num_of_duplicates: 0 1.20/1.02 inst_inst_num_from_inst_to_res: 0 1.20/1.02 inst_dismatching_checking_time: 0. 1.20/1.02 1.20/1.02 ------ Resolution 1.20/1.02 1.20/1.02 res_num_of_clauses: 0 1.20/1.02 res_num_in_passive: 0 1.20/1.02 res_num_in_active: 0 1.20/1.02 res_num_of_loops: 62 1.20/1.02 res_forward_subset_subsumed: 39 1.20/1.02 res_backward_subset_subsumed: 0 1.20/1.02 res_forward_subsumed: 0 1.20/1.02 res_backward_subsumed: 0 1.20/1.02 res_forward_subsumption_resolution: 0 1.20/1.02 res_backward_subsumption_resolution: 0 1.20/1.02 res_clause_to_clause_subsumption: 36 1.20/1.02 res_orphan_elimination: 0 1.20/1.02 res_tautology_del: 42 1.20/1.02 res_num_eq_res_simplified: 0 1.20/1.02 res_num_sel_changes: 0 1.20/1.02 res_moves_from_active_to_pass: 0 1.20/1.02 1.20/1.02 ------ Superposition 1.20/1.02 1.20/1.02 sup_time_total: 0. 1.20/1.02 sup_time_generating: 0. 1.20/1.02 sup_time_sim_full: 0. 1.20/1.02 sup_time_sim_immed: 0. 1.20/1.02 1.20/1.02 sup_num_of_clauses: 30 1.20/1.02 sup_num_in_active: 28 1.20/1.02 sup_num_in_passive: 2 1.20/1.02 sup_num_of_loops: 32 1.20/1.02 sup_fw_superposition: 19 1.20/1.02 sup_bw_superposition: 28 1.20/1.02 sup_immediate_simplified: 8 1.20/1.02 sup_given_eliminated: 0 1.20/1.02 comparisons_done: 0 1.20/1.02 comparisons_avoided: 30 1.20/1.02 1.20/1.02 ------ Simplifications 1.20/1.02 1.20/1.02 1.20/1.02 sim_fw_subset_subsumed: 6 1.20/1.02 sim_bw_subset_subsumed: 6 1.20/1.02 sim_fw_subsumed: 0 1.20/1.02 sim_bw_subsumed: 0 1.20/1.02 sim_fw_subsumption_res: 0 1.20/1.02 sim_bw_subsumption_res: 0 1.20/1.02 sim_tautology_del: 2 1.20/1.02 sim_eq_tautology_del: 2 1.20/1.02 sim_eq_res_simp: 0 1.20/1.02 sim_fw_demodulated: 0 1.20/1.02 sim_bw_demodulated: 2 1.20/1.02 sim_light_normalised: 2 1.20/1.02 sim_joinable_taut: 0 1.20/1.02 sim_joinable_simp: 0 1.20/1.02 sim_ac_normalised: 0 1.20/1.02 sim_smt_subsumption: 0 1.20/1.02 1.20/1.02 EOF