%------------------------------------------------------------------------------ % File : iProverMo---2.5-0.1 % Problem : LCL643+1.005 : TPTP v9.3.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : iprover_modulo %s %d % Computer : n029.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:21:17 PM UTC 2026 % Result : Unknown 31.03s 31.36s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL643+1.005 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.04 % Command : iprover_modulo %s %d % 0.09/0.37 % Computer : n029.cluster.edu % 0.09/0.37 % Model : x86_64 x86_64 % 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.37 % Memory : 8046.5625MB % 0.09/0.37 % OS : Linux 6.8.0-71-generic % 0.09/0.37 % CPULimit : 300 % 0.09/0.37 % WCLimit : 300 % 0.09/0.37 % DateTime : Sat Sep 5 10:28:25 UTC 2026 % 0.09/0.37 % CPUTime : % 0.09/0.38 % Running in mono-core mode % 0.21/0.58 % Orienting using strategy Equiv(ClausalAll) % 0.21/0.58 % FOF problem with conjecture % 0.21/0.58 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f9906e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_56f2c4.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_cb5fa8 | grep -v "SZS" % 0.34/0.62 % 0.34/0.62 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 0.34/0.62 % 0.34/0.62 % % 0.34/0.62 % ------ iProver source info % 0.34/0.62 % 0.34/0.62 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 0.34/0.62 % git: non_committed_changes: true % 0.34/0.62 % git: last_make_outside_of_git: true % 0.34/0.62 % 0.34/0.62 % % 0.34/0.62 % ------ Input Options % 0.34/0.62 % 0.34/0.62 % --out_options all % 0.34/0.62 % --tptp_safe_out true % 0.34/0.62 % --problem_path "" % 0.34/0.62 % --include_path "" % 0.34/0.62 % --clausifier .//eprover % 0.34/0.62 % --clausifier_options --tstp-format % 0.34/0.62 % --stdin false % 0.34/0.62 % --dbg_backtrace false % 0.34/0.62 % --dbg_dump_prop_clauses false % 0.34/0.62 % --dbg_dump_prop_clauses_file - % 0.34/0.62 % --dbg_out_stat false % 0.34/0.62 % 0.34/0.62 % ------ General Options % 0.34/0.62 % 0.34/0.62 % --fof false % 0.34/0.62 % --time_out_real 150. % 0.34/0.62 % --time_out_prep_mult 0.2 % 0.34/0.62 % --time_out_virtual -1. % 0.34/0.62 % --schedule none % 0.34/0.62 % --ground_splitting input % 0.34/0.62 % --splitting_nvd 16 % 0.34/0.62 % --non_eq_to_eq false % 0.34/0.62 % --prep_gs_sim true % 0.34/0.62 % --prep_unflatten false % 0.34/0.62 % --prep_res_sim true % 0.34/0.62 % --prep_upred true % 0.34/0.62 % --res_sim_input true % 0.34/0.62 % --clause_weak_htbl true % 0.34/0.62 % --gc_record_bc_elim false % 0.34/0.62 % --symbol_type_check false % 0.34/0.62 % --clausify_out false % 0.34/0.62 % --large_theory_mode false % 0.34/0.62 % --prep_sem_filter none % 0.34/0.62 % --prep_sem_filter_out false % 0.34/0.62 % --preprocessed_out false % 0.34/0.62 % --sub_typing false % 0.34/0.62 % --brand_transform false % 0.34/0.62 % --pure_diseq_elim true % 0.34/0.62 % --min_unsat_core false % 0.34/0.62 % --pred_elim true % 0.34/0.62 % --add_important_lit false % 0.34/0.62 % --soft_assumptions false % 0.34/0.62 % --reset_solvers false % 0.34/0.62 % --bc_imp_inh [] % 0.34/0.62 % --conj_cone_tolerance 1.5 % 0.34/0.62 % --prolific_symb_bound 500 % 0.34/0.62 % --lt_threshold 2000 % 0.34/0.62 % 0.34/0.62 % ------ SAT Options % 0.34/0.62 % 0.34/0.62 % --sat_mode false % 0.34/0.62 % --sat_fm_restart_options "" % 0.34/0.62 % --sat_gr_def false % 0.34/0.62 % --sat_epr_types true % 0.34/0.62 % --sat_non_cyclic_types false % 0.34/0.62 % --sat_finite_models false % 0.34/0.62 % --sat_fm_lemmas false % 0.34/0.62 % --sat_fm_prep false % 0.34/0.62 % --sat_fm_uc_incr true % 0.34/0.62 % --sat_out_model small % 0.34/0.62 % --sat_out_clauses false % 0.34/0.62 % 0.34/0.62 % ------ QBF Options % 0.34/0.62 % 0.34/0.62 % --qbf_mode false % 0.34/0.62 % --qbf_elim_univ true % 0.34/0.62 % --qbf_sk_in true % 0.34/0.62 % --qbf_pred_elim true % 0.34/0.62 % --qbf_split 32 % 0.34/0.62 % 0.34/0.62 % ------ BMC1 Options % 0.34/0.62 % 0.34/0.62 % --bmc1_incremental false % 0.34/0.62 % --bmc1_axioms reachable_all % 0.34/0.62 % --bmc1_min_bound 0 % 0.34/0.62 % --bmc1_max_bound -1 % 0.34/0.62 % --bmc1_max_bound_default -1 % 0.34/0.62 % --bmc1_symbol_reachability true % 0.34/0.62 % --bmc1_property_lemmas false % 0.34/0.62 % --bmc1_k_induction false % 0.34/0.62 % --bmc1_non_equiv_states false % 0.34/0.62 % --bmc1_deadlock false % 0.34/0.62 % --bmc1_ucm false % 0.34/0.62 % --bmc1_add_unsat_core none % 0.34/0.62 % --bmc1_unsat_core_children false % 0.34/0.62 % --bmc1_unsat_core_extrapolate_axioms false % 0.34/0.62 % --bmc1_out_stat full % 0.34/0.62 % --bmc1_ground_init false % 0.34/0.62 % --bmc1_pre_inst_next_state false % 0.34/0.62 % --bmc1_pre_inst_state false % 0.34/0.62 % --bmc1_pre_inst_reach_state false % 0.34/0.62 % --bmc1_out_unsat_core false % 0.34/0.62 % --bmc1_aig_witness_out false % 0.34/0.62 % --bmc1_verbose false % 0.34/0.62 % --bmc1_dump_clauses_tptp false % 1.24/1.57 % --bmc1_dump_unsat_core_tptp false % 1.24/1.57 % --bmc1_dump_file - % 1.24/1.57 % --bmc1_ucm_expand_uc_limit 128 % 1.24/1.57 % --bmc1_ucm_n_expand_iterations 6 % 1.24/1.57 % --bmc1_ucm_extend_mode 1 % 1.24/1.57 % --bmc1_ucm_init_mode 2 % 1.24/1.57 % --bmc1_ucm_cone_mode none % 1.24/1.57 % --bmc1_ucm_reduced_relation_type 0 % 1.24/1.57 % --bmc1_ucm_relax_model 4 % 1.24/1.57 % --bmc1_ucm_full_tr_after_sat true % 1.24/1.57 % --bmc1_ucm_expand_neg_assumptions false % 1.24/1.57 % --bmc1_ucm_layered_model none % 1.24/1.57 % --bmc1_ucm_max_lemma_size 10 % 1.24/1.57 % 1.24/1.57 % ------ AIG Options % 1.24/1.57 % 1.24/1.57 % --aig_mode false % 1.24/1.57 % 1.24/1.57 % ------ Instantiation Options % 1.24/1.57 % 1.24/1.57 % --instantiation_flag true % 1.24/1.57 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 1.24/1.57 % --inst_solver_per_active 750 % 1.24/1.57 % --inst_solver_calls_frac 0.5 % 1.24/1.57 % --inst_passive_queue_type priority_queues % 1.24/1.57 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 1.24/1.57 % --inst_passive_queues_freq [25;2] % 1.24/1.57 % --inst_dismatching true % 1.24/1.57 % --inst_eager_unprocessed_to_passive true % 1.24/1.57 % --inst_prop_sim_given true % 1.24/1.57 % --inst_prop_sim_new false % 1.24/1.57 % --inst_orphan_elimination true % 1.24/1.57 % --inst_learning_loop_flag true % 1.24/1.57 % --inst_learning_start 3000 % 1.24/1.57 % --inst_learning_factor 2 % 1.24/1.57 % --inst_start_prop_sim_after_learn 3 % 1.24/1.57 % --inst_sel_renew solver % 1.24/1.57 % --inst_lit_activity_flag true % 1.24/1.57 % --inst_out_proof true % 1.24/1.57 % 1.24/1.57 % ------ Resolution Options % 1.24/1.57 % 1.24/1.57 % --resolution_flag true % 1.24/1.57 % --res_lit_sel kbo_max % 1.24/1.57 % --res_to_prop_solver none % 1.24/1.57 % --res_prop_simpl_new false % 1.24/1.57 % --res_prop_simpl_given false % 1.24/1.57 % --res_passive_queue_type priority_queues % 1.24/1.57 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 1.24/1.57 % --res_passive_queues_freq [15;5] % 1.24/1.57 % --res_forward_subs full % 1.24/1.57 % --res_backward_subs full % 1.24/1.57 % --res_forward_subs_resolution true % 1.24/1.57 % --res_backward_subs_resolution true % 1.24/1.57 % --res_orphan_elimination false % 1.24/1.57 % --res_time_limit 1000. % 1.24/1.57 % --res_out_proof true % 1.24/1.57 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f9906e.s % 1.24/1.57 % --modulo true % 1.24/1.57 % 1.24/1.57 % ------ Combination Options % 1.24/1.57 % 1.24/1.57 % --comb_res_mult 1000 % 1.24/1.57 % --comb_inst_mult 300 % 1.24/1.57 % ------ % 1.24/1.57 % 1.24/1.57 % ------ Parsing...% successful % 1.24/1.57 % 1.24/1.57 % ------ Preprocessing... gs_s sp: 1208 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e % % 1.24/1.57 % 1.24/1.57 % ------ Proving... % 1.24/1.57 % ------ Problem Properties % 1.24/1.57 % 1.24/1.57 % % 1.24/1.57 % EPR false % 1.24/1.57 % Horn false % 1.24/1.57 % Has equality false % 1.24/1.57 % 1.24/1.57 % % ------ Input Options Time Limit: Unbounded % 1.24/1.57 % 1.24/1.57 % 1.24/1.57 % % ------ Current options: % 1.24/1.57 % 1.24/1.57 % ------ Input Options % 1.24/1.57 % 1.24/1.57 % --out_options all % 1.24/1.57 % --tptp_safe_out true % 1.24/1.57 % --problem_path "" % 1.24/1.57 % --include_path "" % 1.24/1.57 % --clausifier .//eprover % 1.24/1.57 % --clausifier_options --tstp-format % 1.24/1.57 % --stdin false % 1.24/1.57 % --dbg_backtrace false % 1.24/1.57 % --dbg_dump_prop_clauses false % 1.24/1.57 % --dbg_dump_prop_clauses_file - % 1.24/1.57 % --dbg_out_stat false % 1.24/1.57 % 1.24/1.57 % ------ General Options % 1.24/1.57 % 1.24/1.57 % --fof false % 1.24/1.57 % --time_out_real 150. % 1.24/1.57 % --time_out_prep_mult 0.2 % 1.24/1.57 % --time_out_virtual -1. % 1.24/1.57 % --schedule none % 1.24/1.57 % --ground_splitting input % 1.24/1.57 % --splitting_nvd 16 % 1.24/1.57 % --non_eq_to_eq false % 1.24/1.57 % --prep_gs_sim true % 1.24/1.57 % --prep_unflatten false % 1.24/1.57 % --prep_res_sim true % 1.24/1.57 % --prep_upred true % 1.24/1.57 % --res_sim_input true % 1.24/1.57 % --clause_weak_htbl true % 1.24/1.57 % --gc_record_bc_elim false % 1.24/1.57 % --symbol_type_check false % 1.24/1.57 % --clausify_out false % 1.24/1.57 % --large_theory_mode false % 1.24/1.57 % --prep_sem_filter none % 1.24/1.57 % --prep_sem_filter_out false % 1.24/1.57 % --preprocessed_out false % 1.24/1.57 % --sub_typing false % 1.24/1.57 % --brand_transform false % 1.24/1.57 % --pure_diseq_elim true % 1.24/1.57 % --min_unsat_core false % 1.24/1.57 % --pred_elim true % 1.24/1.57 % --add_important_lit false % 1.24/1.57 % --soft_assumptions false % 1.24/1.57 % --reset_solvers false % 1.24/1.57 % --bc_imp_inh [] % 1.24/1.57 % --conj_cone_tolerance 1.5 % 1.24/1.57 % --prolific_symb_bound 500 % 1.24/1.57 % --lt_threshold 2000 % 1.24/1.57 % 1.24/1.57 % ------ SAT Options % 1.24/1.57 % 1.24/1.57 % --sat_mode false % 1.24/1.57 % --sat_fm_restart_options "" % 1.24/1.57 % --sat_gr_def false % 1.24/1.57 % --sat_epr_types true % 1.24/1.57 % --sat_non_cyclic_types false % 1.24/1.57 % --sat_finite_models false % 1.24/1.57 % --sat_fm_lemmas false % 1.24/1.57 % --sat_fm_prep false % 1.24/1.57 % --sat_fm_uc_incr true % 1.24/1.57 % --sat_out_model small % 1.24/1.57 % --sat_out_clauses false % 1.24/1.57 % 1.24/1.57 % ------ QBF Options % 1.24/1.57 % 1.24/1.57 % --qbf_mode false % 1.24/1.57 % --qbf_elim_univ true % 1.24/1.57 % --qbf_sk_in true % 1.24/1.57 % --qbf_pred_elim true % 1.24/1.57 % --qbf_split 32 % 1.24/1.57 % 1.24/1.57 % ------ BMC1 Options % 1.24/1.57 % 1.24/1.57 % --bmc1_incremental false % 1.24/1.57 % --bmc1_axioms reachable_all % 1.24/1.57 % --bmc1_min_bound 0 % 1.24/1.57 % --bmc1_max_bound -1 % 1.24/1.57 % --bmc1_max_bound_default -1 % 1.24/1.57 % --bmc1_symbol_reachability true % 1.24/1.57 % --bmc1_property_lemmas false % 1.24/1.57 % --bmc1_k_induction false % 1.24/1.57 % --bmc1_non_equiv_states false % 1.24/1.57 % --bmc1_deadlock false % 1.24/1.57 % --bmc1_ucm false % 1.24/1.57 % --bmc1_add_unsat_core none % 1.24/1.57 % --bmc1_unsat_core_children false % 1.24/1.57 % --bmc1_unsat_core_extrapolate_axioms false % 1.24/1.57 % --bmc1_out_stat full % 1.24/1.57 % --bmc1_ground_init false % 1.24/1.57 % --bmc1_pre_inst_next_state false % 1.24/1.57 % --bmc1_pre_inst_state false % 1.24/1.57 % --bmc1_pre_inst_reach_state false % 1.24/1.57 % --bmc1_out_unsat_core false % 1.24/1.57 % --bmc1_aig_witness_out false % 1.24/1.57 % --bmc1_verbose false % 1.24/1.57 % --bmc1_dump_clauses_tptp false % 1.24/1.57 % --bmc1_dump_unsat_core_tptp false % 1.24/1.57 % --bmc1_dump_file - % 1.24/1.57 % --bmc1_ucm_expand_uc_limit 128 % 1.24/1.57 % --bmc1_ucm_n_expand_iterations 6 % 1.24/1.57 % --bmc1_ucm_extend_mode 1 % 1.24/1.57 % --bmc1_ucm_init_mode 2 % 1.24/1.57 % --bmc1_ucm_cone_mode none % 1.24/1.57 % --bmc1_ucm_reduced_relation_type 0 % 1.24/1.57 % --bmc1_ucm_relax_model 4 % 1.24/1.57 % --bmc1_ucm_full_tr_after_sat true % 1.24/1.57 % --bmc1_ucm_expand_neg_assumptions false % 1.24/1.57 % --bmc1_ucm_layered_model none % 1.24/1.57 % --bmc1_ucm_max_lemma_size 10 % 1.24/1.57 % 1.24/1.57 % ------ AIG Options % 1.24/1.57 % 1.24/1.57 % --aig_mode false % 1.24/1.57 % 1.24/1.57 % ------ Instantiation Options % 1.24/1.57 % 1.24/1.57 % --instantiation_flag true % 1.24/1.57 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 1.24/1.57 % --inst_solver_per_active 750 % 1.24/1.57 % --inst_solver_calls_frac 0.5 % 1.24/1.57 % --inst_passive_queue_type priority_queues % 1.24/1.57 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 1.24/1.57 % --inst_passive_queues_freq [25;2] % 1.24/1.57 % --inst_dismatching true % 1.24/1.57 % --inst_eager_unprocessed_to_passive true % 14.63/15.03 % --inst_prop_sim_given true % 14.63/15.03 % --inst_prop_sim_new false % 14.63/15.03 % --inst_orphan_elimination true % 14.63/15.03 % --inst_learning_loop_flag true % 14.63/15.03 % --inst_learning_start 3000 % 14.63/15.03 % --inst_learning_factor 2 % 14.63/15.03 % --inst_start_prop_sim_after_learn 3 % 14.63/15.03 % --inst_sel_renew solver % 14.63/15.03 % --inst_lit_activity_flag true % 14.63/15.03 % --inst_out_proof true % 14.63/15.03 % 14.63/15.03 % ------ Resolution Options % 14.63/15.03 % 14.63/15.03 % --resolution_flag true % 14.63/15.03 % --res_lit_sel kbo_max % 14.63/15.03 % --res_to_prop_solver none % 14.63/15.03 % --res_prop_simpl_new false % 14.63/15.03 % --res_prop_simpl_given false % 14.63/15.03 % --res_passive_queue_type priority_queues % 14.63/15.03 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 14.63/15.03 % --res_passive_queues_freq [15;5] % 14.63/15.03 % --res_forward_subs full % 14.63/15.03 % --res_backward_subs full % 14.63/15.03 % --res_forward_subs_resolution true % 14.63/15.03 % --res_backward_subs_resolution true % 14.63/15.03 % --res_orphan_elimination false % 14.63/15.03 % --res_time_limit 1000. % 14.63/15.03 % --res_out_proof true % 14.63/15.03 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f9906e.s % 14.63/15.03 % --modulo true % 14.63/15.03 % 14.63/15.03 % ------ Combination Options % 14.63/15.03 % 14.63/15.03 % --comb_res_mult 1000 % 14.63/15.03 % --comb_inst_mult 300 % 14.63/15.03 % ------ % 14.63/15.03 % 14.63/15.03 % 14.63/15.03 % 14.63/15.03 % ------ Proving... % 14.63/15.03 % warning: shown sat in sat incomplete mode % 14.63/15.03 % % 14.63/15.03 % 14.63/15.03 % 14.63/15.03 ------ Building Model...Done % 14.63/15.03 % 14.63/15.03 %------ The model is defined over ground terms (initial term algebra). % 14.63/15.03 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 14.63/15.03 %------ where \phi is a formula over the term algebra. % 14.63/15.03 %------ If we have equality in the problem then it is also defined as a predicate above, % 14.63/15.03 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 14.63/15.03 %------ See help for --sat_out_model for different model outputs. % 14.63/15.03 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 14.63/15.03 %------ where the first argument stands for the sort ($i in the unsorted case) % 14.63/15.03 % 14.63/15.03 % 14.63/15.03 % 14.63/15.03 % 14.63/15.03 %------ Positive definition of p2 % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 (! [X0] : % 14.63/15.03 ( p2(X0) <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of r1 % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 (! [X0,X1] : % 14.63/15.03 ( r1(X0,X1) <=> % 14.63/15.03 ( % 14.63/15.03 ( % 14.63/15.03 ( X0=sk3_esk14_0 & X1=sk3_esk15_0 ) % 14.63/15.03 ) % 14.63/15.03 % 14.63/15.03 ) % 14.63/15.03 ) % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of p1 % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 (! [X0] : % 14.63/15.03 ( p1(X0) <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of p3 % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 (! [X0] : % 14.63/15.03 ( p3(X0) <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of p4 % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 (! [X0] : % 14.63/15.03 ( p4(X0) <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP0_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP0_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP1_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP1_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP2_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP2_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP3_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP3_iProver_split <=> % 14.63/15.03 $true % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP4_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP4_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP5_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP5_iProver_split <=> % 14.63/15.03 $true % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP6_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP6_iProver_split <=> % 14.63/15.03 $true % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP7_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP7_iProver_split <=> % 14.63/15.03 $true % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP8_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP8_iProver_split <=> % 14.63/15.03 $true % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP9_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP9_iProver_split <=> % 14.63/15.03 $true % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP10_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP10_iProver_split <=> % 14.63/15.03 $true % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP12_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP12_iProver_split <=> % 14.63/15.03 $true % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP13_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP13_iProver_split <=> % 14.63/15.03 $true % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP17_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP17_iProver_split <=> % 14.63/15.03 $true % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP22_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP22_iProver_split <=> % 14.63/15.03 $true % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP29_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP29_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP30_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP30_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP31_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP31_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP32_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP32_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP33_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP33_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP34_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP34_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP35_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP35_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP36_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP36_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP37_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP37_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP38_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP38_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP39_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP39_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP40_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP40_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP41_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP41_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP42_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP42_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP43_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP43_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 %------ Positive definition of sP44_iProver_split % 14.63/15.03 fof(lit_def,axiom, % 14.63/15.03 ( sP44_iProver_split <=> % 14.63/15.03 $false % 14.63/15.03 ) % 14.63/15.03 ). % 14.63/15.03 % 14.63/15.03 % 14.63/15.03 % 14.63/15.03 % ------ Statistics % 14.63/15.03 % 14.63/15.03 % ------ General % 14.63/15.03 % 14.63/15.03 % num_of_input_clauses: 594 % 14.63/15.03 % num_of_input_neg_conjectures: 338 % 14.63/15.03 % num_of_splits: 1208 % 14.63/15.03 % num_of_split_atoms: 45 % 14.63/15.03 % num_of_sem_filtered_clauses: 0 % 14.63/15.03 % num_of_subtypes: 0 % 14.63/15.03 % monotx_restored_types: 0 % 14.63/15.03 % sat_num_of_epr_types: 0 % 14.63/15.03 % sat_num_of_non_cyclic_types: 0 % 14.63/15.03 % sat_guarded_non_collapsed_types: 0 % 14.63/15.03 % is_epr: 0 % 14.63/15.03 % is_horn: 0 % 14.63/15.03 % has_eq: 0 % 14.63/15.03 % num_pure_diseq_elim: 0 % 14.63/15.03 % simp_replaced_by: 0 % 14.63/15.03 % res_preprocessed: 2140 % 14.63/15.03 % prep_upred: 0 % 14.63/15.03 % prep_unflattend: 0 % 14.63/15.03 % pred_elim_cands: 45 % 14.63/15.03 % pred_elim: 14 % 14.63/15.03 % pred_elim_cl: 14 % 14.63/15.03 % pred_elim_cycles: 45 % 14.63/15.03 % forced_gc_time: 0 % 14.63/15.03 % gc_basic_clause_elim: 0 % 14.63/15.03 % parsing_time: 0.108 % 0.34/15.06 % sem_filter_time: 0. % 0.34/15.06 % pred_elim_time: 0.502 % 0.34/15.06 % out_proof_time: 0. % 0.34/15.06 % monotx_time: 0. % 0.34/15.06 % subtype_inf_time: 0. % 0.34/15.06 % unif_index_cands_time: 0.011 % 0.34/15.06 % unif_index_add_time: 0.005 % 0.34/15.06 % total_time: 14.441 % 0.34/15.06 % num_of_symbols: 115 % 0.34/15.06 % num_of_terms: 5737 % 0.34/15.06 % 0.34/15.06 % ------ Propositional Solver % 0.34/15.06 % 0.34/15.06 % prop_solver_calls: 3 % 0.34/15.06 % prop_fast_solver_calls: 20675 % 0.34/15.06 % prop_num_of_clauses: 1753 % 0.34/15.06 % prop_preprocess_simplified: 16086 % 0.34/15.06 % prop_fo_subsumed: 0 % 0.34/15.06 % prop_solver_time: 0. % 0.34/15.06 % prop_fast_solver_time: 0.054 % 0.34/15.06 % prop_unsat_core_time: 0. % 0.34/15.06 % 0.34/15.06 % ------ QBF % 0.34/15.06 % 0.34/15.06 % qbf_q_res: 0 % 0.34/15.06 % qbf_num_tautologies: 0 % 0.34/15.06 % qbf_prep_cycles: 0 % 0.34/15.06 % 0.34/15.06 % ------ BMC1 % 0.34/15.06 % 0.34/15.06 % bmc1_current_bound: -1 % 0.34/15.06 % bmc1_last_solved_bound: -1 % 0.34/15.06 % bmc1_unsat_core_size: -1 % 0.34/15.06 % bmc1_unsat_core_parents_size: -1 % 0.34/15.06 % bmc1_merge_next_fun: 0 % 0.34/15.06 % bmc1_unsat_core_clauses_time: 0. % 0.34/15.06 % 0.34/15.06 % ------ Instantiation % 0.34/15.06 % 0.34/15.06 % inst_num_of_clauses: 629 % 0.34/15.06 % inst_num_in_passive: 0 % 0.34/15.06 % inst_num_in_active: 629 % 0.34/15.06 % inst_num_in_unprocessed: 0 % 0.34/15.06 % inst_num_of_loops: 665 % 0.34/15.06 % inst_num_of_learning_restarts: 0 % 0.34/15.06 % inst_num_moves_active_passive: 33 % 0.34/15.06 % inst_lit_activity: 279 % 0.34/15.06 % inst_lit_activity_moves: 0 % 0.34/15.06 % inst_num_tautologies: 0 % 0.34/15.06 % inst_num_prop_implied: 0 % 0.34/15.06 % inst_num_existing_simplified: 0 % 0.34/15.06 % inst_num_eq_res_simplified: 0 % 0.34/15.06 % inst_num_child_elim: 0 % 0.34/15.06 % inst_num_of_dismatching_blockings: 0 % 0.34/15.06 % inst_num_of_non_proper_insts: 4 % 0.34/15.06 % inst_num_of_duplicates: 0 % 0.34/15.06 % inst_inst_num_from_inst_to_res: 0 % 0.34/15.06 % inst_dismatching_checking_time: 0. % 0.34/15.06 % 0.34/15.06 % ------ Resolution % 0.34/15.06 % 0.34/15.06 % res_num_of_clauses: 56412 % 0.34/15.06 % res_num_in_passive: 56351 % 0.34/15.06 % res_num_in_active: 1467 % 0.34/15.06 % res_num_of_loops: 3000 % 0.34/15.06 % res_forward_subset_subsumed: 2160 % 0.34/15.06 % res_backward_subset_subsumed: 1493 % 0.34/15.06 % res_forward_subsumed: 1447 % 0.34/15.06 % res_backward_subsumed: 0 % 0.34/15.06 % res_forward_subsumption_resolution: 588 % 0.34/15.06 % res_backward_subsumption_resolution: 32 % 0.34/15.06 % res_clause_to_clause_subsumption: 7543 % 0.34/15.06 % res_orphan_elimination: 0 % 0.34/15.06 % res_tautology_del: 8563 % 0.34/15.06 % res_num_eq_res_simplified: 0 % 0.34/15.06 % res_num_sel_changes: 0 % 0.34/15.06 % res_moves_from_active_to_pass: 0 % 0.34/15.06 % 0.34/15.06 % Status Unknown % 14.82/15.28 % Orienting using strategy ClausalAll % 14.82/15.28 % FOF problem with conjecture % 14.82/15.28 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f9906e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_56f2c4.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_0ec783 | grep -v "SZS" % 15.05/15.33 % 15.05/15.33 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 15.05/15.33 % 15.05/15.33 % % 15.05/15.33 % ------ iProver source info % 15.05/15.33 % 15.05/15.33 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 15.05/15.33 % git: non_committed_changes: true % 15.05/15.33 % git: last_make_outside_of_git: true % 15.05/15.33 % 15.05/15.33 % % 15.05/15.33 % ------ Input Options % 15.05/15.33 % 15.05/15.33 % --out_options all % 15.05/15.33 % --tptp_safe_out true % 15.05/15.33 % --problem_path "" % 15.05/15.33 % --include_path "" % 15.05/15.33 % --clausifier .//eprover % 15.05/15.33 % --clausifier_options --tstp-format % 15.05/15.33 % --stdin false % 15.05/15.33 % --dbg_backtrace false % 15.05/15.33 % --dbg_dump_prop_clauses false % 15.05/15.33 % --dbg_dump_prop_clauses_file - % 15.05/15.33 % --dbg_out_stat false % 15.05/15.33 % 15.05/15.33 % ------ General Options % 15.05/15.33 % 15.05/15.33 % --fof false % 15.05/15.33 % --time_out_real 150. % 15.05/15.33 % --time_out_prep_mult 0.2 % 15.05/15.33 % --time_out_virtual -1. % 15.05/15.33 % --schedule none % 15.05/15.33 % --ground_splitting input % 15.05/15.33 % --splitting_nvd 16 % 15.05/15.33 % --non_eq_to_eq false % 15.05/15.33 % --prep_gs_sim true % 15.05/15.33 % --prep_unflatten false % 15.05/15.33 % --prep_res_sim true % 15.05/15.33 % --prep_upred true % 15.05/15.33 % --res_sim_input true % 15.05/15.33 % --clause_weak_htbl true % 15.05/15.33 % --gc_record_bc_elim false % 15.05/15.33 % --symbol_type_check false % 15.05/15.33 % --clausify_out false % 15.05/15.33 % --large_theory_mode false % 15.05/15.33 % --prep_sem_filter none % 15.05/15.33 % --prep_sem_filter_out false % 15.05/15.33 % --preprocessed_out false % 15.05/15.33 % --sub_typing false % 15.05/15.33 % --brand_transform false % 15.05/15.33 % --pure_diseq_elim true % 15.05/15.33 % --min_unsat_core false % 15.05/15.33 % --pred_elim true % 15.05/15.33 % --add_important_lit false % 15.05/15.33 % --soft_assumptions false % 15.05/15.33 % --reset_solvers false % 15.05/15.33 % --bc_imp_inh [] % 15.05/15.33 % --conj_cone_tolerance 1.5 % 15.05/15.33 % --prolific_symb_bound 500 % 15.05/15.33 % --lt_threshold 2000 % 15.05/15.33 % 15.05/15.33 % ------ SAT Options % 15.05/15.33 % 15.05/15.33 % --sat_mode false % 15.05/15.33 % --sat_fm_restart_options "" % 15.05/15.33 % --sat_gr_def false % 15.05/15.33 % --sat_epr_types true % 15.05/15.33 % --sat_non_cyclic_types false % 15.05/15.33 % --sat_finite_models false % 15.05/15.33 % --sat_fm_lemmas false % 15.05/15.33 % --sat_fm_prep false % 15.05/15.33 % --sat_fm_uc_incr true % 15.05/15.33 % --sat_out_model small % 15.05/15.33 % --sat_out_clauses false % 15.05/15.33 % 15.05/15.33 % ------ QBF Options % 15.05/15.33 % 15.05/15.33 % --qbf_mode false % 15.05/15.33 % --qbf_elim_univ true % 15.05/15.33 % --qbf_sk_in true % 15.05/15.33 % --qbf_pred_elim true % 15.05/15.33 % --qbf_split 32 % 15.05/15.33 % 15.05/15.33 % ------ BMC1 Options % 15.05/15.33 % 15.05/15.33 % --bmc1_incremental false % 15.05/15.33 % --bmc1_axioms reachable_all % 15.05/15.33 % --bmc1_min_bound 0 % 15.05/15.33 % --bmc1_max_bound -1 % 15.05/15.33 % --bmc1_max_bound_default -1 % 15.05/15.33 % --bmc1_symbol_reachability true % 15.05/15.33 % --bmc1_property_lemmas false % 15.05/15.33 % --bmc1_k_induction false % 15.05/15.33 % --bmc1_non_equiv_states false % 15.05/15.33 % --bmc1_deadlock false % 15.05/15.33 % --bmc1_ucm false % 15.05/15.33 % --bmc1_add_unsat_core none % 15.05/15.33 % --bmc1_unsat_core_children false % 15.05/15.33 % --bmc1_unsat_core_extrapolate_axioms false % 15.05/15.33 % --bmc1_out_stat full % 15.05/15.33 % --bmc1_ground_init false % 15.05/15.33 % --bmc1_pre_inst_next_state false % 15.05/15.33 % --bmc1_pre_inst_state false % 15.05/15.33 % --bmc1_pre_inst_reach_state false % 15.05/15.33 % --bmc1_out_unsat_core false % 15.05/15.33 % --bmc1_aig_witness_out false % 15.05/15.33 % --bmc1_verbose false % 15.05/15.33 % --bmc1_dump_clauses_tptp false % 16.45/16.73 % --bmc1_dump_unsat_core_tptp false % 16.45/16.73 % --bmc1_dump_file - % 16.45/16.73 % --bmc1_ucm_expand_uc_limit 128 % 16.45/16.73 % --bmc1_ucm_n_expand_iterations 6 % 16.45/16.73 % --bmc1_ucm_extend_mode 1 % 16.45/16.73 % --bmc1_ucm_init_mode 2 % 16.45/16.73 % --bmc1_ucm_cone_mode none % 16.45/16.73 % --bmc1_ucm_reduced_relation_type 0 % 16.45/16.73 % --bmc1_ucm_relax_model 4 % 16.45/16.73 % --bmc1_ucm_full_tr_after_sat true % 16.45/16.73 % --bmc1_ucm_expand_neg_assumptions false % 16.45/16.73 % --bmc1_ucm_layered_model none % 16.45/16.73 % --bmc1_ucm_max_lemma_size 10 % 16.45/16.73 % 16.45/16.73 % ------ AIG Options % 16.45/16.73 % 16.45/16.73 % --aig_mode false % 16.45/16.73 % 16.45/16.73 % ------ Instantiation Options % 16.45/16.73 % 16.45/16.73 % --instantiation_flag true % 16.45/16.73 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 16.45/16.73 % --inst_solver_per_active 750 % 16.45/16.73 % --inst_solver_calls_frac 0.5 % 16.45/16.73 % --inst_passive_queue_type priority_queues % 16.45/16.73 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 16.45/16.73 % --inst_passive_queues_freq [25;2] % 16.45/16.73 % --inst_dismatching true % 16.45/16.73 % --inst_eager_unprocessed_to_passive true % 16.45/16.73 % --inst_prop_sim_given true % 16.45/16.73 % --inst_prop_sim_new false % 16.45/16.73 % --inst_orphan_elimination true % 16.45/16.73 % --inst_learning_loop_flag true % 16.45/16.73 % --inst_learning_start 3000 % 16.45/16.73 % --inst_learning_factor 2 % 16.45/16.73 % --inst_start_prop_sim_after_learn 3 % 16.45/16.73 % --inst_sel_renew solver % 16.45/16.73 % --inst_lit_activity_flag true % 16.45/16.73 % --inst_out_proof true % 16.45/16.73 % 16.45/16.73 % ------ Resolution Options % 16.45/16.73 % 16.45/16.73 % --resolution_flag true % 16.45/16.73 % --res_lit_sel kbo_max % 16.45/16.73 % --res_to_prop_solver none % 16.45/16.73 % --res_prop_simpl_new false % 16.45/16.73 % --res_prop_simpl_given false % 16.45/16.73 % --res_passive_queue_type priority_queues % 16.45/16.73 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 16.45/16.73 % --res_passive_queues_freq [15;5] % 16.45/16.73 % --res_forward_subs full % 16.45/16.73 % --res_backward_subs full % 16.45/16.73 % --res_forward_subs_resolution true % 16.45/16.73 % --res_backward_subs_resolution true % 16.45/16.73 % --res_orphan_elimination false % 16.45/16.73 % --res_time_limit 1000. % 16.45/16.73 % --res_out_proof true % 16.45/16.73 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f9906e.s % 16.45/16.73 % --modulo true % 16.45/16.73 % 16.45/16.73 % ------ Combination Options % 16.45/16.73 % 16.45/16.73 % --comb_res_mult 1000 % 16.45/16.73 % --comb_inst_mult 300 % 16.45/16.73 % ------ % 16.45/16.73 % 16.45/16.73 % ------ Parsing...% successful % 16.45/16.73 % 16.45/16.73 % ------ Preprocessing... gs_s sp: 1208 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e % % 16.45/16.73 % 16.45/16.73 % ------ Proving... % 16.45/16.73 % ------ Problem Properties % 16.45/16.73 % 16.45/16.73 % % 16.45/16.73 % EPR false % 16.45/16.73 % Horn false % 16.45/16.73 % Has equality false % 16.45/16.73 % 16.45/16.73 % % ------ Input Options Time Limit: Unbounded % 16.45/16.73 % 16.45/16.73 % 16.45/16.73 % % ------ Current options: % 16.45/16.73 % 16.45/16.73 % ------ Input Options % 16.45/16.73 % 16.45/16.73 % --out_options all % 16.45/16.73 % --tptp_safe_out true % 16.45/16.73 % --problem_path "" % 16.45/16.73 % --include_path "" % 16.45/16.73 % --clausifier .//eprover % 16.45/16.73 % --clausifier_options --tstp-format % 16.45/16.73 % --stdin false % 16.45/16.73 % --dbg_backtrace false % 16.45/16.73 % --dbg_dump_prop_clauses false % 16.45/16.73 % --dbg_dump_prop_clauses_file - % 16.45/16.73 % --dbg_out_stat false % 16.45/16.73 % 16.45/16.73 % ------ General Options % 16.45/16.73 % 16.45/16.73 % --fof false % 16.45/16.73 % --time_out_real 150. % 16.45/16.73 % --time_out_prep_mult 0.2 % 16.45/16.73 % --time_out_virtual -1. % 16.45/16.73 % --schedule none % 16.45/16.73 % --ground_splitting input % 16.45/16.73 % --splitting_nvd 16 % 16.45/16.73 % --non_eq_to_eq false % 16.45/16.73 % --prep_gs_sim true % 16.45/16.73 % --prep_unflatten false % 16.45/16.73 % --prep_res_sim true % 16.45/16.73 % --prep_upred true % 16.45/16.73 % --res_sim_input true % 16.45/16.73 % --clause_weak_htbl true % 16.45/16.73 % --gc_record_bc_elim false % 16.45/16.73 % --symbol_type_check false % 16.45/16.73 % --clausify_out false % 16.45/16.73 % --large_theory_mode false % 16.45/16.73 % --prep_sem_filter none % 16.45/16.73 % --prep_sem_filter_out false % 16.45/16.73 % --preprocessed_out false % 16.45/16.73 % --sub_typing false % 16.45/16.73 % --brand_transform false % 16.45/16.73 % --pure_diseq_elim true % 16.45/16.73 % --min_unsat_core false % 16.45/16.73 % --pred_elim true % 16.45/16.73 % --add_important_lit false % 16.45/16.73 % --soft_assumptions false % 16.45/16.73 % --reset_solvers false % 16.45/16.73 % --bc_imp_inh [] % 16.45/16.73 % --conj_cone_tolerance 1.5 % 16.45/16.73 % --prolific_symb_bound 500 % 16.45/16.73 % --lt_threshold 2000 % 16.45/16.73 % 16.45/16.73 % ------ SAT Options % 16.45/16.73 % 16.45/16.73 % --sat_mode false % 16.45/16.73 % --sat_fm_restart_options "" % 16.45/16.73 % --sat_gr_def false % 16.45/16.73 % --sat_epr_types true % 16.45/16.73 % --sat_non_cyclic_types false % 16.45/16.73 % --sat_finite_models false % 16.45/16.73 % --sat_fm_lemmas false % 16.45/16.73 % --sat_fm_prep false % 16.45/16.73 % --sat_fm_uc_incr true % 16.45/16.73 % --sat_out_model small % 16.45/16.73 % --sat_out_clauses false % 16.45/16.73 % 16.45/16.73 % ------ QBF Options % 16.45/16.73 % 16.45/16.73 % --qbf_mode false % 16.45/16.73 % --qbf_elim_univ true % 16.45/16.73 % --qbf_sk_in true % 16.45/16.73 % --qbf_pred_elim true % 16.45/16.73 % --qbf_split 32 % 16.45/16.73 % 16.45/16.73 % ------ BMC1 Options % 16.45/16.73 % 16.45/16.73 % --bmc1_incremental false % 16.45/16.73 % --bmc1_axioms reachable_all % 16.45/16.73 % --bmc1_min_bound 0 % 16.45/16.73 % --bmc1_max_bound -1 % 16.45/16.73 % --bmc1_max_bound_default -1 % 16.45/16.73 % --bmc1_symbol_reachability true % 16.45/16.73 % --bmc1_property_lemmas false % 16.45/16.73 % --bmc1_k_induction false % 16.45/16.73 % --bmc1_non_equiv_states false % 16.45/16.73 % --bmc1_deadlock false % 16.45/16.73 % --bmc1_ucm false % 16.45/16.73 % --bmc1_add_unsat_core none % 16.45/16.73 % --bmc1_unsat_core_children false % 16.45/16.73 % --bmc1_unsat_core_extrapolate_axioms false % 16.45/16.73 % --bmc1_out_stat full % 16.45/16.73 % --bmc1_ground_init false % 16.45/16.73 % --bmc1_pre_inst_next_state false % 16.45/16.73 % --bmc1_pre_inst_state false % 16.45/16.73 % --bmc1_pre_inst_reach_state false % 16.45/16.73 % --bmc1_out_unsat_core false % 16.45/16.73 % --bmc1_aig_witness_out false % 16.45/16.73 % --bmc1_verbose false % 16.45/16.73 % --bmc1_dump_clauses_tptp false % 16.45/16.73 % --bmc1_dump_unsat_core_tptp false % 16.45/16.73 % --bmc1_dump_file - % 16.45/16.73 % --bmc1_ucm_expand_uc_limit 128 % 16.45/16.73 % --bmc1_ucm_n_expand_iterations 6 % 16.45/16.73 % --bmc1_ucm_extend_mode 1 % 16.45/16.73 % --bmc1_ucm_init_mode 2 % 16.45/16.73 % --bmc1_ucm_cone_mode none % 16.45/16.73 % --bmc1_ucm_reduced_relation_type 0 % 16.45/16.73 % --bmc1_ucm_relax_model 4 % 16.45/16.73 % --bmc1_ucm_full_tr_after_sat true % 16.45/16.73 % --bmc1_ucm_expand_neg_assumptions false % 16.45/16.73 % --bmc1_ucm_layered_model none % 16.45/16.73 % --bmc1_ucm_max_lemma_size 10 % 16.45/16.73 % 16.45/16.73 % ------ AIG Options % 16.45/16.73 % 16.45/16.73 % --aig_mode false % 16.45/16.73 % 16.45/16.73 % ------ Instantiation Options % 16.45/16.73 % 16.45/16.73 % --instantiation_flag true % 16.45/16.73 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 16.45/16.73 % --inst_solver_per_active 750 % 16.45/16.73 % --inst_solver_calls_frac 0.5 % 16.45/16.73 % --inst_passive_queue_type priority_queues % 16.45/16.73 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 16.45/16.73 % --inst_passive_queues_freq [25;2] % 16.45/16.73 % --inst_dismatching true % 16.45/16.73 % --inst_eager_unprocessed_to_passive true % 31.03/31.34 % --inst_prop_sim_given true % 31.03/31.34 % --inst_prop_sim_new false % 31.03/31.34 % --inst_orphan_elimination true % 31.03/31.34 % --inst_learning_loop_flag true % 31.03/31.34 % --inst_learning_start 3000 % 31.03/31.34 % --inst_learning_factor 2 % 31.03/31.34 % --inst_start_prop_sim_after_learn 3 % 31.03/31.34 % --inst_sel_renew solver % 31.03/31.34 % --inst_lit_activity_flag true % 31.03/31.34 % --inst_out_proof true % 31.03/31.34 % 31.03/31.34 % ------ Resolution Options % 31.03/31.34 % 31.03/31.34 % --resolution_flag true % 31.03/31.34 % --res_lit_sel kbo_max % 31.03/31.34 % --res_to_prop_solver none % 31.03/31.34 % --res_prop_simpl_new false % 31.03/31.34 % --res_prop_simpl_given false % 31.03/31.34 % --res_passive_queue_type priority_queues % 31.03/31.34 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 31.03/31.34 % --res_passive_queues_freq [15;5] % 31.03/31.34 % --res_forward_subs full % 31.03/31.34 % --res_backward_subs full % 31.03/31.34 % --res_forward_subs_resolution true % 31.03/31.34 % --res_backward_subs_resolution true % 31.03/31.34 % --res_orphan_elimination false % 31.03/31.34 % --res_time_limit 1000. % 31.03/31.34 % --res_out_proof true % 31.03/31.34 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_f9906e.s % 31.03/31.34 % --modulo true % 31.03/31.34 % 31.03/31.34 % ------ Combination Options % 31.03/31.34 % 31.03/31.34 % --comb_res_mult 1000 % 31.03/31.34 % --comb_inst_mult 300 % 31.03/31.34 % ------ % 31.03/31.34 % 31.03/31.34 % 31.03/31.34 % 31.03/31.34 % ------ Proving... % 31.03/31.34 % warning: shown sat in sat incomplete mode % 31.03/31.34 % % 31.03/31.34 % 31.03/31.34 % 31.03/31.34 ------ Building Model...Done % 31.03/31.34 % 31.03/31.34 %------ The model is defined over ground terms (initial term algebra). % 31.03/31.34 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 31.03/31.34 %------ where \phi is a formula over the term algebra. % 31.03/31.34 %------ If we have equality in the problem then it is also defined as a predicate above, % 31.03/31.34 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 31.03/31.34 %------ See help for --sat_out_model for different model outputs. % 31.03/31.34 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 31.03/31.34 %------ where the first argument stands for the sort ($i in the unsorted case) % 31.03/31.34 % 31.03/31.34 % 31.03/31.34 % 31.03/31.34 % 31.03/31.34 %------ Positive definition of p2 % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 (! [X0] : % 31.03/31.34 ( p2(X0) <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of r1 % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 (! [X0,X1] : % 31.03/31.34 ( r1(X0,X1) <=> % 31.03/31.34 ( % 31.03/31.34 ( % 31.03/31.34 ( X0=sk2_esk14_0 & X1=sk2_esk15_0 ) % 31.03/31.34 ) % 31.03/31.34 % 31.03/31.34 ) % 31.03/31.34 ) % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of p1 % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 (! [X0] : % 31.03/31.34 ( p1(X0) <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of p3 % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 (! [X0] : % 31.03/31.34 ( p3(X0) <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of p4 % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 (! [X0] : % 31.03/31.34 ( p4(X0) <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP0_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP0_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP1_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP1_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP2_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP2_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP3_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP3_iProver_split <=> % 31.03/31.34 $true % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP4_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP4_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP5_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP5_iProver_split <=> % 31.03/31.34 $true % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP6_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP6_iProver_split <=> % 31.03/31.34 $true % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP7_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP7_iProver_split <=> % 31.03/31.34 $true % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP8_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP8_iProver_split <=> % 31.03/31.34 $true % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP9_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP9_iProver_split <=> % 31.03/31.34 $true % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP10_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP10_iProver_split <=> % 31.03/31.34 $true % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP12_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP12_iProver_split <=> % 31.03/31.34 $true % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP13_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP13_iProver_split <=> % 31.03/31.34 $true % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP17_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP17_iProver_split <=> % 31.03/31.34 $true % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP22_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP22_iProver_split <=> % 31.03/31.34 $true % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP29_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP29_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP30_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP30_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP31_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP31_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP32_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP32_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP33_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP33_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP34_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP34_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP35_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP35_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP36_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP36_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP37_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP37_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP38_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP38_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP39_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP39_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP40_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP40_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP41_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP41_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP42_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP42_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP43_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP43_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 %------ Positive definition of sP44_iProver_split % 31.03/31.34 fof(lit_def,axiom, % 31.03/31.34 ( sP44_iProver_split <=> % 31.03/31.34 $false % 31.03/31.34 ) % 31.03/31.34 ). % 31.03/31.34 % 31.03/31.34 % 31.03/31.34 % 31.03/31.34 % ------ Statistics % 31.03/31.34 % 31.03/31.34 % ------ General % 31.03/31.34 % 31.03/31.34 % num_of_input_clauses: 594 % 31.03/31.34 % num_of_input_neg_conjectures: 338 % 31.03/31.34 % num_of_splits: 1208 % 31.03/31.34 % num_of_split_atoms: 45 % 31.03/31.34 % num_of_sem_filtered_clauses: 0 % 31.03/31.34 % num_of_subtypes: 0 % 31.03/31.34 % monotx_restored_types: 0 % 31.03/31.34 % sat_num_of_epr_types: 0 % 31.03/31.34 % sat_num_of_non_cyclic_types: 0 % 31.03/31.34 % sat_guarded_non_collapsed_types: 0 % 31.03/31.34 % is_epr: 0 % 31.03/31.34 % is_horn: 0 % 31.03/31.34 % has_eq: 0 % 31.03/31.34 % num_pure_diseq_elim: 0 % 31.03/31.34 % simp_replaced_by: 0 % 31.03/31.34 % res_preprocessed: 2140 % 31.03/31.34 % prep_upred: 0 % 31.03/31.34 % prep_unflattend: 0 % 31.03/31.34 % pred_elim_cands: 45 % 31.03/31.34 % pred_elim: 14 % 31.03/31.34 % pred_elim_cl: 14 % 31.03/31.34 % pred_elim_cycles: 45 % 31.03/31.34 % forced_gc_time: 0 % 31.03/31.34 % gc_basic_clause_elim: 0 % 31.03/31.34 % parsing_time: 0.133 % 31.03/31.36 % sem_filter_time: 0. % 31.03/31.36 % pred_elim_time: 0.887 % 31.03/31.36 % out_proof_time: 0. % 31.03/31.36 % monotx_time: 0. % 31.03/31.36 % subtype_inf_time: 0. % 31.03/31.36 % unif_index_cands_time: 0.012 % 31.03/31.36 % unif_index_add_time: 0.005 % 31.03/31.36 % total_time: 16.049 % 31.03/31.36 % num_of_symbols: 115 % 31.03/31.36 % num_of_terms: 5737 % 31.03/31.36 % 31.03/31.36 % ------ Propositional Solver % 31.03/31.36 % 31.03/31.36 % prop_solver_calls: 3 % 31.03/31.36 % prop_fast_solver_calls: 20675 % 31.03/31.36 % prop_num_of_clauses: 1753 % 31.03/31.36 % prop_preprocess_simplified: 16086 % 31.03/31.36 % prop_fo_subsumed: 0 % 31.03/31.36 % prop_solver_time: 0. % 31.03/31.36 % prop_fast_solver_time: 0.063 % 31.03/31.36 % prop_unsat_core_time: 0. % 31.03/31.36 % 31.03/31.36 % ------ QBF % 31.03/31.36 % 31.03/31.36 % qbf_q_res: 0 % 31.03/31.36 % qbf_num_tautologies: 0 % 31.03/31.36 % qbf_prep_cycles: 0 % 31.03/31.36 % 31.03/31.36 % ------ BMC1 % 31.03/31.36 % 31.03/31.36 % bmc1_current_bound: -1 % 31.03/31.36 % bmc1_last_solved_bound: -1 % 31.03/31.36 % bmc1_unsat_core_size: -1 % 31.03/31.36 % bmc1_unsat_core_parents_size: -1 % 31.03/31.36 % bmc1_merge_next_fun: 0 % 31.03/31.36 % bmc1_unsat_core_clauses_time: 0. % 31.03/31.36 % 31.03/31.36 % ------ Instantiation % 31.03/31.36 % 31.03/31.36 % inst_num_of_clauses: 629 % 31.03/31.36 % inst_num_in_passive: 0 % 31.03/31.36 % inst_num_in_active: 629 % 31.03/31.36 % inst_num_in_unprocessed: 0 % 31.03/31.36 % inst_num_of_loops: 665 % 31.03/31.36 % inst_num_of_learning_restarts: 0 % 31.03/31.36 % inst_num_moves_active_passive: 33 % 31.03/31.36 % inst_lit_activity: 279 % 31.03/31.36 % inst_lit_activity_moves: 0 % 31.03/31.36 % inst_num_tautologies: 0 % 31.03/31.36 % inst_num_prop_implied: 0 % 31.03/31.36 % inst_num_existing_simplified: 0 % 31.03/31.36 % inst_num_eq_res_simplified: 0 % 31.03/31.36 % inst_num_child_elim: 0 % 31.03/31.36 % inst_num_of_dismatching_blockings: 0 % 31.03/31.36 % inst_num_of_non_proper_insts: 4 % 31.03/31.36 % inst_num_of_duplicates: 0 % 31.03/31.36 % inst_inst_num_from_inst_to_res: 0 % 31.03/31.36 % inst_dismatching_checking_time: 0. % 31.03/31.36 % 31.03/31.36 % ------ Resolution % 31.03/31.36 % 31.03/31.36 % res_num_of_clauses: 56412 % 31.03/31.36 % res_num_in_passive: 56351 % 31.03/31.36 % res_num_in_active: 1467 % 31.03/31.36 % res_num_of_loops: 3000 % 31.03/31.36 % res_forward_subset_subsumed: 2160 % 31.03/31.36 % res_backward_subset_subsumed: 1493 % 31.03/31.36 % res_forward_subsumed: 1447 % 31.03/31.36 % res_backward_subsumed: 0 % 31.03/31.36 % res_forward_subsumption_resolution: 588 % 31.03/31.36 % res_backward_subsumption_resolution: 32 % 31.03/31.36 % res_clause_to_clause_subsumption: 7543 % 31.03/31.36 % res_orphan_elimination: 0 % 31.03/31.36 % res_tautology_del: 8563 % 31.03/31.36 % res_num_eq_res_simplified: 0 % 31.03/31.36 % res_num_sel_changes: 0 % 31.03/31.36 % res_moves_from_active_to_pass: 0 % 31.03/31.36 % 31.03/31.36 % Status Unknown % 31.03/31.36 % Last status : % 31.03/31.36 % SZS status Unknown %------------------------------------------------------------------------------