0.06/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.11 % Command : iproveropt_run.sh %d %s 0.10/0.31 % Computer : n027.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 960 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Thu Jul 2 07:07:01 EDT 2020 0.16/0.31 % CPUTime : 0.16/0.32 % Running in FOF mode 3.91/0.95 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p 3.91/0.95 3.91/0.95 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 3.91/0.95 3.91/0.95 ------ iProver source info 3.91/0.95 3.91/0.95 git: date: 2020-06-30 10:37:57 +0100 3.91/0.95 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 3.91/0.95 git: non_committed_changes: false 3.91/0.95 git: last_make_outside_of_git: false 3.91/0.95 3.91/0.95 ------ 3.91/0.95 3.91/0.95 ------ Input Options 3.91/0.95 3.91/0.95 --out_options all 3.91/0.95 --tptp_safe_out true 3.91/0.95 --problem_path "" 3.91/0.95 --include_path "" 3.91/0.95 --clausifier res/vclausify_rel 3.91/0.95 --clausifier_options "" 3.91/0.95 --stdin false 3.91/0.95 --stats_out all 3.91/0.95 3.91/0.95 ------ General Options 3.91/0.95 3.91/0.95 --fof false 3.91/0.95 --time_out_real 125. 3.91/0.95 --time_out_virtual -1. 3.91/0.95 --symbol_type_check false 3.91/0.95 --clausify_out false 3.91/0.95 --sig_cnt_out false 3.91/0.95 --trig_cnt_out false 3.91/0.95 --trig_cnt_out_tolerance 1. 3.91/0.95 --trig_cnt_out_sk_spl false 3.91/0.95 --abstr_cl_out false 3.91/0.95 3.91/0.95 ------ Global Options 3.91/0.95 3.91/0.95 --schedule default 3.91/0.95 --add_important_lit false 3.91/0.95 --prop_solver_per_cl 1000 3.91/0.95 --min_unsat_core false 3.91/0.95 --soft_assumptions false 3.91/0.95 --soft_lemma_size 3 3.91/0.95 --prop_impl_unit_size 0 3.91/0.95 --prop_impl_unit [] 3.91/0.95 --share_sel_clauses true 3.91/0.95 --reset_solvers false 3.91/0.95 --bc_imp_inh [conj_cone] 3.91/0.95 --conj_cone_tolerance 3. 3.91/0.95 --extra_neg_conj none 3.91/0.95 --large_theory_mode true 3.91/0.95 --prolific_symb_bound 200 3.91/0.95 --lt_threshold 2000 3.91/0.95 --clause_weak_htbl true 3.91/0.95 --gc_record_bc_elim false 3.91/0.95 3.91/0.95 ------ Preprocessing Options 3.91/0.95 3.91/0.95 --preprocessing_flag true 3.91/0.95 --time_out_prep_mult 0.1 3.91/0.95 --splitting_mode input 3.91/0.95 --splitting_grd true 3.91/0.95 --splitting_cvd false 3.91/0.95 --splitting_cvd_svl false 3.91/0.95 --splitting_nvd 32 3.91/0.95 --sub_typing true 3.91/0.95 --prep_gs_sim true 3.91/0.95 --prep_unflatten true 3.91/0.95 --prep_res_sim true 3.91/0.95 --prep_upred true 3.91/0.95 --prep_sem_filter exhaustive 3.91/0.95 --prep_sem_filter_out false 3.91/0.95 --pred_elim true 3.91/0.95 --res_sim_input true 3.91/0.95 --eq_ax_congr_red true 3.91/0.95 --pure_diseq_elim true 3.91/0.95 --brand_transform false 3.91/0.95 --non_eq_to_eq false 3.91/0.95 --prep_def_merge true 3.91/0.95 --prep_def_merge_prop_impl false 3.91/0.95 --prep_def_merge_mbd true 3.91/0.95 --prep_def_merge_tr_red false 3.91/0.95 --prep_def_merge_tr_cl false 3.91/0.95 --smt_preprocessing true 3.91/0.95 --smt_ac_axioms fast 3.91/0.95 --preprocessed_out false 3.91/0.95 --preprocessed_stats false 3.91/0.95 3.91/0.95 ------ Abstraction refinement Options 3.91/0.95 3.91/0.95 --abstr_ref [] 3.91/0.95 --abstr_ref_prep false 3.91/0.95 --abstr_ref_until_sat false 3.91/0.95 --abstr_ref_sig_restrict funpre 3.91/0.95 --abstr_ref_af_restrict_to_split_sk false 3.91/0.95 --abstr_ref_under [] 3.91/0.95 3.91/0.95 ------ SAT Options 3.91/0.95 3.91/0.95 --sat_mode false 3.91/0.95 --sat_fm_restart_options "" 3.91/0.95 --sat_gr_def false 3.91/0.95 --sat_epr_types true 3.91/0.95 --sat_non_cyclic_types false 3.91/0.95 --sat_finite_models false 3.91/0.95 --sat_fm_lemmas false 3.91/0.95 --sat_fm_prep false 3.91/0.95 --sat_fm_uc_incr true 3.91/0.95 --sat_out_model small 3.91/0.95 --sat_out_clauses false 3.91/0.95 3.91/0.95 ------ QBF Options 3.91/0.95 3.91/0.95 --qbf_mode false 3.91/0.95 --qbf_elim_univ false 3.91/0.95 --qbf_dom_inst none 3.91/0.95 --qbf_dom_pre_inst false 3.91/0.95 --qbf_sk_in false 3.91/0.95 --qbf_pred_elim true 3.91/0.95 --qbf_split 512 3.91/0.95 3.91/0.95 ------ BMC1 Options 3.91/0.95 3.91/0.95 --bmc1_incremental false 3.91/0.95 --bmc1_axioms reachable_all 3.91/0.95 --bmc1_min_bound 0 3.91/0.95 --bmc1_max_bound -1 3.91/0.95 --bmc1_max_bound_default -1 3.91/0.95 --bmc1_symbol_reachability true 3.91/0.95 --bmc1_property_lemmas false 3.91/0.95 --bmc1_k_induction false 3.91/0.95 --bmc1_non_equiv_states false 3.91/0.95 --bmc1_deadlock false 3.91/0.95 --bmc1_ucm false 3.91/0.95 --bmc1_add_unsat_core none 3.91/0.95 --bmc1_unsat_core_children false 3.91/0.95 --bmc1_unsat_core_extrapolate_axioms false 3.91/0.95 --bmc1_out_stat full 3.91/0.95 --bmc1_ground_init false 3.91/0.95 --bmc1_pre_inst_next_state false 3.91/0.95 --bmc1_pre_inst_state false 3.91/0.95 --bmc1_pre_inst_reach_state false 3.91/0.95 --bmc1_out_unsat_core false 3.91/0.95 --bmc1_aig_witness_out false 3.91/0.95 --bmc1_verbose false 3.91/0.95 --bmc1_dump_clauses_tptp false 3.91/0.95 --bmc1_dump_unsat_core_tptp false 3.91/0.95 --bmc1_dump_file - 3.91/0.95 --bmc1_ucm_expand_uc_limit 128 3.91/0.95 --bmc1_ucm_n_expand_iterations 6 3.91/0.95 --bmc1_ucm_extend_mode 1 3.91/0.95 --bmc1_ucm_init_mode 2 3.91/0.95 --bmc1_ucm_cone_mode none 3.91/0.95 --bmc1_ucm_reduced_relation_type 0 3.91/0.95 --bmc1_ucm_relax_model 4 3.91/0.95 --bmc1_ucm_full_tr_after_sat true 3.91/0.95 --bmc1_ucm_expand_neg_assumptions false 3.91/0.95 --bmc1_ucm_layered_model none 3.91/0.95 --bmc1_ucm_max_lemma_size 10 3.91/0.95 3.91/0.95 ------ AIG Options 3.91/0.95 3.91/0.95 --aig_mode false 3.91/0.95 3.91/0.95 ------ Instantiation Options 3.91/0.95 3.91/0.95 --instantiation_flag true 3.91/0.95 --inst_sos_flag true 3.91/0.95 --inst_sos_phase true 3.91/0.95 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 3.91/0.95 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 3.91/0.95 --inst_lit_sel_side num_symb 3.91/0.95 --inst_solver_per_active 1400 3.91/0.95 --inst_solver_calls_frac 1. 3.91/0.95 --inst_passive_queue_type priority_queues 3.91/0.95 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 3.91/0.95 --inst_passive_queues_freq [25;2] 3.91/0.95 --inst_dismatching true 3.91/0.95 --inst_eager_unprocessed_to_passive true 3.91/0.95 --inst_prop_sim_given true 3.91/0.95 --inst_prop_sim_new false 3.91/0.95 --inst_subs_new false 3.91/0.95 --inst_eq_res_simp false 3.91/0.95 --inst_subs_given false 3.91/0.95 --inst_orphan_elimination true 3.91/0.95 --inst_learning_loop_flag true 3.91/0.95 --inst_learning_start 3000 3.91/0.95 --inst_learning_factor 2 3.91/0.95 --inst_start_prop_sim_after_learn 3 3.91/0.95 --inst_sel_renew solver 3.91/0.95 --inst_lit_activity_flag true 3.91/0.95 --inst_restr_to_given false 3.91/0.95 --inst_activity_threshold 500 3.91/0.95 --inst_out_proof true 3.91/0.95 3.91/0.95 ------ Resolution Options 3.91/0.95 3.91/0.95 --resolution_flag true 3.91/0.95 --res_lit_sel adaptive 3.91/0.95 --res_lit_sel_side none 3.91/0.95 --res_ordering kbo 3.91/0.95 --res_to_prop_solver active 3.91/0.95 --res_prop_simpl_new false 3.91/0.95 --res_prop_simpl_given true 3.91/0.95 --res_passive_queue_type priority_queues 3.91/0.95 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 3.91/0.95 --res_passive_queues_freq [15;5] 3.91/0.95 --res_forward_subs full 3.91/0.95 --res_backward_subs full 3.91/0.95 --res_forward_subs_resolution true 3.91/0.95 --res_backward_subs_resolution true 3.91/0.95 --res_orphan_elimination true 3.91/0.95 --res_time_limit 2. 3.91/0.95 --res_out_proof true 3.91/0.95 3.91/0.95 ------ Superposition Options 3.91/0.95 3.91/0.95 --superposition_flag true 3.91/0.95 --sup_passive_queue_type priority_queues 3.91/0.95 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 3.91/0.95 --sup_passive_queues_freq [8;1;4] 3.91/0.95 --demod_completeness_check fast 3.91/0.95 --demod_use_ground true 3.91/0.95 --sup_to_prop_solver passive 3.91/0.95 --sup_prop_simpl_new true 3.91/0.95 --sup_prop_simpl_given true 3.91/0.95 --sup_fun_splitting true 3.91/0.95 --sup_smt_interval 50000 3.91/0.95 3.91/0.95 ------ Superposition Simplification Setup 3.91/0.95 3.91/0.95 --sup_indices_passive [LightNormIndex;FwDemodIndex] 3.91/0.95 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 3.91/0.95 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 3.91/0.95 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 3.91/0.95 --sup_full_triv [TrivRules;PropSubs] 3.91/0.95 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 3.91/0.95 --sup_full_bw [BwDemod;BwSubsumption] 3.91/0.95 --sup_immed_triv [TrivRules] 3.91/0.95 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 3.91/0.95 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 3.91/0.95 --sup_immed_bw_main [] 3.91/0.95 --sup_immed_bw_immed [BwDemod;BwSubsumption] 3.91/0.95 --sup_input_triv [Unflattening;TrivRules] 3.91/0.95 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 3.91/0.95 --sup_input_bw [] 3.91/0.95 3.91/0.95 ------ Combination Options 3.91/0.95 3.91/0.95 --comb_res_mult 3 3.91/0.95 --comb_sup_mult 2 3.91/0.95 --comb_inst_mult 10 3.91/0.95 3.91/0.95 ------ Debug Options 3.91/0.95 3.91/0.95 --dbg_backtrace false 3.91/0.95 --dbg_dump_prop_clauses false 3.91/0.95 --dbg_dump_prop_clauses_file - 3.91/0.95 --dbg_out_stat false 3.91/0.95 ------ Parsing... 3.91/0.95 ------ Clausification by vclausify_rel & Parsing by iProver... 3.91/0.95 3.91/0.95 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e 3.91/0.95 3.91/0.95 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 3.91/0.95 3.91/0.95 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 3.91/0.95 ------ Proving... 3.91/0.95 ------ Problem Properties 3.91/0.95 3.91/0.95 3.91/0.95 clauses 12 3.91/0.95 conjectures 6 3.91/0.95 EPR 1 3.91/0.95 Horn 12 3.91/0.95 unary 1 3.91/0.95 binary 7 3.91/0.95 lits 27 3.91/0.95 lits eq 6 3.91/0.95 fd_pure 0 3.91/0.95 fd_pseudo 0 3.91/0.95 fd_cond 0 3.91/0.95 fd_pseudo_cond 0 3.91/0.95 AC symbols 0 3.91/0.95 3.91/0.95 ------ Schedule dynamic 5 is on 3.91/0.95 3.91/0.95 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 3.91/0.95 3.91/0.95 3.91/0.95 ------ 3.91/0.95 Current options: 3.91/0.95 ------ 3.91/0.95 3.91/0.95 ------ Input Options 3.91/0.95 3.91/0.95 --out_options all 3.91/0.95 --tptp_safe_out true 3.91/0.95 --problem_path "" 3.91/0.95 --include_path "" 3.91/0.95 --clausifier res/vclausify_rel 3.91/0.95 --clausifier_options "" 3.91/0.95 --stdin false 3.91/0.95 --stats_out all 3.91/0.95 3.91/0.95 ------ General Options 3.91/0.95 3.91/0.95 --fof false 3.91/0.95 --time_out_real 125. 3.91/0.95 --time_out_virtual -1. 3.91/0.95 --symbol_type_check false 3.91/0.95 --clausify_out false 3.91/0.95 --sig_cnt_out false 3.91/0.95 --trig_cnt_out false 3.91/0.95 --trig_cnt_out_tolerance 1. 3.91/0.95 --trig_cnt_out_sk_spl false 3.91/0.95 --abstr_cl_out false 3.91/0.95 3.91/0.95 ------ Global Options 3.91/0.95 3.91/0.95 --schedule default 3.91/0.95 --add_important_lit false 3.91/0.95 --prop_solver_per_cl 1000 3.91/0.95 --min_unsat_core false 3.91/0.95 --soft_assumptions false 3.91/0.95 --soft_lemma_size 3 3.91/0.95 --prop_impl_unit_size 0 3.91/0.95 --prop_impl_unit [] 3.91/0.95 --share_sel_clauses true 3.91/0.95 --reset_solvers false 3.91/0.95 --bc_imp_inh [conj_cone] 3.91/0.95 --conj_cone_tolerance 3. 3.91/0.95 --extra_neg_conj none 3.91/0.95 --large_theory_mode true 3.91/0.95 --prolific_symb_bound 200 3.91/0.95 --lt_threshold 2000 3.91/0.95 --clause_weak_htbl true 3.91/0.95 --gc_record_bc_elim false 3.91/0.95 3.91/0.95 ------ Preprocessing Options 3.91/0.95 3.91/0.95 --preprocessing_flag true 3.91/0.95 --time_out_prep_mult 0.1 3.91/0.95 --splitting_mode input 3.91/0.95 --splitting_grd true 3.91/0.95 --splitting_cvd false 3.91/0.95 --splitting_cvd_svl false 3.91/0.95 --splitting_nvd 32 3.91/0.95 --sub_typing true 3.91/0.95 --prep_gs_sim true 3.91/0.95 --prep_unflatten true 3.91/0.95 --prep_res_sim true 3.91/0.95 --prep_upred true 3.91/0.95 --prep_sem_filter exhaustive 3.91/0.95 --prep_sem_filter_out false 3.91/0.95 --pred_elim true 3.91/0.95 --res_sim_input true 3.91/0.95 --eq_ax_congr_red true 3.91/0.95 --pure_diseq_elim true 3.91/0.95 --brand_transform false 3.91/0.95 --non_eq_to_eq false 3.91/0.95 --prep_def_merge true 3.91/0.95 --prep_def_merge_prop_impl false 3.91/0.95 --prep_def_merge_mbd true 3.91/0.95 --prep_def_merge_tr_red false 3.91/0.95 --prep_def_merge_tr_cl false 3.91/0.95 --smt_preprocessing true 3.91/0.95 --smt_ac_axioms fast 3.91/0.95 --preprocessed_out false 3.91/0.95 --preprocessed_stats false 3.91/0.95 3.91/0.95 ------ Abstraction refinement Options 3.91/0.95 3.91/0.95 --abstr_ref [] 3.91/0.95 --abstr_ref_prep false 3.91/0.95 --abstr_ref_until_sat false 3.91/0.95 --abstr_ref_sig_restrict funpre 3.91/0.95 --abstr_ref_af_restrict_to_split_sk false 3.91/0.95 --abstr_ref_under [] 3.91/0.95 3.91/0.95 ------ SAT Options 3.91/0.95 3.91/0.95 --sat_mode false 3.91/0.95 --sat_fm_restart_options "" 3.91/0.95 --sat_gr_def false 3.91/0.95 --sat_epr_types true 3.91/0.95 --sat_non_cyclic_types false 3.91/0.95 --sat_finite_models false 3.91/0.95 --sat_fm_lemmas false 3.91/0.95 --sat_fm_prep false 3.91/0.95 --sat_fm_uc_incr true 3.91/0.95 --sat_out_model small 3.91/0.95 --sat_out_clauses false 3.91/0.95 3.91/0.95 ------ QBF Options 3.91/0.95 3.91/0.95 --qbf_mode false 3.91/0.95 --qbf_elim_univ false 3.91/0.95 --qbf_dom_inst none 3.91/0.95 --qbf_dom_pre_inst false 3.91/0.95 --qbf_sk_in false 3.91/0.95 --qbf_pred_elim true 3.91/0.95 --qbf_split 512 3.91/0.95 3.91/0.95 ------ BMC1 Options 3.91/0.95 3.91/0.95 --bmc1_incremental false 3.91/0.95 --bmc1_axioms reachable_all 3.91/0.95 --bmc1_min_bound 0 3.91/0.95 --bmc1_max_bound -1 3.91/0.95 --bmc1_max_bound_default -1 3.91/0.95 --bmc1_symbol_reachability true 3.91/0.95 --bmc1_property_lemmas false 3.91/0.95 --bmc1_k_induction false 3.91/0.95 --bmc1_non_equiv_states false 3.91/0.95 --bmc1_deadlock false 3.91/0.95 --bmc1_ucm false 3.91/0.95 --bmc1_add_unsat_core none 3.91/0.95 --bmc1_unsat_core_children false 3.91/0.95 --bmc1_unsat_core_extrapolate_axioms false 3.91/0.95 --bmc1_out_stat full 3.91/0.95 --bmc1_ground_init false 3.91/0.95 --bmc1_pre_inst_next_state false 3.91/0.95 --bmc1_pre_inst_state false 3.91/0.95 --bmc1_pre_inst_reach_state false 3.91/0.95 --bmc1_out_unsat_core false 3.91/0.95 --bmc1_aig_witness_out false 3.91/0.95 --bmc1_verbose false 3.91/0.95 --bmc1_dump_clauses_tptp false 3.91/0.95 --bmc1_dump_unsat_core_tptp false 3.91/0.95 --bmc1_dump_file - 3.91/0.95 --bmc1_ucm_expand_uc_limit 128 3.91/0.95 --bmc1_ucm_n_expand_iterations 6 3.91/0.95 --bmc1_ucm_extend_mode 1 3.91/0.95 --bmc1_ucm_init_mode 2 3.91/0.95 --bmc1_ucm_cone_mode none 3.91/0.95 --bmc1_ucm_reduced_relation_type 0 3.91/0.95 --bmc1_ucm_relax_model 4 3.91/0.95 --bmc1_ucm_full_tr_after_sat true 3.91/0.95 --bmc1_ucm_expand_neg_assumptions false 3.91/0.95 --bmc1_ucm_layered_model none 3.91/0.95 --bmc1_ucm_max_lemma_size 10 3.91/0.95 3.91/0.95 ------ AIG Options 3.91/0.95 3.91/0.95 --aig_mode false 3.91/0.95 3.91/0.95 ------ Instantiation Options 3.91/0.95 3.91/0.95 --instantiation_flag true 3.91/0.95 --inst_sos_flag true 3.91/0.95 --inst_sos_phase true 3.91/0.95 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 3.91/0.95 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 3.91/0.95 --inst_lit_sel_side none 3.91/0.95 --inst_solver_per_active 1400 3.91/0.95 --inst_solver_calls_frac 1. 3.91/0.95 --inst_passive_queue_type priority_queues 3.91/0.95 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 3.91/0.95 --inst_passive_queues_freq [25;2] 3.91/0.95 --inst_dismatching true 3.91/0.95 --inst_eager_unprocessed_to_passive true 3.91/0.95 --inst_prop_sim_given true 3.91/0.95 --inst_prop_sim_new false 3.91/0.95 --inst_subs_new false 3.91/0.95 --inst_eq_res_simp false 3.91/0.95 --inst_subs_given false 3.91/0.95 --inst_orphan_elimination true 3.91/0.95 --inst_learning_loop_flag true 3.91/0.95 --inst_learning_start 3000 3.91/0.95 --inst_learning_factor 2 3.91/0.95 --inst_start_prop_sim_after_learn 3 3.91/0.95 --inst_sel_renew solver 3.91/0.95 --inst_lit_activity_flag true 3.91/0.95 --inst_restr_to_given false 3.91/0.95 --inst_activity_threshold 500 3.91/0.95 --inst_out_proof true 3.91/0.95 3.91/0.95 ------ Resolution Options 3.91/0.95 3.91/0.95 --resolution_flag false 3.91/0.95 --res_lit_sel adaptive 3.91/0.95 --res_lit_sel_side none 3.91/0.95 --res_ordering kbo 3.91/0.95 --res_to_prop_solver active 3.91/0.95 --res_prop_simpl_new false 3.91/0.95 --res_prop_simpl_given true 3.91/0.95 --res_passive_queue_type priority_queues 3.91/0.95 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 3.91/0.95 --res_passive_queues_freq [15;5] 3.91/0.95 --res_forward_subs full 3.91/0.95 --res_backward_subs full 3.91/0.95 --res_forward_subs_resolution true 3.91/0.95 --res_backward_subs_resolution true 3.91/0.95 --res_orphan_elimination true 3.91/0.95 --res_time_limit 2. 3.91/0.95 --res_out_proof true 3.91/0.95 3.91/0.95 ------ Superposition Options 3.91/0.95 3.91/0.95 --superposition_flag true 3.91/0.95 --sup_passive_queue_type priority_queues 3.91/0.95 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 3.91/0.95 --sup_passive_queues_freq [8;1;4] 3.91/0.95 --demod_completeness_check fast 3.91/0.95 --demod_use_ground true 3.91/0.95 --sup_to_prop_solver passive 3.91/0.95 --sup_prop_simpl_new true 3.91/0.95 --sup_prop_simpl_given true 3.91/0.95 --sup_fun_splitting true 3.91/0.95 --sup_smt_interval 50000 3.91/0.95 3.91/0.95 ------ Superposition Simplification Setup 3.91/0.95 3.91/0.95 --sup_indices_passive [LightNormIndex;FwDemodIndex] 3.91/0.95 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 3.91/0.95 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 3.91/0.95 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 3.91/0.95 --sup_full_triv [TrivRules;PropSubs] 3.91/0.95 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 3.91/0.95 --sup_full_bw [BwDemod;BwSubsumption] 3.91/0.95 --sup_immed_triv [TrivRules] 3.91/0.95 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 3.91/0.95 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 3.91/0.95 --sup_immed_bw_main [] 3.91/0.95 --sup_immed_bw_immed [BwDemod;BwSubsumption] 3.91/0.95 --sup_input_triv [Unflattening;TrivRules] 3.91/0.95 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 3.91/0.95 --sup_input_bw [] 3.91/0.95 3.91/0.95 ------ Combination Options 3.91/0.95 3.91/0.95 --comb_res_mult 3 3.91/0.95 --comb_sup_mult 2 3.91/0.95 --comb_inst_mult 10 3.91/0.95 3.91/0.95 ------ Debug Options 3.91/0.95 3.91/0.95 --dbg_backtrace false 3.91/0.95 --dbg_dump_prop_clauses false 3.91/0.95 --dbg_dump_prop_clauses_file - 3.91/0.95 --dbg_out_stat false 3.91/0.95 3.91/0.95 3.91/0.95 3.91/0.95 3.91/0.95 ------ Proving... 3.91/0.95 3.91/0.95 3.91/0.95 % SZS status Theorem for theBenchmark.p 3.91/0.95 3.91/0.95 % SZS output start CNFRefutation for theBenchmark.p 3.91/0.95 3.91/0.95 fof(f6,axiom,( 3.91/0.95 ? [X0] : (! [X1] : (sorti1(X1) => op1(X1,X0) != X1) & sorti1(X0))), 3.91/0.95 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 3.91/0.95 3.91/0.95 fof(f13,plain,( 3.91/0.95 ? [X0] : (! [X1] : (op1(X1,X0) != X1 | ~sorti1(X1)) & sorti1(X0))), 3.91/0.95 inference(ennf_transformation,[],[f6])). 3.91/0.95 3.91/0.95 fof(f17,plain,( 3.91/0.95 ? [X0] : (! [X1] : (op1(X1,X0) != X1 | ~sorti1(X1)) & sorti1(X0)) => (! [X1] : (op1(X1,sK1) != X1 | ~sorti1(X1)) & sorti1(sK1))), 3.91/0.95 introduced(choice_axiom,[])). 3.91/0.95 3.91/0.95 fof(f18,plain,( 3.91/0.95 ! [X1] : (op1(X1,sK1) != X1 | ~sorti1(X1)) & sorti1(sK1)), 3.91/0.95 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f13,f17])). 3.91/0.95 3.91/0.95 fof(f29,plain,( 3.91/0.95 sorti1(sK1)), 3.91/0.95 inference(cnf_transformation,[],[f18])). 3.91/0.95 3.91/0.95 fof(f2,conjecture,( 3.91/0.95 (! [X0] : (sorti1(X0) => sorti2(h(X0))) & ! [X1] : (sorti2(X1) => sorti1(j(X1)))) => ~(! [X6] : (sorti1(X6) => ! [X7] : (sorti1(X7) => op2(h(X6),h(X7)) = h(op1(X6,X7)))) & ! [X4] : (sorti2(X4) => ! [X5] : (sorti2(X5) => j(op2(X4,X5)) = op1(j(X4),j(X5)))) & ! [X3] : (sorti1(X3) => j(h(X3)) = X3) & ! [X2] : (sorti2(X2) => h(j(X2)) = X2))), 3.91/0.95 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 3.91/0.95 3.91/0.95 fof(f3,negated_conjecture,( 3.91/0.95 ~((! [X0] : (sorti1(X0) => sorti2(h(X0))) & ! [X1] : (sorti2(X1) => sorti1(j(X1)))) => ~(! [X6] : (sorti1(X6) => ! [X7] : (sorti1(X7) => op2(h(X6),h(X7)) = h(op1(X6,X7)))) & ! [X4] : (sorti2(X4) => ! [X5] : (sorti2(X5) => j(op2(X4,X5)) = op1(j(X4),j(X5)))) & ! [X3] : (sorti1(X3) => j(h(X3)) = X3) & ! [X2] : (sorti2(X2) => h(j(X2)) = X2)))), 3.91/0.95 inference(negated_conjecture,[],[f2])). 3.91/0.95 3.91/0.95 fof(f7,plain,( 3.91/0.95 ~((! [X0] : (sorti1(X0) => sorti2(h(X0))) & ! [X1] : (sorti2(X1) => sorti1(j(X1)))) => ~(! [X2] : (sorti1(X2) => ! [X3] : (sorti1(X3) => op2(h(X2),h(X3)) = h(op1(X2,X3)))) & ! [X4] : (sorti2(X4) => ! [X5] : (sorti2(X5) => j(op2(X4,X5)) = op1(j(X4),j(X5)))) & ! [X6] : (sorti1(X6) => j(h(X6)) = X6) & ! [X7] : (sorti2(X7) => h(j(X7)) = X7)))), 3.91/0.95 inference(rectify,[],[f3])). 3.91/0.95 3.91/0.95 fof(f9,plain,( 3.91/0.95 (! [X2] : (! [X3] : (op2(h(X2),h(X3)) = h(op1(X2,X3)) | ~sorti1(X3)) | ~sorti1(X2)) & ! [X4] : (! [X5] : (j(op2(X4,X5)) = op1(j(X4),j(X5)) | ~sorti2(X5)) | ~sorti2(X4)) & ! [X6] : (j(h(X6)) = X6 | ~sorti1(X6)) & ! [X7] : (h(j(X7)) = X7 | ~sorti2(X7))) & (! [X0] : (sorti2(h(X0)) | ~sorti1(X0)) & ! [X1] : (sorti1(j(X1)) | ~sorti2(X1)))), 3.91/0.95 inference(ennf_transformation,[],[f7])). 3.91/0.95 3.91/0.95 fof(f10,plain,( 3.91/0.95 ! [X2] : (! [X3] : (op2(h(X2),h(X3)) = h(op1(X2,X3)) | ~sorti1(X3)) | ~sorti1(X2)) & ! [X4] : (! [X5] : (j(op2(X4,X5)) = op1(j(X4),j(X5)) | ~sorti2(X5)) | ~sorti2(X4)) & ! [X6] : (j(h(X6)) = X6 | ~sorti1(X6)) & ! [X7] : (h(j(X7)) = X7 | ~sorti2(X7)) & ! [X0] : (sorti2(h(X0)) | ~sorti1(X0)) & ! [X1] : (sorti1(j(X1)) | ~sorti2(X1))), 3.91/0.95 inference(flattening,[],[f9])). 3.91/0.95 3.91/0.95 fof(f16,plain,( 3.91/0.95 ! [X0] : (! [X1] : (op2(h(X0),h(X1)) = h(op1(X0,X1)) | ~sorti1(X1)) | ~sorti1(X0)) & ! [X2] : (! [X3] : (j(op2(X2,X3)) = op1(j(X2),j(X3)) | ~sorti2(X3)) | ~sorti2(X2)) & ! [X4] : (j(h(X4)) = X4 | ~sorti1(X4)) & ! [X5] : (h(j(X5)) = X5 | ~sorti2(X5)) & ! [X6] : (sorti2(h(X6)) | ~sorti1(X6)) & ! [X7] : (sorti1(j(X7)) | ~sorti2(X7))), 3.91/0.95 inference(rectify,[],[f10])). 3.91/0.95 3.91/0.95 fof(f22,plain,( 3.91/0.95 ( ! [X6] : (sorti2(h(X6)) | ~sorti1(X6)) )), 3.91/0.95 inference(cnf_transformation,[],[f16])). 3.91/0.95 3.91/0.95 fof(f1,axiom,( 3.91/0.95 ~? [X0] : (! [X1] : (sorti2(X1) => op2(X1,X0) != X1) & sorti2(X0))), 3.91/0.95 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 3.91/0.95 3.91/0.95 fof(f8,plain,( 3.91/0.95 ! [X0] : (? [X1] : (op2(X1,X0) = X1 & sorti2(X1)) | ~sorti2(X0))), 3.91/0.95 inference(ennf_transformation,[],[f1])). 3.91/0.95 3.91/0.95 fof(f14,plain,( 3.91/0.95 ! [X0] : (? [X1] : (op2(X1,X0) = X1 & sorti2(X1)) => (op2(sK0(X0),X0) = sK0(X0) & sorti2(sK0(X0))))), 3.91/0.95 introduced(choice_axiom,[])). 3.91/0.95 3.91/0.95 fof(f15,plain,( 3.91/0.95 ! [X0] : ((op2(sK0(X0),X0) = sK0(X0) & sorti2(sK0(X0))) | ~sorti2(X0))), 3.91/0.95 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f14])). 3.91/0.95 3.91/0.95 fof(f19,plain,( 3.91/0.95 ( ! [X0] : (sorti2(sK0(X0)) | ~sorti2(X0)) )), 3.91/0.95 inference(cnf_transformation,[],[f15])). 3.91/0.95 3.91/0.95 fof(f23,plain,( 3.91/0.95 ( ! [X5] : (h(j(X5)) = X5 | ~sorti2(X5)) )), 3.91/0.95 inference(cnf_transformation,[],[f16])). 3.91/0.95 3.91/0.95 fof(f25,plain,( 3.91/0.95 ( ! [X2,X3] : (j(op2(X2,X3)) = op1(j(X2),j(X3)) | ~sorti2(X3) | ~sorti2(X2)) )), 3.91/0.95 inference(cnf_transformation,[],[f16])). 3.91/0.95 3.91/0.95 fof(f24,plain,( 3.91/0.95 ( ! [X4] : (j(h(X4)) = X4 | ~sorti1(X4)) )), 3.91/0.95 inference(cnf_transformation,[],[f16])). 3.91/0.95 3.91/0.95 fof(f20,plain,( 3.91/0.95 ( ! [X0] : (op2(sK0(X0),X0) = sK0(X0) | ~sorti2(X0)) )), 3.91/0.95 inference(cnf_transformation,[],[f15])). 3.91/0.95 3.91/0.95 fof(f30,plain,( 3.91/0.95 ( ! [X1] : (op1(X1,sK1) != X1 | ~sorti1(X1)) )), 3.91/0.95 inference(cnf_transformation,[],[f18])). 3.91/0.95 3.91/0.95 fof(f21,plain,( 3.91/0.95 ( ! [X7] : (sorti1(j(X7)) | ~sorti2(X7)) )), 3.91/0.95 inference(cnf_transformation,[],[f16])). 3.91/0.95 3.91/0.95 cnf(c_11,plain, 3.91/0.95 ( sorti1(sK1) ), 3.91/0.95 inference(cnf_transformation,[],[f29]) ). 3.91/0.95 3.91/0.95 cnf(c_146,plain, 3.91/0.95 ( sorti1(sK1) ), 3.91/0.95 inference(subtyping,[status(esa)],[c_11]) ). 3.91/0.95 3.91/0.95 cnf(c_407,plain, 3.91/0.95 ( sorti1(sK1) = iProver_top ), 3.91/0.95 inference(predicate_to_equality,[status(thm)],[c_146]) ). 3.91/0.95 3.91/0.95 cnf(c_6,negated_conjecture, 3.91/0.95 ( ~ sorti1(X0) | sorti2(h(X0)) ), 3.91/0.95 inference(cnf_transformation,[],[f22]) ). 3.91/0.95 3.91/0.95 cnf(c_151,negated_conjecture, 3.91/0.95 ( ~ sorti1(X0_36) | sorti2(h(X0_36)) ), 3.91/0.95 inference(subtyping,[status(esa)],[c_6]) ). 3.91/0.95 3.91/0.95 cnf(c_402,plain, 3.91/0.95 ( sorti1(X0_36) != iProver_top | sorti2(h(X0_36)) = iProver_top ), 3.91/0.95 inference(predicate_to_equality,[status(thm)],[c_151]) ). 3.91/0.95 3.91/0.95 cnf(c_1,plain, 3.91/0.95 ( ~ sorti2(X0) | sorti2(sK0(X0)) ), 3.91/0.95 inference(cnf_transformation,[],[f19]) ). 3.91/0.95 3.91/0.95 cnf(c_156,plain, 3.91/0.95 ( ~ sorti2(X0_37) | sorti2(sK0(X0_37)) ), 3.91/0.95 inference(subtyping,[status(esa)],[c_1]) ). 3.91/0.95 3.91/0.95 cnf(c_397,plain, 3.91/0.95 ( sorti2(X0_37) != iProver_top | sorti2(sK0(X0_37)) = iProver_top ), 3.91/0.95 inference(predicate_to_equality,[status(thm)],[c_156]) ). 3.91/0.95 3.91/0.95 cnf(c_5,negated_conjecture, 3.91/0.95 ( ~ sorti2(X0) | h(j(X0)) = X0 ), 3.91/0.95 inference(cnf_transformation,[],[f23]) ). 3.91/0.95 3.91/0.95 cnf(c_152,negated_conjecture, 3.91/0.95 ( ~ sorti2(X0_37) | h(j(X0_37)) = X0_37 ), 3.91/0.95 inference(subtyping,[status(esa)],[c_5]) ). 3.91/0.95 3.91/0.95 cnf(c_401,plain, 3.91/0.95 ( h(j(X0_37)) = X0_37 | sorti2(X0_37) != iProver_top ), 3.91/0.95 inference(predicate_to_equality,[status(thm)],[c_152]) ). 3.91/0.95 3.91/0.95 cnf(c_1271,plain, 3.91/0.95 ( h(j(sK0(X0_37))) = sK0(X0_37) | sorti2(X0_37) != iProver_top ), 3.91/0.95 inference(superposition,[status(thm)],[c_397,c_401]) ). 3.91/0.95 3.91/0.95 cnf(c_1911,plain, 3.91/0.95 ( h(j(sK0(h(X0_36)))) = sK0(h(X0_36)) 3.91/0.95 | sorti1(X0_36) != iProver_top ), 3.91/0.95 inference(superposition,[status(thm)],[c_402,c_1271]) ). 3.91/0.95 3.91/0.95 cnf(c_2196,plain, 3.91/0.95 ( h(j(sK0(h(sK1)))) = sK0(h(sK1)) ), 3.91/0.95 inference(superposition,[status(thm)],[c_407,c_1911]) ). 3.91/0.95 3.91/0.95 cnf(c_3320,plain, 3.91/0.95 ( sorti1(j(sK0(h(sK1)))) != iProver_top 3.91/0.95 | sorti2(sK0(h(sK1))) = iProver_top ), 3.91/0.95 inference(superposition,[status(thm)],[c_2196,c_402]) ). 3.91/0.95 3.91/0.95 cnf(c_15,plain, 3.91/0.95 ( sorti1(X0) != iProver_top | sorti2(h(X0)) = iProver_top ), 3.91/0.95 inference(predicate_to_equality,[status(thm)],[c_6]) ). 3.91/0.95 3.91/0.95 cnf(c_17,plain, 3.91/0.95 ( sorti1(sK1) != iProver_top | sorti2(h(sK1)) = iProver_top ), 3.91/0.95 inference(instantiation,[status(thm)],[c_15]) ). 3.91/0.95 3.91/0.95 cnf(c_30,plain, 3.91/0.95 ( sorti1(sK1) = iProver_top ), 3.91/0.95 inference(predicate_to_equality,[status(thm)],[c_11]) ). 3.91/0.95 3.91/0.95 cnf(c_542,plain, 3.91/0.95 ( ~ sorti2(h(X0_36)) | sorti2(sK0(h(X0_36))) ), 3.91/0.95 inference(instantiation,[status(thm)],[c_156]) ). 3.91/0.95 3.91/0.95 cnf(c_543,plain, 3.91/0.95 ( sorti2(h(X0_36)) != iProver_top 3.91/0.95 | sorti2(sK0(h(X0_36))) = iProver_top ), 3.91/0.95 inference(predicate_to_equality,[status(thm)],[c_542]) ). 3.91/0.95 3.91/0.95 cnf(c_545,plain, 3.91/0.95 ( sorti2(h(sK1)) != iProver_top 3.91/0.95 | sorti2(sK0(h(sK1))) = iProver_top ), 3.91/0.95 inference(instantiation,[status(thm)],[c_543]) ). 3.91/0.95 3.91/0.95 cnf(c_4096,plain, 3.91/0.95 ( sorti2(sK0(h(sK1))) = iProver_top ), 3.91/0.95 inference(global_propositional_subsumption, 3.91/0.95 [status(thm)], 3.91/0.95 [c_3320,c_17,c_30,c_545]) ). 3.91/0.95 3.91/0.95 cnf(c_3,negated_conjecture, 3.91/0.95 ( ~ sorti2(X0) | ~ sorti2(X1) | j(op2(X1,X0)) = op1(j(X1),j(X0)) ), 3.91/0.95 inference(cnf_transformation,[],[f25]) ). 3.91/0.95 3.91/0.95 cnf(c_154,negated_conjecture, 3.91/0.95 ( ~ sorti2(X0_37) 3.91/0.95 | ~ sorti2(X1_37) 3.91/0.95 | j(op2(X1_37,X0_37)) = op1(j(X1_37),j(X0_37)) ), 3.91/0.95 inference(subtyping,[status(esa)],[c_3]) ). 3.91/0.95 3.91/0.95 cnf(c_399,plain, 3.91/0.95 ( j(op2(X0_37,X1_37)) = op1(j(X0_37),j(X1_37)) 3.91/0.95 | sorti2(X1_37) != iProver_top 3.91/0.95 | sorti2(X0_37) != iProver_top ), 3.91/0.95 inference(predicate_to_equality,[status(thm)],[c_154]) ). 3.91/0.95 3.91/0.95 cnf(c_4104,plain, 3.91/0.95 ( op1(j(sK0(h(sK1))),j(X0_37)) = j(op2(sK0(h(sK1)),X0_37)) 3.91/0.95 | sorti2(X0_37) != iProver_top ), 3.91/0.95 inference(superposition,[status(thm)],[c_4096,c_399]) ). 3.91/0.95 3.91/0.95 cnf(c_5959,plain, 3.91/0.95 ( op1(j(sK0(h(sK1))),j(h(X0_36))) = j(op2(sK0(h(sK1)),h(X0_36))) 3.91/0.95 | sorti1(X0_36) != iProver_top ), 3.91/0.95 inference(superposition,[status(thm)],[c_402,c_4104]) ). 3.91/0.95 3.91/0.95 cnf(c_6822,plain, 3.91/0.95 ( op1(j(sK0(h(sK1))),j(h(sK1))) = j(op2(sK0(h(sK1)),h(sK1))) ), 3.91/0.95 inference(superposition,[status(thm)],[c_407,c_5959]) ). 3.91/0.95 3.91/0.95 cnf(c_4,negated_conjecture, 3.91/0.95 ( ~ sorti1(X0) | j(h(X0)) = X0 ), 3.91/0.95 inference(cnf_transformation,[],[f24]) ). 3.91/0.95 3.91/0.95 cnf(c_153,negated_conjecture, 3.91/0.95 ( ~ sorti1(X0_36) | j(h(X0_36)) = X0_36 ), 3.91/0.95 inference(subtyping,[status(esa)],[c_4]) ). 3.91/0.95 3.91/0.95 cnf(c_400,plain, 3.91/0.95 ( j(h(X0_36)) = X0_36 | sorti1(X0_36) != iProver_top ), 3.91/0.95 inference(predicate_to_equality,[status(thm)],[c_153]) ). 3.91/0.95 3.91/0.95 cnf(c_1084,plain, 3.91/0.95 ( j(h(sK1)) = sK1 ), 3.91/0.95 inference(superposition,[status(thm)],[c_407,c_400]) ). 3.91/0.95 3.91/0.95 cnf(c_0,plain, 3.91/0.95 ( ~ sorti2(X0) | op2(sK0(X0),X0) = sK0(X0) ), 3.91/0.95 inference(cnf_transformation,[],[f20]) ). 3.91/0.95 3.91/0.95 cnf(c_157,plain, 3.91/0.95 ( ~ sorti2(X0_37) | op2(sK0(X0_37),X0_37) = sK0(X0_37) ), 3.91/0.95 inference(subtyping,[status(esa)],[c_0]) ). 3.91/0.95 3.91/0.95 cnf(c_396,plain, 3.91/0.95 ( op2(sK0(X0_37),X0_37) = sK0(X0_37) 3.91/0.95 | sorti2(X0_37) != iProver_top ), 3.91/0.95 inference(predicate_to_equality,[status(thm)],[c_157]) ). 3.91/0.95 3.91/0.95 cnf(c_1077,plain, 3.91/0.95 ( op2(sK0(h(X0_36)),h(X0_36)) = sK0(h(X0_36)) 3.91/0.95 | sorti1(X0_36) != iProver_top ), 3.91/0.95 inference(superposition,[status(thm)],[c_402,c_396]) ). 3.91/0.95 3.91/0.95 cnf(c_2696,plain, 3.91/0.95 ( op2(sK0(h(sK1)),h(sK1)) = sK0(h(sK1)) ), 3.91/0.95 inference(superposition,[status(thm)],[c_407,c_1077]) ). 3.91/0.95 3.91/0.95 cnf(c_6826,plain, 3.91/0.95 ( op1(j(sK0(h(sK1))),sK1) = j(sK0(h(sK1))) ), 3.91/0.95 inference(light_normalisation,[status(thm)],[c_6822,c_1084,c_2696]) ). 3.91/0.95 3.91/0.95 cnf(c_10,plain, 3.91/0.95 ( ~ sorti1(X0) | op1(X0,sK1) != X0 ), 3.91/0.95 inference(cnf_transformation,[],[f30]) ). 3.91/0.95 3.91/0.95 cnf(c_147,plain, 3.91/0.95 ( ~ sorti1(X0_36) | op1(X0_36,sK1) != X0_36 ), 3.91/0.95 inference(subtyping,[status(esa)],[c_10]) ). 3.91/0.95 3.91/0.95 cnf(c_702,plain, 3.91/0.95 ( ~ sorti1(j(sK0(h(X0_36)))) 3.91/0.95 | op1(j(sK0(h(X0_36))),sK1) != j(sK0(h(X0_36))) ), 3.91/0.95 inference(instantiation,[status(thm)],[c_147]) ). 3.91/0.95 3.91/0.95 cnf(c_704,plain, 3.91/0.95 ( ~ sorti1(j(sK0(h(sK1)))) 3.91/0.95 | op1(j(sK0(h(sK1))),sK1) != j(sK0(h(sK1))) ), 3.91/0.95 inference(instantiation,[status(thm)],[c_702]) ). 3.91/0.95 3.91/0.95 cnf(c_7,negated_conjecture, 3.91/0.95 ( sorti1(j(X0)) | ~ sorti2(X0) ), 3.91/0.95 inference(cnf_transformation,[],[f21]) ). 3.91/0.95 3.91/0.95 cnf(c_150,negated_conjecture, 3.91/0.95 ( sorti1(j(X0_37)) | ~ sorti2(X0_37) ), 3.91/0.95 inference(subtyping,[status(esa)],[c_7]) ). 3.91/0.95 3.91/0.95 cnf(c_433,plain, 3.91/0.95 ( sorti1(j(sK0(X0_37))) | ~ sorti2(sK0(X0_37)) ), 3.91/0.95 inference(instantiation,[status(thm)],[c_150]) ). 3.91/0.95 3.91/0.95 cnf(c_587,plain, 3.91/0.95 ( sorti1(j(sK0(h(X0_36)))) | ~ sorti2(sK0(h(X0_36))) ), 3.91/0.95 inference(instantiation,[status(thm)],[c_433]) ). 3.91/0.95 3.91/0.95 cnf(c_589,plain, 3.91/0.95 ( sorti1(j(sK0(h(sK1)))) | ~ sorti2(sK0(h(sK1))) ), 3.91/0.95 inference(instantiation,[status(thm)],[c_587]) ). 3.91/0.95 3.91/0.95 cnf(c_544,plain, 3.91/0.95 ( ~ sorti2(h(sK1)) | sorti2(sK0(h(sK1))) ), 3.91/0.95 inference(instantiation,[status(thm)],[c_542]) ). 3.91/0.95 3.91/0.95 cnf(c_16,plain, 3.91/0.95 ( ~ sorti1(sK1) | sorti2(h(sK1)) ), 3.91/0.95 inference(instantiation,[status(thm)],[c_6]) ). 3.91/0.95 3.91/0.95 cnf(contradiction,plain, 3.91/0.95 ( $false ), 3.91/0.95 inference(minisat, 3.91/0.95 [status(thm)], 3.91/0.95 [c_6826,c_704,c_589,c_544,c_11,c_16]) ). 3.91/0.95 3.91/0.95 3.91/0.95 % SZS output end CNFRefutation for theBenchmark.p 3.91/0.95 3.91/0.95 ------ Statistics 3.91/0.95 3.91/0.95 ------ General 3.91/0.95 3.91/0.95 abstr_ref_over_cycles: 0 3.91/0.95 abstr_ref_under_cycles: 0 3.91/0.95 gc_basic_clause_elim: 0 3.91/0.95 forced_gc_time: 0 3.91/0.95 parsing_time: 0.011 3.91/0.95 unif_index_cands_time: 0. 3.91/0.95 unif_index_add_time: 0. 3.91/0.95 orderings_time: 0. 3.91/0.95 out_proof_time: 0.011 3.91/0.95 total_time: 0.295 3.91/0.95 num_of_symbols: 44 3.91/0.95 num_of_terms: 12620 3.91/0.95 3.91/0.95 ------ Preprocessing 3.91/0.95 3.91/0.95 num_of_splits: 0 3.91/0.95 num_of_split_atoms: 0 3.91/0.95 num_of_reused_defs: 0 3.91/0.95 num_eq_ax_congr_red: 2 3.91/0.95 num_of_sem_filtered_clauses: 1 3.91/0.95 num_of_subtypes: 2 3.91/0.95 monotx_restored_types: 0 3.91/0.95 sat_num_of_epr_types: 0 3.91/0.95 sat_num_of_non_cyclic_types: 0 3.91/0.95 sat_guarded_non_collapsed_types: 2 3.91/0.95 num_pure_diseq_elim: 0 3.91/0.95 simp_replaced_by: 0 3.91/0.95 res_preprocessed: 57 3.91/0.95 prep_upred: 0 3.91/0.95 prep_unflattend: 0 3.91/0.95 smt_new_axioms: 0 3.91/0.95 pred_elim_cands: 2 3.91/0.95 pred_elim: 0 3.91/0.95 pred_elim_cl: 0 3.91/0.95 pred_elim_cycles: 1 3.91/0.95 merged_defs: 0 3.91/0.95 merged_defs_ncl: 0 3.91/0.95 bin_hyper_res: 0 3.91/0.95 prep_cycles: 3 3.91/0.95 pred_elim_time: 0. 3.91/0.95 splitting_time: 0. 3.91/0.95 sem_filter_time: 0. 3.91/0.95 monotx_time: 0. 3.91/0.95 subtype_inf_time: 0. 3.91/0.95 3.91/0.95 ------ Problem properties 3.91/0.95 3.91/0.95 clauses: 12 3.91/0.95 conjectures: 6 3.91/0.95 epr: 1 3.91/0.95 horn: 12 3.91/0.95 ground: 1 3.91/0.95 unary: 1 3.91/0.95 binary: 7 3.91/0.95 lits: 27 3.91/0.95 lits_eq: 6 3.91/0.95 fd_pure: 0 3.91/0.95 fd_pseudo: 0 3.91/0.95 fd_cond: 0 3.91/0.95 fd_pseudo_cond: 0 3.91/0.95 ac_symbols: 0 3.91/0.95 3.91/0.95 ------ Propositional Solver 3.91/0.95 3.91/0.95 prop_solver_calls: 27 3.91/0.95 prop_fast_solver_calls: 433 3.91/0.95 smt_solver_calls: 0 3.91/0.95 smt_fast_solver_calls: 0 3.91/0.95 prop_num_of_clauses: 4302 3.91/0.95 prop_preprocess_simplified: 7665 3.91/0.95 prop_fo_subsumed: 3 3.91/0.95 prop_solver_time: 0. 3.91/0.95 smt_solver_time: 0. 3.91/0.95 smt_fast_solver_time: 0. 3.91/0.95 prop_fast_solver_time: 0. 3.91/0.95 prop_unsat_core_time: 0. 3.91/0.95 3.91/0.95 ------ QBF 3.91/0.95 3.91/0.95 qbf_q_res: 0 3.91/0.95 qbf_num_tautologies: 0 3.91/0.95 qbf_prep_cycles: 0 3.91/0.95 3.91/0.95 ------ BMC1 3.91/0.95 3.91/0.95 bmc1_current_bound: -1 3.91/0.95 bmc1_last_solved_bound: -1 3.91/0.95 bmc1_unsat_core_size: -1 3.91/0.95 bmc1_unsat_core_parents_size: -1 3.91/0.95 bmc1_merge_next_fun: 0 3.91/0.95 bmc1_unsat_core_clauses_time: 0. 3.91/0.95 3.91/0.95 ------ Instantiation 3.91/0.95 3.91/0.95 inst_num_of_clauses: 938 3.91/0.95 inst_num_in_passive: 317 3.91/0.95 inst_num_in_active: 383 3.91/0.95 inst_num_in_unprocessed: 238 3.91/0.95 inst_num_of_loops: 420 3.91/0.95 inst_num_of_learning_restarts: 0 3.91/0.95 inst_num_moves_active_passive: 34 3.91/0.95 inst_lit_activity: 0 3.91/0.95 inst_lit_activity_moves: 1 3.91/0.95 inst_num_tautologies: 0 3.91/0.95 inst_num_prop_implied: 0 3.91/0.95 inst_num_existing_simplified: 0 3.91/0.95 inst_num_eq_res_simplified: 0 3.91/0.95 inst_num_child_elim: 0 3.91/0.95 inst_num_of_dismatching_blockings: 460 3.91/0.95 inst_num_of_non_proper_insts: 642 3.91/0.95 inst_num_of_duplicates: 0 3.91/0.95 inst_inst_num_from_inst_to_res: 0 3.91/0.95 inst_dismatching_checking_time: 0. 3.91/0.95 3.91/0.95 ------ Resolution 3.91/0.95 3.91/0.95 res_num_of_clauses: 0 3.91/0.95 res_num_in_passive: 0 3.91/0.95 res_num_in_active: 0 3.91/0.95 res_num_of_loops: 60 3.91/0.95 res_forward_subset_subsumed: 0 3.91/0.95 res_backward_subset_subsumed: 0 3.91/0.95 res_forward_subsumed: 0 3.91/0.95 res_backward_subsumed: 0 3.91/0.95 res_forward_subsumption_resolution: 0 3.91/0.95 res_backward_subsumption_resolution: 0 3.91/0.95 res_clause_to_clause_subsumption: 783 3.91/0.95 res_orphan_elimination: 0 3.91/0.95 res_tautology_del: 26 3.91/0.95 res_num_eq_res_simplified: 0 3.91/0.95 res_num_sel_changes: 0 3.91/0.95 res_moves_from_active_to_pass: 0 3.91/0.95 3.91/0.95 ------ Superposition 3.91/0.95 3.91/0.95 sup_time_total: 0. 3.91/0.95 sup_time_generating: 0. 3.91/0.95 sup_time_sim_full: 0. 3.91/0.95 sup_time_sim_immed: 0. 3.91/0.95 3.91/0.95 sup_num_of_clauses: 229 3.91/0.95 sup_num_in_active: 83 3.91/0.95 sup_num_in_passive: 146 3.91/0.95 sup_num_of_loops: 83 3.91/0.95 sup_fw_superposition: 244 3.91/0.95 sup_bw_superposition: 62 3.91/0.95 sup_immediate_simplified: 64 3.91/0.95 sup_given_eliminated: 0 3.91/0.95 comparisons_done: 0 3.91/0.95 comparisons_avoided: 0 3.91/0.95 3.91/0.95 ------ Simplifications 3.91/0.95 3.91/0.95 3.91/0.95 sim_fw_subset_subsumed: 2 3.91/0.95 sim_bw_subset_subsumed: 0 3.91/0.95 sim_fw_subsumed: 3 3.91/0.95 sim_bw_subsumed: 0 3.91/0.95 sim_fw_subsumption_res: 0 3.91/0.95 sim_bw_subsumption_res: 0 3.91/0.95 sim_tautology_del: 0 3.91/0.95 sim_eq_tautology_del: 52 3.91/0.95 sim_eq_res_simp: 0 3.91/0.95 sim_fw_demodulated: 4 3.91/0.95 sim_bw_demodulated: 1 3.91/0.95 sim_light_normalised: 57 3.91/0.95 sim_joinable_taut: 0 3.91/0.95 sim_joinable_simp: 0 3.91/0.95 sim_ac_normalised: 0 3.91/0.95 sim_smt_subsumption: 0 3.91/0.95 3.91/0.96 EOF