0.07/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : iproveropt_run.sh %d %s 0.14/0.34 % Computer : n004.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 960 0.14/0.34 % WCLimit : 120 0.14/0.34 % DateTime : Wed Jul 1 17:19:58 EDT 2020 0.14/0.35 % CPUTime : 0.14/0.35 % Running in FOF mode 1.23/1.01 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p 1.23/1.01 1.23/1.01 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 1.23/1.01 1.23/1.01 ------ iProver source info 1.23/1.01 1.23/1.01 git: date: 2020-06-30 10:37:57 +0100 1.23/1.01 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 1.23/1.01 git: non_committed_changes: false 1.23/1.01 git: last_make_outside_of_git: false 1.23/1.01 1.23/1.01 ------ 1.23/1.01 1.23/1.01 ------ Input Options 1.23/1.01 1.23/1.01 --out_options all 1.23/1.01 --tptp_safe_out true 1.23/1.01 --problem_path "" 1.23/1.01 --include_path "" 1.23/1.01 --clausifier res/vclausify_rel 1.23/1.01 --clausifier_options --mode clausify 1.23/1.01 --stdin false 1.23/1.01 --stats_out all 1.23/1.01 1.23/1.01 ------ General Options 1.23/1.01 1.23/1.01 --fof false 1.23/1.01 --time_out_real 125. 1.23/1.01 --time_out_virtual -1. 1.23/1.01 --symbol_type_check false 1.23/1.01 --clausify_out false 1.23/1.01 --sig_cnt_out false 1.23/1.01 --trig_cnt_out false 1.23/1.01 --trig_cnt_out_tolerance 1. 1.23/1.01 --trig_cnt_out_sk_spl false 1.23/1.01 --abstr_cl_out false 1.23/1.01 1.23/1.01 ------ Global Options 1.23/1.01 1.23/1.01 --schedule default 1.23/1.01 --add_important_lit false 1.23/1.01 --prop_solver_per_cl 1000 1.23/1.01 --min_unsat_core false 1.23/1.01 --soft_assumptions false 1.23/1.01 --soft_lemma_size 3 1.23/1.01 --prop_impl_unit_size 0 1.23/1.01 --prop_impl_unit [] 1.23/1.01 --share_sel_clauses true 1.23/1.01 --reset_solvers false 1.23/1.01 --bc_imp_inh [conj_cone] 1.23/1.01 --conj_cone_tolerance 3. 1.23/1.01 --extra_neg_conj none 1.23/1.01 --large_theory_mode true 1.23/1.01 --prolific_symb_bound 200 1.23/1.01 --lt_threshold 2000 1.23/1.01 --clause_weak_htbl true 1.23/1.01 --gc_record_bc_elim false 1.23/1.01 1.23/1.01 ------ Preprocessing Options 1.23/1.01 1.23/1.01 --preprocessing_flag true 1.23/1.01 --time_out_prep_mult 0.1 1.23/1.01 --splitting_mode input 1.23/1.01 --splitting_grd true 1.23/1.01 --splitting_cvd false 1.23/1.01 --splitting_cvd_svl false 1.23/1.01 --splitting_nvd 32 1.23/1.01 --sub_typing true 1.23/1.01 --prep_gs_sim true 1.23/1.01 --prep_unflatten true 1.23/1.01 --prep_res_sim true 1.23/1.01 --prep_upred true 1.23/1.01 --prep_sem_filter exhaustive 1.23/1.01 --prep_sem_filter_out false 1.23/1.01 --pred_elim true 1.23/1.01 --res_sim_input true 1.23/1.01 --eq_ax_congr_red true 1.23/1.01 --pure_diseq_elim true 1.23/1.01 --brand_transform false 1.23/1.01 --non_eq_to_eq false 1.23/1.01 --prep_def_merge true 1.23/1.01 --prep_def_merge_prop_impl false 1.23/1.01 --prep_def_merge_mbd true 1.23/1.01 --prep_def_merge_tr_red false 1.23/1.01 --prep_def_merge_tr_cl false 1.23/1.01 --smt_preprocessing true 1.23/1.01 --smt_ac_axioms fast 1.23/1.01 --preprocessed_out false 1.23/1.01 --preprocessed_stats false 1.23/1.01 1.23/1.01 ------ Abstraction refinement Options 1.23/1.01 1.23/1.01 --abstr_ref [] 1.23/1.01 --abstr_ref_prep false 1.23/1.01 --abstr_ref_until_sat false 1.23/1.01 --abstr_ref_sig_restrict funpre 1.23/1.01 --abstr_ref_af_restrict_to_split_sk false 1.23/1.01 --abstr_ref_under [] 1.23/1.01 1.23/1.01 ------ SAT Options 1.23/1.01 1.23/1.01 --sat_mode false 1.23/1.01 --sat_fm_restart_options "" 1.23/1.01 --sat_gr_def false 1.23/1.01 --sat_epr_types true 1.23/1.01 --sat_non_cyclic_types false 1.23/1.01 --sat_finite_models false 1.23/1.01 --sat_fm_lemmas false 1.23/1.01 --sat_fm_prep false 1.23/1.01 --sat_fm_uc_incr true 1.23/1.01 --sat_out_model small 1.23/1.01 --sat_out_clauses false 1.23/1.01 1.23/1.01 ------ QBF Options 1.23/1.01 1.23/1.01 --qbf_mode false 1.23/1.01 --qbf_elim_univ false 1.23/1.01 --qbf_dom_inst none 1.23/1.01 --qbf_dom_pre_inst false 1.23/1.01 --qbf_sk_in false 1.23/1.01 --qbf_pred_elim true 1.23/1.01 --qbf_split 512 1.23/1.01 1.23/1.01 ------ BMC1 Options 1.23/1.01 1.23/1.01 --bmc1_incremental false 1.23/1.01 --bmc1_axioms reachable_all 1.23/1.01 --bmc1_min_bound 0 1.23/1.01 --bmc1_max_bound -1 1.23/1.01 --bmc1_max_bound_default -1 1.23/1.01 --bmc1_symbol_reachability true 1.23/1.01 --bmc1_property_lemmas false 1.23/1.01 --bmc1_k_induction false 1.23/1.01 --bmc1_non_equiv_states false 1.23/1.01 --bmc1_deadlock false 1.23/1.01 --bmc1_ucm false 1.23/1.01 --bmc1_add_unsat_core none 1.23/1.01 --bmc1_unsat_core_children false 1.23/1.01 --bmc1_unsat_core_extrapolate_axioms false 1.23/1.01 --bmc1_out_stat full 1.23/1.01 --bmc1_ground_init false 1.23/1.01 --bmc1_pre_inst_next_state false 1.23/1.01 --bmc1_pre_inst_state false 1.23/1.01 --bmc1_pre_inst_reach_state false 1.23/1.01 --bmc1_out_unsat_core false 1.23/1.01 --bmc1_aig_witness_out false 1.23/1.01 --bmc1_verbose false 1.23/1.01 --bmc1_dump_clauses_tptp false 1.23/1.01 --bmc1_dump_unsat_core_tptp false 1.23/1.01 --bmc1_dump_file - 1.23/1.01 --bmc1_ucm_expand_uc_limit 128 1.23/1.01 --bmc1_ucm_n_expand_iterations 6 1.23/1.01 --bmc1_ucm_extend_mode 1 1.23/1.01 --bmc1_ucm_init_mode 2 1.23/1.01 --bmc1_ucm_cone_mode none 1.23/1.01 --bmc1_ucm_reduced_relation_type 0 1.23/1.01 --bmc1_ucm_relax_model 4 1.23/1.01 --bmc1_ucm_full_tr_after_sat true 1.23/1.01 --bmc1_ucm_expand_neg_assumptions false 1.23/1.01 --bmc1_ucm_layered_model none 1.23/1.01 --bmc1_ucm_max_lemma_size 10 1.23/1.01 1.23/1.01 ------ AIG Options 1.23/1.01 1.23/1.01 --aig_mode false 1.23/1.01 1.23/1.01 ------ Instantiation Options 1.23/1.01 1.23/1.01 --instantiation_flag true 1.23/1.01 --inst_sos_flag false 1.23/1.01 --inst_sos_phase true 1.23/1.01 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 1.23/1.01 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 1.23/1.01 --inst_lit_sel_side num_symb 1.23/1.01 --inst_solver_per_active 1400 1.23/1.01 --inst_solver_calls_frac 1. 1.23/1.01 --inst_passive_queue_type priority_queues 1.23/1.01 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 1.23/1.01 --inst_passive_queues_freq [25;2] 1.23/1.01 --inst_dismatching true 1.23/1.01 --inst_eager_unprocessed_to_passive true 1.23/1.01 --inst_prop_sim_given true 1.23/1.01 --inst_prop_sim_new false 1.23/1.01 --inst_subs_new false 1.23/1.01 --inst_eq_res_simp false 1.23/1.01 --inst_subs_given false 1.23/1.01 --inst_orphan_elimination true 1.23/1.01 --inst_learning_loop_flag true 1.23/1.01 --inst_learning_start 3000 1.23/1.01 --inst_learning_factor 2 1.23/1.01 --inst_start_prop_sim_after_learn 3 1.23/1.01 --inst_sel_renew solver 1.23/1.01 --inst_lit_activity_flag true 1.23/1.01 --inst_restr_to_given false 1.23/1.01 --inst_activity_threshold 500 1.23/1.01 --inst_out_proof true 1.23/1.01 1.23/1.01 ------ Resolution Options 1.23/1.01 1.23/1.01 --resolution_flag true 1.23/1.01 --res_lit_sel adaptive 1.23/1.01 --res_lit_sel_side none 1.23/1.01 --res_ordering kbo 1.23/1.01 --res_to_prop_solver active 1.23/1.01 --res_prop_simpl_new false 1.23/1.01 --res_prop_simpl_given true 1.23/1.01 --res_passive_queue_type priority_queues 1.23/1.01 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 1.23/1.01 --res_passive_queues_freq [15;5] 1.23/1.01 --res_forward_subs full 1.23/1.01 --res_backward_subs full 1.23/1.01 --res_forward_subs_resolution true 1.23/1.01 --res_backward_subs_resolution true 1.23/1.01 --res_orphan_elimination true 1.23/1.01 --res_time_limit 2. 1.23/1.01 --res_out_proof true 1.23/1.01 1.23/1.01 ------ Superposition Options 1.23/1.01 1.23/1.01 --superposition_flag true 1.23/1.01 --sup_passive_queue_type priority_queues 1.23/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.23/1.01 --sup_passive_queues_freq [8;1;4] 1.23/1.01 --demod_completeness_check fast 1.23/1.01 --demod_use_ground true 1.23/1.01 --sup_to_prop_solver passive 1.23/1.01 --sup_prop_simpl_new true 1.23/1.01 --sup_prop_simpl_given true 1.23/1.01 --sup_fun_splitting false 1.23/1.01 --sup_smt_interval 50000 1.23/1.01 1.23/1.01 ------ Superposition Simplification Setup 1.23/1.01 1.23/1.01 --sup_indices_passive [] 1.23/1.01 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 1.23/1.01 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 1.23/1.01 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 1.23/1.01 --sup_full_triv [TrivRules;PropSubs] 1.23/1.01 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 1.23/1.01 --sup_full_bw [BwDemod] 1.23/1.01 --sup_immed_triv [TrivRules] 1.23/1.01 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 1.23/1.01 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 1.23/1.01 --sup_immed_bw_main [] 1.23/1.01 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 1.23/1.01 --sup_input_triv [Unflattening;TrivRules] 1.23/1.01 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 1.23/1.01 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 1.23/1.01 1.23/1.01 ------ Combination Options 1.23/1.01 1.23/1.01 --comb_res_mult 3 1.23/1.01 --comb_sup_mult 2 1.23/1.01 --comb_inst_mult 10 1.23/1.01 1.23/1.01 ------ Debug Options 1.23/1.01 1.23/1.01 --dbg_backtrace false 1.23/1.01 --dbg_dump_prop_clauses false 1.23/1.01 --dbg_dump_prop_clauses_file - 1.23/1.01 --dbg_out_stat false 1.23/1.01 ------ Parsing... 1.23/1.01 ------ Clausification by vclausify_rel & Parsing by iProver... 1.23/1.01 1.23/1.01 ------ Preprocessing... sf_s rm: 2 0s sf_e pe_s pe_e sf_s rm: 1 0s sf_e pe_s pe_e 1.23/1.01 1.23/1.01 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 1.23/1.01 1.23/1.01 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 1.23/1.01 ------ Proving... 1.23/1.01 ------ Problem Properties 1.23/1.01 1.23/1.01 1.23/1.01 clauses 8 1.23/1.01 conjectures 0 1.23/1.01 EPR 6 1.23/1.01 Horn 7 1.23/1.01 unary 3 1.23/1.01 binary 2 1.23/1.01 lits 16 1.23/1.01 lits eq 1 1.23/1.01 fd_pure 0 1.23/1.01 fd_pseudo 0 1.23/1.01 fd_cond 0 1.23/1.01 fd_pseudo_cond 1 1.23/1.01 AC symbols 0 1.23/1.01 1.23/1.01 ------ Schedule dynamic 5 is on 1.23/1.01 1.23/1.01 ------ no conjectures: strip conj schedule 1.23/1.01 1.23/1.01 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10. 1.23/1.01 1.23/1.01 1.23/1.01 ------ 1.23/1.01 Current options: 1.23/1.01 ------ 1.23/1.01 1.23/1.01 ------ Input Options 1.23/1.01 1.23/1.01 --out_options all 1.23/1.01 --tptp_safe_out true 1.23/1.01 --problem_path "" 1.23/1.01 --include_path "" 1.23/1.01 --clausifier res/vclausify_rel 1.23/1.01 --clausifier_options --mode clausify 1.23/1.01 --stdin false 1.23/1.01 --stats_out all 1.23/1.01 1.23/1.01 ------ General Options 1.23/1.01 1.23/1.01 --fof false 1.23/1.01 --time_out_real 125. 1.23/1.01 --time_out_virtual -1. 1.23/1.01 --symbol_type_check false 1.23/1.01 --clausify_out false 1.23/1.01 --sig_cnt_out false 1.23/1.01 --trig_cnt_out false 1.23/1.01 --trig_cnt_out_tolerance 1. 1.23/1.01 --trig_cnt_out_sk_spl false 1.23/1.01 --abstr_cl_out false 1.23/1.01 1.23/1.01 ------ Global Options 1.23/1.01 1.23/1.01 --schedule default 1.23/1.01 --add_important_lit false 1.23/1.01 --prop_solver_per_cl 1000 1.23/1.01 --min_unsat_core false 1.23/1.01 --soft_assumptions false 1.23/1.01 --soft_lemma_size 3 1.23/1.01 --prop_impl_unit_size 0 1.23/1.01 --prop_impl_unit [] 1.23/1.01 --share_sel_clauses true 1.23/1.01 --reset_solvers false 1.23/1.01 --bc_imp_inh [conj_cone] 1.23/1.01 --conj_cone_tolerance 3. 1.23/1.01 --extra_neg_conj none 1.23/1.01 --large_theory_mode true 1.23/1.01 --prolific_symb_bound 200 1.23/1.01 --lt_threshold 2000 1.23/1.01 --clause_weak_htbl true 1.23/1.01 --gc_record_bc_elim false 1.23/1.01 1.23/1.01 ------ Preprocessing Options 1.23/1.01 1.23/1.01 --preprocessing_flag true 1.23/1.01 --time_out_prep_mult 0.1 1.23/1.01 --splitting_mode input 1.23/1.01 --splitting_grd true 1.23/1.01 --splitting_cvd false 1.23/1.01 --splitting_cvd_svl false 1.23/1.01 --splitting_nvd 32 1.23/1.01 --sub_typing true 1.23/1.01 --prep_gs_sim true 1.23/1.01 --prep_unflatten true 1.23/1.01 --prep_res_sim true 1.23/1.01 --prep_upred true 1.23/1.01 --prep_sem_filter exhaustive 1.23/1.01 --prep_sem_filter_out false 1.23/1.01 --pred_elim true 1.23/1.01 --res_sim_input true 1.23/1.01 --eq_ax_congr_red true 1.23/1.01 --pure_diseq_elim true 1.23/1.01 --brand_transform false 1.23/1.01 --non_eq_to_eq false 1.23/1.01 --prep_def_merge true 1.23/1.01 --prep_def_merge_prop_impl false 1.23/1.01 --prep_def_merge_mbd true 1.23/1.01 --prep_def_merge_tr_red false 1.23/1.01 --prep_def_merge_tr_cl false 1.23/1.01 --smt_preprocessing true 1.23/1.01 --smt_ac_axioms fast 1.23/1.01 --preprocessed_out false 1.23/1.01 --preprocessed_stats false 1.23/1.01 1.23/1.01 ------ Abstraction refinement Options 1.23/1.01 1.23/1.01 --abstr_ref [] 1.23/1.01 --abstr_ref_prep false 1.23/1.01 --abstr_ref_until_sat false 1.23/1.01 --abstr_ref_sig_restrict funpre 1.23/1.01 --abstr_ref_af_restrict_to_split_sk false 1.23/1.01 --abstr_ref_under [] 1.23/1.01 1.23/1.01 ------ SAT Options 1.23/1.01 1.23/1.01 --sat_mode false 1.23/1.01 --sat_fm_restart_options "" 1.23/1.01 --sat_gr_def false 1.23/1.01 --sat_epr_types true 1.23/1.01 --sat_non_cyclic_types false 1.23/1.01 --sat_finite_models false 1.23/1.01 --sat_fm_lemmas false 1.23/1.01 --sat_fm_prep false 1.23/1.01 --sat_fm_uc_incr true 1.23/1.01 --sat_out_model small 1.23/1.01 --sat_out_clauses false 1.23/1.01 1.23/1.01 ------ QBF Options 1.23/1.01 1.23/1.01 --qbf_mode false 1.23/1.01 --qbf_elim_univ false 1.23/1.01 --qbf_dom_inst none 1.23/1.01 --qbf_dom_pre_inst false 1.23/1.01 --qbf_sk_in false 1.23/1.01 --qbf_pred_elim true 1.23/1.01 --qbf_split 512 1.23/1.01 1.23/1.01 ------ BMC1 Options 1.23/1.01 1.23/1.01 --bmc1_incremental false 1.23/1.01 --bmc1_axioms reachable_all 1.23/1.01 --bmc1_min_bound 0 1.23/1.01 --bmc1_max_bound -1 1.23/1.01 --bmc1_max_bound_default -1 1.23/1.01 --bmc1_symbol_reachability true 1.23/1.01 --bmc1_property_lemmas false 1.23/1.01 --bmc1_k_induction false 1.23/1.01 --bmc1_non_equiv_states false 1.23/1.01 --bmc1_deadlock false 1.23/1.01 --bmc1_ucm false 1.23/1.01 --bmc1_add_unsat_core none 1.23/1.01 --bmc1_unsat_core_children false 1.23/1.01 --bmc1_unsat_core_extrapolate_axioms false 1.23/1.01 --bmc1_out_stat full 1.23/1.01 --bmc1_ground_init false 1.23/1.01 --bmc1_pre_inst_next_state false 1.23/1.01 --bmc1_pre_inst_state false 1.23/1.01 --bmc1_pre_inst_reach_state false 1.23/1.01 --bmc1_out_unsat_core false 1.23/1.01 --bmc1_aig_witness_out false 1.23/1.01 --bmc1_verbose false 1.23/1.01 --bmc1_dump_clauses_tptp false 1.23/1.01 --bmc1_dump_unsat_core_tptp false 1.23/1.01 --bmc1_dump_file - 1.23/1.01 --bmc1_ucm_expand_uc_limit 128 1.23/1.01 --bmc1_ucm_n_expand_iterations 6 1.23/1.01 --bmc1_ucm_extend_mode 1 1.23/1.01 --bmc1_ucm_init_mode 2 1.23/1.01 --bmc1_ucm_cone_mode none 1.23/1.01 --bmc1_ucm_reduced_relation_type 0 1.23/1.01 --bmc1_ucm_relax_model 4 1.23/1.01 --bmc1_ucm_full_tr_after_sat true 1.23/1.01 --bmc1_ucm_expand_neg_assumptions false 1.23/1.01 --bmc1_ucm_layered_model none 1.23/1.01 --bmc1_ucm_max_lemma_size 10 1.23/1.01 1.23/1.01 ------ AIG Options 1.23/1.01 1.23/1.01 --aig_mode false 1.23/1.01 1.23/1.01 ------ Instantiation Options 1.23/1.01 1.23/1.01 --instantiation_flag true 1.23/1.01 --inst_sos_flag false 1.23/1.01 --inst_sos_phase true 1.23/1.01 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 1.23/1.01 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 1.23/1.01 --inst_lit_sel_side none 1.23/1.01 --inst_solver_per_active 1400 1.23/1.01 --inst_solver_calls_frac 1. 1.23/1.01 --inst_passive_queue_type priority_queues 1.23/1.01 --inst_passive_queues [[-num_var];[+age;-num_symb]] 1.23/1.01 --inst_passive_queues_freq [25;2] 1.23/1.01 --inst_dismatching true 1.23/1.01 --inst_eager_unprocessed_to_passive true 1.23/1.01 --inst_prop_sim_given true 1.23/1.01 --inst_prop_sim_new false 1.23/1.01 --inst_subs_new false 1.23/1.01 --inst_eq_res_simp false 1.23/1.01 --inst_subs_given false 1.23/1.01 --inst_orphan_elimination true 1.23/1.01 --inst_learning_loop_flag true 1.23/1.01 --inst_learning_start 3000 1.23/1.01 --inst_learning_factor 2 1.23/1.01 --inst_start_prop_sim_after_learn 3 1.23/1.01 --inst_sel_renew solver 1.23/1.01 --inst_lit_activity_flag true 1.23/1.01 --inst_restr_to_given false 1.23/1.01 --inst_activity_threshold 500 1.23/1.01 --inst_out_proof true 1.23/1.01 1.23/1.01 ------ Resolution Options 1.23/1.01 1.23/1.01 --resolution_flag false 1.23/1.01 --res_lit_sel adaptive 1.23/1.01 --res_lit_sel_side none 1.23/1.01 --res_ordering kbo 1.23/1.01 --res_to_prop_solver active 1.23/1.01 --res_prop_simpl_new false 1.23/1.01 --res_prop_simpl_given true 1.23/1.01 --res_passive_queue_type priority_queues 1.23/1.01 --res_passive_queues [[-num_symb];[+age;-num_symb]] 1.23/1.01 --res_passive_queues_freq [15;5] 1.23/1.01 --res_forward_subs full 1.23/1.01 --res_backward_subs full 1.23/1.01 --res_forward_subs_resolution true 1.23/1.01 --res_backward_subs_resolution true 1.23/1.01 --res_orphan_elimination true 1.23/1.01 --res_time_limit 2. 1.23/1.01 --res_out_proof true 1.23/1.01 1.23/1.01 ------ Superposition Options 1.23/1.01 1.23/1.01 --superposition_flag true 1.23/1.01 --sup_passive_queue_type priority_queues 1.23/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.23/1.01 --sup_passive_queues_freq [8;1;4] 1.23/1.01 --demod_completeness_check fast 1.23/1.01 --demod_use_ground true 1.23/1.01 --sup_to_prop_solver passive 1.23/1.01 --sup_prop_simpl_new true 1.23/1.01 --sup_prop_simpl_given true 1.23/1.01 --sup_fun_splitting false 1.23/1.01 --sup_smt_interval 50000 1.23/1.01 1.23/1.01 ------ Superposition Simplification Setup 1.23/1.01 1.23/1.01 --sup_indices_passive [] 1.23/1.01 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 1.23/1.01 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 1.23/1.01 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 1.23/1.01 --sup_full_triv [TrivRules;PropSubs] 1.23/1.01 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 1.23/1.01 --sup_full_bw [BwDemod] 1.23/1.01 --sup_immed_triv [TrivRules] 1.23/1.01 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 1.23/1.01 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 1.23/1.01 --sup_immed_bw_main [] 1.23/1.01 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 1.23/1.01 --sup_input_triv [Unflattening;TrivRules] 1.23/1.01 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 1.23/1.01 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 1.23/1.01 1.23/1.01 ------ Combination Options 1.23/1.01 1.23/1.01 --comb_res_mult 3 1.23/1.01 --comb_sup_mult 2 1.23/1.01 --comb_inst_mult 10 1.23/1.01 1.23/1.01 ------ Debug Options 1.23/1.01 1.23/1.01 --dbg_backtrace false 1.23/1.01 --dbg_dump_prop_clauses false 1.23/1.01 --dbg_dump_prop_clauses_file - 1.23/1.01 --dbg_out_stat false 1.23/1.01 1.23/1.01 1.23/1.01 1.23/1.01 1.23/1.01 ------ Proving... 1.23/1.01 1.23/1.01 1.23/1.01 % SZS status Theorem for theBenchmark.p 1.23/1.01 1.23/1.01 % SZS output start CNFRefutation for theBenchmark.p 1.23/1.01 1.23/1.01 fof(f6,axiom,( 1.23/1.01 reflexive_rewrite(a,c) & reflexive_rewrite(a,b)), 1.23/1.01 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 1.23/1.01 1.23/1.01 fof(f25,plain,( 1.23/1.01 reflexive_rewrite(a,b)), 1.23/1.01 inference(cnf_transformation,[],[f6])). 1.23/1.01 1.23/1.01 fof(f8,axiom,( 1.23/1.01 ! [X0,X1] : (reflexive_rewrite(X0,X1) => (X0 = X1 | rewrite(X0,X1)))), 1.23/1.01 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 1.23/1.01 1.23/1.01 fof(f16,plain,( 1.23/1.01 ! [X0,X1] : ((X0 = X1 | rewrite(X0,X1)) | ~reflexive_rewrite(X0,X1))), 1.23/1.01 inference(ennf_transformation,[],[f8])). 1.23/1.01 1.23/1.01 fof(f17,plain,( 1.23/1.01 ! [X0,X1] : (X0 = X1 | rewrite(X0,X1) | ~reflexive_rewrite(X0,X1))), 1.23/1.01 inference(flattening,[],[f16])). 1.23/1.01 1.23/1.01 fof(f28,plain,( 1.23/1.01 ( ! [X0,X1] : (X0 = X1 | rewrite(X0,X1) | ~reflexive_rewrite(X0,X1)) )), 1.23/1.01 inference(cnf_transformation,[],[f17])). 1.23/1.01 1.23/1.01 fof(f26,plain,( 1.23/1.01 reflexive_rewrite(a,c)), 1.23/1.01 inference(cnf_transformation,[],[f6])). 1.23/1.01 1.23/1.01 fof(f5,axiom,( 1.23/1.01 ! [X0] : ((reflexive_rewrite(b,X0) & reflexive_rewrite(c,X0)) => goal)), 1.23/1.01 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 1.23/1.01 1.23/1.01 fof(f13,plain,( 1.23/1.01 ! [X0] : (goal | (~reflexive_rewrite(b,X0) | ~reflexive_rewrite(c,X0)))), 1.23/1.01 inference(ennf_transformation,[],[f5])). 1.23/1.01 1.23/1.01 fof(f14,plain,( 1.23/1.01 ! [X0] : (goal | ~reflexive_rewrite(b,X0) | ~reflexive_rewrite(c,X0))), 1.23/1.01 inference(flattening,[],[f13])). 1.23/1.01 1.23/1.01 fof(f24,plain,( 1.23/1.01 ( ! [X0] : (goal | ~reflexive_rewrite(b,X0) | ~reflexive_rewrite(c,X0)) )), 1.23/1.01 inference(cnf_transformation,[],[f14])). 1.23/1.01 1.23/1.01 fof(f3,conjecture,( 1.23/1.01 goal), 1.23/1.01 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 1.23/1.01 1.23/1.01 fof(f4,negated_conjecture,( 1.23/1.01 ~goal), 1.23/1.01 inference(negated_conjecture,[],[f3])). 1.23/1.01 1.23/1.01 fof(f9,plain,( 1.23/1.01 ~goal), 1.23/1.01 inference(flattening,[],[f4])). 1.23/1.01 1.23/1.01 fof(f23,plain,( 1.23/1.01 ~goal), 1.23/1.01 inference(cnf_transformation,[],[f9])). 1.23/1.01 1.23/1.01 fof(f1,axiom,( 1.23/1.01 ! [X0,X1] : (X0 = X1 => reflexive_rewrite(X0,X1))), 1.23/1.01 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 1.23/1.01 1.23/1.01 fof(f10,plain,( 1.23/1.01 ! [X0,X1] : (reflexive_rewrite(X0,X1) | X0 != X1)), 1.23/1.01 inference(ennf_transformation,[],[f1])). 1.23/1.01 1.23/1.01 fof(f20,plain,( 1.23/1.01 ( ! [X0,X1] : (reflexive_rewrite(X0,X1) | X0 != X1) )), 1.23/1.01 inference(cnf_transformation,[],[f10])). 1.23/1.01 1.23/1.01 fof(f29,plain,( 1.23/1.01 ( ! [X1] : (reflexive_rewrite(X1,X1)) )), 1.23/1.01 inference(equality_resolution,[],[f20])). 1.23/1.01 1.23/1.01 fof(f2,axiom,( 1.23/1.01 ! [X0,X1,X2] : ((rewrite(X0,X2) & rewrite(X0,X1)) => ? [X3] : (rewrite(X1,X3) & rewrite(X2,X3)))), 1.23/1.01 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 1.23/1.01 1.23/1.01 fof(f11,plain,( 1.23/1.01 ! [X0,X1,X2] : (? [X3] : (rewrite(X1,X3) & rewrite(X2,X3)) | (~rewrite(X0,X2) | ~rewrite(X0,X1)))), 1.23/1.01 inference(ennf_transformation,[],[f2])). 1.23/1.01 1.23/1.01 fof(f12,plain,( 1.23/1.01 ! [X0,X1,X2] : (? [X3] : (rewrite(X1,X3) & rewrite(X2,X3)) | ~rewrite(X0,X2) | ~rewrite(X0,X1))), 1.23/1.01 inference(flattening,[],[f11])). 1.23/1.01 1.23/1.01 fof(f18,plain,( 1.23/1.01 ! [X2,X1] : (? [X3] : (rewrite(X1,X3) & rewrite(X2,X3)) => (rewrite(X1,sK0(X1,X2)) & rewrite(X2,sK0(X1,X2))))), 1.23/1.01 introduced(choice_axiom,[])). 1.23/1.01 1.23/1.01 fof(f19,plain,( 1.23/1.01 ! [X0,X1,X2] : ((rewrite(X1,sK0(X1,X2)) & rewrite(X2,sK0(X1,X2))) | ~rewrite(X0,X2) | ~rewrite(X0,X1))), 1.23/1.01 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f18])). 1.23/1.01 1.23/1.01 fof(f21,plain,( 1.23/1.01 ( ! [X2,X0,X1] : (rewrite(X2,sK0(X1,X2)) | ~rewrite(X0,X2) | ~rewrite(X0,X1)) )), 1.23/1.01 inference(cnf_transformation,[],[f19])). 1.23/1.01 1.23/1.01 fof(f7,axiom,( 1.23/1.01 ! [X0,X1] : (rewrite(X0,X1) => reflexive_rewrite(X0,X1))), 1.23/1.01 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 1.23/1.01 1.23/1.01 fof(f15,plain,( 1.23/1.01 ! [X0,X1] : (reflexive_rewrite(X0,X1) | ~rewrite(X0,X1))), 1.23/1.01 inference(ennf_transformation,[],[f7])). 1.23/1.01 1.23/1.01 fof(f27,plain,( 1.23/1.01 ( ! [X0,X1] : (reflexive_rewrite(X0,X1) | ~rewrite(X0,X1)) )), 1.23/1.01 inference(cnf_transformation,[],[f15])). 1.23/1.01 1.23/1.01 fof(f22,plain,( 1.23/1.01 ( ! [X2,X0,X1] : (rewrite(X1,sK0(X1,X2)) | ~rewrite(X0,X2) | ~rewrite(X0,X1)) )), 1.23/1.01 inference(cnf_transformation,[],[f19])). 1.23/1.01 1.23/1.01 cnf(c_6,plain, 1.23/1.01 ( reflexive_rewrite(a,b) ), 1.23/1.01 inference(cnf_transformation,[],[f25]) ). 1.23/1.01 1.23/1.01 cnf(c_312,plain, 1.23/1.01 ( reflexive_rewrite(a,b) = iProver_top ), 1.23/1.01 inference(predicate_to_equality,[status(thm)],[c_6]) ). 1.23/1.01 1.23/1.01 cnf(c_8,plain, 1.23/1.01 ( rewrite(X0,X1) | ~ reflexive_rewrite(X0,X1) | X0 = X1 ), 1.23/1.01 inference(cnf_transformation,[],[f28]) ). 1.23/1.01 1.23/1.01 cnf(c_310,plain, 1.23/1.01 ( X0 = X1 1.23/1.01 | rewrite(X0,X1) = iProver_top 1.23/1.01 | reflexive_rewrite(X0,X1) != iProver_top ), 1.23/1.01 inference(predicate_to_equality,[status(thm)],[c_8]) ). 1.23/1.01 1.23/1.01 cnf(c_594,plain, 1.23/1.01 ( a = b | rewrite(a,b) = iProver_top ), 1.23/1.01 inference(superposition,[status(thm)],[c_312,c_310]) ). 1.23/1.01 1.23/1.01 cnf(c_16,plain, 1.23/1.01 ( reflexive_rewrite(a,b) = iProver_top ), 1.23/1.01 inference(predicate_to_equality,[status(thm)],[c_6]) ). 1.23/1.01 1.23/1.01 cnf(c_5,plain, 1.23/1.01 ( reflexive_rewrite(a,c) ), 1.23/1.01 inference(cnf_transformation,[],[f26]) ). 1.23/1.01 1.23/1.01 cnf(c_4,plain, 1.23/1.01 ( ~ reflexive_rewrite(c,X0) | ~ reflexive_rewrite(b,X0) | goal ), 1.23/1.01 inference(cnf_transformation,[],[f24]) ). 1.23/1.01 1.23/1.01 cnf(c_3,negated_conjecture, 1.23/1.01 ( ~ goal ), 1.23/1.01 inference(cnf_transformation,[],[f23]) ). 1.23/1.01 1.23/1.01 cnf(c_52,plain, 1.23/1.01 ( ~ reflexive_rewrite(b,X0) | ~ reflexive_rewrite(c,X0) ), 1.23/1.01 inference(global_propositional_subsumption,[status(thm)],[c_4,c_3]) ). 1.23/1.01 1.23/1.01 cnf(c_53,plain, 1.23/1.01 ( ~ reflexive_rewrite(c,X0) | ~ reflexive_rewrite(b,X0) ), 1.23/1.01 inference(renaming,[status(thm)],[c_52]) ). 1.23/1.01 1.23/1.01 cnf(c_367,plain, 1.23/1.01 ( ~ reflexive_rewrite(c,c) | ~ reflexive_rewrite(b,c) ), 1.23/1.01 inference(instantiation,[status(thm)],[c_53]) ). 1.23/1.01 1.23/1.01 cnf(c_0,plain, 1.23/1.01 ( reflexive_rewrite(X0,X0) ), 1.23/1.01 inference(cnf_transformation,[],[f29]) ). 1.23/1.01 1.23/1.01 cnf(c_368,plain, 1.23/1.01 ( reflexive_rewrite(c,c) ), 1.23/1.01 inference(instantiation,[status(thm)],[c_0]) ). 1.23/1.01 1.23/1.01 cnf(c_159,plain,( X0 = X0 ),theory(equality) ). 1.23/1.01 1.23/1.01 cnf(c_403,plain, 1.23/1.01 ( c = c ), 1.23/1.01 inference(instantiation,[status(thm)],[c_159]) ). 1.23/1.01 1.23/1.01 cnf(c_161,plain, 1.23/1.01 ( ~ reflexive_rewrite(X0,X1) 1.23/1.01 | reflexive_rewrite(X2,X3) 1.23/1.01 | X2 != X0 1.23/1.01 | X3 != X1 ), 1.23/1.01 theory(equality) ). 1.23/1.01 1.23/1.01 cnf(c_390,plain, 1.23/1.01 ( ~ reflexive_rewrite(X0,X1) 1.23/1.01 | reflexive_rewrite(b,c) 1.23/1.01 | c != X1 1.23/1.01 | b != X0 ), 1.23/1.01 inference(instantiation,[status(thm)],[c_161]) ). 1.23/1.01 1.23/1.01 cnf(c_420,plain, 1.23/1.01 ( ~ reflexive_rewrite(X0,c) 1.23/1.01 | reflexive_rewrite(b,c) 1.23/1.01 | c != c 1.23/1.01 | b != X0 ), 1.23/1.01 inference(instantiation,[status(thm)],[c_390]) ). 1.23/1.01 1.23/1.01 cnf(c_422,plain, 1.23/1.01 ( ~ reflexive_rewrite(a,c) 1.23/1.01 | reflexive_rewrite(b,c) 1.23/1.01 | c != c 1.23/1.01 | b != a ), 1.23/1.01 inference(instantiation,[status(thm)],[c_420]) ). 1.23/1.01 1.23/1.01 cnf(c_160,plain,( X0 != X1 | X2 != X1 | X2 = X0 ),theory(equality) ). 1.23/1.01 1.23/1.01 cnf(c_440,plain, 1.23/1.01 ( X0 != X1 | b != X1 | b = X0 ), 1.23/1.01 inference(instantiation,[status(thm)],[c_160]) ). 1.23/1.01 1.23/1.01 cnf(c_479,plain, 1.23/1.01 ( X0 != b | b = X0 | b != b ), 1.23/1.01 inference(instantiation,[status(thm)],[c_440]) ). 1.23/1.01 1.23/1.01 cnf(c_481,plain, 1.23/1.01 ( a != b | b = a | b != b ), 1.23/1.01 inference(instantiation,[status(thm)],[c_479]) ). 1.23/1.01 1.23/1.01 cnf(c_480,plain, 1.23/1.01 ( b = b ), 1.23/1.01 inference(instantiation,[status(thm)],[c_159]) ). 1.23/1.01 1.23/1.01 cnf(c_510,plain, 1.23/1.01 ( rewrite(X0,b) | ~ reflexive_rewrite(X0,b) | X0 = b ), 1.23/1.01 inference(instantiation,[status(thm)],[c_8]) ). 1.23/1.01 1.23/1.01 cnf(c_511,plain, 1.23/1.01 ( X0 = b 1.23/1.01 | rewrite(X0,b) = iProver_top 1.23/1.01 | reflexive_rewrite(X0,b) != iProver_top ), 1.23/1.01 inference(predicate_to_equality,[status(thm)],[c_510]) ). 1.23/1.01 1.23/1.01 cnf(c_513,plain, 1.23/1.01 ( a = b 1.23/1.01 | rewrite(a,b) = iProver_top 1.23/1.01 | reflexive_rewrite(a,b) != iProver_top ), 1.23/1.01 inference(instantiation,[status(thm)],[c_511]) ). 1.23/1.01 1.23/1.01 cnf(c_683,plain, 1.23/1.01 ( rewrite(a,b) = iProver_top ), 1.23/1.01 inference(global_propositional_subsumption, 1.23/1.01 [status(thm)], 1.23/1.01 [c_594,c_16,c_5,c_367,c_368,c_403,c_422,c_481,c_480, 1.23/1.01 c_513]) ). 1.23/1.01 1.23/1.01 cnf(c_2,plain, 1.23/1.01 ( ~ rewrite(X0,X1) | ~ rewrite(X0,X2) | rewrite(X1,sK0(X2,X1)) ), 1.23/1.01 inference(cnf_transformation,[],[f21]) ). 1.23/1.01 1.23/1.01 cnf(c_314,plain, 1.23/1.01 ( rewrite(X0,X1) != iProver_top 1.23/1.01 | rewrite(X0,X2) != iProver_top 1.23/1.01 | rewrite(X1,sK0(X2,X1)) = iProver_top ), 1.23/1.01 inference(predicate_to_equality,[status(thm)],[c_2]) ). 1.23/1.01 1.23/1.01 cnf(c_689,plain, 1.23/1.01 ( rewrite(a,X0) != iProver_top 1.23/1.01 | rewrite(b,sK0(X0,b)) = iProver_top ), 1.23/1.01 inference(superposition,[status(thm)],[c_683,c_314]) ). 1.23/1.01 1.23/1.01 cnf(c_7,plain, 1.23/1.01 ( ~ rewrite(X0,X1) | reflexive_rewrite(X0,X1) ), 1.23/1.01 inference(cnf_transformation,[],[f27]) ). 1.23/1.01 1.23/1.01 cnf(c_311,plain, 1.23/1.01 ( rewrite(X0,X1) != iProver_top 1.23/1.01 | reflexive_rewrite(X0,X1) = iProver_top ), 1.23/1.01 inference(predicate_to_equality,[status(thm)],[c_7]) ). 1.23/1.01 1.23/1.01 cnf(c_800,plain, 1.23/1.01 ( rewrite(a,X0) != iProver_top 1.23/1.01 | reflexive_rewrite(b,sK0(X0,b)) = iProver_top ), 1.23/1.01 inference(superposition,[status(thm)],[c_689,c_311]) ). 1.23/1.01 1.23/1.01 cnf(c_1,plain, 1.23/1.01 ( ~ rewrite(X0,X1) | ~ rewrite(X0,X2) | rewrite(X2,sK0(X2,X1)) ), 1.23/1.01 inference(cnf_transformation,[],[f22]) ). 1.23/1.01 1.23/1.01 cnf(c_315,plain, 1.23/1.01 ( rewrite(X0,X1) != iProver_top 1.23/1.01 | rewrite(X0,X2) != iProver_top 1.23/1.01 | rewrite(X2,sK0(X2,X1)) = iProver_top ), 1.23/1.01 inference(predicate_to_equality,[status(thm)],[c_1]) ). 1.23/1.01 1.23/1.01 cnf(c_688,plain, 1.23/1.01 ( rewrite(X0,sK0(X0,b)) = iProver_top 1.23/1.01 | rewrite(a,X0) != iProver_top ), 1.23/1.01 inference(superposition,[status(thm)],[c_683,c_315]) ). 1.23/1.01 1.23/1.01 cnf(c_710,plain, 1.23/1.01 ( rewrite(a,X0) != iProver_top 1.23/1.01 | reflexive_rewrite(X0,sK0(X0,b)) = iProver_top ), 1.23/1.01 inference(superposition,[status(thm)],[c_688,c_311]) ). 1.23/1.01 1.23/1.01 cnf(c_309,plain, 1.23/1.01 ( reflexive_rewrite(c,X0) != iProver_top 1.23/1.01 | reflexive_rewrite(b,X0) != iProver_top ), 1.23/1.01 inference(predicate_to_equality,[status(thm)],[c_53]) ). 1.23/1.01 1.23/1.01 cnf(c_829,plain, 1.23/1.01 ( rewrite(a,c) != iProver_top 1.23/1.01 | reflexive_rewrite(b,sK0(c,b)) != iProver_top ), 1.23/1.01 inference(superposition,[status(thm)],[c_710,c_309]) ). 1.23/1.01 1.23/1.01 cnf(c_17,plain, 1.23/1.01 ( reflexive_rewrite(a,c) = iProver_top ), 1.23/1.01 inference(predicate_to_equality,[status(thm)],[c_5]) ). 1.23/1.01 1.23/1.01 cnf(c_396,plain, 1.23/1.01 ( X0 != X1 | c != X1 | c = X0 ), 1.23/1.01 inference(instantiation,[status(thm)],[c_160]) ). 1.23/1.01 1.23/1.01 cnf(c_429,plain, 1.23/1.01 ( X0 != c | c = X0 | c != c ), 1.23/1.01 inference(instantiation,[status(thm)],[c_396]) ). 1.23/1.01 1.23/1.01 cnf(c_430,plain, 1.23/1.01 ( a != c | c = a | c != c ), 1.23/1.01 inference(instantiation,[status(thm)],[c_429]) ). 1.23/1.01 1.23/1.01 cnf(c_450,plain, 1.23/1.01 ( rewrite(X0,c) | ~ reflexive_rewrite(X0,c) | X0 = c ), 1.23/1.01 inference(instantiation,[status(thm)],[c_8]) ). 1.23/1.01 1.23/1.01 cnf(c_451,plain, 1.23/1.01 ( X0 = c 1.23/1.01 | rewrite(X0,c) = iProver_top 1.23/1.01 | reflexive_rewrite(X0,c) != iProver_top ), 1.23/1.01 inference(predicate_to_equality,[status(thm)],[c_450]) ). 1.23/1.01 1.23/1.01 cnf(c_453,plain, 1.23/1.01 ( a = c 1.23/1.01 | rewrite(a,c) = iProver_top 1.23/1.01 | reflexive_rewrite(a,c) != iProver_top ), 1.23/1.01 inference(instantiation,[status(thm)],[c_451]) ). 1.23/1.01 1.23/1.01 cnf(c_462,plain, 1.23/1.01 ( reflexive_rewrite(b,b) ), 1.23/1.01 inference(instantiation,[status(thm)],[c_0]) ). 1.23/1.01 1.23/1.01 cnf(c_530,plain, 1.23/1.01 ( ~ reflexive_rewrite(c,b) | ~ reflexive_rewrite(b,b) ), 1.23/1.01 inference(instantiation,[status(thm)],[c_53]) ). 1.23/1.01 1.23/1.01 cnf(c_382,plain, 1.23/1.01 ( ~ reflexive_rewrite(X0,X1) 1.23/1.01 | reflexive_rewrite(c,X2) 1.23/1.01 | X2 != X1 1.23/1.01 | c != X0 ), 1.23/1.01 inference(instantiation,[status(thm)],[c_161]) ). 1.23/1.01 1.23/1.01 cnf(c_643,plain, 1.23/1.01 ( ~ reflexive_rewrite(X0,X1) 1.23/1.01 | reflexive_rewrite(c,b) 1.23/1.01 | c != X0 1.23/1.01 | b != X1 ), 1.23/1.01 inference(instantiation,[status(thm)],[c_382]) ). 1.23/1.01 1.23/1.01 cnf(c_843,plain, 1.23/1.01 ( ~ reflexive_rewrite(X0,b) 1.23/1.01 | reflexive_rewrite(c,b) 1.23/1.01 | c != X0 1.23/1.01 | b != b ), 1.23/1.01 inference(instantiation,[status(thm)],[c_643]) ). 1.23/1.01 1.23/1.01 cnf(c_845,plain, 1.23/1.01 ( ~ reflexive_rewrite(a,b) 1.23/1.01 | reflexive_rewrite(c,b) 1.23/1.01 | c != a 1.23/1.01 | b != b ), 1.23/1.01 inference(instantiation,[status(thm)],[c_843]) ). 1.23/1.01 1.23/1.01 cnf(c_906,plain, 1.23/1.01 ( reflexive_rewrite(b,sK0(c,b)) != iProver_top ), 1.23/1.01 inference(global_propositional_subsumption, 1.23/1.01 [status(thm)], 1.23/1.01 [c_829,c_6,c_17,c_403,c_430,c_453,c_462,c_480,c_530, 1.23/1.01 c_845]) ). 1.23/1.01 1.23/1.01 cnf(c_911,plain, 1.23/1.01 ( rewrite(a,c) != iProver_top ), 1.23/1.01 inference(superposition,[status(thm)],[c_800,c_906]) ). 1.23/1.01 1.23/1.01 cnf(contradiction,plain, 1.23/1.01 ( $false ), 1.23/1.01 inference(minisat, 1.23/1.01 [status(thm)], 1.23/1.01 [c_911,c_845,c_530,c_480,c_462,c_453,c_430,c_403,c_17, 1.23/1.01 c_6]) ). 1.23/1.01 1.23/1.01 1.23/1.01 % SZS output end CNFRefutation for theBenchmark.p 1.23/1.01 1.23/1.01 ------ Statistics 1.23/1.01 1.23/1.01 ------ General 1.23/1.01 1.23/1.01 abstr_ref_over_cycles: 0 1.23/1.01 abstr_ref_under_cycles: 0 1.23/1.01 gc_basic_clause_elim: 0 1.23/1.01 forced_gc_time: 0 1.23/1.01 parsing_time: 0.013 1.23/1.01 unif_index_cands_time: 0. 1.23/1.01 unif_index_add_time: 0. 1.23/1.01 orderings_time: 0. 1.23/1.01 out_proof_time: 0.01 1.23/1.01 total_time: 0.064 1.23/1.01 num_of_symbols: 38 1.23/1.01 num_of_terms: 408 1.23/1.01 1.23/1.01 ------ Preprocessing 1.23/1.01 1.23/1.01 num_of_splits: 0 1.23/1.01 num_of_split_atoms: 0 1.23/1.01 num_of_reused_defs: 0 1.23/1.01 num_eq_ax_congr_red: 9 1.23/1.01 num_of_sem_filtered_clauses: 2 1.23/1.01 num_of_subtypes: 0 1.23/1.01 monotx_restored_types: 0 1.23/1.01 sat_num_of_epr_types: 0 1.23/1.01 sat_num_of_non_cyclic_types: 0 1.23/1.01 sat_guarded_non_collapsed_types: 0 1.23/1.01 num_pure_diseq_elim: 0 1.23/1.01 simp_replaced_by: 0 1.23/1.01 res_preprocessed: 42 1.23/1.01 prep_upred: 0 1.23/1.01 prep_unflattend: 0 1.23/1.01 smt_new_axioms: 0 1.23/1.01 pred_elim_cands: 2 1.23/1.01 pred_elim: 0 1.23/1.01 pred_elim_cl: 0 1.23/1.01 pred_elim_cycles: 2 1.23/1.01 merged_defs: 0 1.23/1.01 merged_defs_ncl: 0 1.23/1.01 bin_hyper_res: 0 1.23/1.01 prep_cycles: 4 1.23/1.01 pred_elim_time: 0. 1.23/1.01 splitting_time: 0. 1.23/1.01 sem_filter_time: 0. 1.23/1.01 monotx_time: 0.001 1.23/1.01 subtype_inf_time: 0. 1.23/1.01 1.23/1.01 ------ Problem properties 1.23/1.01 1.23/1.01 clauses: 8 1.23/1.01 conjectures: 0 1.23/1.01 epr: 6 1.23/1.01 horn: 7 1.23/1.01 ground: 2 1.23/1.01 unary: 3 1.23/1.01 binary: 2 1.23/1.01 lits: 16 1.23/1.01 lits_eq: 1 1.23/1.01 fd_pure: 0 1.23/1.01 fd_pseudo: 0 1.23/1.01 fd_cond: 0 1.23/1.01 fd_pseudo_cond: 1 1.23/1.01 ac_symbols: 0 1.23/1.01 1.23/1.01 ------ Propositional Solver 1.23/1.01 1.23/1.01 prop_solver_calls: 29 1.23/1.01 prop_fast_solver_calls: 212 1.23/1.01 smt_solver_calls: 0 1.23/1.01 smt_fast_solver_calls: 0 1.23/1.01 prop_num_of_clauses: 251 1.23/1.01 prop_preprocess_simplified: 1317 1.23/1.01 prop_fo_subsumed: 3 1.23/1.01 prop_solver_time: 0. 1.23/1.01 smt_solver_time: 0. 1.23/1.01 smt_fast_solver_time: 0. 1.23/1.01 prop_fast_solver_time: 0. 1.23/1.01 prop_unsat_core_time: 0. 1.23/1.01 1.23/1.01 ------ QBF 1.23/1.01 1.23/1.01 qbf_q_res: 0 1.23/1.01 qbf_num_tautologies: 0 1.23/1.01 qbf_prep_cycles: 0 1.23/1.01 1.23/1.01 ------ BMC1 1.23/1.01 1.23/1.01 bmc1_current_bound: -1 1.23/1.01 bmc1_last_solved_bound: -1 1.23/1.01 bmc1_unsat_core_size: -1 1.23/1.01 bmc1_unsat_core_parents_size: -1 1.23/1.01 bmc1_merge_next_fun: 0 1.23/1.01 bmc1_unsat_core_clauses_time: 0. 1.23/1.01 1.23/1.01 ------ Instantiation 1.23/1.01 1.23/1.01 inst_num_of_clauses: 69 1.23/1.01 inst_num_in_passive: 4 1.23/1.01 inst_num_in_active: 58 1.23/1.01 inst_num_in_unprocessed: 7 1.23/1.01 inst_num_of_loops: 80 1.23/1.01 inst_num_of_learning_restarts: 0 1.23/1.01 inst_num_moves_active_passive: 16 1.23/1.01 inst_lit_activity: 0 1.23/1.01 inst_lit_activity_moves: 0 1.23/1.01 inst_num_tautologies: 0 1.23/1.01 inst_num_prop_implied: 0 1.23/1.01 inst_num_existing_simplified: 0 1.23/1.01 inst_num_eq_res_simplified: 0 1.23/1.01 inst_num_child_elim: 0 1.23/1.01 inst_num_of_dismatching_blockings: 4 1.23/1.01 inst_num_of_non_proper_insts: 114 1.23/1.01 inst_num_of_duplicates: 0 1.23/1.01 inst_inst_num_from_inst_to_res: 0 1.23/1.01 inst_dismatching_checking_time: 0. 1.23/1.01 1.23/1.01 ------ Resolution 1.23/1.01 1.23/1.01 res_num_of_clauses: 0 1.23/1.01 res_num_in_passive: 0 1.23/1.01 res_num_in_active: 0 1.23/1.01 res_num_of_loops: 46 1.23/1.01 res_forward_subset_subsumed: 14 1.23/1.01 res_backward_subset_subsumed: 0 1.23/1.01 res_forward_subsumed: 0 1.23/1.01 res_backward_subsumed: 0 1.23/1.01 res_forward_subsumption_resolution: 0 1.23/1.01 res_backward_subsumption_resolution: 0 1.23/1.01 res_clause_to_clause_subsumption: 74 1.23/1.01 res_orphan_elimination: 0 1.23/1.01 res_tautology_del: 12 1.23/1.01 res_num_eq_res_simplified: 0 1.23/1.01 res_num_sel_changes: 0 1.23/1.01 res_moves_from_active_to_pass: 0 1.23/1.01 1.23/1.01 ------ Superposition 1.23/1.01 1.23/1.01 sup_time_total: 0. 1.23/1.01 sup_time_generating: 0. 1.23/1.01 sup_time_sim_full: 0. 1.23/1.01 sup_time_sim_immed: 0. 1.23/1.01 1.23/1.01 sup_num_of_clauses: 23 1.23/1.01 sup_num_in_active: 16 1.23/1.01 sup_num_in_passive: 7 1.23/1.01 sup_num_of_loops: 15 1.23/1.01 sup_fw_superposition: 5 1.23/1.01 sup_bw_superposition: 15 1.23/1.01 sup_immediate_simplified: 3 1.23/1.01 sup_given_eliminated: 0 1.23/1.01 comparisons_done: 0 1.23/1.01 comparisons_avoided: 0 1.23/1.01 1.23/1.01 ------ Simplifications 1.23/1.01 1.23/1.01 1.23/1.01 sim_fw_subset_subsumed: 3 1.23/1.01 sim_bw_subset_subsumed: 0 1.23/1.01 sim_fw_subsumed: 0 1.23/1.01 sim_bw_subsumed: 0 1.23/1.01 sim_fw_subsumption_res: 0 1.23/1.01 sim_bw_subsumption_res: 0 1.23/1.01 sim_tautology_del: 0 1.23/1.01 sim_eq_tautology_del: 1 1.23/1.01 sim_eq_res_simp: 0 1.23/1.01 sim_fw_demodulated: 0 1.23/1.01 sim_bw_demodulated: 0 1.23/1.01 sim_light_normalised: 0 1.23/1.01 sim_joinable_taut: 0 1.23/1.01 sim_joinable_simp: 0 1.23/1.01 sim_ac_normalised: 0 1.23/1.01 sim_smt_subsumption: 0 1.23/1.01 1.23/1.02 EOF