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