0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.12 % Command : iproveropt_run.sh %d %s 0.13/0.33 % Computer : n005.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 960 0.13/0.33 % WCLimit : 120 0.13/0.33 % DateTime : Thu Jul 2 08:55:21 EDT 2020 0.13/0.33 % CPUTime : 0.13/0.34 % Running in FOF mode 7.23/1.50 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p 7.23/1.50 7.23/1.50 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 7.23/1.50 7.23/1.50 ------ iProver source info 7.23/1.50 7.23/1.50 git: date: 2020-06-30 10:37:57 +0100 7.23/1.50 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 7.23/1.50 git: non_committed_changes: false 7.23/1.50 git: last_make_outside_of_git: false 7.23/1.50 7.23/1.50 ------ 7.23/1.50 7.23/1.50 ------ Input Options 7.23/1.50 7.23/1.50 --out_options all 7.23/1.50 --tptp_safe_out true 7.23/1.50 --problem_path "" 7.23/1.50 --include_path "" 7.23/1.50 --clausifier res/vclausify_rel 7.23/1.50 --clausifier_options --mode clausify 7.23/1.50 --stdin false 7.23/1.50 --stats_out all 7.23/1.50 7.23/1.50 ------ General Options 7.23/1.50 7.23/1.50 --fof false 7.23/1.50 --time_out_real 125. 7.23/1.50 --time_out_virtual -1. 7.23/1.50 --symbol_type_check false 7.23/1.50 --clausify_out false 7.23/1.50 --sig_cnt_out false 7.23/1.50 --trig_cnt_out false 7.23/1.50 --trig_cnt_out_tolerance 1. 7.23/1.50 --trig_cnt_out_sk_spl false 7.23/1.50 --abstr_cl_out false 7.23/1.50 7.23/1.50 ------ Global Options 7.23/1.50 7.23/1.50 --schedule default 7.23/1.50 --add_important_lit false 7.23/1.50 --prop_solver_per_cl 1000 7.23/1.50 --min_unsat_core false 7.23/1.50 --soft_assumptions false 7.23/1.50 --soft_lemma_size 3 7.23/1.50 --prop_impl_unit_size 0 7.23/1.50 --prop_impl_unit [] 7.23/1.50 --share_sel_clauses true 7.23/1.50 --reset_solvers false 7.23/1.50 --bc_imp_inh [conj_cone] 7.23/1.50 --conj_cone_tolerance 3. 7.23/1.50 --extra_neg_conj none 7.23/1.50 --large_theory_mode true 7.23/1.50 --prolific_symb_bound 200 7.23/1.50 --lt_threshold 2000 7.23/1.50 --clause_weak_htbl true 7.23/1.50 --gc_record_bc_elim false 7.23/1.50 7.23/1.50 ------ Preprocessing Options 7.23/1.50 7.23/1.50 --preprocessing_flag true 7.23/1.50 --time_out_prep_mult 0.1 7.23/1.50 --splitting_mode input 7.23/1.50 --splitting_grd true 7.23/1.50 --splitting_cvd false 7.23/1.50 --splitting_cvd_svl false 7.23/1.50 --splitting_nvd 32 7.23/1.50 --sub_typing true 7.23/1.50 --prep_gs_sim true 7.23/1.50 --prep_unflatten true 7.23/1.50 --prep_res_sim true 7.23/1.50 --prep_upred true 7.23/1.50 --prep_sem_filter exhaustive 7.23/1.50 --prep_sem_filter_out false 7.23/1.50 --pred_elim true 7.23/1.50 --res_sim_input true 7.23/1.50 --eq_ax_congr_red true 7.23/1.50 --pure_diseq_elim true 7.23/1.50 --brand_transform false 7.23/1.50 --non_eq_to_eq false 7.23/1.50 --prep_def_merge true 7.23/1.50 --prep_def_merge_prop_impl false 7.23/1.50 --prep_def_merge_mbd true 7.23/1.50 --prep_def_merge_tr_red false 7.23/1.50 --prep_def_merge_tr_cl false 7.23/1.50 --smt_preprocessing true 7.23/1.50 --smt_ac_axioms fast 7.23/1.50 --preprocessed_out false 7.23/1.50 --preprocessed_stats false 7.23/1.50 7.23/1.50 ------ Abstraction refinement Options 7.23/1.50 7.23/1.50 --abstr_ref [] 7.23/1.50 --abstr_ref_prep false 7.23/1.50 --abstr_ref_until_sat false 7.23/1.50 --abstr_ref_sig_restrict funpre 7.23/1.50 --abstr_ref_af_restrict_to_split_sk false 7.23/1.50 --abstr_ref_under [] 7.23/1.50 7.23/1.50 ------ SAT Options 7.23/1.50 7.23/1.50 --sat_mode false 7.23/1.50 --sat_fm_restart_options "" 7.23/1.50 --sat_gr_def false 7.23/1.50 --sat_epr_types true 7.23/1.50 --sat_non_cyclic_types false 7.23/1.50 --sat_finite_models false 7.23/1.50 --sat_fm_lemmas false 7.23/1.50 --sat_fm_prep false 7.23/1.50 --sat_fm_uc_incr true 7.23/1.50 --sat_out_model small 7.23/1.50 --sat_out_clauses false 7.23/1.50 7.23/1.50 ------ QBF Options 7.23/1.50 7.23/1.50 --qbf_mode false 7.23/1.50 --qbf_elim_univ false 7.23/1.50 --qbf_dom_inst none 7.23/1.50 --qbf_dom_pre_inst false 7.23/1.50 --qbf_sk_in false 7.23/1.50 --qbf_pred_elim true 7.23/1.50 --qbf_split 512 7.23/1.50 7.23/1.50 ------ BMC1 Options 7.23/1.50 7.23/1.50 --bmc1_incremental false 7.23/1.50 --bmc1_axioms reachable_all 7.23/1.50 --bmc1_min_bound 0 7.23/1.50 --bmc1_max_bound -1 7.23/1.50 --bmc1_max_bound_default -1 7.23/1.50 --bmc1_symbol_reachability true 7.23/1.50 --bmc1_property_lemmas false 7.23/1.50 --bmc1_k_induction false 7.23/1.50 --bmc1_non_equiv_states false 7.23/1.50 --bmc1_deadlock false 7.23/1.50 --bmc1_ucm false 7.23/1.50 --bmc1_add_unsat_core none 7.23/1.50 --bmc1_unsat_core_children false 7.23/1.50 --bmc1_unsat_core_extrapolate_axioms false 7.23/1.50 --bmc1_out_stat full 7.23/1.50 --bmc1_ground_init false 7.23/1.50 --bmc1_pre_inst_next_state false 7.23/1.50 --bmc1_pre_inst_state false 7.23/1.50 --bmc1_pre_inst_reach_state false 7.23/1.50 --bmc1_out_unsat_core false 7.23/1.50 --bmc1_aig_witness_out false 7.23/1.50 --bmc1_verbose false 7.23/1.50 --bmc1_dump_clauses_tptp false 7.23/1.50 --bmc1_dump_unsat_core_tptp false 7.23/1.50 --bmc1_dump_file - 7.23/1.50 --bmc1_ucm_expand_uc_limit 128 7.23/1.50 --bmc1_ucm_n_expand_iterations 6 7.23/1.50 --bmc1_ucm_extend_mode 1 7.23/1.50 --bmc1_ucm_init_mode 2 7.23/1.50 --bmc1_ucm_cone_mode none 7.23/1.50 --bmc1_ucm_reduced_relation_type 0 7.23/1.50 --bmc1_ucm_relax_model 4 7.23/1.50 --bmc1_ucm_full_tr_after_sat true 7.23/1.50 --bmc1_ucm_expand_neg_assumptions false 7.23/1.50 --bmc1_ucm_layered_model none 7.23/1.50 --bmc1_ucm_max_lemma_size 10 7.23/1.50 7.23/1.50 ------ AIG Options 7.23/1.50 7.23/1.50 --aig_mode false 7.23/1.50 7.23/1.50 ------ Instantiation Options 7.23/1.50 7.23/1.50 --instantiation_flag true 7.23/1.50 --inst_sos_flag false 7.23/1.50 --inst_sos_phase true 7.23/1.50 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 7.23/1.50 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 7.23/1.50 --inst_lit_sel_side num_symb 7.23/1.50 --inst_solver_per_active 1400 7.23/1.50 --inst_solver_calls_frac 1. 7.23/1.50 --inst_passive_queue_type priority_queues 7.23/1.50 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 7.23/1.50 --inst_passive_queues_freq [25;2] 7.23/1.50 --inst_dismatching true 7.23/1.50 --inst_eager_unprocessed_to_passive true 7.23/1.50 --inst_prop_sim_given true 7.23/1.50 --inst_prop_sim_new false 7.23/1.50 --inst_subs_new false 7.23/1.50 --inst_eq_res_simp false 7.23/1.50 --inst_subs_given false 7.23/1.50 --inst_orphan_elimination true 7.23/1.50 --inst_learning_loop_flag true 7.23/1.50 --inst_learning_start 3000 7.23/1.50 --inst_learning_factor 2 7.23/1.50 --inst_start_prop_sim_after_learn 3 7.23/1.50 --inst_sel_renew solver 7.23/1.50 --inst_lit_activity_flag true 7.23/1.50 --inst_restr_to_given false 7.23/1.50 --inst_activity_threshold 500 7.23/1.50 --inst_out_proof true 7.23/1.50 7.23/1.50 ------ Resolution Options 7.23/1.50 7.23/1.50 --resolution_flag true 7.23/1.50 --res_lit_sel adaptive 7.23/1.50 --res_lit_sel_side none 7.23/1.50 --res_ordering kbo 7.23/1.50 --res_to_prop_solver active 7.23/1.50 --res_prop_simpl_new false 7.23/1.50 --res_prop_simpl_given true 7.23/1.50 --res_passive_queue_type priority_queues 7.23/1.50 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 7.23/1.50 --res_passive_queues_freq [15;5] 7.23/1.50 --res_forward_subs full 7.23/1.50 --res_backward_subs full 7.23/1.50 --res_forward_subs_resolution true 7.23/1.50 --res_backward_subs_resolution true 7.23/1.50 --res_orphan_elimination true 7.23/1.50 --res_time_limit 2. 7.23/1.50 --res_out_proof true 7.23/1.50 7.23/1.50 ------ Superposition Options 7.23/1.50 7.23/1.50 --superposition_flag true 7.23/1.50 --sup_passive_queue_type priority_queues 7.23/1.50 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 7.23/1.50 --sup_passive_queues_freq [8;1;4] 7.23/1.50 --demod_completeness_check fast 7.23/1.50 --demod_use_ground true 7.23/1.50 --sup_to_prop_solver passive 7.23/1.50 --sup_prop_simpl_new true 7.23/1.50 --sup_prop_simpl_given true 7.23/1.50 --sup_fun_splitting false 7.23/1.50 --sup_smt_interval 50000 7.23/1.50 7.23/1.50 ------ Superposition Simplification Setup 7.23/1.50 7.23/1.50 --sup_indices_passive [] 7.23/1.50 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 7.23/1.50 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 7.23/1.50 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 7.23/1.50 --sup_full_triv [TrivRules;PropSubs] 7.23/1.50 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 7.23/1.50 --sup_full_bw [BwDemod] 7.23/1.50 --sup_immed_triv [TrivRules] 7.23/1.50 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 7.23/1.50 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 7.23/1.50 --sup_immed_bw_main [] 7.23/1.50 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 7.23/1.50 --sup_input_triv [Unflattening;TrivRules] 7.23/1.50 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 7.23/1.50 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 7.23/1.50 7.23/1.50 ------ Combination Options 7.23/1.50 7.23/1.50 --comb_res_mult 3 7.23/1.50 --comb_sup_mult 2 7.23/1.50 --comb_inst_mult 10 7.23/1.50 7.23/1.50 ------ Debug Options 7.23/1.50 7.23/1.50 --dbg_backtrace false 7.23/1.50 --dbg_dump_prop_clauses false 7.23/1.50 --dbg_dump_prop_clauses_file - 7.23/1.50 --dbg_out_stat false 7.23/1.50 ------ Parsing... 7.23/1.50 ------ Clausification by vclausify_rel & Parsing by iProver... 7.23/1.50 7.23/1.50 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e 7.23/1.50 7.23/1.50 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 7.23/1.50 7.23/1.50 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 7.23/1.50 ------ Proving... 7.23/1.50 ------ Problem Properties 7.23/1.50 7.23/1.50 7.23/1.50 clauses 80 7.23/1.50 conjectures 0 7.23/1.50 EPR 5 7.23/1.50 Horn 37 7.23/1.50 unary 4 7.23/1.50 binary 19 7.23/1.50 lits 213 7.23/1.50 lits eq 3 7.23/1.50 fd_pure 0 7.23/1.50 fd_pseudo 0 7.23/1.50 fd_cond 0 7.23/1.50 fd_pseudo_cond 2 7.23/1.50 AC symbols 0 7.23/1.50 7.23/1.50 ------ Schedule dynamic 5 is on 7.23/1.50 7.23/1.50 ------ no conjectures: strip conj schedule 7.23/1.50 7.23/1.50 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10. 7.23/1.50 7.23/1.50 7.23/1.50 ------ 7.23/1.50 Current options: 7.23/1.50 ------ 7.23/1.50 7.23/1.50 ------ Input Options 7.23/1.50 7.23/1.50 --out_options all 7.23/1.50 --tptp_safe_out true 7.23/1.50 --problem_path "" 7.23/1.50 --include_path "" 7.23/1.50 --clausifier res/vclausify_rel 7.23/1.50 --clausifier_options --mode clausify 7.23/1.50 --stdin false 7.23/1.50 --stats_out all 7.23/1.50 7.23/1.50 ------ General Options 7.23/1.50 7.23/1.50 --fof false 7.23/1.50 --time_out_real 125. 7.23/1.50 --time_out_virtual -1. 7.23/1.50 --symbol_type_check false 7.23/1.50 --clausify_out false 7.23/1.50 --sig_cnt_out false 7.23/1.50 --trig_cnt_out false 7.23/1.50 --trig_cnt_out_tolerance 1. 7.23/1.50 --trig_cnt_out_sk_spl false 7.23/1.50 --abstr_cl_out false 7.23/1.50 7.23/1.50 ------ Global Options 7.23/1.50 7.23/1.50 --schedule default 7.23/1.50 --add_important_lit false 7.23/1.50 --prop_solver_per_cl 1000 7.23/1.50 --min_unsat_core false 7.23/1.50 --soft_assumptions false 7.23/1.50 --soft_lemma_size 3 7.23/1.50 --prop_impl_unit_size 0 7.23/1.50 --prop_impl_unit [] 7.23/1.50 --share_sel_clauses true 7.23/1.50 --reset_solvers false 7.23/1.50 --bc_imp_inh [conj_cone] 7.23/1.50 --conj_cone_tolerance 3. 7.23/1.50 --extra_neg_conj none 7.23/1.50 --large_theory_mode true 7.23/1.50 --prolific_symb_bound 200 7.23/1.50 --lt_threshold 2000 7.23/1.50 --clause_weak_htbl true 7.23/1.50 --gc_record_bc_elim false 7.23/1.50 7.23/1.50 ------ Preprocessing Options 7.23/1.50 7.23/1.50 --preprocessing_flag true 7.23/1.50 --time_out_prep_mult 0.1 7.23/1.50 --splitting_mode input 7.23/1.50 --splitting_grd true 7.23/1.50 --splitting_cvd false 7.23/1.50 --splitting_cvd_svl false 7.23/1.50 --splitting_nvd 32 7.23/1.50 --sub_typing true 7.23/1.50 --prep_gs_sim true 7.23/1.50 --prep_unflatten true 7.23/1.50 --prep_res_sim true 7.23/1.50 --prep_upred true 7.23/1.50 --prep_sem_filter exhaustive 7.23/1.50 --prep_sem_filter_out false 7.23/1.50 --pred_elim true 7.23/1.50 --res_sim_input true 7.23/1.50 --eq_ax_congr_red true 7.23/1.50 --pure_diseq_elim true 7.23/1.50 --brand_transform false 7.23/1.50 --non_eq_to_eq false 7.23/1.50 --prep_def_merge true 7.23/1.50 --prep_def_merge_prop_impl false 7.23/1.50 --prep_def_merge_mbd true 7.23/1.50 --prep_def_merge_tr_red false 7.23/1.50 --prep_def_merge_tr_cl false 7.23/1.50 --smt_preprocessing true 7.23/1.50 --smt_ac_axioms fast 7.23/1.50 --preprocessed_out false 7.23/1.50 --preprocessed_stats false 7.23/1.50 7.23/1.50 ------ Abstraction refinement Options 7.23/1.50 7.23/1.50 --abstr_ref [] 7.23/1.50 --abstr_ref_prep false 7.23/1.50 --abstr_ref_until_sat false 7.23/1.50 --abstr_ref_sig_restrict funpre 7.23/1.50 --abstr_ref_af_restrict_to_split_sk false 7.23/1.50 --abstr_ref_under [] 7.23/1.50 7.23/1.50 ------ SAT Options 7.23/1.50 7.23/1.50 --sat_mode false 7.23/1.50 --sat_fm_restart_options "" 7.23/1.50 --sat_gr_def false 7.23/1.50 --sat_epr_types true 7.23/1.50 --sat_non_cyclic_types false 7.23/1.50 --sat_finite_models false 7.23/1.50 --sat_fm_lemmas false 7.23/1.50 --sat_fm_prep false 7.23/1.50 --sat_fm_uc_incr true 7.23/1.50 --sat_out_model small 7.23/1.50 --sat_out_clauses false 7.23/1.50 7.23/1.50 ------ QBF Options 7.23/1.50 7.23/1.50 --qbf_mode false 7.23/1.50 --qbf_elim_univ false 7.23/1.50 --qbf_dom_inst none 7.23/1.50 --qbf_dom_pre_inst false 7.23/1.50 --qbf_sk_in false 7.23/1.50 --qbf_pred_elim true 7.23/1.50 --qbf_split 512 7.23/1.50 7.23/1.50 ------ BMC1 Options 7.23/1.50 7.23/1.50 --bmc1_incremental false 7.23/1.50 --bmc1_axioms reachable_all 7.23/1.50 --bmc1_min_bound 0 7.23/1.50 --bmc1_max_bound -1 7.23/1.50 --bmc1_max_bound_default -1 7.23/1.50 --bmc1_symbol_reachability true 7.23/1.50 --bmc1_property_lemmas false 7.23/1.50 --bmc1_k_induction false 7.23/1.50 --bmc1_non_equiv_states false 7.23/1.50 --bmc1_deadlock false 7.23/1.50 --bmc1_ucm false 7.23/1.50 --bmc1_add_unsat_core none 7.23/1.50 --bmc1_unsat_core_children false 7.23/1.50 --bmc1_unsat_core_extrapolate_axioms false 7.23/1.50 --bmc1_out_stat full 7.23/1.50 --bmc1_ground_init false 7.23/1.50 --bmc1_pre_inst_next_state false 7.23/1.50 --bmc1_pre_inst_state false 7.23/1.50 --bmc1_pre_inst_reach_state false 7.23/1.50 --bmc1_out_unsat_core false 7.23/1.50 --bmc1_aig_witness_out false 7.23/1.50 --bmc1_verbose false 7.23/1.50 --bmc1_dump_clauses_tptp false 7.23/1.50 --bmc1_dump_unsat_core_tptp false 7.23/1.50 --bmc1_dump_file - 7.23/1.50 --bmc1_ucm_expand_uc_limit 128 7.23/1.50 --bmc1_ucm_n_expand_iterations 6 7.23/1.50 --bmc1_ucm_extend_mode 1 7.23/1.50 --bmc1_ucm_init_mode 2 7.23/1.50 --bmc1_ucm_cone_mode none 7.23/1.50 --bmc1_ucm_reduced_relation_type 0 7.23/1.50 --bmc1_ucm_relax_model 4 7.23/1.50 --bmc1_ucm_full_tr_after_sat true 7.23/1.50 --bmc1_ucm_expand_neg_assumptions false 7.23/1.50 --bmc1_ucm_layered_model none 7.23/1.50 --bmc1_ucm_max_lemma_size 10 7.23/1.50 7.23/1.50 ------ AIG Options 7.23/1.50 7.23/1.50 --aig_mode false 7.23/1.50 7.23/1.50 ------ Instantiation Options 7.23/1.50 7.23/1.50 --instantiation_flag true 7.23/1.50 --inst_sos_flag false 7.23/1.50 --inst_sos_phase true 7.23/1.50 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 7.23/1.50 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 7.23/1.50 --inst_lit_sel_side none 7.23/1.50 --inst_solver_per_active 1400 7.23/1.50 --inst_solver_calls_frac 1. 7.23/1.50 --inst_passive_queue_type priority_queues 7.23/1.50 --inst_passive_queues [[-num_var];[+age;-num_symb]] 7.23/1.50 --inst_passive_queues_freq [25;2] 7.23/1.50 --inst_dismatching true 7.23/1.50 --inst_eager_unprocessed_to_passive true 7.23/1.50 --inst_prop_sim_given true 7.23/1.50 --inst_prop_sim_new false 7.23/1.50 --inst_subs_new false 7.23/1.50 --inst_eq_res_simp false 7.23/1.50 --inst_subs_given false 7.23/1.50 --inst_orphan_elimination true 7.23/1.50 --inst_learning_loop_flag true 7.23/1.50 --inst_learning_start 3000 7.23/1.50 --inst_learning_factor 2 7.23/1.50 --inst_start_prop_sim_after_learn 3 7.23/1.50 --inst_sel_renew solver 7.23/1.50 --inst_lit_activity_flag true 7.23/1.50 --inst_restr_to_given false 7.23/1.50 --inst_activity_threshold 500 7.23/1.50 --inst_out_proof true 7.23/1.50 7.23/1.50 ------ Resolution Options 7.23/1.50 7.23/1.50 --resolution_flag false 7.23/1.50 --res_lit_sel adaptive 7.23/1.50 --res_lit_sel_side none 7.23/1.50 --res_ordering kbo 7.23/1.50 --res_to_prop_solver active 7.23/1.50 --res_prop_simpl_new false 7.23/1.50 --res_prop_simpl_given true 7.23/1.50 --res_passive_queue_type priority_queues 7.23/1.50 --res_passive_queues [[-num_symb];[+age;-num_symb]] 7.23/1.50 --res_passive_queues_freq [15;5] 7.23/1.50 --res_forward_subs full 7.23/1.50 --res_backward_subs full 7.23/1.50 --res_forward_subs_resolution true 7.23/1.50 --res_backward_subs_resolution true 7.23/1.50 --res_orphan_elimination true 7.23/1.50 --res_time_limit 2. 7.23/1.50 --res_out_proof true 7.23/1.50 7.23/1.50 ------ Superposition Options 7.23/1.50 7.23/1.50 --superposition_flag true 7.23/1.50 --sup_passive_queue_type priority_queues 7.23/1.50 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 7.23/1.50 --sup_passive_queues_freq [8;1;4] 7.23/1.50 --demod_completeness_check fast 7.23/1.50 --demod_use_ground true 7.23/1.50 --sup_to_prop_solver passive 7.23/1.50 --sup_prop_simpl_new true 7.23/1.50 --sup_prop_simpl_given true 7.23/1.50 --sup_fun_splitting false 7.23/1.50 --sup_smt_interval 50000 7.23/1.50 7.23/1.50 ------ Superposition Simplification Setup 7.23/1.50 7.23/1.50 --sup_indices_passive [] 7.23/1.50 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 7.23/1.50 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 7.23/1.50 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 7.23/1.50 --sup_full_triv [TrivRules;PropSubs] 7.23/1.50 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 7.23/1.50 --sup_full_bw [BwDemod] 7.23/1.50 --sup_immed_triv [TrivRules] 7.23/1.50 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 7.23/1.50 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 7.23/1.50 --sup_immed_bw_main [] 7.23/1.50 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 7.23/1.50 --sup_input_triv [Unflattening;TrivRules] 7.23/1.50 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 7.23/1.50 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 7.23/1.50 7.23/1.50 ------ Combination Options 7.23/1.50 7.23/1.50 --comb_res_mult 3 7.23/1.50 --comb_sup_mult 2 7.23/1.50 --comb_inst_mult 10 7.23/1.50 7.23/1.50 ------ Debug Options 7.23/1.50 7.23/1.50 --dbg_backtrace false 7.23/1.50 --dbg_dump_prop_clauses false 7.23/1.50 --dbg_dump_prop_clauses_file - 7.23/1.50 --dbg_out_stat false 7.23/1.50 7.23/1.50 7.23/1.50 7.23/1.50 7.23/1.50 ------ Proving... 7.23/1.50 7.23/1.50 7.23/1.50 % SZS status Theorem for theBenchmark.p 7.23/1.50 7.23/1.50 % SZS output start CNFRefutation for theBenchmark.p 7.23/1.50 7.23/1.50 fof(f6,axiom,( 7.23/1.50 ! [X1,X2] : (subset(X1,X2) <=> ! [X0] : (member(X0,X1) => member(X0,X2)))), 7.23/1.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 7.23/1.50 7.23/1.50 fof(f22,plain,( 7.23/1.50 ! [X0,X1] : (subset(X0,X1) <=> ! [X2] : (member(X2,X0) => member(X2,X1)))), 7.23/1.50 inference(rectify,[],[f6])). 7.23/1.50 7.23/1.50 fof(f34,plain,( 7.23/1.50 ! [X0,X1] : (subset(X0,X1) <=> ! [X2] : (member(X2,X1) | ~member(X2,X0)))), 7.23/1.50 inference(ennf_transformation,[],[f22])). 7.23/1.50 7.23/1.50 fof(f50,plain,( 7.23/1.50 ! [X0,X1] : ((subset(X0,X1) | ? [X2] : (~member(X2,X1) & member(X2,X0))) & (! [X2] : (member(X2,X1) | ~member(X2,X0)) | ~subset(X0,X1)))), 7.23/1.50 inference(nnf_transformation,[],[f34])). 7.23/1.50 7.23/1.50 fof(f51,plain,( 7.23/1.50 ! [X0,X1] : ((subset(X0,X1) | ? [X2] : (~member(X2,X1) & member(X2,X0))) & (! [X3] : (member(X3,X1) | ~member(X3,X0)) | ~subset(X0,X1)))), 7.23/1.50 inference(rectify,[],[f50])). 7.23/1.50 7.23/1.50 fof(f52,plain,( 7.23/1.50 ! [X1,X0] : (? [X2] : (~member(X2,X1) & member(X2,X0)) => (~member(sK2(X0,X1),X1) & member(sK2(X0,X1),X0)))), 7.23/1.50 introduced(choice_axiom,[])). 7.23/1.50 7.23/1.50 fof(f53,plain,( 7.23/1.50 ! [X0,X1] : ((subset(X0,X1) | (~member(sK2(X0,X1),X1) & member(sK2(X0,X1),X0))) & (! [X3] : (member(X3,X1) | ~member(X3,X0)) | ~subset(X0,X1)))), 7.23/1.50 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f51,f52])). 7.23/1.50 7.23/1.50 fof(f91,plain,( 7.23/1.50 ( ! [X0,X1] : (subset(X0,X1) | member(sK2(X0,X1),X0)) )), 7.23/1.50 inference(cnf_transformation,[],[f53])). 7.23/1.50 7.23/1.50 fof(f38,plain,( 7.23/1.50 ! [X1,X0] : (? [X2,X3,X4] : (~apply(X1,X2,X4) & apply(X1,X3,X4) & apply(X1,X2,X3) & member(X3,X0) & member(X4,X0) & member(X2,X0)) | ~sP0(X1,X0))), 7.23/1.50 introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])])). 7.23/1.50 7.23/1.50 fof(f66,plain,( 7.23/1.50 ! [X1,X0] : (? [X2,X3,X4] : (~apply(X1,X2,X4) & apply(X1,X3,X4) & apply(X1,X2,X3) & member(X3,X0) & member(X4,X0) & member(X2,X0)) | ~sP0(X1,X0))), 7.23/1.50 inference(nnf_transformation,[],[f38])). 7.23/1.50 7.23/1.50 fof(f67,plain,( 7.23/1.50 ! [X0,X1] : (? [X2,X3,X4] : (~apply(X0,X2,X4) & apply(X0,X3,X4) & apply(X0,X2,X3) & member(X3,X1) & member(X4,X1) & member(X2,X1)) | ~sP0(X0,X1))), 7.23/1.50 inference(rectify,[],[f66])). 7.23/1.50 7.23/1.50 fof(f68,plain,( 7.23/1.50 ! [X1,X0] : (? [X2,X3,X4] : (~apply(X0,X2,X4) & apply(X0,X3,X4) & apply(X0,X2,X3) & member(X3,X1) & member(X4,X1) & member(X2,X1)) => (~apply(X0,sK4(X0,X1),sK6(X0,X1)) & apply(X0,sK5(X0,X1),sK6(X0,X1)) & apply(X0,sK4(X0,X1),sK5(X0,X1)) & member(sK5(X0,X1),X1) & member(sK6(X0,X1),X1) & member(sK4(X0,X1),X1)))), 7.23/1.50 introduced(choice_axiom,[])). 7.23/1.50 7.23/1.50 fof(f69,plain,( 7.23/1.50 ! [X0,X1] : ((~apply(X0,sK4(X0,X1),sK6(X0,X1)) & apply(X0,sK5(X0,X1),sK6(X0,X1)) & apply(X0,sK4(X0,X1),sK5(X0,X1)) & member(sK5(X0,X1),X1) & member(sK6(X0,X1),X1) & member(sK4(X0,X1),X1)) | ~sP0(X0,X1))), 7.23/1.50 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f67,f68])). 7.23/1.50 7.23/1.50 fof(f112,plain,( 7.23/1.50 ( ! [X0,X1] : (apply(X0,sK4(X0,X1),sK5(X0,X1)) | ~sP0(X0,X1)) )), 7.23/1.50 inference(cnf_transformation,[],[f69])). 7.23/1.50 7.23/1.50 fof(f16,axiom,( 7.23/1.50 ! [X1,X5] : (equivalence(X5,X1) <=> (! [X0,X3,X6] : ((member(X3,X1) & member(X6,X1) & member(X0,X1)) => ((apply(X5,X3,X6) & apply(X5,X0,X3)) => apply(X5,X0,X6))) & ! [X0] : (member(X0,X1) => apply(X5,X0,X0)) & ! [X0,X3] : ((member(X3,X1) & member(X0,X1)) => (apply(X5,X0,X3) => apply(X5,X3,X0)))))), 7.23/1.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 7.23/1.50 7.23/1.50 fof(f29,plain,( 7.23/1.50 ! [X0,X1] : (equivalence(X1,X0) <=> (! [X2,X3,X4] : ((member(X3,X0) & member(X4,X0) & member(X2,X0)) => ((apply(X1,X3,X4) & apply(X1,X2,X3)) => apply(X1,X2,X4))) & ! [X5] : (member(X5,X0) => apply(X1,X5,X5)) & ! [X6,X7] : ((member(X7,X0) & member(X6,X0)) => (apply(X1,X6,X7) => apply(X1,X7,X6)))))), 7.23/1.50 inference(rectify,[],[f16])). 7.23/1.50 7.23/1.50 fof(f32,plain,( 7.23/1.50 ! [X0,X1] : ((! [X2,X3,X4] : ((member(X3,X0) & member(X4,X0) & member(X2,X0)) => ((apply(X1,X3,X4) & apply(X1,X2,X3)) => apply(X1,X2,X4))) & ! [X5] : (member(X5,X0) => apply(X1,X5,X5)) & ! [X6,X7] : ((member(X7,X0) & member(X6,X0)) => (apply(X1,X6,X7) => apply(X1,X7,X6)))) => equivalence(X1,X0))), 7.23/1.50 inference(unused_predicate_definition_removal,[],[f29])). 7.23/1.50 7.23/1.50 fof(f35,plain,( 7.23/1.50 ! [X0,X1] : (equivalence(X1,X0) | (? [X2,X3,X4] : ((~apply(X1,X2,X4) & (apply(X1,X3,X4) & apply(X1,X2,X3))) & (member(X3,X0) & member(X4,X0) & member(X2,X0))) | ? [X5] : (~apply(X1,X5,X5) & member(X5,X0)) | ? [X6,X7] : ((~apply(X1,X7,X6) & apply(X1,X6,X7)) & (member(X7,X0) & member(X6,X0)))))), 7.23/1.50 inference(ennf_transformation,[],[f32])). 7.23/1.50 7.23/1.50 fof(f36,plain,( 7.23/1.50 ! [X0,X1] : (equivalence(X1,X0) | ? [X2,X3,X4] : (~apply(X1,X2,X4) & apply(X1,X3,X4) & apply(X1,X2,X3) & member(X3,X0) & member(X4,X0) & member(X2,X0)) | ? [X5] : (~apply(X1,X5,X5) & member(X5,X0)) | ? [X6,X7] : (~apply(X1,X7,X6) & apply(X1,X6,X7) & member(X7,X0) & member(X6,X0)))), 7.23/1.50 inference(flattening,[],[f35])). 7.23/1.50 7.23/1.50 fof(f39,plain,( 7.23/1.50 ! [X0,X1] : (equivalence(X1,X0) | sP0(X1,X0) | ? [X5] : (~apply(X1,X5,X5) & member(X5,X0)) | ? [X6,X7] : (~apply(X1,X7,X6) & apply(X1,X6,X7) & member(X7,X0) & member(X6,X0)))), 7.23/1.50 inference(definition_folding,[],[f36,f38])). 7.23/1.50 7.23/1.50 fof(f70,plain,( 7.23/1.50 ! [X0,X1] : (equivalence(X1,X0) | sP0(X1,X0) | ? [X2] : (~apply(X1,X2,X2) & member(X2,X0)) | ? [X3,X4] : (~apply(X1,X4,X3) & apply(X1,X3,X4) & member(X4,X0) & member(X3,X0)))), 7.23/1.50 inference(rectify,[],[f39])). 7.23/1.50 7.23/1.50 fof(f72,plain,( 7.23/1.50 ! [X1,X0] : (? [X3,X4] : (~apply(X1,X4,X3) & apply(X1,X3,X4) & member(X4,X0) & member(X3,X0)) => (~apply(X1,sK9(X0,X1),sK8(X0,X1)) & apply(X1,sK8(X0,X1),sK9(X0,X1)) & member(sK9(X0,X1),X0) & member(sK8(X0,X1),X0)))), 7.23/1.50 introduced(choice_axiom,[])). 7.23/1.50 7.23/1.50 fof(f71,plain,( 7.23/1.50 ! [X1,X0] : (? [X2] : (~apply(X1,X2,X2) & member(X2,X0)) => (~apply(X1,sK7(X0,X1),sK7(X0,X1)) & member(sK7(X0,X1),X0)))), 7.23/1.50 introduced(choice_axiom,[])). 7.23/1.50 7.23/1.50 fof(f73,plain,( 7.23/1.50 ! [X0,X1] : (equivalence(X1,X0) | sP0(X1,X0) | (~apply(X1,sK7(X0,X1),sK7(X0,X1)) & member(sK7(X0,X1),X0)) | (~apply(X1,sK9(X0,X1),sK8(X0,X1)) & apply(X1,sK8(X0,X1),sK9(X0,X1)) & member(sK9(X0,X1),X0) & member(sK8(X0,X1),X0)))), 7.23/1.50 inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9])],[f70,f72,f71])). 7.23/1.50 7.23/1.50 fof(f121,plain,( 7.23/1.50 ( ! [X0,X1] : (equivalence(X1,X0) | sP0(X1,X0) | ~apply(X1,sK7(X0,X1),sK7(X0,X1)) | apply(X1,sK8(X0,X1),sK9(X0,X1))) )), 7.23/1.50 inference(cnf_transformation,[],[f73])). 7.23/1.50 7.23/1.50 fof(f18,conjecture,( 7.23/1.50 ! [X4] : equivalence(equal_set_predicate,power_set(X4))), 7.23/1.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 7.23/1.50 7.23/1.50 fof(f19,negated_conjecture,( 7.23/1.50 ~! [X4] : equivalence(equal_set_predicate,power_set(X4))), 7.23/1.50 inference(negated_conjecture,[],[f18])). 7.23/1.50 7.23/1.50 fof(f31,plain,( 7.23/1.50 ~! [X0] : equivalence(equal_set_predicate,power_set(X0))), 7.23/1.50 inference(rectify,[],[f19])). 7.23/1.50 7.23/1.50 fof(f37,plain,( 7.23/1.50 ? [X0] : ~equivalence(equal_set_predicate,power_set(X0))), 7.23/1.50 inference(ennf_transformation,[],[f31])). 7.23/1.50 7.23/1.50 fof(f75,plain,( 7.23/1.50 ? [X0] : ~equivalence(equal_set_predicate,power_set(X0)) => ~equivalence(equal_set_predicate,power_set(sK10))), 7.23/1.50 introduced(choice_axiom,[])). 7.23/1.50 7.23/1.50 fof(f76,plain,( 7.23/1.50 ~equivalence(equal_set_predicate,power_set(sK10))), 7.23/1.50 inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f37,f75])). 7.23/1.50 7.23/1.50 fof(f125,plain,( 7.23/1.50 ~equivalence(equal_set_predicate,power_set(sK10))), 7.23/1.50 inference(cnf_transformation,[],[f76])). 7.23/1.50 7.23/1.50 fof(f122,plain,( 7.23/1.50 ( ! [X0,X1] : (equivalence(X1,X0) | sP0(X1,X0) | ~apply(X1,sK7(X0,X1),sK7(X0,X1)) | ~apply(X1,sK9(X0,X1),sK8(X0,X1))) )), 7.23/1.50 inference(cnf_transformation,[],[f73])). 7.23/1.50 7.23/1.50 fof(f8,axiom,( 7.23/1.50 ! [X1,X2] : ((subset(X2,X1) & subset(X1,X2)) <=> equal_set(X1,X2))), 7.23/1.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 7.23/1.50 7.23/1.50 fof(f23,plain,( 7.23/1.50 ! [X0,X1] : ((subset(X1,X0) & subset(X0,X1)) <=> equal_set(X0,X1))), 7.23/1.50 inference(rectify,[],[f8])). 7.23/1.50 7.23/1.50 fof(f54,plain,( 7.23/1.50 ! [X0,X1] : (((subset(X1,X0) & subset(X0,X1)) | ~equal_set(X0,X1)) & (equal_set(X0,X1) | (~subset(X1,X0) | ~subset(X0,X1))))), 7.23/1.50 inference(nnf_transformation,[],[f23])). 7.23/1.50 7.23/1.50 fof(f55,plain,( 7.23/1.50 ! [X0,X1] : (((subset(X1,X0) & subset(X0,X1)) | ~equal_set(X0,X1)) & (equal_set(X0,X1) | ~subset(X1,X0) | ~subset(X0,X1)))), 7.23/1.50 inference(flattening,[],[f54])). 7.23/1.50 7.23/1.50 fof(f94,plain,( 7.23/1.50 ( ! [X0,X1] : (equal_set(X0,X1) | ~subset(X1,X0) | ~subset(X0,X1)) )), 7.23/1.50 inference(cnf_transformation,[],[f55])). 7.23/1.50 7.23/1.50 fof(f17,axiom,( 7.23/1.50 ! [X0,X3] : (equal_set(X0,X3) <=> apply(equal_set_predicate,X0,X3))), 7.23/1.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 7.23/1.50 7.23/1.50 fof(f30,plain,( 7.23/1.50 ! [X0,X1] : (equal_set(X0,X1) <=> apply(equal_set_predicate,X0,X1))), 7.23/1.50 inference(rectify,[],[f17])). 7.23/1.50 7.23/1.50 fof(f74,plain,( 7.23/1.50 ! [X0,X1] : ((equal_set(X0,X1) | ~apply(equal_set_predicate,X0,X1)) & (apply(equal_set_predicate,X0,X1) | ~equal_set(X0,X1)))), 7.23/1.50 inference(nnf_transformation,[],[f30])). 7.23/1.50 7.23/1.50 fof(f123,plain,( 7.23/1.50 ( ! [X0,X1] : (apply(equal_set_predicate,X0,X1) | ~equal_set(X0,X1)) )), 7.23/1.50 inference(cnf_transformation,[],[f74])). 7.23/1.50 7.23/1.50 fof(f124,plain,( 7.23/1.50 ( ! [X0,X1] : (equal_set(X0,X1) | ~apply(equal_set_predicate,X0,X1)) )), 7.23/1.50 inference(cnf_transformation,[],[f74])). 7.23/1.50 7.23/1.50 fof(f95,plain,( 7.23/1.50 ( ! [X0,X1] : (subset(X0,X1) | ~equal_set(X0,X1)) )), 7.23/1.50 inference(cnf_transformation,[],[f55])). 7.23/1.50 7.23/1.50 fof(f92,plain,( 7.23/1.50 ( ! [X0,X1] : (subset(X0,X1) | ~member(sK2(X0,X1),X1)) )), 7.23/1.50 inference(cnf_transformation,[],[f53])). 7.23/1.50 7.23/1.50 fof(f96,plain,( 7.23/1.50 ( ! [X0,X1] : (subset(X1,X0) | ~equal_set(X0,X1)) )), 7.23/1.50 inference(cnf_transformation,[],[f55])). 7.23/1.50 7.23/1.50 fof(f90,plain,( 7.23/1.50 ( ! [X0,X3,X1] : (member(X3,X1) | ~member(X3,X0) | ~subset(X0,X1)) )), 7.23/1.50 inference(cnf_transformation,[],[f53])). 7.23/1.50 7.23/1.50 fof(f113,plain,( 7.23/1.50 ( ! [X0,X1] : (apply(X0,sK5(X0,X1),sK6(X0,X1)) | ~sP0(X0,X1)) )), 7.23/1.50 inference(cnf_transformation,[],[f69])). 7.23/1.50 7.23/1.50 fof(f114,plain,( 7.23/1.50 ( ! [X0,X1] : (~apply(X0,sK4(X0,X1),sK6(X0,X1)) | ~sP0(X0,X1)) )), 7.23/1.50 inference(cnf_transformation,[],[f69])). 7.23/1.50 7.23/1.50 cnf(c_14,plain, 7.23/1.50 ( subset(X0,X1) | member(sK2(X0,X1),X0) ), 7.23/1.50 inference(cnf_transformation,[],[f91]) ). 7.23/1.50 7.23/1.50 cnf(c_3078,plain, 7.23/1.50 ( subset(X0,X1) = iProver_top 7.23/1.50 | member(sK2(X0,X1),X0) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_14]) ). 7.23/1.50 7.23/1.50 cnf(c_34,plain, 7.23/1.50 ( apply(X0,sK4(X0,X1),sK5(X0,X1)) | ~ sP0(X0,X1) ), 7.23/1.50 inference(cnf_transformation,[],[f112]) ). 7.23/1.50 7.23/1.50 cnf(c_39,plain, 7.23/1.50 ( apply(X0,sK8(X1,X0),sK9(X1,X0)) 7.23/1.50 | ~ apply(X0,sK7(X1,X0),sK7(X1,X0)) 7.23/1.50 | equivalence(X0,X1) 7.23/1.50 | sP0(X0,X1) ), 7.23/1.50 inference(cnf_transformation,[],[f121]) ). 7.23/1.50 7.23/1.50 cnf(c_48,negated_conjecture, 7.23/1.50 ( ~ equivalence(equal_set_predicate,power_set(sK10)) ), 7.23/1.50 inference(cnf_transformation,[],[f125]) ). 7.23/1.50 7.23/1.50 cnf(c_761,plain, 7.23/1.50 ( apply(X0,sK8(X1,X0),sK9(X1,X0)) 7.23/1.50 | ~ apply(X0,sK7(X1,X0),sK7(X1,X0)) 7.23/1.50 | sP0(X0,X1) 7.23/1.50 | power_set(sK10) != X1 7.23/1.50 | equal_set_predicate != X0 ), 7.23/1.50 inference(resolution_lifted,[status(thm)],[c_39,c_48]) ). 7.23/1.50 7.23/1.50 cnf(c_762,plain, 7.23/1.50 ( apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | sP0(equal_set_predicate,power_set(sK10)) ), 7.23/1.50 inference(unflattening,[status(thm)],[c_761]) ). 7.23/1.50 7.23/1.50 cnf(c_1144,plain, 7.23/1.50 ( apply(X0,sK4(X0,X1),sK5(X0,X1)) 7.23/1.50 | apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | power_set(sK10) != X1 7.23/1.50 | equal_set_predicate != X0 ), 7.23/1.50 inference(resolution_lifted,[status(thm)],[c_34,c_762]) ). 7.23/1.50 7.23/1.50 cnf(c_1145,plain, 7.23/1.50 ( apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK5(equal_set_predicate,power_set(sK10))) ), 7.23/1.50 inference(unflattening,[status(thm)],[c_1144]) ). 7.23/1.50 7.23/1.50 cnf(c_3035,plain, 7.23/1.50 ( apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) = iProver_top 7.23/1.50 | apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK5(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_1145]) ). 7.23/1.50 7.23/1.50 cnf(c_38,plain, 7.23/1.50 ( ~ apply(X0,sK9(X1,X0),sK8(X1,X0)) 7.23/1.50 | ~ apply(X0,sK7(X1,X0),sK7(X1,X0)) 7.23/1.50 | equivalence(X0,X1) 7.23/1.50 | sP0(X0,X1) ), 7.23/1.50 inference(cnf_transformation,[],[f122]) ). 7.23/1.50 7.23/1.50 cnf(c_774,plain, 7.23/1.50 ( ~ apply(X0,sK9(X1,X0),sK8(X1,X0)) 7.23/1.50 | ~ apply(X0,sK7(X1,X0),sK7(X1,X0)) 7.23/1.50 | sP0(X0,X1) 7.23/1.50 | power_set(sK10) != X1 7.23/1.50 | equal_set_predicate != X0 ), 7.23/1.50 inference(resolution_lifted,[status(thm)],[c_38,c_48]) ). 7.23/1.50 7.23/1.50 cnf(c_775,plain, 7.23/1.50 ( ~ apply(equal_set_predicate,sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | sP0(equal_set_predicate,power_set(sK10)) ), 7.23/1.50 inference(unflattening,[status(thm)],[c_774]) ). 7.23/1.50 7.23/1.50 cnf(c_1131,plain, 7.23/1.50 ( apply(X0,sK4(X0,X1),sK5(X0,X1)) 7.23/1.50 | ~ apply(equal_set_predicate,sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | power_set(sK10) != X1 7.23/1.50 | equal_set_predicate != X0 ), 7.23/1.50 inference(resolution_lifted,[status(thm)],[c_34,c_775]) ). 7.23/1.50 7.23/1.50 cnf(c_1132,plain, 7.23/1.50 ( ~ apply(equal_set_predicate,sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK5(equal_set_predicate,power_set(sK10))) ), 7.23/1.50 inference(unflattening,[status(thm)],[c_1131]) ). 7.23/1.50 7.23/1.50 cnf(c_1133,plain, 7.23/1.50 ( apply(equal_set_predicate,sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK5(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_1132]) ). 7.23/1.50 7.23/1.50 cnf(c_1146,plain, 7.23/1.50 ( apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) = iProver_top 7.23/1.50 | apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK5(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_1145]) ). 7.23/1.50 7.23/1.50 cnf(c_19,plain, 7.23/1.50 ( equal_set(X0,X1) | ~ subset(X0,X1) | ~ subset(X1,X0) ), 7.23/1.50 inference(cnf_transformation,[],[f94]) ). 7.23/1.50 7.23/1.50 cnf(c_47,plain, 7.23/1.50 ( apply(equal_set_predicate,X0,X1) | ~ equal_set(X0,X1) ), 7.23/1.50 inference(cnf_transformation,[],[f123]) ). 7.23/1.50 7.23/1.50 cnf(c_409,plain, 7.23/1.50 ( ~ equal_set(X0,X1) | apply(equal_set_predicate,X0,X1) ), 7.23/1.50 inference(prop_impl,[status(thm)],[c_47]) ). 7.23/1.50 7.23/1.50 cnf(c_410,plain, 7.23/1.50 ( apply(equal_set_predicate,X0,X1) | ~ equal_set(X0,X1) ), 7.23/1.50 inference(renaming,[status(thm)],[c_409]) ). 7.23/1.50 7.23/1.50 cnf(c_657,plain, 7.23/1.50 ( apply(equal_set_predicate,X0,X1) 7.23/1.50 | ~ subset(X0,X1) 7.23/1.50 | ~ subset(X1,X0) ), 7.23/1.50 inference(resolution,[status(thm)],[c_19,c_410]) ). 7.23/1.50 7.23/1.50 cnf(c_3873,plain, 7.23/1.50 ( apply(equal_set_predicate,sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ subset(sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ subset(sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) ), 7.23/1.50 inference(instantiation,[status(thm)],[c_657]) ). 7.23/1.50 7.23/1.50 cnf(c_3874,plain, 7.23/1.50 ( apply(equal_set_predicate,sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) = iProver_top 7.23/1.50 | subset(sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | subset(sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) != iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_3873]) ). 7.23/1.50 7.23/1.50 cnf(c_3876,plain, 7.23/1.50 ( apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ subset(sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) ), 7.23/1.50 inference(instantiation,[status(thm)],[c_657]) ). 7.23/1.50 7.23/1.50 cnf(c_3877,plain, 7.23/1.50 ( apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) = iProver_top 7.23/1.50 | subset(sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_3876]) ). 7.23/1.50 7.23/1.50 cnf(c_46,plain, 7.23/1.50 ( ~ apply(equal_set_predicate,X0,X1) | equal_set(X0,X1) ), 7.23/1.50 inference(cnf_transformation,[],[f124]) ). 7.23/1.50 7.23/1.50 cnf(c_407,plain, 7.23/1.50 ( equal_set(X0,X1) | ~ apply(equal_set_predicate,X0,X1) ), 7.23/1.50 inference(prop_impl,[status(thm)],[c_46]) ). 7.23/1.50 7.23/1.50 cnf(c_408,plain, 7.23/1.50 ( ~ apply(equal_set_predicate,X0,X1) | equal_set(X0,X1) ), 7.23/1.50 inference(renaming,[status(thm)],[c_407]) ). 7.23/1.50 7.23/1.50 cnf(c_18,plain, 7.23/1.50 ( ~ equal_set(X0,X1) | subset(X0,X1) ), 7.23/1.50 inference(cnf_transformation,[],[f95]) ). 7.23/1.50 7.23/1.50 cnf(c_637,plain, 7.23/1.50 ( ~ apply(equal_set_predicate,X0,X1) | subset(X0,X1) ), 7.23/1.50 inference(resolution,[status(thm)],[c_408,c_18]) ). 7.23/1.50 7.23/1.50 cnf(c_4013,plain, 7.23/1.50 ( ~ apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) 7.23/1.50 | subset(sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) ), 7.23/1.50 inference(instantiation,[status(thm)],[c_637]) ). 7.23/1.50 7.23/1.50 cnf(c_4017,plain, 7.23/1.50 ( apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | subset(sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_4013]) ). 7.23/1.50 7.23/1.50 cnf(c_13,plain, 7.23/1.50 ( subset(X0,X1) | ~ member(sK2(X0,X1),X1) ), 7.23/1.50 inference(cnf_transformation,[],[f92]) ). 7.23/1.50 7.23/1.50 cnf(c_4027,plain, 7.23/1.50 ( subset(sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ member(sK2(sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)),sK7(power_set(sK10),equal_set_predicate)) ), 7.23/1.50 inference(instantiation,[status(thm)],[c_13]) ). 7.23/1.50 7.23/1.50 cnf(c_4034,plain, 7.23/1.50 ( subset(sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) = iProver_top 7.23/1.50 | member(sK2(sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)),sK7(power_set(sK10),equal_set_predicate)) != iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_4027]) ). 7.23/1.50 7.23/1.50 cnf(c_4026,plain, 7.23/1.50 ( subset(sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | member(sK2(sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)),sK7(power_set(sK10),equal_set_predicate)) ), 7.23/1.50 inference(instantiation,[status(thm)],[c_14]) ). 7.23/1.50 7.23/1.50 cnf(c_4036,plain, 7.23/1.50 ( subset(sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) = iProver_top 7.23/1.50 | member(sK2(sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)),sK7(power_set(sK10),equal_set_predicate)) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_4026]) ). 7.23/1.50 7.23/1.50 cnf(c_17,plain, 7.23/1.50 ( ~ equal_set(X0,X1) | subset(X1,X0) ), 7.23/1.50 inference(cnf_transformation,[],[f96]) ). 7.23/1.50 7.23/1.50 cnf(c_648,plain, 7.23/1.50 ( ~ apply(equal_set_predicate,X0,X1) | subset(X1,X0) ), 7.23/1.50 inference(resolution,[status(thm)],[c_408,c_17]) ). 7.23/1.50 7.23/1.50 cnf(c_4313,plain, 7.23/1.50 ( ~ apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) 7.23/1.50 | subset(sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) ), 7.23/1.50 inference(instantiation,[status(thm)],[c_648]) ). 7.23/1.50 7.23/1.50 cnf(c_4314,plain, 7.23/1.50 ( apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | subset(sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_4313]) ). 7.23/1.50 7.23/1.50 cnf(c_8748,plain, 7.23/1.50 ( apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK5(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(global_propositional_subsumption, 7.23/1.50 [status(thm)], 7.23/1.50 [c_3035,c_1133,c_1146,c_3874,c_3877,c_4017,c_4034,c_4036, 7.23/1.50 c_4314]) ). 7.23/1.50 7.23/1.50 cnf(c_8752,plain, 7.23/1.50 ( apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK5(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(global_propositional_subsumption, 7.23/1.50 [status(thm)], 7.23/1.50 [c_8748,c_1133,c_1146,c_3874,c_3877,c_4017,c_4034,c_4036, 7.23/1.50 c_4314]) ). 7.23/1.50 7.23/1.50 cnf(c_3063,plain, 7.23/1.50 ( apply(equal_set_predicate,X0,X1) != iProver_top 7.23/1.50 | subset(X0,X1) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_637]) ). 7.23/1.50 7.23/1.50 cnf(c_11416,plain, 7.23/1.50 ( subset(sK4(equal_set_predicate,power_set(sK10)),sK5(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_8752,c_3063]) ). 7.23/1.50 7.23/1.50 cnf(c_15,plain, 7.23/1.50 ( ~ subset(X0,X1) | ~ member(X2,X0) | member(X2,X1) ), 7.23/1.50 inference(cnf_transformation,[],[f90]) ). 7.23/1.50 7.23/1.50 cnf(c_3077,plain, 7.23/1.50 ( subset(X0,X1) != iProver_top 7.23/1.50 | member(X2,X0) != iProver_top 7.23/1.50 | member(X2,X1) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_15]) ). 7.23/1.50 7.23/1.50 cnf(c_11877,plain, 7.23/1.50 ( member(X0,sK5(equal_set_predicate,power_set(sK10))) = iProver_top 7.23/1.50 | member(X0,sK4(equal_set_predicate,power_set(sK10))) != iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_11416,c_3077]) ). 7.23/1.50 7.23/1.50 cnf(c_13834,plain, 7.23/1.50 ( subset(sK4(equal_set_predicate,power_set(sK10)),X0) = iProver_top 7.23/1.50 | member(sK2(sK4(equal_set_predicate,power_set(sK10)),X0),sK5(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_3078,c_11877]) ). 7.23/1.50 7.23/1.50 cnf(c_33,plain, 7.23/1.50 ( apply(X0,sK5(X0,X1),sK6(X0,X1)) | ~ sP0(X0,X1) ), 7.23/1.50 inference(cnf_transformation,[],[f113]) ). 7.23/1.50 7.23/1.50 cnf(c_1248,plain, 7.23/1.50 ( apply(X0,sK5(X0,X1),sK6(X0,X1)) 7.23/1.50 | apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | power_set(sK10) != X1 7.23/1.50 | equal_set_predicate != X0 ), 7.23/1.50 inference(resolution_lifted,[status(thm)],[c_33,c_762]) ). 7.23/1.50 7.23/1.50 cnf(c_1249,plain, 7.23/1.50 ( apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | apply(equal_set_predicate,sK5(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) ), 7.23/1.50 inference(unflattening,[status(thm)],[c_1248]) ). 7.23/1.50 7.23/1.50 cnf(c_3027,plain, 7.23/1.50 ( apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) = iProver_top 7.23/1.50 | apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK5(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_1249]) ). 7.23/1.50 7.23/1.50 cnf(c_1235,plain, 7.23/1.50 ( apply(X0,sK5(X0,X1),sK6(X0,X1)) 7.23/1.50 | ~ apply(equal_set_predicate,sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | power_set(sK10) != X1 7.23/1.50 | equal_set_predicate != X0 ), 7.23/1.50 inference(resolution_lifted,[status(thm)],[c_33,c_775]) ). 7.23/1.50 7.23/1.50 cnf(c_1236,plain, 7.23/1.50 ( ~ apply(equal_set_predicate,sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | apply(equal_set_predicate,sK5(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) ), 7.23/1.50 inference(unflattening,[status(thm)],[c_1235]) ). 7.23/1.50 7.23/1.50 cnf(c_1237,plain, 7.23/1.50 ( apply(equal_set_predicate,sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK5(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_1236]) ). 7.23/1.50 7.23/1.50 cnf(c_1250,plain, 7.23/1.50 ( apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) = iProver_top 7.23/1.50 | apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK5(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_1249]) ). 7.23/1.50 7.23/1.50 cnf(c_7487,plain, 7.23/1.50 ( apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK5(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(global_propositional_subsumption, 7.23/1.50 [status(thm)], 7.23/1.50 [c_3027,c_1237,c_1250,c_3874,c_3877,c_4017,c_4034,c_4036, 7.23/1.50 c_4314]) ). 7.23/1.50 7.23/1.50 cnf(c_7491,plain, 7.23/1.50 ( apply(equal_set_predicate,sK5(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(global_propositional_subsumption, 7.23/1.50 [status(thm)], 7.23/1.50 [c_7487,c_1237,c_1250,c_3874,c_3877,c_4017,c_4034,c_4036, 7.23/1.50 c_4314]) ). 7.23/1.50 7.23/1.50 cnf(c_11417,plain, 7.23/1.50 ( subset(sK5(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_7491,c_3063]) ). 7.23/1.50 7.23/1.50 cnf(c_11883,plain, 7.23/1.50 ( member(X0,sK5(equal_set_predicate,power_set(sK10))) != iProver_top 7.23/1.50 | member(X0,sK6(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_11417,c_3077]) ). 7.23/1.50 7.23/1.50 cnf(c_40289,plain, 7.23/1.50 ( subset(sK4(equal_set_predicate,power_set(sK10)),X0) = iProver_top 7.23/1.50 | member(sK2(sK4(equal_set_predicate,power_set(sK10)),X0),sK6(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_13834,c_11883]) ). 7.23/1.50 7.23/1.50 cnf(c_3079,plain, 7.23/1.50 ( subset(X0,X1) = iProver_top 7.23/1.50 | member(sK2(X0,X1),X1) != iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_13]) ). 7.23/1.50 7.23/1.50 cnf(c_40431,plain, 7.23/1.50 ( subset(sK4(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_40289,c_3079]) ). 7.23/1.50 7.23/1.50 cnf(c_3062,plain, 7.23/1.50 ( apply(equal_set_predicate,X0,X1) != iProver_top 7.23/1.50 | subset(X1,X0) = iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_648]) ). 7.23/1.50 7.23/1.50 cnf(c_10152,plain, 7.23/1.50 ( subset(sK6(equal_set_predicate,power_set(sK10)),sK5(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_7491,c_3062]) ). 7.23/1.50 7.23/1.50 cnf(c_10822,plain, 7.23/1.50 ( member(X0,sK5(equal_set_predicate,power_set(sK10))) = iProver_top 7.23/1.50 | member(X0,sK6(equal_set_predicate,power_set(sK10))) != iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_10152,c_3077]) ). 7.23/1.50 7.23/1.50 cnf(c_13363,plain, 7.23/1.50 ( subset(sK6(equal_set_predicate,power_set(sK10)),X0) = iProver_top 7.23/1.50 | member(sK2(sK6(equal_set_predicate,power_set(sK10)),X0),sK5(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_3078,c_10822]) ). 7.23/1.50 7.23/1.50 cnf(c_10151,plain, 7.23/1.50 ( subset(sK5(equal_set_predicate,power_set(sK10)),sK4(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_8752,c_3062]) ). 7.23/1.50 7.23/1.50 cnf(c_10816,plain, 7.23/1.50 ( member(X0,sK5(equal_set_predicate,power_set(sK10))) != iProver_top 7.23/1.50 | member(X0,sK4(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_10151,c_3077]) ). 7.23/1.50 7.23/1.50 cnf(c_39236,plain, 7.23/1.50 ( subset(sK6(equal_set_predicate,power_set(sK10)),X0) = iProver_top 7.23/1.50 | member(sK2(sK6(equal_set_predicate,power_set(sK10)),X0),sK4(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_13363,c_10816]) ). 7.23/1.50 7.23/1.50 cnf(c_40412,plain, 7.23/1.50 ( subset(sK6(equal_set_predicate,power_set(sK10)),sK4(equal_set_predicate,power_set(sK10))) = iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_39236,c_3079]) ). 7.23/1.50 7.23/1.50 cnf(c_3061,plain, 7.23/1.50 ( apply(equal_set_predicate,X0,X1) = iProver_top 7.23/1.50 | subset(X0,X1) != iProver_top 7.23/1.50 | subset(X1,X0) != iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_657]) ). 7.23/1.50 7.23/1.50 cnf(c_32,plain, 7.23/1.50 ( ~ apply(X0,sK4(X0,X1),sK6(X0,X1)) | ~ sP0(X0,X1) ), 7.23/1.50 inference(cnf_transformation,[],[f114]) ). 7.23/1.50 7.23/1.50 cnf(c_1352,plain, 7.23/1.50 ( ~ apply(X0,sK4(X0,X1),sK6(X0,X1)) 7.23/1.50 | apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | power_set(sK10) != X1 7.23/1.50 | equal_set_predicate != X0 ), 7.23/1.50 inference(resolution_lifted,[status(thm)],[c_32,c_762]) ). 7.23/1.50 7.23/1.50 cnf(c_1353,plain, 7.23/1.50 ( apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) ), 7.23/1.50 inference(unflattening,[status(thm)],[c_1352]) ). 7.23/1.50 7.23/1.50 cnf(c_3019,plain, 7.23/1.50 ( apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) = iProver_top 7.23/1.50 | apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) != iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_1353]) ). 7.23/1.50 7.23/1.50 cnf(c_9071,plain, 7.23/1.50 ( apply(equal_set_predicate,sK8(power_set(sK10),equal_set_predicate),sK9(power_set(sK10),equal_set_predicate)) = iProver_top 7.23/1.50 | apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) != iProver_top 7.23/1.50 | subset(sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top ), 7.23/1.50 inference(superposition,[status(thm)],[c_3061,c_3019]) ). 7.23/1.50 7.23/1.50 cnf(c_1339,plain, 7.23/1.50 ( ~ apply(X0,sK4(X0,X1),sK6(X0,X1)) 7.23/1.50 | ~ apply(equal_set_predicate,sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | power_set(sK10) != X1 7.23/1.50 | equal_set_predicate != X0 ), 7.23/1.50 inference(resolution_lifted,[status(thm)],[c_32,c_775]) ). 7.23/1.50 7.23/1.50 cnf(c_1340,plain, 7.23/1.50 ( ~ apply(equal_set_predicate,sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) 7.23/1.50 | ~ apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) ), 7.23/1.50 inference(unflattening,[status(thm)],[c_1339]) ). 7.23/1.50 7.23/1.50 cnf(c_1341,plain, 7.23/1.50 ( apply(equal_set_predicate,sK9(power_set(sK10),equal_set_predicate),sK8(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top 7.23/1.50 | apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) != iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_1340]) ). 7.23/1.50 7.23/1.50 cnf(c_10131,plain, 7.23/1.50 ( apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) != iProver_top 7.23/1.50 | subset(sK7(power_set(sK10),equal_set_predicate),sK7(power_set(sK10),equal_set_predicate)) != iProver_top ), 7.23/1.50 inference(global_propositional_subsumption, 7.23/1.50 [status(thm)], 7.23/1.50 [c_9071,c_1341,c_3874,c_3877,c_4017,c_4034,c_4036,c_4314]) ). 7.23/1.50 7.23/1.50 cnf(c_10135,plain, 7.23/1.50 ( apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) != iProver_top ), 7.23/1.50 inference(global_propositional_subsumption, 7.23/1.50 [status(thm)], 7.23/1.50 [c_10131,c_1341,c_3874,c_3877,c_4017,c_4034,c_4036, 7.23/1.50 c_4314,c_9071]) ). 7.23/1.50 7.23/1.50 cnf(c_5636,plain, 7.23/1.50 ( apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) 7.23/1.50 | ~ subset(sK6(equal_set_predicate,power_set(sK10)),sK4(equal_set_predicate,power_set(sK10))) 7.23/1.50 | ~ subset(sK4(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) ), 7.23/1.50 inference(instantiation,[status(thm)],[c_657]) ). 7.23/1.50 7.23/1.50 cnf(c_5637,plain, 7.23/1.50 ( apply(equal_set_predicate,sK4(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) = iProver_top 7.23/1.50 | subset(sK6(equal_set_predicate,power_set(sK10)),sK4(equal_set_predicate,power_set(sK10))) != iProver_top 7.23/1.50 | subset(sK4(equal_set_predicate,power_set(sK10)),sK6(equal_set_predicate,power_set(sK10))) != iProver_top ), 7.23/1.50 inference(predicate_to_equality,[status(thm)],[c_5636]) ). 7.23/1.50 7.23/1.50 cnf(contradiction,plain, 7.23/1.50 ( $false ), 7.23/1.50 inference(minisat,[status(thm)],[c_40431,c_40412,c_10135,c_5637]) ). 7.23/1.50 7.23/1.50 7.23/1.50 % SZS output end CNFRefutation for theBenchmark.p 7.23/1.50 7.23/1.50 ------ Statistics 7.23/1.50 7.23/1.50 ------ General 7.23/1.50 7.23/1.50 abstr_ref_over_cycles: 0 7.23/1.50 abstr_ref_under_cycles: 0 7.23/1.50 gc_basic_clause_elim: 0 7.23/1.50 forced_gc_time: 0 7.23/1.50 parsing_time: 0.007 7.23/1.50 unif_index_cands_time: 0. 7.23/1.50 unif_index_add_time: 0. 7.23/1.50 orderings_time: 0. 7.23/1.50 out_proof_time: 0.013 7.23/1.50 total_time: 0.831 7.23/1.50 num_of_symbols: 58 7.23/1.50 num_of_terms: 49000 7.23/1.50 7.23/1.50 ------ Preprocessing 7.23/1.50 7.23/1.50 num_of_splits: 0 7.23/1.50 num_of_split_atoms: 0 7.23/1.50 num_of_reused_defs: 0 7.23/1.50 num_eq_ax_congr_red: 60 7.23/1.50 num_of_sem_filtered_clauses: 1 7.23/1.50 num_of_subtypes: 0 7.23/1.50 monotx_restored_types: 0 7.23/1.50 sat_num_of_epr_types: 0 7.23/1.50 sat_num_of_non_cyclic_types: 0 7.23/1.50 sat_guarded_non_collapsed_types: 0 7.23/1.50 num_pure_diseq_elim: 0 7.23/1.50 simp_replaced_by: 0 7.23/1.50 res_preprocessed: 232 7.23/1.50 prep_upred: 0 7.23/1.50 prep_unflattend: 112 7.23/1.50 smt_new_axioms: 0 7.23/1.50 pred_elim_cands: 6 7.23/1.50 pred_elim: 3 7.23/1.50 pred_elim_cl: -31 7.23/1.50 pred_elim_cycles: 4 7.23/1.50 merged_defs: 8 7.23/1.50 merged_defs_ncl: 0 7.23/1.50 bin_hyper_res: 8 7.23/1.50 prep_cycles: 3 7.23/1.50 pred_elim_time: 0.012 7.23/1.50 splitting_time: 0. 7.23/1.50 sem_filter_time: 0. 7.23/1.50 monotx_time: 0. 7.23/1.50 subtype_inf_time: 0. 7.23/1.50 7.23/1.50 ------ Problem properties 7.23/1.50 7.23/1.50 clauses: 80 7.23/1.50 conjectures: 0 7.23/1.50 epr: 5 7.23/1.50 horn: 37 7.23/1.50 ground: 48 7.23/1.50 unary: 4 7.23/1.50 binary: 19 7.23/1.50 lits: 213 7.23/1.50 lits_eq: 3 7.23/1.50 fd_pure: 0 7.23/1.50 fd_pseudo: 0 7.23/1.50 fd_cond: 0 7.23/1.50 fd_pseudo_cond: 2 7.23/1.50 ac_symbols: 0 7.23/1.50 7.23/1.50 ------ Propositional Solver 7.23/1.50 7.23/1.50 prop_solver_calls: 25 7.23/1.50 prop_fast_solver_calls: 2030 7.23/1.50 smt_solver_calls: 0 7.23/1.50 smt_fast_solver_calls: 0 7.23/1.50 prop_num_of_clauses: 16925 7.23/1.50 prop_preprocess_simplified: 32717 7.23/1.50 prop_fo_subsumed: 60 7.23/1.50 prop_solver_time: 0. 7.23/1.50 smt_solver_time: 0. 7.23/1.50 smt_fast_solver_time: 0. 7.23/1.50 prop_fast_solver_time: 0. 7.23/1.50 prop_unsat_core_time: 0.001 7.23/1.50 7.23/1.50 ------ QBF 7.23/1.50 7.23/1.50 qbf_q_res: 0 7.23/1.50 qbf_num_tautologies: 0 7.23/1.50 qbf_prep_cycles: 0 7.23/1.50 7.23/1.50 ------ BMC1 7.23/1.50 7.23/1.50 bmc1_current_bound: -1 7.23/1.50 bmc1_last_solved_bound: -1 7.23/1.50 bmc1_unsat_core_size: -1 7.23/1.50 bmc1_unsat_core_parents_size: -1 7.23/1.50 bmc1_merge_next_fun: 0 7.23/1.50 bmc1_unsat_core_clauses_time: 0. 7.23/1.50 7.23/1.50 ------ Instantiation 7.23/1.50 7.23/1.50 inst_num_of_clauses: 4037 7.23/1.50 inst_num_in_passive: 2249 7.23/1.50 inst_num_in_active: 846 7.23/1.50 inst_num_in_unprocessed: 942 7.23/1.50 inst_num_of_loops: 1120 7.23/1.50 inst_num_of_learning_restarts: 0 7.23/1.50 inst_num_moves_active_passive: 273 7.23/1.50 inst_lit_activity: 0 7.23/1.50 inst_lit_activity_moves: 1 7.23/1.50 inst_num_tautologies: 0 7.23/1.50 inst_num_prop_implied: 0 7.23/1.50 inst_num_existing_simplified: 0 7.23/1.50 inst_num_eq_res_simplified: 0 7.23/1.50 inst_num_child_elim: 0 7.23/1.50 inst_num_of_dismatching_blockings: 5302 7.23/1.50 inst_num_of_non_proper_insts: 3586 7.23/1.50 inst_num_of_duplicates: 0 7.23/1.50 inst_inst_num_from_inst_to_res: 0 7.23/1.50 inst_dismatching_checking_time: 0. 7.23/1.50 7.23/1.50 ------ Resolution 7.23/1.50 7.23/1.50 res_num_of_clauses: 0 7.23/1.50 res_num_in_passive: 0 7.23/1.50 res_num_in_active: 0 7.23/1.50 res_num_of_loops: 235 7.23/1.50 res_forward_subset_subsumed: 191 7.23/1.50 res_backward_subset_subsumed: 0 7.23/1.50 res_forward_subsumed: 0 7.23/1.50 res_backward_subsumed: 0 7.23/1.50 res_forward_subsumption_resolution: 0 7.23/1.50 res_backward_subsumption_resolution: 0 7.23/1.50 res_clause_to_clause_subsumption: 2588 7.23/1.50 res_orphan_elimination: 0 7.23/1.50 res_tautology_del: 46 7.23/1.50 res_num_eq_res_simplified: 0 7.23/1.50 res_num_sel_changes: 0 7.23/1.50 res_moves_from_active_to_pass: 0 7.23/1.50 7.23/1.50 ------ Superposition 7.23/1.50 7.23/1.50 sup_time_total: 0. 7.23/1.50 sup_time_generating: 0. 7.23/1.50 sup_time_sim_full: 0. 7.23/1.50 sup_time_sim_immed: 0. 7.23/1.50 7.23/1.50 sup_num_of_clauses: 663 7.23/1.50 sup_num_in_active: 188 7.23/1.50 sup_num_in_passive: 475 7.23/1.50 sup_num_of_loops: 223 7.23/1.50 sup_fw_superposition: 794 7.23/1.50 sup_bw_superposition: 341 7.23/1.50 sup_immediate_simplified: 237 7.23/1.50 sup_given_eliminated: 0 7.23/1.50 comparisons_done: 0 7.23/1.50 comparisons_avoided: 0 7.23/1.50 7.23/1.50 ------ Simplifications 7.23/1.50 7.23/1.50 7.23/1.50 sim_fw_subset_subsumed: 155 7.23/1.50 sim_bw_subset_subsumed: 61 7.23/1.50 sim_fw_subsumed: 48 7.23/1.50 sim_bw_subsumed: 10 7.23/1.50 sim_fw_subsumption_res: 0 7.23/1.50 sim_bw_subsumption_res: 0 7.23/1.50 sim_tautology_del: 11 7.23/1.50 sim_eq_tautology_del: 3 7.23/1.50 sim_eq_res_simp: 0 7.23/1.50 sim_fw_demodulated: 0 7.23/1.50 sim_bw_demodulated: 0 7.23/1.50 sim_light_normalised: 0 7.23/1.50 sim_joinable_taut: 0 7.23/1.50 sim_joinable_simp: 0 7.23/1.50 sim_ac_normalised: 0 7.23/1.50 sim_smt_subsumption: 0 7.23/1.50 7.23/1.51 EOF