%------------------------------------------------------------------------------ % File : iProverMo---2.5-0.1 % Problem : NLP199-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : iprover_modulo %s %d % Computer : n014.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:42:14 EDT 2022 % Result : Unknown 4.12s 4.36s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NLP199-1 : TPTP v8.1.0. Released v2.4.0. % 0.07/0.13 % Command : iprover_modulo %s %d % 0.13/0.34 % Computer : n014.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jul 1 09:04:11 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.35 % Running in mono-core mode % 0.20/0.42 % Orienting using strategy Equiv(ClausalAll) % 0.20/0.42 % Orientation found % 0.20/0.42 % 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_86d5f6.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_713bcf.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_ba4b56 | grep -v "SZS" % 0.20/0.44 % 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 0.20/0.44 % 0.20/0.44 % % 0.20/0.44 % ------ iProver source info % 0.20/0.44 % 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 0.20/0.44 % git: non_committed_changes: true % 0.20/0.44 % git: last_make_outside_of_git: true % 0.20/0.44 % 0.20/0.44 % % 0.20/0.44 % ------ Input Options % 0.20/0.44 % 0.20/0.44 % --out_options all % 0.20/0.44 % --tptp_safe_out true % 0.20/0.44 % --problem_path "" % 0.20/0.44 % --include_path "" % 0.20/0.44 % --clausifier .//eprover % 0.20/0.44 % --clausifier_options --tstp-format % 0.20/0.44 % --stdin false % 0.20/0.44 % --dbg_backtrace false % 0.20/0.44 % --dbg_dump_prop_clauses false % 0.20/0.44 % --dbg_dump_prop_clauses_file - % 0.20/0.44 % --dbg_out_stat false % 0.20/0.44 % 0.20/0.44 % ------ General Options % 0.20/0.44 % 0.20/0.44 % --fof false % 0.20/0.44 % --time_out_real 150. % 0.20/0.44 % --time_out_prep_mult 0.2 % 0.20/0.44 % --time_out_virtual -1. % 0.20/0.44 % --schedule none % 0.20/0.44 % --ground_splitting input % 0.20/0.44 % --splitting_nvd 16 % 0.20/0.44 % --non_eq_to_eq false % 0.20/0.44 % --prep_gs_sim true % 0.20/0.44 % --prep_unflatten false % 0.20/0.44 % --prep_res_sim true % 0.20/0.44 % --prep_upred true % 0.20/0.44 % --res_sim_input true % 0.20/0.44 % --clause_weak_htbl true % 0.20/0.44 % --gc_record_bc_elim false % 0.20/0.44 % --symbol_type_check false % 0.20/0.44 % --clausify_out false % 0.20/0.44 % --large_theory_mode false % 0.20/0.44 % --prep_sem_filter none % 0.20/0.44 % --prep_sem_filter_out false % 0.20/0.44 % --preprocessed_out false % 0.20/0.44 % --sub_typing false % 0.20/0.44 % --brand_transform false % 0.20/0.44 % --pure_diseq_elim true % 0.20/0.44 % --min_unsat_core false % 0.20/0.44 % --pred_elim true % 0.20/0.44 % --add_important_lit false % 0.20/0.44 % --soft_assumptions false % 0.20/0.44 % --reset_solvers false % 0.20/0.44 % --bc_imp_inh [] % 0.20/0.44 % --conj_cone_tolerance 1.5 % 0.20/0.44 % --prolific_symb_bound 500 % 0.20/0.44 % --lt_threshold 2000 % 0.20/0.44 % 0.20/0.44 % ------ SAT Options % 0.20/0.44 % 0.20/0.44 % --sat_mode false % 0.20/0.44 % --sat_fm_restart_options "" % 0.20/0.44 % --sat_gr_def false % 0.20/0.44 % --sat_epr_types true % 0.20/0.44 % --sat_non_cyclic_types false % 0.20/0.44 % --sat_finite_models false % 0.20/0.44 % --sat_fm_lemmas false % 0.20/0.44 % --sat_fm_prep false % 0.20/0.44 % --sat_fm_uc_incr true % 0.20/0.44 % --sat_out_model small % 0.20/0.44 % --sat_out_clauses false % 0.20/0.44 % 0.20/0.44 % ------ QBF Options % 0.20/0.44 % 0.20/0.44 % --qbf_mode false % 0.20/0.44 % --qbf_elim_univ true % 0.20/0.44 % --qbf_sk_in true % 0.20/0.44 % --qbf_pred_elim true % 0.20/0.44 % --qbf_split 32 % 0.20/0.44 % 0.20/0.44 % ------ BMC1 Options % 0.20/0.44 % 0.20/0.44 % --bmc1_incremental false % 0.20/0.44 % --bmc1_axioms reachable_all % 0.20/0.44 % --bmc1_min_bound 0 % 0.20/0.44 % --bmc1_max_bound -1 % 0.20/0.44 % --bmc1_max_bound_default -1 % 0.20/0.44 % --bmc1_symbol_reachability true % 0.20/0.44 % --bmc1_property_lemmas false % 0.20/0.44 % --bmc1_k_induction false % 0.20/0.44 % --bmc1_non_equiv_states false % 0.20/0.44 % --bmc1_deadlock false % 0.20/0.44 % --bmc1_ucm false % 0.20/0.44 % --bmc1_add_unsat_core none % 0.20/0.44 % --bmc1_unsat_core_children false % 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false % 0.20/0.44 % --bmc1_out_stat full % 0.20/0.44 % --bmc1_ground_init false % 0.20/0.44 % --bmc1_pre_inst_next_state false % 0.20/0.44 % --bmc1_pre_inst_state false % 0.20/0.44 % --bmc1_pre_inst_reach_state false % 0.20/0.44 % --bmc1_out_unsat_core false % 0.20/0.44 % --bmc1_aig_witness_out false % 0.20/0.44 % --bmc1_verbose false % 0.20/0.44 % --bmc1_dump_clauses_tptp false % 0.20/0.57 % --bmc1_dump_unsat_core_tptp false % 0.20/0.57 % --bmc1_dump_file - % 0.20/0.57 % --bmc1_ucm_expand_uc_limit 128 % 0.20/0.57 % --bmc1_ucm_n_expand_iterations 6 % 0.20/0.57 % --bmc1_ucm_extend_mode 1 % 0.20/0.57 % --bmc1_ucm_init_mode 2 % 0.20/0.57 % --bmc1_ucm_cone_mode none % 0.20/0.57 % --bmc1_ucm_reduced_relation_type 0 % 0.20/0.57 % --bmc1_ucm_relax_model 4 % 0.20/0.57 % --bmc1_ucm_full_tr_after_sat true % 0.20/0.57 % --bmc1_ucm_expand_neg_assumptions false % 0.20/0.57 % --bmc1_ucm_layered_model none % 0.20/0.57 % --bmc1_ucm_max_lemma_size 10 % 0.20/0.57 % 0.20/0.57 % ------ AIG Options % 0.20/0.57 % 0.20/0.57 % --aig_mode false % 0.20/0.57 % 0.20/0.57 % ------ Instantiation Options % 0.20/0.57 % 0.20/0.57 % --instantiation_flag true % 0.20/0.57 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.20/0.57 % --inst_solver_per_active 750 % 0.20/0.57 % --inst_solver_calls_frac 0.5 % 0.20/0.57 % --inst_passive_queue_type priority_queues % 0.20/0.57 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.20/0.57 % --inst_passive_queues_freq [25;2] % 0.20/0.57 % --inst_dismatching true % 0.20/0.57 % --inst_eager_unprocessed_to_passive true % 0.20/0.57 % --inst_prop_sim_given true % 0.20/0.57 % --inst_prop_sim_new false % 0.20/0.57 % --inst_orphan_elimination true % 0.20/0.57 % --inst_learning_loop_flag true % 0.20/0.57 % --inst_learning_start 3000 % 0.20/0.57 % --inst_learning_factor 2 % 0.20/0.57 % --inst_start_prop_sim_after_learn 3 % 0.20/0.57 % --inst_sel_renew solver % 0.20/0.57 % --inst_lit_activity_flag true % 0.20/0.57 % --inst_out_proof true % 0.20/0.57 % 0.20/0.57 % ------ Resolution Options % 0.20/0.57 % 0.20/0.57 % --resolution_flag true % 0.20/0.57 % --res_lit_sel kbo_max % 0.20/0.57 % --res_to_prop_solver none % 0.20/0.57 % --res_prop_simpl_new false % 0.20/0.57 % --res_prop_simpl_given false % 0.20/0.57 % --res_passive_queue_type priority_queues % 0.20/0.57 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 0.20/0.57 % --res_passive_queues_freq [15;5] % 0.20/0.57 % --res_forward_subs full % 0.20/0.57 % --res_backward_subs full % 0.20/0.57 % --res_forward_subs_resolution true % 0.20/0.57 % --res_backward_subs_resolution true % 0.20/0.57 % --res_orphan_elimination false % 0.20/0.57 % --res_time_limit 1000. % 0.20/0.57 % --res_out_proof true % 0.20/0.57 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_86d5f6.s % 0.20/0.57 % --modulo true % 0.20/0.57 % 0.20/0.57 % ------ Combination Options % 0.20/0.57 % 0.20/0.57 % --comb_res_mult 1000 % 0.20/0.57 % --comb_inst_mult 300 % 0.20/0.57 % ------ % 0.20/0.57 % 0.20/0.57 % ------ Parsing...% successful % 0.20/0.57 % 0.20/0.57 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 24 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e % % 0.20/0.57 % 0.20/0.57 % ------ Proving... % 0.20/0.57 % ------ Problem Properties % 0.20/0.57 % 0.20/0.57 % % 0.20/0.57 % EPR false % 0.20/0.57 % Horn false % 0.20/0.57 % Has equality false % 0.20/0.57 % 0.20/0.57 % % ------ Input Options Time Limit: Unbounded % 0.20/0.57 % 0.20/0.57 % 0.20/0.57 % % ------ Current options: % 0.20/0.57 % 0.20/0.57 % ------ Input Options % 0.20/0.57 % 0.20/0.57 % --out_options all % 0.20/0.57 % --tptp_safe_out true % 0.20/0.57 % --problem_path "" % 0.20/0.57 % --include_path "" % 0.20/0.57 % --clausifier .//eprover % 0.20/0.57 % --clausifier_options --tstp-format % 0.20/0.57 % --stdin false % 0.20/0.57 % --dbg_backtrace false % 0.20/0.57 % --dbg_dump_prop_clauses false % 0.20/0.57 % --dbg_dump_prop_clauses_file - % 0.20/0.57 % --dbg_out_stat false % 0.20/0.57 % 0.20/0.57 % ------ General Options % 0.20/0.57 % 0.20/0.57 % --fof false % 0.20/0.57 % --time_out_real 150. % 0.20/0.57 % --time_out_prep_mult 0.2 % 0.20/0.57 % --time_out_virtual -1. % 0.20/0.57 % --schedule none % 0.20/0.57 % --ground_splitting input % 0.20/0.57 % --splitting_nvd 16 % 0.20/0.57 % --non_eq_to_eq false % 0.20/0.57 % --prep_gs_sim true % 0.20/0.57 % --prep_unflatten false % 0.20/0.57 % --prep_res_sim true % 0.20/0.57 % --prep_upred true % 0.20/0.57 % --res_sim_input true % 0.20/0.57 % --clause_weak_htbl true % 0.20/0.57 % --gc_record_bc_elim false % 0.20/0.57 % --symbol_type_check false % 0.20/0.57 % --clausify_out false % 0.20/0.57 % --large_theory_mode false % 0.20/0.57 % --prep_sem_filter none % 0.20/0.57 % --prep_sem_filter_out false % 0.20/0.57 % --preprocessed_out false % 0.20/0.57 % --sub_typing false % 0.20/0.57 % --brand_transform false % 0.20/0.57 % --pure_diseq_elim true % 0.20/0.57 % --min_unsat_core false % 0.20/0.57 % --pred_elim true % 0.20/0.57 % --add_important_lit false % 0.20/0.57 % --soft_assumptions false % 0.20/0.57 % --reset_solvers false % 0.20/0.57 % --bc_imp_inh [] % 0.20/0.57 % --conj_cone_tolerance 1.5 % 0.20/0.57 % --prolific_symb_bound 500 % 0.20/0.57 % --lt_threshold 2000 % 0.20/0.57 % 0.20/0.57 % ------ SAT Options % 0.20/0.57 % 0.20/0.57 % --sat_mode false % 0.20/0.57 % --sat_fm_restart_options "" % 0.20/0.57 % --sat_gr_def false % 0.20/0.57 % --sat_epr_types true % 0.20/0.57 % --sat_non_cyclic_types false % 0.20/0.57 % --sat_finite_models false % 0.20/0.57 % --sat_fm_lemmas false % 0.20/0.57 % --sat_fm_prep false % 0.20/0.57 % --sat_fm_uc_incr true % 0.20/0.57 % --sat_out_model small % 0.20/0.57 % --sat_out_clauses false % 0.20/0.57 % 0.20/0.57 % ------ QBF Options % 0.20/0.57 % 0.20/0.57 % --qbf_mode false % 0.20/0.57 % --qbf_elim_univ true % 0.20/0.57 % --qbf_sk_in true % 0.20/0.57 % --qbf_pred_elim true % 0.20/0.57 % --qbf_split 32 % 0.20/0.57 % 0.20/0.57 % ------ BMC1 Options % 0.20/0.57 % 0.20/0.57 % --bmc1_incremental false % 0.20/0.57 % --bmc1_axioms reachable_all % 0.20/0.57 % --bmc1_min_bound 0 % 0.20/0.57 % --bmc1_max_bound -1 % 0.20/0.57 % --bmc1_max_bound_default -1 % 0.20/0.57 % --bmc1_symbol_reachability true % 0.20/0.57 % --bmc1_property_lemmas false % 0.20/0.57 % --bmc1_k_induction false % 0.20/0.57 % --bmc1_non_equiv_states false % 0.20/0.57 % --bmc1_deadlock false % 0.20/0.57 % --bmc1_ucm false % 0.20/0.57 % --bmc1_add_unsat_core none % 0.20/0.57 % --bmc1_unsat_core_children false % 0.20/0.57 % --bmc1_unsat_core_extrapolate_axioms false % 0.20/0.57 % --bmc1_out_stat full % 0.20/0.57 % --bmc1_ground_init false % 0.20/0.57 % --bmc1_pre_inst_next_state false % 0.20/0.57 % --bmc1_pre_inst_state false % 0.20/0.57 % --bmc1_pre_inst_reach_state false % 0.20/0.57 % --bmc1_out_unsat_core false % 0.20/0.57 % --bmc1_aig_witness_out false % 0.20/0.57 % --bmc1_verbose false % 0.20/0.57 % --bmc1_dump_clauses_tptp false % 0.20/0.57 % --bmc1_dump_unsat_core_tptp false % 0.20/0.57 % --bmc1_dump_file - % 0.20/0.57 % --bmc1_ucm_expand_uc_limit 128 % 0.20/0.57 % --bmc1_ucm_n_expand_iterations 6 % 0.20/0.57 % --bmc1_ucm_extend_mode 1 % 0.20/0.57 % --bmc1_ucm_init_mode 2 % 0.20/0.57 % --bmc1_ucm_cone_mode none % 0.20/0.57 % --bmc1_ucm_reduced_relation_type 0 % 0.20/0.57 % --bmc1_ucm_relax_model 4 % 0.20/0.57 % --bmc1_ucm_full_tr_after_sat true % 0.20/0.57 % --bmc1_ucm_expand_neg_assumptions false % 0.20/0.57 % --bmc1_ucm_layered_model none % 0.20/0.57 % --bmc1_ucm_max_lemma_size 10 % 0.20/0.57 % 0.20/0.57 % ------ AIG Options % 0.20/0.57 % 0.20/0.57 % --aig_mode false % 0.20/0.57 % 0.20/0.57 % ------ Instantiation Options % 0.20/0.57 % 0.20/0.57 % --instantiation_flag true % 0.20/0.57 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.20/0.57 % --inst_solver_per_active 750 % 0.20/0.57 % --inst_solver_calls_frac 0.5 % 0.20/0.57 % --inst_passive_queue_type priority_queues % 0.20/0.57 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.20/0.57 % --inst_passive_queues_freq [25;2] % 0.20/0.57 % --inst_dismatching true % 0.20/0.57 % --inst_eager_unprocessed_to_passive true % 2.24/2.45 % --inst_prop_sim_given true % 2.24/2.45 % --inst_prop_sim_new false % 2.24/2.45 % --inst_orphan_elimination true % 2.24/2.45 % --inst_learning_loop_flag true % 2.24/2.45 % --inst_learning_start 3000 % 2.24/2.45 % --inst_learning_factor 2 % 2.24/2.45 % --inst_start_prop_sim_after_learn 3 % 2.24/2.45 % --inst_sel_renew solver % 2.24/2.45 % --inst_lit_activity_flag true % 2.24/2.45 % --inst_out_proof true % 2.24/2.45 % 2.24/2.45 % ------ Resolution Options % 2.24/2.45 % 2.24/2.45 % --resolution_flag true % 2.24/2.45 % --res_lit_sel kbo_max % 2.24/2.45 % --res_to_prop_solver none % 2.24/2.45 % --res_prop_simpl_new false % 2.24/2.45 % --res_prop_simpl_given false % 2.24/2.45 % --res_passive_queue_type priority_queues % 2.24/2.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 2.24/2.45 % --res_passive_queues_freq [15;5] % 2.24/2.45 % --res_forward_subs full % 2.24/2.45 % --res_backward_subs full % 2.24/2.45 % --res_forward_subs_resolution true % 2.24/2.45 % --res_backward_subs_resolution true % 2.24/2.45 % --res_orphan_elimination false % 2.24/2.45 % --res_time_limit 1000. % 2.24/2.45 % --res_out_proof true % 2.24/2.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_86d5f6.s % 2.24/2.45 % --modulo true % 2.24/2.45 % 2.24/2.45 % ------ Combination Options % 2.24/2.45 % 2.24/2.45 % --comb_res_mult 1000 % 2.24/2.45 % --comb_inst_mult 300 % 2.24/2.45 % ------ % 2.24/2.45 % 2.24/2.45 % 2.24/2.45 % 2.24/2.45 % ------ Proving... % 2.24/2.45 % warning: shown sat in sat incomplete mode % 2.24/2.45 % % 2.24/2.45 % 2.24/2.45 % 2.24/2.45 ------ Building Model...Done % 2.24/2.45 % 2.24/2.45 %------ The model is defined over ground terms (initial term algebra). % 2.24/2.45 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 2.24/2.45 %------ where \phi is a formula over the term algebra. % 2.24/2.45 %------ If we have equality in the problem then it is also defined as a predicate above, % 2.24/2.45 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 2.24/2.45 %------ See help for --sat_out_model for different model outputs. % 2.24/2.45 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 2.24/2.45 %------ where the first argument stands for the sort ($i in the unsorted case) % 2.24/2.45 % 2.24/2.45 % 2.24/2.45 % 2.24/2.45 % 2.24/2.45 %------ Positive definition of ssSkC0 % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 ( ssSkC0 <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of actual_world % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0] : % 2.24/2.45 ( ~(actual_world(X0)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of state % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( state(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc73 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of of % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( ~(of(X0,X1,X2)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of man % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( man(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc75 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of be % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2,X3] : % 2.24/2.45 ( ~(be(X0,X1,X2,X3)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of forename % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( forename(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc74 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of jules_forename % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( ~(jules_forename(X0,X1)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of wheel % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( wheel(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc72 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of behind % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( ~(behind(X0,X1,X2)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of frontseat % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( frontseat(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc78 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of ssSkP1 % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( ssSkP1(X0,X1,X2) <=> % 2.24/2.45 $true % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of ssSkP2 % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( ssSkP2(X0,X1,X2) <=> % 2.24/2.45 $true % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of ssSkP0 % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( ssSkP0(X0,X1) <=> % 2.24/2.45 $true % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of group % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( group(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc76 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 | % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc77 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of two % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( two(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc77 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of coat % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( coat(X0,X1) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of hollywood_placename % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( hollywood_placename(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc81 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of placename % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( ~(placename(X0,X1)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of in % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( in(X0,X1,X2) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc79 & X2=skc80 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of down % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( ~(down(X0,X1,X2)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of lonely % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( lonely(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc80 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of street % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( ~(street(X0,X1)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of city % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( ~(city(X0,X1)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of agent % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( ~(agent(X0,X1,X2)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of old % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( old(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc82 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of dirty % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( ~(dirty(X0,X1)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of white % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( ~(white(X0,X1)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of chevy % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( chevy(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc82 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of event % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( event(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc79 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Negative definition of present % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( ~(present(X0,X1)) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of barrel % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1] : % 2.24/2.45 ( barrel(X0,X1) <=> % 2.24/2.45 ( % 2.24/2.45 ( % 2.24/2.45 ( X0=skc71 & X1=skc79 ) % 2.24/2.45 ) % 2.24/2.45 % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of member % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( member(X0,X1,X2) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of sP2_iProver_split % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( sP2_iProver_split(X0,X1,X2) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of sP5_iProver_split % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( sP5_iProver_split(X0,X1,X2) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of sP7_iProver_split % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2,X3,X4,X5] : % 2.24/2.45 ( sP7_iProver_split(X0,X1,X2,X3,X4,X5) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of sP8_iProver_split % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( sP8_iProver_split(X0,X1,X2) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of sP10_iProver_split % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2,X3,X4,X5] : % 2.24/2.45 ( sP10_iProver_split(X0,X1,X2,X3,X4,X5) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of sP11_iProver_split % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( sP11_iProver_split(X0,X1,X2) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of sP14_iProver_split % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( sP14_iProver_split(X0,X1,X2) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of sP17_iProver_split % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( sP17_iProver_split(X0,X1,X2) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of sP19_iProver_split % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2,X3,X4,X5] : % 2.24/2.45 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of sP20_iProver_split % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( sP20_iProver_split(X0,X1,X2) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of sP22_iProver_split % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2,X3,X4,X5] : % 2.24/2.45 ( sP22_iProver_split(X0,X1,X2,X3,X4,X5) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 %------ Positive definition of sP23_iProver_split % 2.24/2.45 fof(lit_def,axiom, % 2.24/2.45 (! [X0,X1,X2] : % 2.24/2.45 ( sP23_iProver_split(X0,X1,X2) <=> % 2.24/2.45 $false % 2.24/2.45 ) % 2.24/2.45 ) % 2.24/2.45 ). % 2.24/2.45 % 2.24/2.45 % 2.24/2.45 % 2.24/2.45 % ------ Statistics % 2.24/2.45 % 2.24/2.45 % ------ General % 2.24/2.45 % 2.24/2.45 % num_of_input_clauses: 92 % 2.24/2.45 % num_of_input_neg_conjectures: 92 % 2.24/2.45 % num_of_splits: 24 % 2.24/2.45 % num_of_split_atoms: 24 % 2.24/2.45 % num_of_sem_filtered_clauses: 0 % 2.24/2.45 % num_of_subtypes: 0 % 2.24/2.45 % monotx_restored_types: 0 % 2.24/2.45 % sat_num_of_epr_types: 0 % 2.24/2.45 % sat_num_of_non_cyclic_types: 0 % 2.24/2.45 % sat_guarded_non_collapsed_types: 0 % 2.24/2.45 % is_epr: 0 % 2.24/2.45 % is_horn: 0 % 2.24/2.45 % has_eq: 0 % 2.24/2.45 % num_pure_diseq_elim: 0 % 2.24/2.45 % simp_replaced_by: 0 % 2.24/2.45 % res_preprocessed: 208 % 2.24/2.45 % prep_upred: 0 % 2.24/2.45 % prep_unflattend: 0 % 2.24/2.45 % pred_elim_cands: 24 % 2.24/2.45 % pred_elim: 8 % 2.24/2.45 % pred_elim_cl: 8 % 2.24/2.45 % pred_elim_cycles: 40 % 2.24/2.45 % forced_gc_time: 0 % 2.24/2.45 % gc_basic_clause_elim: 0 % 2.24/2.45 % parsing_time: 0.005 % 2.24/2.45 % sem_filter_time: 0. % 2.24/2.45 % pred_elim_time: 0.098 % 2.24/2.45 % out_proof_time: 0. % 2.24/2.45 % monotx_time: 0. % 2.24/2.45 % subtype_inf_time: 0. % 2.24/2.45 % unif_index_cands_time: 0.002 % 2.24/2.45 % unif_index_add_time: 0.001 % 2.24/2.45 % total_time: 2.023 % 2.24/2.45 % num_of_symbols: 122 % 2.24/2.45 % num_of_terms: 6296 % 2.24/2.45 % 2.24/2.45 % ------ Propositional Solver % 2.24/2.45 % 2.24/2.45 % prop_solver_calls: 3 % 2.24/2.45 % prop_fast_solver_calls: 2023 % 2.24/2.45 % prop_num_of_clauses: 408 % 2.24/2.45 % prop_preprocess_simplified: 1800 % 2.24/2.45 % prop_fo_subsumed: 0 % 2.24/2.45 % prop_solver_time: 0. % 2.24/2.45 % prop_fast_solver_time: 0.004 % 2.24/2.45 % prop_unsat_core_time: 0. % 2.24/2.45 % 2.24/2.45 % ------ QBF % 2.24/2.45 % 2.24/2.45 % qbf_q_res: 0 % 2.24/2.45 % qbf_num_tautologies: 0 % 2.24/2.45 % qbf_prep_cycles: 0 % 2.24/2.45 % 2.24/2.45 % ------ BMC1 % 2.24/2.45 % 2.24/2.45 % bmc1_current_bound: -1 % 2.24/2.45 % bmc1_last_solved_bound: -1 % 2.24/2.45 % bmc1_unsat_core_size: -1 % 2.24/2.45 % bmc1_unsat_core_parents_size: -1 % 2.24/2.45 % bmc1_merge_next_fun: 0 % 2.24/2.45 % bmc1_unsat_core_clauses_time: 0. % 2.24/2.45 % 2.24/2.45 % ------ Instantiation % 2.24/2.45 % 2.24/2.45 % inst_num_of_clauses: 188 % 2.24/2.45 % inst_num_in_passive: 0 % 2.24/2.45 % inst_num_in_active: 188 % 2.24/2.45 % inst_num_in_unprocessed: 0 % 2.24/2.45 % inst_num_of_loops: 195 % 2.24/2.45 % inst_num_of_learning_restarts: 0 % 2.24/2.45 % inst_num_moves_active_passive: 0 % 2.24/2.45 % inst_lit_activity: 38 % 2.24/2.45 % inst_lit_activity_moves: 0 % 2.24/2.45 % inst_num_tautologies: 0 % 2.24/2.45 % inst_num_prop_implied: 0 % 2.24/2.45 % inst_num_existing_simplified: 0 % 2.24/2.45 % inst_num_eq_res_simplified: 0 % 2.24/2.45 % inst_num_child_elim: 0 % 2.24/2.45 % inst_num_of_dismatching_blockings: 0 % 2.24/2.45 % inst_num_of_non_proper_insts: 76 % 2.24/2.45 % inst_num_of_duplicates: 0 % 2.24/2.45 % inst_inst_num_from_inst_to_res: 0 % 2.24/2.45 % inst_dismatching_checking_time: 0. % 2.24/2.45 % 2.24/2.45 % ------ Resolution % 2.24/2.45 % 2.24/2.45 % res_num_of_clauses: 21173 % 2.24/2.45 % res_num_in_passive: 20257 % 2.24/2.45 % res_num_in_active: 916 % 2.24/2.45 % res_num_of_loops: 1000 % 2.24/2.45 % res_forward_subset_subsumed: 19536 % 2.24/2.45 % res_backward_subset_subsumed: 0 % 2.24/2.45 % res_forward_subsumed: 82 % 2.24/2.45 % res_backward_subsumed: 2 % 2.24/2.45 % res_forward_subsumption_resolution: 102 % 2.24/2.45 % res_backward_subsumption_resolution: 0 % 2.24/2.45 % res_clause_to_clause_subsumption: 606 % 2.24/2.45 % res_orphan_elimination: 0 % 2.24/2.45 % res_tautology_del: 476 % 2.24/2.45 % res_num_eq_res_simplified: 0 % 2.24/2.45 % res_num_sel_changes: 0 % 2.24/2.45 % res_moves_from_active_to_pass: 0 % 2.24/2.45 % 2.24/2.45 % Status Unknown % 2.24/2.49 % Orienting using strategy ClausalAll % 2.24/2.49 % Orientation found % 2.24/2.49 % 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_86d5f6.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_713bcf.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_2bc556 | grep -v "SZS" % 2.34/2.51 % 2.34/2.51 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 2.34/2.51 % 2.34/2.51 % % 2.34/2.51 % ------ iProver source info % 2.34/2.51 % 2.34/2.51 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 2.34/2.51 % git: non_committed_changes: true % 2.34/2.51 % git: last_make_outside_of_git: true % 2.34/2.51 % 2.34/2.51 % % 2.34/2.51 % ------ Input Options % 2.34/2.51 % 2.34/2.51 % --out_options all % 2.34/2.51 % --tptp_safe_out true % 2.34/2.51 % --problem_path "" % 2.34/2.51 % --include_path "" % 2.34/2.51 % --clausifier .//eprover % 2.34/2.51 % --clausifier_options --tstp-format % 2.34/2.51 % --stdin false % 2.34/2.51 % --dbg_backtrace false % 2.34/2.51 % --dbg_dump_prop_clauses false % 2.34/2.51 % --dbg_dump_prop_clauses_file - % 2.34/2.51 % --dbg_out_stat false % 2.34/2.51 % 2.34/2.51 % ------ General Options % 2.34/2.51 % 2.34/2.51 % --fof false % 2.34/2.51 % --time_out_real 150. % 2.34/2.51 % --time_out_prep_mult 0.2 % 2.34/2.51 % --time_out_virtual -1. % 2.34/2.51 % --schedule none % 2.34/2.51 % --ground_splitting input % 2.34/2.51 % --splitting_nvd 16 % 2.34/2.51 % --non_eq_to_eq false % 2.34/2.51 % --prep_gs_sim true % 2.34/2.51 % --prep_unflatten false % 2.34/2.51 % --prep_res_sim true % 2.34/2.51 % --prep_upred true % 2.34/2.51 % --res_sim_input true % 2.34/2.51 % --clause_weak_htbl true % 2.34/2.51 % --gc_record_bc_elim false % 2.34/2.51 % --symbol_type_check false % 2.34/2.51 % --clausify_out false % 2.34/2.51 % --large_theory_mode false % 2.34/2.51 % --prep_sem_filter none % 2.34/2.51 % --prep_sem_filter_out false % 2.34/2.51 % --preprocessed_out false % 2.34/2.51 % --sub_typing false % 2.34/2.51 % --brand_transform false % 2.34/2.51 % --pure_diseq_elim true % 2.34/2.51 % --min_unsat_core false % 2.34/2.51 % --pred_elim true % 2.34/2.51 % --add_important_lit false % 2.34/2.51 % --soft_assumptions false % 2.34/2.51 % --reset_solvers false % 2.34/2.51 % --bc_imp_inh [] % 2.34/2.51 % --conj_cone_tolerance 1.5 % 2.34/2.51 % --prolific_symb_bound 500 % 2.34/2.51 % --lt_threshold 2000 % 2.34/2.51 % 2.34/2.51 % ------ SAT Options % 2.34/2.51 % 2.34/2.51 % --sat_mode false % 2.34/2.51 % --sat_fm_restart_options "" % 2.34/2.51 % --sat_gr_def false % 2.34/2.51 % --sat_epr_types true % 2.34/2.51 % --sat_non_cyclic_types false % 2.34/2.51 % --sat_finite_models false % 2.34/2.51 % --sat_fm_lemmas false % 2.34/2.51 % --sat_fm_prep false % 2.34/2.51 % --sat_fm_uc_incr true % 2.34/2.51 % --sat_out_model small % 2.34/2.51 % --sat_out_clauses false % 2.34/2.51 % 2.34/2.51 % ------ QBF Options % 2.34/2.51 % 2.34/2.51 % --qbf_mode false % 2.34/2.51 % --qbf_elim_univ true % 2.34/2.51 % --qbf_sk_in true % 2.34/2.51 % --qbf_pred_elim true % 2.34/2.51 % --qbf_split 32 % 2.34/2.51 % 2.34/2.51 % ------ BMC1 Options % 2.34/2.51 % 2.34/2.51 % --bmc1_incremental false % 2.34/2.51 % --bmc1_axioms reachable_all % 2.34/2.51 % --bmc1_min_bound 0 % 2.34/2.51 % --bmc1_max_bound -1 % 2.34/2.51 % --bmc1_max_bound_default -1 % 2.34/2.51 % --bmc1_symbol_reachability true % 2.34/2.51 % --bmc1_property_lemmas false % 2.34/2.51 % --bmc1_k_induction false % 2.34/2.51 % --bmc1_non_equiv_states false % 2.34/2.51 % --bmc1_deadlock false % 2.34/2.51 % --bmc1_ucm false % 2.34/2.51 % --bmc1_add_unsat_core none % 2.34/2.51 % --bmc1_unsat_core_children false % 2.34/2.51 % --bmc1_unsat_core_extrapolate_axioms false % 2.34/2.51 % --bmc1_out_stat full % 2.34/2.51 % --bmc1_ground_init false % 2.34/2.51 % --bmc1_pre_inst_next_state false % 2.34/2.51 % --bmc1_pre_inst_state false % 2.34/2.51 % --bmc1_pre_inst_reach_state false % 2.34/2.51 % --bmc1_out_unsat_core false % 2.34/2.51 % --bmc1_aig_witness_out false % 2.34/2.51 % --bmc1_verbose false % 2.34/2.51 % --bmc1_dump_clauses_tptp false % 2.34/2.57 % --bmc1_dump_unsat_core_tptp false % 2.34/2.57 % --bmc1_dump_file - % 2.34/2.57 % --bmc1_ucm_expand_uc_limit 128 % 2.34/2.57 % --bmc1_ucm_n_expand_iterations 6 % 2.34/2.57 % --bmc1_ucm_extend_mode 1 % 2.34/2.57 % --bmc1_ucm_init_mode 2 % 2.34/2.57 % --bmc1_ucm_cone_mode none % 2.34/2.57 % --bmc1_ucm_reduced_relation_type 0 % 2.34/2.57 % --bmc1_ucm_relax_model 4 % 2.34/2.57 % --bmc1_ucm_full_tr_after_sat true % 2.34/2.57 % --bmc1_ucm_expand_neg_assumptions false % 2.34/2.57 % --bmc1_ucm_layered_model none % 2.34/2.57 % --bmc1_ucm_max_lemma_size 10 % 2.34/2.57 % 2.34/2.57 % ------ AIG Options % 2.34/2.57 % 2.34/2.57 % --aig_mode false % 2.34/2.57 % 2.34/2.57 % ------ Instantiation Options % 2.34/2.57 % 2.34/2.57 % --instantiation_flag true % 2.34/2.57 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 2.34/2.57 % --inst_solver_per_active 750 % 2.34/2.57 % --inst_solver_calls_frac 0.5 % 2.34/2.57 % --inst_passive_queue_type priority_queues % 2.34/2.57 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 2.34/2.57 % --inst_passive_queues_freq [25;2] % 2.34/2.57 % --inst_dismatching true % 2.34/2.57 % --inst_eager_unprocessed_to_passive true % 2.34/2.57 % --inst_prop_sim_given true % 2.34/2.57 % --inst_prop_sim_new false % 2.34/2.57 % --inst_orphan_elimination true % 2.34/2.57 % --inst_learning_loop_flag true % 2.34/2.57 % --inst_learning_start 3000 % 2.34/2.57 % --inst_learning_factor 2 % 2.34/2.57 % --inst_start_prop_sim_after_learn 3 % 2.34/2.57 % --inst_sel_renew solver % 2.34/2.57 % --inst_lit_activity_flag true % 2.34/2.57 % --inst_out_proof true % 2.34/2.57 % 2.34/2.57 % ------ Resolution Options % 2.34/2.57 % 2.34/2.57 % --resolution_flag true % 2.34/2.57 % --res_lit_sel kbo_max % 2.34/2.57 % --res_to_prop_solver none % 2.34/2.57 % --res_prop_simpl_new false % 2.34/2.57 % --res_prop_simpl_given false % 2.34/2.57 % --res_passive_queue_type priority_queues % 2.34/2.57 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 2.34/2.57 % --res_passive_queues_freq [15;5] % 2.34/2.57 % --res_forward_subs full % 2.34/2.57 % --res_backward_subs full % 2.34/2.57 % --res_forward_subs_resolution true % 2.34/2.57 % --res_backward_subs_resolution true % 2.34/2.57 % --res_orphan_elimination false % 2.34/2.57 % --res_time_limit 1000. % 2.34/2.57 % --res_out_proof true % 2.34/2.57 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_86d5f6.s % 2.34/2.57 % --modulo true % 2.34/2.57 % 2.34/2.57 % ------ Combination Options % 2.34/2.57 % 2.34/2.57 % --comb_res_mult 1000 % 2.34/2.57 % --comb_inst_mult 300 % 2.34/2.57 % ------ % 2.34/2.57 % 2.34/2.57 % ------ Parsing...% successful % 2.34/2.57 % 2.34/2.57 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 24 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e % % 2.34/2.57 % 2.34/2.57 % ------ Proving... % 2.34/2.57 % ------ Problem Properties % 2.34/2.57 % 2.34/2.57 % % 2.34/2.57 % EPR false % 2.34/2.57 % Horn false % 2.34/2.57 % Has equality false % 2.34/2.57 % 2.34/2.57 % % ------ Input Options Time Limit: Unbounded % 2.34/2.57 % 2.34/2.57 % 2.34/2.57 % % ------ Current options: % 2.34/2.57 % 2.34/2.57 % ------ Input Options % 2.34/2.57 % 2.34/2.57 % --out_options all % 2.34/2.57 % --tptp_safe_out true % 2.34/2.57 % --problem_path "" % 2.34/2.57 % --include_path "" % 2.34/2.57 % --clausifier .//eprover % 2.34/2.57 % --clausifier_options --tstp-format % 2.34/2.57 % --stdin false % 2.34/2.57 % --dbg_backtrace false % 2.34/2.57 % --dbg_dump_prop_clauses false % 2.34/2.57 % --dbg_dump_prop_clauses_file - % 2.34/2.57 % --dbg_out_stat false % 2.34/2.57 % 2.34/2.57 % ------ General Options % 2.34/2.57 % 2.34/2.57 % --fof false % 2.34/2.57 % --time_out_real 150. % 2.34/2.57 % --time_out_prep_mult 0.2 % 2.34/2.57 % --time_out_virtual -1. % 2.34/2.57 % --schedule none % 2.34/2.57 % --ground_splitting input % 2.34/2.57 % --splitting_nvd 16 % 2.34/2.57 % --non_eq_to_eq false % 2.34/2.57 % --prep_gs_sim true % 2.34/2.57 % --prep_unflatten false % 2.34/2.57 % --prep_res_sim true % 2.34/2.57 % --prep_upred true % 2.34/2.57 % --res_sim_input true % 2.34/2.57 % --clause_weak_htbl true % 2.34/2.57 % --gc_record_bc_elim false % 2.34/2.57 % --symbol_type_check false % 2.34/2.57 % --clausify_out false % 2.34/2.57 % --large_theory_mode false % 2.34/2.57 % --prep_sem_filter none % 2.34/2.57 % --prep_sem_filter_out false % 2.34/2.57 % --preprocessed_out false % 2.34/2.57 % --sub_typing false % 2.34/2.57 % --brand_transform false % 2.34/2.57 % --pure_diseq_elim true % 2.34/2.57 % --min_unsat_core false % 2.34/2.57 % --pred_elim true % 2.34/2.57 % --add_important_lit false % 2.34/2.57 % --soft_assumptions false % 2.34/2.57 % --reset_solvers false % 2.34/2.57 % --bc_imp_inh [] % 2.34/2.57 % --conj_cone_tolerance 1.5 % 2.34/2.57 % --prolific_symb_bound 500 % 2.34/2.57 % --lt_threshold 2000 % 2.34/2.57 % 2.34/2.57 % ------ SAT Options % 2.34/2.57 % 2.34/2.57 % --sat_mode false % 2.34/2.57 % --sat_fm_restart_options "" % 2.34/2.57 % --sat_gr_def false % 2.34/2.57 % --sat_epr_types true % 2.34/2.57 % --sat_non_cyclic_types false % 2.34/2.57 % --sat_finite_models false % 2.34/2.57 % --sat_fm_lemmas false % 2.34/2.57 % --sat_fm_prep false % 2.34/2.57 % --sat_fm_uc_incr true % 2.34/2.57 % --sat_out_model small % 2.34/2.57 % --sat_out_clauses false % 2.34/2.57 % 2.34/2.57 % ------ QBF Options % 2.34/2.57 % 2.34/2.57 % --qbf_mode false % 2.34/2.57 % --qbf_elim_univ true % 2.34/2.57 % --qbf_sk_in true % 2.34/2.57 % --qbf_pred_elim true % 2.34/2.57 % --qbf_split 32 % 2.34/2.57 % 2.34/2.57 % ------ BMC1 Options % 2.34/2.57 % 2.34/2.57 % --bmc1_incremental false % 2.34/2.57 % --bmc1_axioms reachable_all % 2.34/2.57 % --bmc1_min_bound 0 % 2.34/2.57 % --bmc1_max_bound -1 % 2.34/2.57 % --bmc1_max_bound_default -1 % 2.34/2.57 % --bmc1_symbol_reachability true % 2.34/2.57 % --bmc1_property_lemmas false % 2.34/2.57 % --bmc1_k_induction false % 2.34/2.57 % --bmc1_non_equiv_states false % 2.34/2.57 % --bmc1_deadlock false % 2.34/2.57 % --bmc1_ucm false % 2.34/2.57 % --bmc1_add_unsat_core none % 2.34/2.57 % --bmc1_unsat_core_children false % 2.34/2.57 % --bmc1_unsat_core_extrapolate_axioms false % 2.34/2.57 % --bmc1_out_stat full % 2.34/2.57 % --bmc1_ground_init false % 2.34/2.57 % --bmc1_pre_inst_next_state false % 2.34/2.57 % --bmc1_pre_inst_state false % 2.34/2.57 % --bmc1_pre_inst_reach_state false % 2.34/2.57 % --bmc1_out_unsat_core false % 2.34/2.57 % --bmc1_aig_witness_out false % 2.34/2.57 % --bmc1_verbose false % 2.34/2.57 % --bmc1_dump_clauses_tptp false % 2.34/2.57 % --bmc1_dump_unsat_core_tptp false % 2.34/2.57 % --bmc1_dump_file - % 2.34/2.57 % --bmc1_ucm_expand_uc_limit 128 % 2.34/2.57 % --bmc1_ucm_n_expand_iterations 6 % 2.34/2.57 % --bmc1_ucm_extend_mode 1 % 2.34/2.57 % --bmc1_ucm_init_mode 2 % 2.34/2.57 % --bmc1_ucm_cone_mode none % 2.34/2.57 % --bmc1_ucm_reduced_relation_type 0 % 2.34/2.57 % --bmc1_ucm_relax_model 4 % 2.34/2.57 % --bmc1_ucm_full_tr_after_sat true % 2.34/2.57 % --bmc1_ucm_expand_neg_assumptions false % 2.34/2.57 % --bmc1_ucm_layered_model none % 2.34/2.57 % --bmc1_ucm_max_lemma_size 10 % 2.34/2.57 % 2.34/2.57 % ------ AIG Options % 2.34/2.57 % 2.34/2.57 % --aig_mode false % 2.34/2.57 % 2.34/2.57 % ------ Instantiation Options % 2.34/2.57 % 2.34/2.57 % --instantiation_flag true % 2.34/2.57 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 2.34/2.57 % --inst_solver_per_active 750 % 2.34/2.57 % --inst_solver_calls_frac 0.5 % 2.34/2.57 % --inst_passive_queue_type priority_queues % 2.34/2.57 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 2.34/2.57 % --inst_passive_queues_freq [25;2] % 2.34/2.57 % --inst_dismatching true % 2.34/2.57 % --inst_eager_unprocessed_to_passive true % 4.12/4.36 % --inst_prop_sim_given true % 4.12/4.36 % --inst_prop_sim_new false % 4.12/4.36 % --inst_orphan_elimination true % 4.12/4.36 % --inst_learning_loop_flag true % 4.12/4.36 % --inst_learning_start 3000 % 4.12/4.36 % --inst_learning_factor 2 % 4.12/4.36 % --inst_start_prop_sim_after_learn 3 % 4.12/4.36 % --inst_sel_renew solver % 4.12/4.36 % --inst_lit_activity_flag true % 4.12/4.36 % --inst_out_proof true % 4.12/4.36 % 4.12/4.36 % ------ Resolution Options % 4.12/4.36 % 4.12/4.36 % --resolution_flag true % 4.12/4.36 % --res_lit_sel kbo_max % 4.12/4.36 % --res_to_prop_solver none % 4.12/4.36 % --res_prop_simpl_new false % 4.12/4.36 % --res_prop_simpl_given false % 4.12/4.36 % --res_passive_queue_type priority_queues % 4.12/4.36 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 4.12/4.36 % --res_passive_queues_freq [15;5] % 4.12/4.36 % --res_forward_subs full % 4.12/4.36 % --res_backward_subs full % 4.12/4.36 % --res_forward_subs_resolution true % 4.12/4.36 % --res_backward_subs_resolution true % 4.12/4.36 % --res_orphan_elimination false % 4.12/4.36 % --res_time_limit 1000. % 4.12/4.36 % --res_out_proof true % 4.12/4.36 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_86d5f6.s % 4.12/4.36 % --modulo true % 4.12/4.36 % 4.12/4.36 % ------ Combination Options % 4.12/4.36 % 4.12/4.36 % --comb_res_mult 1000 % 4.12/4.36 % --comb_inst_mult 300 % 4.12/4.36 % ------ % 4.12/4.36 % 4.12/4.36 % 4.12/4.36 % 4.12/4.36 % ------ Proving... % 4.12/4.36 % warning: shown sat in sat incomplete mode % 4.12/4.36 % % 4.12/4.36 % 4.12/4.36 % 4.12/4.36 ------ Building Model...Done % 4.12/4.36 % 4.12/4.36 %------ The model is defined over ground terms (initial term algebra). % 4.12/4.36 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 4.12/4.36 %------ where \phi is a formula over the term algebra. % 4.12/4.36 %------ If we have equality in the problem then it is also defined as a predicate above, % 4.12/4.36 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 4.12/4.36 %------ See help for --sat_out_model for different model outputs. % 4.12/4.36 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 4.12/4.36 %------ where the first argument stands for the sort ($i in the unsorted case) % 4.12/4.36 % 4.12/4.36 % 4.12/4.36 % 4.12/4.36 % 4.12/4.36 %------ Positive definition of ssSkC0 % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 ( ssSkC0 <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of actual_world % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0] : % 4.12/4.36 ( ~(actual_world(X0)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of state % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( state(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc73 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of of % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( ~(of(X0,X1,X2)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of man % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( man(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc75 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of be % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2,X3] : % 4.12/4.36 ( ~(be(X0,X1,X2,X3)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of forename % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( forename(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc74 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of jules_forename % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( ~(jules_forename(X0,X1)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of wheel % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( wheel(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc72 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of behind % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( ~(behind(X0,X1,X2)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of frontseat % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( frontseat(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc78 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of ssSkP1 % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( ssSkP1(X0,X1,X2) <=> % 4.12/4.36 $true % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of ssSkP2 % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( ssSkP2(X0,X1,X2) <=> % 4.12/4.36 $true % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of ssSkP0 % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( ssSkP0(X0,X1) <=> % 4.12/4.36 $true % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of group % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( group(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc76 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 | % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc77 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of two % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( two(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc77 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of coat % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( coat(X0,X1) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of hollywood_placename % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( hollywood_placename(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc81 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of placename % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( ~(placename(X0,X1)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of in % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( in(X0,X1,X2) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc79 & X2=skc80 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of down % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( ~(down(X0,X1,X2)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of lonely % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( lonely(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc80 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of street % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( ~(street(X0,X1)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of city % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( ~(city(X0,X1)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of agent % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( ~(agent(X0,X1,X2)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of old % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( old(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc82 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of dirty % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( ~(dirty(X0,X1)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of white % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( ~(white(X0,X1)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of chevy % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( chevy(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc82 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of event % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( event(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc79 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Negative definition of present % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( ~(present(X0,X1)) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of barrel % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1] : % 4.12/4.36 ( barrel(X0,X1) <=> % 4.12/4.36 ( % 4.12/4.36 ( % 4.12/4.36 ( X0=skc71 & X1=skc79 ) % 4.12/4.36 ) % 4.12/4.36 % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of member % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( member(X0,X1,X2) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of sP2_iProver_split % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( sP2_iProver_split(X0,X1,X2) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of sP5_iProver_split % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( sP5_iProver_split(X0,X1,X2) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of sP7_iProver_split % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2,X3,X4,X5] : % 4.12/4.36 ( sP7_iProver_split(X0,X1,X2,X3,X4,X5) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of sP8_iProver_split % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( sP8_iProver_split(X0,X1,X2) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of sP10_iProver_split % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2,X3,X4,X5] : % 4.12/4.36 ( sP10_iProver_split(X0,X1,X2,X3,X4,X5) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of sP11_iProver_split % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( sP11_iProver_split(X0,X1,X2) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of sP14_iProver_split % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( sP14_iProver_split(X0,X1,X2) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of sP17_iProver_split % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( sP17_iProver_split(X0,X1,X2) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of sP19_iProver_split % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2,X3,X4,X5] : % 4.12/4.36 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of sP20_iProver_split % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( sP20_iProver_split(X0,X1,X2) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of sP22_iProver_split % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2,X3,X4,X5] : % 4.12/4.36 ( sP22_iProver_split(X0,X1,X2,X3,X4,X5) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 %------ Positive definition of sP23_iProver_split % 4.12/4.36 fof(lit_def,axiom, % 4.12/4.36 (! [X0,X1,X2] : % 4.12/4.36 ( sP23_iProver_split(X0,X1,X2) <=> % 4.12/4.36 $false % 4.12/4.36 ) % 4.12/4.36 ) % 4.12/4.36 ). % 4.12/4.36 % 4.12/4.36 % 4.12/4.36 % 4.12/4.36 % ------ Statistics % 4.12/4.36 % 4.12/4.36 % ------ General % 4.12/4.36 % 4.12/4.36 % num_of_input_clauses: 92 % 4.12/4.36 % num_of_input_neg_conjectures: 92 % 4.12/4.36 % num_of_splits: 24 % 4.12/4.36 % num_of_split_atoms: 24 % 4.12/4.36 % num_of_sem_filtered_clauses: 0 % 4.12/4.36 % num_of_subtypes: 0 % 4.12/4.36 % monotx_restored_types: 0 % 4.12/4.36 % sat_num_of_epr_types: 0 % 4.12/4.36 % sat_num_of_non_cyclic_types: 0 % 4.12/4.36 % sat_guarded_non_collapsed_types: 0 % 4.12/4.36 % is_epr: 0 % 4.12/4.36 % is_horn: 0 % 4.12/4.36 % has_eq: 0 % 4.12/4.36 % num_pure_diseq_elim: 0 % 4.12/4.36 % simp_replaced_by: 0 % 4.12/4.36 % res_preprocessed: 208 % 4.12/4.36 % prep_upred: 0 % 4.12/4.36 % prep_unflattend: 0 % 4.12/4.36 % pred_elim_cands: 24 % 4.12/4.36 % pred_elim: 8 % 4.12/4.36 % pred_elim_cl: 8 % 4.12/4.36 % pred_elim_cycles: 40 % 4.12/4.36 % forced_gc_time: 0 % 4.12/4.36 % gc_basic_clause_elim: 0 % 4.12/4.36 % parsing_time: 0.002 % 4.12/4.36 % sem_filter_time: 0. % 4.12/4.36 % pred_elim_time: 0.044 % 4.12/4.36 % out_proof_time: 0. % 4.12/4.36 % monotx_time: 0. % 4.12/4.36 % subtype_inf_time: 0. % 4.12/4.36 % unif_index_cands_time: 0.002 % 4.12/4.36 % unif_index_add_time: 0.001 % 4.12/4.36 % total_time: 1.855 % 4.12/4.36 % num_of_symbols: 122 % 4.12/4.36 % num_of_terms: 6296 % 4.12/4.36 % 4.12/4.36 % ------ Propositional Solver % 4.12/4.36 % 4.12/4.36 % prop_solver_calls: 3 % 4.12/4.36 % prop_fast_solver_calls: 2023 % 4.12/4.36 % prop_num_of_clauses: 408 % 4.12/4.36 % prop_preprocess_simplified: 1800 % 4.12/4.36 % prop_fo_subsumed: 0 % 4.12/4.36 % prop_solver_time: 0. % 4.12/4.36 % prop_fast_solver_time: 0.001 % 4.12/4.36 % prop_unsat_core_time: 0. % 4.12/4.36 % 4.12/4.36 % ------ QBF % 4.12/4.36 % 4.12/4.36 % qbf_q_res: 0 % 4.12/4.36 % qbf_num_tautologies: 0 % 4.12/4.36 % qbf_prep_cycles: 0 % 4.12/4.36 % 4.12/4.36 % ------ BMC1 % 4.12/4.36 % 4.12/4.36 % bmc1_current_bound: -1 % 4.12/4.36 % bmc1_last_solved_bound: -1 % 4.12/4.36 % bmc1_unsat_core_size: -1 % 4.12/4.36 % bmc1_unsat_core_parents_size: -1 % 4.12/4.36 % bmc1_merge_next_fun: 0 % 4.12/4.36 % bmc1_unsat_core_clauses_time: 0. % 4.12/4.36 % 4.12/4.36 % ------ Instantiation % 4.12/4.36 % 4.12/4.36 % inst_num_of_clauses: 188 % 4.12/4.36 % inst_num_in_passive: 0 % 4.12/4.36 % inst_num_in_active: 188 % 4.12/4.36 % inst_num_in_unprocessed: 0 % 4.12/4.36 % inst_num_of_loops: 195 % 4.12/4.36 % inst_num_of_learning_restarts: 0 % 4.12/4.36 % inst_num_moves_active_passive: 0 % 4.12/4.36 % inst_lit_activity: 38 % 4.12/4.36 % inst_lit_activity_moves: 0 % 4.12/4.36 % inst_num_tautologies: 0 % 4.12/4.36 % inst_num_prop_implied: 0 % 4.12/4.36 % inst_num_existing_simplified: 0 % 4.12/4.36 % inst_num_eq_res_simplified: 0 % 4.12/4.36 % inst_num_child_elim: 0 % 4.12/4.36 % inst_num_of_dismatching_blockings: 0 % 4.12/4.36 % inst_num_of_non_proper_insts: 76 % 4.12/4.36 % inst_num_of_duplicates: 0 % 4.12/4.36 % inst_inst_num_from_inst_to_res: 0 % 4.12/4.36 % inst_dismatching_checking_time: 0. % 4.12/4.36 % 4.12/4.36 % ------ Resolution % 4.12/4.36 % 4.12/4.36 % res_num_of_clauses: 21173 % 4.12/4.36 % res_num_in_passive: 20257 % 4.12/4.36 % res_num_in_active: 916 % 4.12/4.36 % res_num_of_loops: 1000 % 4.12/4.36 % res_forward_subset_subsumed: 19536 % 4.12/4.36 % res_backward_subset_subsumed: 0 % 4.12/4.36 % res_forward_subsumed: 82 % 4.12/4.36 % res_backward_subsumed: 2 % 4.12/4.36 % res_forward_subsumption_resolution: 102 % 4.12/4.36 % res_backward_subsumption_resolution: 0 % 4.12/4.36 % res_clause_to_clause_subsumption: 606 % 4.12/4.36 % res_orphan_elimination: 0 % 4.12/4.36 % res_tautology_del: 476 % 4.12/4.36 % res_num_eq_res_simplified: 0 % 4.12/4.36 % res_num_sel_changes: 0 % 4.12/4.36 % res_moves_from_active_to_pass: 0 % 4.12/4.36 % 4.12/4.36 % Status Unknown % 4.12/4.36 % Last status : % 4.12/4.36 % SZS status Unknown %------------------------------------------------------------------------------