%------------------------------------------------------------------------------ % File : iProverMo---2.5-0.1 % Problem : NLP033+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : iprover_modulo %s %d % Computer : n004.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Mon Jul 18 02:38:48 EDT 2022 % Result : Unknown 6.67s 6.91s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NLP033+1 : TPTP v8.1.0. Released v2.4.0. % 0.07/0.13 % Command : iprover_modulo %s %d % 0.13/0.34 % Computer : n004.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Fri Jul 1 10:01:53 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.35 % Running in mono-core mode % 0.21/0.51 % Orienting using strategy Equiv(ClausalAll) % 0.21/0.51 % FOF problem with conjecture % 0.21/0.51 % 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_54ec5d.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_30cef8.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_c8210c | grep -v "SZS" % 0.36/0.54 % 0.36/0.54 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 0.36/0.54 % 0.36/0.54 % % 0.36/0.54 % ------ iProver source info % 0.36/0.54 % 0.36/0.54 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 0.36/0.54 % git: non_committed_changes: true % 0.36/0.54 % git: last_make_outside_of_git: true % 0.36/0.54 % 0.36/0.54 % % 0.36/0.54 % ------ Input Options % 0.36/0.54 % 0.36/0.54 % --out_options all % 0.36/0.54 % --tptp_safe_out true % 0.36/0.54 % --problem_path "" % 0.36/0.54 % --include_path "" % 0.36/0.54 % --clausifier .//eprover % 0.36/0.54 % --clausifier_options --tstp-format % 0.36/0.54 % --stdin false % 0.36/0.54 % --dbg_backtrace false % 0.36/0.54 % --dbg_dump_prop_clauses false % 0.36/0.54 % --dbg_dump_prop_clauses_file - % 0.36/0.54 % --dbg_out_stat false % 0.36/0.54 % 0.36/0.54 % ------ General Options % 0.36/0.54 % 0.36/0.54 % --fof false % 0.36/0.54 % --time_out_real 150. % 0.36/0.54 % --time_out_prep_mult 0.2 % 0.36/0.54 % --time_out_virtual -1. % 0.36/0.54 % --schedule none % 0.36/0.54 % --ground_splitting input % 0.36/0.54 % --splitting_nvd 16 % 0.36/0.54 % --non_eq_to_eq false % 0.36/0.54 % --prep_gs_sim true % 0.36/0.54 % --prep_unflatten false % 0.36/0.54 % --prep_res_sim true % 0.36/0.54 % --prep_upred true % 0.36/0.54 % --res_sim_input true % 0.36/0.54 % --clause_weak_htbl true % 0.36/0.54 % --gc_record_bc_elim false % 0.36/0.54 % --symbol_type_check false % 0.36/0.54 % --clausify_out false % 0.36/0.54 % --large_theory_mode false % 0.36/0.54 % --prep_sem_filter none % 0.36/0.54 % --prep_sem_filter_out false % 0.36/0.54 % --preprocessed_out false % 0.36/0.54 % --sub_typing false % 0.36/0.54 % --brand_transform false % 0.36/0.54 % --pure_diseq_elim true % 0.36/0.54 % --min_unsat_core false % 0.36/0.54 % --pred_elim true % 0.36/0.54 % --add_important_lit false % 0.36/0.54 % --soft_assumptions false % 0.36/0.54 % --reset_solvers false % 0.36/0.54 % --bc_imp_inh [] % 0.36/0.54 % --conj_cone_tolerance 1.5 % 0.36/0.54 % --prolific_symb_bound 500 % 0.36/0.54 % --lt_threshold 2000 % 0.36/0.54 % 0.36/0.54 % ------ SAT Options % 0.36/0.54 % 0.36/0.54 % --sat_mode false % 0.36/0.54 % --sat_fm_restart_options "" % 0.36/0.54 % --sat_gr_def false % 0.36/0.54 % --sat_epr_types true % 0.36/0.54 % --sat_non_cyclic_types false % 0.36/0.54 % --sat_finite_models false % 0.36/0.54 % --sat_fm_lemmas false % 0.36/0.54 % --sat_fm_prep false % 0.36/0.54 % --sat_fm_uc_incr true % 0.36/0.54 % --sat_out_model small % 0.36/0.54 % --sat_out_clauses false % 0.36/0.54 % 0.36/0.54 % ------ QBF Options % 0.36/0.54 % 0.36/0.54 % --qbf_mode false % 0.36/0.54 % --qbf_elim_univ true % 0.36/0.54 % --qbf_sk_in true % 0.36/0.54 % --qbf_pred_elim true % 0.36/0.54 % --qbf_split 32 % 0.36/0.54 % 0.36/0.54 % ------ BMC1 Options % 0.36/0.54 % 0.36/0.54 % --bmc1_incremental false % 0.36/0.54 % --bmc1_axioms reachable_all % 0.36/0.54 % --bmc1_min_bound 0 % 0.36/0.54 % --bmc1_max_bound -1 % 0.36/0.54 % --bmc1_max_bound_default -1 % 0.36/0.54 % --bmc1_symbol_reachability true % 0.36/0.54 % --bmc1_property_lemmas false % 0.36/0.54 % --bmc1_k_induction false % 0.36/0.54 % --bmc1_non_equiv_states false % 0.36/0.54 % --bmc1_deadlock false % 0.36/0.54 % --bmc1_ucm false % 0.36/0.54 % --bmc1_add_unsat_core none % 0.36/0.54 % --bmc1_unsat_core_children false % 0.36/0.54 % --bmc1_unsat_core_extrapolate_axioms false % 0.36/0.54 % --bmc1_out_stat full % 0.36/0.54 % --bmc1_ground_init false % 0.36/0.54 % --bmc1_pre_inst_next_state false % 0.36/0.54 % --bmc1_pre_inst_state false % 0.36/0.54 % --bmc1_pre_inst_reach_state false % 0.36/0.54 % --bmc1_out_unsat_core false % 0.36/0.54 % --bmc1_aig_witness_out false % 0.36/0.54 % --bmc1_verbose false % 0.36/0.54 % --bmc1_dump_clauses_tptp false % 1.29/1.47 % --bmc1_dump_unsat_core_tptp false % 1.29/1.47 % --bmc1_dump_file - % 1.29/1.47 % --bmc1_ucm_expand_uc_limit 128 % 1.29/1.47 % --bmc1_ucm_n_expand_iterations 6 % 1.29/1.47 % --bmc1_ucm_extend_mode 1 % 1.29/1.47 % --bmc1_ucm_init_mode 2 % 1.29/1.47 % --bmc1_ucm_cone_mode none % 1.29/1.47 % --bmc1_ucm_reduced_relation_type 0 % 1.29/1.47 % --bmc1_ucm_relax_model 4 % 1.29/1.47 % --bmc1_ucm_full_tr_after_sat true % 1.29/1.47 % --bmc1_ucm_expand_neg_assumptions false % 1.29/1.47 % --bmc1_ucm_layered_model none % 1.29/1.47 % --bmc1_ucm_max_lemma_size 10 % 1.29/1.47 % 1.29/1.47 % ------ AIG Options % 1.29/1.47 % 1.29/1.47 % --aig_mode false % 1.29/1.47 % 1.29/1.47 % ------ Instantiation Options % 1.29/1.47 % 1.29/1.47 % --instantiation_flag true % 1.29/1.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 1.29/1.47 % --inst_solver_per_active 750 % 1.29/1.47 % --inst_solver_calls_frac 0.5 % 1.29/1.47 % --inst_passive_queue_type priority_queues % 1.29/1.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 1.29/1.47 % --inst_passive_queues_freq [25;2] % 1.29/1.47 % --inst_dismatching true % 1.29/1.47 % --inst_eager_unprocessed_to_passive true % 1.29/1.47 % --inst_prop_sim_given true % 1.29/1.47 % --inst_prop_sim_new false % 1.29/1.47 % --inst_orphan_elimination true % 1.29/1.47 % --inst_learning_loop_flag true % 1.29/1.47 % --inst_learning_start 3000 % 1.29/1.47 % --inst_learning_factor 2 % 1.29/1.47 % --inst_start_prop_sim_after_learn 3 % 1.29/1.47 % --inst_sel_renew solver % 1.29/1.47 % --inst_lit_activity_flag true % 1.29/1.47 % --inst_out_proof true % 1.29/1.47 % 1.29/1.47 % ------ Resolution Options % 1.29/1.47 % 1.29/1.47 % --resolution_flag true % 1.29/1.47 % --res_lit_sel kbo_max % 1.29/1.47 % --res_to_prop_solver none % 1.29/1.47 % --res_prop_simpl_new false % 1.29/1.47 % --res_prop_simpl_given false % 1.29/1.47 % --res_passive_queue_type priority_queues % 1.29/1.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 1.29/1.47 % --res_passive_queues_freq [15;5] % 1.29/1.47 % --res_forward_subs full % 1.29/1.47 % --res_backward_subs full % 1.29/1.47 % --res_forward_subs_resolution true % 1.29/1.47 % --res_backward_subs_resolution true % 1.29/1.47 % --res_orphan_elimination false % 1.29/1.47 % --res_time_limit 1000. % 1.29/1.47 % --res_out_proof true % 1.29/1.47 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_54ec5d.s % 1.29/1.47 % --modulo true % 1.29/1.47 % 1.29/1.47 % ------ Combination Options % 1.29/1.47 % 1.29/1.47 % --comb_res_mult 1000 % 1.29/1.47 % --comb_inst_mult 300 % 1.29/1.47 % ------ % 1.29/1.47 % 1.29/1.47 % ------ Parsing...% successful % 1.29/1.47 % 1.29/1.47 % ------ Preprocessing... gs_s sp: 1848 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e % % 1.29/1.47 % 1.29/1.47 % ------ Proving... % 1.29/1.47 % ------ Problem Properties % 1.29/1.47 % 1.29/1.47 % % 1.29/1.47 % EPR false % 1.29/1.47 % Horn false % 1.29/1.47 % Has equality false % 1.29/1.47 % 1.29/1.47 % % ------ Input Options Time Limit: Unbounded % 1.29/1.47 % 1.29/1.47 % 1.29/1.47 % % ------ Current options: % 1.29/1.47 % 1.29/1.47 % ------ Input Options % 1.29/1.47 % 1.29/1.47 % --out_options all % 1.29/1.47 % --tptp_safe_out true % 1.29/1.47 % --problem_path "" % 1.29/1.47 % --include_path "" % 1.29/1.47 % --clausifier .//eprover % 1.29/1.47 % --clausifier_options --tstp-format % 1.29/1.47 % --stdin false % 1.29/1.47 % --dbg_backtrace false % 1.29/1.47 % --dbg_dump_prop_clauses false % 1.29/1.47 % --dbg_dump_prop_clauses_file - % 1.29/1.47 % --dbg_out_stat false % 1.29/1.47 % 1.29/1.47 % ------ General Options % 1.29/1.47 % 1.29/1.47 % --fof false % 1.29/1.47 % --time_out_real 150. % 1.29/1.47 % --time_out_prep_mult 0.2 % 1.29/1.47 % --time_out_virtual -1. % 1.29/1.47 % --schedule none % 1.29/1.47 % --ground_splitting input % 1.29/1.47 % --splitting_nvd 16 % 1.29/1.47 % --non_eq_to_eq false % 1.29/1.47 % --prep_gs_sim true % 1.29/1.47 % --prep_unflatten false % 1.29/1.47 % --prep_res_sim true % 1.29/1.47 % --prep_upred true % 1.29/1.47 % --res_sim_input true % 1.29/1.47 % --clause_weak_htbl true % 1.29/1.47 % --gc_record_bc_elim false % 1.29/1.47 % --symbol_type_check false % 1.29/1.47 % --clausify_out false % 1.29/1.47 % --large_theory_mode false % 1.29/1.47 % --prep_sem_filter none % 1.29/1.47 % --prep_sem_filter_out false % 1.29/1.47 % --preprocessed_out false % 1.29/1.47 % --sub_typing false % 1.29/1.47 % --brand_transform false % 1.29/1.47 % --pure_diseq_elim true % 1.29/1.47 % --min_unsat_core false % 1.29/1.47 % --pred_elim true % 1.29/1.47 % --add_important_lit false % 1.29/1.47 % --soft_assumptions false % 1.29/1.47 % --reset_solvers false % 1.29/1.47 % --bc_imp_inh [] % 1.29/1.47 % --conj_cone_tolerance 1.5 % 1.29/1.47 % --prolific_symb_bound 500 % 1.29/1.47 % --lt_threshold 2000 % 1.29/1.47 % 1.29/1.47 % ------ SAT Options % 1.29/1.47 % 1.29/1.47 % --sat_mode false % 1.29/1.47 % --sat_fm_restart_options "" % 1.29/1.47 % --sat_gr_def false % 1.29/1.47 % --sat_epr_types true % 1.29/1.47 % --sat_non_cyclic_types false % 1.29/1.47 % --sat_finite_models false % 1.29/1.47 % --sat_fm_lemmas false % 1.29/1.47 % --sat_fm_prep false % 1.29/1.47 % --sat_fm_uc_incr true % 1.29/1.47 % --sat_out_model small % 1.29/1.47 % --sat_out_clauses false % 1.29/1.47 % 1.29/1.47 % ------ QBF Options % 1.29/1.47 % 1.29/1.47 % --qbf_mode false % 1.29/1.47 % --qbf_elim_univ true % 1.29/1.47 % --qbf_sk_in true % 1.29/1.47 % --qbf_pred_elim true % 1.29/1.47 % --qbf_split 32 % 1.29/1.47 % 1.29/1.47 % ------ BMC1 Options % 1.29/1.47 % 1.29/1.47 % --bmc1_incremental false % 1.29/1.47 % --bmc1_axioms reachable_all % 1.29/1.47 % --bmc1_min_bound 0 % 1.29/1.47 % --bmc1_max_bound -1 % 1.29/1.47 % --bmc1_max_bound_default -1 % 1.29/1.47 % --bmc1_symbol_reachability true % 1.29/1.47 % --bmc1_property_lemmas false % 1.29/1.47 % --bmc1_k_induction false % 1.29/1.47 % --bmc1_non_equiv_states false % 1.29/1.47 % --bmc1_deadlock false % 1.29/1.47 % --bmc1_ucm false % 1.29/1.47 % --bmc1_add_unsat_core none % 1.29/1.47 % --bmc1_unsat_core_children false % 1.29/1.47 % --bmc1_unsat_core_extrapolate_axioms false % 1.29/1.47 % --bmc1_out_stat full % 1.29/1.47 % --bmc1_ground_init false % 1.29/1.47 % --bmc1_pre_inst_next_state false % 1.29/1.47 % --bmc1_pre_inst_state false % 1.29/1.47 % --bmc1_pre_inst_reach_state false % 1.29/1.47 % --bmc1_out_unsat_core false % 1.29/1.47 % --bmc1_aig_witness_out false % 1.29/1.47 % --bmc1_verbose false % 1.29/1.47 % --bmc1_dump_clauses_tptp false % 1.29/1.47 % --bmc1_dump_unsat_core_tptp false % 1.29/1.47 % --bmc1_dump_file - % 1.29/1.47 % --bmc1_ucm_expand_uc_limit 128 % 1.29/1.47 % --bmc1_ucm_n_expand_iterations 6 % 1.29/1.47 % --bmc1_ucm_extend_mode 1 % 1.29/1.47 % --bmc1_ucm_init_mode 2 % 1.29/1.47 % --bmc1_ucm_cone_mode none % 1.29/1.47 % --bmc1_ucm_reduced_relation_type 0 % 1.29/1.47 % --bmc1_ucm_relax_model 4 % 1.29/1.47 % --bmc1_ucm_full_tr_after_sat true % 1.29/1.47 % --bmc1_ucm_expand_neg_assumptions false % 1.29/1.47 % --bmc1_ucm_layered_model none % 1.29/1.47 % --bmc1_ucm_max_lemma_size 10 % 1.29/1.47 % 1.29/1.47 % ------ AIG Options % 1.29/1.47 % 1.29/1.47 % --aig_mode false % 1.29/1.47 % 1.29/1.47 % ------ Instantiation Options % 1.29/1.47 % 1.29/1.47 % --instantiation_flag true % 1.29/1.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 1.29/1.47 % --inst_solver_per_active 750 % 1.29/1.47 % --inst_solver_calls_frac 0.5 % 1.29/1.47 % --inst_passive_queue_type priority_queues % 1.29/1.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 1.29/1.47 % --inst_passive_queues_freq [25;2] % 1.29/1.47 % --inst_dismatching true % 1.29/1.47 % --inst_eager_unprocessed_to_passive true % 1.29/1.47 % --inst_prop_sim_given true % 3.35/3.55 % --inst_prop_sim_new false % 3.35/3.55 % --inst_orphan_elimination true % 3.35/3.55 % --inst_learning_loop_flag true % 3.35/3.55 % --inst_learning_start 3000 % 3.35/3.55 % --inst_learning_factor 2 % 3.35/3.55 % --inst_start_prop_sim_after_learn 3 % 3.35/3.55 % --inst_sel_renew solver % 3.35/3.55 % --inst_lit_activity_flag true % 3.35/3.55 % --inst_out_proof true % 3.35/3.55 % 3.35/3.55 % ------ Resolution Options % 3.35/3.55 % 3.35/3.55 % --resolution_flag true % 3.35/3.55 % --res_lit_sel kbo_max % 3.35/3.55 % --res_to_prop_solver none % 3.35/3.55 % --res_prop_simpl_new false % 3.35/3.55 % --res_prop_simpl_given false % 3.35/3.55 % --res_passive_queue_type priority_queues % 3.35/3.55 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 3.35/3.55 % --res_passive_queues_freq [15;5] % 3.35/3.55 % --res_forward_subs full % 3.35/3.55 % --res_backward_subs full % 3.35/3.55 % --res_forward_subs_resolution true % 3.35/3.55 % --res_backward_subs_resolution true % 3.35/3.56 % --res_orphan_elimination false % 3.35/3.56 % --res_time_limit 1000. % 3.35/3.56 % --res_out_proof true % 3.35/3.56 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_54ec5d.s % 3.35/3.56 % --modulo true % 3.35/3.56 % 3.35/3.56 % ------ Combination Options % 3.35/3.56 % 3.35/3.56 % --comb_res_mult 1000 % 3.35/3.56 % --comb_inst_mult 300 % 3.35/3.56 % ------ % 3.35/3.56 % 3.35/3.56 % 3.35/3.56 % 3.35/3.56 % ------ Proving... % 3.35/3.56 % warning: shown sat in sat incomplete mode % 3.35/3.56 % % 3.35/3.56 % 3.35/3.56 % 3.35/3.56 ------ Building Model...Done % 3.35/3.56 % 3.35/3.56 %------ The model is defined over ground terms (initial term algebra). % 3.35/3.56 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 3.35/3.56 %------ where \phi is a formula over the term algebra. % 3.35/3.56 %------ If we have equality in the problem then it is also defined as a predicate above, % 3.35/3.56 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 3.35/3.56 %------ See help for --sat_out_model for different model outputs. % 3.35/3.56 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 3.35/3.56 %------ where the first argument stands for the sort ($i in the unsorted case) % 3.35/3.56 % 3.35/3.56 % 3.35/3.56 % 3.35/3.56 % 3.35/3.56 %------ Positive definition of member % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 (! [X0,X1,X2] : % 3.35/3.56 ( member(X0,X1,X2) <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Negative definition of actual_world % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 (! [X0] : % 3.35/3.56 ( ~(actual_world(X0)) <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of table % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 (! [X0,X1] : % 3.35/3.56 ( table(X0,X1) <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of group % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 (! [X0,X1] : % 3.35/3.56 ( group(X0,X1) <=> % 3.35/3.56 ( % 3.35/3.56 ( % 3.35/3.56 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 ) % 3.35/3.56 ) % 3.35/3.56 % 3.35/3.56 ) % 3.35/3.56 ) % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of hamburger % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 (! [X0,X1] : % 3.35/3.56 ( hamburger(X0,X1) <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP0_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP0_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP1_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP1_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP2_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP2_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP3_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP3_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP4_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP4_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP5_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP5_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP6_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP6_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP7_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP7_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP8_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP8_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP9_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP9_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP10_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP10_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP11_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP11_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP12_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP12_iProver_split <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP13_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP13_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP14_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP14_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP15_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP15_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP16_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP16_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP17_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP17_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP18_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP18_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP19_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP19_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP20_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP20_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP21_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP21_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP22_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP22_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP23_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP23_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP24_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP24_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP25_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP25_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP26_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP26_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP27_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP27_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP28_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP28_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP29_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP29_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP30_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP30_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP31_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP31_iProver_split <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP32_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP32_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP33_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP33_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP34_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP34_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP35_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP35_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP36_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP36_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP37_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP37_iProver_split <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP38_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP38_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP39_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP39_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP40_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP40_iProver_split <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP41_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP41_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP42_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP42_iProver_split <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP43_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP43_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP44_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP44_iProver_split <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP45_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP45_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP46_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP46_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP47_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP47_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP48_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP48_iProver_split <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP49_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP49_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP50_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP50_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP51_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP51_iProver_split <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP52_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP52_iProver_split <=> % 3.35/3.56 $false % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP53_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP53_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 %------ Positive definition of sP54_iProver_split % 3.35/3.56 fof(lit_def,axiom, % 3.35/3.56 ( sP54_iProver_split <=> % 3.35/3.56 $true % 3.35/3.56 ) % 3.35/3.56 ). % 3.35/3.56 % 3.35/3.56 % 3.35/3.56 % 3.35/3.56 % ------ Statistics % 3.35/3.56 % 3.35/3.56 % ------ General % 3.35/3.56 % 3.35/3.56 % num_of_input_clauses: 576 % 3.35/3.56 % num_of_input_neg_conjectures: 576 % 3.35/3.56 % num_of_splits: 1848 % 3.35/3.56 % num_of_split_atoms: 55 % 3.35/3.56 % num_of_sem_filtered_clauses: 0 % 3.35/3.56 % num_of_subtypes: 0 % 3.35/3.56 % monotx_restored_types: 0 % 3.35/3.56 % sat_num_of_epr_types: 0 % 3.35/3.56 % sat_num_of_non_cyclic_types: 0 % 3.35/3.56 % sat_guarded_non_collapsed_types: 0 % 3.35/3.56 % is_epr: 0 % 3.35/3.56 % is_horn: 0 % 3.35/3.56 % has_eq: 0 % 3.35/3.56 % num_pure_diseq_elim: 0 % 3.35/3.56 % simp_replaced_by: 0 % 3.35/3.56 % res_preprocessed: 3000 % 3.35/3.56 % prep_upred: 0 % 3.35/3.56 % prep_unflattend: 0 % 3.35/3.56 % pred_elim_cands: 55 % 3.35/3.56 % pred_elim: 0 % 3.35/3.56 % pred_elim_cl: 0 % 3.35/3.56 % pred_elim_cycles: 55 % 3.35/3.56 % forced_gc_time: 0 % 3.35/3.56 % gc_basic_clause_elim: 0 % 3.35/3.56 % parsing_time: 0.062 % 3.35/3.56 % sem_filter_time: 0. % 3.35/3.56 % pred_elim_time: 0.681 % 3.35/3.56 % out_proof_time: 0. % 3.35/3.56 % monotx_time: 0. % 3.35/3.56 % subtype_inf_time: 0. % 3.35/3.56 % unif_index_cands_time: 0.002 % 3.35/3.56 % unif_index_add_time: 0.003 % 3.35/3.56 % total_time: 3.035 % 3.35/3.56 % num_of_symbols: 112 % 3.35/3.56 % num_of_terms: 2372 % 3.35/3.56 % 3.35/3.56 % ------ Propositional Solver % 3.35/3.56 % 3.35/3.56 % prop_solver_calls: 3 % 3.35/3.56 % prop_fast_solver_calls: 24781 % 3.35/3.56 % prop_num_of_clauses: 3558 % 3.35/3.56 % prop_preprocess_simplified: 18380 % 3.35/3.56 % prop_fo_subsumed: 0 % 3.35/3.56 % prop_solver_time: 0. % 3.35/3.56 % prop_fast_solver_time: 0.023 % 3.35/3.56 % prop_unsat_core_time: 0. % 3.35/3.56 % 3.35/3.56 % ------ QBF % 3.35/3.56 % 3.35/3.56 % qbf_q_res: 0 % 3.35/3.56 % qbf_num_tautologies: 0 % 3.35/3.56 % qbf_prep_cycles: 0 % 3.35/3.56 % 3.35/3.56 % ------ BMC1 % 3.35/3.56 % 3.35/3.56 % bmc1_current_bound: -1 % 3.35/3.56 % bmc1_last_solved_bound: -1 % 3.35/3.56 % bmc1_unsat_core_size: -1 % 3.35/3.56 % bmc1_unsat_core_parents_size: -1 % 3.35/3.56 % bmc1_merge_next_fun: 0 % 3.35/3.56 % bmc1_unsat_core_clauses_time: 0. % 3.35/3.56 % 3.35/3.56 % ------ Instantiation % 3.35/3.56 % 3.35/3.56 % inst_num_of_clauses: 633 % 3.35/3.56 % inst_num_in_passive: 0 % 3.35/3.56 % inst_num_in_active: 633 % 3.35/3.56 % inst_num_in_unprocessed: 0 % 3.35/3.56 % inst_num_of_loops: 672 % 3.35/3.56 % inst_num_of_learning_restarts: 0 % 3.35/3.56 % inst_num_moves_active_passive: 36 % 3.35/3.56 % inst_lit_activity: 52 % 3.35/3.56 % inst_lit_activity_moves: 0 % 3.35/3.56 % inst_num_tautologies: 0 % 3.35/3.56 % inst_num_prop_implied: 0 % 3.35/3.56 % inst_num_existing_simplified: 0 % 3.35/3.56 % inst_num_eq_res_simplified: 0 % 3.35/3.56 % inst_num_child_elim: 0 % 3.35/3.56 % inst_num_of_dismatching_blockings: 0 % 3.35/3.56 % inst_num_of_non_proper_insts: 22 % 3.35/3.56 % inst_num_of_duplicates: 0 % 3.35/3.56 % inst_inst_num_from_inst_to_res: 0 % 3.35/3.56 % inst_dismatching_checking_time: 0. % 3.35/3.56 % 3.35/3.56 % ------ Resolution % 3.35/3.56 % 3.35/3.56 % res_num_of_clauses: 5288 % 3.35/3.56 % res_num_in_passive: 3686 % 3.35/3.56 % res_num_in_active: 1752 % 3.35/3.56 % res_num_of_loops: 3000 % 3.35/3.56 % res_forward_subset_subsumed: 2520 % 3.35/3.56 % res_backward_subset_subsumed: 694 % 3.35/3.56 % res_forward_subsumed: 1214 % 3.35/3.56 % res_backward_subsumed: 13 % 3.35/3.56 % res_forward_subsumption_resolution: 1041 % 3.35/3.56 % res_backward_subsumption_resolution: 0 % 3.35/3.56 % res_clause_to_clause_subsumption: 7804 % 3.35/3.56 % res_orphan_elimination: 0 % 3.35/3.56 % res_tautology_del: 452 % 3.35/3.56 % res_num_eq_res_simplified: 0 % 3.35/3.56 % res_num_sel_changes: 0 % 3.35/3.56 % res_moves_from_active_to_pass: 0 % 3.35/3.56 % 3.35/3.56 % Status Unknown % 3.41/3.66 % Orienting using strategy ClausalAll % 3.41/3.66 % FOF problem with conjecture % 3.41/3.66 % 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_54ec5d.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_30cef8.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_918505 | grep -v "SZS" % 3.41/3.68 % 3.41/3.68 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 3.41/3.68 % 3.41/3.68 % % 3.41/3.68 % ------ iProver source info % 3.41/3.68 % 3.41/3.68 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 3.41/3.68 % git: non_committed_changes: true % 3.41/3.68 % git: last_make_outside_of_git: true % 3.41/3.68 % 3.41/3.68 % % 3.41/3.68 % ------ Input Options % 3.41/3.68 % 3.41/3.68 % --out_options all % 3.41/3.68 % --tptp_safe_out true % 3.41/3.68 % --problem_path "" % 3.41/3.68 % --include_path "" % 3.41/3.68 % --clausifier .//eprover % 3.41/3.68 % --clausifier_options --tstp-format % 3.41/3.68 % --stdin false % 3.41/3.68 % --dbg_backtrace false % 3.41/3.68 % --dbg_dump_prop_clauses false % 3.41/3.68 % --dbg_dump_prop_clauses_file - % 3.41/3.68 % --dbg_out_stat false % 3.41/3.68 % 3.41/3.68 % ------ General Options % 3.41/3.68 % 3.41/3.68 % --fof false % 3.41/3.68 % --time_out_real 150. % 3.41/3.68 % --time_out_prep_mult 0.2 % 3.41/3.68 % --time_out_virtual -1. % 3.41/3.68 % --schedule none % 3.41/3.68 % --ground_splitting input % 3.41/3.68 % --splitting_nvd 16 % 3.41/3.68 % --non_eq_to_eq false % 3.41/3.68 % --prep_gs_sim true % 3.41/3.68 % --prep_unflatten false % 3.41/3.68 % --prep_res_sim true % 3.41/3.68 % --prep_upred true % 3.41/3.68 % --res_sim_input true % 3.41/3.68 % --clause_weak_htbl true % 3.41/3.68 % --gc_record_bc_elim false % 3.41/3.68 % --symbol_type_check false % 3.41/3.68 % --clausify_out false % 3.41/3.68 % --large_theory_mode false % 3.41/3.68 % --prep_sem_filter none % 3.41/3.68 % --prep_sem_filter_out false % 3.41/3.68 % --preprocessed_out false % 3.41/3.68 % --sub_typing false % 3.41/3.68 % --brand_transform false % 3.41/3.68 % --pure_diseq_elim true % 3.41/3.68 % --min_unsat_core false % 3.41/3.68 % --pred_elim true % 3.41/3.68 % --add_important_lit false % 3.41/3.68 % --soft_assumptions false % 3.41/3.68 % --reset_solvers false % 3.41/3.68 % --bc_imp_inh [] % 3.41/3.68 % --conj_cone_tolerance 1.5 % 3.41/3.68 % --prolific_symb_bound 500 % 3.41/3.68 % --lt_threshold 2000 % 3.41/3.68 % 3.41/3.68 % ------ SAT Options % 3.41/3.68 % 3.41/3.68 % --sat_mode false % 3.41/3.68 % --sat_fm_restart_options "" % 3.41/3.68 % --sat_gr_def false % 3.41/3.68 % --sat_epr_types true % 3.41/3.68 % --sat_non_cyclic_types false % 3.41/3.68 % --sat_finite_models false % 3.41/3.68 % --sat_fm_lemmas false % 3.41/3.68 % --sat_fm_prep false % 3.41/3.68 % --sat_fm_uc_incr true % 3.41/3.68 % --sat_out_model small % 3.41/3.68 % --sat_out_clauses false % 3.41/3.68 % 3.41/3.68 % ------ QBF Options % 3.41/3.68 % 3.41/3.68 % --qbf_mode false % 3.41/3.68 % --qbf_elim_univ true % 3.41/3.68 % --qbf_sk_in true % 3.41/3.68 % --qbf_pred_elim true % 3.41/3.68 % --qbf_split 32 % 3.41/3.68 % 3.41/3.68 % ------ BMC1 Options % 3.41/3.68 % 3.41/3.68 % --bmc1_incremental false % 3.41/3.68 % --bmc1_axioms reachable_all % 3.41/3.68 % --bmc1_min_bound 0 % 3.41/3.68 % --bmc1_max_bound -1 % 3.41/3.68 % --bmc1_max_bound_default -1 % 3.41/3.68 % --bmc1_symbol_reachability true % 3.41/3.68 % --bmc1_property_lemmas false % 3.41/3.68 % --bmc1_k_induction false % 3.41/3.68 % --bmc1_non_equiv_states false % 3.41/3.68 % --bmc1_deadlock false % 3.41/3.68 % --bmc1_ucm false % 3.41/3.68 % --bmc1_add_unsat_core none % 3.41/3.68 % --bmc1_unsat_core_children false % 3.41/3.68 % --bmc1_unsat_core_extrapolate_axioms false % 3.41/3.68 % --bmc1_out_stat full % 3.41/3.68 % --bmc1_ground_init false % 3.41/3.68 % --bmc1_pre_inst_next_state false % 3.41/3.68 % --bmc1_pre_inst_state false % 3.41/3.68 % --bmc1_pre_inst_reach_state false % 3.41/3.68 % --bmc1_out_unsat_core false % 3.41/3.68 % --bmc1_aig_witness_out false % 3.41/3.68 % --bmc1_verbose false % 3.41/3.68 % --bmc1_dump_clauses_tptp false % 4.51/4.68 % --bmc1_dump_unsat_core_tptp false % 4.51/4.68 % --bmc1_dump_file - % 4.51/4.68 % --bmc1_ucm_expand_uc_limit 128 % 4.51/4.68 % --bmc1_ucm_n_expand_iterations 6 % 4.51/4.68 % --bmc1_ucm_extend_mode 1 % 4.51/4.68 % --bmc1_ucm_init_mode 2 % 4.51/4.68 % --bmc1_ucm_cone_mode none % 4.51/4.68 % --bmc1_ucm_reduced_relation_type 0 % 4.51/4.68 % --bmc1_ucm_relax_model 4 % 4.51/4.68 % --bmc1_ucm_full_tr_after_sat true % 4.51/4.68 % --bmc1_ucm_expand_neg_assumptions false % 4.51/4.68 % --bmc1_ucm_layered_model none % 4.51/4.68 % --bmc1_ucm_max_lemma_size 10 % 4.51/4.68 % 4.51/4.68 % ------ AIG Options % 4.51/4.68 % 4.51/4.68 % --aig_mode false % 4.51/4.68 % 4.51/4.68 % ------ Instantiation Options % 4.51/4.68 % 4.51/4.68 % --instantiation_flag true % 4.51/4.68 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 4.51/4.68 % --inst_solver_per_active 750 % 4.51/4.68 % --inst_solver_calls_frac 0.5 % 4.51/4.68 % --inst_passive_queue_type priority_queues % 4.51/4.68 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 4.51/4.68 % --inst_passive_queues_freq [25;2] % 4.51/4.68 % --inst_dismatching true % 4.51/4.68 % --inst_eager_unprocessed_to_passive true % 4.51/4.68 % --inst_prop_sim_given true % 4.51/4.68 % --inst_prop_sim_new false % 4.51/4.68 % --inst_orphan_elimination true % 4.51/4.68 % --inst_learning_loop_flag true % 4.51/4.68 % --inst_learning_start 3000 % 4.51/4.68 % --inst_learning_factor 2 % 4.51/4.68 % --inst_start_prop_sim_after_learn 3 % 4.51/4.68 % --inst_sel_renew solver % 4.51/4.68 % --inst_lit_activity_flag true % 4.51/4.68 % --inst_out_proof true % 4.51/4.68 % 4.51/4.68 % ------ Resolution Options % 4.51/4.68 % 4.51/4.68 % --resolution_flag true % 4.51/4.68 % --res_lit_sel kbo_max % 4.51/4.68 % --res_to_prop_solver none % 4.51/4.68 % --res_prop_simpl_new false % 4.51/4.68 % --res_prop_simpl_given false % 4.51/4.68 % --res_passive_queue_type priority_queues % 4.51/4.68 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 4.51/4.68 % --res_passive_queues_freq [15;5] % 4.51/4.68 % --res_forward_subs full % 4.51/4.68 % --res_backward_subs full % 4.51/4.68 % --res_forward_subs_resolution true % 4.51/4.68 % --res_backward_subs_resolution true % 4.51/4.68 % --res_orphan_elimination false % 4.51/4.68 % --res_time_limit 1000. % 4.51/4.68 % --res_out_proof true % 4.51/4.68 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_54ec5d.s % 4.51/4.68 % --modulo true % 4.51/4.68 % 4.51/4.68 % ------ Combination Options % 4.51/4.68 % 4.51/4.68 % --comb_res_mult 1000 % 4.51/4.68 % --comb_inst_mult 300 % 4.51/4.68 % ------ % 4.51/4.68 % 4.51/4.68 % ------ Parsing...% successful % 4.51/4.68 % 4.51/4.68 % ------ Preprocessing... gs_s sp: 1848 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e % % 4.51/4.68 % 4.51/4.68 % ------ Proving... % 4.51/4.68 % ------ Problem Properties % 4.51/4.68 % 4.51/4.68 % % 4.51/4.68 % EPR false % 4.51/4.68 % Horn false % 4.51/4.68 % Has equality false % 4.51/4.68 % 4.51/4.68 % % ------ Input Options Time Limit: Unbounded % 4.51/4.68 % 4.51/4.68 % 4.51/4.68 % % ------ Current options: % 4.51/4.68 % 4.51/4.68 % ------ Input Options % 4.51/4.68 % 4.51/4.68 % --out_options all % 4.51/4.68 % --tptp_safe_out true % 4.51/4.68 % --problem_path "" % 4.51/4.68 % --include_path "" % 4.51/4.68 % --clausifier .//eprover % 4.51/4.68 % --clausifier_options --tstp-format % 4.51/4.68 % --stdin false % 4.51/4.68 % --dbg_backtrace false % 4.51/4.68 % --dbg_dump_prop_clauses false % 4.51/4.68 % --dbg_dump_prop_clauses_file - % 4.51/4.68 % --dbg_out_stat false % 4.51/4.68 % 4.51/4.68 % ------ General Options % 4.51/4.68 % 4.51/4.68 % --fof false % 4.51/4.68 % --time_out_real 150. % 4.51/4.68 % --time_out_prep_mult 0.2 % 4.51/4.68 % --time_out_virtual -1. % 4.51/4.68 % --schedule none % 4.51/4.68 % --ground_splitting input % 4.51/4.68 % --splitting_nvd 16 % 4.51/4.68 % --non_eq_to_eq false % 4.51/4.68 % --prep_gs_sim true % 4.51/4.68 % --prep_unflatten false % 4.51/4.69 % --prep_res_sim true % 4.51/4.69 % --prep_upred true % 4.51/4.69 % --res_sim_input true % 4.51/4.69 % --clause_weak_htbl true % 4.51/4.69 % --gc_record_bc_elim false % 4.51/4.69 % --symbol_type_check false % 4.51/4.69 % --clausify_out false % 4.51/4.69 % --large_theory_mode false % 4.51/4.69 % --prep_sem_filter none % 4.51/4.69 % --prep_sem_filter_out false % 4.51/4.69 % --preprocessed_out false % 4.51/4.69 % --sub_typing false % 4.51/4.69 % --brand_transform false % 4.51/4.69 % --pure_diseq_elim true % 4.51/4.69 % --min_unsat_core false % 4.51/4.69 % --pred_elim true % 4.51/4.69 % --add_important_lit false % 4.51/4.69 % --soft_assumptions false % 4.51/4.69 % --reset_solvers false % 4.51/4.69 % --bc_imp_inh [] % 4.51/4.69 % --conj_cone_tolerance 1.5 % 4.51/4.69 % --prolific_symb_bound 500 % 4.51/4.69 % --lt_threshold 2000 % 4.51/4.69 % 4.51/4.69 % ------ SAT Options % 4.51/4.69 % 4.51/4.69 % --sat_mode false % 4.51/4.69 % --sat_fm_restart_options "" % 4.51/4.69 % --sat_gr_def false % 4.51/4.69 % --sat_epr_types true % 4.51/4.69 % --sat_non_cyclic_types false % 4.51/4.69 % --sat_finite_models false % 4.51/4.69 % --sat_fm_lemmas false % 4.51/4.69 % --sat_fm_prep false % 4.51/4.69 % --sat_fm_uc_incr true % 4.51/4.69 % --sat_out_model small % 4.51/4.69 % --sat_out_clauses false % 4.51/4.69 % 4.51/4.69 % ------ QBF Options % 4.51/4.69 % 4.51/4.69 % --qbf_mode false % 4.51/4.69 % --qbf_elim_univ true % 4.51/4.69 % --qbf_sk_in true % 4.51/4.69 % --qbf_pred_elim true % 4.51/4.69 % --qbf_split 32 % 4.51/4.69 % 4.51/4.69 % ------ BMC1 Options % 4.51/4.69 % 4.51/4.69 % --bmc1_incremental false % 4.51/4.69 % --bmc1_axioms reachable_all % 4.51/4.69 % --bmc1_min_bound 0 % 4.51/4.69 % --bmc1_max_bound -1 % 4.51/4.69 % --bmc1_max_bound_default -1 % 4.51/4.69 % --bmc1_symbol_reachability true % 4.51/4.69 % --bmc1_property_lemmas false % 4.51/4.69 % --bmc1_k_induction false % 4.51/4.69 % --bmc1_non_equiv_states false % 4.51/4.69 % --bmc1_deadlock false % 4.51/4.69 % --bmc1_ucm false % 4.51/4.69 % --bmc1_add_unsat_core none % 4.51/4.69 % --bmc1_unsat_core_children false % 4.51/4.69 % --bmc1_unsat_core_extrapolate_axioms false % 4.51/4.69 % --bmc1_out_stat full % 4.51/4.69 % --bmc1_ground_init false % 4.51/4.69 % --bmc1_pre_inst_next_state false % 4.51/4.69 % --bmc1_pre_inst_state false % 4.51/4.69 % --bmc1_pre_inst_reach_state false % 4.51/4.69 % --bmc1_out_unsat_core false % 4.51/4.69 % --bmc1_aig_witness_out false % 4.51/4.69 % --bmc1_verbose false % 4.51/4.69 % --bmc1_dump_clauses_tptp false % 4.51/4.69 % --bmc1_dump_unsat_core_tptp false % 4.51/4.69 % --bmc1_dump_file - % 4.51/4.69 % --bmc1_ucm_expand_uc_limit 128 % 4.51/4.69 % --bmc1_ucm_n_expand_iterations 6 % 4.51/4.69 % --bmc1_ucm_extend_mode 1 % 4.51/4.69 % --bmc1_ucm_init_mode 2 % 4.51/4.69 % --bmc1_ucm_cone_mode none % 4.51/4.69 % --bmc1_ucm_reduced_relation_type 0 % 4.51/4.69 % --bmc1_ucm_relax_model 4 % 4.51/4.69 % --bmc1_ucm_full_tr_after_sat true % 4.51/4.69 % --bmc1_ucm_expand_neg_assumptions false % 4.51/4.69 % --bmc1_ucm_layered_model none % 4.51/4.69 % --bmc1_ucm_max_lemma_size 10 % 4.51/4.69 % 4.51/4.69 % ------ AIG Options % 4.51/4.69 % 4.51/4.69 % --aig_mode false % 4.51/4.69 % 4.51/4.69 % ------ Instantiation Options % 4.51/4.69 % 4.51/4.69 % --instantiation_flag true % 4.51/4.69 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 4.51/4.69 % --inst_solver_per_active 750 % 4.51/4.69 % --inst_solver_calls_frac 0.5 % 4.51/4.69 % --inst_passive_queue_type priority_queues % 4.51/4.69 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 4.51/4.69 % --inst_passive_queues_freq [25;2] % 4.51/4.69 % --inst_dismatching true % 4.51/4.69 % --inst_eager_unprocessed_to_passive true % 4.51/4.69 % --inst_prop_sim_given true % 6.67/6.91 % --inst_prop_sim_new false % 6.67/6.91 % --inst_orphan_elimination true % 6.67/6.91 % --inst_learning_loop_flag true % 6.67/6.91 % --inst_learning_start 3000 % 6.67/6.91 % --inst_learning_factor 2 % 6.67/6.91 % --inst_start_prop_sim_after_learn 3 % 6.67/6.91 % --inst_sel_renew solver % 6.67/6.91 % --inst_lit_activity_flag true % 6.67/6.91 % --inst_out_proof true % 6.67/6.91 % 6.67/6.91 % ------ Resolution Options % 6.67/6.91 % 6.67/6.91 % --resolution_flag true % 6.67/6.91 % --res_lit_sel kbo_max % 6.67/6.91 % --res_to_prop_solver none % 6.67/6.91 % --res_prop_simpl_new false % 6.67/6.91 % --res_prop_simpl_given false % 6.67/6.91 % --res_passive_queue_type priority_queues % 6.67/6.91 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 6.67/6.91 % --res_passive_queues_freq [15;5] % 6.67/6.91 % --res_forward_subs full % 6.67/6.91 % --res_backward_subs full % 6.67/6.91 % --res_forward_subs_resolution true % 6.67/6.91 % --res_backward_subs_resolution true % 6.67/6.91 % --res_orphan_elimination false % 6.67/6.91 % --res_time_limit 1000. % 6.67/6.91 % --res_out_proof true % 6.67/6.91 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_54ec5d.s % 6.67/6.91 % --modulo true % 6.67/6.91 % 6.67/6.91 % ------ Combination Options % 6.67/6.91 % 6.67/6.91 % --comb_res_mult 1000 % 6.67/6.91 % --comb_inst_mult 300 % 6.67/6.91 % ------ % 6.67/6.91 % 6.67/6.91 % 6.67/6.91 % 6.67/6.91 % ------ Proving... % 6.67/6.91 % warning: shown sat in sat incomplete mode % 6.67/6.91 % % 6.67/6.91 % 6.67/6.91 % 6.67/6.91 ------ Building Model...Done % 6.67/6.91 % 6.67/6.91 %------ The model is defined over ground terms (initial term algebra). % 6.67/6.91 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 6.67/6.91 %------ where \phi is a formula over the term algebra. % 6.67/6.91 %------ If we have equality in the problem then it is also defined as a predicate above, % 6.67/6.91 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 6.67/6.91 %------ See help for --sat_out_model for different model outputs. % 6.67/6.91 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 6.67/6.91 %------ where the first argument stands for the sort ($i in the unsorted case) % 6.67/6.91 % 6.67/6.91 % 6.67/6.91 % 6.67/6.91 % 6.67/6.91 %------ Positive definition of member % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 (! [X0,X1,X2] : % 6.67/6.91 ( member(X0,X1,X2) <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Negative definition of actual_world % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 (! [X0] : % 6.67/6.91 ( ~(actual_world(X0)) <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of table % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 (! [X0,X1] : % 6.67/6.91 ( table(X0,X1) <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of group % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 (! [X0,X1] : % 6.67/6.91 ( group(X0,X1) <=> % 6.67/6.91 ( % 6.67/6.91 ( % 6.67/6.91 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 ) % 6.67/6.91 ) % 6.67/6.91 % 6.67/6.91 ) % 6.67/6.91 ) % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of hamburger % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 (! [X0,X1] : % 6.67/6.91 ( hamburger(X0,X1) <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP0_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP0_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP1_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP1_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP2_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP2_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP3_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP3_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP4_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP4_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP5_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP5_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP6_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP6_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP7_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP7_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP8_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP8_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP9_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP9_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP10_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP10_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP11_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP11_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP12_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP12_iProver_split <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP13_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP13_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP14_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP14_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP15_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP15_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP16_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP16_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP17_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP17_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP18_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP18_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP19_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP19_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP20_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP20_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP21_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP21_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP22_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP22_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP23_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP23_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP24_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP24_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP25_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP25_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP26_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP26_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP27_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP27_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP28_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP28_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP29_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP29_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP30_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP30_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP31_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP31_iProver_split <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP32_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP32_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP33_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP33_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP34_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP34_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP35_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP35_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP36_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP36_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP37_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP37_iProver_split <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP38_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP38_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP39_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP39_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP40_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP40_iProver_split <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP41_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP41_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP42_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP42_iProver_split <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP43_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP43_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP44_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP44_iProver_split <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP45_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP45_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP46_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP46_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP47_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP47_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP48_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP48_iProver_split <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP49_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP49_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP50_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP50_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP51_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP51_iProver_split <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP52_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP52_iProver_split <=> % 6.67/6.91 $false % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP53_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP53_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 %------ Positive definition of sP54_iProver_split % 6.67/6.91 fof(lit_def,axiom, % 6.67/6.91 ( sP54_iProver_split <=> % 6.67/6.91 $true % 6.67/6.91 ) % 6.67/6.91 ). % 6.67/6.91 % 6.67/6.91 % 6.67/6.91 % 6.67/6.91 % ------ Statistics % 6.67/6.91 % 6.67/6.91 % ------ General % 6.67/6.91 % 6.67/6.91 % num_of_input_clauses: 576 % 6.67/6.91 % num_of_input_neg_conjectures: 576 % 6.67/6.91 % num_of_splits: 1848 % 6.67/6.91 % num_of_split_atoms: 55 % 6.67/6.91 % num_of_sem_filtered_clauses: 0 % 6.67/6.91 % num_of_subtypes: 0 % 6.67/6.91 % monotx_restored_types: 0 % 6.67/6.91 % sat_num_of_epr_types: 0 % 6.67/6.91 % sat_num_of_non_cyclic_types: 0 % 6.67/6.91 % sat_guarded_non_collapsed_types: 0 % 6.67/6.91 % is_epr: 0 % 6.67/6.91 % is_horn: 0 % 6.67/6.91 % has_eq: 0 % 6.67/6.91 % num_pure_diseq_elim: 0 % 6.67/6.91 % simp_replaced_by: 0 % 6.67/6.91 % res_preprocessed: 3000 % 6.67/6.91 % prep_upred: 0 % 6.67/6.91 % prep_unflattend: 0 % 6.67/6.91 % pred_elim_cands: 55 % 6.67/6.91 % pred_elim: 0 % 6.67/6.91 % pred_elim_cl: 0 % 6.67/6.91 % pred_elim_cycles: 55 % 6.67/6.91 % forced_gc_time: 0 % 6.67/6.91 % gc_basic_clause_elim: 0 % 6.67/6.91 % parsing_time: 0.084 % 6.67/6.91 % sem_filter_time: 0. % 6.67/6.91 % pred_elim_time: 0.709 % 6.67/6.91 % out_proof_time: 0. % 6.67/6.91 % monotx_time: 0. % 6.67/6.91 % subtype_inf_time: 0. % 6.67/6.91 % unif_index_cands_time: 0.002 % 6.67/6.91 % unif_index_add_time: 0.003 % 6.67/6.91 % total_time: 3.244 % 6.67/6.91 % num_of_symbols: 112 % 6.67/6.91 % num_of_terms: 2372 % 6.67/6.91 % 6.67/6.91 % ------ Propositional Solver % 6.67/6.91 % 6.67/6.91 % prop_solver_calls: 3 % 6.67/6.91 % prop_fast_solver_calls: 24781 % 6.67/6.91 % prop_num_of_clauses: 3558 % 6.67/6.91 % prop_preprocess_simplified: 18380 % 6.67/6.91 % prop_fo_subsumed: 0 % 6.67/6.91 % prop_solver_time: 0. % 6.67/6.91 % prop_fast_solver_time: 0.023 % 6.67/6.91 % prop_unsat_core_time: 0. % 6.67/6.91 % 6.67/6.91 % ------ QBF % 6.67/6.91 % 6.67/6.91 % qbf_q_res: 0 % 6.67/6.91 % qbf_num_tautologies: 0 % 6.67/6.91 % qbf_prep_cycles: 0 % 6.67/6.91 % 6.67/6.91 % ------ BMC1 % 6.67/6.91 % 6.67/6.91 % bmc1_current_bound: -1 % 6.67/6.91 % bmc1_last_solved_bound: -1 % 6.67/6.91 % bmc1_unsat_core_size: -1 % 6.67/6.91 % bmc1_unsat_core_parents_size: -1 % 6.67/6.91 % bmc1_merge_next_fun: 0 % 6.67/6.91 % bmc1_unsat_core_clauses_time: 0. % 6.67/6.91 % 6.67/6.91 % ------ Instantiation % 6.67/6.91 % 6.67/6.91 % inst_num_of_clauses: 633 % 6.67/6.91 % inst_num_in_passive: 0 % 6.67/6.91 % inst_num_in_active: 633 % 6.67/6.91 % inst_num_in_unprocessed: 0 % 6.67/6.91 % inst_num_of_loops: 672 % 6.67/6.91 % inst_num_of_learning_restarts: 0 % 6.67/6.91 % inst_num_moves_active_passive: 36 % 6.67/6.91 % inst_lit_activity: 52 % 6.67/6.91 % inst_lit_activity_moves: 0 % 6.67/6.91 % inst_num_tautologies: 0 % 6.67/6.91 % inst_num_prop_implied: 0 % 6.67/6.91 % inst_num_existing_simplified: 0 % 6.67/6.91 % inst_num_eq_res_simplified: 0 % 6.67/6.91 % inst_num_child_elim: 0 % 6.67/6.91 % inst_num_of_dismatching_blockings: 0 % 6.67/6.91 % inst_num_of_non_proper_insts: 22 % 6.67/6.91 % inst_num_of_duplicates: 0 % 6.67/6.91 % inst_inst_num_from_inst_to_res: 0 % 6.67/6.91 % inst_dismatching_checking_time: 0. % 6.67/6.91 % 6.67/6.91 % ------ Resolution % 6.67/6.91 % 6.67/6.91 % res_num_of_clauses: 5288 % 6.67/6.91 % res_num_in_passive: 3686 % 6.67/6.91 % res_num_in_active: 1752 % 6.67/6.91 % res_num_of_loops: 3000 % 6.67/6.91 % res_forward_subset_subsumed: 2520 % 6.67/6.91 % res_backward_subset_subsumed: 694 % 6.67/6.91 % res_forward_subsumed: 1214 % 6.67/6.91 % res_backward_subsumed: 13 % 6.67/6.91 % res_forward_subsumption_resolution: 1041 % 6.67/6.91 % res_backward_subsumption_resolution: 0 % 6.67/6.91 % res_clause_to_clause_subsumption: 7804 % 6.67/6.91 % res_orphan_elimination: 0 % 6.67/6.91 % res_tautology_del: 452 % 6.67/6.91 % res_num_eq_res_simplified: 0 % 6.67/6.91 % res_num_sel_changes: 0 % 6.67/6.91 % res_moves_from_active_to_pass: 0 % 6.67/6.91 % 6.67/6.91 % Status Unknown % 6.67/6.91 % Last status : % 6.67/6.91 % SZS status Unknown %------------------------------------------------------------------------------