TSTP Solution File: NLP256-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP256-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n019.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:44:24 EDT 2022
% Result : Unknown 164.60s 164.79s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NLP256-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 1 02:21:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % Orientation found
% 0.20/0.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d3a938.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_c5a4aa.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_254820 | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.52 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.52 % --bmc1_dump_file -
% 0.20/0.52 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.52 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.52 % --bmc1_ucm_extend_mode 1
% 0.20/0.52 % --bmc1_ucm_init_mode 2
% 0.20/0.52 % --bmc1_ucm_cone_mode none
% 0.20/0.52 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.52 % --bmc1_ucm_relax_model 4
% 0.20/0.52 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.52 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.52 % --bmc1_ucm_layered_model none
% 0.20/0.52 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.52
% 0.20/0.52 % ------ AIG Options
% 0.20/0.52
% 0.20/0.52 % --aig_mode false
% 0.20/0.52
% 0.20/0.52 % ------ Instantiation Options
% 0.20/0.52
% 0.20/0.52 % --instantiation_flag true
% 0.20/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.52 % --inst_solver_per_active 750
% 0.20/0.52 % --inst_solver_calls_frac 0.5
% 0.20/0.52 % --inst_passive_queue_type priority_queues
% 0.20/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.52 % --inst_passive_queues_freq [25;2]
% 0.20/0.52 % --inst_dismatching true
% 0.20/0.52 % --inst_eager_unprocessed_to_passive true
% 0.20/0.52 % --inst_prop_sim_given true
% 0.20/0.52 % --inst_prop_sim_new false
% 0.20/0.52 % --inst_orphan_elimination true
% 0.20/0.52 % --inst_learning_loop_flag true
% 0.20/0.52 % --inst_learning_start 3000
% 0.20/0.52 % --inst_learning_factor 2
% 0.20/0.52 % --inst_start_prop_sim_after_learn 3
% 0.20/0.52 % --inst_sel_renew solver
% 0.20/0.52 % --inst_lit_activity_flag true
% 0.20/0.52 % --inst_out_proof true
% 0.20/0.52
% 0.20/0.52 % ------ Resolution Options
% 0.20/0.52
% 0.20/0.52 % --resolution_flag true
% 0.20/0.52 % --res_lit_sel kbo_max
% 0.20/0.52 % --res_to_prop_solver none
% 0.20/0.52 % --res_prop_simpl_new false
% 0.20/0.52 % --res_prop_simpl_given false
% 0.20/0.52 % --res_passive_queue_type priority_queues
% 0.20/0.52 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.52 % --res_passive_queues_freq [15;5]
% 0.20/0.52 % --res_forward_subs full
% 0.20/0.52 % --res_backward_subs full
% 0.20/0.52 % --res_forward_subs_resolution true
% 0.20/0.52 % --res_backward_subs_resolution true
% 0.20/0.52 % --res_orphan_elimination false
% 0.20/0.52 % --res_time_limit 1000.
% 0.20/0.52 % --res_out_proof true
% 0.20/0.52 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d3a938.s
% 0.20/0.52 % --modulo true
% 0.20/0.52
% 0.20/0.52 % ------ Combination Options
% 0.20/0.52
% 0.20/0.52 % --comb_res_mult 1000
% 0.20/0.52 % --comb_inst_mult 300
% 0.20/0.52 % ------
% 0.20/0.52
% 0.20/0.52 % ------ Parsing...% successful
% 0.20/0.52
% 0.20/0.52 % ------ Preprocessing... gs_s sp: 12 0s gs_e snvd_s sp: 12 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 4 0s snvd_e %
% 0.20/0.52
% 0.20/0.52 % ------ Proving...
% 0.20/0.52 % ------ Problem Properties
% 0.20/0.52
% 0.20/0.52 %
% 0.20/0.52 % EPR false
% 0.20/0.52 % Horn false
% 0.20/0.52 % Has equality true
% 0.20/0.52
% 0.20/0.52 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 % % ------ Current options:
% 0.20/0.52
% 0.20/0.52 % ------ Input Options
% 0.20/0.52
% 0.20/0.52 % --out_options all
% 0.20/0.52 % --tptp_safe_out true
% 0.20/0.52 % --problem_path ""
% 0.20/0.52 % --include_path ""
% 0.20/0.52 % --clausifier .//eprover
% 0.20/0.52 % --clausifier_options --tstp-format
% 0.20/0.52 % --stdin false
% 0.20/0.52 % --dbg_backtrace false
% 0.20/0.52 % --dbg_dump_prop_clauses false
% 0.20/0.52 % --dbg_dump_prop_clauses_file -
% 0.20/0.52 % --dbg_out_stat false
% 0.20/0.52
% 0.20/0.52 % ------ General Options
% 0.20/0.52
% 0.20/0.52 % --fof false
% 0.20/0.52 % --time_out_real 150.
% 0.20/0.52 % --time_out_prep_mult 0.2
% 0.20/0.52 % --time_out_virtual -1.
% 0.20/0.52 % --schedule none
% 0.20/0.52 % --ground_splitting input
% 0.20/0.52 % --splitting_nvd 16
% 0.20/0.52 % --non_eq_to_eq false
% 0.20/0.52 % --prep_gs_sim true
% 0.20/0.52 % --prep_unflatten false
% 0.20/0.52 % --prep_res_sim true
% 0.20/0.52 % --prep_upred true
% 0.20/0.52 % --res_sim_input true
% 0.20/0.52 % --clause_weak_htbl true
% 0.20/0.52 % --gc_record_bc_elim false
% 0.20/0.52 % --symbol_type_check false
% 0.20/0.52 % --clausify_out false
% 0.20/0.52 % --large_theory_mode false
% 0.20/0.52 % --prep_sem_filter none
% 0.20/0.52 % --prep_sem_filter_out false
% 0.20/0.52 % --preprocessed_out false
% 0.20/0.52 % --sub_typing false
% 0.20/0.52 % --brand_transform false
% 0.20/0.52 % --pure_diseq_elim true
% 0.20/0.52 % --min_unsat_core false
% 0.20/0.52 % --pred_elim true
% 0.20/0.52 % --add_important_lit false
% 0.20/0.52 % --soft_assumptions false
% 0.20/0.52 % --reset_solvers false
% 0.20/0.52 % --bc_imp_inh []
% 0.20/0.52 % --conj_cone_tolerance 1.5
% 0.20/0.52 % --prolific_symb_bound 500
% 0.20/0.52 % --lt_threshold 2000
% 0.20/0.52
% 0.20/0.52 % ------ SAT Options
% 0.20/0.52
% 0.20/0.52 % --sat_mode false
% 0.20/0.52 % --sat_fm_restart_options ""
% 0.20/0.52 % --sat_gr_def false
% 0.20/0.52 % --sat_epr_types true
% 0.20/0.52 % --sat_non_cyclic_types false
% 0.20/0.52 % --sat_finite_models false
% 0.20/0.52 % --sat_fm_lemmas false
% 0.20/0.52 % --sat_fm_prep false
% 0.20/0.52 % --sat_fm_uc_incr true
% 0.20/0.52 % --sat_out_model small
% 0.20/0.52 % --sat_out_clauses false
% 0.20/0.52
% 0.20/0.52 % ------ QBF Options
% 0.20/0.52
% 0.20/0.52 % --qbf_mode false
% 0.20/0.52 % --qbf_elim_univ true
% 0.20/0.52 % --qbf_sk_in true
% 0.20/0.52 % --qbf_pred_elim true
% 0.20/0.52 % --qbf_split 32
% 0.20/0.52
% 0.20/0.52 % ------ BMC1 Options
% 0.20/0.52
% 0.20/0.52 % --bmc1_incremental false
% 0.20/0.52 % --bmc1_axioms reachable_all
% 0.20/0.52 % --bmc1_min_bound 0
% 0.20/0.52 % --bmc1_max_bound -1
% 0.20/0.52 % --bmc1_max_bound_default -1
% 0.20/0.52 % --bmc1_symbol_reachability true
% 0.20/0.52 % --bmc1_property_lemmas false
% 0.20/0.52 % --bmc1_k_induction false
% 0.20/0.52 % --bmc1_non_equiv_states false
% 0.20/0.52 % --bmc1_deadlock false
% 0.20/0.52 % --bmc1_ucm false
% 0.20/0.52 % --bmc1_add_unsat_core none
% 0.20/0.52 % --bmc1_unsat_core_children false
% 0.20/0.52 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.52 % --bmc1_out_stat full
% 0.20/0.52 % --bmc1_ground_init false
% 0.20/0.52 % --bmc1_pre_inst_next_state false
% 0.20/0.52 % --bmc1_pre_inst_state false
% 0.20/0.52 % --bmc1_pre_inst_reach_state false
% 0.20/0.52 % --bmc1_out_unsat_core false
% 0.20/0.52 % --bmc1_aig_witness_out false
% 0.20/0.52 % --bmc1_verbose false
% 0.20/0.52 % --bmc1_dump_clauses_tptp false
% 0.20/0.52 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.52 % --bmc1_dump_file -
% 0.20/0.52 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.52 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.52 % --bmc1_ucm_extend_mode 1
% 0.20/0.52 % --bmc1_ucm_init_mode 2
% 0.20/0.52 % --bmc1_ucm_cone_mode none
% 0.20/0.52 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.52 % --bmc1_ucm_relax_model 4
% 0.20/0.52 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.52 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.52 % --bmc1_ucm_layered_model none
% 0.20/0.52 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.52
% 0.20/0.52 % ------ AIG Options
% 0.20/0.52
% 0.20/0.52 % --aig_mode false
% 0.20/0.52
% 0.20/0.52 % ------ Instantiation Options
% 0.20/0.52
% 0.20/0.52 % --instantiation_flag true
% 0.20/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.52 % --inst_solver_per_active 750
% 0.20/0.52 % --inst_solver_calls_frac 0.5
% 0.20/0.52 % --inst_passive_queue_type priority_queues
% 0.20/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.52 % --inst_passive_queues_freq [25;2]
% 0.20/0.52 % --inst_dismatching true
% 0.20/0.52 % --inst_eager_unprocessed_to_passive true
% 14.50/14.72 % --inst_prop_sim_given true
% 14.50/14.72 % --inst_prop_sim_new false
% 14.50/14.72 % --inst_orphan_elimination true
% 14.50/14.72 % --inst_learning_loop_flag true
% 14.50/14.72 % --inst_learning_start 3000
% 14.50/14.72 % --inst_learning_factor 2
% 14.50/14.72 % --inst_start_prop_sim_after_learn 3
% 14.50/14.72 % --inst_sel_renew solver
% 14.50/14.72 % --inst_lit_activity_flag true
% 14.50/14.72 % --inst_out_proof true
% 14.50/14.72
% 14.50/14.72 % ------ Resolution Options
% 14.50/14.72
% 14.50/14.72 % --resolution_flag true
% 14.50/14.72 % --res_lit_sel kbo_max
% 14.50/14.72 % --res_to_prop_solver none
% 14.50/14.72 % --res_prop_simpl_new false
% 14.50/14.72 % --res_prop_simpl_given false
% 14.50/14.72 % --res_passive_queue_type priority_queues
% 14.50/14.72 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 14.50/14.72 % --res_passive_queues_freq [15;5]
% 14.50/14.72 % --res_forward_subs full
% 14.50/14.72 % --res_backward_subs full
% 14.50/14.72 % --res_forward_subs_resolution true
% 14.50/14.72 % --res_backward_subs_resolution true
% 14.50/14.72 % --res_orphan_elimination false
% 14.50/14.72 % --res_time_limit 1000.
% 14.50/14.72 % --res_out_proof true
% 14.50/14.72 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d3a938.s
% 14.50/14.72 % --modulo true
% 14.50/14.72
% 14.50/14.72 % ------ Combination Options
% 14.50/14.72
% 14.50/14.72 % --comb_res_mult 1000
% 14.50/14.72 % --comb_inst_mult 300
% 14.50/14.72 % ------
% 14.50/14.72
% 14.50/14.72
% 14.50/14.72
% 14.50/14.72 % ------ Proving...
% 14.50/14.72 % warning: shown sat in sat incomplete mode
% 14.50/14.72 %
% 14.50/14.72
% 14.50/14.72
% 14.50/14.72 ------ Building Model...Done
% 14.50/14.72
% 14.50/14.72 %------ The model is defined over ground terms (initial term algebra).
% 14.50/14.72 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 14.50/14.72 %------ where \phi is a formula over the term algebra.
% 14.50/14.72 %------ If we have equality in the problem then it is also defined as a predicate above,
% 14.50/14.72 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 14.50/14.72 %------ See help for --sat_out_model for different model outputs.
% 14.50/14.72 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 14.50/14.72 %------ where the first argument stands for the sort ($i in the unsorted case)
% 14.50/14.72
% 14.50/14.72
% 14.50/14.72
% 14.50/14.72
% 14.50/14.72 %------ Negative definition of equality_sorted
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X0,X1] :
% 14.50/14.72 ( ~(equality_sorted(X0,X0,X1)) <=>
% 14.50/14.72 $false
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of be
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2,X3] :
% 14.50/14.72 ( be(X0,X1,X2,X3) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc9 & X2=skc10 & X3=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc9 & X2=skc10 & X3=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of accessible_world
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( accessible_world(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of agent
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2] :
% 14.50/14.72 ( agent(X0,X1,X2) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc13 & X2=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skf2(skc15) & X2=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skf2(skc10) & X2=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc13 & X2=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of theme
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2] :
% 14.50/14.72 ( theme(X0,X1,X2) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc13 & X2=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc13 & X2=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of think_believe_consider
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( think_believe_consider(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of proposition
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( proposition(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of entity
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( entity(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of of
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2] :
% 14.50/14.72 ( of(X0,X1,X2) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc11 & X2=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc14 & X2=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc11 & X2=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc14 & X2=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of forename
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( forename(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc11 )
% 14.50/14.72 &
% 14.50/14.72 ( X0!=skc12 )
% 14.50/14.72 &
% 14.50/14.72 ( X0!=skc8 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc14 )
% 14.50/14.72 &
% 14.50/14.72 ( X0!=skc12 )
% 14.50/14.72 &
% 14.50/14.72 ( X0!=skc8 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of smoke
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( smoke(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 ? [X2] :
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skf2(X2) )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of event
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( event(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 ? [X2] :
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skf2(X2) )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc13 )
% 14.50/14.72 &
% 14.50/14.72 ( X0!=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of eventuality
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( eventuality(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 ? [X2] :
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skf2(X2) )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of thing
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( thing(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 ? [X2] :
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skf2(X2) )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of singleton
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( singleton(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 ? [X2] :
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skf2(X2) )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of specific
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( specific(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 ? [X2] :
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skf2(X2) )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of nonexistent
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( nonexistent(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 ? [X2] :
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skf2(X2) )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of unisex
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( unisex(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 ? [X2] :
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skf2(X2) )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of present
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( present(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 ? [X2] :
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skf2(X2) )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc13 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of relation
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( relation(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of abstraction
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( abstraction(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of nonhuman
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( nonhuman(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of general
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( general(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of state
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( state(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc9 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc9 )
% 14.50/14.72 &
% 14.50/14.72 ( X0!=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of man
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( man(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 &
% 14.50/14.72 ( X0!=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 &
% 14.50/14.72 ( X0!=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of human_person
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( human_person(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of organism
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( organism(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of existent
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( existent(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of impartial
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( impartial(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of living
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( living(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of human
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( human(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of animate
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( animate(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of male
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( male(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc10 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc15 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of relname
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( relname(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of vincent_forename
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( vincent_forename(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc14 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc14 )
% 14.50/14.72 &
% 14.50/14.72 ( X0!=skc12 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of jules_forename
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1] :
% 14.50/14.72 ( jules_forename(X0,X1) <=>
% 14.50/14.72 (
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc12 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X0=skc8 & X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 |
% 14.50/14.72 (
% 14.50/14.72 ( X1=skc11 )
% 14.50/14.72 )
% 14.50/14.72
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Negative definition of actual_world
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0] :
% 14.50/14.72 ( ~(actual_world(X0)) <=>
% 14.50/14.72 $false
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of sP0_iProver_split
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 ( sP0_iProver_split <=>
% 14.50/14.72 $false
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of sP4_iProver_split
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12] :
% 14.50/14.72 ( sP4_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12) <=>
% 14.50/14.72 $true
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of sP6_iProver_split
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2,X3,X4,X5,X6] :
% 14.50/14.72 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 14.50/14.72 $false
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of sP9_iProver_split
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2,X3] :
% 14.50/14.72 ( sP9_iProver_split(X0,X1,X2,X3) <=>
% 14.50/14.72 $false
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of sP10_iProver_split
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12] :
% 14.50/14.72 ( sP10_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12) <=>
% 14.50/14.72 $true
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of sP12_iProver_split
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2,X3,X4,X5,X6] :
% 14.50/14.72 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6) <=>
% 14.50/14.72 $false
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of sP15_iProver_split
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2,X3] :
% 14.50/14.72 ( sP15_iProver_split(X0,X1,X2,X3) <=>
% 14.50/14.72 $false
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of sP16_iProver_split
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12] :
% 14.50/14.72 ( sP16_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12) <=>
% 14.50/14.72 $true
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of sP17_iProver_split
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12] :
% 14.50/14.72 ( sP17_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12) <=>
% 14.50/14.72 $false
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of sP18_iProver_split
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12] :
% 14.50/14.72 ( sP18_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12) <=>
% 14.50/14.72 $true
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72 %------ Positive definition of sP19_iProver_split
% 14.50/14.72 fof(lit_def,axiom,
% 14.50/14.72 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12] :
% 14.50/14.72 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12) <=>
% 14.50/14.72 $false
% 14.50/14.72 )
% 14.50/14.72 )
% 14.50/14.72 ).
% 14.50/14.72
% 14.50/14.72
% 14.50/14.72
% 14.50/14.72 % ------ Statistics
% 14.50/14.72
% 14.50/14.72 % ------ General
% 14.50/14.72
% 14.50/14.72 % num_of_input_clauses: 211
% 14.50/14.72 % num_of_input_neg_conjectures: 24
% 14.50/14.72 % num_of_splits: 28
% 14.50/14.72 % num_of_split_atoms: 20
% 14.50/14.72 % num_of_sem_filtered_clauses: 0
% 14.50/14.72 % num_of_subtypes: 0
% 14.50/14.72 % monotx_restored_types: 0
% 14.50/14.72 % sat_num_of_epr_types: 0
% 14.50/14.72 % sat_num_of_non_cyclic_types: 0
% 14.50/14.72 % sat_guarded_non_collapsed_types: 0
% 14.50/14.72 % is_epr: 0
% 14.50/14.72 % is_horn: 0
% 14.50/14.72 % has_eq: 1
% 14.50/14.72 % num_pure_diseq_elim: 0
% 14.50/14.72 % simp_replaced_by: 0
% 14.50/14.72 % res_preprocessed: 72
% 14.50/14.72 % prep_upred: 0
% 14.50/14.72 % prep_unflattend: 156
% 14.50/14.72 % pred_elim_cands: 16
% 14.50/14.72 % pred_elim: 9
% 14.50/14.72 % pred_elim_cl: 11
% 14.50/14.72 % pred_elim_cycles: 22
% 14.50/14.72 % forced_gc_time: 0
% 14.50/14.72 % gc_basic_clause_elim: 0
% 14.50/14.72 % parsing_time: 0.008
% 14.50/14.72 % sem_filter_time: 0.
% 14.50/14.72 % pred_elim_time: 0.045
% 14.50/14.72 % out_proof_time: 0.
% 14.50/14.72 % monotx_time: 0.
% 14.50/14.72 % subtype_inf_time: 0.
% 14.50/14.72 % unif_index_cands_time: 0.008
% 14.50/14.72 % unif_index_add_time: 0.01
% 14.50/14.72 % total_time: 14.295
% 14.50/14.72 % num_of_symbols: 91
% 14.50/14.72 % num_of_terms: 16968
% 14.50/14.72
% 14.50/14.72 % ------ Propositional Solver
% 14.50/14.72
% 14.50/14.72 % prop_solver_calls: 11
% 14.50/14.72 % prop_fast_solver_calls: 938
% 14.50/14.72 % prop_num_of_clauses: 3860
% 14.50/14.72 % prop_preprocess_simplified: 6467
% 14.50/14.72 % prop_fo_subsumed: 4
% 14.50/14.72 % prop_solver_time: 0.
% 14.50/14.72 % prop_fast_solver_time: 0.002
% 14.50/14.72 % prop_unsat_core_time: 0.
% 14.50/14.72
% 14.50/14.72 % ------ QBF
% 14.50/14.72
% 14.50/14.72 % qbf_q_res: 0
% 14.50/14.72 % qbf_num_tautologies: 0
% 14.50/14.72 % qbf_prep_cycles: 0
% 14.50/14.72
% 14.50/14.72 % ------ BMC1
% 14.50/14.72
% 14.50/14.72 % bmc1_current_bound: -1
% 14.50/14.72 % bmc1_last_solved_bound: -1
% 14.50/14.72 % bmc1_unsat_core_size: -1
% 14.50/14.72 % bmc1_unsat_core_parents_size: -1
% 14.50/14.72 % bmc1_merge_next_fun: 0
% 14.50/14.72 % bmc1_unsat_core_clauses_time: 0.
% 14.50/14.72
% 14.50/14.72 % ------ Instantiation
% 14.50/14.72
% 14.50/14.72 % inst_num_of_clauses: 2497
% 14.50/14.72 % inst_num_in_passive: 0
% 14.50/14.72 % inst_num_in_active: 2494
% 14.50/14.72 % inst_num_in_unprocessed: 0
% 14.50/14.72 % inst_num_of_loops: 2512
% 14.50/14.72 % inst_num_of_learning_restarts: 0
% 14.50/14.72 % inst_num_moves_active_passive: 3
% 14.50/14.72 % inst_lit_activity: 360
% 14.50/14.72 % inst_lit_activity_moves: 0
% 14.50/14.72 % inst_num_tautologies: 3
% 14.50/14.72 % inst_num_prop_implied: 0
% 14.50/14.72 % inst_num_existing_simplified: 0
% 14.50/14.72 % inst_num_eq_res_simplified: 0
% 14.50/14.72 % inst_num_child_elim: 0
% 14.50/14.72 % inst_num_of_dismatching_blockings: 401
% 14.50/14.72 % inst_num_of_non_proper_insts: 3314
% 14.50/14.72 % inst_num_of_duplicates: 3673
% 14.50/14.72 % inst_inst_num_from_inst_to_res: 0
% 14.50/14.72 % inst_dismatching_checking_time: 0.001
% 14.50/14.72
% 14.50/14.72 % ------ Resolution
% 14.50/14.72
% 14.50/14.72 % res_num_of_clauses: 7692
% 14.50/14.72 % res_num_in_passive: 3014
% 14.50/14.72 % res_num_in_active: 4558
% 14.50/14.72 % res_num_of_loops: 9000
% 14.50/14.72 % res_forward_subset_subsumed: 4845
% 14.50/14.72 % res_backward_subset_subsumed: 8
% 14.50/14.72 % res_forward_subsumed: 2952
% 14.50/14.72 % res_backward_subsumed: 137
% 14.50/14.72 % res_forward_subsumption_resolution: 9807
% 14.50/14.72 % res_backward_subsumption_resolution: 4
% 14.50/14.72 % res_clause_to_clause_subsumption: 278791
% 14.50/14.72 % res_orphan_elimination: 0
% 14.50/14.72 % res_tautology_del: 0
% 14.50/14.72 % res_num_eq_res_simplified: 0
% 14.50/14.72 % res_num_sel_changes: 0
% 14.50/14.72 % res_moves_from_active_to_pass: 0
% 14.50/14.72
% 14.50/14.72 % Status Unknown
% 14.56/14.76 % Orienting using strategy ClausalAll
% 14.56/14.76 % Orientation found
% 14.56/14.76 % 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_d3a938.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_c5a4aa.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_e44e80 | grep -v "SZS"
% 14.56/14.78
% 14.56/14.78 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 14.56/14.78
% 14.56/14.78 %
% 14.56/14.78 % ------ iProver source info
% 14.56/14.78
% 14.56/14.78 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 14.56/14.78 % git: non_committed_changes: true
% 14.56/14.78 % git: last_make_outside_of_git: true
% 14.56/14.78
% 14.56/14.78 %
% 14.56/14.78 % ------ Input Options
% 14.56/14.78
% 14.56/14.78 % --out_options all
% 14.56/14.78 % --tptp_safe_out true
% 14.56/14.78 % --problem_path ""
% 14.56/14.78 % --include_path ""
% 14.56/14.78 % --clausifier .//eprover
% 14.56/14.78 % --clausifier_options --tstp-format
% 14.56/14.78 % --stdin false
% 14.56/14.78 % --dbg_backtrace false
% 14.56/14.78 % --dbg_dump_prop_clauses false
% 14.56/14.78 % --dbg_dump_prop_clauses_file -
% 14.56/14.78 % --dbg_out_stat false
% 14.56/14.78
% 14.56/14.78 % ------ General Options
% 14.56/14.78
% 14.56/14.78 % --fof false
% 14.56/14.78 % --time_out_real 150.
% 14.56/14.78 % --time_out_prep_mult 0.2
% 14.56/14.78 % --time_out_virtual -1.
% 14.56/14.78 % --schedule none
% 14.56/14.78 % --ground_splitting input
% 14.56/14.78 % --splitting_nvd 16
% 14.56/14.78 % --non_eq_to_eq false
% 14.56/14.78 % --prep_gs_sim true
% 14.56/14.78 % --prep_unflatten false
% 14.56/14.78 % --prep_res_sim true
% 14.56/14.78 % --prep_upred true
% 14.56/14.78 % --res_sim_input true
% 14.56/14.78 % --clause_weak_htbl true
% 14.56/14.78 % --gc_record_bc_elim false
% 14.56/14.78 % --symbol_type_check false
% 14.56/14.78 % --clausify_out false
% 14.56/14.78 % --large_theory_mode false
% 14.56/14.78 % --prep_sem_filter none
% 14.56/14.78 % --prep_sem_filter_out false
% 14.56/14.78 % --preprocessed_out false
% 14.56/14.78 % --sub_typing false
% 14.56/14.78 % --brand_transform false
% 14.56/14.78 % --pure_diseq_elim true
% 14.56/14.78 % --min_unsat_core false
% 14.56/14.78 % --pred_elim true
% 14.56/14.78 % --add_important_lit false
% 14.56/14.78 % --soft_assumptions false
% 14.56/14.78 % --reset_solvers false
% 14.56/14.78 % --bc_imp_inh []
% 14.56/14.78 % --conj_cone_tolerance 1.5
% 14.56/14.78 % --prolific_symb_bound 500
% 14.56/14.78 % --lt_threshold 2000
% 14.56/14.78
% 14.56/14.78 % ------ SAT Options
% 14.56/14.78
% 14.56/14.78 % --sat_mode false
% 14.56/14.78 % --sat_fm_restart_options ""
% 14.56/14.78 % --sat_gr_def false
% 14.56/14.78 % --sat_epr_types true
% 14.56/14.78 % --sat_non_cyclic_types false
% 14.56/14.78 % --sat_finite_models false
% 14.56/14.78 % --sat_fm_lemmas false
% 14.56/14.78 % --sat_fm_prep false
% 14.56/14.78 % --sat_fm_uc_incr true
% 14.56/14.78 % --sat_out_model small
% 14.56/14.78 % --sat_out_clauses false
% 14.56/14.78
% 14.56/14.78 % ------ QBF Options
% 14.56/14.78
% 14.56/14.78 % --qbf_mode false
% 14.56/14.78 % --qbf_elim_univ true
% 14.56/14.78 % --qbf_sk_in true
% 14.56/14.78 % --qbf_pred_elim true
% 14.56/14.78 % --qbf_split 32
% 14.56/14.78
% 14.56/14.78 % ------ BMC1 Options
% 14.56/14.78
% 14.56/14.78 % --bmc1_incremental false
% 14.56/14.78 % --bmc1_axioms reachable_all
% 14.56/14.78 % --bmc1_min_bound 0
% 14.56/14.78 % --bmc1_max_bound -1
% 14.56/14.78 % --bmc1_max_bound_default -1
% 14.56/14.78 % --bmc1_symbol_reachability true
% 14.56/14.78 % --bmc1_property_lemmas false
% 14.56/14.78 % --bmc1_k_induction false
% 14.56/14.78 % --bmc1_non_equiv_states false
% 14.56/14.78 % --bmc1_deadlock false
% 14.56/14.78 % --bmc1_ucm false
% 14.56/14.78 % --bmc1_add_unsat_core none
% 14.56/14.78 % --bmc1_unsat_core_children false
% 14.56/14.78 % --bmc1_unsat_core_extrapolate_axioms false
% 14.56/14.78 % --bmc1_out_stat full
% 14.56/14.78 % --bmc1_ground_init false
% 14.56/14.78 % --bmc1_pre_inst_next_state false
% 14.56/14.78 % --bmc1_pre_inst_state false
% 14.56/14.78 % --bmc1_pre_inst_reach_state false
% 14.56/14.78 % --bmc1_out_unsat_core false
% 14.56/14.78 % --bmc1_aig_witness_out false
% 14.56/14.78 % --bmc1_verbose false
% 14.56/14.78 % --bmc1_dump_clauses_tptp false
% 14.56/14.82 % --bmc1_dump_unsat_core_tptp false
% 14.56/14.82 % --bmc1_dump_file -
% 14.56/14.82 % --bmc1_ucm_expand_uc_limit 128
% 14.56/14.82 % --bmc1_ucm_n_expand_iterations 6
% 14.56/14.82 % --bmc1_ucm_extend_mode 1
% 14.56/14.82 % --bmc1_ucm_init_mode 2
% 14.56/14.82 % --bmc1_ucm_cone_mode none
% 14.56/14.82 % --bmc1_ucm_reduced_relation_type 0
% 14.56/14.82 % --bmc1_ucm_relax_model 4
% 14.56/14.82 % --bmc1_ucm_full_tr_after_sat true
% 14.56/14.82 % --bmc1_ucm_expand_neg_assumptions false
% 14.56/14.82 % --bmc1_ucm_layered_model none
% 14.56/14.82 % --bmc1_ucm_max_lemma_size 10
% 14.56/14.82
% 14.56/14.82 % ------ AIG Options
% 14.56/14.82
% 14.56/14.82 % --aig_mode false
% 14.56/14.82
% 14.56/14.82 % ------ Instantiation Options
% 14.56/14.82
% 14.56/14.82 % --instantiation_flag true
% 14.56/14.82 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 14.56/14.82 % --inst_solver_per_active 750
% 14.56/14.82 % --inst_solver_calls_frac 0.5
% 14.56/14.82 % --inst_passive_queue_type priority_queues
% 14.56/14.82 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 14.56/14.82 % --inst_passive_queues_freq [25;2]
% 14.56/14.82 % --inst_dismatching true
% 14.56/14.82 % --inst_eager_unprocessed_to_passive true
% 14.56/14.82 % --inst_prop_sim_given true
% 14.56/14.82 % --inst_prop_sim_new false
% 14.56/14.82 % --inst_orphan_elimination true
% 14.56/14.82 % --inst_learning_loop_flag true
% 14.56/14.82 % --inst_learning_start 3000
% 14.56/14.82 % --inst_learning_factor 2
% 14.56/14.82 % --inst_start_prop_sim_after_learn 3
% 14.56/14.82 % --inst_sel_renew solver
% 14.56/14.82 % --inst_lit_activity_flag true
% 14.56/14.82 % --inst_out_proof true
% 14.56/14.82
% 14.56/14.82 % ------ Resolution Options
% 14.56/14.82
% 14.56/14.82 % --resolution_flag true
% 14.56/14.82 % --res_lit_sel kbo_max
% 14.56/14.82 % --res_to_prop_solver none
% 14.56/14.82 % --res_prop_simpl_new false
% 14.56/14.82 % --res_prop_simpl_given false
% 14.56/14.82 % --res_passive_queue_type priority_queues
% 14.56/14.82 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 14.56/14.82 % --res_passive_queues_freq [15;5]
% 14.56/14.82 % --res_forward_subs full
% 14.56/14.82 % --res_backward_subs full
% 14.56/14.82 % --res_forward_subs_resolution true
% 14.56/14.82 % --res_backward_subs_resolution true
% 14.56/14.82 % --res_orphan_elimination false
% 14.56/14.82 % --res_time_limit 1000.
% 14.56/14.82 % --res_out_proof true
% 14.56/14.82 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d3a938.s
% 14.56/14.82 % --modulo true
% 14.56/14.82
% 14.56/14.82 % ------ Combination Options
% 14.56/14.82
% 14.56/14.82 % --comb_res_mult 1000
% 14.56/14.82 % --comb_inst_mult 300
% 14.56/14.82 % ------
% 14.56/14.82
% 14.56/14.82 % ------ Parsing...% successful
% 14.56/14.82
% 14.56/14.82 % ------ Preprocessing... gs_s sp: 12 0s gs_e snvd_s sp: 12 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 4 0s snvd_e %
% 14.56/14.82
% 14.56/14.82 % ------ Proving...
% 14.56/14.82 % ------ Problem Properties
% 14.56/14.82
% 14.56/14.82 %
% 14.56/14.82 % EPR false
% 14.56/14.82 % Horn false
% 14.56/14.82 % Has equality true
% 14.56/14.82
% 14.56/14.82 % % ------ Input Options Time Limit: Unbounded
% 14.56/14.82
% 14.56/14.82
% 14.56/14.82 % % ------ Current options:
% 14.56/14.82
% 14.56/14.82 % ------ Input Options
% 14.56/14.82
% 14.56/14.82 % --out_options all
% 14.56/14.82 % --tptp_safe_out true
% 14.56/14.82 % --problem_path ""
% 14.56/14.82 % --include_path ""
% 14.56/14.82 % --clausifier .//eprover
% 14.56/14.82 % --clausifier_options --tstp-format
% 14.56/14.82 % --stdin false
% 14.56/14.82 % --dbg_backtrace false
% 14.56/14.82 % --dbg_dump_prop_clauses false
% 14.56/14.82 % --dbg_dump_prop_clauses_file -
% 14.56/14.82 % --dbg_out_stat false
% 14.56/14.82
% 14.56/14.82 % ------ General Options
% 14.56/14.82
% 14.56/14.82 % --fof false
% 14.56/14.82 % --time_out_real 150.
% 14.56/14.82 % --time_out_prep_mult 0.2
% 14.56/14.82 % --time_out_virtual -1.
% 14.56/14.82 % --schedule none
% 14.56/14.82 % --ground_splitting input
% 14.56/14.82 % --splitting_nvd 16
% 14.56/14.82 % --non_eq_to_eq false
% 14.56/14.82 % --prep_gs_sim true
% 14.56/14.82 % --prep_unflatten false
% 14.56/14.82 % --prep_res_sim true
% 14.56/14.82 % --prep_upred true
% 14.56/14.82 % --res_sim_input true
% 14.56/14.82 % --clause_weak_htbl true
% 14.56/14.82 % --gc_record_bc_elim false
% 14.56/14.82 % --symbol_type_check false
% 14.56/14.82 % --clausify_out false
% 14.56/14.82 % --large_theory_mode false
% 14.56/14.82 % --prep_sem_filter none
% 14.56/14.82 % --prep_sem_filter_out false
% 14.56/14.82 % --preprocessed_out false
% 14.56/14.82 % --sub_typing false
% 14.56/14.82 % --brand_transform false
% 14.56/14.82 % --pure_diseq_elim true
% 14.56/14.82 % --min_unsat_core false
% 14.56/14.82 % --pred_elim true
% 14.56/14.82 % --add_important_lit false
% 14.56/14.82 % --soft_assumptions false
% 14.56/14.82 % --reset_solvers false
% 14.56/14.82 % --bc_imp_inh []
% 14.56/14.82 % --conj_cone_tolerance 1.5
% 14.56/14.82 % --prolific_symb_bound 500
% 14.56/14.82 % --lt_threshold 2000
% 14.56/14.82
% 14.56/14.82 % ------ SAT Options
% 14.56/14.82
% 14.56/14.82 % --sat_mode false
% 14.56/14.82 % --sat_fm_restart_options ""
% 14.56/14.82 % --sat_gr_def false
% 14.56/14.82 % --sat_epr_types true
% 14.56/14.82 % --sat_non_cyclic_types false
% 14.56/14.82 % --sat_finite_models false
% 14.56/14.82 % --sat_fm_lemmas false
% 14.56/14.82 % --sat_fm_prep false
% 14.56/14.82 % --sat_fm_uc_incr true
% 14.56/14.82 % --sat_out_model small
% 14.56/14.82 % --sat_out_clauses false
% 14.56/14.82
% 14.56/14.82 % ------ QBF Options
% 14.56/14.82
% 14.56/14.82 % --qbf_mode false
% 14.56/14.82 % --qbf_elim_univ true
% 14.56/14.82 % --qbf_sk_in true
% 14.56/14.82 % --qbf_pred_elim true
% 14.56/14.82 % --qbf_split 32
% 14.56/14.82
% 14.56/14.82 % ------ BMC1 Options
% 14.56/14.82
% 14.56/14.82 % --bmc1_incremental false
% 14.56/14.82 % --bmc1_axioms reachable_all
% 14.56/14.82 % --bmc1_min_bound 0
% 14.56/14.82 % --bmc1_max_bound -1
% 14.56/14.82 % --bmc1_max_bound_default -1
% 14.56/14.82 % --bmc1_symbol_reachability true
% 14.56/14.82 % --bmc1_property_lemmas false
% 14.56/14.82 % --bmc1_k_induction false
% 14.56/14.82 % --bmc1_non_equiv_states false
% 14.56/14.82 % --bmc1_deadlock false
% 14.56/14.82 % --bmc1_ucm false
% 14.56/14.82 % --bmc1_add_unsat_core none
% 14.56/14.82 % --bmc1_unsat_core_children false
% 14.56/14.82 % --bmc1_unsat_core_extrapolate_axioms false
% 14.56/14.82 % --bmc1_out_stat full
% 14.56/14.82 % --bmc1_ground_init false
% 14.56/14.82 % --bmc1_pre_inst_next_state false
% 14.56/14.82 % --bmc1_pre_inst_state false
% 14.56/14.82 % --bmc1_pre_inst_reach_state false
% 14.56/14.82 % --bmc1_out_unsat_core false
% 14.56/14.82 % --bmc1_aig_witness_out false
% 14.56/14.82 % --bmc1_verbose false
% 14.56/14.82 % --bmc1_dump_clauses_tptp false
% 14.56/14.82 % --bmc1_dump_unsat_core_tptp false
% 14.56/14.82 % --bmc1_dump_file -
% 14.56/14.82 % --bmc1_ucm_expand_uc_limit 128
% 14.56/14.82 % --bmc1_ucm_n_expand_iterations 6
% 14.56/14.82 % --bmc1_ucm_extend_mode 1
% 14.56/14.82 % --bmc1_ucm_init_mode 2
% 14.56/14.82 % --bmc1_ucm_cone_mode none
% 14.56/14.82 % --bmc1_ucm_reduced_relation_type 0
% 14.56/14.82 % --bmc1_ucm_relax_model 4
% 14.56/14.82 % --bmc1_ucm_full_tr_after_sat true
% 14.56/14.82 % --bmc1_ucm_expand_neg_assumptions false
% 14.56/14.82 % --bmc1_ucm_layered_model none
% 14.56/14.82 % --bmc1_ucm_max_lemma_size 10
% 14.56/14.82
% 14.56/14.82 % ------ AIG Options
% 14.56/14.82
% 14.56/14.82 % --aig_mode false
% 14.56/14.82
% 14.56/14.82 % ------ Instantiation Options
% 14.56/14.82
% 14.56/14.82 % --instantiation_flag true
% 14.56/14.82 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 14.56/14.82 % --inst_solver_per_active 750
% 14.56/14.82 % --inst_solver_calls_frac 0.5
% 14.56/14.82 % --inst_passive_queue_type priority_queues
% 14.56/14.82 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 14.56/14.82 % --inst_passive_queues_freq [25;2]
% 14.56/14.82 % --inst_dismatching true
% 14.56/14.82 % --inst_eager_unprocessed_to_passive true
% 164.60/164.78 % --inst_prop_sim_given true
% 164.60/164.78 % --inst_prop_sim_new false
% 164.60/164.78 % --inst_orphan_elimination true
% 164.60/164.78 % --inst_learning_loop_flag true
% 164.60/164.78 % --inst_learning_start 3000
% 164.60/164.78 % --inst_learning_factor 2
% 164.60/164.78 % --inst_start_prop_sim_after_learn 3
% 164.60/164.78 % --inst_sel_renew solver
% 164.60/164.78 % --inst_lit_activity_flag true
% 164.60/164.78 % --inst_out_proof true
% 164.60/164.78
% 164.60/164.78 % ------ Resolution Options
% 164.60/164.78
% 164.60/164.78 % --resolution_flag true
% 164.60/164.78 % --res_lit_sel kbo_max
% 164.60/164.78 % --res_to_prop_solver none
% 164.60/164.78 % --res_prop_simpl_new false
% 164.60/164.78 % --res_prop_simpl_given false
% 164.60/164.78 % --res_passive_queue_type priority_queues
% 164.60/164.78 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 164.60/164.78 % --res_passive_queues_freq [15;5]
% 164.60/164.78 % --res_forward_subs full
% 164.60/164.78 % --res_backward_subs full
% 164.60/164.78 % --res_forward_subs_resolution true
% 164.60/164.78 % --res_backward_subs_resolution true
% 164.60/164.78 % --res_orphan_elimination false
% 164.60/164.78 % --res_time_limit 1000.
% 164.60/164.78 % --res_out_proof true
% 164.60/164.78 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_d3a938.s
% 164.60/164.78 % --modulo true
% 164.60/164.78
% 164.60/164.78 % ------ Combination Options
% 164.60/164.78
% 164.60/164.78 % --comb_res_mult 1000
% 164.60/164.78 % --comb_inst_mult 300
% 164.60/164.78 % ------
% 164.60/164.78
% 164.60/164.78
% 164.60/164.78
% 164.60/164.78 % ------ Proving...
% 164.60/164.78 %
% 164.60/164.78
% 164.60/164.78
% 164.60/164.78 % Time Out Real
% 164.60/164.78
% 164.60/164.78 % ------ Statistics
% 164.60/164.78
% 164.60/164.78 % ------ General
% 164.60/164.78
% 164.60/164.78 % num_of_input_clauses: 211
% 164.60/164.78 % num_of_input_neg_conjectures: 24
% 164.60/164.78 % num_of_splits: 28
% 164.60/164.78 % num_of_split_atoms: 20
% 164.60/164.78 % num_of_sem_filtered_clauses: 0
% 164.60/164.78 % num_of_subtypes: 0
% 164.60/164.78 % monotx_restored_types: 0
% 164.60/164.78 % sat_num_of_epr_types: 0
% 164.60/164.78 % sat_num_of_non_cyclic_types: 0
% 164.60/164.78 % sat_guarded_non_collapsed_types: 0
% 164.60/164.78 % is_epr: 0
% 164.60/164.78 % is_horn: 0
% 164.60/164.78 % has_eq: 1
% 164.60/164.78 % num_pure_diseq_elim: 0
% 164.60/164.78 % simp_replaced_by: 5
% 164.60/164.78 % res_preprocessed: 72
% 164.60/164.78 % prep_upred: 0
% 164.60/164.78 % prep_unflattend: 204
% 164.60/164.78 % pred_elim_cands: 16
% 164.60/164.78 % pred_elim: 9
% 164.60/164.78 % pred_elim_cl: 11
% 164.60/164.78 % pred_elim_cycles: 20
% 164.60/164.78 % forced_gc_time: 0
% 164.60/164.78 % gc_basic_clause_elim: 0
% 164.60/164.78 % parsing_time: 0.004
% 164.60/164.78 % sem_filter_time: 0.
% 164.60/164.78 % pred_elim_time: 0.019
% 164.60/164.78 % out_proof_time: 0.
% 164.60/164.78 % monotx_time: 0.
% 164.60/164.78 % subtype_inf_time: 0.
% 164.60/164.78 % unif_index_cands_time: 0.057
% 164.60/164.78 % unif_index_add_time: 0.088
% 164.60/164.78 % total_time: 150.009
% 164.60/164.78 % num_of_symbols: 91
% 164.60/164.78 % num_of_terms: 29011
% 164.60/164.78
% 164.60/164.78 % ------ Propositional Solver
% 164.60/164.78
% 164.60/164.78 % prop_solver_calls: 52
% 164.60/164.78 % prop_fast_solver_calls: 940
% 164.60/164.78 % prop_num_of_clauses: 14504
% 164.60/164.78 % prop_preprocess_simplified: 50143
% 164.60/164.78 % prop_fo_subsumed: 6
% 164.60/164.78 % prop_solver_time: 0.007
% 164.60/164.78 % prop_fast_solver_time: 0.
% 164.60/164.78 % prop_unsat_core_time: 0.
% 164.60/164.78
% 164.60/164.78 % ------ QBF
% 164.60/164.78
% 164.60/164.78 % qbf_q_res: 0
% 164.60/164.78 % qbf_num_tautologies: 0
% 164.60/164.78 % qbf_prep_cycles: 0
% 164.60/164.78
% 164.60/164.78 % ------ BMC1
% 164.60/164.78
% 164.60/164.78 % bmc1_current_bound: -1
% 164.60/164.78 % bmc1_last_solved_bound: -1
% 164.60/164.78 % bmc1_unsat_core_size: -1
% 164.60/164.78 % bmc1_unsat_core_parents_size: -1
% 164.60/164.78 % bmc1_merge_next_fun: 0
% 164.60/164.78 % bmc1_unsat_core_clauses_time: 0.
% 164.60/164.78
% 164.60/164.78 % ------ Instantiation
% 164.60/164.78
% 164.60/164.78 % inst_num_of_clauses: 7036
% 164.60/164.78 % inst_num_in_passive: 196
% 164.60/164.78 % inst_num_in_active: 6467
% 164.60/164.78 % inst_num_in_unprocessed: 306
% 164.60/164.78 % inst_num_of_loops: 8098
% 164.60/164.78 % inst_num_of_learning_restarts: 2
% 164.60/164.78 % inst_num_moves_active_passive: 1553
% 164.60/164.78 % inst_lit_activity: 1264
% 164.60/164.78 % inst_lit_activity_moves: 1
% 164.60/164.78 % inst_num_tautologies: 67
% 164.60/164.78 % inst_num_prop_implied: 0
% 164.60/164.78 % inst_num_existing_simplified: 0
% 164.60/164.78 % inst_num_eq_res_simplified: 0
% 164.60/164.78 % inst_num_child_elim: 0
% 164.60/164.78 % inst_num_of_dismatching_blockings: 216
% 164.60/164.78 % inst_num_of_non_proper_insts: 14856
% 164.60/164.78 % inst_num_of_duplicates: 7570
% 164.60/164.78 % inst_inst_num_from_inst_to_res: 0
% 164.60/164.78 % inst_dismatching_checking_time: 0.065
% 164.60/164.78
% 164.60/164.78 % ------ Resolution
% 164.60/164.78
% 164.60/164.78 % res_num_of_clauses: 48074
% 164.60/164.78 % res_num_in_passive: 8862
% 164.60/164.78 % res_num_in_active: 38376
% 164.60/164.78 % res_num_of_loops: 57013
% 164.60/164.78 % res_forward_subset_subsumed: 5550
% 164.60/164.78 % res_backward_subset_subsumed: 4
% 164.60/164.78 % res_forward_subsumed: 15049
% 164.60/164.78 % res_backward_subsumed: 36
% 164.60/164.78 % res_forward_subsumption_resolution: 24339
% 164.60/164.78 % res_backward_subsumption_resolution: 11
% 164.60/164.78 % res_clause_to_clause_subsumption: 5789952
% 164.60/164.78 % res_orphan_elimination: 0
% 164.60/164.78 % res_tautology_del: 0
% 164.60/164.78 % res_num_eq_res_simplified: 0
% 164.60/164.78 % res_num_sel_changes: 0
% 164.60/164.78 % res_moves_from_active_to_pass: 0
% 164.60/164.78
% 164.60/164.78 % Status Unknown
% 164.60/164.78 % Last status :
% 164.60/164.78 % SZS status Unknown
%------------------------------------------------------------------------------