%------------------------------------------------------------------------------ % File : iProverMo---2.5-0.1 % Problem : NLP166+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : iprover_modulo %s %d % Computer : n008.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:41:18 EDT 2022 % Result : Unknown 61.94s 62.17s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NLP166+1 : TPTP v8.1.0. Released v2.4.0. % 0.12/0.13 % Command : iprover_modulo %s %d % 0.13/0.33 % Computer : n008.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Thu Jun 30 18:04:53 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.34 % Running in mono-core mode % 0.20/0.43 % Orienting using strategy Equiv(ClausalAll) % 0.20/0.43 % FOF problem with conjecture % 0.20/0.43 % 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_68a3f0.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_5dd9fe.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_4fd16f | grep -v "SZS" % 0.20/0.45 % 0.20/0.45 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 0.20/0.45 % 0.20/0.45 % % 0.20/0.45 % ------ iProver source info % 0.20/0.45 % 0.20/0.45 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 0.20/0.45 % git: non_committed_changes: true % 0.20/0.45 % git: last_make_outside_of_git: true % 0.20/0.45 % 0.20/0.45 % % 0.20/0.45 % ------ Input Options % 0.20/0.45 % 0.20/0.45 % --out_options all % 0.20/0.45 % --tptp_safe_out true % 0.20/0.45 % --problem_path "" % 0.20/0.45 % --include_path "" % 0.20/0.45 % --clausifier .//eprover % 0.20/0.45 % --clausifier_options --tstp-format % 0.20/0.45 % --stdin false % 0.20/0.45 % --dbg_backtrace false % 0.20/0.45 % --dbg_dump_prop_clauses false % 0.20/0.45 % --dbg_dump_prop_clauses_file - % 0.20/0.45 % --dbg_out_stat false % 0.20/0.45 % 0.20/0.45 % ------ General Options % 0.20/0.45 % 0.20/0.45 % --fof false % 0.20/0.45 % --time_out_real 150. % 0.20/0.45 % --time_out_prep_mult 0.2 % 0.20/0.45 % --time_out_virtual -1. % 0.20/0.45 % --schedule none % 0.20/0.45 % --ground_splitting input % 0.20/0.45 % --splitting_nvd 16 % 0.20/0.45 % --non_eq_to_eq false % 0.20/0.45 % --prep_gs_sim true % 0.20/0.45 % --prep_unflatten false % 0.20/0.45 % --prep_res_sim true % 0.20/0.45 % --prep_upred true % 0.20/0.45 % --res_sim_input true % 0.20/0.45 % --clause_weak_htbl true % 0.20/0.45 % --gc_record_bc_elim false % 0.20/0.45 % --symbol_type_check false % 0.20/0.45 % --clausify_out false % 0.20/0.45 % --large_theory_mode false % 0.20/0.45 % --prep_sem_filter none % 0.20/0.45 % --prep_sem_filter_out false % 0.20/0.45 % --preprocessed_out false % 0.20/0.45 % --sub_typing false % 0.20/0.45 % --brand_transform false % 0.20/0.45 % --pure_diseq_elim true % 0.20/0.45 % --min_unsat_core false % 0.20/0.45 % --pred_elim true % 0.20/0.45 % --add_important_lit false % 0.20/0.45 % --soft_assumptions false % 0.20/0.45 % --reset_solvers false % 0.20/0.45 % --bc_imp_inh [] % 0.20/0.45 % --conj_cone_tolerance 1.5 % 0.20/0.45 % --prolific_symb_bound 500 % 0.20/0.45 % --lt_threshold 2000 % 0.20/0.45 % 0.20/0.45 % ------ SAT Options % 0.20/0.45 % 0.20/0.45 % --sat_mode false % 0.20/0.45 % --sat_fm_restart_options "" % 0.20/0.45 % --sat_gr_def false % 0.20/0.45 % --sat_epr_types true % 0.20/0.45 % --sat_non_cyclic_types false % 0.20/0.45 % --sat_finite_models false % 0.20/0.45 % --sat_fm_lemmas false % 0.20/0.45 % --sat_fm_prep false % 0.20/0.45 % --sat_fm_uc_incr true % 0.20/0.45 % --sat_out_model small % 0.20/0.45 % --sat_out_clauses false % 0.20/0.45 % 0.20/0.45 % ------ QBF Options % 0.20/0.45 % 0.20/0.45 % --qbf_mode false % 0.20/0.45 % --qbf_elim_univ true % 0.20/0.45 % --qbf_sk_in true % 0.20/0.45 % --qbf_pred_elim true % 0.20/0.45 % --qbf_split 32 % 0.20/0.45 % 0.20/0.45 % ------ BMC1 Options % 0.20/0.45 % 0.20/0.45 % --bmc1_incremental false % 0.20/0.45 % --bmc1_axioms reachable_all % 0.20/0.45 % --bmc1_min_bound 0 % 0.20/0.45 % --bmc1_max_bound -1 % 0.20/0.45 % --bmc1_max_bound_default -1 % 0.20/0.45 % --bmc1_symbol_reachability true % 0.20/0.45 % --bmc1_property_lemmas false % 0.20/0.45 % --bmc1_k_induction false % 0.20/0.45 % --bmc1_non_equiv_states false % 0.20/0.45 % --bmc1_deadlock false % 0.20/0.45 % --bmc1_ucm false % 0.20/0.45 % --bmc1_add_unsat_core none % 0.20/0.45 % --bmc1_unsat_core_children false % 0.20/0.45 % --bmc1_unsat_core_extrapolate_axioms false % 0.20/0.45 % --bmc1_out_stat full % 0.20/0.45 % --bmc1_ground_init false % 0.20/0.45 % --bmc1_pre_inst_next_state false % 0.20/0.45 % --bmc1_pre_inst_state false % 0.20/0.45 % --bmc1_pre_inst_reach_state false % 0.20/0.45 % --bmc1_out_unsat_core false % 0.20/0.45 % --bmc1_aig_witness_out false % 0.20/0.45 % --bmc1_verbose false % 0.20/0.45 % --bmc1_dump_clauses_tptp false % 0.60/0.80 % --bmc1_dump_unsat_core_tptp false % 0.60/0.80 % --bmc1_dump_file - % 0.60/0.80 % --bmc1_ucm_expand_uc_limit 128 % 0.60/0.80 % --bmc1_ucm_n_expand_iterations 6 % 0.60/0.80 % --bmc1_ucm_extend_mode 1 % 0.60/0.80 % --bmc1_ucm_init_mode 2 % 0.60/0.80 % --bmc1_ucm_cone_mode none % 0.60/0.80 % --bmc1_ucm_reduced_relation_type 0 % 0.60/0.80 % --bmc1_ucm_relax_model 4 % 0.60/0.80 % --bmc1_ucm_full_tr_after_sat true % 0.60/0.80 % --bmc1_ucm_expand_neg_assumptions false % 0.60/0.80 % --bmc1_ucm_layered_model none % 0.60/0.80 % --bmc1_ucm_max_lemma_size 10 % 0.60/0.80 % 0.60/0.80 % ------ AIG Options % 0.60/0.80 % 0.60/0.80 % --aig_mode false % 0.60/0.80 % 0.60/0.80 % ------ Instantiation Options % 0.60/0.80 % 0.60/0.80 % --instantiation_flag true % 0.60/0.80 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.60/0.80 % --inst_solver_per_active 750 % 0.60/0.80 % --inst_solver_calls_frac 0.5 % 0.60/0.80 % --inst_passive_queue_type priority_queues % 0.60/0.80 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.60/0.80 % --inst_passive_queues_freq [25;2] % 0.60/0.80 % --inst_dismatching true % 0.60/0.80 % --inst_eager_unprocessed_to_passive true % 0.60/0.80 % --inst_prop_sim_given true % 0.60/0.80 % --inst_prop_sim_new false % 0.60/0.80 % --inst_orphan_elimination true % 0.60/0.80 % --inst_learning_loop_flag true % 0.60/0.80 % --inst_learning_start 3000 % 0.60/0.80 % --inst_learning_factor 2 % 0.60/0.80 % --inst_start_prop_sim_after_learn 3 % 0.60/0.80 % --inst_sel_renew solver % 0.60/0.80 % --inst_lit_activity_flag true % 0.60/0.80 % --inst_out_proof true % 0.60/0.80 % 0.60/0.80 % ------ Resolution Options % 0.60/0.80 % 0.60/0.80 % --resolution_flag true % 0.60/0.80 % --res_lit_sel kbo_max % 0.60/0.80 % --res_to_prop_solver none % 0.60/0.80 % --res_prop_simpl_new false % 0.60/0.80 % --res_prop_simpl_given false % 0.60/0.80 % --res_passive_queue_type priority_queues % 0.60/0.80 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 0.60/0.80 % --res_passive_queues_freq [15;5] % 0.60/0.80 % --res_forward_subs full % 0.60/0.80 % --res_backward_subs full % 0.60/0.80 % --res_forward_subs_resolution true % 0.60/0.80 % --res_backward_subs_resolution true % 0.60/0.80 % --res_orphan_elimination false % 0.60/0.80 % --res_time_limit 1000. % 0.60/0.80 % --res_out_proof true % 0.60/0.80 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_68a3f0.s % 0.60/0.80 % --modulo true % 0.60/0.80 % 0.60/0.80 % ------ Combination Options % 0.60/0.80 % 0.60/0.80 % --comb_res_mult 1000 % 0.60/0.80 % --comb_inst_mult 300 % 0.60/0.80 % ------ % 0.60/0.80 % 0.60/0.80 % ------ Parsing...% successful % 0.60/0.80 % 0.60/0.80 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 54 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e snvd_s sp: 0 0s snvd_e % % 0.60/0.80 % 0.60/0.80 % ------ Proving... % 0.60/0.80 % ------ Problem Properties % 0.60/0.80 % 0.60/0.80 % % 0.60/0.80 % EPR false % 0.60/0.80 % Horn false % 0.60/0.80 % Has equality false % 0.60/0.80 % 0.60/0.80 % % ------ Input Options Time Limit: Unbounded % 0.60/0.81 % 0.60/0.81 % 0.60/0.81 % % ------ Current options: % 0.60/0.81 % 0.60/0.81 % ------ Input Options % 0.60/0.81 % 0.60/0.81 % --out_options all % 0.60/0.81 % --tptp_safe_out true % 0.60/0.81 % --problem_path "" % 0.60/0.81 % --include_path "" % 0.60/0.81 % --clausifier .//eprover % 0.60/0.81 % --clausifier_options --tstp-format % 0.60/0.81 % --stdin false % 0.60/0.81 % --dbg_backtrace false % 0.60/0.81 % --dbg_dump_prop_clauses false % 0.60/0.81 % --dbg_dump_prop_clauses_file - % 0.60/0.81 % --dbg_out_stat false % 0.60/0.81 % 0.60/0.81 % ------ General Options % 0.60/0.81 % 0.60/0.81 % --fof false % 0.60/0.81 % --time_out_real 150. % 0.60/0.81 % --time_out_prep_mult 0.2 % 0.60/0.81 % --time_out_virtual -1. % 0.60/0.81 % --schedule none % 0.60/0.81 % --ground_splitting input % 0.60/0.81 % --splitting_nvd 16 % 0.60/0.81 % --non_eq_to_eq false % 0.60/0.81 % --prep_gs_sim true % 0.60/0.81 % --prep_unflatten false % 0.60/0.81 % --prep_res_sim true % 0.60/0.81 % --prep_upred true % 0.60/0.81 % --res_sim_input true % 0.60/0.81 % --clause_weak_htbl true % 0.60/0.81 % --gc_record_bc_elim false % 0.60/0.81 % --symbol_type_check false % 0.60/0.81 % --clausify_out false % 0.60/0.81 % --large_theory_mode false % 0.60/0.81 % --prep_sem_filter none % 0.60/0.81 % --prep_sem_filter_out false % 0.60/0.81 % --preprocessed_out false % 0.60/0.81 % --sub_typing false % 0.60/0.81 % --brand_transform false % 0.60/0.81 % --pure_diseq_elim true % 0.60/0.81 % --min_unsat_core false % 0.60/0.81 % --pred_elim true % 0.60/0.81 % --add_important_lit false % 0.60/0.81 % --soft_assumptions false % 0.60/0.81 % --reset_solvers false % 0.60/0.81 % --bc_imp_inh [] % 0.60/0.81 % --conj_cone_tolerance 1.5 % 0.60/0.81 % --prolific_symb_bound 500 % 0.60/0.81 % --lt_threshold 2000 % 0.60/0.81 % 0.60/0.81 % ------ SAT Options % 0.60/0.81 % 0.60/0.81 % --sat_mode false % 0.60/0.81 % --sat_fm_restart_options "" % 0.60/0.81 % --sat_gr_def false % 0.60/0.81 % --sat_epr_types true % 0.60/0.81 % --sat_non_cyclic_types false % 0.60/0.81 % --sat_finite_models false % 0.60/0.81 % --sat_fm_lemmas false % 0.60/0.81 % --sat_fm_prep false % 0.60/0.81 % --sat_fm_uc_incr true % 0.60/0.81 % --sat_out_model small % 0.60/0.81 % --sat_out_clauses false % 0.60/0.81 % 0.60/0.81 % ------ QBF Options % 0.60/0.81 % 0.60/0.81 % --qbf_mode false % 0.60/0.81 % --qbf_elim_univ true % 0.60/0.81 % --qbf_sk_in true % 0.60/0.81 % --qbf_pred_elim true % 0.60/0.81 % --qbf_split 32 % 0.60/0.81 % 0.60/0.81 % ------ BMC1 Options % 0.60/0.81 % 0.60/0.81 % --bmc1_incremental false % 0.60/0.81 % --bmc1_axioms reachable_all % 0.60/0.81 % --bmc1_min_bound 0 % 0.60/0.81 % --bmc1_max_bound -1 % 0.60/0.81 % --bmc1_max_bound_default -1 % 0.60/0.81 % --bmc1_symbol_reachability true % 0.60/0.81 % --bmc1_property_lemmas false % 0.60/0.81 % --bmc1_k_induction false % 0.60/0.81 % --bmc1_non_equiv_states false % 0.60/0.81 % --bmc1_deadlock false % 0.60/0.81 % --bmc1_ucm false % 0.60/0.81 % --bmc1_add_unsat_core none % 0.60/0.81 % --bmc1_unsat_core_children false % 0.60/0.81 % --bmc1_unsat_core_extrapolate_axioms false % 0.60/0.81 % --bmc1_out_stat full % 0.60/0.81 % --bmc1_ground_init false % 0.60/0.81 % --bmc1_pre_inst_next_state false % 0.60/0.81 % --bmc1_pre_inst_state false % 0.60/0.81 % --bmc1_pre_inst_reach_state false % 0.60/0.81 % --bmc1_out_unsat_core false % 0.60/0.81 % --bmc1_aig_witness_out false % 0.60/0.81 % --bmc1_verbose false % 0.60/0.81 % --bmc1_dump_clauses_tptp false % 0.60/0.81 % --bmc1_dump_unsat_core_tptp false % 0.60/0.81 % --bmc1_dump_file - % 0.60/0.81 % --bmc1_ucm_expand_uc_limit 128 % 0.60/0.81 % --bmc1_ucm_n_expand_iterations 6 % 0.60/0.81 % --bmc1_ucm_extend_mode 1 % 0.60/0.81 % --bmc1_ucm_init_mode 2 % 0.60/0.81 % --bmc1_ucm_cone_mode none % 0.60/0.81 % --bmc1_ucm_reduced_relation_type 0 % 0.60/0.81 % --bmc1_ucm_relax_model 4 % 0.60/0.81 % --bmc1_ucm_full_tr_after_sat true % 0.60/0.81 % --bmc1_ucm_expand_neg_assumptions false % 0.60/0.81 % --bmc1_ucm_layered_model none % 0.60/0.81 % --bmc1_ucm_max_lemma_size 10 % 0.60/0.81 % 0.60/0.81 % ------ AIG Options % 0.60/0.81 % 0.60/0.81 % --aig_mode false % 0.60/0.81 % 0.60/0.81 % ------ Instantiation Options % 0.60/0.81 % 0.60/0.81 % --instantiation_flag true % 0.60/0.81 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.60/0.81 % --inst_solver_per_active 750 % 0.60/0.81 % --inst_solver_calls_frac 0.5 % 0.60/0.81 % --inst_passive_queue_type priority_queues % 0.60/0.81 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.60/0.81 % --inst_passive_queues_freq [25;2] % 0.60/0.81 % --inst_dismatching true % 0.60/0.81 % --inst_eager_unprocessed_to_passive true % 30.01/30.21 % --inst_prop_sim_given true % 30.01/30.21 % --inst_prop_sim_new false % 30.01/30.21 % --inst_orphan_elimination true % 30.01/30.21 % --inst_learning_loop_flag true % 30.01/30.21 % --inst_learning_start 3000 % 30.01/30.21 % --inst_learning_factor 2 % 30.01/30.21 % --inst_start_prop_sim_after_learn 3 % 30.01/30.21 % --inst_sel_renew solver % 30.01/30.21 % --inst_lit_activity_flag true % 30.01/30.21 % --inst_out_proof true % 30.01/30.21 % 30.01/30.21 % ------ Resolution Options % 30.01/30.21 % 30.01/30.21 % --resolution_flag true % 30.01/30.21 % --res_lit_sel kbo_max % 30.01/30.21 % --res_to_prop_solver none % 30.01/30.21 % --res_prop_simpl_new false % 30.01/30.21 % --res_prop_simpl_given false % 30.01/30.21 % --res_passive_queue_type priority_queues % 30.01/30.21 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 30.01/30.21 % --res_passive_queues_freq [15;5] % 30.01/30.21 % --res_forward_subs full % 30.01/30.21 % --res_backward_subs full % 30.01/30.21 % --res_forward_subs_resolution true % 30.01/30.21 % --res_backward_subs_resolution true % 30.01/30.21 % --res_orphan_elimination false % 30.01/30.21 % --res_time_limit 1000. % 30.01/30.21 % --res_out_proof true % 30.01/30.21 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_68a3f0.s % 30.01/30.21 % --modulo true % 30.01/30.21 % 30.01/30.21 % ------ Combination Options % 30.01/30.21 % 30.01/30.21 % --comb_res_mult 1000 % 30.01/30.21 % --comb_inst_mult 300 % 30.01/30.21 % ------ % 30.01/30.21 % 30.01/30.21 % 30.01/30.21 % 30.01/30.21 % ------ Proving... % 30.01/30.21 % warning: shown sat in sat incomplete mode % 30.01/30.21 % % 30.01/30.21 % 30.01/30.21 % 30.01/30.21 ------ Building Model...Done % 30.01/30.21 % 30.01/30.21 %------ The model is defined over ground terms (initial term algebra). % 30.01/30.21 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 30.01/30.21 %------ where \phi is a formula over the term algebra. % 30.01/30.21 %------ If we have equality in the problem then it is also defined as a predicate above, % 30.01/30.21 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 30.01/30.21 %------ See help for --sat_out_model for different model outputs. % 30.01/30.21 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 30.01/30.21 %------ where the first argument stands for the sort ($i in the unsorted case) % 30.01/30.21 % 30.01/30.21 % 30.01/30.21 % 30.01/30.21 % 30.01/30.21 %------ Positive definition of epred1_0 % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 ( epred1_0 <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of actual_world % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0] : % 30.01/30.21 ( ~(actual_world(X0)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of group % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( group(X0,X1) <=> % 30.01/30.21 ( % 30.01/30.21 ( % 30.01/30.21 ( X0=sk3_esk17_0 & X1=sk3_esk24_0 ) % 30.01/30.21 ) % 30.01/30.21 % 30.01/30.21 | % 30.01/30.21 ( % 30.01/30.21 ( X0=sk3_esk17_0 & X1=sk3_esk27_0 ) % 30.01/30.21 ) % 30.01/30.21 % 30.01/30.21 | % 30.01/30.21 ( % 30.01/30.21 ( X0=sk3_esk17_0 & X1=sk3_esk18_0 ) % 30.01/30.21 ) % 30.01/30.21 % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of frontseat % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( frontseat(X0,X1) <=> % 30.01/30.21 ( % 30.01/30.21 ( % 30.01/30.21 ( X0=sk3_esk17_0 & X1=sk3_esk19_0 ) % 30.01/30.21 ) % 30.01/30.21 % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of of % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2] : % 30.01/30.21 ( ~(of(X0,X1,X2)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of city % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( ~(city(X0,X1)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of hollywood_placename % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( ~(hollywood_placename(X0,X1)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of placename % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( ~(placename(X0,X1)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of chevy % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( chevy(X0,X1) <=> % 30.01/30.21 ( % 30.01/30.21 ( % 30.01/30.21 ( X0=sk3_esk17_0 & X1=sk3_esk21_0 ) % 30.01/30.21 ) % 30.01/30.21 % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of white % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( ~(white(X0,X1)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of dirty % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( ~(dirty(X0,X1)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of old % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( ~(old(X0,X1)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of street % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( ~(street(X0,X1)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of lonely % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( ~(lonely(X0,X1)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of event % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( event(X0,X1) <=> % 30.01/30.21 ( % 30.01/30.21 ( % 30.01/30.21 ( X0=sk3_esk17_0 & X1=sk3_esk23_0 ) % 30.01/30.21 ) % 30.01/30.21 % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of agent % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2] : % 30.01/30.21 ( ~(agent(X0,X1,X2)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of present % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( present(X0,X1) <=> % 30.01/30.21 ( % 30.01/30.21 ( % 30.01/30.21 ( X0=sk3_esk17_0 & X1=sk3_esk23_0 ) % 30.01/30.21 ) % 30.01/30.21 % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of barrel % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( ~(barrel(X0,X1)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of down % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2] : % 30.01/30.21 ( ~(down(X0,X1,X2)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Negative definition of in % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2] : % 30.01/30.21 ( ~(in(X0,X1,X2)) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of two % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( two(X0,X1) <=> % 30.01/30.21 ( % 30.01/30.21 ( % 30.01/30.21 ( X0=sk3_esk17_0 & X1=sk3_esk24_0 ) % 30.01/30.21 ) % 30.01/30.21 % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of wear % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( wear(X0,X1) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of nonreflexive % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1] : % 30.01/30.21 ( nonreflexive(X0,X1) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of member % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2] : % 30.01/30.21 ( member(X0,X1,X2) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of epred2_0 % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 ( epred2_0 <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP0_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP3_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP5_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 30.01/30.21 ( sP5_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP6_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP8_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 30.01/30.21 ( sP8_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP9_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP12_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP14_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP14_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP16_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP16_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP19_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP22_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP22_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP25_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP25_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP27_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP27_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP29_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 30.01/30.21 ( sP29_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP30_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP33_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP33_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP35_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP35_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $false % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP36_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP36_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP39_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP39_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP41_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP41_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP43_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP43_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP46_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP46_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP49_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP49_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 %------ Positive definition of sP52_iProver_split % 30.01/30.21 fof(lit_def,axiom, % 30.01/30.21 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 30.01/30.21 ( sP52_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 30.01/30.21 $true % 30.01/30.21 ) % 30.01/30.21 ) % 30.01/30.21 ). % 30.01/30.21 % 30.01/30.21 % 30.01/30.21 % 30.01/30.21 % ------ Statistics % 30.01/30.21 % 30.01/30.21 % ------ General % 30.01/30.21 % 30.01/30.21 % num_of_input_clauses: 121 % 30.01/30.21 % num_of_input_neg_conjectures: 1 % 30.01/30.21 % num_of_splits: 54 % 30.01/30.21 % num_of_split_atoms: 54 % 30.01/30.21 % num_of_sem_filtered_clauses: 0 % 30.01/30.21 % num_of_subtypes: 0 % 30.01/30.21 % monotx_restored_types: 0 % 30.01/30.21 % sat_num_of_epr_types: 0 % 30.01/30.21 % sat_num_of_non_cyclic_types: 0 % 30.01/30.21 % sat_guarded_non_collapsed_types: 0 % 30.01/30.21 % is_epr: 0 % 30.01/30.21 % is_horn: 0 % 30.01/30.21 % has_eq: 0 % 30.01/30.21 % num_pure_diseq_elim: 0 % 30.01/30.21 % simp_replaced_by: 0 % 30.01/30.21 % res_preprocessed: 176 % 30.01/30.21 % prep_upred: 0 % 30.01/30.21 % prep_unflattend: 0 % 30.01/30.21 % pred_elim_cands: 85 % 30.01/30.21 % pred_elim: 17 % 30.01/30.21 % pred_elim_cl: 17 % 30.01/30.21 % pred_elim_cycles: 80 % 30.01/30.21 % forced_gc_time: 0 % 30.01/30.21 % gc_basic_clause_elim: 0 % 30.01/30.21 % parsing_time: 0.023 % 30.01/30.21 % sem_filter_time: 0. % 30.01/30.21 % pred_elim_time: 0.244 % 30.01/30.21 % out_proof_time: 0. % 30.01/30.21 % monotx_time: 0. % 30.01/30.21 % subtype_inf_time: 0. % 30.01/30.21 % unif_index_cands_time: 0.022 % 30.01/30.21 % unif_index_add_time: 0.024 % 30.01/30.21 % total_time: 29.772 % 30.01/30.21 % num_of_symbols: 145 % 30.01/30.21 % num_of_terms: 27813 % 30.01/30.21 % 30.01/30.21 % ------ Propositional Solver % 30.01/30.21 % 30.01/30.21 % prop_solver_calls: 20 % 30.01/30.21 % prop_fast_solver_calls: 6937 % 30.01/30.21 % prop_num_of_clauses: 8128 % 30.01/30.21 % prop_preprocess_simplified: 10849 % 30.01/30.21 % prop_fo_subsumed: 112 % 30.01/30.21 % prop_solver_time: 0.001 % 30.01/30.21 % prop_fast_solver_time: 0.016 % 30.01/30.21 % prop_unsat_core_time: 0. % 30.01/30.21 % 30.01/30.21 % ------ QBF % 30.01/30.21 % 30.01/30.21 % qbf_q_res: 0 % 30.01/30.21 % qbf_num_tautologies: 0 % 30.01/30.21 % qbf_prep_cycles: 0 % 30.01/30.21 % 30.01/30.21 % ------ BMC1 % 30.01/30.21 % 30.01/30.21 % bmc1_current_bound: -1 % 30.01/30.21 % bmc1_last_solved_bound: -1 % 30.01/30.21 % bmc1_unsat_core_size: -1 % 30.01/30.21 % bmc1_unsat_core_parents_size: -1 % 30.01/30.21 % bmc1_merge_next_fun: 0 % 30.01/30.21 % bmc1_unsat_core_clauses_time: 0. % 30.01/30.21 % 30.01/30.21 % ------ Instantiation % 30.01/30.21 % 30.01/30.21 % inst_num_of_clauses: 1256 % 30.01/30.21 % inst_num_in_passive: 0 % 30.01/30.21 % inst_num_in_active: 1256 % 30.01/30.21 % inst_num_in_unprocessed: 0 % 30.01/30.21 % inst_num_of_loops: 1260 % 30.01/30.21 % inst_num_of_learning_restarts: 1 % 30.01/30.21 % inst_num_moves_active_passive: 0 % 30.01/30.21 % inst_lit_activity: 397 % 30.01/30.21 % inst_lit_activity_moves: 0 % 30.01/30.21 % inst_num_tautologies: 0 % 30.01/30.21 % inst_num_prop_implied: 0 % 30.01/30.21 % inst_num_existing_simplified: 0 % 30.01/30.21 % inst_num_eq_res_simplified: 0 % 30.01/30.21 % inst_num_child_elim: 0 % 30.01/30.21 % inst_num_of_dismatching_blockings: 0 % 30.01/30.21 % inst_num_of_non_proper_insts: 1098 % 30.01/30.21 % inst_num_of_duplicates: 0 % 30.01/30.21 % inst_inst_num_from_inst_to_res: 0 % 30.01/30.21 % inst_dismatching_checking_time: 0.002 % 30.01/30.21 % 30.01/30.21 % ------ Resolution % 30.01/30.21 % 30.01/30.21 % res_num_of_clauses: 38724 % 30.01/30.21 % res_num_in_passive: 27521 % 30.01/30.21 % res_num_in_active: 11291 % 30.01/30.21 % res_num_of_loops: 15000 % 30.01/30.21 % res_forward_subset_subsumed: 31133 % 30.01/30.21 % res_backward_subset_subsumed: 532 % 30.01/30.21 % res_forward_subsumed: 0 % 30.01/30.21 % res_backward_subsumed: 0 % 30.01/30.21 % res_forward_subsumption_resolution: 16987 % 30.01/30.21 % res_backward_subsumption_resolution: 32 % 30.01/30.21 % res_clause_to_clause_subsumption: 63093 % 30.01/30.21 % res_orphan_elimination: 0 % 30.01/30.21 % res_tautology_del: 15600 % 30.01/30.21 % res_num_eq_res_simplified: 0 % 30.01/30.21 % res_num_sel_changes: 0 % 30.01/30.21 % res_moves_from_active_to_pass: 0 % 30.01/30.21 % 30.01/30.21 % Status Unknown % 30.01/30.26 % Orienting using strategy ClausalAll % 30.01/30.26 % FOF problem with conjecture % 30.01/30.26 % 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_68a3f0.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_5dd9fe.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_3a604a | grep -v "SZS" % 30.01/30.27 % 30.01/30.27 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 30.01/30.27 % 30.01/30.27 % % 30.01/30.27 % ------ iProver source info % 30.01/30.27 % 30.01/30.27 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 30.01/30.27 % git: non_committed_changes: true % 30.01/30.27 % git: last_make_outside_of_git: true % 30.01/30.27 % 30.01/30.27 % % 30.01/30.27 % ------ Input Options % 30.01/30.27 % 30.01/30.27 % --out_options all % 30.01/30.27 % --tptp_safe_out true % 30.01/30.27 % --problem_path "" % 30.01/30.27 % --include_path "" % 30.01/30.27 % --clausifier .//eprover % 30.01/30.27 % --clausifier_options --tstp-format % 30.01/30.27 % --stdin false % 30.01/30.27 % --dbg_backtrace false % 30.01/30.27 % --dbg_dump_prop_clauses false % 30.01/30.27 % --dbg_dump_prop_clauses_file - % 30.01/30.27 % --dbg_out_stat false % 30.01/30.27 % 30.01/30.27 % ------ General Options % 30.01/30.27 % 30.01/30.27 % --fof false % 30.01/30.27 % --time_out_real 150. % 30.01/30.27 % --time_out_prep_mult 0.2 % 30.01/30.27 % --time_out_virtual -1. % 30.01/30.27 % --schedule none % 30.01/30.27 % --ground_splitting input % 30.01/30.27 % --splitting_nvd 16 % 30.01/30.27 % --non_eq_to_eq false % 30.01/30.27 % --prep_gs_sim true % 30.01/30.27 % --prep_unflatten false % 30.01/30.27 % --prep_res_sim true % 30.01/30.27 % --prep_upred true % 30.01/30.27 % --res_sim_input true % 30.01/30.27 % --clause_weak_htbl true % 30.01/30.27 % --gc_record_bc_elim false % 30.01/30.27 % --symbol_type_check false % 30.01/30.27 % --clausify_out false % 30.01/30.27 % --large_theory_mode false % 30.01/30.27 % --prep_sem_filter none % 30.01/30.27 % --prep_sem_filter_out false % 30.01/30.27 % --preprocessed_out false % 30.01/30.27 % --sub_typing false % 30.01/30.27 % --brand_transform false % 30.01/30.27 % --pure_diseq_elim true % 30.01/30.27 % --min_unsat_core false % 30.01/30.27 % --pred_elim true % 30.01/30.27 % --add_important_lit false % 30.01/30.27 % --soft_assumptions false % 30.01/30.27 % --reset_solvers false % 30.01/30.27 % --bc_imp_inh [] % 30.01/30.27 % --conj_cone_tolerance 1.5 % 30.01/30.27 % --prolific_symb_bound 500 % 30.01/30.27 % --lt_threshold 2000 % 30.01/30.27 % 30.01/30.27 % ------ SAT Options % 30.01/30.27 % 30.01/30.27 % --sat_mode false % 30.01/30.27 % --sat_fm_restart_options "" % 30.01/30.27 % --sat_gr_def false % 30.01/30.27 % --sat_epr_types true % 30.01/30.27 % --sat_non_cyclic_types false % 30.01/30.27 % --sat_finite_models false % 30.01/30.27 % --sat_fm_lemmas false % 30.01/30.27 % --sat_fm_prep false % 30.01/30.27 % --sat_fm_uc_incr true % 30.01/30.27 % --sat_out_model small % 30.01/30.27 % --sat_out_clauses false % 30.01/30.27 % 30.01/30.27 % ------ QBF Options % 30.01/30.27 % 30.01/30.27 % --qbf_mode false % 30.01/30.27 % --qbf_elim_univ true % 30.01/30.27 % --qbf_sk_in true % 30.01/30.27 % --qbf_pred_elim true % 30.01/30.27 % --qbf_split 32 % 30.01/30.27 % 30.01/30.27 % ------ BMC1 Options % 30.01/30.27 % 30.01/30.27 % --bmc1_incremental false % 30.01/30.27 % --bmc1_axioms reachable_all % 30.01/30.27 % --bmc1_min_bound 0 % 30.01/30.27 % --bmc1_max_bound -1 % 30.01/30.27 % --bmc1_max_bound_default -1 % 30.01/30.27 % --bmc1_symbol_reachability true % 30.01/30.27 % --bmc1_property_lemmas false % 30.01/30.27 % --bmc1_k_induction false % 30.01/30.27 % --bmc1_non_equiv_states false % 30.01/30.27 % --bmc1_deadlock false % 30.01/30.27 % --bmc1_ucm false % 30.01/30.27 % --bmc1_add_unsat_core none % 30.01/30.27 % --bmc1_unsat_core_children false % 30.01/30.27 % --bmc1_unsat_core_extrapolate_axioms false % 30.01/30.27 % --bmc1_out_stat full % 30.01/30.27 % --bmc1_ground_init false % 30.01/30.27 % --bmc1_pre_inst_next_state false % 30.01/30.27 % --bmc1_pre_inst_state false % 30.01/30.27 % --bmc1_pre_inst_reach_state false % 30.01/30.27 % --bmc1_out_unsat_core false % 30.01/30.27 % --bmc1_aig_witness_out false % 30.01/30.27 % --bmc1_verbose false % 30.01/30.27 % --bmc1_dump_clauses_tptp false % 30.10/30.50 % --bmc1_dump_unsat_core_tptp false % 30.10/30.50 % --bmc1_dump_file - % 30.10/30.50 % --bmc1_ucm_expand_uc_limit 128 % 30.10/30.50 % --bmc1_ucm_n_expand_iterations 6 % 30.10/30.50 % --bmc1_ucm_extend_mode 1 % 30.10/30.50 % --bmc1_ucm_init_mode 2 % 30.10/30.50 % --bmc1_ucm_cone_mode none % 30.10/30.50 % --bmc1_ucm_reduced_relation_type 0 % 30.10/30.50 % --bmc1_ucm_relax_model 4 % 30.10/30.50 % --bmc1_ucm_full_tr_after_sat true % 30.10/30.50 % --bmc1_ucm_expand_neg_assumptions false % 30.10/30.50 % --bmc1_ucm_layered_model none % 30.10/30.50 % --bmc1_ucm_max_lemma_size 10 % 30.10/30.50 % 30.10/30.50 % ------ AIG Options % 30.10/30.50 % 30.10/30.50 % --aig_mode false % 30.10/30.50 % 30.10/30.50 % ------ Instantiation Options % 30.10/30.50 % 30.10/30.50 % --instantiation_flag true % 30.10/30.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 30.10/30.50 % --inst_solver_per_active 750 % 30.10/30.50 % --inst_solver_calls_frac 0.5 % 30.10/30.50 % --inst_passive_queue_type priority_queues % 30.10/30.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 30.10/30.50 % --inst_passive_queues_freq [25;2] % 30.10/30.50 % --inst_dismatching true % 30.10/30.50 % --inst_eager_unprocessed_to_passive true % 30.10/30.50 % --inst_prop_sim_given true % 30.10/30.50 % --inst_prop_sim_new false % 30.10/30.50 % --inst_orphan_elimination true % 30.10/30.50 % --inst_learning_loop_flag true % 30.10/30.50 % --inst_learning_start 3000 % 30.10/30.50 % --inst_learning_factor 2 % 30.10/30.50 % --inst_start_prop_sim_after_learn 3 % 30.10/30.50 % --inst_sel_renew solver % 30.10/30.50 % --inst_lit_activity_flag true % 30.10/30.50 % --inst_out_proof true % 30.10/30.50 % 30.10/30.50 % ------ Resolution Options % 30.10/30.50 % 30.10/30.50 % --resolution_flag true % 30.10/30.50 % --res_lit_sel kbo_max % 30.10/30.50 % --res_to_prop_solver none % 30.10/30.50 % --res_prop_simpl_new false % 30.10/30.50 % --res_prop_simpl_given false % 30.10/30.50 % --res_passive_queue_type priority_queues % 30.10/30.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 30.10/30.50 % --res_passive_queues_freq [15;5] % 30.10/30.50 % --res_forward_subs full % 30.10/30.50 % --res_backward_subs full % 30.10/30.50 % --res_forward_subs_resolution true % 30.10/30.50 % --res_backward_subs_resolution true % 30.10/30.50 % --res_orphan_elimination false % 30.10/30.50 % --res_time_limit 1000. % 30.10/30.50 % --res_out_proof true % 30.10/30.50 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_68a3f0.s % 30.10/30.50 % --modulo true % 30.10/30.50 % 30.10/30.50 % ------ Combination Options % 30.10/30.50 % 30.10/30.50 % --comb_res_mult 1000 % 30.10/30.50 % --comb_inst_mult 300 % 30.10/30.50 % ------ % 30.10/30.50 % 30.10/30.50 % ------ Parsing...% successful % 30.10/30.50 % 30.10/30.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 54 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e snvd_s sp: 0 0s snvd_e % % 30.10/30.50 % 30.10/30.50 % ------ Proving... % 30.10/30.50 % ------ Problem Properties % 30.10/30.50 % 30.10/30.50 % % 30.10/30.50 % EPR false % 30.10/30.50 % Horn false % 30.10/30.50 % Has equality false % 30.10/30.50 % 30.10/30.50 % % ------ Input Options Time Limit: Unbounded % 30.10/30.50 % 30.10/30.50 % 30.10/30.50 % % ------ Current options: % 30.10/30.50 % 30.10/30.50 % ------ Input Options % 30.10/30.50 % 30.10/30.50 % --out_options all % 30.10/30.50 % --tptp_safe_out true % 30.10/30.50 % --problem_path "" % 30.10/30.50 % --include_path "" % 30.10/30.50 % --clausifier .//eprover % 30.10/30.50 % --clausifier_options --tstp-format % 30.10/30.50 % --stdin false % 30.10/30.50 % --dbg_backtrace false % 30.10/30.50 % --dbg_dump_prop_clauses false % 30.10/30.50 % --dbg_dump_prop_clauses_file - % 30.10/30.50 % --dbg_out_stat false % 30.10/30.50 % 30.10/30.50 % ------ General Options % 30.10/30.50 % 30.10/30.50 % --fof false % 30.10/30.50 % --time_out_real 150. % 30.10/30.50 % --time_out_prep_mult 0.2 % 30.10/30.50 % --time_out_virtual -1. % 30.10/30.50 % --schedule none % 30.10/30.50 % --ground_splitting input % 30.10/30.50 % --splitting_nvd 16 % 30.10/30.50 % --non_eq_to_eq false % 30.10/30.50 % --prep_gs_sim true % 30.10/30.50 % --prep_unflatten false % 30.10/30.50 % --prep_res_sim true % 30.10/30.50 % --prep_upred true % 30.10/30.50 % --res_sim_input true % 30.10/30.50 % --clause_weak_htbl true % 30.10/30.50 % --gc_record_bc_elim false % 30.10/30.50 % --symbol_type_check false % 30.10/30.50 % --clausify_out false % 30.10/30.50 % --large_theory_mode false % 30.10/30.50 % --prep_sem_filter none % 30.10/30.50 % --prep_sem_filter_out false % 30.10/30.50 % --preprocessed_out false % 30.10/30.50 % --sub_typing false % 30.10/30.50 % --brand_transform false % 30.10/30.50 % --pure_diseq_elim true % 30.10/30.50 % --min_unsat_core false % 30.10/30.50 % --pred_elim true % 30.10/30.50 % --add_important_lit false % 30.10/30.50 % --soft_assumptions false % 30.10/30.50 % --reset_solvers false % 30.10/30.50 % --bc_imp_inh [] % 30.10/30.50 % --conj_cone_tolerance 1.5 % 30.10/30.50 % --prolific_symb_bound 500 % 30.10/30.50 % --lt_threshold 2000 % 30.10/30.50 % 30.10/30.50 % ------ SAT Options % 30.10/30.50 % 30.10/30.50 % --sat_mode false % 30.10/30.50 % --sat_fm_restart_options "" % 30.10/30.50 % --sat_gr_def false % 30.10/30.50 % --sat_epr_types true % 30.10/30.50 % --sat_non_cyclic_types false % 30.10/30.50 % --sat_finite_models false % 30.10/30.50 % --sat_fm_lemmas false % 30.10/30.50 % --sat_fm_prep false % 30.10/30.50 % --sat_fm_uc_incr true % 30.10/30.50 % --sat_out_model small % 30.10/30.50 % --sat_out_clauses false % 30.10/30.50 % 30.10/30.50 % ------ QBF Options % 30.10/30.50 % 30.10/30.50 % --qbf_mode false % 30.10/30.50 % --qbf_elim_univ true % 30.10/30.50 % --qbf_sk_in true % 30.10/30.50 % --qbf_pred_elim true % 30.10/30.50 % --qbf_split 32 % 30.10/30.50 % 30.10/30.50 % ------ BMC1 Options % 30.10/30.50 % 30.10/30.50 % --bmc1_incremental false % 30.10/30.50 % --bmc1_axioms reachable_all % 30.10/30.50 % --bmc1_min_bound 0 % 30.10/30.50 % --bmc1_max_bound -1 % 30.10/30.50 % --bmc1_max_bound_default -1 % 30.10/30.50 % --bmc1_symbol_reachability true % 30.10/30.50 % --bmc1_property_lemmas false % 30.10/30.50 % --bmc1_k_induction false % 30.10/30.50 % --bmc1_non_equiv_states false % 30.10/30.50 % --bmc1_deadlock false % 30.10/30.50 % --bmc1_ucm false % 30.10/30.50 % --bmc1_add_unsat_core none % 30.10/30.50 % --bmc1_unsat_core_children false % 30.10/30.50 % --bmc1_unsat_core_extrapolate_axioms false % 30.10/30.50 % --bmc1_out_stat full % 30.10/30.50 % --bmc1_ground_init false % 30.10/30.50 % --bmc1_pre_inst_next_state false % 30.10/30.50 % --bmc1_pre_inst_state false % 30.10/30.50 % --bmc1_pre_inst_reach_state false % 30.10/30.50 % --bmc1_out_unsat_core false % 30.10/30.50 % --bmc1_aig_witness_out false % 30.10/30.50 % --bmc1_verbose false % 30.10/30.50 % --bmc1_dump_clauses_tptp false % 30.10/30.50 % --bmc1_dump_unsat_core_tptp false % 30.10/30.50 % --bmc1_dump_file - % 30.10/30.50 % --bmc1_ucm_expand_uc_limit 128 % 30.10/30.50 % --bmc1_ucm_n_expand_iterations 6 % 30.10/30.50 % --bmc1_ucm_extend_mode 1 % 30.10/30.50 % --bmc1_ucm_init_mode 2 % 30.10/30.50 % --bmc1_ucm_cone_mode none % 30.10/30.50 % --bmc1_ucm_reduced_relation_type 0 % 30.10/30.50 % --bmc1_ucm_relax_model 4 % 30.10/30.50 % --bmc1_ucm_full_tr_after_sat true % 30.10/30.50 % --bmc1_ucm_expand_neg_assumptions false % 30.10/30.50 % --bmc1_ucm_layered_model none % 30.10/30.50 % --bmc1_ucm_max_lemma_size 10 % 30.10/30.50 % 30.10/30.50 % ------ AIG Options % 30.10/30.50 % 30.10/30.50 % --aig_mode false % 30.10/30.50 % 30.10/30.50 % ------ Instantiation Options % 30.10/30.50 % 30.10/30.50 % --instantiation_flag true % 30.10/30.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 30.10/30.50 % --inst_solver_per_active 750 % 30.10/30.50 % --inst_solver_calls_frac 0.5 % 30.10/30.50 % --inst_passive_queue_type priority_queues % 30.10/30.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 30.10/30.50 % --inst_passive_queues_freq [25;2] % 30.10/30.50 % --inst_dismatching true % 30.10/30.50 % --inst_eager_unprocessed_to_passive true % 61.94/62.16 % --inst_prop_sim_given true % 61.94/62.16 % --inst_prop_sim_new false % 61.94/62.16 % --inst_orphan_elimination true % 61.94/62.16 % --inst_learning_loop_flag true % 61.94/62.16 % --inst_learning_start 3000 % 61.94/62.16 % --inst_learning_factor 2 % 61.94/62.16 % --inst_start_prop_sim_after_learn 3 % 61.94/62.16 % --inst_sel_renew solver % 61.94/62.16 % --inst_lit_activity_flag true % 61.94/62.16 % --inst_out_proof true % 61.94/62.16 % 61.94/62.16 % ------ Resolution Options % 61.94/62.16 % 61.94/62.16 % --resolution_flag true % 61.94/62.16 % --res_lit_sel kbo_max % 61.94/62.16 % --res_to_prop_solver none % 61.94/62.16 % --res_prop_simpl_new false % 61.94/62.16 % --res_prop_simpl_given false % 61.94/62.16 % --res_passive_queue_type priority_queues % 61.94/62.16 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 61.94/62.16 % --res_passive_queues_freq [15;5] % 61.94/62.16 % --res_forward_subs full % 61.94/62.16 % --res_backward_subs full % 61.94/62.16 % --res_forward_subs_resolution true % 61.94/62.16 % --res_backward_subs_resolution true % 61.94/62.16 % --res_orphan_elimination false % 61.94/62.16 % --res_time_limit 1000. % 61.94/62.16 % --res_out_proof true % 61.94/62.16 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_68a3f0.s % 61.94/62.16 % --modulo true % 61.94/62.16 % 61.94/62.16 % ------ Combination Options % 61.94/62.16 % 61.94/62.16 % --comb_res_mult 1000 % 61.94/62.16 % --comb_inst_mult 300 % 61.94/62.16 % ------ % 61.94/62.16 % 61.94/62.16 % 61.94/62.16 % 61.94/62.16 % ------ Proving... % 61.94/62.16 % warning: shown sat in sat incomplete mode % 61.94/62.16 % % 61.94/62.16 % 61.94/62.16 % 61.94/62.16 ------ Building Model...Done % 61.94/62.16 % 61.94/62.16 %------ The model is defined over ground terms (initial term algebra). % 61.94/62.16 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 61.94/62.16 %------ where \phi is a formula over the term algebra. % 61.94/62.16 %------ If we have equality in the problem then it is also defined as a predicate above, % 61.94/62.16 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 61.94/62.16 %------ See help for --sat_out_model for different model outputs. % 61.94/62.16 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 61.94/62.16 %------ where the first argument stands for the sort ($i in the unsorted case) % 61.94/62.16 % 61.94/62.16 % 61.94/62.16 % 61.94/62.16 % 61.94/62.16 %------ Positive definition of epred1_0 % 61.94/62.16 fof(lit_def,axiom, % 61.94/62.16 ( epred1_0 <=> % 61.94/62.16 $true % 61.94/62.16 ) % 61.94/62.16 ). % 61.94/62.16 % 61.94/62.16 %------ Negative definition of actual_world % 61.94/62.16 fof(lit_def,axiom, % 61.94/62.16 (! [X0] : % 61.94/62.16 ( ~(actual_world(X0)) <=> % 61.94/62.16 $false % 61.94/62.16 ) % 61.94/62.16 ) % 61.94/62.16 ). % 61.94/62.16 % 61.94/62.16 %------ Positive definition of group % 61.94/62.16 fof(lit_def,axiom, % 61.94/62.16 (! [X0,X1] : % 61.94/62.16 ( group(X0,X1) <=> % 61.94/62.16 ( % 61.94/62.16 ( % 61.94/62.16 ( X0=sk2_esk17_0 & X1=sk2_esk24_0 ) % 61.94/62.16 ) % 61.94/62.16 % 61.94/62.16 | % 61.94/62.16 ( % 61.94/62.16 ( X0=sk2_esk17_0 & X1=sk2_esk27_0 ) % 61.94/62.16 ) % 61.94/62.16 % 61.94/62.16 | % 61.94/62.16 ( % 61.94/62.16 ( X0=sk2_esk17_0 & X1=sk2_esk18_0 ) % 61.94/62.16 ) % 61.94/62.16 % 61.94/62.16 ) % 61.94/62.16 ) % 61.94/62.16 ) % 61.94/62.16 ). % 61.94/62.16 % 61.94/62.16 %------ Positive definition of frontseat % 61.94/62.16 fof(lit_def,axiom, % 61.94/62.16 (! [X0,X1] : % 61.94/62.16 ( frontseat(X0,X1) <=> % 61.94/62.16 ( % 61.94/62.16 ( % 61.94/62.16 ( X0=sk2_esk17_0 & X1=sk2_esk19_0 ) % 61.94/62.16 ) % 61.94/62.16 % 61.94/62.16 ) % 61.94/62.16 ) % 61.94/62.16 ) % 61.94/62.16 ). % 61.94/62.16 % 61.94/62.16 %------ Negative definition of of % 61.94/62.16 fof(lit_def,axiom, % 61.94/62.16 (! [X0,X1,X2] : % 61.94/62.16 ( ~(of(X0,X1,X2)) <=> % 61.94/62.16 $false % 61.94/62.16 ) % 61.94/62.16 ) % 61.94/62.16 ). % 61.94/62.16 % 61.94/62.16 %------ Negative definition of city % 61.94/62.16 fof(lit_def,axiom, % 61.94/62.16 (! [X0,X1] : % 61.94/62.16 ( ~(city(X0,X1)) <=> % 61.94/62.16 $false % 61.94/62.16 ) % 61.94/62.16 ) % 61.94/62.16 ). % 61.94/62.16 % 61.94/62.16 %------ Negative definition of hollywood_placename % 61.94/62.16 fof(lit_def,axiom, % 61.94/62.16 (! [X0,X1] : % 61.94/62.16 ( ~(hollywood_placename(X0,X1)) <=> % 61.94/62.16 $false % 61.94/62.16 ) % 61.94/62.16 ) % 61.94/62.16 ). % 61.94/62.16 % 61.94/62.16 %------ Negative definition of placename % 61.94/62.16 fof(lit_def,axiom, % 61.94/62.16 (! [X0,X1] : % 61.94/62.16 ( ~(placename(X0,X1)) <=> % 61.94/62.16 $false % 61.94/62.16 ) % 61.94/62.16 ) % 61.94/62.16 ). % 61.94/62.16 % 61.94/62.16 %------ Positive definition of chevy % 61.94/62.16 fof(lit_def,axiom, % 61.94/62.16 (! [X0,X1] : % 61.94/62.16 ( chevy(X0,X1) <=> % 61.94/62.16 ( % 61.94/62.16 ( % 61.94/62.16 ( X0=sk2_esk17_0 & X1=sk2_esk21_0 ) % 61.94/62.16 ) % 61.94/62.16 % 61.94/62.16 ) % 61.94/62.16 ) % 61.94/62.16 ) % 61.94/62.16 ). % 61.94/62.16 % 61.94/62.16 %------ Negative definition of white % 61.94/62.16 fof(lit_def,axiom, % 61.94/62.16 (! [X0,X1] : % 61.94/62.17 ( ~(white(X0,X1)) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Negative definition of dirty % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1] : % 61.94/62.17 ( ~(dirty(X0,X1)) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Negative definition of old % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1] : % 61.94/62.17 ( ~(old(X0,X1)) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Negative definition of street % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1] : % 61.94/62.17 ( ~(street(X0,X1)) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Negative definition of lonely % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1] : % 61.94/62.17 ( ~(lonely(X0,X1)) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of event % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1] : % 61.94/62.17 ( event(X0,X1) <=> % 61.94/62.17 ( % 61.94/62.17 ( % 61.94/62.17 ( X0=sk2_esk17_0 & X1=sk2_esk23_0 ) % 61.94/62.17 ) % 61.94/62.17 % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Negative definition of agent % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2] : % 61.94/62.17 ( ~(agent(X0,X1,X2)) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of present % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1] : % 61.94/62.17 ( present(X0,X1) <=> % 61.94/62.17 ( % 61.94/62.17 ( % 61.94/62.17 ( X0=sk2_esk17_0 & X1=sk2_esk23_0 ) % 61.94/62.17 ) % 61.94/62.17 % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Negative definition of barrel % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1] : % 61.94/62.17 ( ~(barrel(X0,X1)) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Negative definition of down % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2] : % 61.94/62.17 ( ~(down(X0,X1,X2)) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Negative definition of in % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2] : % 61.94/62.17 ( ~(in(X0,X1,X2)) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of two % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1] : % 61.94/62.17 ( two(X0,X1) <=> % 61.94/62.17 ( % 61.94/62.17 ( % 61.94/62.17 ( X0=sk2_esk17_0 & X1=sk2_esk24_0 ) % 61.94/62.17 ) % 61.94/62.17 % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of wear % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1] : % 61.94/62.17 ( wear(X0,X1) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of nonreflexive % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1] : % 61.94/62.17 ( nonreflexive(X0,X1) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of member % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2] : % 61.94/62.17 ( member(X0,X1,X2) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of epred2_0 % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 ( epred2_0 <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP0_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP3_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP5_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 61.94/62.17 ( sP5_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP6_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP8_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 61.94/62.17 ( sP8_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP9_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP12_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP14_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP14_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP16_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP16_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP19_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP22_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP22_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP25_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP25_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP27_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP27_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP29_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 61.94/62.17 ( sP29_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP30_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP33_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP33_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP35_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP35_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $false % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP36_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP36_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP39_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP39_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP41_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP41_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP43_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP43_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP46_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP46_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP49_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP49_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 %------ Positive definition of sP52_iProver_split % 61.94/62.17 fof(lit_def,axiom, % 61.94/62.17 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 61.94/62.17 ( sP52_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 61.94/62.17 $true % 61.94/62.17 ) % 61.94/62.17 ) % 61.94/62.17 ). % 61.94/62.17 % 61.94/62.17 % 61.94/62.17 % 61.94/62.17 % ------ Statistics % 61.94/62.17 % 61.94/62.17 % ------ General % 61.94/62.17 % 61.94/62.17 % num_of_input_clauses: 121 % 61.94/62.17 % num_of_input_neg_conjectures: 1 % 61.94/62.17 % num_of_splits: 54 % 61.94/62.17 % num_of_split_atoms: 54 % 61.94/62.17 % num_of_sem_filtered_clauses: 0 % 61.94/62.17 % num_of_subtypes: 0 % 61.94/62.17 % monotx_restored_types: 0 % 61.94/62.17 % sat_num_of_epr_types: 0 % 61.94/62.17 % sat_num_of_non_cyclic_types: 0 % 61.94/62.17 % sat_guarded_non_collapsed_types: 0 % 61.94/62.17 % is_epr: 0 % 61.94/62.17 % is_horn: 0 % 61.94/62.17 % has_eq: 0 % 61.94/62.17 % num_pure_diseq_elim: 0 % 61.94/62.17 % simp_replaced_by: 0 % 61.94/62.17 % res_preprocessed: 176 % 61.94/62.17 % prep_upred: 0 % 61.94/62.17 % prep_unflattend: 0 % 61.94/62.17 % pred_elim_cands: 85 % 61.94/62.17 % pred_elim: 17 % 61.94/62.17 % pred_elim_cl: 17 % 61.94/62.17 % pred_elim_cycles: 80 % 61.94/62.17 % forced_gc_time: 0 % 61.94/62.17 % gc_basic_clause_elim: 0 % 61.94/62.17 % parsing_time: 0.012 % 61.94/62.17 % sem_filter_time: 0. % 61.94/62.17 % pred_elim_time: 0.176 % 61.94/62.17 % out_proof_time: 0. % 61.94/62.17 % monotx_time: 0. % 61.94/62.17 % subtype_inf_time: 0. % 61.94/62.17 % unif_index_cands_time: 0.029 % 61.94/62.17 % unif_index_add_time: 0.031 % 61.94/62.17 % total_time: 31.902 % 61.94/62.17 % num_of_symbols: 145 % 61.94/62.17 % num_of_terms: 27813 % 61.94/62.17 % 61.94/62.17 % ------ Propositional Solver % 61.94/62.17 % 61.94/62.17 % prop_solver_calls: 20 % 61.94/62.17 % prop_fast_solver_calls: 6937 % 61.94/62.17 % prop_num_of_clauses: 8128 % 61.94/62.17 % prop_preprocess_simplified: 10849 % 61.94/62.17 % prop_fo_subsumed: 112 % 61.94/62.17 % prop_solver_time: 0.001 % 61.94/62.17 % prop_fast_solver_time: 0.009 % 61.94/62.17 % prop_unsat_core_time: 0. % 61.94/62.17 % 61.94/62.17 % ------ QBF % 61.94/62.17 % 61.94/62.17 % qbf_q_res: 0 % 61.94/62.17 % qbf_num_tautologies: 0 % 61.94/62.17 % qbf_prep_cycles: 0 % 61.94/62.17 % 61.94/62.17 % ------ BMC1 % 61.94/62.17 % 61.94/62.17 % bmc1_current_bound: -1 % 61.94/62.17 % bmc1_last_solved_bound: -1 % 61.94/62.17 % bmc1_unsat_core_size: -1 % 61.94/62.17 % bmc1_unsat_core_parents_size: -1 % 61.94/62.17 % bmc1_merge_next_fun: 0 % 61.94/62.17 % bmc1_unsat_core_clauses_time: 0. % 61.94/62.17 % 61.94/62.17 % ------ Instantiation % 61.94/62.17 % 61.94/62.17 % inst_num_of_clauses: 1256 % 61.94/62.17 % inst_num_in_passive: 0 % 61.94/62.17 % inst_num_in_active: 1256 % 61.94/62.17 % inst_num_in_unprocessed: 0 % 61.94/62.17 % inst_num_of_loops: 1260 % 61.94/62.17 % inst_num_of_learning_restarts: 1 % 61.94/62.17 % inst_num_moves_active_passive: 0 % 61.94/62.17 % inst_lit_activity: 397 % 61.94/62.17 % inst_lit_activity_moves: 0 % 61.94/62.17 % inst_num_tautologies: 0 % 61.94/62.17 % inst_num_prop_implied: 0 % 61.94/62.17 % inst_num_existing_simplified: 0 % 61.94/62.17 % inst_num_eq_res_simplified: 0 % 61.94/62.17 % inst_num_child_elim: 0 % 61.94/62.17 % inst_num_of_dismatching_blockings: 0 % 61.94/62.17 % inst_num_of_non_proper_insts: 1098 % 61.94/62.17 % inst_num_of_duplicates: 0 % 61.94/62.17 % inst_inst_num_from_inst_to_res: 0 % 61.94/62.17 % inst_dismatching_checking_time: 0.003 % 61.94/62.17 % 61.94/62.17 % ------ Resolution % 61.94/62.17 % 61.94/62.17 % res_num_of_clauses: 38724 % 61.94/62.17 % res_num_in_passive: 27521 % 61.94/62.17 % res_num_in_active: 11291 % 61.94/62.17 % res_num_of_loops: 15000 % 61.94/62.17 % res_forward_subset_subsumed: 31133 % 61.94/62.17 % res_backward_subset_subsumed: 532 % 61.94/62.17 % res_forward_subsumed: 0 % 61.94/62.17 % res_backward_subsumed: 0 % 61.94/62.17 % res_forward_subsumption_resolution: 16987 % 61.94/62.17 % res_backward_subsumption_resolution: 32 % 61.94/62.17 % res_clause_to_clause_subsumption: 63093 % 61.94/62.17 % res_orphan_elimination: 0 % 61.94/62.17 % res_tautology_del: 15600 % 61.94/62.17 % res_num_eq_res_simplified: 0 % 61.94/62.17 % res_num_sel_changes: 0 % 61.94/62.17 % res_moves_from_active_to_pass: 0 % 61.94/62.17 % 61.94/62.17 % Status Unknown % 61.94/62.17 % Last status : % 61.94/62.17 % SZS status Unknown %------------------------------------------------------------------------------