%------------------------------------------------------------------------------ % File : iProverMo---2.5-0.1 % Problem : NLP250-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : iprover_modulo %s %d % Computer : n026.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:44:19 EDT 2022 % Result : Unknown 159.67s 159.89s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : NLP250-1 : TPTP v8.1.0. Released v2.4.0. % 0.10/0.13 % Command : iprover_modulo %s %d % 0.13/0.33 % Computer : n026.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Fri Jul 1 07:46:04 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.34 % Running in mono-core mode % 0.20/0.41 % Orienting using strategy Equiv(ClausalAll) % 0.20/0.41 % Orientation found % 0.20/0.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_5f6e78.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_674b21.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_226451 | grep -v "SZS" % 0.20/0.43 % 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 0.20/0.43 % 0.20/0.43 % % 0.20/0.43 % ------ iProver source info % 0.20/0.43 % 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 0.20/0.43 % git: non_committed_changes: true % 0.20/0.43 % git: last_make_outside_of_git: true % 0.20/0.43 % 0.20/0.43 % % 0.20/0.43 % ------ Input Options % 0.20/0.43 % 0.20/0.43 % --out_options all % 0.20/0.43 % --tptp_safe_out true % 0.20/0.43 % --problem_path "" % 0.20/0.43 % --include_path "" % 0.20/0.43 % --clausifier .//eprover % 0.20/0.43 % --clausifier_options --tstp-format % 0.20/0.43 % --stdin false % 0.20/0.43 % --dbg_backtrace false % 0.20/0.43 % --dbg_dump_prop_clauses false % 0.20/0.43 % --dbg_dump_prop_clauses_file - % 0.20/0.43 % --dbg_out_stat false % 0.20/0.43 % 0.20/0.43 % ------ General Options % 0.20/0.43 % 0.20/0.43 % --fof false % 0.20/0.43 % --time_out_real 150. % 0.20/0.43 % --time_out_prep_mult 0.2 % 0.20/0.43 % --time_out_virtual -1. % 0.20/0.43 % --schedule none % 0.20/0.43 % --ground_splitting input % 0.20/0.43 % --splitting_nvd 16 % 0.20/0.43 % --non_eq_to_eq false % 0.20/0.43 % --prep_gs_sim true % 0.20/0.43 % --prep_unflatten false % 0.20/0.43 % --prep_res_sim true % 0.20/0.43 % --prep_upred true % 0.20/0.43 % --res_sim_input true % 0.20/0.43 % --clause_weak_htbl true % 0.20/0.43 % --gc_record_bc_elim false % 0.20/0.43 % --symbol_type_check false % 0.20/0.43 % --clausify_out false % 0.20/0.43 % --large_theory_mode false % 0.20/0.43 % --prep_sem_filter none % 0.20/0.43 % --prep_sem_filter_out false % 0.20/0.43 % --preprocessed_out false % 0.20/0.43 % --sub_typing false % 0.20/0.43 % --brand_transform false % 0.20/0.43 % --pure_diseq_elim true % 0.20/0.43 % --min_unsat_core false % 0.20/0.43 % --pred_elim true % 0.20/0.43 % --add_important_lit false % 0.20/0.43 % --soft_assumptions false % 0.20/0.43 % --reset_solvers false % 0.20/0.43 % --bc_imp_inh [] % 0.20/0.43 % --conj_cone_tolerance 1.5 % 0.20/0.43 % --prolific_symb_bound 500 % 0.20/0.43 % --lt_threshold 2000 % 0.20/0.43 % 0.20/0.43 % ------ SAT Options % 0.20/0.43 % 0.20/0.43 % --sat_mode false % 0.20/0.43 % --sat_fm_restart_options "" % 0.20/0.43 % --sat_gr_def false % 0.20/0.43 % --sat_epr_types true % 0.20/0.43 % --sat_non_cyclic_types false % 0.20/0.43 % --sat_finite_models false % 0.20/0.43 % --sat_fm_lemmas false % 0.20/0.43 % --sat_fm_prep false % 0.20/0.43 % --sat_fm_uc_incr true % 0.20/0.43 % --sat_out_model small % 0.20/0.43 % --sat_out_clauses false % 0.20/0.43 % 0.20/0.43 % ------ QBF Options % 0.20/0.43 % 0.20/0.43 % --qbf_mode false % 0.20/0.43 % --qbf_elim_univ true % 0.20/0.43 % --qbf_sk_in true % 0.20/0.43 % --qbf_pred_elim true % 0.20/0.43 % --qbf_split 32 % 0.20/0.43 % 0.20/0.43 % ------ BMC1 Options % 0.20/0.43 % 0.20/0.43 % --bmc1_incremental false % 0.20/0.43 % --bmc1_axioms reachable_all % 0.20/0.43 % --bmc1_min_bound 0 % 0.20/0.43 % --bmc1_max_bound -1 % 0.20/0.43 % --bmc1_max_bound_default -1 % 0.20/0.43 % --bmc1_symbol_reachability true % 0.20/0.43 % --bmc1_property_lemmas false % 0.20/0.43 % --bmc1_k_induction false % 0.20/0.43 % --bmc1_non_equiv_states false % 0.20/0.43 % --bmc1_deadlock false % 0.20/0.43 % --bmc1_ucm false % 0.20/0.43 % --bmc1_add_unsat_core none % 0.20/0.43 % --bmc1_unsat_core_children false % 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false % 0.20/0.43 % --bmc1_out_stat full % 0.20/0.43 % --bmc1_ground_init false % 0.20/0.43 % --bmc1_pre_inst_next_state false % 0.20/0.43 % --bmc1_pre_inst_state false % 0.20/0.43 % --bmc1_pre_inst_reach_state false % 0.20/0.43 % --bmc1_out_unsat_core false % 0.20/0.43 % --bmc1_aig_witness_out false % 0.20/0.43 % --bmc1_verbose false % 0.20/0.43 % --bmc1_dump_clauses_tptp false % 0.20/0.50 % --bmc1_dump_unsat_core_tptp false % 0.20/0.50 % --bmc1_dump_file - % 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128 % 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6 % 0.20/0.50 % --bmc1_ucm_extend_mode 1 % 0.20/0.50 % --bmc1_ucm_init_mode 2 % 0.20/0.50 % --bmc1_ucm_cone_mode none % 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0 % 0.20/0.50 % --bmc1_ucm_relax_model 4 % 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true % 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false % 0.20/0.50 % --bmc1_ucm_layered_model none % 0.20/0.50 % --bmc1_ucm_max_lemma_size 10 % 0.20/0.50 % 0.20/0.50 % ------ AIG Options % 0.20/0.50 % 0.20/0.50 % --aig_mode false % 0.20/0.50 % 0.20/0.50 % ------ Instantiation Options % 0.20/0.50 % 0.20/0.50 % --instantiation_flag true % 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.20/0.50 % --inst_solver_per_active 750 % 0.20/0.50 % --inst_solver_calls_frac 0.5 % 0.20/0.50 % --inst_passive_queue_type priority_queues % 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.20/0.50 % --inst_passive_queues_freq [25;2] % 0.20/0.50 % --inst_dismatching true % 0.20/0.50 % --inst_eager_unprocessed_to_passive true % 0.20/0.50 % --inst_prop_sim_given true % 0.20/0.50 % --inst_prop_sim_new false % 0.20/0.50 % --inst_orphan_elimination true % 0.20/0.50 % --inst_learning_loop_flag true % 0.20/0.50 % --inst_learning_start 3000 % 0.20/0.50 % --inst_learning_factor 2 % 0.20/0.50 % --inst_start_prop_sim_after_learn 3 % 0.20/0.50 % --inst_sel_renew solver % 0.20/0.50 % --inst_lit_activity_flag true % 0.20/0.50 % --inst_out_proof true % 0.20/0.50 % 0.20/0.50 % ------ Resolution Options % 0.20/0.50 % 0.20/0.50 % --resolution_flag true % 0.20/0.50 % --res_lit_sel kbo_max % 0.20/0.50 % --res_to_prop_solver none % 0.20/0.50 % --res_prop_simpl_new false % 0.20/0.50 % --res_prop_simpl_given false % 0.20/0.50 % --res_passive_queue_type priority_queues % 0.20/0.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 0.20/0.50 % --res_passive_queues_freq [15;5] % 0.20/0.50 % --res_forward_subs full % 0.20/0.50 % --res_backward_subs full % 0.20/0.50 % --res_forward_subs_resolution true % 0.20/0.50 % --res_backward_subs_resolution true % 0.20/0.50 % --res_orphan_elimination false % 0.20/0.50 % --res_time_limit 1000. % 0.20/0.50 % --res_out_proof true % 0.20/0.50 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_5f6e78.s % 0.20/0.50 % --modulo true % 0.20/0.50 % 0.20/0.50 % ------ Combination Options % 0.20/0.50 % 0.20/0.50 % --comb_res_mult 1000 % 0.20/0.50 % --comb_inst_mult 300 % 0.20/0.50 % ------ % 0.20/0.50 % 0.20/0.50 % ------ Parsing...% successful % 0.20/0.50 % 0.20/0.50 % ------ Preprocessing... gs_s sp: 12 0s gs_e snvd_s sp: 12 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e snvd_s sp: 0 0s snvd_e % % 0.20/0.50 % 0.20/0.50 % ------ Proving... % 0.20/0.50 % ------ Problem Properties % 0.20/0.50 % 0.20/0.50 % % 0.20/0.50 % EPR false % 0.20/0.50 % Horn false % 0.20/0.50 % Has equality true % 0.20/0.50 % 0.20/0.50 % % ------ Input Options Time Limit: Unbounded % 0.20/0.50 % 0.20/0.50 % 0.20/0.50 % % ------ Current options: % 0.20/0.50 % 0.20/0.50 % ------ Input Options % 0.20/0.50 % 0.20/0.50 % --out_options all % 0.20/0.50 % --tptp_safe_out true % 0.20/0.50 % --problem_path "" % 0.20/0.50 % --include_path "" % 0.20/0.50 % --clausifier .//eprover % 0.20/0.50 % --clausifier_options --tstp-format % 0.20/0.50 % --stdin false % 0.20/0.50 % --dbg_backtrace false % 0.20/0.50 % --dbg_dump_prop_clauses false % 0.20/0.50 % --dbg_dump_prop_clauses_file - % 0.20/0.50 % --dbg_out_stat false % 0.20/0.50 % 0.20/0.50 % ------ General Options % 0.20/0.50 % 0.20/0.50 % --fof false % 0.20/0.50 % --time_out_real 150. % 0.20/0.50 % --time_out_prep_mult 0.2 % 0.20/0.50 % --time_out_virtual -1. % 0.20/0.50 % --schedule none % 0.20/0.50 % --ground_splitting input % 0.20/0.50 % --splitting_nvd 16 % 0.20/0.50 % --non_eq_to_eq false % 0.20/0.50 % --prep_gs_sim true % 0.20/0.50 % --prep_unflatten false % 0.20/0.50 % --prep_res_sim true % 0.20/0.50 % --prep_upred true % 0.20/0.50 % --res_sim_input true % 0.20/0.50 % --clause_weak_htbl true % 0.20/0.50 % --gc_record_bc_elim false % 0.20/0.50 % --symbol_type_check false % 0.20/0.50 % --clausify_out false % 0.20/0.50 % --large_theory_mode false % 0.20/0.50 % --prep_sem_filter none % 0.20/0.50 % --prep_sem_filter_out false % 0.20/0.50 % --preprocessed_out false % 0.20/0.50 % --sub_typing false % 0.20/0.50 % --brand_transform false % 0.20/0.50 % --pure_diseq_elim true % 0.20/0.50 % --min_unsat_core false % 0.20/0.50 % --pred_elim true % 0.20/0.50 % --add_important_lit false % 0.20/0.50 % --soft_assumptions false % 0.20/0.50 % --reset_solvers false % 0.20/0.50 % --bc_imp_inh [] % 0.20/0.50 % --conj_cone_tolerance 1.5 % 0.20/0.50 % --prolific_symb_bound 500 % 0.20/0.50 % --lt_threshold 2000 % 0.20/0.50 % 0.20/0.50 % ------ SAT Options % 0.20/0.50 % 0.20/0.50 % --sat_mode false % 0.20/0.50 % --sat_fm_restart_options "" % 0.20/0.50 % --sat_gr_def false % 0.20/0.50 % --sat_epr_types true % 0.20/0.50 % --sat_non_cyclic_types false % 0.20/0.50 % --sat_finite_models false % 0.20/0.50 % --sat_fm_lemmas false % 0.20/0.50 % --sat_fm_prep false % 0.20/0.50 % --sat_fm_uc_incr true % 0.20/0.50 % --sat_out_model small % 0.20/0.50 % --sat_out_clauses false % 0.20/0.50 % 0.20/0.50 % ------ QBF Options % 0.20/0.50 % 0.20/0.50 % --qbf_mode false % 0.20/0.50 % --qbf_elim_univ true % 0.20/0.50 % --qbf_sk_in true % 0.20/0.50 % --qbf_pred_elim true % 0.20/0.50 % --qbf_split 32 % 0.20/0.50 % 0.20/0.50 % ------ BMC1 Options % 0.20/0.50 % 0.20/0.50 % --bmc1_incremental false % 0.20/0.50 % --bmc1_axioms reachable_all % 0.20/0.50 % --bmc1_min_bound 0 % 0.20/0.50 % --bmc1_max_bound -1 % 0.20/0.50 % --bmc1_max_bound_default -1 % 0.20/0.50 % --bmc1_symbol_reachability true % 0.20/0.50 % --bmc1_property_lemmas false % 0.20/0.50 % --bmc1_k_induction false % 0.20/0.50 % --bmc1_non_equiv_states false % 0.20/0.50 % --bmc1_deadlock false % 0.20/0.50 % --bmc1_ucm false % 0.20/0.50 % --bmc1_add_unsat_core none % 0.20/0.50 % --bmc1_unsat_core_children false % 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false % 0.20/0.50 % --bmc1_out_stat full % 0.20/0.50 % --bmc1_ground_init false % 0.20/0.50 % --bmc1_pre_inst_next_state false % 0.20/0.50 % --bmc1_pre_inst_state false % 0.20/0.50 % --bmc1_pre_inst_reach_state false % 0.20/0.50 % --bmc1_out_unsat_core false % 0.20/0.50 % --bmc1_aig_witness_out false % 0.20/0.50 % --bmc1_verbose false % 0.20/0.50 % --bmc1_dump_clauses_tptp false % 0.20/0.50 % --bmc1_dump_unsat_core_tptp false % 0.20/0.50 % --bmc1_dump_file - % 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128 % 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6 % 0.20/0.50 % --bmc1_ucm_extend_mode 1 % 0.20/0.50 % --bmc1_ucm_init_mode 2 % 0.20/0.50 % --bmc1_ucm_cone_mode none % 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0 % 0.20/0.50 % --bmc1_ucm_relax_model 4 % 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true % 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false % 0.20/0.50 % --bmc1_ucm_layered_model none % 0.20/0.50 % --bmc1_ucm_max_lemma_size 10 % 0.20/0.50 % 0.20/0.50 % ------ AIG Options % 0.20/0.50 % 0.20/0.50 % --aig_mode false % 0.20/0.50 % 0.20/0.50 % ------ Instantiation Options % 0.20/0.50 % 0.20/0.50 % --instantiation_flag true % 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.20/0.50 % --inst_solver_per_active 750 % 0.20/0.50 % --inst_solver_calls_frac 0.5 % 0.20/0.50 % --inst_passive_queue_type priority_queues % 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.20/0.50 % --inst_passive_queues_freq [25;2] % 0.20/0.50 % --inst_dismatching true % 0.20/0.50 % --inst_eager_unprocessed_to_passive true % 9.64/9.82 % --inst_prop_sim_given true % 9.64/9.82 % --inst_prop_sim_new false % 9.64/9.82 % --inst_orphan_elimination true % 9.64/9.82 % --inst_learning_loop_flag true % 9.64/9.82 % --inst_learning_start 3000 % 9.64/9.82 % --inst_learning_factor 2 % 9.64/9.82 % --inst_start_prop_sim_after_learn 3 % 9.64/9.82 % --inst_sel_renew solver % 9.64/9.82 % --inst_lit_activity_flag true % 9.64/9.82 % --inst_out_proof true % 9.64/9.82 % 9.64/9.82 % ------ Resolution Options % 9.64/9.82 % 9.64/9.82 % --resolution_flag true % 9.64/9.82 % --res_lit_sel kbo_max % 9.64/9.82 % --res_to_prop_solver none % 9.64/9.82 % --res_prop_simpl_new false % 9.64/9.82 % --res_prop_simpl_given false % 9.64/9.82 % --res_passive_queue_type priority_queues % 9.64/9.82 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 9.64/9.82 % --res_passive_queues_freq [15;5] % 9.64/9.82 % --res_forward_subs full % 9.64/9.82 % --res_backward_subs full % 9.64/9.82 % --res_forward_subs_resolution true % 9.64/9.82 % --res_backward_subs_resolution true % 9.64/9.82 % --res_orphan_elimination false % 9.64/9.82 % --res_time_limit 1000. % 9.64/9.82 % --res_out_proof true % 9.64/9.82 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_5f6e78.s % 9.64/9.82 % --modulo true % 9.64/9.82 % 9.64/9.82 % ------ Combination Options % 9.64/9.82 % 9.64/9.82 % --comb_res_mult 1000 % 9.64/9.82 % --comb_inst_mult 300 % 9.64/9.82 % ------ % 9.64/9.82 % 9.64/9.82 % 9.64/9.82 % 9.64/9.82 % ------ Proving... % 9.64/9.82 % warning: shown sat in sat incomplete mode % 9.64/9.82 % % 9.64/9.82 % 9.64/9.82 % 9.64/9.82 ------ Building Model...Done % 9.64/9.82 % 9.64/9.82 %------ The model is defined over ground terms (initial term algebra). % 9.64/9.82 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 9.64/9.82 %------ where \phi is a formula over the term algebra. % 9.64/9.82 %------ If we have equality in the problem then it is also defined as a predicate above, % 9.64/9.82 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 9.64/9.82 %------ See help for --sat_out_model for different model outputs. % 9.64/9.82 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 9.64/9.82 %------ where the first argument stands for the sort ($i in the unsorted case) % 9.64/9.82 % 9.64/9.82 % 9.64/9.82 % 9.64/9.82 % 9.64/9.82 %------ Negative definition of equality_sorted % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X0,X1] : % 9.64/9.82 ( ~(equality_sorted(X0,X0,X1)) <=> % 9.64/9.82 $false % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of be % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1,X2,X3] : % 9.64/9.82 ( be(X0,X1,X2,X3) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc9 & X2=skc10 & X3=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 & X2=skc10 & X3=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of accessible_world % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( accessible_world(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of agent % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1,X2] : % 9.64/9.82 ( agent(X0,X1,X2) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc13 & X2=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(skc10) & X2=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(skc15) & X2=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc13 & X2=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of theme % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1,X2] : % 9.64/9.82 ( theme(X0,X1,X2) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc13 & X2=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc13 & X2=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of think_believe_consider % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( think_believe_consider(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of proposition % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( proposition(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of entity % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( entity(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of of % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1,X2] : % 9.64/9.82 ( of(X0,X1,X2) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc11 & X2=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc14 & X2=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc11 & X2=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 & X2=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of forename % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( forename(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc11 ) % 9.64/9.82 & % 9.64/9.82 ( X0!=skc12 ) % 9.64/9.82 & % 9.64/9.82 ( X0!=skc8 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc14 ) % 9.64/9.82 & % 9.64/9.82 ( X0!=skc12 ) % 9.64/9.82 & % 9.64/9.82 ( X0!=skc8 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of smoke % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( smoke(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ? [X2] : % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(X2) ) % 9.64/9.82 & % 9.64/9.82 ( X2!=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(skc15) ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of event % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( event(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ? [X2] : % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(X2) ) % 9.64/9.82 & % 9.64/9.82 ( X2!=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(skc15) ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of eventuality % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( eventuality(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ? [X2] : % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(X2) ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of thing % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( thing(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ? [X2] : % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(X2) ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of singleton % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( singleton(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ? [X2] : % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(X2) ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of specific % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( specific(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ? [X2] : % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(X2) ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of nonexistent % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( nonexistent(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ? [X2] : % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(X2) ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of unisex % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( unisex(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ? [X2] : % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(X2) ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of present % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( present(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ? [X2] : % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(X2) ) % 9.64/9.82 & % 9.64/9.82 ( X2!=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skf2(skc15) ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc13 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of relation % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( relation(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of abstraction % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( abstraction(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of nonhuman % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( nonhuman(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of general % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( general(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc12 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of state % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( state(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc9 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of man % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( man(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of human_person % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( human_person(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of organism % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( organism(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of existent % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( existent(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of impartial % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( impartial(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of living % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( living(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of human % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( human(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of animate % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( animate(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of male % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( male(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc10 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc15 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of relname % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( relname(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of vincent_forename % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( vincent_forename(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of jules_forename % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1] : % 9.64/9.82 ( jules_forename(X0,X1) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc12 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X1=skc11 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of actual_world % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0] : % 9.64/9.82 ( actual_world(X0) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of sP0_iProver_split % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 ( sP0_iProver_split <=> % 9.64/9.82 $false % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of sP4_iProver_split % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13] : % 9.64/9.82 ( sP4_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13) <=> % 9.64/9.82 $true % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of sP6_iProver_split % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 9.64/9.82 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 9.64/9.82 $false % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Negative definition of sP7_iProver_split % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13] : % 9.64/9.82 ( ~(sP7_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13)) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 & X2=skc10 & X3=skc12 & X4=skc12 & X5=skc13 & X6=skc15 & X7=skc13 & X8=skc15 & X9=skc13 & X10=skc14 & X11=skc11 & X12=skc14 & X13=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 & X2=skc10 & X3=skc12 & X4=skc12 & X5=skc13 & X6=skc15 & X7=skc13 & X8=skc15 & X9=skf2(skc15) & X10=skc14 & X11=skc11 & X12=skc14 & X13=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of sP9_iProver_split % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1,X2,X3,X4] : % 9.64/9.82 ( sP9_iProver_split(X0,X1,X2,X3,X4) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 & X2=skc11 & X3=skc14 & X4=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of sP10_iProver_split % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13] : % 9.64/9.82 ( sP10_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13) <=> % 9.64/9.82 $true % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of sP12_iProver_split % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 9.64/9.82 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 9.64/9.82 $false % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Negative definition of sP13_iProver_split % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13] : % 9.64/9.82 ( ~(sP13_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13)) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 & X2=skc10 & X3=skc12 & X4=skc12 & X5=skc13 & X6=skc15 & X7=skc13 & X8=skc15 & X9=skc13 & X10=skc14 & X11=skc11 & X12=skc14 & X13=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 | % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc9 & X2=skc10 & X3=skc12 & X4=skc12 & X5=skc13 & X6=skc15 & X7=skc13 & X8=skc15 & X9=skf2(skc15) & X10=skc14 & X11=skc11 & X12=skc14 & X13=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 %------ Positive definition of sP15_iProver_split % 9.64/9.82 fof(lit_def,axiom, % 9.64/9.82 (! [X0,X1,X2,X3,X4] : % 9.64/9.82 ( sP15_iProver_split(X0,X1,X2,X3,X4) <=> % 9.64/9.82 ( % 9.64/9.82 ( % 9.64/9.82 ( X0=skc8 & X1=skc14 & X2=skc11 & X3=skc14 & X4=skc14 ) % 9.64/9.82 ) % 9.64/9.82 % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ) % 9.64/9.82 ). % 9.64/9.82 % 9.64/9.82 % 9.64/9.82 % 9.64/9.82 % ------ Statistics % 9.64/9.82 % 9.64/9.82 % ------ General % 9.64/9.82 % 9.64/9.82 % num_of_input_clauses: 211 % 9.64/9.82 % num_of_input_neg_conjectures: 24 % 9.64/9.82 % num_of_splits: 24 % 9.64/9.82 % num_of_split_atoms: 16 % 9.64/9.82 % num_of_sem_filtered_clauses: 0 % 9.64/9.83 % num_of_subtypes: 0 % 9.64/9.83 % monotx_restored_types: 0 % 9.64/9.83 % sat_num_of_epr_types: 0 % 9.64/9.83 % sat_num_of_non_cyclic_types: 0 % 9.64/9.83 % sat_guarded_non_collapsed_types: 0 % 9.64/9.83 % is_epr: 0 % 9.64/9.83 % is_horn: 0 % 9.64/9.83 % has_eq: 1 % 9.64/9.83 % num_pure_diseq_elim: 0 % 9.64/9.83 % simp_replaced_by: 0 % 9.64/9.83 % res_preprocessed: 72 % 9.64/9.83 % prep_upred: 0 % 9.64/9.83 % prep_unflattend: 162 % 9.64/9.83 % pred_elim_cands: 16 % 9.64/9.83 % pred_elim: 7 % 9.64/9.83 % pred_elim_cl: 7 % 9.64/9.83 % pred_elim_cycles: 20 % 9.64/9.83 % forced_gc_time: 0 % 9.64/9.83 % gc_basic_clause_elim: 0 % 9.64/9.83 % parsing_time: 0.008 % 9.64/9.83 % sem_filter_time: 0. % 9.64/9.83 % pred_elim_time: 0.037 % 9.64/9.83 % out_proof_time: 0. % 9.64/9.83 % monotx_time: 0. % 9.64/9.83 % subtype_inf_time: 0. % 9.64/9.83 % unif_index_cands_time: 0.005 % 9.64/9.83 % unif_index_add_time: 0.006 % 9.64/9.83 % total_time: 9.405 % 9.64/9.83 % num_of_symbols: 87 % 9.64/9.83 % num_of_terms: 7971 % 9.64/9.83 % 9.64/9.83 % ------ Propositional Solver % 9.64/9.83 % 9.64/9.83 % prop_solver_calls: 14 % 9.64/9.83 % prop_fast_solver_calls: 900 % 9.64/9.83 % prop_num_of_clauses: 1482 % 9.64/9.83 % prop_preprocess_simplified: 3637 % 9.64/9.83 % prop_fo_subsumed: 4 % 9.64/9.83 % prop_solver_time: 0. % 9.64/9.83 % prop_fast_solver_time: 0.002 % 9.64/9.83 % prop_unsat_core_time: 0. % 9.64/9.83 % 9.64/9.83 % ------ QBF % 9.64/9.83 % 9.64/9.83 % qbf_q_res: 0 % 9.64/9.83 % qbf_num_tautologies: 0 % 9.64/9.83 % qbf_prep_cycles: 0 % 9.64/9.83 % 9.64/9.83 % ------ BMC1 % 9.64/9.83 % 9.64/9.83 % bmc1_current_bound: -1 % 9.64/9.83 % bmc1_last_solved_bound: -1 % 9.64/9.83 % bmc1_unsat_core_size: -1 % 9.64/9.83 % bmc1_unsat_core_parents_size: -1 % 9.64/9.83 % bmc1_merge_next_fun: 0 % 9.64/9.83 % bmc1_unsat_core_clauses_time: 0. % 9.64/9.83 % 9.64/9.83 % ------ Instantiation % 9.64/9.83 % 9.64/9.83 % inst_num_of_clauses: 1208 % 9.64/9.83 % inst_num_in_passive: 0 % 9.64/9.83 % inst_num_in_active: 1175 % 9.64/9.83 % inst_num_in_unprocessed: 0 % 9.64/9.83 % inst_num_of_loops: 1237 % 9.64/9.83 % inst_num_of_learning_restarts: 0 % 9.64/9.83 % inst_num_moves_active_passive: 11 % 9.64/9.83 % inst_lit_activity: 80 % 9.64/9.83 % inst_lit_activity_moves: 0 % 9.64/9.83 % inst_num_tautologies: 33 % 9.64/9.83 % inst_num_prop_implied: 0 % 9.64/9.83 % inst_num_existing_simplified: 0 % 9.64/9.83 % inst_num_eq_res_simplified: 0 % 9.64/9.83 % inst_num_child_elim: 0 % 9.64/9.83 % inst_num_of_dismatching_blockings: 197 % 9.64/9.83 % inst_num_of_non_proper_insts: 1776 % 9.64/9.83 % inst_num_of_duplicates: 1245 % 9.64/9.83 % inst_inst_num_from_inst_to_res: 0 % 9.64/9.83 % inst_dismatching_checking_time: 0.001 % 9.64/9.83 % 9.64/9.83 % ------ Resolution % 9.64/9.83 % 9.64/9.83 % res_num_of_clauses: 5298 % 9.64/9.83 % res_num_in_passive: 2857 % 9.64/9.83 % res_num_in_active: 2340 % 9.64/9.83 % res_num_of_loops: 5000 % 9.64/9.83 % res_forward_subset_subsumed: 3321 % 9.64/9.83 % res_backward_subset_subsumed: 3 % 9.64/9.83 % res_forward_subsumed: 1779 % 9.64/9.83 % res_backward_subsumed: 198 % 9.64/9.83 % res_forward_subsumption_resolution: 6885 % 9.64/9.83 % res_backward_subsumption_resolution: 5 % 9.64/9.83 % res_clause_to_clause_subsumption: 197908 % 9.64/9.83 % res_orphan_elimination: 0 % 9.64/9.83 % res_tautology_del: 0 % 9.64/9.83 % res_num_eq_res_simplified: 0 % 9.64/9.83 % res_num_sel_changes: 0 % 9.64/9.83 % res_moves_from_active_to_pass: 0 % 9.64/9.83 % 9.64/9.83 % Status Unknown % 9.64/9.87 % Orienting using strategy ClausalAll % 9.64/9.87 % Orientation found % 9.64/9.87 % 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/sandbox2/tmp/iprover_proof_5f6e78.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_674b21.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_e32abe | grep -v "SZS" % 9.73/9.89 % 9.73/9.89 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 9.73/9.89 % 9.73/9.89 % % 9.73/9.89 % ------ iProver source info % 9.73/9.89 % 9.73/9.89 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 9.73/9.89 % git: non_committed_changes: true % 9.73/9.89 % git: last_make_outside_of_git: true % 9.73/9.89 % 9.73/9.89 % % 9.73/9.89 % ------ Input Options % 9.73/9.89 % 9.73/9.89 % --out_options all % 9.73/9.89 % --tptp_safe_out true % 9.73/9.89 % --problem_path "" % 9.73/9.89 % --include_path "" % 9.73/9.89 % --clausifier .//eprover % 9.73/9.89 % --clausifier_options --tstp-format % 9.73/9.89 % --stdin false % 9.73/9.89 % --dbg_backtrace false % 9.73/9.89 % --dbg_dump_prop_clauses false % 9.73/9.89 % --dbg_dump_prop_clauses_file - % 9.73/9.89 % --dbg_out_stat false % 9.73/9.89 % 9.73/9.89 % ------ General Options % 9.73/9.89 % 9.73/9.89 % --fof false % 9.73/9.89 % --time_out_real 150. % 9.73/9.89 % --time_out_prep_mult 0.2 % 9.73/9.89 % --time_out_virtual -1. % 9.73/9.89 % --schedule none % 9.73/9.89 % --ground_splitting input % 9.73/9.89 % --splitting_nvd 16 % 9.73/9.89 % --non_eq_to_eq false % 9.73/9.89 % --prep_gs_sim true % 9.73/9.89 % --prep_unflatten false % 9.73/9.89 % --prep_res_sim true % 9.73/9.89 % --prep_upred true % 9.73/9.89 % --res_sim_input true % 9.73/9.89 % --clause_weak_htbl true % 9.73/9.89 % --gc_record_bc_elim false % 9.73/9.89 % --symbol_type_check false % 9.73/9.89 % --clausify_out false % 9.73/9.89 % --large_theory_mode false % 9.73/9.89 % --prep_sem_filter none % 9.73/9.89 % --prep_sem_filter_out false % 9.73/9.89 % --preprocessed_out false % 9.73/9.89 % --sub_typing false % 9.73/9.89 % --brand_transform false % 9.73/9.89 % --pure_diseq_elim true % 9.73/9.89 % --min_unsat_core false % 9.73/9.89 % --pred_elim true % 9.73/9.89 % --add_important_lit false % 9.73/9.89 % --soft_assumptions false % 9.73/9.89 % --reset_solvers false % 9.73/9.89 % --bc_imp_inh [] % 9.73/9.89 % --conj_cone_tolerance 1.5 % 9.73/9.89 % --prolific_symb_bound 500 % 9.73/9.89 % --lt_threshold 2000 % 9.73/9.89 % 9.73/9.89 % ------ SAT Options % 9.73/9.89 % 9.73/9.89 % --sat_mode false % 9.73/9.89 % --sat_fm_restart_options "" % 9.73/9.89 % --sat_gr_def false % 9.73/9.89 % --sat_epr_types true % 9.73/9.89 % --sat_non_cyclic_types false % 9.73/9.89 % --sat_finite_models false % 9.73/9.89 % --sat_fm_lemmas false % 9.73/9.89 % --sat_fm_prep false % 9.73/9.89 % --sat_fm_uc_incr true % 9.73/9.89 % --sat_out_model small % 9.73/9.89 % --sat_out_clauses false % 9.73/9.89 % 9.73/9.89 % ------ QBF Options % 9.73/9.89 % 9.73/9.89 % --qbf_mode false % 9.73/9.89 % --qbf_elim_univ true % 9.73/9.89 % --qbf_sk_in true % 9.73/9.89 % --qbf_pred_elim true % 9.73/9.89 % --qbf_split 32 % 9.73/9.89 % 9.73/9.89 % ------ BMC1 Options % 9.73/9.89 % 9.73/9.89 % --bmc1_incremental false % 9.73/9.89 % --bmc1_axioms reachable_all % 9.73/9.89 % --bmc1_min_bound 0 % 9.73/9.89 % --bmc1_max_bound -1 % 9.73/9.89 % --bmc1_max_bound_default -1 % 9.73/9.89 % --bmc1_symbol_reachability true % 9.73/9.89 % --bmc1_property_lemmas false % 9.73/9.89 % --bmc1_k_induction false % 9.73/9.89 % --bmc1_non_equiv_states false % 9.73/9.89 % --bmc1_deadlock false % 9.73/9.89 % --bmc1_ucm false % 9.73/9.89 % --bmc1_add_unsat_core none % 9.73/9.89 % --bmc1_unsat_core_children false % 9.73/9.89 % --bmc1_unsat_core_extrapolate_axioms false % 9.73/9.89 % --bmc1_out_stat full % 9.73/9.89 % --bmc1_ground_init false % 9.73/9.89 % --bmc1_pre_inst_next_state false % 9.73/9.89 % --bmc1_pre_inst_state false % 9.73/9.89 % --bmc1_pre_inst_reach_state false % 9.73/9.89 % --bmc1_out_unsat_core false % 9.73/9.89 % --bmc1_aig_witness_out false % 9.73/9.89 % --bmc1_verbose false % 9.73/9.89 % --bmc1_dump_clauses_tptp false % 9.73/9.92 % --bmc1_dump_unsat_core_tptp false % 9.73/9.92 % --bmc1_dump_file - % 9.73/9.92 % --bmc1_ucm_expand_uc_limit 128 % 9.73/9.92 % --bmc1_ucm_n_expand_iterations 6 % 9.73/9.92 % --bmc1_ucm_extend_mode 1 % 9.73/9.92 % --bmc1_ucm_init_mode 2 % 9.73/9.92 % --bmc1_ucm_cone_mode none % 9.73/9.92 % --bmc1_ucm_reduced_relation_type 0 % 9.73/9.92 % --bmc1_ucm_relax_model 4 % 9.73/9.92 % --bmc1_ucm_full_tr_after_sat true % 9.73/9.92 % --bmc1_ucm_expand_neg_assumptions false % 9.73/9.92 % --bmc1_ucm_layered_model none % 9.73/9.92 % --bmc1_ucm_max_lemma_size 10 % 9.73/9.92 % 9.73/9.92 % ------ AIG Options % 9.73/9.92 % 9.73/9.92 % --aig_mode false % 9.73/9.92 % 9.73/9.92 % ------ Instantiation Options % 9.73/9.92 % 9.73/9.92 % --instantiation_flag true % 9.73/9.92 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 9.73/9.92 % --inst_solver_per_active 750 % 9.73/9.92 % --inst_solver_calls_frac 0.5 % 9.73/9.92 % --inst_passive_queue_type priority_queues % 9.73/9.92 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 9.73/9.92 % --inst_passive_queues_freq [25;2] % 9.73/9.92 % --inst_dismatching true % 9.73/9.92 % --inst_eager_unprocessed_to_passive true % 9.73/9.92 % --inst_prop_sim_given true % 9.73/9.92 % --inst_prop_sim_new false % 9.73/9.92 % --inst_orphan_elimination true % 9.73/9.92 % --inst_learning_loop_flag true % 9.73/9.92 % --inst_learning_start 3000 % 9.73/9.92 % --inst_learning_factor 2 % 9.73/9.92 % --inst_start_prop_sim_after_learn 3 % 9.73/9.92 % --inst_sel_renew solver % 9.73/9.92 % --inst_lit_activity_flag true % 9.73/9.92 % --inst_out_proof true % 9.73/9.92 % 9.73/9.92 % ------ Resolution Options % 9.73/9.92 % 9.73/9.92 % --resolution_flag true % 9.73/9.92 % --res_lit_sel kbo_max % 9.73/9.92 % --res_to_prop_solver none % 9.73/9.92 % --res_prop_simpl_new false % 9.73/9.92 % --res_prop_simpl_given false % 9.73/9.92 % --res_passive_queue_type priority_queues % 9.73/9.92 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 9.73/9.92 % --res_passive_queues_freq [15;5] % 9.73/9.92 % --res_forward_subs full % 9.73/9.92 % --res_backward_subs full % 9.73/9.92 % --res_forward_subs_resolution true % 9.73/9.92 % --res_backward_subs_resolution true % 9.73/9.92 % --res_orphan_elimination false % 9.73/9.92 % --res_time_limit 1000. % 9.73/9.92 % --res_out_proof true % 9.73/9.92 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_5f6e78.s % 9.73/9.92 % --modulo true % 9.73/9.92 % 9.73/9.92 % ------ Combination Options % 9.73/9.92 % 9.73/9.92 % --comb_res_mult 1000 % 9.73/9.92 % --comb_inst_mult 300 % 9.73/9.92 % ------ % 9.73/9.92 % 9.73/9.92 % ------ Parsing...% successful % 9.73/9.92 % 9.73/9.92 % ------ Preprocessing... gs_s sp: 12 0s gs_e snvd_s sp: 12 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 4 0s snvd_e % % 9.73/9.92 % 9.73/9.92 % ------ Proving... % 9.73/9.92 % ------ Problem Properties % 9.73/9.92 % 9.73/9.92 % % 9.73/9.92 % EPR false % 9.73/9.92 % Horn false % 9.73/9.92 % Has equality true % 9.73/9.92 % 9.73/9.92 % % ------ Input Options Time Limit: Unbounded % 9.73/9.92 % 9.73/9.92 % 9.73/9.92 % % ------ Current options: % 9.73/9.92 % 9.73/9.92 % ------ Input Options % 9.73/9.92 % 9.73/9.92 % --out_options all % 9.73/9.92 % --tptp_safe_out true % 9.73/9.92 % --problem_path "" % 9.73/9.92 % --include_path "" % 9.73/9.92 % --clausifier .//eprover % 9.73/9.92 % --clausifier_options --tstp-format % 9.73/9.92 % --stdin false % 9.73/9.92 % --dbg_backtrace false % 9.73/9.92 % --dbg_dump_prop_clauses false % 9.73/9.92 % --dbg_dump_prop_clauses_file - % 9.73/9.92 % --dbg_out_stat false % 9.73/9.92 % 9.73/9.92 % ------ General Options % 9.73/9.92 % 9.73/9.92 % --fof false % 9.73/9.92 % --time_out_real 150. % 9.73/9.92 % --time_out_prep_mult 0.2 % 9.73/9.92 % --time_out_virtual -1. % 9.73/9.92 % --schedule none % 9.73/9.92 % --ground_splitting input % 9.73/9.92 % --splitting_nvd 16 % 9.73/9.92 % --non_eq_to_eq false % 9.73/9.92 % --prep_gs_sim true % 9.73/9.92 % --prep_unflatten false % 9.73/9.92 % --prep_res_sim true % 9.73/9.92 % --prep_upred true % 9.73/9.92 % --res_sim_input true % 9.73/9.92 % --clause_weak_htbl true % 9.73/9.92 % --gc_record_bc_elim false % 9.73/9.92 % --symbol_type_check false % 9.73/9.92 % --clausify_out false % 9.73/9.92 % --large_theory_mode false % 9.73/9.92 % --prep_sem_filter none % 9.73/9.92 % --prep_sem_filter_out false % 9.73/9.92 % --preprocessed_out false % 9.73/9.92 % --sub_typing false % 9.73/9.92 % --brand_transform false % 9.73/9.92 % --pure_diseq_elim true % 9.73/9.92 % --min_unsat_core false % 9.73/9.92 % --pred_elim true % 9.73/9.92 % --add_important_lit false % 9.73/9.92 % --soft_assumptions false % 9.73/9.92 % --reset_solvers false % 9.73/9.92 % --bc_imp_inh [] % 9.73/9.92 % --conj_cone_tolerance 1.5 % 9.73/9.92 % --prolific_symb_bound 500 % 9.73/9.92 % --lt_threshold 2000 % 9.73/9.92 % 9.73/9.92 % ------ SAT Options % 9.73/9.92 % 9.73/9.92 % --sat_mode false % 9.73/9.92 % --sat_fm_restart_options "" % 9.73/9.92 % --sat_gr_def false % 9.73/9.92 % --sat_epr_types true % 9.73/9.92 % --sat_non_cyclic_types false % 9.73/9.92 % --sat_finite_models false % 9.73/9.92 % --sat_fm_lemmas false % 9.73/9.92 % --sat_fm_prep false % 9.73/9.92 % --sat_fm_uc_incr true % 9.73/9.92 % --sat_out_model small % 9.73/9.92 % --sat_out_clauses false % 9.73/9.92 % 9.73/9.92 % ------ QBF Options % 9.73/9.92 % 9.73/9.92 % --qbf_mode false % 9.73/9.92 % --qbf_elim_univ true % 9.73/9.92 % --qbf_sk_in true % 9.73/9.92 % --qbf_pred_elim true % 9.73/9.92 % --qbf_split 32 % 9.73/9.92 % 9.73/9.92 % ------ BMC1 Options % 9.73/9.92 % 9.73/9.92 % --bmc1_incremental false % 9.73/9.92 % --bmc1_axioms reachable_all % 9.73/9.92 % --bmc1_min_bound 0 % 9.73/9.92 % --bmc1_max_bound -1 % 9.73/9.93 % --bmc1_max_bound_default -1 % 9.73/9.93 % --bmc1_symbol_reachability true % 9.73/9.93 % --bmc1_property_lemmas false % 9.73/9.93 % --bmc1_k_induction false % 9.73/9.93 % --bmc1_non_equiv_states false % 9.73/9.93 % --bmc1_deadlock false % 9.73/9.93 % --bmc1_ucm false % 9.73/9.93 % --bmc1_add_unsat_core none % 9.73/9.93 % --bmc1_unsat_core_children false % 9.73/9.93 % --bmc1_unsat_core_extrapolate_axioms false % 9.73/9.93 % --bmc1_out_stat full % 9.73/9.93 % --bmc1_ground_init false % 9.73/9.93 % --bmc1_pre_inst_next_state false % 9.73/9.93 % --bmc1_pre_inst_state false % 9.73/9.93 % --bmc1_pre_inst_reach_state false % 9.73/9.93 % --bmc1_out_unsat_core false % 9.73/9.93 % --bmc1_aig_witness_out false % 9.73/9.93 % --bmc1_verbose false % 9.73/9.93 % --bmc1_dump_clauses_tptp false % 9.73/9.93 % --bmc1_dump_unsat_core_tptp false % 9.73/9.93 % --bmc1_dump_file - % 9.73/9.93 % --bmc1_ucm_expand_uc_limit 128 % 9.73/9.93 % --bmc1_ucm_n_expand_iterations 6 % 9.73/9.93 % --bmc1_ucm_extend_mode 1 % 9.73/9.93 % --bmc1_ucm_init_mode 2 % 9.73/9.93 % --bmc1_ucm_cone_mode none % 9.73/9.93 % --bmc1_ucm_reduced_relation_type 0 % 9.73/9.93 % --bmc1_ucm_relax_model 4 % 9.73/9.93 % --bmc1_ucm_full_tr_after_sat true % 9.73/9.93 % --bmc1_ucm_expand_neg_assumptions false % 9.73/9.93 % --bmc1_ucm_layered_model none % 9.73/9.93 % --bmc1_ucm_max_lemma_size 10 % 9.73/9.93 % 9.73/9.93 % ------ AIG Options % 9.73/9.93 % 9.73/9.93 % --aig_mode false % 9.73/9.93 % 9.73/9.93 % ------ Instantiation Options % 9.73/9.93 % 9.73/9.93 % --instantiation_flag true % 9.73/9.93 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 9.73/9.93 % --inst_solver_per_active 750 % 9.73/9.93 % --inst_solver_calls_frac 0.5 % 9.73/9.93 % --inst_passive_queue_type priority_queues % 9.73/9.93 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 9.73/9.93 % --inst_passive_queues_freq [25;2] % 9.73/9.93 % --inst_dismatching true % 9.73/9.93 % --inst_eager_unprocessed_to_passive true % 159.67/159.89 % --inst_prop_sim_given true % 159.67/159.89 % --inst_prop_sim_new false % 159.67/159.89 % --inst_orphan_elimination true % 159.67/159.89 % --inst_learning_loop_flag true % 159.67/159.89 % --inst_learning_start 3000 % 159.67/159.89 % --inst_learning_factor 2 % 159.67/159.89 % --inst_start_prop_sim_after_learn 3 % 159.67/159.89 % --inst_sel_renew solver % 159.67/159.89 % --inst_lit_activity_flag true % 159.67/159.89 % --inst_out_proof true % 159.67/159.89 % 159.67/159.89 % ------ Resolution Options % 159.67/159.89 % 159.67/159.89 % --resolution_flag true % 159.67/159.89 % --res_lit_sel kbo_max % 159.67/159.89 % --res_to_prop_solver none % 159.67/159.89 % --res_prop_simpl_new false % 159.67/159.89 % --res_prop_simpl_given false % 159.67/159.89 % --res_passive_queue_type priority_queues % 159.67/159.89 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 159.67/159.89 % --res_passive_queues_freq [15;5] % 159.67/159.89 % --res_forward_subs full % 159.67/159.89 % --res_backward_subs full % 159.67/159.89 % --res_forward_subs_resolution true % 159.67/159.89 % --res_backward_subs_resolution true % 159.67/159.89 % --res_orphan_elimination false % 159.67/159.89 % --res_time_limit 1000. % 159.67/159.89 % --res_out_proof true % 159.67/159.89 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_5f6e78.s % 159.67/159.89 % --modulo true % 159.67/159.89 % 159.67/159.89 % ------ Combination Options % 159.67/159.89 % 159.67/159.89 % --comb_res_mult 1000 % 159.67/159.89 % --comb_inst_mult 300 % 159.67/159.89 % ------ % 159.67/159.89 % 159.67/159.89 % 159.67/159.89 % 159.67/159.89 % ------ Proving... % 159.67/159.89 % % 159.67/159.89 % 159.67/159.89 % 159.67/159.89 % Time Out Real % 159.67/159.89 % 159.67/159.89 % ------ Statistics % 159.67/159.89 % 159.67/159.89 % ------ General % 159.67/159.89 % 159.67/159.89 % num_of_input_clauses: 211 % 159.67/159.89 % num_of_input_neg_conjectures: 24 % 159.67/159.89 % num_of_splits: 28 % 159.67/159.89 % num_of_split_atoms: 20 % 159.67/159.89 % num_of_sem_filtered_clauses: 0 % 159.67/159.89 % num_of_subtypes: 0 % 159.67/159.89 % monotx_restored_types: 0 % 159.67/159.89 % sat_num_of_epr_types: 0 % 159.67/159.89 % sat_num_of_non_cyclic_types: 0 % 159.67/159.89 % sat_guarded_non_collapsed_types: 0 % 159.67/159.89 % is_epr: 0 % 159.67/159.89 % is_horn: 0 % 159.67/159.89 % has_eq: 1 % 159.67/159.89 % num_pure_diseq_elim: 0 % 159.67/159.89 % simp_replaced_by: 5 % 159.67/159.89 % res_preprocessed: 72 % 159.67/159.89 % prep_upred: 0 % 159.67/159.89 % prep_unflattend: 234 % 159.67/159.89 % pred_elim_cands: 16 % 159.67/159.89 % pred_elim: 9 % 159.67/159.89 % pred_elim_cl: 11 % 159.67/159.89 % pred_elim_cycles: 20 % 159.67/159.89 % forced_gc_time: 0 % 159.67/159.89 % gc_basic_clause_elim: 0 % 159.67/159.89 % parsing_time: 0.004 % 159.67/159.89 % sem_filter_time: 0. % 159.67/159.89 % pred_elim_time: 0.02 % 159.67/159.89 % out_proof_time: 0. % 159.67/159.89 % monotx_time: 0. % 159.67/159.89 % subtype_inf_time: 0. % 159.67/159.89 % unif_index_cands_time: 0.069 % 159.67/159.89 % unif_index_add_time: 0.111 % 159.67/159.89 % total_time: 150.009 % 159.67/159.89 % num_of_symbols: 91 % 159.67/159.89 % num_of_terms: 38569 % 159.67/159.89 % 159.67/159.89 % ------ Propositional Solver % 159.67/159.89 % 159.67/159.89 % prop_solver_calls: 48 % 159.67/159.89 % prop_fast_solver_calls: 962 % 159.67/159.89 % prop_num_of_clauses: 19074 % 159.67/159.89 % prop_preprocess_simplified: 53669 % 159.67/159.89 % prop_fo_subsumed: 6 % 159.67/159.89 % prop_solver_time: 0.009 % 159.67/159.89 % prop_fast_solver_time: 0.001 % 159.67/159.89 % prop_unsat_core_time: 0. % 159.67/159.89 % 159.67/159.89 % ------ QBF % 159.67/159.89 % 159.67/159.89 % qbf_q_res: 0 % 159.67/159.89 % qbf_num_tautologies: 0 % 159.67/159.89 % qbf_prep_cycles: 0 % 159.67/159.89 % 159.67/159.89 % ------ BMC1 % 159.67/159.89 % 159.67/159.89 % bmc1_current_bound: -1 % 159.67/159.89 % bmc1_last_solved_bound: -1 % 159.67/159.89 % bmc1_unsat_core_size: -1 % 159.67/159.89 % bmc1_unsat_core_parents_size: -1 % 159.67/159.89 % bmc1_merge_next_fun: 0 % 159.67/159.89 % bmc1_unsat_core_clauses_time: 0. % 159.67/159.89 % 159.67/159.89 % ------ Instantiation % 159.67/159.89 % 159.67/159.89 % inst_num_of_clauses: 7841 % 159.67/159.89 % inst_num_in_passive: 1683 % 159.67/159.89 % inst_num_in_active: 6126 % 159.67/159.89 % inst_num_in_unprocessed: 16 % 159.67/159.89 % inst_num_of_loops: 8098 % 159.67/159.89 % inst_num_of_learning_restarts: 2 % 159.67/159.89 % inst_num_moves_active_passive: 1948 % 159.67/159.89 % inst_lit_activity: 2031 % 159.67/159.89 % inst_lit_activity_moves: 1 % 159.67/159.89 % inst_num_tautologies: 16 % 159.67/159.89 % inst_num_prop_implied: 0 % 159.67/159.89 % inst_num_existing_simplified: 0 % 159.67/159.89 % inst_num_eq_res_simplified: 0 % 159.67/159.89 % inst_num_child_elim: 0 % 159.67/159.89 % inst_num_of_dismatching_blockings: 3493 % 159.67/159.89 % inst_num_of_non_proper_insts: 11988 % 159.67/159.89 % inst_num_of_duplicates: 7133 % 159.67/159.89 % inst_inst_num_from_inst_to_res: 0 % 159.67/159.89 % inst_dismatching_checking_time: 0.092 % 159.67/159.89 % 159.67/159.89 % ------ Resolution % 159.67/159.89 % 159.67/159.89 % res_num_of_clauses: 55453 % 159.67/159.89 % res_num_in_passive: 10365 % 159.67/159.89 % res_num_in_active: 39309 % 159.67/159.89 % res_num_of_loops: 57753 % 159.67/159.89 % res_forward_subset_subsumed: 14017 % 159.67/159.89 % res_backward_subset_subsumed: 7 % 159.67/159.89 % res_forward_subsumed: 11376 % 159.67/159.89 % res_backward_subsumed: 36 % 159.67/159.89 % res_forward_subsumption_resolution: 16653 % 159.67/159.89 % res_backward_subsumption_resolution: 12 % 159.67/159.89 % res_clause_to_clause_subsumption: 4537303 % 159.67/159.89 % res_orphan_elimination: 0 % 159.67/159.89 % res_tautology_del: 0 % 159.67/159.89 % res_num_eq_res_simplified: 0 % 159.67/159.89 % res_num_sel_changes: 0 % 159.67/159.89 % res_moves_from_active_to_pass: 0 % 159.67/159.89 % 159.67/159.89 % Status Unknown % 159.67/159.89 % Last status : % 159.67/159.89 % SZS status Unknown %------------------------------------------------------------------------------