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