0.06/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : iproveropt_run.sh %d %s 0.11/0.32 % Computer : n022.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 960 0.11/0.32 % WCLimit : 120 0.11/0.32 % DateTime : Thu Jul 2 07:44:02 EDT 2020 0.11/0.32 % CPUTime : 0.11/0.33 % Running in FOF mode 11.33/1.97 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p 11.33/1.97 11.33/1.97 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 11.33/1.97 11.33/1.97 ------ iProver source info 11.33/1.97 11.33/1.97 git: date: 2020-06-30 10:37:57 +0100 11.33/1.97 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 11.33/1.97 git: non_committed_changes: false 11.33/1.97 git: last_make_outside_of_git: false 11.33/1.97 11.33/1.97 ------ 11.33/1.97 11.33/1.97 ------ Input Options 11.33/1.97 11.33/1.97 --out_options all 11.33/1.97 --tptp_safe_out true 11.33/1.97 --problem_path "" 11.33/1.97 --include_path "" 11.33/1.97 --clausifier res/vclausify_rel 11.33/1.97 --clausifier_options "" 11.33/1.97 --stdin false 11.33/1.97 --stats_out all 11.33/1.97 11.33/1.97 ------ General Options 11.33/1.97 11.33/1.97 --fof false 11.33/1.97 --time_out_real 125. 11.33/1.97 --time_out_virtual -1. 11.33/1.97 --symbol_type_check false 11.33/1.97 --clausify_out false 11.33/1.97 --sig_cnt_out false 11.33/1.97 --trig_cnt_out false 11.33/1.97 --trig_cnt_out_tolerance 1. 11.33/1.97 --trig_cnt_out_sk_spl false 11.33/1.97 --abstr_cl_out false 11.33/1.97 11.33/1.97 ------ Global Options 11.33/1.97 11.33/1.97 --schedule default 11.33/1.97 --add_important_lit false 11.33/1.97 --prop_solver_per_cl 1000 11.33/1.97 --min_unsat_core false 11.33/1.97 --soft_assumptions false 11.33/1.97 --soft_lemma_size 3 11.33/1.97 --prop_impl_unit_size 0 11.33/1.97 --prop_impl_unit [] 11.33/1.97 --share_sel_clauses true 11.33/1.97 --reset_solvers false 11.33/1.97 --bc_imp_inh [conj_cone] 11.33/1.97 --conj_cone_tolerance 3. 11.33/1.97 --extra_neg_conj none 11.33/1.97 --large_theory_mode true 11.33/1.97 --prolific_symb_bound 200 11.33/1.97 --lt_threshold 2000 11.33/1.97 --clause_weak_htbl true 11.33/1.97 --gc_record_bc_elim false 11.33/1.97 11.33/1.97 ------ Preprocessing Options 11.33/1.97 11.33/1.97 --preprocessing_flag true 11.33/1.97 --time_out_prep_mult 0.1 11.33/1.97 --splitting_mode input 11.33/1.97 --splitting_grd true 11.33/1.97 --splitting_cvd false 11.33/1.97 --splitting_cvd_svl false 11.33/1.97 --splitting_nvd 32 11.33/1.97 --sub_typing true 11.33/1.97 --prep_gs_sim true 11.33/1.97 --prep_unflatten true 11.33/1.97 --prep_res_sim true 11.33/1.97 --prep_upred true 11.33/1.97 --prep_sem_filter exhaustive 11.33/1.97 --prep_sem_filter_out false 11.33/1.97 --pred_elim true 11.33/1.97 --res_sim_input true 11.33/1.97 --eq_ax_congr_red true 11.33/1.97 --pure_diseq_elim true 11.33/1.97 --brand_transform false 11.33/1.97 --non_eq_to_eq false 11.33/1.97 --prep_def_merge true 11.33/1.97 --prep_def_merge_prop_impl false 11.33/1.97 --prep_def_merge_mbd true 11.33/1.97 --prep_def_merge_tr_red false 11.33/1.97 --prep_def_merge_tr_cl false 11.33/1.97 --smt_preprocessing true 11.33/1.97 --smt_ac_axioms fast 11.33/1.97 --preprocessed_out false 11.33/1.97 --preprocessed_stats false 11.33/1.97 11.33/1.97 ------ Abstraction refinement Options 11.33/1.97 11.33/1.97 --abstr_ref [] 11.33/1.97 --abstr_ref_prep false 11.33/1.97 --abstr_ref_until_sat false 11.33/1.97 --abstr_ref_sig_restrict funpre 11.33/1.97 --abstr_ref_af_restrict_to_split_sk false 11.33/1.97 --abstr_ref_under [] 11.33/1.97 11.33/1.97 ------ SAT Options 11.33/1.97 11.33/1.97 --sat_mode false 11.33/1.97 --sat_fm_restart_options "" 11.33/1.97 --sat_gr_def false 11.33/1.97 --sat_epr_types true 11.33/1.97 --sat_non_cyclic_types false 11.33/1.97 --sat_finite_models false 11.33/1.97 --sat_fm_lemmas false 11.33/1.97 --sat_fm_prep false 11.33/1.97 --sat_fm_uc_incr true 11.33/1.97 --sat_out_model small 11.33/1.97 --sat_out_clauses false 11.33/1.97 11.33/1.97 ------ QBF Options 11.33/1.97 11.33/1.97 --qbf_mode false 11.33/1.97 --qbf_elim_univ false 11.33/1.97 --qbf_dom_inst none 11.33/1.97 --qbf_dom_pre_inst false 11.33/1.97 --qbf_sk_in false 11.33/1.97 --qbf_pred_elim true 11.33/1.97 --qbf_split 512 11.33/1.97 11.33/1.97 ------ BMC1 Options 11.33/1.97 11.33/1.97 --bmc1_incremental false 11.33/1.97 --bmc1_axioms reachable_all 11.33/1.97 --bmc1_min_bound 0 11.33/1.97 --bmc1_max_bound -1 11.33/1.97 --bmc1_max_bound_default -1 11.33/1.97 --bmc1_symbol_reachability true 11.33/1.97 --bmc1_property_lemmas false 11.33/1.97 --bmc1_k_induction false 11.33/1.97 --bmc1_non_equiv_states false 11.33/1.97 --bmc1_deadlock false 11.33/1.97 --bmc1_ucm false 11.33/1.97 --bmc1_add_unsat_core none 11.33/1.97 --bmc1_unsat_core_children false 11.33/1.97 --bmc1_unsat_core_extrapolate_axioms false 11.33/1.97 --bmc1_out_stat full 11.33/1.97 --bmc1_ground_init false 11.33/1.97 --bmc1_pre_inst_next_state false 11.33/1.97 --bmc1_pre_inst_state false 11.33/1.97 --bmc1_pre_inst_reach_state false 11.33/1.97 --bmc1_out_unsat_core false 11.33/1.97 --bmc1_aig_witness_out false 11.33/1.97 --bmc1_verbose false 11.33/1.97 --bmc1_dump_clauses_tptp false 11.33/1.97 --bmc1_dump_unsat_core_tptp false 11.33/1.97 --bmc1_dump_file - 11.33/1.97 --bmc1_ucm_expand_uc_limit 128 11.33/1.97 --bmc1_ucm_n_expand_iterations 6 11.33/1.97 --bmc1_ucm_extend_mode 1 11.33/1.97 --bmc1_ucm_init_mode 2 11.33/1.97 --bmc1_ucm_cone_mode none 11.33/1.97 --bmc1_ucm_reduced_relation_type 0 11.33/1.97 --bmc1_ucm_relax_model 4 11.33/1.97 --bmc1_ucm_full_tr_after_sat true 11.33/1.97 --bmc1_ucm_expand_neg_assumptions false 11.33/1.97 --bmc1_ucm_layered_model none 11.33/1.97 --bmc1_ucm_max_lemma_size 10 11.33/1.97 11.33/1.97 ------ AIG Options 11.33/1.97 11.33/1.97 --aig_mode false 11.33/1.97 11.33/1.97 ------ Instantiation Options 11.33/1.97 11.33/1.97 --instantiation_flag true 11.33/1.97 --inst_sos_flag true 11.33/1.97 --inst_sos_phase true 11.33/1.97 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 11.33/1.97 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 11.33/1.97 --inst_lit_sel_side num_symb 11.33/1.97 --inst_solver_per_active 1400 11.33/1.97 --inst_solver_calls_frac 1. 11.33/1.97 --inst_passive_queue_type priority_queues 11.33/1.97 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 11.33/1.97 --inst_passive_queues_freq [25;2] 11.33/1.97 --inst_dismatching true 11.33/1.97 --inst_eager_unprocessed_to_passive true 11.33/1.97 --inst_prop_sim_given true 11.33/1.97 --inst_prop_sim_new false 11.33/1.97 --inst_subs_new false 11.33/1.97 --inst_eq_res_simp false 11.33/1.97 --inst_subs_given false 11.33/1.97 --inst_orphan_elimination true 11.33/1.97 --inst_learning_loop_flag true 11.33/1.97 --inst_learning_start 3000 11.33/1.97 --inst_learning_factor 2 11.33/1.97 --inst_start_prop_sim_after_learn 3 11.33/1.97 --inst_sel_renew solver 11.33/1.97 --inst_lit_activity_flag true 11.33/1.97 --inst_restr_to_given false 11.33/1.97 --inst_activity_threshold 500 11.33/1.97 --inst_out_proof true 11.33/1.97 11.33/1.97 ------ Resolution Options 11.33/1.97 11.33/1.97 --resolution_flag true 11.33/1.97 --res_lit_sel adaptive 11.33/1.97 --res_lit_sel_side none 11.33/1.97 --res_ordering kbo 11.33/1.97 --res_to_prop_solver active 11.33/1.97 --res_prop_simpl_new false 11.33/1.97 --res_prop_simpl_given true 11.33/1.97 --res_passive_queue_type priority_queues 11.33/1.97 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 11.33/1.97 --res_passive_queues_freq [15;5] 11.33/1.97 --res_forward_subs full 11.33/1.97 --res_backward_subs full 11.33/1.97 --res_forward_subs_resolution true 11.33/1.97 --res_backward_subs_resolution true 11.33/1.97 --res_orphan_elimination true 11.33/1.97 --res_time_limit 2. 11.33/1.97 --res_out_proof true 11.33/1.97 11.33/1.97 ------ Superposition Options 11.33/1.97 11.33/1.97 --superposition_flag true 11.33/1.97 --sup_passive_queue_type priority_queues 11.33/1.97 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 11.33/1.97 --sup_passive_queues_freq [8;1;4] 11.33/1.97 --demod_completeness_check fast 11.33/1.97 --demod_use_ground true 11.33/1.97 --sup_to_prop_solver passive 11.33/1.97 --sup_prop_simpl_new true 11.33/1.97 --sup_prop_simpl_given true 11.33/1.97 --sup_fun_splitting true 11.33/1.97 --sup_smt_interval 50000 11.33/1.97 11.33/1.97 ------ Superposition Simplification Setup 11.33/1.97 11.33/1.97 --sup_indices_passive [LightNormIndex;FwDemodIndex] 11.33/1.97 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 11.33/1.97 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 11.33/1.97 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 11.33/1.97 --sup_full_triv [TrivRules;PropSubs] 11.33/1.97 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 11.33/1.97 --sup_full_bw [BwDemod;BwSubsumption] 11.33/1.97 --sup_immed_triv [TrivRules] 11.33/1.97 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 11.33/1.97 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 11.33/1.97 --sup_immed_bw_main [] 11.33/1.97 --sup_immed_bw_immed [BwDemod;BwSubsumption] 11.33/1.97 --sup_input_triv [Unflattening;TrivRules] 11.33/1.97 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 11.33/1.97 --sup_input_bw [] 11.33/1.97 11.33/1.97 ------ Combination Options 11.33/1.97 11.33/1.97 --comb_res_mult 3 11.33/1.97 --comb_sup_mult 2 11.33/1.97 --comb_inst_mult 10 11.33/1.97 11.33/1.97 ------ Debug Options 11.33/1.97 11.33/1.97 --dbg_backtrace false 11.33/1.97 --dbg_dump_prop_clauses false 11.33/1.97 --dbg_dump_prop_clauses_file - 11.33/1.97 --dbg_out_stat false 11.33/1.97 ------ Parsing... 11.33/1.97 ------ Clausification by vclausify_rel & Parsing by iProver... 11.33/1.97 11.33/1.97 ------ Preprocessing... sf_s rm: 31 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 7 0s sf_e pe_s pe_e 11.33/1.97 11.33/1.97 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 11.33/1.97 11.33/1.97 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 11.33/1.97 ------ Proving... 11.33/1.97 ------ Problem Properties 11.33/1.97 11.33/1.97 11.33/1.97 clauses 47 11.33/1.97 conjectures 6 11.33/1.97 EPR 17 11.33/1.97 Horn 37 11.33/1.97 unary 23 11.33/1.97 binary 17 11.33/1.97 lits 90 11.33/1.97 lits eq 9 11.33/1.97 fd_pure 0 11.33/1.97 fd_pseudo 0 11.33/1.97 fd_cond 0 11.33/1.97 fd_pseudo_cond 0 11.33/1.97 AC symbols 0 11.33/1.97 11.33/1.97 ------ Schedule dynamic 5 is on 11.33/1.97 11.33/1.97 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 11.33/1.97 11.33/1.97 11.33/1.97 ------ 11.33/1.97 Current options: 11.33/1.97 ------ 11.33/1.97 11.33/1.97 ------ Input Options 11.33/1.97 11.33/1.97 --out_options all 11.33/1.97 --tptp_safe_out true 11.33/1.97 --problem_path "" 11.33/1.97 --include_path "" 11.33/1.97 --clausifier res/vclausify_rel 11.33/1.97 --clausifier_options "" 11.33/1.97 --stdin false 11.33/1.97 --stats_out all 11.33/1.97 11.33/1.97 ------ General Options 11.33/1.97 11.33/1.97 --fof false 11.33/1.97 --time_out_real 125. 11.33/1.97 --time_out_virtual -1. 11.33/1.97 --symbol_type_check false 11.33/1.97 --clausify_out false 11.33/1.97 --sig_cnt_out false 11.33/1.97 --trig_cnt_out false 11.33/1.97 --trig_cnt_out_tolerance 1. 11.33/1.97 --trig_cnt_out_sk_spl false 11.33/1.97 --abstr_cl_out false 11.33/1.97 11.33/1.97 ------ Global Options 11.33/1.97 11.33/1.97 --schedule default 11.33/1.97 --add_important_lit false 11.33/1.97 --prop_solver_per_cl 1000 11.33/1.97 --min_unsat_core false 11.33/1.97 --soft_assumptions false 11.33/1.97 --soft_lemma_size 3 11.33/1.97 --prop_impl_unit_size 0 11.33/1.97 --prop_impl_unit [] 11.33/1.97 --share_sel_clauses true 11.33/1.97 --reset_solvers false 11.33/1.97 --bc_imp_inh [conj_cone] 11.33/1.97 --conj_cone_tolerance 3. 11.33/1.97 --extra_neg_conj none 11.33/1.97 --large_theory_mode true 11.33/1.97 --prolific_symb_bound 200 11.33/1.97 --lt_threshold 2000 11.33/1.97 --clause_weak_htbl true 11.33/1.97 --gc_record_bc_elim false 11.33/1.97 11.33/1.97 ------ Preprocessing Options 11.33/1.97 11.33/1.97 --preprocessing_flag true 11.33/1.97 --time_out_prep_mult 0.1 11.33/1.97 --splitting_mode input 11.33/1.97 --splitting_grd true 11.33/1.97 --splitting_cvd false 11.33/1.97 --splitting_cvd_svl false 11.33/1.97 --splitting_nvd 32 11.33/1.97 --sub_typing true 11.33/1.97 --prep_gs_sim true 11.33/1.97 --prep_unflatten true 11.33/1.97 --prep_res_sim true 11.33/1.97 --prep_upred true 11.33/1.97 --prep_sem_filter exhaustive 11.33/1.97 --prep_sem_filter_out false 11.33/1.97 --pred_elim true 11.33/1.97 --res_sim_input true 11.33/1.97 --eq_ax_congr_red true 11.33/1.97 --pure_diseq_elim true 11.33/1.97 --brand_transform false 11.33/1.97 --non_eq_to_eq false 11.33/1.97 --prep_def_merge true 11.33/1.97 --prep_def_merge_prop_impl false 11.33/1.97 --prep_def_merge_mbd true 11.33/1.97 --prep_def_merge_tr_red false 11.33/1.97 --prep_def_merge_tr_cl false 11.33/1.97 --smt_preprocessing true 11.33/1.97 --smt_ac_axioms fast 11.33/1.97 --preprocessed_out false 11.33/1.97 --preprocessed_stats false 11.33/1.97 11.33/1.97 ------ Abstraction refinement Options 11.33/1.97 11.33/1.97 --abstr_ref [] 11.33/1.97 --abstr_ref_prep false 11.33/1.97 --abstr_ref_until_sat false 11.33/1.97 --abstr_ref_sig_restrict funpre 11.33/1.97 --abstr_ref_af_restrict_to_split_sk false 11.33/1.97 --abstr_ref_under [] 11.33/1.97 11.33/1.97 ------ SAT Options 11.33/1.97 11.33/1.97 --sat_mode false 11.33/1.97 --sat_fm_restart_options "" 11.33/1.97 --sat_gr_def false 11.33/1.97 --sat_epr_types true 11.33/1.97 --sat_non_cyclic_types false 11.33/1.97 --sat_finite_models false 11.33/1.97 --sat_fm_lemmas false 11.33/1.97 --sat_fm_prep false 11.33/1.97 --sat_fm_uc_incr true 11.33/1.97 --sat_out_model small 11.33/1.97 --sat_out_clauses false 11.33/1.97 11.33/1.97 ------ QBF Options 11.33/1.97 11.33/1.97 --qbf_mode false 11.33/1.97 --qbf_elim_univ false 11.33/1.97 --qbf_dom_inst none 11.33/1.97 --qbf_dom_pre_inst false 11.33/1.97 --qbf_sk_in false 11.33/1.97 --qbf_pred_elim true 11.33/1.97 --qbf_split 512 11.33/1.97 11.33/1.97 ------ BMC1 Options 11.33/1.97 11.33/1.97 --bmc1_incremental false 11.33/1.97 --bmc1_axioms reachable_all 11.33/1.97 --bmc1_min_bound 0 11.33/1.97 --bmc1_max_bound -1 11.33/1.97 --bmc1_max_bound_default -1 11.33/1.97 --bmc1_symbol_reachability true 11.33/1.97 --bmc1_property_lemmas false 11.33/1.97 --bmc1_k_induction false 11.33/1.97 --bmc1_non_equiv_states false 11.33/1.97 --bmc1_deadlock false 11.33/1.97 --bmc1_ucm false 11.33/1.97 --bmc1_add_unsat_core none 11.33/1.97 --bmc1_unsat_core_children false 11.33/1.97 --bmc1_unsat_core_extrapolate_axioms false 11.33/1.97 --bmc1_out_stat full 11.33/1.97 --bmc1_ground_init false 11.33/1.97 --bmc1_pre_inst_next_state false 11.33/1.97 --bmc1_pre_inst_state false 11.33/1.97 --bmc1_pre_inst_reach_state false 11.33/1.97 --bmc1_out_unsat_core false 11.33/1.97 --bmc1_aig_witness_out false 11.33/1.97 --bmc1_verbose false 11.33/1.97 --bmc1_dump_clauses_tptp false 11.33/1.97 --bmc1_dump_unsat_core_tptp false 11.33/1.97 --bmc1_dump_file - 11.33/1.97 --bmc1_ucm_expand_uc_limit 128 11.33/1.97 --bmc1_ucm_n_expand_iterations 6 11.33/1.97 --bmc1_ucm_extend_mode 1 11.33/1.97 --bmc1_ucm_init_mode 2 11.33/1.97 --bmc1_ucm_cone_mode none 11.33/1.97 --bmc1_ucm_reduced_relation_type 0 11.33/1.97 --bmc1_ucm_relax_model 4 11.33/1.97 --bmc1_ucm_full_tr_after_sat true 11.33/1.97 --bmc1_ucm_expand_neg_assumptions false 11.33/1.97 --bmc1_ucm_layered_model none 11.33/1.97 --bmc1_ucm_max_lemma_size 10 11.33/1.97 11.33/1.97 ------ AIG Options 11.33/1.97 11.33/1.97 --aig_mode false 11.33/1.97 11.33/1.97 ------ Instantiation Options 11.33/1.97 11.33/1.97 --instantiation_flag true 11.33/1.97 --inst_sos_flag true 11.33/1.97 --inst_sos_phase true 11.33/1.97 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 11.33/1.97 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 11.33/1.97 --inst_lit_sel_side none 11.33/1.97 --inst_solver_per_active 1400 11.33/1.97 --inst_solver_calls_frac 1. 11.33/1.97 --inst_passive_queue_type priority_queues 11.33/1.97 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 11.33/1.97 --inst_passive_queues_freq [25;2] 11.33/1.97 --inst_dismatching true 11.33/1.97 --inst_eager_unprocessed_to_passive true 11.33/1.97 --inst_prop_sim_given true 11.33/1.97 --inst_prop_sim_new false 11.33/1.97 --inst_subs_new false 11.33/1.97 --inst_eq_res_simp false 11.33/1.97 --inst_subs_given false 11.33/1.97 --inst_orphan_elimination true 11.33/1.97 --inst_learning_loop_flag true 11.33/1.97 --inst_learning_start 3000 11.33/1.97 --inst_learning_factor 2 11.33/1.97 --inst_start_prop_sim_after_learn 3 11.33/1.97 --inst_sel_renew solver 11.33/1.97 --inst_lit_activity_flag true 11.33/1.97 --inst_restr_to_given false 11.33/1.97 --inst_activity_threshold 500 11.33/1.97 --inst_out_proof true 11.33/1.97 11.33/1.97 ------ Resolution Options 11.33/1.97 11.33/1.97 --resolution_flag false 11.33/1.97 --res_lit_sel adaptive 11.33/1.97 --res_lit_sel_side none 11.33/1.97 --res_ordering kbo 11.33/1.97 --res_to_prop_solver active 11.33/1.97 --res_prop_simpl_new false 11.33/1.97 --res_prop_simpl_given true 11.33/1.97 --res_passive_queue_type priority_queues 11.33/1.97 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 11.33/1.97 --res_passive_queues_freq [15;5] 11.33/1.97 --res_forward_subs full 11.33/1.97 --res_backward_subs full 11.33/1.97 --res_forward_subs_resolution true 11.33/1.97 --res_backward_subs_resolution true 11.33/1.97 --res_orphan_elimination true 11.33/1.97 --res_time_limit 2. 11.33/1.97 --res_out_proof true 11.33/1.97 11.33/1.97 ------ Superposition Options 11.33/1.97 11.33/1.97 --superposition_flag true 11.33/1.97 --sup_passive_queue_type priority_queues 11.33/1.97 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 11.33/1.97 --sup_passive_queues_freq [8;1;4] 11.33/1.97 --demod_completeness_check fast 11.33/1.97 --demod_use_ground true 11.33/1.97 --sup_to_prop_solver passive 11.33/1.97 --sup_prop_simpl_new true 11.33/1.97 --sup_prop_simpl_given true 11.33/1.97 --sup_fun_splitting true 11.33/1.97 --sup_smt_interval 50000 11.33/1.97 11.33/1.97 ------ Superposition Simplification Setup 11.33/1.97 11.33/1.97 --sup_indices_passive [LightNormIndex;FwDemodIndex] 11.33/1.97 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 11.33/1.97 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 11.33/1.97 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 11.33/1.97 --sup_full_triv [TrivRules;PropSubs] 11.33/1.97 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 11.33/1.97 --sup_full_bw [BwDemod;BwSubsumption] 11.33/1.97 --sup_immed_triv [TrivRules] 11.33/1.97 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 11.33/1.97 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 11.33/1.97 --sup_immed_bw_main [] 11.33/1.97 --sup_immed_bw_immed [BwDemod;BwSubsumption] 11.33/1.97 --sup_input_triv [Unflattening;TrivRules] 11.33/1.97 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 11.33/1.97 --sup_input_bw [] 11.33/1.97 11.33/1.97 ------ Combination Options 11.33/1.97 11.33/1.97 --comb_res_mult 3 11.33/1.97 --comb_sup_mult 2 11.33/1.97 --comb_inst_mult 10 11.33/1.97 11.33/1.97 ------ Debug Options 11.33/1.97 11.33/1.97 --dbg_backtrace false 11.33/1.97 --dbg_dump_prop_clauses false 11.33/1.97 --dbg_dump_prop_clauses_file - 11.33/1.97 --dbg_out_stat false 11.33/1.97 11.33/1.97 11.33/1.97 11.33/1.97 11.33/1.97 ------ Proving... 11.33/1.97 11.33/1.97 11.33/1.97 % SZS status Theorem for theBenchmark.p 11.33/1.97 11.33/1.97 % SZS output start CNFRefutation for theBenchmark.p 11.33/1.97 11.33/1.97 fof(f8,conjecture,( 11.33/1.97 ! [X0,X1] : ((element(X1,powerset(powerset(succ(X0)))) & ordinal(X0)) => ? [X2] : ! [X3] : ((in(X3,powerset(X0)) & ? [X4] : (set_difference(X4,singleton(X0)) = X3 & in(X4,X1))) <=> in(X3,X2)))), 11.33/1.97 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 11.33/1.97 11.33/1.97 fof(f9,negated_conjecture,( 11.33/1.97 ~! [X0,X1] : ((element(X1,powerset(powerset(succ(X0)))) & ordinal(X0)) => ? [X2] : ! [X3] : ((in(X3,powerset(X0)) & ? [X4] : (set_difference(X4,singleton(X0)) = X3 & in(X4,X1))) <=> in(X3,X2)))), 11.33/1.97 inference(negated_conjecture,[],[f8])). 11.33/1.97 11.33/1.97 fof(f56,plain,( 11.33/1.97 ? [X0,X1] : (! [X2] : ? [X3] : ((in(X3,powerset(X0)) & ? [X4] : (set_difference(X4,singleton(X0)) = X3 & in(X4,X1))) <~> in(X3,X2)) & (element(X1,powerset(powerset(succ(X0)))) & ordinal(X0)))), 11.33/1.97 inference(ennf_transformation,[],[f9])). 11.33/1.97 11.33/1.97 fof(f57,plain,( 11.33/1.97 ? [X0,X1] : (! [X2] : ? [X3] : ((in(X3,powerset(X0)) & ? [X4] : (set_difference(X4,singleton(X0)) = X3 & in(X4,X1))) <~> in(X3,X2)) & element(X1,powerset(powerset(succ(X0)))) & ordinal(X0))), 11.33/1.97 inference(flattening,[],[f56])). 11.33/1.97 11.33/1.97 fof(f93,plain,( 11.33/1.97 ? [X0,X1] : (! [X2] : ? [X3] : ((~in(X3,X2) | (~in(X3,powerset(X0)) | ! [X4] : (set_difference(X4,singleton(X0)) != X3 | ~in(X4,X1)))) & (in(X3,X2) | (in(X3,powerset(X0)) & ? [X4] : (set_difference(X4,singleton(X0)) = X3 & in(X4,X1))))) & element(X1,powerset(powerset(succ(X0)))) & ordinal(X0))), 11.33/1.97 inference(nnf_transformation,[],[f57])). 11.33/1.97 11.33/1.97 fof(f94,plain,( 11.33/1.97 ? [X0,X1] : (! [X2] : ? [X3] : ((~in(X3,X2) | ~in(X3,powerset(X0)) | ! [X4] : (set_difference(X4,singleton(X0)) != X3 | ~in(X4,X1))) & (in(X3,X2) | (in(X3,powerset(X0)) & ? [X4] : (set_difference(X4,singleton(X0)) = X3 & in(X4,X1))))) & element(X1,powerset(powerset(succ(X0)))) & ordinal(X0))), 11.33/1.97 inference(flattening,[],[f93])). 11.33/1.97 11.33/1.97 fof(f95,plain,( 11.33/1.97 ? [X0,X1] : (! [X2] : ? [X3] : ((~in(X3,X2) | ~in(X3,powerset(X0)) | ! [X4] : (set_difference(X4,singleton(X0)) != X3 | ~in(X4,X1))) & (in(X3,X2) | (in(X3,powerset(X0)) & ? [X5] : (set_difference(X5,singleton(X0)) = X3 & in(X5,X1))))) & element(X1,powerset(powerset(succ(X0)))) & ordinal(X0))), 11.33/1.97 inference(rectify,[],[f94])). 11.33/1.97 11.33/1.97 fof(f98,plain,( 11.33/1.97 ( ! [X0,X3,X1] : (! [X2] : (? [X5] : (set_difference(X5,singleton(X0)) = X3 & in(X5,X1)) => (set_difference(sK14(X2),singleton(X0)) = X3 & in(sK14(X2),X1)))) )), 11.33/1.97 introduced(choice_axiom,[])). 11.33/1.97 11.33/1.97 fof(f97,plain,( 11.33/1.97 ( ! [X0,X1] : (! [X2] : (? [X3] : ((~in(X3,X2) | ~in(X3,powerset(X0)) | ! [X4] : (set_difference(X4,singleton(X0)) != X3 | ~in(X4,X1))) & (in(X3,X2) | (in(X3,powerset(X0)) & ? [X5] : (set_difference(X5,singleton(X0)) = X3 & in(X5,X1))))) => ((~in(sK13(X2),X2) | ~in(sK13(X2),powerset(X0)) | ! [X4] : (set_difference(X4,singleton(X0)) != sK13(X2) | ~in(X4,X1))) & (in(sK13(X2),X2) | (in(sK13(X2),powerset(X0)) & ? [X5] : (set_difference(X5,singleton(X0)) = sK13(X2) & in(X5,X1))))))) )), 11.33/1.97 introduced(choice_axiom,[])). 11.33/1.97 11.33/1.97 fof(f96,plain,( 11.33/1.97 ? [X0,X1] : (! [X2] : ? [X3] : ((~in(X3,X2) | ~in(X3,powerset(X0)) | ! [X4] : (set_difference(X4,singleton(X0)) != X3 | ~in(X4,X1))) & (in(X3,X2) | (in(X3,powerset(X0)) & ? [X5] : (set_difference(X5,singleton(X0)) = X3 & in(X5,X1))))) & element(X1,powerset(powerset(succ(X0)))) & ordinal(X0)) => (! [X2] : ? [X3] : ((~in(X3,X2) | ~in(X3,powerset(sK11)) | ! [X4] : (set_difference(X4,singleton(sK11)) != X3 | ~in(X4,sK12))) & (in(X3,X2) | (in(X3,powerset(sK11)) & ? [X5] : (set_difference(X5,singleton(sK11)) = X3 & in(X5,sK12))))) & element(sK12,powerset(powerset(succ(sK11)))) & ordinal(sK11))), 11.33/1.97 introduced(choice_axiom,[])). 11.33/1.97 11.33/1.97 fof(f99,plain,( 11.33/1.97 ! [X2] : ((~in(sK13(X2),X2) | ~in(sK13(X2),powerset(sK11)) | ! [X4] : (set_difference(X4,singleton(sK11)) != sK13(X2) | ~in(X4,sK12))) & (in(sK13(X2),X2) | (in(sK13(X2),powerset(sK11)) & (set_difference(sK14(X2),singleton(sK11)) = sK13(X2) & in(sK14(X2),sK12))))) & element(sK12,powerset(powerset(succ(sK11)))) & ordinal(sK11)), 11.33/1.97 inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12,sK13,sK14])],[f95,f98,f97,f96])). 11.33/1.97 11.33/1.97 fof(f154,plain,( 11.33/1.97 ( ! [X4,X2] : (~in(sK13(X2),X2) | ~in(sK13(X2),powerset(sK11)) | set_difference(X4,singleton(sK11)) != sK13(X2) | ~in(X4,sK12)) )), 11.33/1.97 inference(cnf_transformation,[],[f99])). 11.33/1.97 11.33/1.97 fof(f7,axiom,( 11.33/1.97 ! [X0,X1] : ((ordinal(X0) & element(X1,powerset(powerset(succ(X0))))) => (! [X2,X3,X4] : ((? [X7] : (in(X7,X1) & set_difference(X7,singleton(X0)) = X3) & X2 = X4 & ? [X6] : (in(X6,X1) & set_difference(X6,singleton(X0)) = X4) & X2 = X3) => X3 = X4) => ? [X2] : ! [X3] : (? [X4] : (X3 = X4 & ? [X5] : (in(X5,X1) & set_difference(X5,singleton(X0)) = X3) & in(X4,powerset(X0))) <=> in(X3,X2))))), 11.33/1.97 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 11.33/1.97 11.33/1.97 fof(f44,plain,( 11.33/1.97 ! [X0,X1] : ((ordinal(X0) & element(X1,powerset(powerset(succ(X0))))) => (! [X2,X3,X4] : ((? [X5] : (in(X5,X1) & set_difference(X5,singleton(X0)) = X3) & X2 = X4 & ? [X6] : (in(X6,X1) & set_difference(X6,singleton(X0)) = X4) & X2 = X3) => X3 = X4) => ? [X7] : ! [X8] : (? [X9] : (X8 = X9 & ? [X10] : (in(X10,X1) & set_difference(X10,singleton(X0)) = X8) & in(X9,powerset(X0))) <=> in(X8,X7))))), 11.33/1.97 inference(rectify,[],[f7])). 11.33/1.97 11.33/1.97 fof(f54,plain,( 11.33/1.97 ! [X0,X1] : ((? [X7] : ! [X8] : (? [X9] : (X8 = X9 & ? [X10] : (in(X10,X1) & set_difference(X10,singleton(X0)) = X8) & in(X9,powerset(X0))) <=> in(X8,X7)) | ? [X2,X3,X4] : (X3 != X4 & (? [X5] : (in(X5,X1) & set_difference(X5,singleton(X0)) = X3) & X2 = X4 & ? [X6] : (in(X6,X1) & set_difference(X6,singleton(X0)) = X4) & X2 = X3))) | (~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0))))))), 11.33/1.97 inference(ennf_transformation,[],[f44])). 11.33/1.97 11.33/1.97 fof(f55,plain,( 11.33/1.97 ! [X0,X1] : (? [X7] : ! [X8] : (? [X9] : (X8 = X9 & ? [X10] : (in(X10,X1) & set_difference(X10,singleton(X0)) = X8) & in(X9,powerset(X0))) <=> in(X8,X7)) | ? [X2,X3,X4] : (X3 != X4 & ? [X5] : (in(X5,X1) & set_difference(X5,singleton(X0)) = X3) & X2 = X4 & ? [X6] : (in(X6,X1) & set_difference(X6,singleton(X0)) = X4) & X2 = X3) | ~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0)))))), 11.33/1.97 inference(flattening,[],[f54])). 11.33/1.97 11.33/1.97 fof(f75,plain,( 11.33/1.97 ! [X1,X0] : (? [X2,X3,X4] : (X3 != X4 & ? [X5] : (in(X5,X1) & set_difference(X5,singleton(X0)) = X3) & X2 = X4 & ? [X6] : (in(X6,X1) & set_difference(X6,singleton(X0)) = X4) & X2 = X3) | ~sP0(X1,X0))), 11.33/1.97 introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])])). 11.33/1.97 11.33/1.97 fof(f76,plain,( 11.33/1.97 ! [X0,X1] : (? [X7] : ! [X8] : (? [X9] : (X8 = X9 & ? [X10] : (in(X10,X1) & set_difference(X10,singleton(X0)) = X8) & in(X9,powerset(X0))) <=> in(X8,X7)) | sP0(X1,X0) | ~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0)))))), 11.33/1.97 inference(definition_folding,[],[f55,f75])). 11.33/1.97 11.33/1.97 fof(f87,plain,( 11.33/1.97 ! [X0,X1] : (? [X7] : ! [X8] : ((? [X9] : (X8 = X9 & ? [X10] : (in(X10,X1) & set_difference(X10,singleton(X0)) = X8) & in(X9,powerset(X0))) | ~in(X8,X7)) & (in(X8,X7) | ! [X9] : (X8 != X9 | ! [X10] : (~in(X10,X1) | set_difference(X10,singleton(X0)) != X8) | ~in(X9,powerset(X0))))) | sP0(X1,X0) | ~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0)))))), 11.33/1.97 inference(nnf_transformation,[],[f76])). 11.33/1.97 11.33/1.97 fof(f88,plain,( 11.33/1.97 ! [X0,X1] : (? [X2] : ! [X3] : ((? [X4] : (X3 = X4 & ? [X5] : (in(X5,X1) & set_difference(X5,singleton(X0)) = X3) & in(X4,powerset(X0))) | ~in(X3,X2)) & (in(X3,X2) | ! [X6] : (X3 != X6 | ! [X7] : (~in(X7,X1) | set_difference(X7,singleton(X0)) != X3) | ~in(X6,powerset(X0))))) | sP0(X1,X0) | ~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0)))))), 11.33/1.97 inference(rectify,[],[f87])). 11.33/1.97 11.33/1.97 fof(f91,plain,( 11.33/1.97 ! [X3,X1,X0] : (? [X5] : (in(X5,X1) & set_difference(X5,singleton(X0)) = X3) => (in(sK10(X0,X1,X3),X1) & set_difference(sK10(X0,X1,X3),singleton(X0)) = X3))), 11.33/1.97 introduced(choice_axiom,[])). 11.33/1.97 11.33/1.97 fof(f90,plain,( 11.33/1.97 ! [X3,X1,X0] : (? [X4] : (X3 = X4 & ? [X5] : (in(X5,X1) & set_difference(X5,singleton(X0)) = X3) & in(X4,powerset(X0))) => (sK9(X0,X1,X3) = X3 & ? [X5] : (in(X5,X1) & set_difference(X5,singleton(X0)) = X3) & in(sK9(X0,X1,X3),powerset(X0))))), 11.33/1.97 introduced(choice_axiom,[])). 11.33/1.97 11.33/1.97 fof(f89,plain,( 11.33/1.97 ! [X1,X0] : (? [X2] : ! [X3] : ((? [X4] : (X3 = X4 & ? [X5] : (in(X5,X1) & set_difference(X5,singleton(X0)) = X3) & in(X4,powerset(X0))) | ~in(X3,X2)) & (in(X3,X2) | ! [X6] : (X3 != X6 | ! [X7] : (~in(X7,X1) | set_difference(X7,singleton(X0)) != X3) | ~in(X6,powerset(X0))))) => ! [X3] : ((? [X4] : (X3 = X4 & ? [X5] : (in(X5,X1) & set_difference(X5,singleton(X0)) = X3) & in(X4,powerset(X0))) | ~in(X3,sK8(X0,X1))) & (in(X3,sK8(X0,X1)) | ! [X6] : (X3 != X6 | ! [X7] : (~in(X7,X1) | set_difference(X7,singleton(X0)) != X3) | ~in(X6,powerset(X0))))))), 11.33/1.97 introduced(choice_axiom,[])). 11.33/1.97 11.33/1.97 fof(f92,plain,( 11.33/1.97 ! [X0,X1] : (! [X3] : (((sK9(X0,X1,X3) = X3 & (in(sK10(X0,X1,X3),X1) & set_difference(sK10(X0,X1,X3),singleton(X0)) = X3) & in(sK9(X0,X1,X3),powerset(X0))) | ~in(X3,sK8(X0,X1))) & (in(X3,sK8(X0,X1)) | ! [X6] : (X3 != X6 | ! [X7] : (~in(X7,X1) | set_difference(X7,singleton(X0)) != X3) | ~in(X6,powerset(X0))))) | sP0(X1,X0) | ~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0)))))), 11.33/1.97 inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10])],[f88,f91,f90,f89])). 11.33/1.97 11.33/1.97 fof(f144,plain,( 11.33/1.97 ( ! [X6,X0,X7,X3,X1] : (in(X3,sK8(X0,X1)) | X3 != X6 | ~in(X7,X1) | set_difference(X7,singleton(X0)) != X3 | ~in(X6,powerset(X0)) | sP0(X1,X0) | ~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0))))) )), 11.33/1.97 inference(cnf_transformation,[],[f92])). 11.33/1.97 11.33/1.97 fof(f231,plain,( 11.33/1.97 ( ! [X6,X0,X7,X1] : (in(X6,sK8(X0,X1)) | ~in(X7,X1) | set_difference(X7,singleton(X0)) != X6 | ~in(X6,powerset(X0)) | sP0(X1,X0) | ~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0))))) )), 11.33/1.97 inference(equality_resolution,[],[f144])). 11.33/1.97 11.33/1.97 fof(f232,plain,( 11.33/1.97 ( ! [X0,X7,X1] : (in(set_difference(X7,singleton(X0)),sK8(X0,X1)) | ~in(X7,X1) | ~in(set_difference(X7,singleton(X0)),powerset(X0)) | sP0(X1,X0) | ~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0))))) )), 11.33/1.97 inference(equality_resolution,[],[f231])). 11.33/1.97 11.33/1.97 fof(f146,plain,( 11.33/1.97 ( ! [X0,X3,X1] : (set_difference(sK10(X0,X1,X3),singleton(X0)) = X3 | ~in(X3,sK8(X0,X1)) | sP0(X1,X0) | ~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0))))) )), 11.33/1.97 inference(cnf_transformation,[],[f92])). 11.33/1.97 11.33/1.97 fof(f147,plain,( 11.33/1.97 ( ! [X0,X3,X1] : (in(sK10(X0,X1,X3),X1) | ~in(X3,sK8(X0,X1)) | sP0(X1,X0) | ~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0))))) )), 11.33/1.97 inference(cnf_transformation,[],[f92])). 11.33/1.97 11.33/1.97 fof(f145,plain,( 11.33/1.97 ( ! [X0,X3,X1] : (in(sK9(X0,X1,X3),powerset(X0)) | ~in(X3,sK8(X0,X1)) | sP0(X1,X0) | ~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0))))) )), 11.33/1.97 inference(cnf_transformation,[],[f92])). 11.33/1.97 11.33/1.97 fof(f81,plain,( 11.33/1.97 ! [X1,X0] : (? [X2,X3,X4] : (X3 != X4 & ? [X5] : (in(X5,X1) & set_difference(X5,singleton(X0)) = X3) & X2 = X4 & ? [X6] : (in(X6,X1) & set_difference(X6,singleton(X0)) = X4) & X2 = X3) | ~sP0(X1,X0))), 11.33/1.97 inference(nnf_transformation,[],[f75])). 11.33/1.97 11.33/1.97 fof(f82,plain,( 11.33/1.97 ! [X0,X1] : (? [X2,X3,X4] : (X3 != X4 & ? [X5] : (in(X5,X0) & set_difference(X5,singleton(X1)) = X3) & X2 = X4 & ? [X6] : (in(X6,X0) & set_difference(X6,singleton(X1)) = X4) & X2 = X3) | ~sP0(X0,X1))), 11.33/1.97 inference(rectify,[],[f81])). 11.33/1.97 11.33/1.97 fof(f85,plain,( 11.33/1.97 ( ! [X4] : (! [X1,X0] : (? [X6] : (in(X6,X0) & set_difference(X6,singleton(X1)) = X4) => (in(sK7(X0,X1),X0) & set_difference(sK7(X0,X1),singleton(X1)) = X4))) )), 11.33/1.97 introduced(choice_axiom,[])). 11.33/1.97 11.33/1.97 fof(f84,plain,( 11.33/1.97 ( ! [X3] : (! [X1,X0] : (? [X5] : (in(X5,X0) & set_difference(X5,singleton(X1)) = X3) => (in(sK6(X0,X1),X0) & set_difference(sK6(X0,X1),singleton(X1)) = X3))) )), 11.33/1.97 introduced(choice_axiom,[])). 11.33/1.97 11.33/1.97 fof(f83,plain,( 11.33/1.97 ! [X1,X0] : (? [X2,X3,X4] : (X3 != X4 & ? [X5] : (in(X5,X0) & set_difference(X5,singleton(X1)) = X3) & X2 = X4 & ? [X6] : (in(X6,X0) & set_difference(X6,singleton(X1)) = X4) & X2 = X3) => (sK4(X0,X1) != sK5(X0,X1) & ? [X5] : (in(X5,X0) & set_difference(X5,singleton(X1)) = sK4(X0,X1)) & sK3(X0,X1) = sK5(X0,X1) & ? [X6] : (in(X6,X0) & set_difference(X6,singleton(X1)) = sK5(X0,X1)) & sK3(X0,X1) = sK4(X0,X1)))), 11.33/1.97 introduced(choice_axiom,[])). 11.33/1.97 11.33/1.97 fof(f86,plain,( 11.33/1.97 ! [X0,X1] : ((sK4(X0,X1) != sK5(X0,X1) & (in(sK6(X0,X1),X0) & set_difference(sK6(X0,X1),singleton(X1)) = sK4(X0,X1)) & sK3(X0,X1) = sK5(X0,X1) & (in(sK7(X0,X1),X0) & set_difference(sK7(X0,X1),singleton(X1)) = sK5(X0,X1)) & sK3(X0,X1) = sK4(X0,X1)) | ~sP0(X0,X1))), 11.33/1.97 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7])],[f82,f85,f84,f83])). 11.33/1.97 11.33/1.97 fof(f137,plain,( 11.33/1.97 ( ! [X0,X1] : (sK3(X0,X1) = sK4(X0,X1) | ~sP0(X0,X1)) )), 11.33/1.97 inference(cnf_transformation,[],[f86])). 11.33/1.97 11.33/1.97 fof(f140,plain,( 11.33/1.97 ( ! [X0,X1] : (sK3(X0,X1) = sK5(X0,X1) | ~sP0(X0,X1)) )), 11.33/1.97 inference(cnf_transformation,[],[f86])). 11.33/1.97 11.33/1.97 fof(f151,plain,( 11.33/1.97 ( ! [X2] : (in(sK13(X2),X2) | in(sK14(X2),sK12)) )), 11.33/1.97 inference(cnf_transformation,[],[f99])). 11.33/1.97 11.33/1.97 fof(f150,plain,( 11.33/1.97 element(sK12,powerset(powerset(succ(sK11))))), 11.33/1.97 inference(cnf_transformation,[],[f99])). 11.33/1.97 11.33/1.97 fof(f149,plain,( 11.33/1.97 ordinal(sK11)), 11.33/1.97 inference(cnf_transformation,[],[f99])). 11.33/1.97 11.33/1.97 fof(f153,plain,( 11.33/1.97 ( ! [X2] : (in(sK13(X2),X2) | in(sK13(X2),powerset(sK11))) )), 11.33/1.97 inference(cnf_transformation,[],[f99])). 11.33/1.97 11.33/1.97 fof(f152,plain,( 11.33/1.97 ( ! [X2] : (in(sK13(X2),X2) | set_difference(sK14(X2),singleton(sK11)) = sK13(X2)) )), 11.33/1.97 inference(cnf_transformation,[],[f99])). 11.33/1.97 11.33/1.97 fof(f148,plain,( 11.33/1.97 ( ! [X0,X3,X1] : (sK9(X0,X1,X3) = X3 | ~in(X3,sK8(X0,X1)) | sP0(X1,X0) | ~ordinal(X0) | ~element(X1,powerset(powerset(succ(X0))))) )), 11.33/1.97 inference(cnf_transformation,[],[f92])). 11.33/1.97 11.33/1.97 fof(f143,plain,( 11.33/1.97 ( ! [X0,X1] : (sK4(X0,X1) != sK5(X0,X1) | ~sP0(X0,X1)) )), 11.33/1.97 inference(cnf_transformation,[],[f86])). 11.33/1.97 11.33/1.97 cnf(c_4666,plain, 11.33/1.97 ( ~ in(X0,X1) | in(X2,X3) | X2 != X0 | X3 != X1 ), 11.33/1.97 theory(equality) ). 11.33/1.97 11.33/1.97 cnf(c_5551,plain, 11.33/1.97 ( ~ in(X0,X1) 11.33/1.97 | in(sK13(X2),powerset(sK11)) 11.33/1.97 | sK13(X2) != X0 11.33/1.97 | powerset(sK11) != X1 ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4666]) ). 11.33/1.97 11.33/1.97 cnf(c_5598,plain, 11.33/1.97 ( ~ in(X0,powerset(sK11)) 11.33/1.97 | in(sK13(X1),powerset(sK11)) 11.33/1.97 | sK13(X1) != X0 11.33/1.97 | powerset(sK11) != powerset(sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5551]) ). 11.33/1.97 11.33/1.97 cnf(c_15064,plain, 11.33/1.97 ( ~ in(set_difference(sK14(sK8(X0,sK12)),singleton(sK11)),powerset(sK11)) 11.33/1.97 | in(sK13(X1),powerset(sK11)) 11.33/1.97 | sK13(X1) != set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) 11.33/1.97 | powerset(sK11) != powerset(sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5598]) ). 11.33/1.97 11.33/1.97 cnf(c_19438,plain, 11.33/1.97 ( ~ in(set_difference(sK14(sK8(X0,sK12)),singleton(sK11)),powerset(sK11)) 11.33/1.97 | in(sK13(sK8(X0,sK12)),powerset(sK11)) 11.33/1.97 | sK13(sK8(X0,sK12)) != set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) 11.33/1.97 | powerset(sK11) != powerset(sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_15064]) ). 11.33/1.97 11.33/1.97 cnf(c_19439,plain, 11.33/1.97 ( sK13(sK8(X0,sK12)) != set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) 11.33/1.97 | powerset(sK11) != powerset(sK11) 11.33/1.97 | in(set_difference(sK14(sK8(X0,sK12)),singleton(sK11)),powerset(sK11)) != iProver_top 11.33/1.97 | in(sK13(sK8(X0,sK12)),powerset(sK11)) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_19438]) ). 11.33/1.97 11.33/1.97 cnf(c_19441,plain, 11.33/1.97 ( sK13(sK8(sK11,sK12)) != set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) 11.33/1.97 | powerset(sK11) != powerset(sK11) 11.33/1.97 | in(set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)),powerset(sK11)) != iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),powerset(sK11)) = iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_19439]) ). 11.33/1.97 11.33/1.97 cnf(c_5693,plain, 11.33/1.97 ( in(X0,X1) 11.33/1.97 | ~ in(set_difference(X2,singleton(X3)),sK8(X3,X4)) 11.33/1.97 | X1 != sK8(X3,X4) 11.33/1.97 | X0 != set_difference(X2,singleton(X3)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4666]) ). 11.33/1.97 11.33/1.97 cnf(c_6168,plain, 11.33/1.97 ( in(X0,sK8(X1,X2)) 11.33/1.97 | ~ in(set_difference(X3,singleton(X1)),sK8(X1,X2)) 11.33/1.97 | X0 != set_difference(X3,singleton(X1)) 11.33/1.97 | sK8(X1,X2) != sK8(X1,X2) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5693]) ). 11.33/1.97 11.33/1.97 cnf(c_14820,plain, 11.33/1.97 ( ~ in(set_difference(sK14(sK8(X0,sK12)),singleton(sK11)),sK8(sK11,X1)) 11.33/1.97 | in(sK13(sK8(X0,sK12)),sK8(sK11,X1)) 11.33/1.97 | sK8(sK11,X1) != sK8(sK11,X1) 11.33/1.97 | sK13(sK8(X0,sK12)) != set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6168]) ). 11.33/1.97 11.33/1.97 cnf(c_16794,plain, 11.33/1.97 ( ~ in(set_difference(sK14(sK8(X0,sK12)),singleton(sK11)),sK8(sK11,sK12)) 11.33/1.97 | in(sK13(sK8(X0,sK12)),sK8(sK11,sK12)) 11.33/1.97 | sK8(sK11,sK12) != sK8(sK11,sK12) 11.33/1.97 | sK13(sK8(X0,sK12)) != set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_14820]) ). 11.33/1.97 11.33/1.97 cnf(c_16796,plain, 11.33/1.97 ( sK8(sK11,sK12) != sK8(sK11,sK12) 11.33/1.97 | sK13(sK8(X0,sK12)) != set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) 11.33/1.97 | in(set_difference(sK14(sK8(X0,sK12)),singleton(sK11)),sK8(sK11,sK12)) != iProver_top 11.33/1.97 | in(sK13(sK8(X0,sK12)),sK8(sK11,sK12)) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_16794]) ). 11.33/1.97 11.33/1.97 cnf(c_16798,plain, 11.33/1.97 ( sK8(sK11,sK12) != sK8(sK11,sK12) 11.33/1.97 | sK13(sK8(sK11,sK12)) != set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) 11.33/1.97 | in(set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)),sK8(sK11,sK12)) != iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) = iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_16796]) ). 11.33/1.97 11.33/1.97 cnf(c_5688,plain, 11.33/1.97 ( in(X0,X1) 11.33/1.97 | ~ in(sK9(X2,X3,X4),powerset(X2)) 11.33/1.97 | X0 != sK9(X2,X3,X4) 11.33/1.97 | X1 != powerset(X2) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4666]) ). 11.33/1.97 11.33/1.97 cnf(c_6154,plain, 11.33/1.97 ( in(X0,powerset(X1)) 11.33/1.97 | ~ in(sK9(X1,X2,X3),powerset(X1)) 11.33/1.97 | X0 != sK9(X1,X2,X3) 11.33/1.97 | powerset(X1) != powerset(X1) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5688]) ). 11.33/1.97 11.33/1.97 cnf(c_9382,plain, 11.33/1.97 ( in(X0,powerset(sK11)) 11.33/1.97 | ~ in(sK9(sK11,sK12,sK13(sK8(sK11,sK12))),powerset(sK11)) 11.33/1.97 | X0 != sK9(sK11,sK12,sK13(sK8(sK11,sK12))) 11.33/1.97 | powerset(sK11) != powerset(sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6154]) ). 11.33/1.97 11.33/1.97 cnf(c_14490,plain, 11.33/1.97 ( ~ in(sK9(sK11,sK12,sK13(sK8(sK11,sK12))),powerset(sK11)) 11.33/1.97 | in(set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)),powerset(sK11)) 11.33/1.97 | set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) != sK9(sK11,sK12,sK13(sK8(sK11,sK12))) 11.33/1.97 | powerset(sK11) != powerset(sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_9382]) ). 11.33/1.97 11.33/1.97 cnf(c_14491,plain, 11.33/1.97 ( set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) != sK9(sK11,sK12,sK13(sK8(sK11,sK12))) 11.33/1.97 | powerset(sK11) != powerset(sK11) 11.33/1.97 | in(sK9(sK11,sK12,sK13(sK8(sK11,sK12))),powerset(sK11)) != iProver_top 11.33/1.97 | in(set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)),powerset(sK11)) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_14490]) ). 11.33/1.97 11.33/1.97 cnf(c_4659,plain,( X0 = X0 ),theory(equality) ). 11.33/1.97 11.33/1.97 cnf(c_7974,plain, 11.33/1.97 ( sK4(X0,X1) = sK4(X0,X1) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4659]) ). 11.33/1.97 11.33/1.97 cnf(c_13698,plain, 11.33/1.97 ( sK4(sK12,X0) = sK4(sK12,X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_7974]) ). 11.33/1.97 11.33/1.97 cnf(c_13699,plain, 11.33/1.97 ( sK4(sK12,sK11) = sK4(sK12,sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_13698]) ). 11.33/1.97 11.33/1.97 cnf(c_5604,plain, 11.33/1.97 ( ~ in(X0,powerset(X1)) 11.33/1.97 | in(sK13(X2),powerset(sK11)) 11.33/1.97 | sK13(X2) != X0 11.33/1.97 | powerset(sK11) != powerset(X1) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5551]) ). 11.33/1.97 11.33/1.97 cnf(c_5795,plain, 11.33/1.97 ( ~ in(sK9(X0,X1,X2),powerset(X0)) 11.33/1.97 | in(sK13(X3),powerset(sK11)) 11.33/1.97 | sK13(X3) != sK9(X0,X1,X2) 11.33/1.97 | powerset(sK11) != powerset(X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5604]) ). 11.33/1.97 11.33/1.97 cnf(c_9377,plain, 11.33/1.97 ( ~ in(sK9(sK11,sK12,sK13(sK8(sK11,sK12))),powerset(sK11)) 11.33/1.97 | in(sK13(X0),powerset(sK11)) 11.33/1.97 | sK13(X0) != sK9(sK11,sK12,sK13(sK8(sK11,sK12))) 11.33/1.97 | powerset(sK11) != powerset(sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5795]) ). 11.33/1.97 11.33/1.97 cnf(c_12896,plain, 11.33/1.97 ( ~ in(sK9(sK11,sK12,sK13(sK8(sK11,sK12))),powerset(sK11)) 11.33/1.97 | in(sK13(sK8(sK11,sK12)),powerset(sK11)) 11.33/1.97 | sK13(sK8(sK11,sK12)) != sK9(sK11,sK12,sK13(sK8(sK11,sK12))) 11.33/1.97 | powerset(sK11) != powerset(sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_9377]) ). 11.33/1.97 11.33/1.97 cnf(c_12898,plain, 11.33/1.97 ( sK13(sK8(sK11,sK12)) != sK9(sK11,sK12,sK13(sK8(sK11,sK12))) 11.33/1.97 | powerset(sK11) != powerset(sK11) 11.33/1.97 | in(sK9(sK11,sK12,sK13(sK8(sK11,sK12))),powerset(sK11)) != iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),powerset(sK11)) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_12896]) ). 11.33/1.97 11.33/1.97 cnf(c_21,negated_conjecture, 11.33/1.97 ( ~ in(X0,sK12) 11.33/1.97 | ~ in(sK13(X1),X1) 11.33/1.97 | ~ in(sK13(X1),powerset(sK11)) 11.33/1.97 | set_difference(X0,singleton(sK11)) != sK13(X1) ), 11.33/1.97 inference(cnf_transformation,[],[f154]) ). 11.33/1.97 11.33/1.97 cnf(c_5512,plain, 11.33/1.97 ( ~ in(sK10(X0,sK12,X1),sK12) 11.33/1.97 | ~ in(sK13(X2),X2) 11.33/1.97 | ~ in(sK13(X2),powerset(sK11)) 11.33/1.97 | set_difference(sK10(X0,sK12,X1),singleton(sK11)) != sK13(X2) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_21]) ). 11.33/1.97 11.33/1.97 cnf(c_9445,plain, 11.33/1.97 ( ~ in(sK10(X0,sK12,X1),sK12) 11.33/1.97 | ~ in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) 11.33/1.97 | ~ in(sK13(sK8(sK11,sK12)),powerset(sK11)) 11.33/1.97 | set_difference(sK10(X0,sK12,X1),singleton(sK11)) != sK13(sK8(sK11,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5512]) ). 11.33/1.97 11.33/1.97 cnf(c_12421,plain, 11.33/1.97 ( ~ in(sK10(X0,sK12,sK13(sK8(X0,sK12))),sK12) 11.33/1.97 | ~ in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) 11.33/1.97 | ~ in(sK13(sK8(sK11,sK12)),powerset(sK11)) 11.33/1.97 | set_difference(sK10(X0,sK12,sK13(sK8(X0,sK12))),singleton(sK11)) != sK13(sK8(sK11,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_9445]) ). 11.33/1.97 11.33/1.97 cnf(c_12440,plain, 11.33/1.97 ( set_difference(sK10(X0,sK12,sK13(sK8(X0,sK12))),singleton(sK11)) != sK13(sK8(sK11,sK12)) 11.33/1.97 | in(sK10(X0,sK12,sK13(sK8(X0,sK12))),sK12) != iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) != iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),powerset(sK11)) != iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_12421]) ). 11.33/1.97 11.33/1.97 cnf(c_12442,plain, 11.33/1.97 ( set_difference(sK10(sK11,sK12,sK13(sK8(sK11,sK12))),singleton(sK11)) != sK13(sK8(sK11,sK12)) 11.33/1.97 | in(sK10(sK11,sK12,sK13(sK8(sK11,sK12))),sK12) != iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) != iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),powerset(sK11)) != iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_12440]) ). 11.33/1.97 11.33/1.97 cnf(c_6211,plain, 11.33/1.97 ( in(X0,X1) | ~ in(sK13(X2),X3) | X1 != X3 | X0 != sK13(X2) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4666]) ). 11.33/1.97 11.33/1.97 cnf(c_9674,plain, 11.33/1.97 ( in(set_difference(sK14(sK8(X0,sK12)),singleton(sK11)),X1) 11.33/1.97 | ~ in(sK13(sK8(X0,sK12)),X2) 11.33/1.97 | X1 != X2 11.33/1.97 | set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) != sK13(sK8(X0,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6211]) ). 11.33/1.97 11.33/1.97 cnf(c_10764,plain, 11.33/1.97 ( in(set_difference(sK14(sK8(X0,sK12)),singleton(sK11)),X1) 11.33/1.97 | ~ in(sK13(sK8(X0,sK12)),powerset(sK11)) 11.33/1.97 | X1 != powerset(sK11) 11.33/1.97 | set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) != sK13(sK8(X0,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_9674]) ). 11.33/1.97 11.33/1.97 cnf(c_12378,plain, 11.33/1.97 ( in(set_difference(sK14(sK8(X0,sK12)),singleton(sK11)),powerset(sK11)) 11.33/1.97 | ~ in(sK13(sK8(X0,sK12)),powerset(sK11)) 11.33/1.97 | set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) != sK13(sK8(X0,sK12)) 11.33/1.97 | powerset(sK11) != powerset(sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_10764]) ). 11.33/1.97 11.33/1.97 cnf(c_12379,plain, 11.33/1.97 ( set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) != sK13(sK8(X0,sK12)) 11.33/1.97 | powerset(sK11) != powerset(sK11) 11.33/1.97 | in(set_difference(sK14(sK8(X0,sK12)),singleton(sK11)),powerset(sK11)) = iProver_top 11.33/1.97 | in(sK13(sK8(X0,sK12)),powerset(sK11)) != iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_12378]) ). 11.33/1.97 11.33/1.97 cnf(c_12381,plain, 11.33/1.97 ( set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) != sK13(sK8(sK11,sK12)) 11.33/1.97 | powerset(sK11) != powerset(sK11) 11.33/1.97 | in(set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)),powerset(sK11)) = iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),powerset(sK11)) != iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_12379]) ). 11.33/1.97 11.33/1.97 cnf(c_4660,plain,( X0 != X1 | X2 != X1 | X2 = X0 ),theory(equality) ). 11.33/1.97 11.33/1.97 cnf(c_6486,plain, 11.33/1.97 ( X0 != X1 11.33/1.97 | set_difference(X2,singleton(X3)) != X1 11.33/1.97 | set_difference(X2,singleton(X3)) = X0 ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4660]) ). 11.33/1.97 11.33/1.97 cnf(c_9684,plain, 11.33/1.97 ( X0 != sK13(sK8(X1,sK12)) 11.33/1.97 | set_difference(sK14(sK8(X1,sK12)),singleton(sK11)) = X0 11.33/1.97 | set_difference(sK14(sK8(X1,sK12)),singleton(sK11)) != sK13(sK8(X1,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6486]) ). 11.33/1.97 11.33/1.97 cnf(c_12308,plain, 11.33/1.97 ( sK9(X0,sK12,sK13(sK8(X0,sK12))) != sK13(sK8(X0,sK12)) 11.33/1.97 | set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) = sK9(X0,sK12,sK13(sK8(X0,sK12))) 11.33/1.97 | set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) != sK13(sK8(X0,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_9684]) ). 11.33/1.97 11.33/1.97 cnf(c_12309,plain, 11.33/1.97 ( sK9(sK11,sK12,sK13(sK8(sK11,sK12))) != sK13(sK8(sK11,sK12)) 11.33/1.97 | set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) = sK9(sK11,sK12,sK13(sK8(sK11,sK12))) 11.33/1.97 | set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) != sK13(sK8(sK11,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_12308]) ). 11.33/1.97 11.33/1.97 cnf(c_7805,plain, 11.33/1.97 ( X0 != X1 | sK4(X2,X3) != X1 | sK4(X2,X3) = X0 ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4660]) ). 11.33/1.97 11.33/1.97 cnf(c_9024,plain, 11.33/1.97 ( X0 != sK4(X1,X2) | sK4(X1,X2) = X0 | sK4(X1,X2) != sK4(X1,X2) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_7805]) ). 11.33/1.97 11.33/1.97 cnf(c_12170,plain, 11.33/1.97 ( sK3(sK12,X0) != sK4(sK12,X0) 11.33/1.97 | sK4(sK12,X0) = sK3(sK12,X0) 11.33/1.97 | sK4(sK12,X0) != sK4(sK12,X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_9024]) ). 11.33/1.97 11.33/1.97 cnf(c_12171,plain, 11.33/1.97 ( sK3(sK12,sK11) != sK4(sK12,sK11) 11.33/1.97 | sK4(sK12,sK11) = sK3(sK12,sK11) 11.33/1.97 | sK4(sK12,sK11) != sK4(sK12,sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_12170]) ). 11.33/1.97 11.33/1.97 cnf(c_6177,plain, 11.33/1.97 ( sK5(sK12,X0) != X1 11.33/1.97 | sK5(sK12,X0) = sK4(sK12,X0) 11.33/1.97 | sK4(sK12,X0) != X1 ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4660]) ). 11.33/1.97 11.33/1.97 cnf(c_11406,plain, 11.33/1.97 ( sK5(sK12,X0) != sK3(sK12,X0) 11.33/1.97 | sK5(sK12,X0) = sK4(sK12,X0) 11.33/1.97 | sK4(sK12,X0) != sK3(sK12,X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6177]) ). 11.33/1.97 11.33/1.97 cnf(c_11407,plain, 11.33/1.97 ( sK5(sK12,sK11) != sK3(sK12,sK11) 11.33/1.97 | sK5(sK12,sK11) = sK4(sK12,sK11) 11.33/1.97 | sK4(sK12,sK11) != sK3(sK12,sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_11406]) ). 11.33/1.97 11.33/1.97 cnf(c_11017,plain, 11.33/1.97 ( sK8(X0,sK12) = sK8(X0,sK12) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4659]) ). 11.33/1.97 11.33/1.97 cnf(c_11018,plain, 11.33/1.97 ( sK8(sK11,sK12) = sK8(sK11,sK12) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_11017]) ). 11.33/1.97 11.33/1.97 cnf(c_9477,plain, 11.33/1.97 ( ~ in(sK14(sK8(sK11,sK12)),sK12) 11.33/1.97 | ~ in(sK13(X0),X0) 11.33/1.97 | ~ in(sK13(X0),powerset(sK11)) 11.33/1.97 | set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) != sK13(X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_21]) ). 11.33/1.97 11.33/1.97 cnf(c_10054,plain, 11.33/1.97 ( ~ in(sK14(sK8(sK11,sK12)),sK12) 11.33/1.97 | ~ in(sK13(sK8(X0,sK12)),sK8(X0,sK12)) 11.33/1.97 | ~ in(sK13(sK8(X0,sK12)),powerset(sK11)) 11.33/1.97 | set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) != sK13(sK8(X0,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_9477]) ). 11.33/1.97 11.33/1.97 cnf(c_10055,plain, 11.33/1.97 ( set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) != sK13(sK8(X0,sK12)) 11.33/1.97 | in(sK14(sK8(sK11,sK12)),sK12) != iProver_top 11.33/1.97 | in(sK13(sK8(X0,sK12)),sK8(X0,sK12)) != iProver_top 11.33/1.97 | in(sK13(sK8(X0,sK12)),powerset(sK11)) != iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_10054]) ). 11.33/1.97 11.33/1.97 cnf(c_10057,plain, 11.33/1.97 ( set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) != sK13(sK8(sK11,sK12)) 11.33/1.97 | in(sK14(sK8(sK11,sK12)),sK12) != iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) != iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),powerset(sK11)) != iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_10055]) ). 11.33/1.97 11.33/1.97 cnf(c_6009,plain, 11.33/1.97 ( sK13(X0) = sK13(X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4659]) ). 11.33/1.97 11.33/1.97 cnf(c_9711,plain, 11.33/1.97 ( sK13(sK8(X0,sK12)) = sK13(sK8(X0,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6009]) ). 11.33/1.97 11.33/1.97 cnf(c_9712,plain, 11.33/1.97 ( sK13(sK8(sK11,sK12)) = sK13(sK8(sK11,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_9711]) ). 11.33/1.97 11.33/1.97 cnf(c_6008,plain, 11.33/1.97 ( X0 != X1 | sK13(X2) != X1 | sK13(X2) = X0 ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4660]) ). 11.33/1.97 11.33/1.97 cnf(c_6285,plain, 11.33/1.97 ( X0 != sK13(X1) | sK13(X1) = X0 | sK13(X1) != sK13(X1) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6008]) ). 11.33/1.97 11.33/1.97 cnf(c_9662,plain, 11.33/1.97 ( set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) != sK13(sK8(X0,sK12)) 11.33/1.97 | sK13(sK8(X0,sK12)) = set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) 11.33/1.97 | sK13(sK8(X0,sK12)) != sK13(sK8(X0,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6285]) ). 11.33/1.97 11.33/1.97 cnf(c_9673,plain, 11.33/1.97 ( set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) != sK13(sK8(sK11,sK12)) 11.33/1.97 | sK13(sK8(sK11,sK12)) = set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) 11.33/1.97 | sK13(sK8(sK11,sK12)) != sK13(sK8(sK11,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_9662]) ). 11.33/1.97 11.33/1.97 cnf(c_20,plain, 11.33/1.97 ( ~ in(X0,X1) 11.33/1.97 | in(set_difference(X0,singleton(X2)),sK8(X2,X1)) 11.33/1.97 | ~ in(set_difference(X0,singleton(X2)),powerset(X2)) 11.33/1.97 | sP0(X1,X2) 11.33/1.97 | ~ element(X1,powerset(powerset(succ(X2)))) 11.33/1.97 | ~ ordinal(X2) ), 11.33/1.97 inference(cnf_transformation,[],[f232]) ). 11.33/1.97 11.33/1.97 cnf(c_9461,plain, 11.33/1.97 ( in(set_difference(sK14(sK8(sK11,sK12)),singleton(X0)),sK8(X0,sK12)) 11.33/1.97 | ~ in(set_difference(sK14(sK8(sK11,sK12)),singleton(X0)),powerset(X0)) 11.33/1.97 | ~ in(sK14(sK8(sK11,sK12)),sK12) 11.33/1.97 | sP0(sK12,X0) 11.33/1.97 | ~ element(sK12,powerset(powerset(succ(X0)))) 11.33/1.97 | ~ ordinal(X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_20]) ). 11.33/1.97 11.33/1.97 cnf(c_9472,plain, 11.33/1.97 ( in(set_difference(sK14(sK8(sK11,sK12)),singleton(X0)),sK8(X0,sK12)) = iProver_top 11.33/1.97 | in(set_difference(sK14(sK8(sK11,sK12)),singleton(X0)),powerset(X0)) != iProver_top 11.33/1.97 | in(sK14(sK8(sK11,sK12)),sK12) != iProver_top 11.33/1.97 | sP0(sK12,X0) = iProver_top 11.33/1.97 | element(sK12,powerset(powerset(succ(X0)))) != iProver_top 11.33/1.97 | ordinal(X0) != iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_9461]) ). 11.33/1.97 11.33/1.97 cnf(c_9474,plain, 11.33/1.97 ( in(set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)),sK8(sK11,sK12)) = iProver_top 11.33/1.97 | in(set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)),powerset(sK11)) != iProver_top 11.33/1.97 | in(sK14(sK8(sK11,sK12)),sK12) != iProver_top 11.33/1.97 | sP0(sK12,sK11) = iProver_top 11.33/1.97 | element(sK12,powerset(powerset(succ(sK11)))) != iProver_top 11.33/1.97 | ordinal(sK11) != iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_9472]) ). 11.33/1.97 11.33/1.97 cnf(c_18,plain, 11.33/1.97 ( ~ in(X0,sK8(X1,X2)) 11.33/1.97 | sP0(X2,X1) 11.33/1.97 | ~ element(X2,powerset(powerset(succ(X1)))) 11.33/1.97 | ~ ordinal(X1) 11.33/1.97 | set_difference(sK10(X1,X2,X0),singleton(X1)) = X0 ), 11.33/1.97 inference(cnf_transformation,[],[f146]) ). 11.33/1.97 11.33/1.97 cnf(c_7497,plain, 11.33/1.97 ( ~ in(X0,sK8(X1,sK12)) 11.33/1.97 | sP0(sK12,X1) 11.33/1.97 | ~ element(sK12,powerset(powerset(succ(X1)))) 11.33/1.97 | ~ ordinal(X1) 11.33/1.97 | set_difference(sK10(X1,sK12,X0),singleton(X1)) = X0 ), 11.33/1.97 inference(instantiation,[status(thm)],[c_18]) ). 11.33/1.97 11.33/1.97 cnf(c_8746,plain, 11.33/1.97 ( ~ in(sK13(sK8(X0,sK12)),sK8(X0,sK12)) 11.33/1.97 | sP0(sK12,X0) 11.33/1.97 | ~ element(sK12,powerset(powerset(succ(X0)))) 11.33/1.97 | ~ ordinal(X0) 11.33/1.97 | set_difference(sK10(X0,sK12,sK13(sK8(X0,sK12))),singleton(X0)) = sK13(sK8(X0,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_7497]) ). 11.33/1.97 11.33/1.97 cnf(c_8747,plain, 11.33/1.97 ( set_difference(sK10(X0,sK12,sK13(sK8(X0,sK12))),singleton(X0)) = sK13(sK8(X0,sK12)) 11.33/1.97 | in(sK13(sK8(X0,sK12)),sK8(X0,sK12)) != iProver_top 11.33/1.97 | sP0(sK12,X0) = iProver_top 11.33/1.97 | element(sK12,powerset(powerset(succ(X0)))) != iProver_top 11.33/1.97 | ordinal(X0) != iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_8746]) ). 11.33/1.97 11.33/1.97 cnf(c_8749,plain, 11.33/1.97 ( set_difference(sK10(sK11,sK12,sK13(sK8(sK11,sK12))),singleton(sK11)) = sK13(sK8(sK11,sK12)) 11.33/1.97 | in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) != iProver_top 11.33/1.97 | sP0(sK12,sK11) = iProver_top 11.33/1.97 | element(sK12,powerset(powerset(succ(sK11)))) != iProver_top 11.33/1.97 | ordinal(sK11) != iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_8747]) ). 11.33/1.97 11.33/1.97 cnf(c_17,plain, 11.33/1.97 ( ~ in(X0,sK8(X1,X2)) 11.33/1.97 | in(sK10(X1,X2,X0),X2) 11.33/1.97 | sP0(X2,X1) 11.33/1.97 | ~ element(X2,powerset(powerset(succ(X1)))) 11.33/1.97 | ~ ordinal(X1) ), 11.33/1.97 inference(cnf_transformation,[],[f147]) ). 11.33/1.97 11.33/1.97 cnf(c_5703,plain, 11.33/1.97 ( ~ in(X0,sK8(X1,sK12)) 11.33/1.97 | in(sK10(X1,sK12,X0),sK12) 11.33/1.97 | sP0(sK12,X1) 11.33/1.97 | ~ element(sK12,powerset(powerset(succ(X1)))) 11.33/1.97 | ~ ordinal(X1) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_17]) ). 11.33/1.97 11.33/1.97 cnf(c_8712,plain, 11.33/1.97 ( in(sK10(X0,sK12,sK13(sK8(X0,sK12))),sK12) 11.33/1.97 | ~ in(sK13(sK8(X0,sK12)),sK8(X0,sK12)) 11.33/1.97 | sP0(sK12,X0) 11.33/1.97 | ~ element(sK12,powerset(powerset(succ(X0)))) 11.33/1.97 | ~ ordinal(X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5703]) ). 11.33/1.97 11.33/1.97 cnf(c_8713,plain, 11.33/1.97 ( in(sK10(X0,sK12,sK13(sK8(X0,sK12))),sK12) = iProver_top 11.33/1.97 | in(sK13(sK8(X0,sK12)),sK8(X0,sK12)) != iProver_top 11.33/1.97 | sP0(sK12,X0) = iProver_top 11.33/1.97 | element(sK12,powerset(powerset(succ(X0)))) != iProver_top 11.33/1.97 | ordinal(X0) != iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_8712]) ). 11.33/1.97 11.33/1.97 cnf(c_8715,plain, 11.33/1.97 ( in(sK10(sK11,sK12,sK13(sK8(sK11,sK12))),sK12) = iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) != iProver_top 11.33/1.97 | sP0(sK12,sK11) = iProver_top 11.33/1.97 | element(sK12,powerset(powerset(succ(sK11)))) != iProver_top 11.33/1.97 | ordinal(sK11) != iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_8713]) ). 11.33/1.97 11.33/1.97 cnf(c_8488,plain, 11.33/1.97 ( sK9(X0,sK12,sK13(sK8(X0,sK12))) != sK13(sK8(X0,sK12)) 11.33/1.97 | sK13(sK8(X0,sK12)) = sK9(X0,sK12,sK13(sK8(X0,sK12))) 11.33/1.97 | sK13(sK8(X0,sK12)) != sK13(sK8(X0,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6285]) ). 11.33/1.97 11.33/1.97 cnf(c_8499,plain, 11.33/1.97 ( sK9(sK11,sK12,sK13(sK8(sK11,sK12))) != sK13(sK8(sK11,sK12)) 11.33/1.97 | sK13(sK8(sK11,sK12)) = sK9(sK11,sK12,sK13(sK8(sK11,sK12))) 11.33/1.97 | sK13(sK8(sK11,sK12)) != sK13(sK8(sK11,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_8488]) ). 11.33/1.97 11.33/1.97 cnf(c_19,plain, 11.33/1.97 ( ~ in(X0,sK8(X1,X2)) 11.33/1.97 | in(sK9(X1,X2,X0),powerset(X1)) 11.33/1.97 | sP0(X2,X1) 11.33/1.97 | ~ element(X2,powerset(powerset(succ(X1)))) 11.33/1.97 | ~ ordinal(X1) ), 11.33/1.97 inference(cnf_transformation,[],[f145]) ). 11.33/1.97 11.33/1.97 cnf(c_6113,plain, 11.33/1.97 ( ~ in(X0,sK8(sK11,X1)) 11.33/1.97 | in(sK9(sK11,X1,X0),powerset(sK11)) 11.33/1.97 | sP0(X1,sK11) 11.33/1.97 | ~ element(X1,powerset(powerset(succ(sK11)))) 11.33/1.97 | ~ ordinal(sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_19]) ). 11.33/1.97 11.33/1.97 cnf(c_6623,plain, 11.33/1.97 ( ~ in(X0,sK8(sK11,sK12)) 11.33/1.97 | in(sK9(sK11,sK12,X0),powerset(sK11)) 11.33/1.97 | sP0(sK12,sK11) 11.33/1.97 | ~ element(sK12,powerset(powerset(succ(sK11)))) 11.33/1.97 | ~ ordinal(sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6113]) ). 11.33/1.97 11.33/1.97 cnf(c_8440,plain, 11.33/1.97 ( in(sK9(sK11,sK12,sK13(sK8(sK11,sK12))),powerset(sK11)) 11.33/1.97 | ~ in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) 11.33/1.97 | sP0(sK12,sK11) 11.33/1.97 | ~ element(sK12,powerset(powerset(succ(sK11)))) 11.33/1.97 | ~ ordinal(sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6623]) ). 11.33/1.97 11.33/1.97 cnf(c_8444,plain, 11.33/1.97 ( in(sK9(sK11,sK12,sK13(sK8(sK11,sK12))),powerset(sK11)) = iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) != iProver_top 11.33/1.97 | sP0(sK12,sK11) = iProver_top 11.33/1.97 | element(sK12,powerset(powerset(succ(sK11)))) != iProver_top 11.33/1.97 | ordinal(sK11) != iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_8440]) ). 11.33/1.97 11.33/1.97 cnf(c_15,plain, 11.33/1.97 ( ~ sP0(X0,X1) | sK3(X0,X1) = sK4(X0,X1) ), 11.33/1.97 inference(cnf_transformation,[],[f137]) ). 11.33/1.97 11.33/1.97 cnf(c_8177,plain, 11.33/1.97 ( ~ sP0(sK12,X0) | sK3(sK12,X0) = sK4(sK12,X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_15]) ). 11.33/1.97 11.33/1.97 cnf(c_8178,plain, 11.33/1.97 ( sK3(sK12,X0) = sK4(sK12,X0) | sP0(sK12,X0) != iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_8177]) ). 11.33/1.97 11.33/1.97 cnf(c_8180,plain, 11.33/1.97 ( sK3(sK12,sK11) = sK4(sK12,sK11) | sP0(sK12,sK11) != iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_8178]) ). 11.33/1.97 11.33/1.97 cnf(c_12,plain, 11.33/1.97 ( ~ sP0(X0,X1) | sK3(X0,X1) = sK5(X0,X1) ), 11.33/1.97 inference(cnf_transformation,[],[f140]) ). 11.33/1.97 11.33/1.97 cnf(c_8156,plain, 11.33/1.97 ( ~ sP0(sK12,X0) | sK3(sK12,X0) = sK5(sK12,X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_12]) ). 11.33/1.97 11.33/1.97 cnf(c_8157,plain, 11.33/1.97 ( sK3(sK12,X0) = sK5(sK12,X0) | sP0(sK12,X0) != iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_8156]) ). 11.33/1.97 11.33/1.97 cnf(c_8159,plain, 11.33/1.97 ( sK3(sK12,sK11) = sK5(sK12,sK11) | sP0(sK12,sK11) != iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_8157]) ). 11.33/1.97 11.33/1.97 cnf(c_24,negated_conjecture, 11.33/1.97 ( in(sK14(X0),sK12) | in(sK13(X0),X0) ), 11.33/1.97 inference(cnf_transformation,[],[f151]) ). 11.33/1.97 11.33/1.97 cnf(c_5405,plain, 11.33/1.97 ( in(sK14(X0),sK12) = iProver_top | in(sK13(X0),X0) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_24]) ). 11.33/1.97 11.33/1.97 cnf(c_25,negated_conjecture, 11.33/1.97 ( element(sK12,powerset(powerset(succ(sK11)))) ), 11.33/1.97 inference(cnf_transformation,[],[f150]) ). 11.33/1.97 11.33/1.97 cnf(c_5404,plain, 11.33/1.97 ( element(sK12,powerset(powerset(succ(sK11)))) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_25]) ). 11.33/1.97 11.33/1.97 cnf(c_5411,plain, 11.33/1.97 ( set_difference(sK10(X0,X1,X2),singleton(X0)) = X2 11.33/1.97 | in(X2,sK8(X0,X1)) != iProver_top 11.33/1.97 | sP0(X1,X0) = iProver_top 11.33/1.97 | element(X1,powerset(powerset(succ(X0)))) != iProver_top 11.33/1.97 | ordinal(X0) != iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_18]) ). 11.33/1.97 11.33/1.97 cnf(c_7879,plain, 11.33/1.97 ( set_difference(sK10(sK11,sK12,X0),singleton(sK11)) = X0 11.33/1.97 | in(X0,sK8(sK11,sK12)) != iProver_top 11.33/1.97 | sP0(sK12,sK11) = iProver_top 11.33/1.97 | ordinal(sK11) != iProver_top ), 11.33/1.97 inference(superposition,[status(thm)],[c_5404,c_5411]) ). 11.33/1.97 11.33/1.97 cnf(c_26,negated_conjecture, 11.33/1.97 ( ordinal(sK11) ), 11.33/1.97 inference(cnf_transformation,[],[f149]) ). 11.33/1.97 11.33/1.97 cnf(c_103,plain, 11.33/1.97 ( ordinal(sK11) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_26]) ). 11.33/1.97 11.33/1.97 cnf(c_8016,plain, 11.33/1.97 ( sP0(sK12,sK11) = iProver_top 11.33/1.97 | in(X0,sK8(sK11,sK12)) != iProver_top 11.33/1.97 | set_difference(sK10(sK11,sK12,X0),singleton(sK11)) = X0 ), 11.33/1.97 inference(global_propositional_subsumption, 11.33/1.97 [status(thm)], 11.33/1.97 [c_7879,c_103,c_104,c_7416]) ). 11.33/1.97 11.33/1.97 cnf(c_8017,plain, 11.33/1.97 ( set_difference(sK10(sK11,sK12,X0),singleton(sK11)) = X0 11.33/1.97 | in(X0,sK8(sK11,sK12)) != iProver_top 11.33/1.97 | sP0(sK12,sK11) = iProver_top ), 11.33/1.97 inference(renaming,[status(thm)],[c_8016]) ). 11.33/1.97 11.33/1.97 cnf(c_8027,plain, 11.33/1.97 ( set_difference(sK10(sK11,sK12,sK13(sK8(sK11,sK12))),singleton(sK11)) = sK13(sK8(sK11,sK12)) 11.33/1.97 | in(sK14(sK8(sK11,sK12)),sK12) = iProver_top 11.33/1.97 | sP0(sK12,sK11) = iProver_top ), 11.33/1.97 inference(superposition,[status(thm)],[c_5405,c_8017]) ). 11.33/1.97 11.33/1.97 cnf(c_22,negated_conjecture, 11.33/1.97 ( in(sK13(X0),X0) | in(sK13(X0),powerset(sK11)) ), 11.33/1.97 inference(cnf_transformation,[],[f153]) ). 11.33/1.97 11.33/1.97 cnf(c_5407,plain, 11.33/1.97 ( in(sK13(X0),X0) = iProver_top 11.33/1.97 | in(sK13(X0),powerset(sK11)) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_22]) ). 11.33/1.97 11.33/1.97 cnf(c_8026,plain, 11.33/1.97 ( set_difference(sK10(sK11,sK12,sK13(sK8(sK11,sK12))),singleton(sK11)) = sK13(sK8(sK11,sK12)) 11.33/1.97 | in(sK13(sK8(sK11,sK12)),powerset(sK11)) = iProver_top 11.33/1.97 | sP0(sK12,sK11) = iProver_top ), 11.33/1.97 inference(superposition,[status(thm)],[c_5407,c_8017]) ). 11.33/1.97 11.33/1.97 cnf(c_23,negated_conjecture, 11.33/1.97 ( in(sK13(X0),X0) 11.33/1.97 | set_difference(sK14(X0),singleton(sK11)) = sK13(X0) ), 11.33/1.97 inference(cnf_transformation,[],[f152]) ). 11.33/1.97 11.33/1.97 cnf(c_5406,plain, 11.33/1.97 ( set_difference(sK14(X0),singleton(sK11)) = sK13(X0) 11.33/1.97 | in(sK13(X0),X0) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_23]) ). 11.33/1.97 11.33/1.97 cnf(c_8025,plain, 11.33/1.97 ( set_difference(sK10(sK11,sK12,sK13(sK8(sK11,sK12))),singleton(sK11)) = sK13(sK8(sK11,sK12)) 11.33/1.97 | set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) = sK13(sK8(sK11,sK12)) 11.33/1.97 | sP0(sK12,sK11) = iProver_top ), 11.33/1.97 inference(superposition,[status(thm)],[c_5406,c_8017]) ). 11.33/1.97 11.33/1.97 cnf(c_16,plain, 11.33/1.97 ( ~ in(X0,sK8(X1,X2)) 11.33/1.97 | sP0(X2,X1) 11.33/1.97 | ~ element(X2,powerset(powerset(succ(X1)))) 11.33/1.97 | ~ ordinal(X1) 11.33/1.97 | sK9(X1,X2,X0) = X0 ), 11.33/1.97 inference(cnf_transformation,[],[f148]) ). 11.33/1.97 11.33/1.97 cnf(c_5413,plain, 11.33/1.97 ( sK9(X0,X1,X2) = X2 11.33/1.97 | in(X2,sK8(X0,X1)) != iProver_top 11.33/1.97 | sP0(X1,X0) = iProver_top 11.33/1.97 | element(X1,powerset(powerset(succ(X0)))) != iProver_top 11.33/1.97 | ordinal(X0) != iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_16]) ). 11.33/1.97 11.33/1.97 cnf(c_7726,plain, 11.33/1.97 ( sK9(sK11,sK12,X0) = X0 11.33/1.97 | in(X0,sK8(sK11,sK12)) != iProver_top 11.33/1.97 | sP0(sK12,sK11) = iProver_top 11.33/1.97 | ordinal(sK11) != iProver_top ), 11.33/1.97 inference(superposition,[status(thm)],[c_5404,c_5413]) ). 11.33/1.97 11.33/1.97 cnf(c_7746,plain, 11.33/1.97 ( sP0(sK12,sK11) = iProver_top 11.33/1.97 | in(X0,sK8(sK11,sK12)) != iProver_top 11.33/1.97 | sK9(sK11,sK12,X0) = X0 ), 11.33/1.97 inference(global_propositional_subsumption, 11.33/1.97 [status(thm)], 11.33/1.97 [c_7726,c_103]) ). 11.33/1.97 11.33/1.97 cnf(c_7747,plain, 11.33/1.97 ( sK9(sK11,sK12,X0) = X0 11.33/1.97 | in(X0,sK8(sK11,sK12)) != iProver_top 11.33/1.97 | sP0(sK12,sK11) = iProver_top ), 11.33/1.97 inference(renaming,[status(thm)],[c_7746]) ). 11.33/1.97 11.33/1.97 cnf(c_7755,plain, 11.33/1.97 ( sK9(sK11,sK12,sK13(sK8(sK11,sK12))) = sK13(sK8(sK11,sK12)) 11.33/1.97 | in(sK13(sK8(sK11,sK12)),powerset(sK11)) = iProver_top 11.33/1.97 | sP0(sK12,sK11) = iProver_top ), 11.33/1.97 inference(superposition,[status(thm)],[c_5407,c_7747]) ). 11.33/1.97 11.33/1.97 cnf(c_7754,plain, 11.33/1.97 ( sK9(sK11,sK12,sK13(sK8(sK11,sK12))) = sK13(sK8(sK11,sK12)) 11.33/1.97 | set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) = sK13(sK8(sK11,sK12)) 11.33/1.97 | sP0(sK12,sK11) = iProver_top ), 11.33/1.97 inference(superposition,[status(thm)],[c_5406,c_7747]) ). 11.33/1.97 11.33/1.97 cnf(c_6408,plain, 11.33/1.97 ( X0 != X1 | sK5(sK12,X2) != X1 | sK5(sK12,X2) = X0 ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4660]) ). 11.33/1.97 11.33/1.97 cnf(c_6785,plain, 11.33/1.97 ( X0 != sK5(sK12,X1) 11.33/1.97 | sK5(sK12,X1) = X0 11.33/1.97 | sK5(sK12,X1) != sK5(sK12,X1) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6408]) ). 11.33/1.97 11.33/1.97 cnf(c_7671,plain, 11.33/1.97 ( sK3(sK12,X0) != sK5(sK12,X0) 11.33/1.97 | sK5(sK12,X0) = sK3(sK12,X0) 11.33/1.97 | sK5(sK12,X0) != sK5(sK12,X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6785]) ). 11.33/1.97 11.33/1.97 cnf(c_7672,plain, 11.33/1.97 ( sK3(sK12,sK11) != sK5(sK12,sK11) 11.33/1.97 | sK5(sK12,sK11) = sK3(sK12,sK11) 11.33/1.97 | sK5(sK12,sK11) != sK5(sK12,sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_7671]) ). 11.33/1.97 11.33/1.97 cnf(c_6782,plain, 11.33/1.97 ( sK5(sK12,X0) = sK5(sK12,X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4659]) ). 11.33/1.97 11.33/1.97 cnf(c_6783,plain, 11.33/1.97 ( sK5(sK12,sK11) = sK5(sK12,sK11) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_6782]) ). 11.33/1.97 11.33/1.97 cnf(c_9,plain, 11.33/1.97 ( ~ sP0(X0,X1) | sK5(X0,X1) != sK4(X0,X1) ), 11.33/1.97 inference(cnf_transformation,[],[f143]) ). 11.33/1.97 11.33/1.97 cnf(c_5945,plain, 11.33/1.97 ( ~ sP0(sK12,X0) | sK5(sK12,X0) != sK4(sK12,X0) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_9]) ). 11.33/1.97 11.33/1.97 cnf(c_5946,plain, 11.33/1.97 ( sK5(sK12,X0) != sK4(sK12,X0) | sP0(sK12,X0) != iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_5945]) ). 11.33/1.97 11.33/1.97 cnf(c_5948,plain, 11.33/1.97 ( sK5(sK12,sK11) != sK4(sK12,sK11) 11.33/1.97 | sP0(sK12,sK11) != iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5946]) ). 11.33/1.97 11.33/1.97 cnf(c_5799,plain, 11.33/1.97 ( in(sK13(sK8(X0,sK12)),sK8(X0,sK12)) 11.33/1.97 | set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) = sK13(sK8(X0,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_23]) ). 11.33/1.97 11.33/1.97 cnf(c_5814,plain, 11.33/1.97 ( set_difference(sK14(sK8(X0,sK12)),singleton(sK11)) = sK13(sK8(X0,sK12)) 11.33/1.97 | in(sK13(sK8(X0,sK12)),sK8(X0,sK12)) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_5799]) ). 11.33/1.97 11.33/1.97 cnf(c_5816,plain, 11.33/1.97 ( set_difference(sK14(sK8(sK11,sK12)),singleton(sK11)) = sK13(sK8(sK11,sK12)) 11.33/1.97 | in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) = iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5814]) ). 11.33/1.97 11.33/1.97 cnf(c_5800,plain, 11.33/1.97 ( in(sK14(sK8(X0,sK12)),sK12) 11.33/1.97 | in(sK13(sK8(X0,sK12)),sK8(X0,sK12)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_24]) ). 11.33/1.97 11.33/1.97 cnf(c_5810,plain, 11.33/1.97 ( in(sK14(sK8(X0,sK12)),sK12) = iProver_top 11.33/1.97 | in(sK13(sK8(X0,sK12)),sK8(X0,sK12)) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_5800]) ). 11.33/1.97 11.33/1.97 cnf(c_5812,plain, 11.33/1.97 ( in(sK14(sK8(sK11,sK12)),sK12) = iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) = iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5810]) ). 11.33/1.97 11.33/1.97 cnf(c_5801,plain, 11.33/1.97 ( in(sK13(sK8(X0,sK12)),sK8(X0,sK12)) 11.33/1.97 | in(sK13(sK8(X0,sK12)),powerset(sK11)) ), 11.33/1.97 inference(instantiation,[status(thm)],[c_22]) ). 11.33/1.97 11.33/1.97 cnf(c_5806,plain, 11.33/1.97 ( in(sK13(sK8(X0,sK12)),sK8(X0,sK12)) = iProver_top 11.33/1.97 | in(sK13(sK8(X0,sK12)),powerset(sK11)) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_5801]) ). 11.33/1.97 11.33/1.97 cnf(c_5808,plain, 11.33/1.97 ( in(sK13(sK8(sK11,sK12)),sK8(sK11,sK12)) = iProver_top 11.33/1.97 | in(sK13(sK8(sK11,sK12)),powerset(sK11)) = iProver_top ), 11.33/1.97 inference(instantiation,[status(thm)],[c_5806]) ). 11.33/1.97 11.33/1.97 cnf(c_4678,plain, 11.33/1.97 ( sK11 = sK11 ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4659]) ). 11.33/1.97 11.33/1.97 cnf(c_4662,plain, 11.33/1.97 ( X0 != X1 | powerset(X0) = powerset(X1) ), 11.33/1.97 theory(equality) ). 11.33/1.97 11.33/1.97 cnf(c_4670,plain, 11.33/1.97 ( powerset(sK11) = powerset(sK11) | sK11 != sK11 ), 11.33/1.97 inference(instantiation,[status(thm)],[c_4662]) ). 11.33/1.97 11.33/1.97 cnf(c_104,plain, 11.33/1.97 ( element(sK12,powerset(powerset(succ(sK11)))) = iProver_top ), 11.33/1.97 inference(predicate_to_equality,[status(thm)],[c_25]) ). 11.33/1.97 11.33/1.97 cnf(contradiction,plain, 11.33/1.97 ( $false ), 11.33/1.97 inference(minisat, 11.33/1.97 [status(thm)], 11.33/1.97 [c_19441,c_16798,c_14491,c_13699,c_12898,c_12442,c_12381, 11.33/1.97 c_12309,c_12171,c_11407,c_11018,c_10057,c_9712,c_9673, 11.33/1.97 c_9474,c_8749,c_8715,c_8499,c_8444,c_8180,c_8159,c_8027, 11.33/1.97 c_8026,c_8025,c_7755,c_7754,c_7672,c_6783,c_5948,c_5816, 11.33/1.97 c_5812,c_5808,c_4678,c_4670,c_104,c_103]) ). 11.33/1.97 11.33/1.97 11.33/1.97 % SZS output end CNFRefutation for theBenchmark.p 11.33/1.97 11.33/1.97 ------ Statistics 11.33/1.97 11.33/1.97 ------ General 11.33/1.97 11.33/1.97 abstr_ref_over_cycles: 0 11.33/1.97 abstr_ref_under_cycles: 0 11.33/1.97 gc_basic_clause_elim: 0 11.33/1.97 forced_gc_time: 0 11.33/1.97 parsing_time: 0.014 11.33/1.97 unif_index_cands_time: 0. 11.33/1.97 unif_index_add_time: 0. 11.33/1.97 orderings_time: 0. 11.33/1.97 out_proof_time: 0.027 11.33/1.97 total_time: 1.093 11.33/1.97 num_of_symbols: 74 11.33/1.97 num_of_terms: 20108 11.33/1.97 11.33/1.97 ------ Preprocessing 11.33/1.97 11.33/1.97 num_of_splits: 0 11.33/1.97 num_of_split_atoms: 0 11.33/1.97 num_of_reused_defs: 0 11.33/1.97 num_eq_ax_congr_red: 78 11.33/1.97 num_of_sem_filtered_clauses: 27 11.33/1.97 num_of_subtypes: 1 11.33/1.97 monotx_restored_types: 0 11.33/1.97 sat_num_of_epr_types: 0 11.33/1.97 sat_num_of_non_cyclic_types: 0 11.33/1.97 sat_guarded_non_collapsed_types: 1 11.33/1.97 num_pure_diseq_elim: 0 11.33/1.97 simp_replaced_by: 0 11.33/1.97 res_preprocessed: 254 11.33/1.97 prep_upred: 0 11.33/1.97 prep_unflattend: 216 11.33/1.97 smt_new_axioms: 0 11.33/1.97 pred_elim_cands: 5 11.33/1.97 pred_elim: 2 11.33/1.97 pred_elim_cl: 19 11.33/1.97 pred_elim_cycles: 6 11.33/1.97 merged_defs: 0 11.33/1.97 merged_defs_ncl: 0 11.33/1.97 bin_hyper_res: 0 11.33/1.97 prep_cycles: 4 11.33/1.97 pred_elim_time: 0.072 11.33/1.97 splitting_time: 0. 11.33/1.97 sem_filter_time: 0. 11.33/1.97 monotx_time: 0. 11.33/1.97 subtype_inf_time: 0. 11.33/1.97 11.33/1.97 ------ Problem properties 11.33/1.97 11.33/1.97 clauses: 47 11.33/1.97 conjectures: 6 11.33/1.97 epr: 17 11.33/1.97 horn: 37 11.33/1.97 ground: 15 11.33/1.97 unary: 23 11.33/1.97 binary: 17 11.33/1.97 lits: 90 11.33/1.97 lits_eq: 9 11.33/1.97 fd_pure: 0 11.33/1.97 fd_pseudo: 0 11.33/1.97 fd_cond: 0 11.33/1.97 fd_pseudo_cond: 0 11.33/1.97 ac_symbols: 0 11.33/1.97 11.33/1.97 ------ Propositional Solver 11.33/1.97 11.33/1.97 prop_solver_calls: 37 11.33/1.97 prop_fast_solver_calls: 3228 11.33/1.97 smt_solver_calls: 0 11.33/1.97 smt_fast_solver_calls: 0 11.33/1.97 prop_num_of_clauses: 7398 11.33/1.97 prop_preprocess_simplified: 17767 11.33/1.97 prop_fo_subsumed: 169 11.33/1.97 prop_solver_time: 0. 11.33/1.97 smt_solver_time: 0. 11.33/1.97 smt_fast_solver_time: 0. 11.33/1.97 prop_fast_solver_time: 0. 11.33/1.97 prop_unsat_core_time: 0.002 11.33/1.97 11.33/1.97 ------ QBF 11.33/1.97 11.33/1.97 qbf_q_res: 0 11.33/1.97 qbf_num_tautologies: 0 11.33/1.97 qbf_prep_cycles: 0 11.33/1.97 11.33/1.97 ------ BMC1 11.33/1.97 11.33/1.97 bmc1_current_bound: -1 11.33/1.97 bmc1_last_solved_bound: -1 11.33/1.97 bmc1_unsat_core_size: -1 11.33/1.97 bmc1_unsat_core_parents_size: -1 11.33/1.97 bmc1_merge_next_fun: 0 11.33/1.97 bmc1_unsat_core_clauses_time: 0. 11.33/1.97 11.33/1.97 ------ Instantiation 11.33/1.97 11.33/1.97 inst_num_of_clauses: 2070 11.33/1.97 inst_num_in_passive: 533 11.33/1.97 inst_num_in_active: 1332 11.33/1.97 inst_num_in_unprocessed: 204 11.33/1.97 inst_num_of_loops: 1570 11.33/1.97 inst_num_of_learning_restarts: 0 11.33/1.97 inst_num_moves_active_passive: 228 11.33/1.97 inst_lit_activity: 0 11.33/1.97 inst_lit_activity_moves: 0 11.33/1.97 inst_num_tautologies: 0 11.33/1.97 inst_num_prop_implied: 0 11.33/1.97 inst_num_existing_simplified: 0 11.33/1.97 inst_num_eq_res_simplified: 0 11.33/1.97 inst_num_child_elim: 0 11.33/1.97 inst_num_of_dismatching_blockings: 3110 11.33/1.97 inst_num_of_non_proper_insts: 4668 11.33/1.97 inst_num_of_duplicates: 0 11.33/1.97 inst_inst_num_from_inst_to_res: 0 11.33/1.97 inst_dismatching_checking_time: 0. 11.33/1.97 11.33/1.97 ------ Resolution 11.33/1.97 11.33/1.97 res_num_of_clauses: 0 11.33/1.97 res_num_in_passive: 0 11.33/1.97 res_num_in_active: 0 11.33/1.97 res_num_of_loops: 258 11.33/1.97 res_forward_subset_subsumed: 194 11.33/1.97 res_backward_subset_subsumed: 0 11.33/1.97 res_forward_subsumed: 1 11.33/1.97 res_backward_subsumed: 0 11.33/1.97 res_forward_subsumption_resolution: 0 11.33/1.97 res_backward_subsumption_resolution: 0 11.33/1.97 res_clause_to_clause_subsumption: 1860 11.33/1.97 res_orphan_elimination: 0 11.33/1.97 res_tautology_del: 672 11.33/1.97 res_num_eq_res_simplified: 0 11.33/1.97 res_num_sel_changes: 0 11.33/1.97 res_moves_from_active_to_pass: 0 11.33/1.97 11.33/1.97 ------ Superposition 11.33/1.97 11.33/1.97 sup_time_total: 0. 11.33/1.97 sup_time_generating: 0. 11.33/1.97 sup_time_sim_full: 0. 11.33/1.97 sup_time_sim_immed: 0. 11.33/1.97 11.33/1.97 sup_num_of_clauses: 571 11.33/1.97 sup_num_in_active: 276 11.33/1.97 sup_num_in_passive: 295 11.33/1.97 sup_num_of_loops: 312 11.33/1.97 sup_fw_superposition: 325 11.33/1.97 sup_bw_superposition: 295 11.33/1.97 sup_immediate_simplified: 49 11.33/1.97 sup_given_eliminated: 0 11.33/1.97 comparisons_done: 0 11.33/1.97 comparisons_avoided: 453 11.33/1.97 11.33/1.97 ------ Simplifications 11.33/1.97 11.33/1.97 11.33/1.97 sim_fw_subset_subsumed: 22 11.33/1.97 sim_bw_subset_subsumed: 50 11.33/1.97 sim_fw_subsumed: 11 11.33/1.97 sim_bw_subsumed: 16 11.33/1.97 sim_fw_subsumption_res: 0 11.33/1.97 sim_bw_subsumption_res: 0 11.33/1.97 sim_tautology_del: 8 11.33/1.97 sim_eq_tautology_del: 0 11.33/1.97 sim_eq_res_simp: 1 11.33/1.97 sim_fw_demodulated: 0 11.33/1.97 sim_bw_demodulated: 0 11.33/1.97 sim_light_normalised: 0 11.33/1.97 sim_joinable_taut: 0 11.33/1.97 sim_joinable_simp: 0 11.33/1.97 sim_ac_normalised: 0 11.33/1.97 sim_smt_subsumption: 0 11.33/1.97 11.33/1.98 EOF