0.03/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.14 % Command : iproveropt_run.sh %d %s 0.13/0.34 % Computer : n021.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 08:46:22 EDT 2020 0.13/0.34 % CPUTime : 0.13/0.35 % Running in FOF mode 7.63/1.47 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p 7.63/1.47 7.63/1.47 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 7.63/1.47 7.63/1.47 ------ iProver source info 7.63/1.47 7.63/1.47 git: date: 2020-06-30 10:37:57 +0100 7.63/1.47 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 7.63/1.47 git: non_committed_changes: false 7.63/1.47 git: last_make_outside_of_git: false 7.63/1.47 7.63/1.47 ------ 7.63/1.47 7.63/1.47 ------ Input Options 7.63/1.47 7.63/1.47 --out_options all 7.63/1.47 --tptp_safe_out true 7.63/1.47 --problem_path "" 7.63/1.47 --include_path "" 7.63/1.47 --clausifier res/vclausify_rel 7.63/1.47 --clausifier_options "" 7.63/1.47 --stdin false 7.63/1.47 --stats_out all 7.63/1.47 7.63/1.47 ------ General Options 7.63/1.47 7.63/1.47 --fof false 7.63/1.47 --time_out_real 125. 7.63/1.47 --time_out_virtual -1. 7.63/1.47 --symbol_type_check false 7.63/1.47 --clausify_out false 7.63/1.47 --sig_cnt_out false 7.63/1.47 --trig_cnt_out false 7.63/1.47 --trig_cnt_out_tolerance 1. 7.63/1.47 --trig_cnt_out_sk_spl false 7.63/1.47 --abstr_cl_out false 7.63/1.47 7.63/1.47 ------ Global Options 7.63/1.47 7.63/1.47 --schedule default 7.63/1.47 --add_important_lit false 7.63/1.47 --prop_solver_per_cl 1000 7.63/1.47 --min_unsat_core false 7.63/1.47 --soft_assumptions false 7.63/1.47 --soft_lemma_size 3 7.63/1.47 --prop_impl_unit_size 0 7.63/1.47 --prop_impl_unit [] 7.63/1.47 --share_sel_clauses true 7.63/1.47 --reset_solvers false 7.63/1.47 --bc_imp_inh [conj_cone] 7.63/1.47 --conj_cone_tolerance 3. 7.63/1.47 --extra_neg_conj none 7.63/1.47 --large_theory_mode true 7.63/1.47 --prolific_symb_bound 200 7.63/1.47 --lt_threshold 2000 7.63/1.47 --clause_weak_htbl true 7.63/1.47 --gc_record_bc_elim false 7.63/1.47 7.63/1.47 ------ Preprocessing Options 7.63/1.47 7.63/1.47 --preprocessing_flag true 7.63/1.47 --time_out_prep_mult 0.1 7.63/1.47 --splitting_mode input 7.63/1.47 --splitting_grd true 7.63/1.47 --splitting_cvd false 7.63/1.47 --splitting_cvd_svl false 7.63/1.47 --splitting_nvd 32 7.63/1.47 --sub_typing true 7.63/1.47 --prep_gs_sim true 7.63/1.47 --prep_unflatten true 7.63/1.47 --prep_res_sim true 7.63/1.47 --prep_upred true 7.63/1.47 --prep_sem_filter exhaustive 7.63/1.47 --prep_sem_filter_out false 7.63/1.47 --pred_elim true 7.63/1.47 --res_sim_input true 7.63/1.47 --eq_ax_congr_red true 7.63/1.47 --pure_diseq_elim true 7.63/1.47 --brand_transform false 7.63/1.47 --non_eq_to_eq false 7.63/1.47 --prep_def_merge true 7.63/1.47 --prep_def_merge_prop_impl false 7.63/1.47 --prep_def_merge_mbd true 7.63/1.47 --prep_def_merge_tr_red false 7.63/1.47 --prep_def_merge_tr_cl false 7.63/1.47 --smt_preprocessing true 7.63/1.47 --smt_ac_axioms fast 7.63/1.47 --preprocessed_out false 7.63/1.47 --preprocessed_stats false 7.63/1.47 7.63/1.47 ------ Abstraction refinement Options 7.63/1.47 7.63/1.47 --abstr_ref [] 7.63/1.47 --abstr_ref_prep false 7.63/1.47 --abstr_ref_until_sat false 7.63/1.47 --abstr_ref_sig_restrict funpre 7.63/1.47 --abstr_ref_af_restrict_to_split_sk false 7.63/1.47 --abstr_ref_under [] 7.63/1.47 7.63/1.47 ------ SAT Options 7.63/1.47 7.63/1.47 --sat_mode false 7.63/1.47 --sat_fm_restart_options "" 7.63/1.47 --sat_gr_def false 7.63/1.47 --sat_epr_types true 7.63/1.47 --sat_non_cyclic_types false 7.63/1.47 --sat_finite_models false 7.63/1.47 --sat_fm_lemmas false 7.63/1.47 --sat_fm_prep false 7.63/1.47 --sat_fm_uc_incr true 7.63/1.47 --sat_out_model small 7.63/1.47 --sat_out_clauses false 7.63/1.47 7.63/1.47 ------ QBF Options 7.63/1.47 7.63/1.47 --qbf_mode false 7.63/1.47 --qbf_elim_univ false 7.63/1.47 --qbf_dom_inst none 7.63/1.47 --qbf_dom_pre_inst false 7.63/1.47 --qbf_sk_in false 7.63/1.47 --qbf_pred_elim true 7.63/1.47 --qbf_split 512 7.63/1.47 7.63/1.47 ------ BMC1 Options 7.63/1.47 7.63/1.47 --bmc1_incremental false 7.63/1.47 --bmc1_axioms reachable_all 7.63/1.47 --bmc1_min_bound 0 7.63/1.47 --bmc1_max_bound -1 7.63/1.47 --bmc1_max_bound_default -1 7.63/1.47 --bmc1_symbol_reachability true 7.63/1.47 --bmc1_property_lemmas false 7.63/1.47 --bmc1_k_induction false 7.63/1.47 --bmc1_non_equiv_states false 7.63/1.47 --bmc1_deadlock false 7.63/1.47 --bmc1_ucm false 7.63/1.47 --bmc1_add_unsat_core none 7.63/1.47 --bmc1_unsat_core_children false 7.63/1.47 --bmc1_unsat_core_extrapolate_axioms false 7.63/1.47 --bmc1_out_stat full 7.63/1.47 --bmc1_ground_init false 7.63/1.47 --bmc1_pre_inst_next_state false 7.63/1.47 --bmc1_pre_inst_state false 7.63/1.47 --bmc1_pre_inst_reach_state false 7.63/1.47 --bmc1_out_unsat_core false 7.63/1.47 --bmc1_aig_witness_out false 7.63/1.47 --bmc1_verbose false 7.63/1.47 --bmc1_dump_clauses_tptp false 7.63/1.47 --bmc1_dump_unsat_core_tptp false 7.63/1.47 --bmc1_dump_file - 7.63/1.47 --bmc1_ucm_expand_uc_limit 128 7.63/1.47 --bmc1_ucm_n_expand_iterations 6 7.63/1.47 --bmc1_ucm_extend_mode 1 7.63/1.47 --bmc1_ucm_init_mode 2 7.63/1.47 --bmc1_ucm_cone_mode none 7.63/1.47 --bmc1_ucm_reduced_relation_type 0 7.63/1.47 --bmc1_ucm_relax_model 4 7.63/1.47 --bmc1_ucm_full_tr_after_sat true 7.63/1.47 --bmc1_ucm_expand_neg_assumptions false 7.63/1.47 --bmc1_ucm_layered_model none 7.63/1.47 --bmc1_ucm_max_lemma_size 10 7.63/1.47 7.63/1.47 ------ AIG Options 7.63/1.47 7.63/1.47 --aig_mode false 7.63/1.47 7.63/1.47 ------ Instantiation Options 7.63/1.47 7.63/1.47 --instantiation_flag true 7.63/1.47 --inst_sos_flag true 7.63/1.47 --inst_sos_phase true 7.63/1.47 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 7.63/1.47 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 7.63/1.47 --inst_lit_sel_side num_symb 7.63/1.47 --inst_solver_per_active 1400 7.63/1.47 --inst_solver_calls_frac 1. 7.63/1.47 --inst_passive_queue_type priority_queues 7.63/1.47 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 7.63/1.47 --inst_passive_queues_freq [25;2] 7.63/1.47 --inst_dismatching true 7.63/1.47 --inst_eager_unprocessed_to_passive true 7.63/1.47 --inst_prop_sim_given true 7.63/1.47 --inst_prop_sim_new false 7.63/1.47 --inst_subs_new false 7.63/1.47 --inst_eq_res_simp false 7.63/1.47 --inst_subs_given false 7.63/1.47 --inst_orphan_elimination true 7.63/1.47 --inst_learning_loop_flag true 7.63/1.47 --inst_learning_start 3000 7.63/1.47 --inst_learning_factor 2 7.63/1.47 --inst_start_prop_sim_after_learn 3 7.63/1.47 --inst_sel_renew solver 7.63/1.47 --inst_lit_activity_flag true 7.63/1.47 --inst_restr_to_given false 7.63/1.47 --inst_activity_threshold 500 7.63/1.47 --inst_out_proof true 7.63/1.47 7.63/1.47 ------ Resolution Options 7.63/1.47 7.63/1.47 --resolution_flag true 7.63/1.47 --res_lit_sel adaptive 7.63/1.47 --res_lit_sel_side none 7.63/1.47 --res_ordering kbo 7.63/1.47 --res_to_prop_solver active 7.63/1.47 --res_prop_simpl_new false 7.63/1.47 --res_prop_simpl_given true 7.63/1.47 --res_passive_queue_type priority_queues 7.63/1.47 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 7.63/1.47 --res_passive_queues_freq [15;5] 7.63/1.47 --res_forward_subs full 7.63/1.47 --res_backward_subs full 7.63/1.47 --res_forward_subs_resolution true 7.63/1.47 --res_backward_subs_resolution true 7.63/1.47 --res_orphan_elimination true 7.63/1.47 --res_time_limit 2. 7.63/1.47 --res_out_proof true 7.63/1.47 7.63/1.47 ------ Superposition Options 7.63/1.47 7.63/1.47 --superposition_flag true 7.63/1.47 --sup_passive_queue_type priority_queues 7.63/1.47 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 7.63/1.47 --sup_passive_queues_freq [8;1;4] 7.63/1.47 --demod_completeness_check fast 7.63/1.47 --demod_use_ground true 7.63/1.47 --sup_to_prop_solver passive 7.63/1.47 --sup_prop_simpl_new true 7.63/1.47 --sup_prop_simpl_given true 7.63/1.47 --sup_fun_splitting true 7.63/1.47 --sup_smt_interval 50000 7.63/1.47 7.63/1.47 ------ Superposition Simplification Setup 7.63/1.47 7.63/1.47 --sup_indices_passive [LightNormIndex;FwDemodIndex] 7.63/1.47 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 7.63/1.47 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 7.63/1.47 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 7.63/1.47 --sup_full_triv [TrivRules;PropSubs] 7.63/1.47 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 7.63/1.47 --sup_full_bw [BwDemod;BwSubsumption] 7.63/1.47 --sup_immed_triv [TrivRules] 7.63/1.47 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 7.63/1.47 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 7.63/1.47 --sup_immed_bw_main [] 7.63/1.47 --sup_immed_bw_immed [BwDemod;BwSubsumption] 7.63/1.47 --sup_input_triv [Unflattening;TrivRules] 7.63/1.47 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 7.63/1.47 --sup_input_bw [] 7.63/1.47 7.63/1.47 ------ Combination Options 7.63/1.47 7.63/1.47 --comb_res_mult 3 7.63/1.47 --comb_sup_mult 2 7.63/1.47 --comb_inst_mult 10 7.63/1.47 7.63/1.47 ------ Debug Options 7.63/1.47 7.63/1.47 --dbg_backtrace false 7.63/1.47 --dbg_dump_prop_clauses false 7.63/1.47 --dbg_dump_prop_clauses_file - 7.63/1.47 --dbg_out_stat false 7.63/1.47 ------ Parsing... 7.63/1.47 ------ Clausification by vclausify_rel & Parsing by iProver... 7.63/1.47 7.63/1.47 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sf_s rm: 1 0s sf_e pe_s pe_e 7.63/1.47 7.63/1.47 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 7.63/1.47 7.63/1.47 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 7.63/1.47 ------ Proving... 7.63/1.47 ------ Problem Properties 7.63/1.47 7.63/1.47 7.63/1.47 clauses 85 7.63/1.47 conjectures 8 7.63/1.47 EPR 10 7.63/1.47 Horn 66 7.63/1.47 unary 17 7.63/1.47 binary 5 7.63/1.47 lits 317 7.63/1.47 lits eq 12 7.63/1.47 fd_pure 0 7.63/1.47 fd_pseudo 0 7.63/1.47 fd_cond 0 7.63/1.47 fd_pseudo_cond 5 7.63/1.47 AC symbols 0 7.63/1.47 7.63/1.47 ------ Schedule dynamic 5 is on 7.63/1.47 7.63/1.47 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 7.63/1.47 7.63/1.47 7.63/1.47 ------ 7.63/1.47 Current options: 7.63/1.47 ------ 7.63/1.47 7.63/1.47 ------ Input Options 7.63/1.47 7.63/1.47 --out_options all 7.63/1.47 --tptp_safe_out true 7.63/1.47 --problem_path "" 7.63/1.47 --include_path "" 7.63/1.47 --clausifier res/vclausify_rel 7.63/1.47 --clausifier_options "" 7.63/1.47 --stdin false 7.63/1.47 --stats_out all 7.63/1.47 7.63/1.47 ------ General Options 7.63/1.47 7.63/1.47 --fof false 7.63/1.47 --time_out_real 125. 7.63/1.47 --time_out_virtual -1. 7.63/1.47 --symbol_type_check false 7.63/1.47 --clausify_out false 7.63/1.47 --sig_cnt_out false 7.63/1.47 --trig_cnt_out false 7.63/1.47 --trig_cnt_out_tolerance 1. 7.63/1.47 --trig_cnt_out_sk_spl false 7.63/1.47 --abstr_cl_out false 7.63/1.47 7.63/1.47 ------ Global Options 7.63/1.47 7.63/1.47 --schedule default 7.63/1.47 --add_important_lit false 7.63/1.47 --prop_solver_per_cl 1000 7.63/1.47 --min_unsat_core false 7.63/1.47 --soft_assumptions false 7.63/1.47 --soft_lemma_size 3 7.63/1.47 --prop_impl_unit_size 0 7.63/1.47 --prop_impl_unit [] 7.63/1.47 --share_sel_clauses true 7.63/1.47 --reset_solvers false 7.63/1.47 --bc_imp_inh [conj_cone] 7.63/1.47 --conj_cone_tolerance 3. 7.63/1.47 --extra_neg_conj none 7.63/1.47 --large_theory_mode true 7.63/1.47 --prolific_symb_bound 200 7.63/1.47 --lt_threshold 2000 7.63/1.47 --clause_weak_htbl true 7.63/1.47 --gc_record_bc_elim false 7.63/1.47 7.63/1.47 ------ Preprocessing Options 7.63/1.47 7.63/1.47 --preprocessing_flag true 7.63/1.47 --time_out_prep_mult 0.1 7.63/1.47 --splitting_mode input 7.63/1.47 --splitting_grd true 7.63/1.47 --splitting_cvd false 7.63/1.47 --splitting_cvd_svl false 7.63/1.47 --splitting_nvd 32 7.63/1.47 --sub_typing true 7.63/1.47 --prep_gs_sim true 7.63/1.47 --prep_unflatten true 7.63/1.47 --prep_res_sim true 7.63/1.47 --prep_upred true 7.63/1.47 --prep_sem_filter exhaustive 7.63/1.47 --prep_sem_filter_out false 7.63/1.47 --pred_elim true 7.63/1.47 --res_sim_input true 7.63/1.47 --eq_ax_congr_red true 7.63/1.47 --pure_diseq_elim true 7.63/1.47 --brand_transform false 7.63/1.47 --non_eq_to_eq false 7.63/1.47 --prep_def_merge true 7.63/1.47 --prep_def_merge_prop_impl false 7.63/1.47 --prep_def_merge_mbd true 7.63/1.47 --prep_def_merge_tr_red false 7.63/1.47 --prep_def_merge_tr_cl false 7.63/1.47 --smt_preprocessing true 7.63/1.47 --smt_ac_axioms fast 7.63/1.47 --preprocessed_out false 7.63/1.47 --preprocessed_stats false 7.63/1.47 7.63/1.47 ------ Abstraction refinement Options 7.63/1.47 7.63/1.47 --abstr_ref [] 7.63/1.47 --abstr_ref_prep false 7.63/1.47 --abstr_ref_until_sat false 7.63/1.47 --abstr_ref_sig_restrict funpre 7.63/1.47 --abstr_ref_af_restrict_to_split_sk false 7.63/1.47 --abstr_ref_under [] 7.63/1.47 7.63/1.47 ------ SAT Options 7.63/1.47 7.63/1.47 --sat_mode false 7.63/1.47 --sat_fm_restart_options "" 7.63/1.47 --sat_gr_def false 7.63/1.47 --sat_epr_types true 7.63/1.47 --sat_non_cyclic_types false 7.63/1.47 --sat_finite_models false 7.63/1.47 --sat_fm_lemmas false 7.63/1.47 --sat_fm_prep false 7.63/1.47 --sat_fm_uc_incr true 7.63/1.47 --sat_out_model small 7.63/1.47 --sat_out_clauses false 7.63/1.47 7.63/1.47 ------ QBF Options 7.63/1.47 7.63/1.47 --qbf_mode false 7.63/1.47 --qbf_elim_univ false 7.63/1.47 --qbf_dom_inst none 7.63/1.47 --qbf_dom_pre_inst false 7.63/1.47 --qbf_sk_in false 7.63/1.47 --qbf_pred_elim true 7.63/1.47 --qbf_split 512 7.63/1.47 7.63/1.47 ------ BMC1 Options 7.63/1.47 7.63/1.47 --bmc1_incremental false 7.63/1.47 --bmc1_axioms reachable_all 7.63/1.47 --bmc1_min_bound 0 7.63/1.47 --bmc1_max_bound -1 7.63/1.47 --bmc1_max_bound_default -1 7.63/1.47 --bmc1_symbol_reachability true 7.63/1.47 --bmc1_property_lemmas false 7.63/1.47 --bmc1_k_induction false 7.63/1.47 --bmc1_non_equiv_states false 7.63/1.47 --bmc1_deadlock false 7.63/1.47 --bmc1_ucm false 7.63/1.47 --bmc1_add_unsat_core none 7.63/1.47 --bmc1_unsat_core_children false 7.63/1.47 --bmc1_unsat_core_extrapolate_axioms false 7.63/1.47 --bmc1_out_stat full 7.63/1.47 --bmc1_ground_init false 7.63/1.47 --bmc1_pre_inst_next_state false 7.63/1.47 --bmc1_pre_inst_state false 7.63/1.47 --bmc1_pre_inst_reach_state false 7.63/1.47 --bmc1_out_unsat_core false 7.63/1.47 --bmc1_aig_witness_out false 7.63/1.47 --bmc1_verbose false 7.63/1.47 --bmc1_dump_clauses_tptp false 7.63/1.47 --bmc1_dump_unsat_core_tptp false 7.63/1.47 --bmc1_dump_file - 7.63/1.47 --bmc1_ucm_expand_uc_limit 128 7.63/1.47 --bmc1_ucm_n_expand_iterations 6 7.63/1.47 --bmc1_ucm_extend_mode 1 7.63/1.47 --bmc1_ucm_init_mode 2 7.63/1.47 --bmc1_ucm_cone_mode none 7.63/1.47 --bmc1_ucm_reduced_relation_type 0 7.63/1.47 --bmc1_ucm_relax_model 4 7.63/1.47 --bmc1_ucm_full_tr_after_sat true 7.63/1.47 --bmc1_ucm_expand_neg_assumptions false 7.63/1.47 --bmc1_ucm_layered_model none 7.63/1.47 --bmc1_ucm_max_lemma_size 10 7.63/1.47 7.63/1.47 ------ AIG Options 7.63/1.47 7.63/1.47 --aig_mode false 7.63/1.47 7.63/1.47 ------ Instantiation Options 7.63/1.47 7.63/1.47 --instantiation_flag true 7.63/1.47 --inst_sos_flag true 7.63/1.47 --inst_sos_phase true 7.63/1.47 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 7.63/1.47 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 7.63/1.47 --inst_lit_sel_side none 7.63/1.47 --inst_solver_per_active 1400 7.63/1.47 --inst_solver_calls_frac 1. 7.63/1.47 --inst_passive_queue_type priority_queues 7.63/1.47 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 7.63/1.47 --inst_passive_queues_freq [25;2] 7.63/1.47 --inst_dismatching true 7.63/1.47 --inst_eager_unprocessed_to_passive true 7.63/1.47 --inst_prop_sim_given true 7.63/1.47 --inst_prop_sim_new false 7.63/1.47 --inst_subs_new false 7.63/1.47 --inst_eq_res_simp false 7.63/1.47 --inst_subs_given false 7.63/1.47 --inst_orphan_elimination true 7.63/1.47 --inst_learning_loop_flag true 7.63/1.47 --inst_learning_start 3000 7.63/1.47 --inst_learning_factor 2 7.63/1.47 --inst_start_prop_sim_after_learn 3 7.63/1.47 --inst_sel_renew solver 7.63/1.47 --inst_lit_activity_flag true 7.63/1.47 --inst_restr_to_given false 7.63/1.47 --inst_activity_threshold 500 7.63/1.47 --inst_out_proof true 7.63/1.47 7.63/1.47 ------ Resolution Options 7.63/1.47 7.63/1.47 --resolution_flag false 7.63/1.47 --res_lit_sel adaptive 7.63/1.47 --res_lit_sel_side none 7.63/1.47 --res_ordering kbo 7.63/1.47 --res_to_prop_solver active 7.63/1.47 --res_prop_simpl_new false 7.63/1.47 --res_prop_simpl_given true 7.63/1.47 --res_passive_queue_type priority_queues 7.63/1.47 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 7.63/1.47 --res_passive_queues_freq [15;5] 7.63/1.47 --res_forward_subs full 7.63/1.47 --res_backward_subs full 7.63/1.47 --res_forward_subs_resolution true 7.63/1.47 --res_backward_subs_resolution true 7.63/1.47 --res_orphan_elimination true 7.63/1.47 --res_time_limit 2. 7.63/1.47 --res_out_proof true 7.63/1.47 7.63/1.47 ------ Superposition Options 7.63/1.47 7.63/1.47 --superposition_flag true 7.63/1.47 --sup_passive_queue_type priority_queues 7.63/1.47 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 7.63/1.47 --sup_passive_queues_freq [8;1;4] 7.63/1.47 --demod_completeness_check fast 7.63/1.47 --demod_use_ground true 7.63/1.47 --sup_to_prop_solver passive 7.63/1.47 --sup_prop_simpl_new true 7.63/1.47 --sup_prop_simpl_given true 7.63/1.47 --sup_fun_splitting true 7.63/1.47 --sup_smt_interval 50000 7.63/1.47 7.63/1.47 ------ Superposition Simplification Setup 7.63/1.47 7.63/1.47 --sup_indices_passive [LightNormIndex;FwDemodIndex] 7.63/1.47 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 7.63/1.47 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 7.63/1.47 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 7.63/1.47 --sup_full_triv [TrivRules;PropSubs] 7.63/1.47 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 7.63/1.47 --sup_full_bw [BwDemod;BwSubsumption] 7.63/1.47 --sup_immed_triv [TrivRules] 7.63/1.47 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 7.63/1.47 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 7.63/1.47 --sup_immed_bw_main [] 7.63/1.47 --sup_immed_bw_immed [BwDemod;BwSubsumption] 7.63/1.47 --sup_input_triv [Unflattening;TrivRules] 7.63/1.47 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 7.63/1.47 --sup_input_bw [] 7.63/1.47 7.63/1.47 ------ Combination Options 7.63/1.47 7.63/1.47 --comb_res_mult 3 7.63/1.47 --comb_sup_mult 2 7.63/1.47 --comb_inst_mult 10 7.63/1.47 7.63/1.47 ------ Debug Options 7.63/1.47 7.63/1.47 --dbg_backtrace false 7.63/1.47 --dbg_dump_prop_clauses false 7.63/1.47 --dbg_dump_prop_clauses_file - 7.63/1.47 --dbg_out_stat false 7.63/1.47 7.63/1.47 7.63/1.47 7.63/1.47 7.63/1.47 ------ Proving... 7.63/1.47 7.63/1.47 7.63/1.47 % SZS status Theorem for theBenchmark.p 7.63/1.47 7.63/1.47 % SZS output start CNFRefutation for theBenchmark.p 7.63/1.47 7.63/1.47 fof(f40,conjecture,( 7.63/1.47 ! [X8] : (ne(X8) => ! [X9] : (ne(X9) => ! [X19] : (mem(X19,arr(X9,X8)) => ! [X20] : (mem(X20,arr(X8,bool)) => ! [X40] : (mem(X40,arr(X8,bool)) => (! [X41] : (mem(X41,X8) => (p(ap(X40,X41)) => p(ap(X20,X41)))) => (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X8),X19),X20)) => p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X8),X19),X40)))))))))), 7.63/1.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 7.63/1.47 7.63/1.47 fof(f41,negated_conjecture,( 7.63/1.47 ~! [X8] : (ne(X8) => ! [X9] : (ne(X9) => ! [X19] : (mem(X19,arr(X9,X8)) => ! [X20] : (mem(X20,arr(X8,bool)) => ! [X40] : (mem(X40,arr(X8,bool)) => (! [X41] : (mem(X41,X8) => (p(ap(X40,X41)) => p(ap(X20,X41)))) => (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X8),X19),X20)) => p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X8),X19),X40)))))))))), 7.63/1.47 inference(negated_conjecture,[],[f40])). 7.63/1.47 7.63/1.47 fof(f90,plain,( 7.63/1.47 ~! [X0] : (ne(X0) => ! [X1] : (ne(X1) => ! [X2] : (mem(X2,arr(X1,X0)) => ! [X3] : (mem(X3,arr(X0,bool)) => ! [X4] : (mem(X4,arr(X0,bool)) => (! [X5] : (mem(X5,X0) => (p(ap(X4,X5)) => p(ap(X3,X5)))) => (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3)) => p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)))))))))), 7.63/1.47 inference(rectify,[],[f41])). 7.63/1.47 7.63/1.47 fof(f145,plain,( 7.63/1.47 ? [X0] : (? [X1] : (? [X2] : (? [X3] : (? [X4] : (((~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))) & ! [X5] : ((p(ap(X3,X5)) | ~p(ap(X4,X5))) | ~mem(X5,X0))) & mem(X4,arr(X0,bool))) & mem(X3,arr(X0,bool))) & mem(X2,arr(X1,X0))) & ne(X1)) & ne(X0))), 7.63/1.47 inference(ennf_transformation,[],[f90])). 7.63/1.47 7.63/1.47 fof(f146,plain,( 7.63/1.47 ? [X0] : (? [X1] : (? [X2] : (? [X3] : (? [X4] : (~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3)) & ! [X5] : (p(ap(X3,X5)) | ~p(ap(X4,X5)) | ~mem(X5,X0)) & mem(X4,arr(X0,bool))) & mem(X3,arr(X0,bool))) & mem(X2,arr(X1,X0))) & ne(X1)) & ne(X0))), 7.63/1.47 inference(flattening,[],[f145])). 7.63/1.47 7.63/1.47 fof(f260,plain,( 7.63/1.47 ( ! [X2,X0,X3,X1] : (? [X4] : (~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3)) & ! [X5] : (p(ap(X3,X5)) | ~p(ap(X4,X5)) | ~mem(X5,X0)) & mem(X4,arr(X0,bool))) => (~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),sK35)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3)) & ! [X5] : (p(ap(X3,X5)) | ~p(ap(sK35,X5)) | ~mem(X5,X0)) & mem(sK35,arr(X0,bool)))) )), 7.63/1.47 introduced(choice_axiom,[])). 7.63/1.47 7.63/1.47 fof(f259,plain,( 7.63/1.47 ( ! [X2,X0,X1] : (? [X3] : (? [X4] : (~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3)) & ! [X5] : (p(ap(X3,X5)) | ~p(ap(X4,X5)) | ~mem(X5,X0)) & mem(X4,arr(X0,bool))) & mem(X3,arr(X0,bool))) => (? [X4] : (~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),sK34)) & ! [X5] : (p(ap(sK34,X5)) | ~p(ap(X4,X5)) | ~mem(X5,X0)) & mem(X4,arr(X0,bool))) & mem(sK34,arr(X0,bool)))) )), 7.63/1.47 introduced(choice_axiom,[])). 7.63/1.47 7.63/1.47 fof(f258,plain,( 7.63/1.47 ( ! [X0,X1] : (? [X2] : (? [X3] : (? [X4] : (~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3)) & ! [X5] : (p(ap(X3,X5)) | ~p(ap(X4,X5)) | ~mem(X5,X0)) & mem(X4,arr(X0,bool))) & mem(X3,arr(X0,bool))) & mem(X2,arr(X1,X0))) => (? [X3] : (? [X4] : (~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),sK33),X4)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),sK33),X3)) & ! [X5] : (p(ap(X3,X5)) | ~p(ap(X4,X5)) | ~mem(X5,X0)) & mem(X4,arr(X0,bool))) & mem(X3,arr(X0,bool))) & mem(sK33,arr(X1,X0)))) )), 7.63/1.47 introduced(choice_axiom,[])). 7.63/1.47 7.63/1.47 fof(f257,plain,( 7.63/1.47 ( ! [X0] : (? [X1] : (? [X2] : (? [X3] : (? [X4] : (~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3)) & ! [X5] : (p(ap(X3,X5)) | ~p(ap(X4,X5)) | ~mem(X5,X0)) & mem(X4,arr(X0,bool))) & mem(X3,arr(X0,bool))) & mem(X2,arr(X1,X0))) & ne(X1)) => (? [X2] : (? [X3] : (? [X4] : (~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,X0),X2),X4)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,X0),X2),X3)) & ! [X5] : (p(ap(X3,X5)) | ~p(ap(X4,X5)) | ~mem(X5,X0)) & mem(X4,arr(X0,bool))) & mem(X3,arr(X0,bool))) & mem(X2,arr(sK32,X0))) & ne(sK32))) )), 7.63/1.47 introduced(choice_axiom,[])). 7.63/1.47 7.63/1.47 fof(f256,plain,( 7.63/1.47 ? [X0] : (? [X1] : (? [X2] : (? [X3] : (? [X4] : (~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3)) & ! [X5] : (p(ap(X3,X5)) | ~p(ap(X4,X5)) | ~mem(X5,X0)) & mem(X4,arr(X0,bool))) & mem(X3,arr(X0,bool))) & mem(X2,arr(X1,X0))) & ne(X1)) & ne(X0)) => (? [X1] : (? [X2] : (? [X3] : (? [X4] : (~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,sK31),X2),X4)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,sK31),X2),X3)) & ! [X5] : (p(ap(X3,X5)) | ~p(ap(X4,X5)) | ~mem(X5,sK31)) & mem(X4,arr(sK31,bool))) & mem(X3,arr(sK31,bool))) & mem(X2,arr(X1,sK31))) & ne(X1)) & ne(sK31))), 7.63/1.47 introduced(choice_axiom,[])). 7.63/1.47 7.63/1.47 fof(f261,plain,( 7.63/1.47 ((((~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK35)) & p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK34)) & ! [X5] : (p(ap(sK34,X5)) | ~p(ap(sK35,X5)) | ~mem(X5,sK31)) & mem(sK35,arr(sK31,bool))) & mem(sK34,arr(sK31,bool))) & mem(sK33,arr(sK32,sK31))) & ne(sK32)) & ne(sK31)), 7.63/1.47 inference(skolemisation,[status(esa),new_symbols(skolem,[sK31,sK32,sK33,sK34,sK35])],[f146,f260,f259,f258,f257,f256])). 7.63/1.47 7.63/1.47 fof(f431,plain,( 7.63/1.47 ( ! [X5] : (p(ap(sK34,X5)) | ~p(ap(sK35,X5)) | ~mem(X5,sK31)) )), 7.63/1.47 inference(cnf_transformation,[],[f261])). 7.63/1.47 7.63/1.47 fof(f8,axiom,( 7.63/1.47 ! [X0,X4,X5] : (mem(X5,arr(X0,X4)) => ! [X1] : (mem(X1,X0) => mem(ap(X5,X1),X4)))), 7.63/1.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 7.63/1.47 7.63/1.47 fof(f58,plain,( 7.63/1.47 ! [X0,X1,X2] : (mem(X2,arr(X0,X1)) => ! [X3] : (mem(X3,X0) => mem(ap(X2,X3),X1)))), 7.63/1.47 inference(rectify,[],[f8])). 7.63/1.47 7.63/1.47 fof(f114,plain,( 7.63/1.47 ! [X0,X1,X2] : (! [X3] : (mem(ap(X2,X3),X1) | ~mem(X3,X0)) | ~mem(X2,arr(X0,X1)))), 7.63/1.47 inference(ennf_transformation,[],[f58])). 7.63/1.47 7.63/1.47 fof(f298,plain,( 7.63/1.47 ( ! [X2,X0,X3,X1] : (mem(ap(X2,X3),X1) | ~mem(X3,X0) | ~mem(X2,arr(X0,X1))) )), 7.63/1.47 inference(cnf_transformation,[],[f114])). 7.63/1.47 7.63/1.47 fof(f25,axiom,( 7.63/1.47 ! [X8] : (ne(X8) => ! [X9] : (ne(X9) => ! [X19] : (mem(X19,arr(X8,X9)) => ! [X20] : (mem(X20,arr(X9,bool)) => (! [X35] : (mem(X35,arr(X8,X9)) => ! [X36] : (mem(X36,arr(X9,bool)) => (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X8,X9),X35),X36)) <=> ! [X37] : (mem(X37,X9) => (p(ap(X36,X37)) => ? [X38] : (ap(X35,X38) = X37 & mem(X38,X8))))))) & ! [X31] : (mem(X31,arr(X8,X9)) => ! [X32] : (mem(X32,arr(X9,bool)) => (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X8,X9),X31),X32)) <=> ! [X33] : (mem(X33,X9) => (~p(ap(X32,X33)) => ? [X34] : (ap(X31,X34) = X33 & mem(X34,X8))))))) & ! [X28] : (mem(X28,arr(X8,X9)) => ! [X29] : (mem(X29,arr(X9,bool)) => (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X8,X9),X28),X29)) <=> ! [X30] : (mem(X30,X8) => ~p(ap(X29,ap(X28,X30))))))) & ! [X25] : (mem(X25,arr(X8,X9)) => ! [X26] : (mem(X26,arr(X9,bool)) => (! [X27] : (mem(X27,X8) => p(ap(X26,ap(X25,X27)))) <=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X8,X9),X25),X26))))) & (! [X23] : (mem(X23,X9) => (~p(ap(X20,X23)) => ? [X24] : (mem(X24,X8) & ~p(ap(X20,ap(X19,X24)))))) <=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X8,X9),X19),X20))) & (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X8,X9),X19),X20)) <=> ! [X21] : (mem(X21,X9) => (p(ap(X20,X21)) => ? [X22] : (mem(X22,X8) & p(ap(X20,ap(X19,X22))))))))))))), 7.63/1.47 file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)). 7.63/1.47 7.63/1.47 fof(f75,plain,( 7.63/1.47 ! [X0] : (ne(X0) => ! [X1] : (ne(X1) => ! [X2] : (mem(X2,arr(X0,X1)) => ! [X3] : (mem(X3,arr(X1,bool)) => (! [X4] : (mem(X4,arr(X0,X1)) => ! [X5] : (mem(X5,arr(X1,bool)) => (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X0,X1),X4),X5)) <=> ! [X6] : (mem(X6,X1) => (p(ap(X5,X6)) => ? [X7] : (ap(X4,X7) = X6 & mem(X7,X0))))))) & ! [X8] : (mem(X8,arr(X0,X1)) => ! [X9] : (mem(X9,arr(X1,bool)) => (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X0,X1),X8),X9)) <=> ! [X10] : (mem(X10,X1) => (~p(ap(X9,X10)) => ? [X11] : (ap(X8,X11) = X10 & mem(X11,X0))))))) & ! [X12] : (mem(X12,arr(X0,X1)) => ! [X13] : (mem(X13,arr(X1,bool)) => (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X12),X13)) <=> ! [X14] : (mem(X14,X0) => ~p(ap(X13,ap(X12,X14))))))) & ! [X15] : (mem(X15,arr(X0,X1)) => ! [X16] : (mem(X16,arr(X1,bool)) => (! [X17] : (mem(X17,X0) => p(ap(X16,ap(X15,X17)))) <=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X15),X16))))) & (! [X18] : (mem(X18,X1) => (~p(ap(X3,X18)) => ? [X19] : (mem(X19,X0) & ~p(ap(X3,ap(X2,X19)))))) <=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X0,X1),X2),X3))) & (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X0,X1),X2),X3)) <=> ! [X20] : (mem(X20,X1) => (p(ap(X3,X20)) => ? [X21] : (mem(X21,X0) & p(ap(X3,ap(X2,X21))))))))))))), 7.63/1.47 inference(rectify,[],[f25])). 7.63/1.47 7.63/1.47 fof(f132,plain,( 7.63/1.47 ! [X0] : (! [X1] : (! [X2] : (! [X3] : ((! [X4] : (! [X5] : ((p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X0,X1),X4),X5)) <=> ! [X6] : ((? [X7] : (ap(X4,X7) = X6 & mem(X7,X0)) | ~p(ap(X5,X6))) | ~mem(X6,X1))) | ~mem(X5,arr(X1,bool))) | ~mem(X4,arr(X0,X1))) & ! [X8] : (! [X9] : ((p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X0,X1),X8),X9)) <=> ! [X10] : ((? [X11] : (ap(X8,X11) = X10 & mem(X11,X0)) | p(ap(X9,X10))) | ~mem(X10,X1))) | ~mem(X9,arr(X1,bool))) | ~mem(X8,arr(X0,X1))) & ! [X12] : (! [X13] : ((p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X12),X13)) <=> ! [X14] : (~p(ap(X13,ap(X12,X14))) | ~mem(X14,X0))) | ~mem(X13,arr(X1,bool))) | ~mem(X12,arr(X0,X1))) & ! [X15] : (! [X16] : ((! [X17] : (p(ap(X16,ap(X15,X17))) | ~mem(X17,X0)) <=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X15),X16))) | ~mem(X16,arr(X1,bool))) | ~mem(X15,arr(X0,X1))) & (! [X18] : ((? [X19] : (mem(X19,X0) & ~p(ap(X3,ap(X2,X19)))) | p(ap(X3,X18))) | ~mem(X18,X1)) <=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X0,X1),X2),X3))) & (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X0,X1),X2),X3)) <=> ! [X20] : ((? [X21] : (mem(X21,X0) & p(ap(X3,ap(X2,X21)))) | ~p(ap(X3,X20))) | ~mem(X20,X1)))) | ~mem(X3,arr(X1,bool))) | ~mem(X2,arr(X0,X1))) | ~ne(X1)) | ~ne(X0))), 7.63/1.47 inference(ennf_transformation,[],[f75])). 7.63/1.47 7.63/1.47 fof(f133,plain,( 7.63/1.47 ! [X0] : (! [X1] : (! [X2] : (! [X3] : ((! [X4] : (! [X5] : ((p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X0,X1),X4),X5)) <=> ! [X6] : (? [X7] : (ap(X4,X7) = X6 & mem(X7,X0)) | ~p(ap(X5,X6)) | ~mem(X6,X1))) | ~mem(X5,arr(X1,bool))) | ~mem(X4,arr(X0,X1))) & ! [X8] : (! [X9] : ((p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X0,X1),X8),X9)) <=> ! [X10] : (? [X11] : (ap(X8,X11) = X10 & mem(X11,X0)) | p(ap(X9,X10)) | ~mem(X10,X1))) | ~mem(X9,arr(X1,bool))) | ~mem(X8,arr(X0,X1))) & ! [X12] : (! [X13] : ((p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X12),X13)) <=> ! [X14] : (~p(ap(X13,ap(X12,X14))) | ~mem(X14,X0))) | ~mem(X13,arr(X1,bool))) | ~mem(X12,arr(X0,X1))) & ! [X15] : (! [X16] : ((! [X17] : (p(ap(X16,ap(X15,X17))) | ~mem(X17,X0)) <=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X15),X16))) | ~mem(X16,arr(X1,bool))) | ~mem(X15,arr(X0,X1))) & (! [X18] : (? [X19] : (mem(X19,X0) & ~p(ap(X3,ap(X2,X19)))) | p(ap(X3,X18)) | ~mem(X18,X1)) <=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X0,X1),X2),X3))) & (p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X0,X1),X2),X3)) <=> ! [X20] : (? [X21] : (mem(X21,X0) & p(ap(X3,ap(X2,X21)))) | ~p(ap(X3,X20)) | ~mem(X20,X1)))) | ~mem(X3,arr(X1,bool))) | ~mem(X2,arr(X0,X1))) | ~ne(X1)) | ~ne(X0))), 7.63/1.47 inference(flattening,[],[f132])). 7.63/1.47 7.63/1.47 fof(f175,plain,( 7.63/1.47 ! [X1,X0] : (! [X15] : (! [X16] : ((! [X17] : (p(ap(X16,ap(X15,X17))) | ~mem(X17,X0)) <=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X15),X16))) | ~mem(X16,arr(X1,bool))) | ~mem(X15,arr(X0,X1))) | ~sP13(X1,X0))), 7.63/1.47 introduced(predicate_definition_introduction,[new_symbols(naming,[sP13])])). 7.63/1.47 7.63/1.47 fof(f174,plain,( 7.63/1.47 ! [X0,X1] : (! [X4] : (! [X5] : ((p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X0,X1),X4),X5)) <=> ! [X6] : (? [X7] : (ap(X4,X7) = X6 & mem(X7,X0)) | ~p(ap(X5,X6)) | ~mem(X6,X1))) | ~mem(X5,arr(X1,bool))) | ~mem(X4,arr(X0,X1))) | ~sP12(X0,X1))), 7.63/1.47 introduced(predicate_definition_introduction,[new_symbols(naming,[sP12])])). 7.63/1.47 7.63/1.47 fof(f173,plain,( 7.63/1.47 ! [X0,X1] : (! [X8] : (! [X9] : ((p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X0,X1),X8),X9)) <=> ! [X10] : (? [X11] : (ap(X8,X11) = X10 & mem(X11,X0)) | p(ap(X9,X10)) | ~mem(X10,X1))) | ~mem(X9,arr(X1,bool))) | ~mem(X8,arr(X0,X1))) | ~sP11(X0,X1))), 7.63/1.47 introduced(predicate_definition_introduction,[new_symbols(naming,[sP11])])). 7.63/1.47 7.63/1.47 fof(f172,plain,( 7.63/1.47 ! [X3,X2,X1,X0] : ((! [X18] : (? [X19] : (mem(X19,X0) & ~p(ap(X3,ap(X2,X19)))) | p(ap(X3,X18)) | ~mem(X18,X1)) <=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X0,X1),X2),X3))) | ~sP10(X3,X2,X1,X0))), 7.63/1.47 introduced(predicate_definition_introduction,[new_symbols(naming,[sP10])])). 7.63/1.47 7.63/1.47 fof(f171,plain,( 7.63/1.47 ! [X0,X2,X3,X1] : ((p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X0,X1),X2),X3)) <=> ! [X20] : (? [X21] : (mem(X21,X0) & p(ap(X3,ap(X2,X21)))) | ~p(ap(X3,X20)) | ~mem(X20,X1))) | ~sP9(X0,X2,X3,X1))), 7.63/1.47 introduced(predicate_definition_introduction,[new_symbols(naming,[sP9])])). 7.63/1.47 7.63/1.47 fof(f176,plain,( 7.63/1.47 ! [X0] : (! [X1] : (! [X2] : (! [X3] : ((sP12(X0,X1) & sP11(X0,X1) & ! [X12] : (! [X13] : ((p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X12),X13)) <=> ! [X14] : (~p(ap(X13,ap(X12,X14))) | ~mem(X14,X0))) | ~mem(X13,arr(X1,bool))) | ~mem(X12,arr(X0,X1))) & sP13(X1,X0) & sP10(X3,X2,X1,X0) & sP9(X0,X2,X3,X1)) | ~mem(X3,arr(X1,bool))) | ~mem(X2,arr(X0,X1))) | ~ne(X1)) | ~ne(X0))), 7.63/1.47 inference(definition_folding,[],[f133,f175,f174,f173,f172,f171])). 7.63/1.47 7.63/1.47 fof(f245,plain,( 7.63/1.47 ! [X0] : (! [X1] : (! [X2] : (! [X3] : ((sP12(X0,X1) & sP11(X0,X1) & ! [X12] : (! [X13] : (((p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X12),X13)) | ? [X14] : (p(ap(X13,ap(X12,X14))) & mem(X14,X0))) & (! [X14] : (~p(ap(X13,ap(X12,X14))) | ~mem(X14,X0)) | ~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X12),X13)))) | ~mem(X13,arr(X1,bool))) | ~mem(X12,arr(X0,X1))) & sP13(X1,X0) & sP10(X3,X2,X1,X0) & sP9(X0,X2,X3,X1)) | ~mem(X3,arr(X1,bool))) | ~mem(X2,arr(X0,X1))) | ~ne(X1)) | ~ne(X0))), 7.63/1.47 inference(nnf_transformation,[],[f176])). 7.63/1.47 7.63/1.47 fof(f246,plain,( 7.63/1.47 ! [X0] : (! [X1] : (! [X2] : (! [X3] : ((sP12(X0,X1) & sP11(X0,X1) & ! [X4] : (! [X5] : (((p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5)) | ? [X6] : (p(ap(X5,ap(X4,X6))) & mem(X6,X0))) & (! [X7] : (~p(ap(X5,ap(X4,X7))) | ~mem(X7,X0)) | ~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5)))) | ~mem(X5,arr(X1,bool))) | ~mem(X4,arr(X0,X1))) & sP13(X1,X0) & sP10(X3,X2,X1,X0) & sP9(X0,X2,X3,X1)) | ~mem(X3,arr(X1,bool))) | ~mem(X2,arr(X0,X1))) | ~ne(X1)) | ~ne(X0))), 7.63/1.47 inference(rectify,[],[f245])). 7.63/1.47 7.63/1.47 fof(f247,plain,( 7.63/1.47 ! [X5,X4,X0] : (? [X6] : (p(ap(X5,ap(X4,X6))) & mem(X6,X0)) => (p(ap(X5,ap(X4,sK30(X0,X4,X5)))) & mem(sK30(X0,X4,X5),X0)))), 7.63/1.47 introduced(choice_axiom,[])). 7.63/1.47 7.63/1.47 fof(f248,plain,( 7.63/1.47 ! [X0] : (! [X1] : (! [X2] : (! [X3] : ((sP12(X0,X1) & sP11(X0,X1) & ! [X4] : (! [X5] : (((p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5)) | (p(ap(X5,ap(X4,sK30(X0,X4,X5)))) & mem(sK30(X0,X4,X5),X0))) & (! [X7] : (~p(ap(X5,ap(X4,X7))) | ~mem(X7,X0)) | ~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5)))) | ~mem(X5,arr(X1,bool))) | ~mem(X4,arr(X0,X1))) & sP13(X1,X0) & sP10(X3,X2,X1,X0) & sP9(X0,X2,X3,X1)) | ~mem(X3,arr(X1,bool))) | ~mem(X2,arr(X0,X1))) | ~ne(X1)) | ~ne(X0))), 7.63/1.47 inference(skolemisation,[status(esa),new_symbols(skolem,[sK30])],[f246,f247])). 7.63/1.47 7.63/1.47 fof(f400,plain,( 7.63/1.47 ( ! [X4,X2,X0,X7,X5,X3,X1] : (~p(ap(X5,ap(X4,X7))) | ~mem(X7,X0) | ~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5)) | ~mem(X5,arr(X1,bool)) | ~mem(X4,arr(X0,X1)) | ~mem(X3,arr(X1,bool)) | ~mem(X2,arr(X0,X1)) | ~ne(X1) | ~ne(X0)) )), 7.63/1.47 inference(cnf_transformation,[],[f248])). 7.63/1.47 7.63/1.47 fof(f401,plain,( 7.63/1.47 ( ! [X4,X2,X0,X5,X3,X1] : (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5)) | mem(sK30(X0,X4,X5),X0) | ~mem(X5,arr(X1,bool)) | ~mem(X4,arr(X0,X1)) | ~mem(X3,arr(X1,bool)) | ~mem(X2,arr(X0,X1)) | ~ne(X1) | ~ne(X0)) )), 7.63/1.47 inference(cnf_transformation,[],[f248])). 7.63/1.47 7.63/1.47 fof(f402,plain,( 7.63/1.47 ( ! [X4,X2,X0,X5,X3,X1] : (p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X4),X5)) | p(ap(X5,ap(X4,sK30(X0,X4,X5)))) | ~mem(X5,arr(X1,bool)) | ~mem(X4,arr(X0,X1)) | ~mem(X3,arr(X1,bool)) | ~mem(X2,arr(X0,X1)) | ~ne(X1) | ~ne(X0)) )), 7.63/1.47 inference(cnf_transformation,[],[f248])). 7.63/1.47 7.63/1.47 fof(f433,plain,( 7.63/1.47 ~p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK35))), 7.63/1.47 inference(cnf_transformation,[],[f261])). 7.63/1.47 7.63/1.47 fof(f432,plain,( 7.63/1.47 p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK34))), 7.63/1.47 inference(cnf_transformation,[],[f261])). 7.63/1.47 7.63/1.47 fof(f430,plain,( 7.63/1.47 mem(sK35,arr(sK31,bool))), 7.63/1.47 inference(cnf_transformation,[],[f261])). 7.63/1.47 7.63/1.47 fof(f429,plain,( 7.63/1.47 mem(sK34,arr(sK31,bool))), 7.63/1.47 inference(cnf_transformation,[],[f261])). 7.63/1.47 7.63/1.47 fof(f428,plain,( 7.63/1.47 mem(sK33,arr(sK32,sK31))), 7.63/1.47 inference(cnf_transformation,[],[f261])). 7.63/1.47 7.63/1.47 fof(f427,plain,( 7.63/1.47 ne(sK32)), 7.63/1.47 inference(cnf_transformation,[],[f261])). 7.63/1.47 7.63/1.47 fof(f426,plain,( 7.63/1.47 ne(sK31)), 7.63/1.47 inference(cnf_transformation,[],[f261])). 7.63/1.47 7.63/1.47 cnf(c_139,negated_conjecture, 7.63/1.47 ( ~ mem(X0,sK31) | p(ap(sK34,X0)) | ~ p(ap(sK35,X0)) ), 7.63/1.47 inference(cnf_transformation,[],[f431]) ). 7.63/1.47 7.63/1.47 cnf(c_6454,plain, 7.63/1.47 ( ~ mem(ap(X0,X1),sK31) 7.63/1.47 | p(ap(sK34,ap(X0,X1))) 7.63/1.47 | ~ p(ap(sK35,ap(X0,X1))) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_139]) ). 7.63/1.47 7.63/1.47 cnf(c_15585,plain, 7.63/1.47 ( ~ mem(ap(sK33,sK30(sK32,sK33,sK35)),sK31) 7.63/1.47 | p(ap(sK34,ap(sK33,sK30(sK32,sK33,sK35)))) 7.63/1.47 | ~ p(ap(sK35,ap(sK33,sK30(sK32,sK33,sK35)))) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_6454]) ). 7.63/1.47 7.63/1.47 cnf(c_9,plain, 7.63/1.47 ( ~ mem(X0,X1) | ~ mem(X2,arr(X1,X3)) | mem(ap(X2,X0),X3) ), 7.63/1.47 inference(cnf_transformation,[],[f298]) ). 7.63/1.47 7.63/1.47 cnf(c_6670,plain, 7.63/1.47 ( ~ mem(X0,X1) | ~ mem(X2,arr(X1,sK31)) | mem(ap(X2,X0),sK31) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_9]) ). 7.63/1.47 7.63/1.47 cnf(c_10016,plain, 7.63/1.47 ( ~ mem(X0,arr(sK32,sK31)) 7.63/1.47 | ~ mem(sK30(sK32,sK33,sK35),sK32) 7.63/1.47 | mem(ap(X0,sK30(sK32,sK33,sK35)),sK31) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_6670]) ). 7.63/1.47 7.63/1.47 cnf(c_12340,plain, 7.63/1.47 ( ~ mem(sK30(sK32,sK33,sK35),sK32) 7.63/1.47 | mem(ap(sK33,sK30(sK32,sK33,sK35)),sK31) 7.63/1.47 | ~ mem(sK33,arr(sK32,sK31)) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_10016]) ). 7.63/1.47 7.63/1.47 cnf(c_112,plain, 7.63/1.47 ( ~ mem(X0,X1) 7.63/1.47 | ~ mem(X2,arr(X1,X3)) 7.63/1.47 | ~ mem(X4,arr(X1,X3)) 7.63/1.47 | ~ mem(X5,arr(X3,bool)) 7.63/1.47 | ~ mem(X6,arr(X3,bool)) 7.63/1.47 | ~ ne(X3) 7.63/1.47 | ~ ne(X1) 7.63/1.47 | ~ p(ap(X6,ap(X4,X0))) 7.63/1.47 | ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X3),X4),X6)) ), 7.63/1.47 inference(cnf_transformation,[],[f400]) ). 7.63/1.47 7.63/1.47 cnf(c_6414,plain, 7.63/1.47 ( ~ mem(X0,X1) 7.63/1.47 | ~ mem(X2,arr(X1,sK31)) 7.63/1.47 | ~ mem(X3,arr(X1,sK31)) 7.63/1.47 | ~ mem(X4,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK34,arr(sK31,bool)) 7.63/1.47 | ~ ne(X1) 7.63/1.47 | ~ ne(sK31) 7.63/1.47 | ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,sK31),X3),sK34)) 7.63/1.47 | ~ p(ap(sK34,ap(X3,X0))) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_112]) ). 7.63/1.47 7.63/1.47 cnf(c_7085,plain, 7.63/1.47 ( ~ mem(X0,X1) 7.63/1.47 | ~ mem(X2,arr(X1,sK31)) 7.63/1.47 | ~ mem(X3,arr(X1,sK31)) 7.63/1.47 | ~ mem(sK34,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK35,arr(sK31,bool)) 7.63/1.47 | ~ ne(X1) 7.63/1.47 | ~ ne(sK31) 7.63/1.47 | ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,sK31),X3),sK34)) 7.63/1.47 | ~ p(ap(sK34,ap(X3,X0))) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_6414]) ). 7.63/1.47 7.63/1.47 cnf(c_7755,plain, 7.63/1.47 ( ~ mem(X0,arr(sK32,sK31)) 7.63/1.47 | ~ mem(X1,arr(sK32,sK31)) 7.63/1.47 | ~ mem(sK30(sK32,sK33,sK35),sK32) 7.63/1.47 | ~ mem(sK34,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK35,arr(sK31,bool)) 7.63/1.47 | ~ ne(sK31) 7.63/1.47 | ~ ne(sK32) 7.63/1.47 | ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),X1),sK34)) 7.63/1.47 | ~ p(ap(sK34,ap(X1,sK30(sK32,sK33,sK35)))) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_7085]) ). 7.63/1.47 7.63/1.47 cnf(c_9573,plain, 7.63/1.47 ( ~ mem(X0,arr(sK32,sK31)) 7.63/1.47 | ~ mem(sK30(sK32,sK33,sK35),sK32) 7.63/1.47 | ~ mem(sK34,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK35,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK33,arr(sK32,sK31)) 7.63/1.47 | ~ ne(sK31) 7.63/1.47 | ~ ne(sK32) 7.63/1.47 | ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),X0),sK34)) 7.63/1.47 | ~ p(ap(sK34,ap(X0,sK30(sK32,sK33,sK35)))) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_7755]) ). 7.63/1.47 7.63/1.47 cnf(c_11470,plain, 7.63/1.47 ( ~ mem(sK30(sK32,sK33,sK35),sK32) 7.63/1.47 | ~ mem(sK34,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK35,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK33,arr(sK32,sK31)) 7.63/1.47 | ~ ne(sK31) 7.63/1.47 | ~ ne(sK32) 7.63/1.47 | ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK34)) 7.63/1.47 | ~ p(ap(sK34,ap(sK33,sK30(sK32,sK33,sK35)))) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_9573]) ). 7.63/1.47 7.63/1.47 cnf(c_111,plain, 7.63/1.47 ( ~ mem(X0,arr(X1,X2)) 7.63/1.47 | ~ mem(X3,arr(X1,X2)) 7.63/1.47 | ~ mem(X4,arr(X2,bool)) 7.63/1.47 | ~ mem(X5,arr(X2,bool)) 7.63/1.47 | mem(sK30(X1,X3,X5),X1) 7.63/1.47 | ~ ne(X2) 7.63/1.47 | ~ ne(X1) 7.63/1.47 | p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X3),X5)) ), 7.63/1.47 inference(cnf_transformation,[],[f401]) ). 7.63/1.47 7.63/1.47 cnf(c_6340,plain, 7.63/1.47 ( ~ mem(X0,arr(sK31,bool)) 7.63/1.47 | ~ mem(X1,arr(sK32,sK31)) 7.63/1.47 | mem(sK30(sK32,sK33,sK35),sK32) 7.63/1.47 | ~ mem(sK35,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK33,arr(sK32,sK31)) 7.63/1.47 | ~ ne(sK31) 7.63/1.47 | ~ ne(sK32) 7.63/1.47 | p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK35)) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_111]) ). 7.63/1.47 7.63/1.47 cnf(c_6604,plain, 7.63/1.47 ( ~ mem(X0,arr(sK32,sK31)) 7.63/1.47 | mem(sK30(sK32,sK33,sK35),sK32) 7.63/1.47 | ~ mem(sK35,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK33,arr(sK32,sK31)) 7.63/1.47 | ~ ne(sK31) 7.63/1.47 | ~ ne(sK32) 7.63/1.47 | p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK35)) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_6340]) ). 7.63/1.47 7.63/1.47 cnf(c_6911,plain, 7.63/1.47 ( mem(sK30(sK32,sK33,sK35),sK32) 7.63/1.47 | ~ mem(sK35,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK33,arr(sK32,sK31)) 7.63/1.47 | ~ ne(sK31) 7.63/1.47 | ~ ne(sK32) 7.63/1.47 | p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK35)) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_6604]) ). 7.63/1.47 7.63/1.47 cnf(c_110,plain, 7.63/1.47 ( ~ mem(X0,arr(X1,X2)) 7.63/1.47 | ~ mem(X3,arr(X1,X2)) 7.63/1.47 | ~ mem(X4,arr(X2,bool)) 7.63/1.47 | ~ mem(X5,arr(X2,bool)) 7.63/1.47 | ~ ne(X2) 7.63/1.47 | ~ ne(X1) 7.63/1.47 | p(ap(X5,ap(X3,sK30(X1,X3,X5)))) 7.63/1.47 | p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X3),X5)) ), 7.63/1.47 inference(cnf_transformation,[],[f402]) ). 7.63/1.47 7.63/1.47 cnf(c_6339,plain, 7.63/1.47 ( ~ mem(X0,arr(sK31,bool)) 7.63/1.47 | ~ mem(X1,arr(sK32,sK31)) 7.63/1.47 | ~ mem(sK35,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK33,arr(sK32,sK31)) 7.63/1.47 | ~ ne(sK31) 7.63/1.47 | ~ ne(sK32) 7.63/1.47 | p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK35)) 7.63/1.47 | p(ap(sK35,ap(sK33,sK30(sK32,sK33,sK35)))) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_110]) ). 7.63/1.47 7.63/1.47 cnf(c_6577,plain, 7.63/1.47 ( ~ mem(X0,arr(sK32,sK31)) 7.63/1.47 | ~ mem(sK35,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK33,arr(sK32,sK31)) 7.63/1.47 | ~ ne(sK31) 7.63/1.47 | ~ ne(sK32) 7.63/1.47 | p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK35)) 7.63/1.47 | p(ap(sK35,ap(sK33,sK30(sK32,sK33,sK35)))) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_6339]) ). 7.63/1.47 7.63/1.47 cnf(c_6891,plain, 7.63/1.47 ( ~ mem(sK35,arr(sK31,bool)) 7.63/1.47 | ~ mem(sK33,arr(sK32,sK31)) 7.63/1.47 | ~ ne(sK31) 7.63/1.47 | ~ ne(sK32) 7.63/1.47 | p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK35)) 7.63/1.47 | p(ap(sK35,ap(sK33,sK30(sK32,sK33,sK35)))) ), 7.63/1.47 inference(instantiation,[status(thm)],[c_6577]) ). 7.63/1.47 7.63/1.47 cnf(c_137,negated_conjecture, 7.63/1.47 ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK35)) ), 7.63/1.47 inference(cnf_transformation,[],[f433]) ). 7.63/1.47 7.63/1.47 cnf(c_138,negated_conjecture, 7.63/1.47 ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK32,sK31),sK33),sK34)) ), 7.63/1.47 inference(cnf_transformation,[],[f432]) ). 7.63/1.47 7.63/1.47 cnf(c_140,negated_conjecture, 7.63/1.47 ( mem(sK35,arr(sK31,bool)) ), 7.63/1.47 inference(cnf_transformation,[],[f430]) ). 7.63/1.47 7.63/1.47 cnf(c_141,negated_conjecture, 7.63/1.47 ( mem(sK34,arr(sK31,bool)) ), 7.63/1.47 inference(cnf_transformation,[],[f429]) ). 7.63/1.47 7.63/1.47 cnf(c_142,negated_conjecture, 7.63/1.47 ( mem(sK33,arr(sK32,sK31)) ), 7.63/1.47 inference(cnf_transformation,[],[f428]) ). 7.63/1.47 7.63/1.47 cnf(c_143,negated_conjecture, 7.63/1.47 ( ne(sK32) ), 7.63/1.47 inference(cnf_transformation,[],[f427]) ). 7.63/1.47 7.63/1.47 cnf(c_144,negated_conjecture, 7.63/1.47 ( ne(sK31) ), 7.63/1.47 inference(cnf_transformation,[],[f426]) ). 7.63/1.47 7.63/1.47 cnf(contradiction,plain, 7.63/1.47 ( $false ), 7.63/1.47 inference(minisat, 7.63/1.47 [status(thm)], 7.63/1.47 [c_15585,c_12340,c_11470,c_6911,c_6891,c_137,c_138,c_140, 7.63/1.47 c_141,c_142,c_143,c_144]) ). 7.63/1.47 7.63/1.47 7.63/1.47 % SZS output end CNFRefutation for theBenchmark.p 7.63/1.47 7.63/1.47 ------ Statistics 7.63/1.47 7.63/1.47 ------ General 7.63/1.47 7.63/1.47 abstr_ref_over_cycles: 0 7.63/1.47 abstr_ref_under_cycles: 0 7.63/1.47 gc_basic_clause_elim: 0 7.63/1.47 forced_gc_time: 0 7.63/1.47 parsing_time: 0.021 7.63/1.47 unif_index_cands_time: 0. 7.63/1.47 unif_index_add_time: 0. 7.63/1.47 orderings_time: 0. 7.63/1.47 out_proof_time: 0.033 7.63/1.47 total_time: 0.712 7.63/1.47 num_of_symbols: 92 7.63/1.47 num_of_terms: 15873 7.63/1.47 7.63/1.47 ------ Preprocessing 7.63/1.47 7.63/1.47 num_of_splits: 0 7.63/1.47 num_of_split_atoms: 0 7.63/1.47 num_of_reused_defs: 0 7.63/1.47 num_eq_ax_congr_red: 254 7.63/1.47 num_of_sem_filtered_clauses: 1 7.63/1.47 num_of_subtypes: 0 7.63/1.47 monotx_restored_types: 0 7.63/1.47 sat_num_of_epr_types: 0 7.63/1.47 sat_num_of_non_cyclic_types: 0 7.63/1.47 sat_guarded_non_collapsed_types: 0 7.63/1.47 num_pure_diseq_elim: 0 7.63/1.47 simp_replaced_by: 0 7.63/1.47 res_preprocessed: 434 7.63/1.47 prep_upred: 0 7.63/1.47 prep_unflattend: 12 7.63/1.47 smt_new_axioms: 0 7.63/1.47 pred_elim_cands: 8 7.63/1.47 pred_elim: 14 7.63/1.47 pred_elim_cl: 77 7.63/1.47 pred_elim_cycles: 25 7.63/1.47 merged_defs: 0 7.63/1.47 merged_defs_ncl: 0 7.63/1.47 bin_hyper_res: 0 7.63/1.47 prep_cycles: 4 7.63/1.47 pred_elim_time: 0.055 7.63/1.47 splitting_time: 0. 7.63/1.47 sem_filter_time: 0. 7.63/1.47 monotx_time: 0.001 7.63/1.47 subtype_inf_time: 0. 7.63/1.47 7.63/1.47 ------ Problem properties 7.63/1.47 7.63/1.47 clauses: 85 7.63/1.47 conjectures: 8 7.63/1.47 epr: 10 7.63/1.47 horn: 66 7.63/1.47 ground: 17 7.63/1.47 unary: 17 7.63/1.47 binary: 5 7.63/1.47 lits: 317 7.63/1.47 lits_eq: 12 7.63/1.47 fd_pure: 0 7.63/1.47 fd_pseudo: 0 7.63/1.47 fd_cond: 0 7.63/1.47 fd_pseudo_cond: 5 7.63/1.47 ac_symbols: 0 7.63/1.47 7.63/1.47 ------ Propositional Solver 7.63/1.47 7.63/1.47 prop_solver_calls: 29 7.63/1.47 prop_fast_solver_calls: 4009 7.63/1.47 smt_solver_calls: 0 7.63/1.47 smt_fast_solver_calls: 0 7.63/1.47 prop_num_of_clauses: 6163 7.63/1.47 prop_preprocess_simplified: 25648 7.63/1.47 prop_fo_subsumed: 39 7.63/1.47 prop_solver_time: 0. 7.63/1.47 smt_solver_time: 0. 7.63/1.47 smt_fast_solver_time: 0. 7.63/1.47 prop_fast_solver_time: 0. 7.63/1.47 prop_unsat_core_time: 0.001 7.63/1.47 7.63/1.47 ------ QBF 7.63/1.47 7.63/1.47 qbf_q_res: 0 7.63/1.47 qbf_num_tautologies: 0 7.63/1.47 qbf_prep_cycles: 0 7.63/1.47 7.63/1.47 ------ BMC1 7.63/1.47 7.63/1.47 bmc1_current_bound: -1 7.63/1.47 bmc1_last_solved_bound: -1 7.63/1.47 bmc1_unsat_core_size: -1 7.63/1.47 bmc1_unsat_core_parents_size: -1 7.63/1.47 bmc1_merge_next_fun: 0 7.63/1.47 bmc1_unsat_core_clauses_time: 0. 7.63/1.47 7.63/1.47 ------ Instantiation 7.63/1.47 7.63/1.47 inst_num_of_clauses: 1574 7.63/1.47 inst_num_in_passive: 1215 7.63/1.47 inst_num_in_active: 358 7.63/1.47 inst_num_in_unprocessed: 0 7.63/1.47 inst_num_of_loops: 363 7.63/1.47 inst_num_of_learning_restarts: 0 7.63/1.47 inst_num_moves_active_passive: 4 7.63/1.47 inst_lit_activity: 0 7.63/1.47 inst_lit_activity_moves: 0 7.63/1.47 inst_num_tautologies: 0 7.63/1.47 inst_num_prop_implied: 0 7.63/1.47 inst_num_existing_simplified: 0 7.63/1.47 inst_num_eq_res_simplified: 0 7.63/1.47 inst_num_child_elim: 0 7.63/1.47 inst_num_of_dismatching_blockings: 134 7.63/1.47 inst_num_of_non_proper_insts: 604 7.63/1.47 inst_num_of_duplicates: 0 7.63/1.47 inst_inst_num_from_inst_to_res: 0 7.63/1.47 inst_dismatching_checking_time: 0. 7.63/1.47 7.63/1.47 ------ Resolution 7.63/1.47 7.63/1.47 res_num_of_clauses: 0 7.63/1.47 res_num_in_passive: 0 7.63/1.47 res_num_in_active: 0 7.63/1.47 res_num_of_loops: 438 7.63/1.47 res_forward_subset_subsumed: 38 7.63/1.47 res_backward_subset_subsumed: 0 7.63/1.47 res_forward_subsumed: 9 7.63/1.47 res_backward_subsumed: 11 7.63/1.47 res_forward_subsumption_resolution: 1 7.63/1.47 res_backward_subsumption_resolution: 0 7.63/1.47 res_clause_to_clause_subsumption: 483 7.63/1.47 res_orphan_elimination: 0 7.63/1.47 res_tautology_del: 141 7.63/1.47 res_num_eq_res_simplified: 0 7.63/1.47 res_num_sel_changes: 0 7.63/1.47 res_moves_from_active_to_pass: 0 7.63/1.47 7.63/1.47 ------ Superposition 7.63/1.47 7.63/1.47 sup_time_total: 0. 7.63/1.47 sup_time_generating: 0. 7.63/1.47 sup_time_sim_full: 0. 7.63/1.47 sup_time_sim_immed: 0. 7.63/1.47 7.63/1.47 sup_num_of_clauses: 170 7.63/1.47 sup_num_in_active: 72 7.63/1.47 sup_num_in_passive: 98 7.63/1.47 sup_num_of_loops: 72 7.63/1.47 sup_fw_superposition: 44 7.63/1.47 sup_bw_superposition: 42 7.63/1.47 sup_immediate_simplified: 1 7.63/1.47 sup_given_eliminated: 0 7.63/1.47 comparisons_done: 0 7.63/1.47 comparisons_avoided: 0 7.63/1.47 7.63/1.47 ------ Simplifications 7.63/1.47 7.63/1.47 7.63/1.47 sim_fw_subset_subsumed: 1 7.63/1.47 sim_bw_subset_subsumed: 0 7.63/1.47 sim_fw_subsumed: 0 7.63/1.47 sim_bw_subsumed: 0 7.63/1.47 sim_fw_subsumption_res: 0 7.63/1.47 sim_bw_subsumption_res: 0 7.63/1.47 sim_tautology_del: 0 7.63/1.47 sim_eq_tautology_del: 0 7.63/1.47 sim_eq_res_simp: 0 7.63/1.47 sim_fw_demodulated: 0 7.63/1.47 sim_bw_demodulated: 0 7.63/1.47 sim_light_normalised: 0 7.63/1.47 sim_joinable_taut: 0 7.63/1.47 sim_joinable_simp: 0 7.63/1.47 sim_ac_normalised: 0 7.63/1.47 sim_smt_subsumption: 0 7.63/1.47 7.63/1.48 EOF