0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.11 % Command : iproveropt_run.sh %d %s 0.11/0.32 % Computer : n025.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 960 0.11/0.32 % WCLimit : 120 0.11/0.32 % DateTime : Thu Jul 2 07:16:48 EDT 2020 0.11/0.32 % CPUTime : 0.11/0.32 % Running in FOF mode 7.82/1.46 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p 7.82/1.46 7.82/1.46 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 7.82/1.46 7.82/1.46 ------ iProver source info 7.82/1.46 7.82/1.46 git: date: 2020-06-30 10:37:57 +0100 7.82/1.46 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 7.82/1.46 git: non_committed_changes: false 7.82/1.46 git: last_make_outside_of_git: false 7.82/1.46 7.82/1.46 ------ 7.82/1.46 7.82/1.46 ------ Input Options 7.82/1.46 7.82/1.46 --out_options all 7.82/1.46 --tptp_safe_out true 7.82/1.46 --problem_path "" 7.82/1.46 --include_path "" 7.82/1.46 --clausifier res/vclausify_rel 7.82/1.46 --clausifier_options --mode clausify 7.82/1.46 --stdin false 7.82/1.46 --stats_out all 7.82/1.46 7.82/1.46 ------ General Options 7.82/1.46 7.82/1.46 --fof false 7.82/1.46 --time_out_real 125. 7.82/1.46 --time_out_virtual -1. 7.82/1.46 --symbol_type_check false 7.82/1.46 --clausify_out false 7.82/1.46 --sig_cnt_out false 7.82/1.46 --trig_cnt_out false 7.82/1.46 --trig_cnt_out_tolerance 1. 7.82/1.46 --trig_cnt_out_sk_spl false 7.82/1.46 --abstr_cl_out false 7.82/1.46 7.82/1.46 ------ Global Options 7.82/1.46 7.82/1.46 --schedule default 7.82/1.46 --add_important_lit false 7.82/1.46 --prop_solver_per_cl 1000 7.82/1.46 --min_unsat_core false 7.82/1.46 --soft_assumptions false 7.82/1.46 --soft_lemma_size 3 7.82/1.46 --prop_impl_unit_size 0 7.82/1.46 --prop_impl_unit [] 7.82/1.46 --share_sel_clauses true 7.82/1.46 --reset_solvers false 7.82/1.46 --bc_imp_inh [conj_cone] 7.82/1.46 --conj_cone_tolerance 3. 7.82/1.46 --extra_neg_conj none 7.82/1.46 --large_theory_mode true 7.82/1.46 --prolific_symb_bound 200 7.82/1.46 --lt_threshold 2000 7.82/1.46 --clause_weak_htbl true 7.82/1.46 --gc_record_bc_elim false 7.82/1.46 7.82/1.46 ------ Preprocessing Options 7.82/1.46 7.82/1.46 --preprocessing_flag true 7.82/1.46 --time_out_prep_mult 0.1 7.82/1.46 --splitting_mode input 7.82/1.46 --splitting_grd true 7.82/1.46 --splitting_cvd false 7.82/1.46 --splitting_cvd_svl false 7.82/1.46 --splitting_nvd 32 7.82/1.46 --sub_typing true 7.82/1.46 --prep_gs_sim true 7.82/1.46 --prep_unflatten true 7.82/1.46 --prep_res_sim true 7.82/1.46 --prep_upred true 7.82/1.46 --prep_sem_filter exhaustive 7.82/1.46 --prep_sem_filter_out false 7.82/1.46 --pred_elim true 7.82/1.46 --res_sim_input true 7.82/1.46 --eq_ax_congr_red true 7.82/1.46 --pure_diseq_elim true 7.82/1.46 --brand_transform false 7.82/1.46 --non_eq_to_eq false 7.82/1.46 --prep_def_merge true 7.82/1.46 --prep_def_merge_prop_impl false 7.82/1.46 --prep_def_merge_mbd true 7.82/1.46 --prep_def_merge_tr_red false 7.82/1.46 --prep_def_merge_tr_cl false 7.82/1.46 --smt_preprocessing true 7.82/1.46 --smt_ac_axioms fast 7.82/1.46 --preprocessed_out false 7.82/1.46 --preprocessed_stats false 7.82/1.46 7.82/1.46 ------ Abstraction refinement Options 7.82/1.46 7.82/1.46 --abstr_ref [] 7.82/1.46 --abstr_ref_prep false 7.82/1.46 --abstr_ref_until_sat false 7.82/1.46 --abstr_ref_sig_restrict funpre 7.82/1.46 --abstr_ref_af_restrict_to_split_sk false 7.82/1.46 --abstr_ref_under [] 7.82/1.46 7.82/1.46 ------ SAT Options 7.82/1.46 7.82/1.46 --sat_mode false 7.82/1.46 --sat_fm_restart_options "" 7.82/1.46 --sat_gr_def false 7.82/1.46 --sat_epr_types true 7.82/1.46 --sat_non_cyclic_types false 7.82/1.46 --sat_finite_models false 7.82/1.46 --sat_fm_lemmas false 7.82/1.46 --sat_fm_prep false 7.82/1.46 --sat_fm_uc_incr true 7.82/1.46 --sat_out_model small 7.82/1.46 --sat_out_clauses false 7.82/1.46 7.82/1.46 ------ QBF Options 7.82/1.46 7.82/1.46 --qbf_mode false 7.82/1.46 --qbf_elim_univ false 7.82/1.46 --qbf_dom_inst none 7.82/1.46 --qbf_dom_pre_inst false 7.82/1.46 --qbf_sk_in false 7.82/1.46 --qbf_pred_elim true 7.82/1.46 --qbf_split 512 7.82/1.46 7.82/1.46 ------ BMC1 Options 7.82/1.46 7.82/1.46 --bmc1_incremental false 7.82/1.46 --bmc1_axioms reachable_all 7.82/1.46 --bmc1_min_bound 0 7.82/1.46 --bmc1_max_bound -1 7.82/1.46 --bmc1_max_bound_default -1 7.82/1.46 --bmc1_symbol_reachability true 7.82/1.46 --bmc1_property_lemmas false 7.82/1.46 --bmc1_k_induction false 7.82/1.46 --bmc1_non_equiv_states false 7.82/1.46 --bmc1_deadlock false 7.82/1.46 --bmc1_ucm false 7.82/1.46 --bmc1_add_unsat_core none 7.82/1.46 --bmc1_unsat_core_children false 7.82/1.46 --bmc1_unsat_core_extrapolate_axioms false 7.82/1.46 --bmc1_out_stat full 7.82/1.46 --bmc1_ground_init false 7.82/1.46 --bmc1_pre_inst_next_state false 7.82/1.46 --bmc1_pre_inst_state false 7.82/1.46 --bmc1_pre_inst_reach_state false 7.82/1.46 --bmc1_out_unsat_core false 7.82/1.46 --bmc1_aig_witness_out false 7.82/1.46 --bmc1_verbose false 7.82/1.46 --bmc1_dump_clauses_tptp false 7.82/1.46 --bmc1_dump_unsat_core_tptp false 7.82/1.46 --bmc1_dump_file - 7.82/1.46 --bmc1_ucm_expand_uc_limit 128 7.82/1.46 --bmc1_ucm_n_expand_iterations 6 7.82/1.46 --bmc1_ucm_extend_mode 1 7.82/1.46 --bmc1_ucm_init_mode 2 7.82/1.46 --bmc1_ucm_cone_mode none 7.82/1.46 --bmc1_ucm_reduced_relation_type 0 7.82/1.46 --bmc1_ucm_relax_model 4 7.82/1.46 --bmc1_ucm_full_tr_after_sat true 7.82/1.46 --bmc1_ucm_expand_neg_assumptions false 7.82/1.46 --bmc1_ucm_layered_model none 7.82/1.46 --bmc1_ucm_max_lemma_size 10 7.82/1.46 7.82/1.46 ------ AIG Options 7.82/1.46 7.82/1.46 --aig_mode false 7.82/1.46 7.82/1.46 ------ Instantiation Options 7.82/1.46 7.82/1.46 --instantiation_flag true 7.82/1.46 --inst_sos_flag false 7.82/1.46 --inst_sos_phase true 7.82/1.46 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 7.82/1.46 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 7.82/1.46 --inst_lit_sel_side num_symb 7.82/1.46 --inst_solver_per_active 1400 7.82/1.46 --inst_solver_calls_frac 1. 7.82/1.46 --inst_passive_queue_type priority_queues 7.82/1.46 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 7.82/1.46 --inst_passive_queues_freq [25;2] 7.82/1.46 --inst_dismatching true 7.82/1.46 --inst_eager_unprocessed_to_passive true 7.82/1.46 --inst_prop_sim_given true 7.82/1.46 --inst_prop_sim_new false 7.82/1.46 --inst_subs_new false 7.82/1.46 --inst_eq_res_simp false 7.82/1.46 --inst_subs_given false 7.82/1.46 --inst_orphan_elimination true 7.82/1.46 --inst_learning_loop_flag true 7.82/1.46 --inst_learning_start 3000 7.82/1.46 --inst_learning_factor 2 7.82/1.46 --inst_start_prop_sim_after_learn 3 7.82/1.46 --inst_sel_renew solver 7.82/1.46 --inst_lit_activity_flag true 7.82/1.46 --inst_restr_to_given false 7.82/1.46 --inst_activity_threshold 500 7.82/1.46 --inst_out_proof true 7.82/1.46 7.82/1.46 ------ Resolution Options 7.82/1.46 7.82/1.46 --resolution_flag true 7.82/1.46 --res_lit_sel adaptive 7.82/1.46 --res_lit_sel_side none 7.82/1.46 --res_ordering kbo 7.82/1.46 --res_to_prop_solver active 7.82/1.46 --res_prop_simpl_new false 7.82/1.46 --res_prop_simpl_given true 7.82/1.46 --res_passive_queue_type priority_queues 7.82/1.46 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 7.82/1.47 --res_passive_queues_freq [15;5] 7.82/1.47 --res_forward_subs full 7.82/1.47 --res_backward_subs full 7.82/1.47 --res_forward_subs_resolution true 7.82/1.47 --res_backward_subs_resolution true 7.82/1.47 --res_orphan_elimination true 7.82/1.47 --res_time_limit 2. 7.82/1.47 --res_out_proof true 7.82/1.47 7.82/1.47 ------ Superposition Options 7.82/1.47 7.82/1.47 --superposition_flag true 7.82/1.47 --sup_passive_queue_type priority_queues 7.82/1.47 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 7.82/1.47 --sup_passive_queues_freq [8;1;4] 7.82/1.47 --demod_completeness_check fast 7.82/1.47 --demod_use_ground true 7.82/1.47 --sup_to_prop_solver passive 7.82/1.47 --sup_prop_simpl_new true 7.82/1.47 --sup_prop_simpl_given true 7.82/1.47 --sup_fun_splitting false 7.82/1.47 --sup_smt_interval 50000 7.82/1.47 7.82/1.47 ------ Superposition Simplification Setup 7.82/1.47 7.82/1.47 --sup_indices_passive [] 7.82/1.47 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 7.82/1.47 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 7.82/1.47 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 7.82/1.47 --sup_full_triv [TrivRules;PropSubs] 7.82/1.47 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 7.82/1.47 --sup_full_bw [BwDemod] 7.82/1.47 --sup_immed_triv [TrivRules] 7.82/1.47 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 7.82/1.47 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 7.82/1.47 --sup_immed_bw_main [] 7.82/1.47 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 7.82/1.47 --sup_input_triv [Unflattening;TrivRules] 7.82/1.47 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 7.82/1.47 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 7.82/1.47 7.82/1.47 ------ Combination Options 7.82/1.47 7.82/1.47 --comb_res_mult 3 7.82/1.47 --comb_sup_mult 2 7.82/1.47 --comb_inst_mult 10 7.82/1.47 7.82/1.47 ------ Debug Options 7.82/1.47 7.82/1.47 --dbg_backtrace false 7.82/1.47 --dbg_dump_prop_clauses false 7.82/1.47 --dbg_dump_prop_clauses_file - 7.82/1.47 --dbg_out_stat false 7.82/1.47 ------ Parsing... 7.82/1.47 ------ Clausification by vclausify_rel & Parsing by iProver... 7.82/1.47 7.82/1.47 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 3 0s sf_e pe_s pe_e 7.82/1.47 7.82/1.47 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 7.82/1.47 7.82/1.47 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 7.82/1.47 ------ Proving... 7.82/1.47 ------ Problem Properties 7.82/1.47 7.82/1.47 7.82/1.47 clauses 33 7.82/1.47 conjectures 6 7.82/1.47 EPR 4 7.82/1.47 Horn 23 7.82/1.47 unary 19 7.82/1.47 binary 13 7.82/1.47 lits 48 7.82/1.47 lits eq 23 7.82/1.47 fd_pure 0 7.82/1.47 fd_pseudo 0 7.82/1.47 fd_cond 1 7.82/1.47 fd_pseudo_cond 2 7.82/1.47 AC symbols 0 7.82/1.47 7.82/1.47 ------ Schedule dynamic 5 is on 7.82/1.47 7.82/1.47 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 7.82/1.47 7.82/1.47 7.82/1.47 ------ 7.82/1.47 Current options: 7.82/1.47 ------ 7.82/1.47 7.82/1.47 ------ Input Options 7.82/1.47 7.82/1.47 --out_options all 7.82/1.47 --tptp_safe_out true 7.82/1.47 --problem_path "" 7.82/1.47 --include_path "" 7.82/1.47 --clausifier res/vclausify_rel 7.82/1.47 --clausifier_options --mode clausify 7.82/1.47 --stdin false 7.82/1.47 --stats_out all 7.82/1.47 7.82/1.47 ------ General Options 7.82/1.47 7.82/1.47 --fof false 7.82/1.47 --time_out_real 125. 7.82/1.47 --time_out_virtual -1. 7.82/1.47 --symbol_type_check false 7.82/1.47 --clausify_out false 7.82/1.47 --sig_cnt_out false 7.82/1.47 --trig_cnt_out false 7.82/1.47 --trig_cnt_out_tolerance 1. 7.82/1.47 --trig_cnt_out_sk_spl false 7.82/1.47 --abstr_cl_out false 7.82/1.47 7.82/1.47 ------ Global Options 7.82/1.47 7.82/1.47 --schedule default 7.82/1.47 --add_important_lit false 7.82/1.47 --prop_solver_per_cl 1000 7.82/1.47 --min_unsat_core false 7.82/1.47 --soft_assumptions false 7.82/1.47 --soft_lemma_size 3 7.82/1.47 --prop_impl_unit_size 0 7.82/1.47 --prop_impl_unit [] 7.82/1.47 --share_sel_clauses true 7.82/1.47 --reset_solvers false 7.82/1.47 --bc_imp_inh [conj_cone] 7.82/1.47 --conj_cone_tolerance 3. 7.82/1.47 --extra_neg_conj none 7.82/1.47 --large_theory_mode true 7.82/1.47 --prolific_symb_bound 200 7.82/1.47 --lt_threshold 2000 7.82/1.47 --clause_weak_htbl true 7.82/1.47 --gc_record_bc_elim false 7.82/1.47 7.82/1.47 ------ Preprocessing Options 7.82/1.47 7.82/1.47 --preprocessing_flag true 7.82/1.47 --time_out_prep_mult 0.1 7.82/1.47 --splitting_mode input 7.82/1.47 --splitting_grd true 7.82/1.47 --splitting_cvd false 7.82/1.47 --splitting_cvd_svl false 7.82/1.47 --splitting_nvd 32 7.82/1.47 --sub_typing true 7.82/1.47 --prep_gs_sim true 7.82/1.47 --prep_unflatten true 7.82/1.47 --prep_res_sim true 7.82/1.47 --prep_upred true 7.82/1.47 --prep_sem_filter exhaustive 7.82/1.47 --prep_sem_filter_out false 7.82/1.47 --pred_elim true 7.82/1.47 --res_sim_input true 7.82/1.47 --eq_ax_congr_red true 7.82/1.47 --pure_diseq_elim true 7.82/1.47 --brand_transform false 7.82/1.47 --non_eq_to_eq false 7.82/1.47 --prep_def_merge true 7.82/1.47 --prep_def_merge_prop_impl false 7.82/1.47 --prep_def_merge_mbd true 7.82/1.47 --prep_def_merge_tr_red false 7.82/1.47 --prep_def_merge_tr_cl false 7.82/1.47 --smt_preprocessing true 7.82/1.47 --smt_ac_axioms fast 7.82/1.47 --preprocessed_out false 7.82/1.47 --preprocessed_stats false 7.82/1.47 7.82/1.47 ------ Abstraction refinement Options 7.82/1.47 7.82/1.47 --abstr_ref [] 7.82/1.47 --abstr_ref_prep false 7.82/1.47 --abstr_ref_until_sat false 7.82/1.47 --abstr_ref_sig_restrict funpre 7.82/1.47 --abstr_ref_af_restrict_to_split_sk false 7.82/1.47 --abstr_ref_under [] 7.82/1.47 7.82/1.47 ------ SAT Options 7.82/1.47 7.82/1.47 --sat_mode false 7.82/1.47 --sat_fm_restart_options "" 7.82/1.47 --sat_gr_def false 7.82/1.47 --sat_epr_types true 7.82/1.47 --sat_non_cyclic_types false 7.82/1.47 --sat_finite_models false 7.82/1.47 --sat_fm_lemmas false 7.82/1.47 --sat_fm_prep false 7.82/1.47 --sat_fm_uc_incr true 7.82/1.47 --sat_out_model small 7.82/1.47 --sat_out_clauses false 7.82/1.47 7.82/1.47 ------ QBF Options 7.82/1.47 7.82/1.47 --qbf_mode false 7.82/1.47 --qbf_elim_univ false 7.82/1.47 --qbf_dom_inst none 7.82/1.47 --qbf_dom_pre_inst false 7.82/1.47 --qbf_sk_in false 7.82/1.47 --qbf_pred_elim true 7.82/1.47 --qbf_split 512 7.82/1.47 7.82/1.47 ------ BMC1 Options 7.82/1.47 7.82/1.47 --bmc1_incremental false 7.82/1.47 --bmc1_axioms reachable_all 7.82/1.47 --bmc1_min_bound 0 7.82/1.47 --bmc1_max_bound -1 7.82/1.47 --bmc1_max_bound_default -1 7.82/1.47 --bmc1_symbol_reachability true 7.82/1.47 --bmc1_property_lemmas false 7.82/1.47 --bmc1_k_induction false 7.82/1.47 --bmc1_non_equiv_states false 7.82/1.47 --bmc1_deadlock false 7.82/1.47 --bmc1_ucm false 7.82/1.47 --bmc1_add_unsat_core none 7.82/1.47 --bmc1_unsat_core_children false 7.82/1.47 --bmc1_unsat_core_extrapolate_axioms false 7.82/1.47 --bmc1_out_stat full 7.82/1.47 --bmc1_ground_init false 7.82/1.47 --bmc1_pre_inst_next_state false 7.82/1.47 --bmc1_pre_inst_state false 7.82/1.47 --bmc1_pre_inst_reach_state false 7.82/1.47 --bmc1_out_unsat_core false 7.82/1.47 --bmc1_aig_witness_out false 7.82/1.47 --bmc1_verbose false 7.82/1.47 --bmc1_dump_clauses_tptp false 7.82/1.47 --bmc1_dump_unsat_core_tptp false 7.82/1.47 --bmc1_dump_file - 7.82/1.47 --bmc1_ucm_expand_uc_limit 128 7.82/1.47 --bmc1_ucm_n_expand_iterations 6 7.82/1.47 --bmc1_ucm_extend_mode 1 7.82/1.47 --bmc1_ucm_init_mode 2 7.82/1.47 --bmc1_ucm_cone_mode none 7.82/1.47 --bmc1_ucm_reduced_relation_type 0 7.82/1.47 --bmc1_ucm_relax_model 4 7.82/1.47 --bmc1_ucm_full_tr_after_sat true 7.82/1.47 --bmc1_ucm_expand_neg_assumptions false 7.82/1.47 --bmc1_ucm_layered_model none 7.82/1.47 --bmc1_ucm_max_lemma_size 10 7.82/1.47 7.82/1.47 ------ AIG Options 7.82/1.47 7.82/1.47 --aig_mode false 7.82/1.47 7.82/1.47 ------ Instantiation Options 7.82/1.47 7.82/1.47 --instantiation_flag true 7.82/1.47 --inst_sos_flag false 7.82/1.47 --inst_sos_phase true 7.82/1.47 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 7.82/1.47 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 7.82/1.47 --inst_lit_sel_side none 7.82/1.47 --inst_solver_per_active 1400 7.82/1.47 --inst_solver_calls_frac 1. 7.82/1.47 --inst_passive_queue_type priority_queues 7.82/1.47 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 7.82/1.47 --inst_passive_queues_freq [25;2] 7.82/1.47 --inst_dismatching true 7.82/1.47 --inst_eager_unprocessed_to_passive true 7.82/1.47 --inst_prop_sim_given true 7.82/1.47 --inst_prop_sim_new false 7.82/1.47 --inst_subs_new false 7.82/1.47 --inst_eq_res_simp false 7.82/1.47 --inst_subs_given false 7.82/1.47 --inst_orphan_elimination true 7.82/1.47 --inst_learning_loop_flag true 7.82/1.47 --inst_learning_start 3000 7.82/1.47 --inst_learning_factor 2 7.82/1.47 --inst_start_prop_sim_after_learn 3 7.82/1.47 --inst_sel_renew solver 7.82/1.47 --inst_lit_activity_flag true 7.82/1.47 --inst_restr_to_given false 7.82/1.47 --inst_activity_threshold 500 7.82/1.47 --inst_out_proof true 7.82/1.47 7.82/1.47 ------ Resolution Options 7.82/1.47 7.82/1.47 --resolution_flag false 7.82/1.47 --res_lit_sel adaptive 7.82/1.47 --res_lit_sel_side none 7.82/1.47 --res_ordering kbo 7.82/1.47 --res_to_prop_solver active 7.82/1.47 --res_prop_simpl_new false 7.82/1.47 --res_prop_simpl_given true 7.82/1.47 --res_passive_queue_type priority_queues 7.82/1.47 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 7.82/1.47 --res_passive_queues_freq [15;5] 7.82/1.47 --res_forward_subs full 7.82/1.47 --res_backward_subs full 7.82/1.47 --res_forward_subs_resolution true 7.82/1.47 --res_backward_subs_resolution true 7.82/1.47 --res_orphan_elimination true 7.82/1.47 --res_time_limit 2. 7.82/1.47 --res_out_proof true 7.82/1.47 7.82/1.47 ------ Superposition Options 7.82/1.47 7.82/1.47 --superposition_flag true 7.82/1.47 --sup_passive_queue_type priority_queues 7.82/1.47 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 7.82/1.47 --sup_passive_queues_freq [8;1;4] 7.82/1.47 --demod_completeness_check fast 7.82/1.47 --demod_use_ground true 7.82/1.47 --sup_to_prop_solver passive 7.82/1.47 --sup_prop_simpl_new true 7.82/1.47 --sup_prop_simpl_given true 7.82/1.47 --sup_fun_splitting false 7.82/1.47 --sup_smt_interval 50000 7.82/1.47 7.82/1.47 ------ Superposition Simplification Setup 7.82/1.47 7.82/1.47 --sup_indices_passive [] 7.82/1.47 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 7.82/1.47 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 7.82/1.47 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 7.82/1.47 --sup_full_triv [TrivRules;PropSubs] 7.82/1.47 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 7.82/1.47 --sup_full_bw [BwDemod] 7.82/1.47 --sup_immed_triv [TrivRules] 7.82/1.47 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 7.82/1.47 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 7.82/1.47 --sup_immed_bw_main [] 7.82/1.47 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 7.82/1.47 --sup_input_triv [Unflattening;TrivRules] 7.82/1.47 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 7.82/1.47 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 7.82/1.47 7.82/1.47 ------ Combination Options 7.82/1.47 7.82/1.47 --comb_res_mult 3 7.82/1.47 --comb_sup_mult 2 7.82/1.47 --comb_inst_mult 10 7.82/1.47 7.82/1.47 ------ Debug Options 7.82/1.47 7.82/1.47 --dbg_backtrace false 7.82/1.47 --dbg_dump_prop_clauses false 7.82/1.47 --dbg_dump_prop_clauses_file - 7.82/1.47 --dbg_out_stat false 7.82/1.47 7.82/1.47 7.82/1.47 7.82/1.47 7.82/1.47 ------ Proving... 7.82/1.47 7.82/1.47 7.82/1.47 % SZS status Theorem for theBenchmark.p 7.82/1.47 7.82/1.47 % SZS output start CNFRefutation for theBenchmark.p 7.82/1.47 7.82/1.47 fof(f12,conjecture,( 7.82/1.47 ? [X6] : (! [X13] : (X6 != X13 | ! [X15] : (~r1(X15) | ~r2(X15,X13))) & ! [X32] : (X6 != X32 | ~r1(X32)))), 7.82/1.47 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 7.82/1.47 7.82/1.47 fof(f13,negated_conjecture,( 7.82/1.47 ~? [X6] : (! [X13] : (X6 != X13 | ! [X15] : (~r1(X15) | ~r2(X15,X13))) & ! [X32] : (X6 != X32 | ~r1(X32)))), 7.82/1.47 inference(negated_conjecture,[],[f12])). 7.82/1.47 7.82/1.47 fof(f24,plain,( 7.82/1.47 ~? [X0] : (! [X1] : (X0 != X1 | ! [X2] : (~r1(X2) | ~r2(X2,X1))) & ! [X3] : (X0 != X3 | ~r1(X3)))), 7.82/1.47 inference(rectify,[],[f13])). 7.82/1.47 7.82/1.47 fof(f25,plain,( 7.82/1.47 ! [X0] : (? [X1] : (X0 = X1 & ? [X2] : (r1(X2) & r2(X2,X1))) | ? [X3] : (X0 = X3 & r1(X3)))), 7.82/1.47 inference(ennf_transformation,[],[f24])). 7.82/1.47 7.82/1.47 fof(f56,plain,( 7.82/1.47 ! [X0] : (? [X3] : (X0 = X3 & r1(X3)) => (sK22(X0) = X0 & r1(sK22(X0))))), 7.82/1.47 introduced(choice_axiom,[])). 7.82/1.47 7.82/1.47 fof(f55,plain,( 7.82/1.47 ( ! [X1] : (! [X0] : (? [X2] : (r1(X2) & r2(X2,X1)) => (r1(sK21(X0)) & r2(sK21(X0),X1)))) )), 7.82/1.47 introduced(choice_axiom,[])). 7.82/1.47 7.82/1.47 fof(f54,plain,( 7.82/1.47 ! [X0] : (? [X1] : (X0 = X1 & ? [X2] : (r1(X2) & r2(X2,X1))) => (sK20(X0) = X0 & ? [X2] : (r1(X2) & r2(X2,sK20(X0)))))), 7.82/1.47 introduced(choice_axiom,[])). 7.82/1.47 7.82/1.47 fof(f57,plain,( 7.82/1.47 ! [X0] : ((sK20(X0) = X0 & (r1(sK21(X0)) & r2(sK21(X0),sK20(X0)))) | (sK22(X0) = X0 & r1(sK22(X0))))), 7.82/1.47 inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21,sK22])],[f25,f56,f55,f54])). 7.82/1.47 7.82/1.47 fof(f102,plain,( 7.82/1.47 ( ! [X0] : (sK20(X0) = X0 | sK22(X0) = X0) )), 7.82/1.47 inference(cnf_transformation,[],[f57])). 7.82/1.47 7.82/1.47 fof(f101,plain,( 7.82/1.47 ( ! [X0] : (sK20(X0) = X0 | r1(sK22(X0))) )), 7.82/1.47 inference(cnf_transformation,[],[f57])). 7.82/1.47 7.82/1.47 fof(f3,axiom,( 7.82/1.47 ! [X8] : ? [X9] : ! [X10] : ((X9 != X10 & ~r2(X8,X10)) | (r2(X8,X10) & X9 = X10))), 7.82/1.47 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 7.82/1.47 7.82/1.47 fof(f15,plain,( 7.82/1.47 ! [X0] : ? [X1] : ! [X2] : ((X1 != X2 & ~r2(X0,X2)) | (r2(X0,X2) & X1 = X2))), 7.82/1.47 inference(rectify,[],[f3])). 7.82/1.47 7.82/1.47 fof(f31,plain,( 7.82/1.47 ! [X0] : (? [X1] : ! [X2] : ((X1 != X2 & ~r2(X0,X2)) | (r2(X0,X2) & X1 = X2)) => ! [X2] : ((sK4(X0) != X2 & ~r2(X0,X2)) | (r2(X0,X2) & sK4(X0) = X2)))), 7.82/1.47 introduced(choice_axiom,[])). 7.82/1.47 7.82/1.47 fof(f32,plain,( 7.82/1.47 ! [X0] : ! [X2] : ((sK4(X0) != X2 & ~r2(X0,X2)) | (r2(X0,X2) & sK4(X0) = X2))), 7.82/1.47 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f15,f31])). 7.82/1.47 7.82/1.47 fof(f69,plain,( 7.82/1.47 ( ! [X2,X0] : (sK4(X0) != X2 | r2(X0,X2)) )), 7.82/1.47 inference(cnf_transformation,[],[f32])). 7.82/1.47 7.82/1.47 fof(f105,plain,( 7.82/1.47 ( ! [X0] : (r2(X0,sK4(X0))) )), 7.82/1.47 inference(equality_resolution,[],[f69])). 7.82/1.47 7.82/1.47 fof(f8,axiom,( 7.82/1.47 ! [X27,X28] : (! [X29] : (~r1(X29) | X28 != X29) | ~r2(X27,X28))), 7.82/1.47 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 7.82/1.47 7.82/1.47 fof(f20,plain,( 7.82/1.47 ! [X0,X1] : (! [X2] : (~r1(X2) | X1 != X2) | ~r2(X0,X1))), 7.82/1.47 inference(rectify,[],[f8])). 7.82/1.47 7.82/1.47 fof(f87,plain,( 7.82/1.47 ( ! [X2,X0,X1] : (~r1(X2) | X1 != X2 | ~r2(X0,X1)) )), 7.82/1.47 inference(cnf_transformation,[],[f20])). 7.82/1.47 7.82/1.47 fof(f111,plain,( 7.82/1.47 ( ! [X2,X0] : (~r1(X2) | ~r2(X0,X2)) )), 7.82/1.47 inference(equality_resolution,[],[f87])). 7.82/1.47 7.82/1.47 fof(f98,plain,( 7.82/1.47 ( ! [X0] : (r2(sK21(X0),sK20(X0)) | sK22(X0) = X0) )), 7.82/1.47 inference(cnf_transformation,[],[f57])). 7.82/1.47 7.82/1.47 fof(f10,axiom,( 7.82/1.47 ! [X36,X37] : (! [X38] : (! [X39] : (X38 != X39 | ~r2(X36,X39)) | ~r2(X37,X38)) | X36 = X37)), 7.82/1.47 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 7.82/1.47 7.82/1.47 fof(f22,plain,( 7.82/1.47 ! [X0,X1] : (! [X2] : (! [X3] : (X2 != X3 | ~r2(X0,X3)) | ~r2(X1,X2)) | X0 = X1)), 7.82/1.47 inference(rectify,[],[f10])). 7.82/1.47 7.82/1.47 fof(f93,plain,( 7.82/1.47 ( ! [X2,X0,X3,X1] : (X2 != X3 | ~r2(X0,X3) | ~r2(X1,X2) | X0 = X1) )), 7.82/1.47 inference(cnf_transformation,[],[f22])). 7.82/1.47 7.82/1.47 fof(f112,plain,( 7.82/1.47 ( ! [X0,X3,X1] : (~r2(X0,X3) | ~r2(X1,X3) | X0 = X1) )), 7.82/1.47 inference(equality_resolution,[],[f93])). 7.82/1.47 7.82/1.47 fof(f100,plain,( 7.82/1.47 ( ! [X0] : (r1(sK21(X0)) | sK22(X0) = X0) )), 7.82/1.47 inference(cnf_transformation,[],[f57])). 7.82/1.47 7.82/1.47 fof(f97,plain,( 7.82/1.47 ( ! [X0] : (r2(sK21(X0),sK20(X0)) | r1(sK22(X0))) )), 7.82/1.47 inference(cnf_transformation,[],[f57])). 7.82/1.47 7.82/1.47 fof(f5,axiom,( 7.82/1.47 ? [X17] : ! [X18] : ((~r1(X18) & X17 != X18) | (X17 = X18 & r1(X18)))), 7.82/1.47 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 7.82/1.47 7.82/1.47 fof(f17,plain,( 7.82/1.47 ? [X0] : ! [X1] : ((~r1(X1) & X0 != X1) | (X0 = X1 & r1(X1)))), 7.82/1.47 inference(rectify,[],[f5])). 7.82/1.47 7.82/1.47 fof(f38,plain,( 7.82/1.47 ? [X0] : ! [X1] : ((~r1(X1) & X0 != X1) | (X0 = X1 & r1(X1))) => ! [X1] : ((~r1(X1) & sK9 != X1) | (sK9 = X1 & r1(X1)))), 7.82/1.47 introduced(choice_axiom,[])). 7.82/1.47 7.82/1.47 fof(f39,plain,( 7.82/1.47 ! [X1] : ((~r1(X1) & sK9 != X1) | (sK9 = X1 & r1(X1)))), 7.82/1.47 inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f17,f38])). 7.82/1.47 7.82/1.47 fof(f78,plain,( 7.82/1.47 ( ! [X1] : (~r1(X1) | sK9 = X1) )), 7.82/1.47 inference(cnf_transformation,[],[f39])). 7.82/1.47 7.82/1.47 fof(f99,plain,( 7.82/1.47 ( ! [X0] : (r1(sK21(X0)) | r1(sK22(X0))) )), 7.82/1.47 inference(cnf_transformation,[],[f57])). 7.82/1.47 7.82/1.47 fof(f75,plain,( 7.82/1.47 ( ! [X1] : (sK9 != X1 | r1(X1)) )), 7.82/1.47 inference(cnf_transformation,[],[f39])). 7.82/1.47 7.82/1.47 fof(f108,plain,( 7.82/1.47 r1(sK9)), 7.82/1.47 inference(equality_resolution,[],[f75])). 7.82/1.47 7.82/1.47 cnf(c_39,negated_conjecture, 7.82/1.47 ( sK22(X0) = X0 | sK20(X0) = X0 ), 7.82/1.47 inference(cnf_transformation,[],[f102]) ). 7.82/1.47 7.82/1.47 cnf(c_40,negated_conjecture, 7.82/1.47 ( r1(sK22(X0)) | sK20(X0) = X0 ), 7.82/1.47 inference(cnf_transformation,[],[f101]) ). 7.82/1.47 7.82/1.47 cnf(c_925,plain, 7.82/1.47 ( sK20(X0) = X0 | r1(sK22(X0)) = iProver_top ), 7.82/1.47 inference(predicate_to_equality,[status(thm)],[c_40]) ). 7.82/1.47 7.82/1.47 cnf(c_1113,plain, 7.82/1.47 ( sK20(X0) = X0 | r1(X0) = iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_39,c_925]) ). 7.82/1.47 7.82/1.47 cnf(c_8,plain, 7.82/1.47 ( r2(X0,sK4(X0)) ), 7.82/1.47 inference(cnf_transformation,[],[f105]) ). 7.82/1.47 7.82/1.47 cnf(c_937,plain, 7.82/1.47 ( r2(X0,sK4(X0)) = iProver_top ), 7.82/1.47 inference(predicate_to_equality,[status(thm)],[c_8]) ). 7.82/1.47 7.82/1.47 cnf(c_29,plain, 7.82/1.47 ( ~ r2(X0,X1) | ~ r1(X1) ), 7.82/1.47 inference(cnf_transformation,[],[f111]) ). 7.82/1.47 7.82/1.47 cnf(c_930,plain, 7.82/1.47 ( r2(X0,X1) != iProver_top | r1(X1) != iProver_top ), 7.82/1.47 inference(predicate_to_equality,[status(thm)],[c_29]) ). 7.82/1.47 7.82/1.47 cnf(c_2049,plain, 7.82/1.47 ( r1(sK4(X0)) != iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_937,c_930]) ). 7.82/1.47 7.82/1.47 cnf(c_6209,plain, 7.82/1.47 ( sK20(sK4(X0)) = sK4(X0) ), 7.82/1.47 inference(superposition,[status(thm)],[c_1113,c_2049]) ). 7.82/1.47 7.82/1.47 cnf(c_43,negated_conjecture, 7.82/1.47 ( r2(sK21(X0),sK20(X0)) | sK22(X0) = X0 ), 7.82/1.47 inference(cnf_transformation,[],[f98]) ). 7.82/1.47 7.82/1.47 cnf(c_922,plain, 7.82/1.47 ( sK22(X0) = X0 | r2(sK21(X0),sK20(X0)) = iProver_top ), 7.82/1.47 inference(predicate_to_equality,[status(thm)],[c_43]) ). 7.82/1.47 7.82/1.47 cnf(c_6394,plain, 7.82/1.47 ( sK22(sK4(X0)) = sK4(X0) 7.82/1.47 | r2(sK21(sK4(X0)),sK4(X0)) = iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_6209,c_922]) ). 7.82/1.47 7.82/1.47 cnf(c_35,plain, 7.82/1.47 ( ~ r2(X0,X1) | ~ r2(X2,X1) | X2 = X0 ), 7.82/1.47 inference(cnf_transformation,[],[f112]) ). 7.82/1.47 7.82/1.47 cnf(c_927,plain, 7.82/1.47 ( X0 = X1 | r2(X1,X2) != iProver_top | r2(X0,X2) != iProver_top ), 7.82/1.47 inference(predicate_to_equality,[status(thm)],[c_35]) ). 7.82/1.47 7.82/1.47 cnf(c_4307,plain, 7.82/1.47 ( X0 = X1 | r2(X1,sK4(X0)) != iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_937,c_927]) ). 7.82/1.47 7.82/1.47 cnf(c_16517,plain, 7.82/1.47 ( sK21(sK4(X0)) = X0 | sK22(sK4(X0)) = sK4(X0) ), 7.82/1.47 inference(superposition,[status(thm)],[c_6394,c_4307]) ). 7.82/1.47 7.82/1.47 cnf(c_41,negated_conjecture, 7.82/1.47 ( r1(sK21(X0)) | sK22(X0) = X0 ), 7.82/1.47 inference(cnf_transformation,[],[f100]) ). 7.82/1.47 7.82/1.47 cnf(c_924,plain, 7.82/1.47 ( sK22(X0) = X0 | r1(sK21(X0)) = iProver_top ), 7.82/1.47 inference(predicate_to_equality,[status(thm)],[c_41]) ). 7.82/1.47 7.82/1.47 cnf(c_17418,plain, 7.82/1.47 ( sK22(sK4(X0)) = sK4(X0) | r1(X0) = iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_16517,c_924]) ). 7.82/1.47 7.82/1.47 cnf(c_17496,plain, 7.82/1.47 ( sK22(sK4(sK4(X0))) = sK4(sK4(X0)) ), 7.82/1.47 inference(superposition,[status(thm)],[c_17418,c_2049]) ). 7.82/1.47 7.82/1.47 cnf(c_44,negated_conjecture, 7.82/1.47 ( r2(sK21(X0),sK20(X0)) | r1(sK22(X0)) ), 7.82/1.47 inference(cnf_transformation,[],[f97]) ). 7.82/1.47 7.82/1.47 cnf(c_921,plain, 7.82/1.47 ( r2(sK21(X0),sK20(X0)) = iProver_top 7.82/1.47 | r1(sK22(X0)) = iProver_top ), 7.82/1.47 inference(predicate_to_equality,[status(thm)],[c_44]) ). 7.82/1.47 7.82/1.47 cnf(c_6393,plain, 7.82/1.47 ( r2(sK21(sK4(X0)),sK4(X0)) = iProver_top 7.82/1.47 | r1(sK22(sK4(X0))) = iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_6209,c_921]) ). 7.82/1.47 7.82/1.47 cnf(c_16518,plain, 7.82/1.47 ( sK21(sK4(X0)) = X0 | r1(sK22(sK4(X0))) = iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_6393,c_4307]) ). 7.82/1.47 7.82/1.47 cnf(c_17,plain, 7.82/1.47 ( ~ r1(X0) | sK9 = X0 ), 7.82/1.47 inference(cnf_transformation,[],[f78]) ). 7.82/1.47 7.82/1.47 cnf(c_934,plain, 7.82/1.47 ( sK9 = X0 | r1(X0) != iProver_top ), 7.82/1.47 inference(predicate_to_equality,[status(thm)],[c_17]) ). 7.82/1.47 7.82/1.47 cnf(c_18875,plain, 7.82/1.47 ( sK21(sK4(X0)) = X0 | sK22(sK4(X0)) = sK9 ), 7.82/1.47 inference(superposition,[status(thm)],[c_16518,c_934]) ). 7.82/1.47 7.82/1.47 cnf(c_42,negated_conjecture, 7.82/1.47 ( r1(sK21(X0)) | r1(sK22(X0)) ), 7.82/1.47 inference(cnf_transformation,[],[f99]) ). 7.82/1.47 7.82/1.47 cnf(c_923,plain, 7.82/1.47 ( r1(sK21(X0)) = iProver_top | r1(sK22(X0)) = iProver_top ), 7.82/1.47 inference(predicate_to_equality,[status(thm)],[c_42]) ). 7.82/1.47 7.82/1.47 cnf(c_20822,plain, 7.82/1.47 ( sK22(sK4(X0)) = sK9 7.82/1.47 | r1(X0) = iProver_top 7.82/1.47 | r1(sK22(sK4(X0))) = iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_18875,c_923]) ). 7.82/1.47 7.82/1.47 cnf(c_21993,plain, 7.82/1.47 ( sK22(sK4(X0)) = sK9 | r1(X0) = iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_20822,c_934]) ). 7.82/1.47 7.82/1.47 cnf(c_2051,plain, 7.82/1.47 ( r1(sK22(X0)) = iProver_top | r1(sK20(X0)) != iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_921,c_930]) ). 7.82/1.47 7.82/1.47 cnf(c_22310,plain, 7.82/1.47 ( sK22(sK4(sK20(X0))) = sK9 | r1(sK22(X0)) = iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_21993,c_2051]) ). 7.82/1.47 7.82/1.47 cnf(c_23521,plain, 7.82/1.47 ( sK22(sK4(sK20(sK4(sK4(X0))))) = sK9 7.82/1.47 | r1(sK4(sK4(X0))) = iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_17496,c_22310]) ). 7.82/1.47 7.82/1.47 cnf(c_23552,plain, 7.82/1.47 ( sK4(sK4(sK4(X0))) = sK9 | r1(sK4(sK4(X0))) = iProver_top ), 7.82/1.47 inference(demodulation,[status(thm)],[c_23521,c_6209,c_17496]) ). 7.82/1.47 7.82/1.47 cnf(c_24845,plain, 7.82/1.47 ( sK4(sK4(sK4(X0))) = sK9 ), 7.82/1.47 inference(forward_subsumption_resolution, 7.82/1.47 [status(thm)], 7.82/1.47 [c_23552,c_2049]) ). 7.82/1.47 7.82/1.47 cnf(c_24871,plain, 7.82/1.47 ( sK21(sK4(sK4(sK4(X0)))) = sK4(sK4(X0)) 7.82/1.47 | r1(sK22(sK9)) = iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_24845,c_16518]) ). 7.82/1.47 7.82/1.47 cnf(c_2235,plain, 7.82/1.47 ( sK21(X0) = sK9 | r1(sK22(X0)) = iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_923,c_934]) ). 7.82/1.47 7.82/1.47 cnf(c_17636,plain, 7.82/1.47 ( sK21(sK4(sK4(X0))) = sK9 | r1(sK4(sK4(X0))) = iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_17496,c_2235]) ). 7.82/1.47 7.82/1.47 cnf(c_19523,plain, 7.82/1.47 ( sK21(sK4(sK4(X0))) = sK9 ), 7.82/1.47 inference(forward_subsumption_resolution, 7.82/1.47 [status(thm)], 7.82/1.47 [c_17636,c_2049]) ). 7.82/1.47 7.82/1.47 cnf(c_24891,plain, 7.82/1.47 ( sK21(sK9) = sK9 ), 7.82/1.47 inference(superposition,[status(thm)],[c_24845,c_19523]) ). 7.82/1.47 7.82/1.47 cnf(c_24892,plain, 7.82/1.47 ( sK4(sK4(sK4(X0))) = sK22(sK9) ), 7.82/1.47 inference(superposition,[status(thm)],[c_24845,c_17496]) ). 7.82/1.47 7.82/1.47 cnf(c_24893,plain, 7.82/1.47 ( sK22(sK9) = sK9 ), 7.82/1.47 inference(light_normalisation,[status(thm)],[c_24892,c_24845]) ). 7.82/1.47 7.82/1.47 cnf(c_24931,plain, 7.82/1.47 ( sK4(sK4(X0)) = sK9 | r1(sK9) = iProver_top ), 7.82/1.47 inference(light_normalisation, 7.82/1.47 [status(thm)], 7.82/1.47 [c_24871,c_24845,c_24891,c_24893]) ). 7.82/1.47 7.82/1.47 cnf(c_24885,plain, 7.82/1.47 ( r1(sK9) != iProver_top ), 7.82/1.47 inference(superposition,[status(thm)],[c_24845,c_2049]) ). 7.82/1.47 7.82/1.47 cnf(c_24934,plain, 7.82/1.47 ( sK4(sK4(X0)) = sK9 ), 7.82/1.47 inference(forward_subsumption_resolution, 7.82/1.47 [status(thm)], 7.82/1.47 [c_24931,c_24885]) ). 7.82/1.47 7.82/1.47 cnf(c_24937,plain, 7.82/1.47 ( sK4(sK9) = sK9 ), 7.82/1.47 inference(demodulation,[status(thm)],[c_24934,c_24845]) ). 7.82/1.47 7.82/1.47 cnf(c_588,plain,( ~ r1(X0) | r1(X1) | X1 != X0 ),theory(equality) ). 7.82/1.47 7.82/1.47 cnf(c_1171,plain, 7.82/1.47 ( ~ r1(X0) | r1(sK4(X1)) | sK4(X1) != X0 ), 7.82/1.47 inference(instantiation,[status(thm)],[c_588]) ). 7.82/1.47 7.82/1.47 cnf(c_1173,plain, 7.82/1.47 ( r1(sK4(sK9)) | ~ r1(sK9) | sK4(sK9) != sK9 ), 7.82/1.47 inference(instantiation,[status(thm)],[c_1171]) ). 7.82/1.47 7.82/1.47 cnf(c_1095,plain, 7.82/1.47 ( ~ r2(X0,sK4(X0)) | ~ r1(sK4(X0)) ), 7.82/1.47 inference(instantiation,[status(thm)],[c_29]) ). 7.82/1.47 7.82/1.47 cnf(c_1097,plain, 7.82/1.47 ( ~ r2(sK9,sK4(sK9)) | ~ r1(sK4(sK9)) ), 7.82/1.47 inference(instantiation,[status(thm)],[c_1095]) ). 7.82/1.47 7.82/1.47 cnf(c_127,plain, 7.82/1.47 ( r2(sK9,sK4(sK9)) ), 7.82/1.47 inference(instantiation,[status(thm)],[c_8]) ). 7.82/1.47 7.82/1.47 cnf(c_20,plain,( r1(sK9) ),inference(cnf_transformation,[],[f108]) ). 7.82/1.47 7.82/1.47 cnf(contradiction,plain, 7.82/1.47 ( $false ), 7.82/1.47 inference(minisat,[status(thm)],[c_24937,c_1173,c_1097,c_127,c_20]) ). 7.82/1.47 7.82/1.47 7.82/1.47 % SZS output end CNFRefutation for theBenchmark.p 7.82/1.47 7.82/1.47 ------ Statistics 7.82/1.47 7.82/1.47 ------ General 7.82/1.47 7.82/1.47 abstr_ref_over_cycles: 0 7.82/1.47 abstr_ref_under_cycles: 0 7.82/1.47 gc_basic_clause_elim: 0 7.82/1.47 forced_gc_time: 0 7.82/1.47 parsing_time: 0.009 7.82/1.47 unif_index_cands_time: 0. 7.82/1.47 unif_index_add_time: 0. 7.82/1.47 orderings_time: 0. 7.82/1.47 out_proof_time: 0.013 7.82/1.47 total_time: 0.829 7.82/1.47 num_of_symbols: 58 7.82/1.47 num_of_terms: 22417 7.82/1.47 7.82/1.47 ------ Preprocessing 7.82/1.47 7.82/1.47 num_of_splits: 0 7.82/1.47 num_of_split_atoms: 0 7.82/1.47 num_of_reused_defs: 0 7.82/1.47 num_eq_ax_congr_red: 91 7.82/1.47 num_of_sem_filtered_clauses: 1 7.82/1.47 num_of_subtypes: 0 7.82/1.47 monotx_restored_types: 0 7.82/1.47 sat_num_of_epr_types: 0 7.82/1.47 sat_num_of_non_cyclic_types: 0 7.82/1.47 sat_guarded_non_collapsed_types: 0 7.82/1.47 num_pure_diseq_elim: 0 7.82/1.47 simp_replaced_by: 0 7.82/1.47 res_preprocessed: 149 7.82/1.47 prep_upred: 0 7.82/1.47 prep_unflattend: 27 7.82/1.47 smt_new_axioms: 0 7.82/1.47 pred_elim_cands: 2 7.82/1.47 pred_elim: 2 7.82/1.47 pred_elim_cl: 4 7.82/1.47 pred_elim_cycles: 4 7.82/1.47 merged_defs: 0 7.82/1.47 merged_defs_ncl: 0 7.82/1.47 bin_hyper_res: 0 7.82/1.47 prep_cycles: 4 7.82/1.47 pred_elim_time: 0.002 7.82/1.47 splitting_time: 0. 7.82/1.47 sem_filter_time: 0. 7.82/1.47 monotx_time: 0. 7.82/1.47 subtype_inf_time: 0. 7.82/1.47 7.82/1.47 ------ Problem properties 7.82/1.47 7.82/1.47 clauses: 33 7.82/1.47 conjectures: 6 7.82/1.47 epr: 4 7.82/1.47 horn: 23 7.82/1.47 ground: 1 7.82/1.47 unary: 19 7.82/1.47 binary: 13 7.82/1.47 lits: 48 7.82/1.47 lits_eq: 23 7.82/1.47 fd_pure: 0 7.82/1.47 fd_pseudo: 0 7.82/1.47 fd_cond: 1 7.82/1.47 fd_pseudo_cond: 2 7.82/1.47 ac_symbols: 0 7.82/1.47 7.82/1.47 ------ Propositional Solver 7.82/1.47 7.82/1.47 prop_solver_calls: 29 7.82/1.47 prop_fast_solver_calls: 812 7.82/1.47 smt_solver_calls: 0 7.82/1.47 smt_fast_solver_calls: 0 7.82/1.47 prop_num_of_clauses: 10262 7.82/1.47 prop_preprocess_simplified: 19462 7.82/1.47 prop_fo_subsumed: 3 7.82/1.47 prop_solver_time: 0. 7.82/1.47 smt_solver_time: 0. 7.82/1.47 smt_fast_solver_time: 0. 7.82/1.47 prop_fast_solver_time: 0. 7.82/1.47 prop_unsat_core_time: 0.001 7.82/1.47 7.82/1.47 ------ QBF 7.82/1.47 7.82/1.47 qbf_q_res: 0 7.82/1.47 qbf_num_tautologies: 0 7.82/1.47 qbf_prep_cycles: 0 7.82/1.47 7.82/1.47 ------ BMC1 7.82/1.47 7.82/1.47 bmc1_current_bound: -1 7.82/1.47 bmc1_last_solved_bound: -1 7.82/1.47 bmc1_unsat_core_size: -1 7.82/1.47 bmc1_unsat_core_parents_size: -1 7.82/1.47 bmc1_merge_next_fun: 0 7.82/1.47 bmc1_unsat_core_clauses_time: 0. 7.82/1.47 7.82/1.47 ------ Instantiation 7.82/1.47 7.82/1.47 inst_num_of_clauses: 2468 7.82/1.47 inst_num_in_passive: 737 7.82/1.47 inst_num_in_active: 736 7.82/1.47 inst_num_in_unprocessed: 995 7.82/1.47 inst_num_of_loops: 820 7.82/1.47 inst_num_of_learning_restarts: 0 7.82/1.47 inst_num_moves_active_passive: 83 7.82/1.47 inst_lit_activity: 0 7.82/1.47 inst_lit_activity_moves: 0 7.82/1.47 inst_num_tautologies: 0 7.82/1.47 inst_num_prop_implied: 0 7.82/1.47 inst_num_existing_simplified: 0 7.82/1.47 inst_num_eq_res_simplified: 0 7.82/1.47 inst_num_child_elim: 0 7.82/1.47 inst_num_of_dismatching_blockings: 432 7.82/1.47 inst_num_of_non_proper_insts: 1751 7.82/1.47 inst_num_of_duplicates: 0 7.82/1.47 inst_inst_num_from_inst_to_res: 0 7.82/1.47 inst_dismatching_checking_time: 0. 7.82/1.47 7.82/1.47 ------ Resolution 7.82/1.47 7.82/1.47 res_num_of_clauses: 0 7.82/1.47 res_num_in_passive: 0 7.82/1.47 res_num_in_active: 0 7.82/1.47 res_num_of_loops: 153 7.82/1.47 res_forward_subset_subsumed: 53 7.82/1.47 res_backward_subset_subsumed: 0 7.82/1.47 res_forward_subsumed: 0 7.82/1.47 res_backward_subsumed: 0 7.82/1.47 res_forward_subsumption_resolution: 0 7.82/1.47 res_backward_subsumption_resolution: 0 7.82/1.47 res_clause_to_clause_subsumption: 4742 7.82/1.47 res_orphan_elimination: 0 7.82/1.47 res_tautology_del: 103 7.82/1.47 res_num_eq_res_simplified: 0 7.82/1.47 res_num_sel_changes: 0 7.82/1.47 res_moves_from_active_to_pass: 0 7.82/1.47 7.82/1.47 ------ Superposition 7.82/1.47 7.82/1.47 sup_time_total: 0. 7.82/1.47 sup_time_generating: 0. 7.82/1.47 sup_time_sim_full: 0. 7.82/1.47 sup_time_sim_immed: 0. 7.82/1.47 7.82/1.47 sup_num_of_clauses: 860 7.82/1.47 sup_num_in_active: 150 7.82/1.47 sup_num_in_passive: 710 7.82/1.47 sup_num_of_loops: 162 7.82/1.47 sup_fw_superposition: 875 7.82/1.47 sup_bw_superposition: 1028 7.82/1.47 sup_immediate_simplified: 682 7.82/1.47 sup_given_eliminated: 3 7.82/1.47 comparisons_done: 0 7.82/1.47 comparisons_avoided: 144 7.82/1.47 7.82/1.47 ------ Simplifications 7.82/1.47 7.82/1.47 7.82/1.47 sim_fw_subset_subsumed: 218 7.82/1.47 sim_bw_subset_subsumed: 14 7.82/1.47 sim_fw_subsumed: 228 7.82/1.47 sim_bw_subsumed: 3 7.82/1.47 sim_fw_subsumption_res: 4 7.82/1.47 sim_bw_subsumption_res: 0 7.82/1.47 sim_tautology_del: 0 7.82/1.47 sim_eq_tautology_del: 77 7.82/1.47 sim_eq_res_simp: 0 7.82/1.47 sim_fw_demodulated: 157 7.82/1.47 sim_bw_demodulated: 18 7.82/1.47 sim_light_normalised: 167 7.82/1.47 sim_joinable_taut: 0 7.82/1.47 sim_joinable_simp: 0 7.82/1.47 sim_ac_normalised: 0 7.82/1.47 sim_smt_subsumption: 0 7.82/1.47 7.82/1.48 EOF