TSTP Solution File: NLP191-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP191-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:08 EDT 2022
% Result : Unknown 83.26s 83.44s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP191-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 30 20:51:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.19/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.40 % Orientation found
% 0.19/0.40 % 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_55acf1.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_e07ab4.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_89f2af | grep -v "SZS"
% 0.19/0.43
% 0.19/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.43
% 0.19/0.43 %
% 0.19/0.43 % ------ iProver source info
% 0.19/0.43
% 0.19/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.43 % git: non_committed_changes: true
% 0.19/0.43 % git: last_make_outside_of_git: true
% 0.19/0.43
% 0.19/0.43 %
% 0.19/0.43 % ------ Input Options
% 0.19/0.43
% 0.19/0.43 % --out_options all
% 0.19/0.43 % --tptp_safe_out true
% 0.19/0.43 % --problem_path ""
% 0.19/0.43 % --include_path ""
% 0.19/0.43 % --clausifier .//eprover
% 0.19/0.43 % --clausifier_options --tstp-format
% 0.19/0.43 % --stdin false
% 0.19/0.43 % --dbg_backtrace false
% 0.19/0.43 % --dbg_dump_prop_clauses false
% 0.19/0.43 % --dbg_dump_prop_clauses_file -
% 0.19/0.43 % --dbg_out_stat false
% 0.19/0.43
% 0.19/0.43 % ------ General Options
% 0.19/0.43
% 0.19/0.43 % --fof false
% 0.19/0.43 % --time_out_real 150.
% 0.19/0.43 % --time_out_prep_mult 0.2
% 0.19/0.43 % --time_out_virtual -1.
% 0.19/0.43 % --schedule none
% 0.19/0.43 % --ground_splitting input
% 0.19/0.43 % --splitting_nvd 16
% 0.19/0.43 % --non_eq_to_eq false
% 0.19/0.43 % --prep_gs_sim true
% 0.19/0.43 % --prep_unflatten false
% 0.19/0.43 % --prep_res_sim true
% 0.19/0.43 % --prep_upred true
% 0.19/0.43 % --res_sim_input true
% 0.19/0.43 % --clause_weak_htbl true
% 0.19/0.43 % --gc_record_bc_elim false
% 0.19/0.43 % --symbol_type_check false
% 0.19/0.43 % --clausify_out false
% 0.19/0.43 % --large_theory_mode false
% 0.19/0.43 % --prep_sem_filter none
% 0.19/0.43 % --prep_sem_filter_out false
% 0.19/0.43 % --preprocessed_out false
% 0.19/0.43 % --sub_typing false
% 0.19/0.43 % --brand_transform false
% 0.19/0.43 % --pure_diseq_elim true
% 0.19/0.43 % --min_unsat_core false
% 0.19/0.43 % --pred_elim true
% 0.19/0.43 % --add_important_lit false
% 0.19/0.43 % --soft_assumptions false
% 0.19/0.43 % --reset_solvers false
% 0.19/0.43 % --bc_imp_inh []
% 0.19/0.43 % --conj_cone_tolerance 1.5
% 0.19/0.43 % --prolific_symb_bound 500
% 0.19/0.43 % --lt_threshold 2000
% 0.19/0.43
% 0.19/0.43 % ------ SAT Options
% 0.19/0.43
% 0.19/0.43 % --sat_mode false
% 0.19/0.43 % --sat_fm_restart_options ""
% 0.19/0.43 % --sat_gr_def false
% 0.19/0.43 % --sat_epr_types true
% 0.19/0.43 % --sat_non_cyclic_types false
% 0.19/0.43 % --sat_finite_models false
% 0.19/0.43 % --sat_fm_lemmas false
% 0.19/0.43 % --sat_fm_prep false
% 0.19/0.43 % --sat_fm_uc_incr true
% 0.19/0.43 % --sat_out_model small
% 0.19/0.43 % --sat_out_clauses false
% 0.19/0.43
% 0.19/0.43 % ------ QBF Options
% 0.19/0.43
% 0.19/0.43 % --qbf_mode false
% 0.19/0.43 % --qbf_elim_univ true
% 0.19/0.43 % --qbf_sk_in true
% 0.19/0.43 % --qbf_pred_elim true
% 0.19/0.43 % --qbf_split 32
% 0.19/0.43
% 0.19/0.43 % ------ BMC1 Options
% 0.19/0.43
% 0.19/0.43 % --bmc1_incremental false
% 0.19/0.43 % --bmc1_axioms reachable_all
% 0.19/0.43 % --bmc1_min_bound 0
% 0.19/0.43 % --bmc1_max_bound -1
% 0.19/0.43 % --bmc1_max_bound_default -1
% 0.19/0.43 % --bmc1_symbol_reachability true
% 0.19/0.43 % --bmc1_property_lemmas false
% 0.19/0.43 % --bmc1_k_induction false
% 0.19/0.43 % --bmc1_non_equiv_states false
% 0.19/0.43 % --bmc1_deadlock false
% 0.19/0.43 % --bmc1_ucm false
% 0.19/0.43 % --bmc1_add_unsat_core none
% 0.19/0.43 % --bmc1_unsat_core_children false
% 0.19/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.43 % --bmc1_out_stat full
% 0.19/0.43 % --bmc1_ground_init false
% 0.19/0.43 % --bmc1_pre_inst_next_state false
% 0.19/0.43 % --bmc1_pre_inst_state false
% 0.19/0.43 % --bmc1_pre_inst_reach_state false
% 0.19/0.43 % --bmc1_out_unsat_core false
% 0.19/0.43 % --bmc1_aig_witness_out false
% 0.19/0.43 % --bmc1_verbose false
% 0.19/0.43 % --bmc1_dump_clauses_tptp false
% 0.37/0.56 % --bmc1_dump_unsat_core_tptp false
% 0.37/0.56 % --bmc1_dump_file -
% 0.37/0.56 % --bmc1_ucm_expand_uc_limit 128
% 0.37/0.56 % --bmc1_ucm_n_expand_iterations 6
% 0.37/0.56 % --bmc1_ucm_extend_mode 1
% 0.37/0.56 % --bmc1_ucm_init_mode 2
% 0.37/0.56 % --bmc1_ucm_cone_mode none
% 0.37/0.56 % --bmc1_ucm_reduced_relation_type 0
% 0.37/0.56 % --bmc1_ucm_relax_model 4
% 0.37/0.56 % --bmc1_ucm_full_tr_after_sat true
% 0.37/0.56 % --bmc1_ucm_expand_neg_assumptions false
% 0.37/0.56 % --bmc1_ucm_layered_model none
% 0.37/0.56 % --bmc1_ucm_max_lemma_size 10
% 0.37/0.56
% 0.37/0.56 % ------ AIG Options
% 0.37/0.56
% 0.37/0.56 % --aig_mode false
% 0.37/0.56
% 0.37/0.56 % ------ Instantiation Options
% 0.37/0.56
% 0.37/0.56 % --instantiation_flag true
% 0.37/0.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.37/0.56 % --inst_solver_per_active 750
% 0.37/0.56 % --inst_solver_calls_frac 0.5
% 0.37/0.56 % --inst_passive_queue_type priority_queues
% 0.37/0.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.37/0.56 % --inst_passive_queues_freq [25;2]
% 0.37/0.56 % --inst_dismatching true
% 0.37/0.56 % --inst_eager_unprocessed_to_passive true
% 0.37/0.56 % --inst_prop_sim_given true
% 0.37/0.56 % --inst_prop_sim_new false
% 0.37/0.56 % --inst_orphan_elimination true
% 0.37/0.56 % --inst_learning_loop_flag true
% 0.37/0.56 % --inst_learning_start 3000
% 0.37/0.56 % --inst_learning_factor 2
% 0.37/0.56 % --inst_start_prop_sim_after_learn 3
% 0.37/0.56 % --inst_sel_renew solver
% 0.37/0.56 % --inst_lit_activity_flag true
% 0.37/0.56 % --inst_out_proof true
% 0.37/0.56
% 0.37/0.56 % ------ Resolution Options
% 0.37/0.56
% 0.37/0.56 % --resolution_flag true
% 0.37/0.56 % --res_lit_sel kbo_max
% 0.37/0.56 % --res_to_prop_solver none
% 0.37/0.56 % --res_prop_simpl_new false
% 0.37/0.56 % --res_prop_simpl_given false
% 0.37/0.56 % --res_passive_queue_type priority_queues
% 0.37/0.56 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.37/0.56 % --res_passive_queues_freq [15;5]
% 0.37/0.56 % --res_forward_subs full
% 0.37/0.56 % --res_backward_subs full
% 0.37/0.56 % --res_forward_subs_resolution true
% 0.37/0.56 % --res_backward_subs_resolution true
% 0.37/0.56 % --res_orphan_elimination false
% 0.37/0.56 % --res_time_limit 1000.
% 0.37/0.56 % --res_out_proof true
% 0.37/0.56 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_55acf1.s
% 0.37/0.56 % --modulo true
% 0.37/0.56
% 0.37/0.56 % ------ Combination Options
% 0.37/0.56
% 0.37/0.56 % --comb_res_mult 1000
% 0.37/0.56 % --comb_inst_mult 300
% 0.37/0.56 % ------
% 0.37/0.56
% 0.37/0.56 % ------ Parsing...% successful
% 0.37/0.56
% 0.37/0.56 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 24 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.37/0.56
% 0.37/0.56 % ------ Proving...
% 0.37/0.56 % ------ Problem Properties
% 0.37/0.56
% 0.37/0.56 %
% 0.37/0.56 % EPR false
% 0.37/0.56 % Horn false
% 0.37/0.56 % Has equality false
% 0.37/0.56
% 0.37/0.56 % % ------ Input Options Time Limit: Unbounded
% 0.37/0.56
% 0.37/0.56
% 0.37/0.56 % % ------ Current options:
% 0.37/0.56
% 0.37/0.56 % ------ Input Options
% 0.37/0.56
% 0.37/0.56 % --out_options all
% 0.37/0.56 % --tptp_safe_out true
% 0.37/0.56 % --problem_path ""
% 0.37/0.56 % --include_path ""
% 0.37/0.56 % --clausifier .//eprover
% 0.37/0.56 % --clausifier_options --tstp-format
% 0.37/0.56 % --stdin false
% 0.37/0.56 % --dbg_backtrace false
% 0.37/0.56 % --dbg_dump_prop_clauses false
% 0.37/0.56 % --dbg_dump_prop_clauses_file -
% 0.37/0.56 % --dbg_out_stat false
% 0.37/0.56
% 0.37/0.56 % ------ General Options
% 0.37/0.56
% 0.37/0.56 % --fof false
% 0.37/0.56 % --time_out_real 150.
% 0.37/0.56 % --time_out_prep_mult 0.2
% 0.37/0.56 % --time_out_virtual -1.
% 0.37/0.56 % --schedule none
% 0.37/0.56 % --ground_splitting input
% 0.37/0.56 % --splitting_nvd 16
% 0.37/0.56 % --non_eq_to_eq false
% 0.37/0.56 % --prep_gs_sim true
% 0.37/0.56 % --prep_unflatten false
% 0.37/0.56 % --prep_res_sim true
% 0.37/0.56 % --prep_upred true
% 0.37/0.56 % --res_sim_input true
% 0.37/0.56 % --clause_weak_htbl true
% 0.37/0.56 % --gc_record_bc_elim false
% 0.37/0.56 % --symbol_type_check false
% 0.37/0.56 % --clausify_out false
% 0.37/0.56 % --large_theory_mode false
% 0.37/0.56 % --prep_sem_filter none
% 0.37/0.56 % --prep_sem_filter_out false
% 0.37/0.56 % --preprocessed_out false
% 0.37/0.56 % --sub_typing false
% 0.37/0.56 % --brand_transform false
% 0.37/0.56 % --pure_diseq_elim true
% 0.37/0.56 % --min_unsat_core false
% 0.37/0.56 % --pred_elim true
% 0.37/0.56 % --add_important_lit false
% 0.37/0.56 % --soft_assumptions false
% 0.37/0.56 % --reset_solvers false
% 0.37/0.56 % --bc_imp_inh []
% 0.37/0.56 % --conj_cone_tolerance 1.5
% 0.37/0.56 % --prolific_symb_bound 500
% 0.37/0.56 % --lt_threshold 2000
% 0.37/0.56
% 0.37/0.56 % ------ SAT Options
% 0.37/0.56
% 0.37/0.56 % --sat_mode false
% 0.37/0.56 % --sat_fm_restart_options ""
% 0.37/0.56 % --sat_gr_def false
% 0.37/0.56 % --sat_epr_types true
% 0.37/0.56 % --sat_non_cyclic_types false
% 0.37/0.56 % --sat_finite_models false
% 0.37/0.56 % --sat_fm_lemmas false
% 0.37/0.56 % --sat_fm_prep false
% 0.37/0.56 % --sat_fm_uc_incr true
% 0.37/0.56 % --sat_out_model small
% 0.37/0.56 % --sat_out_clauses false
% 0.37/0.56
% 0.37/0.56 % ------ QBF Options
% 0.37/0.56
% 0.37/0.56 % --qbf_mode false
% 0.37/0.56 % --qbf_elim_univ true
% 0.37/0.56 % --qbf_sk_in true
% 0.37/0.56 % --qbf_pred_elim true
% 0.37/0.56 % --qbf_split 32
% 0.37/0.56
% 0.37/0.56 % ------ BMC1 Options
% 0.37/0.56
% 0.37/0.56 % --bmc1_incremental false
% 0.37/0.56 % --bmc1_axioms reachable_all
% 0.37/0.56 % --bmc1_min_bound 0
% 0.37/0.56 % --bmc1_max_bound -1
% 0.37/0.56 % --bmc1_max_bound_default -1
% 0.37/0.56 % --bmc1_symbol_reachability true
% 0.37/0.56 % --bmc1_property_lemmas false
% 0.37/0.56 % --bmc1_k_induction false
% 0.37/0.56 % --bmc1_non_equiv_states false
% 0.37/0.56 % --bmc1_deadlock false
% 0.37/0.56 % --bmc1_ucm false
% 0.37/0.56 % --bmc1_add_unsat_core none
% 0.37/0.56 % --bmc1_unsat_core_children false
% 0.37/0.56 % --bmc1_unsat_core_extrapolate_axioms false
% 0.37/0.56 % --bmc1_out_stat full
% 0.37/0.56 % --bmc1_ground_init false
% 0.37/0.56 % --bmc1_pre_inst_next_state false
% 0.37/0.56 % --bmc1_pre_inst_state false
% 0.37/0.56 % --bmc1_pre_inst_reach_state false
% 0.37/0.56 % --bmc1_out_unsat_core false
% 0.37/0.56 % --bmc1_aig_witness_out false
% 0.37/0.56 % --bmc1_verbose false
% 0.37/0.56 % --bmc1_dump_clauses_tptp false
% 0.37/0.56 % --bmc1_dump_unsat_core_tptp false
% 0.37/0.56 % --bmc1_dump_file -
% 0.37/0.56 % --bmc1_ucm_expand_uc_limit 128
% 0.37/0.56 % --bmc1_ucm_n_expand_iterations 6
% 0.37/0.56 % --bmc1_ucm_extend_mode 1
% 0.37/0.56 % --bmc1_ucm_init_mode 2
% 0.37/0.56 % --bmc1_ucm_cone_mode none
% 0.37/0.56 % --bmc1_ucm_reduced_relation_type 0
% 0.37/0.56 % --bmc1_ucm_relax_model 4
% 0.37/0.56 % --bmc1_ucm_full_tr_after_sat true
% 0.37/0.56 % --bmc1_ucm_expand_neg_assumptions false
% 0.37/0.56 % --bmc1_ucm_layered_model none
% 0.37/0.56 % --bmc1_ucm_max_lemma_size 10
% 0.37/0.56
% 0.37/0.56 % ------ AIG Options
% 0.37/0.56
% 0.37/0.56 % --aig_mode false
% 0.37/0.56
% 0.37/0.56 % ------ Instantiation Options
% 0.37/0.56
% 0.37/0.56 % --instantiation_flag true
% 0.37/0.56 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.37/0.56 % --inst_solver_per_active 750
% 0.37/0.56 % --inst_solver_calls_frac 0.5
% 0.37/0.56 % --inst_passive_queue_type priority_queues
% 0.37/0.56 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.37/0.56 % --inst_passive_queues_freq [25;2]
% 0.37/0.56 % --inst_dismatching true
% 0.37/0.56 % --inst_eager_unprocessed_to_passive true
% 39.38/39.59 % --inst_prop_sim_given true
% 39.38/39.59 % --inst_prop_sim_new false
% 39.38/39.59 % --inst_orphan_elimination true
% 39.38/39.59 % --inst_learning_loop_flag true
% 39.38/39.59 % --inst_learning_start 3000
% 39.38/39.59 % --inst_learning_factor 2
% 39.38/39.59 % --inst_start_prop_sim_after_learn 3
% 39.38/39.59 % --inst_sel_renew solver
% 39.38/39.59 % --inst_lit_activity_flag true
% 39.38/39.59 % --inst_out_proof true
% 39.38/39.59
% 39.38/39.59 % ------ Resolution Options
% 39.38/39.59
% 39.38/39.59 % --resolution_flag true
% 39.38/39.59 % --res_lit_sel kbo_max
% 39.38/39.59 % --res_to_prop_solver none
% 39.38/39.59 % --res_prop_simpl_new false
% 39.38/39.59 % --res_prop_simpl_given false
% 39.38/39.59 % --res_passive_queue_type priority_queues
% 39.38/39.59 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 39.38/39.59 % --res_passive_queues_freq [15;5]
% 39.38/39.59 % --res_forward_subs full
% 39.38/39.59 % --res_backward_subs full
% 39.38/39.59 % --res_forward_subs_resolution true
% 39.38/39.59 % --res_backward_subs_resolution true
% 39.38/39.59 % --res_orphan_elimination false
% 39.38/39.59 % --res_time_limit 1000.
% 39.38/39.59 % --res_out_proof true
% 39.38/39.59 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_55acf1.s
% 39.38/39.59 % --modulo true
% 39.38/39.59
% 39.38/39.59 % ------ Combination Options
% 39.38/39.59
% 39.38/39.59 % --comb_res_mult 1000
% 39.38/39.59 % --comb_inst_mult 300
% 39.38/39.59 % ------
% 39.38/39.59
% 39.38/39.59
% 39.38/39.59
% 39.38/39.59 % ------ Proving...
% 39.38/39.59 % warning: shown sat in sat incomplete mode
% 39.38/39.59 %
% 39.38/39.59
% 39.38/39.59
% 39.38/39.59 ------ Building Model...Done
% 39.38/39.59
% 39.38/39.59 %------ The model is defined over ground terms (initial term algebra).
% 39.38/39.59 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 39.38/39.59 %------ where \phi is a formula over the term algebra.
% 39.38/39.59 %------ If we have equality in the problem then it is also defined as a predicate above,
% 39.38/39.59 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 39.38/39.59 %------ See help for --sat_out_model for different model outputs.
% 39.38/39.59 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 39.38/39.59 %------ where the first argument stands for the sort ($i in the unsorted case)
% 39.38/39.59
% 39.38/39.59
% 39.38/39.59
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of ssSkC0
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 ( ssSkC0 <=>
% 39.38/39.59 $true
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of actual_world
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0] :
% 39.38/39.59 ( ~(actual_world(X0)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of state
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( state(X0,X1) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc27 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc75 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 ? [X2,X3] :
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf13(skc73,X2,X3) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of of
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( ~(of(X0,X1,X2)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of man
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( man(X0,X1) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc29 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc77 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of be
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2,X3] :
% 39.38/39.59 ( be(X0,X1,X2,X3) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc27 & X2=skc29 & X3=skc26 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc75 & X2=skc77 & X3=skc74 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 ? [X4] :
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf13(skc73,X4,skf10(skc73,skc83)) & X2=skf10(skc73,skc83) & X3=skf12(skf10(skc73,skc83),skc73,X4) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 ? [X4] :
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf13(skc73,X4,skf11(skc73,skc82)) & X2=skf11(skc73,skc82) & X3=skf12(skf11(skc73,skc82),skc73,X4) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 ? [X4] :
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf13(skc73,X4,skf16(skc84,skc73,skc82)) & X2=skf16(skc84,skc73,skc82) & X3=skf12(skf16(skc84,skc73,skc82),skc73,X4) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 ? [X4] :
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf13(skc73,X4,skf23(skc73,skc82)) & X2=skf23(skc73,skc82) & X3=skf12(skf23(skc73,skc82),skc73,X4) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 ? [X4] :
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf13(skc73,X4,skf23(skc73,skc83)) & X2=skf23(skc73,skc83) & X3=skf12(skf23(skc73,skc83),skc73,X4) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 ? [X4] :
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf13(skc73,X4,skf16(skc79,skc73,skc83)) & X2=skf16(skc79,skc73,skc83) & X3=skf12(skf16(skc79,skc73,skc83),skc73,X4) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of forename
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( forename(X0,X1) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc28 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc76 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of jules_forename
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(jules_forename(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of hollywood_placename
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( hollywood_placename(X0,X1) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc36 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc80 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of placename
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(placename(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of in
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( ~(in(X0,X1,X2)) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X2=skc35 )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skc34 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf12(skf11(skc73,skc82),skc73,skc79) & X2=skc79 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf12(skf16(skc84,skc73,skc82),skc73,skc84) & X2=skc84 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf12(skf23(skc73,skc83),skc73,skc79) & X2=skc79 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf12(skf23(skc73,skc83),skc73,skc84) & X2=skc84 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf12(skf16(skc79,skc73,skc83),skc73,skc79) & X2=skc79 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf12(skf16(skc79,skc73,skc83),skc73,skc84) & X2=skc84 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X2=skc79 )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skc78 )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skf12(skf11(skc73,skc82),skc73,skc79) )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skf12(skf23(skc73,skc82),skc73,skc79) )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skf12(skf16(skc84,skc73,skc82),skc73,skc79) )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skf12(skf23(skc73,skc83),skc73,skc79) )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skf12(skf16(skc79,skc73,skc83),skc73,skc79) )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skf12(skf10(skc73,skc83),skc73,skc79) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X2=skc84 )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skf12(skf16(skc84,skc73,skc82),skc73,skc84) )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skf12(skf23(skc73,skc83),skc73,skc84) )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skf12(skf16(skc79,skc73,skc83),skc73,skc84) )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skf12(skf10(skc73,skc83),skc73,skc84) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of down
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( down(X0,X1,X2) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc34 & X2=skc35 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc78 & X2=skc79 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of lonely
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( lonely(X0,X1) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc35 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc79 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of street
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(street(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of city
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(city(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of behind
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( behind(X0,X1,X2) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc26 & X2=skc30 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc81 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of agent
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( ~(agent(X0,X1,X2)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of old
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( old(X0,X1) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc37 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc81 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of dirty
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(dirty(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of white
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(white(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of chevy
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(chevy(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of wheel
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( wheel(X0,X1) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc30 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc81 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of event
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( event(X0,X1) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc34 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc78 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 ? [X2,X3] :
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf17(skc73,X2,X3) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of present
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(present(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of barrel
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(barrel(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of frontseat
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( frontseat(X0,X1) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc33 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc84 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of ssSkP1
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( ~(ssSkP1(X0,X1,X2)) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc84 & X1=skc82 & X2=skc73 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of ssSkP2
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( ~(ssSkP2(X0,X1,X2)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of ssSkP0
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(ssSkP0(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of group
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( group(X0,X1) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc31 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc32 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc82 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of two
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( two(X0,X1) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc32 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of coat
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( coat(X0,X1) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf11(skc73,skc82) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf23(skc73,skc82) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf16(skc84,skc73,skc82) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of black
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(black(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of cheap
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(cheap(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of member
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( member(X0,X1,X2) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf23(skc73,skc82) & X2=skc82 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf16(skc84,skc73,skc82) & X2=skc82 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf10(skc73,skc83) & X2=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of patient
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( ~(patient(X0,X1,X2)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of nonreflexive
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(nonreflexive(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of wear
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(wear(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of fellow
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(fellow(X0,X1)) <=>
% 39.38/39.59 (
% 39.38/39.59 ? [X2] :
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skf11(skc73,X2) )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of young
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1] :
% 39.38/39.59 ( ~(young(X0,X1)) <=>
% 39.38/39.59 $false
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of sP1_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2,X3,X4,X5,X6] :
% 39.38/39.59 ( ~(sP1_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc82 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc83 & X6=skc82 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc83 & X6=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of sP2_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( ~(sP2_iProver_split(X0,X1,X2)) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc32 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of sP3_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 39.38/39.59 ( ~(sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7)) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc75 & X2=skc80 & X3=skc79 & X4=skc76 & X5=skc77 & X6=skc74 & X7=skc78 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of sP5_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( sP5_iProver_split(X0,X1,X2) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc83 )
% 39.38/39.59 &
% 39.38/39.59 ( X2!=skc82 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of sP7_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2,X3,X4,X5,X6] :
% 39.38/39.59 ( ~(sP7_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc82 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc83 & X6=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of sP8_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( sP8_iProver_split(X0,X1,X2) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skc32 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc83 & X2=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of sP9_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 39.38/39.59 ( ~(sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7)) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc75 & X2=skc80 & X3=skc79 & X4=skc76 & X5=skc77 & X6=skc74 & X7=skc78 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of sP11_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( sP11_iProver_split(X0,X1,X2) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc83 & X2=skc82 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of sP13_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2,X3,X4,X5,X6] :
% 39.38/39.59 ( ~(sP13_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc82 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of sP14_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( ~(sP14_iProver_split(X0,X1,X2)) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc25 & X1=skc32 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of sP15_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 39.38/39.59 ( ~(sP15_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7)) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc75 & X2=skc80 & X3=skc79 & X4=skc76 & X5=skc77 & X6=skc74 & X7=skc78 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of sP17_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( sP17_iProver_split(X0,X1,X2) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc83 )
% 39.38/39.59 &
% 39.38/39.59 ( X2!=skc82 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of sP19_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2,X3,X4,X5,X6] :
% 39.38/39.59 ( ~(sP19_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc82 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc83 & X6=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of sP20_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( sP20_iProver_split(X0,X1,X2) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 )
% 39.38/39.59 &
% 39.38/39.59 ( X1!=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 |
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc83 & X2=skc83 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Negative definition of sP21_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 39.38/39.59 ( ~(sP21_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7)) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc75 & X2=skc80 & X3=skc79 & X4=skc76 & X5=skc77 & X6=skc74 & X7=skc78 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59 %------ Positive definition of sP23_iProver_split
% 39.38/39.59 fof(lit_def,axiom,
% 39.38/39.59 (! [X0,X1,X2] :
% 39.38/39.59 ( sP23_iProver_split(X0,X1,X2) <=>
% 39.38/39.59 (
% 39.38/39.59 (
% 39.38/39.59 ( X0=skc73 & X1=skc83 & X2=skc82 )
% 39.38/39.59 )
% 39.38/39.59
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 )
% 39.38/39.59 ).
% 39.38/39.59
% 39.38/39.59
% 39.38/39.59
% 39.38/39.59 % ------ Statistics
% 39.38/39.59
% 39.38/39.59 % ------ General
% 39.38/39.59
% 39.38/39.59 % num_of_input_clauses: 92
% 39.38/39.59 % num_of_input_neg_conjectures: 92
% 39.38/39.59 % num_of_splits: 24
% 39.38/39.59 % num_of_split_atoms: 24
% 39.38/39.59 % num_of_sem_filtered_clauses: 0
% 39.38/39.59 % num_of_subtypes: 0
% 39.38/39.59 % monotx_restored_types: 0
% 39.38/39.59 % sat_num_of_epr_types: 0
% 39.38/39.59 % sat_num_of_non_cyclic_types: 0
% 39.38/39.59 % sat_guarded_non_collapsed_types: 0
% 39.38/39.59 % is_epr: 0
% 39.38/39.59 % is_horn: 0
% 39.38/39.59 % has_eq: 0
% 39.38/39.59 % num_pure_diseq_elim: 0
% 39.38/39.59 % simp_replaced_by: 0
% 39.38/39.59 % res_preprocessed: 208
% 39.38/39.59 % prep_upred: 0
% 39.38/39.59 % prep_unflattend: 0
% 39.38/39.59 % pred_elim_cands: 24
% 39.38/39.59 % pred_elim: 8
% 39.38/39.59 % pred_elim_cl: 8
% 39.38/39.59 % pred_elim_cycles: 36
% 39.38/39.59 % forced_gc_time: 0
% 39.38/39.59 % gc_basic_clause_elim: 0
% 39.38/39.59 % parsing_time: 0.004
% 39.38/39.59 % sem_filter_time: 0.
% 39.38/39.59 % pred_elim_time: 0.096
% 39.38/39.59 % out_proof_time: 0.
% 39.38/39.59 % monotx_time: 0.
% 39.38/39.59 % subtype_inf_time: 0.
% 39.38/39.59 % unif_index_cands_time: 0.021
% 39.38/39.59 % unif_index_add_time: 0.015
% 39.38/39.59 % total_time: 39.178
% 39.38/39.59 % num_of_symbols: 123
% 39.38/39.59 % num_of_terms: 17249
% 39.38/39.59
% 39.38/39.59 % ------ Propositional Solver
% 39.38/39.59
% 39.38/39.59 % prop_solver_calls: 24
% 39.38/39.59 % prop_fast_solver_calls: 1951
% 39.38/39.59 % prop_num_of_clauses: 1858
% 39.38/39.59 % prop_preprocess_simplified: 3386
% 39.38/39.59 % prop_fo_subsumed: 0
% 39.38/39.59 % prop_solver_time: 0.001
% 39.38/39.59 % prop_fast_solver_time: 0.004
% 39.38/39.59 % prop_unsat_core_time: 0.
% 39.38/39.59
% 39.38/39.59 % ------ QBF
% 39.38/39.59
% 39.38/39.59 % qbf_q_res: 0
% 39.38/39.59 % qbf_num_tautologies: 0
% 39.38/39.59 % qbf_prep_cycles: 0
% 39.38/39.59
% 39.38/39.59 % ------ BMC1
% 39.38/39.59
% 39.38/39.59 % bmc1_current_bound: -1
% 39.38/39.59 % bmc1_last_solved_bound: -1
% 39.38/39.59 % bmc1_unsat_core_size: -1
% 39.38/39.59 % bmc1_unsat_core_parents_size: -1
% 39.38/39.59 % bmc1_merge_next_fun: 0
% 39.38/39.59 % bmc1_unsat_core_clauses_time: 0.
% 39.38/39.59
% 39.38/39.59 % ------ Instantiation
% 39.38/39.59
% 39.38/39.59 % inst_num_of_clauses: 1021
% 39.38/39.59 % inst_num_in_passive: 0
% 39.38/39.59 % inst_num_in_active: 1021
% 39.38/39.59 % inst_num_in_unprocessed: 0
% 39.38/39.59 % inst_num_of_loops: 1253
% 39.38/39.59 % inst_num_of_learning_restarts: 0
% 39.38/39.59 % inst_num_moves_active_passive: 201
% 39.38/39.59 % inst_lit_activity: 143
% 39.38/39.59 % inst_lit_activity_moves: 0
% 39.38/39.59 % inst_num_tautologies: 0
% 39.38/39.59 % inst_num_prop_implied: 0
% 39.38/39.59 % inst_num_existing_simplified: 0
% 39.38/39.59 % inst_num_eq_res_simplified: 0
% 39.38/39.59 % inst_num_child_elim: 0
% 39.38/39.59 % inst_num_of_dismatching_blockings: 81
% 39.38/39.59 % inst_num_of_non_proper_insts: 1415
% 39.38/39.59 % inst_num_of_duplicates: 157
% 39.38/39.59 % inst_inst_num_from_inst_to_res: 0
% 39.38/39.59 % inst_dismatching_checking_time: 0.
% 39.38/39.59
% 39.38/39.59 % ------ Resolution
% 39.38/39.59
% 39.38/39.59 % res_num_of_clauses: 347048
% 39.38/39.59 % res_num_in_passive: 353605
% 39.38/39.59 % res_num_in_active: 3506
% 39.38/39.59 % res_num_of_loops: 5000
% 39.38/39.59 % res_forward_subset_subsumed: 272411
% 39.38/39.59 % res_backward_subset_subsumed: 10605
% 39.38/39.59 % res_forward_subsumed: 1083
% 39.38/39.59 % res_backward_subsumed: 21
% 39.38/39.59 % res_forward_subsumption_resolution: 2382
% 39.38/39.59 % res_backward_subsumption_resolution: 106
% 39.38/39.59 % res_clause_to_clause_subsumption: 23460
% 39.38/39.59 % res_orphan_elimination: 0
% 39.38/39.59 % res_tautology_del: 5517
% 39.38/39.59 % res_num_eq_res_simplified: 0
% 39.38/39.59 % res_num_sel_changes: 0
% 39.38/39.59 % res_moves_from_active_to_pass: 0
% 39.38/39.59
% 39.38/39.59 % Status Unknown
% 39.38/39.64 % Orienting using strategy ClausalAll
% 39.38/39.64 % Orientation found
% 39.38/39.64 % 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_55acf1.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_e07ab4.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_31dc7c | grep -v "SZS"
% 39.38/39.65
% 39.38/39.65 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 39.38/39.65
% 39.38/39.65 %
% 39.38/39.65 % ------ iProver source info
% 39.38/39.65
% 39.38/39.65 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 39.38/39.65 % git: non_committed_changes: true
% 39.38/39.65 % git: last_make_outside_of_git: true
% 39.38/39.65
% 39.38/39.65 %
% 39.38/39.65 % ------ Input Options
% 39.38/39.65
% 39.38/39.65 % --out_options all
% 39.38/39.65 % --tptp_safe_out true
% 39.38/39.65 % --problem_path ""
% 39.38/39.65 % --include_path ""
% 39.38/39.65 % --clausifier .//eprover
% 39.38/39.65 % --clausifier_options --tstp-format
% 39.38/39.65 % --stdin false
% 39.38/39.65 % --dbg_backtrace false
% 39.38/39.65 % --dbg_dump_prop_clauses false
% 39.38/39.65 % --dbg_dump_prop_clauses_file -
% 39.38/39.65 % --dbg_out_stat false
% 39.38/39.65
% 39.38/39.65 % ------ General Options
% 39.38/39.65
% 39.38/39.65 % --fof false
% 39.38/39.65 % --time_out_real 150.
% 39.38/39.65 % --time_out_prep_mult 0.2
% 39.38/39.65 % --time_out_virtual -1.
% 39.38/39.65 % --schedule none
% 39.38/39.65 % --ground_splitting input
% 39.38/39.65 % --splitting_nvd 16
% 39.38/39.65 % --non_eq_to_eq false
% 39.38/39.65 % --prep_gs_sim true
% 39.38/39.65 % --prep_unflatten false
% 39.38/39.65 % --prep_res_sim true
% 39.38/39.65 % --prep_upred true
% 39.38/39.65 % --res_sim_input true
% 39.38/39.65 % --clause_weak_htbl true
% 39.38/39.65 % --gc_record_bc_elim false
% 39.38/39.65 % --symbol_type_check false
% 39.38/39.65 % --clausify_out false
% 39.38/39.65 % --large_theory_mode false
% 39.38/39.65 % --prep_sem_filter none
% 39.38/39.65 % --prep_sem_filter_out false
% 39.38/39.65 % --preprocessed_out false
% 39.38/39.65 % --sub_typing false
% 39.38/39.65 % --brand_transform false
% 39.38/39.65 % --pure_diseq_elim true
% 39.38/39.65 % --min_unsat_core false
% 39.38/39.65 % --pred_elim true
% 39.38/39.65 % --add_important_lit false
% 39.38/39.65 % --soft_assumptions false
% 39.38/39.65 % --reset_solvers false
% 39.38/39.65 % --bc_imp_inh []
% 39.38/39.65 % --conj_cone_tolerance 1.5
% 39.38/39.65 % --prolific_symb_bound 500
% 39.38/39.65 % --lt_threshold 2000
% 39.38/39.65
% 39.38/39.65 % ------ SAT Options
% 39.38/39.65
% 39.38/39.65 % --sat_mode false
% 39.38/39.65 % --sat_fm_restart_options ""
% 39.38/39.65 % --sat_gr_def false
% 39.38/39.65 % --sat_epr_types true
% 39.38/39.65 % --sat_non_cyclic_types false
% 39.38/39.65 % --sat_finite_models false
% 39.38/39.65 % --sat_fm_lemmas false
% 39.38/39.65 % --sat_fm_prep false
% 39.38/39.65 % --sat_fm_uc_incr true
% 39.38/39.65 % --sat_out_model small
% 39.38/39.65 % --sat_out_clauses false
% 39.38/39.65
% 39.38/39.65 % ------ QBF Options
% 39.38/39.65
% 39.38/39.65 % --qbf_mode false
% 39.38/39.65 % --qbf_elim_univ true
% 39.38/39.65 % --qbf_sk_in true
% 39.38/39.65 % --qbf_pred_elim true
% 39.38/39.65 % --qbf_split 32
% 39.38/39.65
% 39.38/39.65 % ------ BMC1 Options
% 39.38/39.65
% 39.38/39.65 % --bmc1_incremental false
% 39.38/39.65 % --bmc1_axioms reachable_all
% 39.38/39.65 % --bmc1_min_bound 0
% 39.38/39.65 % --bmc1_max_bound -1
% 39.38/39.65 % --bmc1_max_bound_default -1
% 39.38/39.65 % --bmc1_symbol_reachability true
% 39.38/39.65 % --bmc1_property_lemmas false
% 39.38/39.65 % --bmc1_k_induction false
% 39.38/39.65 % --bmc1_non_equiv_states false
% 39.38/39.65 % --bmc1_deadlock false
% 39.38/39.65 % --bmc1_ucm false
% 39.38/39.65 % --bmc1_add_unsat_core none
% 39.38/39.65 % --bmc1_unsat_core_children false
% 39.38/39.65 % --bmc1_unsat_core_extrapolate_axioms false
% 39.38/39.65 % --bmc1_out_stat full
% 39.38/39.65 % --bmc1_ground_init false
% 39.38/39.65 % --bmc1_pre_inst_next_state false
% 39.38/39.65 % --bmc1_pre_inst_state false
% 39.38/39.65 % --bmc1_pre_inst_reach_state false
% 39.38/39.65 % --bmc1_out_unsat_core false
% 39.38/39.65 % --bmc1_aig_witness_out false
% 39.38/39.65 % --bmc1_verbose false
% 39.38/39.65 % --bmc1_dump_clauses_tptp false
% 39.54/39.71 % --bmc1_dump_unsat_core_tptp false
% 39.54/39.71 % --bmc1_dump_file -
% 39.54/39.71 % --bmc1_ucm_expand_uc_limit 128
% 39.54/39.71 % --bmc1_ucm_n_expand_iterations 6
% 39.54/39.71 % --bmc1_ucm_extend_mode 1
% 39.54/39.71 % --bmc1_ucm_init_mode 2
% 39.54/39.71 % --bmc1_ucm_cone_mode none
% 39.54/39.71 % --bmc1_ucm_reduced_relation_type 0
% 39.54/39.71 % --bmc1_ucm_relax_model 4
% 39.54/39.71 % --bmc1_ucm_full_tr_after_sat true
% 39.54/39.71 % --bmc1_ucm_expand_neg_assumptions false
% 39.54/39.71 % --bmc1_ucm_layered_model none
% 39.54/39.71 % --bmc1_ucm_max_lemma_size 10
% 39.54/39.71
% 39.54/39.71 % ------ AIG Options
% 39.54/39.71
% 39.54/39.71 % --aig_mode false
% 39.54/39.71
% 39.54/39.71 % ------ Instantiation Options
% 39.54/39.71
% 39.54/39.71 % --instantiation_flag true
% 39.54/39.71 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 39.54/39.71 % --inst_solver_per_active 750
% 39.54/39.71 % --inst_solver_calls_frac 0.5
% 39.54/39.71 % --inst_passive_queue_type priority_queues
% 39.54/39.71 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 39.54/39.71 % --inst_passive_queues_freq [25;2]
% 39.54/39.71 % --inst_dismatching true
% 39.54/39.71 % --inst_eager_unprocessed_to_passive true
% 39.54/39.71 % --inst_prop_sim_given true
% 39.54/39.71 % --inst_prop_sim_new false
% 39.54/39.71 % --inst_orphan_elimination true
% 39.54/39.71 % --inst_learning_loop_flag true
% 39.54/39.71 % --inst_learning_start 3000
% 39.54/39.71 % --inst_learning_factor 2
% 39.54/39.71 % --inst_start_prop_sim_after_learn 3
% 39.54/39.71 % --inst_sel_renew solver
% 39.54/39.71 % --inst_lit_activity_flag true
% 39.54/39.71 % --inst_out_proof true
% 39.54/39.71
% 39.54/39.71 % ------ Resolution Options
% 39.54/39.71
% 39.54/39.71 % --resolution_flag true
% 39.54/39.71 % --res_lit_sel kbo_max
% 39.54/39.71 % --res_to_prop_solver none
% 39.54/39.71 % --res_prop_simpl_new false
% 39.54/39.71 % --res_prop_simpl_given false
% 39.54/39.71 % --res_passive_queue_type priority_queues
% 39.54/39.71 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 39.54/39.71 % --res_passive_queues_freq [15;5]
% 39.54/39.71 % --res_forward_subs full
% 39.54/39.71 % --res_backward_subs full
% 39.54/39.71 % --res_forward_subs_resolution true
% 39.54/39.71 % --res_backward_subs_resolution true
% 39.54/39.71 % --res_orphan_elimination false
% 39.54/39.71 % --res_time_limit 1000.
% 39.54/39.71 % --res_out_proof true
% 39.54/39.71 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_55acf1.s
% 39.54/39.71 % --modulo true
% 39.54/39.71
% 39.54/39.71 % ------ Combination Options
% 39.54/39.71
% 39.54/39.71 % --comb_res_mult 1000
% 39.54/39.71 % --comb_inst_mult 300
% 39.54/39.71 % ------
% 39.54/39.71
% 39.54/39.71 % ------ Parsing...% successful
% 39.54/39.71
% 39.54/39.71 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 24 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 39.54/39.71
% 39.54/39.71 % ------ Proving...
% 39.54/39.71 % ------ Problem Properties
% 39.54/39.71
% 39.54/39.71 %
% 39.54/39.71 % EPR false
% 39.54/39.71 % Horn false
% 39.54/39.71 % Has equality false
% 39.54/39.71
% 39.54/39.71 % % ------ Input Options Time Limit: Unbounded
% 39.54/39.71
% 39.54/39.71
% 39.54/39.71 % % ------ Current options:
% 39.54/39.71
% 39.54/39.71 % ------ Input Options
% 39.54/39.71
% 39.54/39.71 % --out_options all
% 39.54/39.71 % --tptp_safe_out true
% 39.54/39.71 % --problem_path ""
% 39.54/39.71 % --include_path ""
% 39.54/39.71 % --clausifier .//eprover
% 39.54/39.71 % --clausifier_options --tstp-format
% 39.54/39.71 % --stdin false
% 39.54/39.71 % --dbg_backtrace false
% 39.54/39.71 % --dbg_dump_prop_clauses false
% 39.54/39.71 % --dbg_dump_prop_clauses_file -
% 39.54/39.71 % --dbg_out_stat false
% 39.54/39.71
% 39.54/39.71 % ------ General Options
% 39.54/39.71
% 39.54/39.71 % --fof false
% 39.54/39.71 % --time_out_real 150.
% 39.54/39.71 % --time_out_prep_mult 0.2
% 39.54/39.71 % --time_out_virtual -1.
% 39.54/39.71 % --schedule none
% 39.54/39.71 % --ground_splitting input
% 39.54/39.71 % --splitting_nvd 16
% 39.54/39.71 % --non_eq_to_eq false
% 39.54/39.71 % --prep_gs_sim true
% 39.54/39.71 % --prep_unflatten false
% 39.54/39.71 % --prep_res_sim true
% 39.54/39.71 % --prep_upred true
% 39.54/39.71 % --res_sim_input true
% 39.54/39.71 % --clause_weak_htbl true
% 39.54/39.71 % --gc_record_bc_elim false
% 39.54/39.71 % --symbol_type_check false
% 39.54/39.71 % --clausify_out false
% 39.54/39.71 % --large_theory_mode false
% 39.54/39.71 % --prep_sem_filter none
% 39.54/39.71 % --prep_sem_filter_out false
% 39.54/39.71 % --preprocessed_out false
% 39.54/39.71 % --sub_typing false
% 39.54/39.71 % --brand_transform false
% 39.54/39.71 % --pure_diseq_elim true
% 39.54/39.71 % --min_unsat_core false
% 39.54/39.71 % --pred_elim true
% 39.54/39.71 % --add_important_lit false
% 39.54/39.71 % --soft_assumptions false
% 39.54/39.71 % --reset_solvers false
% 39.54/39.71 % --bc_imp_inh []
% 39.54/39.71 % --conj_cone_tolerance 1.5
% 39.54/39.71 % --prolific_symb_bound 500
% 39.54/39.71 % --lt_threshold 2000
% 39.54/39.71
% 39.54/39.71 % ------ SAT Options
% 39.54/39.71
% 39.54/39.71 % --sat_mode false
% 39.54/39.71 % --sat_fm_restart_options ""
% 39.54/39.71 % --sat_gr_def false
% 39.54/39.71 % --sat_epr_types true
% 39.54/39.71 % --sat_non_cyclic_types false
% 39.54/39.71 % --sat_finite_models false
% 39.54/39.71 % --sat_fm_lemmas false
% 39.54/39.71 % --sat_fm_prep false
% 39.54/39.71 % --sat_fm_uc_incr true
% 39.54/39.71 % --sat_out_model small
% 39.54/39.71 % --sat_out_clauses false
% 39.54/39.71
% 39.54/39.71 % ------ QBF Options
% 39.54/39.71
% 39.54/39.71 % --qbf_mode false
% 39.54/39.71 % --qbf_elim_univ true
% 39.54/39.71 % --qbf_sk_in true
% 39.54/39.71 % --qbf_pred_elim true
% 39.54/39.71 % --qbf_split 32
% 39.54/39.71
% 39.54/39.71 % ------ BMC1 Options
% 39.54/39.71
% 39.54/39.71 % --bmc1_incremental false
% 39.54/39.71 % --bmc1_axioms reachable_all
% 39.54/39.71 % --bmc1_min_bound 0
% 39.54/39.71 % --bmc1_max_bound -1
% 39.54/39.71 % --bmc1_max_bound_default -1
% 39.54/39.71 % --bmc1_symbol_reachability true
% 39.54/39.71 % --bmc1_property_lemmas false
% 39.54/39.71 % --bmc1_k_induction false
% 39.54/39.71 % --bmc1_non_equiv_states false
% 39.54/39.71 % --bmc1_deadlock false
% 39.54/39.71 % --bmc1_ucm false
% 39.54/39.71 % --bmc1_add_unsat_core none
% 39.54/39.71 % --bmc1_unsat_core_children false
% 39.54/39.71 % --bmc1_unsat_core_extrapolate_axioms false
% 39.54/39.71 % --bmc1_out_stat full
% 39.54/39.71 % --bmc1_ground_init false
% 39.54/39.71 % --bmc1_pre_inst_next_state false
% 39.54/39.71 % --bmc1_pre_inst_state false
% 39.54/39.71 % --bmc1_pre_inst_reach_state false
% 39.54/39.71 % --bmc1_out_unsat_core false
% 39.54/39.71 % --bmc1_aig_witness_out false
% 39.54/39.71 % --bmc1_verbose false
% 39.54/39.71 % --bmc1_dump_clauses_tptp false
% 39.54/39.71 % --bmc1_dump_unsat_core_tptp false
% 39.54/39.71 % --bmc1_dump_file -
% 39.54/39.71 % --bmc1_ucm_expand_uc_limit 128
% 39.54/39.71 % --bmc1_ucm_n_expand_iterations 6
% 39.54/39.71 % --bmc1_ucm_extend_mode 1
% 39.54/39.71 % --bmc1_ucm_init_mode 2
% 39.54/39.71 % --bmc1_ucm_cone_mode none
% 39.54/39.71 % --bmc1_ucm_reduced_relation_type 0
% 39.54/39.71 % --bmc1_ucm_relax_model 4
% 39.54/39.71 % --bmc1_ucm_full_tr_after_sat true
% 39.54/39.71 % --bmc1_ucm_expand_neg_assumptions false
% 39.54/39.71 % --bmc1_ucm_layered_model none
% 39.54/39.71 % --bmc1_ucm_max_lemma_size 10
% 39.54/39.71
% 39.54/39.71 % ------ AIG Options
% 39.54/39.71
% 39.54/39.71 % --aig_mode false
% 39.54/39.71
% 39.54/39.71 % ------ Instantiation Options
% 39.54/39.71
% 39.54/39.71 % --instantiation_flag true
% 39.54/39.71 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 39.54/39.71 % --inst_solver_per_active 750
% 39.54/39.71 % --inst_solver_calls_frac 0.5
% 39.54/39.71 % --inst_passive_queue_type priority_queues
% 39.54/39.71 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 39.54/39.71 % --inst_passive_queues_freq [25;2]
% 39.54/39.71 % --inst_dismatching true
% 39.54/39.71 % --inst_eager_unprocessed_to_passive true
% 83.26/83.44 % --inst_prop_sim_given true
% 83.26/83.44 % --inst_prop_sim_new false
% 83.26/83.44 % --inst_orphan_elimination true
% 83.26/83.44 % --inst_learning_loop_flag true
% 83.26/83.44 % --inst_learning_start 3000
% 83.26/83.44 % --inst_learning_factor 2
% 83.26/83.44 % --inst_start_prop_sim_after_learn 3
% 83.26/83.44 % --inst_sel_renew solver
% 83.26/83.44 % --inst_lit_activity_flag true
% 83.26/83.44 % --inst_out_proof true
% 83.26/83.44
% 83.26/83.44 % ------ Resolution Options
% 83.26/83.44
% 83.26/83.44 % --resolution_flag true
% 83.26/83.44 % --res_lit_sel kbo_max
% 83.26/83.44 % --res_to_prop_solver none
% 83.26/83.44 % --res_prop_simpl_new false
% 83.26/83.44 % --res_prop_simpl_given false
% 83.26/83.44 % --res_passive_queue_type priority_queues
% 83.26/83.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 83.26/83.44 % --res_passive_queues_freq [15;5]
% 83.26/83.44 % --res_forward_subs full
% 83.26/83.44 % --res_backward_subs full
% 83.26/83.44 % --res_forward_subs_resolution true
% 83.26/83.44 % --res_backward_subs_resolution true
% 83.26/83.44 % --res_orphan_elimination false
% 83.26/83.44 % --res_time_limit 1000.
% 83.26/83.44 % --res_out_proof true
% 83.26/83.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_55acf1.s
% 83.26/83.44 % --modulo true
% 83.26/83.44
% 83.26/83.44 % ------ Combination Options
% 83.26/83.44
% 83.26/83.44 % --comb_res_mult 1000
% 83.26/83.44 % --comb_inst_mult 300
% 83.26/83.44 % ------
% 83.26/83.44
% 83.26/83.44
% 83.26/83.44
% 83.26/83.44 % ------ Proving...
% 83.26/83.44 % warning: shown sat in sat incomplete mode
% 83.26/83.44 %
% 83.26/83.44
% 83.26/83.44
% 83.26/83.44 ------ Building Model...Done
% 83.26/83.44
% 83.26/83.44 %------ The model is defined over ground terms (initial term algebra).
% 83.26/83.44 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 83.26/83.44 %------ where \phi is a formula over the term algebra.
% 83.26/83.44 %------ If we have equality in the problem then it is also defined as a predicate above,
% 83.26/83.44 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 83.26/83.44 %------ See help for --sat_out_model for different model outputs.
% 83.26/83.44 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 83.26/83.44 %------ where the first argument stands for the sort ($i in the unsorted case)
% 83.26/83.44
% 83.26/83.44
% 83.26/83.44
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of ssSkC0
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 ( ssSkC0 <=>
% 83.26/83.44 $true
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of actual_world
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0] :
% 83.26/83.44 ( ~(actual_world(X0)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of state
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( state(X0,X1) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc27 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc75 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 ? [X2,X3] :
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf13(skc73,X2,X3) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of of
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( ~(of(X0,X1,X2)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of man
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( man(X0,X1) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc29 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc77 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of be
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2,X3] :
% 83.26/83.44 ( be(X0,X1,X2,X3) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc27 & X2=skc29 & X3=skc26 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc75 & X2=skc77 & X3=skc74 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 ? [X4] :
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf13(skc73,X4,skf10(skc73,skc83)) & X2=skf10(skc73,skc83) & X3=skf12(skf10(skc73,skc83),skc73,X4) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 ? [X4] :
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf13(skc73,X4,skf11(skc73,skc82)) & X2=skf11(skc73,skc82) & X3=skf12(skf11(skc73,skc82),skc73,X4) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 ? [X4] :
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf13(skc73,X4,skf16(skc84,skc73,skc82)) & X2=skf16(skc84,skc73,skc82) & X3=skf12(skf16(skc84,skc73,skc82),skc73,X4) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 ? [X4] :
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf13(skc73,X4,skf23(skc73,skc82)) & X2=skf23(skc73,skc82) & X3=skf12(skf23(skc73,skc82),skc73,X4) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 ? [X4] :
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf13(skc73,X4,skf23(skc73,skc83)) & X2=skf23(skc73,skc83) & X3=skf12(skf23(skc73,skc83),skc73,X4) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 ? [X4] :
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf13(skc73,X4,skf16(skc79,skc73,skc83)) & X2=skf16(skc79,skc73,skc83) & X3=skf12(skf16(skc79,skc73,skc83),skc73,X4) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of forename
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( forename(X0,X1) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc28 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc76 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of jules_forename
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(jules_forename(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of hollywood_placename
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( hollywood_placename(X0,X1) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc36 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc80 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of placename
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(placename(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of in
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( ~(in(X0,X1,X2)) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X2=skc35 )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skc34 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf12(skf11(skc73,skc82),skc73,skc79) & X2=skc79 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf12(skf16(skc84,skc73,skc82),skc73,skc84) & X2=skc84 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf12(skf23(skc73,skc83),skc73,skc79) & X2=skc79 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf12(skf23(skc73,skc83),skc73,skc84) & X2=skc84 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf12(skf16(skc79,skc73,skc83),skc73,skc79) & X2=skc79 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf12(skf16(skc79,skc73,skc83),skc73,skc84) & X2=skc84 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X2=skc79 )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skc78 )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skf12(skf11(skc73,skc82),skc73,skc79) )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skf12(skf23(skc73,skc82),skc73,skc79) )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skf12(skf16(skc84,skc73,skc82),skc73,skc79) )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skf12(skf23(skc73,skc83),skc73,skc79) )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skf12(skf16(skc79,skc73,skc83),skc73,skc79) )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skf12(skf10(skc73,skc83),skc73,skc79) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X2=skc84 )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skf12(skf16(skc84,skc73,skc82),skc73,skc84) )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skf12(skf23(skc73,skc83),skc73,skc84) )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skf12(skf16(skc79,skc73,skc83),skc73,skc84) )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skf12(skf10(skc73,skc83),skc73,skc84) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of down
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( down(X0,X1,X2) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc34 & X2=skc35 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc78 & X2=skc79 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of lonely
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( lonely(X0,X1) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc35 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc79 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of street
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(street(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of city
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(city(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of behind
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( behind(X0,X1,X2) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc26 & X2=skc30 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc81 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of agent
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( ~(agent(X0,X1,X2)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of old
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( old(X0,X1) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc37 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc81 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of dirty
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(dirty(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of white
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(white(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of chevy
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(chevy(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of wheel
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( wheel(X0,X1) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc30 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc81 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of event
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( event(X0,X1) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc34 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc78 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 ? [X2,X3] :
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf17(skc73,X2,X3) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of present
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(present(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of barrel
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(barrel(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of frontseat
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( frontseat(X0,X1) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc33 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc84 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of ssSkP1
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( ~(ssSkP1(X0,X1,X2)) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc84 & X1=skc82 & X2=skc73 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of ssSkP2
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( ~(ssSkP2(X0,X1,X2)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of ssSkP0
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(ssSkP0(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of group
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( group(X0,X1) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc31 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc32 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc82 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of two
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( two(X0,X1) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc32 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of coat
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( coat(X0,X1) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf11(skc73,skc82) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf23(skc73,skc82) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf16(skc84,skc73,skc82) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of black
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(black(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of cheap
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(cheap(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of member
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( member(X0,X1,X2) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf23(skc73,skc82) & X2=skc82 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf16(skc84,skc73,skc82) & X2=skc82 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf10(skc73,skc83) & X2=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of patient
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( ~(patient(X0,X1,X2)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of nonreflexive
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(nonreflexive(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of wear
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(wear(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of fellow
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(fellow(X0,X1)) <=>
% 83.26/83.44 (
% 83.26/83.44 ? [X2] :
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skf11(skc73,X2) )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of young
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1] :
% 83.26/83.44 ( ~(young(X0,X1)) <=>
% 83.26/83.44 $false
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of sP1_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2,X3,X4,X5,X6] :
% 83.26/83.44 ( ~(sP1_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc82 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc83 & X6=skc82 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc83 & X6=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of sP2_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( ~(sP2_iProver_split(X0,X1,X2)) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc32 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of sP3_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 83.26/83.44 ( ~(sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7)) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc75 & X2=skc80 & X3=skc79 & X4=skc76 & X5=skc77 & X6=skc74 & X7=skc78 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of sP5_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( sP5_iProver_split(X0,X1,X2) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc83 )
% 83.26/83.44 &
% 83.26/83.44 ( X2!=skc82 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of sP7_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2,X3,X4,X5,X6] :
% 83.26/83.44 ( ~(sP7_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc82 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc83 & X6=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of sP8_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( sP8_iProver_split(X0,X1,X2) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skc32 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc83 & X2=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of sP9_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 83.26/83.44 ( ~(sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7)) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc75 & X2=skc80 & X3=skc79 & X4=skc76 & X5=skc77 & X6=skc74 & X7=skc78 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of sP11_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( sP11_iProver_split(X0,X1,X2) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc83 & X2=skc82 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of sP13_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2,X3,X4,X5,X6] :
% 83.26/83.44 ( ~(sP13_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc82 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of sP14_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( ~(sP14_iProver_split(X0,X1,X2)) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc25 & X1=skc32 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of sP15_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 83.26/83.44 ( ~(sP15_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7)) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc75 & X2=skc80 & X3=skc79 & X4=skc76 & X5=skc77 & X6=skc74 & X7=skc78 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of sP17_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( sP17_iProver_split(X0,X1,X2) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc83 )
% 83.26/83.44 &
% 83.26/83.44 ( X2!=skc82 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of sP19_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2,X3,X4,X5,X6] :
% 83.26/83.44 ( ~(sP19_iProver_split(X0,X1,X2,X3,X4,X5,X6)) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc82 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc82 & X6=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc74 & X2=skc78 & X3=skc81 & X4=skc84 & X5=skc83 & X6=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of sP20_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( sP20_iProver_split(X0,X1,X2) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 )
% 83.26/83.44 &
% 83.26/83.44 ( X1!=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 |
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc83 & X2=skc83 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Negative definition of sP21_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2,X3,X4,X5,X6,X7] :
% 83.26/83.44 ( ~(sP21_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7)) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc75 & X2=skc80 & X3=skc79 & X4=skc76 & X5=skc77 & X6=skc74 & X7=skc78 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44 %------ Positive definition of sP23_iProver_split
% 83.26/83.44 fof(lit_def,axiom,
% 83.26/83.44 (! [X0,X1,X2] :
% 83.26/83.44 ( sP23_iProver_split(X0,X1,X2) <=>
% 83.26/83.44 (
% 83.26/83.44 (
% 83.26/83.44 ( X0=skc73 & X1=skc83 & X2=skc82 )
% 83.26/83.44 )
% 83.26/83.44
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 )
% 83.26/83.44 ).
% 83.26/83.44
% 83.26/83.44
% 83.26/83.44
% 83.26/83.44 % ------ Statistics
% 83.26/83.44
% 83.26/83.44 % ------ General
% 83.26/83.44
% 83.26/83.44 % num_of_input_clauses: 92
% 83.26/83.44 % num_of_input_neg_conjectures: 92
% 83.26/83.44 % num_of_splits: 24
% 83.26/83.44 % num_of_split_atoms: 24
% 83.26/83.44 % num_of_sem_filtered_clauses: 0
% 83.26/83.44 % num_of_subtypes: 0
% 83.26/83.44 % monotx_restored_types: 0
% 83.26/83.44 % sat_num_of_epr_types: 0
% 83.26/83.44 % sat_num_of_non_cyclic_types: 0
% 83.26/83.44 % sat_guarded_non_collapsed_types: 0
% 83.26/83.44 % is_epr: 0
% 83.26/83.44 % is_horn: 0
% 83.26/83.44 % has_eq: 0
% 83.26/83.44 % num_pure_diseq_elim: 0
% 83.26/83.44 % simp_replaced_by: 0
% 83.26/83.44 % res_preprocessed: 208
% 83.26/83.44 % prep_upred: 0
% 83.26/83.44 % prep_unflattend: 0
% 83.26/83.44 % pred_elim_cands: 24
% 83.26/83.44 % pred_elim: 8
% 83.26/83.44 % pred_elim_cl: 8
% 83.26/83.44 % pred_elim_cycles: 36
% 83.26/83.44 % forced_gc_time: 0
% 83.26/83.44 % gc_basic_clause_elim: 0
% 83.26/83.44 % parsing_time: 0.002
% 83.26/83.44 % sem_filter_time: 0.
% 83.26/83.44 % pred_elim_time: 0.042
% 83.26/83.44 % out_proof_time: 0.
% 83.26/83.44 % monotx_time: 0.
% 83.26/83.44 % subtype_inf_time: 0.
% 83.26/83.44 % unif_index_cands_time: 0.025
% 83.26/83.44 % unif_index_add_time: 0.017
% 83.26/83.44 % total_time: 43.793
% 83.26/83.44 % num_of_symbols: 123
% 83.26/83.44 % num_of_terms: 17249
% 83.26/83.44
% 83.26/83.44 % ------ Propositional Solver
% 83.26/83.44
% 83.26/83.44 % prop_solver_calls: 24
% 83.26/83.44 % prop_fast_solver_calls: 1951
% 83.26/83.44 % prop_num_of_clauses: 1858
% 83.26/83.44 % prop_preprocess_simplified: 3386
% 83.26/83.44 % prop_fo_subsumed: 0
% 83.26/83.44 % prop_solver_time: 0.001
% 83.26/83.44 % prop_fast_solver_time: 0.001
% 83.26/83.44 % prop_unsat_core_time: 0.
% 83.26/83.44
% 83.26/83.44 % ------ QBF
% 83.26/83.44
% 83.26/83.44 % qbf_q_res: 0
% 83.26/83.44 % qbf_num_tautologies: 0
% 83.26/83.44 % qbf_prep_cycles: 0
% 83.26/83.44
% 83.26/83.44 % ------ BMC1
% 83.26/83.44
% 83.26/83.44 % bmc1_current_bound: -1
% 83.26/83.44 % bmc1_last_solved_bound: -1
% 83.26/83.44 % bmc1_unsat_core_size: -1
% 83.26/83.44 % bmc1_unsat_core_parents_size: -1
% 83.26/83.44 % bmc1_merge_next_fun: 0
% 83.26/83.44 % bmc1_unsat_core_clauses_time: 0.
% 83.26/83.44
% 83.26/83.44 % ------ Instantiation
% 83.26/83.44
% 83.26/83.44 % inst_num_of_clauses: 1021
% 83.26/83.44 % inst_num_in_passive: 0
% 83.26/83.44 % inst_num_in_active: 1021
% 83.26/83.44 % inst_num_in_unprocessed: 0
% 83.26/83.44 % inst_num_of_loops: 1253
% 83.26/83.44 % inst_num_of_learning_restarts: 0
% 83.26/83.44 % inst_num_moves_active_passive: 201
% 83.26/83.44 % inst_lit_activity: 143
% 83.26/83.44 % inst_lit_activity_moves: 0
% 83.26/83.44 % inst_num_tautologies: 0
% 83.26/83.44 % inst_num_prop_implied: 0
% 83.26/83.44 % inst_num_existing_simplified: 0
% 83.26/83.44 % inst_num_eq_res_simplified: 0
% 83.26/83.44 % inst_num_child_elim: 0
% 83.26/83.44 % inst_num_of_dismatching_blockings: 81
% 83.26/83.44 % inst_num_of_non_proper_insts: 1415
% 83.26/83.44 % inst_num_of_duplicates: 157
% 83.26/83.44 % inst_inst_num_from_inst_to_res: 0
% 83.26/83.44 % inst_dismatching_checking_time: 0.001
% 83.26/83.44
% 83.26/83.44 % ------ Resolution
% 83.26/83.44
% 83.26/83.44 % res_num_of_clauses: 347048
% 83.26/83.44 % res_num_in_passive: 353605
% 83.26/83.44 % res_num_in_active: 3506
% 83.26/83.44 % res_num_of_loops: 5000
% 83.26/83.44 % res_forward_subset_subsumed: 272411
% 83.26/83.44 % res_backward_subset_subsumed: 10605
% 83.26/83.44 % res_forward_subsumed: 1083
% 83.26/83.44 % res_backward_subsumed: 21
% 83.26/83.44 % res_forward_subsumption_resolution: 2382
% 83.26/83.44 % res_backward_subsumption_resolution: 106
% 83.26/83.44 % res_clause_to_clause_subsumption: 23460
% 83.26/83.44 % res_orphan_elimination: 0
% 83.26/83.44 % res_tautology_del: 5517
% 83.26/83.44 % res_num_eq_res_simplified: 0
% 83.26/83.44 % res_num_sel_changes: 0
% 83.26/83.44 % res_moves_from_active_to_pass: 0
% 83.26/83.44
% 83.26/83.44 % Status Unknown
% 83.26/83.44 % Last status :
% 83.26/83.44 % SZS status Unknown
%------------------------------------------------------------------------------