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