0.07/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : iproveropt_run.sh %d %s 0.13/0.35 % Computer : n004.cluster.edu 0.13/0.35 % Model : x86_64 x86_64 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.35 % Memory : 8042.1875MB 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 960 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Thu Jul 2 07:40:34 EDT 2020 0.13/0.35 % CPUTime : 0.13/0.35 % Running in FOF mode 43.62/6.00 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p 43.62/6.00 43.62/6.00 %---------------- iProver v3.3 (CASC-J10 2020) ----------------% 43.62/6.00 43.62/6.00 ------ iProver source info 43.62/6.00 43.62/6.00 git: date: 2020-06-30 10:37:57 +0100 43.62/6.00 git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388 43.62/6.00 git: non_committed_changes: false 43.62/6.00 git: last_make_outside_of_git: false 43.62/6.00 43.62/6.00 ------ 43.62/6.00 43.62/6.00 ------ Input Options 43.62/6.00 43.62/6.00 --out_options all 43.62/6.00 --tptp_safe_out true 43.62/6.00 --problem_path "" 43.62/6.00 --include_path "" 43.62/6.00 --clausifier res/vclausify_rel 43.62/6.00 --clausifier_options "" 43.62/6.00 --stdin false 43.62/6.00 --stats_out all 43.62/6.00 43.62/6.00 ------ General Options 43.62/6.00 43.62/6.00 --fof false 43.62/6.00 --time_out_real 125. 43.62/6.00 --time_out_virtual -1. 43.62/6.00 --symbol_type_check false 43.62/6.00 --clausify_out false 43.62/6.00 --sig_cnt_out false 43.62/6.00 --trig_cnt_out false 43.62/6.00 --trig_cnt_out_tolerance 1. 43.62/6.00 --trig_cnt_out_sk_spl false 43.62/6.00 --abstr_cl_out false 43.62/6.00 43.62/6.00 ------ Global Options 43.62/6.00 43.62/6.00 --schedule default 43.62/6.00 --add_important_lit false 43.62/6.00 --prop_solver_per_cl 1000 43.62/6.00 --min_unsat_core false 43.62/6.00 --soft_assumptions false 43.62/6.00 --soft_lemma_size 3 43.62/6.00 --prop_impl_unit_size 0 43.62/6.00 --prop_impl_unit [] 43.62/6.00 --share_sel_clauses true 43.62/6.00 --reset_solvers false 43.62/6.00 --bc_imp_inh [conj_cone] 43.62/6.00 --conj_cone_tolerance 3. 43.62/6.00 --extra_neg_conj none 43.62/6.00 --large_theory_mode true 43.62/6.00 --prolific_symb_bound 200 43.62/6.00 --lt_threshold 2000 43.62/6.00 --clause_weak_htbl true 43.62/6.00 --gc_record_bc_elim false 43.62/6.00 43.62/6.00 ------ Preprocessing Options 43.62/6.00 43.62/6.00 --preprocessing_flag true 43.62/6.00 --time_out_prep_mult 0.1 43.62/6.00 --splitting_mode input 43.62/6.00 --splitting_grd true 43.62/6.00 --splitting_cvd false 43.62/6.00 --splitting_cvd_svl false 43.62/6.00 --splitting_nvd 32 43.62/6.00 --sub_typing true 43.62/6.00 --prep_gs_sim true 43.62/6.00 --prep_unflatten true 43.62/6.00 --prep_res_sim true 43.62/6.00 --prep_upred true 43.62/6.00 --prep_sem_filter exhaustive 43.62/6.00 --prep_sem_filter_out false 43.62/6.00 --pred_elim true 43.62/6.00 --res_sim_input true 43.62/6.00 --eq_ax_congr_red true 43.62/6.00 --pure_diseq_elim true 43.62/6.00 --brand_transform false 43.62/6.00 --non_eq_to_eq false 43.62/6.00 --prep_def_merge true 43.62/6.00 --prep_def_merge_prop_impl false 43.62/6.00 --prep_def_merge_mbd true 43.62/6.00 --prep_def_merge_tr_red false 43.62/6.00 --prep_def_merge_tr_cl false 43.62/6.00 --smt_preprocessing true 43.62/6.00 --smt_ac_axioms fast 43.62/6.00 --preprocessed_out false 43.62/6.00 --preprocessed_stats false 43.62/6.00 43.62/6.00 ------ Abstraction refinement Options 43.62/6.00 43.62/6.00 --abstr_ref [] 43.62/6.00 --abstr_ref_prep false 43.62/6.00 --abstr_ref_until_sat false 43.62/6.00 --abstr_ref_sig_restrict funpre 43.62/6.00 --abstr_ref_af_restrict_to_split_sk false 43.62/6.00 --abstr_ref_under [] 43.62/6.00 43.62/6.00 ------ SAT Options 43.62/6.00 43.62/6.00 --sat_mode false 43.62/6.00 --sat_fm_restart_options "" 43.62/6.00 --sat_gr_def false 43.62/6.00 --sat_epr_types true 43.62/6.00 --sat_non_cyclic_types false 43.62/6.00 --sat_finite_models false 43.62/6.00 --sat_fm_lemmas false 43.62/6.00 --sat_fm_prep false 43.62/6.00 --sat_fm_uc_incr true 43.62/6.00 --sat_out_model small 43.62/6.00 --sat_out_clauses false 43.62/6.00 43.62/6.00 ------ QBF Options 43.62/6.00 43.62/6.00 --qbf_mode false 43.62/6.00 --qbf_elim_univ false 43.62/6.00 --qbf_dom_inst none 43.62/6.00 --qbf_dom_pre_inst false 43.62/6.00 --qbf_sk_in false 43.62/6.00 --qbf_pred_elim true 43.62/6.00 --qbf_split 512 43.62/6.00 43.62/6.00 ------ BMC1 Options 43.62/6.00 43.62/6.00 --bmc1_incremental false 43.62/6.00 --bmc1_axioms reachable_all 43.62/6.00 --bmc1_min_bound 0 43.62/6.00 --bmc1_max_bound -1 43.62/6.00 --bmc1_max_bound_default -1 43.62/6.00 --bmc1_symbol_reachability true 43.62/6.00 --bmc1_property_lemmas false 43.62/6.00 --bmc1_k_induction false 43.62/6.00 --bmc1_non_equiv_states false 43.62/6.00 --bmc1_deadlock false 43.62/6.00 --bmc1_ucm false 43.62/6.00 --bmc1_add_unsat_core none 43.62/6.00 --bmc1_unsat_core_children false 43.62/6.00 --bmc1_unsat_core_extrapolate_axioms false 43.62/6.00 --bmc1_out_stat full 43.62/6.00 --bmc1_ground_init false 43.62/6.00 --bmc1_pre_inst_next_state false 43.62/6.00 --bmc1_pre_inst_state false 43.62/6.00 --bmc1_pre_inst_reach_state false 43.62/6.00 --bmc1_out_unsat_core false 43.62/6.00 --bmc1_aig_witness_out false 43.62/6.00 --bmc1_verbose false 43.62/6.00 --bmc1_dump_clauses_tptp false 43.62/6.00 --bmc1_dump_unsat_core_tptp false 43.62/6.00 --bmc1_dump_file - 43.62/6.00 --bmc1_ucm_expand_uc_limit 128 43.62/6.00 --bmc1_ucm_n_expand_iterations 6 43.62/6.00 --bmc1_ucm_extend_mode 1 43.62/6.00 --bmc1_ucm_init_mode 2 43.62/6.00 --bmc1_ucm_cone_mode none 43.62/6.00 --bmc1_ucm_reduced_relation_type 0 43.62/6.00 --bmc1_ucm_relax_model 4 43.62/6.00 --bmc1_ucm_full_tr_after_sat true 43.62/6.00 --bmc1_ucm_expand_neg_assumptions false 43.62/6.00 --bmc1_ucm_layered_model none 43.62/6.00 --bmc1_ucm_max_lemma_size 10 43.62/6.00 43.62/6.00 ------ AIG Options 43.62/6.00 43.62/6.00 --aig_mode false 43.62/6.00 43.62/6.00 ------ Instantiation Options 43.62/6.00 43.62/6.00 --instantiation_flag true 43.62/6.00 --inst_sos_flag true 43.62/6.00 --inst_sos_phase true 43.62/6.00 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 43.62/6.00 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 43.62/6.00 --inst_lit_sel_side num_symb 43.62/6.00 --inst_solver_per_active 1400 43.62/6.00 --inst_solver_calls_frac 1. 43.62/6.00 --inst_passive_queue_type priority_queues 43.62/6.00 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 43.62/6.00 --inst_passive_queues_freq [25;2] 43.62/6.00 --inst_dismatching true 43.62/6.00 --inst_eager_unprocessed_to_passive true 43.62/6.00 --inst_prop_sim_given true 43.62/6.00 --inst_prop_sim_new false 43.62/6.00 --inst_subs_new false 43.62/6.00 --inst_eq_res_simp false 43.62/6.00 --inst_subs_given false 43.62/6.00 --inst_orphan_elimination true 43.62/6.00 --inst_learning_loop_flag true 43.62/6.00 --inst_learning_start 3000 43.62/6.00 --inst_learning_factor 2 43.62/6.00 --inst_start_prop_sim_after_learn 3 43.62/6.00 --inst_sel_renew solver 43.62/6.00 --inst_lit_activity_flag true 43.62/6.00 --inst_restr_to_given false 43.62/6.00 --inst_activity_threshold 500 43.62/6.00 --inst_out_proof true 43.62/6.00 43.62/6.00 ------ Resolution Options 43.62/6.00 43.62/6.00 --resolution_flag true 43.62/6.00 --res_lit_sel adaptive 43.62/6.00 --res_lit_sel_side none 43.62/6.00 --res_ordering kbo 43.62/6.00 --res_to_prop_solver active 43.62/6.00 --res_prop_simpl_new false 43.62/6.00 --res_prop_simpl_given true 43.62/6.00 --res_passive_queue_type priority_queues 43.62/6.00 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 43.62/6.00 --res_passive_queues_freq [15;5] 43.62/6.00 --res_forward_subs full 43.62/6.00 --res_backward_subs full 43.62/6.00 --res_forward_subs_resolution true 43.62/6.00 --res_backward_subs_resolution true 43.62/6.00 --res_orphan_elimination true 43.62/6.00 --res_time_limit 2. 43.62/6.00 --res_out_proof true 43.62/6.00 43.62/6.00 ------ Superposition Options 43.62/6.00 43.62/6.00 --superposition_flag true 43.62/6.00 --sup_passive_queue_type priority_queues 43.62/6.00 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 43.62/6.00 --sup_passive_queues_freq [8;1;4] 43.62/6.00 --demod_completeness_check fast 43.62/6.00 --demod_use_ground true 43.62/6.00 --sup_to_prop_solver passive 43.62/6.00 --sup_prop_simpl_new true 43.62/6.00 --sup_prop_simpl_given true 43.62/6.00 --sup_fun_splitting true 43.62/6.00 --sup_smt_interval 50000 43.62/6.00 43.62/6.00 ------ Superposition Simplification Setup 43.62/6.00 43.62/6.00 --sup_indices_passive [LightNormIndex;FwDemodIndex] 43.62/6.00 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 43.62/6.00 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 43.62/6.00 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 43.62/6.00 --sup_full_triv [TrivRules;PropSubs] 43.62/6.00 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 43.62/6.00 --sup_full_bw [BwDemod;BwSubsumption] 43.62/6.00 --sup_immed_triv [TrivRules] 43.62/6.00 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 43.62/6.00 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 43.62/6.00 --sup_immed_bw_main [] 43.62/6.00 --sup_immed_bw_immed [BwDemod;BwSubsumption] 43.62/6.00 --sup_input_triv [Unflattening;TrivRules] 43.62/6.00 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 43.62/6.00 --sup_input_bw [] 43.62/6.00 43.62/6.00 ------ Combination Options 43.62/6.00 43.62/6.00 --comb_res_mult 3 43.62/6.00 --comb_sup_mult 2 43.62/6.00 --comb_inst_mult 10 43.62/6.00 43.62/6.00 ------ Debug Options 43.62/6.00 43.62/6.00 --dbg_backtrace false 43.62/6.00 --dbg_dump_prop_clauses false 43.62/6.00 --dbg_dump_prop_clauses_file - 43.62/6.00 --dbg_out_stat false 43.62/6.00 ------ Parsing... 43.62/6.00 ------ Clausification by vclausify_rel & Parsing by iProver... 43.62/6.00 43.62/6.00 ------ Preprocessing... sf_s rm: 3 0s sf_e pe_s pe_e sf_s rm: 1 0s sf_e pe_s pe_e 43.62/6.00 43.62/6.00 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 43.62/6.00 43.62/6.00 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 43.62/6.00 ------ Proving... 43.62/6.00 ------ Problem Properties 43.62/6.00 43.62/6.00 43.62/6.00 clauses 17 43.62/6.00 conjectures 1 43.62/6.00 EPR 3 43.62/6.00 Horn 16 43.62/6.00 unary 7 43.62/6.00 binary 3 43.62/6.00 lits 40 43.62/6.00 lits eq 13 43.62/6.00 fd_pure 0 43.62/6.00 fd_pseudo 0 43.62/6.00 fd_cond 0 43.62/6.00 fd_pseudo_cond 0 43.62/6.00 AC symbols 0 43.62/6.00 43.62/6.00 ------ Schedule dynamic 5 is on 43.62/6.00 43.62/6.00 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 43.62/6.00 43.62/6.00 43.62/6.00 ------ 43.62/6.00 Current options: 43.62/6.00 ------ 43.62/6.00 43.62/6.00 ------ Input Options 43.62/6.00 43.62/6.00 --out_options all 43.62/6.00 --tptp_safe_out true 43.62/6.00 --problem_path "" 43.62/6.00 --include_path "" 43.62/6.00 --clausifier res/vclausify_rel 43.62/6.00 --clausifier_options "" 43.62/6.00 --stdin false 43.62/6.00 --stats_out all 43.62/6.00 43.62/6.00 ------ General Options 43.62/6.00 43.62/6.00 --fof false 43.62/6.00 --time_out_real 125. 43.62/6.00 --time_out_virtual -1. 43.62/6.00 --symbol_type_check false 43.62/6.00 --clausify_out false 43.62/6.00 --sig_cnt_out false 43.62/6.00 --trig_cnt_out false 43.62/6.00 --trig_cnt_out_tolerance 1. 43.62/6.00 --trig_cnt_out_sk_spl false 43.62/6.00 --abstr_cl_out false 43.62/6.00 43.62/6.00 ------ Global Options 43.62/6.00 43.62/6.00 --schedule default 43.62/6.00 --add_important_lit false 43.62/6.00 --prop_solver_per_cl 1000 43.62/6.00 --min_unsat_core false 43.62/6.00 --soft_assumptions false 43.62/6.00 --soft_lemma_size 3 43.62/6.00 --prop_impl_unit_size 0 43.62/6.00 --prop_impl_unit [] 43.62/6.00 --share_sel_clauses true 43.62/6.00 --reset_solvers false 43.62/6.00 --bc_imp_inh [conj_cone] 43.62/6.00 --conj_cone_tolerance 3. 43.62/6.00 --extra_neg_conj none 43.62/6.00 --large_theory_mode true 43.62/6.00 --prolific_symb_bound 200 43.62/6.00 --lt_threshold 2000 43.62/6.00 --clause_weak_htbl true 43.62/6.00 --gc_record_bc_elim false 43.62/6.00 43.62/6.00 ------ Preprocessing Options 43.62/6.00 43.62/6.00 --preprocessing_flag true 43.62/6.00 --time_out_prep_mult 0.1 43.62/6.00 --splitting_mode input 43.62/6.00 --splitting_grd true 43.62/6.00 --splitting_cvd false 43.62/6.00 --splitting_cvd_svl false 43.62/6.00 --splitting_nvd 32 43.62/6.00 --sub_typing true 43.62/6.00 --prep_gs_sim true 43.62/6.00 --prep_unflatten true 43.62/6.00 --prep_res_sim true 43.62/6.00 --prep_upred true 43.62/6.00 --prep_sem_filter exhaustive 43.62/6.00 --prep_sem_filter_out false 43.62/6.00 --pred_elim true 43.62/6.00 --res_sim_input true 43.62/6.00 --eq_ax_congr_red true 43.62/6.00 --pure_diseq_elim true 43.62/6.00 --brand_transform false 43.62/6.00 --non_eq_to_eq false 43.62/6.00 --prep_def_merge true 43.62/6.00 --prep_def_merge_prop_impl false 43.62/6.00 --prep_def_merge_mbd true 43.62/6.00 --prep_def_merge_tr_red false 43.62/6.00 --prep_def_merge_tr_cl false 43.62/6.00 --smt_preprocessing true 43.62/6.00 --smt_ac_axioms fast 43.62/6.00 --preprocessed_out false 43.62/6.00 --preprocessed_stats false 43.62/6.00 43.62/6.00 ------ Abstraction refinement Options 43.62/6.00 43.62/6.00 --abstr_ref [] 43.62/6.00 --abstr_ref_prep false 43.62/6.00 --abstr_ref_until_sat false 43.62/6.00 --abstr_ref_sig_restrict funpre 43.62/6.00 --abstr_ref_af_restrict_to_split_sk false 43.62/6.00 --abstr_ref_under [] 43.62/6.00 43.62/6.00 ------ SAT Options 43.62/6.00 43.62/6.00 --sat_mode false 43.62/6.00 --sat_fm_restart_options "" 43.62/6.00 --sat_gr_def false 43.62/6.00 --sat_epr_types true 43.62/6.00 --sat_non_cyclic_types false 43.62/6.00 --sat_finite_models false 43.62/6.00 --sat_fm_lemmas false 43.62/6.00 --sat_fm_prep false 43.62/6.00 --sat_fm_uc_incr true 43.62/6.00 --sat_out_model small 43.62/6.00 --sat_out_clauses false 43.62/6.00 43.62/6.00 ------ QBF Options 43.62/6.00 43.62/6.00 --qbf_mode false 43.62/6.00 --qbf_elim_univ false 43.62/6.00 --qbf_dom_inst none 43.62/6.00 --qbf_dom_pre_inst false 43.62/6.00 --qbf_sk_in false 43.62/6.00 --qbf_pred_elim true 43.62/6.00 --qbf_split 512 43.62/6.00 43.62/6.00 ------ BMC1 Options 43.62/6.00 43.62/6.00 --bmc1_incremental false 43.62/6.00 --bmc1_axioms reachable_all 43.62/6.00 --bmc1_min_bound 0 43.62/6.00 --bmc1_max_bound -1 43.62/6.00 --bmc1_max_bound_default -1 43.62/6.00 --bmc1_symbol_reachability true 43.62/6.00 --bmc1_property_lemmas false 43.62/6.00 --bmc1_k_induction false 43.62/6.00 --bmc1_non_equiv_states false 43.62/6.00 --bmc1_deadlock false 43.62/6.00 --bmc1_ucm false 43.62/6.00 --bmc1_add_unsat_core none 43.62/6.00 --bmc1_unsat_core_children false 43.62/6.00 --bmc1_unsat_core_extrapolate_axioms false 43.62/6.00 --bmc1_out_stat full 43.62/6.00 --bmc1_ground_init false 43.62/6.00 --bmc1_pre_inst_next_state false 43.62/6.00 --bmc1_pre_inst_state false 43.62/6.00 --bmc1_pre_inst_reach_state false 43.62/6.00 --bmc1_out_unsat_core false 43.62/6.00 --bmc1_aig_witness_out false 43.62/6.00 --bmc1_verbose false 43.62/6.00 --bmc1_dump_clauses_tptp false 43.62/6.00 --bmc1_dump_unsat_core_tptp false 43.62/6.00 --bmc1_dump_file - 43.62/6.00 --bmc1_ucm_expand_uc_limit 128 43.62/6.00 --bmc1_ucm_n_expand_iterations 6 43.62/6.00 --bmc1_ucm_extend_mode 1 43.62/6.00 --bmc1_ucm_init_mode 2 43.62/6.00 --bmc1_ucm_cone_mode none 43.62/6.00 --bmc1_ucm_reduced_relation_type 0 43.62/6.00 --bmc1_ucm_relax_model 4 43.62/6.00 --bmc1_ucm_full_tr_after_sat true 43.62/6.00 --bmc1_ucm_expand_neg_assumptions false 43.62/6.00 --bmc1_ucm_layered_model none 43.62/6.00 --bmc1_ucm_max_lemma_size 10 43.62/6.00 43.62/6.00 ------ AIG Options 43.62/6.00 43.62/6.00 --aig_mode false 43.62/6.00 43.62/6.00 ------ Instantiation Options 43.62/6.00 43.62/6.00 --instantiation_flag true 43.62/6.00 --inst_sos_flag true 43.62/6.00 --inst_sos_phase true 43.62/6.00 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 43.62/6.00 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 43.62/6.00 --inst_lit_sel_side none 43.62/6.00 --inst_solver_per_active 1400 43.62/6.00 --inst_solver_calls_frac 1. 43.62/6.00 --inst_passive_queue_type priority_queues 43.62/6.00 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 43.62/6.00 --inst_passive_queues_freq [25;2] 43.62/6.00 --inst_dismatching true 43.62/6.00 --inst_eager_unprocessed_to_passive true 43.62/6.00 --inst_prop_sim_given true 43.62/6.00 --inst_prop_sim_new false 43.62/6.00 --inst_subs_new false 43.62/6.00 --inst_eq_res_simp false 43.62/6.00 --inst_subs_given false 43.62/6.00 --inst_orphan_elimination true 43.62/6.00 --inst_learning_loop_flag true 43.62/6.00 --inst_learning_start 3000 43.62/6.00 --inst_learning_factor 2 43.62/6.00 --inst_start_prop_sim_after_learn 3 43.62/6.00 --inst_sel_renew solver 43.62/6.00 --inst_lit_activity_flag true 43.62/6.00 --inst_restr_to_given false 43.62/6.00 --inst_activity_threshold 500 43.62/6.00 --inst_out_proof true 43.62/6.00 43.62/6.00 ------ Resolution Options 43.62/6.00 43.62/6.00 --resolution_flag false 43.62/6.00 --res_lit_sel adaptive 43.62/6.00 --res_lit_sel_side none 43.62/6.00 --res_ordering kbo 43.62/6.00 --res_to_prop_solver active 43.62/6.00 --res_prop_simpl_new false 43.62/6.00 --res_prop_simpl_given true 43.62/6.00 --res_passive_queue_type priority_queues 43.62/6.00 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 43.62/6.00 --res_passive_queues_freq [15;5] 43.62/6.00 --res_forward_subs full 43.62/6.00 --res_backward_subs full 43.62/6.00 --res_forward_subs_resolution true 43.62/6.00 --res_backward_subs_resolution true 43.62/6.00 --res_orphan_elimination true 43.62/6.00 --res_time_limit 2. 43.62/6.00 --res_out_proof true 43.62/6.00 43.62/6.00 ------ Superposition Options 43.62/6.00 43.62/6.00 --superposition_flag true 43.62/6.00 --sup_passive_queue_type priority_queues 43.62/6.00 --sup_passive_queues [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]] 43.62/6.00 --sup_passive_queues_freq [8;1;4] 43.62/6.00 --demod_completeness_check fast 43.62/6.00 --demod_use_ground true 43.62/6.00 --sup_to_prop_solver passive 43.62/6.00 --sup_prop_simpl_new true 43.62/6.00 --sup_prop_simpl_given true 43.62/6.00 --sup_fun_splitting true 43.62/6.00 --sup_smt_interval 50000 43.62/6.00 43.62/6.00 ------ Superposition Simplification Setup 43.62/6.00 43.62/6.00 --sup_indices_passive [LightNormIndex;FwDemodIndex] 43.62/6.00 --sup_indices_active [SubsumptionIndex;BwDemodIndex] 43.62/6.00 --sup_indices_immed [SubsumptionIndex;FwDemodIndex;BwDemodIndex] 43.62/6.00 --sup_indices_input [SubsumptionIndex;LightNormIndex;FwDemodIndex] 43.62/6.00 --sup_full_triv [TrivRules;PropSubs] 43.62/6.00 --sup_full_fw [FwDemodLightNormLoopTriv;FwSubsumption;Joinability] 43.62/6.00 --sup_full_bw [BwDemod;BwSubsumption] 43.62/6.00 --sup_immed_triv [TrivRules] 43.62/6.00 --sup_immed_fw_main [Joinability;FwDemodLightNormLoopTriv;FwSubsumption] 43.62/6.00 --sup_immed_fw_immed [FwDemodLightNormLoopTriv;FwSubsumption] 43.62/6.00 --sup_immed_bw_main [] 43.62/6.00 --sup_immed_bw_immed [BwDemod;BwSubsumption] 43.62/6.00 --sup_input_triv [Unflattening;TrivRules] 43.62/6.00 --sup_input_fw [FwDemodLightNormLoopTriv;FwSubsumption] 43.62/6.00 --sup_input_bw [] 43.62/6.00 43.62/6.00 ------ Combination Options 43.62/6.00 43.62/6.00 --comb_res_mult 3 43.62/6.00 --comb_sup_mult 2 43.62/6.00 --comb_inst_mult 10 43.62/6.00 43.62/6.00 ------ Debug Options 43.62/6.00 43.62/6.00 --dbg_backtrace false 43.62/6.00 --dbg_dump_prop_clauses false 43.62/6.00 --dbg_dump_prop_clauses_file - 43.62/6.00 --dbg_out_stat false 43.62/6.00 43.62/6.00 43.62/6.00 43.62/6.00 43.62/6.00 ------ Proving... 43.62/6.00 43.62/6.00 43.62/6.00 % SZS status Theorem for theBenchmark.p 43.62/6.00 43.62/6.00 % SZS output start CNFRefutation for theBenchmark.p 43.62/6.00 43.62/6.00 fof(f1,axiom,( 43.62/6.00 ! [X0,X1] : ((le(X0,n) & (le(s(X0),X1) <=> le(s(perm(X1)),perm(X0))) & le(X1,n) & le(s(X0),X1) & le(s(n0),X0)) => (q(X0) != q(X1) & plus(q(X0),X0) != plus(q(X1),X1) & minus(q(X0),X0) != minus(q(X1),X1))) => queens_q), 43.62/6.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 43.62/6.00 43.62/6.00 fof(f17,plain,( 43.62/6.00 queens_q | ? [X0,X1] : ((q(X0) = q(X1) | plus(q(X0),X0) = plus(q(X1),X1) | minus(q(X0),X0) = minus(q(X1),X1)) & (le(X0,n) & (le(s(X0),X1) <=> le(s(perm(X1)),perm(X0))) & le(X1,n) & le(s(X0),X1) & le(s(n0),X0)))), 43.62/6.00 inference(ennf_transformation,[],[f1])). 43.62/6.00 43.62/6.00 fof(f18,plain,( 43.62/6.00 queens_q | ? [X0,X1] : ((q(X0) = q(X1) | plus(q(X0),X0) = plus(q(X1),X1) | minus(q(X0),X0) = minus(q(X1),X1)) & le(X0,n) & (le(s(X0),X1) <=> le(s(perm(X1)),perm(X0))) & le(X1,n) & le(s(X0),X1) & le(s(n0),X0))), 43.62/6.00 inference(flattening,[],[f17])). 43.62/6.00 43.62/6.00 fof(f27,plain,( 43.62/6.00 queens_q | ? [X0,X1] : ((q(X0) = q(X1) | plus(q(X0),X0) = plus(q(X1),X1) | minus(q(X0),X0) = minus(q(X1),X1)) & le(X0,n) & ((le(s(X0),X1) | ~le(s(perm(X1)),perm(X0))) & (le(s(perm(X1)),perm(X0)) | ~le(s(X0),X1))) & le(X1,n) & le(s(X0),X1) & le(s(n0),X0))), 43.62/6.00 inference(nnf_transformation,[],[f18])). 43.62/6.00 43.62/6.00 fof(f28,plain,( 43.62/6.00 queens_q | ? [X0,X1] : ((q(X0) = q(X1) | plus(q(X0),X0) = plus(q(X1),X1) | minus(q(X0),X0) = minus(q(X1),X1)) & le(X0,n) & (le(s(X0),X1) | ~le(s(perm(X1)),perm(X0))) & (le(s(perm(X1)),perm(X0)) | ~le(s(X0),X1)) & le(X1,n) & le(s(X0),X1) & le(s(n0),X0))), 43.62/6.00 inference(flattening,[],[f27])). 43.62/6.00 43.62/6.00 fof(f29,plain,( 43.62/6.00 ? [X0,X1] : ((q(X0) = q(X1) | plus(q(X0),X0) = plus(q(X1),X1) | minus(q(X0),X0) = minus(q(X1),X1)) & le(X0,n) & (le(s(X0),X1) | ~le(s(perm(X1)),perm(X0))) & (le(s(perm(X1)),perm(X0)) | ~le(s(X0),X1)) & le(X1,n) & le(s(X0),X1) & le(s(n0),X0)) => ((q(sK0) = q(sK1) | plus(q(sK0),sK0) = plus(q(sK1),sK1) | minus(q(sK0),sK0) = minus(q(sK1),sK1)) & le(sK0,n) & (le(s(sK0),sK1) | ~le(s(perm(sK1)),perm(sK0))) & (le(s(perm(sK1)),perm(sK0)) | ~le(s(sK0),sK1)) & le(sK1,n) & le(s(sK0),sK1) & le(s(n0),sK0))), 43.62/6.00 introduced(choice_axiom,[])). 43.62/6.00 43.62/6.00 fof(f30,plain,( 43.62/6.00 queens_q | ((q(sK0) = q(sK1) | plus(q(sK0),sK0) = plus(q(sK1),sK1) | minus(q(sK0),sK0) = minus(q(sK1),sK1)) & le(sK0,n) & (le(s(sK0),sK1) | ~le(s(perm(sK1)),perm(sK0))) & (le(s(perm(sK1)),perm(sK0)) | ~le(s(sK0),sK1)) & le(sK1,n) & le(s(sK0),sK1) & le(s(n0),sK0))), 43.62/6.00 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f28,f29])). 43.62/6.00 43.62/6.00 fof(f39,plain,( 43.62/6.00 queens_q | q(sK0) = q(sK1) | plus(q(sK0),sK0) = plus(q(sK1),sK1) | minus(q(sK0),sK0) = minus(q(sK1),sK1)), 43.62/6.00 inference(cnf_transformation,[],[f30])). 43.62/6.00 43.62/6.00 fof(f10,conjecture,( 43.62/6.00 (! [X0] : q(X0) = p(perm(X0)) & queens_p) => queens_q), 43.62/6.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 43.62/6.00 43.62/6.00 fof(f11,negated_conjecture,( 43.62/6.00 ~((! [X0] : q(X0) = p(perm(X0)) & queens_p) => queens_q)), 43.62/6.00 inference(negated_conjecture,[],[f10])). 43.62/6.00 43.62/6.00 fof(f25,plain,( 43.62/6.00 ~queens_q & (! [X0] : q(X0) = p(perm(X0)) & queens_p)), 43.62/6.00 inference(ennf_transformation,[],[f11])). 43.62/6.00 43.62/6.00 fof(f26,plain,( 43.62/6.00 ~queens_q & ! [X0] : q(X0) = p(perm(X0)) & queens_p), 43.62/6.00 inference(flattening,[],[f25])). 43.62/6.00 43.62/6.00 fof(f54,plain,( 43.62/6.00 ( ! [X0] : (q(X0) = p(perm(X0))) )), 43.62/6.00 inference(cnf_transformation,[],[f26])). 43.62/6.00 43.62/6.00 fof(f7,axiom,( 43.62/6.00 ! [X0] : perm(X0) = minus(s(n),X0)), 43.62/6.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 43.62/6.00 43.62/6.00 fof(f49,plain,( 43.62/6.00 ( ! [X0] : (perm(X0) = minus(s(n),X0)) )), 43.62/6.00 inference(cnf_transformation,[],[f7])). 43.62/6.00 43.62/6.00 fof(f56,plain,( 43.62/6.00 ( ! [X0] : (q(X0) = p(minus(s(n),X0))) )), 43.62/6.00 inference(definition_unfolding,[],[f54,f49])). 43.62/6.00 43.62/6.00 fof(f57,plain,( 43.62/6.00 queens_q | p(minus(s(n),sK0)) = p(minus(s(n),sK1)) | plus(p(minus(s(n),sK0)),sK0) = plus(p(minus(s(n),sK1)),sK1) | minus(p(minus(s(n),sK0)),sK0) = minus(p(minus(s(n),sK1)),sK1)), 43.62/6.00 inference(definition_unfolding,[],[f39,f56,f56,f56,f56,f56,f56])). 43.62/6.00 43.62/6.00 fof(f55,plain,( 43.62/6.00 ~queens_q), 43.62/6.00 inference(cnf_transformation,[],[f26])). 43.62/6.00 43.62/6.00 fof(f5,axiom,( 43.62/6.00 ! [X0,X1,X5,X6] : (minus(X0,X5) = minus(X6,X1) <=> plus(X0,X1) = plus(X5,X6))), 43.62/6.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 43.62/6.00 43.62/6.00 fof(f13,plain,( 43.62/6.00 ! [X0,X1,X2,X3] : (minus(X0,X2) = minus(X3,X1) <=> plus(X0,X1) = plus(X2,X3))), 43.62/6.00 inference(rectify,[],[f5])). 43.62/6.00 43.62/6.00 fof(f31,plain,( 43.62/6.00 ! [X0,X1,X2,X3] : ((minus(X0,X2) = minus(X3,X1) | plus(X0,X1) != plus(X2,X3)) & (plus(X0,X1) = plus(X2,X3) | minus(X0,X2) != minus(X3,X1)))), 43.62/6.00 inference(nnf_transformation,[],[f13])). 43.62/6.00 43.62/6.00 fof(f47,plain,( 43.62/6.00 ( ! [X2,X0,X3,X1] : (minus(X0,X2) = minus(X3,X1) | plus(X0,X1) != plus(X2,X3)) )), 43.62/6.00 inference(cnf_transformation,[],[f31])). 43.62/6.00 43.62/6.00 fof(f6,axiom,( 43.62/6.00 ! [X1,X0] : minus(X0,X1) = minus(perm(X1),perm(X0))), 43.62/6.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 43.62/6.00 43.62/6.00 fof(f14,plain,( 43.62/6.00 ! [X0,X1] : minus(X1,X0) = minus(perm(X0),perm(X1))), 43.62/6.00 inference(rectify,[],[f6])). 43.62/6.00 43.62/6.00 fof(f48,plain,( 43.62/6.00 ( ! [X0,X1] : (minus(X1,X0) = minus(perm(X0),perm(X1))) )), 43.62/6.00 inference(cnf_transformation,[],[f14])). 43.62/6.00 43.62/6.00 fof(f62,plain,( 43.62/6.00 ( ! [X0,X1] : (minus(X1,X0) = minus(minus(s(n),X0),minus(s(n),X1))) )), 43.62/6.00 inference(definition_unfolding,[],[f48,f49,f49])). 43.62/6.00 43.62/6.00 fof(f9,axiom,( 43.62/6.00 ! [X0,X1,X5,X6] : (minus(X0,X5) = minus(X1,X6) <=> minus(X0,X1) = minus(X5,X6))), 43.62/6.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 43.62/6.00 43.62/6.00 fof(f16,plain,( 43.62/6.00 ! [X0,X1,X2,X3] : (minus(X0,X2) = minus(X1,X3) <=> minus(X0,X1) = minus(X2,X3))), 43.62/6.00 inference(rectify,[],[f9])). 43.62/6.00 43.62/6.00 fof(f32,plain,( 43.62/6.00 ! [X0,X1,X2,X3] : ((minus(X0,X2) = minus(X1,X3) | minus(X0,X1) != minus(X2,X3)) & (minus(X0,X1) = minus(X2,X3) | minus(X0,X2) != minus(X1,X3)))), 43.62/6.00 inference(nnf_transformation,[],[f16])). 43.62/6.00 43.62/6.00 fof(f51,plain,( 43.62/6.00 ( ! [X2,X0,X3,X1] : (minus(X0,X1) = minus(X2,X3) | minus(X0,X2) != minus(X1,X3)) )), 43.62/6.00 inference(cnf_transformation,[],[f32])). 43.62/6.00 43.62/6.00 fof(f46,plain,( 43.62/6.00 ( ! [X2,X0,X3,X1] : (plus(X0,X1) = plus(X2,X3) | minus(X0,X2) != minus(X3,X1)) )), 43.62/6.00 inference(cnf_transformation,[],[f31])). 43.62/6.00 43.62/6.00 fof(f33,plain,( 43.62/6.00 queens_q | le(s(n0),sK0)), 43.62/6.00 inference(cnf_transformation,[],[f30])). 43.62/6.00 43.62/6.00 fof(f34,plain,( 43.62/6.00 queens_q | le(s(sK0),sK1)), 43.62/6.00 inference(cnf_transformation,[],[f30])). 43.62/6.00 43.62/6.00 fof(f35,plain,( 43.62/6.00 queens_q | le(sK1,n)), 43.62/6.00 inference(cnf_transformation,[],[f30])). 43.62/6.00 43.62/6.00 fof(f36,plain,( 43.62/6.00 queens_q | le(s(perm(sK1)),perm(sK0)) | ~le(s(sK0),sK1)), 43.62/6.00 inference(cnf_transformation,[],[f30])). 43.62/6.00 43.62/6.00 fof(f59,plain,( 43.62/6.00 queens_q | le(s(minus(s(n),sK1)),minus(s(n),sK0)) | ~le(s(sK0),sK1)), 43.62/6.00 inference(definition_unfolding,[],[f36,f49,f49])). 43.62/6.00 43.62/6.00 fof(f38,plain,( 43.62/6.00 queens_q | le(sK0,n)), 43.62/6.00 inference(cnf_transformation,[],[f30])). 43.62/6.00 43.62/6.00 fof(f4,axiom,( 43.62/6.00 ! [X2,X3,X4] : ((le(X3,X4) & le(X2,X3)) => le(X2,X4))), 43.62/6.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 43.62/6.01 43.62/6.01 fof(f12,plain,( 43.62/6.01 ! [X0,X1,X2] : ((le(X1,X2) & le(X0,X1)) => le(X0,X2))), 43.62/6.01 inference(rectify,[],[f4])). 43.62/6.01 43.62/6.01 fof(f23,plain,( 43.62/6.01 ! [X0,X1,X2] : (le(X0,X2) | (~le(X1,X2) | ~le(X0,X1)))), 43.62/6.01 inference(ennf_transformation,[],[f12])). 43.62/6.01 43.62/6.01 fof(f24,plain,( 43.62/6.01 ! [X0,X1,X2] : (le(X0,X2) | ~le(X1,X2) | ~le(X0,X1))), 43.62/6.01 inference(flattening,[],[f23])). 43.62/6.01 43.62/6.01 fof(f45,plain,( 43.62/6.01 ( ! [X2,X0,X1] : (le(X0,X2) | ~le(X1,X2) | ~le(X0,X1)) )), 43.62/6.01 inference(cnf_transformation,[],[f24])). 43.62/6.01 43.62/6.01 fof(f2,axiom,( 43.62/6.01 ! [X0] : ((le(X0,n) & le(s(n0),X0)) => (le(s(n0),perm(X0)) & le(perm(X0),n)))), 43.62/6.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 43.62/6.01 43.62/6.01 fof(f19,plain,( 43.62/6.01 ! [X0] : ((le(s(n0),perm(X0)) & le(perm(X0),n)) | (~le(X0,n) | ~le(s(n0),X0)))), 43.62/6.01 inference(ennf_transformation,[],[f2])). 43.62/6.01 43.62/6.01 fof(f20,plain,( 43.62/6.01 ! [X0] : ((le(s(n0),perm(X0)) & le(perm(X0),n)) | ~le(X0,n) | ~le(s(n0),X0))), 43.62/6.01 inference(flattening,[],[f19])). 43.62/6.01 43.62/6.01 fof(f40,plain,( 43.62/6.01 ( ! [X0] : (le(perm(X0),n) | ~le(X0,n) | ~le(s(n0),X0)) )), 43.62/6.01 inference(cnf_transformation,[],[f20])). 43.62/6.01 43.62/6.01 fof(f61,plain,( 43.62/6.01 ( ! [X0] : (le(minus(s(n),X0),n) | ~le(X0,n) | ~le(s(n0),X0)) )), 43.62/6.01 inference(definition_unfolding,[],[f40,f49])). 43.62/6.01 43.62/6.01 fof(f8,axiom,( 43.62/6.01 ! [X2] : le(X2,s(X2))), 43.62/6.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 43.62/6.01 43.62/6.01 fof(f15,plain,( 43.62/6.01 ! [X0] : le(X0,s(X0))), 43.62/6.01 inference(rectify,[],[f8])). 43.62/6.01 43.62/6.01 fof(f50,plain,( 43.62/6.01 ( ! [X0] : (le(X0,s(X0))) )), 43.62/6.01 inference(cnf_transformation,[],[f15])). 43.62/6.01 43.62/6.01 fof(f41,plain,( 43.62/6.01 ( ! [X0] : (le(s(n0),perm(X0)) | ~le(X0,n) | ~le(s(n0),X0)) )), 43.62/6.01 inference(cnf_transformation,[],[f20])). 43.62/6.01 43.62/6.01 fof(f60,plain,( 43.62/6.01 ( ! [X0] : (le(s(n0),minus(s(n),X0)) | ~le(X0,n) | ~le(s(n0),X0)) )), 43.62/6.01 inference(definition_unfolding,[],[f41,f49])). 43.62/6.01 43.62/6.01 fof(f3,axiom,( 43.62/6.01 queens_p => ! [X0,X1] : ((le(s(n0),X0) & le(s(X0),X1) & le(X1,n) & le(X0,n)) => (p(X0) != p(X1) & minus(p(X0),X0) != minus(p(X1),X1) & plus(p(X0),X0) != plus(p(X1),X1)))), 43.62/6.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 43.62/6.01 43.62/6.01 fof(f21,plain,( 43.62/6.01 ! [X0,X1] : ((p(X0) != p(X1) & minus(p(X0),X0) != minus(p(X1),X1) & plus(p(X0),X0) != plus(p(X1),X1)) | (~le(s(n0),X0) | ~le(s(X0),X1) | ~le(X1,n) | ~le(X0,n))) | ~queens_p), 43.62/6.01 inference(ennf_transformation,[],[f3])). 43.62/6.01 43.62/6.01 fof(f22,plain,( 43.62/6.01 ! [X0,X1] : ((p(X0) != p(X1) & minus(p(X0),X0) != minus(p(X1),X1) & plus(p(X0),X0) != plus(p(X1),X1)) | ~le(s(n0),X0) | ~le(s(X0),X1) | ~le(X1,n) | ~le(X0,n)) | ~queens_p), 43.62/6.01 inference(flattening,[],[f21])). 43.62/6.01 43.62/6.01 fof(f43,plain,( 43.62/6.01 ( ! [X0,X1] : (minus(p(X0),X0) != minus(p(X1),X1) | ~le(s(n0),X0) | ~le(s(X0),X1) | ~le(X1,n) | ~le(X0,n) | ~queens_p) )), 43.62/6.01 inference(cnf_transformation,[],[f22])). 43.62/6.01 43.62/6.01 fof(f53,plain,( 43.62/6.01 queens_p), 43.62/6.01 inference(cnf_transformation,[],[f26])). 43.62/6.01 43.62/6.01 fof(f42,plain,( 43.62/6.01 ( ! [X0,X1] : (plus(p(X0),X0) != plus(p(X1),X1) | ~le(s(n0),X0) | ~le(s(X0),X1) | ~le(X1,n) | ~le(X0,n) | ~queens_p) )), 43.62/6.01 inference(cnf_transformation,[],[f22])). 43.62/6.01 43.62/6.01 fof(f44,plain,( 43.62/6.01 ( ! [X0,X1] : (p(X0) != p(X1) | ~le(s(n0),X0) | ~le(s(X0),X1) | ~le(X1,n) | ~le(X0,n) | ~queens_p) )), 43.62/6.01 inference(cnf_transformation,[],[f22])). 43.62/6.01 43.62/6.01 cnf(c_0,negated_conjecture, 43.62/6.01 ( queens_q 43.62/6.01 | plus(p(minus(s(n),sK0)),sK0) = plus(p(minus(s(n),sK1)),sK1) 43.62/6.01 | minus(p(minus(s(n),sK0)),sK0) = minus(p(minus(s(n),sK1)),sK1) 43.62/6.01 | p(minus(s(n),sK0)) = p(minus(s(n),sK1)) ), 43.62/6.01 inference(cnf_transformation,[],[f57]) ). 43.62/6.01 43.62/6.01 cnf(c_19,negated_conjecture, 43.62/6.01 ( ~ queens_q ), 43.62/6.01 inference(cnf_transformation,[],[f55]) ). 43.62/6.01 43.62/6.01 cnf(c_87,negated_conjecture, 43.62/6.01 ( plus(p(minus(s(n),sK0)),sK0) = plus(p(minus(s(n),sK1)),sK1) 43.62/6.01 | minus(p(minus(s(n),sK0)),sK0) = minus(p(minus(s(n),sK1)),sK1) 43.62/6.01 | p(minus(s(n),sK0)) = p(minus(s(n),sK1)) ), 43.62/6.01 inference(global_propositional_subsumption, 43.62/6.01 [status(thm)], 43.62/6.01 [c_0,c_19]) ). 43.62/6.01 43.62/6.01 cnf(c_364,negated_conjecture, 43.62/6.01 ( plus(p(minus(s(n),sK0)),sK0) = plus(p(minus(s(n),sK1)),sK1) 43.62/6.01 | minus(p(minus(s(n),sK0)),sK0) = minus(p(minus(s(n),sK1)),sK1) 43.62/6.01 | p(minus(s(n),sK0)) = p(minus(s(n),sK1)) ), 43.62/6.01 inference(subtyping,[status(esa)],[c_87]) ). 43.62/6.01 43.62/6.01 cnf(c_13,plain, 43.62/6.01 ( plus(X0,X1) != plus(X2,X3) | minus(X1,X3) = minus(X2,X0) ), 43.62/6.01 inference(cnf_transformation,[],[f47]) ). 43.62/6.01 43.62/6.01 cnf(c_369,plain, 43.62/6.01 ( plus(X0_39,X1_39) != plus(X2_39,X3_39) 43.62/6.01 | minus(X1_39,X3_39) = minus(X2_39,X0_39) ), 43.62/6.01 inference(subtyping,[status(esa)],[c_13]) ). 43.62/6.01 43.62/6.01 cnf(c_1195,plain, 43.62/6.01 ( plus(p(minus(s(n),sK0)),sK0) != plus(X0_39,X1_39) 43.62/6.01 | minus(p(minus(s(n),sK1)),X0_39) = minus(X1_39,sK1) 43.62/6.01 | minus(p(minus(s(n),sK1)),sK1) = minus(p(minus(s(n),sK0)),sK0) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_364,c_369]) ). 43.62/6.01 43.62/6.01 cnf(c_1394,plain, 43.62/6.01 ( minus(p(minus(s(n),sK1)),p(minus(s(n),sK0))) = minus(sK0,sK1) 43.62/6.01 | minus(p(minus(s(n),sK1)),sK1) = minus(p(minus(s(n),sK0)),sK0) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(equality_resolution,[status(thm)],[c_1195]) ). 43.62/6.01 43.62/6.01 cnf(c_15,plain, 43.62/6.01 ( minus(minus(s(n),X0),minus(s(n),X1)) = minus(X1,X0) ), 43.62/6.01 inference(cnf_transformation,[],[f62]) ). 43.62/6.01 43.62/6.01 cnf(c_367,plain, 43.62/6.01 ( minus(minus(s(n),X0_39),minus(s(n),X1_39)) = minus(X1_39,X0_39) ), 43.62/6.01 inference(subtyping,[status(esa)],[c_15]) ). 43.62/6.01 43.62/6.01 cnf(c_18,plain, 43.62/6.01 ( minus(X0,X1) != minus(X2,X3) | minus(X3,X1) = minus(X2,X0) ), 43.62/6.01 inference(cnf_transformation,[],[f51]) ). 43.62/6.01 43.62/6.01 cnf(c_365,plain, 43.62/6.01 ( minus(X0_39,X1_39) != minus(X2_39,X3_39) 43.62/6.01 | minus(X3_39,X1_39) = minus(X2_39,X0_39) ), 43.62/6.01 inference(subtyping,[status(esa)],[c_18]) ). 43.62/6.01 43.62/6.01 cnf(c_1125,plain, 43.62/6.01 ( minus(X0_39,X1_39) != minus(X2_39,X3_39) 43.62/6.01 | minus(X0_39,minus(s(n),X3_39)) = minus(X1_39,minus(s(n),X2_39)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_367,c_365]) ). 43.62/6.01 43.62/6.01 cnf(c_1846,plain, 43.62/6.01 ( minus(X0_39,X1_39) != minus(sK0,sK1) 43.62/6.01 | minus(p(minus(s(n),sK1)),sK1) = minus(p(minus(s(n),sK0)),sK0) 43.62/6.01 | minus(p(minus(s(n),sK0)),minus(s(n),X0_39)) = minus(p(minus(s(n),sK1)),minus(s(n),X1_39)) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_1394,c_1125]) ). 43.62/6.01 43.62/6.01 cnf(c_2806,plain, 43.62/6.01 ( minus(p(minus(s(n),sK1)),minus(s(n),sK1)) = minus(p(minus(s(n),sK0)),minus(s(n),sK0)) 43.62/6.01 | minus(p(minus(s(n),sK1)),sK1) = minus(p(minus(s(n),sK0)),sK0) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(equality_resolution,[status(thm)],[c_1846]) ). 43.62/6.01 43.62/6.01 cnf(c_14,plain, 43.62/6.01 ( plus(X0,X1) = plus(X2,X3) | minus(X1,X3) != minus(X2,X0) ), 43.62/6.01 inference(cnf_transformation,[],[f46]) ). 43.62/6.01 43.62/6.01 cnf(c_368,plain, 43.62/6.01 ( plus(X0_39,X1_39) = plus(X2_39,X3_39) 43.62/6.01 | minus(X1_39,X3_39) != minus(X2_39,X0_39) ), 43.62/6.01 inference(subtyping,[status(esa)],[c_14]) ). 43.62/6.01 43.62/6.01 cnf(c_22027,plain, 43.62/6.01 ( plus(X0_39,p(minus(s(n),sK1))) = plus(X1_39,minus(s(n),sK1)) 43.62/6.01 | minus(p(minus(s(n),sK1)),sK1) = minus(p(minus(s(n),sK0)),sK0) 43.62/6.01 | minus(p(minus(s(n),sK0)),minus(s(n),sK0)) != minus(X1_39,X0_39) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_2806,c_368]) ). 43.62/6.01 43.62/6.01 cnf(c_6,plain, 43.62/6.01 ( le(s(n0),sK0) | queens_q ), 43.62/6.01 inference(cnf_transformation,[],[f33]) ). 43.62/6.01 43.62/6.01 cnf(c_5,plain, 43.62/6.01 ( le(s(sK0),sK1) | queens_q ), 43.62/6.01 inference(cnf_transformation,[],[f34]) ). 43.62/6.01 43.62/6.01 cnf(c_4,plain, 43.62/6.01 ( le(sK1,n) | queens_q ), 43.62/6.01 inference(cnf_transformation,[],[f35]) ). 43.62/6.01 43.62/6.01 cnf(c_3,plain, 43.62/6.01 ( le(s(minus(s(n),sK1)),minus(s(n),sK0)) 43.62/6.01 | ~ le(s(sK0),sK1) 43.62/6.01 | queens_q ), 43.62/6.01 inference(cnf_transformation,[],[f59]) ). 43.62/6.01 43.62/6.01 cnf(c_1,plain, 43.62/6.01 ( le(sK0,n) | queens_q ), 43.62/6.01 inference(cnf_transformation,[],[f38]) ). 43.62/6.01 43.62/6.01 cnf(c_12,plain, 43.62/6.01 ( ~ le(X0,X1) | ~ le(X2,X0) | le(X2,X1) ), 43.62/6.01 inference(cnf_transformation,[],[f45]) ). 43.62/6.01 43.62/6.01 cnf(c_370,plain, 43.62/6.01 ( ~ le(X0_39,X1_39) | ~ le(X2_39,X0_39) | le(X2_39,X1_39) ), 43.62/6.01 inference(subtyping,[status(esa)],[c_12]) ). 43.62/6.01 43.62/6.01 cnf(c_936,plain, 43.62/6.01 ( ~ le(X0_39,s(sK0)) | le(X0_39,sK1) | ~ le(s(sK0),sK1) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_370]) ). 43.62/6.01 43.62/6.01 cnf(c_1110,plain, 43.62/6.01 ( ~ le(s(sK0),sK1) | ~ le(sK0,s(sK0)) | le(sK0,sK1) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_936]) ). 43.62/6.01 43.62/6.01 cnf(c_8,plain, 43.62/6.01 ( ~ le(X0,n) | le(minus(s(n),X0),n) | ~ le(s(n0),X0) ), 43.62/6.01 inference(cnf_transformation,[],[f61]) ). 43.62/6.01 43.62/6.01 cnf(c_371,plain, 43.62/6.01 ( ~ le(X0_39,n) | le(minus(s(n),X0_39),n) | ~ le(s(n0),X0_39) ), 43.62/6.01 inference(subtyping,[status(esa)],[c_8]) ). 43.62/6.01 43.62/6.01 cnf(c_1145,plain, 43.62/6.01 ( le(minus(s(n),sK0),n) | ~ le(s(n0),sK0) | ~ le(sK0,n) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_371]) ). 43.62/6.01 43.62/6.01 cnf(c_1148,plain, 43.62/6.01 ( le(minus(s(n),sK1),n) | ~ le(s(n0),sK1) | ~ le(sK1,n) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_371]) ). 43.62/6.01 43.62/6.01 cnf(c_763,plain, 43.62/6.01 ( ~ le(X0_39,sK1) | ~ le(s(n0),X0_39) | le(s(n0),sK1) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_370]) ). 43.62/6.01 43.62/6.01 cnf(c_1418,plain, 43.62/6.01 ( le(s(n0),sK1) | ~ le(s(n0),sK0) | ~ le(sK0,sK1) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_763]) ). 43.62/6.01 43.62/6.01 cnf(c_16,plain, 43.62/6.01 ( le(X0,s(X0)) ), 43.62/6.01 inference(cnf_transformation,[],[f50]) ). 43.62/6.01 43.62/6.01 cnf(c_366,plain, 43.62/6.01 ( le(X0_39,s(X0_39)) ), 43.62/6.01 inference(subtyping,[status(esa)],[c_16]) ). 43.62/6.01 43.62/6.01 cnf(c_1454,plain, 43.62/6.01 ( le(sK0,s(sK0)) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_366]) ). 43.62/6.01 43.62/6.01 cnf(c_7,plain, 43.62/6.01 ( ~ le(X0,n) | ~ le(s(n0),X0) | le(s(n0),minus(s(n),X0)) ), 43.62/6.01 inference(cnf_transformation,[],[f60]) ). 43.62/6.01 43.62/6.01 cnf(c_372,plain, 43.62/6.01 ( ~ le(X0_39,n) | ~ le(s(n0),X0_39) | le(s(n0),minus(s(n),X0_39)) ), 43.62/6.01 inference(subtyping,[status(esa)],[c_7]) ). 43.62/6.01 43.62/6.01 cnf(c_2643,plain, 43.62/6.01 ( le(s(n0),minus(s(n),sK1)) | ~ le(s(n0),sK1) | ~ le(sK1,n) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_372]) ). 43.62/6.01 43.62/6.01 cnf(c_10,plain, 43.62/6.01 ( ~ le(X0,n) 43.62/6.01 | ~ le(X1,n) 43.62/6.01 | ~ le(s(X0),X1) 43.62/6.01 | ~ le(s(n0),X0) 43.62/6.01 | ~ queens_p 43.62/6.01 | minus(p(X1),X1) != minus(p(X0),X0) ), 43.62/6.01 inference(cnf_transformation,[],[f43]) ). 43.62/6.01 43.62/6.01 cnf(c_20,negated_conjecture, 43.62/6.01 ( queens_p ), 43.62/6.01 inference(cnf_transformation,[],[f53]) ). 43.62/6.01 43.62/6.01 cnf(c_99,plain, 43.62/6.01 ( ~ le(s(n0),X0) 43.62/6.01 | ~ le(s(X0),X1) 43.62/6.01 | ~ le(X1,n) 43.62/6.01 | ~ le(X0,n) 43.62/6.01 | minus(p(X1),X1) != minus(p(X0),X0) ), 43.62/6.01 inference(global_propositional_subsumption, 43.62/6.01 [status(thm)], 43.62/6.01 [c_10,c_20]) ). 43.62/6.01 43.62/6.01 cnf(c_100,plain, 43.62/6.01 ( ~ le(X0,n) 43.62/6.01 | ~ le(X1,n) 43.62/6.01 | ~ le(s(X0),X1) 43.62/6.01 | ~ le(s(n0),X0) 43.62/6.01 | minus(p(X1),X1) != minus(p(X0),X0) ), 43.62/6.01 inference(renaming,[status(thm)],[c_99]) ). 43.62/6.01 43.62/6.01 cnf(c_362,plain, 43.62/6.01 ( ~ le(X0_39,n) 43.62/6.01 | ~ le(X1_39,n) 43.62/6.01 | ~ le(s(X0_39),X1_39) 43.62/6.01 | ~ le(s(n0),X0_39) 43.62/6.01 | minus(p(X1_39),X1_39) != minus(p(X0_39),X0_39) ), 43.62/6.01 inference(subtyping,[status(esa)],[c_100]) ). 43.62/6.01 43.62/6.01 cnf(c_736,plain, 43.62/6.01 ( ~ le(X0_39,n) 43.62/6.01 | ~ le(minus(s(n),X1_39),n) 43.62/6.01 | ~ le(s(minus(s(n),X1_39)),X0_39) 43.62/6.01 | ~ le(s(n0),minus(s(n),X1_39)) 43.62/6.01 | minus(p(X0_39),X0_39) != minus(p(minus(s(n),X1_39)),minus(s(n),X1_39)) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_362]) ). 43.62/6.01 43.62/6.01 cnf(c_1463,plain, 43.62/6.01 ( ~ le(minus(s(n),X0_39),n) 43.62/6.01 | ~ le(minus(s(n),sK0),n) 43.62/6.01 | ~ le(s(minus(s(n),X0_39)),minus(s(n),sK0)) 43.62/6.01 | ~ le(s(n0),minus(s(n),X0_39)) 43.62/6.01 | minus(p(minus(s(n),sK0)),minus(s(n),sK0)) != minus(p(minus(s(n),X0_39)),minus(s(n),X0_39)) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_736]) ). 43.62/6.01 43.62/6.01 cnf(c_3625,plain, 43.62/6.01 ( ~ le(minus(s(n),sK1),n) 43.62/6.01 | ~ le(minus(s(n),sK0),n) 43.62/6.01 | ~ le(s(minus(s(n),sK1)),minus(s(n),sK0)) 43.62/6.01 | ~ le(s(n0),minus(s(n),sK1)) 43.62/6.01 | minus(p(minus(s(n),sK0)),minus(s(n),sK0)) != minus(p(minus(s(n),sK1)),minus(s(n),sK1)) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_1463]) ). 43.62/6.01 43.62/6.01 cnf(c_5470,plain, 43.62/6.01 ( plus(minus(s(n),sK1),p(minus(s(n),sK0))) != plus(p(minus(s(n),sK1)),minus(s(n),sK0)) 43.62/6.01 | minus(p(minus(s(n),sK0)),minus(s(n),sK0)) = minus(p(minus(s(n),sK1)),minus(s(n),sK1)) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_369]) ). 43.62/6.01 43.62/6.01 cnf(c_21984,plain, 43.62/6.01 ( plus(p(minus(s(n),sK1)),X0_39) = plus(minus(s(n),sK1),X1_39) 43.62/6.01 | minus(p(minus(s(n),sK1)),sK1) = minus(p(minus(s(n),sK0)),sK0) 43.62/6.01 | minus(p(minus(s(n),sK0)),minus(s(n),sK0)) != minus(X1_39,X0_39) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_2806,c_368]) ). 43.62/6.01 43.62/6.01 cnf(c_24986,plain, 43.62/6.01 ( plus(minus(s(n),sK1),p(minus(s(n),sK0))) = plus(p(minus(s(n),sK1)),minus(s(n),sK0)) 43.62/6.01 | minus(p(minus(s(n),sK1)),sK1) = minus(p(minus(s(n),sK0)),sK0) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(equality_resolution,[status(thm)],[c_21984]) ). 43.62/6.01 43.62/6.01 cnf(c_24991,plain, 43.62/6.01 ( minus(p(minus(s(n),sK1)),sK1) = minus(p(minus(s(n),sK0)),sK0) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(global_propositional_subsumption, 43.62/6.01 [status(thm)], 43.62/6.01 [c_22027,c_19,c_6,c_5,c_4,c_3,c_1,c_1110,c_1145,c_1148, 43.62/6.01 c_1418,c_1454,c_2643,c_3625,c_5470,c_24986]) ). 43.62/6.01 43.62/6.01 cnf(c_25031,plain, 43.62/6.01 ( minus(X0_39,minus(s(n),p(minus(s(n),sK1)))) = minus(X1_39,minus(s(n),sK1)) 43.62/6.01 | minus(p(minus(s(n),sK0)),sK0) != minus(X1_39,X0_39) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_24991,c_1125]) ). 43.62/6.01 43.62/6.01 cnf(c_72673,plain, 43.62/6.01 ( minus(sK0,minus(s(n),p(minus(s(n),sK1)))) = minus(p(minus(s(n),sK0)),minus(s(n),sK1)) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(equality_resolution,[status(thm)],[c_25031]) ). 43.62/6.01 43.62/6.01 cnf(c_1852,plain, 43.62/6.01 ( minus(X0_39,minus(s(n),X1_39)) = minus(X1_39,minus(s(n),X0_39)) ), 43.62/6.01 inference(equality_resolution,[status(thm)],[c_1125]) ). 43.62/6.01 43.62/6.01 cnf(c_13971,plain, 43.62/6.01 ( minus(X0_39,minus(s(n),X1_39)) != minus(X2_39,X3_39) 43.62/6.01 | minus(minus(s(n),X0_39),X3_39) = minus(X1_39,X2_39) ), 43.62/6.01 inference(superposition,[status(thm)],[c_1852,c_365]) ). 43.62/6.01 43.62/6.01 cnf(c_116598,plain, 43.62/6.01 ( minus(minus(s(n),X0_39),minus(s(n),sK1)) = minus(X1_39,p(minus(s(n),sK0))) 43.62/6.01 | minus(sK0,minus(s(n),p(minus(s(n),sK1)))) != minus(X0_39,minus(s(n),X1_39)) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_72673,c_13971]) ). 43.62/6.01 43.62/6.01 cnf(c_116888,plain, 43.62/6.01 ( minus(X0_39,p(minus(s(n),sK0))) = minus(sK1,X1_39) 43.62/6.01 | minus(sK0,minus(s(n),p(minus(s(n),sK1)))) != minus(X1_39,minus(s(n),X0_39)) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(demodulation,[status(thm)],[c_116598,c_367]) ). 43.62/6.01 43.62/6.01 cnf(c_11,plain, 43.62/6.01 ( ~ le(X0,n) 43.62/6.01 | ~ le(X1,n) 43.62/6.01 | ~ le(s(X0),X1) 43.62/6.01 | ~ le(s(n0),X0) 43.62/6.01 | ~ queens_p 43.62/6.01 | plus(p(X1),X1) != plus(p(X0),X0) ), 43.62/6.01 inference(cnf_transformation,[],[f42]) ). 43.62/6.01 43.62/6.01 cnf(c_92,plain, 43.62/6.01 ( ~ le(s(n0),X0) 43.62/6.01 | ~ le(s(X0),X1) 43.62/6.01 | ~ le(X1,n) 43.62/6.01 | ~ le(X0,n) 43.62/6.01 | plus(p(X1),X1) != plus(p(X0),X0) ), 43.62/6.01 inference(global_propositional_subsumption, 43.62/6.01 [status(thm)], 43.62/6.01 [c_11,c_20]) ). 43.62/6.01 43.62/6.01 cnf(c_93,plain, 43.62/6.01 ( ~ le(X0,n) 43.62/6.01 | ~ le(X1,n) 43.62/6.01 | ~ le(s(X0),X1) 43.62/6.01 | ~ le(s(n0),X0) 43.62/6.01 | plus(p(X1),X1) != plus(p(X0),X0) ), 43.62/6.01 inference(renaming,[status(thm)],[c_92]) ). 43.62/6.01 43.62/6.01 cnf(c_363,plain, 43.62/6.01 ( ~ le(X0_39,n) 43.62/6.01 | ~ le(X1_39,n) 43.62/6.01 | ~ le(s(X0_39),X1_39) 43.62/6.01 | ~ le(s(n0),X0_39) 43.62/6.01 | plus(p(X1_39),X1_39) != plus(p(X0_39),X0_39) ), 43.62/6.01 inference(subtyping,[status(esa)],[c_93]) ). 43.62/6.01 43.62/6.01 cnf(c_2060,plain, 43.62/6.01 ( ~ le(X0_39,n) 43.62/6.01 | ~ le(minus(s(n),sK1),n) 43.62/6.01 | ~ le(s(minus(s(n),sK1)),X0_39) 43.62/6.01 | ~ le(s(n0),minus(s(n),sK1)) 43.62/6.01 | plus(p(X0_39),X0_39) != plus(p(minus(s(n),sK1)),minus(s(n),sK1)) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_363]) ). 43.62/6.01 43.62/6.01 cnf(c_7332,plain, 43.62/6.01 ( ~ le(minus(s(n),sK1),n) 43.62/6.01 | ~ le(minus(s(n),sK0),n) 43.62/6.01 | ~ le(s(minus(s(n),sK1)),minus(s(n),sK0)) 43.62/6.01 | ~ le(s(n0),minus(s(n),sK1)) 43.62/6.01 | plus(p(minus(s(n),sK0)),minus(s(n),sK0)) != plus(p(minus(s(n),sK1)),minus(s(n),sK1)) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_2060]) ). 43.62/6.01 43.62/6.01 cnf(c_12556,plain, 43.62/6.01 ( plus(p(minus(s(n),sK0)),minus(s(n),sK0)) = plus(p(minus(s(n),sK1)),minus(s(n),sK1)) 43.62/6.01 | minus(minus(s(n),sK0),minus(s(n),sK1)) != minus(p(minus(s(n),sK1)),p(minus(s(n),sK0))) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_368]) ). 43.62/6.01 43.62/6.01 cnf(c_24226,plain, 43.62/6.01 ( minus(minus(s(n),sK0),minus(s(n),sK1)) = minus(p(minus(s(n),sK1)),p(minus(s(n),sK0))) 43.62/6.01 | minus(p(minus(s(n),sK0)),minus(s(n),sK1)) != minus(p(minus(s(n),sK1)),minus(s(n),sK0)) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_365]) ). 43.62/6.01 43.62/6.01 cnf(c_34074,plain, 43.62/6.01 ( plus(minus(s(n),sK0),p(minus(s(n),sK0))) != plus(p(minus(s(n),sK1)),minus(s(n),sK1)) 43.62/6.01 | minus(p(minus(s(n),sK0)),minus(s(n),sK1)) = minus(p(minus(s(n),sK1)),minus(s(n),sK0)) ), 43.62/6.01 inference(instantiation,[status(thm)],[c_369]) ). 43.62/6.01 43.62/6.01 cnf(c_1126,plain, 43.62/6.01 ( minus(X0_39,X1_39) != minus(X2_39,X3_39) 43.62/6.01 | minus(minus(s(n),X3_39),X0_39) = minus(minus(s(n),X2_39),X1_39) ), 43.62/6.01 inference(superposition,[status(thm)],[c_367,c_365]) ). 43.62/6.01 43.62/6.01 cnf(c_13953,plain, 43.62/6.01 ( minus(X0_39,minus(s(n),X1_39)) != minus(X2_39,X3_39) 43.62/6.01 | minus(minus(s(n),X2_39),minus(s(n),X0_39)) = minus(minus(s(n),X3_39),X1_39) ), 43.62/6.01 inference(superposition,[status(thm)],[c_1852,c_1126]) ). 43.62/6.01 43.62/6.01 cnf(c_14171,plain, 43.62/6.01 ( minus(X0_39,minus(s(n),X1_39)) != minus(X2_39,X3_39) 43.62/6.01 | minus(minus(s(n),X3_39),X1_39) = minus(X0_39,X2_39) ), 43.62/6.01 inference(demodulation,[status(thm)],[c_13953,c_367]) ). 43.62/6.01 43.62/6.01 cnf(c_15113,plain, 43.62/6.01 ( minus(X0_39,X1_39) != minus(X2_39,X3_39) 43.62/6.01 | minus(minus(s(n),X1_39),X2_39) = minus(minus(s(n),X3_39),X0_39) ), 43.62/6.01 inference(superposition,[status(thm)],[c_367,c_14171]) ). 43.62/6.01 43.62/6.01 cnf(c_16655,plain, 43.62/6.01 ( minus(X0_39,X1_39) != minus(X2_39,X3_39) 43.62/6.01 | minus(minus(s(n),minus(s(n),X2_39)),X0_39) = minus(minus(s(n),X1_39),minus(s(n),X3_39)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_367,c_15113]) ). 43.62/6.01 43.62/6.01 cnf(c_1127,plain, 43.62/6.01 ( minus(X0_39,X0_39) = minus(X1_39,X1_39) ), 43.62/6.01 inference(equality_resolution,[status(thm)],[c_365]) ). 43.62/6.01 43.62/6.01 cnf(c_1128,plain, 43.62/6.01 ( minus(X0_39,X0_39) = sP0_iProver_split ), 43.62/6.01 inference(splitting, 43.62/6.01 [splitting(split),new_symbols(definition,[sP0_iProver_split])], 43.62/6.01 [c_1127]) ). 43.62/6.01 43.62/6.01 cnf(c_5263,plain, 43.62/6.01 ( minus(sP0_iProver_split,minus(s(n),X0_39)) = minus(X0_39,s(n)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_1128,c_367]) ). 43.62/6.01 43.62/6.01 cnf(c_2452,plain, 43.62/6.01 ( minus(X0_39,X1_39) != minus(X2_39,X3_39) 43.62/6.01 | minus(minus(s(n),minus(s(n),X3_39)),X1_39) = minus(minus(s(n),minus(s(n),X2_39)),X0_39) ), 43.62/6.01 inference(superposition,[status(thm)],[c_367,c_1126]) ). 43.62/6.01 43.62/6.01 cnf(c_5338,plain, 43.62/6.01 ( minus(X0_39,s(n)) != minus(X1_39,X2_39) 43.62/6.01 | minus(minus(s(n),minus(s(n),X2_39)),minus(s(n),X0_39)) = minus(minus(s(n),minus(s(n),X1_39)),sP0_iProver_split) ), 43.62/6.01 inference(superposition,[status(thm)],[c_5263,c_2452]) ). 43.62/6.01 43.62/6.01 cnf(c_5264,plain, 43.62/6.01 ( minus(minus(s(n),X0_39),sP0_iProver_split) = minus(s(n),X0_39) ), 43.62/6.01 inference(superposition,[status(thm)],[c_1128,c_367]) ). 43.62/6.01 43.62/6.01 cnf(c_5398,plain, 43.62/6.01 ( minus(X0_39,s(n)) != minus(X1_39,X2_39) 43.62/6.01 | minus(s(n),minus(s(n),X1_39)) = minus(X0_39,minus(s(n),X2_39)) ), 43.62/6.01 inference(demodulation,[status(thm)],[c_5338,c_367,c_5264]) ). 43.62/6.01 43.62/6.01 cnf(c_9020,plain, 43.62/6.01 ( minus(X0_39,minus(s(n),s(n))) = minus(s(n),minus(s(n),X0_39)) ), 43.62/6.01 inference(equality_resolution,[status(thm)],[c_5398]) ). 43.62/6.01 43.62/6.01 cnf(c_9021,plain, 43.62/6.01 ( minus(s(n),minus(s(n),X0_39)) = minus(X0_39,sP0_iProver_split) ), 43.62/6.01 inference(demodulation,[status(thm)],[c_9020,c_1128]) ). 43.62/6.01 43.62/6.01 cnf(c_16677,plain, 43.62/6.01 ( minus(X0_39,X1_39) != minus(X2_39,X3_39) 43.62/6.01 | minus(minus(X0_39,sP0_iProver_split),X2_39) = minus(X1_39,X3_39) ), 43.62/6.01 inference(demodulation,[status(thm)],[c_16655,c_367,c_9021]) ). 43.62/6.01 43.62/6.01 cnf(c_16701,plain, 43.62/6.01 ( minus(X0_39,X1_39) != minus(X2_39,X3_39) 43.62/6.01 | minus(minus(X0_39,sP0_iProver_split),minus(s(n),X3_39)) = minus(X1_39,minus(s(n),X2_39)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_367,c_16677]) ). 43.62/6.01 43.62/6.01 cnf(c_14001,plain, 43.62/6.01 ( minus(minus(X0_39,minus(s(n),s(n))),minus(s(n),X1_39)) = minus(X1_39,minus(s(n),X0_39)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_1852,c_367]) ). 43.62/6.01 43.62/6.01 cnf(c_14117,plain, 43.62/6.01 ( minus(minus(X0_39,sP0_iProver_split),minus(s(n),X1_39)) = minus(X1_39,minus(s(n),X0_39)) ), 43.62/6.01 inference(demodulation,[status(thm)],[c_14001,c_1128]) ). 43.62/6.01 43.62/6.01 cnf(c_16720,plain, 43.62/6.01 ( minus(X0_39,X1_39) != minus(X2_39,X3_39) 43.62/6.01 | minus(X3_39,minus(s(n),X0_39)) = minus(X1_39,minus(s(n),X2_39)) ), 43.62/6.01 inference(demodulation,[status(thm)],[c_16701,c_14117]) ). 43.62/6.01 43.62/6.01 cnf(c_57405,plain, 43.62/6.01 ( minus(X0_39,minus(s(n),p(minus(s(n),sK1)))) = minus(sK1,minus(s(n),X1_39)) 43.62/6.01 | minus(p(minus(s(n),sK0)),sK0) != minus(X1_39,X0_39) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_24991,c_16720]) ). 43.62/6.01 43.62/6.01 cnf(c_73779,plain, 43.62/6.01 ( minus(sK0,minus(s(n),p(minus(s(n),sK1)))) = minus(sK1,minus(s(n),p(minus(s(n),sK0)))) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(equality_resolution,[status(thm)],[c_57405]) ). 43.62/6.01 43.62/6.01 cnf(c_25012,plain, 43.62/6.01 ( minus(p(minus(s(n),sK1)),minus(s(n),X0_39)) = minus(sK1,minus(s(n),X1_39)) 43.62/6.01 | minus(p(minus(s(n),sK0)),sK0) != minus(X1_39,X0_39) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_24991,c_1125]) ). 43.62/6.01 43.62/6.01 cnf(c_71954,plain, 43.62/6.01 ( minus(p(minus(s(n),sK1)),minus(s(n),sK0)) = minus(sK1,minus(s(n),p(minus(s(n),sK0)))) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(equality_resolution,[status(thm)],[c_25012]) ). 43.62/6.01 43.62/6.01 cnf(c_116668,plain, 43.62/6.01 ( plus(X0_39,p(minus(s(n),sK0))) = plus(X1_39,minus(s(n),sK1)) 43.62/6.01 | minus(sK0,minus(s(n),p(minus(s(n),sK1)))) != minus(X1_39,X0_39) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_72673,c_368]) ). 43.62/6.01 43.62/6.01 cnf(c_122763,plain, 43.62/6.01 ( plus(minus(s(n),sK0),p(minus(s(n),sK0))) = plus(p(minus(s(n),sK1)),minus(s(n),sK1)) 43.62/6.01 | minus(sK0,minus(s(n),p(minus(s(n),sK1)))) != minus(sK1,minus(s(n),p(minus(s(n),sK0)))) 43.62/6.01 | p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(superposition,[status(thm)],[c_71954,c_116668]) ). 43.62/6.01 43.62/6.01 cnf(c_122913,plain, 43.62/6.01 ( p(minus(s(n),sK1)) = p(minus(s(n),sK0)) ), 43.62/6.01 inference(global_propositional_subsumption, 43.62/6.01 [status(thm)], 43.62/6.01 [c_116888,c_19,c_6,c_5,c_4,c_3,c_1,c_1110,c_1145,c_1148, 43.62/6.01 c_1418,c_1454,c_2643,c_7332,c_12556,c_24226,c_34074, 43.62/6.01 c_73779,c_122763]) ). 43.62/6.01 43.62/6.01 cnf(c_9,plain, 43.62/6.01 ( ~ le(X0,n) 43.62/6.01 | ~ le(X1,n) 43.62/6.01 | ~ le(s(X0),X1) 43.62/6.01 | ~ le(s(n0),X0) 43.62/6.01 | ~ queens_p 43.62/6.01 | p(X1) != p(X0) ), 43.62/6.01 inference(cnf_transformation,[],[f44]) ). 43.62/6.01 43.62/6.01 cnf(c_106,plain, 43.62/6.01 ( ~ le(s(n0),X0) 43.62/6.01 | ~ le(s(X0),X1) 43.62/6.01 | ~ le(X1,n) 43.62/6.01 | ~ le(X0,n) 43.62/6.01 | p(X1) != p(X0) ), 43.62/6.01 inference(global_propositional_subsumption, 43.62/6.01 [status(thm)], 43.62/6.01 [c_9,c_20]) ). 43.62/6.01 43.62/6.01 cnf(c_107,plain, 43.62/6.01 ( ~ le(X0,n) 43.62/6.01 | ~ le(X1,n) 43.62/6.01 | ~ le(s(X0),X1) 43.62/6.01 | ~ le(s(n0),X0) 43.62/6.01 | p(X1) != p(X0) ), 43.62/6.01 inference(renaming,[status(thm)],[c_106]) ). 43.62/6.01 43.62/6.01 cnf(c_361,plain, 43.62/6.01 ( ~ le(X0_39,n) 43.62/6.01 | ~ le(X1_39,n) 43.62/6.01 | ~ le(s(X0_39),X1_39) 43.62/6.01 | ~ le(s(n0),X0_39) 43.62/6.01 | p(X1_39) != p(X0_39) ), 43.62/6.01 inference(subtyping,[status(esa)],[c_107]) ). 43.62/6.01 43.62/6.01 cnf(c_677,plain, 43.62/6.01 ( p(X0_39) != p(X1_39) 43.62/6.01 | le(X0_39,n) != iProver_top 43.62/6.01 | le(X1_39,n) != iProver_top 43.62/6.01 | le(s(X1_39),X0_39) != iProver_top 43.62/6.01 | le(s(n0),X1_39) != iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_361]) ). 43.62/6.01 43.62/6.01 cnf(c_123404,plain, 43.62/6.01 ( p(minus(s(n),sK0)) != p(X0_39) 43.62/6.01 | le(X0_39,n) != iProver_top 43.62/6.01 | le(minus(s(n),sK1),n) != iProver_top 43.62/6.01 | le(s(minus(s(n),sK1)),X0_39) != iProver_top 43.62/6.01 | le(s(n0),minus(s(n),sK1)) != iProver_top ), 43.62/6.01 inference(superposition,[status(thm)],[c_122913,c_677]) ). 43.62/6.01 43.62/6.01 cnf(c_22,plain, 43.62/6.01 ( queens_q != iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_19]) ). 43.62/6.01 43.62/6.01 cnf(c_46,plain, 43.62/6.01 ( le(s(n0),sK0) = iProver_top | queens_q = iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_6]) ). 43.62/6.01 43.62/6.01 cnf(c_47,plain, 43.62/6.01 ( le(s(sK0),sK1) = iProver_top | queens_q = iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_5]) ). 43.62/6.01 43.62/6.01 cnf(c_48,plain, 43.62/6.01 ( le(sK1,n) = iProver_top | queens_q = iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_4]) ). 43.62/6.01 43.62/6.01 cnf(c_1111,plain, 43.62/6.01 ( le(s(sK0),sK1) != iProver_top 43.62/6.01 | le(sK0,s(sK0)) != iProver_top 43.62/6.01 | le(sK0,sK1) = iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_1110]) ). 43.62/6.01 43.62/6.01 cnf(c_1149,plain, 43.62/6.01 ( le(minus(s(n),sK1),n) = iProver_top 43.62/6.01 | le(s(n0),sK1) != iProver_top 43.62/6.01 | le(sK1,n) != iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_1148]) ). 43.62/6.01 43.62/6.01 cnf(c_1421,plain, 43.62/6.01 ( le(s(n0),sK1) = iProver_top 43.62/6.01 | le(s(n0),sK0) != iProver_top 43.62/6.01 | le(sK0,sK1) != iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_1418]) ). 43.62/6.01 43.62/6.01 cnf(c_1455,plain, 43.62/6.01 ( le(sK0,s(sK0)) = iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_1454]) ). 43.62/6.01 43.62/6.01 cnf(c_2644,plain, 43.62/6.01 ( le(s(n0),minus(s(n),sK1)) = iProver_top 43.62/6.01 | le(s(n0),sK1) != iProver_top 43.62/6.01 | le(sK1,n) != iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_2643]) ). 43.62/6.01 43.62/6.01 cnf(c_173619,plain, 43.62/6.01 ( le(s(minus(s(n),sK1)),X0_39) != iProver_top 43.62/6.01 | p(minus(s(n),sK0)) != p(X0_39) 43.62/6.01 | le(X0_39,n) != iProver_top ), 43.62/6.01 inference(global_propositional_subsumption, 43.62/6.01 [status(thm)], 43.62/6.01 [c_123404,c_22,c_46,c_47,c_48,c_1111,c_1149,c_1421, 43.62/6.01 c_1455,c_2644]) ). 43.62/6.01 43.62/6.01 cnf(c_173620,plain, 43.62/6.01 ( p(minus(s(n),sK0)) != p(X0_39) 43.62/6.01 | le(X0_39,n) != iProver_top 43.62/6.01 | le(s(minus(s(n),sK1)),X0_39) != iProver_top ), 43.62/6.01 inference(renaming,[status(thm)],[c_173619]) ). 43.62/6.01 43.62/6.01 cnf(c_173626,plain, 43.62/6.01 ( le(minus(s(n),sK0),n) != iProver_top 43.62/6.01 | le(s(minus(s(n),sK1)),minus(s(n),sK0)) != iProver_top ), 43.62/6.01 inference(equality_resolution,[status(thm)],[c_173620]) ). 43.62/6.01 43.62/6.01 cnf(c_1146,plain, 43.62/6.01 ( le(minus(s(n),sK0),n) = iProver_top 43.62/6.01 | le(s(n0),sK0) != iProver_top 43.62/6.01 | le(sK0,n) != iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_1145]) ). 43.62/6.01 43.62/6.01 cnf(c_51,plain, 43.62/6.01 ( le(sK0,n) = iProver_top | queens_q = iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_1]) ). 43.62/6.01 43.62/6.01 cnf(c_49,plain, 43.62/6.01 ( le(s(minus(s(n),sK1)),minus(s(n),sK0)) = iProver_top 43.62/6.01 | le(s(sK0),sK1) != iProver_top 43.62/6.01 | queens_q = iProver_top ), 43.62/6.01 inference(predicate_to_equality,[status(thm)],[c_3]) ). 43.62/6.01 43.62/6.01 cnf(contradiction,plain, 43.62/6.01 ( $false ), 43.62/6.01 inference(minisat, 43.62/6.01 [status(thm)], 43.62/6.01 [c_173626,c_1146,c_51,c_49,c_47,c_46,c_22]) ). 43.62/6.01 43.62/6.01 43.62/6.01 % SZS output end CNFRefutation for theBenchmark.p 43.62/6.01 43.62/6.01 ------ Statistics 43.62/6.01 43.62/6.01 ------ General 43.62/6.01 43.62/6.01 abstr_ref_over_cycles: 0 43.62/6.01 abstr_ref_under_cycles: 0 43.62/6.01 gc_basic_clause_elim: 0 43.62/6.01 forced_gc_time: 0 43.62/6.01 parsing_time: 0.015 43.62/6.01 unif_index_cands_time: 0. 43.62/6.01 unif_index_add_time: 0. 43.62/6.01 orderings_time: 0. 43.62/6.01 out_proof_time: 0.023 43.62/6.01 total_time: 5.19 43.62/6.01 num_of_symbols: 51 43.62/6.01 num_of_terms: 60812 43.62/6.01 43.62/6.01 ------ Preprocessing 43.62/6.01 43.62/6.01 num_of_splits: 0 43.62/6.01 num_of_split_atoms: 7 43.62/6.01 num_of_reused_defs: 0 43.62/6.01 num_eq_ax_congr_red: 0 43.62/6.01 num_of_sem_filtered_clauses: 3 43.62/6.01 num_of_subtypes: 2 43.62/6.01 monotx_restored_types: 0 43.62/6.01 sat_num_of_epr_types: 0 43.62/6.01 sat_num_of_non_cyclic_types: 0 43.62/6.01 sat_guarded_non_collapsed_types: 0 43.62/6.01 num_pure_diseq_elim: 0 43.62/6.01 simp_replaced_by: 0 43.62/6.01 res_preprocessed: 89 43.62/6.01 prep_upred: 0 43.62/6.01 prep_unflattend: 0 43.62/6.01 smt_new_axioms: 0 43.62/6.01 pred_elim_cands: 1 43.62/6.01 pred_elim: 0 43.62/6.01 pred_elim_cl: 0 43.62/6.01 pred_elim_cycles: 2 43.62/6.01 merged_defs: 8 43.62/6.01 merged_defs_ncl: 0 43.62/6.01 bin_hyper_res: 9 43.62/6.01 prep_cycles: 4 43.62/6.01 pred_elim_time: 0. 43.62/6.01 splitting_time: 0. 43.62/6.01 sem_filter_time: 0. 43.62/6.01 monotx_time: 0. 43.62/6.01 subtype_inf_time: 0. 43.62/6.01 43.62/6.01 ------ Problem properties 43.62/6.01 43.62/6.01 clauses: 17 43.62/6.01 conjectures: 1 43.62/6.01 epr: 3 43.62/6.01 horn: 16 43.62/6.01 ground: 6 43.62/6.01 unary: 7 43.62/6.01 binary: 3 43.62/6.01 lits: 40 43.62/6.01 lits_eq: 13 43.62/6.01 fd_pure: 0 43.62/6.01 fd_pseudo: 0 43.62/6.01 fd_cond: 0 43.62/6.01 fd_pseudo_cond: 0 43.62/6.01 ac_symbols: 0 43.62/6.01 43.62/6.01 ------ Propositional Solver 43.62/6.01 43.62/6.01 prop_solver_calls: 52 43.62/6.01 prop_fast_solver_calls: 27321 43.62/6.01 smt_solver_calls: 0 43.62/6.01 smt_fast_solver_calls: 0 43.62/6.01 prop_num_of_clauses: 36096 43.62/6.01 prop_preprocess_simplified: 68449 43.62/6.01 prop_fo_subsumed: 8642 43.62/6.01 prop_solver_time: 0. 43.62/6.01 smt_solver_time: 0. 43.62/6.01 smt_fast_solver_time: 0. 43.62/6.01 prop_fast_solver_time: 0. 43.62/6.01 prop_unsat_core_time: 0.003 43.62/6.01 43.62/6.01 ------ QBF 43.62/6.01 43.62/6.01 qbf_q_res: 0 43.62/6.01 qbf_num_tautologies: 0 43.62/6.01 qbf_prep_cycles: 0 43.62/6.01 43.62/6.01 ------ BMC1 43.62/6.01 43.62/6.01 bmc1_current_bound: -1 43.62/6.01 bmc1_last_solved_bound: -1 43.62/6.01 bmc1_unsat_core_size: -1 43.62/6.01 bmc1_unsat_core_parents_size: -1 43.62/6.01 bmc1_merge_next_fun: 0 43.62/6.01 bmc1_unsat_core_clauses_time: 0. 43.62/6.01 43.62/6.01 ------ Instantiation 43.62/6.01 43.62/6.01 inst_num_of_clauses: 7254 43.62/6.01 inst_num_in_passive: 1351 43.62/6.01 inst_num_in_active: 7354 43.62/6.01 inst_num_in_unprocessed: 1356 43.62/6.01 inst_num_of_loops: 7749 43.62/6.01 inst_num_of_learning_restarts: 1 43.62/6.01 inst_num_moves_active_passive: 381 43.62/6.01 inst_lit_activity: 0 43.62/6.01 inst_lit_activity_moves: 3 43.62/6.01 inst_num_tautologies: 0 43.62/6.01 inst_num_prop_implied: 0 43.62/6.01 inst_num_existing_simplified: 0 43.62/6.01 inst_num_eq_res_simplified: 0 43.62/6.01 inst_num_child_elim: 0 43.62/6.01 inst_num_of_dismatching_blockings: 32962 43.62/6.01 inst_num_of_non_proper_insts: 27139 43.62/6.01 inst_num_of_duplicates: 0 43.62/6.01 inst_inst_num_from_inst_to_res: 0 43.62/6.01 inst_dismatching_checking_time: 0. 43.62/6.01 43.62/6.01 ------ Resolution 43.62/6.01 43.62/6.01 res_num_of_clauses: 26 43.62/6.01 res_num_in_passive: 26 43.62/6.01 res_num_in_active: 0 43.62/6.01 res_num_of_loops: 93 43.62/6.01 res_forward_subset_subsumed: 919 43.62/6.01 res_backward_subset_subsumed: 24 43.62/6.01 res_forward_subsumed: 0 43.62/6.01 res_backward_subsumed: 0 43.62/6.01 res_forward_subsumption_resolution: 0 43.62/6.01 res_backward_subsumption_resolution: 0 43.62/6.01 res_clause_to_clause_subsumption: 238571 43.62/6.01 res_orphan_elimination: 0 43.62/6.01 res_tautology_del: 3503 43.62/6.01 res_num_eq_res_simplified: 0 43.62/6.01 res_num_sel_changes: 0 43.62/6.01 res_moves_from_active_to_pass: 0 43.62/6.01 43.62/6.01 ------ Superposition 43.62/6.01 43.62/6.01 sup_time_total: 0. 43.62/6.01 sup_time_generating: 0. 43.62/6.01 sup_time_sim_full: 0. 43.62/6.01 sup_time_sim_immed: 0. 43.62/6.01 43.62/6.01 sup_num_of_clauses: 2459 43.62/6.01 sup_num_in_active: 727 43.62/6.01 sup_num_in_passive: 1732 43.62/6.01 sup_num_of_loops: 1549 43.62/6.01 sup_fw_superposition: 17762 43.62/6.01 sup_bw_superposition: 12444 43.62/6.01 sup_immediate_simplified: 14586 43.62/6.01 sup_given_eliminated: 7 43.62/6.01 comparisons_done: 0 43.62/6.01 comparisons_avoided: 312 43.62/6.01 43.62/6.01 ------ Simplifications 43.62/6.01 43.62/6.01 43.62/6.01 sim_fw_subset_subsumed: 1224 43.62/6.01 sim_bw_subset_subsumed: 99 43.62/6.01 sim_fw_subsumed: 2391 43.62/6.01 sim_bw_subsumed: 463 43.62/6.01 sim_fw_subsumption_res: 0 43.62/6.01 sim_bw_subsumption_res: 0 43.62/6.01 sim_tautology_del: 103 43.62/6.01 sim_eq_tautology_del: 868 43.62/6.01 sim_eq_res_simp: 9 43.62/6.01 sim_fw_demodulated: 12232 43.62/6.01 sim_bw_demodulated: 518 43.62/6.01 sim_light_normalised: 2699 43.62/6.01 sim_joinable_taut: 0 43.62/6.01 sim_joinable_simp: 0 43.62/6.01 sim_ac_normalised: 0 43.62/6.01 sim_smt_subsumption: 0 43.62/6.01 43.62/6.02 EOF