0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : iproveropt_run.sh %d %s 0.13/0.34 % Computer : n025.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Thu Jul 2 07:05:33 EDT 2020 0.13/0.34 % CPUTime : 0.13/0.34 % Running in FOF mode 3.10/0.98 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p 3.10/0.98 3.10/0.98 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 3.10/0.98 3.10/0.98 ------ iProver source info 3.10/0.98 3.10/0.98 git: date: 2020-06-30 10:37:57 +0100 3.10/0.98 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 3.10/0.98 git: non_committed_changes: false 3.10/0.98 git: last_make_outside_of_git: false 3.10/0.98 3.10/0.98 ------ 3.10/0.98 3.10/0.98 ------ Input Options 3.10/0.98 3.10/0.98 --out_options all 3.10/0.98 --tptp_safe_out true 3.10/0.98 --problem_path "" 3.10/0.98 --include_path "" 3.10/0.98 --clausifier res/vclausify_rel 3.10/0.98 --clausifier_options "" 3.10/0.98 --stdin false 3.10/0.98 --stats_out all 3.10/0.98 3.10/0.98 ------ General Options 3.10/0.98 3.10/0.98 --fof false 3.10/0.98 --time_out_real 125. 3.10/0.98 --time_out_virtual -1. 3.10/0.98 --symbol_type_check false 3.10/0.98 --clausify_out false 3.10/0.98 --sig_cnt_out false 3.10/0.98 --trig_cnt_out false 3.10/0.98 --trig_cnt_out_tolerance 1. 3.10/0.98 --trig_cnt_out_sk_spl false 3.10/0.98 --abstr_cl_out false 3.10/0.98 3.10/0.98 ------ Global Options 3.10/0.98 3.10/0.98 --schedule default 3.10/0.98 --add_important_lit false 3.10/0.98 --prop_solver_per_cl 1000 3.10/0.98 --min_unsat_core false 3.10/0.98 --soft_assumptions false 3.10/0.98 --soft_lemma_size 3 3.10/0.98 --prop_impl_unit_size 0 3.10/0.98 --prop_impl_unit [] 3.10/0.98 --share_sel_clauses true 3.10/0.98 --reset_solvers false 3.10/0.98 --bc_imp_inh [conj_cone] 3.10/0.98 --conj_cone_tolerance 3. 3.10/0.98 --extra_neg_conj none 3.10/0.98 --large_theory_mode true 3.10/0.98 --prolific_symb_bound 200 3.10/0.98 --lt_threshold 2000 3.10/0.98 --clause_weak_htbl true 3.10/0.98 --gc_record_bc_elim false 3.10/0.98 3.10/0.98 ------ Preprocessing Options 3.10/0.98 3.10/0.98 --preprocessing_flag true 3.10/0.98 --time_out_prep_mult 0.1 3.10/0.98 --splitting_mode input 3.10/0.98 --splitting_grd true 3.10/0.98 --splitting_cvd false 3.10/0.98 --splitting_cvd_svl false 3.10/0.98 --splitting_nvd 32 3.10/0.98 --sub_typing true 3.10/0.98 --prep_gs_sim true 3.10/0.98 --prep_unflatten true 3.10/0.98 --prep_res_sim true 3.10/0.98 --prep_upred true 3.10/0.98 --prep_sem_filter exhaustive 3.10/0.98 --prep_sem_filter_out false 3.10/0.98 --pred_elim true 3.10/0.98 --res_sim_input true 3.10/0.98 --eq_ax_congr_red true 3.10/0.98 --pure_diseq_elim true 3.10/0.98 --brand_transform false 3.10/0.98 --non_eq_to_eq false 3.10/0.98 --prep_def_merge true 3.10/0.98 --prep_def_merge_prop_impl false 3.10/0.98 --prep_def_merge_mbd true 3.10/0.98 --prep_def_merge_tr_red false 3.10/0.98 --prep_def_merge_tr_cl false 3.10/0.98 --smt_preprocessing true 3.10/0.98 --smt_ac_axioms fast 3.10/0.98 --preprocessed_out false 3.10/0.98 --preprocessed_stats false 3.10/0.98 3.10/0.98 ------ Abstraction refinement Options 3.10/0.98 3.10/0.98 --abstr_ref [] 3.10/0.98 --abstr_ref_prep false 3.10/0.98 --abstr_ref_until_sat false 3.10/0.98 --abstr_ref_sig_restrict funpre 3.10/0.98 --abstr_ref_af_restrict_to_split_sk false 3.10/0.98 --abstr_ref_under [] 3.10/0.98 3.10/0.98 ------ SAT Options 3.10/0.98 3.10/0.98 --sat_mode false 3.10/0.98 --sat_fm_restart_options "" 3.10/0.98 --sat_gr_def false 3.10/0.98 --sat_epr_types true 3.10/0.98 --sat_non_cyclic_types false 3.10/0.98 --sat_finite_models false 3.10/0.98 --sat_fm_lemmas false 3.10/0.98 --sat_fm_prep false 3.10/0.98 --sat_fm_uc_incr true 3.10/0.98 --sat_out_model small 3.10/0.98 --sat_out_clauses false 3.10/0.98 3.10/0.98 ------ QBF Options 3.10/0.98 3.10/0.98 --qbf_mode false 3.10/0.98 --qbf_elim_univ false 3.10/0.98 --qbf_dom_inst none 3.10/0.98 --qbf_dom_pre_inst false 3.10/0.98 --qbf_sk_in false 3.10/0.98 --qbf_pred_elim true 3.10/0.98 --qbf_split 512 3.10/0.98 3.10/0.98 ------ BMC1 Options 3.10/0.98 3.10/0.98 --bmc1_incremental false 3.10/0.98 --bmc1_axioms reachable_all 3.10/0.98 --bmc1_min_bound 0 3.10/0.98 --bmc1_max_bound -1 3.10/0.98 --bmc1_max_bound_default -1 3.10/0.98 --bmc1_symbol_reachability true 3.10/0.98 --bmc1_property_lemmas false 3.10/0.98 --bmc1_k_induction false 3.10/0.98 --bmc1_non_equiv_states false 3.10/0.98 --bmc1_deadlock false 3.10/0.98 --bmc1_ucm false 3.10/0.98 --bmc1_add_unsat_core none 3.10/0.98 --bmc1_unsat_core_children false 3.10/0.98 --bmc1_unsat_core_extrapolate_axioms false 3.10/0.98 --bmc1_out_stat full 3.10/0.98 --bmc1_ground_init false 3.10/0.98 --bmc1_pre_inst_next_state false 3.10/0.98 --bmc1_pre_inst_state false 3.10/0.98 --bmc1_pre_inst_reach_state false 3.10/0.98 --bmc1_out_unsat_core false 3.10/0.98 --bmc1_aig_witness_out false 3.10/0.98 --bmc1_verbose false 3.10/0.98 --bmc1_dump_clauses_tptp false 3.10/0.98 --bmc1_dump_unsat_core_tptp false 3.10/0.98 --bmc1_dump_file - 3.10/0.98 --bmc1_ucm_expand_uc_limit 128 3.10/0.98 --bmc1_ucm_n_expand_iterations 6 3.10/0.98 --bmc1_ucm_extend_mode 1 3.10/0.98 --bmc1_ucm_init_mode 2 3.10/0.98 --bmc1_ucm_cone_mode none 3.10/0.98 --bmc1_ucm_reduced_relation_type 0 3.10/0.98 --bmc1_ucm_relax_model 4 3.10/0.98 --bmc1_ucm_full_tr_after_sat true 3.10/0.98 --bmc1_ucm_expand_neg_assumptions false 3.10/0.98 --bmc1_ucm_layered_model none 3.10/0.98 --bmc1_ucm_max_lemma_size 10 3.10/0.98 3.10/0.98 ------ AIG Options 3.10/0.98 3.10/0.98 --aig_mode false 3.10/0.98 3.10/0.98 ------ Instantiation Options 3.10/0.98 3.10/0.98 --instantiation_flag true 3.10/0.98 --inst_sos_flag true 3.10/0.98 --inst_sos_phase true 3.10/0.98 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 3.10/0.98 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 3.10/0.98 --inst_lit_sel_side num_symb 3.10/0.98 --inst_solver_per_active 1400 3.10/0.98 --inst_solver_calls_frac 1. 3.10/0.98 --inst_passive_queue_type priority_queues 3.10/0.98 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 3.10/0.98 --inst_passive_queues_freq [25;2] 3.10/0.98 --inst_dismatching true 3.10/0.98 --inst_eager_unprocessed_to_passive true 3.10/0.98 --inst_prop_sim_given true 3.10/0.98 --inst_prop_sim_new false 3.10/0.98 --inst_subs_new false 3.10/0.98 --inst_eq_res_simp false 3.10/0.98 --inst_subs_given false 3.10/0.98 --inst_orphan_elimination true 3.10/0.98 --inst_learning_loop_flag true 3.10/0.98 --inst_learning_start 3000 3.10/0.98 --inst_learning_factor 2 3.10/0.98 --inst_start_prop_sim_after_learn 3 3.10/0.98 --inst_sel_renew solver 3.10/0.98 --inst_lit_activity_flag true 3.10/0.98 --inst_restr_to_given false 3.10/0.98 --inst_activity_threshold 500 3.10/0.98 --inst_out_proof true 3.10/0.98 3.10/0.98 ------ Resolution Options 3.10/0.98 3.10/0.98 --resolution_flag true 3.10/0.98 --res_lit_sel adaptive 3.10/0.98 --res_lit_sel_side none 3.10/0.98 --res_ordering kbo 3.10/0.98 --res_to_prop_solver active 3.10/0.98 --res_prop_simpl_new false 3.10/0.98 --res_prop_simpl_given true 3.10/0.98 --res_passive_queue_type priority_queues 3.10/0.98 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 3.10/0.98 --res_passive_queues_freq [15;5] 3.10/0.98 --res_forward_subs full 3.10/0.98 --res_backward_subs full 3.10/0.98 --res_forward_subs_resolution true 3.10/0.98 --res_backward_subs_resolution true 3.10/0.98 --res_orphan_elimination true 3.10/0.98 --res_time_limit 2. 3.10/0.98 --res_out_proof true 3.10/0.98 3.10/0.98 ------ Superposition Options 3.10/0.98 3.10/0.98 --superposition_flag true 3.10/0.98 --sup_passive_queue_type priority_queues 3.10/0.98 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 3.10/0.98 --sup_passive_queues_freq [8;1;4] 3.10/0.98 --demod_completeness_check fast 3.10/0.98 --demod_use_ground true 3.10/0.98 --sup_to_prop_solver passive 3.10/0.98 --sup_prop_simpl_new true 3.10/0.98 --sup_prop_simpl_given true 3.10/0.98 --sup_fun_splitting true 3.10/0.98 --sup_smt_interval 50000 3.10/0.98 3.10/0.98 ------ Superposition Simplification Setup 3.10/0.98 3.10/0.98 --sup_indices_passive [LightNormIndex;FwDemodIndex] 3.10/0.98 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 3.10/0.98 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 3.10/0.98 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 3.10/0.98 --sup_full_triv [TrivRules;PropSubs] 3.10/0.98 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 3.10/0.98 --sup_full_bw [BwDemod;BwSubsumption] 3.10/0.98 --sup_immed_triv [TrivRules] 3.10/0.98 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 3.10/0.98 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 3.10/0.98 --sup_immed_bw_main [] 3.10/0.98 --sup_immed_bw_immed [BwDemod;BwSubsumption] 3.10/0.98 --sup_input_triv [Unflattening;TrivRules] 3.10/0.98 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 3.10/0.98 --sup_input_bw [] 3.10/0.98 3.10/0.98 ------ Combination Options 3.10/0.98 3.10/0.98 --comb_res_mult 3 3.10/0.98 --comb_sup_mult 2 3.10/0.98 --comb_inst_mult 10 3.10/0.98 3.10/0.98 ------ Debug Options 3.10/0.98 3.10/0.98 --dbg_backtrace false 3.10/0.98 --dbg_dump_prop_clauses false 3.10/0.98 --dbg_dump_prop_clauses_file - 3.10/0.98 --dbg_out_stat false 3.10/0.98 ------ Parsing... 3.10/0.98 ------ Clausification by vclausify_rel & Parsing by iProver... 3.10/0.98 3.10/0.98 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 2 0s sf_e pe_s pe_e 3.10/0.98 3.10/0.98 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 3.10/0.98 3.10/0.98 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 3.10/0.98 ------ Proving... 3.10/0.98 ------ Problem Properties 3.10/0.98 3.10/0.98 3.10/0.98 clauses 50 3.10/0.98 conjectures 4 3.10/0.98 EPR 17 3.10/0.98 Horn 35 3.10/0.98 unary 5 3.10/0.98 binary 14 3.10/0.98 lits 146 3.10/0.98 lits eq 32 3.10/0.98 fd_pure 0 3.10/0.98 fd_pseudo 0 3.10/0.98 fd_cond 0 3.10/0.98 fd_pseudo_cond 3 3.10/0.98 AC symbols 0 3.10/0.98 3.10/0.98 ------ Schedule dynamic 5 is on 3.10/0.98 3.10/0.98 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 3.10/0.98 3.10/0.98 3.10/0.98 ------ 3.10/0.98 Current options: 3.10/0.98 ------ 3.10/0.98 3.10/0.98 ------ Input Options 3.10/0.98 3.10/0.98 --out_options all 3.10/0.98 --tptp_safe_out true 3.10/0.98 --problem_path "" 3.10/0.98 --include_path "" 3.10/0.98 --clausifier res/vclausify_rel 3.10/0.98 --clausifier_options "" 3.10/0.98 --stdin false 3.10/0.98 --stats_out all 3.10/0.98 3.10/0.98 ------ General Options 3.10/0.98 3.10/0.98 --fof false 3.10/0.98 --time_out_real 125. 3.10/0.98 --time_out_virtual -1. 3.10/0.98 --symbol_type_check false 3.10/0.98 --clausify_out false 3.10/0.98 --sig_cnt_out false 3.10/0.98 --trig_cnt_out false 3.10/0.98 --trig_cnt_out_tolerance 1. 3.10/0.98 --trig_cnt_out_sk_spl false 3.10/0.98 --abstr_cl_out false 3.10/0.98 3.10/0.98 ------ Global Options 3.10/0.98 3.10/0.98 --schedule default 3.10/0.98 --add_important_lit false 3.10/0.98 --prop_solver_per_cl 1000 3.10/0.98 --min_unsat_core false 3.10/0.98 --soft_assumptions false 3.10/0.98 --soft_lemma_size 3 3.10/0.98 --prop_impl_unit_size 0 3.10/0.98 --prop_impl_unit [] 3.10/0.98 --share_sel_clauses true 3.10/0.98 --reset_solvers false 3.10/0.98 --bc_imp_inh [conj_cone] 3.10/0.98 --conj_cone_tolerance 3. 3.10/0.98 --extra_neg_conj none 3.10/0.98 --large_theory_mode true 3.10/0.98 --prolific_symb_bound 200 3.10/0.98 --lt_threshold 2000 3.10/0.98 --clause_weak_htbl true 3.10/0.98 --gc_record_bc_elim false 3.10/0.98 3.10/0.98 ------ Preprocessing Options 3.10/0.98 3.10/0.98 --preprocessing_flag true 3.10/0.98 --time_out_prep_mult 0.1 3.10/0.98 --splitting_mode input 3.10/0.98 --splitting_grd true 3.10/0.98 --splitting_cvd false 3.10/0.98 --splitting_cvd_svl false 3.10/0.98 --splitting_nvd 32 3.10/0.98 --sub_typing true 3.10/0.98 --prep_gs_sim true 3.10/0.98 --prep_unflatten true 3.10/0.98 --prep_res_sim true 3.10/0.98 --prep_upred true 3.10/0.98 --prep_sem_filter exhaustive 3.10/0.98 --prep_sem_filter_out false 3.10/0.98 --pred_elim true 3.10/0.98 --res_sim_input true 3.10/0.98 --eq_ax_congr_red true 3.10/0.98 --pure_diseq_elim true 3.10/0.98 --brand_transform false 3.10/0.98 --non_eq_to_eq false 3.10/0.98 --prep_def_merge true 3.10/0.98 --prep_def_merge_prop_impl false 3.10/0.98 --prep_def_merge_mbd true 3.10/0.98 --prep_def_merge_tr_red false 3.10/0.98 --prep_def_merge_tr_cl false 3.10/0.98 --smt_preprocessing true 3.10/0.98 --smt_ac_axioms fast 3.10/0.98 --preprocessed_out false 3.10/0.98 --preprocessed_stats false 3.10/0.98 3.10/0.98 ------ Abstraction refinement Options 3.10/0.98 3.10/0.98 --abstr_ref [] 3.10/0.98 --abstr_ref_prep false 3.10/0.98 --abstr_ref_until_sat false 3.10/0.98 --abstr_ref_sig_restrict funpre 3.10/0.98 --abstr_ref_af_restrict_to_split_sk false 3.10/0.98 --abstr_ref_under [] 3.10/0.98 3.10/0.98 ------ SAT Options 3.10/0.98 3.10/0.98 --sat_mode false 3.10/0.98 --sat_fm_restart_options "" 3.10/0.98 --sat_gr_def false 3.10/0.98 --sat_epr_types true 3.10/0.98 --sat_non_cyclic_types false 3.10/0.98 --sat_finite_models false 3.10/0.98 --sat_fm_lemmas false 3.10/0.98 --sat_fm_prep false 3.10/0.98 --sat_fm_uc_incr true 3.10/0.98 --sat_out_model small 3.10/0.98 --sat_out_clauses false 3.10/0.98 3.10/0.98 ------ QBF Options 3.10/0.98 3.10/0.98 --qbf_mode false 3.10/0.98 --qbf_elim_univ false 3.10/0.98 --qbf_dom_inst none 3.10/0.98 --qbf_dom_pre_inst false 3.10/0.98 --qbf_sk_in false 3.10/0.98 --qbf_pred_elim true 3.10/0.98 --qbf_split 512 3.10/0.98 3.10/0.98 ------ BMC1 Options 3.10/0.98 3.10/0.98 --bmc1_incremental false 3.10/0.98 --bmc1_axioms reachable_all 3.10/0.98 --bmc1_min_bound 0 3.10/0.98 --bmc1_max_bound -1 3.10/0.98 --bmc1_max_bound_default -1 3.10/0.98 --bmc1_symbol_reachability true 3.10/0.98 --bmc1_property_lemmas false 3.10/0.98 --bmc1_k_induction false 3.10/0.98 --bmc1_non_equiv_states false 3.10/0.98 --bmc1_deadlock false 3.10/0.98 --bmc1_ucm false 3.10/0.98 --bmc1_add_unsat_core none 3.10/0.98 --bmc1_unsat_core_children false 3.10/0.98 --bmc1_unsat_core_extrapolate_axioms false 3.10/0.98 --bmc1_out_stat full 3.10/0.98 --bmc1_ground_init false 3.10/0.98 --bmc1_pre_inst_next_state false 3.10/0.98 --bmc1_pre_inst_state false 3.10/0.98 --bmc1_pre_inst_reach_state false 3.10/0.98 --bmc1_out_unsat_core false 3.10/0.98 --bmc1_aig_witness_out false 3.10/0.98 --bmc1_verbose false 3.10/0.98 --bmc1_dump_clauses_tptp false 3.10/0.98 --bmc1_dump_unsat_core_tptp false 3.10/0.98 --bmc1_dump_file - 3.10/0.98 --bmc1_ucm_expand_uc_limit 128 3.10/0.98 --bmc1_ucm_n_expand_iterations 6 3.10/0.98 --bmc1_ucm_extend_mode 1 3.10/0.98 --bmc1_ucm_init_mode 2 3.10/0.98 --bmc1_ucm_cone_mode none 3.10/0.98 --bmc1_ucm_reduced_relation_type 0 3.10/0.98 --bmc1_ucm_relax_model 4 3.10/0.98 --bmc1_ucm_full_tr_after_sat true 3.10/0.98 --bmc1_ucm_expand_neg_assumptions false 3.10/0.98 --bmc1_ucm_layered_model none 3.10/0.98 --bmc1_ucm_max_lemma_size 10 3.10/0.98 3.10/0.98 ------ AIG Options 3.10/0.98 3.10/0.98 --aig_mode false 3.10/0.98 3.10/0.98 ------ Instantiation Options 3.10/0.98 3.10/0.98 --instantiation_flag true 3.10/0.98 --inst_sos_flag true 3.10/0.98 --inst_sos_phase true 3.10/0.98 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 3.10/0.98 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 3.10/0.98 --inst_lit_sel_side none 3.10/0.98 --inst_solver_per_active 1400 3.10/0.98 --inst_solver_calls_frac 1. 3.10/0.98 --inst_passive_queue_type priority_queues 3.10/0.98 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 3.10/0.98 --inst_passive_queues_freq [25;2] 3.10/0.98 --inst_dismatching true 3.10/0.98 --inst_eager_unprocessed_to_passive true 3.10/0.98 --inst_prop_sim_given true 3.10/0.98 --inst_prop_sim_new false 3.10/0.98 --inst_subs_new false 3.10/0.98 --inst_eq_res_simp false 3.10/0.98 --inst_subs_given false 3.10/0.98 --inst_orphan_elimination true 3.10/0.98 --inst_learning_loop_flag true 3.10/0.98 --inst_learning_start 3000 3.10/0.98 --inst_learning_factor 2 3.10/0.98 --inst_start_prop_sim_after_learn 3 3.10/0.98 --inst_sel_renew solver 3.10/0.98 --inst_lit_activity_flag true 3.10/0.98 --inst_restr_to_given false 3.10/0.98 --inst_activity_threshold 500 3.10/0.98 --inst_out_proof true 3.10/0.98 3.10/0.98 ------ Resolution Options 3.10/0.98 3.10/0.98 --resolution_flag false 3.10/0.98 --res_lit_sel adaptive 3.10/0.98 --res_lit_sel_side none 3.10/0.98 --res_ordering kbo 3.10/0.98 --res_to_prop_solver active 3.10/0.98 --res_prop_simpl_new false 3.10/0.98 --res_prop_simpl_given true 3.10/0.98 --res_passive_queue_type priority_queues 3.10/0.98 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 3.10/0.98 --res_passive_queues_freq [15;5] 3.10/0.98 --res_forward_subs full 3.10/0.98 --res_backward_subs full 3.10/0.98 --res_forward_subs_resolution true 3.10/0.98 --res_backward_subs_resolution true 3.10/0.98 --res_orphan_elimination true 3.10/0.98 --res_time_limit 2. 3.10/0.98 --res_out_proof true 3.10/0.98 3.10/0.98 ------ Superposition Options 3.10/0.98 3.10/0.98 --superposition_flag true 3.10/0.98 --sup_passive_queue_type priority_queues 3.10/0.98 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 3.10/0.98 --sup_passive_queues_freq [8;1;4] 3.10/0.98 --demod_completeness_check fast 3.10/0.98 --demod_use_ground true 3.10/0.98 --sup_to_prop_solver passive 3.10/0.98 --sup_prop_simpl_new true 3.10/0.98 --sup_prop_simpl_given true 3.10/0.98 --sup_fun_splitting true 3.10/0.98 --sup_smt_interval 50000 3.10/0.98 3.10/0.98 ------ Superposition Simplification Setup 3.10/0.98 3.10/0.98 --sup_indices_passive [LightNormIndex;FwDemodIndex] 3.10/0.98 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 3.10/0.98 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 3.10/0.98 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 3.10/0.98 --sup_full_triv [TrivRules;PropSubs] 3.10/0.98 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 3.10/0.98 --sup_full_bw [BwDemod;BwSubsumption] 3.10/0.98 --sup_immed_triv [TrivRules] 3.10/0.98 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 3.10/0.98 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 3.10/0.98 --sup_immed_bw_main [] 3.10/0.98 --sup_immed_bw_immed [BwDemod;BwSubsumption] 3.10/0.98 --sup_input_triv [Unflattening;TrivRules] 3.10/0.98 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 3.10/0.98 --sup_input_bw [] 3.10/0.98 3.10/0.98 ------ Combination Options 3.10/0.98 3.10/0.98 --comb_res_mult 3 3.10/0.98 --comb_sup_mult 2 3.10/0.98 --comb_inst_mult 10 3.10/0.98 3.10/0.98 ------ Debug Options 3.10/0.98 3.10/0.98 --dbg_backtrace false 3.10/0.98 --dbg_dump_prop_clauses false 3.10/0.98 --dbg_dump_prop_clauses_file - 3.10/0.98 --dbg_out_stat false 3.10/0.98 3.10/0.98 3.10/0.98 3.10/0.98 3.10/0.98 ------ Proving... 3.10/0.98 3.10/0.98 3.10/0.98 % SZS status Theorem for theBenchmark.p 3.10/0.98 3.10/0.98 % SZS output start CNFRefutation for theBenchmark.p 3.10/0.98 3.10/0.98 fof(f10,axiom,( 3.10/0.98 ! [X0,X1,X5,X6,X4] : ((precedes(X5,X6,X4) & shortest_path(X0,X1,X4)) => (~? [X9] : (tail_of(X5) = tail_of(X9) & head_of(X6) = head_of(X9)) & ~precedes(X6,X5,X4)))), 3.10/0.98 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 3.10/0.98 3.10/0.98 fof(f28,plain,( 3.10/0.98 ! [X0,X1,X2,X3,X4] : ((precedes(X2,X3,X4) & shortest_path(X0,X1,X4)) => (~? [X5] : (tail_of(X2) = tail_of(X5) & head_of(X3) = head_of(X5)) & ~precedes(X3,X2,X4)))), 3.10/0.98 inference(rectify,[],[f10])). 3.10/0.98 3.10/0.98 fof(f50,plain,( 3.10/0.98 ! [X0,X1,X2,X3,X4] : ((! [X5] : (tail_of(X2) != tail_of(X5) | head_of(X3) != head_of(X5)) & ~precedes(X3,X2,X4)) | (~precedes(X2,X3,X4) | ~shortest_path(X0,X1,X4)))), 3.10/0.98 inference(ennf_transformation,[],[f28])). 3.10/0.98 3.10/0.98 fof(f51,plain,( 3.10/0.98 ! [X0,X1,X2,X3,X4] : ((! [X5] : (tail_of(X2) != tail_of(X5) | head_of(X3) != head_of(X5)) & ~precedes(X3,X2,X4)) | ~precedes(X2,X3,X4) | ~shortest_path(X0,X1,X4))), 3.10/0.98 inference(flattening,[],[f50])). 3.10/0.98 3.10/0.98 fof(f122,plain,( 3.10/0.98 ( ! [X4,X2,X0,X5,X3,X1] : (tail_of(X2) != tail_of(X5) | head_of(X3) != head_of(X5) | ~precedes(X2,X3,X4) | ~shortest_path(X0,X1,X4)) )), 3.10/0.98 inference(cnf_transformation,[],[f51])). 3.10/0.98 3.10/0.98 fof(f6,axiom,( 3.10/0.98 ! [X4,X0,X1] : (path(X0,X1,X4) => ! [X5,X6] : ((on_path(X6,X4) & (sequential(X5,X6) | ? [X9] : (sequential(X5,X9) & precedes(X9,X6,X4))) & on_path(X5,X4)) => precedes(X5,X6,X4)))), 3.10/0.98 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 3.10/0.98 3.10/0.98 fof(f24,plain,( 3.10/0.98 ! [X0,X1,X2] : (path(X1,X2,X0) => ! [X3,X4] : ((on_path(X4,X0) & (sequential(X3,X4) | ? [X5] : (sequential(X3,X5) & precedes(X5,X4,X0))) & on_path(X3,X0)) => precedes(X3,X4,X0)))), 3.10/0.98 inference(rectify,[],[f6])). 3.10/0.98 3.10/0.98 fof(f43,plain,( 3.10/0.98 ! [X0,X1,X2] : (! [X3,X4] : (precedes(X3,X4,X0) | (~on_path(X4,X0) | (~sequential(X3,X4) & ! [X5] : (~sequential(X3,X5) | ~precedes(X5,X4,X0))) | ~on_path(X3,X0))) | ~path(X1,X2,X0))), 3.10/0.98 inference(ennf_transformation,[],[f24])). 3.10/0.98 3.10/0.98 fof(f44,plain,( 3.10/0.98 ! [X0,X1,X2] : (! [X3,X4] : (precedes(X3,X4,X0) | ~on_path(X4,X0) | (~sequential(X3,X4) & ! [X5] : (~sequential(X3,X5) | ~precedes(X5,X4,X0))) | ~on_path(X3,X0)) | ~path(X1,X2,X0))), 3.10/0.98 inference(flattening,[],[f43])). 3.10/0.98 3.10/0.98 fof(f110,plain,( 3.10/0.98 ( ! [X4,X2,X0,X3,X1] : (precedes(X3,X4,X0) | ~on_path(X4,X0) | ~sequential(X3,X4) | ~on_path(X3,X0) | ~path(X1,X2,X0)) )), 3.10/0.98 inference(cnf_transformation,[],[f44])). 3.10/0.98 3.10/0.98 fof(f18,conjecture,( 3.10/0.98 ! [X0,X1,X5,X6,X4] : ((precedes(X5,X6,X4) & shortest_path(X0,X1,X4)) => (head_of(X6) != tail_of(X5) & head_of(X5) != head_of(X6) & ~? [X9] : (head_of(X6) = head_of(X9) & tail_of(X5) = tail_of(X9))))), 3.10/0.98 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 3.10/0.98 3.10/0.98 fof(f19,negated_conjecture,( 3.10/0.98 ~! [X0,X1,X5,X6,X4] : ((precedes(X5,X6,X4) & shortest_path(X0,X1,X4)) => (head_of(X6) != tail_of(X5) & head_of(X5) != head_of(X6) & ~? [X9] : (head_of(X6) = head_of(X9) & tail_of(X5) = tail_of(X9))))), 3.10/0.98 inference(negated_conjecture,[],[f18])). 3.10/0.98 3.10/0.98 fof(f36,plain,( 3.10/0.98 ~! [X0,X1,X2,X3,X4] : ((precedes(X2,X3,X4) & shortest_path(X0,X1,X4)) => (head_of(X3) != tail_of(X2) & head_of(X2) != head_of(X3) & ~? [X5] : (head_of(X3) = head_of(X5) & tail_of(X2) = tail_of(X5))))), 3.10/0.98 inference(rectify,[],[f19])). 3.10/0.98 3.10/0.98 fof(f60,plain,( 3.10/0.98 ? [X0,X1,X2,X3,X4] : ((head_of(X3) = tail_of(X2) | head_of(X2) = head_of(X3) | ? [X5] : (head_of(X3) = head_of(X5) & tail_of(X2) = tail_of(X5))) & (precedes(X2,X3,X4) & shortest_path(X0,X1,X4)))), 3.10/0.98 inference(ennf_transformation,[],[f36])). 3.10/0.98 3.10/0.98 fof(f61,plain,( 3.10/0.98 ? [X0,X1,X2,X3,X4] : ((head_of(X3) = tail_of(X2) | head_of(X2) = head_of(X3) | ? [X5] : (head_of(X3) = head_of(X5) & tail_of(X2) = tail_of(X5))) & precedes(X2,X3,X4) & shortest_path(X0,X1,X4))), 3.10/0.98 inference(flattening,[],[f60])). 3.10/0.98 3.10/0.98 fof(f85,plain,( 3.10/0.98 ( ! [X2,X3] : (? [X5] : (head_of(X3) = head_of(X5) & tail_of(X2) = tail_of(X5)) => (head_of(sK12) = head_of(X3) & tail_of(sK12) = tail_of(X2))) )), 3.10/0.98 introduced(choice_axiom,[])). 3.10/0.98 3.10/0.98 fof(f84,plain,( 3.10/0.98 ? [X0,X1,X2,X3,X4] : ((head_of(X3) = tail_of(X2) | head_of(X2) = head_of(X3) | ? [X5] : (head_of(X3) = head_of(X5) & tail_of(X2) = tail_of(X5))) & precedes(X2,X3,X4) & shortest_path(X0,X1,X4)) => ((head_of(sK10) = tail_of(sK9) | head_of(sK9) = head_of(sK10) | ? [X5] : (head_of(sK10) = head_of(X5) & tail_of(sK9) = tail_of(X5))) & precedes(sK9,sK10,sK11) & shortest_path(sK7,sK8,sK11))), 3.10/0.98 introduced(choice_axiom,[])). 3.10/0.98 3.10/0.98 fof(f86,plain,( 3.10/0.98 (head_of(sK10) = tail_of(sK9) | head_of(sK9) = head_of(sK10) | (head_of(sK10) = head_of(sK12) & tail_of(sK9) = tail_of(sK12))) & precedes(sK9,sK10,sK11) & shortest_path(sK7,sK8,sK11)), 3.10/0.98 inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10,sK11,sK12])],[f61,f85,f84])). 3.10/0.98 3.10/0.98 fof(f137,plain,( 3.10/0.98 head_of(sK10) = tail_of(sK9) | head_of(sK9) = head_of(sK10) | head_of(sK10) = head_of(sK12)), 3.10/0.98 inference(cnf_transformation,[],[f86])). 3.10/0.98 3.10/0.98 fof(f3,axiom,( 3.10/0.98 ! [X5,X6] : (sequential(X5,X6) <=> (X5 != X6 & head_of(X5) = tail_of(X6) & edge(X6) & edge(X5)))), 3.10/0.98 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 3.10/0.98 3.10/0.98 fof(f21,plain,( 3.10/0.98 ! [X0,X1] : (sequential(X0,X1) <=> (X0 != X1 & head_of(X0) = tail_of(X1) & edge(X1) & edge(X0)))), 3.10/0.98 inference(rectify,[],[f3])). 3.10/0.98 3.10/0.98 fof(f67,plain,( 3.10/0.98 ! [X0,X1] : ((sequential(X0,X1) | (X0 = X1 | head_of(X0) != tail_of(X1) | ~edge(X1) | ~edge(X0))) & ((X0 != X1 & head_of(X0) = tail_of(X1) & edge(X1) & edge(X0)) | ~sequential(X0,X1)))), 3.10/0.98 inference(nnf_transformation,[],[f21])). 3.10/0.98 3.10/0.98 fof(f68,plain,( 3.10/0.98 ! [X0,X1] : ((sequential(X0,X1) | X0 = X1 | head_of(X0) != tail_of(X1) | ~edge(X1) | ~edge(X0)) & ((X0 != X1 & head_of(X0) = tail_of(X1) & edge(X1) & edge(X0)) | ~sequential(X0,X1)))), 3.10/0.98 inference(flattening,[],[f67])). 3.10/0.98 3.10/0.98 fof(f96,plain,( 3.10/0.98 ( ! [X0,X1] : (sequential(X0,X1) | X0 = X1 | head_of(X0) != tail_of(X1) | ~edge(X1) | ~edge(X0)) )), 3.10/0.98 inference(cnf_transformation,[],[f68])). 3.10/0.98 3.10/0.98 fof(f134,plain,( 3.10/0.98 shortest_path(sK7,sK8,sK11)), 3.10/0.98 inference(cnf_transformation,[],[f86])). 3.10/0.98 3.10/0.98 fof(f135,plain,( 3.10/0.98 precedes(sK9,sK10,sK11)), 3.10/0.98 inference(cnf_transformation,[],[f86])). 3.10/0.98 3.10/0.98 fof(f2,axiom,( 3.10/0.98 ! [X0,X1,X3] : ((! [X4] : (path(X0,X1,X4) => less_or_equal(length_of(X3),length_of(X4))) & X0 != X1 & path(X0,X1,X3)) <=> shortest_path(X0,X1,X3))), 3.10/0.98 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 3.10/0.98 3.10/0.98 fof(f20,plain,( 3.10/0.98 ! [X0,X1,X2] : ((! [X3] : (path(X0,X1,X3) => less_or_equal(length_of(X2),length_of(X3))) & X0 != X1 & path(X0,X1,X2)) <=> shortest_path(X0,X1,X2))), 3.10/0.98 inference(rectify,[],[f2])). 3.10/0.98 3.10/0.98 fof(f39,plain,( 3.10/0.98 ! [X0,X1,X2] : ((! [X3] : (less_or_equal(length_of(X2),length_of(X3)) | ~path(X0,X1,X3)) & X0 != X1 & path(X0,X1,X2)) <=> shortest_path(X0,X1,X2))), 3.10/0.98 inference(ennf_transformation,[],[f20])). 3.10/0.98 3.10/0.98 fof(f62,plain,( 3.10/0.98 ! [X0,X1,X2] : (((! [X3] : (less_or_equal(length_of(X2),length_of(X3)) | ~path(X0,X1,X3)) & X0 != X1 & path(X0,X1,X2)) | ~shortest_path(X0,X1,X2)) & (shortest_path(X0,X1,X2) | (? [X3] : (~less_or_equal(length_of(X2),length_of(X3)) & path(X0,X1,X3)) | X0 = X1 | ~path(X0,X1,X2))))), 3.10/0.98 inference(nnf_transformation,[],[f39])). 3.10/0.98 3.10/0.98 fof(f63,plain,( 3.10/0.98 ! [X0,X1,X2] : (((! [X3] : (less_or_equal(length_of(X2),length_of(X3)) | ~path(X0,X1,X3)) & X0 != X1 & path(X0,X1,X2)) | ~shortest_path(X0,X1,X2)) & (shortest_path(X0,X1,X2) | ? [X3] : (~less_or_equal(length_of(X2),length_of(X3)) & path(X0,X1,X3)) | X0 = X1 | ~path(X0,X1,X2)))), 3.10/0.98 inference(flattening,[],[f62])). 3.10/0.98 3.10/0.98 fof(f64,plain,( 3.10/0.98 ! [X0,X1,X2] : (((! [X3] : (less_or_equal(length_of(X2),length_of(X3)) | ~path(X0,X1,X3)) & X0 != X1 & path(X0,X1,X2)) | ~shortest_path(X0,X1,X2)) & (shortest_path(X0,X1,X2) | ? [X4] : (~less_or_equal(length_of(X2),length_of(X4)) & path(X0,X1,X4)) | X0 = X1 | ~path(X0,X1,X2)))), 3.10/0.98 inference(rectify,[],[f63])). 3.10/0.98 3.10/0.98 fof(f65,plain,( 3.10/0.98 ! [X2,X1,X0] : (? [X4] : (~less_or_equal(length_of(X2),length_of(X4)) & path(X0,X1,X4)) => (~less_or_equal(length_of(X2),length_of(sK0(X0,X1,X2))) & path(X0,X1,sK0(X0,X1,X2))))), 3.10/0.98 introduced(choice_axiom,[])). 3.10/0.98 3.10/0.98 fof(f66,plain,( 3.10/0.98 ! [X0,X1,X2] : (((! [X3] : (less_or_equal(length_of(X2),length_of(X3)) | ~path(X0,X1,X3)) & X0 != X1 & path(X0,X1,X2)) | ~shortest_path(X0,X1,X2)) & (shortest_path(X0,X1,X2) | (~less_or_equal(length_of(X2),length_of(sK0(X0,X1,X2))) & path(X0,X1,sK0(X0,X1,X2))) | X0 = X1 | ~path(X0,X1,X2)))), 3.10/0.98 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f64,f65])). 3.10/0.98 3.10/0.98 fof(f89,plain,( 3.10/0.98 ( ! [X2,X0,X1] : (path(X0,X1,X2) | ~shortest_path(X0,X1,X2)) )), 3.10/0.98 inference(cnf_transformation,[],[f66])). 3.10/0.98 3.10/0.98 fof(f7,axiom,( 3.10/0.98 ! [X4,X0,X1] : (path(X0,X1,X4) => ! [X5,X6] : (precedes(X5,X6,X4) => ((? [X9] : (sequential(X5,X9) & precedes(X9,X6,X4)) <~> sequential(X5,X6)) & on_path(X5,X4) & on_path(X6,X4))))), 3.10/0.98 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 3.10/0.98 3.10/0.98 fof(f25,plain,( 3.10/0.98 ! [X0,X1,X2] : (path(X1,X2,X0) => ! [X3,X4] : (precedes(X3,X4,X0) => ((? [X5] : (sequential(X3,X5) & precedes(X5,X4,X0)) <~> sequential(X3,X4)) & on_path(X3,X0) & on_path(X4,X0))))), 3.10/0.98 inference(rectify,[],[f7])). 3.10/0.98 3.10/0.98 fof(f45,plain,( 3.10/0.98 ! [X0,X1,X2] : (! [X3,X4] : (((? [X5] : (sequential(X3,X5) & precedes(X5,X4,X0)) <~> sequential(X3,X4)) & on_path(X3,X0) & on_path(X4,X0)) | ~precedes(X3,X4,X0)) | ~path(X1,X2,X0))), 3.10/0.98 inference(ennf_transformation,[],[f25])). 3.10/0.98 3.10/0.98 fof(f77,plain,( 3.10/0.98 ! [X0,X1,X2] : (! [X3,X4] : ((((~sequential(X3,X4) | ! [X5] : (~sequential(X3,X5) | ~precedes(X5,X4,X0))) & (sequential(X3,X4) | ? [X5] : (sequential(X3,X5) & precedes(X5,X4,X0)))) & on_path(X3,X0) & on_path(X4,X0)) | ~precedes(X3,X4,X0)) | ~path(X1,X2,X0))), 3.10/0.98 inference(nnf_transformation,[],[f45])). 3.10/0.98 3.10/0.98 fof(f78,plain,( 3.10/0.98 ! [X0,X1,X2] : (! [X3,X4] : (((~sequential(X3,X4) | ! [X5] : (~sequential(X3,X5) | ~precedes(X5,X4,X0))) & (sequential(X3,X4) | ? [X5] : (sequential(X3,X5) & precedes(X5,X4,X0))) & on_path(X3,X0) & on_path(X4,X0)) | ~precedes(X3,X4,X0)) | ~path(X1,X2,X0))), 3.10/0.98 inference(flattening,[],[f77])). 3.10/0.98 3.10/0.98 fof(f79,plain,( 3.10/0.98 ! [X0,X1,X2] : (! [X3,X4] : (((~sequential(X3,X4) | ! [X5] : (~sequential(X3,X5) | ~precedes(X5,X4,X0))) & (sequential(X3,X4) | ? [X6] : (sequential(X3,X6) & precedes(X6,X4,X0))) & on_path(X3,X0) & on_path(X4,X0)) | ~precedes(X3,X4,X0)) | ~path(X1,X2,X0))), 3.10/0.98 inference(rectify,[],[f78])). 3.10/0.98 3.10/0.98 fof(f80,plain,( 3.10/0.98 ! [X4,X3,X0] : (? [X6] : (sequential(X3,X6) & precedes(X6,X4,X0)) => (sequential(X3,sK4(X0,X3,X4)) & precedes(sK4(X0,X3,X4),X4,X0)))), 3.10/0.98 introduced(choice_axiom,[])). 3.10/0.98 3.10/0.98 fof(f81,plain,( 3.10/0.98 ! [X0,X1,X2] : (! [X3,X4] : (((~sequential(X3,X4) | ! [X5] : (~sequential(X3,X5) | ~precedes(X5,X4,X0))) & (sequential(X3,X4) | (sequential(X3,sK4(X0,X3,X4)) & precedes(sK4(X0,X3,X4),X4,X0))) & on_path(X3,X0) & on_path(X4,X0)) | ~precedes(X3,X4,X0)) | ~path(X1,X2,X0))), 3.10/0.98 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f79,f80])). 3.10/0.98 3.10/0.98 fof(f112,plain,( 3.10/0.98 ( ! [X4,X2,X0,X3,X1] : (on_path(X3,X0) | ~precedes(X3,X4,X0) | ~path(X1,X2,X0)) )), 3.10/0.98 inference(cnf_transformation,[],[f81])). 3.10/0.98 3.10/0.98 fof(f9,axiom,( 3.10/0.98 ! [X0,X1,X4,X2] : ((on_path(X2,X4) & path(X0,X1,X4)) => (in_path(tail_of(X2),X4) & edge(X2) & in_path(head_of(X2),X4)))), 3.10/0.98 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 3.10/0.98 3.10/0.98 fof(f27,plain,( 3.10/0.98 ! [X0,X1,X2,X3] : ((on_path(X3,X2) & path(X0,X1,X2)) => (in_path(tail_of(X3),X2) & edge(X3) & in_path(head_of(X3),X2)))), 3.10/0.98 inference(rectify,[],[f9])). 3.10/0.98 3.10/0.98 fof(f48,plain,( 3.10/0.98 ! [X0,X1,X2,X3] : ((in_path(tail_of(X3),X2) & edge(X3) & in_path(head_of(X3),X2)) | (~on_path(X3,X2) | ~path(X0,X1,X2)))), 3.10/0.98 inference(ennf_transformation,[],[f27])). 3.10/0.98 3.10/0.98 fof(f49,plain,( 3.10/0.98 ! [X0,X1,X2,X3] : ((in_path(tail_of(X3),X2) & edge(X3) & in_path(head_of(X3),X2)) | ~on_path(X3,X2) | ~path(X0,X1,X2))), 3.10/0.98 inference(flattening,[],[f48])). 3.10/0.98 3.10/0.98 fof(f119,plain,( 3.10/0.98 ( ! [X2,X0,X3,X1] : (edge(X3) | ~on_path(X3,X2) | ~path(X0,X1,X2)) )), 3.10/0.98 inference(cnf_transformation,[],[f49])). 3.10/0.98 3.10/0.98 fof(f111,plain,( 3.10/0.98 ( ! [X4,X2,X0,X3,X1] : (on_path(X4,X0) | ~precedes(X3,X4,X0) | ~path(X1,X2,X0)) )), 3.10/0.98 inference(cnf_transformation,[],[f81])). 3.10/0.98 3.10/0.98 fof(f121,plain,( 3.10/0.98 ( ! [X4,X2,X0,X3,X1] : (~precedes(X3,X2,X4) | ~precedes(X2,X3,X4) | ~shortest_path(X0,X1,X4)) )), 3.10/0.98 inference(cnf_transformation,[],[f51])). 3.10/0.98 3.10/0.98 fof(f136,plain,( 3.10/0.98 head_of(sK10) = tail_of(sK9) | head_of(sK9) = head_of(sK10) | tail_of(sK9) = tail_of(sK12)), 3.10/0.98 inference(cnf_transformation,[],[f86])). 3.10/0.98 3.10/0.98 cnf(c_34,plain, 3.10/0.98 ( ~ precedes(X0,X1,X2) 3.10/0.98 | ~ shortest_path(X3,X4,X2) 3.10/0.98 | tail_of(X5) != tail_of(X0) 3.10/0.98 | head_of(X5) != head_of(X1) ), 3.10/0.98 inference(cnf_transformation,[],[f122]) ). 3.10/0.98 3.10/0.98 cnf(c_1965,plain, 3.10/0.98 ( ~ precedes(X0_65,X1_65,X0_64) 3.10/0.98 | ~ shortest_path(X0_63,X1_63,X0_64) 3.10/0.98 | tail_of(X2_65) != tail_of(X0_65) 3.10/0.98 | head_of(X2_65) != head_of(X1_65) ), 3.10/0.98 inference(subtyping,[status(esa)],[c_34]) ). 3.10/0.98 3.10/0.98 cnf(c_2962,plain, 3.10/0.98 ( ~ precedes(X0_65,X1_65,sK11) 3.10/0.98 | ~ shortest_path(sK7,sK8,sK11) 3.10/0.98 | tail_of(X2_65) != tail_of(X0_65) 3.10/0.98 | head_of(X2_65) != head_of(X1_65) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_1965]) ). 3.10/0.98 3.10/0.98 cnf(c_3089,plain, 3.10/0.98 ( ~ precedes(sK9,sK10,sK11) 3.10/0.98 | ~ shortest_path(sK7,sK8,sK11) 3.10/0.98 | tail_of(X0_65) != tail_of(sK9) 3.10/0.98 | head_of(X0_65) != head_of(sK10) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_2962]) ). 3.10/0.98 3.10/0.98 cnf(c_8357,plain, 3.10/0.98 ( ~ precedes(sK9,sK10,sK11) 3.10/0.98 | ~ shortest_path(sK7,sK8,sK11) 3.10/0.98 | tail_of(sK12) != tail_of(sK9) 3.10/0.98 | head_of(sK12) != head_of(sK10) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3089]) ). 3.10/0.98 3.10/0.98 cnf(c_22,plain, 3.10/0.98 ( precedes(X0,X1,X2) 3.10/0.98 | ~ path(X3,X4,X2) 3.10/0.98 | ~ on_path(X1,X2) 3.10/0.98 | ~ on_path(X0,X2) 3.10/0.98 | ~ sequential(X0,X1) ), 3.10/0.98 inference(cnf_transformation,[],[f110]) ). 3.10/0.98 3.10/0.98 cnf(c_1975,plain, 3.10/0.98 ( precedes(X0_65,X1_65,X0_64) 3.10/0.98 | ~ path(X0_63,X1_63,X0_64) 3.10/0.98 | ~ on_path(X0_65,X0_64) 3.10/0.98 | ~ on_path(X1_65,X0_64) 3.10/0.98 | ~ sequential(X0_65,X1_65) ), 3.10/0.98 inference(subtyping,[status(esa)],[c_22]) ). 3.10/0.98 3.10/0.98 cnf(c_2995,plain, 3.10/0.98 ( precedes(sK10,sK9,sK11) 3.10/0.98 | ~ path(X0_63,X1_63,sK11) 3.10/0.98 | ~ on_path(sK9,sK11) 3.10/0.98 | ~ on_path(sK10,sK11) 3.10/0.98 | ~ sequential(sK10,sK9) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_1975]) ). 3.10/0.98 3.10/0.98 cnf(c_6267,plain, 3.10/0.98 ( precedes(sK10,sK9,sK11) 3.10/0.98 | ~ path(sK7,sK8,sK11) 3.10/0.98 | ~ on_path(sK9,sK11) 3.10/0.98 | ~ on_path(sK10,sK11) 3.10/0.98 | ~ sequential(sK10,sK9) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_2995]) ). 3.10/0.98 3.10/0.98 cnf(c_47,negated_conjecture, 3.10/0.98 ( head_of(sK9) = head_of(sK10) 3.10/0.98 | head_of(sK10) = tail_of(sK9) 3.10/0.98 | head_of(sK10) = head_of(sK12) ), 3.10/0.98 inference(cnf_transformation,[],[f137]) ). 3.10/0.98 3.10/0.98 cnf(c_1954,negated_conjecture, 3.10/0.98 ( head_of(sK9) = head_of(sK10) 3.10/0.98 | head_of(sK10) = tail_of(sK9) 3.10/0.98 | head_of(sK10) = head_of(sK12) ), 3.10/0.98 inference(subtyping,[status(esa)],[c_47]) ). 3.10/0.98 3.10/0.98 cnf(c_5,plain, 3.10/0.98 ( sequential(X0,X1) 3.10/0.98 | ~ edge(X1) 3.10/0.98 | ~ edge(X0) 3.10/0.98 | X1 = X0 3.10/0.98 | tail_of(X1) != head_of(X0) ), 3.10/0.98 inference(cnf_transformation,[],[f96]) ). 3.10/0.98 3.10/0.98 cnf(c_1992,plain, 3.10/0.98 ( sequential(X0_65,X1_65) 3.10/0.98 | ~ edge(X0_65) 3.10/0.98 | ~ edge(X1_65) 3.10/0.98 | X1_65 = X0_65 3.10/0.98 | tail_of(X1_65) != head_of(X0_65) ), 3.10/0.98 inference(subtyping,[status(esa)],[c_5]) ). 3.10/0.98 3.10/0.98 cnf(c_2869,plain, 3.10/0.98 ( X0_65 = X1_65 3.10/0.98 | tail_of(X0_65) != head_of(X1_65) 3.10/0.98 | sequential(X1_65,X0_65) = iProver_top 3.10/0.98 | edge(X0_65) != iProver_top 3.10/0.98 | edge(X1_65) != iProver_top ), 3.10/0.98 inference(predicate_to_equality,[status(thm)],[c_1992]) ). 3.10/0.98 3.10/0.98 cnf(c_5579,plain, 3.10/0.98 ( sK9 = X0_65 3.10/0.98 | head_of(X0_65) != head_of(sK10) 3.10/0.98 | head_of(sK12) = head_of(sK10) 3.10/0.98 | head_of(sK9) = head_of(sK10) 3.10/0.98 | sequential(X0_65,sK9) = iProver_top 3.10/0.98 | edge(X0_65) != iProver_top 3.10/0.98 | edge(sK9) != iProver_top ), 3.10/0.98 inference(superposition,[status(thm)],[c_1954,c_2869]) ). 3.10/0.98 3.10/0.98 cnf(c_50,negated_conjecture, 3.10/0.98 ( shortest_path(sK7,sK8,sK11) ), 3.10/0.98 inference(cnf_transformation,[],[f134]) ). 3.10/0.98 3.10/0.98 cnf(c_49,negated_conjecture, 3.10/0.98 ( precedes(sK9,sK10,sK11) ), 3.10/0.98 inference(cnf_transformation,[],[f135]) ). 3.10/0.98 3.10/0.98 cnf(c_1999,plain,( X0_63 = X0_63 ),theory(equality) ). 3.10/0.98 3.10/0.98 cnf(c_3136,plain, 3.10/0.98 ( tail_of(sK9) = tail_of(sK9) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_1999]) ). 3.10/0.98 3.10/0.98 cnf(c_3225,plain, 3.10/0.98 ( ~ precedes(sK9,sK10,sK11) 3.10/0.98 | ~ shortest_path(sK7,sK8,sK11) 3.10/0.98 | tail_of(sK9) != tail_of(sK9) 3.10/0.98 | head_of(sK9) != head_of(sK10) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3089]) ). 3.10/0.98 3.10/0.98 cnf(c_1952,negated_conjecture, 3.10/0.98 ( precedes(sK9,sK10,sK11) ), 3.10/0.98 inference(subtyping,[status(esa)],[c_49]) ). 3.10/0.98 3.10/0.98 cnf(c_2907,plain, 3.10/0.98 ( precedes(sK9,sK10,sK11) = iProver_top ), 3.10/0.98 inference(predicate_to_equality,[status(thm)],[c_1952]) ). 3.10/0.98 3.10/0.98 cnf(c_1951,negated_conjecture, 3.10/0.98 ( shortest_path(sK7,sK8,sK11) ), 3.10/0.98 inference(subtyping,[status(esa)],[c_50]) ). 3.10/0.98 3.10/0.98 cnf(c_2908,plain, 3.10/0.98 ( shortest_path(sK7,sK8,sK11) = iProver_top ), 3.10/0.98 inference(predicate_to_equality,[status(thm)],[c_1951]) ). 3.10/0.98 3.10/0.98 cnf(c_2,plain, 3.10/0.98 ( ~ shortest_path(X0,X1,X2) | path(X0,X1,X2) ), 3.10/0.98 inference(cnf_transformation,[],[f89]) ). 3.10/0.98 3.10/0.98 cnf(c_1995,plain, 3.10/0.98 ( ~ shortest_path(X0_63,X1_63,X0_64) | path(X0_63,X1_63,X0_64) ), 3.10/0.98 inference(subtyping,[status(esa)],[c_2]) ). 3.10/0.98 3.10/0.98 cnf(c_2866,plain, 3.10/0.98 ( shortest_path(X0_63,X1_63,X0_64) != iProver_top 3.10/0.98 | path(X0_63,X1_63,X0_64) = iProver_top ), 3.10/0.98 inference(predicate_to_equality,[status(thm)],[c_1995]) ). 3.10/0.98 3.10/0.98 cnf(c_3994,plain, 3.10/0.98 ( path(sK7,sK8,sK11) = iProver_top ), 3.10/0.98 inference(superposition,[status(thm)],[c_2908,c_2866]) ). 3.10/0.98 3.10/0.98 cnf(c_27,plain, 3.10/0.98 ( ~ precedes(X0,X1,X2) | ~ path(X3,X4,X2) | on_path(X0,X2) ), 3.10/0.98 inference(cnf_transformation,[],[f112]) ). 3.10/0.98 3.10/0.98 cnf(c_1970,plain, 3.10/0.98 ( ~ precedes(X0_65,X1_65,X0_64) 3.10/0.98 | ~ path(X0_63,X1_63,X0_64) 3.10/0.98 | on_path(X0_65,X0_64) ), 3.10/0.98 inference(subtyping,[status(esa)],[c_27]) ). 3.10/0.98 3.10/0.98 cnf(c_2891,plain, 3.10/0.98 ( precedes(X0_65,X1_65,X0_64) != iProver_top 3.10/0.98 | path(X0_63,X1_63,X0_64) != iProver_top 3.10/0.98 | on_path(X0_65,X0_64) = iProver_top ), 3.10/0.98 inference(predicate_to_equality,[status(thm)],[c_1970]) ). 3.10/0.98 3.10/0.98 cnf(c_4565,plain, 3.10/0.98 ( precedes(X0_65,X1_65,sK11) != iProver_top 3.10/0.98 | on_path(X0_65,sK11) = iProver_top ), 3.10/0.98 inference(superposition,[status(thm)],[c_3994,c_2891]) ). 3.10/0.98 3.10/0.98 cnf(c_4727,plain, 3.10/0.98 ( on_path(sK9,sK11) = iProver_top ), 3.10/0.98 inference(superposition,[status(thm)],[c_2907,c_4565]) ). 3.10/0.98 3.10/0.98 cnf(c_32,plain, 3.10/0.98 ( ~ path(X0,X1,X2) | ~ on_path(X3,X2) | edge(X3) ), 3.10/0.98 inference(cnf_transformation,[],[f119]) ). 3.10/0.98 3.10/0.98 cnf(c_1967,plain, 3.10/0.98 ( ~ path(X0_63,X1_63,X0_64) 3.10/0.98 | ~ on_path(X0_65,X0_64) 3.10/0.98 | edge(X0_65) ), 3.10/0.98 inference(subtyping,[status(esa)],[c_32]) ). 3.10/0.98 3.10/0.98 cnf(c_2894,plain, 3.10/0.98 ( path(X0_63,X1_63,X0_64) != iProver_top 3.10/0.98 | on_path(X0_65,X0_64) != iProver_top 3.10/0.98 | edge(X0_65) = iProver_top ), 3.10/0.98 inference(predicate_to_equality,[status(thm)],[c_1967]) ). 3.10/0.98 3.10/0.98 cnf(c_4518,plain, 3.10/0.98 ( on_path(X0_65,sK11) != iProver_top | edge(X0_65) = iProver_top ), 3.10/0.98 inference(superposition,[status(thm)],[c_3994,c_2894]) ). 3.10/0.98 3.10/0.98 cnf(c_4730,plain, 3.10/0.98 ( edge(sK9) = iProver_top ), 3.10/0.98 inference(superposition,[status(thm)],[c_4727,c_4518]) ). 3.10/0.98 3.10/0.98 cnf(c_5896,plain, 3.10/0.98 ( edge(X0_65) != iProver_top 3.10/0.98 | sequential(X0_65,sK9) = iProver_top 3.10/0.98 | sK9 = X0_65 3.10/0.98 | head_of(X0_65) != head_of(sK10) 3.10/0.98 | head_of(sK12) = head_of(sK10) ), 3.10/0.98 inference(global_propositional_subsumption, 3.10/0.98 [status(thm)], 3.10/0.98 [c_5579,c_50,c_49,c_3136,c_3225,c_4730]) ). 3.10/0.98 3.10/0.98 cnf(c_5897,plain, 3.10/0.98 ( sK9 = X0_65 3.10/0.98 | head_of(X0_65) != head_of(sK10) 3.10/0.98 | head_of(sK12) = head_of(sK10) 3.10/0.98 | sequential(X0_65,sK9) = iProver_top 3.10/0.98 | edge(X0_65) != iProver_top ), 3.10/0.98 inference(renaming,[status(thm)],[c_5896]) ). 3.10/0.98 3.10/0.98 cnf(c_5902,plain, 3.10/0.98 ( sK9 = sK10 3.10/0.98 | head_of(sK12) = head_of(sK10) 3.10/0.98 | sequential(sK10,sK9) = iProver_top 3.10/0.98 | edge(sK10) != iProver_top ), 3.10/0.98 inference(equality_resolution,[status(thm)],[c_5897]) ). 3.10/0.98 3.10/0.98 cnf(c_5903,plain, 3.10/0.98 ( sequential(sK10,sK9) 3.10/0.98 | ~ edge(sK10) 3.10/0.98 | sK9 = sK10 3.10/0.98 | head_of(sK12) = head_of(sK10) ), 3.10/0.98 inference(predicate_to_equality_rev,[status(thm)],[c_5902]) ). 3.10/0.98 3.10/0.98 cnf(c_5303,plain, 3.10/0.98 ( tail_of(sK12) = tail_of(sK12) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_1999]) ). 3.10/0.98 3.10/0.98 cnf(c_4731,plain, 3.10/0.98 ( edge(sK9) ), 3.10/0.98 inference(predicate_to_equality_rev,[status(thm)],[c_4730]) ). 3.10/0.98 3.10/0.98 cnf(c_4519,plain, 3.10/0.98 ( ~ on_path(X0_65,sK11) | edge(X0_65) ), 3.10/0.98 inference(predicate_to_equality_rev,[status(thm)],[c_4518]) ). 3.10/0.98 3.10/0.98 cnf(c_4521,plain, 3.10/0.98 ( ~ on_path(sK10,sK11) | edge(sK10) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_4519]) ). 3.10/0.98 3.10/0.98 cnf(c_2003,plain, 3.10/0.98 ( X0_63 != X1_63 | X2_63 != X1_63 | X2_63 = X0_63 ), 3.10/0.98 theory(equality) ). 3.10/0.98 3.10/0.98 cnf(c_3052,plain, 3.10/0.98 ( tail_of(X0_65) != X0_63 3.10/0.98 | tail_of(X0_65) = tail_of(sK9) 3.10/0.98 | tail_of(sK9) != X0_63 ), 3.10/0.98 inference(instantiation,[status(thm)],[c_2003]) ). 3.10/0.98 3.10/0.98 cnf(c_3179,plain, 3.10/0.98 ( tail_of(X0_65) != tail_of(X1_65) 3.10/0.98 | tail_of(X0_65) = tail_of(sK9) 3.10/0.98 | tail_of(sK9) != tail_of(X1_65) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3052]) ). 3.10/0.98 3.10/0.98 cnf(c_4057,plain, 3.10/0.98 ( tail_of(X0_65) != tail_of(sK12) 3.10/0.98 | tail_of(X0_65) = tail_of(sK9) 3.10/0.98 | tail_of(sK9) != tail_of(sK12) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3179]) ). 3.10/0.98 3.10/0.98 cnf(c_4324,plain, 3.10/0.98 ( tail_of(sK12) != tail_of(sK12) 3.10/0.98 | tail_of(sK12) = tail_of(sK9) 3.10/0.98 | tail_of(sK9) != tail_of(sK12) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_4057]) ). 3.10/0.98 3.10/0.98 cnf(c_28,plain, 3.10/0.98 ( ~ precedes(X0,X1,X2) | ~ path(X3,X4,X2) | on_path(X1,X2) ), 3.10/0.98 inference(cnf_transformation,[],[f111]) ). 3.10/0.98 3.10/0.98 cnf(c_1969,plain, 3.10/0.98 ( ~ precedes(X0_65,X1_65,X0_64) 3.10/0.98 | ~ path(X0_63,X1_63,X0_64) 3.10/0.98 | on_path(X1_65,X0_64) ), 3.10/0.98 inference(subtyping,[status(esa)],[c_28]) ). 3.10/0.98 3.10/0.98 cnf(c_3150,plain, 3.10/0.98 ( ~ precedes(X0_65,sK10,sK11) 3.10/0.98 | ~ path(X0_63,X1_63,sK11) 3.10/0.98 | on_path(sK10,sK11) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_1969]) ). 3.10/0.98 3.10/0.98 cnf(c_3464,plain, 3.10/0.98 ( ~ precedes(sK9,sK10,sK11) 3.10/0.98 | ~ path(X0_63,X1_63,sK11) 3.10/0.98 | on_path(sK10,sK11) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3150]) ). 3.10/0.98 3.10/0.98 cnf(c_4073,plain, 3.10/0.98 ( ~ precedes(sK9,sK10,sK11) 3.10/0.98 | ~ path(sK7,sK8,sK11) 3.10/0.98 | on_path(sK10,sK11) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3464]) ). 3.10/0.98 3.10/0.98 cnf(c_3119,plain, 3.10/0.98 ( ~ precedes(sK9,X0_65,sK11) 3.10/0.98 | ~ path(X0_63,X1_63,sK11) 3.10/0.98 | on_path(sK9,sK11) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_1970]) ). 3.10/0.98 3.10/0.98 cnf(c_4075,plain, 3.10/0.98 ( ~ precedes(sK9,X0_65,sK11) 3.10/0.98 | ~ path(sK7,sK8,sK11) 3.10/0.98 | on_path(sK9,sK11) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3119]) ). 3.10/0.98 3.10/0.98 cnf(c_4077,plain, 3.10/0.98 ( ~ precedes(sK9,sK10,sK11) 3.10/0.98 | ~ path(sK7,sK8,sK11) 3.10/0.98 | on_path(sK9,sK11) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_4075]) ). 3.10/0.98 3.10/0.98 cnf(c_3178,plain, 3.10/0.98 ( X0_63 != X1_63 | tail_of(sK9) != X1_63 | tail_of(sK9) = X0_63 ), 3.10/0.98 inference(instantiation,[status(thm)],[c_2003]) ). 3.10/0.98 3.10/0.98 cnf(c_3514,plain, 3.10/0.98 ( X0_63 != tail_of(sK9) 3.10/0.98 | tail_of(sK9) = X0_63 3.10/0.98 | tail_of(sK9) != tail_of(sK9) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3178]) ). 3.10/0.98 3.10/0.98 cnf(c_3996,plain, 3.10/0.98 ( tail_of(sK9) != tail_of(sK9) 3.10/0.98 | tail_of(sK9) = head_of(sK10) 3.10/0.98 | head_of(sK10) != tail_of(sK9) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3514]) ). 3.10/0.98 3.10/0.98 cnf(c_3181,plain, 3.10/0.98 ( sequential(X0_65,sK9) 3.10/0.98 | ~ edge(X0_65) 3.10/0.98 | ~ edge(sK9) 3.10/0.98 | sK9 = X0_65 3.10/0.98 | tail_of(sK9) != head_of(X0_65) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_1992]) ). 3.10/0.98 3.10/0.98 cnf(c_3183,plain, 3.10/0.98 ( sequential(sK10,sK9) 3.10/0.98 | ~ edge(sK9) 3.10/0.98 | ~ edge(sK10) 3.10/0.98 | sK9 = sK10 3.10/0.98 | tail_of(sK9) != head_of(sK10) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3181]) ). 3.10/0.98 3.10/0.98 cnf(c_2005,plain, 3.10/0.98 ( X0_65 != X1_65 | X2_65 != X1_65 | X2_65 = X0_65 ), 3.10/0.98 theory(equality) ). 3.10/0.98 3.10/0.98 cnf(c_3145,plain, 3.10/0.98 ( X0_65 != X1_65 | X0_65 = sK9 | sK9 != X1_65 ), 3.10/0.98 inference(instantiation,[status(thm)],[c_2005]) ). 3.10/0.98 3.10/0.98 cnf(c_3146,plain, 3.10/0.98 ( sK9 != sK10 | sK10 = sK9 | sK10 != sK10 ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3145]) ). 3.10/0.98 3.10/0.98 cnf(c_3091,plain, 3.10/0.98 ( ~ precedes(sK9,sK10,sK11) 3.10/0.98 | ~ shortest_path(sK7,sK8,sK11) 3.10/0.98 | tail_of(sK10) != tail_of(sK9) 3.10/0.98 | head_of(sK10) != head_of(sK10) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3089]) ). 3.10/0.98 3.10/0.98 cnf(c_2013,plain, 3.10/0.98 ( X0_65 != X1_65 | tail_of(X0_65) = tail_of(X1_65) ), 3.10/0.98 theory(equality) ). 3.10/0.98 3.10/0.98 cnf(c_3054,plain, 3.10/0.98 ( X0_65 != sK9 | tail_of(X0_65) = tail_of(sK9) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_2013]) ). 3.10/0.98 3.10/0.98 cnf(c_3055,plain, 3.10/0.98 ( sK10 != sK9 | tail_of(sK10) = tail_of(sK9) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_3054]) ). 3.10/0.98 3.10/0.98 cnf(c_35,plain, 3.10/0.98 ( ~ precedes(X0,X1,X2) 3.10/0.98 | ~ precedes(X1,X0,X2) 3.10/0.98 | ~ shortest_path(X3,X4,X2) ), 3.10/0.98 inference(cnf_transformation,[],[f121]) ). 3.10/0.98 3.10/0.98 cnf(c_1964,plain, 3.10/0.98 ( ~ precedes(X0_65,X1_65,X0_64) 3.10/0.98 | ~ precedes(X1_65,X0_65,X0_64) 3.10/0.98 | ~ shortest_path(X0_63,X1_63,X0_64) ), 3.10/0.98 inference(subtyping,[status(esa)],[c_35]) ). 3.10/0.98 3.10/0.98 cnf(c_2963,plain, 3.10/0.98 ( ~ precedes(X0_65,X1_65,sK11) 3.10/0.98 | ~ precedes(X1_65,X0_65,sK11) 3.10/0.98 | ~ shortest_path(sK7,sK8,sK11) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_1964]) ). 3.10/0.98 3.10/0.98 cnf(c_3008,plain, 3.10/0.98 ( ~ precedes(sK9,sK10,sK11) 3.10/0.98 | ~ precedes(sK10,sK9,sK11) 3.10/0.98 | ~ shortest_path(sK7,sK8,sK11) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_2963]) ). 3.10/0.98 3.10/0.98 cnf(c_48,negated_conjecture, 3.10/0.98 ( tail_of(sK9) = tail_of(sK12) 3.10/0.98 | head_of(sK9) = head_of(sK10) 3.10/0.98 | head_of(sK10) = tail_of(sK9) ), 3.10/0.98 inference(cnf_transformation,[],[f136]) ). 3.10/0.98 3.10/0.98 cnf(c_1953,negated_conjecture, 3.10/0.98 ( tail_of(sK9) = tail_of(sK12) 3.10/0.98 | head_of(sK9) = head_of(sK10) 3.10/0.98 | head_of(sK10) = tail_of(sK9) ), 3.10/0.98 inference(subtyping,[status(esa)],[c_48]) ). 3.10/0.98 3.10/0.98 cnf(c_2001,plain,( X0_65 = X0_65 ),theory(equality) ). 3.10/0.98 3.10/0.98 cnf(c_2040,plain, 3.10/0.98 ( sK10 = sK10 ), 3.10/0.98 inference(instantiation,[status(thm)],[c_2001]) ). 3.10/0.98 3.10/0.98 cnf(c_2012,plain, 3.10/0.98 ( X0_65 != X1_65 | head_of(X0_65) = head_of(X1_65) ), 3.10/0.98 theory(equality) ). 3.10/0.98 3.10/0.98 cnf(c_2027,plain, 3.10/0.98 ( sK10 != sK10 | head_of(sK10) = head_of(sK10) ), 3.10/0.98 inference(instantiation,[status(thm)],[c_2012]) ). 3.10/0.98 3.10/0.98 cnf(c_1043,plain, 3.10/0.98 ( path(X0,X1,X2) | sK8 != X1 | sK7 != X0 | sK11 != X2 ), 3.10/0.98 inference(resolution_lifted,[status(thm)],[c_2,c_50]) ). 3.10/0.98 3.10/0.98 cnf(c_1044,plain, 3.10/0.98 ( path(sK7,sK8,sK11) ), 3.10/0.98 inference(unflattening,[status(thm)],[c_1043]) ). 3.10/0.98 3.10/0.98 cnf(contradiction,plain, 3.10/0.98 ( $false ), 3.10/0.98 inference(minisat, 3.10/0.98 [status(thm)], 3.10/0.98 [c_8357,c_6267,c_5903,c_5303,c_4731,c_4521,c_4324,c_4073, 3.10/0.98 c_4077,c_3996,c_3225,c_3183,c_3146,c_3136,c_3091,c_3055, 3.10/0.98 c_3008,c_1953,c_2040,c_2027,c_1044,c_49,c_50]) ). 3.10/0.98 3.10/0.98 3.10/0.98 % SZS output end CNFRefutation for theBenchmark.p 3.10/0.98 3.10/0.98 ------ Statistics 3.10/0.98 3.10/0.98 ------ General 3.10/0.98 3.10/0.98 abstr_ref_over_cycles: 0 3.10/0.98 abstr_ref_under_cycles: 0 3.10/0.98 gc_basic_clause_elim: 0 3.10/0.98 forced_gc_time: 0 3.10/0.98 parsing_time: 0.015 3.10/0.98 unif_index_cands_time: 0. 3.10/0.98 unif_index_add_time: 0. 3.10/0.98 orderings_time: 0. 3.10/0.98 out_proof_time: 0.011 3.10/0.98 total_time: 0.24 3.10/0.98 num_of_symbols: 69 3.10/0.98 num_of_terms: 8506 3.10/0.98 3.10/0.98 ------ Preprocessing 3.10/0.98 3.10/0.98 num_of_splits: 0 3.10/0.98 num_of_split_atoms: 0 3.10/0.98 num_of_reused_defs: 0 3.10/0.98 num_eq_ax_congr_red: 57 3.10/0.98 num_of_sem_filtered_clauses: 1 3.10/0.98 num_of_subtypes: 6 3.10/0.98 monotx_restored_types: 1 3.10/0.98 sat_num_of_epr_types: 0 3.10/0.98 sat_num_of_non_cyclic_types: 0 3.10/0.98 sat_guarded_non_collapsed_types: 1 3.10/0.98 num_pure_diseq_elim: 0 3.10/0.98 simp_replaced_by: 0 3.10/0.98 res_preprocessed: 248 3.10/0.98 prep_upred: 0 3.10/0.98 prep_unflattend: 99 3.10/0.98 smt_new_axioms: 0 3.10/0.98 pred_elim_cands: 9 3.10/0.98 pred_elim: 1 3.10/0.98 pred_elim_cl: 1 3.10/0.98 pred_elim_cycles: 9 3.10/0.98 merged_defs: 0 3.10/0.98 merged_defs_ncl: 0 3.10/0.98 bin_hyper_res: 0 3.10/0.98 prep_cycles: 4 3.10/0.98 pred_elim_time: 0.021 3.10/0.98 splitting_time: 0. 3.10/0.98 sem_filter_time: 0. 3.10/0.98 monotx_time: 0. 3.10/0.98 subtype_inf_time: 0.001 3.10/0.98 3.10/0.98 ------ Problem properties 3.10/0.98 3.10/0.98 clauses: 50 3.10/0.98 conjectures: 4 3.10/0.98 epr: 17 3.10/0.98 horn: 35 3.10/0.98 ground: 4 3.10/0.98 unary: 5 3.10/0.98 binary: 14 3.10/0.98 lits: 146 3.10/0.98 lits_eq: 32 3.10/0.98 fd_pure: 0 3.10/0.98 fd_pseudo: 0 3.10/0.98 fd_cond: 0 3.10/0.98 fd_pseudo_cond: 3 3.10/0.98 ac_symbols: 0 3.10/0.98 3.10/0.98 ------ Propositional Solver 3.10/0.98 3.10/0.98 prop_solver_calls: 31 3.10/0.98 prop_fast_solver_calls: 2025 3.10/0.98 smt_solver_calls: 0 3.10/0.98 smt_fast_solver_calls: 0 3.10/0.98 prop_num_of_clauses: 3302 3.10/0.98 prop_preprocess_simplified: 11114 3.10/0.98 prop_fo_subsumed: 53 3.10/0.98 prop_solver_time: 0. 3.10/0.98 smt_solver_time: 0. 3.10/0.98 smt_fast_solver_time: 0. 3.10/0.98 prop_fast_solver_time: 0. 3.10/0.98 prop_unsat_core_time: 0. 3.10/0.98 3.10/0.98 ------ QBF 3.10/0.98 3.10/0.98 qbf_q_res: 0 3.10/0.98 qbf_num_tautologies: 0 3.10/0.98 qbf_prep_cycles: 0 3.10/0.98 3.10/0.98 ------ BMC1 3.10/0.98 3.10/0.98 bmc1_current_bound: -1 3.10/0.98 bmc1_last_solved_bound: -1 3.10/0.98 bmc1_unsat_core_size: -1 3.10/0.98 bmc1_unsat_core_parents_size: -1 3.10/0.98 bmc1_merge_next_fun: 0 3.10/0.98 bmc1_unsat_core_clauses_time: 0. 3.10/0.98 3.10/0.98 ------ Instantiation 3.10/0.98 3.10/0.98 inst_num_of_clauses: 795 3.10/0.98 inst_num_in_passive: 312 3.10/0.98 inst_num_in_active: 472 3.10/0.98 inst_num_in_unprocessed: 10 3.10/0.98 inst_num_of_loops: 548 3.10/0.98 inst_num_of_learning_restarts: 0 3.10/0.98 inst_num_moves_active_passive: 72 3.10/0.98 inst_lit_activity: 0 3.10/0.98 inst_lit_activity_moves: 0 3.10/0.98 inst_num_tautologies: 0 3.10/0.98 inst_num_prop_implied: 0 3.10/0.98 inst_num_existing_simplified: 0 3.10/0.98 inst_num_eq_res_simplified: 0 3.10/0.98 inst_num_child_elim: 0 3.10/0.98 inst_num_of_dismatching_blockings: 359 3.10/0.98 inst_num_of_non_proper_insts: 1069 3.10/0.98 inst_num_of_duplicates: 0 3.10/0.98 inst_inst_num_from_inst_to_res: 0 3.10/0.98 inst_dismatching_checking_time: 0. 3.10/0.98 3.10/0.98 ------ Resolution 3.10/0.98 3.10/0.98 res_num_of_clauses: 0 3.10/0.98 res_num_in_passive: 0 3.10/0.98 res_num_in_active: 0 3.10/0.98 res_num_of_loops: 252 3.10/0.98 res_forward_subset_subsumed: 96 3.10/0.98 res_backward_subset_subsumed: 0 3.10/0.98 res_forward_subsumed: 0 3.10/0.98 res_backward_subsumed: 0 3.10/0.98 res_forward_subsumption_resolution: 1 3.10/0.98 res_backward_subsumption_resolution: 0 3.10/0.98 res_clause_to_clause_subsumption: 680 3.10/0.98 res_orphan_elimination: 0 3.10/0.98 res_tautology_del: 65 3.10/0.98 res_num_eq_res_simplified: 0 3.10/0.98 res_num_sel_changes: 0 3.10/0.98 res_moves_from_active_to_pass: 0 3.10/0.98 3.10/0.98 ------ Superposition 3.10/0.98 3.10/0.98 sup_time_total: 0. 3.10/0.98 sup_time_generating: 0. 3.10/0.98 sup_time_sim_full: 0. 3.10/0.98 sup_time_sim_immed: 0. 3.10/0.98 3.10/0.98 sup_num_of_clauses: 234 3.10/0.98 sup_num_in_active: 96 3.10/0.98 sup_num_in_passive: 138 3.10/0.98 sup_num_of_loops: 108 3.10/0.98 sup_fw_superposition: 94 3.10/0.98 sup_bw_superposition: 149 3.10/0.98 sup_immediate_simplified: 26 3.10/0.98 sup_given_eliminated: 0 3.10/0.98 comparisons_done: 0 3.10/0.98 comparisons_avoided: 9 3.10/0.98 3.10/0.98 ------ Simplifications 3.10/0.98 3.10/0.98 3.10/0.98 sim_fw_subset_subsumed: 18 3.10/0.98 sim_bw_subset_subsumed: 1 3.10/0.98 sim_fw_subsumed: 3 3.10/0.98 sim_bw_subsumed: 9 3.10/0.98 sim_fw_subsumption_res: 0 3.10/0.98 sim_bw_subsumption_res: 0 3.10/0.98 sim_tautology_del: 4 3.10/0.98 sim_eq_tautology_del: 1 3.10/0.98 sim_eq_res_simp: 0 3.10/0.98 sim_fw_demodulated: 0 3.10/0.98 sim_bw_demodulated: 6 3.10/0.98 sim_light_normalised: 1 3.10/0.98 sim_joinable_taut: 0 3.10/0.98 sim_joinable_simp: 0 3.10/0.98 sim_ac_normalised: 0 3.10/0.98 sim_smt_subsumption: 0 3.10/0.98 3.10/0.99 EOF