TSTP Solution File: NLP211+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP211+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 02:42:26 EDT 2022
% Result : Unknown 10.13s 10.29s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP211+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jul 1 01:59:15 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % Running in mono-core mode
% 0.21/0.45 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.45 % FOF problem with conjecture
% 0.21/0.45 % 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_058039.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_eef08d.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_958450 | grep -v "SZS"
% 0.21/0.47
% 0.21/0.47 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.47
% 0.21/0.47 %
% 0.21/0.47 % ------ iProver source info
% 0.21/0.47
% 0.21/0.47 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.47 % git: non_committed_changes: true
% 0.21/0.47 % git: last_make_outside_of_git: true
% 0.21/0.47
% 0.21/0.47 %
% 0.21/0.47 % ------ Input Options
% 0.21/0.47
% 0.21/0.47 % --out_options all
% 0.21/0.47 % --tptp_safe_out true
% 0.21/0.47 % --problem_path ""
% 0.21/0.47 % --include_path ""
% 0.21/0.47 % --clausifier .//eprover
% 0.21/0.47 % --clausifier_options --tstp-format
% 0.21/0.47 % --stdin false
% 0.21/0.47 % --dbg_backtrace false
% 0.21/0.47 % --dbg_dump_prop_clauses false
% 0.21/0.47 % --dbg_dump_prop_clauses_file -
% 0.21/0.47 % --dbg_out_stat false
% 0.21/0.47
% 0.21/0.47 % ------ General Options
% 0.21/0.47
% 0.21/0.47 % --fof false
% 0.21/0.47 % --time_out_real 150.
% 0.21/0.47 % --time_out_prep_mult 0.2
% 0.21/0.47 % --time_out_virtual -1.
% 0.21/0.47 % --schedule none
% 0.21/0.47 % --ground_splitting input
% 0.21/0.47 % --splitting_nvd 16
% 0.21/0.47 % --non_eq_to_eq false
% 0.21/0.47 % --prep_gs_sim true
% 0.21/0.47 % --prep_unflatten false
% 0.21/0.47 % --prep_res_sim true
% 0.21/0.47 % --prep_upred true
% 0.21/0.47 % --res_sim_input true
% 0.21/0.47 % --clause_weak_htbl true
% 0.21/0.47 % --gc_record_bc_elim false
% 0.21/0.47 % --symbol_type_check false
% 0.21/0.47 % --clausify_out false
% 0.21/0.47 % --large_theory_mode false
% 0.21/0.47 % --prep_sem_filter none
% 0.21/0.47 % --prep_sem_filter_out false
% 0.21/0.47 % --preprocessed_out false
% 0.21/0.47 % --sub_typing false
% 0.21/0.47 % --brand_transform false
% 0.21/0.47 % --pure_diseq_elim true
% 0.21/0.47 % --min_unsat_core false
% 0.21/0.47 % --pred_elim true
% 0.21/0.47 % --add_important_lit false
% 0.21/0.47 % --soft_assumptions false
% 0.21/0.47 % --reset_solvers false
% 0.21/0.47 % --bc_imp_inh []
% 0.21/0.47 % --conj_cone_tolerance 1.5
% 0.21/0.47 % --prolific_symb_bound 500
% 0.21/0.47 % --lt_threshold 2000
% 0.21/0.47
% 0.21/0.47 % ------ SAT Options
% 0.21/0.47
% 0.21/0.47 % --sat_mode false
% 0.21/0.47 % --sat_fm_restart_options ""
% 0.21/0.47 % --sat_gr_def false
% 0.21/0.47 % --sat_epr_types true
% 0.21/0.47 % --sat_non_cyclic_types false
% 0.21/0.47 % --sat_finite_models false
% 0.21/0.47 % --sat_fm_lemmas false
% 0.21/0.47 % --sat_fm_prep false
% 0.21/0.47 % --sat_fm_uc_incr true
% 0.21/0.47 % --sat_out_model small
% 0.21/0.47 % --sat_out_clauses false
% 0.21/0.47
% 0.21/0.47 % ------ QBF Options
% 0.21/0.47
% 0.21/0.47 % --qbf_mode false
% 0.21/0.47 % --qbf_elim_univ true
% 0.21/0.47 % --qbf_sk_in true
% 0.21/0.47 % --qbf_pred_elim true
% 0.21/0.47 % --qbf_split 32
% 0.21/0.47
% 0.21/0.47 % ------ BMC1 Options
% 0.21/0.47
% 0.21/0.47 % --bmc1_incremental false
% 0.21/0.47 % --bmc1_axioms reachable_all
% 0.21/0.47 % --bmc1_min_bound 0
% 0.21/0.47 % --bmc1_max_bound -1
% 0.21/0.47 % --bmc1_max_bound_default -1
% 0.21/0.47 % --bmc1_symbol_reachability true
% 0.21/0.47 % --bmc1_property_lemmas false
% 0.21/0.47 % --bmc1_k_induction false
% 0.21/0.47 % --bmc1_non_equiv_states false
% 0.21/0.47 % --bmc1_deadlock false
% 0.21/0.47 % --bmc1_ucm false
% 0.21/0.47 % --bmc1_add_unsat_core none
% 0.21/0.47 % --bmc1_unsat_core_children false
% 0.21/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.47 % --bmc1_out_stat full
% 0.21/0.47 % --bmc1_ground_init false
% 0.21/0.47 % --bmc1_pre_inst_next_state false
% 0.21/0.47 % --bmc1_pre_inst_state false
% 0.21/0.47 % --bmc1_pre_inst_reach_state false
% 0.21/0.47 % --bmc1_out_unsat_core false
% 0.21/0.47 % --bmc1_aig_witness_out false
% 0.21/0.47 % --bmc1_verbose false
% 0.21/0.47 % --bmc1_dump_clauses_tptp false
% 0.77/0.98 % --bmc1_dump_unsat_core_tptp false
% 0.77/0.98 % --bmc1_dump_file -
% 0.77/0.98 % --bmc1_ucm_expand_uc_limit 128
% 0.77/0.98 % --bmc1_ucm_n_expand_iterations 6
% 0.77/0.98 % --bmc1_ucm_extend_mode 1
% 0.77/0.98 % --bmc1_ucm_init_mode 2
% 0.77/0.98 % --bmc1_ucm_cone_mode none
% 0.77/0.98 % --bmc1_ucm_reduced_relation_type 0
% 0.77/0.98 % --bmc1_ucm_relax_model 4
% 0.77/0.98 % --bmc1_ucm_full_tr_after_sat true
% 0.77/0.98 % --bmc1_ucm_expand_neg_assumptions false
% 0.77/0.98 % --bmc1_ucm_layered_model none
% 0.77/0.98 % --bmc1_ucm_max_lemma_size 10
% 0.77/0.98
% 0.77/0.98 % ------ AIG Options
% 0.77/0.98
% 0.77/0.98 % --aig_mode false
% 0.77/0.98
% 0.77/0.98 % ------ Instantiation Options
% 0.77/0.98
% 0.77/0.98 % --instantiation_flag true
% 0.77/0.98 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.77/0.98 % --inst_solver_per_active 750
% 0.77/0.98 % --inst_solver_calls_frac 0.5
% 0.77/0.98 % --inst_passive_queue_type priority_queues
% 0.77/0.98 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.77/0.98 % --inst_passive_queues_freq [25;2]
% 0.77/0.98 % --inst_dismatching true
% 0.77/0.98 % --inst_eager_unprocessed_to_passive true
% 0.77/0.98 % --inst_prop_sim_given true
% 0.77/0.98 % --inst_prop_sim_new false
% 0.77/0.98 % --inst_orphan_elimination true
% 0.77/0.98 % --inst_learning_loop_flag true
% 0.77/0.98 % --inst_learning_start 3000
% 0.77/0.98 % --inst_learning_factor 2
% 0.77/0.98 % --inst_start_prop_sim_after_learn 3
% 0.77/0.98 % --inst_sel_renew solver
% 0.77/0.98 % --inst_lit_activity_flag true
% 0.77/0.98 % --inst_out_proof true
% 0.77/0.98
% 0.77/0.98 % ------ Resolution Options
% 0.77/0.98
% 0.77/0.98 % --resolution_flag true
% 0.77/0.98 % --res_lit_sel kbo_max
% 0.77/0.98 % --res_to_prop_solver none
% 0.77/0.98 % --res_prop_simpl_new false
% 0.77/0.98 % --res_prop_simpl_given false
% 0.77/0.98 % --res_passive_queue_type priority_queues
% 0.77/0.98 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.77/0.98 % --res_passive_queues_freq [15;5]
% 0.77/0.98 % --res_forward_subs full
% 0.77/0.98 % --res_backward_subs full
% 0.77/0.98 % --res_forward_subs_resolution true
% 0.77/0.98 % --res_backward_subs_resolution true
% 0.77/0.98 % --res_orphan_elimination false
% 0.77/0.98 % --res_time_limit 1000.
% 0.77/0.98 % --res_out_proof true
% 0.77/0.98 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_058039.s
% 0.77/0.98 % --modulo true
% 0.77/0.98
% 0.77/0.98 % ------ Combination Options
% 0.77/0.98
% 0.77/0.98 % --comb_res_mult 1000
% 0.77/0.98 % --comb_inst_mult 300
% 0.77/0.98 % ------
% 0.77/0.98
% 0.77/0.98 % ------ Parsing...% successful
% 0.77/0.98
% 0.77/0.98 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 144 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.77/0.98
% 0.77/0.98 % ------ Proving...
% 0.77/0.98 % ------ Problem Properties
% 0.77/0.98
% 0.77/0.98 %
% 0.77/0.98 % EPR false
% 0.77/0.98 % Horn false
% 0.77/0.98 % Has equality true
% 0.77/0.98
% 0.77/0.98 % % ------ Input Options Time Limit: Unbounded
% 0.77/0.98
% 0.77/0.98
% 0.77/0.98 % % ------ Current options:
% 0.77/0.98
% 0.77/0.98 % ------ Input Options
% 0.77/0.98
% 0.77/0.98 % --out_options all
% 0.77/0.98 % --tptp_safe_out true
% 0.77/0.98 % --problem_path ""
% 0.77/0.98 % --include_path ""
% 0.77/0.98 % --clausifier .//eprover
% 0.77/0.98 % --clausifier_options --tstp-format
% 0.77/0.98 % --stdin false
% 0.77/0.98 % --dbg_backtrace false
% 0.77/0.98 % --dbg_dump_prop_clauses false
% 0.77/0.98 % --dbg_dump_prop_clauses_file -
% 0.77/0.98 % --dbg_out_stat false
% 0.77/0.98
% 0.77/0.98 % ------ General Options
% 0.77/0.98
% 0.77/0.98 % --fof false
% 0.77/0.98 % --time_out_real 150.
% 0.77/0.98 % --time_out_prep_mult 0.2
% 0.77/0.98 % --time_out_virtual -1.
% 0.77/0.98 % --schedule none
% 0.77/0.98 % --ground_splitting input
% 0.77/0.98 % --splitting_nvd 16
% 0.77/0.98 % --non_eq_to_eq false
% 0.77/0.98 % --prep_gs_sim true
% 0.77/0.98 % --prep_unflatten false
% 0.77/0.98 % --prep_res_sim true
% 0.77/0.98 % --prep_upred true
% 0.77/0.98 % --res_sim_input true
% 0.77/0.98 % --clause_weak_htbl true
% 0.77/0.98 % --gc_record_bc_elim false
% 0.77/0.98 % --symbol_type_check false
% 0.77/0.98 % --clausify_out false
% 0.77/0.98 % --large_theory_mode false
% 0.77/0.98 % --prep_sem_filter none
% 0.77/0.98 % --prep_sem_filter_out false
% 0.77/0.98 % --preprocessed_out false
% 0.77/0.98 % --sub_typing false
% 0.77/0.98 % --brand_transform false
% 0.77/0.98 % --pure_diseq_elim true
% 0.77/0.98 % --min_unsat_core false
% 0.77/0.98 % --pred_elim true
% 0.77/0.98 % --add_important_lit false
% 0.77/0.98 % --soft_assumptions false
% 0.77/0.98 % --reset_solvers false
% 0.77/0.98 % --bc_imp_inh []
% 0.77/0.98 % --conj_cone_tolerance 1.5
% 0.77/0.98 % --prolific_symb_bound 500
% 0.77/0.98 % --lt_threshold 2000
% 0.77/0.98
% 0.77/0.98 % ------ SAT Options
% 0.77/0.98
% 0.77/0.98 % --sat_mode false
% 0.77/0.98 % --sat_fm_restart_options ""
% 0.77/0.98 % --sat_gr_def false
% 0.77/0.98 % --sat_epr_types true
% 0.77/0.98 % --sat_non_cyclic_types false
% 0.77/0.98 % --sat_finite_models false
% 0.77/0.98 % --sat_fm_lemmas false
% 0.77/0.98 % --sat_fm_prep false
% 0.77/0.98 % --sat_fm_uc_incr true
% 0.77/0.98 % --sat_out_model small
% 0.77/0.98 % --sat_out_clauses false
% 0.77/0.98
% 0.77/0.98 % ------ QBF Options
% 0.77/0.98
% 0.77/0.98 % --qbf_mode false
% 0.77/0.98 % --qbf_elim_univ true
% 0.77/0.98 % --qbf_sk_in true
% 0.77/0.98 % --qbf_pred_elim true
% 0.77/0.98 % --qbf_split 32
% 0.77/0.98
% 0.77/0.98 % ------ BMC1 Options
% 0.77/0.98
% 0.77/0.98 % --bmc1_incremental false
% 0.77/0.98 % --bmc1_axioms reachable_all
% 0.77/0.98 % --bmc1_min_bound 0
% 0.77/0.98 % --bmc1_max_bound -1
% 0.77/0.98 % --bmc1_max_bound_default -1
% 0.77/0.98 % --bmc1_symbol_reachability true
% 0.77/0.98 % --bmc1_property_lemmas false
% 0.77/0.98 % --bmc1_k_induction false
% 0.77/0.98 % --bmc1_non_equiv_states false
% 0.77/0.98 % --bmc1_deadlock false
% 0.77/0.98 % --bmc1_ucm false
% 0.77/0.98 % --bmc1_add_unsat_core none
% 0.77/0.98 % --bmc1_unsat_core_children false
% 0.77/0.98 % --bmc1_unsat_core_extrapolate_axioms false
% 0.77/0.98 % --bmc1_out_stat full
% 0.77/0.98 % --bmc1_ground_init false
% 0.77/0.98 % --bmc1_pre_inst_next_state false
% 0.77/0.98 % --bmc1_pre_inst_state false
% 0.77/0.98 % --bmc1_pre_inst_reach_state false
% 0.77/0.98 % --bmc1_out_unsat_core false
% 0.77/0.98 % --bmc1_aig_witness_out false
% 0.77/0.98 % --bmc1_verbose false
% 0.77/0.98 % --bmc1_dump_clauses_tptp false
% 0.77/0.98 % --bmc1_dump_unsat_core_tptp false
% 0.77/0.98 % --bmc1_dump_file -
% 0.77/0.98 % --bmc1_ucm_expand_uc_limit 128
% 0.77/0.99 % --bmc1_ucm_n_expand_iterations 6
% 0.77/0.99 % --bmc1_ucm_extend_mode 1
% 0.77/0.99 % --bmc1_ucm_init_mode 2
% 0.77/0.99 % --bmc1_ucm_cone_mode none
% 0.77/0.99 % --bmc1_ucm_reduced_relation_type 0
% 0.77/0.99 % --bmc1_ucm_relax_model 4
% 0.77/0.99 % --bmc1_ucm_full_tr_after_sat true
% 0.77/0.99 % --bmc1_ucm_expand_neg_assumptions false
% 0.77/0.99 % --bmc1_ucm_layered_model none
% 0.77/0.99 % --bmc1_ucm_max_lemma_size 10
% 0.77/0.99
% 0.77/0.99 % ------ AIG Options
% 0.77/0.99
% 0.77/0.99 % --aig_mode false
% 0.77/0.99
% 0.77/0.99 % ------ Instantiation Options
% 0.77/0.99
% 0.77/0.99 % --instantiation_flag true
% 0.77/0.99 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.77/0.99 % --inst_solver_per_active 750
% 0.77/0.99 % --inst_solver_calls_frac 0.5
% 0.77/0.99 % --inst_passive_queue_type priority_queues
% 0.77/0.99 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.77/0.99 % --inst_passive_queues_freq [25;2]
% 0.77/0.99 % --inst_dismatching true
% 0.77/0.99 % --inst_eager_unprocessed_to_passive true
% 4.70/4.88 % --inst_prop_sim_given true
% 4.70/4.88 % --inst_prop_sim_new false
% 4.70/4.88 % --inst_orphan_elimination true
% 4.70/4.88 % --inst_learning_loop_flag true
% 4.70/4.88 % --inst_learning_start 3000
% 4.70/4.88 % --inst_learning_factor 2
% 4.70/4.88 % --inst_start_prop_sim_after_learn 3
% 4.70/4.88 % --inst_sel_renew solver
% 4.70/4.88 % --inst_lit_activity_flag true
% 4.70/4.88 % --inst_out_proof true
% 4.70/4.88
% 4.70/4.88 % ------ Resolution Options
% 4.70/4.88
% 4.70/4.88 % --resolution_flag true
% 4.70/4.88 % --res_lit_sel kbo_max
% 4.70/4.88 % --res_to_prop_solver none
% 4.70/4.88 % --res_prop_simpl_new false
% 4.70/4.88 % --res_prop_simpl_given false
% 4.70/4.88 % --res_passive_queue_type priority_queues
% 4.70/4.88 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 4.70/4.88 % --res_passive_queues_freq [15;5]
% 4.70/4.88 % --res_forward_subs full
% 4.70/4.88 % --res_backward_subs full
% 4.70/4.88 % --res_forward_subs_resolution true
% 4.70/4.88 % --res_backward_subs_resolution true
% 4.70/4.88 % --res_orphan_elimination false
% 4.70/4.88 % --res_time_limit 1000.
% 4.70/4.88 % --res_out_proof true
% 4.70/4.88 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_058039.s
% 4.70/4.88 % --modulo true
% 4.70/4.88
% 4.70/4.88 % ------ Combination Options
% 4.70/4.88
% 4.70/4.88 % --comb_res_mult 1000
% 4.70/4.88 % --comb_inst_mult 300
% 4.70/4.88 % ------
% 4.70/4.88
% 4.70/4.88
% 4.70/4.88
% 4.70/4.88 % ------ Proving...
% 4.70/4.88 % warning: shown sat in sat incomplete mode
% 4.70/4.88 %
% 4.70/4.88
% 4.70/4.88
% 4.70/4.88 ------ Building Model...Done
% 4.70/4.88
% 4.70/4.88 %------ The model is defined over ground terms (initial term algebra).
% 4.70/4.88 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 4.70/4.88 %------ where \phi is a formula over the term algebra.
% 4.70/4.88 %------ If we have equality in the problem then it is also defined as a predicate above,
% 4.70/4.88 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 4.70/4.88 %------ See help for --sat_out_model for different model outputs.
% 4.70/4.88 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 4.70/4.88 %------ where the first argument stands for the sort ($i in the unsorted case)
% 4.70/4.88
% 4.70/4.88
% 4.70/4.88
% 4.70/4.88
% 4.70/4.88 %------ Negative definition of equality_sorted
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X0,X1] :
% 4.70/4.88 ( ~(equality_sorted(X0,X0,X1)) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=$i & X0=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of of
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1,X2] :
% 4.70/4.88 ( of(X0,X1,X2) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 & X2=sk3_esk5_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of forename
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( forename(X0,X1) <=>
% 4.70/4.88 $false
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of entity
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( entity(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of placename
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( placename(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of member
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1,X2] :
% 4.70/4.88 ( member(X0,X1,X2) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) & X2=sk3_esk7_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) & X2=sk3_esk7_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of jules_forename
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( jules_forename(X0,X1) <=>
% 4.70/4.88 $false
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of relname
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( relname(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of furniture
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( furniture(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of instrumentality
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( instrumentality(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of seat
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( seat(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of frontseat
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( frontseat(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of location
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( location(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of object
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( object(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of city
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( city(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of hollywood_placename
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( hollywood_placename(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of abstraction
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( abstraction(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Negative definition of unisex
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( ~(unisex(X0,X1)) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of general
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( general(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of nonhuman
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( nonhuman(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of thing
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( thing(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk2_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk1_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of relation
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( relation(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of transport
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( transport(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of vehicle
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( vehicle(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of car
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( car(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of chevy
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( chevy(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of way
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( way(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of artifact
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( artifact(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of street
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( street(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of barrel
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( barrel(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of event
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( event(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk2_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk1_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of two
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( two(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of group
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( group(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk10_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of man
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( man(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of male
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( male(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of human_person
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( human_person(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of animate
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( animate(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of human
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( human(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of organism
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( organism(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of living
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( living(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Negative definition of impartial
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( ~(impartial(X0,X1)) <=>
% 4.70/4.88 $false
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of fellow
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( fellow(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of wear
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( wear(X0,X1) <=>
% 4.70/4.88 $false
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of set
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( set(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk10_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of multiple
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( multiple(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk10_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of clothes
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( clothes(X0,X1) <=>
% 4.70/4.88 $false
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of coat
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( coat(X0,X1) <=>
% 4.70/4.88 $false
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Positive definition of nonliving
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( nonliving(X0,X1) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 )
% 4.70/4.88 ).
% 4.70/4.88
% 4.70/4.88 %------ Negative definition of existent
% 4.70/4.88 fof(lit_def,axiom,
% 4.70/4.88 (! [X0,X1] :
% 4.70/4.88 ( ~(existent(X0,X1)) <=>
% 4.70/4.88 (
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 )
% 4.70/4.88 )
% 4.70/4.88
% 4.70/4.88 |
% 4.70/4.88 (
% 4.70/4.88 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk2_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 |
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk1_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Negative definition of specific
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( ~(specific(X0,X1)) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of device
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( device(X0,X1) <=>
% 4.70/4.89 $false
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of wheel
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( wheel(X0,X1) <=>
% 4.70/4.89 $false
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of eventuality
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( eventuality(X0,X1) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 |
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk2_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 |
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk1_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of state
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( state(X0,X1) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk2_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 |
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk1_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of nonexistent
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( nonexistent(X0,X1) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 |
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk2_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 |
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk1_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Negative definition of singleton
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( ~(singleton(X0,X1)) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 |
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk10_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Negative definition of white
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( ~(white(X0,X1)) <=>
% 4.70/4.89 $false
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of black
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( black(X0,X1) <=>
% 4.70/4.89 $false
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Negative definition of young
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( ~(young(X0,X1)) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of old
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( old(X0,X1) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Negative definition of agent
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2] :
% 4.70/4.89 ( ~(agent(X0,X1,X2)) <=>
% 4.70/4.89 $false
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of nonreflexive
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( nonreflexive(X0,X1) <=>
% 4.70/4.89 $false
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of be
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3] :
% 4.70/4.89 ( be(X0,X1,X2,X3) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk2_2(sk3_esk7_0,sk3_esk1_0)) & X2=sk1_esk2_2(sk3_esk7_0,sk3_esk1_0) & X3=sk3_esk9_1(sk1_esk2_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 |
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk8_1(sk1_esk1_2(sk3_esk7_0,sk3_esk1_0)) & X2=sk1_esk1_2(sk3_esk7_0,sk3_esk1_0) & X3=sk3_esk9_1(sk1_esk1_2(sk3_esk7_0,sk3_esk1_0)) )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Negative definition of actual_world
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0] :
% 4.70/4.89 ( ~(actual_world(X0)) <=>
% 4.70/4.89 $false
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of dirty
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( dirty(X0,X1) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of lonely
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( lonely(X0,X1) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of present
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1] :
% 4.70/4.89 ( present(X0,X1) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of down
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2] :
% 4.70/4.89 ( down(X0,X1,X2) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk5_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of in
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2] :
% 4.70/4.89 ( in(X0,X1,X2) <=>
% 4.70/4.89 (
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 & X2=sk3_esk5_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 |
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk9_1(sk1_esk2_2(sk3_esk7_0,sk3_esk1_0)) & X2=sk3_esk2_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 |
% 4.70/4.89 (
% 4.70/4.89 ( X0=sk3_esk1_0 & X1=sk3_esk9_1(sk1_esk1_2(sk3_esk7_0,sk3_esk1_0)) & X2=sk3_esk2_0 )
% 4.70/4.89 )
% 4.70/4.89
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of behind
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2] :
% 4.70/4.89 ( behind(X0,X1,X2) <=>
% 4.70/4.89 $false
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP0_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP3_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP6_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP9_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP12_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP15_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP15_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP18_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP18_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP21_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP21_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP24_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP24_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP27_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP27_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP30_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP33_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP33_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP36_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP36_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP39_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP39_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP42_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP42_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP45_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP45_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP48_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP48_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP51_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP51_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP54_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP54_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP57_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP57_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP60_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP60_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP63_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP63_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP66_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP66_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP69_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP69_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP72_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP72_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP75_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP75_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP78_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP78_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP81_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP81_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP84_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP84_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP87_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP87_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP90_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP90_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP93_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP93_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP96_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP96_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP99_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP99_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP102_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP102_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP105_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP105_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP108_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP108_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP111_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP111_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP114_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP114_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP117_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 4.70/4.89 ( sP117_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP120_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP120_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP123_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP123_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP126_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP126_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP129_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP129_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP132_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP132_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP135_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP135_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP138_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP138_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89 %------ Positive definition of sP141_iProver_split
% 4.70/4.89 fof(lit_def,axiom,
% 4.70/4.89 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 4.70/4.89 ( sP141_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 4.70/4.89 $true
% 4.70/4.89 )
% 4.70/4.89 )
% 4.70/4.89 ).
% 4.70/4.89
% 4.70/4.89
% 4.70/4.89
% 4.70/4.89 % ------ Statistics
% 4.70/4.89
% 4.70/4.89 % ------ General
% 4.70/4.89
% 4.70/4.89 % num_of_input_clauses: 146
% 4.70/4.89 % num_of_input_neg_conjectures: 59
% 4.70/4.89 % num_of_splits: 144
% 4.70/4.89 % num_of_split_atoms: 144
% 4.70/4.89 % num_of_sem_filtered_clauses: 0
% 4.70/4.89 % num_of_subtypes: 0
% 4.70/4.89 % monotx_restored_types: 0
% 4.70/4.89 % sat_num_of_epr_types: 0
% 4.70/4.89 % sat_num_of_non_cyclic_types: 0
% 4.70/4.89 % sat_guarded_non_collapsed_types: 0
% 4.70/4.89 % is_epr: 0
% 4.70/4.89 % is_horn: 0
% 4.70/4.89 % has_eq: 1
% 4.70/4.89 % num_pure_diseq_elim: 0
% 4.70/4.89 % simp_replaced_by: 0
% 4.70/4.89 % res_preprocessed: 262
% 4.70/4.89 % prep_upred: 0
% 4.70/4.89 % prep_unflattend: 2284
% 4.70/4.89 % pred_elim_cands: 144
% 4.70/4.89 % pred_elim: 56
% 4.70/4.89 % pred_elim_cl: 62
% 4.70/4.89 % pred_elim_cycles: 166
% 4.70/4.89 % forced_gc_time: 0
% 4.70/4.89 % gc_basic_clause_elim: 0
% 4.70/4.89 % parsing_time: 0.018
% 4.70/4.89 % sem_filter_time: 0.
% 4.70/4.89 % pred_elim_time: 0.361
% 4.70/4.89 % out_proof_time: 0.
% 4.70/4.89 % monotx_time: 0.
% 4.70/4.89 % subtype_inf_time: 0.
% 4.70/4.89 % unif_index_cands_time: 0.006
% 4.70/4.89 % unif_index_add_time: 0.007
% 4.70/4.89 % total_time: 4.427
% 4.70/4.89 % num_of_symbols: 259
% 4.70/4.89 % num_of_terms: 14492
% 4.70/4.89
% 4.70/4.89 % ------ Propositional Solver
% 4.70/4.89
% 4.70/4.89 % prop_solver_calls: 12
% 4.70/4.89 % prop_fast_solver_calls: 10313
% 4.70/4.89 % prop_num_of_clauses: 1950
% 4.70/4.89 % prop_preprocess_simplified: 5189
% 4.70/4.89 % prop_fo_subsumed: 104
% 4.70/4.89 % prop_solver_time: 0.001
% 4.70/4.89 % prop_fast_solver_time: 0.023
% 4.70/4.89 % prop_unsat_core_time: 0.
% 4.70/4.89
% 4.70/4.89 % ------ QBF
% 4.70/4.89
% 4.70/4.89 % qbf_q_res: 0
% 4.70/4.89 % qbf_num_tautologies: 0
% 4.70/4.89 % qbf_prep_cycles: 0
% 4.70/4.89
% 4.70/4.89 % ------ BMC1
% 4.70/4.89
% 4.70/4.89 % bmc1_current_bound: -1
% 4.70/4.89 % bmc1_last_solved_bound: -1
% 4.70/4.89 % bmc1_unsat_core_size: -1
% 4.70/4.89 % bmc1_unsat_core_parents_size: -1
% 4.70/4.89 % bmc1_merge_next_fun: 0
% 4.70/4.89 % bmc1_unsat_core_clauses_time: 0.
% 4.70/4.89
% 4.70/4.89 % ------ Instantiation
% 4.70/4.89
% 4.70/4.89 % inst_num_of_clauses: 717
% 4.70/4.89 % inst_num_in_passive: 0
% 4.70/4.89 % inst_num_in_active: 717
% 4.70/4.89 % inst_num_in_unprocessed: 0
% 4.70/4.89 % inst_num_of_loops: 727
% 4.70/4.89 % inst_num_of_learning_restarts: 0
% 4.70/4.89 % inst_num_moves_active_passive: 0
% 4.70/4.89 % inst_lit_activity: 168
% 4.70/4.89 % inst_lit_activity_moves: 0
% 4.70/4.89 % inst_num_tautologies: 0
% 4.70/4.89 % inst_num_prop_implied: 0
% 4.70/4.89 % inst_num_existing_simplified: 0
% 4.70/4.89 % inst_num_eq_res_simplified: 0
% 4.70/4.89 % inst_num_child_elim: 0
% 4.70/4.89 % inst_num_of_dismatching_blockings: 0
% 4.70/4.89 % inst_num_of_non_proper_insts: 254
% 4.70/4.89 % inst_num_of_duplicates: 31
% 4.70/4.89 % inst_inst_num_from_inst_to_res: 0
% 4.70/4.89 % inst_dismatching_checking_time: 0.
% 4.70/4.89
% 4.70/4.89 % ------ Resolution
% 4.70/4.89
% 4.70/4.89 % res_num_of_clauses: 8141
% 4.70/4.89 % res_num_in_passive: 5442
% 4.70/4.89 % res_num_in_active: 2547
% 4.70/4.89 % res_num_of_loops: 3000
% 4.70/4.89 % res_forward_subset_subsumed: 1397
% 4.70/4.89 % res_backward_subset_subsumed: 0
% 4.70/4.89 % res_forward_subsumed: 2
% 4.70/4.89 % res_backward_subsumed: 0
% 4.70/4.89 % res_forward_subsumption_resolution: 1196
% 4.70/4.89 % res_backward_subsumption_resolution: 0
% 4.70/4.89 % res_clause_to_clause_subsumption: 7638
% 4.70/4.89 % res_orphan_elimination: 0
% 4.70/4.89 % res_tautology_del: 0
% 4.70/4.89 % res_num_eq_res_simplified: 1
% 4.70/4.89 % res_num_sel_changes: 0
% 4.70/4.89 % res_moves_from_active_to_pass: 0
% 4.70/4.89
% 4.70/4.89 % Status Unknown
% 4.77/4.95 % Orienting using strategy ClausalAll
% 4.77/4.95 % FOF problem with conjecture
% 4.77/4.95 % 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_058039.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_eef08d.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_1ffcee | grep -v "SZS"
% 4.81/4.97
% 4.81/4.97 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 4.81/4.97
% 4.81/4.97 %
% 4.81/4.97 % ------ iProver source info
% 4.81/4.97
% 4.81/4.97 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 4.81/4.97 % git: non_committed_changes: true
% 4.81/4.97 % git: last_make_outside_of_git: true
% 4.81/4.97
% 4.81/4.97 %
% 4.81/4.97 % ------ Input Options
% 4.81/4.97
% 4.81/4.97 % --out_options all
% 4.81/4.97 % --tptp_safe_out true
% 4.81/4.97 % --problem_path ""
% 4.81/4.97 % --include_path ""
% 4.81/4.97 % --clausifier .//eprover
% 4.81/4.97 % --clausifier_options --tstp-format
% 4.81/4.97 % --stdin false
% 4.81/4.97 % --dbg_backtrace false
% 4.81/4.97 % --dbg_dump_prop_clauses false
% 4.81/4.97 % --dbg_dump_prop_clauses_file -
% 4.81/4.97 % --dbg_out_stat false
% 4.81/4.97
% 4.81/4.97 % ------ General Options
% 4.81/4.97
% 4.81/4.97 % --fof false
% 4.81/4.97 % --time_out_real 150.
% 4.81/4.97 % --time_out_prep_mult 0.2
% 4.81/4.97 % --time_out_virtual -1.
% 4.81/4.97 % --schedule none
% 4.81/4.97 % --ground_splitting input
% 4.81/4.97 % --splitting_nvd 16
% 4.81/4.97 % --non_eq_to_eq false
% 4.81/4.97 % --prep_gs_sim true
% 4.81/4.97 % --prep_unflatten false
% 4.81/4.97 % --prep_res_sim true
% 4.81/4.97 % --prep_upred true
% 4.81/4.97 % --res_sim_input true
% 4.81/4.97 % --clause_weak_htbl true
% 4.81/4.97 % --gc_record_bc_elim false
% 4.81/4.97 % --symbol_type_check false
% 4.81/4.97 % --clausify_out false
% 4.81/4.97 % --large_theory_mode false
% 4.81/4.97 % --prep_sem_filter none
% 4.81/4.97 % --prep_sem_filter_out false
% 4.81/4.97 % --preprocessed_out false
% 4.81/4.97 % --sub_typing false
% 4.81/4.97 % --brand_transform false
% 4.81/4.97 % --pure_diseq_elim true
% 4.81/4.97 % --min_unsat_core false
% 4.81/4.97 % --pred_elim true
% 4.81/4.97 % --add_important_lit false
% 4.81/4.97 % --soft_assumptions false
% 4.81/4.97 % --reset_solvers false
% 4.81/4.97 % --bc_imp_inh []
% 4.81/4.97 % --conj_cone_tolerance 1.5
% 4.81/4.97 % --prolific_symb_bound 500
% 4.81/4.97 % --lt_threshold 2000
% 4.81/4.97
% 4.81/4.97 % ------ SAT Options
% 4.81/4.97
% 4.81/4.97 % --sat_mode false
% 4.81/4.97 % --sat_fm_restart_options ""
% 4.81/4.97 % --sat_gr_def false
% 4.81/4.97 % --sat_epr_types true
% 4.81/4.97 % --sat_non_cyclic_types false
% 4.81/4.97 % --sat_finite_models false
% 4.81/4.97 % --sat_fm_lemmas false
% 4.81/4.97 % --sat_fm_prep false
% 4.81/4.97 % --sat_fm_uc_incr true
% 4.81/4.97 % --sat_out_model small
% 4.81/4.97 % --sat_out_clauses false
% 4.81/4.97
% 4.81/4.97 % ------ QBF Options
% 4.81/4.97
% 4.81/4.97 % --qbf_mode false
% 4.81/4.97 % --qbf_elim_univ true
% 4.81/4.97 % --qbf_sk_in true
% 4.81/4.97 % --qbf_pred_elim true
% 4.81/4.97 % --qbf_split 32
% 4.81/4.97
% 4.81/4.97 % ------ BMC1 Options
% 4.81/4.97
% 4.81/4.97 % --bmc1_incremental false
% 4.81/4.97 % --bmc1_axioms reachable_all
% 4.81/4.97 % --bmc1_min_bound 0
% 4.81/4.97 % --bmc1_max_bound -1
% 4.81/4.97 % --bmc1_max_bound_default -1
% 4.81/4.97 % --bmc1_symbol_reachability true
% 4.81/4.97 % --bmc1_property_lemmas false
% 4.81/4.97 % --bmc1_k_induction false
% 4.81/4.97 % --bmc1_non_equiv_states false
% 4.81/4.97 % --bmc1_deadlock false
% 4.81/4.97 % --bmc1_ucm false
% 4.81/4.97 % --bmc1_add_unsat_core none
% 4.81/4.97 % --bmc1_unsat_core_children false
% 4.81/4.97 % --bmc1_unsat_core_extrapolate_axioms false
% 4.81/4.97 % --bmc1_out_stat full
% 4.81/4.97 % --bmc1_ground_init false
% 4.81/4.97 % --bmc1_pre_inst_next_state false
% 4.81/4.97 % --bmc1_pre_inst_state false
% 4.81/4.97 % --bmc1_pre_inst_reach_state false
% 4.81/4.97 % --bmc1_out_unsat_core false
% 4.81/4.97 % --bmc1_aig_witness_out false
% 4.81/4.97 % --bmc1_verbose false
% 4.81/4.97 % --bmc1_dump_clauses_tptp false
% 4.81/5.25 % --bmc1_dump_unsat_core_tptp false
% 4.81/5.25 % --bmc1_dump_file -
% 4.81/5.25 % --bmc1_ucm_expand_uc_limit 128
% 4.81/5.25 % --bmc1_ucm_n_expand_iterations 6
% 4.81/5.25 % --bmc1_ucm_extend_mode 1
% 4.81/5.25 % --bmc1_ucm_init_mode 2
% 4.81/5.25 % --bmc1_ucm_cone_mode none
% 4.81/5.25 % --bmc1_ucm_reduced_relation_type 0
% 4.81/5.25 % --bmc1_ucm_relax_model 4
% 4.81/5.25 % --bmc1_ucm_full_tr_after_sat true
% 4.81/5.25 % --bmc1_ucm_expand_neg_assumptions false
% 4.81/5.25 % --bmc1_ucm_layered_model none
% 4.81/5.25 % --bmc1_ucm_max_lemma_size 10
% 4.81/5.25
% 4.81/5.25 % ------ AIG Options
% 4.81/5.25
% 4.81/5.25 % --aig_mode false
% 4.81/5.25
% 4.81/5.25 % ------ Instantiation Options
% 4.81/5.25
% 4.81/5.25 % --instantiation_flag true
% 4.81/5.25 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 4.81/5.25 % --inst_solver_per_active 750
% 4.81/5.25 % --inst_solver_calls_frac 0.5
% 4.81/5.25 % --inst_passive_queue_type priority_queues
% 4.81/5.25 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 4.81/5.25 % --inst_passive_queues_freq [25;2]
% 4.81/5.25 % --inst_dismatching true
% 4.81/5.25 % --inst_eager_unprocessed_to_passive true
% 4.81/5.25 % --inst_prop_sim_given true
% 4.81/5.25 % --inst_prop_sim_new false
% 4.81/5.25 % --inst_orphan_elimination true
% 4.81/5.25 % --inst_learning_loop_flag true
% 4.81/5.25 % --inst_learning_start 3000
% 4.81/5.25 % --inst_learning_factor 2
% 4.81/5.25 % --inst_start_prop_sim_after_learn 3
% 4.81/5.25 % --inst_sel_renew solver
% 4.81/5.25 % --inst_lit_activity_flag true
% 4.81/5.25 % --inst_out_proof true
% 4.81/5.25
% 4.81/5.25 % ------ Resolution Options
% 4.81/5.25
% 4.81/5.25 % --resolution_flag true
% 4.81/5.25 % --res_lit_sel kbo_max
% 4.81/5.25 % --res_to_prop_solver none
% 4.81/5.25 % --res_prop_simpl_new false
% 4.81/5.25 % --res_prop_simpl_given false
% 4.81/5.25 % --res_passive_queue_type priority_queues
% 4.81/5.25 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 4.81/5.25 % --res_passive_queues_freq [15;5]
% 4.81/5.25 % --res_forward_subs full
% 4.81/5.25 % --res_backward_subs full
% 4.81/5.25 % --res_forward_subs_resolution true
% 4.81/5.25 % --res_backward_subs_resolution true
% 4.81/5.25 % --res_orphan_elimination false
% 4.81/5.25 % --res_time_limit 1000.
% 4.81/5.25 % --res_out_proof true
% 4.81/5.25 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_058039.s
% 4.81/5.25 % --modulo true
% 4.81/5.25
% 4.81/5.25 % ------ Combination Options
% 4.81/5.25
% 4.81/5.25 % --comb_res_mult 1000
% 4.81/5.25 % --comb_inst_mult 300
% 4.81/5.25 % ------
% 4.81/5.25
% 4.81/5.25 % ------ Parsing...% successful
% 4.81/5.25
% 4.81/5.25 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 144 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe_e snvd_s sp: 0 0s snvd_e %
% 4.81/5.25
% 4.81/5.25 % ------ Proving...
% 4.81/5.25 % ------ Problem Properties
% 4.81/5.25
% 4.81/5.25 %
% 4.81/5.25 % EPR false
% 4.81/5.25 % Horn false
% 4.81/5.25 % Has equality true
% 4.81/5.25
% 4.81/5.25 % % ------ Input Options Time Limit: Unbounded
% 4.81/5.25
% 4.81/5.25
% 4.81/5.25 % % ------ Current options:
% 4.81/5.25
% 4.81/5.25 % ------ Input Options
% 4.81/5.25
% 4.81/5.25 % --out_options all
% 4.81/5.25 % --tptp_safe_out true
% 4.81/5.25 % --problem_path ""
% 4.81/5.25 % --include_path ""
% 4.81/5.25 % --clausifier .//eprover
% 4.81/5.25 % --clausifier_options --tstp-format
% 4.81/5.25 % --stdin false
% 4.81/5.25 % --dbg_backtrace false
% 4.81/5.25 % --dbg_dump_prop_clauses false
% 4.81/5.25 % --dbg_dump_prop_clauses_file -
% 4.81/5.25 % --dbg_out_stat false
% 4.81/5.25
% 4.81/5.25 % ------ General Options
% 4.81/5.25
% 4.81/5.25 % --fof false
% 4.81/5.25 % --time_out_real 150.
% 4.81/5.25 % --time_out_prep_mult 0.2
% 4.81/5.25 % --time_out_virtual -1.
% 4.81/5.25 % --schedule none
% 4.81/5.25 % --ground_splitting input
% 4.81/5.25 % --splitting_nvd 16
% 4.81/5.25 % --non_eq_to_eq false
% 4.81/5.25 % --prep_gs_sim true
% 4.81/5.25 % --prep_unflatten false
% 4.81/5.25 % --prep_res_sim true
% 4.81/5.25 % --prep_upred true
% 4.81/5.25 % --res_sim_input true
% 4.81/5.25 % --clause_weak_htbl true
% 4.81/5.25 % --gc_record_bc_elim false
% 4.81/5.25 % --symbol_type_check false
% 4.81/5.25 % --clausify_out false
% 4.81/5.25 % --large_theory_mode false
% 4.81/5.25 % --prep_sem_filter none
% 4.81/5.25 % --prep_sem_filter_out false
% 4.81/5.25 % --preprocessed_out false
% 4.81/5.25 % --sub_typing false
% 4.81/5.25 % --brand_transform false
% 4.81/5.25 % --pure_diseq_elim true
% 4.81/5.25 % --min_unsat_core false
% 4.81/5.25 % --pred_elim true
% 4.81/5.25 % --add_important_lit false
% 4.81/5.25 % --soft_assumptions false
% 4.81/5.25 % --reset_solvers false
% 4.81/5.25 % --bc_imp_inh []
% 4.81/5.25 % --conj_cone_tolerance 1.5
% 4.81/5.25 % --prolific_symb_bound 500
% 4.81/5.25 % --lt_threshold 2000
% 4.81/5.25
% 4.81/5.25 % ------ SAT Options
% 4.81/5.25
% 4.81/5.25 % --sat_mode false
% 4.81/5.25 % --sat_fm_restart_options ""
% 4.81/5.25 % --sat_gr_def false
% 4.81/5.25 % --sat_epr_types true
% 4.81/5.25 % --sat_non_cyclic_types false
% 4.81/5.25 % --sat_finite_models false
% 4.81/5.25 % --sat_fm_lemmas false
% 4.81/5.25 % --sat_fm_prep false
% 4.81/5.25 % --sat_fm_uc_incr true
% 4.81/5.25 % --sat_out_model small
% 4.81/5.25 % --sat_out_clauses false
% 4.81/5.25
% 4.81/5.25 % ------ QBF Options
% 4.81/5.25
% 4.81/5.25 % --qbf_mode false
% 4.81/5.25 % --qbf_elim_univ true
% 4.81/5.25 % --qbf_sk_in true
% 4.81/5.25 % --qbf_pred_elim true
% 4.81/5.25 % --qbf_split 32
% 4.81/5.25
% 4.81/5.25 % ------ BMC1 Options
% 4.81/5.25
% 4.81/5.25 % --bmc1_incremental false
% 4.81/5.25 % --bmc1_axioms reachable_all
% 4.81/5.25 % --bmc1_min_bound 0
% 4.81/5.25 % --bmc1_max_bound -1
% 4.81/5.25 % --bmc1_max_bound_default -1
% 4.81/5.25 % --bmc1_symbol_reachability true
% 4.81/5.25 % --bmc1_property_lemmas false
% 4.81/5.25 % --bmc1_k_induction false
% 4.81/5.25 % --bmc1_non_equiv_states false
% 4.81/5.25 % --bmc1_deadlock false
% 4.81/5.25 % --bmc1_ucm false
% 4.81/5.25 % --bmc1_add_unsat_core none
% 4.81/5.25 % --bmc1_unsat_core_children false
% 4.81/5.25 % --bmc1_unsat_core_extrapolate_axioms false
% 4.81/5.25 % --bmc1_out_stat full
% 4.81/5.25 % --bmc1_ground_init false
% 4.81/5.25 % --bmc1_pre_inst_next_state false
% 4.81/5.25 % --bmc1_pre_inst_state false
% 4.81/5.25 % --bmc1_pre_inst_reach_state false
% 4.81/5.25 % --bmc1_out_unsat_core false
% 4.81/5.25 % --bmc1_aig_witness_out false
% 4.81/5.25 % --bmc1_verbose false
% 4.81/5.25 % --bmc1_dump_clauses_tptp false
% 4.81/5.25 % --bmc1_dump_unsat_core_tptp false
% 4.81/5.25 % --bmc1_dump_file -
% 4.81/5.25 % --bmc1_ucm_expand_uc_limit 128
% 4.81/5.25 % --bmc1_ucm_n_expand_iterations 6
% 4.81/5.25 % --bmc1_ucm_extend_mode 1
% 4.81/5.25 % --bmc1_ucm_init_mode 2
% 4.81/5.25 % --bmc1_ucm_cone_mode none
% 4.81/5.25 % --bmc1_ucm_reduced_relation_type 0
% 4.81/5.25 % --bmc1_ucm_relax_model 4
% 4.81/5.25 % --bmc1_ucm_full_tr_after_sat true
% 4.81/5.25 % --bmc1_ucm_expand_neg_assumptions false
% 4.81/5.25 % --bmc1_ucm_layered_model none
% 4.81/5.25 % --bmc1_ucm_max_lemma_size 10
% 4.81/5.25
% 4.81/5.25 % ------ AIG Options
% 4.81/5.25
% 4.81/5.25 % --aig_mode false
% 4.81/5.25
% 4.81/5.25 % ------ Instantiation Options
% 4.81/5.25
% 4.81/5.25 % --instantiation_flag true
% 4.81/5.25 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 4.81/5.25 % --inst_solver_per_active 750
% 4.81/5.25 % --inst_solver_calls_frac 0.5
% 4.81/5.25 % --inst_passive_queue_type priority_queues
% 4.81/5.25 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 4.81/5.25 % --inst_passive_queues_freq [25;2]
% 4.81/5.25 % --inst_dismatching true
% 4.81/5.25 % --inst_eager_unprocessed_to_passive true
% 10.06/10.29 % --inst_prop_sim_given true
% 10.06/10.29 % --inst_prop_sim_new false
% 10.06/10.29 % --inst_orphan_elimination true
% 10.06/10.29 % --inst_learning_loop_flag true
% 10.06/10.29 % --inst_learning_start 3000
% 10.06/10.29 % --inst_learning_factor 2
% 10.06/10.29 % --inst_start_prop_sim_after_learn 3
% 10.06/10.29 % --inst_sel_renew solver
% 10.06/10.29 % --inst_lit_activity_flag true
% 10.06/10.29 % --inst_out_proof true
% 10.06/10.29
% 10.06/10.29 % ------ Resolution Options
% 10.06/10.29
% 10.06/10.29 % --resolution_flag true
% 10.06/10.29 % --res_lit_sel kbo_max
% 10.06/10.29 % --res_to_prop_solver none
% 10.06/10.29 % --res_prop_simpl_new false
% 10.06/10.29 % --res_prop_simpl_given false
% 10.06/10.29 % --res_passive_queue_type priority_queues
% 10.06/10.29 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 10.06/10.29 % --res_passive_queues_freq [15;5]
% 10.06/10.29 % --res_forward_subs full
% 10.06/10.29 % --res_backward_subs full
% 10.13/10.29 % --res_forward_subs_resolution true
% 10.13/10.29 % --res_backward_subs_resolution true
% 10.13/10.29 % --res_orphan_elimination false
% 10.13/10.29 % --res_time_limit 1000.
% 10.13/10.29 % --res_out_proof true
% 10.13/10.29 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_058039.s
% 10.13/10.29 % --modulo true
% 10.13/10.29
% 10.13/10.29 % ------ Combination Options
% 10.13/10.29
% 10.13/10.29 % --comb_res_mult 1000
% 10.13/10.29 % --comb_inst_mult 300
% 10.13/10.29 % ------
% 10.13/10.29
% 10.13/10.29
% 10.13/10.29
% 10.13/10.29 % ------ Proving...
% 10.13/10.29 % warning: shown sat in sat incomplete mode
% 10.13/10.29 %
% 10.13/10.29
% 10.13/10.29
% 10.13/10.29 ------ Building Model...Done
% 10.13/10.29
% 10.13/10.29 %------ The model is defined over ground terms (initial term algebra).
% 10.13/10.29 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 10.13/10.29 %------ where \phi is a formula over the term algebra.
% 10.13/10.29 %------ If we have equality in the problem then it is also defined as a predicate above,
% 10.13/10.29 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 10.13/10.29 %------ See help for --sat_out_model for different model outputs.
% 10.13/10.29 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 10.13/10.29 %------ where the first argument stands for the sort ($i in the unsorted case)
% 10.13/10.29
% 10.13/10.29
% 10.13/10.29
% 10.13/10.29
% 10.13/10.29 %------ Negative definition of equality_sorted
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X0,X1] :
% 10.13/10.29 ( ~(equality_sorted(X0,X0,X1)) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=$i & X0=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of member
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2] :
% 10.13/10.29 ( member(X0,X1,X2) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) & X2=sk2_esk7_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) & X2=sk2_esk7_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of jules_forename
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( jules_forename(X0,X1) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of forename
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( forename(X0,X1) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of relname
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( relname(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of furniture
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( furniture(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of instrumentality
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( instrumentality(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of seat
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( seat(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of frontseat
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( frontseat(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of location
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( location(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of object
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( object(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of city
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( city(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of hollywood_placename
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( hollywood_placename(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of placename
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( placename(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of abstraction
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( abstraction(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of unisex
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( unisex(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk2_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk1_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of general
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( general(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of nonhuman
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( nonhuman(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of thing
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( thing(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk2_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk1_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of relation
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( relation(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of transport
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( transport(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of vehicle
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( vehicle(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of car
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( car(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of chevy
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( chevy(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of way
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( way(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of artifact
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( artifact(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of street
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( street(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of barrel
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( barrel(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of event
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( event(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk2_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk1_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of two
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( two(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of group
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( group(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk10_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of man
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( man(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of male
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( male(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of human_person
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( human_person(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of animate
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( animate(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of human
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( human(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of organism
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( organism(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of living
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( living(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Negative definition of impartial
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( ~(impartial(X0,X1)) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of entity
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( entity(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of fellow
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( fellow(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of wear
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( wear(X0,X1) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of set
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( set(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk10_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of multiple
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( multiple(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk10_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of clothes
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( clothes(X0,X1) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of coat
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( coat(X0,X1) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of nonliving
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( nonliving(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of existent
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( existent(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of specific
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( specific(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk2_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk1_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of device
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( device(X0,X1) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of wheel
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( wheel(X0,X1) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of eventuality
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( eventuality(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk2_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk1_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of state
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( state(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk2_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk1_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of nonexistent
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( nonexistent(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk2_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk1_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of singleton
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( singleton(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk2_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk1_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of white
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( white(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of black
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( black(X0,X1) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of young
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( young(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of old
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( old(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of nonreflexive
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( nonreflexive(X0,X1) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Negative definition of agent
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2] :
% 10.13/10.29 ( ~(agent(X0,X1,X2)) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of of
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2] :
% 10.13/10.29 ( of(X0,X1,X2) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 & X2=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of be
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3] :
% 10.13/10.29 ( be(X0,X1,X2,X3) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk2_2(sk2_esk1_0,sk2_esk7_0)) & X2=sk1_esk2_2(sk2_esk1_0,sk2_esk7_0) & X3=sk2_esk9_1(sk1_esk2_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk8_1(sk1_esk1_2(sk2_esk1_0,sk2_esk7_0)) & X2=sk1_esk1_2(sk2_esk1_0,sk2_esk7_0) & X3=sk2_esk9_1(sk1_esk1_2(sk2_esk1_0,sk2_esk7_0)) )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Negative definition of actual_world
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0] :
% 10.13/10.29 ( ~(actual_world(X0)) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of dirty
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( dirty(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of lonely
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( lonely(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of present
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1] :
% 10.13/10.29 ( present(X0,X1) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of down
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2] :
% 10.13/10.29 ( down(X0,X1,X2) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of in
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2] :
% 10.13/10.29 ( in(X0,X1,X2) <=>
% 10.13/10.29 (
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 & X2=sk2_esk5_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk9_1(sk1_esk2_2(sk2_esk1_0,sk2_esk7_0)) & X2=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 |
% 10.13/10.29 (
% 10.13/10.29 ( X0=sk2_esk1_0 & X1=sk2_esk9_1(sk1_esk1_2(sk2_esk1_0,sk2_esk7_0)) & X2=sk2_esk2_0 )
% 10.13/10.29 )
% 10.13/10.29
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of behind
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2] :
% 10.13/10.29 ( behind(X0,X1,X2) <=>
% 10.13/10.29 $false
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP0_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP3_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP6_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP9_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP12_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP15_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP15_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP18_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP18_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP21_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP21_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP24_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP24_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP27_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP27_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP30_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP33_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP33_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP36_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP36_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP39_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP39_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP42_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP42_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP45_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP45_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP48_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP48_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP51_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP51_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP54_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP54_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP57_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP57_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP60_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP60_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP63_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP63_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP66_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP66_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP69_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP69_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP72_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP72_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP75_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP75_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP78_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP78_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP81_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP81_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP84_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP84_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP87_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP87_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP90_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP90_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP93_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP93_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP96_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP96_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP99_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP99_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP102_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP102_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP105_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP105_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP108_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP108_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP111_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP111_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP114_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP114_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP117_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
% 10.13/10.29 ( sP117_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP120_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP120_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP123_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP123_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP126_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP126_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP129_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP129_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP132_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP132_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP135_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP135_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP138_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP138_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29 %------ Positive definition of sP141_iProver_split
% 10.13/10.29 fof(lit_def,axiom,
% 10.13/10.29 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] :
% 10.13/10.29 ( sP141_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=>
% 10.13/10.29 $true
% 10.13/10.29 )
% 10.13/10.29 )
% 10.13/10.29 ).
% 10.13/10.29
% 10.13/10.29
% 10.13/10.29
% 10.13/10.29 % ------ Statistics
% 10.13/10.29
% 10.13/10.29 % ------ General
% 10.13/10.29
% 10.13/10.29 % num_of_input_clauses: 233
% 10.13/10.29 % num_of_input_neg_conjectures: 59
% 10.13/10.29 % num_of_splits: 144
% 10.13/10.29 % num_of_split_atoms: 144
% 10.13/10.29 % num_of_sem_filtered_clauses: 0
% 10.13/10.29 % num_of_subtypes: 0
% 10.13/10.29 % monotx_restored_types: 0
% 10.13/10.29 % sat_num_of_epr_types: 0
% 10.13/10.29 % sat_num_of_non_cyclic_types: 0
% 10.13/10.29 % sat_guarded_non_collapsed_types: 0
% 10.13/10.29 % is_epr: 0
% 10.13/10.29 % is_horn: 0
% 10.13/10.29 % has_eq: 1
% 10.13/10.29 % num_pure_diseq_elim: 0
% 10.13/10.29 % simp_replaced_by: 0
% 10.13/10.29 % res_preprocessed: 262
% 10.13/10.29 % prep_upred: 0
% 10.13/10.29 % prep_unflattend: 1624
% 10.13/10.29 % pred_elim_cands: 144
% 10.13/10.29 % pred_elim: 56
% 10.13/10.29 % pred_elim_cl: 56
% 10.13/10.29 % pred_elim_cycles: 160
% 10.13/10.29 % forced_gc_time: 0
% 10.13/10.29 % gc_basic_clause_elim: 0
% 10.13/10.29 % parsing_time: 0.011
% 10.13/10.29 % sem_filter_time: 0.
% 10.13/10.29 % pred_elim_time: 0.204
% 10.13/10.29 % out_proof_time: 0.
% 10.13/10.29 % monotx_time: 0.
% 10.13/10.29 % subtype_inf_time: 0.
% 10.13/10.29 % unif_index_cands_time: 0.006
% 10.13/10.29 % unif_index_add_time: 0.007
% 10.13/10.29 % total_time: 5.328
% 10.13/10.29 % num_of_symbols: 259
% 10.13/10.29 % num_of_terms: 12510
% 10.13/10.29
% 10.13/10.29 % ------ Propositional Solver
% 10.13/10.29
% 10.13/10.29 % prop_solver_calls: 12
% 10.13/10.29 % prop_fast_solver_calls: 7389
% 10.13/10.29 % prop_num_of_clauses: 1326
% 10.13/10.29 % prop_preprocess_simplified: 4755
% 10.13/10.29 % prop_fo_subsumed: 2
% 10.13/10.29 % prop_solver_time: 0.
% 10.13/10.29 % prop_fast_solver_time: 0.01
% 10.13/10.29 % prop_unsat_core_time: 0.
% 10.13/10.29
% 10.13/10.29 % ------ QBF
% 10.13/10.29
% 10.13/10.29 % qbf_q_res: 0
% 10.13/10.29 % qbf_num_tautologies: 0
% 10.13/10.29 % qbf_prep_cycles: 0
% 10.13/10.29
% 10.13/10.29 % ------ BMC1
% 10.13/10.29
% 10.13/10.29 % bmc1_current_bound: -1
% 10.13/10.29 % bmc1_last_solved_bound: -1
% 10.13/10.29 % bmc1_unsat_core_size: -1
% 10.13/10.29 % bmc1_unsat_core_parents_size: -1
% 10.13/10.29 % bmc1_merge_next_fun: 0
% 10.13/10.29 % bmc1_unsat_core_clauses_time: 0.
% 10.13/10.29
% 10.13/10.29 % ------ Instantiation
% 10.13/10.29
% 10.13/10.29 % inst_num_of_clauses: 649
% 10.13/10.29 % inst_num_in_passive: 0
% 10.13/10.29 % inst_num_in_active: 649
% 10.13/10.29 % inst_num_in_unprocessed: 0
% 10.13/10.29 % inst_num_of_loops: 661
% 10.13/10.29 % inst_num_of_learning_restarts: 0
% 10.13/10.29 % inst_num_moves_active_passive: 0
% 10.13/10.29 % inst_lit_activity: 67
% 10.13/10.29 % inst_lit_activity_moves: 0
% 10.13/10.29 % inst_num_tautologies: 0
% 10.13/10.29 % inst_num_prop_implied: 0
% 10.13/10.29 % inst_num_existing_simplified: 0
% 10.13/10.29 % inst_num_eq_res_simplified: 0
% 10.13/10.29 % inst_num_child_elim: 0
% 10.13/10.29 % inst_num_of_dismatching_blockings: 0
% 10.13/10.29 % inst_num_of_non_proper_insts: 272
% 10.13/10.29 % inst_num_of_duplicates: 156
% 10.13/10.29 % inst_inst_num_from_inst_to_res: 0
% 10.13/10.29 % inst_dismatching_checking_time: 0.
% 10.13/10.29
% 10.13/10.29 % ------ Resolution
% 10.13/10.29
% 10.13/10.29 % res_num_of_clauses: 8990
% 10.13/10.29 % res_num_in_passive: 6365
% 10.13/10.29 % res_num_in_active: 2523
% 10.13/10.29 % res_num_of_loops: 3000
% 10.13/10.29 % res_forward_subset_subsumed: 1154
% 10.13/10.29 % res_backward_subset_subsumed: 0
% 10.13/10.29 % res_forward_subsumed: 2
% 10.13/10.29 % res_backward_subsumed: 0
% 10.13/10.29 % res_forward_subsumption_resolution: 1641
% 10.13/10.29 % res_backward_subsumption_resolution: 0
% 10.13/10.29 % res_clause_to_clause_subsumption: 38018
% 10.13/10.29 % res_orphan_elimination: 0
% 10.13/10.29 % res_tautology_del: 304
% 10.13/10.29 % res_num_eq_res_simplified: 0
% 10.13/10.29 % res_num_sel_changes: 0
% 10.13/10.29 % res_moves_from_active_to_pass: 0
% 10.13/10.29
% 10.13/10.29 % Status Unknown
% 10.13/10.29 % Last status :
% 10.13/10.29 % SZS status Unknown
%------------------------------------------------------------------------------