0.08/0.67 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.68 % Command : iproveropt_run.sh %d %s 0.09/0.88 % Computer : n008.cluster.edu 0.09/0.88 % Model : x86_64 x86_64 0.09/0.88 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.88 % Memory : 8042.1875MB 0.09/0.88 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.88 % CPULimit : 960 0.09/0.88 % WCLimit : 120 0.09/0.88 % DateTime : Thu Jul 2 06:39:44 EDT 2020 0.09/0.88 % CPUTime : 0.09/0.89 % Running in FOF mode 2.89/1.52 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p 2.89/1.52 2.89/1.52 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 2.89/1.52 2.89/1.52 ------ iProver source info 2.89/1.52 2.89/1.52 git: date: 2020-06-30 10:37:57 +0100 2.89/1.52 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 2.89/1.52 git: non_committed_changes: false 2.89/1.52 git: last_make_outside_of_git: false 2.89/1.52 2.89/1.52 ------ 2.89/1.52 2.89/1.52 ------ Input Options 2.89/1.52 2.89/1.52 --out_options all 2.89/1.52 --tptp_safe_out true 2.89/1.52 --problem_path "" 2.89/1.52 --include_path "" 2.89/1.52 --clausifier res/vclausify_rel 2.89/1.52 --clausifier_options "" 2.89/1.52 --stdin false 2.89/1.52 --stats_out all 2.89/1.52 2.89/1.52 ------ General Options 2.89/1.52 2.89/1.52 --fof false 2.89/1.52 --time_out_real 125. 2.89/1.52 --time_out_virtual -1. 2.89/1.52 --symbol_type_check false 2.89/1.52 --clausify_out false 2.89/1.52 --sig_cnt_out false 2.89/1.52 --trig_cnt_out false 2.89/1.52 --trig_cnt_out_tolerance 1. 2.89/1.52 --trig_cnt_out_sk_spl false 2.89/1.52 --abstr_cl_out false 2.89/1.52 2.89/1.52 ------ Global Options 2.89/1.52 2.89/1.52 --schedule default 2.89/1.52 --add_important_lit false 2.89/1.52 --prop_solver_per_cl 1000 2.89/1.52 --min_unsat_core false 2.89/1.52 --soft_assumptions false 2.89/1.52 --soft_lemma_size 3 2.89/1.52 --prop_impl_unit_size 0 2.89/1.52 --prop_impl_unit [] 2.89/1.52 --share_sel_clauses true 2.89/1.52 --reset_solvers false 2.89/1.52 --bc_imp_inh [conj_cone] 2.89/1.52 --conj_cone_tolerance 3. 2.89/1.52 --extra_neg_conj none 2.89/1.52 --large_theory_mode true 2.89/1.52 --prolific_symb_bound 200 2.89/1.52 --lt_threshold 2000 2.89/1.52 --clause_weak_htbl true 2.89/1.52 --gc_record_bc_elim false 2.89/1.52 2.89/1.52 ------ Preprocessing Options 2.89/1.52 2.89/1.52 --preprocessing_flag true 2.89/1.52 --time_out_prep_mult 0.1 2.89/1.52 --splitting_mode input 2.89/1.52 --splitting_grd true 2.89/1.52 --splitting_cvd false 2.89/1.52 --splitting_cvd_svl false 2.89/1.52 --splitting_nvd 32 2.89/1.52 --sub_typing true 2.89/1.52 --prep_gs_sim true 2.89/1.52 --prep_unflatten true 2.89/1.52 --prep_res_sim true 2.89/1.52 --prep_upred true 2.89/1.52 --prep_sem_filter exhaustive 2.89/1.52 --prep_sem_filter_out false 2.89/1.52 --pred_elim true 2.89/1.52 --res_sim_input true 2.89/1.52 --eq_ax_congr_red true 2.89/1.52 --pure_diseq_elim true 2.89/1.52 --brand_transform false 2.89/1.52 --non_eq_to_eq false 2.89/1.52 --prep_def_merge true 2.89/1.52 --prep_def_merge_prop_impl false 2.89/1.52 --prep_def_merge_mbd true 2.89/1.52 --prep_def_merge_tr_red false 2.89/1.52 --prep_def_merge_tr_cl false 2.89/1.52 --smt_preprocessing true 2.89/1.52 --smt_ac_axioms fast 2.89/1.52 --preprocessed_out false 2.89/1.52 --preprocessed_stats false 2.89/1.52 2.89/1.52 ------ Abstraction refinement Options 2.89/1.52 2.89/1.52 --abstr_ref [] 2.89/1.52 --abstr_ref_prep false 2.89/1.52 --abstr_ref_until_sat false 2.89/1.52 --abstr_ref_sig_restrict funpre 2.89/1.52 --abstr_ref_af_restrict_to_split_sk false 2.89/1.52 --abstr_ref_under [] 2.89/1.52 2.89/1.52 ------ SAT Options 2.89/1.52 2.89/1.52 --sat_mode false 2.89/1.52 --sat_fm_restart_options "" 2.89/1.52 --sat_gr_def false 2.89/1.52 --sat_epr_types true 2.89/1.52 --sat_non_cyclic_types false 2.89/1.52 --sat_finite_models false 2.89/1.52 --sat_fm_lemmas false 2.89/1.52 --sat_fm_prep false 2.89/1.52 --sat_fm_uc_incr true 2.89/1.52 --sat_out_model small 2.89/1.52 --sat_out_clauses false 2.89/1.52 2.89/1.52 ------ QBF Options 2.89/1.52 2.89/1.52 --qbf_mode false 2.89/1.52 --qbf_elim_univ false 2.89/1.52 --qbf_dom_inst none 2.89/1.52 --qbf_dom_pre_inst false 2.89/1.52 --qbf_sk_in false 2.89/1.52 --qbf_pred_elim true 2.89/1.52 --qbf_split 512 2.89/1.52 2.89/1.52 ------ BMC1 Options 2.89/1.52 2.89/1.52 --bmc1_incremental false 2.89/1.52 --bmc1_axioms reachable_all 2.89/1.52 --bmc1_min_bound 0 2.89/1.52 --bmc1_max_bound -1 2.89/1.52 --bmc1_max_bound_default -1 2.89/1.52 --bmc1_symbol_reachability true 2.89/1.52 --bmc1_property_lemmas false 2.89/1.52 --bmc1_k_induction false 2.89/1.52 --bmc1_non_equiv_states false 2.89/1.52 --bmc1_deadlock false 2.89/1.52 --bmc1_ucm false 2.89/1.52 --bmc1_add_unsat_core none 2.89/1.52 --bmc1_unsat_core_children false 2.89/1.52 --bmc1_unsat_core_extrapolate_axioms false 2.89/1.52 --bmc1_out_stat full 2.89/1.52 --bmc1_ground_init false 2.89/1.52 --bmc1_pre_inst_next_state false 2.89/1.52 --bmc1_pre_inst_state false 2.89/1.52 --bmc1_pre_inst_reach_state false 2.89/1.52 --bmc1_out_unsat_core false 2.89/1.52 --bmc1_aig_witness_out false 2.89/1.52 --bmc1_verbose false 2.89/1.52 --bmc1_dump_clauses_tptp false 2.89/1.52 --bmc1_dump_unsat_core_tptp false 2.89/1.52 --bmc1_dump_file - 2.89/1.52 --bmc1_ucm_expand_uc_limit 128 2.89/1.52 --bmc1_ucm_n_expand_iterations 6 2.89/1.52 --bmc1_ucm_extend_mode 1 2.89/1.52 --bmc1_ucm_init_mode 2 2.89/1.52 --bmc1_ucm_cone_mode none 2.89/1.52 --bmc1_ucm_reduced_relation_type 0 2.89/1.52 --bmc1_ucm_relax_model 4 2.89/1.52 --bmc1_ucm_full_tr_after_sat true 2.89/1.52 --bmc1_ucm_expand_neg_assumptions false 2.89/1.52 --bmc1_ucm_layered_model none 2.89/1.52 --bmc1_ucm_max_lemma_size 10 2.89/1.52 2.89/1.52 ------ AIG Options 2.89/1.52 2.89/1.52 --aig_mode false 2.89/1.52 2.89/1.52 ------ Instantiation Options 2.89/1.52 2.89/1.52 --instantiation_flag true 2.89/1.52 --inst_sos_flag true 2.89/1.52 --inst_sos_phase true 2.89/1.52 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 2.89/1.52 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 2.89/1.52 --inst_lit_sel_side num_symb 2.89/1.52 --inst_solver_per_active 1400 2.89/1.52 --inst_solver_calls_frac 1. 2.89/1.52 --inst_passive_queue_type priority_queues 2.89/1.52 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 2.89/1.52 --inst_passive_queues_freq [25;2] 2.89/1.52 --inst_dismatching true 2.89/1.52 --inst_eager_unprocessed_to_passive true 2.89/1.52 --inst_prop_sim_given true 2.89/1.52 --inst_prop_sim_new false 2.89/1.52 --inst_subs_new false 2.89/1.52 --inst_eq_res_simp false 2.89/1.52 --inst_subs_given false 2.89/1.52 --inst_orphan_elimination true 2.89/1.52 --inst_learning_loop_flag true 2.89/1.52 --inst_learning_start 3000 2.89/1.52 --inst_learning_factor 2 2.89/1.52 --inst_start_prop_sim_after_learn 3 2.89/1.52 --inst_sel_renew solver 2.89/1.52 --inst_lit_activity_flag true 2.89/1.52 --inst_restr_to_given false 2.89/1.52 --inst_activity_threshold 500 2.89/1.52 --inst_out_proof true 2.89/1.52 2.89/1.52 ------ Resolution Options 2.89/1.52 2.89/1.52 --resolution_flag true 2.89/1.52 --res_lit_sel adaptive 2.89/1.52 --res_lit_sel_side none 2.89/1.52 --res_ordering kbo 2.89/1.52 --res_to_prop_solver active 2.89/1.52 --res_prop_simpl_new false 2.89/1.52 --res_prop_simpl_given true 2.89/1.52 --res_passive_queue_type priority_queues 2.89/1.52 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 2.89/1.52 --res_passive_queues_freq [15;5] 2.89/1.52 --res_forward_subs full 2.89/1.52 --res_backward_subs full 2.89/1.52 --res_forward_subs_resolution true 2.89/1.52 --res_backward_subs_resolution true 2.89/1.52 --res_orphan_elimination true 2.89/1.52 --res_time_limit 2. 2.89/1.52 --res_out_proof true 2.89/1.52 2.89/1.52 ------ Superposition Options 2.89/1.52 2.89/1.52 --superposition_flag true 2.89/1.52 --sup_passive_queue_type priority_queues 2.89/1.52 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 2.89/1.52 --sup_passive_queues_freq [8;1;4] 2.89/1.52 --demod_completeness_check fast 2.89/1.52 --demod_use_ground true 2.89/1.52 --sup_to_prop_solver passive 2.89/1.52 --sup_prop_simpl_new true 2.89/1.52 --sup_prop_simpl_given true 2.89/1.52 --sup_fun_splitting true 2.89/1.52 --sup_smt_interval 50000 2.89/1.52 2.89/1.52 ------ Superposition Simplification Setup 2.89/1.52 2.89/1.52 --sup_indices_passive [LightNormIndex;FwDemodIndex] 2.89/1.52 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 2.89/1.52 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 2.89/1.52 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 2.89/1.52 --sup_full_triv [TrivRules;PropSubs] 2.89/1.52 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 2.89/1.52 --sup_full_bw [BwDemod;BwSubsumption] 2.89/1.52 --sup_immed_triv [TrivRules] 2.89/1.52 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 2.89/1.52 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 2.89/1.52 --sup_immed_bw_main [] 2.89/1.52 --sup_immed_bw_immed [BwDemod;BwSubsumption] 2.89/1.52 --sup_input_triv [Unflattening;TrivRules] 2.89/1.52 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 2.89/1.52 --sup_input_bw [] 2.89/1.52 2.89/1.52 ------ Combination Options 2.89/1.52 2.89/1.52 --comb_res_mult 3 2.89/1.52 --comb_sup_mult 2 2.89/1.52 --comb_inst_mult 10 2.89/1.52 2.89/1.52 ------ Debug Options 2.89/1.52 2.89/1.52 --dbg_backtrace false 2.89/1.52 --dbg_dump_prop_clauses false 2.89/1.52 --dbg_dump_prop_clauses_file - 2.89/1.52 --dbg_out_stat false 2.89/1.52 ------ Parsing... 2.89/1.52 ------ Clausification by vclausify_rel & Parsing by iProver... 2.89/1.52 2.89/1.52 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e 2.89/1.52 2.89/1.52 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 2.89/1.52 ------ Proving... 2.89/1.52 ------ Problem Properties 2.89/1.52 2.89/1.52 2.89/1.52 clauses 91 2.89/1.52 conjectures 0 2.89/1.52 EPR 37 2.89/1.52 Horn 74 2.89/1.52 unary 13 2.89/1.52 binary 47 2.89/1.52 lits 220 2.89/1.52 lits eq 0 2.89/1.52 fd_pure 0 2.89/1.52 fd_pseudo 0 2.89/1.52 fd_cond 0 2.89/1.52 fd_pseudo_cond 0 2.89/1.52 AC symbols 0 2.89/1.52 2.89/1.52 ------ Schedule dynamic 5 is on 2.89/1.52 2.89/1.52 ------ no conjectures: strip conj schedule 2.89/1.52 2.89/1.52 ------ no equalities: superposition off 2.89/1.52 2.89/1.52 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10. 2.89/1.52 2.89/1.52 2.89/1.52 ------ 2.89/1.52 Current options: 2.89/1.52 ------ 2.89/1.52 2.89/1.52 ------ Input Options 2.89/1.52 2.89/1.52 --out_options all 2.89/1.52 --tptp_safe_out true 2.89/1.52 --problem_path "" 2.89/1.52 --include_path "" 2.89/1.52 --clausifier res/vclausify_rel 2.89/1.52 --clausifier_options "" 2.89/1.52 --stdin false 2.89/1.52 --stats_out all 2.89/1.52 2.89/1.52 ------ General Options 2.89/1.52 2.89/1.52 --fof false 2.89/1.52 --time_out_real 125. 2.89/1.52 --time_out_virtual -1. 2.89/1.52 --symbol_type_check false 2.89/1.52 --clausify_out false 2.89/1.52 --sig_cnt_out false 2.89/1.52 --trig_cnt_out false 2.89/1.52 --trig_cnt_out_tolerance 1. 2.89/1.52 --trig_cnt_out_sk_spl false 2.89/1.52 --abstr_cl_out false 2.89/1.52 2.89/1.52 ------ Global Options 2.89/1.52 2.89/1.52 --schedule default 2.89/1.52 --add_important_lit false 2.89/1.52 --prop_solver_per_cl 1000 2.89/1.52 --min_unsat_core false 2.89/1.52 --soft_assumptions false 2.89/1.52 --soft_lemma_size 3 2.89/1.52 --prop_impl_unit_size 0 2.89/1.52 --prop_impl_unit [] 2.89/1.52 --share_sel_clauses true 2.89/1.52 --reset_solvers false 2.89/1.52 --bc_imp_inh [conj_cone] 2.89/1.52 --conj_cone_tolerance 3. 2.89/1.52 --extra_neg_conj none 2.89/1.52 --large_theory_mode true 2.89/1.52 --prolific_symb_bound 200 2.89/1.52 --lt_threshold 2000 2.89/1.52 --clause_weak_htbl true 2.89/1.52 --gc_record_bc_elim false 2.89/1.52 2.89/1.52 ------ Preprocessing Options 2.89/1.52 2.89/1.52 --preprocessing_flag true 2.89/1.52 --time_out_prep_mult 0.1 2.89/1.52 --splitting_mode input 2.89/1.52 --splitting_grd true 2.89/1.52 --splitting_cvd false 2.89/1.52 --splitting_cvd_svl false 2.89/1.52 --splitting_nvd 32 2.89/1.52 --sub_typing true 2.89/1.52 --prep_gs_sim true 2.89/1.52 --prep_unflatten true 2.89/1.52 --prep_res_sim true 2.89/1.52 --prep_upred true 2.89/1.52 --prep_sem_filter exhaustive 2.89/1.52 --prep_sem_filter_out false 2.89/1.52 --pred_elim true 2.89/1.52 --res_sim_input true 2.89/1.52 --eq_ax_congr_red true 2.89/1.52 --pure_diseq_elim true 2.89/1.52 --brand_transform false 2.89/1.52 --non_eq_to_eq false 2.89/1.52 --prep_def_merge true 2.89/1.52 --prep_def_merge_prop_impl false 2.89/1.52 --prep_def_merge_mbd true 2.89/1.52 --prep_def_merge_tr_red false 2.89/1.52 --prep_def_merge_tr_cl false 2.89/1.52 --smt_preprocessing true 2.89/1.52 --smt_ac_axioms fast 2.89/1.52 --preprocessed_out false 2.89/1.52 --preprocessed_stats false 2.89/1.52 2.89/1.52 ------ Abstraction refinement Options 2.89/1.52 2.89/1.52 --abstr_ref [] 2.89/1.52 --abstr_ref_prep false 2.89/1.52 --abstr_ref_until_sat false 2.89/1.52 --abstr_ref_sig_restrict funpre 2.89/1.52 --abstr_ref_af_restrict_to_split_sk false 2.89/1.52 --abstr_ref_under [] 2.89/1.52 2.89/1.52 ------ SAT Options 2.89/1.52 2.89/1.52 --sat_mode false 2.89/1.52 --sat_fm_restart_options "" 2.89/1.52 --sat_gr_def false 2.89/1.52 --sat_epr_types true 2.89/1.52 --sat_non_cyclic_types false 2.89/1.52 --sat_finite_models false 2.89/1.52 --sat_fm_lemmas false 2.89/1.52 --sat_fm_prep false 2.89/1.52 --sat_fm_uc_incr true 2.89/1.52 --sat_out_model small 2.89/1.52 --sat_out_clauses false 2.89/1.52 2.89/1.52 ------ QBF Options 2.89/1.52 2.89/1.52 --qbf_mode false 2.89/1.52 --qbf_elim_univ false 2.89/1.52 --qbf_dom_inst none 2.89/1.52 --qbf_dom_pre_inst false 2.89/1.52 --qbf_sk_in false 2.89/1.52 --qbf_pred_elim true 2.89/1.52 --qbf_split 512 2.89/1.52 2.89/1.52 ------ BMC1 Options 2.89/1.52 2.89/1.52 --bmc1_incremental false 2.89/1.52 --bmc1_axioms reachable_all 2.89/1.52 --bmc1_min_bound 0 2.89/1.52 --bmc1_max_bound -1 2.89/1.52 --bmc1_max_bound_default -1 2.89/1.52 --bmc1_symbol_reachability true 2.89/1.52 --bmc1_property_lemmas false 2.89/1.52 --bmc1_k_induction false 2.89/1.52 --bmc1_non_equiv_states false 2.89/1.52 --bmc1_deadlock false 2.89/1.52 --bmc1_ucm false 2.89/1.52 --bmc1_add_unsat_core none 2.89/1.52 --bmc1_unsat_core_children false 2.89/1.52 --bmc1_unsat_core_extrapolate_axioms false 2.89/1.52 --bmc1_out_stat full 2.89/1.52 --bmc1_ground_init false 2.89/1.52 --bmc1_pre_inst_next_state false 2.89/1.52 --bmc1_pre_inst_state false 2.89/1.52 --bmc1_pre_inst_reach_state false 2.89/1.52 --bmc1_out_unsat_core false 2.89/1.52 --bmc1_aig_witness_out false 2.89/1.52 --bmc1_verbose false 2.89/1.52 --bmc1_dump_clauses_tptp false 2.89/1.52 --bmc1_dump_unsat_core_tptp false 2.89/1.52 --bmc1_dump_file - 2.89/1.52 --bmc1_ucm_expand_uc_limit 128 2.89/1.52 --bmc1_ucm_n_expand_iterations 6 2.89/1.52 --bmc1_ucm_extend_mode 1 2.89/1.52 --bmc1_ucm_init_mode 2 2.89/1.52 --bmc1_ucm_cone_mode none 2.89/1.52 --bmc1_ucm_reduced_relation_type 0 2.89/1.52 --bmc1_ucm_relax_model 4 2.89/1.52 --bmc1_ucm_full_tr_after_sat true 2.89/1.52 --bmc1_ucm_expand_neg_assumptions false 2.89/1.52 --bmc1_ucm_layered_model none 2.89/1.52 --bmc1_ucm_max_lemma_size 10 2.89/1.52 2.89/1.52 ------ AIG Options 2.89/1.52 2.89/1.52 --aig_mode false 2.89/1.52 2.89/1.52 ------ Instantiation Options 2.89/1.52 2.89/1.52 --instantiation_flag true 2.89/1.52 --inst_sos_flag true 2.89/1.52 --inst_sos_phase true 2.89/1.52 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 2.89/1.52 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 2.89/1.52 --inst_lit_sel_side none 2.89/1.52 --inst_solver_per_active 1400 2.89/1.52 --inst_solver_calls_frac 1. 2.89/1.52 --inst_passive_queue_type priority_queues 2.89/1.52 --inst_passive_queues [[-num_var];[+age;-num_symb]] 2.89/1.52 --inst_passive_queues_freq [25;2] 2.89/1.52 --inst_dismatching true 2.89/1.52 --inst_eager_unprocessed_to_passive true 2.89/1.52 --inst_prop_sim_given true 2.89/1.52 --inst_prop_sim_new false 2.89/1.52 --inst_subs_new false 2.89/1.52 --inst_eq_res_simp false 2.89/1.52 --inst_subs_given false 2.89/1.52 --inst_orphan_elimination true 2.89/1.52 --inst_learning_loop_flag true 2.89/1.52 --inst_learning_start 3000 2.89/1.52 --inst_learning_factor 2 2.89/1.52 --inst_start_prop_sim_after_learn 3 2.89/1.52 --inst_sel_renew solver 2.89/1.52 --inst_lit_activity_flag true 2.89/1.52 --inst_restr_to_given false 2.89/1.52 --inst_activity_threshold 500 2.89/1.52 --inst_out_proof true 2.89/1.52 2.89/1.52 ------ Resolution Options 2.89/1.52 2.89/1.52 --resolution_flag false 2.89/1.52 --res_lit_sel adaptive 2.89/1.52 --res_lit_sel_side none 2.89/1.52 --res_ordering kbo 2.89/1.52 --res_to_prop_solver active 2.89/1.52 --res_prop_simpl_new false 2.89/1.52 --res_prop_simpl_given true 2.89/1.52 --res_passive_queue_type priority_queues 2.89/1.52 --res_passive_queues [[-num_symb];[+age;-num_symb]] 2.89/1.52 --res_passive_queues_freq [15;5] 2.89/1.52 --res_forward_subs full 2.89/1.52 --res_backward_subs full 2.89/1.52 --res_forward_subs_resolution true 2.89/1.52 --res_backward_subs_resolution true 2.89/1.52 --res_orphan_elimination true 2.89/1.52 --res_time_limit 2. 2.89/1.52 --res_out_proof true 2.89/1.52 2.89/1.52 ------ Superposition Options 2.89/1.52 2.89/1.52 --superposition_flag false 2.89/1.52 --sup_passive_queue_type priority_queues 2.89/1.52 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 2.89/1.52 --sup_passive_queues_freq [8;1;4] 2.89/1.52 --demod_completeness_check fast 2.89/1.52 --demod_use_ground true 2.89/1.52 --sup_to_prop_solver passive 2.89/1.52 --sup_prop_simpl_new true 2.89/1.52 --sup_prop_simpl_given true 2.89/1.52 --sup_fun_splitting true 2.89/1.52 --sup_smt_interval 50000 2.89/1.52 2.89/1.52 ------ Superposition Simplification Setup 2.89/1.52 2.89/1.52 --sup_indices_passive [LightNormIndex;FwDemodIndex] 2.89/1.52 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 2.89/1.52 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 2.89/1.52 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 2.89/1.52 --sup_full_triv [TrivRules;PropSubs] 2.89/1.52 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 2.89/1.52 --sup_full_bw [BwDemod;BwSubsumption] 2.89/1.52 --sup_immed_triv [TrivRules] 2.89/1.52 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 2.89/1.52 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 2.89/1.52 --sup_immed_bw_main [] 2.89/1.52 --sup_immed_bw_immed [BwDemod;BwSubsumption] 2.89/1.52 --sup_input_triv [Unflattening;TrivRules] 2.89/1.52 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 2.89/1.52 --sup_input_bw [] 2.89/1.52 2.89/1.52 ------ Combination Options 2.89/1.52 2.89/1.52 --comb_res_mult 3 2.89/1.52 --comb_sup_mult 2 2.89/1.52 --comb_inst_mult 10 2.89/1.52 2.89/1.52 ------ Debug Options 2.89/1.52 2.89/1.52 --dbg_backtrace false 2.89/1.52 --dbg_dump_prop_clauses false 2.89/1.52 --dbg_dump_prop_clauses_file - 2.89/1.52 --dbg_out_stat false 2.89/1.52 2.89/1.52 2.89/1.52 2.89/1.52 2.89/1.52 ------ Proving... 2.89/1.52 2.89/1.52 2.89/1.52 % SZS status Theorem for theBenchmark.p 2.89/1.52 2.89/1.52 % SZS output start CNFRefutation for theBenchmark.p 2.89/1.52 2.89/1.52 fof(f4,axiom,( 2.89/1.52 ! [X0,X1] : (status(X0,X1,sca) <=> (~? [X3] : model(X3,X0) & ? [X4] : model(X4,X1)))), 2.89/1.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 2.89/1.52 2.89/1.52 fof(f38,plain,( 2.89/1.52 ! [X0,X1] : (status(X0,X1,sca) <=> (~? [X2] : model(X2,X0) & ? [X3] : model(X3,X1)))), 2.89/1.52 inference(rectify,[],[f4])). 2.89/1.52 2.89/1.52 fof(f70,plain,( 2.89/1.52 ! [X0,X1] : (status(X0,X1,sca) <=> (! [X2] : ~model(X2,X0) & ? [X3] : model(X3,X1)))), 2.89/1.52 inference(ennf_transformation,[],[f38])). 2.89/1.52 2.89/1.52 fof(f100,plain,( 2.89/1.52 ! [X0,X1] : ((status(X0,X1,sca) | (? [X2] : model(X2,X0) | ! [X3] : ~model(X3,X1))) & ((! [X2] : ~model(X2,X0) & ? [X3] : model(X3,X1)) | ~status(X0,X1,sca)))), 2.89/1.52 inference(nnf_transformation,[],[f70])). 2.89/1.52 2.89/1.52 fof(f101,plain,( 2.89/1.52 ! [X0,X1] : ((status(X0,X1,sca) | ? [X2] : model(X2,X0) | ! [X3] : ~model(X3,X1)) & ((! [X2] : ~model(X2,X0) & ? [X3] : model(X3,X1)) | ~status(X0,X1,sca)))), 2.89/1.52 inference(flattening,[],[f100])). 2.89/1.52 2.89/1.52 fof(f102,plain,( 2.89/1.52 ! [X0,X1] : ((status(X0,X1,sca) | ? [X2] : model(X2,X0) | ! [X3] : ~model(X3,X1)) & ((! [X4] : ~model(X4,X0) & ? [X5] : model(X5,X1)) | ~status(X0,X1,sca)))), 2.89/1.52 inference(rectify,[],[f101])). 2.89/1.52 2.89/1.52 fof(f104,plain,( 2.89/1.52 ! [X1] : (? [X5] : model(X5,X1) => model(sK9(X1),X1))), 2.89/1.52 introduced(choice_axiom,[])). 2.89/1.52 2.89/1.52 fof(f103,plain,( 2.89/1.52 ! [X0] : (? [X2] : model(X2,X0) => model(sK8(X0),X0))), 2.89/1.52 introduced(choice_axiom,[])). 2.89/1.52 2.89/1.52 fof(f105,plain,( 2.89/1.52 ! [X0,X1] : ((status(X0,X1,sca) | model(sK8(X0),X0) | ! [X3] : ~model(X3,X1)) & ((! [X4] : ~model(X4,X0) & model(sK9(X1),X1)) | ~status(X0,X1,sca)))), 2.89/1.52 inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9])],[f102,f104,f103])). 2.89/1.52 2.89/1.52 fof(f227,plain,( 2.89/1.52 ( ! [X4,X0,X1] : (~model(X4,X0) | ~status(X0,X1,sca)) )), 2.89/1.52 inference(cnf_transformation,[],[f105])). 2.89/1.52 2.89/1.52 fof(f6,axiom,( 2.89/1.52 ! [X0,X1] : (status(X0,X1,thm) <=> ! [X3] : (model(X3,X0) => model(X3,X1)))), 2.89/1.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 2.89/1.52 2.89/1.52 fof(f40,plain,( 2.89/1.52 ! [X0,X1] : (status(X0,X1,thm) <=> ! [X2] : (model(X2,X0) => model(X2,X1)))), 2.89/1.52 inference(rectify,[],[f6])). 2.89/1.52 2.89/1.52 fof(f71,plain,( 2.89/1.52 ! [X0,X1] : (status(X0,X1,thm) <=> ! [X2] : (model(X2,X1) | ~model(X2,X0)))), 2.89/1.52 inference(ennf_transformation,[],[f40])). 2.89/1.52 2.89/1.52 fof(f112,plain,( 2.89/1.52 ! [X0,X1] : ((status(X0,X1,thm) | ? [X2] : (~model(X2,X1) & model(X2,X0))) & (! [X2] : (model(X2,X1) | ~model(X2,X0)) | ~status(X0,X1,thm)))), 2.89/1.52 inference(nnf_transformation,[],[f71])). 2.89/1.52 2.89/1.52 fof(f113,plain,( 2.89/1.52 ! [X0,X1] : ((status(X0,X1,thm) | ? [X2] : (~model(X2,X1) & model(X2,X0))) & (! [X3] : (model(X3,X1) | ~model(X3,X0)) | ~status(X0,X1,thm)))), 2.89/1.52 inference(rectify,[],[f112])). 2.89/1.52 2.89/1.52 fof(f114,plain,( 2.89/1.52 ! [X1,X0] : (? [X2] : (~model(X2,X1) & model(X2,X0)) => (~model(sK12(X0,X1),X1) & model(sK12(X0,X1),X0)))), 2.89/1.52 introduced(choice_axiom,[])). 2.89/1.52 2.89/1.52 fof(f115,plain,( 2.89/1.52 ! [X0,X1] : ((status(X0,X1,thm) | (~model(sK12(X0,X1),X1) & model(sK12(X0,X1),X0))) & (! [X3] : (model(X3,X1) | ~model(X3,X0)) | ~status(X0,X1,thm)))), 2.89/1.52 inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f113,f114])). 2.89/1.52 2.89/1.52 fof(f235,plain,( 2.89/1.52 ( ! [X0,X1] : (status(X0,X1,thm) | model(sK12(X0,X1),X0)) )), 2.89/1.52 inference(cnf_transformation,[],[f115])). 2.89/1.52 2.89/1.52 fof(f25,axiom,( 2.89/1.52 ! [X8,X9] : (? [X0,X1] : (status(X0,X1,X9) & status(X0,X1,X8)) <=> mighta(X8,X9))), 2.89/1.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 2.89/1.52 2.89/1.52 fof(f59,plain,( 2.89/1.52 ! [X0,X1] : (? [X2,X3] : (status(X2,X3,X1) & status(X2,X3,X0)) <=> mighta(X0,X1))), 2.89/1.52 inference(rectify,[],[f25])). 2.89/1.52 2.89/1.52 fof(f68,plain,( 2.89/1.52 ! [X0,X1] : (? [X2,X3] : (status(X2,X3,X1) & status(X2,X3,X0)) => mighta(X0,X1))), 2.89/1.52 inference(unused_predicate_definition_removal,[],[f59])). 2.89/1.52 2.89/1.52 fof(f78,plain,( 2.89/1.52 ! [X0,X1] : (mighta(X0,X1) | ! [X2,X3] : (~status(X2,X3,X1) | ~status(X2,X3,X0)))), 2.89/1.52 inference(ennf_transformation,[],[f68])). 2.89/1.52 2.89/1.52 fof(f292,plain,( 2.89/1.52 ( ! [X2,X0,X3,X1] : (mighta(X0,X1) | ~status(X2,X3,X1) | ~status(X2,X3,X0)) )), 2.89/1.52 inference(cnf_transformation,[],[f78])). 2.89/1.52 2.89/1.52 fof(f33,conjecture,( 2.89/1.52 mighta(sca,thm)), 2.89/1.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 2.89/1.52 2.89/1.52 fof(f34,negated_conjecture,( 2.89/1.52 ~mighta(sca,thm)), 2.89/1.52 inference(negated_conjecture,[],[f33])). 2.89/1.52 2.89/1.52 fof(f67,plain,( 2.89/1.52 ~mighta(sca,thm)), 2.89/1.52 inference(flattening,[],[f34])). 2.89/1.52 2.89/1.52 fof(f306,plain,( 2.89/1.52 ~mighta(sca,thm)), 2.89/1.52 inference(cnf_transformation,[],[f67])). 2.89/1.52 2.89/1.52 fof(f20,axiom,( 2.89/1.52 ? [X6] : ! [X7] : ~model(X7,X6)), 2.89/1.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 2.89/1.52 2.89/1.52 fof(f54,plain,( 2.89/1.52 ? [X0] : ! [X1] : ~model(X1,X0)), 2.89/1.52 inference(rectify,[],[f20])). 2.89/1.52 2.89/1.52 fof(f191,plain,( 2.89/1.52 ? [X0] : ! [X1] : ~model(X1,X0) => ! [X1] : ~model(X1,sK41)), 2.89/1.52 introduced(choice_axiom,[])). 2.89/1.52 2.89/1.52 fof(f192,plain,( 2.89/1.52 ! [X1] : ~model(X1,sK41)), 2.89/1.52 inference(skolemisation,[status(esa),new_symbols(skolem,[sK41])],[f54,f191])). 2.89/1.52 2.89/1.52 fof(f286,plain,( 2.89/1.52 ( ! [X1] : (~model(X1,sK41)) )), 2.89/1.52 inference(cnf_transformation,[],[f192])). 2.89/1.52 2.89/1.52 fof(f228,plain,( 2.89/1.52 ( ! [X0,X3,X1] : (status(X0,X1,sca) | model(sK8(X0),X0) | ~model(X3,X1)) )), 2.89/1.52 inference(cnf_transformation,[],[f105])). 2.89/1.52 2.89/1.52 fof(f21,axiom,( 2.89/1.52 ? [X3,X0,X1] : (~model(X3,X1) & ? [X4] : model(X4,X1) & model(X3,X0))), 2.89/1.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 2.89/1.52 2.89/1.52 fof(f55,plain,( 2.89/1.52 ? [X0,X1,X2] : (~model(X0,X2) & ? [X3] : model(X3,X2) & model(X0,X1))), 2.89/1.52 inference(rectify,[],[f21])). 2.89/1.52 2.89/1.52 fof(f194,plain,( 2.89/1.52 ( ! [X2] : (? [X3] : model(X3,X2) => model(sK45,X2)) )), 2.89/1.52 introduced(choice_axiom,[])). 2.89/1.52 2.89/1.52 fof(f193,plain,( 2.89/1.52 ? [X0,X1,X2] : (~model(X0,X2) & ? [X3] : model(X3,X2) & model(X0,X1)) => (~model(sK42,sK44) & ? [X3] : model(X3,sK44) & model(sK42,sK43))), 2.89/1.52 introduced(choice_axiom,[])). 2.89/1.52 2.89/1.52 fof(f195,plain,( 2.89/1.52 ~model(sK42,sK44) & model(sK45,sK44) & model(sK42,sK43)), 2.89/1.52 inference(skolemisation,[status(esa),new_symbols(skolem,[sK42,sK43,sK44,sK45])],[f55,f194,f193])). 2.89/1.52 2.89/1.52 fof(f288,plain,( 2.89/1.52 model(sK45,sK44)), 2.89/1.52 inference(cnf_transformation,[],[f195])). 2.89/1.52 2.89/1.52 cnf(c_14,plain, 2.89/1.52 ( ~ status(X0,X1,sca) | ~ model(X2,X0) ), 2.89/1.52 inference(cnf_transformation,[],[f227]) ). 2.89/1.52 2.89/1.52 cnf(c_1955,plain, 2.89/1.52 ( ~ status(X0_110,X1_110,sca) | ~ model(X0_112,X0_110) ), 2.89/1.52 inference(subtyping,[status(esa)],[c_14]) ). 2.89/1.52 2.89/1.52 cnf(c_3830,plain, 2.89/1.52 ( ~ status(sK41,sK44,sca) | ~ model(X0_112,sK41) ), 2.89/1.52 inference(instantiation,[status(thm)],[c_1955]) ). 2.89/1.52 2.89/1.52 cnf(c_8531,plain, 2.89/1.52 ( ~ status(sK41,sK44,sca) | ~ model(sK12(sK41,sK44),sK41) ), 2.89/1.52 inference(instantiation,[status(thm)],[c_3830]) ). 2.89/1.52 2.89/1.52 cnf(c_22,plain, 2.89/1.52 ( status(X0,X1,thm) | model(sK12(X0,X1),X0) ), 2.89/1.52 inference(cnf_transformation,[],[f235]) ). 2.89/1.52 2.89/1.52 cnf(c_1947,plain, 2.89/1.52 ( status(X0_110,X1_110,thm) | model(sK12(X0_110,X1_110),X0_110) ), 2.89/1.52 inference(subtyping,[status(esa)],[c_22]) ). 2.89/1.52 2.89/1.52 cnf(c_5638,plain, 2.89/1.52 ( status(sK41,sK44,thm) | model(sK12(sK41,sK44),sK41) ), 2.89/1.52 inference(instantiation,[status(thm)],[c_1947]) ). 2.89/1.52 2.89/1.52 cnf(c_79,plain, 2.89/1.52 ( ~ status(X0,X1,X2) | ~ status(X0,X1,X3) | mighta(X3,X2) ), 2.89/1.52 inference(cnf_transformation,[],[f292]) ). 2.89/1.52 2.89/1.52 cnf(c_93,negated_conjecture, 2.89/1.52 ( ~ mighta(sca,thm) ), 2.89/1.52 inference(cnf_transformation,[],[f306]) ). 2.89/1.52 2.89/1.52 cnf(c_1139,plain, 2.89/1.52 ( ~ status(X0,X1,thm) | ~ status(X0,X1,sca) ), 2.89/1.52 inference(resolution,[status(thm)],[c_79,c_93]) ). 2.89/1.52 2.89/1.52 cnf(c_1879,plain, 2.89/1.52 ( ~ status(X0_110,X1_110,thm) | ~ status(X0_110,X1_110,sca) ), 2.89/1.52 inference(subtyping,[status(esa)],[c_1139]) ). 2.89/1.52 2.89/1.52 cnf(c_3827,plain, 2.89/1.52 ( ~ status(sK41,sK44,thm) | ~ status(sK41,sK44,sca) ), 2.89/1.52 inference(instantiation,[status(thm)],[c_1879]) ). 2.89/1.52 2.89/1.52 cnf(c_73,plain, 2.89/1.52 ( ~ model(X0,sK41) ), 2.89/1.52 inference(cnf_transformation,[],[f286]) ). 2.89/1.52 2.89/1.52 cnf(c_1896,plain, 2.89/1.52 ( ~ model(X0_112,sK41) ), 2.89/1.52 inference(subtyping,[status(esa)],[c_73]) ). 2.89/1.52 2.89/1.52 cnf(c_2860,plain, 2.89/1.52 ( ~ model(sK8(sK41),sK41) ), 2.89/1.52 inference(instantiation,[status(thm)],[c_1896]) ). 2.89/1.52 2.89/1.52 cnf(c_13,plain, 2.89/1.52 ( status(X0,X1,sca) | ~ model(X2,X1) | model(sK8(X0),X0) ), 2.89/1.52 inference(cnf_transformation,[],[f228]) ). 2.89/1.52 2.89/1.52 cnf(c_1956,plain, 2.89/1.52 ( status(X0_110,X1_110,sca) 2.89/1.52 | ~ model(X0_112,X1_110) 2.89/1.52 | model(sK8(X0_110),X0_110) ), 2.89/1.52 inference(subtyping,[status(esa)],[c_13]) ). 2.89/1.52 2.89/1.52 cnf(c_2278,plain, 2.89/1.52 ( status(X0_110,sK44,sca) 2.89/1.52 | model(sK8(X0_110),X0_110) 2.89/1.52 | ~ model(sK45,sK44) ), 2.89/1.52 inference(instantiation,[status(thm)],[c_1956]) ). 2.89/1.52 2.89/1.52 cnf(c_2553,plain, 2.89/1.52 ( status(sK41,sK44,sca) 2.89/1.52 | model(sK8(sK41),sK41) 2.89/1.52 | ~ model(sK45,sK44) ), 2.89/1.52 inference(instantiation,[status(thm)],[c_2278]) ). 2.89/1.52 2.89/1.52 cnf(c_75,plain, 2.89/1.52 ( model(sK45,sK44) ), 2.89/1.52 inference(cnf_transformation,[],[f288]) ). 2.89/1.52 2.89/1.52 cnf(contradiction,plain, 2.89/1.52 ( $false ), 2.89/1.52 inference(minisat, 2.89/1.52 [status(thm)], 2.89/1.52 [c_8531,c_5638,c_3827,c_2860,c_2553,c_75]) ). 2.89/1.52 2.89/1.52 2.89/1.52 % SZS output end CNFRefutation for theBenchmark.p 2.89/1.52 2.89/1.52 ------ Statistics 2.89/1.53 2.89/1.53 ------ General 2.89/1.53 2.89/1.53 abstr_ref_over_cycles: 0 2.89/1.53 abstr_ref_under_cycles: 0 2.89/1.53 gc_basic_clause_elim: 0 2.89/1.53 forced_gc_time: 0 2.89/1.53 parsing_time: 0.017 2.89/1.53 unif_index_cands_time: 0. 2.89/1.53 unif_index_add_time: 0. 2.89/1.53 orderings_time: 0. 2.89/1.53 out_proof_time: 0.018 2.89/1.53 total_time: 0.238 2.89/1.53 num_of_symbols: 113 2.89/1.53 num_of_terms: 4890 2.89/1.53 2.89/1.53 ------ Preprocessing 2.89/1.53 2.89/1.53 num_of_splits: 0 2.89/1.53 num_of_split_atoms: 0 2.89/1.53 num_of_reused_defs: 0 2.89/1.53 num_eq_ax_congr_red: 0 2.89/1.53 num_of_sem_filtered_clauses: 0 2.89/1.53 num_of_subtypes: 3 2.89/1.53 monotx_restored_types: 0 2.89/1.53 sat_num_of_epr_types: 0 2.89/1.53 sat_num_of_non_cyclic_types: 0 2.89/1.53 sat_guarded_non_collapsed_types: 0 2.89/1.53 num_pure_diseq_elim: 0 2.89/1.53 simp_replaced_by: 0 2.89/1.53 res_preprocessed: 183 2.89/1.53 prep_upred: 0 2.89/1.53 prep_unflattend: 0 2.89/1.53 smt_new_axioms: 0 2.89/1.53 pred_elim_cands: 2 2.89/1.53 pred_elim: 1 2.89/1.53 pred_elim_cl: 1 2.89/1.53 pred_elim_cycles: 3 2.89/1.53 merged_defs: 4 2.89/1.53 merged_defs_ncl: 0 2.89/1.53 bin_hyper_res: 4 2.89/1.53 prep_cycles: 2 2.89/1.53 pred_elim_time: 0.003 2.89/1.53 splitting_time: 0.001 2.89/1.53 sem_filter_time: 0. 2.89/1.53 monotx_time: 0. 2.89/1.53 subtype_inf_time: 0.001 2.89/1.53 2.89/1.53 ------ Problem properties 2.89/1.53 2.89/1.53 clauses: 91 2.89/1.53 conjectures: 0 2.89/1.53 epr: 37 2.89/1.53 horn: 74 2.89/1.53 ground: 12 2.89/1.53 unary: 13 2.89/1.53 binary: 47 2.89/1.53 lits: 220 2.89/1.53 lits_eq: 0 2.89/1.53 fd_pure: 0 2.89/1.53 fd_pseudo: 0 2.89/1.53 fd_cond: 0 2.89/1.53 fd_pseudo_cond: 0 2.89/1.53 ac_symbols: 0 2.89/1.53 2.89/1.53 ------ Propositional Solver 2.89/1.53 2.89/1.53 prop_solver_calls: 17 2.89/1.53 prop_fast_solver_calls: 890 2.89/1.53 smt_solver_calls: 0 2.89/1.53 smt_fast_solver_calls: 0 2.89/1.53 prop_num_of_clauses: 3613 2.89/1.53 prop_preprocess_simplified: 14231 2.89/1.53 prop_fo_subsumed: 0 2.89/1.53 prop_solver_time: 0. 2.89/1.53 smt_solver_time: 0. 2.89/1.53 smt_fast_solver_time: 0. 2.89/1.53 prop_fast_solver_time: 0. 2.89/1.53 prop_unsat_core_time: 0. 2.89/1.53 2.89/1.53 ------ QBF 2.89/1.53 2.89/1.53 qbf_q_res: 0 2.89/1.53 qbf_num_tautologies: 0 2.89/1.53 qbf_prep_cycles: 0 2.89/1.53 2.89/1.53 ------ BMC1 2.89/1.53 2.89/1.53 bmc1_current_bound: -1 2.89/1.53 bmc1_last_solved_bound: -1 2.89/1.53 bmc1_unsat_core_size: -1 2.89/1.53 bmc1_unsat_core_parents_size: -1 2.89/1.53 bmc1_merge_next_fun: 0 2.89/1.53 bmc1_unsat_core_clauses_time: 0. 2.89/1.53 2.89/1.53 ------ Instantiation 2.89/1.53 2.89/1.53 inst_num_of_clauses: 1147 2.89/1.53 inst_num_in_passive: 893 2.89/1.53 inst_num_in_active: 213 2.89/1.53 inst_num_in_unprocessed: 40 2.89/1.53 inst_num_of_loops: 252 2.89/1.53 inst_num_of_learning_restarts: 0 2.89/1.53 inst_num_moves_active_passive: 37 2.89/1.53 inst_lit_activity: 0 2.89/1.53 inst_lit_activity_moves: 0 2.89/1.53 inst_num_tautologies: 0 2.89/1.53 inst_num_prop_implied: 0 2.89/1.53 inst_num_existing_simplified: 0 2.89/1.53 inst_num_eq_res_simplified: 0 2.89/1.53 inst_num_child_elim: 0 2.89/1.53 inst_num_of_dismatching_blockings: 270 2.89/1.53 inst_num_of_non_proper_insts: 507 2.89/1.53 inst_num_of_duplicates: 0 2.89/1.53 inst_inst_num_from_inst_to_res: 0 2.89/1.53 inst_dismatching_checking_time: 0. 2.89/1.53 2.89/1.53 ------ Resolution 2.89/1.53 2.89/1.53 res_num_of_clauses: 0 2.89/1.53 res_num_in_passive: 0 2.89/1.53 res_num_in_active: 0 2.89/1.53 res_num_of_loops: 185 2.89/1.53 res_forward_subset_subsumed: 92 2.89/1.53 res_backward_subset_subsumed: 0 2.89/1.53 res_forward_subsumed: 0 2.89/1.53 res_backward_subsumed: 0 2.89/1.53 res_forward_subsumption_resolution: 0 2.89/1.53 res_backward_subsumption_resolution: 0 2.89/1.53 res_clause_to_clause_subsumption: 10 2.89/1.53 res_orphan_elimination: 0 2.89/1.53 res_tautology_del: 14 2.89/1.53 res_num_eq_res_simplified: 0 2.89/1.53 res_num_sel_changes: 0 2.89/1.53 res_moves_from_active_to_pass: 0 2.89/1.53 2.89/1.53 ------ Superposition 2.89/1.53 2.89/1.53 sup_time_total: 0. 2.89/1.53 sup_time_generating: 0. 2.89/1.53 sup_time_sim_full: 0. 2.89/1.53 sup_time_sim_immed: 0. 2.89/1.53 2.89/1.53 sup_num_of_clauses: 0 2.89/1.53 sup_num_in_active: 0 2.89/1.53 sup_num_in_passive: 0 2.89/1.53 sup_num_of_loops: 0 2.89/1.53 sup_fw_superposition: 0 2.89/1.53 sup_bw_superposition: 0 2.89/1.53 sup_immediate_simplified: 0 2.89/1.53 sup_given_eliminated: 0 2.89/1.53 comparisons_done: 0 2.89/1.53 comparisons_avoided: 0 2.89/1.53 2.89/1.53 ------ Simplifications 2.89/1.53 2.89/1.53 2.89/1.53 sim_fw_subset_subsumed: 0 2.89/1.53 sim_bw_subset_subsumed: 0 2.89/1.53 sim_fw_subsumed: 0 2.89/1.53 sim_bw_subsumed: 0 2.89/1.53 sim_fw_subsumption_res: 0 2.89/1.53 sim_bw_subsumption_res: 0 2.89/1.53 sim_tautology_del: 0 2.89/1.53 sim_eq_tautology_del: 0 2.89/1.53 sim_eq_res_simp: 0 2.89/1.53 sim_fw_demodulated: 0 2.89/1.53 sim_bw_demodulated: 0 2.89/1.53 sim_light_normalised: 0 2.89/1.53 sim_joinable_taut: 0 2.89/1.53 sim_joinable_simp: 0 2.89/1.53 sim_ac_normalised: 0 2.89/1.53 sim_smt_subsumption: 0 2.89/1.53 2.89/1.53 EOF