0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.14 % Command : python3 prover_driver.py --schedule_mode external --schedule tfa_schedule --no_cores 8 --problem_version tff /export/starexec/sandbox/benchmark/theBenchmark.p 120 --prover /export/starexec/sandbox/solver/bin/res/iproveropt_z3 0.14/0.35 % Computer : n003.cluster.edu 0.14/0.35 % Model : x86_64 x86_64 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.35 % Memory : 8042.1875MB 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.35 % CPULimit : 960 0.14/0.35 % WCLimit : 120 0.14/0.35 % DateTime : Tue Aug 9 03:04:36 EDT 2022 0.14/0.35 % CPUTime : 243.25/31.63 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p 243.25/31.63 243.25/31.63 %---------------- iProver v3.6 (pre CASC-J11 2022) ----------------% 243.25/31.63 243.25/31.63 ------ iProver source info 243.25/31.63 243.25/31.63 git: date: 2022-07-26 19:47:37 +0300 243.25/31.63 git: sha1: 69e283425f6c8ae3fb9e67f2058d741e849b12e1 243.25/31.63 git: non_committed_changes: false 243.25/31.63 git: last_make_outside_of_git: false 243.25/31.63 243.25/31.63 ------ Parsing... 243.25/31.63 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim 243.25/31.63 243.25/31.63 243.25/31.63 ------ Preprocessing... sup_sim: 1 pe_s pe_e sup_sim: 0 pe_s pe_e 243.25/31.63 243.25/31.63 ------ Preprocessing...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim 243.25/31.63 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e ------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim 243.25/31.63 243.25/31.63 243.25/31.63 ------ Preprocessing... 243.25/31.63 ------ Proving... 243.25/31.63 ------ Problem Properties 243.25/31.63 243.25/31.63 243.25/31.63 clauses 39 243.25/31.63 conjectures 3 243.25/31.63 EPR 6 243.25/31.63 Horn 33 243.25/31.63 unary 14 243.25/31.63 binary 20 243.25/31.63 lits 69 243.25/31.63 lits eq 28 243.25/31.63 fd_pure 0 243.25/31.63 fd_pseudo 0 243.25/31.63 fd_cond 2 243.25/31.63 fd_pseudo_cond 2 243.25/31.63 AC symbols 1 243.25/31.63 243.25/31.63 ------ Schedule dynamic 5 is on 243.25/31.63 243.25/31.63 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 243.25/31.63 243.25/31.63 243.25/31.63 ------ 243.25/31.63 Current options: 243.25/31.63 ------ 243.25/31.63 243.25/31.63 ------ Input Options 243.25/31.63 243.25/31.63 --out_options all 243.25/31.63 --tptp_safe_out true 243.25/31.63 --problem_path "" 243.25/31.63 --include_path "" 243.25/31.63 --clausifier res/vclausify_rel 243.25/31.63 --clausifier_options --mode tclausify -t 124.99153852462769 --show_fool true 243.25/31.63 --stdin false 243.25/31.63 --suppress_sat_res false 243.25/31.63 --suppress_unsat_res false 243.25/31.63 --stats_out none 243.25/31.63 --stats_mem false 243.25/31.63 --theory_stats_out false 243.25/31.63 243.25/31.63 ------ General Options 243.25/31.63 243.25/31.63 --fof false 243.25/31.63 --time_out_real 124.99 243.25/31.63 --time_out_virtual -1. 243.25/31.63 --rnd_seed 13 243.25/31.63 --symbol_type_check false 243.25/31.63 --clausify_out false 243.25/31.63 --sig_cnt_out false 243.25/31.63 --trig_cnt_out false 243.25/31.63 --trig_cnt_out_tolerance 1. 243.25/31.63 --trig_cnt_out_sk_spl false 243.25/31.63 --abstr_cl_out false 243.25/31.63 243.25/31.63 ------ Global Options 243.25/31.63 243.25/31.63 --schedule default 243.25/31.63 --add_important_lit false 243.25/31.63 --prop_solver_per_cl 500 243.25/31.63 --subs_bck_mult 8 243.25/31.63 --min_unsat_core false 243.25/31.64 --soft_assumptions false 243.25/31.64 --soft_lemma_size 3 243.25/31.64 --prop_impl_unit_size 0 243.25/31.64 --prop_impl_unit [] 243.25/31.64 --share_sel_clauses true 243.25/31.64 --reset_solvers false 243.25/31.64 --bc_imp_inh [conj_cone] 243.25/31.64 --conj_cone_tolerance 3. 243.25/31.64 --extra_neg_conj none 243.25/31.64 --large_theory_mode true 243.25/31.64 --prolific_symb_bound 200 243.25/31.64 --lt_threshold 2000 243.25/31.64 --clause_weak_htbl true 243.25/31.64 --gc_record_bc_elim false 243.25/31.64 243.25/31.64 ------ Preprocessing Options 243.25/31.64 243.25/31.64 --preprocessing_flag true 243.25/31.64 --time_out_prep_mult 0.1 243.25/31.64 --splitting_mode input 243.25/31.64 --splitting_grd true 243.25/31.64 --splitting_cvd false 243.25/31.64 --splitting_cvd_svl false 243.25/31.64 --splitting_nvd 32 243.25/31.64 --sub_typing false 243.25/31.64 --prep_gs_sim true 243.25/31.64 --prep_unflatten true 243.25/31.64 --prep_res_sim true 243.25/31.64 --prep_sup_sim_all true 243.25/31.64 --prep_sup_sim_sup false 243.25/31.64 --prep_upred true 243.25/31.64 --prep_well_definedness true 243.25/31.64 --prep_sem_filter exhaustive 243.25/31.64 --prep_sem_filter_out false 243.25/31.64 --pred_elim true 243.25/31.64 --res_sim_input true 243.25/31.64 --eq_ax_congr_red true 243.25/31.64 --pure_diseq_elim true 243.25/31.64 --brand_transform false 243.25/31.64 --non_eq_to_eq false 243.25/31.64 --prep_def_merge true 243.25/31.64 --prep_def_merge_prop_impl false 243.25/31.64 --prep_def_merge_mbd true 243.25/31.64 --prep_def_merge_tr_red false 243.25/31.64 --prep_def_merge_tr_cl false 243.25/31.64 --smt_preprocessing false 243.25/31.64 --smt_ac_axioms fast 243.25/31.64 --preprocessed_out false 243.25/31.64 --preprocessed_stats false 243.25/31.64 243.25/31.64 ------ Abstraction refinement Options 243.25/31.64 243.25/31.64 --abstr_ref [] 243.25/31.64 --abstr_ref_prep false 243.25/31.64 --abstr_ref_until_sat false 243.25/31.64 --abstr_ref_sig_restrict funpre 243.25/31.64 --abstr_ref_af_restrict_to_split_sk false 243.25/31.64 --abstr_ref_under [] 243.25/31.64 243.25/31.64 ------ SAT Options 243.25/31.64 243.25/31.64 --sat_mode false 243.25/31.64 --sat_fm_restart_options "" 243.25/31.64 --sat_gr_def false 243.25/31.64 --sat_epr_types true 243.25/31.64 --sat_non_cyclic_types false 243.25/31.64 --sat_finite_models false 243.25/31.64 --sat_fm_lemmas false 243.25/31.64 --sat_fm_prep false 243.25/31.64 --sat_fm_uc_incr true 243.25/31.64 --sat_out_model small 243.25/31.64 --sat_out_clauses false 243.25/31.64 243.25/31.64 ------ QBF Options 243.25/31.64 243.25/31.64 --qbf_mode false 243.25/31.64 --qbf_elim_univ false 243.25/31.64 --qbf_dom_inst none 243.25/31.64 --qbf_dom_pre_inst false 243.25/31.64 --qbf_sk_in false 243.25/31.64 --qbf_pred_elim true 243.25/31.64 --qbf_split 512 243.25/31.64 243.25/31.64 ------ BMC1 Options 243.25/31.64 243.25/31.64 --bmc1_incremental false 243.25/31.64 --bmc1_axioms reachable_all 243.25/31.64 --bmc1_min_bound 0 243.25/31.64 --bmc1_max_bound -1 243.25/31.64 --bmc1_max_bound_default -1 243.25/31.64 --bmc1_symbol_reachability true 243.25/31.64 --bmc1_property_lemmas false 243.25/31.64 --bmc1_k_induction false 243.25/31.64 --bmc1_non_equiv_states false 243.25/31.64 --bmc1_deadlock false 243.25/31.64 --bmc1_ucm false 243.25/31.64 --bmc1_add_unsat_core none 243.25/31.64 --bmc1_unsat_core_children false 243.25/31.64 --bmc1_unsat_core_extrapolate_axioms false 243.25/31.64 --bmc1_out_stat full 243.25/31.64 --bmc1_ground_init false 243.25/31.64 --bmc1_pre_inst_next_state false 243.25/31.64 --bmc1_pre_inst_state false 243.25/31.64 --bmc1_pre_inst_reach_state false 243.25/31.64 --bmc1_out_unsat_core false 243.25/31.64 --bmc1_aig_witness_out false 243.25/31.64 --bmc1_verbose false 243.25/31.64 --bmc1_dump_clauses_tptp false 243.25/31.64 --bmc1_dump_unsat_core_tptp false 243.25/31.64 --bmc1_dump_file - 243.25/31.64 --bmc1_ucm_expand_uc_limit 128 243.25/31.64 --bmc1_ucm_n_expand_iterations 6 243.25/31.64 --bmc1_ucm_extend_mode 1 243.25/31.64 --bmc1_ucm_init_mode 2 243.25/31.64 --bmc1_ucm_cone_mode none 243.25/31.64 --bmc1_ucm_reduced_relation_type 0 243.25/31.64 --bmc1_ucm_relax_model 4 243.25/31.64 --bmc1_ucm_full_tr_after_sat true 243.25/31.64 --bmc1_ucm_expand_neg_assumptions false 243.25/31.64 --bmc1_ucm_layered_model none 243.25/31.64 --bmc1_ucm_max_lemma_size 10 243.25/31.64 243.25/31.64 ------ AIG Options 243.25/31.64 243.25/31.64 --aig_mode false 243.25/31.64 243.25/31.64 ------ Instantiation Options 243.25/31.64 243.25/31.64 --instantiation_flag true 243.25/31.64 --inst_sos_flag false 243.25/31.64 --inst_sos_phase true 243.25/31.64 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 243.25/31.64 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 243.25/31.64 --inst_lit_sel_side none 243.25/31.64 --inst_solver_per_active 1400 243.25/31.64 --inst_solver_calls_frac 1. 243.25/31.64 --inst_passive_queue_type priority_queues 243.25/31.64 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 243.25/31.64 --inst_passive_queues_freq [25;2] 243.25/31.64 --inst_dismatching true 243.25/31.64 --inst_eager_unprocessed_to_passive true 243.25/31.64 --inst_prop_sim_given true 243.25/31.64 --inst_prop_sim_new false 243.25/31.64 --inst_subs_new false 243.25/31.64 --inst_eq_res_simp false 243.25/31.64 --inst_subs_given false 243.25/31.64 --inst_orphan_elimination true 243.25/31.64 --inst_learning_loop_flag true 243.25/31.64 --inst_learning_start 3000 243.25/31.64 --inst_learning_factor 2 243.25/31.64 --inst_start_prop_sim_after_learn 3 243.25/31.64 --inst_sel_renew solver 243.25/31.64 --inst_lit_activity_flag true 243.25/31.64 --inst_restr_to_given false 243.25/31.64 --inst_activity_threshold 500 243.25/31.64 --inst_out_proof true 243.25/31.64 243.25/31.64 ------ Resolution Options 243.25/31.64 243.25/31.64 --resolution_flag false 243.25/31.64 --res_lit_sel adaptive 243.25/31.64 --res_lit_sel_side none 243.25/31.64 --res_ordering kbo 243.25/31.64 --res_to_prop_solver active 243.25/31.64 --res_prop_simpl_new false 243.25/31.64 --res_prop_simpl_given true 243.25/31.64 --res_passive_queue_type priority_queues 243.25/31.64 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 243.25/31.64 --res_passive_queues_freq [15;5] 243.25/31.64 --res_forward_subs full 243.25/31.64 --res_backward_subs full 243.25/31.64 --res_forward_subs_resolution true 243.25/31.64 --res_backward_subs_resolution true 243.25/31.64 --res_orphan_elimination true 243.25/31.64 --res_time_limit 300. 243.25/31.64 --res_out_proof true 243.25/31.64 243.25/31.64 ------ Superposition Options 243.25/31.64 243.25/31.64 --superposition_flag true 243.25/31.64 --sup_passive_queue_type priority_queues 243.25/31.64 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]] 243.25/31.64 --sup_passive_queues_freq [8;1;4;4] 243.25/31.64 --demod_completeness_check fast 243.25/31.64 --demod_use_ground true 243.25/31.64 --sup_to_prop_solver passive 243.25/31.64 --sup_prop_simpl_new true 243.25/31.64 --sup_prop_simpl_given true 243.25/31.64 --sup_fun_splitting false 243.25/31.64 --sup_iter_deepening 2 243.25/31.64 --sup_restarts_mult 12 243.25/31.64 --sup_score sim_d_gen 243.25/31.64 --sup_share_score_frac 0.2 243.25/31.64 --sup_share_max_num_cl 500 243.25/31.64 --sup_ordering kbo 243.25/31.64 --sup_symb_ordering invfreq 243.25/31.64 --sup_term_weight default 243.25/31.64 243.25/31.64 ------ Superposition Simplification Setup 243.25/31.64 243.25/31.64 --sup_indices_passive [LightNormIndex;FwDemodIndex] 243.25/31.64 --sup_full_triv [SMTSimplify;PropSubs] 243.25/31.64 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability] 243.25/31.64 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 243.25/31.64 --sup_immed_triv [] 243.25/31.64 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes] 243.25/31.64 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes] 243.25/31.64 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod] 243.25/31.64 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 243.25/31.64 --sup_input_triv [Unflattening;SMTSimplify] 243.25/31.64 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability] 243.25/31.64 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 243.25/31.64 --sup_full_fixpoint true 243.25/31.64 --sup_main_fixpoint true 243.25/31.64 --sup_immed_fixpoint false 243.25/31.64 --sup_input_fixpoint true 243.25/31.64 --sup_cache_sim none 243.25/31.64 --sup_smt_interval 500 243.25/31.64 --sup_bw_gjoin_interval 0 243.25/31.64 243.25/31.64 ------ Combination Options 243.25/31.64 243.25/31.64 --comb_mode clause_based 243.25/31.64 --comb_inst_mult 5 243.25/31.64 --comb_res_mult 1 243.25/31.64 --comb_sup_mult 8 243.25/31.64 --comb_sup_deep_mult 2 243.25/31.64 243.25/31.64 ------ Debug Options 243.25/31.64 243.25/31.64 --dbg_backtrace false 243.25/31.64 --dbg_dump_prop_clauses false 243.25/31.64 --dbg_dump_prop_clauses_file - 243.25/31.64 --dbg_out_stat false 243.25/31.64 --dbg_just_parse false 243.25/31.64 243.25/31.64 243.25/31.64 243.25/31.64 243.25/31.64 ------ Proving... 243.25/31.64 Proof_search_loop: time out after: 23286 full_loop iterations 243.25/31.64 243.25/31.64 ------ Input Options"--res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15. 243.25/31.64 243.25/31.64 243.25/31.64 ------ 243.25/31.64 Current options: 243.25/31.64 ------ 243.25/31.64 243.25/31.64 ------ Input Options 243.25/31.64 243.25/31.64 --out_options all 243.25/31.64 --tptp_safe_out true 243.25/31.64 --problem_path "" 243.25/31.64 --include_path "" 243.25/31.64 --clausifier res/vclausify_rel 243.25/31.64 --clausifier_options --mode tclausify -t 124.99153852462769 --show_fool true 243.25/31.64 --stdin false 243.25/31.64 --suppress_sat_res false 243.25/31.64 --suppress_unsat_res false 243.25/31.64 --stats_out none 243.25/31.64 --stats_mem false 243.25/31.64 --theory_stats_out false 243.25/31.64 243.25/31.64 ------ General Options 243.25/31.64 243.25/31.64 --fof false 243.25/31.64 --time_out_real 124.99 243.25/31.64 --time_out_virtual -1. 243.25/31.64 --rnd_seed 13 243.25/31.64 --symbol_type_check false 243.25/31.64 --clausify_out false 243.25/31.64 --sig_cnt_out false 243.25/31.64 --trig_cnt_out false 243.25/31.64 --trig_cnt_out_tolerance 1. 243.25/31.64 --trig_cnt_out_sk_spl false 243.25/31.64 --abstr_cl_out false 243.25/31.64 243.25/31.64 ------ Global Options 243.25/31.64 243.25/31.64 --schedule default 243.25/31.64 --add_important_lit false 243.25/31.64 --prop_solver_per_cl 500 243.25/31.64 --subs_bck_mult 8 243.25/31.64 --min_unsat_core false 243.25/31.64 --soft_assumptions false 243.25/31.64 --soft_lemma_size 3 243.25/31.64 --prop_impl_unit_size 0 243.25/31.64 --prop_impl_unit [] 243.25/31.64 --share_sel_clauses true 243.25/31.64 --reset_solvers false 243.25/31.64 --bc_imp_inh [conj_cone] 243.25/31.64 --conj_cone_tolerance 3. 243.25/31.64 --extra_neg_conj none 243.25/31.64 --large_theory_mode true 243.25/31.64 --prolific_symb_bound 200 243.25/31.64 --lt_threshold 2000 243.25/31.64 --clause_weak_htbl true 243.25/31.64 --gc_record_bc_elim false 243.25/31.64 243.25/31.64 ------ Preprocessing Options 243.25/31.64 243.25/31.64 --preprocessing_flag true 243.25/31.64 --time_out_prep_mult 0.1 243.25/31.64 --splitting_mode input 243.25/31.64 --splitting_grd true 243.25/31.64 --splitting_cvd false 243.25/31.64 --splitting_cvd_svl false 243.25/31.64 --splitting_nvd 32 243.25/31.64 --sub_typing false 243.25/31.64 --prep_gs_sim true 243.25/31.64 --prep_unflatten true 243.25/31.64 --prep_res_sim true 243.25/31.64 --prep_sup_sim_all true 243.25/31.64 --prep_sup_sim_sup false 243.25/31.64 --prep_upred true 243.25/31.64 --prep_well_definedness true 243.25/31.64 --prep_sem_filter exhaustive 243.25/31.64 --prep_sem_filter_out false 243.25/31.64 --pred_elim true 243.25/31.64 --res_sim_input true 243.25/31.64 --eq_ax_congr_red true 243.25/31.64 --pure_diseq_elim true 243.25/31.64 --brand_transform false 243.25/31.64 --non_eq_to_eq false 243.25/31.64 --prep_def_merge true 243.25/31.64 --prep_def_merge_prop_impl false 243.25/31.64 --prep_def_merge_mbd true 243.25/31.64 --prep_def_merge_tr_red false 243.25/31.64 --prep_def_merge_tr_cl false 243.25/31.64 --smt_preprocessing false 243.25/31.64 --smt_ac_axioms fast 243.25/31.64 --preprocessed_out false 243.25/31.64 --preprocessed_stats false 243.25/31.64 243.25/31.64 ------ Abstraction refinement Options 243.25/31.64 243.25/31.64 --abstr_ref [] 243.25/31.64 --abstr_ref_prep false 243.25/31.64 --abstr_ref_until_sat false 243.25/31.64 --abstr_ref_sig_restrict funpre 243.25/31.64 --abstr_ref_af_restrict_to_split_sk false 243.25/31.64 --abstr_ref_under [] 243.25/31.64 243.25/31.64 ------ SAT Options 243.25/31.64 243.25/31.64 --sat_mode false 243.25/31.64 --sat_fm_restart_options "" 243.25/31.64 --sat_gr_def false 243.25/31.64 --sat_epr_types true 243.25/31.64 --sat_non_cyclic_types false 243.25/31.64 --sat_finite_models false 243.25/31.64 --sat_fm_lemmas false 243.25/31.64 --sat_fm_prep false 243.25/31.64 --sat_fm_uc_incr true 243.25/31.64 --sat_out_model small 243.25/31.64 --sat_out_clauses false 243.25/31.64 243.25/31.64 ------ QBF Options 243.25/31.64 243.25/31.64 --qbf_mode false 243.25/31.64 --qbf_elim_univ false 243.25/31.64 --qbf_dom_inst none 243.25/31.64 --qbf_dom_pre_inst false 243.25/31.64 --qbf_sk_in false 243.25/31.64 --qbf_pred_elim true 243.25/31.64 --qbf_split 512 243.25/31.64 243.25/31.64 ------ BMC1 Options 243.25/31.64 243.25/31.64 --bmc1_incremental false 243.25/31.64 --bmc1_axioms reachable_all 243.25/31.64 --bmc1_min_bound 0 243.25/31.64 --bmc1_max_bound -1 243.25/31.64 --bmc1_max_bound_default -1 243.25/31.64 --bmc1_symbol_reachability true 243.25/31.64 --bmc1_property_lemmas false 243.25/31.64 --bmc1_k_induction false 243.25/31.64 --bmc1_non_equiv_states false 243.25/31.64 --bmc1_deadlock false 243.25/31.64 --bmc1_ucm false 243.25/31.64 --bmc1_add_unsat_core none 243.25/31.64 --bmc1_unsat_core_children false 243.25/31.64 --bmc1_unsat_core_extrapolate_axioms false 243.25/31.64 --bmc1_out_stat full 243.25/31.64 --bmc1_ground_init false 243.25/31.64 --bmc1_pre_inst_next_state false 243.25/31.64 --bmc1_pre_inst_state false 243.25/31.64 --bmc1_pre_inst_reach_state false 243.25/31.64 --bmc1_out_unsat_core false 243.25/31.64 --bmc1_aig_witness_out false 243.25/31.64 --bmc1_verbose false 243.25/31.64 --bmc1_dump_clauses_tptp false 243.25/31.64 --bmc1_dump_unsat_core_tptp false 243.25/31.64 --bmc1_dump_file - 243.25/31.64 --bmc1_ucm_expand_uc_limit 128 243.25/31.64 --bmc1_ucm_n_expand_iterations 6 243.25/31.64 --bmc1_ucm_extend_mode 1 243.25/31.64 --bmc1_ucm_init_mode 2 243.25/31.64 --bmc1_ucm_cone_mode none 243.25/31.64 --bmc1_ucm_reduced_relation_type 0 243.25/31.64 --bmc1_ucm_relax_model 4 243.25/31.64 --bmc1_ucm_full_tr_after_sat true 243.25/31.64 --bmc1_ucm_expand_neg_assumptions false 243.25/31.64 --bmc1_ucm_layered_model none 243.25/31.64 --bmc1_ucm_max_lemma_size 10 243.25/31.64 243.25/31.64 ------ AIG Options 243.25/31.64 243.25/31.64 --aig_mode false 243.25/31.64 243.25/31.64 ------ Instantiation Options 243.25/31.64 243.25/31.64 --instantiation_flag true 243.25/31.64 --inst_sos_flag false 243.25/31.64 --inst_sos_phase true 243.25/31.64 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 243.25/31.64 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 243.25/31.64 --inst_lit_sel_side num_symb 243.25/31.64 --inst_solver_per_active 1400 243.25/31.64 --inst_solver_calls_frac 1. 243.25/31.64 --inst_passive_queue_type priority_queues 243.25/31.64 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 243.25/31.64 --inst_passive_queues_freq [25;2] 243.25/31.64 --inst_dismatching true 243.25/31.64 --inst_eager_unprocessed_to_passive true 243.25/31.64 --inst_prop_sim_given true 243.25/31.64 --inst_prop_sim_new false 243.25/31.64 --inst_subs_new false 243.25/31.64 --inst_eq_res_simp false 243.25/31.64 --inst_subs_given false 243.25/31.64 --inst_orphan_elimination true 243.25/31.64 --inst_learning_loop_flag true 243.25/31.64 --inst_learning_start 3000 243.25/31.64 --inst_learning_factor 2 243.25/31.64 --inst_start_prop_sim_after_learn 3 243.25/31.64 --inst_sel_renew solver 243.25/31.64 --inst_lit_activity_flag true 243.25/31.64 --inst_restr_to_given false 243.25/31.64 --inst_activity_threshold 500 243.25/31.64 --inst_out_proof true 243.25/31.64 243.25/31.64 ------ Resolution Options 243.25/31.64 243.25/31.64 --resolution_flag true 243.25/31.64 --res_lit_sel adaptive_max 243.25/31.64 --res_lit_sel_side num_symb 243.25/31.64 --res_ordering kbo 243.25/31.64 --res_to_prop_solver active 243.25/31.64 --res_prop_simpl_new false 243.25/31.64 --res_prop_simpl_given true 243.25/31.64 --res_passive_queue_type priority_queues 243.25/31.64 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 243.25/31.64 --res_passive_queues_freq [15;5] 243.25/31.64 --res_forward_subs full 243.25/31.64 --res_backward_subs full 243.25/31.64 --res_forward_subs_resolution true 243.25/31.64 --res_backward_subs_resolution true 243.25/31.64 --res_orphan_elimination true 243.25/31.64 --res_time_limit 300. 243.25/31.64 --res_out_proof true 243.25/31.64 243.25/31.64 ------ Superposition Options 243.25/31.64 243.25/31.64 --superposition_flag true 243.25/31.64 --sup_passive_queue_type priority_queues 243.25/31.64 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]] 243.25/31.64 --sup_passive_queues_freq [8;1;4;4] 243.25/31.64 --demod_completeness_check fast 243.25/31.64 --demod_use_ground true 243.25/31.64 --sup_to_prop_solver passive 243.25/31.64 --sup_prop_simpl_new true 243.25/31.64 --sup_prop_simpl_given true 243.25/31.64 --sup_fun_splitting false 243.25/31.64 --sup_iter_deepening 2 243.25/31.64 --sup_restarts_mult 12 243.25/31.64 --sup_score sim_d_gen 243.25/31.64 --sup_share_score_frac 0.2 243.25/31.64 --sup_share_max_num_cl 500 243.25/31.64 --sup_ordering kbo 243.25/31.64 --sup_symb_ordering invfreq 243.25/31.64 --sup_term_weight default 243.25/31.64 243.25/31.64 ------ Superposition Simplification Setup 243.25/31.64 243.25/31.64 --sup_indices_passive [LightNormIndex;FwDemodIndex] 243.25/31.64 --sup_full_triv [SMTSimplify;PropSubs] 243.25/31.64 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability] 243.25/31.64 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 243.25/31.64 --sup_immed_triv [] 243.25/31.64 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes] 243.25/31.64 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes] 243.25/31.64 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod] 243.25/31.64 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 243.25/31.64 --sup_input_triv [Unflattening;SMTSimplify] 243.25/31.64 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability] 243.25/31.64 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 243.25/31.64 --sup_full_fixpoint true 243.25/31.64 --sup_main_fixpoint true 243.25/31.64 --sup_immed_fixpoint false 243.25/31.64 --sup_input_fixpoint true 243.25/31.64 --sup_cache_sim none 243.25/31.64 --sup_smt_interval 500 243.25/31.64 --sup_bw_gjoin_interval 0 243.25/31.64 243.25/31.64 ------ Combination Options 243.25/31.64 243.25/31.64 --comb_mode clause_based 243.25/31.64 --comb_inst_mult 5 243.25/31.64 --comb_res_mult 1 243.25/31.64 --comb_sup_mult 8 243.25/31.64 --comb_sup_deep_mult 2 243.25/31.64 243.25/31.64 ------ Debug Options 243.25/31.64 243.25/31.64 --dbg_backtrace false 243.25/31.64 --dbg_dump_prop_clauses false 243.25/31.64 --dbg_dump_prop_clauses_file - 243.25/31.64 --dbg_out_stat false 243.25/31.64 --dbg_just_parse false 243.25/31.64 243.25/31.64 243.25/31.64 243.25/31.64 243.25/31.64 ------ Proving... 243.25/31.64 Proof_search_loop: time out after: 18960 full_loop iterations 243.25/31.64 243.25/31.64 ------ Option_1: Negative Selections Time Limit: 35. 243.25/31.64 243.25/31.64 243.25/31.64 ------ 243.25/31.64 Current options: 243.25/31.64 ------ 243.25/31.64 243.25/31.64 ------ Input Options 243.25/31.64 243.25/31.64 --out_options all 243.25/31.64 --tptp_safe_out true 243.25/31.64 --problem_path "" 243.25/31.64 --include_path "" 243.25/31.64 --clausifier res/vclausify_rel 243.25/31.64 --clausifier_options --mode tclausify -t 124.99153852462769 --show_fool true 243.25/31.64 --stdin false 243.25/31.64 --suppress_sat_res false 243.25/31.64 --suppress_unsat_res false 243.25/31.64 --stats_out none 243.25/31.64 --stats_mem false 243.25/31.64 --theory_stats_out false 243.25/31.64 243.25/31.64 ------ General Options 243.25/31.64 243.25/31.64 --fof false 243.25/31.64 --time_out_real 124.99 243.25/31.64 --time_out_virtual -1. 243.25/31.64 --rnd_seed 13 243.25/31.64 --symbol_type_check false 243.25/31.64 --clausify_out false 243.25/31.64 --sig_cnt_out false 243.25/31.64 --trig_cnt_out false 243.25/31.64 --trig_cnt_out_tolerance 1. 243.25/31.64 --trig_cnt_out_sk_spl false 243.25/31.64 --abstr_cl_out false 243.25/31.64 243.25/31.64 ------ Global Options 243.25/31.64 243.25/31.64 --schedule default 243.25/31.64 --add_important_lit false 243.25/31.64 --prop_solver_per_cl 500 243.25/31.64 --subs_bck_mult 8 243.25/31.64 --min_unsat_core false 243.25/31.64 --soft_assumptions false 243.25/31.64 --soft_lemma_size 3 243.25/31.64 --prop_impl_unit_size 0 243.25/31.64 --prop_impl_unit [] 243.25/31.64 --share_sel_clauses true 243.25/31.64 --reset_solvers false 243.25/31.64 --bc_imp_inh [conj_cone] 243.25/31.64 --conj_cone_tolerance 3. 243.25/31.64 --extra_neg_conj none 243.25/31.64 --large_theory_mode true 243.25/31.64 --prolific_symb_bound 500 243.25/31.64 --lt_threshold 2000 243.25/31.64 --clause_weak_htbl true 243.25/31.64 --gc_record_bc_elim false 243.25/31.64 243.25/31.64 ------ Preprocessing Options 243.25/31.64 243.25/31.64 --preprocessing_flag true 243.25/31.64 --time_out_prep_mult 0.1 243.25/31.64 --splitting_mode input 243.25/31.64 --splitting_grd true 243.25/31.64 --splitting_cvd false 243.25/31.64 --splitting_cvd_svl false 243.25/31.64 --splitting_nvd 32 243.25/31.64 --sub_typing false 243.25/31.64 --prep_gs_sim true 243.25/31.64 --prep_unflatten true 243.25/31.64 --prep_res_sim true 243.25/31.64 --prep_sup_sim_all true 243.25/31.64 --prep_sup_sim_sup false 243.25/31.64 --prep_upred true 243.25/31.64 --prep_well_definedness false 243.25/31.64 --prep_sem_filter exhaustive 243.25/31.64 --prep_sem_filter_out false 243.25/31.64 --pred_elim true 243.25/31.64 --res_sim_input true 243.25/31.64 --eq_ax_congr_red true 243.25/31.64 --pure_diseq_elim true 243.25/31.64 --brand_transform false 243.25/31.64 --non_eq_to_eq false 243.25/31.64 --prep_def_merge true 243.25/31.64 --prep_def_merge_prop_impl false 243.25/31.64 --prep_def_merge_mbd true 243.25/31.64 --prep_def_merge_tr_red false 243.25/31.64 --prep_def_merge_tr_cl false 243.25/31.64 --smt_preprocessing false 243.25/31.64 --smt_ac_axioms fast 243.25/31.64 --preprocessed_out false 243.25/31.64 --preprocessed_stats false 243.25/31.64 243.25/31.64 ------ Abstraction refinement Options 243.25/31.64 243.25/31.64 --abstr_ref [] 243.25/31.64 --abstr_ref_prep false 243.25/31.64 --abstr_ref_until_sat false 243.25/31.64 --abstr_ref_sig_restrict funpre 243.25/31.64 --abstr_ref_af_restrict_to_split_sk false 243.25/31.64 --abstr_ref_under [] 243.25/31.64 243.25/31.64 ------ SAT Options 243.25/31.64 243.25/31.64 --sat_mode false 243.25/31.64 --sat_fm_restart_options "" 243.25/31.64 --sat_gr_def false 243.25/31.64 --sat_epr_types true 243.25/31.64 --sat_non_cyclic_types false 243.25/31.64 --sat_finite_models false 243.25/31.64 --sat_fm_lemmas false 243.25/31.64 --sat_fm_prep false 243.25/31.64 --sat_fm_uc_incr false 243.25/31.64 --sat_out_model small 243.25/31.64 --sat_out_clauses false 243.25/31.64 243.25/31.64 ------ QBF Options 243.25/31.64 243.25/31.64 --qbf_mode false 243.25/31.64 --qbf_elim_univ false 243.25/31.64 --qbf_dom_inst none 243.25/31.64 --qbf_dom_pre_inst false 243.25/31.64 --qbf_sk_in false 243.25/31.64 --qbf_pred_elim true 243.25/31.64 --qbf_split 512 243.25/31.64 243.25/31.64 ------ BMC1 Options 243.25/31.64 243.25/31.64 --bmc1_incremental false 243.25/31.64 --bmc1_axioms reachable_all 243.25/31.64 --bmc1_min_bound 0 243.25/31.64 --bmc1_max_bound -1 243.25/31.64 --bmc1_max_bound_default -1 243.25/31.64 --bmc1_symbol_reachability true 243.25/31.64 --bmc1_property_lemmas false 243.25/31.64 --bmc1_k_induction false 243.25/31.64 --bmc1_non_equiv_states false 243.25/31.64 --bmc1_deadlock false 243.25/31.64 --bmc1_ucm false 243.25/31.64 --bmc1_add_unsat_core none 243.25/31.64 --bmc1_unsat_core_children false 243.25/31.64 --bmc1_unsat_core_extrapolate_axioms false 243.25/31.64 --bmc1_out_stat full 243.25/31.64 --bmc1_ground_init false 243.25/31.64 --bmc1_pre_inst_next_state false 243.25/31.64 --bmc1_pre_inst_state false 243.25/31.64 --bmc1_pre_inst_reach_state false 243.25/31.64 --bmc1_out_unsat_core false 243.25/31.64 --bmc1_aig_witness_out false 243.25/31.64 --bmc1_verbose false 243.25/31.64 --bmc1_dump_clauses_tptp false 243.25/31.64 --bmc1_dump_unsat_core_tptp false 243.25/31.64 --bmc1_dump_file - 243.25/31.64 --bmc1_ucm_expand_uc_limit 128 243.25/31.64 --bmc1_ucm_n_expand_iterations 6 243.25/31.64 --bmc1_ucm_extend_mode 1 243.25/31.64 --bmc1_ucm_init_mode 2 243.25/31.64 --bmc1_ucm_cone_mode none 243.25/31.64 --bmc1_ucm_reduced_relation_type 0 243.25/31.64 --bmc1_ucm_relax_model 4 243.25/31.64 --bmc1_ucm_full_tr_after_sat true 243.25/31.64 --bmc1_ucm_expand_neg_assumptions false 243.25/31.64 --bmc1_ucm_layered_model none 243.25/31.64 --bmc1_ucm_max_lemma_size 10 243.25/31.64 243.25/31.64 ------ AIG Options 243.25/31.64 243.25/31.64 --aig_mode false 243.25/31.64 243.25/31.64 ------ Instantiation Options 243.25/31.64 243.25/31.64 --instantiation_flag true 243.25/31.64 --inst_sos_flag false 243.25/31.64 --inst_sos_phase true 243.25/31.64 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 243.25/31.64 --inst_lit_sel [-sign;-num_var;+num_symb] 243.25/31.64 --inst_lit_sel_side none 243.25/31.64 --inst_solver_per_active 1400 243.25/31.64 --inst_solver_calls_frac 1. 243.25/31.64 --inst_passive_queue_type priority_queues 243.25/31.64 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 243.25/31.64 --inst_passive_queues_freq [25;2] 243.25/31.64 --inst_dismatching true 243.25/31.64 --inst_eager_unprocessed_to_passive true 243.25/31.64 --inst_prop_sim_given false 243.25/31.64 --inst_prop_sim_new true 243.25/31.64 --inst_subs_new false 243.25/31.64 --inst_eq_res_simp false 243.25/31.64 --inst_subs_given false 243.25/31.64 --inst_orphan_elimination true 243.25/31.64 --inst_learning_loop_flag true 243.25/31.64 --inst_learning_start 3000 243.25/31.64 --inst_learning_factor 2 243.25/31.64 --inst_start_prop_sim_after_learn 3 243.25/31.64 --inst_sel_renew solver 243.25/31.64 --inst_lit_activity_flag true 243.25/31.64 --inst_restr_to_given false 243.25/31.64 --inst_activity_threshold 500 243.25/31.64 --inst_out_proof true 243.25/31.64 243.25/31.64 ------ Resolution Options 243.25/31.64 243.25/31.64 --resolution_flag true 243.25/31.64 --res_lit_sel neg_max 243.25/31.64 --res_lit_sel_side none 243.25/31.64 --res_ordering kbo 243.25/31.64 --res_to_prop_solver active 243.25/31.64 --res_prop_simpl_new false 243.25/31.64 --res_prop_simpl_given true 243.25/31.64 --res_passive_queue_type priority_queues 243.25/31.64 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 243.25/31.64 --res_passive_queues_freq [15;5] 243.25/31.64 --res_forward_subs full 243.25/31.64 --res_backward_subs subset_subsumption 243.25/31.64 --res_forward_subs_resolution true 243.25/31.64 --res_backward_subs_resolution false 243.25/31.64 --res_orphan_elimination false 243.25/31.64 --res_time_limit 300. 243.25/31.64 --res_out_proof true 243.25/31.64 243.25/31.64 ------ Superposition Options 243.25/31.64 243.25/31.64 --superposition_flag true 243.25/31.64 --sup_passive_queue_type priority_queues 243.25/31.64 --sup_passive_queues [[+age];[-num_symb]] 243.25/31.64 --sup_passive_queues_freq [3;2] 243.25/31.64 --demod_completeness_check fast 243.25/31.64 --demod_use_ground true 243.25/31.64 --sup_to_prop_solver passive 243.25/31.64 --sup_prop_simpl_new true 243.25/31.64 --sup_prop_simpl_given true 243.25/31.64 --sup_fun_splitting false 243.25/31.64 --sup_iter_deepening 2 243.25/31.64 --sup_restarts_mult 12 243.25/31.64 --sup_score sim_d_gen 243.25/31.64 --sup_share_score_frac 0.2 243.25/31.64 --sup_share_max_num_cl 500 243.25/31.64 --sup_ordering kbo 243.25/31.64 --sup_symb_ordering invfreq 243.25/31.64 --sup_term_weight default 243.25/31.64 243.25/31.64 ------ Superposition Simplification Setup 243.25/31.64 243.25/31.64 --sup_indices_passive [LightNormIndex;FwDemodIndex] 243.25/31.64 --sup_full_triv [SMTSimplify;PropSubs] 243.25/31.64 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability] 243.25/31.64 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 243.25/31.64 --sup_immed_triv [] 243.25/31.64 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes] 243.25/31.64 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes] 243.25/31.64 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod] 243.25/31.64 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 243.25/31.64 --sup_input_triv [Unflattening;SMTSimplify] 243.25/31.64 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability] 243.25/31.64 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 243.25/31.64 --sup_full_fixpoint true 243.25/31.64 --sup_main_fixpoint true 243.25/31.64 --sup_immed_fixpoint false 243.25/31.64 --sup_input_fixpoint true 243.25/31.64 --sup_cache_sim none 243.25/31.64 --sup_smt_interval 500 243.25/31.64 --sup_bw_gjoin_interval 0 243.25/31.64 243.25/31.64 ------ Combination Options 243.25/31.64 243.25/31.64 --comb_mode clause_based 243.25/31.64 --comb_inst_mult 5 243.25/31.64 --comb_res_mult 1 243.25/31.64 --comb_sup_mult 8 243.25/31.64 --comb_sup_deep_mult 2 243.25/31.64 243.25/31.64 ------ Debug Options 243.25/31.64 243.25/31.64 --dbg_backtrace false 243.25/31.64 --dbg_dump_prop_clauses false 243.25/31.64 --dbg_dump_prop_clauses_file - 243.25/31.64 --dbg_out_stat false 243.25/31.64 --dbg_just_parse false 243.25/31.64 243.25/31.64 243.25/31.64 243.25/31.64 243.25/31.64 ------ Proving... 243.25/31.64 243.25/31.64 243.25/31.64 % SZS status Theorem for theBenchmark.p 243.25/31.64 243.25/31.64 % SZS output start CNFRefutation for theBenchmark.p 243.25/31.64 243.25/31.64 tff(f10,conjecture,( 243.25/31.64 ! [X0 : element,X5 : set,X6 : $int] : ((~member(X0,X5) & cardinality(X5) = X6) => $sum(X6,1) = cardinality(union(singleton(X0),X5)))), 243.25/31.64 file('/export/starexec/sandbox/benchmark/theBenchmark.p',vc2)). 243.25/31.64 243.25/31.64 tff(f11,negated_conjecture,( 243.25/31.64 ~! [X0 : element,X5 : set,X6 : $int] : ((~member(X0,X5) & cardinality(X5) = X6) => $sum(X6,1) = cardinality(union(singleton(X0),X5)))), 243.25/31.64 inference(negated_conjecture,[],[f10])). 243.25/31.64 243.25/31.64 tff(f33,plain,( 243.25/31.64 ~! [X0 : element,X1 : set,X2 : $int] : ((~member(X0,X1) & cardinality(X1) = X2) => cardinality(union(singleton(X0),X1)) = $sum(X2,1))), 243.25/31.64 inference(rectify,[],[f11])). 243.25/31.64 243.25/31.64 tff(f37,plain,( 243.25/31.64 ? [X0 : element,X1 : set,X2 : $int] : (cardinality(union(singleton(X0),X1)) != $sum(X2,1) & (~member(X0,X1) & cardinality(X1) = X2))), 243.25/31.64 inference(ennf_transformation,[],[f33])). 243.25/31.64 243.25/31.64 tff(f38,plain,( 243.25/31.64 ? [X0 : element,X1 : set,X2 : $int] : (cardinality(union(singleton(X0),X1)) != $sum(X2,1) & ~member(X0,X1) & cardinality(X1) = X2)), 243.25/31.64 inference(flattening,[],[f37])). 243.25/31.64 243.25/31.64 tff(f50,plain,( 243.25/31.64 ? [X0 : element,X1 : set,X2 : $int] : (cardinality(union(singleton(X0),X1)) != $sum(X2,1) & ~member(X0,X1) & cardinality(X1) = X2) => (cardinality(union(singleton(sK0),sK1)) != $sum(sK2,1) & ~member(sK0,sK1) & sK2 = cardinality(sK1))), 243.25/31.64 introduced(choice_axiom,[])). 243.25/31.64 243.25/31.64 tff(f51,plain,( 243.25/31.64 cardinality(union(singleton(sK0),sK1)) != $sum(sK2,1) & ~member(sK0,sK1) & sK2 = cardinality(sK1)), 243.25/31.64 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f38,f50])). 243.25/31.64 243.25/31.64 tff(f77,plain,( 243.25/31.64 sK2 = cardinality(sK1)), 243.25/31.64 inference(cnf_transformation,[],[f51])). 243.25/31.64 243.25/31.64 tff(f79,plain,( 243.25/31.64 cardinality(union(singleton(sK0),sK1)) != $sum(sK2,1)), 243.25/31.64 inference(cnf_transformation,[],[f51])). 243.25/31.64 243.25/31.64 tff(f16,plain,( 243.25/31.64 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2)) )), 243.25/31.64 introduced(theory_axiom_144,[])). 243.25/31.64 243.25/31.64 tff(f15,plain,( 243.25/31.64 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )), 243.25/31.64 introduced(theory_axiom_143,[])). 243.25/31.64 243.25/31.64 tff(f6,axiom,( 243.25/31.64 ! [X0 : element,X3 : set] : (empty_set = intersection(singleton(X0),X3) <=> cardinality(union(singleton(X0),X3)) = $sum(cardinality(X3),1))), 243.25/31.64 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cardinality_intersection_2)). 243.25/31.64 243.25/31.64 tff(f29,plain,( 243.25/31.64 ! [X0 : element,X1 : set] : (empty_set = intersection(singleton(X0),X1) <=> cardinality(union(singleton(X0),X1)) = $sum(cardinality(X1),1))), 243.25/31.64 inference(rectify,[],[f6])). 243.25/31.64 243.25/31.64 tff(f45,plain,( 243.25/31.64 ! [X0 : element,X1 : set] : ((empty_set = intersection(singleton(X0),X1) | cardinality(union(singleton(X0),X1)) != $sum(cardinality(X1),1)) & (cardinality(union(singleton(X0),X1)) = $sum(cardinality(X1),1) | empty_set != intersection(singleton(X0),X1)))), 243.25/31.64 inference(nnf_transformation,[],[f29])). 243.25/31.64 243.25/31.64 tff(f68,plain,( 243.25/31.64 ( ! [X0 : element,X1 : set] : (cardinality(union(singleton(X0),X1)) = $sum(cardinality(X1),1) | empty_set != intersection(singleton(X0),X1)) )), 243.25/31.64 inference(cnf_transformation,[],[f45])). 243.25/31.64 243.25/31.64 tff(f14,axiom,( 243.25/31.64 ! [X3 : set] : (empty_set = X3 <=> ! [X0 : element] : ~member(X0,X3))), 243.25/31.64 file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set)). 243.25/31.64 243.25/31.64 tff(f36,plain,( 243.25/31.64 ! [X0 : set] : (empty_set = X0 <=> ! [X1 : element] : ~member(X1,X0))), 243.25/31.64 inference(rectify,[],[f14])). 243.25/31.64 243.25/31.64 tff(f54,plain,( 243.25/31.64 ! [X0 : set] : ((empty_set = X0 | ? [X1 : element] : member(X1,X0)) & (! [X1 : element] : ~member(X1,X0) | empty_set != X0))), 243.25/31.64 inference(nnf_transformation,[],[f36])). 243.25/31.64 243.25/31.64 tff(f55,plain,( 243.25/31.64 ! [X0 : set] : ((empty_set = X0 | ? [X1 : element] : member(X1,X0)) & (! [X2 : element] : ~member(X2,X0) | empty_set != X0))), 243.25/31.64 inference(rectify,[],[f54])). 243.25/31.64 243.25/31.64 tff(f56,plain,( 243.25/31.64 ! [X0 : set] : (? [X1 : element] : member(X1,X0) => member(sK3(X0),X0))), 243.25/31.64 introduced(choice_axiom,[])). 243.25/31.64 243.25/31.64 tff(f57,plain,( 243.25/31.64 ! [X0 : set] : ((empty_set = X0 | member(sK3(X0),X0)) & (! [X2 : element] : ~member(X2,X0) | empty_set != X0))), 243.25/31.64 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f55,f56])). 243.25/31.64 243.25/31.64 tff(f85,plain,( 243.25/31.64 ( ! [X0 : set] : (empty_set = X0 | member(sK3(X0),X0)) )), 243.25/31.64 inference(cnf_transformation,[],[f57])). 243.25/31.64 243.25/31.64 tff(f3,axiom,( 243.25/31.64 ! [X0 : element,X1 : set,X2 : set] : ((member(X0,X2) & member(X0,X1)) <=> member(X0,intersection(X1,X2)))), 243.25/31.64 file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection)). 243.25/31.64 243.25/31.64 tff(f42,plain,( 243.25/31.64 ! [X0 : element,X1 : set,X2 : set] : (((member(X0,X2) & member(X0,X1)) | ~member(X0,intersection(X1,X2))) & (member(X0,intersection(X1,X2)) | (~member(X0,X2) | ~member(X0,X1))))), 243.25/31.64 inference(nnf_transformation,[],[f3])). 243.25/31.64 243.25/31.64 tff(f43,plain,( 243.25/31.64 ! [X0 : element,X1 : set,X2 : set] : (((member(X0,X2) & member(X0,X1)) | ~member(X0,intersection(X1,X2))) & (member(X0,intersection(X1,X2)) | ~member(X0,X2) | ~member(X0,X1)))), 243.25/31.64 inference(flattening,[],[f42])). 243.25/31.64 243.25/31.64 tff(f65,plain,( 243.25/31.64 ( ! [X2 : set,X0 : element,X1 : set] : (member(X0,X2) | ~member(X0,intersection(X1,X2))) )), 243.25/31.64 inference(cnf_transformation,[],[f43])). 243.25/31.64 243.25/31.64 tff(f1,axiom,( 243.25/31.64 ! [X0 : element,X1 : element] : (X0 = X1 <=> member(X0,singleton(X1)))), 243.25/31.64 file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton)). 243.25/31.64 243.25/31.64 tff(f39,plain,( 243.25/31.64 ! [X0 : element,X1 : element] : ((X0 = X1 | ~member(X0,singleton(X1))) & (member(X0,singleton(X1)) | X0 != X1))), 243.25/31.64 inference(nnf_transformation,[],[f1])). 243.25/31.64 243.25/31.64 tff(f59,plain,( 243.25/31.64 ( ! [X0 : element,X1 : element] : (X0 = X1 | ~member(X0,singleton(X1))) )), 243.25/31.64 inference(cnf_transformation,[],[f39])). 243.25/31.64 243.25/31.64 tff(f64,plain,( 243.25/31.64 ( ! [X2 : set,X0 : element,X1 : set] : (member(X0,X1) | ~member(X0,intersection(X1,X2))) )), 243.25/31.64 inference(cnf_transformation,[],[f43])). 243.25/31.64 243.25/31.64 tff(f58,plain,( 243.25/31.64 ( ! [X0 : element,X1 : element] : (member(X0,singleton(X1)) | X0 != X1) )), 243.25/31.64 inference(cnf_transformation,[],[f39])). 243.25/31.64 243.25/31.64 tff(f86,plain,( 243.25/31.64 ( ! [X1 : element] : (member(X1,singleton(X1))) )), 243.25/31.64 inference(equality_resolution,[],[f58])). 243.25/31.64 243.25/31.64 tff(f78,plain,( 243.25/31.64 ~member(sK0,sK1)), 243.25/31.64 inference(cnf_transformation,[],[f51])). 243.25/31.64 243.25/31.64 cnf(c_888,plain, 243.25/31.64 ( X0_13 != X1_13 243.25/31.64 | X0_14 != X1_14 243.25/31.64 | ~ member(X1_14,X1_13) 243.25/31.64 | member(X0_14,X0_13) ), 243.25/31.64 theory(equality) ). 243.25/31.64 243.25/31.64 cnf(c_1599623,plain, 243.25/31.64 ( X0_13 != sK1 243.25/31.64 | X0_14 != sK3(intersection(singleton(sK0),sK1)) 243.25/31.64 | ~ member(sK3(intersection(singleton(sK0),sK1)),sK1) 243.25/31.64 | member(X0_14,X0_13) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_888]) ). 243.25/31.64 243.25/31.64 cnf(c_82,negated_conjecture, 243.25/31.64 ( cardinality(sK1) = sK2 ), 243.25/31.64 inference(cnf_transformation,[],[f77]) ). 243.25/31.64 243.25/31.64 cnf(c_80,negated_conjecture, 243.25/31.64 ( cardinality(union(singleton(sK0),sK1)) != $sum_int(sK2,1) ), 243.25/31.64 inference(cnf_transformation,[],[f79]) ). 243.25/31.64 243.25/31.64 cnf(c_59,plain, 243.25/31.64 ( $sum_int($sum_int(X0_3,X1_3),X2_3) = $sum_int(X0_3,$sum_int(X1_3,X2_3)) ), 243.25/31.64 inference(cnf_transformation,[],[f16]) ). 243.25/31.64 243.25/31.64 cnf(c_60,plain, 243.25/31.64 ( $sum_int(X0_3,X1_3) = $sum_int(X1_3,X0_3) ), 243.25/31.64 inference(cnf_transformation,[],[f15]) ). 243.25/31.64 243.25/31.64 cnf(c_118,negated_conjecture, 243.25/31.64 ( cardinality(union(singleton(sK0),sK1)) != $sum_int(1,sK2) ), 243.25/31.64 inference(theory_normalisation,[status(thm)],[c_80,c_59,c_60]) ). 243.25/31.64 243.25/31.64 cnf(c_875,plain,( X0_3 = X0_3 ),theory(equality) ). 243.25/31.64 243.25/31.64 cnf(c_2164,plain, 243.25/31.64 ( 1 = 1 ), 243.25/31.64 inference(instantiation,[status(thm)],[c_875]) ). 243.25/31.64 243.25/31.64 cnf(c_2486,plain, 243.25/31.64 ( $sum_int(1,sK2) = $sum_int(1,sK2) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_875]) ). 243.25/31.64 243.25/31.64 cnf(c_72,plain, 243.25/31.64 ( intersection(singleton(X0_14),X0_13) != empty_set 243.25/31.64 | cardinality(union(singleton(X0_14),X0_13)) = $sum_int(cardinality(X0_13),1) ), 243.25/31.64 inference(cnf_transformation,[],[f68]) ). 243.25/31.64 243.25/31.64 cnf(c_117,plain, 243.25/31.64 ( intersection(singleton(X0_14),X0_13) != empty_set 243.25/31.64 | cardinality(union(singleton(X0_14),X0_13)) = $sum_int(1,cardinality(X0_13)) ), 243.25/31.64 inference(theory_normalisation,[status(thm)],[c_72,c_59,c_60]) ). 243.25/31.64 243.25/31.64 cnf(c_522,plain, 243.25/31.64 ( intersection(singleton(X0_14),X0_13) != empty_set 243.25/31.64 | cardinality(union(singleton(X0_14),X0_13)) = $sum_int(1,cardinality(X0_13)) ), 243.25/31.64 inference(prop_impl,[status(thm)],[c_117]) ). 243.25/31.64 243.25/31.64 cnf(c_4124,plain, 243.25/31.64 ( intersection(singleton(sK0),sK1) != empty_set 243.25/31.64 | cardinality(union(singleton(sK0),sK1)) = $sum_int(1,cardinality(sK1)) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_522]) ). 243.25/31.64 243.25/31.64 cnf(c_87,plain, 243.25/31.64 ( X0_13 = empty_set | member(sK3(X0_13),X0_13) ), 243.25/31.64 inference(cnf_transformation,[],[f85]) ). 243.25/31.64 243.25/31.64 cnf(c_1733,plain, 243.25/31.64 ( intersection(singleton(X0_14),X0_13) = empty_set 243.25/31.64 | member(sK3(intersection(singleton(X0_14),X0_13)),intersection(singleton(X0_14),X0_13)) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_87]) ). 243.25/31.64 243.25/31.64 cnf(c_8560,plain, 243.25/31.64 ( intersection(singleton(sK0),sK1) = empty_set 243.25/31.64 | member(sK3(intersection(singleton(sK0),sK1)),intersection(singleton(sK0),sK1)) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_1733]) ). 243.25/31.64 243.25/31.64 cnf(c_881,plain, 243.25/31.64 ( X0_3 != X1_3 243.25/31.64 | X2_3 != X3_3 243.25/31.64 | $sum_int(X0_3,X2_3) = $sum_int(X1_3,X3_3) ), 243.25/31.64 theory(equality) ). 243.25/31.64 243.25/31.64 cnf(c_2491,plain, 243.25/31.64 ( X0_3 != 1 | X1_3 != sK2 | $sum_int(X0_3,X1_3) = $sum_int(1,sK2) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_881]) ). 243.25/31.64 243.25/31.64 cnf(c_4838,plain, 243.25/31.64 ( X0_3 != sK2 | 1 != 1 | $sum_int(1,X0_3) = $sum_int(1,sK2) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_2491]) ). 243.25/31.64 243.25/31.64 cnf(c_10494,plain, 243.25/31.64 ( cardinality(sK1) != sK2 243.25/31.64 | 1 != 1 243.25/31.64 | $sum_int(1,cardinality(sK1)) = $sum_int(1,sK2) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_4838]) ). 243.25/31.64 243.25/31.64 cnf(c_878,plain, 243.25/31.64 ( X0_3 != X1_3 | X2_3 != X1_3 | X2_3 = X0_3 ), 243.25/31.64 theory(equality) ). 243.25/31.64 243.25/31.64 cnf(c_2051,plain, 243.25/31.64 ( $sum_int(1,sK2) != X0_3 | X1_3 != X0_3 | $sum_int(1,sK2) = X1_3 ), 243.25/31.64 inference(instantiation,[status(thm)],[c_878]) ). 243.25/31.64 243.25/31.64 cnf(c_4330,plain, 243.25/31.64 ( $sum_int(1,sK2) != $sum_int(1,sK2) 243.25/31.64 | X0_3 != $sum_int(1,sK2) 243.25/31.64 | $sum_int(1,sK2) = X0_3 ), 243.25/31.64 inference(instantiation,[status(thm)],[c_2051]) ). 243.25/31.64 243.25/31.64 cnf(c_18257,plain, 243.25/31.64 ( $sum_int(1,cardinality(sK1)) != $sum_int(1,sK2) 243.25/31.64 | $sum_int(1,sK2) != $sum_int(1,sK2) 243.25/31.64 | $sum_int(1,sK2) = $sum_int(1,cardinality(sK1)) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_4330]) ). 243.25/31.64 243.25/31.64 cnf(c_66,plain, 243.25/31.64 ( ~ member(X0_14,intersection(X0_13,X1_13)) | member(X0_14,X1_13) ), 243.25/31.64 inference(cnf_transformation,[],[f65]) ). 243.25/31.64 243.25/31.64 cnf(c_20781,plain, 243.25/31.64 ( ~ member(sK3(intersection(singleton(sK0),sK1)),intersection(singleton(sK0),sK1)) 243.25/31.64 | member(sK3(intersection(singleton(sK0),sK1)),sK1) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_66]) ). 243.25/31.64 243.25/31.64 cnf(c_2304,plain, 243.25/31.64 ( cardinality(union(singleton(sK0),sK1)) != X0_3 243.25/31.64 | X1_3 != X0_3 243.25/31.64 | cardinality(union(singleton(sK0),sK1)) = X1_3 ), 243.25/31.64 inference(instantiation,[status(thm)],[c_878]) ). 243.25/31.64 243.25/31.64 cnf(c_4123,plain, 243.25/31.64 ( cardinality(union(singleton(sK0),sK1)) != $sum_int(1,cardinality(sK1)) 243.25/31.64 | X0_3 != $sum_int(1,cardinality(sK1)) 243.25/31.64 | cardinality(union(singleton(sK0),sK1)) = X0_3 ), 243.25/31.64 inference(instantiation,[status(thm)],[c_2304]) ). 243.25/31.64 243.25/31.64 cnf(c_44203,plain, 243.25/31.64 ( cardinality(union(singleton(sK0),sK1)) != $sum_int(1,cardinality(sK1)) 243.25/31.64 | $sum_int(1,sK2) != $sum_int(1,cardinality(sK1)) 243.25/31.64 | cardinality(union(singleton(sK0),sK1)) = $sum_int(1,sK2) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_4123]) ). 243.25/31.64 243.25/31.64 cnf(c_75335,plain, 243.25/31.64 ( X0_13 != sK1 243.25/31.64 | X0_14 != sK3(intersection(singleton(sK0),sK1)) 243.25/31.64 | ~ member(sK3(intersection(singleton(sK0),sK1)),sK1) 243.25/31.64 | member(X0_14,X0_13) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_888]) ). 243.25/31.64 243.25/31.64 cnf(c_1599624,plain, 243.25/31.64 ( X0_14 != sK3(intersection(singleton(sK0),sK1)) 243.25/31.64 | X0_13 != sK1 243.25/31.64 | member(X0_14,X0_13) ), 243.25/31.64 inference(global_propositional_subsumption, 243.25/31.64 [status(thm)], 243.25/31.64 [c_1599623,c_82,c_118,c_2164,c_2486,c_4124,c_8560, 243.25/31.64 c_10494,c_18257,c_20781,c_44203,c_75335]) ). 243.25/31.64 243.25/31.64 cnf(c_1599625,plain, 243.25/31.64 ( X0_13 != sK1 243.25/31.64 | X0_14 != sK3(intersection(singleton(sK0),sK1)) 243.25/31.64 | member(X0_14,X0_13) ), 243.25/31.64 inference(renaming,[status(thm)],[c_1599624]) ). 243.25/31.64 243.25/31.64 cnf(c_1755923,plain, 243.25/31.64 ( X0_14 != sK3(intersection(singleton(sK0),sK1)) 243.25/31.64 | sK1 != sK1 243.25/31.64 | member(X0_14,sK1) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_1599625]) ). 243.25/31.64 243.25/31.64 cnf(c_1755924,plain, 243.25/31.64 ( sK0 != sK3(intersection(singleton(sK0),sK1)) 243.25/31.64 | sK1 != sK1 243.25/31.64 | member(sK0,sK1) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_1755923]) ). 243.25/31.64 243.25/31.64 cnf(c_61,plain, 243.25/31.64 ( ~ member(X0_14,singleton(X1_14)) | X0_14 = X1_14 ), 243.25/31.64 inference(cnf_transformation,[],[f59]) ). 243.25/31.64 243.25/31.64 cnf(c_1661380,plain, 243.25/31.64 ( ~ member(sK3(intersection(singleton(sK0),sK1)),singleton(X0_14)) 243.25/31.64 | sK3(intersection(singleton(sK0),sK1)) = X0_14 ), 243.25/31.64 inference(instantiation,[status(thm)],[c_61]) ). 243.25/31.64 243.25/31.64 cnf(c_1661381,plain, 243.25/31.64 ( ~ member(sK3(intersection(singleton(sK0),sK1)),singleton(sK0)) 243.25/31.64 | sK3(intersection(singleton(sK0),sK1)) = sK0 ), 243.25/31.64 inference(instantiation,[status(thm)],[c_1661380]) ). 243.25/31.64 243.25/31.64 cnf(c_880,plain, 243.25/31.64 ( X0_14 != X1_14 | X2_14 != X1_14 | X2_14 = X0_14 ), 243.25/31.64 theory(equality) ). 243.25/31.64 243.25/31.64 cnf(c_708084,plain, 243.25/31.64 ( sK3(intersection(singleton(sK0),sK1)) != X0_14 243.25/31.64 | X1_14 != X0_14 243.25/31.64 | X1_14 = sK3(intersection(singleton(sK0),sK1)) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_880]) ). 243.25/31.64 243.25/31.64 cnf(c_708085,plain, 243.25/31.64 ( sK3(intersection(singleton(sK0),sK1)) != sK0 243.25/31.64 | sK0 != sK0 243.25/31.64 | sK0 = sK3(intersection(singleton(sK0),sK1)) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_708084]) ). 243.25/31.64 243.25/31.64 cnf(c_67,plain, 243.25/31.64 ( ~ member(X0_14,intersection(X0_13,X1_13)) | member(X0_14,X0_13) ), 243.25/31.64 inference(cnf_transformation,[],[f64]) ). 243.25/31.64 243.25/31.64 cnf(c_20780,plain, 243.25/31.64 ( ~ member(sK3(intersection(singleton(sK0),sK1)),intersection(singleton(sK0),sK1)) 243.25/31.64 | member(sK3(intersection(singleton(sK0),sK1)),singleton(sK0)) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_67]) ). 243.25/31.64 243.25/31.64 cnf(c_876,plain,( X0_13 = X0_13 ),theory(equality) ). 243.25/31.64 243.25/31.64 cnf(c_9509,plain, 243.25/31.64 ( sK1 = sK1 ), 243.25/31.64 inference(instantiation,[status(thm)],[c_876]) ). 243.25/31.64 243.25/31.64 cnf(c_105,plain, 243.25/31.64 ( ~ member(sK0,singleton(sK0)) | sK0 = sK0 ), 243.25/31.64 inference(instantiation,[status(thm)],[c_61]) ). 243.25/31.64 243.25/31.64 cnf(c_62,plain, 243.25/31.64 ( member(X0_14,singleton(X0_14)) ), 243.25/31.64 inference(cnf_transformation,[],[f86]) ). 243.25/31.64 243.25/31.64 cnf(c_104,plain, 243.25/31.64 ( member(sK0,singleton(sK0)) ), 243.25/31.64 inference(instantiation,[status(thm)],[c_62]) ). 243.25/31.64 243.25/31.64 cnf(c_81,negated_conjecture, 243.25/31.64 ( ~ member(sK0,sK1) ), 243.25/31.64 inference(cnf_transformation,[],[f78]) ). 243.25/31.64 243.25/31.64 cnf(contradiction,plain, 243.25/31.64 ( $false ), 243.25/31.64 inference(minisat, 243.25/31.64 [status(thm)], 243.25/31.64 [c_1755924,c_1661381,c_708085,c_44203,c_20780,c_18257, 243.25/31.64 c_10494,c_9509,c_8560,c_4124,c_2486,c_2164,c_118,c_105, 243.25/31.64 c_104,c_81,c_82]) ). 243.25/31.64 243.25/31.64 243.25/31.64 % SZS output end CNFRefutation for theBenchmark.p 243.25/31.64 243.25/31.64 243.25/31.66 EOF