%------------------------------------------------------------------------------ % File : iProverMo---2.5-0.1 % Problem : NLP060+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : iprover_modulo %s %d % Computer : n007.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:39:11 EDT 2022 % Result : Unknown 7.89s 8.10s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : NLP060+1 : TPTP v8.1.0. Released v2.4.0. % 0.03/0.12 % Command : iprover_modulo %s %d % 0.12/0.33 % Computer : n007.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Fri Jul 1 00:46:54 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % Running in mono-core mode % 0.20/0.45 % Orienting using strategy Equiv(ClausalAll) % 0.20/0.45 % FOF problem with conjecture % 0.20/0.45 % 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_921566.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_4f5902.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_04a4e5 | grep -v "SZS" % 0.20/0.48 % 0.20/0.48 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 0.20/0.48 % 0.20/0.48 % % 0.20/0.48 % ------ iProver source info % 0.20/0.48 % 0.20/0.48 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 0.20/0.48 % git: non_committed_changes: true % 0.20/0.48 % git: last_make_outside_of_git: true % 0.20/0.48 % 0.20/0.48 % % 0.20/0.48 % ------ Input Options % 0.20/0.48 % 0.20/0.48 % --out_options all % 0.20/0.48 % --tptp_safe_out true % 0.20/0.48 % --problem_path "" % 0.20/0.48 % --include_path "" % 0.20/0.48 % --clausifier .//eprover % 0.20/0.48 % --clausifier_options --tstp-format % 0.20/0.48 % --stdin false % 0.20/0.48 % --dbg_backtrace false % 0.20/0.48 % --dbg_dump_prop_clauses false % 0.20/0.48 % --dbg_dump_prop_clauses_file - % 0.20/0.48 % --dbg_out_stat false % 0.20/0.48 % 0.20/0.48 % ------ General Options % 0.20/0.48 % 0.20/0.48 % --fof false % 0.20/0.48 % --time_out_real 150. % 0.20/0.48 % --time_out_prep_mult 0.2 % 0.20/0.48 % --time_out_virtual -1. % 0.20/0.48 % --schedule none % 0.20/0.48 % --ground_splitting input % 0.20/0.48 % --splitting_nvd 16 % 0.20/0.48 % --non_eq_to_eq false % 0.20/0.48 % --prep_gs_sim true % 0.20/0.48 % --prep_unflatten false % 0.20/0.48 % --prep_res_sim true % 0.20/0.48 % --prep_upred true % 0.20/0.48 % --res_sim_input true % 0.20/0.48 % --clause_weak_htbl true % 0.20/0.48 % --gc_record_bc_elim false % 0.20/0.48 % --symbol_type_check false % 0.20/0.48 % --clausify_out false % 0.20/0.48 % --large_theory_mode false % 0.20/0.48 % --prep_sem_filter none % 0.20/0.48 % --prep_sem_filter_out false % 0.20/0.48 % --preprocessed_out false % 0.20/0.48 % --sub_typing false % 0.20/0.48 % --brand_transform false % 0.20/0.48 % --pure_diseq_elim true % 0.20/0.48 % --min_unsat_core false % 0.20/0.48 % --pred_elim true % 0.20/0.48 % --add_important_lit false % 0.20/0.48 % --soft_assumptions false % 0.20/0.48 % --reset_solvers false % 0.20/0.48 % --bc_imp_inh [] % 0.20/0.48 % --conj_cone_tolerance 1.5 % 0.20/0.48 % --prolific_symb_bound 500 % 0.20/0.48 % --lt_threshold 2000 % 0.20/0.48 % 0.20/0.48 % ------ SAT Options % 0.20/0.48 % 0.20/0.48 % --sat_mode false % 0.20/0.48 % --sat_fm_restart_options "" % 0.20/0.48 % --sat_gr_def false % 0.20/0.48 % --sat_epr_types true % 0.20/0.48 % --sat_non_cyclic_types false % 0.20/0.48 % --sat_finite_models false % 0.20/0.48 % --sat_fm_lemmas false % 0.20/0.48 % --sat_fm_prep false % 0.20/0.48 % --sat_fm_uc_incr true % 0.20/0.48 % --sat_out_model small % 0.20/0.48 % --sat_out_clauses false % 0.20/0.48 % 0.20/0.48 % ------ QBF Options % 0.20/0.48 % 0.20/0.48 % --qbf_mode false % 0.20/0.48 % --qbf_elim_univ true % 0.20/0.48 % --qbf_sk_in true % 0.20/0.48 % --qbf_pred_elim true % 0.20/0.48 % --qbf_split 32 % 0.20/0.48 % 0.20/0.48 % ------ BMC1 Options % 0.20/0.48 % 0.20/0.48 % --bmc1_incremental false % 0.20/0.48 % --bmc1_axioms reachable_all % 0.20/0.48 % --bmc1_min_bound 0 % 0.20/0.48 % --bmc1_max_bound -1 % 0.20/0.48 % --bmc1_max_bound_default -1 % 0.20/0.48 % --bmc1_symbol_reachability true % 0.20/0.48 % --bmc1_property_lemmas false % 0.20/0.48 % --bmc1_k_induction false % 0.20/0.48 % --bmc1_non_equiv_states false % 0.20/0.48 % --bmc1_deadlock false % 0.20/0.48 % --bmc1_ucm false % 0.20/0.48 % --bmc1_add_unsat_core none % 0.20/0.48 % --bmc1_unsat_core_children false % 0.20/0.48 % --bmc1_unsat_core_extrapolate_axioms false % 0.20/0.48 % --bmc1_out_stat full % 0.20/0.48 % --bmc1_ground_init false % 0.20/0.48 % --bmc1_pre_inst_next_state false % 0.20/0.48 % --bmc1_pre_inst_state false % 0.20/0.48 % --bmc1_pre_inst_reach_state false % 0.20/0.48 % --bmc1_out_unsat_core false % 0.20/0.48 % --bmc1_aig_witness_out false % 0.20/0.48 % --bmc1_verbose false % 0.20/0.48 % --bmc1_dump_clauses_tptp false % 0.88/1.05 % --bmc1_dump_unsat_core_tptp false % 0.88/1.05 % --bmc1_dump_file - % 0.88/1.05 % --bmc1_ucm_expand_uc_limit 128 % 0.88/1.05 % --bmc1_ucm_n_expand_iterations 6 % 0.88/1.05 % --bmc1_ucm_extend_mode 1 % 0.88/1.05 % --bmc1_ucm_init_mode 2 % 0.88/1.05 % --bmc1_ucm_cone_mode none % 0.88/1.05 % --bmc1_ucm_reduced_relation_type 0 % 0.88/1.05 % --bmc1_ucm_relax_model 4 % 0.88/1.05 % --bmc1_ucm_full_tr_after_sat true % 0.88/1.05 % --bmc1_ucm_expand_neg_assumptions false % 0.88/1.05 % --bmc1_ucm_layered_model none % 0.88/1.05 % --bmc1_ucm_max_lemma_size 10 % 0.88/1.05 % 0.88/1.05 % ------ AIG Options % 0.88/1.05 % 0.88/1.05 % --aig_mode false % 0.88/1.05 % 0.88/1.05 % ------ Instantiation Options % 0.88/1.05 % 0.88/1.05 % --instantiation_flag true % 0.88/1.05 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.88/1.05 % --inst_solver_per_active 750 % 0.88/1.05 % --inst_solver_calls_frac 0.5 % 0.88/1.05 % --inst_passive_queue_type priority_queues % 0.88/1.05 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.88/1.05 % --inst_passive_queues_freq [25;2] % 0.88/1.05 % --inst_dismatching true % 0.88/1.05 % --inst_eager_unprocessed_to_passive true % 0.88/1.05 % --inst_prop_sim_given true % 0.88/1.05 % --inst_prop_sim_new false % 0.88/1.05 % --inst_orphan_elimination true % 0.88/1.05 % --inst_learning_loop_flag true % 0.88/1.05 % --inst_learning_start 3000 % 0.88/1.05 % --inst_learning_factor 2 % 0.88/1.05 % --inst_start_prop_sim_after_learn 3 % 0.88/1.05 % --inst_sel_renew solver % 0.88/1.05 % --inst_lit_activity_flag true % 0.88/1.05 % --inst_out_proof true % 0.88/1.05 % 0.88/1.05 % ------ Resolution Options % 0.88/1.05 % 0.88/1.05 % --resolution_flag true % 0.88/1.05 % --res_lit_sel kbo_max % 0.88/1.05 % --res_to_prop_solver none % 0.88/1.05 % --res_prop_simpl_new false % 0.88/1.05 % --res_prop_simpl_given false % 0.88/1.05 % --res_passive_queue_type priority_queues % 0.88/1.05 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 0.88/1.05 % --res_passive_queues_freq [15;5] % 0.88/1.05 % --res_forward_subs full % 0.88/1.05 % --res_backward_subs full % 0.88/1.05 % --res_forward_subs_resolution true % 0.88/1.05 % --res_backward_subs_resolution true % 0.88/1.05 % --res_orphan_elimination false % 0.88/1.05 % --res_time_limit 1000. % 0.88/1.05 % --res_out_proof true % 0.88/1.05 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_921566.s % 0.88/1.05 % --modulo true % 0.88/1.05 % 0.88/1.05 % ------ Combination Options % 0.88/1.05 % 0.88/1.05 % --comb_res_mult 1000 % 0.88/1.05 % --comb_inst_mult 300 % 0.88/1.05 % ------ % 0.88/1.05 % 0.88/1.05 % ------ Parsing...% successful % 0.88/1.05 % 0.88/1.05 % ------ Preprocessing... gs_s sp: 1120 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e % % 0.88/1.05 % 0.88/1.05 % ------ Proving... % 0.88/1.05 % ------ Problem Properties % 0.88/1.05 % 0.88/1.05 % % 0.88/1.05 % EPR false % 0.88/1.05 % Horn false % 0.88/1.05 % Has equality false % 0.88/1.05 % 0.88/1.05 % % ------ Input Options Time Limit: Unbounded % 0.88/1.05 % 0.88/1.05 % 0.88/1.05 % % ------ Current options: % 0.88/1.05 % 0.88/1.05 % ------ Input Options % 0.88/1.05 % 0.88/1.05 % --out_options all % 0.88/1.05 % --tptp_safe_out true % 0.88/1.05 % --problem_path "" % 0.88/1.05 % --include_path "" % 0.88/1.05 % --clausifier .//eprover % 0.88/1.05 % --clausifier_options --tstp-format % 0.88/1.05 % --stdin false % 0.88/1.05 % --dbg_backtrace false % 0.88/1.05 % --dbg_dump_prop_clauses false % 0.88/1.05 % --dbg_dump_prop_clauses_file - % 0.88/1.05 % --dbg_out_stat false % 0.88/1.05 % 0.88/1.05 % ------ General Options % 0.88/1.05 % 0.88/1.05 % --fof false % 0.88/1.05 % --time_out_real 150. % 0.88/1.05 % --time_out_prep_mult 0.2 % 0.88/1.05 % --time_out_virtual -1. % 0.88/1.05 % --schedule none % 0.88/1.05 % --ground_splitting input % 0.88/1.05 % --splitting_nvd 16 % 0.88/1.05 % --non_eq_to_eq false % 0.88/1.05 % --prep_gs_sim true % 0.88/1.05 % --prep_unflatten false % 0.88/1.05 % --prep_res_sim true % 0.88/1.05 % --prep_upred true % 0.88/1.05 % --res_sim_input true % 0.88/1.05 % --clause_weak_htbl true % 0.88/1.05 % --gc_record_bc_elim false % 0.88/1.05 % --symbol_type_check false % 0.88/1.05 % --clausify_out false % 0.88/1.05 % --large_theory_mode false % 0.88/1.05 % --prep_sem_filter none % 0.88/1.05 % --prep_sem_filter_out false % 0.88/1.05 % --preprocessed_out false % 0.88/1.05 % --sub_typing false % 0.88/1.05 % --brand_transform false % 0.88/1.05 % --pure_diseq_elim true % 0.88/1.05 % --min_unsat_core false % 0.88/1.05 % --pred_elim true % 0.88/1.05 % --add_important_lit false % 0.88/1.05 % --soft_assumptions false % 0.88/1.05 % --reset_solvers false % 0.88/1.05 % --bc_imp_inh [] % 0.88/1.05 % --conj_cone_tolerance 1.5 % 0.88/1.05 % --prolific_symb_bound 500 % 0.88/1.05 % --lt_threshold 2000 % 0.88/1.05 % 0.88/1.05 % ------ SAT Options % 0.88/1.05 % 0.88/1.05 % --sat_mode false % 0.88/1.05 % --sat_fm_restart_options "" % 0.88/1.05 % --sat_gr_def false % 0.88/1.05 % --sat_epr_types true % 0.88/1.05 % --sat_non_cyclic_types false % 0.88/1.05 % --sat_finite_models false % 0.88/1.05 % --sat_fm_lemmas false % 0.88/1.05 % --sat_fm_prep false % 0.88/1.05 % --sat_fm_uc_incr true % 0.88/1.05 % --sat_out_model small % 0.88/1.05 % --sat_out_clauses false % 0.88/1.05 % 0.88/1.05 % ------ QBF Options % 0.88/1.05 % 0.88/1.05 % --qbf_mode false % 0.88/1.05 % --qbf_elim_univ true % 0.88/1.05 % --qbf_sk_in true % 0.88/1.05 % --qbf_pred_elim true % 0.88/1.05 % --qbf_split 32 % 0.88/1.05 % 0.88/1.05 % ------ BMC1 Options % 0.88/1.05 % 0.88/1.05 % --bmc1_incremental false % 0.88/1.05 % --bmc1_axioms reachable_all % 0.88/1.05 % --bmc1_min_bound 0 % 0.88/1.05 % --bmc1_max_bound -1 % 0.88/1.05 % --bmc1_max_bound_default -1 % 0.88/1.05 % --bmc1_symbol_reachability true % 0.88/1.05 % --bmc1_property_lemmas false % 0.88/1.05 % --bmc1_k_induction false % 0.88/1.05 % --bmc1_non_equiv_states false % 0.88/1.05 % --bmc1_deadlock false % 0.88/1.05 % --bmc1_ucm false % 0.88/1.05 % --bmc1_add_unsat_core none % 0.88/1.05 % --bmc1_unsat_core_children false % 0.88/1.05 % --bmc1_unsat_core_extrapolate_axioms false % 0.88/1.05 % --bmc1_out_stat full % 0.88/1.05 % --bmc1_ground_init false % 0.88/1.05 % --bmc1_pre_inst_next_state false % 0.88/1.05 % --bmc1_pre_inst_state false % 0.88/1.05 % --bmc1_pre_inst_reach_state false % 0.88/1.05 % --bmc1_out_unsat_core false % 0.88/1.05 % --bmc1_aig_witness_out false % 0.88/1.05 % --bmc1_verbose false % 0.88/1.05 % --bmc1_dump_clauses_tptp false % 0.88/1.05 % --bmc1_dump_unsat_core_tptp false % 0.88/1.05 % --bmc1_dump_file - % 0.88/1.05 % --bmc1_ucm_expand_uc_limit 128 % 0.88/1.05 % --bmc1_ucm_n_expand_iterations 6 % 0.88/1.05 % --bmc1_ucm_extend_mode 1 % 0.88/1.05 % --bmc1_ucm_init_mode 2 % 0.88/1.05 % --bmc1_ucm_cone_mode none % 0.88/1.05 % --bmc1_ucm_reduced_relation_type 0 % 0.88/1.05 % --bmc1_ucm_relax_model 4 % 0.88/1.05 % --bmc1_ucm_full_tr_after_sat true % 0.88/1.05 % --bmc1_ucm_expand_neg_assumptions false % 0.88/1.05 % --bmc1_ucm_layered_model none % 0.88/1.05 % --bmc1_ucm_max_lemma_size 10 % 0.88/1.05 % 0.88/1.05 % ------ AIG Options % 0.88/1.05 % 0.88/1.05 % --aig_mode false % 0.88/1.05 % 0.88/1.05 % ------ Instantiation Options % 0.88/1.05 % 0.88/1.05 % --instantiation_flag true % 0.88/1.05 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.88/1.05 % --inst_solver_per_active 750 % 0.88/1.05 % --inst_solver_calls_frac 0.5 % 0.88/1.05 % --inst_passive_queue_type priority_queues % 0.88/1.05 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.88/1.05 % --inst_passive_queues_freq [25;2] % 0.88/1.05 % --inst_dismatching true % 0.88/1.05 % --inst_eager_unprocessed_to_passive true % 0.88/1.05 % --inst_prop_sim_given true % 4.10/4.31 % --inst_prop_sim_new false % 4.10/4.31 % --inst_orphan_elimination true % 4.10/4.31 % --inst_learning_loop_flag true % 4.10/4.31 % --inst_learning_start 3000 % 4.10/4.31 % --inst_learning_factor 2 % 4.10/4.31 % --inst_start_prop_sim_after_learn 3 % 4.10/4.31 % --inst_sel_renew solver % 4.10/4.31 % --inst_lit_activity_flag true % 4.10/4.31 % --inst_out_proof true % 4.10/4.31 % 4.10/4.31 % ------ Resolution Options % 4.10/4.31 % 4.10/4.31 % --resolution_flag true % 4.10/4.31 % --res_lit_sel kbo_max % 4.10/4.31 % --res_to_prop_solver none % 4.10/4.31 % --res_prop_simpl_new false % 4.10/4.31 % --res_prop_simpl_given false % 4.10/4.31 % --res_passive_queue_type priority_queues % 4.10/4.31 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 4.10/4.31 % --res_passive_queues_freq [15;5] % 4.10/4.31 % --res_forward_subs full % 4.10/4.31 % --res_backward_subs full % 4.10/4.31 % --res_forward_subs_resolution true % 4.10/4.31 % --res_backward_subs_resolution true % 4.10/4.31 % --res_orphan_elimination false % 4.10/4.31 % --res_time_limit 1000. % 4.10/4.31 % --res_out_proof true % 4.10/4.31 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_921566.s % 4.10/4.31 % --modulo true % 4.10/4.31 % 4.10/4.31 % ------ Combination Options % 4.10/4.31 % 4.10/4.31 % --comb_res_mult 1000 % 4.10/4.31 % --comb_inst_mult 300 % 4.10/4.31 % ------ % 4.10/4.31 % 4.10/4.31 % 4.10/4.31 % 4.10/4.31 % ------ Proving... % 4.10/4.31 % warning: shown sat in sat incomplete mode % 4.10/4.31 % % 4.10/4.31 % 4.10/4.31 % 4.10/4.31 ------ Building Model...Done % 4.10/4.31 % 4.10/4.31 %------ The model is defined over ground terms (initial term algebra). % 4.10/4.31 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 4.10/4.31 %------ where \phi is a formula over the term algebra. % 4.10/4.31 %------ If we have equality in the problem then it is also defined as a predicate above, % 4.10/4.31 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 4.10/4.31 %------ See help for --sat_out_model for different model outputs. % 4.10/4.31 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 4.10/4.31 %------ where the first argument stands for the sort ($i in the unsorted case) % 4.10/4.31 % 4.10/4.31 % 4.10/4.31 % 4.10/4.31 % 4.10/4.31 %------ Positive definition of actual_world % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0] : % 4.10/4.31 ( actual_world(X0) <=> % 4.10/4.31 ( % 4.10/4.31 ( % 4.10/4.31 ( X0=sk3_esk1_0 ) % 4.10/4.31 ) % 4.10/4.31 % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of male % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1] : % 4.10/4.31 ( male(X0,X1) <=> % 4.10/4.31 ( % 4.10/4.31 ( % 4.10/4.31 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 ) % 4.10/4.31 ) % 4.10/4.31 % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of from_loc % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1,X2] : % 4.10/4.31 ( from_loc(X0,X1,X2) <=> % 4.10/4.31 ( % 4.10/4.31 ( % 4.10/4.31 ( X0=sk3_esk1_0 & X1=sk3_esk5_2(sk3_esk6_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0),sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) & X2=sk3_esk4_2(sk3_esk6_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0),sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) ) % 4.10/4.31 ) % 4.10/4.31 % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of fire % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1] : % 4.10/4.31 ( fire(X0,X1) <=> % 4.10/4.31 ( % 4.10/4.31 ( % 4.10/4.31 ( X0=sk3_esk1_0 & X1=sk3_esk5_2(sk3_esk6_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0),sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) ) % 4.10/4.31 ) % 4.10/4.31 % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Negative definition of nonreflexive % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1] : % 4.10/4.31 ( ~(nonreflexive(X0,X1)) <=> % 4.10/4.31 $false % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Negative definition of present % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1] : % 4.10/4.31 ( ~(present(X0,X1)) <=> % 4.10/4.31 $false % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of patient % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1,X2] : % 4.10/4.31 ( patient(X0,X1,X2) <=> % 4.10/4.31 ( % 4.10/4.31 ( % 4.10/4.31 ( X0=sk3_esk1_0 & X1=sk3_esk5_2(sk3_esk6_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0),sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) & X2=sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) ) % 4.10/4.31 ) % 4.10/4.31 % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Negative definition of agent % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1,X2] : % 4.10/4.31 ( ~(agent(X0,X1,X2)) <=> % 4.10/4.31 $false % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Negative definition of event % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1] : % 4.10/4.31 ( ~(event(X0,X1)) <=> % 4.10/4.31 $false % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of six % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1] : % 4.10/4.31 ( six(X0,X1) <=> % 4.10/4.31 ( % 4.10/4.31 ( % 4.10/4.31 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 ) % 4.10/4.31 ) % 4.10/4.31 % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Negative definition of group % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1] : % 4.10/4.31 ( ~(group(X0,X1)) <=> % 4.10/4.31 $false % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of shot % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1] : % 4.10/4.31 ( shot(X0,X1) <=> % 4.10/4.31 ( % 4.10/4.31 ( % 4.10/4.31 ( X0=sk3_esk1_0 & X1=sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) ) % 4.10/4.31 ) % 4.10/4.31 % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Negative definition of cannon % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1] : % 4.10/4.31 ( ~(cannon(X0,X1)) <=> % 4.10/4.31 ( % 4.10/4.31 ( % 4.10/4.31 ( X0=sk3_esk10_0 ) % 4.10/4.31 ) % 4.10/4.31 % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Negative definition of of % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1,X2] : % 4.10/4.31 ( ~(of(X0,X1,X2)) <=> % 4.10/4.31 $false % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of member % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1,X2] : % 4.10/4.31 ( member(X0,X1,X2) <=> % 4.10/4.31 ( % 4.10/4.31 ( % 4.10/4.31 ( X0=sk3_esk1_0 & X1=sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) & X2=sk3_esk3_0 ) % 4.10/4.31 ) % 4.10/4.31 % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of man % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 (! [X0,X1] : % 4.10/4.31 ( man(X0,X1) <=> % 4.10/4.31 ( % 4.10/4.31 ( % 4.10/4.31 ( X0=sk3_esk1_0 & X1=sk3_esk6_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) ) % 4.10/4.31 ) % 4.10/4.31 % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP0_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP0_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP1_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP1_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP2_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP2_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP3_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP3_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP4_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP4_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP5_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP5_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP6_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP6_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP7_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP7_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP8_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP8_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP9_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP9_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP10_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP10_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP11_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP11_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP12_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP12_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP13_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP13_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP14_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP14_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP15_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP15_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP16_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP16_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP17_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP17_iProver_split <=> % 4.10/4.31 $false % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP18_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP18_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP19_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP19_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP20_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP20_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP21_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP21_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP22_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP22_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP23_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP23_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP24_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP24_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP25_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP25_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP26_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP26_iProver_split <=> % 4.10/4.31 $false % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP27_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP27_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP28_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP28_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP29_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP29_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP30_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP30_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP31_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP31_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP32_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP32_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 %------ Positive definition of sP33_iProver_split % 4.10/4.31 fof(lit_def,axiom, % 4.10/4.31 ( sP33_iProver_split <=> % 4.10/4.31 $true % 4.10/4.31 ) % 4.10/4.31 ). % 4.10/4.31 % 4.10/4.31 % 4.10/4.31 % 4.10/4.31 % ------ Statistics % 4.10/4.31 % 4.10/4.31 % ------ General % 4.10/4.31 % 4.10/4.31 % num_of_input_clauses: 432 % 4.10/4.31 % num_of_input_neg_conjectures: 432 % 4.10/4.31 % num_of_splits: 1120 % 4.10/4.31 % num_of_split_atoms: 34 % 4.10/4.31 % num_of_sem_filtered_clauses: 0 % 4.10/4.31 % num_of_subtypes: 0 % 4.10/4.31 % monotx_restored_types: 0 % 4.10/4.31 % sat_num_of_epr_types: 0 % 4.10/4.31 % sat_num_of_non_cyclic_types: 0 % 4.10/4.31 % sat_guarded_non_collapsed_types: 0 % 4.10/4.31 % is_epr: 0 % 4.10/4.31 % is_horn: 0 % 4.10/4.31 % has_eq: 0 % 4.10/4.31 % num_pure_diseq_elim: 0 % 4.10/4.31 % simp_replaced_by: 0 % 4.10/4.31 % res_preprocessed: 1984 % 4.10/4.31 % prep_upred: 0 % 4.10/4.31 % prep_unflattend: 0 % 4.10/4.31 % pred_elim_cands: 34 % 4.10/4.31 % pred_elim: 0 % 4.10/4.31 % pred_elim_cl: 0 % 4.10/4.31 % pred_elim_cycles: 34 % 4.10/4.31 % forced_gc_time: 0 % 4.10/4.31 % gc_basic_clause_elim: 0 % 4.10/4.31 % parsing_time: 0.049 % 4.10/4.31 % sem_filter_time: 0. % 4.10/4.31 % pred_elim_time: 0.401 % 4.10/4.31 % out_proof_time: 0. % 4.10/4.31 % monotx_time: 0. % 4.10/4.31 % subtype_inf_time: 0. % 4.10/4.31 % unif_index_cands_time: 0.002 % 4.10/4.31 % unif_index_add_time: 0.002 % 4.10/4.31 % total_time: 3.847 % 4.10/4.31 % num_of_symbols: 91 % 4.10/4.31 % num_of_terms: 1591 % 4.10/4.31 % 4.10/4.31 % ------ Propositional Solver % 4.10/4.31 % 4.10/4.31 % prop_solver_calls: 6 % 4.10/4.31 % prop_fast_solver_calls: 15950 % 4.10/4.31 % prop_num_of_clauses: 2798 % 4.10/4.31 % prop_preprocess_simplified: 13174 % 4.10/4.31 % prop_fo_subsumed: 0 % 4.10/4.31 % prop_solver_time: 0. % 4.10/4.31 % prop_fast_solver_time: 0.013 % 4.10/4.31 % prop_unsat_core_time: 0. % 4.10/4.31 % 4.10/4.31 % ------ QBF % 4.10/4.31 % 4.10/4.31 % qbf_q_res: 0 % 4.10/4.31 % qbf_num_tautologies: 0 % 4.10/4.31 % qbf_prep_cycles: 0 % 4.10/4.31 % 4.10/4.31 % ------ BMC1 % 4.10/4.31 % 4.10/4.31 % bmc1_current_bound: -1 % 4.10/4.31 % bmc1_last_solved_bound: -1 % 4.10/4.31 % bmc1_unsat_core_size: -1 % 4.10/4.31 % bmc1_unsat_core_parents_size: -1 % 4.10/4.31 % bmc1_merge_next_fun: 0 % 4.10/4.31 % bmc1_unsat_core_clauses_time: 0. % 4.10/4.31 % 4.10/4.31 % ------ Instantiation % 4.10/4.31 % 4.10/4.31 % inst_num_of_clauses: 787 % 4.10/4.31 % inst_num_in_passive: 0 % 4.10/4.31 % inst_num_in_active: 787 % 4.10/4.31 % inst_num_in_unprocessed: 0 % 4.10/4.31 % inst_num_of_loops: 869 % 4.10/4.31 % inst_num_of_learning_restarts: 0 % 4.10/4.31 % inst_num_moves_active_passive: 73 % 4.10/4.31 % inst_lit_activity: 101 % 4.10/4.31 % inst_lit_activity_moves: 0 % 4.10/4.31 % inst_num_tautologies: 0 % 4.10/4.31 % inst_num_prop_implied: 0 % 4.10/4.31 % inst_num_existing_simplified: 0 % 4.10/4.31 % inst_num_eq_res_simplified: 0 % 4.10/4.31 % inst_num_child_elim: 0 % 4.10/4.31 % inst_num_of_dismatching_blockings: 0 % 4.10/4.31 % inst_num_of_non_proper_insts: 279 % 4.10/4.31 % inst_num_of_duplicates: 5 % 4.10/4.31 % inst_inst_num_from_inst_to_res: 0 % 4.10/4.31 % inst_dismatching_checking_time: 0. % 4.10/4.31 % 4.10/4.31 % ------ Resolution % 4.10/4.31 % 4.10/4.31 % res_num_of_clauses: 2196 % 4.10/4.31 % res_num_in_passive: 704 % 4.10/4.31 % res_num_in_active: 1416 % 4.10/4.31 % res_num_of_loops: 3000 % 4.10/4.31 % res_forward_subset_subsumed: 964 % 4.10/4.31 % res_backward_subset_subsumed: 121 % 4.10/4.31 % res_forward_subsumed: 1260 % 4.10/4.31 % res_backward_subsumed: 166 % 4.10/4.31 % res_forward_subsumption_resolution: 2023 % 4.10/4.31 % res_backward_subsumption_resolution: 0 % 4.10/4.31 % res_clause_to_clause_subsumption: 11444 % 4.10/4.31 % res_orphan_elimination: 0 % 4.10/4.31 % res_tautology_del: 2091 % 4.10/4.31 % res_num_eq_res_simplified: 0 % 4.10/4.31 % res_num_sel_changes: 0 % 4.10/4.31 % res_moves_from_active_to_pass: 0 % 4.10/4.31 % 4.10/4.31 % Status Unknown % 4.16/4.41 % Orienting using strategy ClausalAll % 4.16/4.41 % FOF problem with conjecture % 4.16/4.41 % 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_921566.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_4f5902.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_656255 | grep -v "SZS" % 4.16/4.42 % 4.16/4.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 4.16/4.42 % 4.16/4.42 % % 4.16/4.42 % ------ iProver source info % 4.16/4.42 % 4.16/4.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 4.16/4.42 % git: non_committed_changes: true % 4.16/4.42 % git: last_make_outside_of_git: true % 4.16/4.42 % 4.16/4.42 % % 4.16/4.42 % ------ Input Options % 4.16/4.42 % 4.16/4.42 % --out_options all % 4.16/4.42 % --tptp_safe_out true % 4.16/4.42 % --problem_path "" % 4.16/4.42 % --include_path "" % 4.16/4.42 % --clausifier .//eprover % 4.16/4.42 % --clausifier_options --tstp-format % 4.16/4.42 % --stdin false % 4.16/4.42 % --dbg_backtrace false % 4.16/4.42 % --dbg_dump_prop_clauses false % 4.16/4.42 % --dbg_dump_prop_clauses_file - % 4.16/4.42 % --dbg_out_stat false % 4.16/4.42 % 4.16/4.42 % ------ General Options % 4.16/4.42 % 4.16/4.42 % --fof false % 4.16/4.42 % --time_out_real 150. % 4.16/4.42 % --time_out_prep_mult 0.2 % 4.16/4.42 % --time_out_virtual -1. % 4.16/4.42 % --schedule none % 4.16/4.42 % --ground_splitting input % 4.16/4.42 % --splitting_nvd 16 % 4.16/4.42 % --non_eq_to_eq false % 4.16/4.42 % --prep_gs_sim true % 4.16/4.42 % --prep_unflatten false % 4.16/4.42 % --prep_res_sim true % 4.16/4.42 % --prep_upred true % 4.16/4.42 % --res_sim_input true % 4.16/4.42 % --clause_weak_htbl true % 4.16/4.42 % --gc_record_bc_elim false % 4.16/4.42 % --symbol_type_check false % 4.16/4.42 % --clausify_out false % 4.16/4.42 % --large_theory_mode false % 4.16/4.42 % --prep_sem_filter none % 4.16/4.42 % --prep_sem_filter_out false % 4.16/4.42 % --preprocessed_out false % 4.16/4.42 % --sub_typing false % 4.16/4.42 % --brand_transform false % 4.16/4.42 % --pure_diseq_elim true % 4.16/4.42 % --min_unsat_core false % 4.16/4.42 % --pred_elim true % 4.16/4.42 % --add_important_lit false % 4.16/4.42 % --soft_assumptions false % 4.16/4.42 % --reset_solvers false % 4.16/4.42 % --bc_imp_inh [] % 4.16/4.42 % --conj_cone_tolerance 1.5 % 4.16/4.42 % --prolific_symb_bound 500 % 4.16/4.42 % --lt_threshold 2000 % 4.16/4.42 % 4.16/4.42 % ------ SAT Options % 4.16/4.42 % 4.16/4.42 % --sat_mode false % 4.16/4.42 % --sat_fm_restart_options "" % 4.16/4.42 % --sat_gr_def false % 4.16/4.42 % --sat_epr_types true % 4.16/4.42 % --sat_non_cyclic_types false % 4.16/4.42 % --sat_finite_models false % 4.16/4.42 % --sat_fm_lemmas false % 4.16/4.42 % --sat_fm_prep false % 4.16/4.42 % --sat_fm_uc_incr true % 4.16/4.42 % --sat_out_model small % 4.16/4.42 % --sat_out_clauses false % 4.16/4.42 % 4.16/4.42 % ------ QBF Options % 4.16/4.42 % 4.16/4.42 % --qbf_mode false % 4.16/4.42 % --qbf_elim_univ true % 4.16/4.42 % --qbf_sk_in true % 4.16/4.42 % --qbf_pred_elim true % 4.16/4.42 % --qbf_split 32 % 4.16/4.42 % 4.16/4.42 % ------ BMC1 Options % 4.16/4.42 % 4.16/4.42 % --bmc1_incremental false % 4.16/4.42 % --bmc1_axioms reachable_all % 4.16/4.42 % --bmc1_min_bound 0 % 4.16/4.42 % --bmc1_max_bound -1 % 4.16/4.42 % --bmc1_max_bound_default -1 % 4.16/4.42 % --bmc1_symbol_reachability true % 4.16/4.42 % --bmc1_property_lemmas false % 4.16/4.42 % --bmc1_k_induction false % 4.16/4.42 % --bmc1_non_equiv_states false % 4.16/4.42 % --bmc1_deadlock false % 4.16/4.42 % --bmc1_ucm false % 4.16/4.42 % --bmc1_add_unsat_core none % 4.16/4.42 % --bmc1_unsat_core_children false % 4.16/4.42 % --bmc1_unsat_core_extrapolate_axioms false % 4.16/4.42 % --bmc1_out_stat full % 4.16/4.42 % --bmc1_ground_init false % 4.16/4.42 % --bmc1_pre_inst_next_state false % 4.16/4.42 % --bmc1_pre_inst_state false % 4.16/4.42 % --bmc1_pre_inst_reach_state false % 4.16/4.42 % --bmc1_out_unsat_core false % 4.16/4.42 % --bmc1_aig_witness_out false % 4.16/4.42 % --bmc1_verbose false % 4.16/4.42 % --bmc1_dump_clauses_tptp false % 4.69/4.85 % --bmc1_dump_unsat_core_tptp false % 4.69/4.85 % --bmc1_dump_file - % 4.69/4.85 % --bmc1_ucm_expand_uc_limit 128 % 4.69/4.85 % --bmc1_ucm_n_expand_iterations 6 % 4.69/4.85 % --bmc1_ucm_extend_mode 1 % 4.69/4.85 % --bmc1_ucm_init_mode 2 % 4.69/4.85 % --bmc1_ucm_cone_mode none % 4.69/4.85 % --bmc1_ucm_reduced_relation_type 0 % 4.69/4.85 % --bmc1_ucm_relax_model 4 % 4.69/4.85 % --bmc1_ucm_full_tr_after_sat true % 4.69/4.85 % --bmc1_ucm_expand_neg_assumptions false % 4.69/4.85 % --bmc1_ucm_layered_model none % 4.69/4.85 % --bmc1_ucm_max_lemma_size 10 % 4.69/4.85 % 4.69/4.85 % ------ AIG Options % 4.69/4.85 % 4.69/4.85 % --aig_mode false % 4.69/4.85 % 4.69/4.85 % ------ Instantiation Options % 4.69/4.85 % 4.69/4.85 % --instantiation_flag true % 4.69/4.85 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 4.69/4.85 % --inst_solver_per_active 750 % 4.69/4.85 % --inst_solver_calls_frac 0.5 % 4.69/4.85 % --inst_passive_queue_type priority_queues % 4.69/4.85 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 4.69/4.85 % --inst_passive_queues_freq [25;2] % 4.69/4.85 % --inst_dismatching true % 4.69/4.85 % --inst_eager_unprocessed_to_passive true % 4.69/4.85 % --inst_prop_sim_given true % 4.69/4.85 % --inst_prop_sim_new false % 4.69/4.85 % --inst_orphan_elimination true % 4.69/4.85 % --inst_learning_loop_flag true % 4.69/4.85 % --inst_learning_start 3000 % 4.69/4.85 % --inst_learning_factor 2 % 4.69/4.85 % --inst_start_prop_sim_after_learn 3 % 4.69/4.85 % --inst_sel_renew solver % 4.69/4.85 % --inst_lit_activity_flag true % 4.69/4.85 % --inst_out_proof true % 4.69/4.85 % 4.69/4.85 % ------ Resolution Options % 4.69/4.85 % 4.69/4.85 % --resolution_flag true % 4.69/4.85 % --res_lit_sel kbo_max % 4.69/4.85 % --res_to_prop_solver none % 4.69/4.85 % --res_prop_simpl_new false % 4.69/4.85 % --res_prop_simpl_given false % 4.69/4.85 % --res_passive_queue_type priority_queues % 4.69/4.85 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 4.69/4.85 % --res_passive_queues_freq [15;5] % 4.69/4.85 % --res_forward_subs full % 4.69/4.85 % --res_backward_subs full % 4.69/4.85 % --res_forward_subs_resolution true % 4.69/4.85 % --res_backward_subs_resolution true % 4.69/4.85 % --res_orphan_elimination false % 4.69/4.85 % --res_time_limit 1000. % 4.69/4.85 % --res_out_proof true % 4.69/4.85 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_921566.s % 4.69/4.85 % --modulo true % 4.69/4.85 % 4.69/4.85 % ------ Combination Options % 4.69/4.85 % 4.69/4.85 % --comb_res_mult 1000 % 4.69/4.85 % --comb_inst_mult 300 % 4.69/4.85 % ------ % 4.69/4.85 % 4.69/4.85 % ------ Parsing...% successful % 4.69/4.85 % 4.69/4.85 % ------ Preprocessing... gs_s sp: 1120 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e % % 4.69/4.85 % 4.69/4.85 % ------ Proving... % 4.69/4.85 % ------ Problem Properties % 4.69/4.85 % 4.69/4.85 % % 4.69/4.85 % EPR false % 4.69/4.85 % Horn false % 4.69/4.85 % Has equality false % 4.69/4.85 % 4.69/4.85 % % ------ Input Options Time Limit: Unbounded % 4.69/4.85 % 4.69/4.85 % 4.69/4.85 % % ------ Current options: % 4.69/4.85 % 4.69/4.85 % ------ Input Options % 4.69/4.85 % 4.69/4.85 % --out_options all % 4.69/4.85 % --tptp_safe_out true % 4.69/4.85 % --problem_path "" % 4.69/4.85 % --include_path "" % 4.69/4.85 % --clausifier .//eprover % 4.69/4.85 % --clausifier_options --tstp-format % 4.69/4.85 % --stdin false % 4.69/4.85 % --dbg_backtrace false % 4.69/4.85 % --dbg_dump_prop_clauses false % 4.69/4.85 % --dbg_dump_prop_clauses_file - % 4.69/4.85 % --dbg_out_stat false % 4.69/4.85 % 4.69/4.85 % ------ General Options % 4.69/4.85 % 4.69/4.85 % --fof false % 4.69/4.85 % --time_out_real 150. % 4.69/4.85 % --time_out_prep_mult 0.2 % 4.69/4.85 % --time_out_virtual -1. % 4.69/4.85 % --schedule none % 4.69/4.85 % --ground_splitting input % 4.69/4.85 % --splitting_nvd 16 % 4.69/4.85 % --non_eq_to_eq false % 4.69/4.85 % --prep_gs_sim true % 4.69/4.85 % --prep_unflatten false % 4.69/4.85 % --prep_res_sim true % 4.69/4.85 % --prep_upred true % 4.69/4.85 % --res_sim_input true % 4.69/4.85 % --clause_weak_htbl true % 4.69/4.85 % --gc_record_bc_elim false % 4.69/4.85 % --symbol_type_check false % 4.69/4.85 % --clausify_out false % 4.69/4.85 % --large_theory_mode false % 4.69/4.85 % --prep_sem_filter none % 4.69/4.85 % --prep_sem_filter_out false % 4.69/4.85 % --preprocessed_out false % 4.69/4.85 % --sub_typing false % 4.69/4.85 % --brand_transform false % 4.69/4.85 % --pure_diseq_elim true % 4.69/4.85 % --min_unsat_core false % 4.69/4.85 % --pred_elim true % 4.69/4.85 % --add_important_lit false % 4.69/4.85 % --soft_assumptions false % 4.69/4.85 % --reset_solvers false % 4.69/4.85 % --bc_imp_inh [] % 4.69/4.85 % --conj_cone_tolerance 1.5 % 4.69/4.85 % --prolific_symb_bound 500 % 4.69/4.85 % --lt_threshold 2000 % 4.69/4.85 % 4.69/4.85 % ------ SAT Options % 4.69/4.85 % 4.69/4.85 % --sat_mode false % 4.69/4.85 % --sat_fm_restart_options "" % 4.69/4.85 % --sat_gr_def false % 4.69/4.85 % --sat_epr_types true % 4.69/4.85 % --sat_non_cyclic_types false % 4.69/4.85 % --sat_finite_models false % 4.69/4.85 % --sat_fm_lemmas false % 4.69/4.85 % --sat_fm_prep false % 4.69/4.85 % --sat_fm_uc_incr true % 4.69/4.85 % --sat_out_model small % 4.69/4.85 % --sat_out_clauses false % 4.69/4.85 % 4.69/4.85 % ------ QBF Options % 4.69/4.85 % 4.69/4.85 % --qbf_mode false % 4.69/4.85 % --qbf_elim_univ true % 4.69/4.85 % --qbf_sk_in true % 4.69/4.85 % --qbf_pred_elim true % 4.69/4.85 % --qbf_split 32 % 4.69/4.85 % 4.69/4.85 % ------ BMC1 Options % 4.69/4.85 % 4.69/4.85 % --bmc1_incremental false % 4.69/4.85 % --bmc1_axioms reachable_all % 4.69/4.85 % --bmc1_min_bound 0 % 4.69/4.85 % --bmc1_max_bound -1 % 4.69/4.85 % --bmc1_max_bound_default -1 % 4.69/4.85 % --bmc1_symbol_reachability true % 4.69/4.85 % --bmc1_property_lemmas false % 4.69/4.85 % --bmc1_k_induction false % 4.69/4.85 % --bmc1_non_equiv_states false % 4.69/4.85 % --bmc1_deadlock false % 4.69/4.85 % --bmc1_ucm false % 4.69/4.85 % --bmc1_add_unsat_core none % 4.69/4.85 % --bmc1_unsat_core_children false % 4.69/4.85 % --bmc1_unsat_core_extrapolate_axioms false % 4.69/4.85 % --bmc1_out_stat full % 4.69/4.85 % --bmc1_ground_init false % 4.69/4.85 % --bmc1_pre_inst_next_state false % 4.69/4.85 % --bmc1_pre_inst_state false % 4.69/4.85 % --bmc1_pre_inst_reach_state false % 4.69/4.85 % --bmc1_out_unsat_core false % 4.69/4.85 % --bmc1_aig_witness_out false % 4.69/4.85 % --bmc1_verbose false % 4.69/4.85 % --bmc1_dump_clauses_tptp false % 4.69/4.85 % --bmc1_dump_unsat_core_tptp false % 4.69/4.85 % --bmc1_dump_file - % 4.69/4.85 % --bmc1_ucm_expand_uc_limit 128 % 4.69/4.85 % --bmc1_ucm_n_expand_iterations 6 % 4.69/4.85 % --bmc1_ucm_extend_mode 1 % 4.69/4.85 % --bmc1_ucm_init_mode 2 % 4.69/4.85 % --bmc1_ucm_cone_mode none % 4.69/4.85 % --bmc1_ucm_reduced_relation_type 0 % 4.69/4.85 % --bmc1_ucm_relax_model 4 % 4.69/4.85 % --bmc1_ucm_full_tr_after_sat true % 4.69/4.85 % --bmc1_ucm_expand_neg_assumptions false % 4.69/4.85 % --bmc1_ucm_layered_model none % 4.69/4.85 % --bmc1_ucm_max_lemma_size 10 % 4.69/4.85 % 4.69/4.85 % ------ AIG Options % 4.69/4.85 % 4.69/4.85 % --aig_mode false % 4.69/4.85 % 4.69/4.85 % ------ Instantiation Options % 4.69/4.85 % 4.69/4.85 % --instantiation_flag true % 4.69/4.85 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 4.69/4.85 % --inst_solver_per_active 750 % 4.69/4.85 % --inst_solver_calls_frac 0.5 % 4.69/4.85 % --inst_passive_queue_type priority_queues % 4.69/4.85 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 4.69/4.85 % --inst_passive_queues_freq [25;2] % 4.69/4.85 % --inst_dismatching true % 4.69/4.85 % --inst_eager_unprocessed_to_passive true % 4.69/4.85 % --inst_prop_sim_given true % 7.89/8.09 % --inst_prop_sim_new false % 7.89/8.09 % --inst_orphan_elimination true % 7.89/8.09 % --inst_learning_loop_flag true % 7.89/8.09 % --inst_learning_start 3000 % 7.89/8.09 % --inst_learning_factor 2 % 7.89/8.09 % --inst_start_prop_sim_after_learn 3 % 7.89/8.09 % --inst_sel_renew solver % 7.89/8.09 % --inst_lit_activity_flag true % 7.89/8.09 % --inst_out_proof true % 7.89/8.09 % 7.89/8.09 % ------ Resolution Options % 7.89/8.09 % 7.89/8.09 % --resolution_flag true % 7.89/8.09 % --res_lit_sel kbo_max % 7.89/8.09 % --res_to_prop_solver none % 7.89/8.09 % --res_prop_simpl_new false % 7.89/8.09 % --res_prop_simpl_given false % 7.89/8.09 % --res_passive_queue_type priority_queues % 7.89/8.09 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 7.89/8.09 % --res_passive_queues_freq [15;5] % 7.89/8.09 % --res_forward_subs full % 7.89/8.09 % --res_backward_subs full % 7.89/8.09 % --res_forward_subs_resolution true % 7.89/8.09 % --res_backward_subs_resolution true % 7.89/8.09 % --res_orphan_elimination false % 7.89/8.09 % --res_time_limit 1000. % 7.89/8.09 % --res_out_proof true % 7.89/8.09 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_921566.s % 7.89/8.09 % --modulo true % 7.89/8.09 % 7.89/8.09 % ------ Combination Options % 7.89/8.09 % 7.89/8.09 % --comb_res_mult 1000 % 7.89/8.09 % --comb_inst_mult 300 % 7.89/8.09 % ------ % 7.89/8.09 % 7.89/8.09 % 7.89/8.09 % 7.89/8.09 % ------ Proving... % 7.89/8.09 % warning: shown sat in sat incomplete mode % 7.89/8.09 % % 7.89/8.09 % 7.89/8.09 % 7.89/8.09 ------ Building Model...Done % 7.89/8.09 % 7.89/8.09 %------ The model is defined over ground terms (initial term algebra). % 7.89/8.09 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 7.89/8.09 %------ where \phi is a formula over the term algebra. % 7.89/8.09 %------ If we have equality in the problem then it is also defined as a predicate above, % 7.89/8.09 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 7.89/8.09 %------ See help for --sat_out_model for different model outputs. % 7.89/8.10 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 7.89/8.10 %------ where the first argument stands for the sort ($i in the unsorted case) % 7.89/8.10 % 7.89/8.10 % 7.89/8.10 % 7.89/8.10 % 7.89/8.10 %------ Positive definition of actual_world % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0] : % 7.89/8.10 ( actual_world(X0) <=> % 7.89/8.10 ( % 7.89/8.10 ( % 7.89/8.10 ( X0=sk2_esk1_0 ) % 7.89/8.10 ) % 7.89/8.10 % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of male % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1] : % 7.89/8.10 ( male(X0,X1) <=> % 7.89/8.10 ( % 7.89/8.10 ( % 7.89/8.10 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 ) % 7.89/8.10 ) % 7.89/8.10 % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of from_loc % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1,X2] : % 7.89/8.10 ( from_loc(X0,X1,X2) <=> % 7.89/8.10 ( % 7.89/8.10 ( % 7.89/8.10 ( X0=sk2_esk1_0 & X1=sk2_esk5_2(sk2_esk6_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) & X2=sk2_esk4_2(sk2_esk6_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) ) % 7.89/8.10 ) % 7.89/8.10 % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of fire % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1] : % 7.89/8.10 ( fire(X0,X1) <=> % 7.89/8.10 ( % 7.89/8.10 ( % 7.89/8.10 ( X0=sk2_esk1_0 & X1=sk2_esk5_2(sk2_esk6_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) ) % 7.89/8.10 ) % 7.89/8.10 % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Negative definition of nonreflexive % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1] : % 7.89/8.10 ( ~(nonreflexive(X0,X1)) <=> % 7.89/8.10 $false % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Negative definition of present % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1] : % 7.89/8.10 ( ~(present(X0,X1)) <=> % 7.89/8.10 $false % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of patient % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1,X2] : % 7.89/8.10 ( patient(X0,X1,X2) <=> % 7.89/8.10 ( % 7.89/8.10 ( % 7.89/8.10 ( X0=sk2_esk1_0 & X1=sk2_esk5_2(sk2_esk6_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0),sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) & X2=sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0) ) % 7.89/8.10 ) % 7.89/8.10 % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Negative definition of agent % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1,X2] : % 7.89/8.10 ( ~(agent(X0,X1,X2)) <=> % 7.89/8.10 $false % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Negative definition of event % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1] : % 7.89/8.10 ( ~(event(X0,X1)) <=> % 7.89/8.10 $false % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of six % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1] : % 7.89/8.10 ( six(X0,X1) <=> % 7.89/8.10 ( % 7.89/8.10 ( % 7.89/8.10 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 ) % 7.89/8.10 ) % 7.89/8.10 % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Negative definition of group % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1] : % 7.89/8.10 ( ~(group(X0,X1)) <=> % 7.89/8.10 $false % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of shot % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1] : % 7.89/8.10 ( shot(X0,X1) <=> % 7.89/8.10 ( % 7.89/8.10 ( % 7.89/8.10 ( X0=sk2_esk1_0 & X1=sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0) ) % 7.89/8.10 ) % 7.89/8.10 % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Negative definition of cannon % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1] : % 7.89/8.10 ( ~(cannon(X0,X1)) <=> % 7.89/8.10 ( % 7.89/8.10 ( % 7.89/8.10 ( X0=sk2_esk10_0 ) % 7.89/8.10 ) % 7.89/8.10 % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Negative definition of of % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1,X2] : % 7.89/8.10 ( ~(of(X0,X1,X2)) <=> % 7.89/8.10 $false % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of member % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1,X2] : % 7.89/8.10 ( member(X0,X1,X2) <=> % 7.89/8.10 ( % 7.89/8.10 ( % 7.89/8.10 ( X0=sk2_esk1_0 & X1=sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0) & X2=sk2_esk3_0 ) % 7.89/8.10 ) % 7.89/8.10 % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of man % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 (! [X0,X1] : % 7.89/8.10 ( man(X0,X1) <=> % 7.89/8.10 ( % 7.89/8.10 ( % 7.89/8.10 ( X0=sk2_esk1_0 & X1=sk2_esk6_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0) ) % 7.89/8.10 ) % 7.89/8.10 % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP0_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP0_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP1_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP1_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP2_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP2_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP3_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP3_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP4_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP4_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP5_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP5_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP6_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP6_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP7_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP7_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP8_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP8_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP9_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP9_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP10_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP10_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP11_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP11_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP12_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP12_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP13_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP13_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP14_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP14_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP15_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP15_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP16_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP16_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP17_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP17_iProver_split <=> % 7.89/8.10 $false % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP18_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP18_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP19_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP19_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP20_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP20_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP21_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP21_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP22_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP22_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP23_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP23_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP24_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP24_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP25_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP25_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP26_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP26_iProver_split <=> % 7.89/8.10 $false % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP27_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP27_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP28_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP28_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP29_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP29_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP30_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP30_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP31_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP31_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP32_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP32_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 %------ Positive definition of sP33_iProver_split % 7.89/8.10 fof(lit_def,axiom, % 7.89/8.10 ( sP33_iProver_split <=> % 7.89/8.10 $true % 7.89/8.10 ) % 7.89/8.10 ). % 7.89/8.10 % 7.89/8.10 % 7.89/8.10 % 7.89/8.10 % ------ Statistics % 7.89/8.10 % 7.89/8.10 % ------ General % 7.89/8.10 % 7.89/8.10 % num_of_input_clauses: 432 % 7.89/8.10 % num_of_input_neg_conjectures: 432 % 7.89/8.10 % num_of_splits: 1120 % 7.89/8.10 % num_of_split_atoms: 34 % 7.89/8.10 % num_of_sem_filtered_clauses: 0 % 7.89/8.10 % num_of_subtypes: 0 % 7.89/8.10 % monotx_restored_types: 0 % 7.89/8.10 % sat_num_of_epr_types: 0 % 7.89/8.10 % sat_num_of_non_cyclic_types: 0 % 7.89/8.10 % sat_guarded_non_collapsed_types: 0 % 7.89/8.10 % is_epr: 0 % 7.89/8.10 % is_horn: 0 % 7.89/8.10 % has_eq: 0 % 7.89/8.10 % num_pure_diseq_elim: 0 % 7.89/8.10 % simp_replaced_by: 0 % 7.89/8.10 % res_preprocessed: 1984 % 7.89/8.10 % prep_upred: 0 % 7.89/8.10 % prep_unflattend: 0 % 7.89/8.10 % pred_elim_cands: 34 % 7.89/8.10 % pred_elim: 0 % 7.89/8.10 % pred_elim_cl: 0 % 7.89/8.10 % pred_elim_cycles: 34 % 7.89/8.10 % forced_gc_time: 0 % 7.89/8.10 % gc_basic_clause_elim: 0 % 7.89/8.10 % parsing_time: 0.023 % 7.89/8.10 % sem_filter_time: 0. % 7.89/8.10 % pred_elim_time: 0.325 % 7.89/8.10 % out_proof_time: 0. % 7.89/8.10 % monotx_time: 0. % 7.89/8.10 % subtype_inf_time: 0. % 7.89/8.10 % unif_index_cands_time: 0.002 % 7.89/8.10 % unif_index_add_time: 0.002 % 7.89/8.10 % total_time: 3.684 % 7.89/8.10 % num_of_symbols: 91 % 7.89/8.10 % num_of_terms: 1591 % 7.89/8.10 % 7.89/8.10 % ------ Propositional Solver % 7.89/8.10 % 7.89/8.10 % prop_solver_calls: 6 % 7.89/8.10 % prop_fast_solver_calls: 15950 % 7.89/8.10 % prop_num_of_clauses: 2798 % 7.89/8.10 % prop_preprocess_simplified: 13174 % 7.89/8.10 % prop_fo_subsumed: 0 % 7.89/8.10 % prop_solver_time: 0. % 7.89/8.10 % prop_fast_solver_time: 0.009 % 7.89/8.10 % prop_unsat_core_time: 0. % 7.89/8.10 % 7.89/8.10 % ------ QBF % 7.89/8.10 % 7.89/8.10 % qbf_q_res: 0 % 7.89/8.10 % qbf_num_tautologies: 0 % 7.89/8.10 % qbf_prep_cycles: 0 % 7.89/8.10 % 7.89/8.10 % ------ BMC1 % 7.89/8.10 % 7.89/8.10 % bmc1_current_bound: -1 % 7.89/8.10 % bmc1_last_solved_bound: -1 % 7.89/8.10 % bmc1_unsat_core_size: -1 % 7.89/8.10 % bmc1_unsat_core_parents_size: -1 % 7.89/8.10 % bmc1_merge_next_fun: 0 % 7.89/8.10 % bmc1_unsat_core_clauses_time: 0. % 7.89/8.10 % 7.89/8.10 % ------ Instantiation % 7.89/8.10 % 7.89/8.10 % inst_num_of_clauses: 787 % 7.89/8.10 % inst_num_in_passive: 0 % 7.89/8.10 % inst_num_in_active: 787 % 7.89/8.10 % inst_num_in_unprocessed: 0 % 7.89/8.10 % inst_num_of_loops: 869 % 7.89/8.10 % inst_num_of_learning_restarts: 0 % 7.89/8.10 % inst_num_moves_active_passive: 73 % 7.89/8.10 % inst_lit_activity: 101 % 7.89/8.10 % inst_lit_activity_moves: 0 % 7.89/8.10 % inst_num_tautologies: 0 % 7.89/8.10 % inst_num_prop_implied: 0 % 7.89/8.10 % inst_num_existing_simplified: 0 % 7.89/8.10 % inst_num_eq_res_simplified: 0 % 7.89/8.10 % inst_num_child_elim: 0 % 7.89/8.10 % inst_num_of_dismatching_blockings: 0 % 7.89/8.10 % inst_num_of_non_proper_insts: 279 % 7.89/8.10 % inst_num_of_duplicates: 5 % 7.89/8.10 % inst_inst_num_from_inst_to_res: 0 % 7.89/8.10 % inst_dismatching_checking_time: 0. % 7.89/8.10 % 7.89/8.10 % ------ Resolution % 7.89/8.10 % 7.89/8.10 % res_num_of_clauses: 2196 % 7.89/8.10 % res_num_in_passive: 704 % 7.89/8.10 % res_num_in_active: 1416 % 7.89/8.10 % res_num_of_loops: 3000 % 7.89/8.10 % res_forward_subset_subsumed: 964 % 7.89/8.10 % res_backward_subset_subsumed: 121 % 7.89/8.10 % res_forward_subsumed: 1260 % 7.89/8.10 % res_backward_subsumed: 166 % 7.89/8.10 % res_forward_subsumption_resolution: 2023 % 7.89/8.10 % res_backward_subsumption_resolution: 0 % 7.89/8.10 % res_clause_to_clause_subsumption: 11444 % 7.89/8.10 % res_orphan_elimination: 0 % 7.89/8.10 % res_tautology_del: 2091 % 7.89/8.10 % res_num_eq_res_simplified: 0 % 7.89/8.10 % res_num_sel_changes: 0 % 7.89/8.10 % res_moves_from_active_to_pass: 0 % 7.89/8.10 % 7.89/8.10 % Status Unknown % 7.89/8.10 % Last status : % 7.89/8.10 % SZS status Unknown %------------------------------------------------------------------------------