0.06/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.10 % Command : iproveropt_run.sh %d %s 0.10/0.31 % Computer : n020.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 960 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Thu Jul 2 08:38:47 EDT 2020 0.10/0.31 % CPUTime : 0.10/0.31 % Running in FOF mode 35.34/4.95 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p 35.34/4.95 35.34/4.95 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 35.34/4.95 35.34/4.95 ------ iProver source info 35.34/4.95 35.34/4.95 git: date: 2020-06-30 10:37:57 +0100 35.34/4.95 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 35.34/4.95 git: non_committed_changes: false 35.34/4.95 git: last_make_outside_of_git: false 35.34/4.95 35.34/4.95 ------ 35.34/4.95 35.34/4.95 ------ Input Options 35.34/4.95 35.34/4.95 --out_options all 35.34/4.95 --tptp_safe_out true 35.34/4.95 --problem_path "" 35.34/4.95 --include_path "" 35.34/4.95 --clausifier res/vclausify_rel 35.34/4.95 --clausifier_options "" 35.34/4.95 --stdin false 35.34/4.95 --stats_out all 35.34/4.95 35.34/4.95 ------ General Options 35.34/4.95 35.34/4.95 --fof false 35.34/4.95 --time_out_real 125. 35.34/4.95 --time_out_virtual -1. 35.34/4.95 --symbol_type_check false 35.34/4.95 --clausify_out false 35.34/4.95 --sig_cnt_out false 35.34/4.95 --trig_cnt_out false 35.34/4.95 --trig_cnt_out_tolerance 1. 35.34/4.95 --trig_cnt_out_sk_spl false 35.34/4.95 --abstr_cl_out false 35.34/4.95 35.34/4.95 ------ Global Options 35.34/4.95 35.34/4.95 --schedule default 35.34/4.95 --add_important_lit false 35.34/4.95 --prop_solver_per_cl 1000 35.34/4.95 --min_unsat_core false 35.34/4.95 --soft_assumptions false 35.34/4.95 --soft_lemma_size 3 35.34/4.95 --prop_impl_unit_size 0 35.34/4.95 --prop_impl_unit [] 35.34/4.95 --share_sel_clauses true 35.34/4.95 --reset_solvers false 35.34/4.95 --bc_imp_inh [conj_cone] 35.34/4.95 --conj_cone_tolerance 3. 35.34/4.95 --extra_neg_conj none 35.34/4.95 --large_theory_mode true 35.34/4.95 --prolific_symb_bound 200 35.34/4.95 --lt_threshold 2000 35.34/4.95 --clause_weak_htbl true 35.34/4.95 --gc_record_bc_elim false 35.34/4.95 35.34/4.95 ------ Preprocessing Options 35.34/4.95 35.34/4.95 --preprocessing_flag true 35.34/4.95 --time_out_prep_mult 0.1 35.34/4.95 --splitting_mode input 35.34/4.95 --splitting_grd true 35.34/4.95 --splitting_cvd false 35.34/4.95 --splitting_cvd_svl false 35.34/4.95 --splitting_nvd 32 35.34/4.95 --sub_typing true 35.34/4.95 --prep_gs_sim true 35.34/4.95 --prep_unflatten true 35.34/4.95 --prep_res_sim true 35.34/4.95 --prep_upred true 35.34/4.95 --prep_sem_filter exhaustive 35.34/4.95 --prep_sem_filter_out false 35.34/4.95 --pred_elim true 35.34/4.95 --res_sim_input true 35.34/4.95 --eq_ax_congr_red true 35.34/4.95 --pure_diseq_elim true 35.34/4.95 --brand_transform false 35.34/4.95 --non_eq_to_eq false 35.34/4.95 --prep_def_merge true 35.34/4.95 --prep_def_merge_prop_impl false 35.34/4.95 --prep_def_merge_mbd true 35.34/4.95 --prep_def_merge_tr_red false 35.34/4.95 --prep_def_merge_tr_cl false 35.34/4.95 --smt_preprocessing true 35.34/4.95 --smt_ac_axioms fast 35.34/4.95 --preprocessed_out false 35.34/4.95 --preprocessed_stats false 35.34/4.95 35.34/4.95 ------ Abstraction refinement Options 35.34/4.95 35.34/4.95 --abstr_ref [] 35.34/4.95 --abstr_ref_prep false 35.34/4.95 --abstr_ref_until_sat false 35.34/4.95 --abstr_ref_sig_restrict funpre 35.34/4.95 --abstr_ref_af_restrict_to_split_sk false 35.34/4.95 --abstr_ref_under [] 35.34/4.95 35.34/4.95 ------ SAT Options 35.34/4.95 35.34/4.95 --sat_mode false 35.34/4.95 --sat_fm_restart_options "" 35.34/4.95 --sat_gr_def false 35.34/4.95 --sat_epr_types true 35.34/4.95 --sat_non_cyclic_types false 35.34/4.95 --sat_finite_models false 35.34/4.95 --sat_fm_lemmas false 35.34/4.95 --sat_fm_prep false 35.34/4.95 --sat_fm_uc_incr true 35.34/4.95 --sat_out_model small 35.34/4.95 --sat_out_clauses false 35.34/4.95 35.34/4.95 ------ QBF Options 35.34/4.95 35.34/4.95 --qbf_mode false 35.34/4.95 --qbf_elim_univ false 35.34/4.95 --qbf_dom_inst none 35.34/4.95 --qbf_dom_pre_inst false 35.34/4.95 --qbf_sk_in false 35.34/4.95 --qbf_pred_elim true 35.34/4.95 --qbf_split 512 35.34/4.95 35.34/4.95 ------ BMC1 Options 35.34/4.95 35.34/4.95 --bmc1_incremental false 35.34/4.95 --bmc1_axioms reachable_all 35.34/4.95 --bmc1_min_bound 0 35.34/4.95 --bmc1_max_bound -1 35.34/4.95 --bmc1_max_bound_default -1 35.34/4.95 --bmc1_symbol_reachability true 35.34/4.95 --bmc1_property_lemmas false 35.34/4.95 --bmc1_k_induction false 35.34/4.95 --bmc1_non_equiv_states false 35.34/4.95 --bmc1_deadlock false 35.34/4.95 --bmc1_ucm false 35.34/4.95 --bmc1_add_unsat_core none 35.34/4.95 --bmc1_unsat_core_children false 35.34/4.95 --bmc1_unsat_core_extrapolate_axioms false 35.34/4.95 --bmc1_out_stat full 35.34/4.95 --bmc1_ground_init false 35.34/4.95 --bmc1_pre_inst_next_state false 35.34/4.95 --bmc1_pre_inst_state false 35.34/4.95 --bmc1_pre_inst_reach_state false 35.34/4.95 --bmc1_out_unsat_core false 35.34/4.95 --bmc1_aig_witness_out false 35.34/4.95 --bmc1_verbose false 35.34/4.95 --bmc1_dump_clauses_tptp false 35.34/4.95 --bmc1_dump_unsat_core_tptp false 35.34/4.95 --bmc1_dump_file - 35.34/4.95 --bmc1_ucm_expand_uc_limit 128 35.34/4.95 --bmc1_ucm_n_expand_iterations 6 35.34/4.95 --bmc1_ucm_extend_mode 1 35.34/4.95 --bmc1_ucm_init_mode 2 35.34/4.95 --bmc1_ucm_cone_mode none 35.34/4.95 --bmc1_ucm_reduced_relation_type 0 35.34/4.95 --bmc1_ucm_relax_model 4 35.34/4.95 --bmc1_ucm_full_tr_after_sat true 35.34/4.95 --bmc1_ucm_expand_neg_assumptions false 35.34/4.95 --bmc1_ucm_layered_model none 35.34/4.95 --bmc1_ucm_max_lemma_size 10 35.34/4.95 35.34/4.95 ------ AIG Options 35.34/4.95 35.34/4.95 --aig_mode false 35.34/4.95 35.34/4.95 ------ Instantiation Options 35.34/4.95 35.34/4.95 --instantiation_flag true 35.34/4.95 --inst_sos_flag true 35.34/4.95 --inst_sos_phase true 35.34/4.95 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 35.34/4.95 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 35.34/4.95 --inst_lit_sel_side num_symb 35.34/4.95 --inst_solver_per_active 1400 35.34/4.95 --inst_solver_calls_frac 1. 35.34/4.95 --inst_passive_queue_type priority_queues 35.34/4.95 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 35.34/4.95 --inst_passive_queues_freq [25;2] 35.34/4.95 --inst_dismatching true 35.34/4.95 --inst_eager_unprocessed_to_passive true 35.34/4.95 --inst_prop_sim_given true 35.34/4.95 --inst_prop_sim_new false 35.34/4.95 --inst_subs_new false 35.34/4.95 --inst_eq_res_simp false 35.34/4.95 --inst_subs_given false 35.34/4.95 --inst_orphan_elimination true 35.34/4.95 --inst_learning_loop_flag true 35.34/4.95 --inst_learning_start 3000 35.34/4.95 --inst_learning_factor 2 35.34/4.95 --inst_start_prop_sim_after_learn 3 35.34/4.95 --inst_sel_renew solver 35.34/4.95 --inst_lit_activity_flag true 35.34/4.95 --inst_restr_to_given false 35.34/4.95 --inst_activity_threshold 500 35.34/4.95 --inst_out_proof true 35.34/4.95 35.34/4.95 ------ Resolution Options 35.34/4.95 35.34/4.95 --resolution_flag true 35.34/4.95 --res_lit_sel adaptive 35.34/4.95 --res_lit_sel_side none 35.34/4.95 --res_ordering kbo 35.34/4.95 --res_to_prop_solver active 35.34/4.95 --res_prop_simpl_new false 35.34/4.95 --res_prop_simpl_given true 35.34/4.95 --res_passive_queue_type priority_queues 35.34/4.95 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 35.34/4.95 --res_passive_queues_freq [15;5] 35.34/4.95 --res_forward_subs full 35.34/4.95 --res_backward_subs full 35.34/4.95 --res_forward_subs_resolution true 35.34/4.95 --res_backward_subs_resolution true 35.34/4.95 --res_orphan_elimination true 35.34/4.95 --res_time_limit 2. 35.34/4.95 --res_out_proof true 35.34/4.95 35.34/4.95 ------ Superposition Options 35.34/4.95 35.34/4.95 --superposition_flag true 35.34/4.95 --sup_passive_queue_type priority_queues 35.34/4.95 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 35.34/4.95 --sup_passive_queues_freq [8;1;4] 35.34/4.95 --demod_completeness_check fast 35.34/4.95 --demod_use_ground true 35.34/4.95 --sup_to_prop_solver passive 35.34/4.95 --sup_prop_simpl_new true 35.34/4.95 --sup_prop_simpl_given true 35.34/4.95 --sup_fun_splitting true 35.34/4.95 --sup_smt_interval 50000 35.34/4.95 35.34/4.95 ------ Superposition Simplification Setup 35.34/4.95 35.34/4.95 --sup_indices_passive [LightNormIndex;FwDemodIndex] 35.34/4.95 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 35.34/4.95 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 35.34/4.95 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 35.34/4.95 --sup_full_triv [TrivRules;PropSubs] 35.34/4.95 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 35.34/4.95 --sup_full_bw [BwDemod;BwSubsumption] 35.34/4.95 --sup_immed_triv [TrivRules] 35.34/4.95 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 35.34/4.95 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 35.34/4.95 --sup_immed_bw_main [] 35.34/4.95 --sup_immed_bw_immed [BwDemod;BwSubsumption] 35.34/4.95 --sup_input_triv [Unflattening;TrivRules] 35.34/4.95 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 35.34/4.95 --sup_input_bw [] 35.34/4.95 35.34/4.95 ------ Combination Options 35.34/4.95 35.34/4.95 --comb_res_mult 3 35.34/4.95 --comb_sup_mult 2 35.34/4.95 --comb_inst_mult 10 35.34/4.95 35.34/4.95 ------ Debug Options 35.34/4.95 35.34/4.95 --dbg_backtrace false 35.34/4.95 --dbg_dump_prop_clauses false 35.34/4.95 --dbg_dump_prop_clauses_file - 35.34/4.95 --dbg_out_stat false 35.34/4.95 ------ Parsing... 35.34/4.95 ------ Clausification by vclausify_rel & Parsing by iProver... 35.34/4.95 35.34/4.95 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e 35.34/4.95 35.34/4.95 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 35.34/4.95 35.34/4.95 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 35.34/4.95 ------ Proving... 35.34/4.95 ------ Problem Properties 35.34/4.95 35.34/4.95 35.34/4.95 clauses 45 35.34/4.95 conjectures 4 35.34/4.95 EPR 17 35.34/4.95 Horn 29 35.34/4.95 unary 5 35.34/4.95 binary 16 35.34/4.95 lits 133 35.34/4.95 lits eq 12 35.34/4.95 fd_pure 0 35.34/4.95 fd_pseudo 0 35.34/4.95 fd_cond 0 35.34/4.95 fd_pseudo_cond 7 35.34/4.95 AC symbols 0 35.34/4.95 35.34/4.95 ------ Schedule dynamic 5 is on 35.34/4.95 35.34/4.95 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 35.34/4.95 35.34/4.95 35.34/4.95 ------ 35.34/4.95 Current options: 35.34/4.95 ------ 35.34/4.95 35.34/4.95 ------ Input Options 35.34/4.95 35.34/4.95 --out_options all 35.34/4.95 --tptp_safe_out true 35.34/4.95 --problem_path "" 35.34/4.95 --include_path "" 35.34/4.95 --clausifier res/vclausify_rel 35.34/4.95 --clausifier_options "" 35.34/4.95 --stdin false 35.34/4.95 --stats_out all 35.34/4.95 35.34/4.95 ------ General Options 35.34/4.95 35.34/4.95 --fof false 35.34/4.95 --time_out_real 125. 35.34/4.95 --time_out_virtual -1. 35.34/4.95 --symbol_type_check false 35.34/4.95 --clausify_out false 35.34/4.95 --sig_cnt_out false 35.34/4.95 --trig_cnt_out false 35.34/4.95 --trig_cnt_out_tolerance 1. 35.34/4.95 --trig_cnt_out_sk_spl false 35.34/4.95 --abstr_cl_out false 35.34/4.95 35.34/4.95 ------ Global Options 35.34/4.95 35.34/4.95 --schedule default 35.34/4.95 --add_important_lit false 35.34/4.95 --prop_solver_per_cl 1000 35.34/4.95 --min_unsat_core false 35.34/4.95 --soft_assumptions false 35.34/4.95 --soft_lemma_size 3 35.34/4.95 --prop_impl_unit_size 0 35.34/4.95 --prop_impl_unit [] 35.34/4.95 --share_sel_clauses true 35.34/4.95 --reset_solvers false 35.34/4.95 --bc_imp_inh [conj_cone] 35.34/4.95 --conj_cone_tolerance 3. 35.34/4.95 --extra_neg_conj none 35.34/4.95 --large_theory_mode true 35.34/4.95 --prolific_symb_bound 200 35.34/4.95 --lt_threshold 2000 35.34/4.95 --clause_weak_htbl true 35.34/4.95 --gc_record_bc_elim false 35.34/4.95 35.34/4.95 ------ Preprocessing Options 35.34/4.95 35.34/4.95 --preprocessing_flag true 35.34/4.95 --time_out_prep_mult 0.1 35.34/4.95 --splitting_mode input 35.34/4.95 --splitting_grd true 35.34/4.95 --splitting_cvd false 35.34/4.95 --splitting_cvd_svl false 35.34/4.95 --splitting_nvd 32 35.34/4.95 --sub_typing true 35.34/4.95 --prep_gs_sim true 35.34/4.95 --prep_unflatten true 35.34/4.95 --prep_res_sim true 35.34/4.95 --prep_upred true 35.34/4.95 --prep_sem_filter exhaustive 35.34/4.95 --prep_sem_filter_out false 35.34/4.95 --pred_elim true 35.34/4.95 --res_sim_input true 35.34/4.95 --eq_ax_congr_red true 35.34/4.95 --pure_diseq_elim true 35.34/4.95 --brand_transform false 35.34/4.95 --non_eq_to_eq false 35.34/4.95 --prep_def_merge true 35.34/4.95 --prep_def_merge_prop_impl false 35.34/4.95 --prep_def_merge_mbd true 35.34/4.95 --prep_def_merge_tr_red false 35.34/4.95 --prep_def_merge_tr_cl false 35.34/4.95 --smt_preprocessing true 35.34/4.95 --smt_ac_axioms fast 35.34/4.95 --preprocessed_out false 35.34/4.95 --preprocessed_stats false 35.34/4.95 35.34/4.95 ------ Abstraction refinement Options 35.34/4.95 35.34/4.95 --abstr_ref [] 35.34/4.95 --abstr_ref_prep false 35.34/4.95 --abstr_ref_until_sat false 35.34/4.95 --abstr_ref_sig_restrict funpre 35.34/4.95 --abstr_ref_af_restrict_to_split_sk false 35.34/4.95 --abstr_ref_under [] 35.34/4.95 35.34/4.95 ------ SAT Options 35.34/4.95 35.34/4.95 --sat_mode false 35.34/4.95 --sat_fm_restart_options "" 35.34/4.95 --sat_gr_def false 35.34/4.95 --sat_epr_types true 35.34/4.95 --sat_non_cyclic_types false 35.34/4.95 --sat_finite_models false 35.34/4.95 --sat_fm_lemmas false 35.34/4.95 --sat_fm_prep false 35.34/4.95 --sat_fm_uc_incr true 35.34/4.95 --sat_out_model small 35.34/4.95 --sat_out_clauses false 35.34/4.95 35.34/4.95 ------ QBF Options 35.34/4.95 35.34/4.95 --qbf_mode false 35.34/4.95 --qbf_elim_univ false 35.34/4.95 --qbf_dom_inst none 35.34/4.95 --qbf_dom_pre_inst false 35.34/4.95 --qbf_sk_in false 35.34/4.95 --qbf_pred_elim true 35.34/4.95 --qbf_split 512 35.34/4.95 35.34/4.95 ------ BMC1 Options 35.34/4.95 35.34/4.95 --bmc1_incremental false 35.34/4.95 --bmc1_axioms reachable_all 35.34/4.95 --bmc1_min_bound 0 35.34/4.95 --bmc1_max_bound -1 35.34/4.95 --bmc1_max_bound_default -1 35.34/4.95 --bmc1_symbol_reachability true 35.34/4.95 --bmc1_property_lemmas false 35.34/4.95 --bmc1_k_induction false 35.34/4.95 --bmc1_non_equiv_states false 35.34/4.95 --bmc1_deadlock false 35.34/4.95 --bmc1_ucm false 35.34/4.95 --bmc1_add_unsat_core none 35.34/4.95 --bmc1_unsat_core_children false 35.34/4.95 --bmc1_unsat_core_extrapolate_axioms false 35.34/4.95 --bmc1_out_stat full 35.34/4.95 --bmc1_ground_init false 35.34/4.95 --bmc1_pre_inst_next_state false 35.34/4.95 --bmc1_pre_inst_state false 35.34/4.95 --bmc1_pre_inst_reach_state false 35.34/4.95 --bmc1_out_unsat_core false 35.34/4.95 --bmc1_aig_witness_out false 35.34/4.95 --bmc1_verbose false 35.34/4.95 --bmc1_dump_clauses_tptp false 35.34/4.95 --bmc1_dump_unsat_core_tptp false 35.34/4.95 --bmc1_dump_file - 35.34/4.95 --bmc1_ucm_expand_uc_limit 128 35.34/4.95 --bmc1_ucm_n_expand_iterations 6 35.34/4.95 --bmc1_ucm_extend_mode 1 35.34/4.95 --bmc1_ucm_init_mode 2 35.34/4.95 --bmc1_ucm_cone_mode none 35.34/4.95 --bmc1_ucm_reduced_relation_type 0 35.34/4.95 --bmc1_ucm_relax_model 4 35.34/4.95 --bmc1_ucm_full_tr_after_sat true 35.34/4.95 --bmc1_ucm_expand_neg_assumptions false 35.34/4.95 --bmc1_ucm_layered_model none 35.34/4.95 --bmc1_ucm_max_lemma_size 10 35.34/4.95 35.34/4.95 ------ AIG Options 35.34/4.95 35.34/4.95 --aig_mode false 35.34/4.95 35.34/4.95 ------ Instantiation Options 35.34/4.95 35.34/4.95 --instantiation_flag true 35.34/4.95 --inst_sos_flag true 35.34/4.95 --inst_sos_phase true 35.34/4.95 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 35.34/4.95 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 35.34/4.95 --inst_lit_sel_side none 35.34/4.95 --inst_solver_per_active 1400 35.34/4.95 --inst_solver_calls_frac 1. 35.34/4.95 --inst_passive_queue_type priority_queues 35.34/4.95 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 35.34/4.95 --inst_passive_queues_freq [25;2] 35.34/4.95 --inst_dismatching true 35.34/4.95 --inst_eager_unprocessed_to_passive true 35.34/4.95 --inst_prop_sim_given true 35.34/4.95 --inst_prop_sim_new false 35.34/4.95 --inst_subs_new false 35.34/4.95 --inst_eq_res_simp false 35.34/4.95 --inst_subs_given false 35.34/4.95 --inst_orphan_elimination true 35.34/4.95 --inst_learning_loop_flag true 35.34/4.95 --inst_learning_start 3000 35.34/4.95 --inst_learning_factor 2 35.34/4.95 --inst_start_prop_sim_after_learn 3 35.34/4.95 --inst_sel_renew solver 35.34/4.95 --inst_lit_activity_flag true 35.34/4.95 --inst_restr_to_given false 35.34/4.95 --inst_activity_threshold 500 35.34/4.95 --inst_out_proof true 35.34/4.95 35.34/4.95 ------ Resolution Options 35.34/4.95 35.34/4.95 --resolution_flag false 35.34/4.95 --res_lit_sel adaptive 35.34/4.95 --res_lit_sel_side none 35.34/4.95 --res_ordering kbo 35.34/4.95 --res_to_prop_solver active 35.34/4.95 --res_prop_simpl_new false 35.34/4.95 --res_prop_simpl_given true 35.34/4.95 --res_passive_queue_type priority_queues 35.34/4.95 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 35.34/4.95 --res_passive_queues_freq [15;5] 35.34/4.95 --res_forward_subs full 35.34/4.95 --res_backward_subs full 35.34/4.95 --res_forward_subs_resolution true 35.34/4.95 --res_backward_subs_resolution true 35.34/4.95 --res_orphan_elimination true 35.34/4.95 --res_time_limit 2. 35.34/4.95 --res_out_proof true 35.34/4.95 35.34/4.95 ------ Superposition Options 35.34/4.95 35.34/4.95 --superposition_flag true 35.34/4.95 --sup_passive_queue_type priority_queues 35.34/4.95 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 35.34/4.95 --sup_passive_queues_freq [8;1;4] 35.34/4.95 --demod_completeness_check fast 35.34/4.95 --demod_use_ground true 35.34/4.95 --sup_to_prop_solver passive 35.34/4.95 --sup_prop_simpl_new true 35.34/4.95 --sup_prop_simpl_given true 35.34/4.95 --sup_fun_splitting true 35.34/4.95 --sup_smt_interval 50000 35.34/4.95 35.34/4.95 ------ Superposition Simplification Setup 35.34/4.95 35.34/4.95 --sup_indices_passive [LightNormIndex;FwDemodIndex] 35.34/4.95 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 35.34/4.95 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 35.34/4.95 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 35.34/4.95 --sup_full_triv [TrivRules;PropSubs] 35.34/4.95 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 35.34/4.95 --sup_full_bw [BwDemod;BwSubsumption] 35.34/4.95 --sup_immed_triv [TrivRules] 35.34/4.95 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 35.34/4.95 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 35.34/4.95 --sup_immed_bw_main [] 35.34/4.95 --sup_immed_bw_immed [BwDemod;BwSubsumption] 35.34/4.95 --sup_input_triv [Unflattening;TrivRules] 35.34/4.95 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 35.34/4.95 --sup_input_bw [] 35.34/4.95 35.34/4.95 ------ Combination Options 35.34/4.95 35.34/4.95 --comb_res_mult 3 35.34/4.95 --comb_sup_mult 2 35.34/4.95 --comb_inst_mult 10 35.34/4.95 35.34/4.95 ------ Debug Options 35.34/4.95 35.34/4.95 --dbg_backtrace false 35.34/4.95 --dbg_dump_prop_clauses false 35.34/4.95 --dbg_dump_prop_clauses_file - 35.34/4.95 --dbg_out_stat false 35.34/4.95 35.34/4.95 35.34/4.95 35.34/4.95 35.34/4.95 ------ Proving... 35.34/4.95 35.34/4.95 35.34/4.95 % SZS status Theorem for theBenchmark.p 35.34/4.95 35.34/4.95 % SZS output start CNFRefutation for theBenchmark.p 35.34/4.95 35.34/4.95 fof(f12,axiom,( 35.34/4.95 ! [X0,X1] : (! [X2] : (incident_c(X2,X1) => incident_c(X2,X0)) <=> part_of(X1,X0))), 35.34/4.95 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 35.34/4.95 35.34/4.95 fof(f52,plain,( 35.34/4.95 ! [X0,X1] : (! [X2] : (incident_c(X2,X0) | ~incident_c(X2,X1)) <=> part_of(X1,X0))), 35.34/4.95 inference(ennf_transformation,[],[f12])). 35.34/4.95 35.34/4.95 fof(f78,plain,( 35.34/4.95 ! [X0,X1] : ((! [X2] : (incident_c(X2,X0) | ~incident_c(X2,X1)) | ~part_of(X1,X0)) & (part_of(X1,X0) | ? [X2] : (~incident_c(X2,X0) & incident_c(X2,X1))))), 35.34/4.95 inference(nnf_transformation,[],[f52])). 35.34/4.95 35.34/4.95 fof(f79,plain,( 35.34/4.95 ! [X0,X1] : ((! [X2] : (incident_c(X2,X0) | ~incident_c(X2,X1)) | ~part_of(X1,X0)) & (part_of(X1,X0) | ? [X3] : (~incident_c(X3,X0) & incident_c(X3,X1))))), 35.34/4.95 inference(rectify,[],[f78])). 35.34/4.95 35.34/4.95 fof(f80,plain,( 35.34/4.95 ! [X1,X0] : (? [X3] : (~incident_c(X3,X0) & incident_c(X3,X1)) => (~incident_c(sK9(X0,X1),X0) & incident_c(sK9(X0,X1),X1)))), 35.34/4.95 introduced(choice_axiom,[])). 35.34/4.95 35.34/4.95 fof(f81,plain,( 35.34/4.95 ! [X0,X1] : ((! [X2] : (incident_c(X2,X0) | ~incident_c(X2,X1)) | ~part_of(X1,X0)) & (part_of(X1,X0) | (~incident_c(sK9(X0,X1),X0) & incident_c(sK9(X0,X1),X1))))), 35.34/4.95 inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f79,f80])). 35.34/4.95 35.34/4.95 fof(f124,plain,( 35.34/4.95 ( ! [X2,X0,X1] : (incident_c(X2,X0) | ~incident_c(X2,X1) | ~part_of(X1,X0)) )), 35.34/4.95 inference(cnf_transformation,[],[f81])). 35.34/4.95 35.34/4.95 fof(f123,plain,( 35.34/4.95 ( ! [X0,X1] : (part_of(X1,X0) | ~incident_c(sK9(X0,X1),X0)) )), 35.34/4.95 inference(cnf_transformation,[],[f81])). 35.34/4.95 35.34/4.95 fof(f122,plain,( 35.34/4.95 ( ! [X0,X1] : (part_of(X1,X0) | incident_c(sK9(X0,X1),X1)) )), 35.34/4.95 inference(cnf_transformation,[],[f81])). 35.34/4.95 35.34/4.95 fof(f5,axiom,( 35.34/4.95 ! [X2,X0] : ((incident_c(X2,X0) & ! [X1,X4] : ((incident_c(X2,X1) & part_of(X4,X0) & incident_c(X2,X4) & part_of(X1,X0)) => (part_of(X1,X4) | part_of(X4,X1)))) <=> end_point(X2,X0))), 35.34/4.95 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 35.34/4.95 35.34/4.95 fof(f22,plain,( 35.34/4.95 ! [X0,X1] : ((incident_c(X0,X1) & ! [X2,X3] : ((incident_c(X0,X2) & part_of(X3,X1) & incident_c(X0,X3) & part_of(X2,X1)) => (part_of(X2,X3) | part_of(X3,X2)))) <=> end_point(X0,X1))), 35.34/4.95 inference(rectify,[],[f5])). 35.34/4.95 35.34/4.95 fof(f40,plain,( 35.34/4.95 ! [X0,X1] : ((incident_c(X0,X1) & ! [X2,X3] : ((part_of(X2,X3) | part_of(X3,X2)) | (~incident_c(X0,X2) | ~part_of(X3,X1) | ~incident_c(X0,X3) | ~part_of(X2,X1)))) <=> end_point(X0,X1))), 35.34/4.95 inference(ennf_transformation,[],[f22])). 35.34/4.95 35.34/4.95 fof(f41,plain,( 35.34/4.95 ! [X0,X1] : ((incident_c(X0,X1) & ! [X2,X3] : (part_of(X2,X3) | part_of(X3,X2) | ~incident_c(X0,X2) | ~part_of(X3,X1) | ~incident_c(X0,X3) | ~part_of(X2,X1))) <=> end_point(X0,X1))), 35.34/4.95 inference(flattening,[],[f40])). 35.34/4.95 35.34/4.95 fof(f69,plain,( 35.34/4.95 ! [X0,X1] : (((incident_c(X0,X1) & ! [X2,X3] : (part_of(X2,X3) | part_of(X3,X2) | ~incident_c(X0,X2) | ~part_of(X3,X1) | ~incident_c(X0,X3) | ~part_of(X2,X1))) | ~end_point(X0,X1)) & (end_point(X0,X1) | (~incident_c(X0,X1) | ? [X2,X3] : (~part_of(X2,X3) & ~part_of(X3,X2) & incident_c(X0,X2) & part_of(X3,X1) & incident_c(X0,X3) & part_of(X2,X1)))))), 35.34/4.95 inference(nnf_transformation,[],[f41])). 35.34/4.95 35.34/4.95 fof(f70,plain,( 35.34/4.95 ! [X0,X1] : (((incident_c(X0,X1) & ! [X2,X3] : (part_of(X2,X3) | part_of(X3,X2) | ~incident_c(X0,X2) | ~part_of(X3,X1) | ~incident_c(X0,X3) | ~part_of(X2,X1))) | ~end_point(X0,X1)) & (end_point(X0,X1) | ~incident_c(X0,X1) | ? [X2,X3] : (~part_of(X2,X3) & ~part_of(X3,X2) & incident_c(X0,X2) & part_of(X3,X1) & incident_c(X0,X3) & part_of(X2,X1))))), 35.34/4.95 inference(flattening,[],[f69])). 35.34/4.95 35.34/4.95 fof(f71,plain,( 35.34/4.95 ! [X0,X1] : (((incident_c(X0,X1) & ! [X2,X3] : (part_of(X2,X3) | part_of(X3,X2) | ~incident_c(X0,X2) | ~part_of(X3,X1) | ~incident_c(X0,X3) | ~part_of(X2,X1))) | ~end_point(X0,X1)) & (end_point(X0,X1) | ~incident_c(X0,X1) | ? [X4,X5] : (~part_of(X4,X5) & ~part_of(X5,X4) & incident_c(X0,X4) & part_of(X5,X1) & incident_c(X0,X5) & part_of(X4,X1))))), 35.34/4.95 inference(rectify,[],[f70])). 35.34/4.95 35.34/4.95 fof(f72,plain,( 35.34/4.95 ! [X1,X0] : (? [X4,X5] : (~part_of(X4,X5) & ~part_of(X5,X4) & incident_c(X0,X4) & part_of(X5,X1) & incident_c(X0,X5) & part_of(X4,X1)) => (~part_of(sK5(X0,X1),sK6(X0,X1)) & ~part_of(sK6(X0,X1),sK5(X0,X1)) & incident_c(X0,sK5(X0,X1)) & part_of(sK6(X0,X1),X1) & incident_c(X0,sK6(X0,X1)) & part_of(sK5(X0,X1),X1)))), 35.34/4.95 introduced(choice_axiom,[])). 35.34/4.95 35.34/4.95 fof(f73,plain,( 35.34/4.95 ! [X0,X1] : (((incident_c(X0,X1) & ! [X2,X3] : (part_of(X2,X3) | part_of(X3,X2) | ~incident_c(X0,X2) | ~part_of(X3,X1) | ~incident_c(X0,X3) | ~part_of(X2,X1))) | ~end_point(X0,X1)) & (end_point(X0,X1) | ~incident_c(X0,X1) | (~part_of(sK5(X0,X1),sK6(X0,X1)) & ~part_of(sK6(X0,X1),sK5(X0,X1)) & incident_c(X0,sK5(X0,X1)) & part_of(sK6(X0,X1),X1) & incident_c(X0,sK6(X0,X1)) & part_of(sK5(X0,X1),X1))))), 35.34/4.95 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f71,f72])). 35.34/4.95 35.34/4.95 fof(f113,plain,( 35.34/4.95 ( ! [X2,X0,X3,X1] : (part_of(X2,X3) | part_of(X3,X2) | ~incident_c(X0,X2) | ~part_of(X3,X1) | ~incident_c(X0,X3) | ~part_of(X2,X1) | ~end_point(X0,X1)) )), 35.34/4.95 inference(cnf_transformation,[],[f73])). 35.34/4.95 35.34/4.95 fof(f112,plain,( 35.34/4.95 ( ! [X0,X1] : (end_point(X0,X1) | ~incident_c(X0,X1) | ~part_of(sK5(X0,X1),sK6(X0,X1))) )), 35.34/4.95 inference(cnf_transformation,[],[f73])). 35.34/4.95 35.34/4.95 fof(f111,plain,( 35.34/4.95 ( ! [X0,X1] : (end_point(X0,X1) | ~incident_c(X0,X1) | ~part_of(sK6(X0,X1),sK5(X0,X1))) )), 35.34/4.95 inference(cnf_transformation,[],[f73])). 35.34/4.95 35.34/4.95 fof(f110,plain,( 35.34/4.95 ( ! [X0,X1] : (end_point(X0,X1) | ~incident_c(X0,X1) | incident_c(X0,sK5(X0,X1))) )), 35.34/4.95 inference(cnf_transformation,[],[f73])). 35.34/4.95 35.34/4.95 fof(f109,plain,( 35.34/4.95 ( ! [X0,X1] : (end_point(X0,X1) | ~incident_c(X0,X1) | part_of(sK6(X0,X1),X1)) )), 35.34/4.95 inference(cnf_transformation,[],[f73])). 35.34/4.95 35.34/4.95 fof(f108,plain,( 35.34/4.95 ( ! [X0,X1] : (end_point(X0,X1) | ~incident_c(X0,X1) | incident_c(X0,sK6(X0,X1))) )), 35.34/4.95 inference(cnf_transformation,[],[f73])). 35.34/4.95 35.34/4.95 fof(f107,plain,( 35.34/4.95 ( ! [X0,X1] : (end_point(X0,X1) | ~incident_c(X0,X1) | part_of(sK5(X0,X1),X1)) )), 35.34/4.95 inference(cnf_transformation,[],[f73])). 35.34/4.95 35.34/4.95 fof(f17,conjecture,( 35.34/4.95 ! [X0,X7,X2] : ((part_of(X7,X0) & incident_c(X2,X7) & end_point(X2,X0)) => end_point(X2,X7))), 35.34/4.95 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 35.34/4.95 35.34/4.95 fof(f18,negated_conjecture,( 35.34/4.95 ~! [X0,X7,X2] : ((part_of(X7,X0) & incident_c(X2,X7) & end_point(X2,X0)) => end_point(X2,X7))), 35.34/4.95 inference(negated_conjecture,[],[f17])). 35.34/4.95 35.34/4.95 fof(f32,plain,( 35.34/4.95 ~! [X0,X1,X2] : ((part_of(X1,X0) & incident_c(X2,X1) & end_point(X2,X0)) => end_point(X2,X1))), 35.34/4.95 inference(rectify,[],[f18])). 35.34/4.95 35.34/4.95 fof(f54,plain,( 35.34/4.95 ? [X0,X1,X2] : (~end_point(X2,X1) & (part_of(X1,X0) & incident_c(X2,X1) & end_point(X2,X0)))), 35.34/4.95 inference(ennf_transformation,[],[f32])). 35.34/4.95 35.34/4.95 fof(f55,plain,( 35.34/4.95 ? [X0,X1,X2] : (~end_point(X2,X1) & part_of(X1,X0) & incident_c(X2,X1) & end_point(X2,X0))), 35.34/4.95 inference(flattening,[],[f54])). 35.34/4.95 35.34/4.95 fof(f93,plain,( 35.34/4.95 ? [X0,X1,X2] : (~end_point(X2,X1) & part_of(X1,X0) & incident_c(X2,X1) & end_point(X2,X0)) => (~end_point(sK15,sK14) & part_of(sK14,sK13) & incident_c(sK15,sK14) & end_point(sK15,sK13))), 35.34/4.95 introduced(choice_axiom,[])). 35.34/4.95 35.34/4.95 fof(f94,plain,( 35.34/4.95 ~end_point(sK15,sK14) & part_of(sK14,sK13) & incident_c(sK15,sK14) & end_point(sK15,sK13)), 35.34/4.95 inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14,sK15])],[f55,f93])). 35.34/4.95 35.34/4.95 fof(f139,plain,( 35.34/4.95 ~end_point(sK15,sK14)), 35.34/4.95 inference(cnf_transformation,[],[f94])). 35.34/4.95 35.34/4.95 fof(f138,plain,( 35.34/4.95 part_of(sK14,sK13)), 35.34/4.95 inference(cnf_transformation,[],[f94])). 35.34/4.95 35.34/4.95 fof(f137,plain,( 35.34/4.95 incident_c(sK15,sK14)), 35.34/4.95 inference(cnf_transformation,[],[f94])). 35.34/4.95 35.34/4.95 fof(f136,plain,( 35.34/4.95 end_point(sK15,sK13)), 35.34/4.95 inference(cnf_transformation,[],[f94])). 35.34/4.95 35.34/4.95 cnf(c_27,plain, 35.34/4.95 ( ~ part_of(X0,X1) | ~ incident_c(X2,X0) | incident_c(X2,X1) ), 35.34/4.95 inference(cnf_transformation,[],[f124]) ). 35.34/4.95 35.34/4.95 cnf(c_106866,plain, 35.34/4.95 ( ~ part_of(sK5(sK15,sK14),X0) 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),X0) 35.34/4.95 | ~ incident_c(sK9(sK13,sK5(sK15,sK14)),sK5(sK15,sK14)) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_27]) ). 35.34/4.95 35.34/4.95 cnf(c_106867,plain, 35.34/4.95 ( part_of(sK5(sK15,sK14),X0) != iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),X0) = iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),sK5(sK15,sK14)) != iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_106866]) ). 35.34/4.95 35.34/4.95 cnf(c_106869,plain, 35.34/4.95 ( part_of(sK5(sK15,sK14),sK14) != iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),sK5(sK15,sK14)) != iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),sK14) = iProver_top ), 35.34/4.95 inference(instantiation,[status(thm)],[c_106867]) ). 35.34/4.95 35.34/4.95 cnf(c_20228,plain, 35.34/4.95 ( ~ part_of(sK6(sK15,sK14),X0) 35.34/4.95 | incident_c(X1,X0) 35.34/4.95 | ~ incident_c(X1,sK6(sK15,sK14)) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_27]) ). 35.34/4.95 35.34/4.95 cnf(c_63205,plain, 35.34/4.95 ( ~ part_of(sK6(sK15,sK14),X0) 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),X0) 35.34/4.95 | ~ incident_c(sK9(sK13,sK6(sK15,sK14)),sK6(sK15,sK14)) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_20228]) ). 35.34/4.95 35.34/4.95 cnf(c_63206,plain, 35.34/4.95 ( part_of(sK6(sK15,sK14),X0) != iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),X0) = iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),sK6(sK15,sK14)) != iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_63205]) ). 35.34/4.95 35.34/4.95 cnf(c_63208,plain, 35.34/4.95 ( part_of(sK6(sK15,sK14),sK14) != iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),sK6(sK15,sK14)) != iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),sK14) = iProver_top ), 35.34/4.95 inference(instantiation,[status(thm)],[c_63206]) ). 35.34/4.95 35.34/4.95 cnf(c_45875,plain, 35.34/4.95 ( ~ part_of(X0,sK13) 35.34/4.95 | ~ incident_c(sK9(sK13,sK5(sK15,sK14)),X0) 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),sK13) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_27]) ). 35.34/4.95 35.34/4.95 cnf(c_45876,plain, 35.34/4.95 ( part_of(X0,sK13) != iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),X0) != iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),sK13) = iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_45875]) ). 35.34/4.95 35.34/4.95 cnf(c_45878,plain, 35.34/4.95 ( part_of(sK14,sK13) != iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),sK13) = iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),sK14) != iProver_top ), 35.34/4.95 inference(instantiation,[status(thm)],[c_45876]) ). 35.34/4.95 35.34/4.95 cnf(c_9725,plain, 35.34/4.95 ( ~ part_of(X0,sK13) 35.34/4.95 | ~ incident_c(sK9(sK13,sK6(sK15,sK14)),X0) 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),sK13) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_27]) ). 35.34/4.95 35.34/4.95 cnf(c_9726,plain, 35.34/4.95 ( part_of(X0,sK13) != iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),X0) != iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),sK13) = iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_9725]) ). 35.34/4.95 35.34/4.95 cnf(c_9728,plain, 35.34/4.95 ( part_of(sK14,sK13) != iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),sK13) = iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),sK14) != iProver_top ), 35.34/4.95 inference(instantiation,[status(thm)],[c_9726]) ). 35.34/4.95 35.34/4.95 cnf(c_28,plain, 35.34/4.95 ( part_of(X0,X1) | ~ incident_c(sK9(X1,X0),X1) ), 35.34/4.95 inference(cnf_transformation,[],[f123]) ). 35.34/4.95 35.34/4.95 cnf(c_4798,plain, 35.34/4.95 ( part_of(sK5(sK15,sK14),sK13) 35.34/4.95 | ~ incident_c(sK9(sK13,sK5(sK15,sK14)),sK13) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_28]) ). 35.34/4.95 35.34/4.95 cnf(c_4802,plain, 35.34/4.95 ( part_of(sK5(sK15,sK14),sK13) = iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),sK13) != iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_4798]) ). 35.34/4.95 35.34/4.95 cnf(c_29,plain, 35.34/4.95 ( part_of(X0,X1) | incident_c(sK9(X1,X0),X0) ), 35.34/4.95 inference(cnf_transformation,[],[f122]) ). 35.34/4.95 35.34/4.95 cnf(c_4799,plain, 35.34/4.95 ( part_of(sK5(sK15,sK14),sK13) 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),sK5(sK15,sK14)) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_29]) ). 35.34/4.95 35.34/4.95 cnf(c_4800,plain, 35.34/4.95 ( part_of(sK5(sK15,sK14),sK13) = iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK5(sK15,sK14)),sK5(sK15,sK14)) = iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_4799]) ). 35.34/4.95 35.34/4.95 cnf(c_2763,plain, 35.34/4.95 ( part_of(sK6(sK15,sK14),sK13) 35.34/4.95 | ~ incident_c(sK9(sK13,sK6(sK15,sK14)),sK13) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_28]) ). 35.34/4.95 35.34/4.95 cnf(c_2767,plain, 35.34/4.95 ( part_of(sK6(sK15,sK14),sK13) = iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),sK13) != iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_2763]) ). 35.34/4.95 35.34/4.95 cnf(c_2764,plain, 35.34/4.95 ( part_of(sK6(sK15,sK14),sK13) 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),sK6(sK15,sK14)) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_29]) ). 35.34/4.95 35.34/4.95 cnf(c_2765,plain, 35.34/4.95 ( part_of(sK6(sK15,sK14),sK13) = iProver_top 35.34/4.95 | incident_c(sK9(sK13,sK6(sK15,sK14)),sK6(sK15,sK14)) = iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_2764]) ). 35.34/4.95 35.34/4.95 cnf(c_13,plain, 35.34/4.95 ( ~ part_of(X0,X1) 35.34/4.95 | ~ part_of(X2,X1) 35.34/4.95 | part_of(X0,X2) 35.34/4.95 | part_of(X2,X0) 35.34/4.95 | ~ end_point(X3,X1) 35.34/4.95 | ~ incident_c(X3,X2) 35.34/4.95 | ~ incident_c(X3,X0) ), 35.34/4.95 inference(cnf_transformation,[],[f113]) ). 35.34/4.95 35.34/4.95 cnf(c_1472,plain, 35.34/4.95 ( ~ part_of(sK6(sK15,sK14),X0) 35.34/4.95 | part_of(sK6(sK15,sK14),sK5(sK15,sK14)) 35.34/4.95 | ~ part_of(sK5(sK15,sK14),X0) 35.34/4.95 | part_of(sK5(sK15,sK14),sK6(sK15,sK14)) 35.34/4.95 | ~ end_point(X1,X0) 35.34/4.95 | ~ incident_c(X1,sK6(sK15,sK14)) 35.34/4.95 | ~ incident_c(X1,sK5(sK15,sK14)) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_13]) ). 35.34/4.95 35.34/4.95 cnf(c_1844,plain, 35.34/4.95 ( ~ part_of(sK6(sK15,sK14),X0) 35.34/4.95 | part_of(sK6(sK15,sK14),sK5(sK15,sK14)) 35.34/4.95 | ~ part_of(sK5(sK15,sK14),X0) 35.34/4.95 | part_of(sK5(sK15,sK14),sK6(sK15,sK14)) 35.34/4.95 | ~ end_point(sK15,X0) 35.34/4.95 | ~ incident_c(sK15,sK6(sK15,sK14)) 35.34/4.95 | ~ incident_c(sK15,sK5(sK15,sK14)) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_1472]) ). 35.34/4.95 35.34/4.95 cnf(c_2015,plain, 35.34/4.95 ( part_of(sK6(sK15,sK14),sK5(sK15,sK14)) 35.34/4.95 | ~ part_of(sK6(sK15,sK14),sK13) 35.34/4.95 | part_of(sK5(sK15,sK14),sK6(sK15,sK14)) 35.34/4.95 | ~ part_of(sK5(sK15,sK14),sK13) 35.34/4.95 | ~ end_point(sK15,sK13) 35.34/4.95 | ~ incident_c(sK15,sK6(sK15,sK14)) 35.34/4.95 | ~ incident_c(sK15,sK5(sK15,sK14)) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_1844]) ). 35.34/4.95 35.34/4.95 cnf(c_2016,plain, 35.34/4.95 ( part_of(sK6(sK15,sK14),sK5(sK15,sK14)) = iProver_top 35.34/4.95 | part_of(sK6(sK15,sK14),sK13) != iProver_top 35.34/4.95 | part_of(sK5(sK15,sK14),sK6(sK15,sK14)) = iProver_top 35.34/4.95 | part_of(sK5(sK15,sK14),sK13) != iProver_top 35.34/4.95 | end_point(sK15,sK13) != iProver_top 35.34/4.95 | incident_c(sK15,sK6(sK15,sK14)) != iProver_top 35.34/4.95 | incident_c(sK15,sK5(sK15,sK14)) != iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_2015]) ). 35.34/4.95 35.34/4.95 cnf(c_14,plain, 35.34/4.95 ( ~ part_of(sK5(X0,X1),sK6(X0,X1)) 35.34/4.95 | end_point(X0,X1) 35.34/4.95 | ~ incident_c(X0,X1) ), 35.34/4.95 inference(cnf_transformation,[],[f112]) ). 35.34/4.95 35.34/4.95 cnf(c_1419,plain, 35.34/4.95 ( ~ part_of(sK5(sK15,sK14),sK6(sK15,sK14)) 35.34/4.95 | end_point(sK15,sK14) 35.34/4.95 | ~ incident_c(sK15,sK14) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_14]) ). 35.34/4.95 35.34/4.95 cnf(c_1438,plain, 35.34/4.95 ( part_of(sK5(sK15,sK14),sK6(sK15,sK14)) != iProver_top 35.34/4.95 | end_point(sK15,sK14) = iProver_top 35.34/4.95 | incident_c(sK15,sK14) != iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_1419]) ). 35.34/4.95 35.34/4.95 cnf(c_15,plain, 35.34/4.95 ( ~ part_of(sK6(X0,X1),sK5(X0,X1)) 35.34/4.95 | end_point(X0,X1) 35.34/4.95 | ~ incident_c(X0,X1) ), 35.34/4.95 inference(cnf_transformation,[],[f111]) ). 35.34/4.95 35.34/4.95 cnf(c_1420,plain, 35.34/4.95 ( ~ part_of(sK6(sK15,sK14),sK5(sK15,sK14)) 35.34/4.95 | end_point(sK15,sK14) 35.34/4.95 | ~ incident_c(sK15,sK14) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_15]) ). 35.34/4.95 35.34/4.95 cnf(c_1436,plain, 35.34/4.95 ( part_of(sK6(sK15,sK14),sK5(sK15,sK14)) != iProver_top 35.34/4.95 | end_point(sK15,sK14) = iProver_top 35.34/4.95 | incident_c(sK15,sK14) != iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_1420]) ). 35.34/4.95 35.34/4.95 cnf(c_16,plain, 35.34/4.95 ( end_point(X0,X1) 35.34/4.95 | ~ incident_c(X0,X1) 35.34/4.95 | incident_c(X0,sK5(X0,X1)) ), 35.34/4.95 inference(cnf_transformation,[],[f110]) ). 35.34/4.95 35.34/4.95 cnf(c_1421,plain, 35.34/4.95 ( end_point(sK15,sK14) 35.34/4.95 | incident_c(sK15,sK5(sK15,sK14)) 35.34/4.95 | ~ incident_c(sK15,sK14) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_16]) ). 35.34/4.95 35.34/4.95 cnf(c_1434,plain, 35.34/4.95 ( end_point(sK15,sK14) = iProver_top 35.34/4.95 | incident_c(sK15,sK5(sK15,sK14)) = iProver_top 35.34/4.95 | incident_c(sK15,sK14) != iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_1421]) ). 35.34/4.95 35.34/4.95 cnf(c_17,plain, 35.34/4.95 ( part_of(sK6(X0,X1),X1) | end_point(X0,X1) | ~ incident_c(X0,X1) ), 35.34/4.95 inference(cnf_transformation,[],[f109]) ). 35.34/4.95 35.34/4.95 cnf(c_1422,plain, 35.34/4.95 ( part_of(sK6(sK15,sK14),sK14) 35.34/4.95 | end_point(sK15,sK14) 35.34/4.95 | ~ incident_c(sK15,sK14) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_17]) ). 35.34/4.95 35.34/4.95 cnf(c_1432,plain, 35.34/4.95 ( part_of(sK6(sK15,sK14),sK14) = iProver_top 35.34/4.95 | end_point(sK15,sK14) = iProver_top 35.34/4.95 | incident_c(sK15,sK14) != iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_1422]) ). 35.34/4.95 35.34/4.95 cnf(c_18,plain, 35.34/4.95 ( end_point(X0,X1) 35.34/4.95 | ~ incident_c(X0,X1) 35.34/4.95 | incident_c(X0,sK6(X0,X1)) ), 35.34/4.95 inference(cnf_transformation,[],[f108]) ). 35.34/4.95 35.34/4.95 cnf(c_1423,plain, 35.34/4.95 ( end_point(sK15,sK14) 35.34/4.95 | incident_c(sK15,sK6(sK15,sK14)) 35.34/4.95 | ~ incident_c(sK15,sK14) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_18]) ). 35.34/4.95 35.34/4.95 cnf(c_1430,plain, 35.34/4.95 ( end_point(sK15,sK14) = iProver_top 35.34/4.95 | incident_c(sK15,sK6(sK15,sK14)) = iProver_top 35.34/4.95 | incident_c(sK15,sK14) != iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_1423]) ). 35.34/4.95 35.34/4.95 cnf(c_19,plain, 35.34/4.95 ( part_of(sK5(X0,X1),X1) | end_point(X0,X1) | ~ incident_c(X0,X1) ), 35.34/4.95 inference(cnf_transformation,[],[f107]) ). 35.34/4.95 35.34/4.95 cnf(c_1424,plain, 35.34/4.95 ( part_of(sK5(sK15,sK14),sK14) 35.34/4.95 | end_point(sK15,sK14) 35.34/4.95 | ~ incident_c(sK15,sK14) ), 35.34/4.95 inference(instantiation,[status(thm)],[c_19]) ). 35.34/4.95 35.34/4.95 cnf(c_1428,plain, 35.34/4.95 ( part_of(sK5(sK15,sK14),sK14) = iProver_top 35.34/4.95 | end_point(sK15,sK14) = iProver_top 35.34/4.95 | incident_c(sK15,sK14) != iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_1424]) ). 35.34/4.95 35.34/4.95 cnf(c_41,negated_conjecture, 35.34/4.95 ( ~ end_point(sK15,sK14) ), 35.34/4.95 inference(cnf_transformation,[],[f139]) ). 35.34/4.95 35.34/4.95 cnf(c_48,plain, 35.34/4.95 ( end_point(sK15,sK14) != iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_41]) ). 35.34/4.95 35.34/4.95 cnf(c_42,negated_conjecture, 35.34/4.95 ( part_of(sK14,sK13) ), 35.34/4.95 inference(cnf_transformation,[],[f138]) ). 35.34/4.95 35.34/4.95 cnf(c_47,plain, 35.34/4.95 ( part_of(sK14,sK13) = iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_42]) ). 35.34/4.95 35.34/4.95 cnf(c_43,negated_conjecture, 35.34/4.95 ( incident_c(sK15,sK14) ), 35.34/4.95 inference(cnf_transformation,[],[f137]) ). 35.34/4.95 35.34/4.95 cnf(c_46,plain, 35.34/4.95 ( incident_c(sK15,sK14) = iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_43]) ). 35.34/4.95 35.34/4.95 cnf(c_44,negated_conjecture, 35.34/4.95 ( end_point(sK15,sK13) ), 35.34/4.95 inference(cnf_transformation,[],[f136]) ). 35.34/4.95 35.34/4.95 cnf(c_45,plain, 35.34/4.95 ( end_point(sK15,sK13) = iProver_top ), 35.34/4.95 inference(predicate_to_equality,[status(thm)],[c_44]) ). 35.34/4.95 35.34/4.95 cnf(contradiction,plain, 35.34/4.95 ( $false ), 35.34/4.95 inference(minisat, 35.34/4.95 [status(thm)], 35.34/4.95 [c_106869,c_63208,c_45878,c_9728,c_4802,c_4800,c_2767, 35.34/4.95 c_2765,c_2016,c_1438,c_1436,c_1434,c_1432,c_1430,c_1428, 35.34/4.95 c_48,c_47,c_46,c_45]) ). 35.34/4.95 35.34/4.95 35.34/4.95 % SZS output end CNFRefutation for theBenchmark.p 35.34/4.95 35.34/4.95 ------ Statistics 35.34/4.95 35.34/4.95 ------ General 35.34/4.95 35.34/4.95 abstr_ref_over_cycles: 0 35.34/4.95 abstr_ref_under_cycles: 0 35.34/4.95 gc_basic_clause_elim: 0 35.34/4.95 forced_gc_time: 0 35.34/4.95 parsing_time: 0.008 35.34/4.95 unif_index_cands_time: 0. 35.34/4.95 unif_index_add_time: 0. 35.34/4.95 orderings_time: 0. 35.34/4.95 out_proof_time: 0.016 35.34/4.95 total_time: 4.272 35.34/4.95 num_of_symbols: 55 35.34/4.95 num_of_terms: 156238 35.34/4.95 35.34/4.95 ------ Preprocessing 35.34/4.95 35.34/4.95 num_of_splits: 0 35.34/4.95 num_of_split_atoms: 0 35.34/4.95 num_of_reused_defs: 0 35.34/4.95 num_eq_ax_congr_red: 54 35.34/4.95 num_of_sem_filtered_clauses: 1 35.34/4.95 num_of_subtypes: 0 35.34/4.95 monotx_restored_types: 0 35.34/4.95 sat_num_of_epr_types: 0 35.34/4.95 sat_num_of_non_cyclic_types: 0 35.34/4.95 sat_guarded_non_collapsed_types: 0 35.34/4.95 num_pure_diseq_elim: 0 35.34/4.95 simp_replaced_by: 0 35.34/4.95 res_preprocessed: 154 35.34/4.95 prep_upred: 0 35.34/4.95 prep_unflattend: 9 35.34/4.95 smt_new_axioms: 0 35.34/4.95 pred_elim_cands: 7 35.34/4.95 pred_elim: 0 35.34/4.95 pred_elim_cl: 0 35.34/4.95 pred_elim_cycles: 3 35.34/4.95 merged_defs: 0 35.34/4.95 merged_defs_ncl: 0 35.34/4.95 bin_hyper_res: 0 35.34/4.95 prep_cycles: 3 35.34/4.95 pred_elim_time: 0.001 35.34/4.95 splitting_time: 0. 35.34/4.95 sem_filter_time: 0. 35.34/4.95 monotx_time: 0. 35.34/4.95 subtype_inf_time: 0. 35.34/4.95 35.34/4.95 ------ Problem properties 35.34/4.95 35.34/4.95 clauses: 45 35.34/4.95 conjectures: 4 35.34/4.95 epr: 17 35.34/4.95 horn: 29 35.34/4.95 ground: 4 35.34/4.95 unary: 5 35.34/4.95 binary: 16 35.34/4.95 lits: 133 35.34/4.95 lits_eq: 12 35.34/4.95 fd_pure: 0 35.34/4.95 fd_pseudo: 0 35.34/4.95 fd_cond: 0 35.34/4.95 fd_pseudo_cond: 7 35.34/4.95 ac_symbols: 0 35.34/4.95 35.34/4.95 ------ Propositional Solver 35.34/4.95 35.34/4.95 prop_solver_calls: 49 35.34/4.95 prop_fast_solver_calls: 3188 35.34/4.95 smt_solver_calls: 0 35.34/4.95 smt_fast_solver_calls: 0 35.34/4.95 prop_num_of_clauses: 45189 35.34/4.95 prop_preprocess_simplified: 72646 35.34/4.95 prop_fo_subsumed: 38 35.34/4.95 prop_solver_time: 0. 35.34/4.95 smt_solver_time: 0. 35.34/4.95 smt_fast_solver_time: 0. 35.34/4.95 prop_fast_solver_time: 0. 35.34/4.95 prop_unsat_core_time: 0.005 35.34/4.95 35.34/4.95 ------ QBF 35.34/4.95 35.34/4.95 qbf_q_res: 0 35.34/4.95 qbf_num_tautologies: 0 35.34/4.95 qbf_prep_cycles: 0 35.34/4.95 35.34/4.95 ------ BMC1 35.34/4.95 35.34/4.95 bmc1_current_bound: -1 35.34/4.95 bmc1_last_solved_bound: -1 35.34/4.95 bmc1_unsat_core_size: -1 35.34/4.95 bmc1_unsat_core_parents_size: -1 35.34/4.95 bmc1_merge_next_fun: 0 35.34/4.95 bmc1_unsat_core_clauses_time: 0. 35.34/4.95 35.34/4.95 ------ Instantiation 35.34/4.95 35.34/4.95 inst_num_of_clauses: 1363 35.34/4.95 inst_num_in_passive: 780 35.34/4.95 inst_num_in_active: 2128 35.34/4.95 inst_num_in_unprocessed: 117 35.34/4.95 inst_num_of_loops: 3485 35.34/4.95 inst_num_of_learning_restarts: 1 35.34/4.95 inst_num_moves_active_passive: 1356 35.34/4.95 inst_lit_activity: 0 35.34/4.95 inst_lit_activity_moves: 1 35.34/4.95 inst_num_tautologies: 0 35.34/4.95 inst_num_prop_implied: 0 35.34/4.95 inst_num_existing_simplified: 0 35.34/4.95 inst_num_eq_res_simplified: 0 35.34/4.95 inst_num_child_elim: 0 35.34/4.95 inst_num_of_dismatching_blockings: 9777 35.34/4.95 inst_num_of_non_proper_insts: 12584 35.34/4.95 inst_num_of_duplicates: 0 35.34/4.95 inst_inst_num_from_inst_to_res: 0 35.34/4.95 inst_dismatching_checking_time: 0. 35.34/4.95 35.34/4.95 ------ Resolution 35.34/4.95 35.34/4.95 res_num_of_clauses: 54 35.34/4.95 res_num_in_passive: 54 35.34/4.95 res_num_in_active: 0 35.34/4.95 res_num_of_loops: 157 35.34/4.95 res_forward_subset_subsumed: 1069 35.34/4.95 res_backward_subset_subsumed: 0 35.34/4.95 res_forward_subsumed: 0 35.34/4.95 res_backward_subsumed: 0 35.34/4.95 res_forward_subsumption_resolution: 0 35.34/4.95 res_backward_subsumption_resolution: 0 35.34/4.95 res_clause_to_clause_subsumption: 118759 35.34/4.95 res_orphan_elimination: 0 35.34/4.95 res_tautology_del: 525 35.34/4.95 res_num_eq_res_simplified: 0 35.34/4.95 res_num_sel_changes: 0 35.34/4.95 res_moves_from_active_to_pass: 0 35.34/4.95 35.34/4.95 ------ Superposition 35.34/4.95 35.34/4.95 sup_time_total: 0. 35.34/4.95 sup_time_generating: 0. 35.34/4.95 sup_time_sim_full: 0. 35.34/4.95 sup_time_sim_immed: 0. 35.34/4.95 35.34/4.95 sup_num_of_clauses: 7250 35.34/4.95 sup_num_in_active: 650 35.34/4.95 sup_num_in_passive: 6600 35.34/4.95 sup_num_of_loops: 696 35.34/4.95 sup_fw_superposition: 7950 35.34/4.95 sup_bw_superposition: 9503 35.34/4.95 sup_immediate_simplified: 8001 35.34/4.95 sup_given_eliminated: 0 35.34/4.95 comparisons_done: 0 35.34/4.95 comparisons_avoided: 26 35.34/4.95 35.34/4.95 ------ Simplifications 35.34/4.95 35.34/4.95 35.34/4.95 sim_fw_subset_subsumed: 1085 35.34/4.95 sim_bw_subset_subsumed: 279 35.34/4.95 sim_fw_subsumed: 4431 35.34/4.95 sim_bw_subsumed: 130 35.34/4.95 sim_fw_subsumption_res: 0 35.34/4.95 sim_bw_subsumption_res: 0 35.34/4.95 sim_tautology_del: 437 35.34/4.95 sim_eq_tautology_del: 579 35.34/4.95 sim_eq_res_simp: 367 35.34/4.95 sim_fw_demodulated: 2659 35.34/4.95 sim_bw_demodulated: 23 35.34/4.95 sim_light_normalised: 2425 35.34/4.95 sim_joinable_taut: 0 35.34/4.95 sim_joinable_simp: 0 35.34/4.95 sim_ac_normalised: 0 35.34/4.95 sim_smt_subsumption: 0 35.34/4.95 35.34/4.96 EOF