0.03/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.10 % Command : iproveropt_run.sh %d %s 0.10/0.30 % Computer : n010.cluster.edu 0.10/0.30 % Model : x86_64 x86_64 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.30 % Memory : 8042.1875MB 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.30 % CPULimit : 960 0.10/0.30 % WCLimit : 120 0.10/0.30 % DateTime : Thu Jul 2 07:13:57 EDT 2020 0.10/0.30 % CPUTime : 0.10/0.30 % Running in FOF mode 6.24/1.45 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p 6.24/1.45 6.24/1.45 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 6.24/1.45 6.24/1.45 ------ iProver source info 6.24/1.45 6.24/1.45 git: date: 2020-06-30 10:37:57 +0100 6.24/1.45 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 6.24/1.45 git: non_committed_changes: false 6.24/1.45 git: last_make_outside_of_git: false 6.24/1.45 6.24/1.45 ------ 6.24/1.45 6.24/1.45 ------ Input Options 6.24/1.45 6.24/1.45 --out_options all 6.24/1.45 --tptp_safe_out true 6.24/1.45 --problem_path "" 6.24/1.45 --include_path "" 6.24/1.45 --clausifier res/vclausify_rel 6.24/1.45 --clausifier_options --mode clausify 6.24/1.45 --stdin false 6.24/1.45 --stats_out all 6.24/1.45 6.24/1.45 ------ General Options 6.24/1.45 6.24/1.45 --fof false 6.24/1.45 --time_out_real 125. 6.24/1.45 --time_out_virtual -1. 6.24/1.45 --symbol_type_check false 6.24/1.45 --clausify_out false 6.24/1.45 --sig_cnt_out false 6.24/1.45 --trig_cnt_out false 6.24/1.45 --trig_cnt_out_tolerance 1. 6.24/1.45 --trig_cnt_out_sk_spl false 6.24/1.45 --abstr_cl_out false 6.24/1.45 6.24/1.45 ------ Global Options 6.24/1.45 6.24/1.45 --schedule default 6.24/1.45 --add_important_lit false 6.24/1.45 --prop_solver_per_cl 1000 6.24/1.45 --min_unsat_core false 6.24/1.45 --soft_assumptions false 6.24/1.45 --soft_lemma_size 3 6.24/1.45 --prop_impl_unit_size 0 6.24/1.45 --prop_impl_unit [] 6.24/1.45 --share_sel_clauses true 6.24/1.45 --reset_solvers false 6.24/1.45 --bc_imp_inh [conj_cone] 6.24/1.45 --conj_cone_tolerance 3. 6.24/1.45 --extra_neg_conj none 6.24/1.45 --large_theory_mode true 6.24/1.45 --prolific_symb_bound 200 6.24/1.45 --lt_threshold 2000 6.24/1.45 --clause_weak_htbl true 6.24/1.45 --gc_record_bc_elim false 6.24/1.45 6.24/1.45 ------ Preprocessing Options 6.24/1.45 6.24/1.45 --preprocessing_flag true 6.24/1.45 --time_out_prep_mult 0.1 6.24/1.45 --splitting_mode input 6.24/1.45 --splitting_grd true 6.24/1.45 --splitting_cvd false 6.24/1.45 --splitting_cvd_svl false 6.24/1.45 --splitting_nvd 32 6.24/1.45 --sub_typing true 6.24/1.45 --prep_gs_sim true 6.24/1.45 --prep_unflatten true 6.24/1.45 --prep_res_sim true 6.24/1.45 --prep_upred true 6.24/1.45 --prep_sem_filter exhaustive 6.24/1.45 --prep_sem_filter_out false 6.24/1.45 --pred_elim true 6.24/1.45 --res_sim_input true 6.24/1.45 --eq_ax_congr_red true 6.24/1.45 --pure_diseq_elim true 6.24/1.45 --brand_transform false 6.24/1.45 --non_eq_to_eq false 6.24/1.45 --prep_def_merge true 6.24/1.45 --prep_def_merge_prop_impl false 6.24/1.45 --prep_def_merge_mbd true 6.24/1.45 --prep_def_merge_tr_red false 6.24/1.45 --prep_def_merge_tr_cl false 6.24/1.45 --smt_preprocessing true 6.24/1.45 --smt_ac_axioms fast 6.24/1.45 --preprocessed_out false 6.24/1.45 --preprocessed_stats false 6.24/1.45 6.24/1.45 ------ Abstraction refinement Options 6.24/1.45 6.24/1.45 --abstr_ref [] 6.24/1.45 --abstr_ref_prep false 6.24/1.45 --abstr_ref_until_sat false 6.24/1.45 --abstr_ref_sig_restrict funpre 6.24/1.45 --abstr_ref_af_restrict_to_split_sk false 6.24/1.45 --abstr_ref_under [] 6.24/1.45 6.24/1.45 ------ SAT Options 6.24/1.45 6.24/1.45 --sat_mode false 6.24/1.45 --sat_fm_restart_options "" 6.24/1.45 --sat_gr_def false 6.24/1.45 --sat_epr_types true 6.24/1.45 --sat_non_cyclic_types false 6.24/1.45 --sat_finite_models false 6.24/1.45 --sat_fm_lemmas false 6.24/1.45 --sat_fm_prep false 6.24/1.45 --sat_fm_uc_incr true 6.24/1.45 --sat_out_model small 6.24/1.45 --sat_out_clauses false 6.24/1.45 6.24/1.45 ------ QBF Options 6.24/1.45 6.24/1.45 --qbf_mode false 6.24/1.45 --qbf_elim_univ false 6.24/1.45 --qbf_dom_inst none 6.24/1.45 --qbf_dom_pre_inst false 6.24/1.45 --qbf_sk_in false 6.24/1.45 --qbf_pred_elim true 6.24/1.45 --qbf_split 512 6.24/1.45 6.24/1.45 ------ BMC1 Options 6.24/1.45 6.24/1.45 --bmc1_incremental false 6.24/1.45 --bmc1_axioms reachable_all 6.24/1.45 --bmc1_min_bound 0 6.24/1.45 --bmc1_max_bound -1 6.24/1.45 --bmc1_max_bound_default -1 6.24/1.45 --bmc1_symbol_reachability true 6.24/1.45 --bmc1_property_lemmas false 6.24/1.45 --bmc1_k_induction false 6.24/1.45 --bmc1_non_equiv_states false 6.24/1.45 --bmc1_deadlock false 6.24/1.45 --bmc1_ucm false 6.24/1.45 --bmc1_add_unsat_core none 6.24/1.45 --bmc1_unsat_core_children false 6.24/1.45 --bmc1_unsat_core_extrapolate_axioms false 6.24/1.45 --bmc1_out_stat full 6.24/1.45 --bmc1_ground_init false 6.24/1.45 --bmc1_pre_inst_next_state false 6.24/1.45 --bmc1_pre_inst_state false 6.24/1.45 --bmc1_pre_inst_reach_state false 6.24/1.45 --bmc1_out_unsat_core false 6.24/1.45 --bmc1_aig_witness_out false 6.24/1.45 --bmc1_verbose false 6.24/1.45 --bmc1_dump_clauses_tptp false 6.24/1.45 --bmc1_dump_unsat_core_tptp false 6.24/1.45 --bmc1_dump_file - 6.24/1.45 --bmc1_ucm_expand_uc_limit 128 6.24/1.45 --bmc1_ucm_n_expand_iterations 6 6.24/1.45 --bmc1_ucm_extend_mode 1 6.24/1.45 --bmc1_ucm_init_mode 2 6.24/1.45 --bmc1_ucm_cone_mode none 6.24/1.45 --bmc1_ucm_reduced_relation_type 0 6.24/1.45 --bmc1_ucm_relax_model 4 6.24/1.45 --bmc1_ucm_full_tr_after_sat true 6.24/1.45 --bmc1_ucm_expand_neg_assumptions false 6.24/1.45 --bmc1_ucm_layered_model none 6.24/1.45 --bmc1_ucm_max_lemma_size 10 6.24/1.45 6.24/1.45 ------ AIG Options 6.24/1.45 6.24/1.45 --aig_mode false 6.24/1.45 6.24/1.45 ------ Instantiation Options 6.24/1.45 6.24/1.45 --instantiation_flag true 6.24/1.45 --inst_sos_flag false 6.24/1.45 --inst_sos_phase true 6.24/1.45 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 6.24/1.45 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 6.24/1.45 --inst_lit_sel_side num_symb 6.24/1.45 --inst_solver_per_active 1400 6.24/1.45 --inst_solver_calls_frac 1. 6.24/1.45 --inst_passive_queue_type priority_queues 6.24/1.45 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 6.24/1.45 --inst_passive_queues_freq [25;2] 6.24/1.45 --inst_dismatching true 6.24/1.45 --inst_eager_unprocessed_to_passive true 6.24/1.45 --inst_prop_sim_given true 6.24/1.45 --inst_prop_sim_new false 6.24/1.45 --inst_subs_new false 6.24/1.45 --inst_eq_res_simp false 6.24/1.45 --inst_subs_given false 6.24/1.45 --inst_orphan_elimination true 6.24/1.45 --inst_learning_loop_flag true 6.24/1.45 --inst_learning_start 3000 6.24/1.45 --inst_learning_factor 2 6.24/1.45 --inst_start_prop_sim_after_learn 3 6.24/1.45 --inst_sel_renew solver 6.24/1.45 --inst_lit_activity_flag true 6.24/1.45 --inst_restr_to_given false 6.24/1.45 --inst_activity_threshold 500 6.24/1.45 --inst_out_proof true 6.24/1.45 6.24/1.45 ------ Resolution Options 6.24/1.45 6.24/1.45 --resolution_flag true 6.24/1.45 --res_lit_sel adaptive 6.24/1.45 --res_lit_sel_side none 6.24/1.45 --res_ordering kbo 6.24/1.45 --res_to_prop_solver active 6.24/1.45 --res_prop_simpl_new false 6.24/1.45 --res_prop_simpl_given true 6.24/1.45 --res_passive_queue_type priority_queues 6.24/1.45 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 6.24/1.45 --res_passive_queues_freq [15;5] 6.24/1.45 --res_forward_subs full 6.24/1.45 --res_backward_subs full 6.24/1.45 --res_forward_subs_resolution true 6.24/1.45 --res_backward_subs_resolution true 6.24/1.45 --res_orphan_elimination true 6.24/1.45 --res_time_limit 2. 6.24/1.45 --res_out_proof true 6.24/1.45 6.24/1.45 ------ Superposition Options 6.24/1.45 6.24/1.45 --superposition_flag true 6.24/1.45 --sup_passive_queue_type priority_queues 6.24/1.45 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 6.24/1.45 --sup_passive_queues_freq [8;1;4] 6.24/1.45 --demod_completeness_check fast 6.24/1.45 --demod_use_ground true 6.24/1.45 --sup_to_prop_solver passive 6.24/1.45 --sup_prop_simpl_new true 6.24/1.45 --sup_prop_simpl_given true 6.24/1.45 --sup_fun_splitting false 6.24/1.45 --sup_smt_interval 50000 6.24/1.45 6.24/1.45 ------ Superposition Simplification Setup 6.24/1.45 6.24/1.45 --sup_indices_passive [] 6.24/1.45 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 6.24/1.45 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 6.24/1.45 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 6.24/1.45 --sup_full_triv [TrivRules;PropSubs] 6.24/1.45 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 6.24/1.45 --sup_full_bw [BwDemod] 6.24/1.45 --sup_immed_triv [TrivRules] 6.24/1.45 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 6.24/1.45 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 6.24/1.45 --sup_immed_bw_main [] 6.24/1.45 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 6.24/1.45 --sup_input_triv [Unflattening;TrivRules] 6.24/1.45 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 6.24/1.45 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 6.24/1.45 6.24/1.45 ------ Combination Options 6.24/1.45 6.24/1.45 --comb_res_mult 3 6.24/1.45 --comb_sup_mult 2 6.24/1.45 --comb_inst_mult 10 6.24/1.45 6.24/1.45 ------ Debug Options 6.24/1.45 6.24/1.45 --dbg_backtrace false 6.24/1.45 --dbg_dump_prop_clauses false 6.24/1.45 --dbg_dump_prop_clauses_file - 6.24/1.45 --dbg_out_stat false 6.24/1.45 ------ Parsing... 6.24/1.45 ------ Clausification by vclausify_rel & Parsing by iProver... 6.24/1.45 6.24/1.45 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sf_s rm: 12 0s sf_e pe_s pe_e 6.24/1.45 6.24/1.45 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 6.24/1.45 6.24/1.45 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 6.24/1.45 ------ Proving... 6.24/1.45 ------ Problem Properties 6.24/1.45 6.24/1.45 6.24/1.45 clauses 82 6.24/1.45 conjectures 1 6.24/1.45 EPR 65 6.24/1.45 Horn 56 6.24/1.45 unary 27 6.24/1.45 binary 31 6.24/1.45 lits 177 6.24/1.45 lits eq 54 6.24/1.45 fd_pure 0 6.24/1.45 fd_pseudo 0 6.24/1.45 fd_cond 18 6.24/1.45 fd_pseudo_cond 2 6.24/1.45 AC symbols 0 6.24/1.45 6.24/1.45 ------ Schedule dynamic 5 is on 6.24/1.45 6.24/1.45 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 6.24/1.45 6.24/1.45 6.24/1.45 ------ 6.24/1.45 Current options: 6.24/1.45 ------ 6.24/1.45 6.24/1.45 ------ Input Options 6.24/1.45 6.24/1.45 --out_options all 6.24/1.45 --tptp_safe_out true 6.24/1.45 --problem_path "" 6.24/1.45 --include_path "" 6.24/1.45 --clausifier res/vclausify_rel 6.24/1.45 --clausifier_options --mode clausify 6.24/1.45 --stdin false 6.24/1.45 --stats_out all 6.24/1.45 6.24/1.45 ------ General Options 6.24/1.45 6.24/1.45 --fof false 6.24/1.45 --time_out_real 125. 6.24/1.45 --time_out_virtual -1. 6.24/1.45 --symbol_type_check false 6.24/1.45 --clausify_out false 6.24/1.45 --sig_cnt_out false 6.24/1.45 --trig_cnt_out false 6.24/1.45 --trig_cnt_out_tolerance 1. 6.24/1.45 --trig_cnt_out_sk_spl false 6.24/1.45 --abstr_cl_out false 6.24/1.45 6.24/1.45 ------ Global Options 6.24/1.45 6.24/1.45 --schedule default 6.24/1.45 --add_important_lit false 6.24/1.45 --prop_solver_per_cl 1000 6.24/1.45 --min_unsat_core false 6.24/1.45 --soft_assumptions false 6.24/1.45 --soft_lemma_size 3 6.24/1.45 --prop_impl_unit_size 0 6.24/1.45 --prop_impl_unit [] 6.24/1.45 --share_sel_clauses true 6.24/1.45 --reset_solvers false 6.24/1.45 --bc_imp_inh [conj_cone] 6.24/1.45 --conj_cone_tolerance 3. 6.24/1.45 --extra_neg_conj none 6.24/1.45 --large_theory_mode true 6.24/1.45 --prolific_symb_bound 200 6.24/1.45 --lt_threshold 2000 6.24/1.45 --clause_weak_htbl true 6.24/1.45 --gc_record_bc_elim false 6.24/1.45 6.24/1.45 ------ Preprocessing Options 6.24/1.45 6.24/1.45 --preprocessing_flag true 6.24/1.45 --time_out_prep_mult 0.1 6.24/1.45 --splitting_mode input 6.24/1.45 --splitting_grd true 6.24/1.45 --splitting_cvd false 6.24/1.45 --splitting_cvd_svl false 6.24/1.45 --splitting_nvd 32 6.24/1.45 --sub_typing true 6.24/1.45 --prep_gs_sim true 6.24/1.45 --prep_unflatten true 6.24/1.45 --prep_res_sim true 6.24/1.45 --prep_upred true 6.24/1.45 --prep_sem_filter exhaustive 6.24/1.45 --prep_sem_filter_out false 6.24/1.45 --pred_elim true 6.24/1.45 --res_sim_input true 6.24/1.45 --eq_ax_congr_red true 6.24/1.45 --pure_diseq_elim true 6.24/1.45 --brand_transform false 6.24/1.45 --non_eq_to_eq false 6.24/1.45 --prep_def_merge true 6.24/1.45 --prep_def_merge_prop_impl false 6.24/1.45 --prep_def_merge_mbd true 6.24/1.45 --prep_def_merge_tr_red false 6.24/1.45 --prep_def_merge_tr_cl false 6.24/1.45 --smt_preprocessing true 6.24/1.45 --smt_ac_axioms fast 6.24/1.45 --preprocessed_out false 6.24/1.45 --preprocessed_stats false 6.24/1.45 6.24/1.45 ------ Abstraction refinement Options 6.24/1.45 6.24/1.45 --abstr_ref [] 6.24/1.45 --abstr_ref_prep false 6.24/1.45 --abstr_ref_until_sat false 6.24/1.45 --abstr_ref_sig_restrict funpre 6.24/1.45 --abstr_ref_af_restrict_to_split_sk false 6.24/1.45 --abstr_ref_under [] 6.24/1.45 6.24/1.45 ------ SAT Options 6.24/1.45 6.24/1.45 --sat_mode false 6.24/1.45 --sat_fm_restart_options "" 6.24/1.45 --sat_gr_def false 6.24/1.45 --sat_epr_types true 6.24/1.45 --sat_non_cyclic_types false 6.24/1.45 --sat_finite_models false 6.24/1.45 --sat_fm_lemmas false 6.24/1.45 --sat_fm_prep false 6.24/1.45 --sat_fm_uc_incr true 6.24/1.45 --sat_out_model small 6.24/1.45 --sat_out_clauses false 6.24/1.45 6.24/1.45 ------ QBF Options 6.24/1.45 6.24/1.45 --qbf_mode false 6.24/1.45 --qbf_elim_univ false 6.24/1.45 --qbf_dom_inst none 6.24/1.45 --qbf_dom_pre_inst false 6.24/1.45 --qbf_sk_in false 6.24/1.45 --qbf_pred_elim true 6.24/1.45 --qbf_split 512 6.24/1.45 6.24/1.45 ------ BMC1 Options 6.24/1.45 6.24/1.45 --bmc1_incremental false 6.24/1.45 --bmc1_axioms reachable_all 6.24/1.45 --bmc1_min_bound 0 6.24/1.45 --bmc1_max_bound -1 6.24/1.45 --bmc1_max_bound_default -1 6.24/1.45 --bmc1_symbol_reachability true 6.24/1.45 --bmc1_property_lemmas false 6.24/1.45 --bmc1_k_induction false 6.24/1.45 --bmc1_non_equiv_states false 6.24/1.45 --bmc1_deadlock false 6.24/1.45 --bmc1_ucm false 6.24/1.45 --bmc1_add_unsat_core none 6.24/1.45 --bmc1_unsat_core_children false 6.24/1.45 --bmc1_unsat_core_extrapolate_axioms false 6.24/1.45 --bmc1_out_stat full 6.24/1.45 --bmc1_ground_init false 6.24/1.45 --bmc1_pre_inst_next_state false 6.24/1.45 --bmc1_pre_inst_state false 6.24/1.45 --bmc1_pre_inst_reach_state false 6.24/1.45 --bmc1_out_unsat_core false 6.24/1.45 --bmc1_aig_witness_out false 6.24/1.45 --bmc1_verbose false 6.24/1.45 --bmc1_dump_clauses_tptp false 6.24/1.45 --bmc1_dump_unsat_core_tptp false 6.24/1.45 --bmc1_dump_file - 6.24/1.45 --bmc1_ucm_expand_uc_limit 128 6.24/1.45 --bmc1_ucm_n_expand_iterations 6 6.24/1.45 --bmc1_ucm_extend_mode 1 6.24/1.46 --bmc1_ucm_init_mode 2 6.24/1.46 --bmc1_ucm_cone_mode none 6.24/1.46 --bmc1_ucm_reduced_relation_type 0 6.24/1.46 --bmc1_ucm_relax_model 4 6.24/1.46 --bmc1_ucm_full_tr_after_sat true 6.24/1.46 --bmc1_ucm_expand_neg_assumptions false 6.24/1.46 --bmc1_ucm_layered_model none 6.24/1.46 --bmc1_ucm_max_lemma_size 10 6.24/1.46 6.24/1.46 ------ AIG Options 6.24/1.46 6.24/1.46 --aig_mode false 6.24/1.46 6.24/1.46 ------ Instantiation Options 6.24/1.46 6.24/1.46 --instantiation_flag true 6.24/1.46 --inst_sos_flag false 6.24/1.46 --inst_sos_phase true 6.24/1.46 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 6.24/1.46 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 6.24/1.46 --inst_lit_sel_side none 6.24/1.46 --inst_solver_per_active 1400 6.24/1.46 --inst_solver_calls_frac 1. 6.24/1.46 --inst_passive_queue_type priority_queues 6.24/1.46 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 6.24/1.46 --inst_passive_queues_freq [25;2] 6.24/1.46 --inst_dismatching true 6.24/1.46 --inst_eager_unprocessed_to_passive true 6.24/1.46 --inst_prop_sim_given true 6.24/1.46 --inst_prop_sim_new false 6.24/1.46 --inst_subs_new false 6.24/1.46 --inst_eq_res_simp false 6.24/1.46 --inst_subs_given false 6.24/1.46 --inst_orphan_elimination true 6.24/1.46 --inst_learning_loop_flag true 6.24/1.46 --inst_learning_start 3000 6.24/1.46 --inst_learning_factor 2 6.24/1.46 --inst_start_prop_sim_after_learn 3 6.24/1.46 --inst_sel_renew solver 6.24/1.46 --inst_lit_activity_flag true 6.24/1.46 --inst_restr_to_given false 6.24/1.46 --inst_activity_threshold 500 6.24/1.46 --inst_out_proof true 6.24/1.46 6.24/1.46 ------ Resolution Options 6.24/1.46 6.24/1.46 --resolution_flag false 6.24/1.46 --res_lit_sel adaptive 6.24/1.46 --res_lit_sel_side none 6.24/1.46 --res_ordering kbo 6.24/1.46 --res_to_prop_solver active 6.24/1.46 --res_prop_simpl_new false 6.24/1.46 --res_prop_simpl_given true 6.24/1.46 --res_passive_queue_type priority_queues 6.24/1.46 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 6.24/1.46 --res_passive_queues_freq [15;5] 6.24/1.46 --res_forward_subs full 6.24/1.46 --res_backward_subs full 6.24/1.46 --res_forward_subs_resolution true 6.24/1.46 --res_backward_subs_resolution true 6.24/1.46 --res_orphan_elimination true 6.24/1.46 --res_time_limit 2. 6.24/1.46 --res_out_proof true 6.24/1.46 6.24/1.46 ------ Superposition Options 6.24/1.46 6.24/1.46 --superposition_flag true 6.24/1.46 --sup_passive_queue_type priority_queues 6.24/1.46 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 6.24/1.46 --sup_passive_queues_freq [8;1;4] 6.24/1.46 --demod_completeness_check fast 6.24/1.46 --demod_use_ground true 6.24/1.46 --sup_to_prop_solver passive 6.24/1.46 --sup_prop_simpl_new true 6.24/1.46 --sup_prop_simpl_given true 6.24/1.46 --sup_fun_splitting false 6.24/1.46 --sup_smt_interval 50000 6.24/1.46 6.24/1.46 ------ Superposition Simplification Setup 6.24/1.46 6.24/1.46 --sup_indices_passive [] 6.24/1.46 --sup_indices_active [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 6.24/1.46 --sup_indices_immed [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 6.24/1.46 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex] 6.24/1.46 --sup_full_triv [TrivRules;PropSubs] 6.24/1.46 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 6.24/1.46 --sup_full_bw [BwDemod] 6.24/1.46 --sup_immed_triv [TrivRules] 6.24/1.46 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 6.24/1.46 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 6.24/1.46 --sup_immed_bw_main [] 6.24/1.46 --sup_immed_bw_immed [BwDemod;BwSubsumption;BwSubsumptionRes] 6.24/1.46 --sup_input_triv [Unflattening;TrivRules] 6.24/1.46 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes] 6.24/1.46 --sup_input_bw [BwDemod;BwSubsumption;BwSubsumptionRes] 6.24/1.46 6.24/1.46 ------ Combination Options 6.24/1.46 6.24/1.46 --comb_res_mult 3 6.24/1.46 --comb_sup_mult 2 6.24/1.46 --comb_inst_mult 10 6.24/1.46 6.24/1.46 ------ Debug Options 6.24/1.46 6.24/1.46 --dbg_backtrace false 6.24/1.46 --dbg_dump_prop_clauses false 6.24/1.46 --dbg_dump_prop_clauses_file - 6.24/1.46 --dbg_out_stat false 6.24/1.46 6.24/1.46 6.24/1.46 6.24/1.46 6.24/1.46 ------ Proving... 6.24/1.46 6.24/1.46 6.24/1.46 % SZS status Theorem for theBenchmark.p 6.24/1.46 6.24/1.46 % SZS output start CNFRefutation for theBenchmark.p 6.24/1.46 6.24/1.46 fof(f108,plain,( 6.24/1.46 ! [X0,X2,X1] : (sP5(X0,X2,X1) <=> ((pull = X0 & ~happens(push,X2) & spinning = X1) | sP4(X0,X1,X2) | sP3(X1,X2,X0) | sP2(X1,X0,X2) | sP1(X0,X1,X2) | sP0(X0,X2,X1)))), 6.24/1.46 introduced(predicate_definition_introduction,[new_symbols(naming,[sP5])])). 6.24/1.46 6.24/1.46 fof(f124,plain,( 6.24/1.46 ! [X0,X2,X1] : ((sP5(X0,X2,X1) | ((pull != X0 | happens(push,X2) | spinning != X1) & ~sP4(X0,X1,X2) & ~sP3(X1,X2,X0) & ~sP2(X1,X0,X2) & ~sP1(X0,X1,X2) & ~sP0(X0,X2,X1))) & (((pull = X0 & ~happens(push,X2) & spinning = X1) | sP4(X0,X1,X2) | sP3(X1,X2,X0) | sP2(X1,X0,X2) | sP1(X0,X1,X2) | sP0(X0,X2,X1)) | ~sP5(X0,X2,X1)))), 6.24/1.46 inference(nnf_transformation,[],[f108])). 6.24/1.46 6.24/1.46 fof(f125,plain,( 6.24/1.46 ! [X0,X2,X1] : ((sP5(X0,X2,X1) | ((pull != X0 | happens(push,X2) | spinning != X1) & ~sP4(X0,X1,X2) & ~sP3(X1,X2,X0) & ~sP2(X1,X0,X2) & ~sP1(X0,X1,X2) & ~sP0(X0,X2,X1))) & ((pull = X0 & ~happens(push,X2) & spinning = X1) | sP4(X0,X1,X2) | sP3(X1,X2,X0) | sP2(X1,X0,X2) | sP1(X0,X1,X2) | sP0(X0,X2,X1) | ~sP5(X0,X2,X1)))), 6.24/1.46 inference(flattening,[],[f124])). 6.24/1.46 6.24/1.46 fof(f126,plain,( 6.24/1.46 ! [X0,X1,X2] : ((sP5(X0,X1,X2) | ((pull != X0 | happens(push,X1) | spinning != X2) & ~sP4(X0,X2,X1) & ~sP3(X2,X1,X0) & ~sP2(X2,X0,X1) & ~sP1(X0,X2,X1) & ~sP0(X0,X1,X2))) & ((pull = X0 & ~happens(push,X1) & spinning = X2) | sP4(X0,X2,X1) | sP3(X2,X1,X0) | sP2(X2,X0,X1) | sP1(X0,X2,X1) | sP0(X0,X1,X2) | ~sP5(X0,X1,X2)))), 6.24/1.46 inference(rectify,[],[f125])). 6.24/1.46 6.24/1.46 fof(f187,plain,( 6.24/1.46 ( ! [X2,X0,X1] : (sP5(X0,X1,X2) | ~sP4(X0,X2,X1)) )), 6.24/1.46 inference(cnf_transformation,[],[f126])). 6.24/1.46 6.24/1.46 fof(f107,plain,( 6.24/1.46 ! [X0,X1,X2] : (sP4(X0,X1,X2) <=> (push = X0 & spinning = X1 & ~happens(pull,X2)))), 6.24/1.46 introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])])). 6.24/1.46 6.24/1.46 fof(f127,plain,( 6.24/1.46 ! [X0,X1,X2] : ((sP4(X0,X1,X2) | (push != X0 | spinning != X1 | happens(pull,X2))) & ((push = X0 & spinning = X1 & ~happens(pull,X2)) | ~sP4(X0,X1,X2)))), 6.24/1.46 inference(nnf_transformation,[],[f107])). 6.24/1.46 6.24/1.46 fof(f128,plain,( 6.24/1.46 ! [X0,X1,X2] : ((sP4(X0,X1,X2) | push != X0 | spinning != X1 | happens(pull,X2)) & ((push = X0 & spinning = X1 & ~happens(pull,X2)) | ~sP4(X0,X1,X2)))), 6.24/1.46 inference(flattening,[],[f127])). 6.24/1.46 6.24/1.46 fof(f192,plain,( 6.24/1.46 ( ! [X2,X0,X1] : (sP4(X0,X1,X2) | push != X0 | spinning != X1 | happens(pull,X2)) )), 6.24/1.46 inference(cnf_transformation,[],[f128])). 6.24/1.46 6.24/1.46 fof(f290,plain,( 6.24/1.46 ( ! [X2,X1] : (sP4(push,X1,X2) | spinning != X1 | happens(pull,X2)) )), 6.24/1.46 inference(equality_resolution,[],[f192])). 6.24/1.46 6.24/1.46 fof(f291,plain,( 6.24/1.46 ( ! [X2] : (sP4(push,spinning,X2) | happens(pull,X2)) )), 6.24/1.46 inference(equality_resolution,[],[f290])). 6.24/1.46 6.24/1.46 fof(f30,axiom,( 6.24/1.46 n1 = plus(n0,n1)), 6.24/1.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 6.24/1.46 6.24/1.46 fof(f259,plain,( 6.24/1.46 n1 = plus(n0,n1)), 6.24/1.46 inference(cnf_transformation,[],[f30])). 6.24/1.46 6.24/1.46 fof(f13,axiom,( 6.24/1.46 ! [X3,X2,X4] : (terminates(X3,X2,X4) <=> ((pull = X3 & ~happens(push,X4) & spinning = X2) | (push = X3 & spinning = X2 & ~happens(pull,X4)) | (backwards = X2 & happens(push,X4) & pull = X3) | (forwards = X2 & pull = X3 & happens(push,X4)) | (pull = X3 & forwards = X2 & ~happens(push,X4)) | (push = X3 & ~happens(pull,X4) & backwards = X2)))), 6.24/1.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 6.24/1.46 6.24/1.46 fof(f61,plain,( 6.24/1.46 ! [X0,X1,X2] : (terminates(X0,X1,X2) <=> ((pull = X0 & ~happens(push,X2) & spinning = X1) | (push = X0 & spinning = X1 & ~happens(pull,X2)) | (backwards = X1 & happens(push,X2) & pull = X0) | (forwards = X1 & pull = X0 & happens(push,X2)) | (pull = X0 & forwards = X1 & ~happens(push,X2)) | (push = X0 & ~happens(pull,X2) & backwards = X1)))), 6.24/1.46 inference(rectify,[],[f13])). 6.24/1.46 6.24/1.46 fof(f106,plain,( 6.24/1.46 ! [X1,X2,X0] : (sP3(X1,X2,X0) <=> (backwards = X1 & happens(push,X2) & pull = X0))), 6.24/1.46 introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])])). 6.24/1.46 6.24/1.46 fof(f105,plain,( 6.24/1.46 ! [X1,X0,X2] : (sP2(X1,X0,X2) <=> (forwards = X1 & pull = X0 & happens(push,X2)))), 6.24/1.46 introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])])). 6.24/1.46 6.24/1.46 fof(f104,plain,( 6.24/1.46 ! [X0,X1,X2] : (sP1(X0,X1,X2) <=> (pull = X0 & forwards = X1 & ~happens(push,X2)))), 6.24/1.46 introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])])). 6.24/1.46 6.24/1.46 fof(f103,plain,( 6.24/1.46 ! [X0,X2,X1] : (sP0(X0,X2,X1) <=> (push = X0 & ~happens(pull,X2) & backwards = X1))), 6.24/1.46 introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])])). 6.24/1.46 6.24/1.46 fof(f109,plain,( 6.24/1.46 ! [X0,X1,X2] : (terminates(X0,X1,X2) <=> sP5(X0,X2,X1))), 6.24/1.46 inference(definition_folding,[],[f61,f108,f107,f106,f105,f104,f103])). 6.24/1.46 6.24/1.46 fof(f140,plain,( 6.24/1.46 ! [X0,X1,X2] : ((terminates(X0,X1,X2) | ~sP5(X0,X2,X1)) & (sP5(X0,X2,X1) | ~terminates(X0,X1,X2)))), 6.24/1.46 inference(nnf_transformation,[],[f109])). 6.24/1.46 6.24/1.46 fof(f210,plain,( 6.24/1.46 ( ! [X2,X0,X1] : (terminates(X0,X1,X2) | ~sP5(X0,X2,X1)) )), 6.24/1.46 inference(cnf_transformation,[],[f140])). 6.24/1.46 6.24/1.46 fof(f5,axiom,( 6.24/1.46 ! [X3,X4,X2] : ((happens(X3,X4) & terminates(X3,X2,X4)) => ~holdsAt(X2,plus(X4,n1)))), 6.24/1.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 6.24/1.46 6.24/1.46 fof(f53,plain,( 6.24/1.46 ! [X0,X1,X2] : ((happens(X0,X1) & terminates(X0,X2,X1)) => ~holdsAt(X2,plus(X1,n1)))), 6.24/1.46 inference(rectify,[],[f5])). 6.24/1.46 6.24/1.46 fof(f90,plain,( 6.24/1.46 ! [X0,X1,X2] : (~holdsAt(X2,plus(X1,n1)) | (~happens(X0,X1) | ~terminates(X0,X2,X1)))), 6.24/1.46 inference(ennf_transformation,[],[f53])). 6.24/1.46 6.24/1.46 fof(f91,plain,( 6.24/1.46 ! [X0,X1,X2] : (~holdsAt(X2,plus(X1,n1)) | ~happens(X0,X1) | ~terminates(X0,X2,X1))), 6.24/1.46 inference(flattening,[],[f90])). 6.24/1.46 6.24/1.46 fof(f170,plain,( 6.24/1.46 ( ! [X2,X0,X1] : (~holdsAt(X2,plus(X1,n1)) | ~happens(X0,X1) | ~terminates(X0,X2,X1)) )), 6.24/1.46 inference(cnf_transformation,[],[f91])). 6.24/1.46 6.24/1.46 fof(f24,conjecture,( 6.24/1.46 ~holdsAt(spinning,n1)), 6.24/1.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 6.24/1.46 6.24/1.46 fof(f25,negated_conjecture,( 6.24/1.46 ~~holdsAt(spinning,n1)), 6.24/1.46 inference(negated_conjecture,[],[f24])). 6.24/1.46 6.24/1.46 fof(f67,plain,( 6.24/1.46 holdsAt(spinning,n1)), 6.24/1.46 inference(flattening,[],[f25])). 6.24/1.46 6.24/1.46 fof(f253,plain,( 6.24/1.46 holdsAt(spinning,n1)), 6.24/1.46 inference(cnf_transformation,[],[f67])). 6.24/1.46 6.24/1.46 fof(f16,axiom,( 6.24/1.46 ! [X3,X4] : (((pull = X3 & n1 = X4) | (n2 = X4 & pull = X3) | (push = X3 & n2 = X4) | (push = X3 & n0 = X4)) <=> happens(X3,X4))), 6.24/1.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 6.24/1.46 6.24/1.46 fof(f63,plain,( 6.24/1.46 ! [X0,X1] : (((pull = X0 & n1 = X1) | (n2 = X1 & pull = X0) | (push = X0 & n2 = X1) | (push = X0 & n0 = X1)) <=> happens(X0,X1))), 6.24/1.46 inference(rectify,[],[f16])). 6.24/1.46 6.24/1.46 fof(f114,plain,( 6.24/1.46 ! [X0,X1] : (sP9(X0,X1) <=> ((pull = X0 & n1 = X1) | (n2 = X1 & pull = X0) | (push = X0 & n2 = X1) | sP8(X0,X1)))), 6.24/1.46 introduced(predicate_definition_introduction,[new_symbols(naming,[sP9])])). 6.24/1.46 6.24/1.46 fof(f113,plain,( 6.24/1.46 ! [X0,X1] : (sP8(X0,X1) <=> (push = X0 & n0 = X1))), 6.24/1.46 introduced(predicate_definition_introduction,[new_symbols(naming,[sP8])])). 6.24/1.46 6.24/1.46 fof(f115,plain,( 6.24/1.46 ! [X0,X1] : (sP9(X0,X1) <=> happens(X0,X1))), 6.24/1.46 inference(definition_folding,[],[f63,f114,f113])). 6.24/1.46 6.24/1.46 fof(f153,plain,( 6.24/1.46 ! [X0,X1] : ((sP9(X0,X1) | ~happens(X0,X1)) & (happens(X0,X1) | ~sP9(X0,X1)))), 6.24/1.46 inference(nnf_transformation,[],[f115])). 6.24/1.46 6.24/1.46 fof(f241,plain,( 6.24/1.46 ( ! [X0,X1] : (happens(X0,X1) | ~sP9(X0,X1)) )), 6.24/1.46 inference(cnf_transformation,[],[f153])). 6.24/1.46 6.24/1.46 fof(f149,plain,( 6.24/1.46 ! [X0,X1] : ((sP9(X0,X1) | ((pull != X0 | n1 != X1) & (n2 != X1 | pull != X0) & (push != X0 | n2 != X1) & ~sP8(X0,X1))) & (((pull = X0 & n1 = X1) | (n2 = X1 & pull = X0) | (push = X0 & n2 = X1) | sP8(X0,X1)) | ~sP9(X0,X1)))), 6.24/1.46 inference(nnf_transformation,[],[f114])). 6.24/1.46 6.24/1.46 fof(f150,plain,( 6.24/1.46 ! [X0,X1] : ((sP9(X0,X1) | ((pull != X0 | n1 != X1) & (n2 != X1 | pull != X0) & (push != X0 | n2 != X1) & ~sP8(X0,X1))) & ((pull = X0 & n1 = X1) | (n2 = X1 & pull = X0) | (push = X0 & n2 = X1) | sP8(X0,X1) | ~sP9(X0,X1)))), 6.24/1.46 inference(flattening,[],[f149])). 6.24/1.46 6.24/1.46 fof(f234,plain,( 6.24/1.46 ( ! [X0,X1] : (sP9(X0,X1) | ~sP8(X0,X1)) )), 6.24/1.46 inference(cnf_transformation,[],[f150])). 6.24/1.46 6.24/1.46 fof(f151,plain,( 6.24/1.46 ! [X0,X1] : ((sP8(X0,X1) | (push != X0 | n0 != X1)) & ((push = X0 & n0 = X1) | ~sP8(X0,X1)))), 6.24/1.46 inference(nnf_transformation,[],[f113])). 6.24/1.46 6.24/1.46 fof(f152,plain,( 6.24/1.46 ! [X0,X1] : ((sP8(X0,X1) | push != X0 | n0 != X1) & ((push = X0 & n0 = X1) | ~sP8(X0,X1)))), 6.24/1.46 inference(flattening,[],[f151])). 6.24/1.46 6.24/1.46 fof(f240,plain,( 6.24/1.46 ( ! [X0,X1] : (sP8(X0,X1) | push != X0 | n0 != X1) )), 6.24/1.46 inference(cnf_transformation,[],[f152])). 6.24/1.46 6.24/1.46 fof(f312,plain,( 6.24/1.46 ( ! [X1] : (sP8(push,X1) | n0 != X1) )), 6.24/1.46 inference(equality_resolution,[],[f240])). 6.24/1.46 6.24/1.46 fof(f313,plain,( 6.24/1.46 sP8(push,n0)), 6.24/1.46 inference(equality_resolution,[],[f312])). 6.24/1.46 6.24/1.46 fof(f242,plain,( 6.24/1.46 ( ! [X0,X1] : (sP9(X0,X1) | ~happens(X0,X1)) )), 6.24/1.46 inference(cnf_transformation,[],[f153])). 6.24/1.46 6.24/1.46 fof(f229,plain,( 6.24/1.46 ( ! [X0,X1] : (n1 = X1 | n2 = X1 | push = X0 | sP8(X0,X1) | ~sP9(X0,X1)) )), 6.24/1.46 inference(cnf_transformation,[],[f150])). 6.24/1.46 6.24/1.46 fof(f239,plain,( 6.24/1.46 ( ! [X0,X1] : (push = X0 | ~sP8(X0,X1)) )), 6.24/1.46 inference(cnf_transformation,[],[f152])). 6.24/1.46 6.24/1.46 fof(f228,plain,( 6.24/1.46 ( ! [X0,X1] : (n1 = X1 | n2 = X1 | n2 = X1 | sP8(X0,X1) | ~sP9(X0,X1)) )), 6.24/1.46 inference(cnf_transformation,[],[f150])). 6.24/1.46 6.24/1.46 fof(f45,axiom,( 6.24/1.46 ! [X8,X9] : (less_or_equal(X8,X9) <=> (less(X8,X9) | X8 = X9))), 6.24/1.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 6.24/1.46 6.24/1.46 fof(f76,plain,( 6.24/1.46 ! [X0,X1] : (less_or_equal(X0,X1) <=> (less(X0,X1) | X0 = X1))), 6.24/1.46 inference(rectify,[],[f45])). 6.24/1.46 6.24/1.46 fof(f162,plain,( 6.24/1.46 ! [X0,X1] : ((less_or_equal(X0,X1) | (~less(X0,X1) & X0 != X1)) & ((less(X0,X1) | X0 = X1) | ~less_or_equal(X0,X1)))), 6.24/1.46 inference(nnf_transformation,[],[f76])). 6.24/1.46 6.24/1.46 fof(f163,plain,( 6.24/1.46 ! [X0,X1] : ((less_or_equal(X0,X1) | (~less(X0,X1) & X0 != X1)) & (less(X0,X1) | X0 = X1 | ~less_or_equal(X0,X1)))), 6.24/1.46 inference(flattening,[],[f162])). 6.24/1.46 6.24/1.46 fof(f280,plain,( 6.24/1.46 ( ! [X0,X1] : (less_or_equal(X0,X1) | ~less(X0,X1)) )), 6.24/1.46 inference(cnf_transformation,[],[f163])). 6.24/1.46 6.24/1.46 fof(f49,axiom,( 6.24/1.46 ! [X8] : (less_or_equal(X8,n2) <=> less(X8,n3))), 6.24/1.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 6.24/1.46 6.24/1.46 fof(f79,plain,( 6.24/1.46 ! [X0] : (less_or_equal(X0,n2) <=> less(X0,n3))), 6.24/1.46 inference(rectify,[],[f49])). 6.24/1.46 6.24/1.46 fof(f166,plain,( 6.24/1.46 ! [X0] : ((less_or_equal(X0,n2) | ~less(X0,n3)) & (less(X0,n3) | ~less_or_equal(X0,n2)))), 6.24/1.46 inference(nnf_transformation,[],[f79])). 6.24/1.46 6.24/1.46 fof(f286,plain,( 6.24/1.46 ( ! [X0] : (less(X0,n3) | ~less_or_equal(X0,n2)) )), 6.24/1.46 inference(cnf_transformation,[],[f166])). 6.24/1.46 6.24/1.46 fof(f23,axiom,( 6.24/1.46 ! [X8] : (less_or_equal(X8,n0) <=> less(X8,n1))), 6.24/1.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 6.24/1.46 6.24/1.46 fof(f66,plain,( 6.24/1.46 ! [X0] : (less_or_equal(X0,n0) <=> less(X0,n1))), 6.24/1.46 inference(rectify,[],[f23])). 6.24/1.46 6.24/1.46 fof(f156,plain,( 6.24/1.46 ! [X0] : ((less_or_equal(X0,n0) | ~less(X0,n1)) & (less(X0,n1) | ~less_or_equal(X0,n0)))), 6.24/1.46 inference(nnf_transformation,[],[f66])). 6.24/1.46 6.24/1.46 fof(f251,plain,( 6.24/1.46 ( ! [X0] : (less(X0,n1) | ~less_or_equal(X0,n0)) )), 6.24/1.46 inference(cnf_transformation,[],[f156])). 6.24/1.46 6.24/1.46 fof(f287,plain,( 6.24/1.46 ( ! [X0] : (less_or_equal(X0,n2) | ~less(X0,n3)) )), 6.24/1.46 inference(cnf_transformation,[],[f166])). 6.24/1.46 6.24/1.46 fof(f29,axiom,( 6.24/1.46 ! [X8] : (less(X8,n2) <=> less_or_equal(X8,n1))), 6.24/1.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 6.24/1.46 6.24/1.46 fof(f70,plain,( 6.24/1.46 ! [X0] : (less(X0,n2) <=> less_or_equal(X0,n1))), 6.24/1.46 inference(rectify,[],[f29])). 6.24/1.46 6.24/1.46 fof(f157,plain,( 6.24/1.46 ! [X0] : ((less(X0,n2) | ~less_or_equal(X0,n1)) & (less_or_equal(X0,n1) | ~less(X0,n2)))), 6.24/1.46 inference(nnf_transformation,[],[f70])). 6.24/1.46 6.24/1.46 fof(f257,plain,( 6.24/1.46 ( ! [X0] : (less_or_equal(X0,n1) | ~less(X0,n2)) )), 6.24/1.46 inference(cnf_transformation,[],[f157])). 6.24/1.46 6.24/1.46 fof(f18,axiom,( 6.24/1.46 pull != push), 6.24/1.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 6.24/1.46 6.24/1.46 fof(f244,plain,( 6.24/1.46 pull != push), 6.24/1.46 inference(cnf_transformation,[],[f18])). 6.24/1.46 6.24/1.46 fof(f21,axiom,( 6.24/1.46 ! [X8,X9] : ((~less(X9,X8) & X8 != X9) <=> less(X8,X9))), 6.24/1.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 6.24/1.46 6.24/1.46 fof(f65,plain,( 6.24/1.46 ! [X0,X1] : ((~less(X1,X0) & X0 != X1) <=> less(X0,X1))), 6.24/1.46 inference(rectify,[],[f21])). 6.24/1.46 6.24/1.46 fof(f154,plain,( 6.24/1.46 ! [X0,X1] : (((~less(X1,X0) & X0 != X1) | ~less(X0,X1)) & (less(X0,X1) | (less(X1,X0) | X0 = X1)))), 6.24/1.46 inference(nnf_transformation,[],[f65])). 6.24/1.46 6.24/1.46 fof(f155,plain,( 6.24/1.46 ! [X0,X1] : (((~less(X1,X0) & X0 != X1) | ~less(X0,X1)) & (less(X0,X1) | less(X1,X0) | X0 = X1))), 6.24/1.46 inference(flattening,[],[f154])). 6.24/1.46 6.24/1.46 fof(f248,plain,( 6.24/1.46 ( ! [X0,X1] : (X0 != X1 | ~less(X0,X1)) )), 6.24/1.46 inference(cnf_transformation,[],[f155])). 6.24/1.46 6.24/1.46 fof(f314,plain,( 6.24/1.46 ( ! [X1] : (~less(X1,X1)) )), 6.24/1.46 inference(equality_resolution,[],[f248])). 6.24/1.46 6.24/1.46 fof(f258,plain,( 6.24/1.46 ( ! [X0] : (less(X0,n2) | ~less_or_equal(X0,n1)) )), 6.24/1.46 inference(cnf_transformation,[],[f157])). 6.24/1.46 6.24/1.46 fof(f279,plain,( 6.24/1.46 ( ! [X0,X1] : (less_or_equal(X0,X1) | X0 != X1) )), 6.24/1.46 inference(cnf_transformation,[],[f163])). 6.24/1.46 6.24/1.46 fof(f315,plain,( 6.24/1.46 ( ! [X1] : (less_or_equal(X1,X1)) )), 6.24/1.46 inference(equality_resolution,[],[f279])). 6.24/1.46 6.24/1.46 cnf(c_14,plain, 6.24/1.46 ( ~ sP4(X0,X1,X2) | sP5(X0,X2,X1) ), 6.24/1.46 inference(cnf_transformation,[],[f187]) ). 6.24/1.46 6.24/1.46 cnf(c_22,plain, 6.24/1.46 ( sP4(push,spinning,X0) | happens(pull,X0) ), 6.24/1.46 inference(cnf_transformation,[],[f291]) ). 6.24/1.46 6.24/1.46 cnf(c_2641,plain, 6.24/1.46 ( sP5(X0,X1,X2) 6.24/1.46 | happens(pull,X3) 6.24/1.46 | X3 != X1 6.24/1.46 | push != X0 6.24/1.46 | spinning != X2 ), 6.24/1.46 inference(resolution_lifted,[status(thm)],[c_14,c_22]) ). 6.24/1.46 6.24/1.46 cnf(c_2642,plain, 6.24/1.46 ( sP5(push,X0,spinning) | happens(pull,X0) ), 6.24/1.46 inference(unflattening,[status(thm)],[c_2641]) ). 6.24/1.46 6.24/1.46 cnf(c_9305,plain, 6.24/1.46 ( sP5(push,X0,spinning) = iProver_top 6.24/1.46 | happens(pull,X0) = iProver_top ), 6.24/1.46 inference(predicate_to_equality,[status(thm)],[c_2642]) ). 6.24/1.46 6.24/1.46 cnf(c_92,plain, 6.24/1.46 ( plus(n0,n1) = n1 ), 6.24/1.46 inference(cnf_transformation,[],[f259]) ). 6.24/1.46 6.24/1.46 cnf(c_42,plain, 6.24/1.46 ( ~ sP5(X0,X1,X2) | terminates(X0,X2,X1) ), 6.24/1.46 inference(cnf_transformation,[],[f210]) ). 6.24/1.46 6.24/1.46 cnf(c_953,plain, 6.24/1.46 ( ~ sP5(X0,X1,X2) | terminates(X0,X2,X1) ), 6.24/1.46 inference(prop_impl,[status(thm)],[c_42]) ). 6.24/1.46 6.24/1.46 cnf(c_3,plain, 6.24/1.46 ( ~ terminates(X0,X1,X2) 6.24/1.46 | ~ happens(X0,X2) 6.24/1.46 | ~ holdsAt(X1,plus(X2,n1)) ), 6.24/1.46 inference(cnf_transformation,[],[f170]) ). 6.24/1.46 6.24/1.46 cnf(c_1498,plain, 6.24/1.46 ( ~ sP5(X0,X1,X2) 6.24/1.46 | ~ happens(X3,X4) 6.24/1.46 | ~ holdsAt(X5,plus(X4,n1)) 6.24/1.46 | X3 != X0 6.24/1.46 | X5 != X2 6.24/1.46 | X4 != X1 ), 6.24/1.46 inference(resolution_lifted,[status(thm)],[c_953,c_3]) ). 6.24/1.46 6.24/1.46 cnf(c_1499,plain, 6.24/1.46 ( ~ sP5(X0,X1,X2) | ~ happens(X0,X1) | ~ holdsAt(X2,plus(X1,n1)) ), 6.24/1.46 inference(unflattening,[status(thm)],[c_1498]) ). 6.24/1.46 6.24/1.46 cnf(c_9324,plain, 6.24/1.46 ( sP5(X0,X1,X2) != iProver_top 6.24/1.46 | happens(X0,X1) != iProver_top 6.24/1.46 | holdsAt(X2,plus(X1,n1)) != iProver_top ), 6.24/1.46 inference(predicate_to_equality,[status(thm)],[c_1499]) ). 6.24/1.46 6.24/1.46 cnf(c_22978,plain, 6.24/1.46 ( sP5(X0,n0,X1) != iProver_top 6.24/1.46 | happens(X0,n0) != iProver_top 6.24/1.46 | holdsAt(X1,n1) != iProver_top ), 6.24/1.46 inference(superposition,[status(thm)],[c_92,c_9324]) ). 6.24/1.46 6.24/1.46 cnf(c_23020,plain, 6.24/1.46 ( happens(push,n0) != iProver_top 6.24/1.46 | happens(pull,n0) = iProver_top 6.24/1.46 | holdsAt(spinning,n1) != iProver_top ), 6.24/1.46 inference(superposition,[status(thm)],[c_9305,c_22978]) ). 6.24/1.46 6.24/1.46 cnf(c_86,negated_conjecture, 6.24/1.46 ( holdsAt(spinning,n1) ), 6.24/1.46 inference(cnf_transformation,[],[f253]) ). 6.24/1.46 6.24/1.46 cnf(c_121,plain, 6.24/1.46 ( holdsAt(spinning,n1) = iProver_top ), 6.24/1.46 inference(predicate_to_equality,[status(thm)],[c_86]) ). 6.24/1.46 6.24/1.46 cnf(c_75,plain, 6.24/1.46 ( ~ sP9(X0,X1) | happens(X0,X1) ), 6.24/1.46 inference(cnf_transformation,[],[f241]) ). 6.24/1.46 6.24/1.46 cnf(c_949,plain, 6.24/1.46 ( ~ sP9(X0,X1) | happens(X0,X1) ), 6.24/1.46 inference(prop_impl,[status(thm)],[c_75]) ). 6.24/1.46 6.24/1.46 cnf(c_62,plain, 6.24/1.46 ( ~ sP8(X0,X1) | sP9(X0,X1) ), 6.24/1.46 inference(cnf_transformation,[],[f234]) ). 6.24/1.46 6.24/1.46 cnf(c_71,plain, 6.24/1.46 ( sP8(push,n0) ), 6.24/1.46 inference(cnf_transformation,[],[f313]) ). 6.24/1.46 6.24/1.46 cnf(c_1595,plain, 6.24/1.46 ( sP9(X0,X1) | n0 != X1 | push != X0 ), 6.24/1.46 inference(resolution_lifted,[status(thm)],[c_62,c_71]) ). 6.24/1.46 6.24/1.46 cnf(c_1596,plain, 6.24/1.46 ( sP9(push,n0) ), 6.24/1.46 inference(unflattening,[status(thm)],[c_1595]) ). 6.24/1.46 6.24/1.46 cnf(c_1922,plain, 6.24/1.46 ( happens(X0,X1) | n0 != X1 | push != X0 ), 6.24/1.46 inference(resolution_lifted,[status(thm)],[c_949,c_1596]) ). 6.24/1.46 6.24/1.46 cnf(c_1923,plain, 6.24/1.46 ( happens(push,n0) ), 6.24/1.46 inference(unflattening,[status(thm)],[c_1922]) ). 6.24/1.46 6.24/1.46 cnf(c_1924,plain, 6.24/1.46 ( happens(push,n0) = iProver_top ), 6.24/1.46 inference(predicate_to_equality,[status(thm)],[c_1923]) ). 6.24/1.46 6.24/1.46 cnf(c_7815,plain,( X0 = X0 ),theory(equality) ). 6.24/1.46 6.24/1.46 cnf(c_10335,plain, 6.24/1.46 ( spinning = spinning ), 6.24/1.46 inference(instantiation,[status(thm)],[c_7815]) ). 6.24/1.46 6.24/1.46 cnf(c_11614,plain, 6.24/1.46 ( sP5(push,n0,spinning) | happens(pull,n0) ), 6.24/1.46 inference(instantiation,[status(thm)],[c_2642]) ). 6.24/1.46 6.24/1.46 cnf(c_11615,plain, 6.24/1.46 ( sP5(push,n0,spinning) = iProver_top 6.24/1.46 | happens(pull,n0) = iProver_top ), 6.24/1.46 inference(predicate_to_equality,[status(thm)],[c_11614]) ). 6.24/1.46 6.24/1.46 cnf(c_10206,plain, 6.24/1.46 ( ~ sP5(push,n0,X0) 6.24/1.46 | ~ happens(push,n0) 6.24/1.46 | ~ holdsAt(X0,plus(n0,n1)) ), 6.24/1.46 inference(instantiation,[status(thm)],[c_1499]) ). 6.24/1.46 6.24/1.46 cnf(c_14449,plain, 6.24/1.46 ( ~ sP5(push,n0,spinning) 6.24/1.46 | ~ happens(push,n0) 6.24/1.46 | ~ holdsAt(spinning,plus(n0,n1)) ), 6.24/1.46 inference(instantiation,[status(thm)],[c_10206]) ). 6.24/1.46 6.24/1.46 cnf(c_14450,plain, 6.24/1.46 ( sP5(push,n0,spinning) != iProver_top 6.24/1.46 | happens(push,n0) != iProver_top 6.24/1.46 | holdsAt(spinning,plus(n0,n1)) != iProver_top ), 6.24/1.46 inference(predicate_to_equality,[status(thm)],[c_14449]) ). 6.24/1.46 6.24/1.46 cnf(c_7818,plain, 6.24/1.46 ( ~ holdsAt(X0,X1) | holdsAt(X2,X3) | X2 != X0 | X3 != X1 ), 6.24/1.46 theory(equality) ). 6.24/1.46 6.24/1.46 cnf(c_9909,plain, 6.24/1.46 ( holdsAt(X0,X1) 6.24/1.46 | ~ holdsAt(spinning,n1) 6.24/1.46 | X0 != spinning 6.24/1.46 | X1 != n1 ), 6.24/1.46 inference(instantiation,[status(thm)],[c_7818]) ). 6.24/1.46 6.24/1.46 cnf(c_10334,plain, 6.24/1.46 ( holdsAt(spinning,X0) 6.24/1.46 | ~ holdsAt(spinning,n1) 6.24/1.46 | X0 != n1 6.24/1.46 | spinning != spinning ), 6.24/1.46 inference(instantiation,[status(thm)],[c_9909]) ). 6.24/1.46 6.24/1.46 cnf(c_15343,plain, 6.24/1.46 ( holdsAt(spinning,plus(n0,n1)) 6.24/1.46 | ~ holdsAt(spinning,n1) 6.24/1.46 | plus(n0,n1) != n1 6.24/1.46 | spinning != spinning ), 6.24/1.46 inference(instantiation,[status(thm)],[c_10334]) ). 6.24/1.46 6.24/1.46 cnf(c_15344,plain, 6.24/1.46 ( plus(n0,n1) != n1 6.24/1.46 | spinning != spinning 6.24/1.46 | holdsAt(spinning,plus(n0,n1)) = iProver_top 6.24/1.46 | holdsAt(spinning,n1) != iProver_top ), 6.24/1.46 inference(predicate_to_equality,[status(thm)],[c_15343]) ). 6.24/1.46 6.24/1.46 cnf(c_23139,plain, 6.24/1.46 ( happens(pull,n0) = iProver_top ), 6.24/1.46 inference(global_propositional_subsumption, 6.24/1.46 [status(thm)], 6.24/1.46 [c_23020,c_121,c_92,c_1924,c_10335,c_11615,c_14450, 6.24/1.46 c_15344]) ). 6.24/1.46 6.24/1.46 cnf(c_74,plain, 6.24/1.46 ( sP9(X0,X1) | ~ happens(X0,X1) ), 6.24/1.46 inference(cnf_transformation,[],[f242]) ). 6.24/1.46 6.24/1.46 cnf(c_947,plain, 6.24/1.46 ( sP9(X0,X1) | ~ happens(X0,X1) ), 6.24/1.46 inference(prop_impl,[status(thm)],[c_74]) ). 6.24/1.46 6.24/1.46 cnf(c_67,plain, 6.24/1.46 ( sP8(X0,X1) | ~ sP9(X0,X1) | n2 = X1 | push = X0 | n1 = X1 ), 6.24/1.46 inference(cnf_transformation,[],[f229]) ). 6.24/1.46 6.24/1.46 cnf(c_72,plain, 6.24/1.46 ( ~ sP8(X0,X1) | push = X0 ), 6.24/1.46 inference(cnf_transformation,[],[f239]) ). 6.24/1.46 6.24/1.46 cnf(c_68,plain, 6.24/1.46 ( sP8(X0,X1) | ~ sP9(X0,X1) | n2 = X1 | n1 = X1 ), 6.24/1.46 inference(cnf_transformation,[],[f228]) ). 6.24/1.46 6.24/1.46 cnf(c_672,plain, 6.24/1.46 ( ~ sP9(X0,X1) | n2 = X1 | push = X0 | n1 = X1 ), 6.24/1.46 inference(global_propositional_subsumption, 6.24/1.46 [status(thm)], 6.24/1.46 [c_67,c_72,c_68]) ). 6.24/1.46 6.24/1.46 cnf(c_1837,plain, 6.24/1.46 ( ~ happens(X0,X1) | n2 = X1 | push = X0 | n1 = X1 ), 6.24/1.46 inference(resolution,[status(thm)],[c_947,c_672]) ). 6.24/1.46 6.24/1.46 cnf(c_9313,plain, 6.24/1.46 ( n2 = X0 | push = X1 | n1 = X0 | happens(X1,X0) != iProver_top ), 6.24/1.46 inference(predicate_to_equality,[status(thm)],[c_1837]) ). 6.24/1.46 6.24/1.46 cnf(c_23146,plain, 6.24/1.46 ( n0 = n2 | n0 = n1 | push = pull ), 6.24/1.46 inference(superposition,[status(thm)],[c_23139,c_9313]) ). 6.24/1.46 6.24/1.46 cnf(c_111,plain, 6.24/1.46 ( less_or_equal(X0,X1) | ~ less(X0,X1) ), 6.24/1.46 inference(cnf_transformation,[],[f280]) ). 6.24/1.46 6.24/1.46 cnf(c_120,plain, 6.24/1.46 ( ~ less_or_equal(X0,n2) | less(X0,n3) ), 6.24/1.46 inference(cnf_transformation,[],[f286]) ). 6.24/1.46 6.24/1.46 cnf(c_989,plain, 6.24/1.46 ( ~ less_or_equal(X0,n2) | less(X0,n3) ), 6.24/1.46 inference(prop_impl,[status(thm)],[c_120]) ). 6.24/1.46 6.24/1.46 cnf(c_4427,plain, 6.24/1.46 ( ~ less(X0,X1) | less(X2,n3) | X2 != X0 | n2 != X1 ), 6.24/1.46 inference(resolution_lifted,[status(thm)],[c_111,c_989]) ). 6.24/1.46 6.24/1.46 cnf(c_4428,plain, 6.24/1.46 ( less(X0,n3) | ~ less(X0,n2) ), 6.24/1.46 inference(unflattening,[status(thm)],[c_4427]) ). 6.24/1.46 6.24/1.46 cnf(c_4430,plain, 6.24/1.46 ( less(n1,n3) | ~ less(n1,n2) ), 6.24/1.46 inference(instantiation,[status(thm)],[c_4428]) ). 6.24/1.46 6.24/1.46 cnf(c_85,plain, 6.24/1.46 ( ~ less_or_equal(X0,n0) | less(X0,n1) ), 6.24/1.46 inference(cnf_transformation,[],[f251]) ). 6.24/1.46 6.24/1.46 cnf(c_957,plain, 6.24/1.46 ( ~ less_or_equal(X0,n0) | less(X0,n1) ), 6.24/1.46 inference(prop_impl,[status(thm)],[c_85]) ). 6.24/1.46 6.24/1.46 cnf(c_119,plain, 6.24/1.46 ( less_or_equal(X0,n2) | ~ less(X0,n3) ), 6.24/1.46 inference(cnf_transformation,[],[f287]) ). 6.24/1.46 6.24/1.46 cnf(c_987,plain, 6.24/1.46 ( less_or_equal(X0,n2) | ~ less(X0,n3) ), 6.24/1.46 inference(prop_impl,[status(thm)],[c_119]) ). 6.24/1.46 6.24/1.46 cnf(c_3469,plain, 6.24/1.46 ( ~ less(X0,n3) | less(X1,n1) | X0 != X1 | n0 != n2 ), 6.24/1.46 inference(resolution_lifted,[status(thm)],[c_957,c_987]) ). 6.24/1.46 6.24/1.46 cnf(c_3470,plain, 6.24/1.46 ( ~ less(X0,n3) | less(X0,n1) | n0 != n2 ), 6.24/1.46 inference(unflattening,[status(thm)],[c_3469]) ). 6.24/1.46 6.24/1.46 cnf(c_3472,plain, 6.24/1.46 ( ~ less(n1,n3) | less(n1,n1) | n0 != n2 ), 6.24/1.46 inference(instantiation,[status(thm)],[c_3470]) ). 6.24/1.46 6.24/1.46 cnf(c_91,plain, 6.24/1.46 ( less_or_equal(X0,n1) | ~ less(X0,n2) ), 6.24/1.46 inference(cnf_transformation,[],[f257]) ). 6.24/1.46 6.24/1.46 cnf(c_959,plain, 6.24/1.46 ( less_or_equal(X0,n1) | ~ less(X0,n2) ), 6.24/1.46 inference(prop_impl,[status(thm)],[c_91]) ). 6.24/1.46 6.24/1.46 cnf(c_3255,plain, 6.24/1.46 ( ~ less(X0,n2) | less(X1,n1) | X0 != X1 | n0 != n1 ), 6.24/1.46 inference(resolution_lifted,[status(thm)],[c_957,c_959]) ). 6.24/1.46 6.24/1.46 cnf(c_3256,plain, 6.24/1.46 ( ~ less(X0,n2) | less(X0,n1) | n0 != n1 ), 6.24/1.46 inference(unflattening,[status(thm)],[c_3255]) ). 6.24/1.46 6.24/1.46 cnf(c_3258,plain, 6.24/1.46 ( ~ less(n1,n2) | less(n1,n1) | n0 != n1 ), 6.24/1.46 inference(instantiation,[status(thm)],[c_3256]) ). 6.24/1.46 6.24/1.46 cnf(c_77,plain, 6.24/1.46 ( push != pull ), 6.24/1.46 inference(cnf_transformation,[],[f244]) ). 6.24/1.46 6.24/1.46 cnf(c_81,plain, 6.24/1.46 ( ~ less(X0,X0) ), 6.24/1.46 inference(cnf_transformation,[],[f314]) ). 6.24/1.46 6.24/1.46 cnf(c_195,plain, 6.24/1.46 ( ~ less(n1,n1) ), 6.24/1.46 inference(instantiation,[status(thm)],[c_81]) ). 6.24/1.46 6.24/1.46 cnf(c_90,plain, 6.24/1.46 ( ~ less_or_equal(X0,n1) | less(X0,n2) ), 6.24/1.46 inference(cnf_transformation,[],[f258]) ). 6.24/1.46 6.24/1.46 cnf(c_178,plain, 6.24/1.46 ( ~ less_or_equal(n1,n1) | less(n1,n2) ), 6.24/1.46 inference(instantiation,[status(thm)],[c_90]) ). 6.24/1.46 6.24/1.46 cnf(c_112,plain, 6.24/1.46 ( less_or_equal(X0,X0) ), 6.24/1.46 inference(cnf_transformation,[],[f315]) ). 6.24/1.46 6.24/1.46 cnf(c_145,plain, 6.24/1.46 ( less_or_equal(n1,n1) ), 6.24/1.46 inference(instantiation,[status(thm)],[c_112]) ). 6.24/1.46 6.24/1.46 cnf(contradiction,plain, 6.24/1.46 ( $false ), 6.24/1.46 inference(minisat, 6.24/1.46 [status(thm)], 6.24/1.46 [c_23146,c_4430,c_3472,c_3258,c_77,c_195,c_178,c_145]) ). 6.24/1.46 6.24/1.46 6.24/1.46 % SZS output end CNFRefutation for theBenchmark.p 6.24/1.46 6.24/1.46 ------ Statistics 6.24/1.46 6.24/1.46 ------ General 6.24/1.46 6.24/1.46 abstr_ref_over_cycles: 0 6.24/1.46 abstr_ref_under_cycles: 0 6.24/1.46 gc_basic_clause_elim: 0 6.24/1.46 forced_gc_time: 0 6.24/1.46 parsing_time: 0.01 6.24/1.46 unif_index_cands_time: 0. 6.24/1.46 unif_index_add_time: 0. 6.24/1.46 orderings_time: 0. 6.24/1.46 out_proof_time: 0.019 6.24/1.46 total_time: 0.528 6.24/1.46 num_of_symbols: 69 6.24/1.46 num_of_terms: 8071 6.24/1.46 6.24/1.46 ------ Preprocessing 6.24/1.46 6.24/1.46 num_of_splits: 0 6.24/1.46 num_of_split_atoms: 0 6.24/1.46 num_of_reused_defs: 0 6.24/1.46 num_eq_ax_congr_red: 41 6.24/1.46 num_of_sem_filtered_clauses: 1 6.24/1.46 num_of_subtypes: 0 6.24/1.46 monotx_restored_types: 0 6.24/1.46 sat_num_of_epr_types: 0 6.24/1.46 sat_num_of_non_cyclic_types: 0 6.24/1.46 sat_guarded_non_collapsed_types: 0 6.24/1.46 num_pure_diseq_elim: 0 6.24/1.46 simp_replaced_by: 0 6.24/1.46 res_preprocessed: 381 6.24/1.46 prep_upred: 0 6.24/1.46 prep_unflattend: 881 6.24/1.46 smt_new_axioms: 0 6.24/1.46 pred_elim_cands: 7 6.24/1.46 pred_elim: 11 6.24/1.46 pred_elim_cl: 32 6.24/1.46 pred_elim_cycles: 19 6.24/1.46 merged_defs: 76 6.24/1.46 merged_defs_ncl: 0 6.24/1.46 bin_hyper_res: 76 6.24/1.46 prep_cycles: 4 6.24/1.46 pred_elim_time: 0.091 6.24/1.46 splitting_time: 0. 6.24/1.46 sem_filter_time: 0. 6.24/1.46 monotx_time: 0.001 6.24/1.46 subtype_inf_time: 0. 6.24/1.46 6.24/1.46 ------ Problem properties 6.24/1.46 6.24/1.46 clauses: 82 6.24/1.46 conjectures: 1 6.24/1.46 epr: 65 6.24/1.46 horn: 56 6.24/1.46 ground: 22 6.24/1.46 unary: 27 6.24/1.46 binary: 31 6.24/1.46 lits: 177 6.24/1.46 lits_eq: 54 6.24/1.46 fd_pure: 0 6.24/1.46 fd_pseudo: 0 6.24/1.46 fd_cond: 18 6.24/1.46 fd_pseudo_cond: 2 6.24/1.46 ac_symbols: 0 6.24/1.46 6.24/1.46 ------ Propositional Solver 6.24/1.46 6.24/1.46 prop_solver_calls: 26 6.24/1.46 prop_fast_solver_calls: 3356 6.24/1.46 smt_solver_calls: 0 6.24/1.46 smt_fast_solver_calls: 0 6.24/1.46 prop_num_of_clauses: 6036 6.24/1.46 prop_preprocess_simplified: 21597 6.24/1.46 prop_fo_subsumed: 128 6.24/1.46 prop_solver_time: 0. 6.24/1.46 smt_solver_time: 0. 6.24/1.46 smt_fast_solver_time: 0. 6.24/1.46 prop_fast_solver_time: 0. 6.24/1.46 prop_unsat_core_time: 0.001 6.24/1.46 6.24/1.46 ------ QBF 6.24/1.46 6.24/1.46 qbf_q_res: 0 6.24/1.46 qbf_num_tautologies: 0 6.24/1.46 qbf_prep_cycles: 0 6.24/1.46 6.24/1.46 ------ BMC1 6.24/1.46 6.24/1.46 bmc1_current_bound: -1 6.24/1.46 bmc1_last_solved_bound: -1 6.24/1.46 bmc1_unsat_core_size: -1 6.24/1.46 bmc1_unsat_core_parents_size: -1 6.24/1.46 bmc1_merge_next_fun: 0 6.24/1.46 bmc1_unsat_core_clauses_time: 0. 6.24/1.46 6.24/1.46 ------ Instantiation 6.24/1.46 6.24/1.46 inst_num_of_clauses: 1985 6.24/1.46 inst_num_in_passive: 568 6.24/1.46 inst_num_in_active: 996 6.24/1.46 inst_num_in_unprocessed: 421 6.24/1.46 inst_num_of_loops: 1110 6.24/1.46 inst_num_of_learning_restarts: 0 6.24/1.46 inst_num_moves_active_passive: 113 6.24/1.46 inst_lit_activity: 0 6.24/1.46 inst_lit_activity_moves: 0 6.24/1.46 inst_num_tautologies: 0 6.24/1.46 inst_num_prop_implied: 0 6.24/1.46 inst_num_existing_simplified: 0 6.24/1.46 inst_num_eq_res_simplified: 0 6.24/1.46 inst_num_child_elim: 0 6.24/1.46 inst_num_of_dismatching_blockings: 460 6.24/1.46 inst_num_of_non_proper_insts: 1875 6.24/1.46 inst_num_of_duplicates: 0 6.24/1.46 inst_inst_num_from_inst_to_res: 0 6.24/1.46 inst_dismatching_checking_time: 0. 6.24/1.46 6.24/1.46 ------ Resolution 6.24/1.46 6.24/1.46 res_num_of_clauses: 0 6.24/1.46 res_num_in_passive: 0 6.24/1.46 res_num_in_active: 0 6.24/1.46 res_num_of_loops: 385 6.24/1.46 res_forward_subset_subsumed: 362 6.24/1.46 res_backward_subset_subsumed: 6 6.24/1.46 res_forward_subsumed: 22 6.24/1.46 res_backward_subsumed: 2 6.24/1.46 res_forward_subsumption_resolution: 1 6.24/1.46 res_backward_subsumption_resolution: 0 6.24/1.46 res_clause_to_clause_subsumption: 1819 6.24/1.46 res_orphan_elimination: 0 6.24/1.46 res_tautology_del: 429 6.24/1.46 res_num_eq_res_simplified: 0 6.24/1.46 res_num_sel_changes: 0 6.24/1.46 res_moves_from_active_to_pass: 0 6.24/1.46 6.24/1.46 ------ Superposition 6.24/1.46 6.24/1.46 sup_time_total: 0. 6.24/1.46 sup_time_generating: 0. 6.24/1.46 sup_time_sim_full: 0. 6.24/1.46 sup_time_sim_immed: 0. 6.24/1.46 6.24/1.46 sup_num_of_clauses: 276 6.24/1.46 sup_num_in_active: 222 6.24/1.46 sup_num_in_passive: 54 6.24/1.46 sup_num_of_loops: 221 6.24/1.46 sup_fw_superposition: 195 6.24/1.46 sup_bw_superposition: 288 6.24/1.46 sup_immediate_simplified: 91 6.24/1.46 sup_given_eliminated: 0 6.24/1.46 comparisons_done: 0 6.24/1.46 comparisons_avoided: 0 6.24/1.46 6.24/1.46 ------ Simplifications 6.24/1.46 6.24/1.46 6.24/1.46 sim_fw_subset_subsumed: 67 6.24/1.46 sim_bw_subset_subsumed: 0 6.24/1.46 sim_fw_subsumed: 23 6.24/1.46 sim_bw_subsumed: 0 6.24/1.46 sim_fw_subsumption_res: 0 6.24/1.46 sim_bw_subsumption_res: 0 6.24/1.46 sim_tautology_del: 10 6.24/1.46 sim_eq_tautology_del: 42 6.24/1.46 sim_eq_res_simp: 0 6.24/1.46 sim_fw_demodulated: 0 6.24/1.46 sim_bw_demodulated: 0 6.24/1.46 sim_light_normalised: 1 6.24/1.46 sim_joinable_taut: 0 6.24/1.46 sim_joinable_simp: 0 6.24/1.46 sim_ac_normalised: 0 6.24/1.46 sim_smt_subsumption: 0 6.24/1.46 6.24/1.47 EOF