%------------------------------------------------------------------------------ % File : iProverMo---2.5-0.1 % Problem : NLP218-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : iprover_modulo %s %d % Computer : n024.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:32 EDT 2022 % Result : Unknown 209.47s 209.75s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NLP218-1 : TPTP v8.1.0. Released v2.4.0. % 0.07/0.13 % Command : iprover_modulo %s %d % 0.12/0.34 % Computer : n024.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Thu Jun 30 22:08:30 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.35 % Running in mono-core mode % 0.19/0.42 % Orienting using strategy Equiv(ClausalAll) % 0.19/0.42 % Orientation found % 0.19/0.42 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ca4565.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_8519d0.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_6f44e6 | grep -v "SZS" % 0.19/0.44 % 0.19/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 0.19/0.44 % 0.19/0.44 % % 0.19/0.44 % ------ iProver source info % 0.19/0.44 % 0.19/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 0.19/0.44 % git: non_committed_changes: true % 0.19/0.44 % git: last_make_outside_of_git: true % 0.19/0.44 % 0.19/0.44 % % 0.19/0.44 % ------ Input Options % 0.19/0.44 % 0.19/0.44 % --out_options all % 0.19/0.44 % --tptp_safe_out true % 0.19/0.44 % --problem_path "" % 0.19/0.44 % --include_path "" % 0.19/0.44 % --clausifier .//eprover % 0.19/0.44 % --clausifier_options --tstp-format % 0.19/0.44 % --stdin false % 0.19/0.44 % --dbg_backtrace false % 0.19/0.44 % --dbg_dump_prop_clauses false % 0.19/0.44 % --dbg_dump_prop_clauses_file - % 0.19/0.44 % --dbg_out_stat false % 0.19/0.44 % 0.19/0.44 % ------ General Options % 0.19/0.44 % 0.19/0.44 % --fof false % 0.19/0.44 % --time_out_real 150. % 0.19/0.44 % --time_out_prep_mult 0.2 % 0.19/0.44 % --time_out_virtual -1. % 0.19/0.44 % --schedule none % 0.19/0.44 % --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 % 0.33/0.52 % --bmc1_dump_unsat_core_tptp false % 0.33/0.52 % --bmc1_dump_file - % 0.33/0.52 % --bmc1_ucm_expand_uc_limit 128 % 0.33/0.52 % --bmc1_ucm_n_expand_iterations 6 % 0.33/0.52 % --bmc1_ucm_extend_mode 1 % 0.33/0.52 % --bmc1_ucm_init_mode 2 % 0.33/0.52 % --bmc1_ucm_cone_mode none % 0.33/0.52 % --bmc1_ucm_reduced_relation_type 0 % 0.33/0.52 % --bmc1_ucm_relax_model 4 % 0.33/0.52 % --bmc1_ucm_full_tr_after_sat true % 0.33/0.52 % --bmc1_ucm_expand_neg_assumptions false % 0.33/0.52 % --bmc1_ucm_layered_model none % 0.33/0.52 % --bmc1_ucm_max_lemma_size 10 % 0.33/0.52 % 0.33/0.52 % ------ AIG Options % 0.33/0.52 % 0.33/0.52 % --aig_mode false % 0.33/0.52 % 0.33/0.52 % ------ Instantiation Options % 0.33/0.52 % 0.33/0.52 % --instantiation_flag true % 0.33/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.33/0.52 % --inst_solver_per_active 750 % 0.33/0.52 % --inst_solver_calls_frac 0.5 % 0.33/0.52 % --inst_passive_queue_type priority_queues % 0.33/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.33/0.52 % --inst_passive_queues_freq [25;2] % 0.33/0.52 % --inst_dismatching true % 0.33/0.52 % --inst_eager_unprocessed_to_passive true % 0.33/0.52 % --inst_prop_sim_given true % 0.33/0.52 % --inst_prop_sim_new false % 0.33/0.52 % --inst_orphan_elimination true % 0.33/0.52 % --inst_learning_loop_flag true % 0.33/0.52 % --inst_learning_start 3000 % 0.33/0.52 % --inst_learning_factor 2 % 0.33/0.52 % --inst_start_prop_sim_after_learn 3 % 0.33/0.52 % --inst_sel_renew solver % 0.33/0.52 % --inst_lit_activity_flag true % 0.33/0.52 % --inst_out_proof true % 0.33/0.52 % 0.33/0.52 % ------ Resolution Options % 0.33/0.52 % 0.33/0.52 % --resolution_flag true % 0.33/0.52 % --res_lit_sel kbo_max % 0.33/0.52 % --res_to_prop_solver none % 0.33/0.52 % --res_prop_simpl_new false % 0.33/0.52 % --res_prop_simpl_given false % 0.33/0.52 % --res_passive_queue_type priority_queues % 0.33/0.52 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 0.33/0.52 % --res_passive_queues_freq [15;5] % 0.33/0.52 % --res_forward_subs full % 0.33/0.52 % --res_backward_subs full % 0.33/0.52 % --res_forward_subs_resolution true % 0.33/0.52 % --res_backward_subs_resolution true % 0.33/0.52 % --res_orphan_elimination false % 0.33/0.52 % --res_time_limit 1000. % 0.33/0.52 % --res_out_proof true % 0.33/0.52 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ca4565.s % 0.33/0.52 % --modulo true % 0.33/0.52 % 0.33/0.52 % ------ Combination Options % 0.33/0.52 % 0.33/0.52 % --comb_res_mult 1000 % 0.33/0.52 % --comb_inst_mult 300 % 0.33/0.52 % ------ % 0.33/0.52 % 0.33/0.52 % ------ Parsing...% successful % 0.33/0.52 % 0.33/0.52 % ------ Preprocessing... gs_s sp: 0 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.33/0.52 % 0.33/0.52 % ------ Proving... % 0.33/0.52 % ------ Problem Properties % 0.33/0.52 % 0.33/0.52 % % 0.33/0.52 % EPR false % 0.33/0.52 % Horn false % 0.33/0.52 % Has equality true % 0.33/0.52 % 0.33/0.52 % % ------ Input Options Time Limit: Unbounded % 0.33/0.52 % 0.33/0.52 % 0.33/0.52 % % ------ Current options: % 0.33/0.52 % 0.33/0.52 % ------ Input Options % 0.33/0.52 % 0.33/0.52 % --out_options all % 0.33/0.52 % --tptp_safe_out true % 0.33/0.52 % --problem_path "" % 0.33/0.52 % --include_path "" % 0.33/0.52 % --clausifier .//eprover % 0.33/0.52 % --clausifier_options --tstp-format % 0.33/0.52 % --stdin false % 0.33/0.52 % --dbg_backtrace false % 0.33/0.52 % --dbg_dump_prop_clauses false % 0.33/0.52 % --dbg_dump_prop_clauses_file - % 0.33/0.52 % --dbg_out_stat false % 0.33/0.52 % 0.33/0.52 % ------ General Options % 0.33/0.52 % 0.33/0.52 % --fof false % 0.33/0.52 % --time_out_real 150. % 0.33/0.52 % --time_out_prep_mult 0.2 % 0.33/0.52 % --time_out_virtual -1. % 0.33/0.52 % --schedule none % 0.33/0.52 % --ground_splitting input % 0.33/0.52 % --splitting_nvd 16 % 0.33/0.52 % --non_eq_to_eq false % 0.33/0.52 % --prep_gs_sim true % 0.33/0.52 % --prep_unflatten false % 0.33/0.52 % --prep_res_sim true % 0.33/0.52 % --prep_upred true % 0.33/0.52 % --res_sim_input true % 0.33/0.52 % --clause_weak_htbl true % 0.33/0.52 % --gc_record_bc_elim false % 0.33/0.52 % --symbol_type_check false % 0.33/0.52 % --clausify_out false % 0.33/0.52 % --large_theory_mode false % 0.33/0.52 % --prep_sem_filter none % 0.33/0.52 % --prep_sem_filter_out false % 0.33/0.52 % --preprocessed_out false % 0.33/0.52 % --sub_typing false % 0.33/0.52 % --brand_transform false % 0.33/0.52 % --pure_diseq_elim true % 0.33/0.52 % --min_unsat_core false % 0.33/0.52 % --pred_elim true % 0.33/0.52 % --add_important_lit false % 0.33/0.52 % --soft_assumptions false % 0.33/0.52 % --reset_solvers false % 0.33/0.52 % --bc_imp_inh [] % 0.33/0.52 % --conj_cone_tolerance 1.5 % 0.33/0.52 % --prolific_symb_bound 500 % 0.33/0.52 % --lt_threshold 2000 % 0.33/0.52 % 0.33/0.52 % ------ SAT Options % 0.33/0.52 % 0.33/0.52 % --sat_mode false % 0.33/0.52 % --sat_fm_restart_options "" % 0.33/0.52 % --sat_gr_def false % 0.33/0.52 % --sat_epr_types true % 0.33/0.52 % --sat_non_cyclic_types false % 0.33/0.52 % --sat_finite_models false % 0.33/0.52 % --sat_fm_lemmas false % 0.33/0.52 % --sat_fm_prep false % 0.33/0.52 % --sat_fm_uc_incr true % 0.33/0.52 % --sat_out_model small % 0.33/0.52 % --sat_out_clauses false % 0.33/0.52 % 0.33/0.52 % ------ QBF Options % 0.33/0.52 % 0.33/0.52 % --qbf_mode false % 0.33/0.52 % --qbf_elim_univ true % 0.33/0.52 % --qbf_sk_in true % 0.33/0.52 % --qbf_pred_elim true % 0.33/0.52 % --qbf_split 32 % 0.33/0.52 % 0.33/0.52 % ------ BMC1 Options % 0.33/0.52 % 0.33/0.52 % --bmc1_incremental false % 0.33/0.52 % --bmc1_axioms reachable_all % 0.33/0.52 % --bmc1_min_bound 0 % 0.33/0.52 % --bmc1_max_bound -1 % 0.33/0.52 % --bmc1_max_bound_default -1 % 0.33/0.52 % --bmc1_symbol_reachability true % 0.33/0.52 % --bmc1_property_lemmas false % 0.33/0.52 % --bmc1_k_induction false % 0.33/0.52 % --bmc1_non_equiv_states false % 0.33/0.52 % --bmc1_deadlock false % 0.33/0.52 % --bmc1_ucm false % 0.33/0.52 % --bmc1_add_unsat_core none % 0.33/0.52 % --bmc1_unsat_core_children false % 0.33/0.52 % --bmc1_unsat_core_extrapolate_axioms false % 0.33/0.52 % --bmc1_out_stat full % 0.33/0.52 % --bmc1_ground_init false % 0.33/0.52 % --bmc1_pre_inst_next_state false % 0.33/0.52 % --bmc1_pre_inst_state false % 0.33/0.52 % --bmc1_pre_inst_reach_state false % 0.33/0.52 % --bmc1_out_unsat_core false % 0.33/0.52 % --bmc1_aig_witness_out false % 0.33/0.52 % --bmc1_verbose false % 0.33/0.52 % --bmc1_dump_clauses_tptp false % 0.33/0.52 % --bmc1_dump_unsat_core_tptp false % 0.33/0.52 % --bmc1_dump_file - % 0.33/0.52 % --bmc1_ucm_expand_uc_limit 128 % 0.33/0.52 % --bmc1_ucm_n_expand_iterations 6 % 0.33/0.52 % --bmc1_ucm_extend_mode 1 % 0.33/0.52 % --bmc1_ucm_init_mode 2 % 0.33/0.52 % --bmc1_ucm_cone_mode none % 0.33/0.52 % --bmc1_ucm_reduced_relation_type 0 % 0.33/0.52 % --bmc1_ucm_relax_model 4 % 0.33/0.52 % --bmc1_ucm_full_tr_after_sat true % 0.33/0.52 % --bmc1_ucm_expand_neg_assumptions false % 0.33/0.52 % --bmc1_ucm_layered_model none % 0.33/0.52 % --bmc1_ucm_max_lemma_size 10 % 0.33/0.52 % 0.33/0.52 % ------ AIG Options % 0.33/0.52 % 0.33/0.52 % --aig_mode false % 0.33/0.52 % 0.33/0.52 % ------ Instantiation Options % 0.33/0.52 % 0.33/0.52 % --instantiation_flag true % 0.33/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.33/0.52 % --inst_solver_per_active 750 % 0.33/0.52 % --inst_solver_calls_frac 0.5 % 0.33/0.52 % --inst_passive_queue_type priority_queues % 0.33/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.33/0.52 % --inst_passive_queues_freq [25;2] % 0.33/0.52 % --inst_dismatching true % 0.33/0.52 % --inst_eager_unprocessed_to_passive true % 114.23/114.45 % --inst_prop_sim_given true % 114.23/114.45 % --inst_prop_sim_new false % 114.23/114.45 % --inst_orphan_elimination true % 114.23/114.45 % --inst_learning_loop_flag true % 114.23/114.45 % --inst_learning_start 3000 % 114.23/114.45 % --inst_learning_factor 2 % 114.23/114.45 % --inst_start_prop_sim_after_learn 3 % 114.23/114.45 % --inst_sel_renew solver % 114.23/114.45 % --inst_lit_activity_flag true % 114.23/114.45 % --inst_out_proof true % 114.23/114.45 % 114.23/114.45 % ------ Resolution Options % 114.23/114.45 % 114.23/114.45 % --resolution_flag true % 114.23/114.45 % --res_lit_sel kbo_max % 114.23/114.45 % --res_to_prop_solver none % 114.23/114.45 % --res_prop_simpl_new false % 114.23/114.45 % --res_prop_simpl_given false % 114.23/114.45 % --res_passive_queue_type priority_queues % 114.23/114.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 114.23/114.45 % --res_passive_queues_freq [15;5] % 114.23/114.45 % --res_forward_subs full % 114.23/114.45 % --res_backward_subs full % 114.23/114.45 % --res_forward_subs_resolution true % 114.23/114.45 % --res_backward_subs_resolution true % 114.23/114.45 % --res_orphan_elimination false % 114.23/114.45 % --res_time_limit 1000. % 114.23/114.45 % --res_out_proof true % 114.23/114.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ca4565.s % 114.23/114.45 % --modulo true % 114.23/114.45 % 114.23/114.45 % ------ Combination Options % 114.23/114.45 % 114.23/114.45 % --comb_res_mult 1000 % 114.23/114.45 % --comb_inst_mult 300 % 114.23/114.45 % ------ % 114.23/114.45 % 114.23/114.45 % 114.23/114.45 % 114.23/114.45 % ------ Proving... % 114.23/114.45 % warning: shown sat in sat incomplete mode % 114.23/114.45 % % 114.23/114.45 % 114.23/114.45 % 114.23/114.45 ------ Building Model...Done % 114.23/114.45 % 114.23/114.45 %------ The model is defined over ground terms (initial term algebra). % 114.23/114.45 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 114.23/114.45 %------ where \phi is a formula over the term algebra. % 114.23/114.45 %------ If we have equality in the problem then it is also defined as a predicate above, % 114.23/114.45 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 114.23/114.45 %------ See help for --sat_out_model for different model outputs. % 114.23/114.45 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 114.23/114.45 %------ where the first argument stands for the sort ($i in the unsorted case) % 114.23/114.45 % 114.23/114.45 % 114.23/114.45 % 114.23/114.45 % 114.23/114.45 %------ Negative definition of equality_sorted % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X0,X1] : % 114.23/114.45 ( ~(equality_sorted(X0,X0,X1)) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=$i & X0=skf24(skc9,skc7) & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of member % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1,X2] : % 114.23/114.45 ( member(X0,X1,X2) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) & X2=skc9 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) & X2=skc9 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) & X2=skc9 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X3) & X2=skc9 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of two % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( two(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc9 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of be % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1,X2,X3] : % 114.23/114.45 ( be(X0,X1,X2,X3) <=> % 114.23/114.45 ( % 114.23/114.45 ? [X4] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf14(skc7,X4,skf20(skc9,skc7,skc9)) & X2=skf20(skc9,skc7,skc9) & X3=skf13(skf20(skc9,skc7,skc9),skc7,X4) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X4] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf14(skc7,X4,skf26(skc9,skc7)) & X2=skf26(skc9,skc7) & X3=skf13(skf26(skc9,skc7),skc7,X4) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X4] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf14(skc7,X4,skf24(skc9,skc7)) & X2=skf24(skc9,skc7) & X3=skf13(skf24(skc9,skc7),skc7,X4) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X4,X5] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf14(skc7,X4,skf22(skc9,skc7,X5)) & X2=skf22(skc9,skc7,X5) & X3=skf13(skf22(skc9,skc7,X5),skc7,X4) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X4,X5] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf14(skc7,X4,skf17(X5,skc7,skc9)) & X2=skf17(X5,skc7,skc9) & X3=skf13(skf17(X5,skc7,skc9),skc7,X4) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of entity % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( entity(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of of % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1,X2] : % 114.23/114.45 ( of(X0,X1,X2) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc12 & X2=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of placename % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( placename(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc12 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of forename % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( forename(X0,X1) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of agent % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1,X2] : % 114.23/114.45 ( agent(X0,X1,X2) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc10 & X2=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,skf26(skc9,skc7),X3) & X2=skf26(skc9,skc7) ) % 114.23/114.45 & % 114.23/114.45 ( X3!=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,skf24(skc9,skc7),X3) & X2=skf24(skc9,skc7) ) % 114.23/114.45 & % 114.23/114.45 ( X3!=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X3,X4] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,skf17(X3,skc7,skc9),X4) & X2=skf17(X3,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Negative definition of patient % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1,X2] : % 114.23/114.45 ( ~(patient(X0,X1,X2)) <=> % 114.23/114.45 ( % 114.23/114.45 ? [X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,skf26(skc9,skc7),X3) & X2=skf26(skc9,skc7) ) % 114.23/114.45 & % 114.23/114.45 ( X3!=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,skf24(skc9,skc7),X3) & X2=skf24(skc9,skc7) ) % 114.23/114.45 & % 114.23/114.45 ( X3!=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X3,X4] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,skf17(X3,skc7,skc9),X4) & X2=skf17(X3,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Negative definition of nonreflexive % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( ~(nonreflexive(X0,X1)) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0!=skc7 | X1!=skf18(skc7,X0,X1) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 ) % 114.23/114.45 & % 114.23/114.45 ( X1!=skf18(skc7,X1,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of young % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( young(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf17(X2,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of old % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( old(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of white % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( white(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of black % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( black(X0,X1) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of unisex % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( unisex(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc10 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc12 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X1=skf14(X0,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of male % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( male(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of specific % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( specific(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc10 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X1=skf14(X0,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of general % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( general(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc12 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of singleton % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( singleton(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc10 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc12 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X1=skf14(X0,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of multiple % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( multiple(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc8 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc9 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of nonliving % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( nonliving(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of living % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( living(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of nonhuman % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( nonhuman(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc12 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of human % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( human(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of existent % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( existent(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of nonexistent % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( nonexistent(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc10 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X1=skf14(X0,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of animate % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( animate(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of eventuality % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( eventuality(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc10 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf14(skc7,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X1=skf14(X0,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of state % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( state(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf14(skc7,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of thing % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( thing(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc10 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc12 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X1=skf14(X0,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of event % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( event(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc10 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf14(skc7,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X1=skf14(X0,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of device % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( device(X0,X1) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of wheel % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( wheel(X0,X1) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of instrumentality % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( instrumentality(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of artifact % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( artifact(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of object % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( object(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Negative definition of impartial % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( ~(impartial(X0,X1)) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of clothes % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( clothes(X0,X1) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of coat % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( coat(X0,X1) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of set % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( set(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc8 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc9 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of group % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( group(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc8 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc9 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of wear % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( wear(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ? [X2,X3] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf18(skc7,X2,X3) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of man % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( man(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of fellow % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( fellow(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of human_person % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( human_person(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of organism % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( organism(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 | % 114.23/114.45 ? [X2] : % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of barrel % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( barrel(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc10 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of way % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( way(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of street % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( street(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of car % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( car(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of chevy % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( chevy(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of vehicle % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( vehicle(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of transport % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( transport(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc13 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of relname % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( relname(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc12 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of relation % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( relation(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc12 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of abstraction % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( abstraction(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc12 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of hollywood_placename % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( hollywood_placename(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc12 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of location % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( location(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of city % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( city(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of seat % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( seat(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of frontseat % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( frontseat(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of furniture % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( furniture(X0,X1) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 & X1=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of jules_forename % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( jules_forename(X0,X1) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Negative definition of actual_world % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0] : % 114.23/114.45 ( ~(actual_world(X0)) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Negative definition of lonely % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( ~(lonely(X0,X1)) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Negative definition of down % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1,X2] : % 114.23/114.45 ( ~(down(X0,X1,X2)) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Negative definition of in % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1,X2] : % 114.23/114.45 ( ~(in(X0,X1,X2)) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc7 ) % 114.23/114.45 & % 114.23/114.45 ( X1!=skc10 | X2!=skc11 ) % 114.23/114.45 & % 114.23/114.45 ( X1!=skf13(skf26(skc9,skc7),skc7,X2) | X2!=X2 ) % 114.23/114.45 & % 114.23/114.45 ( X1!=skf13(skf24(skc9,skc7),skc7,X2) | X2!=X2 ) % 114.23/114.45 & % 114.23/114.45 ( X1!=skf13(skf20(skc9,skc7,skc9),skc7,X2) | X2!=X2 ) % 114.23/114.45 & % 114.23/114.45 ( X1!=skf13(skf22(skc9,skc7,X1),skc7,X2) | X2!=X2 ) % 114.23/114.45 & % 114.23/114.45 ( X1!=skf13(skf17(X5,skc7,skc9),skc7,skc11) | X2!=skc11 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Negative definition of ssSkP1 % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1,X2] : % 114.23/114.45 ( ~(ssSkP1(X0,X1,X2)) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Negative definition of dirty % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( ~(dirty(X0,X1)) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Negative definition of present % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( ~(present(X0,X1)) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Negative definition of ssSkP0 % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( ~(ssSkP0(X0,X1)) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Negative definition of ssSkP2 % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1,X2] : % 114.23/114.45 ( ~(ssSkP2(X0,X1,X2)) <=> % 114.23/114.45 ( % 114.23/114.45 ( % 114.23/114.45 ( X0=skc9 & X1=skc9 & X2=skc7 ) % 114.23/114.45 ) % 114.23/114.45 % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 %------ Positive definition of cheap % 114.23/114.45 fof(lit_def,axiom, % 114.23/114.45 (! [X0,X1] : % 114.23/114.45 ( cheap(X0,X1) <=> % 114.23/114.45 $false % 114.23/114.45 ) % 114.23/114.45 ) % 114.23/114.45 ). % 114.23/114.45 % 114.23/114.45 % 114.23/114.45 % 114.23/114.45 % ------ Statistics % 114.23/114.45 % 114.23/114.45 % ------ General % 114.23/114.45 % 114.23/114.45 % num_of_input_clauses: 220 % 114.23/114.45 % num_of_input_neg_conjectures: 47 % 114.23/114.45 % num_of_splits: 12 % 114.23/114.45 % num_of_split_atoms: 12 % 114.23/114.45 % num_of_sem_filtered_clauses: 0 % 114.23/114.45 % num_of_subtypes: 0 % 114.23/114.45 % monotx_restored_types: 0 % 114.23/114.45 % sat_num_of_epr_types: 0 % 114.23/114.45 % sat_num_of_non_cyclic_types: 0 % 114.23/114.45 % sat_guarded_non_collapsed_types: 0 % 114.23/114.45 % is_epr: 0 % 114.23/114.45 % is_horn: 0 % 114.23/114.45 % has_eq: 1 % 114.23/114.45 % num_pure_diseq_elim: 0 % 114.23/114.45 % simp_replaced_by: 0 % 114.23/114.45 % res_preprocessed: 106 % 114.23/114.45 % prep_upred: 0 % 114.23/114.45 % prep_unflattend: 136 % 114.23/114.45 % pred_elim_cands: 12 % 114.23/114.45 % pred_elim: 6 % 114.23/114.45 % pred_elim_cl: 8 % 114.23/114.45 % pred_elim_cycles: 18 % 114.23/114.45 % forced_gc_time: 0 % 114.23/114.45 % gc_basic_clause_elim: 0 % 114.23/114.45 % parsing_time: 0.008 % 114.23/114.45 % sem_filter_time: 0. % 114.23/114.45 % pred_elim_time: 0.041 % 114.23/114.45 % out_proof_time: 0. % 114.23/114.45 % monotx_time: 0. % 114.23/114.45 % subtype_inf_time: 0. % 114.23/114.45 % unif_index_cands_time: 0.07 % 114.23/114.45 % unif_index_add_time: 0.023 % 114.23/114.45 % total_time: 114.021 % 114.23/114.45 % num_of_symbols: 129 % 114.23/114.45 % num_of_terms: 116505 % 114.23/114.45 % 114.23/114.45 % ------ Propositional Solver % 114.23/114.45 % 114.23/114.45 % prop_solver_calls: 18 % 114.23/114.45 % prop_fast_solver_calls: 960 % 114.23/114.45 % prop_num_of_clauses: 1791 % 114.23/114.45 % prop_preprocess_simplified: 3819 % 114.23/114.45 % prop_fo_subsumed: 4 % 114.23/114.45 % prop_solver_time: 0.001 % 114.23/114.45 % prop_fast_solver_time: 0.002 % 114.23/114.45 % prop_unsat_core_time: 0. % 114.23/114.45 % 114.23/114.45 % ------ QBF % 114.23/114.45 % 114.23/114.45 % qbf_q_res: 0 % 114.23/114.45 % qbf_num_tautologies: 0 % 114.23/114.45 % qbf_prep_cycles: 0 % 114.23/114.45 % 114.23/114.45 % ------ BMC1 % 114.23/114.45 % 114.23/114.45 % bmc1_current_bound: -1 % 114.23/114.45 % bmc1_last_solved_bound: -1 % 114.23/114.45 % bmc1_unsat_core_size: -1 % 114.23/114.45 % bmc1_unsat_core_parents_size: -1 % 114.23/114.45 % bmc1_merge_next_fun: 0 % 114.23/114.45 % bmc1_unsat_core_clauses_time: 0. % 114.23/114.45 % 114.23/114.45 % ------ Instantiation % 114.23/114.45 % 114.23/114.45 % inst_num_of_clauses: 1208 % 114.23/114.45 % inst_num_in_passive: 0 % 114.23/114.45 % inst_num_in_active: 1208 % 114.23/114.45 % inst_num_in_unprocessed: 0 % 114.23/114.45 % inst_num_of_loops: 1656 % 114.23/114.45 % inst_num_of_learning_restarts: 0 % 114.23/114.45 % inst_num_moves_active_passive: 433 % 114.23/114.45 % inst_lit_activity: 213 % 114.23/114.45 % inst_lit_activity_moves: 0 % 114.23/114.45 % inst_num_tautologies: 0 % 114.23/114.45 % inst_num_prop_implied: 0 % 114.23/114.45 % inst_num_existing_simplified: 0 % 114.23/114.45 % inst_num_eq_res_simplified: 0 % 114.23/114.45 % inst_num_child_elim: 0 % 114.23/114.45 % inst_num_of_dismatching_blockings: 236 % 114.23/114.45 % inst_num_of_non_proper_insts: 4571 % 114.23/114.45 % inst_num_of_duplicates: 1020 % 114.23/114.46 % inst_inst_num_from_inst_to_res: 0 % 114.23/114.46 % inst_dismatching_checking_time: 0. % 114.23/114.46 % 114.23/114.46 % ------ Resolution % 114.23/114.46 % 114.23/114.46 % res_num_of_clauses: 874440 % 114.23/114.46 % res_num_in_passive: 900559 % 114.23/114.46 % res_num_in_active: 3992 % 114.23/114.46 % res_num_of_loops: 6000 % 114.23/114.46 % res_forward_subset_subsumed: 264210 % 114.23/114.46 % res_backward_subset_subsumed: 30895 % 114.23/114.46 % res_forward_subsumed: 1683 % 114.23/114.46 % res_backward_subsumed: 84 % 114.23/114.46 % res_forward_subsumption_resolution: 225 % 114.23/114.46 % res_backward_subsumption_resolution: 0 % 114.23/114.46 % res_clause_to_clause_subsumption: 54734 % 114.23/114.46 % res_orphan_elimination: 0 % 114.23/114.46 % res_tautology_del: 100784 % 114.23/114.46 % res_num_eq_res_simplified: 0 % 114.23/114.46 % res_num_sel_changes: 0 % 114.23/114.46 % res_moves_from_active_to_pass: 0 % 114.23/114.46 % 114.23/114.46 % Status Unknown % 114.23/114.51 % Orienting using strategy ClausalAll % 114.23/114.51 % Orientation found % 114.23/114.51 % 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_ca4565.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_8519d0.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_912550 | grep -v "SZS" % 114.33/114.53 % 114.33/114.53 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 114.33/114.53 % 114.33/114.53 % % 114.33/114.53 % ------ iProver source info % 114.33/114.53 % 114.33/114.53 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 114.33/114.53 % git: non_committed_changes: true % 114.33/114.53 % git: last_make_outside_of_git: true % 114.33/114.53 % 114.33/114.53 % % 114.33/114.53 % ------ Input Options % 114.33/114.53 % 114.33/114.53 % --out_options all % 114.33/114.53 % --tptp_safe_out true % 114.33/114.53 % --problem_path "" % 114.33/114.53 % --include_path "" % 114.33/114.53 % --clausifier .//eprover % 114.33/114.53 % --clausifier_options --tstp-format % 114.33/114.53 % --stdin false % 114.33/114.53 % --dbg_backtrace false % 114.33/114.53 % --dbg_dump_prop_clauses false % 114.33/114.53 % --dbg_dump_prop_clauses_file - % 114.33/114.53 % --dbg_out_stat false % 114.33/114.53 % 114.33/114.53 % ------ General Options % 114.33/114.53 % 114.33/114.53 % --fof false % 114.33/114.53 % --time_out_real 150. % 114.33/114.53 % --time_out_prep_mult 0.2 % 114.33/114.53 % --time_out_virtual -1. % 114.33/114.53 % --schedule none % 114.33/114.53 % --ground_splitting input % 114.33/114.53 % --splitting_nvd 16 % 114.33/114.53 % --non_eq_to_eq false % 114.33/114.53 % --prep_gs_sim true % 114.33/114.53 % --prep_unflatten false % 114.33/114.53 % --prep_res_sim true % 114.33/114.53 % --prep_upred true % 114.33/114.53 % --res_sim_input true % 114.33/114.53 % --clause_weak_htbl true % 114.33/114.53 % --gc_record_bc_elim false % 114.33/114.53 % --symbol_type_check false % 114.33/114.53 % --clausify_out false % 114.33/114.53 % --large_theory_mode false % 114.33/114.53 % --prep_sem_filter none % 114.33/114.53 % --prep_sem_filter_out false % 114.33/114.53 % --preprocessed_out false % 114.33/114.53 % --sub_typing false % 114.33/114.53 % --brand_transform false % 114.33/114.53 % --pure_diseq_elim true % 114.33/114.53 % --min_unsat_core false % 114.33/114.53 % --pred_elim true % 114.33/114.53 % --add_important_lit false % 114.33/114.53 % --soft_assumptions false % 114.33/114.53 % --reset_solvers false % 114.33/114.53 % --bc_imp_inh [] % 114.33/114.53 % --conj_cone_tolerance 1.5 % 114.33/114.53 % --prolific_symb_bound 500 % 114.33/114.53 % --lt_threshold 2000 % 114.33/114.53 % 114.33/114.53 % ------ SAT Options % 114.33/114.53 % 114.33/114.53 % --sat_mode false % 114.33/114.53 % --sat_fm_restart_options "" % 114.33/114.53 % --sat_gr_def false % 114.33/114.53 % --sat_epr_types true % 114.33/114.53 % --sat_non_cyclic_types false % 114.33/114.53 % --sat_finite_models false % 114.33/114.53 % --sat_fm_lemmas false % 114.33/114.53 % --sat_fm_prep false % 114.33/114.53 % --sat_fm_uc_incr true % 114.33/114.53 % --sat_out_model small % 114.33/114.53 % --sat_out_clauses false % 114.33/114.53 % 114.33/114.53 % ------ QBF Options % 114.33/114.53 % 114.33/114.53 % --qbf_mode false % 114.33/114.53 % --qbf_elim_univ true % 114.33/114.53 % --qbf_sk_in true % 114.33/114.53 % --qbf_pred_elim true % 114.33/114.53 % --qbf_split 32 % 114.33/114.53 % 114.33/114.53 % ------ BMC1 Options % 114.33/114.53 % 114.33/114.53 % --bmc1_incremental false % 114.33/114.53 % --bmc1_axioms reachable_all % 114.33/114.53 % --bmc1_min_bound 0 % 114.33/114.53 % --bmc1_max_bound -1 % 114.33/114.53 % --bmc1_max_bound_default -1 % 114.33/114.53 % --bmc1_symbol_reachability true % 114.33/114.53 % --bmc1_property_lemmas false % 114.33/114.53 % --bmc1_k_induction false % 114.33/114.53 % --bmc1_non_equiv_states false % 114.33/114.53 % --bmc1_deadlock false % 114.33/114.53 % --bmc1_ucm false % 114.33/114.53 % --bmc1_add_unsat_core none % 114.33/114.53 % --bmc1_unsat_core_children false % 114.33/114.53 % --bmc1_unsat_core_extrapolate_axioms false % 114.33/114.53 % --bmc1_out_stat full % 114.33/114.53 % --bmc1_ground_init false % 114.33/114.53 % --bmc1_pre_inst_next_state false % 114.33/114.53 % --bmc1_pre_inst_state false % 114.33/114.53 % --bmc1_pre_inst_reach_state false % 114.33/114.53 % --bmc1_out_unsat_core false % 114.33/114.53 % --bmc1_aig_witness_out false % 114.33/114.53 % --bmc1_verbose false % 114.33/114.53 % --bmc1_dump_clauses_tptp false % 114.33/114.56 % --bmc1_dump_unsat_core_tptp false % 114.33/114.56 % --bmc1_dump_file - % 114.33/114.56 % --bmc1_ucm_expand_uc_limit 128 % 114.33/114.56 % --bmc1_ucm_n_expand_iterations 6 % 114.33/114.56 % --bmc1_ucm_extend_mode 1 % 114.33/114.56 % --bmc1_ucm_init_mode 2 % 114.33/114.56 % --bmc1_ucm_cone_mode none % 114.33/114.56 % --bmc1_ucm_reduced_relation_type 0 % 114.33/114.56 % --bmc1_ucm_relax_model 4 % 114.33/114.56 % --bmc1_ucm_full_tr_after_sat true % 114.33/114.56 % --bmc1_ucm_expand_neg_assumptions false % 114.33/114.56 % --bmc1_ucm_layered_model none % 114.33/114.56 % --bmc1_ucm_max_lemma_size 10 % 114.33/114.56 % 114.33/114.56 % ------ AIG Options % 114.33/114.56 % 114.33/114.56 % --aig_mode false % 114.33/114.56 % 114.33/114.56 % ------ Instantiation Options % 114.33/114.56 % 114.33/114.56 % --instantiation_flag true % 114.33/114.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 114.33/114.56 % --inst_solver_per_active 750 % 114.33/114.56 % --inst_solver_calls_frac 0.5 % 114.33/114.56 % --inst_passive_queue_type priority_queues % 114.33/114.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 114.33/114.56 % --inst_passive_queues_freq [25;2] % 114.33/114.56 % --inst_dismatching true % 114.33/114.56 % --inst_eager_unprocessed_to_passive true % 114.33/114.56 % --inst_prop_sim_given true % 114.33/114.56 % --inst_prop_sim_new false % 114.33/114.56 % --inst_orphan_elimination true % 114.33/114.56 % --inst_learning_loop_flag true % 114.33/114.56 % --inst_learning_start 3000 % 114.33/114.56 % --inst_learning_factor 2 % 114.33/114.56 % --inst_start_prop_sim_after_learn 3 % 114.33/114.56 % --inst_sel_renew solver % 114.33/114.56 % --inst_lit_activity_flag true % 114.33/114.56 % --inst_out_proof true % 114.33/114.56 % 114.33/114.56 % ------ Resolution Options % 114.33/114.56 % 114.33/114.56 % --resolution_flag true % 114.33/114.56 % --res_lit_sel kbo_max % 114.33/114.56 % --res_to_prop_solver none % 114.33/114.56 % --res_prop_simpl_new false % 114.33/114.56 % --res_prop_simpl_given false % 114.33/114.56 % --res_passive_queue_type priority_queues % 114.33/114.56 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 114.33/114.56 % --res_passive_queues_freq [15;5] % 114.33/114.56 % --res_forward_subs full % 114.33/114.56 % --res_backward_subs full % 114.33/114.56 % --res_forward_subs_resolution true % 114.33/114.56 % --res_backward_subs_resolution true % 114.33/114.56 % --res_orphan_elimination false % 114.33/114.56 % --res_time_limit 1000. % 114.33/114.56 % --res_out_proof true % 114.33/114.56 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ca4565.s % 114.33/114.56 % --modulo true % 114.33/114.56 % 114.33/114.56 % ------ Combination Options % 114.33/114.56 % 114.33/114.56 % --comb_res_mult 1000 % 114.33/114.56 % --comb_inst_mult 300 % 114.33/114.56 % ------ % 114.33/114.56 % 114.33/114.56 % ------ Parsing...% successful % 114.33/114.56 % 114.33/114.56 % ------ Preprocessing... gs_s sp: 0 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 % % 114.33/114.56 % 114.33/114.56 % ------ Proving... % 114.33/114.56 % ------ Problem Properties % 114.33/114.56 % 114.33/114.56 % % 114.33/114.56 % EPR false % 114.33/114.56 % Horn false % 114.33/114.56 % Has equality true % 114.33/114.56 % 114.33/114.56 % % ------ Input Options Time Limit: Unbounded % 114.33/114.56 % 114.33/114.56 % 114.33/114.56 % % ------ Current options: % 114.33/114.56 % 114.33/114.56 % ------ Input Options % 114.33/114.56 % 114.33/114.56 % --out_options all % 114.33/114.56 % --tptp_safe_out true % 114.33/114.56 % --problem_path "" % 114.33/114.56 % --include_path "" % 114.33/114.56 % --clausifier .//eprover % 114.33/114.56 % --clausifier_options --tstp-format % 114.33/114.56 % --stdin false % 114.33/114.56 % --dbg_backtrace false % 114.33/114.56 % --dbg_dump_prop_clauses false % 114.33/114.56 % --dbg_dump_prop_clauses_file - % 114.33/114.56 % --dbg_out_stat false % 114.33/114.56 % 114.33/114.56 % ------ General Options % 114.33/114.56 % 114.33/114.56 % --fof false % 114.33/114.56 % --time_out_real 150. % 114.33/114.56 % --time_out_prep_mult 0.2 % 114.33/114.56 % --time_out_virtual -1. % 114.33/114.56 % --schedule none % 114.33/114.56 % --ground_splitting input % 114.33/114.56 % --splitting_nvd 16 % 114.33/114.56 % --non_eq_to_eq false % 114.33/114.56 % --prep_gs_sim true % 114.33/114.56 % --prep_unflatten false % 114.33/114.56 % --prep_res_sim true % 114.33/114.56 % --prep_upred true % 114.33/114.56 % --res_sim_input true % 114.33/114.56 % --clause_weak_htbl true % 114.33/114.56 % --gc_record_bc_elim false % 114.33/114.56 % --symbol_type_check false % 114.33/114.56 % --clausify_out false % 114.33/114.56 % --large_theory_mode false % 114.33/114.56 % --prep_sem_filter none % 114.33/114.56 % --prep_sem_filter_out false % 114.33/114.56 % --preprocessed_out false % 114.33/114.56 % --sub_typing false % 114.33/114.56 % --brand_transform false % 114.33/114.56 % --pure_diseq_elim true % 114.33/114.56 % --min_unsat_core false % 114.33/114.56 % --pred_elim true % 114.33/114.56 % --add_important_lit false % 114.33/114.56 % --soft_assumptions false % 114.33/114.56 % --reset_solvers false % 114.33/114.56 % --bc_imp_inh [] % 114.33/114.56 % --conj_cone_tolerance 1.5 % 114.33/114.56 % --prolific_symb_bound 500 % 114.33/114.56 % --lt_threshold 2000 % 114.33/114.56 % 114.33/114.56 % ------ SAT Options % 114.33/114.56 % 114.33/114.56 % --sat_mode false % 114.33/114.56 % --sat_fm_restart_options "" % 114.33/114.56 % --sat_gr_def false % 114.33/114.56 % --sat_epr_types true % 114.33/114.56 % --sat_non_cyclic_types false % 114.33/114.56 % --sat_finite_models false % 114.33/114.56 % --sat_fm_lemmas false % 114.33/114.56 % --sat_fm_prep false % 114.33/114.56 % --sat_fm_uc_incr true % 114.33/114.56 % --sat_out_model small % 114.33/114.56 % --sat_out_clauses false % 114.33/114.56 % 114.33/114.56 % ------ QBF Options % 114.33/114.56 % 114.33/114.56 % --qbf_mode false % 114.33/114.56 % --qbf_elim_univ true % 114.33/114.56 % --qbf_sk_in true % 114.33/114.56 % --qbf_pred_elim true % 114.33/114.56 % --qbf_split 32 % 114.33/114.56 % 114.33/114.56 % ------ BMC1 Options % 114.33/114.56 % 114.33/114.56 % --bmc1_incremental false % 114.33/114.56 % --bmc1_axioms reachable_all % 114.33/114.56 % --bmc1_min_bound 0 % 114.33/114.56 % --bmc1_max_bound -1 % 114.33/114.56 % --bmc1_max_bound_default -1 % 114.33/114.56 % --bmc1_symbol_reachability true % 114.33/114.56 % --bmc1_property_lemmas false % 114.33/114.56 % --bmc1_k_induction false % 114.33/114.56 % --bmc1_non_equiv_states false % 114.33/114.56 % --bmc1_deadlock false % 114.33/114.56 % --bmc1_ucm false % 114.33/114.56 % --bmc1_add_unsat_core none % 114.33/114.56 % --bmc1_unsat_core_children false % 114.33/114.56 % --bmc1_unsat_core_extrapolate_axioms false % 114.33/114.56 % --bmc1_out_stat full % 114.33/114.56 % --bmc1_ground_init false % 114.33/114.56 % --bmc1_pre_inst_next_state false % 114.33/114.56 % --bmc1_pre_inst_state false % 114.33/114.56 % --bmc1_pre_inst_reach_state false % 114.33/114.56 % --bmc1_out_unsat_core false % 114.33/114.56 % --bmc1_aig_witness_out false % 114.33/114.56 % --bmc1_verbose false % 114.33/114.56 % --bmc1_dump_clauses_tptp false % 114.33/114.56 % --bmc1_dump_unsat_core_tptp false % 114.33/114.56 % --bmc1_dump_file - % 114.33/114.56 % --bmc1_ucm_expand_uc_limit 128 % 114.33/114.56 % --bmc1_ucm_n_expand_iterations 6 % 114.33/114.56 % --bmc1_ucm_extend_mode 1 % 114.33/114.56 % --bmc1_ucm_init_mode 2 % 114.33/114.56 % --bmc1_ucm_cone_mode none % 114.33/114.56 % --bmc1_ucm_reduced_relation_type 0 % 114.33/114.56 % --bmc1_ucm_relax_model 4 % 114.33/114.56 % --bmc1_ucm_full_tr_after_sat true % 114.33/114.56 % --bmc1_ucm_expand_neg_assumptions false % 114.33/114.56 % --bmc1_ucm_layered_model none % 114.33/114.56 % --bmc1_ucm_max_lemma_size 10 % 114.33/114.56 % 114.33/114.56 % ------ AIG Options % 114.33/114.56 % 114.33/114.56 % --aig_mode false % 114.33/114.56 % 114.33/114.56 % ------ Instantiation Options % 114.33/114.56 % 114.33/114.56 % --instantiation_flag true % 114.33/114.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 114.33/114.56 % --inst_solver_per_active 750 % 114.33/114.56 % --inst_solver_calls_frac 0.5 % 114.33/114.56 % --inst_passive_queue_type priority_queues % 114.33/114.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 114.33/114.56 % --inst_passive_queues_freq [25;2] % 114.33/114.56 % --inst_dismatching true % 114.33/114.56 % --inst_eager_unprocessed_to_passive true % 209.47/209.74 % --inst_prop_sim_given true % 209.47/209.74 % --inst_prop_sim_new false % 209.47/209.74 % --inst_orphan_elimination true % 209.47/209.74 % --inst_learning_loop_flag true % 209.47/209.74 % --inst_learning_start 3000 % 209.47/209.74 % --inst_learning_factor 2 % 209.47/209.74 % --inst_start_prop_sim_after_learn 3 % 209.47/209.74 % --inst_sel_renew solver % 209.47/209.74 % --inst_lit_activity_flag true % 209.47/209.74 % --inst_out_proof true % 209.47/209.74 % 209.47/209.74 % ------ Resolution Options % 209.47/209.74 % 209.47/209.74 % --resolution_flag true % 209.47/209.74 % --res_lit_sel kbo_max % 209.47/209.74 % --res_to_prop_solver none % 209.47/209.74 % --res_prop_simpl_new false % 209.47/209.74 % --res_prop_simpl_given false % 209.47/209.74 % --res_passive_queue_type priority_queues % 209.47/209.74 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 209.47/209.74 % --res_passive_queues_freq [15;5] % 209.47/209.74 % --res_forward_subs full % 209.47/209.74 % --res_backward_subs full % 209.47/209.74 % --res_forward_subs_resolution true % 209.47/209.74 % --res_backward_subs_resolution true % 209.47/209.74 % --res_orphan_elimination false % 209.47/209.74 % --res_time_limit 1000. % 209.47/209.74 % --res_out_proof true % 209.47/209.74 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ca4565.s % 209.47/209.74 % --modulo true % 209.47/209.74 % 209.47/209.74 % ------ Combination Options % 209.47/209.74 % 209.47/209.74 % --comb_res_mult 1000 % 209.47/209.74 % --comb_inst_mult 300 % 209.47/209.74 % ------ % 209.47/209.74 % 209.47/209.74 % 209.47/209.74 % 209.47/209.74 % ------ Proving... % 209.47/209.74 % warning: shown sat in sat incomplete mode % 209.47/209.74 % % 209.47/209.74 % 209.47/209.74 % 209.47/209.74 ------ Building Model...Done % 209.47/209.74 % 209.47/209.74 %------ The model is defined over ground terms (initial term algebra). % 209.47/209.74 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 209.47/209.74 %------ where \phi is a formula over the term algebra. % 209.47/209.74 %------ If we have equality in the problem then it is also defined as a predicate above, % 209.47/209.74 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 209.47/209.74 %------ See help for --sat_out_model for different model outputs. % 209.47/209.74 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 209.47/209.74 %------ where the first argument stands for the sort ($i in the unsorted case) % 209.47/209.74 % 209.47/209.74 % 209.47/209.74 % 209.47/209.74 % 209.47/209.74 %------ Negative definition of equality_sorted % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X0,X1] : % 209.47/209.74 ( ~(equality_sorted(X0,X0,X1)) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=$i & X0=skf24(skc9,skc7) & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of member % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2] : % 209.47/209.74 ( member(X0,X1,X2) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) & X2=skc9 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) & X2=skc9 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X3] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X3) & X2=skc9 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) & X2=skc9 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of state % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( state(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf14(skc7,X2,X3) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of eventuality % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( eventuality(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc10 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf14(skc7,X2,X3) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X1=skf14(X0,X2,X3) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of thing % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( thing(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc10 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc12 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X1=skf14(X0,X2,X3) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of singleton % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( singleton(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc10 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc12 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X1=skf14(X0,X2,X3) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of specific % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( specific(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc10 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf18(skc7,X2,X3) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X1=skf14(X0,X2,X3) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of nonexistent % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( nonexistent(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc10 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf18(skc7,X2,X3) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X1=skf14(X0,X2,X3) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of unisex % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( unisex(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc10 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc12 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf18(skc7,X2,X3) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X1=skf14(X0,X2,X3) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of event % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( event(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc10 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf14(skc7,X2,X3) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2,X3] : % 209.47/209.74 ( % 209.47/209.74 ( X1=skf14(X0,X2,X3) ) % 209.47/209.74 & % 209.47/209.74 ( X0!=skc7 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of wheel % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( wheel(X0,X1) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of device % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( device(X0,X1) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of instrumentality % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( instrumentality(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of artifact % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( artifact(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of object % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( object(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of entity % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( entity(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of existent % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( existent(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of nonliving % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( nonliving(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Negative definition of impartial % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( ~(impartial(X0,X1)) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of coat % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( coat(X0,X1) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of clothes % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( clothes(X0,X1) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of group % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( group(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc8 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc9 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of set % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( set(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc8 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc9 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of multiple % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( multiple(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc8 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc9 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of wear % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( wear(X0,X1) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of fellow % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( fellow(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of man % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( man(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of human_person % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( human_person(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of organism % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( organism(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of living % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( living(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of human % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( human(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of animate % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( animate(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of male % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( male(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of two % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( two(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc9 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of barrel % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( barrel(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc10 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of street % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( street(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of way % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( way(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of chevy % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( chevy(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of car % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( car(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of vehicle % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( vehicle(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of transport % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( transport(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of placename % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( placename(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc12 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of relname % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( relname(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc12 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of relation % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( relation(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc12 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of abstraction % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( abstraction(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc12 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of nonhuman % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( nonhuman(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc12 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of general % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( general(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc12 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of hollywood_placename % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( hollywood_placename(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc12 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of city % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( city(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of location % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( location(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of frontseat % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( frontseat(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of seat % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( seat(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of furniture % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( furniture(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of forename % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( forename(X0,X1) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of jules_forename % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( jules_forename(X0,X1) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of old % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( old(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of young % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( young(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf22(skc9,skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf20(skc9,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X2] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf17(X2,skc7,skc9) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of black % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( black(X0,X1) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of white % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( white(X0,X1) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc13 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Negative definition of nonreflexive % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( ~(nonreflexive(X0,X1)) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0!=skc7 | X1!=skf18(skc7,X0,X1) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of patient % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2] : % 209.47/209.74 ( patient(X0,X1,X2) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf18(skc7,skf24(skc9,skc7),skf24(skc9,skc7)) & X2=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf18(skc7,skf26(skc9,skc7),skf24(skc9,skc7)) & X2=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf18(skc7,skf24(skc9,skc7),skf26(skc9,skc7)) & X2=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf18(skc7,skf26(skc9,skc7),skf26(skc9,skc7)) & X2=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Negative definition of agent % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2] : % 209.47/209.74 ( ~(agent(X0,X1,X2)) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf18(skc7,skf24(skc9,skc7),skf24(skc9,skc7)) & X2=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf18(skc7,skf26(skc9,skc7),skf24(skc9,skc7)) & X2=skf24(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf18(skc7,skf24(skc9,skc7),skf26(skc9,skc7)) & X2=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf18(skc7,skf26(skc9,skc7),skf26(skc9,skc7)) & X2=skf26(skc9,skc7) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of of % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2] : % 209.47/209.74 ( of(X0,X1,X2) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc12 & X2=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of be % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2,X3] : % 209.47/209.74 ( be(X0,X1,X2,X3) <=> % 209.47/209.74 ( % 209.47/209.74 ? [X4,X5] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf14(skc7,X4,skf22(skc9,skc7,X5)) & X2=skf22(skc9,skc7,X5) & X3=skf13(skf22(skc9,skc7,X5),skc7,X4) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X4] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf14(skc7,X4,skf24(skc9,skc7)) & X2=skf24(skc9,skc7) & X3=skf13(skf24(skc9,skc7),skc7,X4) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X4] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf14(skc7,X4,skf26(skc9,skc7)) & X2=skf26(skc9,skc7) & X3=skf13(skf26(skc9,skc7),skc7,X4) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X4] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf14(skc7,X4,skf20(skc9,skc7,skc9)) & X2=skf20(skc9,skc7,skc9) & X3=skf13(skf20(skc9,skc7,skc9),skc7,X4) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X4,X5] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf14(skc7,X4,skf17(X5,skc7,skc9)) & X2=skf17(X5,skc7,skc9) & X3=skf13(skf17(X5,skc7,skc9),skc7,X4) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Negative definition of actual_world % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0] : % 209.47/209.74 ( ~(actual_world(X0)) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Negative definition of lonely % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( ~(lonely(X0,X1)) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Negative definition of down % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2] : % 209.47/209.74 ( ~(down(X0,X1,X2)) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of in % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2] : % 209.47/209.74 ( in(X0,X1,X2) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skc10 & X2=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf13(skf24(skc9,skc7),skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf13(skf26(skc9,skc7),skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X3] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf13(skf22(skc9,skc7,X3),skc7,X2) ) % 209.47/209.74 & % 209.47/209.74 ( X2!=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X3] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf13(skf17(X3,skc7,skc9),skc7,skc11) & X2=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf13(skf20(skc9,skc7,skc9),skc7,X2) ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 | % 209.47/209.74 ? [X3] : % 209.47/209.74 ( % 209.47/209.74 ( X0=skc7 & X1=skf13(skf22(skc9,skc7,X3),skc7,skc11) & X2=skc11 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Negative definition of ssSkP1 % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2] : % 209.47/209.74 ( ~(ssSkP1(X0,X1,X2)) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Negative definition of dirty % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( ~(dirty(X0,X1)) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Negative definition of present % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( ~(present(X0,X1)) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Negative definition of ssSkP0 % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( ~(ssSkP0(X0,X1)) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Negative definition of ssSkP2 % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2] : % 209.47/209.74 ( ~(ssSkP2(X0,X1,X2)) <=> % 209.47/209.74 ( % 209.47/209.74 ( % 209.47/209.74 ( X0=skc9 & X1=skc9 & X2=skc7 ) % 209.47/209.74 ) % 209.47/209.74 % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of cheap % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1] : % 209.47/209.74 ( cheap(X0,X1) <=> % 209.47/209.74 $false % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of sP0_iProver_split % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] : % 209.47/209.74 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=> % 209.47/209.74 $true % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of sP3_iProver_split % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 209.47/209.74 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 209.47/209.74 $true % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of sP6_iProver_split % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] : % 209.47/209.74 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11) <=> % 209.47/209.74 $true % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 %------ Positive definition of sP9_iProver_split % 209.47/209.74 fof(lit_def,axiom, % 209.47/209.74 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : % 209.47/209.74 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=> % 209.47/209.74 $true % 209.47/209.74 ) % 209.47/209.74 ) % 209.47/209.74 ). % 209.47/209.74 % 209.47/209.74 % 209.47/209.74 % 209.47/209.74 % ------ Statistics % 209.47/209.74 % 209.47/209.74 % ------ General % 209.47/209.74 % 209.47/209.74 % num_of_input_clauses: 220 % 209.47/209.74 % num_of_input_neg_conjectures: 47 % 209.47/209.74 % num_of_splits: 12 % 209.47/209.74 % num_of_split_atoms: 12 % 209.47/209.74 % num_of_sem_filtered_clauses: 0 % 209.47/209.74 % num_of_subtypes: 0 % 209.47/209.74 % monotx_restored_types: 0 % 209.47/209.74 % sat_num_of_epr_types: 0 % 209.47/209.74 % sat_num_of_non_cyclic_types: 0 % 209.47/209.74 % sat_guarded_non_collapsed_types: 0 % 209.47/209.74 % is_epr: 0 % 209.47/209.74 % is_horn: 0 % 209.47/209.74 % has_eq: 1 % 209.47/209.74 % num_pure_diseq_elim: 0 % 209.47/209.74 % simp_replaced_by: 0 % 209.47/209.74 % res_preprocessed: 106 % 209.47/209.74 % prep_upred: 0 % 209.47/209.74 % prep_unflattend: 110 % 209.47/209.74 % pred_elim_cands: 12 % 209.47/209.74 % pred_elim: 6 % 209.47/209.74 % pred_elim_cl: 6 % 209.47/209.74 % pred_elim_cycles: 14 % 209.47/209.74 % forced_gc_time: 0 % 209.47/209.74 % gc_basic_clause_elim: 0 % 209.47/209.74 % parsing_time: 0.004 % 209.47/209.74 % sem_filter_time: 0. % 209.47/209.74 % pred_elim_time: 0.014 % 209.47/209.74 % out_proof_time: 0. % 209.47/209.74 % monotx_time: 0. % 209.47/209.74 % subtype_inf_time: 0. % 209.47/209.74 % unif_index_cands_time: 0.082 % 209.47/209.74 % unif_index_add_time: 0.021 % 209.47/209.74 % total_time: 95.218 % 209.47/209.74 % num_of_symbols: 129 % 209.47/209.74 % num_of_terms: 58624 % 209.47/209.74 % 209.47/209.74 % ------ Propositional Solver % 209.47/209.74 % 209.47/209.74 % prop_solver_calls: 18 % 209.47/209.74 % prop_fast_solver_calls: 864 % 209.47/209.74 % prop_num_of_clauses: 1633 % 209.47/209.74 % prop_preprocess_simplified: 3667 % 209.47/209.74 % prop_fo_subsumed: 2 % 209.47/209.74 % prop_solver_time: 0. % 209.47/209.74 % prop_fast_solver_time: 0. % 209.47/209.74 % prop_unsat_core_time: 0. % 209.47/209.74 % 209.47/209.74 % ------ QBF % 209.47/209.74 % 209.47/209.74 % qbf_q_res: 0 % 209.47/209.74 % qbf_num_tautologies: 0 % 209.47/209.74 % qbf_prep_cycles: 0 % 209.47/209.74 % 209.47/209.74 % ------ BMC1 % 209.47/209.74 % 209.47/209.74 % bmc1_current_bound: -1 % 209.47/209.74 % bmc1_last_solved_bound: -1 % 209.47/209.74 % bmc1_unsat_core_size: -1 % 209.47/209.74 % bmc1_unsat_core_parents_size: -1 % 209.47/209.74 % bmc1_merge_next_fun: 0 % 209.47/209.74 % bmc1_unsat_core_clauses_time: 0. % 209.47/209.74 % 209.47/209.74 % ------ Instantiation % 209.47/209.74 % 209.47/209.74 % inst_num_of_clauses: 1152 % 209.47/209.74 % inst_num_in_passive: 0 % 209.47/209.74 % inst_num_in_active: 1152 % 209.47/209.74 % inst_num_in_unprocessed: 0 % 209.47/209.74 % inst_num_of_loops: 1524 % 209.47/209.74 % inst_num_of_learning_restarts: 0 % 209.47/209.74 % inst_num_moves_active_passive: 356 % 209.47/209.74 % inst_lit_activity: 217 % 209.47/209.74 % inst_lit_activity_moves: 0 % 209.47/209.74 % inst_num_tautologies: 0 % 209.47/209.74 % inst_num_prop_implied: 0 % 209.47/209.74 % inst_num_existing_simplified: 0 % 209.47/209.74 % inst_num_eq_res_simplified: 0 % 209.47/209.74 % inst_num_child_elim: 0 % 209.47/209.74 % inst_num_of_dismatching_blockings: 127 % 209.47/209.74 % inst_num_of_non_proper_insts: 4874 % 209.47/209.74 % inst_num_of_duplicates: 900 % 209.47/209.74 % inst_inst_num_from_inst_to_res: 0 % 209.47/209.74 % inst_dismatching_checking_time: 0. % 209.47/209.74 % 209.47/209.74 % ------ Resolution % 209.47/209.74 % 209.47/209.74 % res_num_of_clauses: 830479 % 209.47/209.74 % res_num_in_passive: 852385 % 209.47/209.74 % res_num_in_active: 4547 % 209.47/209.74 % res_num_of_loops: 6000 % 209.47/209.74 % res_forward_subset_subsumed: 401833 % 209.47/209.74 % res_backward_subset_subsumed: 27079 % 209.47/209.74 % res_forward_subsumed: 1246 % 209.47/209.74 % res_backward_subsumed: 22 % 209.47/209.74 % res_forward_subsumption_resolution: 51 % 209.47/209.74 % res_backward_subsumption_resolution: 2 % 209.47/209.74 % res_clause_to_clause_subsumption: 50301 % 209.47/209.74 % res_orphan_elimination: 0 % 209.47/209.74 % res_tautology_del: 121877 % 209.47/209.74 % res_num_eq_res_simplified: 0 % 209.47/209.74 % res_num_sel_changes: 0 % 209.47/209.74 % res_moves_from_active_to_pass: 0 % 209.47/209.74 % 209.47/209.75 % Status Unknown % 209.47/209.75 % Last status : % 209.47/209.75 % SZS status Unknown %------------------------------------------------------------------------------