%------------------------------------------------------------------------------ % 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 : n005.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:15 EDT 2022 % Result : Unknown 7.15s 7.39s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : NLP199+1 : TPTP v8.1.0. Released v2.4.0. % 0.10/0.12 % Command : iprover_modulo %s %d % 0.12/0.33 % Computer : n005.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Fri Jul 1 10:29:38 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % Running in mono-core mode % 0.19/0.43 % Orienting using strategy Equiv(ClausalAll) % 0.19/0.43 % FOF problem with conjecture % 0.19/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_fb7806.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_ea43a5.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_d3a834 | grep -v "SZS" % 0.19/0.45 % 0.19/0.45 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 0.19/0.45 % 0.19/0.45 % % 0.19/0.45 % ------ iProver source info % 0.19/0.45 % 0.19/0.45 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 0.19/0.45 % git: non_committed_changes: true % 0.19/0.45 % git: last_make_outside_of_git: true % 0.19/0.45 % 0.19/0.45 % % 0.19/0.45 % ------ Input Options % 0.19/0.45 % 0.19/0.45 % --out_options all % 0.19/0.45 % --tptp_safe_out true % 0.19/0.45 % --problem_path "" % 0.19/0.45 % --include_path "" % 0.19/0.45 % --clausifier .//eprover % 0.19/0.45 % --clausifier_options --tstp-format % 0.19/0.45 % --stdin false % 0.19/0.45 % --dbg_backtrace false % 0.19/0.45 % --dbg_dump_prop_clauses false % 0.19/0.45 % --dbg_dump_prop_clauses_file - % 0.19/0.45 % --dbg_out_stat false % 0.19/0.45 % 0.19/0.45 % ------ General Options % 0.19/0.45 % 0.19/0.45 % --fof false % 0.19/0.45 % --time_out_real 150. % 0.19/0.45 % --time_out_prep_mult 0.2 % 0.19/0.45 % --time_out_virtual -1. % 0.19/0.45 % --schedule none % 0.19/0.45 % --ground_splitting input % 0.19/0.45 % --splitting_nvd 16 % 0.19/0.45 % --non_eq_to_eq false % 0.19/0.45 % --prep_gs_sim true % 0.19/0.45 % --prep_unflatten false % 0.19/0.45 % --prep_res_sim true % 0.19/0.45 % --prep_upred true % 0.19/0.45 % --res_sim_input true % 0.19/0.45 % --clause_weak_htbl true % 0.19/0.45 % --gc_record_bc_elim false % 0.19/0.45 % --symbol_type_check false % 0.19/0.45 % --clausify_out false % 0.19/0.45 % --large_theory_mode false % 0.19/0.45 % --prep_sem_filter none % 0.19/0.45 % --prep_sem_filter_out false % 0.19/0.45 % --preprocessed_out false % 0.19/0.45 % --sub_typing false % 0.19/0.45 % --brand_transform false % 0.19/0.45 % --pure_diseq_elim true % 0.19/0.45 % --min_unsat_core false % 0.19/0.45 % --pred_elim true % 0.19/0.45 % --add_important_lit false % 0.19/0.45 % --soft_assumptions false % 0.19/0.45 % --reset_solvers false % 0.19/0.45 % --bc_imp_inh [] % 0.19/0.45 % --conj_cone_tolerance 1.5 % 0.19/0.45 % --prolific_symb_bound 500 % 0.19/0.45 % --lt_threshold 2000 % 0.19/0.45 % 0.19/0.45 % ------ SAT Options % 0.19/0.45 % 0.19/0.45 % --sat_mode false % 0.19/0.45 % --sat_fm_restart_options "" % 0.19/0.45 % --sat_gr_def false % 0.19/0.45 % --sat_epr_types true % 0.19/0.45 % --sat_non_cyclic_types false % 0.19/0.45 % --sat_finite_models false % 0.19/0.45 % --sat_fm_lemmas false % 0.19/0.45 % --sat_fm_prep false % 0.19/0.45 % --sat_fm_uc_incr true % 0.19/0.45 % --sat_out_model small % 0.19/0.45 % --sat_out_clauses false % 0.19/0.45 % 0.19/0.45 % ------ QBF Options % 0.19/0.45 % 0.19/0.45 % --qbf_mode false % 0.19/0.45 % --qbf_elim_univ true % 0.19/0.45 % --qbf_sk_in true % 0.19/0.45 % --qbf_pred_elim true % 0.19/0.45 % --qbf_split 32 % 0.19/0.45 % 0.19/0.45 % ------ BMC1 Options % 0.19/0.45 % 0.19/0.45 % --bmc1_incremental false % 0.19/0.45 % --bmc1_axioms reachable_all % 0.19/0.45 % --bmc1_min_bound 0 % 0.19/0.45 % --bmc1_max_bound -1 % 0.19/0.45 % --bmc1_max_bound_default -1 % 0.19/0.45 % --bmc1_symbol_reachability true % 0.19/0.45 % --bmc1_property_lemmas false % 0.19/0.45 % --bmc1_k_induction false % 0.19/0.45 % --bmc1_non_equiv_states false % 0.19/0.45 % --bmc1_deadlock false % 0.19/0.45 % --bmc1_ucm false % 0.19/0.45 % --bmc1_add_unsat_core none % 0.19/0.45 % --bmc1_unsat_core_children false % 0.19/0.45 % --bmc1_unsat_core_extrapolate_axioms false % 0.19/0.45 % --bmc1_out_stat full % 0.19/0.45 % --bmc1_ground_init false % 0.19/0.45 % --bmc1_pre_inst_next_state false % 0.19/0.45 % --bmc1_pre_inst_state false % 0.19/0.45 % --bmc1_pre_inst_reach_state false % 0.19/0.45 % --bmc1_out_unsat_core false % 0.19/0.45 % --bmc1_aig_witness_out false % 0.19/0.45 % --bmc1_verbose false % 0.19/0.45 % --bmc1_dump_clauses_tptp false % 1.21/1.45 % --bmc1_dump_unsat_core_tptp false % 1.21/1.45 % --bmc1_dump_file - % 1.21/1.45 % --bmc1_ucm_expand_uc_limit 128 % 1.21/1.45 % --bmc1_ucm_n_expand_iterations 6 % 1.21/1.45 % --bmc1_ucm_extend_mode 1 % 1.21/1.45 % --bmc1_ucm_init_mode 2 % 1.21/1.45 % --bmc1_ucm_cone_mode none % 1.21/1.45 % --bmc1_ucm_reduced_relation_type 0 % 1.21/1.45 % --bmc1_ucm_relax_model 4 % 1.21/1.45 % --bmc1_ucm_full_tr_after_sat true % 1.21/1.45 % --bmc1_ucm_expand_neg_assumptions false % 1.21/1.45 % --bmc1_ucm_layered_model none % 1.21/1.45 % --bmc1_ucm_max_lemma_size 10 % 1.21/1.45 % 1.21/1.45 % ------ AIG Options % 1.21/1.45 % 1.21/1.45 % --aig_mode false % 1.21/1.45 % 1.21/1.45 % ------ Instantiation Options % 1.21/1.45 % 1.21/1.45 % --instantiation_flag true % 1.21/1.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 1.21/1.45 % --inst_solver_per_active 750 % 1.21/1.45 % --inst_solver_calls_frac 0.5 % 1.21/1.45 % --inst_passive_queue_type priority_queues % 1.21/1.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 1.21/1.45 % --inst_passive_queues_freq [25;2] % 1.21/1.45 % --inst_dismatching true % 1.21/1.45 % --inst_eager_unprocessed_to_passive true % 1.21/1.45 % --inst_prop_sim_given true % 1.21/1.45 % --inst_prop_sim_new false % 1.21/1.45 % --inst_orphan_elimination true % 1.21/1.45 % --inst_learning_loop_flag true % 1.21/1.45 % --inst_learning_start 3000 % 1.21/1.45 % --inst_learning_factor 2 % 1.21/1.45 % --inst_start_prop_sim_after_learn 3 % 1.21/1.45 % --inst_sel_renew solver % 1.21/1.45 % --inst_lit_activity_flag true % 1.21/1.45 % --inst_out_proof true % 1.21/1.45 % 1.21/1.45 % ------ Resolution Options % 1.21/1.45 % 1.21/1.45 % --resolution_flag true % 1.21/1.45 % --res_lit_sel kbo_max % 1.21/1.45 % --res_to_prop_solver none % 1.21/1.45 % --res_prop_simpl_new false % 1.21/1.45 % --res_prop_simpl_given false % 1.21/1.45 % --res_passive_queue_type priority_queues % 1.21/1.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 1.21/1.45 % --res_passive_queues_freq [15;5] % 1.21/1.45 % --res_forward_subs full % 1.21/1.45 % --res_backward_subs full % 1.21/1.45 % --res_forward_subs_resolution true % 1.21/1.45 % --res_backward_subs_resolution true % 1.21/1.45 % --res_orphan_elimination false % 1.21/1.45 % --res_time_limit 1000. % 1.21/1.45 % --res_out_proof true % 1.21/1.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fb7806.s % 1.21/1.45 % --modulo true % 1.21/1.45 % 1.21/1.45 % ------ Combination Options % 1.21/1.45 % 1.21/1.45 % --comb_res_mult 1000 % 1.21/1.45 % --comb_inst_mult 300 % 1.21/1.45 % ------ % 1.21/1.45 % 1.21/1.45 % ------ Parsing...% successful % 1.21/1.45 % 1.21/1.45 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 144 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe_e snvd_s sp: 0 0s snvd_e % % 1.21/1.45 % 1.21/1.45 % ------ Proving... % 1.21/1.45 % ------ Problem Properties % 1.21/1.45 % 1.21/1.45 % % 1.21/1.45 % EPR false % 1.21/1.45 % Horn false % 1.21/1.45 % Has equality false % 1.21/1.45 % 1.21/1.45 % % ------ Input Options Time Limit: Unbounded % 1.21/1.45 % 1.21/1.45 % 1.21/1.45 % % ------ Current options: % 1.21/1.45 % 1.21/1.45 % ------ Input Options % 1.21/1.45 % 1.21/1.45 % --out_options all % 1.21/1.45 % --tptp_safe_out true % 1.21/1.45 % --problem_path "" % 1.21/1.45 % --include_path "" % 1.21/1.45 % --clausifier .//eprover % 1.21/1.45 % --clausifier_options --tstp-format % 1.21/1.45 % --stdin false % 1.21/1.45 % --dbg_backtrace false % 1.21/1.45 % --dbg_dump_prop_clauses false % 1.21/1.45 % --dbg_dump_prop_clauses_file - % 1.21/1.45 % --dbg_out_stat false % 1.21/1.45 % 1.21/1.45 % ------ General Options % 1.21/1.45 % 1.21/1.45 % --fof false % 1.21/1.45 % --time_out_real 150. % 1.21/1.45 % --time_out_prep_mult 0.2 % 1.21/1.45 % --time_out_virtual -1. % 1.21/1.45 % --schedule none % 1.21/1.45 % --ground_splitting input % 1.21/1.45 % --splitting_nvd 16 % 1.21/1.45 % --non_eq_to_eq false % 1.21/1.45 % --prep_gs_sim true % 1.21/1.45 % --prep_unflatten false % 1.21/1.45 % --prep_res_sim true % 1.21/1.45 % --prep_upred true % 1.21/1.45 % --res_sim_input true % 1.21/1.45 % --clause_weak_htbl true % 1.21/1.45 % --gc_record_bc_elim false % 1.21/1.45 % --symbol_type_check false % 1.21/1.45 % --clausify_out false % 1.21/1.45 % --large_theory_mode false % 1.21/1.45 % --prep_sem_filter none % 1.21/1.45 % --prep_sem_filter_out false % 1.21/1.45 % --preprocessed_out false % 1.21/1.45 % --sub_typing false % 1.21/1.45 % --brand_transform false % 1.21/1.45 % --pure_diseq_elim true % 1.21/1.45 % --min_unsat_core false % 1.21/1.45 % --pred_elim true % 1.21/1.45 % --add_important_lit false % 1.21/1.45 % --soft_assumptions false % 1.21/1.45 % --reset_solvers false % 1.21/1.45 % --bc_imp_inh [] % 1.21/1.45 % --conj_cone_tolerance 1.5 % 1.21/1.45 % --prolific_symb_bound 500 % 1.21/1.45 % --lt_threshold 2000 % 1.21/1.45 % 1.21/1.45 % ------ SAT Options % 1.21/1.45 % 1.21/1.45 % --sat_mode false % 1.21/1.45 % --sat_fm_restart_options "" % 1.21/1.45 % --sat_gr_def false % 1.21/1.45 % --sat_epr_types true % 1.21/1.45 % --sat_non_cyclic_types false % 1.21/1.45 % --sat_finite_models false % 1.21/1.45 % --sat_fm_lemmas false % 1.21/1.45 % --sat_fm_prep false % 1.21/1.45 % --sat_fm_uc_incr true % 1.21/1.45 % --sat_out_model small % 1.21/1.45 % --sat_out_clauses false % 1.21/1.45 % 1.21/1.45 % ------ QBF Options % 1.21/1.45 % 1.21/1.45 % --qbf_mode false % 1.21/1.45 % --qbf_elim_univ true % 1.21/1.45 % --qbf_sk_in true % 1.21/1.45 % --qbf_pred_elim true % 1.21/1.45 % --qbf_split 32 % 1.21/1.45 % 1.21/1.45 % ------ BMC1 Options % 1.21/1.45 % 1.21/1.45 % --bmc1_incremental false % 1.21/1.45 % --bmc1_axioms reachable_all % 1.21/1.45 % --bmc1_min_bound 0 % 1.21/1.45 % --bmc1_max_bound -1 % 1.21/1.45 % --bmc1_max_bound_default -1 % 1.21/1.45 % --bmc1_symbol_reachability true % 1.21/1.45 % --bmc1_property_lemmas false % 1.21/1.45 % --bmc1_k_induction false % 1.21/1.45 % --bmc1_non_equiv_states false % 1.21/1.45 % --bmc1_deadlock false % 1.21/1.45 % --bmc1_ucm false % 1.21/1.45 % --bmc1_add_unsat_core none % 1.21/1.45 % --bmc1_unsat_core_children false % 1.21/1.45 % --bmc1_unsat_core_extrapolate_axioms false % 1.21/1.45 % --bmc1_out_stat full % 1.21/1.45 % --bmc1_ground_init false % 1.21/1.45 % --bmc1_pre_inst_next_state false % 1.21/1.45 % --bmc1_pre_inst_state false % 1.21/1.45 % --bmc1_pre_inst_reach_state false % 1.21/1.45 % --bmc1_out_unsat_core false % 1.21/1.45 % --bmc1_aig_witness_out false % 1.21/1.45 % --bmc1_verbose false % 1.21/1.45 % --bmc1_dump_clauses_tptp false % 1.21/1.45 % --bmc1_dump_unsat_core_tptp false % 1.21/1.45 % --bmc1_dump_file - % 1.21/1.45 % --bmc1_ucm_expand_uc_limit 128 % 1.21/1.45 % --bmc1_ucm_n_expand_iterations 6 % 1.21/1.45 % --bmc1_ucm_extend_mode 1 % 1.21/1.45 % --bmc1_ucm_init_mode 2 % 1.21/1.45 % --bmc1_ucm_cone_mode none % 1.21/1.45 % --bmc1_ucm_reduced_relation_type 0 % 1.21/1.45 % --bmc1_ucm_relax_model 4 % 1.21/1.45 % --bmc1_ucm_full_tr_after_sat true % 1.21/1.45 % --bmc1_ucm_expand_neg_assumptions false % 1.21/1.45 % --bmc1_ucm_layered_model none % 1.21/1.45 % --bmc1_ucm_max_lemma_size 10 % 1.21/1.45 % 1.21/1.45 % ------ AIG Options % 1.21/1.45 % 1.21/1.45 % --aig_mode false % 1.21/1.45 % 1.21/1.45 % ------ Instantiation Options % 1.21/1.45 % 1.21/1.45 % --instantiation_flag true % 1.21/1.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 1.21/1.45 % --inst_solver_per_active 750 % 1.21/1.45 % --inst_solver_calls_frac 0.5 % 1.21/1.45 % --inst_passive_queue_type priority_queues % 1.21/1.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 1.21/1.45 % --inst_passive_queues_freq [25;2] % 1.21/1.45 % --inst_dismatching true % 1.21/1.45 % --inst_eager_unprocessed_to_passive true % 3.63/3.83 % --inst_prop_sim_given true % 3.63/3.83 % --inst_prop_sim_new false % 3.63/3.83 % --inst_orphan_elimination true % 3.63/3.83 % --inst_learning_loop_flag true % 3.63/3.83 % --inst_learning_start 3000 % 3.63/3.83 % --inst_learning_factor 2 % 3.63/3.83 % --inst_start_prop_sim_after_learn 3 % 3.63/3.83 % --inst_sel_renew solver % 3.63/3.83 % --inst_lit_activity_flag true % 3.63/3.83 % --inst_out_proof true % 3.63/3.83 % 3.63/3.83 % ------ Resolution Options % 3.63/3.83 % 3.63/3.83 % --resolution_flag true % 3.63/3.83 % --res_lit_sel kbo_max % 3.63/3.83 % --res_to_prop_solver none % 3.63/3.83 % --res_prop_simpl_new false % 3.63/3.83 % --res_prop_simpl_given false % 3.63/3.83 % --res_passive_queue_type priority_queues % 3.63/3.83 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 3.63/3.83 % --res_passive_queues_freq [15;5] % 3.63/3.83 % --res_forward_subs full % 3.63/3.83 % --res_backward_subs full % 3.63/3.83 % --res_forward_subs_resolution true % 3.63/3.83 % --res_backward_subs_resolution true % 3.63/3.83 % --res_orphan_elimination false % 3.63/3.83 % --res_time_limit 1000. % 3.63/3.83 % --res_out_proof true % 3.63/3.83 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fb7806.s % 3.63/3.83 % --modulo true % 3.63/3.83 % 3.63/3.83 % ------ Combination Options % 3.63/3.83 % 3.63/3.83 % --comb_res_mult 1000 % 3.63/3.83 % --comb_inst_mult 300 % 3.63/3.83 % ------ % 3.63/3.83 % 3.63/3.83 % 3.63/3.83 % 3.63/3.83 % ------ Proving... % 3.63/3.83 % warning: shown sat in sat incomplete mode % 3.63/3.83 % % 3.63/3.83 % 3.63/3.83 % 3.63/3.83 ------ Building Model...Done % 3.63/3.83 % 3.63/3.83 %------ The model is defined over ground terms (initial term algebra). % 3.63/3.83 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 3.63/3.83 %------ where \phi is a formula over the term algebra. % 3.63/3.83 %------ If we have equality in the problem then it is also defined as a predicate above, % 3.63/3.83 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 3.63/3.83 %------ See help for --sat_out_model for different model outputs. % 3.63/3.83 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 3.63/3.83 %------ where the first argument stands for the sort ($i in the unsorted case) % 3.63/3.83 % 3.63/3.83 % 3.63/3.83 % 3.63/3.83 % 3.63/3.83 %------ Positive definition of epred2_0 % 3.63/3.83 fof(lit_def,axiom, % 3.63/3.83 ( epred2_0 <=> % 3.63/3.83 $true % 3.63/3.83 ) % 3.63/3.83 ). % 3.63/3.83 % 3.63/3.83 %------ Negative definition of actual_world % 3.63/3.83 fof(lit_def,axiom, % 3.63/3.83 (! [X0] : % 3.63/3.83 ( ~(actual_world(X0)) <=> % 3.63/3.83 $false % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ). % 3.63/3.83 % 3.63/3.83 %------ Negative definition of of % 3.63/3.83 fof(lit_def,axiom, % 3.63/3.83 (! [X0,X1,X2] : % 3.63/3.83 ( ~(of(X0,X1,X2)) <=> % 3.63/3.83 $false % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ). % 3.63/3.83 % 3.63/3.83 %------ Positive definition of man % 3.63/3.83 fof(lit_def,axiom, % 3.63/3.83 (! [X0,X1] : % 3.63/3.83 ( man(X0,X1) <=> % 3.63/3.83 ( % 3.63/3.83 ( % 3.63/3.83 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 ) % 3.63/3.83 ) % 3.63/3.83 % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ). % 3.63/3.83 % 3.63/3.83 %------ Positive definition of jules_forename % 3.63/3.83 fof(lit_def,axiom, % 3.63/3.83 (! [X0,X1] : % 3.63/3.83 ( jules_forename(X0,X1) <=> % 3.63/3.83 ( % 3.63/3.83 ( % 3.63/3.83 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 ) % 3.63/3.83 ) % 3.63/3.83 % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ). % 3.63/3.83 % 3.63/3.83 %------ Negative definition of forename % 3.63/3.83 fof(lit_def,axiom, % 3.63/3.83 (! [X0,X1] : % 3.63/3.83 ( ~(forename(X0,X1)) <=> % 3.63/3.83 $false % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ). % 3.63/3.83 % 3.63/3.83 %------ Positive definition of frontseat % 3.63/3.83 fof(lit_def,axiom, % 3.63/3.83 (! [X0,X1] : % 3.63/3.83 ( frontseat(X0,X1) <=> % 3.63/3.83 ( % 3.63/3.83 ( % 3.63/3.83 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 ) % 3.63/3.83 ) % 3.63/3.83 % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ). % 3.63/3.83 % 3.63/3.83 %------ Positive definition of chevy % 3.63/3.83 fof(lit_def,axiom, % 3.63/3.83 (! [X0,X1] : % 3.63/3.83 ( chevy(X0,X1) <=> % 3.63/3.83 ( % 3.63/3.83 ( % 3.63/3.83 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 ) % 3.63/3.83 ) % 3.63/3.83 % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ). % 3.63/3.83 % 3.63/3.83 %------ Negative definition of white % 3.63/3.83 fof(lit_def,axiom, % 3.63/3.83 (! [X0,X1] : % 3.63/3.83 ( ~(white(X0,X1)) <=> % 3.63/3.83 $false % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ). % 3.63/3.83 % 3.63/3.83 %------ Negative definition of dirty % 3.63/3.83 fof(lit_def,axiom, % 3.63/3.83 (! [X0,X1] : % 3.63/3.83 ( ~(dirty(X0,X1)) <=> % 3.63/3.83 $false % 3.63/3.83 ) % 3.63/3.83 ) % 3.63/3.83 ). % 3.63/3.83 % 3.63/3.83 %------ Negative definition of old % 3.63/3.83 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( ~(old(X0,X1)) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of city % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( city(X0,X1) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of hollywood_placename % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( hollywood_placename(X0,X1) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of placename % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( ~(placename(X0,X1)) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of street % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( ~(street(X0,X1)) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of lonely % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( lonely(X0,X1) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of event % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( event(X0,X1) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk8_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of agent % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2] : % 3.63/3.84 ( agent(X0,X1,X2) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk8_0 & X2=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of present % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( ~(present(X0,X1)) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of barrel % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( ~(barrel(X0,X1)) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of down % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2] : % 3.63/3.84 ( down(X0,X1,X2) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk8_0 & X2=sk3_esk7_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of in % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2] : % 3.63/3.84 ( in(X0,X1,X2) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk8_0 & X2=sk3_esk7_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of be % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3] : % 3.63/3.84 ( be(X0,X1,X2,X3) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk14_0 & X2=sk3_esk2_0 & X3=sk3_esk15_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of state % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( state(X0,X1) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk14_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of two % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( two(X0,X1) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk9_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of group % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( group(X0,X1) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk9_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 | % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk12_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of wear % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( wear(X0,X1) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of nonreflexive % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( nonreflexive(X0,X1) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of behind % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2] : % 3.63/3.84 ( behind(X0,X1,X2) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk15_0 & X2=sk3_esk15_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of wheel % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1] : % 3.63/3.84 ( wheel(X0,X1) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk15_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of epred1_0 % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 ( epred1_0 <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of member % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2] : % 3.63/3.84 ( member(X0,X1,X2) <=> % 3.63/3.84 ( % 3.63/3.84 ? [X3,X4] : % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk18_10(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0,sk3_esk4_0,sk3_esk5_0,sk3_esk6_0,sk3_esk7_0,X3,X4,sk3_esk12_0) & X2=sk3_esk12_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 | % 3.63/3.84 ? [X3,X4] : % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk19_10(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0,sk3_esk4_0,sk3_esk5_0,sk3_esk6_0,sk3_esk7_0,X3,sk3_esk12_0,X4) & X2=sk3_esk12_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 | % 3.63/3.84 ? [X3] : % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk20_10(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0,sk3_esk4_0,sk3_esk5_0,sk3_esk6_0,sk3_esk7_0,X3,sk3_esk9_0,sk3_esk12_0) & X2=sk3_esk12_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 | % 3.63/3.84 ? [X3,X4] : % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk18_10(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0,sk3_esk4_0,sk3_esk5_0,sk3_esk6_0,sk3_esk7_0,X3,X4,X2) ) % 3.63/3.84 & % 3.63/3.84 ( X2!=sk3_esk9_0 ) % 3.63/3.84 & % 3.63/3.84 ( X2!=sk3_esk12_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 | % 3.63/3.84 ? [X3,X4] : % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk19_10(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0,sk3_esk4_0,sk3_esk5_0,sk3_esk6_0,sk3_esk7_0,X3,X2,X4) ) % 3.63/3.84 & % 3.63/3.84 ( X2!=sk3_esk9_0 ) % 3.63/3.84 & % 3.63/3.84 ( X2!=sk3_esk9_0 | X4!=sk3_esk9_0 ) % 3.63/3.84 & % 3.63/3.84 ( X2!=sk3_esk12_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 | % 3.63/3.84 ? [X3] : % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk20_10(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0,sk3_esk4_0,sk3_esk5_0,sk3_esk6_0,sk3_esk7_0,X3,sk3_esk9_0,X2) ) % 3.63/3.84 & % 3.63/3.84 ( X2!=sk3_esk9_0 ) % 3.63/3.84 & % 3.63/3.84 ( X2!=sk3_esk12_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP0_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP3_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP6_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP9_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP12_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP15_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP15_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP18_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP18_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP21_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP21_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP24_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP24_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP27_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP27_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP30_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP32_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 3.63/3.84 ( sP32_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP33_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP33_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP35_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 3.63/3.84 ( sP35_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP36_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP36_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP38_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 3.63/3.84 ( sP38_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP39_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP39_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP41_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 3.63/3.84 ( sP41_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP42_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP42_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP45_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP45_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP48_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP48_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP50_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 3.63/3.84 ( sP50_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP51_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP51_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP53_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 3.63/3.84 ( sP53_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP54_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP54_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP56_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 3.63/3.84 ( sP56_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP57_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP57_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP59_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 3.63/3.84 ( sP59_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP60_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP60_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP63_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP63_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP66_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP66_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP68_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 3.63/3.84 ( sP68_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP69_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP69_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP71_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 3.63/3.84 ( sP71_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP72_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP72_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP75_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP75_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP78_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP78_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP81_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP81_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP84_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP84_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP87_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP87_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP90_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP90_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP93_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP93_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP95_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] : % 3.63/3.84 ( sP95_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP96_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP96_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP99_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP99_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP102_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP102_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP105_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP105_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP108_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP108_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP110_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 3.63/3.84 ( sP110_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP111_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP111_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP113_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 3.63/3.84 ( sP113_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP114_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP114_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP116_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 3.63/3.84 ( sP116_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP117_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP117_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP119_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 3.63/3.84 ( sP119_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP120_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP120_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP122_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 3.63/3.84 ( sP122_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP123_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP123_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP125_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 3.63/3.84 ( sP125_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP126_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP126_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP128_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 3.63/3.84 ( sP128_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP129_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP129_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP131_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 3.63/3.84 ( sP131_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP132_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP132_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP133_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] : % 3.63/3.84 ( sP133_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP135_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( sP135_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 3.63/3.84 $true % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP136_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] : % 3.63/3.84 ( sP136_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=> % 3.63/3.84 $false % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP138_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP138_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP139_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] : % 3.63/3.84 ( sP139_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 & X11=sk3_esk9_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Negative definition of sP141_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6] : % 3.63/3.84 ( ~(sP141_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 %------ Positive definition of sP142_iProver_split % 3.63/3.84 fof(lit_def,axiom, % 3.63/3.84 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] : % 3.63/3.84 ( sP142_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=> % 3.63/3.84 ( % 3.63/3.84 ( % 3.63/3.84 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk7_0 & X3=sk3_esk3_0 & X4=sk3_esk2_0 & X5=sk3_esk4_0 & X6=sk3_esk5_0 & X10=sk3_esk9_0 & X11=sk3_esk9_0 ) % 3.63/3.84 ) % 3.63/3.84 % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ) % 3.63/3.84 ). % 3.63/3.84 % 3.63/3.84 % 3.63/3.84 % 3.63/3.84 % ------ Statistics % 3.63/3.84 % 3.63/3.84 % ------ General % 3.63/3.84 % 3.63/3.84 % num_of_input_clauses: 135 % 3.63/3.84 % num_of_input_neg_conjectures: 1 % 3.63/3.84 % num_of_splits: 144 % 3.63/3.84 % num_of_split_atoms: 144 % 3.63/3.84 % num_of_sem_filtered_clauses: 0 % 3.63/3.84 % num_of_subtypes: 0 % 3.63/3.84 % monotx_restored_types: 0 % 3.63/3.84 % sat_num_of_epr_types: 0 % 3.63/3.84 % sat_num_of_non_cyclic_types: 0 % 3.63/3.84 % sat_guarded_non_collapsed_types: 0 % 3.63/3.84 % is_epr: 0 % 3.63/3.84 % is_horn: 0 % 3.63/3.84 % has_eq: 0 % 3.63/3.84 % num_pure_diseq_elim: 0 % 3.63/3.84 % simp_replaced_by: 0 % 3.63/3.84 % res_preprocessed: 280 % 3.63/3.84 % prep_upred: 0 % 3.63/3.84 % prep_unflattend: 0 % 3.63/3.84 % pred_elim_cands: 180 % 3.63/3.84 % pred_elim: 56 % 3.63/3.84 % pred_elim_cl: 19 % 3.63/3.84 % pred_elim_cycles: 286 % 3.63/3.84 % forced_gc_time: 0 % 3.63/3.84 % gc_basic_clause_elim: 0 % 3.63/3.84 % parsing_time: 0.018 % 3.63/3.84 % sem_filter_time: 0. % 3.63/3.84 % pred_elim_time: 0.901 % 3.63/3.84 % out_proof_time: 0. % 3.63/3.84 % monotx_time: 0. % 3.63/3.84 % subtype_inf_time: 0. % 3.63/3.84 % unif_index_cands_time: 0.004 % 3.63/3.84 % unif_index_add_time: 0.006 % 3.63/3.84 % total_time: 3.398 % 3.63/3.84 % num_of_symbols: 247 % 3.63/3.84 % num_of_terms: 15398 % 3.63/3.84 % 3.63/3.84 % ------ Propositional Solver % 3.63/3.84 % 3.63/3.84 % prop_solver_calls: 8 % 3.63/3.84 % prop_fast_solver_calls: 19908 % 3.63/3.84 % prop_num_of_clauses: 3153 % 3.63/3.84 % prop_preprocess_simplified: 7520 % 3.63/3.84 % prop_fo_subsumed: 216 % 3.63/3.84 % prop_solver_time: 0. % 3.63/3.84 % prop_fast_solver_time: 0.032 % 3.63/3.84 % prop_unsat_core_time: 0. % 3.63/3.84 % 3.63/3.84 % ------ QBF % 3.63/3.84 % 3.63/3.84 % qbf_q_res: 0 % 3.63/3.84 % qbf_num_tautologies: 0 % 3.63/3.84 % qbf_prep_cycles: 0 % 3.63/3.84 % 3.63/3.84 % ------ BMC1 % 3.63/3.84 % 3.63/3.84 % bmc1_current_bound: -1 % 3.63/3.84 % bmc1_last_solved_bound: -1 % 3.63/3.84 % bmc1_unsat_core_size: -1 % 3.63/3.84 % bmc1_unsat_core_parents_size: -1 % 3.63/3.84 % bmc1_merge_next_fun: 0 % 3.63/3.84 % bmc1_unsat_core_clauses_time: 0. % 3.63/3.84 % 3.63/3.84 % ------ Instantiation % 3.63/3.84 % 3.63/3.84 % inst_num_of_clauses: 702 % 3.63/3.84 % inst_num_in_passive: 0 % 3.63/3.84 % inst_num_in_active: 702 % 3.63/3.84 % inst_num_in_unprocessed: 0 % 3.63/3.84 % inst_num_of_loops: 736 % 3.63/3.84 % inst_num_of_learning_restarts: 0 % 3.63/3.84 % inst_num_moves_active_passive: 20 % 3.63/3.84 % inst_lit_activity: 104 % 3.63/3.84 % inst_lit_activity_moves: 0 % 3.63/3.84 % inst_num_tautologies: 0 % 3.63/3.84 % inst_num_prop_implied: 0 % 3.63/3.84 % inst_num_existing_simplified: 0 % 3.63/3.84 % inst_num_eq_res_simplified: 0 % 3.63/3.84 % inst_num_child_elim: 0 % 3.63/3.84 % inst_num_of_dismatching_blockings: 14 % 3.63/3.84 % inst_num_of_non_proper_insts: 537 % 3.63/3.84 % inst_num_of_duplicates: 51 % 3.63/3.84 % inst_inst_num_from_inst_to_res: 0 % 3.63/3.84 % inst_dismatching_checking_time: 0. % 3.63/3.84 % 3.63/3.84 % ------ Resolution % 3.63/3.84 % 3.63/3.84 % res_num_of_clauses: 4099 % 3.63/3.84 % res_num_in_passive: 1405 % 3.63/3.84 % res_num_in_active: 2698 % 3.63/3.84 % res_num_of_loops: 3000 % 3.63/3.84 % res_forward_subset_subsumed: 592 % 3.63/3.84 % res_backward_subset_subsumed: 8 % 3.63/3.84 % res_forward_subsumed: 4 % 3.63/3.84 % res_backward_subsumed: 0 % 3.63/3.84 % res_forward_subsumption_resolution: 2558 % 3.63/3.84 % res_backward_subsumption_resolution: 0 % 3.63/3.84 % res_clause_to_clause_subsumption: 11027 % 3.63/3.84 % res_orphan_elimination: 0 % 3.63/3.84 % res_tautology_del: 152 % 3.63/3.84 % res_num_eq_res_simplified: 0 % 3.63/3.84 % res_num_sel_changes: 0 % 3.63/3.84 % res_moves_from_active_to_pass: 0 % 3.63/3.84 % 3.63/3.84 % Status Unknown % 3.68/3.92 % Orienting using strategy ClausalAll % 3.68/3.92 % FOF problem with conjecture % 3.68/3.92 % 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_fb7806.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_ea43a5.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_37f86b | grep -v "SZS" % 3.68/3.94 % 3.68/3.94 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 3.68/3.94 % 3.68/3.94 % % 3.68/3.94 % ------ iProver source info % 3.68/3.94 % 3.68/3.94 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 3.68/3.94 % git: non_committed_changes: true % 3.68/3.94 % git: last_make_outside_of_git: true % 3.68/3.94 % 3.68/3.94 % % 3.68/3.94 % ------ Input Options % 3.68/3.94 % 3.68/3.94 % --out_options all % 3.68/3.94 % --tptp_safe_out true % 3.68/3.94 % --problem_path "" % 3.68/3.94 % --include_path "" % 3.68/3.94 % --clausifier .//eprover % 3.68/3.94 % --clausifier_options --tstp-format % 3.68/3.94 % --stdin false % 3.68/3.94 % --dbg_backtrace false % 3.68/3.94 % --dbg_dump_prop_clauses false % 3.68/3.94 % --dbg_dump_prop_clauses_file - % 3.68/3.94 % --dbg_out_stat false % 3.68/3.94 % 3.68/3.94 % ------ General Options % 3.68/3.94 % 3.68/3.94 % --fof false % 3.68/3.94 % --time_out_real 150. % 3.68/3.94 % --time_out_prep_mult 0.2 % 3.68/3.94 % --time_out_virtual -1. % 3.68/3.94 % --schedule none % 3.68/3.94 % --ground_splitting input % 3.68/3.94 % --splitting_nvd 16 % 3.68/3.94 % --non_eq_to_eq false % 3.68/3.94 % --prep_gs_sim true % 3.68/3.94 % --prep_unflatten false % 3.68/3.94 % --prep_res_sim true % 3.68/3.94 % --prep_upred true % 3.68/3.94 % --res_sim_input true % 3.68/3.94 % --clause_weak_htbl true % 3.68/3.94 % --gc_record_bc_elim false % 3.68/3.94 % --symbol_type_check false % 3.68/3.94 % --clausify_out false % 3.68/3.94 % --large_theory_mode false % 3.68/3.94 % --prep_sem_filter none % 3.68/3.94 % --prep_sem_filter_out false % 3.68/3.94 % --preprocessed_out false % 3.68/3.94 % --sub_typing false % 3.68/3.94 % --brand_transform false % 3.68/3.94 % --pure_diseq_elim true % 3.68/3.94 % --min_unsat_core false % 3.68/3.94 % --pred_elim true % 3.68/3.94 % --add_important_lit false % 3.68/3.94 % --soft_assumptions false % 3.68/3.94 % --reset_solvers false % 3.68/3.94 % --bc_imp_inh [] % 3.68/3.94 % --conj_cone_tolerance 1.5 % 3.68/3.94 % --prolific_symb_bound 500 % 3.68/3.94 % --lt_threshold 2000 % 3.68/3.94 % 3.68/3.94 % ------ SAT Options % 3.68/3.94 % 3.68/3.94 % --sat_mode false % 3.68/3.94 % --sat_fm_restart_options "" % 3.68/3.94 % --sat_gr_def false % 3.68/3.94 % --sat_epr_types true % 3.68/3.94 % --sat_non_cyclic_types false % 3.68/3.94 % --sat_finite_models false % 3.68/3.94 % --sat_fm_lemmas false % 3.68/3.94 % --sat_fm_prep false % 3.68/3.94 % --sat_fm_uc_incr true % 3.68/3.94 % --sat_out_model small % 3.68/3.94 % --sat_out_clauses false % 3.68/3.94 % 3.68/3.94 % ------ QBF Options % 3.68/3.94 % 3.68/3.94 % --qbf_mode false % 3.68/3.94 % --qbf_elim_univ true % 3.68/3.94 % --qbf_sk_in true % 3.68/3.94 % --qbf_pred_elim true % 3.68/3.94 % --qbf_split 32 % 3.68/3.94 % 3.68/3.94 % ------ BMC1 Options % 3.68/3.94 % 3.68/3.94 % --bmc1_incremental false % 3.68/3.94 % --bmc1_axioms reachable_all % 3.68/3.94 % --bmc1_min_bound 0 % 3.68/3.94 % --bmc1_max_bound -1 % 3.68/3.94 % --bmc1_max_bound_default -1 % 3.68/3.94 % --bmc1_symbol_reachability true % 3.68/3.94 % --bmc1_property_lemmas false % 3.68/3.94 % --bmc1_k_induction false % 3.68/3.94 % --bmc1_non_equiv_states false % 3.68/3.94 % --bmc1_deadlock false % 3.68/3.94 % --bmc1_ucm false % 3.68/3.94 % --bmc1_add_unsat_core none % 3.68/3.94 % --bmc1_unsat_core_children false % 3.68/3.94 % --bmc1_unsat_core_extrapolate_axioms false % 3.68/3.94 % --bmc1_out_stat full % 3.68/3.94 % --bmc1_ground_init false % 3.68/3.94 % --bmc1_pre_inst_next_state false % 3.68/3.94 % --bmc1_pre_inst_state false % 3.68/3.94 % --bmc1_pre_inst_reach_state false % 3.68/3.94 % --bmc1_out_unsat_core false % 3.68/3.94 % --bmc1_aig_witness_out false % 3.68/3.94 % --bmc1_verbose false % 3.68/3.94 % --bmc1_dump_clauses_tptp false % 4.78/4.98 % --bmc1_dump_unsat_core_tptp false % 4.78/4.98 % --bmc1_dump_file - % 4.78/4.98 % --bmc1_ucm_expand_uc_limit 128 % 4.78/4.98 % --bmc1_ucm_n_expand_iterations 6 % 4.78/4.98 % --bmc1_ucm_extend_mode 1 % 4.78/4.98 % --bmc1_ucm_init_mode 2 % 4.78/4.98 % --bmc1_ucm_cone_mode none % 4.78/4.98 % --bmc1_ucm_reduced_relation_type 0 % 4.78/4.98 % --bmc1_ucm_relax_model 4 % 4.78/4.98 % --bmc1_ucm_full_tr_after_sat true % 4.78/4.98 % --bmc1_ucm_expand_neg_assumptions false % 4.78/4.98 % --bmc1_ucm_layered_model none % 4.78/4.98 % --bmc1_ucm_max_lemma_size 10 % 4.78/4.98 % 4.78/4.98 % ------ AIG Options % 4.78/4.98 % 4.78/4.98 % --aig_mode false % 4.78/4.98 % 4.78/4.98 % ------ Instantiation Options % 4.78/4.98 % 4.78/4.98 % --instantiation_flag true % 4.78/4.98 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 4.78/4.98 % --inst_solver_per_active 750 % 4.78/4.98 % --inst_solver_calls_frac 0.5 % 4.78/4.98 % --inst_passive_queue_type priority_queues % 4.78/4.98 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 4.78/4.98 % --inst_passive_queues_freq [25;2] % 4.78/4.98 % --inst_dismatching true % 4.78/4.98 % --inst_eager_unprocessed_to_passive true % 4.78/4.98 % --inst_prop_sim_given true % 4.78/4.98 % --inst_prop_sim_new false % 4.78/4.98 % --inst_orphan_elimination true % 4.78/4.98 % --inst_learning_loop_flag true % 4.78/4.98 % --inst_learning_start 3000 % 4.78/4.98 % --inst_learning_factor 2 % 4.78/4.98 % --inst_start_prop_sim_after_learn 3 % 4.78/4.98 % --inst_sel_renew solver % 4.78/4.98 % --inst_lit_activity_flag true % 4.78/4.98 % --inst_out_proof true % 4.78/4.98 % 4.78/4.98 % ------ Resolution Options % 4.78/4.98 % 4.78/4.98 % --resolution_flag true % 4.78/4.98 % --res_lit_sel kbo_max % 4.78/4.98 % --res_to_prop_solver none % 4.78/4.98 % --res_prop_simpl_new false % 4.78/4.98 % --res_prop_simpl_given false % 4.78/4.98 % --res_passive_queue_type priority_queues % 4.78/4.98 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 4.78/4.98 % --res_passive_queues_freq [15;5] % 4.78/4.98 % --res_forward_subs full % 4.78/4.98 % --res_backward_subs full % 4.78/4.98 % --res_forward_subs_resolution true % 4.78/4.98 % --res_backward_subs_resolution true % 4.78/4.98 % --res_orphan_elimination false % 4.78/4.98 % --res_time_limit 1000. % 4.78/4.98 % --res_out_proof true % 4.78/4.98 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fb7806.s % 4.78/4.98 % --modulo true % 4.78/4.98 % 4.78/4.98 % ------ Combination Options % 4.78/4.98 % 4.78/4.98 % --comb_res_mult 1000 % 4.78/4.98 % --comb_inst_mult 300 % 4.78/4.98 % ------ % 4.78/4.98 % 4.78/4.98 % ------ Parsing...% successful % 4.78/4.98 % 4.78/4.98 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 144 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe_e snvd_s sp: 0 0s snvd_e % % 4.78/4.98 % 4.78/4.98 % ------ Proving... % 4.78/4.98 % ------ Problem Properties % 4.78/4.98 % 4.78/4.98 % % 4.78/4.98 % EPR false % 4.78/4.98 % Horn false % 4.78/4.98 % Has equality false % 4.78/4.98 % 4.78/4.98 % % ------ Input Options Time Limit: Unbounded % 4.78/4.98 % 4.78/4.98 % 4.78/4.98 % % ------ Current options: % 4.78/4.98 % 4.78/4.98 % ------ Input Options % 4.78/4.98 % 4.78/4.98 % --out_options all % 4.78/4.98 % --tptp_safe_out true % 4.78/4.98 % --problem_path "" % 4.78/4.98 % --include_path "" % 4.78/4.98 % --clausifier .//eprover % 4.78/4.98 % --clausifier_options --tstp-format % 4.78/4.98 % --stdin false % 4.78/4.98 % --dbg_backtrace false % 4.78/4.98 % --dbg_dump_prop_clauses false % 4.78/4.98 % --dbg_dump_prop_clauses_file - % 4.78/4.98 % --dbg_out_stat false % 4.78/4.98 % 4.78/4.98 % ------ General Options % 4.78/4.98 % 4.78/4.98 % --fof false % 4.78/4.98 % --time_out_real 150. % 4.78/4.98 % --time_out_prep_mult 0.2 % 4.78/4.98 % --time_out_virtual -1. % 4.78/4.98 % --schedule none % 4.78/4.98 % --ground_splitting input % 4.78/4.98 % --splitting_nvd 16 % 4.78/4.98 % --non_eq_to_eq false % 4.78/4.98 % --prep_gs_sim true % 4.78/4.98 % --prep_unflatten false % 4.78/4.98 % --prep_res_sim true % 4.78/4.98 % --prep_upred true % 4.78/4.98 % --res_sim_input true % 4.78/4.98 % --clause_weak_htbl true % 4.78/4.98 % --gc_record_bc_elim false % 4.78/4.98 % --symbol_type_check false % 4.78/4.98 % --clausify_out false % 4.78/4.98 % --large_theory_mode false % 4.78/4.98 % --prep_sem_filter none % 4.78/4.98 % --prep_sem_filter_out false % 4.78/4.98 % --preprocessed_out false % 4.78/4.98 % --sub_typing false % 4.78/4.98 % --brand_transform false % 4.78/4.98 % --pure_diseq_elim true % 4.78/4.98 % --min_unsat_core false % 4.78/4.98 % --pred_elim true % 4.78/4.98 % --add_important_lit false % 4.78/4.98 % --soft_assumptions false % 4.78/4.98 % --reset_solvers false % 4.78/4.98 % --bc_imp_inh [] % 4.78/4.98 % --conj_cone_tolerance 1.5 % 4.78/4.98 % --prolific_symb_bound 500 % 4.78/4.98 % --lt_threshold 2000 % 4.78/4.98 % 4.78/4.98 % ------ SAT Options % 4.78/4.98 % 4.78/4.98 % --sat_mode false % 4.78/4.98 % --sat_fm_restart_options "" % 4.78/4.98 % --sat_gr_def false % 4.78/4.98 % --sat_epr_types true % 4.78/4.98 % --sat_non_cyclic_types false % 4.78/4.98 % --sat_finite_models false % 4.78/4.98 % --sat_fm_lemmas false % 4.78/4.98 % --sat_fm_prep false % 4.78/4.98 % --sat_fm_uc_incr true % 4.78/4.98 % --sat_out_model small % 4.78/4.98 % --sat_out_clauses false % 4.78/4.98 % 4.78/4.98 % ------ QBF Options % 4.78/4.98 % 4.78/4.98 % --qbf_mode false % 4.78/4.98 % --qbf_elim_univ true % 4.78/4.98 % --qbf_sk_in true % 4.78/4.98 % --qbf_pred_elim true % 4.78/4.98 % --qbf_split 32 % 4.78/4.98 % 4.78/4.98 % ------ BMC1 Options % 4.78/4.98 % 4.78/4.98 % --bmc1_incremental false % 4.78/4.98 % --bmc1_axioms reachable_all % 4.78/4.98 % --bmc1_min_bound 0 % 4.78/4.98 % --bmc1_max_bound -1 % 4.78/4.98 % --bmc1_max_bound_default -1 % 4.78/4.98 % --bmc1_symbol_reachability true % 4.78/4.98 % --bmc1_property_lemmas false % 4.78/4.98 % --bmc1_k_induction false % 4.78/4.98 % --bmc1_non_equiv_states false % 4.78/4.98 % --bmc1_deadlock false % 4.78/4.98 % --bmc1_ucm false % 4.78/4.98 % --bmc1_add_unsat_core none % 4.78/4.98 % --bmc1_unsat_core_children false % 4.78/4.98 % --bmc1_unsat_core_extrapolate_axioms false % 4.78/4.98 % --bmc1_out_stat full % 4.78/4.98 % --bmc1_ground_init false % 4.78/4.98 % --bmc1_pre_inst_next_state false % 4.78/4.98 % --bmc1_pre_inst_state false % 4.78/4.98 % --bmc1_pre_inst_reach_state false % 4.78/4.98 % --bmc1_out_unsat_core false % 4.78/4.98 % --bmc1_aig_witness_out false % 4.78/4.98 % --bmc1_verbose false % 4.78/4.98 % --bmc1_dump_clauses_tptp false % 4.78/4.98 % --bmc1_dump_unsat_core_tptp false % 4.78/4.98 % --bmc1_dump_file - % 4.78/4.98 % --bmc1_ucm_expand_uc_limit 128 % 4.78/4.98 % --bmc1_ucm_n_expand_iterations 6 % 4.78/4.98 % --bmc1_ucm_extend_mode 1 % 4.78/4.98 % --bmc1_ucm_init_mode 2 % 4.78/4.98 % --bmc1_ucm_cone_mode none % 4.78/4.98 % --bmc1_ucm_reduced_relation_type 0 % 4.78/4.98 % --bmc1_ucm_relax_model 4 % 4.78/4.98 % --bmc1_ucm_full_tr_after_sat true % 4.78/4.98 % --bmc1_ucm_expand_neg_assumptions false % 4.78/4.98 % --bmc1_ucm_layered_model none % 4.78/4.98 % --bmc1_ucm_max_lemma_size 10 % 4.78/4.98 % 4.78/4.98 % ------ AIG Options % 4.78/4.98 % 4.78/4.98 % --aig_mode false % 4.78/4.98 % 4.78/4.98 % ------ Instantiation Options % 4.78/4.98 % 4.78/4.98 % --instantiation_flag true % 4.78/4.98 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 4.78/4.98 % --inst_solver_per_active 750 % 4.78/4.98 % --inst_solver_calls_frac 0.5 % 4.78/4.98 % --inst_passive_queue_type priority_queues % 4.78/4.98 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 4.78/4.98 % --inst_passive_queues_freq [25;2] % 4.78/4.98 % --inst_dismatching true % 4.78/4.98 % --inst_eager_unprocessed_to_passive true % 7.15/7.38 % --inst_prop_sim_given true % 7.15/7.38 % --inst_prop_sim_new false % 7.15/7.38 % --inst_orphan_elimination true % 7.15/7.38 % --inst_learning_loop_flag true % 7.15/7.38 % --inst_learning_start 3000 % 7.15/7.38 % --inst_learning_factor 2 % 7.15/7.38 % --inst_start_prop_sim_after_learn 3 % 7.15/7.38 % --inst_sel_renew solver % 7.15/7.38 % --inst_lit_activity_flag true % 7.15/7.38 % --inst_out_proof true % 7.15/7.38 % 7.15/7.38 % ------ Resolution Options % 7.15/7.38 % 7.15/7.38 % --resolution_flag true % 7.15/7.38 % --res_lit_sel kbo_max % 7.15/7.38 % --res_to_prop_solver none % 7.15/7.38 % --res_prop_simpl_new false % 7.15/7.38 % --res_prop_simpl_given false % 7.15/7.38 % --res_passive_queue_type priority_queues % 7.15/7.38 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 7.15/7.38 % --res_passive_queues_freq [15;5] % 7.15/7.38 % --res_forward_subs full % 7.15/7.38 % --res_backward_subs full % 7.15/7.39 % --res_forward_subs_resolution true % 7.15/7.39 % --res_backward_subs_resolution true % 7.15/7.39 % --res_orphan_elimination false % 7.15/7.39 % --res_time_limit 1000. % 7.15/7.39 % --res_out_proof true % 7.15/7.39 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_fb7806.s % 7.15/7.39 % --modulo true % 7.15/7.39 % 7.15/7.39 % ------ Combination Options % 7.15/7.39 % 7.15/7.39 % --comb_res_mult 1000 % 7.15/7.39 % --comb_inst_mult 300 % 7.15/7.39 % ------ % 7.15/7.39 % 7.15/7.39 % 7.15/7.39 % 7.15/7.39 % ------ Proving... % 7.15/7.39 % warning: shown sat in sat incomplete mode % 7.15/7.39 % % 7.15/7.39 % 7.15/7.39 % 7.15/7.39 ------ Building Model...Done % 7.15/7.39 % 7.15/7.39 %------ The model is defined over ground terms (initial term algebra). % 7.15/7.39 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 7.15/7.39 %------ where \phi is a formula over the term algebra. % 7.15/7.39 %------ If we have equality in the problem then it is also defined as a predicate above, % 7.15/7.39 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 7.15/7.39 %------ See help for --sat_out_model for different model outputs. % 7.15/7.39 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 7.15/7.39 %------ where the first argument stands for the sort ($i in the unsorted case) % 7.15/7.39 % 7.15/7.39 % 7.15/7.39 % 7.15/7.39 % 7.15/7.39 %------ Positive definition of epred2_0 % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 ( epred2_0 <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of actual_world % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0] : % 7.15/7.39 ( ~(actual_world(X0)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of of % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2] : % 7.15/7.39 ( ~(of(X0,X1,X2)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of man % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( man(X0,X1) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of jules_forename % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( jules_forename(X0,X1) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of forename % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( ~(forename(X0,X1)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of frontseat % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( frontseat(X0,X1) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of chevy % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( chevy(X0,X1) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of white % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( ~(white(X0,X1)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of dirty % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( ~(dirty(X0,X1)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of old % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( ~(old(X0,X1)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of city % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( city(X0,X1) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of hollywood_placename % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( hollywood_placename(X0,X1) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of placename % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( ~(placename(X0,X1)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of street % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( ~(street(X0,X1)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of lonely % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( lonely(X0,X1) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of event % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( event(X0,X1) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk8_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of agent % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2] : % 7.15/7.39 ( agent(X0,X1,X2) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk8_0 & X2=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of present % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( ~(present(X0,X1)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of barrel % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( ~(barrel(X0,X1)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of down % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2] : % 7.15/7.39 ( down(X0,X1,X2) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk8_0 & X2=sk2_esk7_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of in % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2] : % 7.15/7.39 ( in(X0,X1,X2) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk8_0 & X2=sk2_esk7_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of be % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3] : % 7.15/7.39 ( be(X0,X1,X2,X3) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk14_0 & X2=sk2_esk2_0 & X3=sk2_esk15_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of state % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( state(X0,X1) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk14_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of two % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( two(X0,X1) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk9_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of group % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( group(X0,X1) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk9_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 | % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk12_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of wear % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( wear(X0,X1) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of nonreflexive % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( nonreflexive(X0,X1) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of behind % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2] : % 7.15/7.39 ( behind(X0,X1,X2) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk15_0 & X2=sk2_esk15_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of wheel % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1] : % 7.15/7.39 ( wheel(X0,X1) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk15_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of epred1_0 % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 ( epred1_0 <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of member % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2] : % 7.15/7.39 ( member(X0,X1,X2) <=> % 7.15/7.39 ( % 7.15/7.39 ? [X3,X4] : % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk18_10(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0,sk2_esk4_0,sk2_esk5_0,sk2_esk6_0,sk2_esk7_0,X3,X4,sk2_esk12_0) & X2=sk2_esk12_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 | % 7.15/7.39 ? [X3,X4] : % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk19_10(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0,sk2_esk4_0,sk2_esk5_0,sk2_esk6_0,sk2_esk7_0,X3,sk2_esk12_0,X4) & X2=sk2_esk12_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 | % 7.15/7.39 ? [X3] : % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk20_10(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0,sk2_esk4_0,sk2_esk5_0,sk2_esk6_0,sk2_esk7_0,X3,sk2_esk9_0,sk2_esk12_0) & X2=sk2_esk12_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 | % 7.15/7.39 ? [X3,X4] : % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk18_10(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0,sk2_esk4_0,sk2_esk5_0,sk2_esk6_0,sk2_esk7_0,X3,X4,X2) ) % 7.15/7.39 & % 7.15/7.39 ( X2!=sk2_esk9_0 ) % 7.15/7.39 & % 7.15/7.39 ( X2!=sk2_esk12_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 | % 7.15/7.39 ? [X3,X4] : % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk19_10(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0,sk2_esk4_0,sk2_esk5_0,sk2_esk6_0,sk2_esk7_0,X3,X2,X4) ) % 7.15/7.39 & % 7.15/7.39 ( X2!=sk2_esk9_0 ) % 7.15/7.39 & % 7.15/7.39 ( X2!=sk2_esk9_0 | X4!=sk2_esk9_0 ) % 7.15/7.39 & % 7.15/7.39 ( X2!=sk2_esk12_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 | % 7.15/7.39 ? [X3] : % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk20_10(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0,sk2_esk4_0,sk2_esk5_0,sk2_esk6_0,sk2_esk7_0,X3,sk2_esk9_0,X2) ) % 7.15/7.39 & % 7.15/7.39 ( X2!=sk2_esk9_0 ) % 7.15/7.39 & % 7.15/7.39 ( X2!=sk2_esk12_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP0_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP3_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP6_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP9_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP12_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP15_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP15_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP18_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP18_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP21_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP21_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP24_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP24_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP27_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP27_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP30_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP32_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 7.15/7.39 ( sP32_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP33_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP33_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP35_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 7.15/7.39 ( sP35_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP36_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP36_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP38_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 7.15/7.39 ( sP38_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP39_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP39_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP41_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 7.15/7.39 ( sP41_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP42_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP42_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP45_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP45_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP48_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP48_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP50_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 7.15/7.39 ( sP50_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP51_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP51_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP53_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 7.15/7.39 ( sP53_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP54_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP54_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP56_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 7.15/7.39 ( sP56_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP57_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP57_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP59_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 7.15/7.39 ( sP59_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP60_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP60_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP63_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP63_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP66_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP66_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP68_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 7.15/7.39 ( sP68_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP69_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP69_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP71_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 7.15/7.39 ( sP71_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP72_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP72_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP75_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP75_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP78_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP78_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP81_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP81_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP84_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP84_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP87_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP87_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP90_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP90_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP93_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP93_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP95_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] : % 7.15/7.39 ( sP95_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP96_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP96_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP99_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP99_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP102_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP102_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP105_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP105_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP108_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP108_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP110_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 7.15/7.39 ( sP110_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP111_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP111_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP113_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 7.15/7.39 ( sP113_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP114_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP114_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP116_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 7.15/7.39 ( sP116_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP117_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP117_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP119_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 7.15/7.39 ( sP119_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP120_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP120_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP122_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 7.15/7.39 ( sP122_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP123_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP123_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP125_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 7.15/7.39 ( sP125_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP126_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP126_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP128_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 7.15/7.39 ( sP128_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP129_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP129_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP131_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 7.15/7.39 ( sP131_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP132_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP132_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP133_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] : % 7.15/7.39 ( sP133_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP135_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( sP135_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=> % 7.15/7.39 $true % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP136_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] : % 7.15/7.39 ( sP136_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=> % 7.15/7.39 $false % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP138_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP138_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP139_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] : % 7.15/7.39 ( sP139_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 & X11=sk2_esk9_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Negative definition of sP141_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6] : % 7.15/7.39 ( ~(sP141_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 %------ Positive definition of sP142_iProver_split % 7.15/7.39 fof(lit_def,axiom, % 7.15/7.39 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] : % 7.15/7.39 ( sP142_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=> % 7.15/7.39 ( % 7.15/7.39 ( % 7.15/7.39 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk7_0 & X3=sk2_esk3_0 & X4=sk2_esk2_0 & X5=sk2_esk4_0 & X6=sk2_esk5_0 & X10=sk2_esk9_0 & X11=sk2_esk9_0 ) % 7.15/7.39 ) % 7.15/7.39 % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ) % 7.15/7.39 ). % 7.15/7.39 % 7.15/7.39 % 7.15/7.39 % 7.15/7.39 % ------ Statistics % 7.15/7.39 % 7.15/7.39 % ------ General % 7.15/7.39 % 7.15/7.39 % num_of_input_clauses: 135 % 7.15/7.39 % num_of_input_neg_conjectures: 1 % 7.15/7.39 % num_of_splits: 144 % 7.15/7.39 % num_of_split_atoms: 144 % 7.15/7.39 % num_of_sem_filtered_clauses: 0 % 7.15/7.39 % num_of_subtypes: 0 % 7.15/7.39 % monotx_restored_types: 0 % 7.15/7.39 % sat_num_of_epr_types: 0 % 7.15/7.39 % sat_num_of_non_cyclic_types: 0 % 7.15/7.39 % sat_guarded_non_collapsed_types: 0 % 7.15/7.39 % is_epr: 0 % 7.15/7.39 % is_horn: 0 % 7.15/7.39 % has_eq: 0 % 7.15/7.39 % num_pure_diseq_elim: 0 % 7.15/7.39 % simp_replaced_by: 0 % 7.15/7.39 % res_preprocessed: 280 % 7.15/7.39 % prep_upred: 0 % 7.15/7.39 % prep_unflattend: 0 % 7.15/7.39 % pred_elim_cands: 180 % 7.15/7.39 % pred_elim: 56 % 7.15/7.39 % pred_elim_cl: 19 % 7.15/7.39 % pred_elim_cycles: 286 % 7.15/7.39 % forced_gc_time: 0 % 7.15/7.39 % gc_basic_clause_elim: 0 % 7.15/7.39 % parsing_time: 0.031 % 7.15/7.39 % sem_filter_time: 0. % 7.15/7.39 % pred_elim_time: 0.898 % 7.15/7.39 % out_proof_time: 0. % 7.15/7.39 % monotx_time: 0. % 7.15/7.39 % subtype_inf_time: 0. % 7.15/7.39 % unif_index_cands_time: 0.004 % 7.15/7.39 % unif_index_add_time: 0.006 % 7.15/7.39 % total_time: 3.459 % 7.15/7.39 % num_of_symbols: 247 % 7.15/7.39 % num_of_terms: 15398 % 7.15/7.39 % 7.15/7.39 % ------ Propositional Solver % 7.15/7.39 % 7.15/7.39 % prop_solver_calls: 8 % 7.15/7.39 % prop_fast_solver_calls: 19908 % 7.15/7.39 % prop_num_of_clauses: 3153 % 7.15/7.39 % prop_preprocess_simplified: 7520 % 7.15/7.39 % prop_fo_subsumed: 216 % 7.15/7.39 % prop_solver_time: 0. % 7.15/7.39 % prop_fast_solver_time: 0.034 % 7.15/7.39 % prop_unsat_core_time: 0. % 7.15/7.39 % 7.15/7.39 % ------ QBF % 7.15/7.39 % 7.15/7.39 % qbf_q_res: 0 % 7.15/7.39 % qbf_num_tautologies: 0 % 7.15/7.39 % qbf_prep_cycles: 0 % 7.15/7.39 % 7.15/7.39 % ------ BMC1 % 7.15/7.39 % 7.15/7.39 % bmc1_current_bound: -1 % 7.15/7.39 % bmc1_last_solved_bound: -1 % 7.15/7.39 % bmc1_unsat_core_size: -1 % 7.15/7.39 % bmc1_unsat_core_parents_size: -1 % 7.15/7.39 % bmc1_merge_next_fun: 0 % 7.15/7.39 % bmc1_unsat_core_clauses_time: 0. % 7.15/7.39 % 7.15/7.39 % ------ Instantiation % 7.15/7.39 % 7.15/7.39 % inst_num_of_clauses: 702 % 7.15/7.39 % inst_num_in_passive: 0 % 7.15/7.39 % inst_num_in_active: 702 % 7.15/7.39 % inst_num_in_unprocessed: 0 % 7.15/7.39 % inst_num_of_loops: 736 % 7.15/7.39 % inst_num_of_learning_restarts: 0 % 7.15/7.39 % inst_num_moves_active_passive: 20 % 7.15/7.39 % inst_lit_activity: 104 % 7.15/7.39 % inst_lit_activity_moves: 0 % 7.15/7.39 % inst_num_tautologies: 0 % 7.15/7.39 % inst_num_prop_implied: 0 % 7.15/7.39 % inst_num_existing_simplified: 0 % 7.15/7.39 % inst_num_eq_res_simplified: 0 % 7.15/7.39 % inst_num_child_elim: 0 % 7.15/7.39 % inst_num_of_dismatching_blockings: 14 % 7.15/7.39 % inst_num_of_non_proper_insts: 537 % 7.15/7.39 % inst_num_of_duplicates: 51 % 7.15/7.39 % inst_inst_num_from_inst_to_res: 0 % 7.15/7.39 % inst_dismatching_checking_time: 0. % 7.15/7.39 % 7.15/7.39 % ------ Resolution % 7.15/7.39 % 7.15/7.39 % res_num_of_clauses: 4099 % 7.15/7.39 % res_num_in_passive: 1405 % 7.15/7.39 % res_num_in_active: 2698 % 7.15/7.39 % res_num_of_loops: 3000 % 7.15/7.39 % res_forward_subset_subsumed: 592 % 7.15/7.39 % res_backward_subset_subsumed: 8 % 7.15/7.39 % res_forward_subsumed: 4 % 7.15/7.39 % res_backward_subsumed: 0 % 7.15/7.39 % res_forward_subsumption_resolution: 2558 % 7.15/7.39 % res_backward_subsumption_resolution: 0 % 7.15/7.39 % res_clause_to_clause_subsumption: 11027 % 7.15/7.39 % res_orphan_elimination: 0 % 7.15/7.39 % res_tautology_del: 152 % 7.15/7.39 % res_num_eq_res_simplified: 0 % 7.15/7.39 % res_num_sel_changes: 0 % 7.15/7.39 % res_moves_from_active_to_pass: 0 % 7.15/7.39 % 7.15/7.39 % Status Unknown % 7.15/7.39 % Last status : % 7.15/7.39 % SZS status Unknown %------------------------------------------------------------------------------