TSTP Solution File: NLP229-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP229-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n004.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:44 EDT 2022
% Result : Unknown 26.18s 26.37s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NLP229-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.14 % Command : iprover_modulo %s %d
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 1 08:23:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Running in mono-core mode
% 0.22/0.43 % Orienting using strategy Equiv(ClausalAll)
% 0.22/0.43 % Orientation found
% 0.22/0.43 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_738b98.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_8738d3.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_6e8440 | grep -v "SZS"
% 0.22/0.46
% 0.22/0.46 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.46
% 0.22/0.46 %
% 0.22/0.46 % ------ iProver source info
% 0.22/0.46
% 0.22/0.46 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.46 % git: non_committed_changes: true
% 0.22/0.46 % git: last_make_outside_of_git: true
% 0.22/0.46
% 0.22/0.46 %
% 0.22/0.46 % ------ Input Options
% 0.22/0.46
% 0.22/0.46 % --out_options all
% 0.22/0.46 % --tptp_safe_out true
% 0.22/0.46 % --problem_path ""
% 0.22/0.46 % --include_path ""
% 0.22/0.46 % --clausifier .//eprover
% 0.22/0.46 % --clausifier_options --tstp-format
% 0.22/0.46 % --stdin false
% 0.22/0.46 % --dbg_backtrace false
% 0.22/0.46 % --dbg_dump_prop_clauses false
% 0.22/0.46 % --dbg_dump_prop_clauses_file -
% 0.22/0.46 % --dbg_out_stat false
% 0.22/0.46
% 0.22/0.46 % ------ General Options
% 0.22/0.46
% 0.22/0.46 % --fof false
% 0.22/0.46 % --time_out_real 150.
% 0.22/0.46 % --time_out_prep_mult 0.2
% 0.22/0.46 % --time_out_virtual -1.
% 0.22/0.46 % --schedule none
% 0.22/0.46 % --ground_splitting input
% 0.22/0.46 % --splitting_nvd 16
% 0.22/0.46 % --non_eq_to_eq false
% 0.22/0.46 % --prep_gs_sim true
% 0.22/0.46 % --prep_unflatten false
% 0.22/0.46 % --prep_res_sim true
% 0.22/0.46 % --prep_upred true
% 0.22/0.46 % --res_sim_input true
% 0.22/0.46 % --clause_weak_htbl true
% 0.22/0.46 % --gc_record_bc_elim false
% 0.22/0.46 % --symbol_type_check false
% 0.22/0.46 % --clausify_out false
% 0.22/0.46 % --large_theory_mode false
% 0.22/0.46 % --prep_sem_filter none
% 0.22/0.46 % --prep_sem_filter_out false
% 0.22/0.46 % --preprocessed_out false
% 0.22/0.46 % --sub_typing false
% 0.22/0.46 % --brand_transform false
% 0.22/0.46 % --pure_diseq_elim true
% 0.22/0.46 % --min_unsat_core false
% 0.22/0.46 % --pred_elim true
% 0.22/0.46 % --add_important_lit false
% 0.22/0.46 % --soft_assumptions false
% 0.22/0.46 % --reset_solvers false
% 0.22/0.46 % --bc_imp_inh []
% 0.22/0.46 % --conj_cone_tolerance 1.5
% 0.22/0.46 % --prolific_symb_bound 500
% 0.22/0.46 % --lt_threshold 2000
% 0.22/0.46
% 0.22/0.46 % ------ SAT Options
% 0.22/0.46
% 0.22/0.46 % --sat_mode false
% 0.22/0.46 % --sat_fm_restart_options ""
% 0.22/0.46 % --sat_gr_def false
% 0.22/0.46 % --sat_epr_types true
% 0.22/0.46 % --sat_non_cyclic_types false
% 0.22/0.46 % --sat_finite_models false
% 0.22/0.46 % --sat_fm_lemmas false
% 0.22/0.46 % --sat_fm_prep false
% 0.22/0.46 % --sat_fm_uc_incr true
% 0.22/0.46 % --sat_out_model small
% 0.22/0.46 % --sat_out_clauses false
% 0.22/0.46
% 0.22/0.46 % ------ QBF Options
% 0.22/0.46
% 0.22/0.46 % --qbf_mode false
% 0.22/0.46 % --qbf_elim_univ true
% 0.22/0.46 % --qbf_sk_in true
% 0.22/0.46 % --qbf_pred_elim true
% 0.22/0.46 % --qbf_split 32
% 0.22/0.46
% 0.22/0.46 % ------ BMC1 Options
% 0.22/0.46
% 0.22/0.46 % --bmc1_incremental false
% 0.22/0.46 % --bmc1_axioms reachable_all
% 0.22/0.46 % --bmc1_min_bound 0
% 0.22/0.46 % --bmc1_max_bound -1
% 0.22/0.46 % --bmc1_max_bound_default -1
% 0.22/0.46 % --bmc1_symbol_reachability true
% 0.22/0.46 % --bmc1_property_lemmas false
% 0.22/0.46 % --bmc1_k_induction false
% 0.22/0.46 % --bmc1_non_equiv_states false
% 0.22/0.46 % --bmc1_deadlock false
% 0.22/0.46 % --bmc1_ucm false
% 0.22/0.46 % --bmc1_add_unsat_core none
% 0.22/0.46 % --bmc1_unsat_core_children false
% 0.22/0.46 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.46 % --bmc1_out_stat full
% 0.22/0.46 % --bmc1_ground_init false
% 0.22/0.46 % --bmc1_pre_inst_next_state false
% 0.22/0.46 % --bmc1_pre_inst_state false
% 0.22/0.46 % --bmc1_pre_inst_reach_state false
% 0.22/0.46 % --bmc1_out_unsat_core false
% 0.22/0.46 % --bmc1_aig_witness_out false
% 0.22/0.46 % --bmc1_verbose false
% 0.22/0.46 % --bmc1_dump_clauses_tptp false
% 0.22/0.48 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.48 % --bmc1_dump_file -
% 0.22/0.48 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.48 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.48 % --bmc1_ucm_extend_mode 1
% 0.22/0.48 % --bmc1_ucm_init_mode 2
% 0.22/0.48 % --bmc1_ucm_cone_mode none
% 0.22/0.48 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.48 % --bmc1_ucm_relax_model 4
% 0.22/0.48 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.48 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.48 % --bmc1_ucm_layered_model none
% 0.22/0.48 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.48
% 0.22/0.48 % ------ AIG Options
% 0.22/0.48
% 0.22/0.48 % --aig_mode false
% 0.22/0.48
% 0.22/0.48 % ------ Instantiation Options
% 0.22/0.48
% 0.22/0.48 % --instantiation_flag true
% 0.22/0.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.48 % --inst_solver_per_active 750
% 0.22/0.48 % --inst_solver_calls_frac 0.5
% 0.22/0.48 % --inst_passive_queue_type priority_queues
% 0.22/0.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.48 % --inst_passive_queues_freq [25;2]
% 0.22/0.48 % --inst_dismatching true
% 0.22/0.48 % --inst_eager_unprocessed_to_passive true
% 0.22/0.48 % --inst_prop_sim_given true
% 0.22/0.48 % --inst_prop_sim_new false
% 0.22/0.48 % --inst_orphan_elimination true
% 0.22/0.48 % --inst_learning_loop_flag true
% 0.22/0.48 % --inst_learning_start 3000
% 0.22/0.48 % --inst_learning_factor 2
% 0.22/0.48 % --inst_start_prop_sim_after_learn 3
% 0.22/0.48 % --inst_sel_renew solver
% 0.22/0.48 % --inst_lit_activity_flag true
% 0.22/0.48 % --inst_out_proof true
% 0.22/0.48
% 0.22/0.48 % ------ Resolution Options
% 0.22/0.48
% 0.22/0.48 % --resolution_flag true
% 0.22/0.48 % --res_lit_sel kbo_max
% 0.22/0.48 % --res_to_prop_solver none
% 0.22/0.48 % --res_prop_simpl_new false
% 0.22/0.48 % --res_prop_simpl_given false
% 0.22/0.48 % --res_passive_queue_type priority_queues
% 0.22/0.48 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.48 % --res_passive_queues_freq [15;5]
% 0.22/0.48 % --res_forward_subs full
% 0.22/0.48 % --res_backward_subs full
% 0.22/0.48 % --res_forward_subs_resolution true
% 0.22/0.48 % --res_backward_subs_resolution true
% 0.22/0.48 % --res_orphan_elimination false
% 0.22/0.48 % --res_time_limit 1000.
% 0.22/0.48 % --res_out_proof true
% 0.22/0.48 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_738b98.s
% 0.22/0.48 % --modulo true
% 0.22/0.48
% 0.22/0.48 % ------ Combination Options
% 0.22/0.48
% 0.22/0.48 % --comb_res_mult 1000
% 0.22/0.48 % --comb_inst_mult 300
% 0.22/0.48 % ------
% 0.22/0.48
% 0.22/0.48 % ------ Parsing...% successful
% 0.22/0.48
% 0.22/0.48 % ------ Preprocessing... gs_s sp: 12 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.22/0.48
% 0.22/0.48 % ------ Proving...
% 0.22/0.48 % ------ Problem Properties
% 0.22/0.48
% 0.22/0.48 %
% 0.22/0.48 % EPR false
% 0.22/0.48 % Horn false
% 0.22/0.48 % Has equality true
% 0.22/0.48
% 0.22/0.48 % % ------ Input Options Time Limit: Unbounded
% 0.22/0.48
% 0.22/0.48
% 0.22/0.48 % % ------ Current options:
% 0.22/0.48
% 0.22/0.48 % ------ Input Options
% 0.22/0.48
% 0.22/0.48 % --out_options all
% 0.22/0.48 % --tptp_safe_out true
% 0.22/0.48 % --problem_path ""
% 0.22/0.48 % --include_path ""
% 0.22/0.48 % --clausifier .//eprover
% 0.22/0.48 % --clausifier_options --tstp-format
% 0.22/0.48 % --stdin false
% 0.22/0.48 % --dbg_backtrace false
% 0.22/0.48 % --dbg_dump_prop_clauses false
% 0.22/0.48 % --dbg_dump_prop_clauses_file -
% 0.22/0.48 % --dbg_out_stat false
% 0.22/0.48
% 0.22/0.48 % ------ General Options
% 0.22/0.48
% 0.22/0.48 % --fof false
% 0.22/0.48 % --time_out_real 150.
% 0.22/0.48 % --time_out_prep_mult 0.2
% 0.22/0.48 % --time_out_virtual -1.
% 0.22/0.48 % --schedule none
% 0.22/0.48 % --ground_splitting input
% 0.22/0.48 % --splitting_nvd 16
% 0.22/0.48 % --non_eq_to_eq false
% 0.22/0.48 % --prep_gs_sim true
% 0.22/0.48 % --prep_unflatten false
% 0.22/0.48 % --prep_res_sim true
% 0.22/0.48 % --prep_upred true
% 0.22/0.48 % --res_sim_input true
% 0.22/0.48 % --clause_weak_htbl true
% 0.22/0.48 % --gc_record_bc_elim false
% 0.22/0.48 % --symbol_type_check false
% 0.22/0.48 % --clausify_out false
% 0.22/0.48 % --large_theory_mode false
% 0.22/0.48 % --prep_sem_filter none
% 0.22/0.48 % --prep_sem_filter_out false
% 0.22/0.48 % --preprocessed_out false
% 0.22/0.48 % --sub_typing false
% 0.22/0.48 % --brand_transform false
% 0.22/0.48 % --pure_diseq_elim true
% 0.22/0.48 % --min_unsat_core false
% 0.22/0.48 % --pred_elim true
% 0.22/0.48 % --add_important_lit false
% 0.22/0.48 % --soft_assumptions false
% 0.22/0.48 % --reset_solvers false
% 0.22/0.48 % --bc_imp_inh []
% 0.22/0.48 % --conj_cone_tolerance 1.5
% 0.22/0.48 % --prolific_symb_bound 500
% 0.22/0.48 % --lt_threshold 2000
% 0.22/0.48
% 0.22/0.48 % ------ SAT Options
% 0.22/0.48
% 0.22/0.48 % --sat_mode false
% 0.22/0.48 % --sat_fm_restart_options ""
% 0.22/0.48 % --sat_gr_def false
% 0.22/0.48 % --sat_epr_types true
% 0.22/0.48 % --sat_non_cyclic_types false
% 0.22/0.48 % --sat_finite_models false
% 0.22/0.48 % --sat_fm_lemmas false
% 0.22/0.48 % --sat_fm_prep false
% 0.22/0.48 % --sat_fm_uc_incr true
% 0.22/0.48 % --sat_out_model small
% 0.22/0.48 % --sat_out_clauses false
% 0.22/0.48
% 0.22/0.48 % ------ QBF Options
% 0.22/0.48
% 0.22/0.48 % --qbf_mode false
% 0.22/0.48 % --qbf_elim_univ true
% 0.22/0.48 % --qbf_sk_in true
% 0.22/0.48 % --qbf_pred_elim true
% 0.22/0.48 % --qbf_split 32
% 0.22/0.48
% 0.22/0.48 % ------ BMC1 Options
% 0.22/0.48
% 0.22/0.48 % --bmc1_incremental false
% 0.22/0.48 % --bmc1_axioms reachable_all
% 0.22/0.48 % --bmc1_min_bound 0
% 0.22/0.48 % --bmc1_max_bound -1
% 0.22/0.48 % --bmc1_max_bound_default -1
% 0.22/0.48 % --bmc1_symbol_reachability true
% 0.22/0.48 % --bmc1_property_lemmas false
% 0.22/0.48 % --bmc1_k_induction false
% 0.22/0.48 % --bmc1_non_equiv_states false
% 0.22/0.48 % --bmc1_deadlock false
% 0.22/0.48 % --bmc1_ucm false
% 0.22/0.48 % --bmc1_add_unsat_core none
% 0.22/0.48 % --bmc1_unsat_core_children false
% 0.22/0.48 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.48 % --bmc1_out_stat full
% 0.22/0.48 % --bmc1_ground_init false
% 0.22/0.48 % --bmc1_pre_inst_next_state false
% 0.22/0.48 % --bmc1_pre_inst_state false
% 0.22/0.48 % --bmc1_pre_inst_reach_state false
% 0.22/0.48 % --bmc1_out_unsat_core false
% 0.22/0.48 % --bmc1_aig_witness_out false
% 0.22/0.48 % --bmc1_verbose false
% 0.22/0.48 % --bmc1_dump_clauses_tptp false
% 0.22/0.48 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.48 % --bmc1_dump_file -
% 0.22/0.48 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.48 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.48 % --bmc1_ucm_extend_mode 1
% 0.22/0.48 % --bmc1_ucm_init_mode 2
% 0.22/0.48 % --bmc1_ucm_cone_mode none
% 0.22/0.48 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.48 % --bmc1_ucm_relax_model 4
% 0.22/0.48 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.48 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.48 % --bmc1_ucm_layered_model none
% 0.22/0.48 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.48
% 0.22/0.48 % ------ AIG Options
% 0.22/0.48
% 0.22/0.48 % --aig_mode false
% 0.22/0.48
% 0.22/0.48 % ------ Instantiation Options
% 0.22/0.48
% 0.22/0.48 % --instantiation_flag true
% 0.22/0.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.48 % --inst_solver_per_active 750
% 0.22/0.48 % --inst_solver_calls_frac 0.5
% 0.22/0.48 % --inst_passive_queue_type priority_queues
% 0.22/0.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.48 % --inst_passive_queues_freq [25;2]
% 0.22/0.48 % --inst_dismatching true
% 0.22/0.48 % --inst_eager_unprocessed_to_passive true
% 0.22/0.48 % --inst_prop_sim_given true
% 2.05/2.27 % --inst_prop_sim_new false
% 2.05/2.27 % --inst_orphan_elimination true
% 2.05/2.27 % --inst_learning_loop_flag true
% 2.05/2.27 % --inst_learning_start 3000
% 2.05/2.27 % --inst_learning_factor 2
% 2.05/2.27 % --inst_start_prop_sim_after_learn 3
% 2.05/2.27 % --inst_sel_renew solver
% 2.05/2.27 % --inst_lit_activity_flag true
% 2.05/2.27 % --inst_out_proof true
% 2.05/2.27
% 2.05/2.27 % ------ Resolution Options
% 2.05/2.27
% 2.05/2.27 % --resolution_flag true
% 2.05/2.27 % --res_lit_sel kbo_max
% 2.05/2.27 % --res_to_prop_solver none
% 2.05/2.27 % --res_prop_simpl_new false
% 2.05/2.27 % --res_prop_simpl_given false
% 2.05/2.27 % --res_passive_queue_type priority_queues
% 2.05/2.27 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.05/2.27 % --res_passive_queues_freq [15;5]
% 2.05/2.27 % --res_forward_subs full
% 2.05/2.27 % --res_backward_subs full
% 2.05/2.27 % --res_forward_subs_resolution true
% 2.05/2.27 % --res_backward_subs_resolution true
% 2.05/2.27 % --res_orphan_elimination false
% 2.05/2.27 % --res_time_limit 1000.
% 2.05/2.27 % --res_out_proof true
% 2.05/2.27 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_738b98.s
% 2.05/2.27 % --modulo true
% 2.05/2.27
% 2.05/2.27 % ------ Combination Options
% 2.05/2.27
% 2.05/2.27 % --comb_res_mult 1000
% 2.05/2.27 % --comb_inst_mult 300
% 2.05/2.27 % ------
% 2.05/2.27
% 2.05/2.27
% 2.05/2.27
% 2.05/2.27 % ------ Proving...
% 2.05/2.27 % warning: shown sat in sat incomplete mode
% 2.05/2.27 %
% 2.05/2.27
% 2.05/2.27
% 2.05/2.27 ------ Building Model...Done
% 2.05/2.27
% 2.05/2.27 %------ The model is defined over ground terms (initial term algebra).
% 2.05/2.27 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.05/2.27 %------ where \phi is a formula over the term algebra.
% 2.05/2.27 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.05/2.27 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.05/2.27 %------ See help for --sat_out_model for different model outputs.
% 2.05/2.27 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.05/2.27 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.05/2.27
% 2.05/2.27
% 2.05/2.27
% 2.05/2.27
% 2.05/2.27 %------ Negative definition of equality_sorted
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X0,X1] :
% 2.05/2.27 ( ~(equality_sorted(X0,X0,X1)) <=>
% 2.05/2.27 $false
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of be
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1,X2,X3] :
% 2.05/2.27 ( be(X0,X1,X2,X3) <=>
% 2.05/2.27 $false
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of accessible_world
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( accessible_world(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of agent
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1,X2] :
% 2.05/2.27 ( agent(X0,X1,X2) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc7 & X2=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skf2(skc9) & X2=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc7 & X2=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of theme
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1,X2] :
% 2.05/2.27 ( theme(X0,X1,X2) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc7 & X2=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc7 & X2=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of think_believe_consider
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( think_believe_consider(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of proposition
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( proposition(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of entity
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( entity(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of of
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1,X2] :
% 2.05/2.27 ( of(X0,X1,X2) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc8 & X2=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc8 & X2=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of forename
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( forename(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc8 )
% 2.05/2.27 &
% 2.05/2.27 ( X0!=skc6 )
% 2.05/2.27 &
% 2.05/2.27 ( X0!=skc5 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of state
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( state(X0,X1) <=>
% 2.05/2.27 $false
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of eventuality
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( eventuality(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 ? [X2] :
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skf2(X2) )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of thing
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( thing(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 ? [X2] :
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skf2(X2) )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of singleton
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( singleton(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 ? [X2] :
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skf2(X2) )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of specific
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( specific(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 ? [X2] :
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skf2(X2) )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of nonexistent
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( nonexistent(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 ? [X2] :
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skf2(X2) )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of unisex
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( unisex(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 ? [X2] :
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skf2(X2) )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of event
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( event(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 ? [X2] :
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skf2(X2) )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc7 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of man
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( man(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of human_person
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( human_person(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of organism
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( organism(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of existent
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( existent(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of impartial
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( impartial(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of living
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( living(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of human
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( human(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of animate
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( animate(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of male
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( male(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc9 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of relname
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( relname(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of relation
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( relation(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of abstraction
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( abstraction(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of nonhuman
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( nonhuman(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of general
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( general(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc5 & X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc6 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 |
% 2.05/2.27 (
% 2.05/2.27 ( X1=skc8 )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of jules_forename
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( jules_forename(X0,X1) <=>
% 2.05/2.27 $false
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of smoke
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( smoke(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 ? [X2] :
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skf2(X2) )
% 2.05/2.27 )
% 2.05/2.27
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 )
% 2.05/2.27 ).
% 2.05/2.27
% 2.05/2.27 %------ Positive definition of present
% 2.05/2.27 fof(lit_def,axiom,
% 2.05/2.27 (! [X0,X1] :
% 2.05/2.27 ( present(X0,X1) <=>
% 2.05/2.27 (
% 2.05/2.27 (
% 2.05/2.27 ( X0=skc6 & X1=skc7 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 ? [X2] :
% 2.05/2.28 (
% 2.05/2.28 ( X0=skc6 & X1=skf2(X2) )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=skc5 & X1=skc7 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X1=skc7 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 ).
% 2.05/2.28
% 2.05/2.28 %------ Positive definition of vincent_forename
% 2.05/2.28 fof(lit_def,axiom,
% 2.05/2.28 (! [X0,X1] :
% 2.05/2.28 ( vincent_forename(X0,X1) <=>
% 2.05/2.28 (
% 2.05/2.28 (
% 2.05/2.28 ( X0=skc6 & X1=skc8 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=skc5 & X1=skc8 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X1=skc8 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 ).
% 2.05/2.28
% 2.05/2.28 %------ Negative definition of actual_world
% 2.05/2.28 fof(lit_def,axiom,
% 2.05/2.28 (! [X0] :
% 2.05/2.28 ( ~(actual_world(X0)) <=>
% 2.05/2.28 $false
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 ).
% 2.05/2.28
% 2.05/2.28 %------ Positive definition of sP1_iProver_split
% 2.05/2.28 fof(lit_def,axiom,
% 2.05/2.28 ( sP1_iProver_split <=>
% 2.05/2.28 $false
% 2.05/2.28 )
% 2.05/2.28 ).
% 2.05/2.28
% 2.05/2.28
% 2.05/2.28
% 2.05/2.28 % ------ Statistics
% 2.05/2.28
% 2.05/2.28 % ------ General
% 2.05/2.28
% 2.05/2.28 % num_of_input_clauses: 205
% 2.05/2.28 % num_of_input_neg_conjectures: 18
% 2.05/2.28 % num_of_splits: 12
% 2.05/2.28 % num_of_split_atoms: 4
% 2.05/2.28 % num_of_sem_filtered_clauses: 0
% 2.05/2.28 % num_of_subtypes: 0
% 2.05/2.28 % monotx_restored_types: 0
% 2.05/2.28 % sat_num_of_epr_types: 0
% 2.05/2.28 % sat_num_of_non_cyclic_types: 0
% 2.05/2.28 % sat_guarded_non_collapsed_types: 0
% 2.05/2.28 % is_epr: 0
% 2.05/2.28 % is_horn: 0
% 2.05/2.28 % has_eq: 1
% 2.05/2.28 % num_pure_diseq_elim: 0
% 2.05/2.28 % simp_replaced_by: 0
% 2.05/2.28 % res_preprocessed: 48
% 2.05/2.28 % prep_upred: 0
% 2.05/2.28 % prep_unflattend: 0
% 2.05/2.28 % pred_elim_cands: 4
% 2.05/2.28 % pred_elim: 3
% 2.05/2.28 % pred_elim_cl: 3
% 2.05/2.28 % pred_elim_cycles: 4
% 2.05/2.28 % forced_gc_time: 0
% 2.05/2.28 % gc_basic_clause_elim: 0
% 2.05/2.28 % parsing_time: 0.007
% 2.05/2.28 % sem_filter_time: 0.
% 2.05/2.28 % pred_elim_time: 0.001
% 2.05/2.28 % out_proof_time: 0.
% 2.05/2.28 % monotx_time: 0.
% 2.05/2.28 % subtype_inf_time: 0.
% 2.05/2.28 % unif_index_cands_time: 0.002
% 2.05/2.28 % unif_index_add_time: 0.003
% 2.05/2.28 % total_time: 1.832
% 2.05/2.28 % num_of_symbols: 72
% 2.05/2.28 % num_of_terms: 3886
% 2.05/2.28
% 2.05/2.28 % ------ Propositional Solver
% 2.05/2.28
% 2.05/2.28 % prop_solver_calls: 8
% 2.05/2.28 % prop_fast_solver_calls: 227
% 2.05/2.28 % prop_num_of_clauses: 680
% 2.05/2.28 % prop_preprocess_simplified: 2155
% 2.05/2.28 % prop_fo_subsumed: 0
% 2.05/2.28 % prop_solver_time: 0.
% 2.05/2.28 % prop_fast_solver_time: 0.
% 2.05/2.28 % prop_unsat_core_time: 0.
% 2.05/2.28
% 2.05/2.28 % ------ QBF
% 2.05/2.28
% 2.05/2.28 % qbf_q_res: 0
% 2.05/2.28 % qbf_num_tautologies: 0
% 2.05/2.28 % qbf_prep_cycles: 0
% 2.05/2.28
% 2.05/2.28 % ------ BMC1
% 2.05/2.28
% 2.05/2.28 % bmc1_current_bound: -1
% 2.05/2.28 % bmc1_last_solved_bound: -1
% 2.05/2.28 % bmc1_unsat_core_size: -1
% 2.05/2.28 % bmc1_unsat_core_parents_size: -1
% 2.05/2.28 % bmc1_merge_next_fun: 0
% 2.05/2.28 % bmc1_unsat_core_clauses_time: 0.
% 2.05/2.28
% 2.05/2.28 % ------ Instantiation
% 2.05/2.28
% 2.05/2.28 % inst_num_of_clauses: 629
% 2.05/2.28 % inst_num_in_passive: 0
% 2.05/2.28 % inst_num_in_active: 627
% 2.05/2.28 % inst_num_in_unprocessed: 0
% 2.05/2.28 % inst_num_of_loops: 640
% 2.05/2.28 % inst_num_of_learning_restarts: 0
% 2.05/2.28 % inst_num_moves_active_passive: 3
% 2.05/2.28 % inst_lit_activity: 74
% 2.05/2.28 % inst_lit_activity_moves: 0
% 2.05/2.28 % inst_num_tautologies: 2
% 2.05/2.28 % inst_num_prop_implied: 0
% 2.05/2.28 % inst_num_existing_simplified: 0
% 2.05/2.28 % inst_num_eq_res_simplified: 0
% 2.05/2.28 % inst_num_child_elim: 0
% 2.05/2.28 % inst_num_of_dismatching_blockings: 44
% 2.05/2.28 % inst_num_of_non_proper_insts: 998
% 2.05/2.28 % inst_num_of_duplicates: 494
% 2.05/2.28 % inst_inst_num_from_inst_to_res: 0
% 2.05/2.28 % inst_dismatching_checking_time: 0.
% 2.05/2.28
% 2.05/2.28 % ------ Resolution
% 2.05/2.28
% 2.05/2.28 % res_num_of_clauses: 1619
% 2.05/2.28 % res_num_in_passive: 338
% 2.05/2.28 % res_num_in_active: 1195
% 2.05/2.28 % res_num_of_loops: 3000
% 2.05/2.28 % res_forward_subset_subsumed: 912
% 2.05/2.28 % res_backward_subset_subsumed: 3
% 2.05/2.28 % res_forward_subsumed: 1814
% 2.05/2.28 % res_backward_subsumed: 14
% 2.05/2.28 % res_forward_subsumption_resolution: 356
% 2.05/2.28 % res_backward_subsumption_resolution: 3
% 2.05/2.28 % res_clause_to_clause_subsumption: 43020
% 2.05/2.28 % res_orphan_elimination: 0
% 2.05/2.28 % res_tautology_del: 0
% 2.05/2.28 % res_num_eq_res_simplified: 0
% 2.05/2.28 % res_num_sel_changes: 0
% 2.05/2.28 % res_moves_from_active_to_pass: 0
% 2.05/2.28
% 2.05/2.28 % Status Unknown
% 2.13/2.33 % Orienting using strategy ClausalAll
% 2.13/2.33 % Orientation found
% 2.13/2.33 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_738b98.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_8738d3.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_0c9a3d | grep -v "SZS"
% 2.13/2.34
% 2.13/2.34 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 2.13/2.34
% 2.13/2.34 %
% 2.13/2.34 % ------ iProver source info
% 2.13/2.34
% 2.13/2.34 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 2.13/2.34 % git: non_committed_changes: true
% 2.13/2.34 % git: last_make_outside_of_git: true
% 2.13/2.34
% 2.13/2.34 %
% 2.13/2.34 % ------ Input Options
% 2.13/2.34
% 2.13/2.34 % --out_options all
% 2.13/2.34 % --tptp_safe_out true
% 2.13/2.34 % --problem_path ""
% 2.13/2.34 % --include_path ""
% 2.13/2.34 % --clausifier .//eprover
% 2.13/2.34 % --clausifier_options --tstp-format
% 2.13/2.34 % --stdin false
% 2.13/2.34 % --dbg_backtrace false
% 2.13/2.34 % --dbg_dump_prop_clauses false
% 2.13/2.34 % --dbg_dump_prop_clauses_file -
% 2.13/2.34 % --dbg_out_stat false
% 2.13/2.34
% 2.13/2.34 % ------ General Options
% 2.13/2.34
% 2.13/2.34 % --fof false
% 2.13/2.34 % --time_out_real 150.
% 2.13/2.34 % --time_out_prep_mult 0.2
% 2.13/2.34 % --time_out_virtual -1.
% 2.13/2.34 % --schedule none
% 2.13/2.34 % --ground_splitting input
% 2.13/2.34 % --splitting_nvd 16
% 2.13/2.34 % --non_eq_to_eq false
% 2.13/2.34 % --prep_gs_sim true
% 2.13/2.34 % --prep_unflatten false
% 2.13/2.34 % --prep_res_sim true
% 2.13/2.34 % --prep_upred true
% 2.13/2.34 % --res_sim_input true
% 2.13/2.34 % --clause_weak_htbl true
% 2.13/2.34 % --gc_record_bc_elim false
% 2.13/2.34 % --symbol_type_check false
% 2.13/2.34 % --clausify_out false
% 2.13/2.34 % --large_theory_mode false
% 2.13/2.34 % --prep_sem_filter none
% 2.13/2.34 % --prep_sem_filter_out false
% 2.13/2.34 % --preprocessed_out false
% 2.13/2.34 % --sub_typing false
% 2.13/2.34 % --brand_transform false
% 2.13/2.34 % --pure_diseq_elim true
% 2.13/2.34 % --min_unsat_core false
% 2.13/2.34 % --pred_elim true
% 2.13/2.34 % --add_important_lit false
% 2.13/2.34 % --soft_assumptions false
% 2.13/2.34 % --reset_solvers false
% 2.13/2.34 % --bc_imp_inh []
% 2.13/2.34 % --conj_cone_tolerance 1.5
% 2.13/2.34 % --prolific_symb_bound 500
% 2.13/2.34 % --lt_threshold 2000
% 2.13/2.34
% 2.13/2.34 % ------ SAT Options
% 2.13/2.34
% 2.13/2.34 % --sat_mode false
% 2.13/2.34 % --sat_fm_restart_options ""
% 2.13/2.34 % --sat_gr_def false
% 2.13/2.34 % --sat_epr_types true
% 2.13/2.34 % --sat_non_cyclic_types false
% 2.13/2.34 % --sat_finite_models false
% 2.13/2.34 % --sat_fm_lemmas false
% 2.13/2.34 % --sat_fm_prep false
% 2.13/2.34 % --sat_fm_uc_incr true
% 2.13/2.34 % --sat_out_model small
% 2.13/2.34 % --sat_out_clauses false
% 2.13/2.34
% 2.13/2.34 % ------ QBF Options
% 2.13/2.34
% 2.13/2.34 % --qbf_mode false
% 2.13/2.34 % --qbf_elim_univ true
% 2.13/2.34 % --qbf_sk_in true
% 2.13/2.34 % --qbf_pred_elim true
% 2.13/2.34 % --qbf_split 32
% 2.13/2.34
% 2.13/2.34 % ------ BMC1 Options
% 2.13/2.34
% 2.13/2.34 % --bmc1_incremental false
% 2.13/2.34 % --bmc1_axioms reachable_all
% 2.13/2.34 % --bmc1_min_bound 0
% 2.13/2.34 % --bmc1_max_bound -1
% 2.13/2.34 % --bmc1_max_bound_default -1
% 2.13/2.34 % --bmc1_symbol_reachability true
% 2.13/2.34 % --bmc1_property_lemmas false
% 2.13/2.34 % --bmc1_k_induction false
% 2.13/2.34 % --bmc1_non_equiv_states false
% 2.13/2.34 % --bmc1_deadlock false
% 2.13/2.34 % --bmc1_ucm false
% 2.13/2.34 % --bmc1_add_unsat_core none
% 2.13/2.34 % --bmc1_unsat_core_children false
% 2.13/2.34 % --bmc1_unsat_core_extrapolate_axioms false
% 2.13/2.34 % --bmc1_out_stat full
% 2.13/2.34 % --bmc1_ground_init false
% 2.13/2.34 % --bmc1_pre_inst_next_state false
% 2.13/2.34 % --bmc1_pre_inst_state false
% 2.13/2.34 % --bmc1_pre_inst_reach_state false
% 2.13/2.34 % --bmc1_out_unsat_core false
% 2.13/2.34 % --bmc1_aig_witness_out false
% 2.13/2.34 % --bmc1_verbose false
% 2.13/2.34 % --bmc1_dump_clauses_tptp false
% 2.13/2.36 % --bmc1_dump_unsat_core_tptp false
% 2.13/2.36 % --bmc1_dump_file -
% 2.13/2.36 % --bmc1_ucm_expand_uc_limit 128
% 2.13/2.36 % --bmc1_ucm_n_expand_iterations 6
% 2.13/2.36 % --bmc1_ucm_extend_mode 1
% 2.13/2.36 % --bmc1_ucm_init_mode 2
% 2.13/2.36 % --bmc1_ucm_cone_mode none
% 2.13/2.36 % --bmc1_ucm_reduced_relation_type 0
% 2.13/2.36 % --bmc1_ucm_relax_model 4
% 2.13/2.36 % --bmc1_ucm_full_tr_after_sat true
% 2.13/2.36 % --bmc1_ucm_expand_neg_assumptions false
% 2.13/2.36 % --bmc1_ucm_layered_model none
% 2.13/2.36 % --bmc1_ucm_max_lemma_size 10
% 2.13/2.36
% 2.13/2.36 % ------ AIG Options
% 2.13/2.36
% 2.13/2.36 % --aig_mode false
% 2.13/2.36
% 2.13/2.36 % ------ Instantiation Options
% 2.13/2.36
% 2.13/2.36 % --instantiation_flag true
% 2.13/2.36 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.13/2.36 % --inst_solver_per_active 750
% 2.13/2.36 % --inst_solver_calls_frac 0.5
% 2.13/2.36 % --inst_passive_queue_type priority_queues
% 2.13/2.36 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.13/2.36 % --inst_passive_queues_freq [25;2]
% 2.13/2.36 % --inst_dismatching true
% 2.13/2.36 % --inst_eager_unprocessed_to_passive true
% 2.13/2.36 % --inst_prop_sim_given true
% 2.13/2.36 % --inst_prop_sim_new false
% 2.13/2.36 % --inst_orphan_elimination true
% 2.13/2.36 % --inst_learning_loop_flag true
% 2.13/2.36 % --inst_learning_start 3000
% 2.13/2.36 % --inst_learning_factor 2
% 2.13/2.36 % --inst_start_prop_sim_after_learn 3
% 2.13/2.36 % --inst_sel_renew solver
% 2.13/2.36 % --inst_lit_activity_flag true
% 2.13/2.36 % --inst_out_proof true
% 2.13/2.36
% 2.13/2.36 % ------ Resolution Options
% 2.13/2.36
% 2.13/2.36 % --resolution_flag true
% 2.13/2.36 % --res_lit_sel kbo_max
% 2.13/2.36 % --res_to_prop_solver none
% 2.13/2.36 % --res_prop_simpl_new false
% 2.13/2.36 % --res_prop_simpl_given false
% 2.13/2.36 % --res_passive_queue_type priority_queues
% 2.13/2.36 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.13/2.36 % --res_passive_queues_freq [15;5]
% 2.13/2.36 % --res_forward_subs full
% 2.13/2.36 % --res_backward_subs full
% 2.13/2.36 % --res_forward_subs_resolution true
% 2.13/2.36 % --res_backward_subs_resolution true
% 2.13/2.36 % --res_orphan_elimination false
% 2.13/2.36 % --res_time_limit 1000.
% 2.13/2.36 % --res_out_proof true
% 2.13/2.36 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_738b98.s
% 2.13/2.36 % --modulo true
% 2.13/2.36
% 2.13/2.36 % ------ Combination Options
% 2.13/2.36
% 2.13/2.36 % --comb_res_mult 1000
% 2.13/2.36 % --comb_inst_mult 300
% 2.13/2.36 % ------
% 2.13/2.36
% 2.13/2.36 % ------ Parsing...% successful
% 2.13/2.36
% 2.13/2.36 % ------ Preprocessing... gs_s sp: 12 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe_e snvd_s sp: 0 0s snvd_e %
% 2.13/2.36
% 2.13/2.36 % ------ Proving...
% 2.13/2.36 % ------ Problem Properties
% 2.13/2.36
% 2.13/2.36 %
% 2.13/2.36 % EPR false
% 2.13/2.36 % Horn false
% 2.13/2.36 % Has equality true
% 2.13/2.36
% 2.13/2.36 % % ------ Input Options Time Limit: Unbounded
% 2.13/2.36
% 2.13/2.36
% 2.13/2.36 % % ------ Current options:
% 2.13/2.36
% 2.13/2.36 % ------ Input Options
% 2.13/2.36
% 2.13/2.36 % --out_options all
% 2.13/2.36 % --tptp_safe_out true
% 2.13/2.36 % --problem_path ""
% 2.13/2.36 % --include_path ""
% 2.13/2.36 % --clausifier .//eprover
% 2.13/2.36 % --clausifier_options --tstp-format
% 2.13/2.36 % --stdin false
% 2.13/2.36 % --dbg_backtrace false
% 2.13/2.36 % --dbg_dump_prop_clauses false
% 2.13/2.36 % --dbg_dump_prop_clauses_file -
% 2.13/2.36 % --dbg_out_stat false
% 2.13/2.36
% 2.13/2.36 % ------ General Options
% 2.13/2.36
% 2.13/2.36 % --fof false
% 2.13/2.36 % --time_out_real 150.
% 2.13/2.36 % --time_out_prep_mult 0.2
% 2.13/2.36 % --time_out_virtual -1.
% 2.13/2.36 % --schedule none
% 2.13/2.36 % --ground_splitting input
% 2.13/2.36 % --splitting_nvd 16
% 2.13/2.36 % --non_eq_to_eq false
% 2.13/2.36 % --prep_gs_sim true
% 2.13/2.36 % --prep_unflatten false
% 2.13/2.36 % --prep_res_sim true
% 2.13/2.36 % --prep_upred true
% 2.13/2.36 % --res_sim_input true
% 2.13/2.36 % --clause_weak_htbl true
% 2.13/2.36 % --gc_record_bc_elim false
% 2.13/2.36 % --symbol_type_check false
% 2.13/2.36 % --clausify_out false
% 2.13/2.36 % --large_theory_mode false
% 2.13/2.36 % --prep_sem_filter none
% 2.13/2.36 % --prep_sem_filter_out false
% 2.13/2.36 % --preprocessed_out false
% 2.13/2.36 % --sub_typing false
% 2.13/2.36 % --brand_transform false
% 2.13/2.36 % --pure_diseq_elim true
% 2.13/2.36 % --min_unsat_core false
% 2.13/2.36 % --pred_elim true
% 2.13/2.36 % --add_important_lit false
% 2.13/2.36 % --soft_assumptions false
% 2.13/2.36 % --reset_solvers false
% 2.13/2.36 % --bc_imp_inh []
% 2.13/2.36 % --conj_cone_tolerance 1.5
% 2.13/2.36 % --prolific_symb_bound 500
% 2.13/2.36 % --lt_threshold 2000
% 2.13/2.36
% 2.13/2.36 % ------ SAT Options
% 2.13/2.36
% 2.13/2.36 % --sat_mode false
% 2.13/2.36 % --sat_fm_restart_options ""
% 2.13/2.36 % --sat_gr_def false
% 2.13/2.36 % --sat_epr_types true
% 2.13/2.36 % --sat_non_cyclic_types false
% 2.13/2.36 % --sat_finite_models false
% 2.13/2.36 % --sat_fm_lemmas false
% 2.13/2.36 % --sat_fm_prep false
% 2.13/2.36 % --sat_fm_uc_incr true
% 2.13/2.36 % --sat_out_model small
% 2.13/2.36 % --sat_out_clauses false
% 2.13/2.36
% 2.13/2.36 % ------ QBF Options
% 2.13/2.36
% 2.13/2.36 % --qbf_mode false
% 2.13/2.36 % --qbf_elim_univ true
% 2.13/2.36 % --qbf_sk_in true
% 2.13/2.36 % --qbf_pred_elim true
% 2.13/2.36 % --qbf_split 32
% 2.13/2.36
% 2.13/2.36 % ------ BMC1 Options
% 2.13/2.36
% 2.13/2.36 % --bmc1_incremental false
% 2.13/2.36 % --bmc1_axioms reachable_all
% 2.13/2.36 % --bmc1_min_bound 0
% 2.13/2.36 % --bmc1_max_bound -1
% 2.13/2.36 % --bmc1_max_bound_default -1
% 2.13/2.36 % --bmc1_symbol_reachability true
% 2.13/2.36 % --bmc1_property_lemmas false
% 2.13/2.36 % --bmc1_k_induction false
% 2.13/2.36 % --bmc1_non_equiv_states false
% 2.13/2.36 % --bmc1_deadlock false
% 2.13/2.36 % --bmc1_ucm false
% 2.13/2.36 % --bmc1_add_unsat_core none
% 2.13/2.36 % --bmc1_unsat_core_children false
% 2.13/2.36 % --bmc1_unsat_core_extrapolate_axioms false
% 2.13/2.36 % --bmc1_out_stat full
% 2.13/2.36 % --bmc1_ground_init false
% 2.13/2.36 % --bmc1_pre_inst_next_state false
% 2.13/2.36 % --bmc1_pre_inst_state false
% 2.13/2.36 % --bmc1_pre_inst_reach_state false
% 2.13/2.36 % --bmc1_out_unsat_core false
% 2.13/2.36 % --bmc1_aig_witness_out false
% 2.13/2.36 % --bmc1_verbose false
% 2.13/2.36 % --bmc1_dump_clauses_tptp false
% 2.13/2.36 % --bmc1_dump_unsat_core_tptp false
% 2.13/2.36 % --bmc1_dump_file -
% 2.13/2.36 % --bmc1_ucm_expand_uc_limit 128
% 2.13/2.36 % --bmc1_ucm_n_expand_iterations 6
% 2.13/2.36 % --bmc1_ucm_extend_mode 1
% 2.13/2.36 % --bmc1_ucm_init_mode 2
% 2.13/2.36 % --bmc1_ucm_cone_mode none
% 2.13/2.36 % --bmc1_ucm_reduced_relation_type 0
% 2.13/2.36 % --bmc1_ucm_relax_model 4
% 2.13/2.36 % --bmc1_ucm_full_tr_after_sat true
% 2.13/2.36 % --bmc1_ucm_expand_neg_assumptions false
% 2.13/2.36 % --bmc1_ucm_layered_model none
% 2.13/2.36 % --bmc1_ucm_max_lemma_size 10
% 2.13/2.36
% 2.13/2.36 % ------ AIG Options
% 2.13/2.36
% 2.13/2.36 % --aig_mode false
% 2.13/2.36
% 2.13/2.36 % ------ Instantiation Options
% 2.13/2.36
% 2.13/2.36 % --instantiation_flag true
% 2.13/2.36 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.13/2.36 % --inst_solver_per_active 750
% 2.13/2.36 % --inst_solver_calls_frac 0.5
% 2.13/2.36 % --inst_passive_queue_type priority_queues
% 2.13/2.36 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.13/2.36 % --inst_passive_queues_freq [25;2]
% 2.13/2.36 % --inst_dismatching true
% 2.13/2.36 % --inst_eager_unprocessed_to_passive true
% 2.13/2.36 % --inst_prop_sim_given true
% 26.18/26.37 % --inst_prop_sim_new false
% 26.18/26.37 % --inst_orphan_elimination true
% 26.18/26.37 % --inst_learning_loop_flag true
% 26.18/26.37 % --inst_learning_start 3000
% 26.18/26.37 % --inst_learning_factor 2
% 26.18/26.37 % --inst_start_prop_sim_after_learn 3
% 26.18/26.37 % --inst_sel_renew solver
% 26.18/26.37 % --inst_lit_activity_flag true
% 26.18/26.37 % --inst_out_proof true
% 26.18/26.37
% 26.18/26.37 % ------ Resolution Options
% 26.18/26.37
% 26.18/26.37 % --resolution_flag true
% 26.18/26.37 % --res_lit_sel kbo_max
% 26.18/26.37 % --res_to_prop_solver none
% 26.18/26.37 % --res_prop_simpl_new false
% 26.18/26.37 % --res_prop_simpl_given false
% 26.18/26.37 % --res_passive_queue_type priority_queues
% 26.18/26.37 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 26.18/26.37 % --res_passive_queues_freq [15;5]
% 26.18/26.37 % --res_forward_subs full
% 26.18/26.37 % --res_backward_subs full
% 26.18/26.37 % --res_forward_subs_resolution true
% 26.18/26.37 % --res_backward_subs_resolution true
% 26.18/26.37 % --res_orphan_elimination false
% 26.18/26.37 % --res_time_limit 1000.
% 26.18/26.37 % --res_out_proof true
% 26.18/26.37 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_738b98.s
% 26.18/26.37 % --modulo true
% 26.18/26.37
% 26.18/26.37 % ------ Combination Options
% 26.18/26.37
% 26.18/26.37 % --comb_res_mult 1000
% 26.18/26.37 % --comb_inst_mult 300
% 26.18/26.37 % ------
% 26.18/26.37
% 26.18/26.37
% 26.18/26.37
% 26.18/26.37 % ------ Proving...
% 26.18/26.37 % warning: shown sat in sat incomplete mode
% 26.18/26.37 %
% 26.18/26.37
% 26.18/26.37
% 26.18/26.37 ------ Building Model...Done
% 26.18/26.37
% 26.18/26.37 %------ The model is defined over ground terms (initial term algebra).
% 26.18/26.37 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 26.18/26.37 %------ where \phi is a formula over the term algebra.
% 26.18/26.37 %------ If we have equality in the problem then it is also defined as a predicate above,
% 26.18/26.37 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 26.18/26.37 %------ See help for --sat_out_model for different model outputs.
% 26.18/26.37 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 26.18/26.37 %------ where the first argument stands for the sort ($i in the unsorted case)
% 26.18/26.37
% 26.18/26.37
% 26.18/26.37
% 26.18/26.37
% 26.18/26.37 %------ Negative definition of equality_sorted
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X0,X1] :
% 26.18/26.37 ( ~(equality_sorted(X0,X0,X1)) <=>
% 26.18/26.37 $false
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of state
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( state(X0,X1) <=>
% 26.18/26.37 $false
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of eventuality
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( eventuality(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 ? [X2] :
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skf2(X2) )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc7 )
% 26.18/26.37 &
% 26.18/26.37 ( X0!=skc5 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of thing
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( thing(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 ? [X2] :
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skf2(X2) )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of singleton
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( singleton(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 ? [X2] :
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skf2(X2) )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of specific
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( specific(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 ? [X2] :
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skf2(X2) )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 &
% 26.18/26.37 ( X0!=skc5 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of nonexistent
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( nonexistent(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 ? [X2] :
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skf2(X2) )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of unisex
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( unisex(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 ? [X2] :
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skf2(X2) )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of event
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( event(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 ? [X2] :
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skf2(X2) )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of man
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( man(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 &
% 26.18/26.37 ( X0!=skc6 )
% 26.18/26.37 &
% 26.18/26.37 ( X0!=skc5 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of human_person
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( human_person(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of organism
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( organism(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of entity
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( entity(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of existent
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( existent(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of impartial
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( impartial(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of living
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( living(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of human
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( human(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of animate
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( animate(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of male
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( male(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of forename
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( forename(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of relname
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( relname(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of relation
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( relation(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of abstraction
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( abstraction(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of nonhuman
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( nonhuman(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of general
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( general(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of jules_forename
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( jules_forename(X0,X1) <=>
% 26.18/26.37 $false
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of smoke
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( smoke(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 ? [X2] :
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skf2(X2) )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of proposition
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( proposition(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of vincent_forename
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( vincent_forename(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc8 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of accessible_world
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( accessible_world(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of present
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( present(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 ? [X2] :
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skf2(X2) )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of think_believe_consider
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1] :
% 26.18/26.37 ( think_believe_consider(X0,X1) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X1=skc7 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of of
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1,X2] :
% 26.18/26.37 ( of(X0,X1,X2) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc8 & X2=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc8 & X2=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of agent
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1,X2] :
% 26.18/26.37 ( agent(X0,X1,X2) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc7 & X2=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skf2(skc9) & X2=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc7 & X2=skc9 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of theme
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1,X2] :
% 26.18/26.37 ( theme(X0,X1,X2) <=>
% 26.18/26.37 (
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc6 & X1=skc7 & X2=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 |
% 26.18/26.37 (
% 26.18/26.37 ( X0=skc5 & X1=skc7 & X2=skc6 )
% 26.18/26.37 )
% 26.18/26.37
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of be
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0,X1,X2,X3] :
% 26.18/26.37 ( be(X0,X1,X2,X3) <=>
% 26.18/26.37 $false
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Negative definition of actual_world
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 (! [X0] :
% 26.18/26.37 ( ~(actual_world(X0)) <=>
% 26.18/26.37 $false
% 26.18/26.37 )
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37 %------ Positive definition of sP1_iProver_split
% 26.18/26.37 fof(lit_def,axiom,
% 26.18/26.37 ( sP1_iProver_split <=>
% 26.18/26.37 $false
% 26.18/26.37 )
% 26.18/26.37 ).
% 26.18/26.37
% 26.18/26.37
% 26.18/26.37
% 26.18/26.37 % ------ Statistics
% 26.18/26.37
% 26.18/26.37 % ------ General
% 26.18/26.37
% 26.18/26.37 % num_of_input_clauses: 205
% 26.18/26.37 % num_of_input_neg_conjectures: 18
% 26.18/26.37 % num_of_splits: 12
% 26.18/26.37 % num_of_split_atoms: 4
% 26.18/26.37 % num_of_sem_filtered_clauses: 0
% 26.18/26.37 % num_of_subtypes: 0
% 26.18/26.37 % monotx_restored_types: 0
% 26.18/26.37 % sat_num_of_epr_types: 0
% 26.18/26.37 % sat_num_of_non_cyclic_types: 0
% 26.18/26.37 % sat_guarded_non_collapsed_types: 0
% 26.18/26.37 % is_epr: 0
% 26.18/26.37 % is_horn: 0
% 26.18/26.37 % has_eq: 1
% 26.18/26.37 % num_pure_diseq_elim: 0
% 26.18/26.37 % simp_replaced_by: 0
% 26.18/26.37 % res_preprocessed: 48
% 26.18/26.37 % prep_upred: 0
% 26.18/26.37 % prep_unflattend: 0
% 26.18/26.37 % pred_elim_cands: 4
% 26.18/26.37 % pred_elim: 3
% 26.18/26.37 % pred_elim_cl: 3
% 26.18/26.37 % pred_elim_cycles: 4
% 26.18/26.37 % forced_gc_time: 0
% 26.18/26.37 % gc_basic_clause_elim: 0
% 26.18/26.37 % parsing_time: 0.003
% 26.18/26.37 % sem_filter_time: 0.
% 26.18/26.37 % pred_elim_time: 0.
% 26.18/26.37 % out_proof_time: 0.
% 26.18/26.37 % monotx_time: 0.
% 26.18/26.37 % subtype_inf_time: 0.
% 26.18/26.37 % unif_index_cands_time: 0.007
% 26.18/26.37 % unif_index_add_time: 0.012
% 26.18/26.37 % total_time: 24.035
% 26.18/26.37 % num_of_symbols: 72
% 26.18/26.37 % num_of_terms: 9266
% 26.18/26.37
% 26.18/26.37 % ------ Propositional Solver
% 26.18/26.37
% 26.18/26.37 % prop_solver_calls: 8
% 26.18/26.37 % prop_fast_solver_calls: 227
% 26.18/26.37 % prop_num_of_clauses: 695
% 26.18/26.37 % prop_preprocess_simplified: 2276
% 26.18/26.37 % prop_fo_subsumed: 0
% 26.18/26.37 % prop_solver_time: 0.
% 26.18/26.37 % prop_fast_solver_time: 0.
% 26.18/26.37 % prop_unsat_core_time: 0.
% 26.18/26.37
% 26.18/26.37 % ------ QBF
% 26.18/26.37
% 26.18/26.37 % qbf_q_res: 0
% 26.18/26.37 % qbf_num_tautologies: 0
% 26.18/26.37 % qbf_prep_cycles: 0
% 26.18/26.37
% 26.18/26.37 % ------ BMC1
% 26.18/26.37
% 26.18/26.37 % bmc1_current_bound: -1
% 26.18/26.37 % bmc1_last_solved_bound: -1
% 26.18/26.37 % bmc1_unsat_core_size: -1
% 26.18/26.37 % bmc1_unsat_core_parents_size: -1
% 26.18/26.37 % bmc1_merge_next_fun: 0
% 26.18/26.37 % bmc1_unsat_core_clauses_time: 0.
% 26.18/26.37
% 26.18/26.37 % ------ Instantiation
% 26.18/26.37
% 26.18/26.37 % inst_num_of_clauses: 661
% 26.18/26.37 % inst_num_in_passive: 0
% 26.18/26.37 % inst_num_in_active: 659
% 26.18/26.37 % inst_num_in_unprocessed: 0
% 26.18/26.37 % inst_num_of_loops: 672
% 26.18/26.37 % inst_num_of_learning_restarts: 0
% 26.18/26.37 % inst_num_moves_active_passive: 3
% 26.18/26.37 % inst_lit_activity: 72
% 26.18/26.37 % inst_lit_activity_moves: 0
% 26.18/26.37 % inst_num_tautologies: 2
% 26.18/26.37 % inst_num_prop_implied: 0
% 26.18/26.37 % inst_num_existing_simplified: 0
% 26.18/26.37 % inst_num_eq_res_simplified: 0
% 26.18/26.37 % inst_num_child_elim: 0
% 26.18/26.37 % inst_num_of_dismatching_blockings: 42
% 26.18/26.37 % inst_num_of_non_proper_insts: 1292
% 26.18/26.37 % inst_num_of_duplicates: 301
% 26.18/26.37 % inst_inst_num_from_inst_to_res: 0
% 26.18/26.37 % inst_dismatching_checking_time: 0.
% 26.18/26.37
% 26.18/26.37 % ------ Resolution
% 26.18/26.37
% 26.18/26.37 % res_num_of_clauses: 2608
% 26.18/26.37 % res_num_in_passive: 19
% 26.18/26.37 % res_num_in_active: 2477
% 26.18/26.37 % res_num_of_loops: 3000
% 26.18/26.37 % res_forward_subset_subsumed: 1046
% 26.18/26.37 % res_backward_subset_subsumed: 4
% 26.18/26.37 % res_forward_subsumed: 628
% 26.18/26.37 % res_backward_subsumed: 0
% 26.18/26.37 % res_forward_subsumption_resolution: 21
% 26.18/26.37 % res_backward_subsumption_resolution: 6
% 26.18/26.37 % res_clause_to_clause_subsumption: 353970
% 26.18/26.37 % res_orphan_elimination: 0
% 26.18/26.37 % res_tautology_del: 0
% 26.18/26.37 % res_num_eq_res_simplified: 0
% 26.18/26.37 % res_num_sel_changes: 0
% 26.18/26.37 % res_moves_from_active_to_pass: 0
% 26.18/26.37
% 26.18/26.37 % Status Unknown
% 26.18/26.37 % Last status :
% 26.18/26.37 % SZS status Unknown
%------------------------------------------------------------------------------