%------------------------------------------------------------------------------ % File : iProverMo---2.5-0.1 % Problem : NLP152-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : iprover_modulo %s %d % Computer : n018.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Mon Jul 18 02:41:07 EDT 2022 % Result : Unknown 44.54s 44.71s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NLP152-1 : TPTP v8.1.0. Released v2.4.0. % 0.11/0.13 % Command : iprover_modulo %s %d % 0.13/0.34 % Computer : n018.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jul 1 03:20:32 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.35 % Running in mono-core mode % 0.20/0.41 % Orienting using strategy Equiv(ClausalAll) % 0.20/0.41 % Orientation found % 0.20/0.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e78a85.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_85fab3.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_d9488f | grep -v "SZS" % 0.20/0.44 % 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 0.20/0.44 % 0.20/0.44 % % 0.20/0.44 % ------ iProver source info % 0.20/0.44 % 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 0.20/0.44 % git: non_committed_changes: true % 0.20/0.44 % git: last_make_outside_of_git: true % 0.20/0.44 % 0.20/0.44 % % 0.20/0.44 % ------ Input Options % 0.20/0.44 % 0.20/0.44 % --out_options all % 0.20/0.44 % --tptp_safe_out true % 0.20/0.44 % --problem_path "" % 0.20/0.44 % --include_path "" % 0.20/0.44 % --clausifier .//eprover % 0.20/0.44 % --clausifier_options --tstp-format % 0.20/0.44 % --stdin false % 0.20/0.44 % --dbg_backtrace false % 0.20/0.44 % --dbg_dump_prop_clauses false % 0.20/0.44 % --dbg_dump_prop_clauses_file - % 0.20/0.44 % --dbg_out_stat false % 0.20/0.44 % 0.20/0.44 % ------ General Options % 0.20/0.44 % 0.20/0.44 % --fof false % 0.20/0.44 % --time_out_real 150. % 0.20/0.44 % --time_out_prep_mult 0.2 % 0.20/0.44 % --time_out_virtual -1. % 0.20/0.44 % --schedule none % 0.20/0.44 % --ground_splitting input % 0.20/0.44 % --splitting_nvd 16 % 0.20/0.44 % --non_eq_to_eq false % 0.20/0.44 % --prep_gs_sim true % 0.20/0.44 % --prep_unflatten false % 0.20/0.44 % --prep_res_sim true % 0.20/0.44 % --prep_upred true % 0.20/0.44 % --res_sim_input true % 0.20/0.44 % --clause_weak_htbl true % 0.20/0.44 % --gc_record_bc_elim false % 0.20/0.44 % --symbol_type_check false % 0.20/0.44 % --clausify_out false % 0.20/0.44 % --large_theory_mode false % 0.20/0.44 % --prep_sem_filter none % 0.20/0.44 % --prep_sem_filter_out false % 0.20/0.44 % --preprocessed_out false % 0.20/0.44 % --sub_typing false % 0.20/0.44 % --brand_transform false % 0.20/0.44 % --pure_diseq_elim true % 0.20/0.44 % --min_unsat_core false % 0.20/0.44 % --pred_elim true % 0.20/0.44 % --add_important_lit false % 0.20/0.44 % --soft_assumptions false % 0.20/0.44 % --reset_solvers false % 0.20/0.44 % --bc_imp_inh [] % 0.20/0.44 % --conj_cone_tolerance 1.5 % 0.20/0.44 % --prolific_symb_bound 500 % 0.20/0.44 % --lt_threshold 2000 % 0.20/0.44 % 0.20/0.44 % ------ SAT Options % 0.20/0.44 % 0.20/0.44 % --sat_mode false % 0.20/0.44 % --sat_fm_restart_options "" % 0.20/0.44 % --sat_gr_def false % 0.20/0.44 % --sat_epr_types true % 0.20/0.44 % --sat_non_cyclic_types false % 0.20/0.44 % --sat_finite_models false % 0.20/0.44 % --sat_fm_lemmas false % 0.20/0.44 % --sat_fm_prep false % 0.20/0.44 % --sat_fm_uc_incr true % 0.20/0.44 % --sat_out_model small % 0.20/0.44 % --sat_out_clauses false % 0.20/0.44 % 0.20/0.44 % ------ QBF Options % 0.20/0.44 % 0.20/0.44 % --qbf_mode false % 0.20/0.44 % --qbf_elim_univ true % 0.20/0.44 % --qbf_sk_in true % 0.20/0.44 % --qbf_pred_elim true % 0.20/0.44 % --qbf_split 32 % 0.20/0.44 % 0.20/0.44 % ------ BMC1 Options % 0.20/0.44 % 0.20/0.44 % --bmc1_incremental false % 0.20/0.44 % --bmc1_axioms reachable_all % 0.20/0.44 % --bmc1_min_bound 0 % 0.20/0.44 % --bmc1_max_bound -1 % 0.20/0.44 % --bmc1_max_bound_default -1 % 0.20/0.44 % --bmc1_symbol_reachability true % 0.20/0.44 % --bmc1_property_lemmas false % 0.20/0.44 % --bmc1_k_induction false % 0.20/0.44 % --bmc1_non_equiv_states false % 0.20/0.44 % --bmc1_deadlock false % 0.20/0.44 % --bmc1_ucm false % 0.20/0.44 % --bmc1_add_unsat_core none % 0.20/0.44 % --bmc1_unsat_core_children false % 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false % 0.20/0.44 % --bmc1_out_stat full % 0.20/0.44 % --bmc1_ground_init false % 0.20/0.44 % --bmc1_pre_inst_next_state false % 0.20/0.44 % --bmc1_pre_inst_state false % 0.20/0.44 % --bmc1_pre_inst_reach_state false % 0.20/0.44 % --bmc1_out_unsat_core false % 0.20/0.44 % --bmc1_aig_witness_out false % 0.20/0.44 % --bmc1_verbose false % 0.20/0.44 % --bmc1_dump_clauses_tptp false % 0.20/0.46 % --bmc1_dump_unsat_core_tptp false % 0.20/0.46 % --bmc1_dump_file - % 0.20/0.46 % --bmc1_ucm_expand_uc_limit 128 % 0.20/0.46 % --bmc1_ucm_n_expand_iterations 6 % 0.20/0.46 % --bmc1_ucm_extend_mode 1 % 0.20/0.46 % --bmc1_ucm_init_mode 2 % 0.20/0.46 % --bmc1_ucm_cone_mode none % 0.20/0.46 % --bmc1_ucm_reduced_relation_type 0 % 0.20/0.46 % --bmc1_ucm_relax_model 4 % 0.20/0.46 % --bmc1_ucm_full_tr_after_sat true % 0.20/0.46 % --bmc1_ucm_expand_neg_assumptions false % 0.20/0.46 % --bmc1_ucm_layered_model none % 0.20/0.46 % --bmc1_ucm_max_lemma_size 10 % 0.20/0.46 % 0.20/0.46 % ------ AIG Options % 0.20/0.46 % 0.20/0.46 % --aig_mode false % 0.20/0.46 % 0.20/0.46 % ------ Instantiation Options % 0.20/0.46 % 0.20/0.46 % --instantiation_flag true % 0.20/0.46 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.20/0.46 % --inst_solver_per_active 750 % 0.20/0.46 % --inst_solver_calls_frac 0.5 % 0.20/0.46 % --inst_passive_queue_type priority_queues % 0.20/0.46 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.20/0.46 % --inst_passive_queues_freq [25;2] % 0.20/0.46 % --inst_dismatching true % 0.20/0.46 % --inst_eager_unprocessed_to_passive true % 0.20/0.46 % --inst_prop_sim_given true % 0.20/0.46 % --inst_prop_sim_new false % 0.20/0.46 % --inst_orphan_elimination true % 0.20/0.46 % --inst_learning_loop_flag true % 0.20/0.46 % --inst_learning_start 3000 % 0.20/0.46 % --inst_learning_factor 2 % 0.20/0.46 % --inst_start_prop_sim_after_learn 3 % 0.20/0.46 % --inst_sel_renew solver % 0.20/0.46 % --inst_lit_activity_flag true % 0.20/0.46 % --inst_out_proof true % 0.20/0.46 % 0.20/0.46 % ------ Resolution Options % 0.20/0.46 % 0.20/0.46 % --resolution_flag true % 0.20/0.46 % --res_lit_sel kbo_max % 0.20/0.46 % --res_to_prop_solver none % 0.20/0.46 % --res_prop_simpl_new false % 0.20/0.46 % --res_prop_simpl_given false % 0.20/0.46 % --res_passive_queue_type priority_queues % 0.20/0.46 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 0.20/0.46 % --res_passive_queues_freq [15;5] % 0.20/0.46 % --res_forward_subs full % 0.20/0.46 % --res_backward_subs full % 0.20/0.46 % --res_forward_subs_resolution true % 0.20/0.46 % --res_backward_subs_resolution true % 0.20/0.46 % --res_orphan_elimination false % 0.20/0.46 % --res_time_limit 1000. % 0.20/0.46 % --res_out_proof true % 0.20/0.46 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e78a85.s % 0.20/0.46 % --modulo true % 0.20/0.46 % 0.20/0.46 % ------ Combination Options % 0.20/0.46 % 0.20/0.46 % --comb_res_mult 1000 % 0.20/0.46 % --comb_inst_mult 300 % 0.20/0.46 % ------ % 0.20/0.46 % 0.20/0.46 % ------ Parsing...% successful % 0.20/0.46 % 0.20/0.46 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e % % 0.20/0.46 % 0.20/0.46 % ------ Proving... % 0.20/0.46 % ------ Problem Properties % 0.20/0.46 % 0.20/0.46 % % 0.20/0.46 % EPR false % 0.20/0.46 % Horn false % 0.20/0.46 % Has equality true % 0.20/0.46 % 0.20/0.46 % % ------ Input Options Time Limit: Unbounded % 0.20/0.46 % 0.20/0.46 % 0.20/0.46 % % ------ Current options: % 0.20/0.46 % 0.20/0.46 % ------ Input Options % 0.20/0.46 % 0.20/0.46 % --out_options all % 0.20/0.46 % --tptp_safe_out true % 0.20/0.46 % --problem_path "" % 0.20/0.46 % --include_path "" % 0.20/0.46 % --clausifier .//eprover % 0.20/0.46 % --clausifier_options --tstp-format % 0.20/0.46 % --stdin false % 0.20/0.46 % --dbg_backtrace false % 0.20/0.46 % --dbg_dump_prop_clauses false % 0.20/0.46 % --dbg_dump_prop_clauses_file - % 0.20/0.46 % --dbg_out_stat false % 0.20/0.46 % 0.20/0.46 % ------ General Options % 0.20/0.46 % 0.20/0.46 % --fof false % 0.20/0.46 % --time_out_real 150. % 0.20/0.46 % --time_out_prep_mult 0.2 % 0.20/0.46 % --time_out_virtual -1. % 0.20/0.46 % --schedule none % 0.20/0.46 % --ground_splitting input % 0.20/0.46 % --splitting_nvd 16 % 0.20/0.46 % --non_eq_to_eq false % 0.20/0.46 % --prep_gs_sim true % 0.20/0.46 % --prep_unflatten false % 0.20/0.46 % --prep_res_sim true % 0.20/0.46 % --prep_upred true % 0.20/0.46 % --res_sim_input true % 0.20/0.46 % --clause_weak_htbl true % 0.20/0.46 % --gc_record_bc_elim false % 0.20/0.46 % --symbol_type_check false % 0.20/0.46 % --clausify_out false % 0.20/0.46 % --large_theory_mode false % 0.20/0.46 % --prep_sem_filter none % 0.20/0.46 % --prep_sem_filter_out false % 0.20/0.46 % --preprocessed_out false % 0.20/0.46 % --sub_typing false % 0.20/0.46 % --brand_transform false % 0.20/0.46 % --pure_diseq_elim true % 0.20/0.46 % --min_unsat_core false % 0.20/0.46 % --pred_elim true % 0.20/0.46 % --add_important_lit false % 0.20/0.46 % --soft_assumptions false % 0.20/0.46 % --reset_solvers false % 0.20/0.46 % --bc_imp_inh [] % 0.20/0.46 % --conj_cone_tolerance 1.5 % 0.20/0.46 % --prolific_symb_bound 500 % 0.20/0.46 % --lt_threshold 2000 % 0.20/0.46 % 0.20/0.46 % ------ SAT Options % 0.20/0.46 % 0.20/0.46 % --sat_mode false % 0.20/0.46 % --sat_fm_restart_options "" % 0.20/0.46 % --sat_gr_def false % 0.20/0.46 % --sat_epr_types true % 0.20/0.46 % --sat_non_cyclic_types false % 0.20/0.46 % --sat_finite_models false % 0.20/0.46 % --sat_fm_lemmas false % 0.20/0.46 % --sat_fm_prep false % 0.20/0.46 % --sat_fm_uc_incr true % 0.20/0.46 % --sat_out_model small % 0.20/0.46 % --sat_out_clauses false % 0.20/0.46 % 0.20/0.46 % ------ QBF Options % 0.20/0.46 % 0.20/0.46 % --qbf_mode false % 0.20/0.46 % --qbf_elim_univ true % 0.20/0.46 % --qbf_sk_in true % 0.20/0.46 % --qbf_pred_elim true % 0.20/0.46 % --qbf_split 32 % 0.20/0.46 % 0.20/0.46 % ------ BMC1 Options % 0.20/0.46 % 0.20/0.46 % --bmc1_incremental false % 0.20/0.46 % --bmc1_axioms reachable_all % 0.20/0.46 % --bmc1_min_bound 0 % 0.20/0.46 % --bmc1_max_bound -1 % 0.20/0.46 % --bmc1_max_bound_default -1 % 0.20/0.46 % --bmc1_symbol_reachability true % 0.20/0.46 % --bmc1_property_lemmas false % 0.20/0.46 % --bmc1_k_induction false % 0.20/0.46 % --bmc1_non_equiv_states false % 0.20/0.46 % --bmc1_deadlock false % 0.20/0.46 % --bmc1_ucm false % 0.20/0.46 % --bmc1_add_unsat_core none % 0.20/0.46 % --bmc1_unsat_core_children false % 0.20/0.46 % --bmc1_unsat_core_extrapolate_axioms false % 0.20/0.46 % --bmc1_out_stat full % 0.20/0.46 % --bmc1_ground_init false % 0.20/0.46 % --bmc1_pre_inst_next_state false % 0.20/0.46 % --bmc1_pre_inst_state false % 0.20/0.46 % --bmc1_pre_inst_reach_state false % 0.20/0.46 % --bmc1_out_unsat_core false % 0.20/0.46 % --bmc1_aig_witness_out false % 0.20/0.46 % --bmc1_verbose false % 0.20/0.46 % --bmc1_dump_clauses_tptp false % 0.20/0.46 % --bmc1_dump_unsat_core_tptp false % 0.20/0.46 % --bmc1_dump_file - % 0.20/0.46 % --bmc1_ucm_expand_uc_limit 128 % 0.20/0.46 % --bmc1_ucm_n_expand_iterations 6 % 0.20/0.46 % --bmc1_ucm_extend_mode 1 % 0.20/0.46 % --bmc1_ucm_init_mode 2 % 0.20/0.46 % --bmc1_ucm_cone_mode none % 0.20/0.46 % --bmc1_ucm_reduced_relation_type 0 % 0.20/0.46 % --bmc1_ucm_relax_model 4 % 0.20/0.46 % --bmc1_ucm_full_tr_after_sat true % 0.20/0.46 % --bmc1_ucm_expand_neg_assumptions false % 0.20/0.46 % --bmc1_ucm_layered_model none % 0.20/0.46 % --bmc1_ucm_max_lemma_size 10 % 0.20/0.46 % 0.20/0.46 % ------ AIG Options % 0.20/0.46 % 0.20/0.46 % --aig_mode false % 0.20/0.46 % 0.20/0.46 % ------ Instantiation Options % 0.20/0.46 % 0.20/0.46 % --instantiation_flag true % 0.20/0.46 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.20/0.46 % --inst_solver_per_active 750 % 0.20/0.46 % --inst_solver_calls_frac 0.5 % 0.20/0.46 % --inst_passive_queue_type priority_queues % 0.20/0.46 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.20/0.46 % --inst_passive_queues_freq [25;2] % 0.20/0.46 % --inst_dismatching true % 0.20/0.46 % --inst_eager_unprocessed_to_passive true % 0.20/0.46 % --inst_prop_sim_given true % 37.73/37.98 % --inst_prop_sim_new false % 37.73/37.98 % --inst_orphan_elimination true % 37.73/37.98 % --inst_learning_loop_flag true % 37.73/37.98 % --inst_learning_start 3000 % 37.73/37.98 % --inst_learning_factor 2 % 37.73/37.98 % --inst_start_prop_sim_after_learn 3 % 37.73/37.98 % --inst_sel_renew solver % 37.73/37.98 % --inst_lit_activity_flag true % 37.73/37.98 % --inst_out_proof true % 37.73/37.98 % 37.73/37.98 % ------ Resolution Options % 37.73/37.98 % 37.73/37.98 % --resolution_flag true % 37.73/37.98 % --res_lit_sel kbo_max % 37.73/37.98 % --res_to_prop_solver none % 37.73/37.98 % --res_prop_simpl_new false % 37.73/37.98 % --res_prop_simpl_given false % 37.73/37.98 % --res_passive_queue_type priority_queues % 37.73/37.98 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 37.73/37.98 % --res_passive_queues_freq [15;5] % 37.73/37.98 % --res_forward_subs full % 37.73/37.98 % --res_backward_subs full % 37.73/37.98 % --res_forward_subs_resolution true % 37.73/37.98 % --res_backward_subs_resolution true % 37.73/37.98 % --res_orphan_elimination false % 37.73/37.98 % --res_time_limit 1000. % 37.73/37.98 % --res_out_proof true % 37.73/37.98 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e78a85.s % 37.73/37.98 % --modulo true % 37.73/37.98 % 37.73/37.98 % ------ Combination Options % 37.73/37.98 % 37.73/37.98 % --comb_res_mult 1000 % 37.73/37.98 % --comb_inst_mult 300 % 37.73/37.98 % ------ % 37.73/37.98 % 37.73/37.98 % 37.73/37.98 % 37.73/37.98 % ------ Proving... % 37.73/37.98 % warning: shown sat in sat incomplete mode % 37.73/37.98 % % 37.73/37.98 % 37.73/37.98 % 37.73/37.98 ------ Building Model...Done % 37.73/37.98 % 37.73/37.98 %------ The model is defined over ground terms (initial term algebra). % 37.73/37.98 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 37.73/37.98 %------ where \phi is a formula over the term algebra. % 37.73/37.98 %------ If we have equality in the problem then it is also defined as a predicate above, % 37.73/37.98 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 37.73/37.98 %------ See help for --sat_out_model for different model outputs. % 37.73/37.98 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 37.73/37.98 %------ where the first argument stands for the sort ($i in the unsorted case) % 37.73/37.98 % 37.73/37.98 % 37.73/37.98 % 37.73/37.98 % 37.73/37.98 %------ Negative definition of equality_sorted % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X0,X1] : % 37.73/37.98 ( ~(equality_sorted(X0,X0,X1)) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of member % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1,X2] : % 37.73/37.98 ( member(X0,X1,X2) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of two % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( two(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of be % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1,X2,X3] : % 37.73/37.98 ( be(X0,X1,X2,X3) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of entity % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( entity(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc7 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of of % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1,X2] : % 37.73/37.98 ( of(X0,X1,X2) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc9 & X2=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of placename % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( placename(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc9 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of young % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( young(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of old % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( old(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of unisex % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( unisex(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc6 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc7 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc9 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of male % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( male(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of specific % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( specific(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc6 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc7 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of general % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( general(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc9 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of singleton % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( singleton(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc6 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc7 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc9 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of multiple % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( multiple(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of nonliving % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( nonliving(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc7 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of living % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( living(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of nonhuman % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( nonhuman(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc9 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of human % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( human(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of existent % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( existent(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc7 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of nonexistent % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( nonexistent(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc6 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of animate % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( animate(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of man % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( man(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of fellow % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( fellow(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of human_person % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( human_person(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of organism % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( organism(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of thing % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( thing(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc6 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc7 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc9 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Negative definition of impartial % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( ~(impartial(X0,X1)) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of set % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( set(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of group % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( group(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of eventuality % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( eventuality(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc6 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of state % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( state(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of event % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( event(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc6 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of barrel % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( barrel(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc6 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of car % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( car(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of chevy % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( chevy(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of vehicle % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( vehicle(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of transport % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( transport(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of instrumentality % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( instrumentality(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of artifact % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( artifact(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc7 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of object % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( object(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 | % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc7 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of way % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( way(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc7 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of street % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( street(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc7 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of relname % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( relname(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc9 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of relation % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( relation(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc9 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of abstraction % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( abstraction(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc9 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of hollywood_placename % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( hollywood_placename(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc9 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of location % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( location(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of city % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( city(X0,X1) <=> % 37.73/37.98 ( % 37.73/37.98 ( % 37.73/37.98 ( X0=skc5 & X1=skc8 ) % 37.73/37.98 ) % 37.73/37.98 % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of seat % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( seat(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of frontseat % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( frontseat(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of furniture % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( furniture(X0,X1) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Negative definition of actual_world % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0] : % 37.73/37.98 ( ~(actual_world(X0)) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Positive definition of ssSkP0 % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( ssSkP0(X0,X1) <=> % 37.73/37.98 $true % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Negative definition of lonely % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( ~(lonely(X0,X1)) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Negative definition of down % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1,X2] : % 37.73/37.98 ( ~(down(X0,X1,X2)) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Negative definition of present % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( ~(present(X0,X1)) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Negative definition of in % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1,X2] : % 37.73/37.98 ( ~(in(X0,X1,X2)) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Negative definition of agent % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1,X2] : % 37.73/37.98 ( ~(agent(X0,X1,X2)) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Negative definition of dirty % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( ~(dirty(X0,X1)) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 %------ Negative definition of white % 37.73/37.98 fof(lit_def,axiom, % 37.73/37.98 (! [X0,X1] : % 37.73/37.98 ( ~(white(X0,X1)) <=> % 37.73/37.98 $false % 37.73/37.98 ) % 37.73/37.98 ) % 37.73/37.98 ). % 37.73/37.98 % 37.73/37.98 % 37.73/37.98 % 37.73/37.98 % ------ Statistics % 37.73/37.98 % 37.73/37.98 % ------ General % 37.73/37.98 % 37.73/37.98 % num_of_input_clauses: 170 % 37.73/37.98 % num_of_input_neg_conjectures: 22 % 37.73/37.98 % num_of_splits: 0 % 37.73/37.98 % num_of_split_atoms: 0 % 37.73/37.98 % num_of_sem_filtered_clauses: 0 % 37.73/37.98 % num_of_subtypes: 0 % 37.73/37.98 % monotx_restored_types: 0 % 37.73/37.98 % sat_num_of_epr_types: 0 % 37.73/37.98 % sat_num_of_non_cyclic_types: 0 % 37.73/37.98 % sat_guarded_non_collapsed_types: 0 % 37.73/37.98 % is_epr: 0 % 37.73/37.98 % is_horn: 0 % 37.73/37.98 % has_eq: 1 % 37.73/37.98 % num_pure_diseq_elim: 0 % 37.73/37.98 % simp_replaced_by: 0 % 37.73/37.98 % res_preprocessed: 44 % 37.73/37.98 % prep_upred: 0 % 37.73/37.98 % prep_unflattend: 0 % 37.73/37.98 % pred_elim_cands: 0 % 37.73/37.98 % pred_elim: 0 % 37.73/37.98 % pred_elim_cl: 0 % 37.73/37.98 % pred_elim_cycles: 0 % 37.73/37.98 % forced_gc_time: 0 % 37.73/37.98 % gc_basic_clause_elim: 0 % 37.73/37.98 % parsing_time: 0.005 % 37.73/37.98 % sem_filter_time: 0. % 37.73/37.98 % pred_elim_time: 0. % 37.73/37.98 % out_proof_time: 0. % 37.73/37.98 % monotx_time: 0. % 37.73/37.98 % subtype_inf_time: 0. % 37.73/37.98 % unif_index_cands_time: 0.03 % 37.73/37.98 % unif_index_add_time: 0.004 % 37.73/37.98 % total_time: 37.559 % 37.73/37.98 % num_of_symbols: 95 % 37.73/37.98 % num_of_terms: 469856 % 37.73/37.98 % 37.73/37.98 % ------ Propositional Solver % 37.73/37.98 % 37.73/37.98 % prop_solver_calls: 8 % 37.73/37.98 % prop_fast_solver_calls: 284 % 37.73/37.98 % prop_num_of_clauses: 250 % 37.73/37.98 % prop_preprocess_simplified: 1129 % 37.73/37.98 % prop_fo_subsumed: 4 % 37.73/37.98 % prop_solver_time: 0. % 37.73/37.98 % prop_fast_solver_time: 0. % 37.73/37.98 % prop_unsat_core_time: 0. % 37.73/37.98 % 37.73/37.98 % ------ QBF % 37.73/37.98 % 37.73/37.98 % qbf_q_res: 0 % 37.73/37.98 % qbf_num_tautologies: 0 % 37.73/37.98 % qbf_prep_cycles: 0 % 37.73/37.98 % 37.73/37.98 % ------ BMC1 % 37.73/37.98 % 37.73/37.98 % bmc1_current_bound: -1 % 37.73/37.98 % bmc1_last_solved_bound: -1 % 37.73/37.98 % bmc1_unsat_core_size: -1 % 37.73/37.98 % bmc1_unsat_core_parents_size: -1 % 37.73/37.98 % bmc1_merge_next_fun: 0 % 37.73/37.98 % bmc1_unsat_core_clauses_time: 0. % 37.73/37.98 % 37.73/37.98 % ------ Instantiation % 37.73/37.98 % 37.73/37.98 % inst_num_of_clauses: 246 % 37.73/37.98 % inst_num_in_passive: 0 % 37.73/37.98 % inst_num_in_active: 246 % 37.73/37.98 % inst_num_in_unprocessed: 0 % 37.73/37.98 % inst_num_of_loops: 255 % 37.73/37.98 % inst_num_of_learning_restarts: 0 % 37.73/37.98 % inst_num_moves_active_passive: 0 % 37.73/37.98 % inst_lit_activity: 18 % 37.73/37.98 % inst_lit_activity_moves: 0 % 37.73/37.98 % inst_num_tautologies: 0 % 37.73/37.98 % inst_num_prop_implied: 0 % 37.73/37.98 % inst_num_existing_simplified: 0 % 37.73/37.98 % inst_num_eq_res_simplified: 0 % 37.73/37.98 % inst_num_child_elim: 0 % 37.73/37.98 % inst_num_of_dismatching_blockings: 0 % 37.73/37.98 % inst_num_of_non_proper_insts: 62 % 37.73/37.98 % inst_num_of_duplicates: 48 % 37.73/37.98 % inst_inst_num_from_inst_to_res: 0 % 37.73/37.98 % inst_dismatching_checking_time: 0. % 37.73/37.98 % 37.73/37.98 % ------ Resolution % 37.73/37.98 % 37.73/37.98 % res_num_of_clauses: 56344 % 37.73/37.98 % res_num_in_passive: 55189 % 37.73/37.98 % res_num_in_active: 1068 % 37.73/37.98 % res_num_of_loops: 1000 % 37.73/37.98 % res_forward_subset_subsumed: 94 % 37.73/37.98 % res_backward_subset_subsumed: 0 % 37.73/37.98 % res_forward_subsumed: 1 % 37.73/37.98 % res_backward_subsumed: 3 % 37.73/37.98 % res_forward_subsumption_resolution: 58 % 37.73/37.98 % res_backward_subsumption_resolution: 0 % 37.73/37.98 % res_clause_to_clause_subsumption: 37422 % 37.73/37.98 % res_orphan_elimination: 0 % 37.73/37.98 % res_tautology_del: 842 % 37.73/37.98 % res_num_eq_res_simplified: 0 % 37.73/37.98 % res_num_sel_changes: 0 % 37.73/37.98 % res_moves_from_active_to_pass: 0 % 37.73/37.98 % 37.73/37.98 % Status Unknown % 37.84/38.03 % Orienting using strategy ClausalAll % 37.84/38.03 % Orientation found % 37.84/38.03 % 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_e78a85.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_85fab3.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_80fba3 | grep -v "SZS" % 37.84/38.04 % 37.84/38.04 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 37.84/38.04 % 37.84/38.04 % % 37.84/38.04 % ------ iProver source info % 37.84/38.04 % 37.84/38.04 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 37.84/38.04 % git: non_committed_changes: true % 37.84/38.04 % git: last_make_outside_of_git: true % 37.84/38.04 % 37.84/38.04 % % 37.84/38.04 % ------ Input Options % 37.84/38.04 % 37.84/38.04 % --out_options all % 37.84/38.04 % --tptp_safe_out true % 37.84/38.04 % --problem_path "" % 37.84/38.04 % --include_path "" % 37.84/38.04 % --clausifier .//eprover % 37.84/38.04 % --clausifier_options --tstp-format % 37.84/38.04 % --stdin false % 37.84/38.04 % --dbg_backtrace false % 37.84/38.04 % --dbg_dump_prop_clauses false % 37.84/38.04 % --dbg_dump_prop_clauses_file - % 37.84/38.04 % --dbg_out_stat false % 37.84/38.04 % 37.84/38.04 % ------ General Options % 37.84/38.04 % 37.84/38.04 % --fof false % 37.84/38.04 % --time_out_real 150. % 37.84/38.04 % --time_out_prep_mult 0.2 % 37.84/38.04 % --time_out_virtual -1. % 37.84/38.04 % --schedule none % 37.84/38.04 % --ground_splitting input % 37.84/38.04 % --splitting_nvd 16 % 37.84/38.04 % --non_eq_to_eq false % 37.84/38.04 % --prep_gs_sim true % 37.84/38.04 % --prep_unflatten false % 37.84/38.04 % --prep_res_sim true % 37.84/38.04 % --prep_upred true % 37.84/38.04 % --res_sim_input true % 37.84/38.04 % --clause_weak_htbl true % 37.84/38.04 % --gc_record_bc_elim false % 37.84/38.04 % --symbol_type_check false % 37.84/38.04 % --clausify_out false % 37.84/38.04 % --large_theory_mode false % 37.84/38.04 % --prep_sem_filter none % 37.84/38.04 % --prep_sem_filter_out false % 37.84/38.04 % --preprocessed_out false % 37.84/38.04 % --sub_typing false % 37.84/38.04 % --brand_transform false % 37.84/38.04 % --pure_diseq_elim true % 37.84/38.04 % --min_unsat_core false % 37.84/38.04 % --pred_elim true % 37.84/38.04 % --add_important_lit false % 37.84/38.04 % --soft_assumptions false % 37.84/38.04 % --reset_solvers false % 37.84/38.04 % --bc_imp_inh [] % 37.84/38.04 % --conj_cone_tolerance 1.5 % 37.84/38.04 % --prolific_symb_bound 500 % 37.84/38.04 % --lt_threshold 2000 % 37.84/38.04 % 37.84/38.04 % ------ SAT Options % 37.84/38.04 % 37.84/38.04 % --sat_mode false % 37.84/38.04 % --sat_fm_restart_options "" % 37.84/38.04 % --sat_gr_def false % 37.84/38.04 % --sat_epr_types true % 37.84/38.04 % --sat_non_cyclic_types false % 37.84/38.04 % --sat_finite_models false % 37.84/38.04 % --sat_fm_lemmas false % 37.84/38.04 % --sat_fm_prep false % 37.84/38.04 % --sat_fm_uc_incr true % 37.84/38.04 % --sat_out_model small % 37.84/38.04 % --sat_out_clauses false % 37.84/38.04 % 37.84/38.04 % ------ QBF Options % 37.84/38.04 % 37.84/38.04 % --qbf_mode false % 37.84/38.04 % --qbf_elim_univ true % 37.84/38.04 % --qbf_sk_in true % 37.84/38.04 % --qbf_pred_elim true % 37.84/38.04 % --qbf_split 32 % 37.84/38.04 % 37.84/38.04 % ------ BMC1 Options % 37.84/38.04 % 37.84/38.04 % --bmc1_incremental false % 37.84/38.04 % --bmc1_axioms reachable_all % 37.84/38.04 % --bmc1_min_bound 0 % 37.84/38.04 % --bmc1_max_bound -1 % 37.84/38.04 % --bmc1_max_bound_default -1 % 37.84/38.04 % --bmc1_symbol_reachability true % 37.84/38.04 % --bmc1_property_lemmas false % 37.84/38.04 % --bmc1_k_induction false % 37.84/38.04 % --bmc1_non_equiv_states false % 37.84/38.04 % --bmc1_deadlock false % 37.84/38.04 % --bmc1_ucm false % 37.84/38.04 % --bmc1_add_unsat_core none % 37.84/38.04 % --bmc1_unsat_core_children false % 37.84/38.04 % --bmc1_unsat_core_extrapolate_axioms false % 37.84/38.04 % --bmc1_out_stat full % 37.84/38.04 % --bmc1_ground_init false % 37.84/38.04 % --bmc1_pre_inst_next_state false % 37.84/38.04 % --bmc1_pre_inst_state false % 37.84/38.04 % --bmc1_pre_inst_reach_state false % 37.84/38.04 % --bmc1_out_unsat_core false % 37.84/38.04 % --bmc1_aig_witness_out false % 37.84/38.04 % --bmc1_verbose false % 37.84/38.04 % --bmc1_dump_clauses_tptp false % 37.84/38.05 % --bmc1_dump_unsat_core_tptp false % 37.84/38.05 % --bmc1_dump_file - % 37.84/38.05 % --bmc1_ucm_expand_uc_limit 128 % 37.84/38.05 % --bmc1_ucm_n_expand_iterations 6 % 37.84/38.05 % --bmc1_ucm_extend_mode 1 % 37.84/38.05 % --bmc1_ucm_init_mode 2 % 37.84/38.05 % --bmc1_ucm_cone_mode none % 37.84/38.05 % --bmc1_ucm_reduced_relation_type 0 % 37.84/38.05 % --bmc1_ucm_relax_model 4 % 37.84/38.05 % --bmc1_ucm_full_tr_after_sat true % 37.84/38.05 % --bmc1_ucm_expand_neg_assumptions false % 37.84/38.05 % --bmc1_ucm_layered_model none % 37.84/38.05 % --bmc1_ucm_max_lemma_size 10 % 37.84/38.05 % 37.84/38.05 % ------ AIG Options % 37.84/38.05 % 37.84/38.05 % --aig_mode false % 37.84/38.05 % 37.84/38.05 % ------ Instantiation Options % 37.84/38.05 % 37.84/38.05 % --instantiation_flag true % 37.84/38.05 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 37.84/38.05 % --inst_solver_per_active 750 % 37.84/38.05 % --inst_solver_calls_frac 0.5 % 37.84/38.05 % --inst_passive_queue_type priority_queues % 37.84/38.05 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 37.84/38.05 % --inst_passive_queues_freq [25;2] % 37.84/38.05 % --inst_dismatching true % 37.84/38.05 % --inst_eager_unprocessed_to_passive true % 37.84/38.05 % --inst_prop_sim_given true % 37.84/38.05 % --inst_prop_sim_new false % 37.84/38.05 % --inst_orphan_elimination true % 37.84/38.05 % --inst_learning_loop_flag true % 37.84/38.05 % --inst_learning_start 3000 % 37.84/38.05 % --inst_learning_factor 2 % 37.84/38.05 % --inst_start_prop_sim_after_learn 3 % 37.84/38.05 % --inst_sel_renew solver % 37.84/38.05 % --inst_lit_activity_flag true % 37.84/38.05 % --inst_out_proof true % 37.84/38.05 % 37.84/38.05 % ------ Resolution Options % 37.84/38.05 % 37.84/38.05 % --resolution_flag true % 37.84/38.05 % --res_lit_sel kbo_max % 37.84/38.05 % --res_to_prop_solver none % 37.84/38.05 % --res_prop_simpl_new false % 37.84/38.05 % --res_prop_simpl_given false % 37.84/38.05 % --res_passive_queue_type priority_queues % 37.84/38.05 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 37.84/38.05 % --res_passive_queues_freq [15;5] % 37.84/38.05 % --res_forward_subs full % 37.84/38.05 % --res_backward_subs full % 37.84/38.05 % --res_forward_subs_resolution true % 37.84/38.05 % --res_backward_subs_resolution true % 37.84/38.05 % --res_orphan_elimination false % 37.84/38.05 % --res_time_limit 1000. % 37.84/38.05 % --res_out_proof true % 37.84/38.05 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e78a85.s % 37.84/38.05 % --modulo true % 37.84/38.05 % 37.84/38.05 % ------ Combination Options % 37.84/38.05 % 37.84/38.05 % --comb_res_mult 1000 % 37.84/38.05 % --comb_inst_mult 300 % 37.84/38.05 % ------ % 37.84/38.05 % 37.84/38.05 % ------ Parsing...% successful % 37.84/38.05 % 37.84/38.05 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e % % 37.84/38.05 % 37.84/38.05 % ------ Proving... % 37.84/38.05 % ------ Problem Properties % 37.84/38.05 % 37.84/38.05 % % 37.84/38.05 % EPR false % 37.84/38.05 % Horn false % 37.84/38.05 % Has equality true % 37.84/38.05 % 37.84/38.05 % % ------ Input Options Time Limit: Unbounded % 37.84/38.05 % 37.84/38.05 % 37.84/38.05 % % ------ Current options: % 37.84/38.05 % 37.84/38.05 % ------ Input Options % 37.84/38.05 % 37.84/38.05 % --out_options all % 37.84/38.05 % --tptp_safe_out true % 37.84/38.05 % --problem_path "" % 37.84/38.05 % --include_path "" % 37.84/38.05 % --clausifier .//eprover % 37.84/38.05 % --clausifier_options --tstp-format % 37.84/38.05 % --stdin false % 37.84/38.05 % --dbg_backtrace false % 37.84/38.05 % --dbg_dump_prop_clauses false % 37.84/38.05 % --dbg_dump_prop_clauses_file - % 37.84/38.05 % --dbg_out_stat false % 37.84/38.05 % 37.84/38.05 % ------ General Options % 37.84/38.05 % 37.84/38.05 % --fof false % 37.84/38.05 % --time_out_real 150. % 37.84/38.05 % --time_out_prep_mult 0.2 % 37.84/38.05 % --time_out_virtual -1. % 37.84/38.05 % --schedule none % 37.84/38.05 % --ground_splitting input % 37.84/38.05 % --splitting_nvd 16 % 37.84/38.05 % --non_eq_to_eq false % 37.84/38.05 % --prep_gs_sim true % 37.84/38.05 % --prep_unflatten false % 37.84/38.05 % --prep_res_sim true % 37.84/38.05 % --prep_upred true % 37.84/38.05 % --res_sim_input true % 37.84/38.05 % --clause_weak_htbl true % 37.84/38.05 % --gc_record_bc_elim false % 37.84/38.05 % --symbol_type_check false % 37.84/38.05 % --clausify_out false % 37.84/38.05 % --large_theory_mode false % 37.84/38.05 % --prep_sem_filter none % 37.84/38.05 % --prep_sem_filter_out false % 37.84/38.05 % --preprocessed_out false % 37.84/38.05 % --sub_typing false % 37.84/38.05 % --brand_transform false % 37.84/38.05 % --pure_diseq_elim true % 37.84/38.05 % --min_unsat_core false % 37.84/38.05 % --pred_elim true % 37.84/38.05 % --add_important_lit false % 37.84/38.05 % --soft_assumptions false % 37.84/38.05 % --reset_solvers false % 37.84/38.05 % --bc_imp_inh [] % 37.84/38.05 % --conj_cone_tolerance 1.5 % 37.84/38.05 % --prolific_symb_bound 500 % 37.84/38.05 % --lt_threshold 2000 % 37.84/38.05 % 37.84/38.05 % ------ SAT Options % 37.84/38.05 % 37.84/38.05 % --sat_mode false % 37.84/38.05 % --sat_fm_restart_options "" % 37.84/38.05 % --sat_gr_def false % 37.84/38.05 % --sat_epr_types true % 37.84/38.05 % --sat_non_cyclic_types false % 37.84/38.05 % --sat_finite_models false % 37.84/38.05 % --sat_fm_lemmas false % 37.84/38.05 % --sat_fm_prep false % 37.84/38.05 % --sat_fm_uc_incr true % 37.84/38.05 % --sat_out_model small % 37.84/38.05 % --sat_out_clauses false % 37.84/38.05 % 37.84/38.05 % ------ QBF Options % 37.84/38.05 % 37.84/38.05 % --qbf_mode false % 37.84/38.05 % --qbf_elim_univ true % 37.84/38.05 % --qbf_sk_in true % 37.84/38.05 % --qbf_pred_elim true % 37.84/38.05 % --qbf_split 32 % 37.84/38.05 % 37.84/38.05 % ------ BMC1 Options % 37.84/38.05 % 37.84/38.05 % --bmc1_incremental false % 37.84/38.05 % --bmc1_axioms reachable_all % 37.84/38.05 % --bmc1_min_bound 0 % 37.84/38.05 % --bmc1_max_bound -1 % 37.84/38.05 % --bmc1_max_bound_default -1 % 37.84/38.05 % --bmc1_symbol_reachability true % 37.84/38.05 % --bmc1_property_lemmas false % 37.84/38.05 % --bmc1_k_induction false % 37.84/38.05 % --bmc1_non_equiv_states false % 37.84/38.05 % --bmc1_deadlock false % 37.84/38.05 % --bmc1_ucm false % 37.84/38.05 % --bmc1_add_unsat_core none % 37.84/38.05 % --bmc1_unsat_core_children false % 37.84/38.05 % --bmc1_unsat_core_extrapolate_axioms false % 37.84/38.05 % --bmc1_out_stat full % 37.84/38.05 % --bmc1_ground_init false % 37.84/38.05 % --bmc1_pre_inst_next_state false % 37.84/38.05 % --bmc1_pre_inst_state false % 37.84/38.05 % --bmc1_pre_inst_reach_state false % 37.84/38.05 % --bmc1_out_unsat_core false % 37.84/38.05 % --bmc1_aig_witness_out false % 37.84/38.05 % --bmc1_verbose false % 37.84/38.05 % --bmc1_dump_clauses_tptp false % 37.84/38.05 % --bmc1_dump_unsat_core_tptp false % 37.84/38.05 % --bmc1_dump_file - % 37.84/38.05 % --bmc1_ucm_expand_uc_limit 128 % 37.84/38.05 % --bmc1_ucm_n_expand_iterations 6 % 37.84/38.05 % --bmc1_ucm_extend_mode 1 % 37.84/38.05 % --bmc1_ucm_init_mode 2 % 37.84/38.05 % --bmc1_ucm_cone_mode none % 37.84/38.05 % --bmc1_ucm_reduced_relation_type 0 % 37.84/38.05 % --bmc1_ucm_relax_model 4 % 37.84/38.05 % --bmc1_ucm_full_tr_after_sat true % 37.84/38.05 % --bmc1_ucm_expand_neg_assumptions false % 37.84/38.05 % --bmc1_ucm_layered_model none % 37.84/38.05 % --bmc1_ucm_max_lemma_size 10 % 37.84/38.05 % 37.84/38.05 % ------ AIG Options % 37.84/38.05 % 37.84/38.05 % --aig_mode false % 37.84/38.05 % 37.84/38.05 % ------ Instantiation Options % 37.84/38.05 % 37.84/38.05 % --instantiation_flag true % 37.84/38.05 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 37.84/38.05 % --inst_solver_per_active 750 % 37.84/38.05 % --inst_solver_calls_frac 0.5 % 37.84/38.05 % --inst_passive_queue_type priority_queues % 37.84/38.05 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 37.84/38.05 % --inst_passive_queues_freq [25;2] % 37.84/38.05 % --inst_dismatching true % 37.84/38.05 % --inst_eager_unprocessed_to_passive true % 37.84/38.05 % --inst_prop_sim_given true % 44.46/44.71 % --inst_prop_sim_new false % 44.46/44.71 % --inst_orphan_elimination true % 44.46/44.71 % --inst_learning_loop_flag true % 44.46/44.71 % --inst_learning_start 3000 % 44.46/44.71 % --inst_learning_factor 2 % 44.46/44.71 % --inst_start_prop_sim_after_learn 3 % 44.46/44.71 % --inst_sel_renew solver % 44.46/44.71 % --inst_lit_activity_flag true % 44.46/44.71 % --inst_out_proof true % 44.46/44.71 % 44.46/44.71 % ------ Resolution Options % 44.46/44.71 % 44.46/44.71 % --resolution_flag true % 44.46/44.71 % --res_lit_sel kbo_max % 44.46/44.71 % --res_to_prop_solver none % 44.46/44.71 % --res_prop_simpl_new false % 44.46/44.71 % --res_prop_simpl_given false % 44.46/44.71 % --res_passive_queue_type priority_queues % 44.46/44.71 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 44.46/44.71 % --res_passive_queues_freq [15;5] % 44.46/44.71 % --res_forward_subs full % 44.46/44.71 % --res_backward_subs full % 44.46/44.71 % --res_forward_subs_resolution true % 44.46/44.71 % --res_backward_subs_resolution true % 44.46/44.71 % --res_orphan_elimination false % 44.46/44.71 % --res_time_limit 1000. % 44.46/44.71 % --res_out_proof true % 44.46/44.71 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_e78a85.s % 44.46/44.71 % --modulo true % 44.46/44.71 % 44.46/44.71 % ------ Combination Options % 44.46/44.71 % 44.46/44.71 % --comb_res_mult 1000 % 44.46/44.71 % --comb_inst_mult 300 % 44.46/44.71 % ------ % 44.46/44.71 % 44.46/44.71 % 44.46/44.71 % 44.46/44.71 % ------ Proving... % 44.46/44.71 % warning: shown sat in sat incomplete mode % 44.46/44.71 % % 44.46/44.71 % 44.46/44.71 % 44.46/44.71 ------ Building Model...Done % 44.46/44.71 % 44.46/44.71 %------ The model is defined over ground terms (initial term algebra). % 44.46/44.71 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 44.46/44.71 %------ where \phi is a formula over the term algebra. % 44.46/44.71 %------ If we have equality in the problem then it is also defined as a predicate above, % 44.46/44.71 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 44.46/44.71 %------ See help for --sat_out_model for different model outputs. % 44.46/44.71 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 44.46/44.71 %------ where the first argument stands for the sort ($i in the unsorted case) % 44.46/44.71 % 44.46/44.71 % 44.46/44.71 % 44.46/44.71 % 44.46/44.71 %------ Negative definition of equality_sorted % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X0,X1] : % 44.46/44.71 ( ~(equality_sorted(X0,X0,X1)) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of member % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1,X2] : % 44.46/44.71 ( member(X0,X1,X2) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of fellow % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( fellow(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of man % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( man(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of human_person % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( human_person(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of organism % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( organism(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of entity % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( entity(X0,X1) <=> % 44.46/44.71 ( % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc8 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc7 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of thing % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( thing(X0,X1) <=> % 44.46/44.71 ( % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc6 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc8 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc7 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc9 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of singleton % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( singleton(X0,X1) <=> % 44.46/44.71 ( % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc6 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc8 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc7 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc9 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of specific % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( specific(X0,X1) <=> % 44.46/44.71 ( % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc6 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc8 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc7 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of existent % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( existent(X0,X1) <=> % 44.46/44.71 ( % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc8 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc7 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Negative definition of impartial % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( ~(impartial(X0,X1)) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of living % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( living(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of human % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( human(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of animate % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( animate(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of male % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( male(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of group % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( group(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of set % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( set(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of multiple % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( multiple(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of two % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( two(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of state % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( state(X0,X1) <=> % 44.46/44.71 $false % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of eventuality % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( eventuality(X0,X1) <=> % 44.46/44.71 ( % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc6 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of nonexistent % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( nonexistent(X0,X1) <=> % 44.46/44.71 ( % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc6 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of unisex % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( unisex(X0,X1) <=> % 44.46/44.71 ( % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc6 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc8 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc7 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 | % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc9 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of event % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( event(X0,X1) <=> % 44.46/44.71 ( % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc6 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of barrel % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( barrel(X0,X1) <=> % 44.46/44.71 ( % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc6 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of chevy % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( chevy(X0,X1) <=> % 44.46/44.71 ( % 44.46/44.71 ( % 44.46/44.71 ( X0=skc5 & X1=skc8 ) % 44.46/44.71 ) % 44.46/44.71 % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ) % 44.46/44.71 ). % 44.46/44.71 % 44.46/44.71 %------ Positive definition of car % 44.46/44.71 fof(lit_def,axiom, % 44.46/44.71 (! [X0,X1] : % 44.46/44.71 ( car(X0,X1) <=> % 44.46/44.71 ( % 44.46/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc8 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of vehicle % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( vehicle(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc8 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of transport % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( transport(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc8 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of instrumentality % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( instrumentality(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc8 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of artifact % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( artifact(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc8 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 | % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc7 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of object % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( object(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc8 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 | % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc7 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of nonliving % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( nonliving(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc8 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 | % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc7 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of street % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( street(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc7 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of way % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( way(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc7 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of placename % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( placename(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc9 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of relname % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( relname(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc9 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of relation % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( relation(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc9 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of abstraction % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( abstraction(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc9 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of nonhuman % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( nonhuman(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc9 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of general % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( general(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc9 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of hollywood_placename % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( hollywood_placename(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc9 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of city % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( city(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc8 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of location % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( location(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc8 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of frontseat % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( frontseat(X0,X1) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of seat % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( seat(X0,X1) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of furniture % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( furniture(X0,X1) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of old % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( old(X0,X1) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc8 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of young % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( young(X0,X1) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of of % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1,X2] : % 44.54/44.71 ( of(X0,X1,X2) <=> % 44.54/44.71 ( % 44.54/44.71 ( % 44.54/44.71 ( X0=skc5 & X1=skc9 & X2=skc8 ) % 44.54/44.71 ) % 44.54/44.71 % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of be % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1,X2,X3] : % 44.54/44.71 ( be(X0,X1,X2,X3) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Negative definition of actual_world % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0] : % 44.54/44.71 ( ~(actual_world(X0)) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Positive definition of ssSkP0 % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( ssSkP0(X0,X1) <=> % 44.54/44.71 $true % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Negative definition of lonely % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( ~(lonely(X0,X1)) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Negative definition of down % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1,X2] : % 44.54/44.71 ( ~(down(X0,X1,X2)) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Negative definition of present % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( ~(present(X0,X1)) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Negative definition of in % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1,X2] : % 44.54/44.71 ( ~(in(X0,X1,X2)) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Negative definition of agent % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1,X2] : % 44.54/44.71 ( ~(agent(X0,X1,X2)) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Negative definition of dirty % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( ~(dirty(X0,X1)) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 %------ Negative definition of white % 44.54/44.71 fof(lit_def,axiom, % 44.54/44.71 (! [X0,X1] : % 44.54/44.71 ( ~(white(X0,X1)) <=> % 44.54/44.71 $false % 44.54/44.71 ) % 44.54/44.71 ) % 44.54/44.71 ). % 44.54/44.71 % 44.54/44.71 % 44.54/44.71 % 44.54/44.71 % ------ Statistics % 44.54/44.71 % 44.54/44.71 % ------ General % 44.54/44.71 % 44.54/44.71 % num_of_input_clauses: 170 % 44.54/44.71 % num_of_input_neg_conjectures: 22 % 44.54/44.71 % num_of_splits: 0 % 44.54/44.71 % num_of_split_atoms: 0 % 44.54/44.71 % num_of_sem_filtered_clauses: 0 % 44.54/44.71 % num_of_subtypes: 0 % 44.54/44.71 % monotx_restored_types: 0 % 44.54/44.71 % sat_num_of_epr_types: 0 % 44.54/44.71 % sat_num_of_non_cyclic_types: 0 % 44.54/44.71 % sat_guarded_non_collapsed_types: 0 % 44.54/44.71 % is_epr: 0 % 44.54/44.71 % is_horn: 0 % 44.54/44.71 % has_eq: 1 % 44.54/44.71 % num_pure_diseq_elim: 0 % 44.54/44.71 % simp_replaced_by: 0 % 44.54/44.71 % res_preprocessed: 44 % 44.54/44.71 % prep_upred: 0 % 44.54/44.71 % prep_unflattend: 0 % 44.54/44.71 % pred_elim_cands: 0 % 44.54/44.71 % pred_elim: 0 % 44.54/44.71 % pred_elim_cl: 0 % 44.54/44.71 % pred_elim_cycles: 0 % 44.54/44.71 % forced_gc_time: 0 % 44.54/44.71 % gc_basic_clause_elim: 0 % 44.54/44.71 % parsing_time: 0.003 % 44.54/44.71 % sem_filter_time: 0. % 44.54/44.71 % pred_elim_time: 0. % 44.54/44.71 % out_proof_time: 0. % 44.54/44.71 % monotx_time: 0. % 44.54/44.71 % subtype_inf_time: 0. % 44.54/44.71 % unif_index_cands_time: 0.048 % 44.54/44.71 % unif_index_add_time: 0.006 % 44.54/44.71 % total_time: 6.678 % 44.54/44.71 % num_of_symbols: 95 % 44.54/44.71 % num_of_terms: 22525 % 44.54/44.71 % 44.54/44.71 % ------ Propositional Solver % 44.54/44.71 % 44.54/44.71 % prop_solver_calls: 8 % 44.54/44.71 % prop_fast_solver_calls: 243 % 44.54/44.71 % prop_num_of_clauses: 247 % 44.54/44.71 % prop_preprocess_simplified: 1104 % 44.54/44.71 % prop_fo_subsumed: 2 % 44.54/44.71 % prop_solver_time: 0. % 44.54/44.71 % prop_fast_solver_time: 0. % 44.54/44.71 % prop_unsat_core_time: 0. % 44.54/44.71 % 44.54/44.71 % ------ QBF % 44.54/44.71 % 44.54/44.71 % qbf_q_res: 0 % 44.54/44.71 % qbf_num_tautologies: 0 % 44.54/44.71 % qbf_prep_cycles: 0 % 44.54/44.71 % 44.54/44.71 % ------ BMC1 % 44.54/44.71 % 44.54/44.71 % bmc1_current_bound: -1 % 44.54/44.71 % bmc1_last_solved_bound: -1 % 44.54/44.71 % bmc1_unsat_core_size: -1 % 44.54/44.71 % bmc1_unsat_core_parents_size: -1 % 44.54/44.71 % bmc1_merge_next_fun: 0 % 44.54/44.71 % bmc1_unsat_core_clauses_time: 0. % 44.54/44.71 % 44.54/44.71 % ------ Instantiation % 44.54/44.71 % 44.54/44.71 % inst_num_of_clauses: 242 % 44.54/44.71 % inst_num_in_passive: 0 % 44.54/44.71 % inst_num_in_active: 242 % 44.54/44.71 % inst_num_in_unprocessed: 0 % 44.54/44.71 % inst_num_of_loops: 251 % 44.54/44.71 % inst_num_of_learning_restarts: 0 % 44.54/44.71 % inst_num_moves_active_passive: 0 % 44.54/44.71 % inst_lit_activity: 18 % 44.54/44.71 % inst_lit_activity_moves: 0 % 44.54/44.71 % inst_num_tautologies: 0 % 44.54/44.71 % inst_num_prop_implied: 0 % 44.54/44.71 % inst_num_existing_simplified: 0 % 44.54/44.71 % inst_num_eq_res_simplified: 0 % 44.54/44.71 % inst_num_child_elim: 0 % 44.54/44.71 % inst_num_of_dismatching_blockings: 0 % 44.54/44.71 % inst_num_of_non_proper_insts: 60 % 44.54/44.71 % inst_num_of_duplicates: 48 % 44.54/44.71 % inst_inst_num_from_inst_to_res: 0 % 44.54/44.71 % inst_dismatching_checking_time: 0. % 44.54/44.71 % 44.54/44.71 % ------ Resolution % 44.54/44.71 % 44.54/44.71 % res_num_of_clauses: 1871 % 44.54/44.71 % res_num_in_passive: 732 % 44.54/44.71 % res_num_in_active: 1054 % 44.54/44.71 % res_num_of_loops: 1000 % 44.54/44.71 % res_forward_subset_subsumed: 79 % 44.54/44.71 % res_backward_subset_subsumed: 0 % 44.54/44.71 % res_forward_subsumed: 1 % 44.54/44.71 % res_backward_subsumed: 16 % 44.54/44.71 % res_forward_subsumption_resolution: 43 % 44.54/44.71 % res_backward_subsumption_resolution: 1 % 44.54/44.71 % res_clause_to_clause_subsumption: 41196 % 44.54/44.71 % res_orphan_elimination: 0 % 44.54/44.71 % res_tautology_del: 0 % 44.54/44.71 % res_num_eq_res_simplified: 0 % 44.54/44.71 % res_num_sel_changes: 0 % 44.54/44.71 % res_moves_from_active_to_pass: 0 % 44.54/44.71 % 44.54/44.71 % Status Unknown % 44.54/44.71 % Last status : % 44.54/44.71 % SZS status Unknown %------------------------------------------------------------------------------