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.32 % Computer : n028.cluster.edu 0.10/0.32 % Model : x86_64 x86_64 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.32 % Memory : 8042.1875MB 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.32 % CPULimit : 960 0.10/0.32 % WCLimit : 120 0.10/0.32 % DateTime : Thu Jul 2 07:05:21 EDT 2020 0.10/0.32 % CPUTime : 0.10/0.32 % Running in FOF mode 2.81/0.96 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p 2.81/0.96 2.81/0.96 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 2.81/0.96 2.81/0.96 ------ iProver source info 2.81/0.96 2.81/0.96 git: date: 2020-06-30 10:37:57 +0100 2.81/0.96 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 2.81/0.96 git: non_committed_changes: false 2.81/0.96 git: last_make_outside_of_git: false 2.81/0.96 2.81/0.96 ------ 2.81/0.96 2.81/0.96 ------ Input Options 2.81/0.96 2.81/0.96 --out_options all 2.81/0.96 --tptp_safe_out true 2.81/0.96 --problem_path "" 2.81/0.96 --include_path "" 2.81/0.96 --clausifier res/vclausify_rel 2.81/0.96 --clausifier_options --mode clausify 2.81/0.96 --stdin false 2.81/0.96 --stats_out all 2.81/0.96 2.81/0.96 ------ General Options 2.81/0.96 2.81/0.96 --fof false 2.81/0.96 --time_out_real 125. 2.81/0.96 --time_out_virtual -1. 2.81/0.96 --symbol_type_check false 2.81/0.96 --clausify_out false 2.81/0.96 --sig_cnt_out false 2.81/0.96 --trig_cnt_out false 2.81/0.96 --trig_cnt_out_tolerance 1. 2.81/0.96 --trig_cnt_out_sk_spl false 2.81/0.96 --abstr_cl_out false 2.81/0.96 2.81/0.96 ------ Global Options 2.81/0.96 2.81/0.96 --schedule default 2.81/0.96 --add_important_lit false 2.81/0.96 --prop_solver_per_cl 1000 2.81/0.96 --min_unsat_core false 2.81/0.96 --soft_assumptions false 2.81/0.96 --soft_lemma_size 3 2.81/0.96 --prop_impl_unit_size 0 2.81/0.96 --prop_impl_unit [] 2.81/0.96 --share_sel_clauses true 2.81/0.96 --reset_solvers false 2.81/0.96 --bc_imp_inh [conj_cone] 2.81/0.96 --conj_cone_tolerance 3. 2.81/0.96 --extra_neg_conj none 2.81/0.96 --large_theory_mode true 2.81/0.96 --prolific_symb_bound 200 2.81/0.96 --lt_threshold 2000 2.81/0.96 --clause_weak_htbl true 2.81/0.96 --gc_record_bc_elim false 2.81/0.96 2.81/0.96 ------ Preprocessing Options 2.81/0.96 2.81/0.96 --preprocessing_flag true 2.81/0.96 --time_out_prep_mult 0.1 2.81/0.96 --splitting_mode input 2.81/0.96 --splitting_grd true 2.81/0.96 --splitting_cvd false 2.81/0.96 --splitting_cvd_svl false 2.81/0.96 --splitting_nvd 32 2.81/0.96 --sub_typing true 2.81/0.96 --prep_gs_sim true 2.81/0.96 --prep_unflatten true 2.81/0.96 --prep_res_sim true 2.81/0.96 --prep_upred true 2.81/0.96 --prep_sem_filter exhaustive 2.81/0.96 --prep_sem_filter_out false 2.81/0.96 --pred_elim true 2.81/0.96 --res_sim_input true 2.81/0.96 --eq_ax_congr_red true 2.81/0.96 --pure_diseq_elim true 2.81/0.96 --brand_transform false 2.81/0.96 --non_eq_to_eq false 2.81/0.96 --prep_def_merge true 2.81/0.96 --prep_def_merge_prop_impl false 2.81/0.96 --prep_def_merge_mbd true 2.81/0.96 --prep_def_merge_tr_red false 2.81/0.96 --prep_def_merge_tr_cl false 2.81/0.96 --smt_preprocessing true 2.81/0.96 --smt_ac_axioms fast 2.81/0.96 --preprocessed_out false 2.81/0.96 --preprocessed_stats false 2.81/0.96 2.81/0.96 ------ Abstraction refinement Options 2.81/0.96 2.81/0.96 --abstr_ref [] 2.81/0.96 --abstr_ref_prep false 2.81/0.96 --abstr_ref_until_sat false 2.81/0.96 --abstr_ref_sig_restrict funpre 2.81/0.96 --abstr_ref_af_restrict_to_split_sk false 2.81/0.96 --abstr_ref_under [] 2.81/0.96 2.81/0.96 ------ SAT Options 2.81/0.96 2.81/0.96 --sat_mode false 2.81/0.96 --sat_fm_restart_options "" 2.81/0.96 --sat_gr_def false 2.81/0.96 --sat_epr_types true 2.81/0.96 --sat_non_cyclic_types false 2.81/0.96 --sat_finite_models false 2.81/0.96 --sat_fm_lemmas false 2.81/0.96 --sat_fm_prep false 2.81/0.96 --sat_fm_uc_incr true 2.81/0.96 --sat_out_model small 2.81/0.96 --sat_out_clauses false 2.81/0.96 2.81/0.96 ------ QBF Options 2.81/0.96 2.81/0.96 --qbf_mode false 2.81/0.96 --qbf_elim_univ false 2.81/0.96 --qbf_dom_inst none 2.81/0.96 --qbf_dom_pre_inst false 2.81/0.96 --qbf_sk_in false 2.81/0.96 --qbf_pred_elim true 2.81/0.96 --qbf_split 512 2.81/0.96 2.81/0.96 ------ BMC1 Options 2.81/0.96 2.81/0.96 --bmc1_incremental false 2.81/0.96 --bmc1_axioms reachable_all 2.81/0.96 --bmc1_min_bound 0 2.81/0.96 --bmc1_max_bound -1 2.81/0.96 --bmc1_max_bound_default -1 2.81/0.96 --bmc1_symbol_reachability true 2.81/0.96 --bmc1_property_lemmas false 2.81/0.96 --bmc1_k_induction false 2.81/0.96 --bmc1_non_equiv_states false 2.81/0.96 --bmc1_deadlock false 2.81/0.96 --bmc1_ucm false 2.81/0.96 --bmc1_add_unsat_core none 2.81/0.96 --bmc1_unsat_core_children false 2.81/0.96 --bmc1_unsat_core_extrapolate_axioms false 2.81/0.96 --bmc1_out_stat full 2.81/0.96 --bmc1_ground_init false 2.81/0.96 --bmc1_pre_inst_next_state false 2.81/0.96 --bmc1_pre_inst_state false 2.81/0.96 --bmc1_pre_inst_reach_state false 2.81/0.96 --bmc1_out_unsat_core false 2.81/0.96 --bmc1_aig_witness_out false 2.81/0.96 --bmc1_verbose false 2.81/0.96 --bmc1_dump_clauses_tptp false 2.81/0.96 --bmc1_dump_unsat_core_tptp false 2.81/0.96 --bmc1_dump_file - 2.81/0.96 --bmc1_ucm_expand_uc_limit 128 2.81/0.96 --bmc1_ucm_n_expand_iterations 6 2.81/0.96 --bmc1_ucm_extend_mode 1 2.81/0.96 --bmc1_ucm_init_mode 2 2.81/0.96 --bmc1_ucm_cone_mode none 2.81/0.96 --bmc1_ucm_reduced_relation_type 0 2.81/0.96 --bmc1_ucm_relax_model 4 2.81/0.96 --bmc1_ucm_full_tr_after_sat true 2.81/0.96 --bmc1_ucm_expand_neg_assumptions false 2.81/0.96 --bmc1_ucm_layered_model none 2.81/0.96 --bmc1_ucm_max_lemma_size 10 2.81/0.96 2.81/0.96 ------ AIG Options 2.81/0.96 2.81/0.96 --aig_mode false 2.81/0.96 2.81/0.96 ------ Instantiation Options 2.81/0.96 2.81/0.96 --instantiation_flag true 2.81/0.96 --inst_sos_flag false 2.81/0.96 --inst_sos_phase true 2.81/0.96 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 2.81/0.96 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 2.81/0.96 --inst_lit_sel_side num_symb 2.81/0.96 --inst_solver_per_active 1400 2.81/0.96 --inst_solver_calls_frac 1. 2.81/0.96 --inst_passive_queue_type priority_queues 2.81/0.96 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 2.81/0.96 --inst_passive_queues_freq [25;2] 2.81/0.96 --inst_dismatching true 2.81/0.96 --inst_eager_unprocessed_to_passive true 2.81/0.96 --inst_prop_sim_given true 2.81/0.96 --inst_prop_sim_new false 2.81/0.96 --inst_subs_new false 2.81/0.96 --inst_eq_res_simp false 2.81/0.96 --inst_subs_given false 2.81/0.96 --inst_orphan_elimination true 2.81/0.96 --inst_learning_loop_flag true 2.81/0.96 --inst_learning_start 3000 2.81/0.96 --inst_learning_factor 2 2.81/0.96 --inst_start_prop_sim_after_learn 3 2.81/0.96 --inst_sel_renew solver 2.81/0.96 --inst_lit_activity_flag true 2.81/0.96 --inst_restr_to_given false 2.81/0.96 --inst_activity_threshold 500 2.81/0.96 --inst_out_proof true 2.81/0.96 2.81/0.96 ------ Resolution Options 2.81/0.96 2.81/0.96 --resolution_flag true 2.81/0.96 --res_lit_sel adaptive 2.81/0.96 --res_lit_sel_side none 2.81/0.96 --res_ordering kbo 2.81/0.96 --res_to_prop_solver active 2.81/0.96 --res_prop_simpl_new false 2.81/0.96 --res_prop_simpl_given true 2.81/0.96 --res_passive_queue_type priority_queues 2.81/0.96 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 2.81/0.96 --res_passive_queues_freq [15;5] 2.81/0.96 --res_forward_subs full 2.81/0.96 --res_backward_subs full 2.81/0.96 --res_forward_subs_resolution true 2.81/0.96 --res_backward_subs_resolution true 2.81/0.96 --res_orphan_elimination true 2.81/0.96 --res_time_limit 2. 2.81/0.96 --res_out_proof true 2.81/0.96 2.81/0.96 ------ Superposition Options 2.81/0.96 2.81/0.96 --superposition_flag true 2.81/0.96 --sup_passive_queue_type priority_queues 2.81/0.96 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 2.81/0.96 --sup_passive_queues_freq [8;1;4] 2.81/0.96 --demod_completeness_check fast 2.81/0.96 --demod_use_ground true 2.81/0.96 --sup_to_prop_solver passive 2.81/0.96 --sup_prop_simpl_new true 2.81/0.96 --sup_prop_simpl_given true 2.81/0.96 --sup_fun_splitting false 2.81/0.96 --sup_smt_interval 50000 2.81/0.96 2.81/0.96 ------ Superposition Simplification Setup 2.81/0.96 2.81/0.96 --sup_indices_passive [] 2.81/0.96 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 2.81/0.96 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 2.81/0.96 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 2.81/0.96 --sup_full_triv [TrivRules;PropSubs] 2.81/0.96 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 2.81/0.96 --sup_full_bw [BwDemod] 2.81/0.96 --sup_immed_triv [TrivRules] 2.81/0.96 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 2.81/0.96 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 2.81/0.96 --sup_immed_bw_main [] 2.81/0.96 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 2.81/0.96 --sup_input_triv [Unflattening;TrivRules] 2.81/0.96 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 2.81/0.96 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 2.81/0.96 2.81/0.96 ------ Combination Options 2.81/0.96 2.81/0.96 --comb_res_mult 3 2.81/0.96 --comb_sup_mult 2 2.81/0.96 --comb_inst_mult 10 2.81/0.96 2.81/0.96 ------ Debug Options 2.81/0.96 2.81/0.96 --dbg_backtrace false 2.81/0.96 --dbg_dump_prop_clauses false 2.81/0.96 --dbg_dump_prop_clauses_file - 2.81/0.96 --dbg_out_stat false 2.81/0.96 ------ Parsing... 2.81/0.96 ------ Clausification by vclausify_rel & Parsing by iProver... 2.81/0.96 2.81/0.96 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 1 0s sf_e pe_s pe_e 2.81/0.96 2.81/0.96 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 2.81/0.96 2.81/0.96 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 2.81/0.96 ------ Proving... 2.81/0.96 ------ Problem Properties 2.81/0.96 2.81/0.96 2.81/0.96 clauses 89 2.81/0.96 conjectures 5 2.81/0.96 EPR 47 2.81/0.96 Horn 71 2.81/0.96 unary 13 2.81/0.96 binary 45 2.81/0.96 lits 207 2.81/0.96 lits eq 10 2.81/0.96 fd_pure 0 2.81/0.96 fd_pseudo 0 2.81/0.96 fd_cond 0 2.81/0.96 fd_pseudo_cond 4 2.81/0.96 AC symbols 0 2.81/0.96 2.81/0.96 ------ Schedule dynamic 5 is on 2.81/0.96 2.81/0.96 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 2.81/0.96 2.81/0.96 2.81/0.96 ------ 2.81/0.96 Current options: 2.81/0.96 ------ 2.81/0.96 2.81/0.96 ------ Input Options 2.81/0.96 2.81/0.96 --out_options all 2.81/0.96 --tptp_safe_out true 2.81/0.96 --problem_path "" 2.81/0.96 --include_path "" 2.81/0.96 --clausifier res/vclausify_rel 2.81/0.96 --clausifier_options --mode clausify 2.81/0.96 --stdin false 2.81/0.96 --stats_out all 2.81/0.96 2.81/0.96 ------ General Options 2.81/0.96 2.81/0.96 --fof false 2.81/0.96 --time_out_real 125. 2.81/0.96 --time_out_virtual -1. 2.81/0.96 --symbol_type_check false 2.81/0.96 --clausify_out false 2.81/0.96 --sig_cnt_out false 2.81/0.96 --trig_cnt_out false 2.81/0.96 --trig_cnt_out_tolerance 1. 2.81/0.96 --trig_cnt_out_sk_spl false 2.81/0.96 --abstr_cl_out false 2.81/0.96 2.81/0.96 ------ Global Options 2.81/0.96 2.81/0.96 --schedule default 2.81/0.96 --add_important_lit false 2.81/0.96 --prop_solver_per_cl 1000 2.81/0.96 --min_unsat_core false 2.81/0.96 --soft_assumptions false 2.81/0.96 --soft_lemma_size 3 2.81/0.96 --prop_impl_unit_size 0 2.81/0.96 --prop_impl_unit [] 2.81/0.96 --share_sel_clauses true 2.81/0.96 --reset_solvers false 2.81/0.96 --bc_imp_inh [conj_cone] 2.81/0.96 --conj_cone_tolerance 3. 2.81/0.96 --extra_neg_conj none 2.81/0.96 --large_theory_mode true 2.81/0.96 --prolific_symb_bound 200 2.81/0.96 --lt_threshold 2000 2.81/0.96 --clause_weak_htbl true 2.81/0.96 --gc_record_bc_elim false 2.81/0.96 2.81/0.96 ------ Preprocessing Options 2.81/0.96 2.81/0.96 --preprocessing_flag true 2.81/0.96 --time_out_prep_mult 0.1 2.81/0.96 --splitting_mode input 2.81/0.96 --splitting_grd true 2.81/0.96 --splitting_cvd false 2.81/0.96 --splitting_cvd_svl false 2.81/0.96 --splitting_nvd 32 2.81/0.96 --sub_typing true 2.81/0.96 --prep_gs_sim true 2.81/0.96 --prep_unflatten true 2.81/0.96 --prep_res_sim true 2.81/0.96 --prep_upred true 2.81/0.96 --prep_sem_filter exhaustive 2.81/0.96 --prep_sem_filter_out false 2.81/0.96 --pred_elim true 2.81/0.96 --res_sim_input true 2.81/0.96 --eq_ax_congr_red true 2.81/0.96 --pure_diseq_elim true 2.81/0.96 --brand_transform false 2.81/0.96 --non_eq_to_eq false 2.81/0.96 --prep_def_merge true 2.81/0.96 --prep_def_merge_prop_impl false 2.81/0.96 --prep_def_merge_mbd true 2.81/0.96 --prep_def_merge_tr_red false 2.81/0.96 --prep_def_merge_tr_cl false 2.81/0.96 --smt_preprocessing true 2.81/0.96 --smt_ac_axioms fast 2.81/0.96 --preprocessed_out false 2.81/0.96 --preprocessed_stats false 2.81/0.96 2.81/0.96 ------ Abstraction refinement Options 2.81/0.96 2.81/0.96 --abstr_ref [] 2.81/0.96 --abstr_ref_prep false 2.81/0.96 --abstr_ref_until_sat false 2.81/0.96 --abstr_ref_sig_restrict funpre 2.81/0.96 --abstr_ref_af_restrict_to_split_sk false 2.81/0.96 --abstr_ref_under [] 2.81/0.96 2.81/0.96 ------ SAT Options 2.81/0.96 2.81/0.96 --sat_mode false 2.81/0.96 --sat_fm_restart_options "" 2.81/0.96 --sat_gr_def false 2.81/0.96 --sat_epr_types true 2.81/0.96 --sat_non_cyclic_types false 2.81/0.96 --sat_finite_models false 2.81/0.96 --sat_fm_lemmas false 2.81/0.96 --sat_fm_prep false 2.81/0.96 --sat_fm_uc_incr true 2.81/0.96 --sat_out_model small 2.81/0.96 --sat_out_clauses false 2.81/0.96 2.81/0.96 ------ QBF Options 2.81/0.96 2.81/0.96 --qbf_mode false 2.81/0.96 --qbf_elim_univ false 2.81/0.96 --qbf_dom_inst none 2.81/0.96 --qbf_dom_pre_inst false 2.81/0.96 --qbf_sk_in false 2.81/0.96 --qbf_pred_elim true 2.81/0.96 --qbf_split 512 2.81/0.96 2.81/0.96 ------ BMC1 Options 2.81/0.96 2.81/0.96 --bmc1_incremental false 2.81/0.96 --bmc1_axioms reachable_all 2.81/0.96 --bmc1_min_bound 0 2.81/0.96 --bmc1_max_bound -1 2.81/0.96 --bmc1_max_bound_default -1 2.81/0.96 --bmc1_symbol_reachability true 2.81/0.96 --bmc1_property_lemmas false 2.81/0.96 --bmc1_k_induction false 2.81/0.96 --bmc1_non_equiv_states false 2.81/0.96 --bmc1_deadlock false 2.81/0.96 --bmc1_ucm false 2.81/0.96 --bmc1_add_unsat_core none 2.81/0.96 --bmc1_unsat_core_children false 2.81/0.96 --bmc1_unsat_core_extrapolate_axioms false 2.81/0.96 --bmc1_out_stat full 2.81/0.96 --bmc1_ground_init false 2.81/0.96 --bmc1_pre_inst_next_state false 2.81/0.96 --bmc1_pre_inst_state false 2.81/0.96 --bmc1_pre_inst_reach_state false 2.81/0.96 --bmc1_out_unsat_core false 2.81/0.96 --bmc1_aig_witness_out false 2.81/0.96 --bmc1_verbose false 2.81/0.96 --bmc1_dump_clauses_tptp false 2.81/0.96 --bmc1_dump_unsat_core_tptp false 2.81/0.96 --bmc1_dump_file - 2.81/0.96 --bmc1_ucm_expand_uc_limit 128 2.81/0.96 --bmc1_ucm_n_expand_iterations 6 2.81/0.96 --bmc1_ucm_extend_mode 1 2.81/0.96 --bmc1_ucm_init_mode 2 2.81/0.96 --bmc1_ucm_cone_mode none 2.81/0.96 --bmc1_ucm_reduced_relation_type 0 2.81/0.96 --bmc1_ucm_relax_model 4 2.81/0.96 --bmc1_ucm_full_tr_after_sat true 2.81/0.96 --bmc1_ucm_expand_neg_assumptions false 2.81/0.96 --bmc1_ucm_layered_model none 2.81/0.96 --bmc1_ucm_max_lemma_size 10 2.81/0.96 2.81/0.96 ------ AIG Options 2.81/0.96 2.81/0.96 --aig_mode false 2.81/0.96 2.81/0.96 ------ Instantiation Options 2.81/0.96 2.81/0.96 --instantiation_flag true 2.81/0.96 --inst_sos_flag false 2.81/0.96 --inst_sos_phase true 2.81/0.96 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 2.81/0.96 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 2.81/0.96 --inst_lit_sel_side none 2.81/0.96 --inst_solver_per_active 1400 2.81/0.96 --inst_solver_calls_frac 1. 2.81/0.96 --inst_passive_queue_type priority_queues 2.81/0.96 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 2.81/0.96 --inst_passive_queues_freq [25;2] 2.81/0.96 --inst_dismatching true 2.81/0.96 --inst_eager_unprocessed_to_passive true 2.81/0.96 --inst_prop_sim_given true 2.81/0.96 --inst_prop_sim_new false 2.81/0.96 --inst_subs_new false 2.81/0.96 --inst_eq_res_simp false 2.81/0.96 --inst_subs_given false 2.81/0.96 --inst_orphan_elimination true 2.81/0.96 --inst_learning_loop_flag true 2.81/0.96 --inst_learning_start 3000 2.81/0.96 --inst_learning_factor 2 2.81/0.96 --inst_start_prop_sim_after_learn 3 2.81/0.96 --inst_sel_renew solver 2.81/0.96 --inst_lit_activity_flag true 2.81/0.96 --inst_restr_to_given false 2.81/0.96 --inst_activity_threshold 500 2.81/0.96 --inst_out_proof true 2.81/0.96 2.81/0.96 ------ Resolution Options 2.81/0.96 2.81/0.96 --resolution_flag false 2.81/0.96 --res_lit_sel adaptive 2.81/0.96 --res_lit_sel_side none 2.81/0.96 --res_ordering kbo 2.81/0.96 --res_to_prop_solver active 2.81/0.96 --res_prop_simpl_new false 2.81/0.96 --res_prop_simpl_given true 2.81/0.96 --res_passive_queue_type priority_queues 2.81/0.96 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 2.81/0.96 --res_passive_queues_freq [15;5] 2.81/0.96 --res_forward_subs full 2.81/0.96 --res_backward_subs full 2.81/0.96 --res_forward_subs_resolution true 2.81/0.96 --res_backward_subs_resolution true 2.81/0.96 --res_orphan_elimination true 2.81/0.96 --res_time_limit 2. 2.81/0.96 --res_out_proof true 2.81/0.96 2.81/0.96 ------ Superposition Options 2.81/0.96 2.81/0.96 --superposition_flag true 2.81/0.96 --sup_passive_queue_type priority_queues 2.81/0.96 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 2.81/0.96 --sup_passive_queues_freq [8;1;4] 2.81/0.96 --demod_completeness_check fast 2.81/0.96 --demod_use_ground true 2.81/0.96 --sup_to_prop_solver passive 2.81/0.96 --sup_prop_simpl_new true 2.81/0.96 --sup_prop_simpl_given true 2.81/0.96 --sup_fun_splitting false 2.81/0.96 --sup_smt_interval 50000 2.81/0.96 2.81/0.96 ------ Superposition Simplification Setup 2.81/0.96 2.81/0.96 --sup_indices_passive [] 2.81/0.96 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 2.81/0.96 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 2.81/0.96 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 2.81/0.96 --sup_full_triv [TrivRules;PropSubs] 2.81/0.96 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 2.81/0.96 --sup_full_bw [BwDemod] 2.81/0.96 --sup_immed_triv [TrivRules] 2.81/0.96 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 2.81/0.96 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 2.81/0.96 --sup_immed_bw_main [] 2.81/0.96 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 2.81/0.96 --sup_input_triv [Unflattening;TrivRules] 2.81/0.96 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 2.81/0.96 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 2.81/0.96 2.81/0.96 ------ Combination Options 2.81/0.96 2.81/0.96 --comb_res_mult 3 2.81/0.96 --comb_sup_mult 2 2.81/0.96 --comb_inst_mult 10 2.81/0.96 2.81/0.96 ------ Debug Options 2.81/0.96 2.81/0.96 --dbg_backtrace false 2.81/0.96 --dbg_dump_prop_clauses false 2.81/0.96 --dbg_dump_prop_clauses_file - 2.81/0.96 --dbg_out_stat false 2.81/0.96 2.81/0.96 2.81/0.96 2.81/0.96 2.81/0.96 ------ Proving... 2.81/0.96 2.81/0.96 2.81/0.96 % SZS status Theorem for theBenchmark.p 2.81/0.96 2.81/0.96 % SZS output start CNFRefutation for theBenchmark.p 2.81/0.96 2.81/0.96 fof(f17,axiom,( 2.81/0.96 ! [X41,X42,X43] : ((leaf_occ(X42,X41) & occurrence_of(X41,X43)) => ~? [X44] : min_precedes(X42,X44,X43))), 2.81/0.96 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 2.81/0.96 2.81/0.96 fof(f60,plain,( 2.81/0.96 ! [X0,X1,X2] : ((leaf_occ(X1,X0) & occurrence_of(X0,X2)) => ~? [X3] : min_precedes(X1,X3,X2))), 2.81/0.96 inference(rectify,[],[f17])). 2.81/0.96 2.81/0.96 fof(f101,plain,( 2.81/0.96 ! [X0,X1,X2] : (! [X3] : ~min_precedes(X1,X3,X2) | (~leaf_occ(X1,X0) | ~occurrence_of(X0,X2)))), 2.81/0.96 inference(ennf_transformation,[],[f60])). 2.81/0.96 2.81/0.96 fof(f102,plain,( 2.81/0.96 ! [X0,X1,X2] : (! [X3] : ~min_precedes(X1,X3,X2) | ~leaf_occ(X1,X0) | ~occurrence_of(X0,X2))), 2.81/0.96 inference(flattening,[],[f101])). 2.81/0.96 2.81/0.96 fof(f200,plain,( 2.81/0.96 ( ! [X2,X0,X3,X1] : (~min_precedes(X1,X3,X2) | ~leaf_occ(X1,X0) | ~occurrence_of(X0,X2)) )), 2.81/0.96 inference(cnf_transformation,[],[f102])). 2.81/0.96 2.81/0.96 fof(f125,plain,( 2.81/0.96 ! [X1,X0,X2] : ((? [X4] : (min_precedes(X1,X4,tptp0) & subactivity_occurrence(X4,X0) & occurrence_of(X4,tptp1)) & occurrence_of(X2,tptp2)) | ~sP0(X1,X0,X2))), 2.81/0.96 introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])])). 2.81/0.96 2.81/0.96 fof(f161,plain,( 2.81/0.96 ! [X1,X0,X2] : ((? [X4] : (min_precedes(X1,X4,tptp0) & subactivity_occurrence(X4,X0) & occurrence_of(X4,tptp1)) & occurrence_of(X2,tptp2)) | ~sP0(X1,X0,X2))), 2.81/0.96 inference(nnf_transformation,[],[f125])). 2.81/0.96 2.81/0.96 fof(f162,plain,( 2.81/0.96 ! [X0,X1,X2] : ((? [X3] : (min_precedes(X0,X3,tptp0) & subactivity_occurrence(X3,X1) & occurrence_of(X3,tptp1)) & occurrence_of(X2,tptp2)) | ~sP0(X0,X1,X2))), 2.81/0.96 inference(rectify,[],[f161])). 2.81/0.96 2.81/0.96 fof(f163,plain,( 2.81/0.96 ! [X1,X0] : (? [X3] : (min_precedes(X0,X3,tptp0) & subactivity_occurrence(X3,X1) & occurrence_of(X3,tptp1)) => (min_precedes(X0,sK16(X0,X1),tptp0) & subactivity_occurrence(sK16(X0,X1),X1) & occurrence_of(sK16(X0,X1),tptp1)))), 2.81/0.96 introduced(choice_axiom,[])). 2.81/0.96 2.81/0.96 fof(f164,plain,( 2.81/0.96 ! [X0,X1,X2] : (((min_precedes(X0,sK16(X0,X1),tptp0) & subactivity_occurrence(sK16(X0,X1),X1) & occurrence_of(sK16(X0,X1),tptp1)) & occurrence_of(X2,tptp2)) | ~sP0(X0,X1,X2))), 2.81/0.96 inference(skolemisation,[status(esa),new_symbols(skolem,[sK16])],[f162,f163])). 2.81/0.96 2.81/0.96 fof(f247,plain,( 2.81/0.96 ( ! [X2,X0,X1] : (min_precedes(X0,sK16(X0,X1),tptp0) | ~sP0(X0,X1,X2)) )), 2.81/0.96 inference(cnf_transformation,[],[f164])). 2.81/0.96 2.81/0.96 fof(f40,conjecture,( 2.81/0.96 ! [X87] : (occurrence_of(X87,tptp0) => ? [X88,X89] : (leaf_occ(X89,X87) & (occurrence_of(X89,tptp1) => ~? [X91] : (subactivity_occurrence(X91,X87) & min_precedes(X88,X91,tptp0) & occurrence_of(X91,tptp2))) & (occurrence_of(X89,tptp2) => ~? [X90] : (min_precedes(X88,X90,tptp0) & subactivity_occurrence(X90,X87) & occurrence_of(X90,tptp1)))))), 2.81/0.96 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 2.81/0.96 2.81/0.96 fof(f41,negated_conjecture,( 2.81/0.96 ~! [X87] : (occurrence_of(X87,tptp0) => ? [X88,X89] : (leaf_occ(X89,X87) & (occurrence_of(X89,tptp1) => ~? [X91] : (subactivity_occurrence(X91,X87) & min_precedes(X88,X91,tptp0) & occurrence_of(X91,tptp2))) & (occurrence_of(X89,tptp2) => ~? [X90] : (min_precedes(X88,X90,tptp0) & subactivity_occurrence(X90,X87) & occurrence_of(X90,tptp1)))))), 2.81/0.96 inference(negated_conjecture,[],[f40])). 2.81/0.96 2.81/0.96 fof(f75,plain,( 2.81/0.96 ~! [X0] : (occurrence_of(X0,tptp0) => ? [X1,X2] : (leaf_occ(X2,X0) & (occurrence_of(X2,tptp1) => ~? [X3] : (subactivity_occurrence(X3,X0) & min_precedes(X1,X3,tptp0) & occurrence_of(X3,tptp2))) & (occurrence_of(X2,tptp2) => ~? [X4] : (min_precedes(X1,X4,tptp0) & subactivity_occurrence(X4,X0) & occurrence_of(X4,tptp1)))))), 2.81/0.96 inference(rectify,[],[f41])). 2.81/0.96 2.81/0.96 fof(f119,plain,( 2.81/0.96 ? [X0] : (! [X1,X2] : (~leaf_occ(X2,X0) | (? [X3] : (subactivity_occurrence(X3,X0) & min_precedes(X1,X3,tptp0) & occurrence_of(X3,tptp2)) & occurrence_of(X2,tptp1)) | (? [X4] : (min_precedes(X1,X4,tptp0) & subactivity_occurrence(X4,X0) & occurrence_of(X4,tptp1)) & occurrence_of(X2,tptp2))) & occurrence_of(X0,tptp0))), 2.81/0.96 inference(ennf_transformation,[],[f75])). 2.81/0.96 2.81/0.96 fof(f126,plain,( 2.81/0.96 ? [X0] : (! [X1,X2] : (~leaf_occ(X2,X0) | (? [X3] : (subactivity_occurrence(X3,X0) & min_precedes(X1,X3,tptp0) & occurrence_of(X3,tptp2)) & occurrence_of(X2,tptp1)) | sP0(X1,X0,X2)) & occurrence_of(X0,tptp0))), 2.81/0.96 inference(definition_folding,[],[f119,f125])). 2.81/0.96 2.81/0.96 fof(f166,plain,( 2.81/0.96 ( ! [X0] : (! [X1] : (? [X3] : (subactivity_occurrence(X3,X0) & min_precedes(X1,X3,tptp0) & occurrence_of(X3,tptp2)) => (subactivity_occurrence(sK18(X1),X0) & min_precedes(X1,sK18(X1),tptp0) & occurrence_of(sK18(X1),tptp2)))) )), 2.81/0.96 introduced(choice_axiom,[])). 2.81/0.96 2.81/0.96 fof(f165,plain,( 2.81/0.96 ? [X0] : (! [X1,X2] : (~leaf_occ(X2,X0) | (? [X3] : (subactivity_occurrence(X3,X0) & min_precedes(X1,X3,tptp0) & occurrence_of(X3,tptp2)) & occurrence_of(X2,tptp1)) | sP0(X1,X0,X2)) & occurrence_of(X0,tptp0)) => (! [X2,X1] : (~leaf_occ(X2,sK17) | (? [X3] : (subactivity_occurrence(X3,sK17) & min_precedes(X1,X3,tptp0) & occurrence_of(X3,tptp2)) & occurrence_of(X2,tptp1)) | sP0(X1,sK17,X2)) & occurrence_of(sK17,tptp0))), 2.81/0.96 introduced(choice_axiom,[])). 2.81/0.96 2.81/0.96 fof(f167,plain,( 2.81/0.96 ! [X1,X2] : (~leaf_occ(X2,sK17) | ((subactivity_occurrence(sK18(X1),sK17) & min_precedes(X1,sK18(X1),tptp0) & occurrence_of(sK18(X1),tptp2)) & occurrence_of(X2,tptp1)) | sP0(X1,sK17,X2)) & occurrence_of(sK17,tptp0)), 2.81/0.96 inference(skolemisation,[status(esa),new_symbols(skolem,[sK17,sK18])],[f126,f166,f165])). 2.81/0.96 2.81/0.96 fof(f251,plain,( 2.81/0.96 ( ! [X2,X1] : (~leaf_occ(X2,sK17) | min_precedes(X1,sK18(X1),tptp0) | sP0(X1,sK17,X2)) )), 2.81/0.96 inference(cnf_transformation,[],[f167])). 2.81/0.96 2.81/0.96 fof(f37,axiom,( 2.81/0.96 ! [X79] : (occurrence_of(X79,tptp0) => ? [X80,X81,X82] : (root_occ(X80,X79) & occurrence_of(X81,tptp4) & (occurrence_of(X82,tptp2) | occurrence_of(X82,tptp1)) & leaf_occ(X82,X79) & next_subocc(X81,X82,tptp0) & next_subocc(X80,X81,tptp0) & occurrence_of(X80,tptp3)))), 2.81/0.96 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 2.81/0.96 2.81/0.96 fof(f73,plain,( 2.81/0.96 ! [X0] : (occurrence_of(X0,tptp0) => ? [X1,X2,X3] : (root_occ(X1,X0) & occurrence_of(X2,tptp4) & (occurrence_of(X3,tptp2) | occurrence_of(X3,tptp1)) & leaf_occ(X3,X0) & next_subocc(X2,X3,tptp0) & next_subocc(X1,X2,tptp0) & occurrence_of(X1,tptp3)))), 2.81/0.96 inference(rectify,[],[f37])). 2.81/0.96 2.81/0.96 fof(f116,plain,( 2.81/0.96 ! [X0] : (? [X1,X2,X3] : (root_occ(X1,X0) & occurrence_of(X2,tptp4) & (occurrence_of(X3,tptp2) | occurrence_of(X3,tptp1)) & leaf_occ(X3,X0) & next_subocc(X2,X3,tptp0) & next_subocc(X1,X2,tptp0) & occurrence_of(X1,tptp3)) | ~occurrence_of(X0,tptp0))), 2.81/0.96 inference(ennf_transformation,[],[f73])). 2.81/0.96 2.81/0.96 fof(f159,plain,( 2.81/0.96 ! [X0] : (? [X1,X2,X3] : (root_occ(X1,X0) & occurrence_of(X2,tptp4) & (occurrence_of(X3,tptp2) | occurrence_of(X3,tptp1)) & leaf_occ(X3,X0) & next_subocc(X2,X3,tptp0) & next_subocc(X1,X2,tptp0) & occurrence_of(X1,tptp3)) => (root_occ(sK13(X0),X0) & occurrence_of(sK14(X0),tptp4) & (occurrence_of(sK15(X0),tptp2) | occurrence_of(sK15(X0),tptp1)) & leaf_occ(sK15(X0),X0) & next_subocc(sK14(X0),sK15(X0),tptp0) & next_subocc(sK13(X0),sK14(X0),tptp0) & occurrence_of(sK13(X0),tptp3)))), 2.81/0.96 introduced(choice_axiom,[])). 2.81/0.96 2.81/0.96 fof(f160,plain,( 2.81/0.96 ! [X0] : ((root_occ(sK13(X0),X0) & occurrence_of(sK14(X0),tptp4) & (occurrence_of(sK15(X0),tptp2) | occurrence_of(sK15(X0),tptp1)) & leaf_occ(sK15(X0),X0) & next_subocc(sK14(X0),sK15(X0),tptp0) & next_subocc(sK13(X0),sK14(X0),tptp0) & occurrence_of(sK13(X0),tptp3)) | ~occurrence_of(X0,tptp0))), 2.81/0.96 inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14,sK15])],[f116,f159])). 2.81/0.96 2.81/0.96 fof(f238,plain,( 2.81/0.96 ( ! [X0] : (leaf_occ(sK15(X0),X0) | ~occurrence_of(X0,tptp0)) )), 2.81/0.96 inference(cnf_transformation,[],[f160])). 2.81/0.96 2.81/0.96 fof(f248,plain,( 2.81/0.96 occurrence_of(sK17,tptp0)), 2.81/0.96 inference(cnf_transformation,[],[f167])). 2.81/0.96 2.81/0.96 cnf(c_26,plain, 2.81/0.96 ( ~ min_precedes(X0,X1,X2) 2.81/0.96 | ~ leaf_occ(X0,X3) 2.81/0.96 | ~ occurrence_of(X3,X2) ), 2.81/0.96 inference(cnf_transformation,[],[f200]) ). 2.81/0.96 2.81/0.96 cnf(c_8869,plain, 2.81/0.96 ( ~ min_precedes(sK15(sK17),X0,X1) 2.81/0.96 | ~ leaf_occ(sK15(sK17),sK17) 2.81/0.96 | ~ occurrence_of(sK17,X1) ), 2.81/0.96 inference(instantiation,[status(thm)],[c_26]) ). 2.81/0.96 2.81/0.96 cnf(c_12813,plain, 2.81/0.96 ( ~ min_precedes(sK15(sK17),sK16(sK15(sK17),sK17),tptp0) 2.81/0.96 | ~ leaf_occ(sK15(sK17),sK17) 2.81/0.96 | ~ occurrence_of(sK17,tptp0) ), 2.81/0.96 inference(instantiation,[status(thm)],[c_8869]) ). 2.81/0.96 2.81/0.96 cnf(c_70,plain, 2.81/0.96 ( ~ sP0(X0,X1,X2) | min_precedes(X0,sK16(X0,X1),tptp0) ), 2.81/0.96 inference(cnf_transformation,[],[f247]) ). 2.81/0.96 2.81/0.96 cnf(c_10168,plain, 2.81/0.96 ( ~ sP0(X0,sK17,sK15(sK17)) 2.81/0.96 | min_precedes(X0,sK16(X0,sK17),tptp0) ), 2.81/0.96 inference(instantiation,[status(thm)],[c_70]) ). 2.81/0.96 2.81/0.96 cnf(c_12812,plain, 2.81/0.96 ( ~ sP0(sK15(sK17),sK17,sK15(sK17)) 2.81/0.96 | min_precedes(sK15(sK17),sK16(sK15(sK17),sK17),tptp0) ), 2.81/0.96 inference(instantiation,[status(thm)],[c_10168]) ). 2.81/0.96 2.81/0.96 cnf(c_75,negated_conjecture, 2.81/0.96 ( sP0(X0,sK17,X1) 2.81/0.96 | min_precedes(X0,sK18(X0),tptp0) 2.81/0.96 | ~ leaf_occ(X1,sK17) ), 2.81/0.96 inference(cnf_transformation,[],[f251]) ). 2.81/0.96 2.81/0.96 cnf(c_8874,plain, 2.81/0.96 ( sP0(X0,sK17,sK15(sK17)) 2.81/0.96 | min_precedes(X0,sK18(X0),tptp0) 2.81/0.96 | ~ leaf_occ(sK15(sK17),sK17) ), 2.81/0.96 inference(instantiation,[status(thm)],[c_75]) ). 2.81/0.96 2.81/0.96 cnf(c_9704,plain, 2.81/0.96 ( sP0(sK15(sK17),sK17,sK15(sK17)) 2.81/0.96 | min_precedes(sK15(sK17),sK18(sK15(sK17)),tptp0) 2.81/0.96 | ~ leaf_occ(sK15(sK17),sK17) ), 2.81/0.96 inference(instantiation,[status(thm)],[c_8874]) ). 2.81/0.96 2.81/0.96 cnf(c_9703,plain, 2.81/0.96 ( ~ min_precedes(sK15(sK17),sK18(sK15(sK17)),tptp0) 2.81/0.96 | ~ leaf_occ(sK15(sK17),sK17) 2.81/0.96 | ~ occurrence_of(sK17,tptp0) ), 2.81/0.96 inference(instantiation,[status(thm)],[c_8869]) ). 2.81/0.96 2.81/0.96 cnf(c_64,plain, 2.81/0.96 ( leaf_occ(sK15(X0),X0) | ~ occurrence_of(X0,tptp0) ), 2.81/0.96 inference(cnf_transformation,[],[f238]) ). 2.81/0.96 2.81/0.96 cnf(c_8563,plain, 2.81/0.96 ( leaf_occ(sK15(sK17),sK17) | ~ occurrence_of(sK17,tptp0) ), 2.81/0.96 inference(instantiation,[status(thm)],[c_64]) ). 2.81/0.96 2.81/0.96 cnf(c_78,negated_conjecture, 2.81/0.96 ( occurrence_of(sK17,tptp0) ), 2.81/0.96 inference(cnf_transformation,[],[f248]) ). 2.81/0.96 2.81/0.96 cnf(contradiction,plain, 2.81/0.96 ( $false ), 2.81/0.96 inference(minisat, 2.81/0.96 [status(thm)], 2.81/0.96 [c_12813,c_12812,c_9704,c_9703,c_8563,c_78]) ). 2.81/0.96 2.81/0.96 2.81/0.96 % SZS output end CNFRefutation for theBenchmark.p 2.81/0.96 2.81/0.96 ------ Statistics 2.81/0.96 2.81/0.96 ------ General 2.81/0.96 2.81/0.96 abstr_ref_over_cycles: 0 2.81/0.96 abstr_ref_under_cycles: 0 2.81/0.96 gc_basic_clause_elim: 0 2.81/0.96 forced_gc_time: 0 2.81/0.96 parsing_time: 0.011 2.81/0.96 unif_index_cands_time: 0. 2.81/0.96 unif_index_add_time: 0. 2.81/0.96 orderings_time: 0. 2.81/0.96 out_proof_time: 0.015 2.81/0.96 total_time: 0.351 2.81/0.96 num_of_symbols: 74 2.81/0.96 num_of_terms: 5755 2.81/0.96 2.81/0.96 ------ Preprocessing 2.81/0.96 2.81/0.96 num_of_splits: 0 2.81/0.96 num_of_split_atoms: 0 2.81/0.96 num_of_reused_defs: 0 2.81/0.96 num_eq_ax_congr_red: 143 2.81/0.96 num_of_sem_filtered_clauses: 1 2.81/0.96 num_of_subtypes: 0 2.81/0.96 monotx_restored_types: 0 2.81/0.96 sat_num_of_epr_types: 0 2.81/0.96 sat_num_of_non_cyclic_types: 0 2.81/0.96 sat_guarded_non_collapsed_types: 0 2.81/0.96 num_pure_diseq_elim: 0 2.81/0.96 simp_replaced_by: 0 2.81/0.96 res_preprocessed: 388 2.81/0.96 prep_upred: 0 2.81/0.96 prep_unflattend: 422 2.81/0.96 smt_new_axioms: 0 2.81/0.96 pred_elim_cands: 17 2.81/0.96 pred_elim: 1 2.81/0.96 pred_elim_cl: 1 2.81/0.96 pred_elim_cycles: 21 2.81/0.96 merged_defs: 0 2.81/0.96 merged_defs_ncl: 0 2.81/0.96 bin_hyper_res: 0 2.81/0.96 prep_cycles: 4 2.81/0.96 pred_elim_time: 0.077 2.81/0.96 splitting_time: 0. 2.81/0.96 sem_filter_time: 0. 2.81/0.96 monotx_time: 0. 2.81/0.96 subtype_inf_time: 0. 2.81/0.96 2.81/0.96 ------ Problem properties 2.81/0.96 2.81/0.96 clauses: 89 2.81/0.96 conjectures: 5 2.81/0.96 epr: 47 2.81/0.96 horn: 71 2.81/0.96 ground: 13 2.81/0.96 unary: 13 2.81/0.96 binary: 45 2.81/0.96 lits: 207 2.81/0.96 lits_eq: 10 2.81/0.96 fd_pure: 0 2.81/0.96 fd_pseudo: 0 2.81/0.96 fd_cond: 0 2.81/0.96 fd_pseudo_cond: 4 2.81/0.96 ac_symbols: 0 2.81/0.96 2.81/0.96 ------ Propositional Solver 2.81/0.96 2.81/0.96 prop_solver_calls: 26 2.81/0.96 prop_fast_solver_calls: 3027 2.81/0.96 smt_solver_calls: 0 2.81/0.96 smt_fast_solver_calls: 0 2.81/0.96 prop_num_of_clauses: 3021 2.81/0.96 prop_preprocess_simplified: 16214 2.81/0.96 prop_fo_subsumed: 23 2.81/0.96 prop_solver_time: 0. 2.81/0.96 smt_solver_time: 0. 2.81/0.96 smt_fast_solver_time: 0. 2.81/0.96 prop_fast_solver_time: 0. 2.81/0.96 prop_unsat_core_time: 0. 2.81/0.96 2.81/0.96 ------ QBF 2.81/0.96 2.81/0.96 qbf_q_res: 0 2.81/0.96 qbf_num_tautologies: 0 2.81/0.96 qbf_prep_cycles: 0 2.81/0.96 2.81/0.96 ------ BMC1 2.81/0.96 2.81/0.96 bmc1_current_bound: -1 2.81/0.96 bmc1_last_solved_bound: -1 2.81/0.96 bmc1_unsat_core_size: -1 2.81/0.96 bmc1_unsat_core_parents_size: -1 2.81/0.96 bmc1_merge_next_fun: 0 2.81/0.96 bmc1_unsat_core_clauses_time: 0. 2.81/0.96 2.81/0.96 ------ Instantiation 2.81/0.96 2.81/0.96 inst_num_of_clauses: 762 2.81/0.96 inst_num_in_passive: 292 2.81/0.96 inst_num_in_active: 432 2.81/0.96 inst_num_in_unprocessed: 37 2.81/0.96 inst_num_of_loops: 442 2.81/0.96 inst_num_of_learning_restarts: 0 2.81/0.96 inst_num_moves_active_passive: 7 2.81/0.96 inst_lit_activity: 0 2.81/0.96 inst_lit_activity_moves: 0 2.81/0.96 inst_num_tautologies: 0 2.81/0.96 inst_num_prop_implied: 0 2.81/0.96 inst_num_existing_simplified: 0 2.81/0.96 inst_num_eq_res_simplified: 0 2.81/0.96 inst_num_child_elim: 0 2.81/0.96 inst_num_of_dismatching_blockings: 29 2.81/0.96 inst_num_of_non_proper_insts: 531 2.81/0.96 inst_num_of_duplicates: 0 2.81/0.96 inst_inst_num_from_inst_to_res: 0 2.81/0.96 inst_dismatching_checking_time: 0. 2.81/0.96 2.81/0.96 ------ Resolution 2.81/0.96 2.81/0.96 res_num_of_clauses: 0 2.81/0.96 res_num_in_passive: 0 2.81/0.96 res_num_in_active: 0 2.81/0.96 res_num_of_loops: 392 2.81/0.96 res_forward_subset_subsumed: 38 2.81/0.96 res_backward_subset_subsumed: 0 2.81/0.96 res_forward_subsumed: 2 2.81/0.96 res_backward_subsumed: 0 2.81/0.96 res_forward_subsumption_resolution: 5 2.81/0.96 res_backward_subsumption_resolution: 0 2.81/0.96 res_clause_to_clause_subsumption: 514 2.81/0.96 res_orphan_elimination: 0 2.81/0.96 res_tautology_del: 39 2.81/0.96 res_num_eq_res_simplified: 0 2.81/0.96 res_num_sel_changes: 0 2.81/0.96 res_moves_from_active_to_pass: 0 2.81/0.96 2.81/0.96 ------ Superposition 2.81/0.96 2.81/0.96 sup_time_total: 0. 2.81/0.96 sup_time_generating: 0. 2.81/0.96 sup_time_sim_full: 0. 2.81/0.96 sup_time_sim_immed: 0. 2.81/0.96 2.81/0.96 sup_num_of_clauses: 181 2.81/0.96 sup_num_in_active: 88 2.81/0.96 sup_num_in_passive: 93 2.81/0.96 sup_num_of_loops: 88 2.81/0.96 sup_fw_superposition: 54 2.81/0.96 sup_bw_superposition: 57 2.81/0.96 sup_immediate_simplified: 8 2.81/0.96 sup_given_eliminated: 0 2.81/0.96 comparisons_done: 0 2.81/0.96 comparisons_avoided: 0 2.81/0.96 2.81/0.96 ------ Simplifications 2.81/0.96 2.81/0.96 2.81/0.96 sim_fw_subset_subsumed: 7 2.81/0.96 sim_bw_subset_subsumed: 1 2.81/0.96 sim_fw_subsumed: 1 2.81/0.96 sim_bw_subsumed: 0 2.81/0.96 sim_fw_subsumption_res: 3 2.81/0.96 sim_bw_subsumption_res: 0 2.81/0.96 sim_tautology_del: 6 2.81/0.96 sim_eq_tautology_del: 0 2.81/0.96 sim_eq_res_simp: 0 2.81/0.96 sim_fw_demodulated: 0 2.81/0.96 sim_bw_demodulated: 0 2.81/0.96 sim_light_normalised: 0 2.81/0.96 sim_joinable_taut: 0 2.81/0.96 sim_joinable_simp: 0 2.81/0.96 sim_ac_normalised: 0 2.81/0.96 sim_smt_subsumption: 0 2.81/0.96 2.81/0.97 EOF