TSTP Solution File: NLP198-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP198-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n029.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:13 EDT 2022
% Result : Unknown 29.10s 29.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP198-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.14/0.33 % Computer : n029.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Fri Jul 1 02:31:24 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.14/0.33 % 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/sandbox/tmp/iprover_proof_c1d306.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_80b229.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_2c7954 | grep -v "SZS"
% 0.19/0.42
% 0.19/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ iProver source info
% 0.19/0.42
% 0.19/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.42 % git: non_committed_changes: true
% 0.19/0.42 % git: last_make_outside_of_git: true
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.37/0.55 % --bmc1_dump_unsat_core_tptp false
% 0.37/0.55 % --bmc1_dump_file -
% 0.37/0.55 % --bmc1_ucm_expand_uc_limit 128
% 0.37/0.55 % --bmc1_ucm_n_expand_iterations 6
% 0.37/0.55 % --bmc1_ucm_extend_mode 1
% 0.37/0.55 % --bmc1_ucm_init_mode 2
% 0.37/0.55 % --bmc1_ucm_cone_mode none
% 0.37/0.55 % --bmc1_ucm_reduced_relation_type 0
% 0.37/0.55 % --bmc1_ucm_relax_model 4
% 0.37/0.55 % --bmc1_ucm_full_tr_after_sat true
% 0.37/0.55 % --bmc1_ucm_expand_neg_assumptions false
% 0.37/0.55 % --bmc1_ucm_layered_model none
% 0.37/0.55 % --bmc1_ucm_max_lemma_size 10
% 0.37/0.55
% 0.37/0.55 % ------ AIG Options
% 0.37/0.55
% 0.37/0.55 % --aig_mode false
% 0.37/0.55
% 0.37/0.55 % ------ Instantiation Options
% 0.37/0.55
% 0.37/0.55 % --instantiation_flag true
% 0.37/0.55 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.37/0.55 % --inst_solver_per_active 750
% 0.37/0.55 % --inst_solver_calls_frac 0.5
% 0.37/0.55 % --inst_passive_queue_type priority_queues
% 0.37/0.55 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.37/0.55 % --inst_passive_queues_freq [25;2]
% 0.37/0.55 % --inst_dismatching true
% 0.37/0.55 % --inst_eager_unprocessed_to_passive true
% 0.37/0.55 % --inst_prop_sim_given true
% 0.37/0.55 % --inst_prop_sim_new false
% 0.37/0.55 % --inst_orphan_elimination true
% 0.37/0.55 % --inst_learning_loop_flag true
% 0.37/0.55 % --inst_learning_start 3000
% 0.37/0.55 % --inst_learning_factor 2
% 0.37/0.55 % --inst_start_prop_sim_after_learn 3
% 0.37/0.55 % --inst_sel_renew solver
% 0.37/0.55 % --inst_lit_activity_flag true
% 0.37/0.55 % --inst_out_proof true
% 0.37/0.55
% 0.37/0.55 % ------ Resolution Options
% 0.37/0.55
% 0.37/0.55 % --resolution_flag true
% 0.37/0.55 % --res_lit_sel kbo_max
% 0.37/0.55 % --res_to_prop_solver none
% 0.37/0.55 % --res_prop_simpl_new false
% 0.37/0.55 % --res_prop_simpl_given false
% 0.37/0.55 % --res_passive_queue_type priority_queues
% 0.37/0.55 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.37/0.55 % --res_passive_queues_freq [15;5]
% 0.37/0.55 % --res_forward_subs full
% 0.37/0.55 % --res_backward_subs full
% 0.37/0.55 % --res_forward_subs_resolution true
% 0.37/0.55 % --res_backward_subs_resolution true
% 0.37/0.55 % --res_orphan_elimination false
% 0.37/0.55 % --res_time_limit 1000.
% 0.37/0.55 % --res_out_proof true
% 0.37/0.55 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c1d306.s
% 0.37/0.55 % --modulo true
% 0.37/0.55
% 0.37/0.55 % ------ Combination Options
% 0.37/0.55
% 0.37/0.55 % --comb_res_mult 1000
% 0.37/0.55 % --comb_inst_mult 300
% 0.37/0.55 % ------
% 0.37/0.55
% 0.37/0.55 % ------ Parsing...% successful
% 0.37/0.55
% 0.37/0.55 % ------ 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.55
% 0.37/0.55 % ------ Proving...
% 0.37/0.55 % ------ Problem Properties
% 0.37/0.55
% 0.37/0.55 %
% 0.37/0.55 % EPR false
% 0.37/0.55 % Horn false
% 0.37/0.55 % Has equality false
% 0.37/0.55
% 0.37/0.55 % % ------ Input Options Time Limit: Unbounded
% 0.37/0.55
% 0.37/0.55
% 0.37/0.55 % % ------ Current options:
% 0.37/0.55
% 0.37/0.55 % ------ Input Options
% 0.37/0.55
% 0.37/0.55 % --out_options all
% 0.37/0.55 % --tptp_safe_out true
% 0.37/0.55 % --problem_path ""
% 0.37/0.55 % --include_path ""
% 0.37/0.55 % --clausifier .//eprover
% 0.37/0.55 % --clausifier_options --tstp-format
% 0.37/0.55 % --stdin false
% 0.37/0.55 % --dbg_backtrace false
% 0.37/0.55 % --dbg_dump_prop_clauses false
% 0.37/0.55 % --dbg_dump_prop_clauses_file -
% 0.37/0.55 % --dbg_out_stat false
% 0.37/0.55
% 0.37/0.55 % ------ General Options
% 0.37/0.55
% 0.37/0.55 % --fof false
% 0.37/0.55 % --time_out_real 150.
% 0.37/0.55 % --time_out_prep_mult 0.2
% 0.37/0.55 % --time_out_virtual -1.
% 0.37/0.55 % --schedule none
% 0.37/0.55 % --ground_splitting input
% 0.37/0.55 % --splitting_nvd 16
% 0.37/0.55 % --non_eq_to_eq false
% 0.37/0.55 % --prep_gs_sim true
% 0.37/0.55 % --prep_unflatten false
% 0.37/0.55 % --prep_res_sim true
% 0.37/0.55 % --prep_upred true
% 0.37/0.55 % --res_sim_input true
% 0.37/0.55 % --clause_weak_htbl true
% 0.37/0.55 % --gc_record_bc_elim false
% 0.37/0.55 % --symbol_type_check false
% 0.37/0.55 % --clausify_out false
% 0.37/0.55 % --large_theory_mode false
% 0.37/0.55 % --prep_sem_filter none
% 0.37/0.55 % --prep_sem_filter_out false
% 0.37/0.55 % --preprocessed_out false
% 0.37/0.55 % --sub_typing false
% 0.37/0.55 % --brand_transform false
% 0.37/0.55 % --pure_diseq_elim true
% 0.37/0.55 % --min_unsat_core false
% 0.37/0.55 % --pred_elim true
% 0.37/0.55 % --add_important_lit false
% 0.37/0.55 % --soft_assumptions false
% 0.37/0.55 % --reset_solvers false
% 0.37/0.55 % --bc_imp_inh []
% 0.37/0.55 % --conj_cone_tolerance 1.5
% 0.37/0.55 % --prolific_symb_bound 500
% 0.37/0.55 % --lt_threshold 2000
% 0.37/0.55
% 0.37/0.55 % ------ SAT Options
% 0.37/0.55
% 0.37/0.55 % --sat_mode false
% 0.37/0.55 % --sat_fm_restart_options ""
% 0.37/0.55 % --sat_gr_def false
% 0.37/0.55 % --sat_epr_types true
% 0.37/0.55 % --sat_non_cyclic_types false
% 0.37/0.55 % --sat_finite_models false
% 0.37/0.55 % --sat_fm_lemmas false
% 0.37/0.55 % --sat_fm_prep false
% 0.37/0.55 % --sat_fm_uc_incr true
% 0.37/0.55 % --sat_out_model small
% 0.37/0.55 % --sat_out_clauses false
% 0.37/0.55
% 0.37/0.55 % ------ QBF Options
% 0.37/0.55
% 0.37/0.55 % --qbf_mode false
% 0.37/0.55 % --qbf_elim_univ true
% 0.37/0.55 % --qbf_sk_in true
% 0.37/0.55 % --qbf_pred_elim true
% 0.37/0.55 % --qbf_split 32
% 0.37/0.55
% 0.37/0.55 % ------ BMC1 Options
% 0.37/0.55
% 0.37/0.55 % --bmc1_incremental false
% 0.37/0.55 % --bmc1_axioms reachable_all
% 0.37/0.55 % --bmc1_min_bound 0
% 0.37/0.55 % --bmc1_max_bound -1
% 0.37/0.55 % --bmc1_max_bound_default -1
% 0.37/0.55 % --bmc1_symbol_reachability true
% 0.37/0.55 % --bmc1_property_lemmas false
% 0.37/0.55 % --bmc1_k_induction false
% 0.37/0.55 % --bmc1_non_equiv_states false
% 0.37/0.55 % --bmc1_deadlock false
% 0.37/0.55 % --bmc1_ucm false
% 0.37/0.55 % --bmc1_add_unsat_core none
% 0.37/0.55 % --bmc1_unsat_core_children false
% 0.37/0.55 % --bmc1_unsat_core_extrapolate_axioms false
% 0.37/0.55 % --bmc1_out_stat full
% 0.37/0.55 % --bmc1_ground_init false
% 0.37/0.55 % --bmc1_pre_inst_next_state false
% 0.37/0.55 % --bmc1_pre_inst_state false
% 0.37/0.55 % --bmc1_pre_inst_reach_state false
% 0.37/0.55 % --bmc1_out_unsat_core false
% 0.37/0.55 % --bmc1_aig_witness_out false
% 0.37/0.55 % --bmc1_verbose false
% 0.37/0.55 % --bmc1_dump_clauses_tptp false
% 0.37/0.55 % --bmc1_dump_unsat_core_tptp false
% 0.37/0.55 % --bmc1_dump_file -
% 0.37/0.55 % --bmc1_ucm_expand_uc_limit 128
% 0.37/0.55 % --bmc1_ucm_n_expand_iterations 6
% 0.37/0.55 % --bmc1_ucm_extend_mode 1
% 0.37/0.55 % --bmc1_ucm_init_mode 2
% 0.37/0.55 % --bmc1_ucm_cone_mode none
% 0.37/0.55 % --bmc1_ucm_reduced_relation_type 0
% 0.37/0.55 % --bmc1_ucm_relax_model 4
% 0.37/0.55 % --bmc1_ucm_full_tr_after_sat true
% 0.37/0.55 % --bmc1_ucm_expand_neg_assumptions false
% 0.37/0.55 % --bmc1_ucm_layered_model none
% 0.37/0.55 % --bmc1_ucm_max_lemma_size 10
% 0.37/0.55
% 0.37/0.55 % ------ AIG Options
% 0.37/0.55
% 0.37/0.55 % --aig_mode false
% 0.37/0.55
% 0.37/0.55 % ------ Instantiation Options
% 0.37/0.55
% 0.37/0.55 % --instantiation_flag true
% 0.37/0.55 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.37/0.55 % --inst_solver_per_active 750
% 0.37/0.55 % --inst_solver_calls_frac 0.5
% 0.37/0.55 % --inst_passive_queue_type priority_queues
% 0.37/0.55 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.37/0.55 % --inst_passive_queues_freq [25;2]
% 0.37/0.55 % --inst_dismatching true
% 0.37/0.55 % --inst_eager_unprocessed_to_passive true
% 14.74/14.94 % --inst_prop_sim_given true
% 14.74/14.94 % --inst_prop_sim_new false
% 14.74/14.94 % --inst_orphan_elimination true
% 14.74/14.94 % --inst_learning_loop_flag true
% 14.74/14.94 % --inst_learning_start 3000
% 14.74/14.94 % --inst_learning_factor 2
% 14.74/14.94 % --inst_start_prop_sim_after_learn 3
% 14.74/14.94 % --inst_sel_renew solver
% 14.74/14.94 % --inst_lit_activity_flag true
% 14.74/14.94 % --inst_out_proof true
% 14.74/14.94
% 14.74/14.94 % ------ Resolution Options
% 14.74/14.94
% 14.74/14.94 % --resolution_flag true
% 14.74/14.94 % --res_lit_sel kbo_max
% 14.74/14.94 % --res_to_prop_solver none
% 14.74/14.94 % --res_prop_simpl_new false
% 14.74/14.94 % --res_prop_simpl_given false
% 14.74/14.94 % --res_passive_queue_type priority_queues
% 14.74/14.94 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 14.74/14.94 % --res_passive_queues_freq [15;5]
% 14.74/14.94 % --res_forward_subs full
% 14.74/14.94 % --res_backward_subs full
% 14.74/14.94 % --res_forward_subs_resolution true
% 14.74/14.94 % --res_backward_subs_resolution true
% 14.74/14.94 % --res_orphan_elimination false
% 14.74/14.94 % --res_time_limit 1000.
% 14.74/14.94 % --res_out_proof true
% 14.74/14.94 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c1d306.s
% 14.74/14.94 % --modulo true
% 14.74/14.94
% 14.74/14.94 % ------ Combination Options
% 14.74/14.94
% 14.74/14.94 % --comb_res_mult 1000
% 14.74/14.94 % --comb_inst_mult 300
% 14.74/14.94 % ------
% 14.74/14.94
% 14.74/14.94
% 14.74/14.94
% 14.74/14.94 % ------ Proving...
% 14.74/14.94 % warning: shown sat in sat incomplete mode
% 14.74/14.94 %
% 14.74/14.94
% 14.74/14.94
% 14.74/14.94 ------ Building Model...Done
% 14.74/14.94
% 14.74/14.94 %------ The model is defined over ground terms (initial term algebra).
% 14.74/14.94 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 14.74/14.94 %------ where \phi is a formula over the term algebra.
% 14.74/14.94 %------ If we have equality in the problem then it is also defined as a predicate above,
% 14.74/14.94 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 14.74/14.94 %------ See help for --sat_out_model for different model outputs.
% 14.74/14.94 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 14.74/14.94 %------ where the first argument stands for the sort ($i in the unsorted case)
% 14.74/14.94
% 14.74/14.94
% 14.74/14.94
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of ssSkC0
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 ( ssSkC0 <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of actual_world
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0] :
% 14.74/14.94 ( ~(actual_world(X0)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of state
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( state(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc73 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 |
% 14.74/14.94 ? [X2,X3] :
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skf13(skc71,X2,X3) )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of of
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( of(X0,X1,X2) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc74 & X2=skc75 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 |
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc81 & X2=skc80 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of man
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( man(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc75 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of be
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2,X3] :
% 14.74/14.94 ( ~(be(X0,X1,X2,X3)) <=>
% 14.74/14.94 (
% 14.74/14.94 ? [X4,X5] :
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc73 & X2=skf16(skc78,skc71,X4) & X3=skf12(skf11(skc71,X5),skc71,skc78) )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 |
% 14.74/14.94 ? [X4,X5,X6,X7] :
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skf13(skc71,X4,X5) & X2=skf16(skc78,skc71,X6) & X3=skf12(skf11(skc71,X7),skc71,skc78) )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of forename
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( forename(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc74 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of jules_forename
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(jules_forename(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of wheel
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( wheel(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc72 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of behind
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( behind(X0,X1,X2) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc72 & X2=skc72 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of frontseat
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( frontseat(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc78 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of ssSkP1
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( ~(ssSkP1(X0,X1,X2)) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc78 & X1=skc76 & X2=skc71 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of ssSkP2
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( ~(ssSkP2(X0,X1,X2)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of ssSkP0
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(ssSkP0(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of group
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( group(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc76 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 |
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc77 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of two
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( two(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc77 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of coat
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( coat(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skf16(skc78,skc71,skc76) )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of black
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(black(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of cheap
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(cheap(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of hollywood_placename
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( hollywood_placename(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc81 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of placename
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(placename(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of in
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( ~(in(X0,X1,X2)) <=>
% 14.74/14.94 (
% 14.74/14.94 ? [X3,X4] :
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skf17(skc71,X3,X4) & X2=skc80 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 |
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skf12(skf16(skc78,skc71,skc76),skc71,skc78) & X2=skc78 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 |
% 14.74/14.94 ? [X3] :
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skf12(skf16(skc78,skc71,X3),skc71,skc78) & X2=skc78 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 |
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X2=skc78 )
% 14.74/14.94 &
% 14.74/14.94 ( X1!=skf12(skf11(skc71,X1),skc71,skc78) )
% 14.74/14.94 &
% 14.74/14.94 ( X1!=skf12(skf16(skc78,skc71,skc76),skc71,skc78) )
% 14.74/14.94 &
% 14.74/14.94 ( X1!=skf12(skf16(skc78,skc71,X1),skc71,skc78) )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 |
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X2=skc80 )
% 14.74/14.94 &
% 14.74/14.94 ( X1!=skc79 )
% 14.74/14.94 &
% 14.74/14.94 ( X1!=skf12(skf11(skc71,X1),skc71,skc80) )
% 14.74/14.94 &
% 14.74/14.94 ( X1!=skf12(skf16(skc78,skc71,X1),skc71,skc80) )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of down
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( ~(down(X0,X1,X2)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of lonely
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( lonely(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc80 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of street
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(street(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of city
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(city(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of agent
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( ~(agent(X0,X1,X2)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of old
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( old(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc82 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of dirty
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(dirty(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of white
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(white(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of chevy
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( chevy(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc82 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of event
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( event(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc79 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 |
% 14.74/14.94 ? [X2,X3] :
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skf17(skc71,X2,X3) )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of present
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(present(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of barrel
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( barrel(X0,X1) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc79 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of member
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( member(X0,X1,X2) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skf16(skc78,skc71,skc76) & X2=skc76 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of patient
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( ~(patient(X0,X1,X2)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of nonreflexive
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(nonreflexive(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of wear
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(wear(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of fellow
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(fellow(X0,X1)) <=>
% 14.74/14.94 (
% 14.74/14.94 ? [X2] :
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skf11(skc71,X2) )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of young
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1] :
% 14.74/14.94 ( ~(young(X0,X1)) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of sP2_iProver_split
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( sP2_iProver_split(X0,X1,X2) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of sP5_iProver_split
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( sP5_iProver_split(X0,X1,X2) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc72 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of sP7_iProver_split
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2,X3,X4,X5] :
% 14.74/14.94 ( sP7_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of sP8_iProver_split
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( sP8_iProver_split(X0,X1,X2) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of sP10_iProver_split
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2,X3,X4,X5] :
% 14.74/14.94 ( ~(sP10_iProver_split(X0,X1,X2,X3,X4,X5)) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc81 & X2=skc80 & X3=skc82 & X4=skc77 & X5=skc79 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of sP11_iProver_split
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( sP11_iProver_split(X0,X1,X2) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc76 )
% 14.74/14.94 &
% 14.74/14.94 ( X2!=skc79 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 |
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc77 )
% 14.74/14.94 &
% 14.74/14.94 ( X2!=skc79 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of sP14_iProver_split
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( sP14_iProver_split(X0,X1,X2) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of sP17_iProver_split
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( sP17_iProver_split(X0,X1,X2) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc72 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of sP19_iProver_split
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2,X3,X4,X5] :
% 14.74/14.94 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of sP20_iProver_split
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( sP20_iProver_split(X0,X1,X2) <=>
% 14.74/14.94 $false
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Negative definition of sP22_iProver_split
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2,X3,X4,X5] :
% 14.74/14.94 ( ~(sP22_iProver_split(X0,X1,X2,X3,X4,X5)) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc81 & X2=skc80 & X3=skc82 & X4=skc77 & X5=skc79 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94 %------ Positive definition of sP23_iProver_split
% 14.74/14.94 fof(lit_def,axiom,
% 14.74/14.94 (! [X0,X1,X2] :
% 14.74/14.94 ( sP23_iProver_split(X0,X1,X2) <=>
% 14.74/14.94 (
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc76 )
% 14.74/14.94 &
% 14.74/14.94 ( X2!=skc79 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 |
% 14.74/14.94 (
% 14.74/14.94 ( X0=skc71 & X1=skc77 )
% 14.74/14.94 &
% 14.74/14.94 ( X2!=skc79 )
% 14.74/14.94 )
% 14.74/14.94
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 )
% 14.74/14.94 ).
% 14.74/14.94
% 14.74/14.94
% 14.74/14.94
% 14.74/14.94 % ------ Statistics
% 14.74/14.94
% 14.74/14.94 % ------ General
% 14.74/14.94
% 14.74/14.94 % num_of_input_clauses: 92
% 14.74/14.94 % num_of_input_neg_conjectures: 92
% 14.74/14.94 % num_of_splits: 24
% 14.74/14.94 % num_of_split_atoms: 24
% 14.74/14.94 % num_of_sem_filtered_clauses: 0
% 14.74/14.94 % num_of_subtypes: 0
% 14.74/14.94 % monotx_restored_types: 0
% 14.74/14.94 % sat_num_of_epr_types: 0
% 14.74/14.94 % sat_num_of_non_cyclic_types: 0
% 14.74/14.94 % sat_guarded_non_collapsed_types: 0
% 14.74/14.94 % is_epr: 0
% 14.74/14.94 % is_horn: 0
% 14.74/14.94 % has_eq: 0
% 14.74/14.94 % num_pure_diseq_elim: 0
% 14.74/14.94 % simp_replaced_by: 0
% 14.74/14.94 % res_preprocessed: 208
% 14.74/14.94 % prep_upred: 0
% 14.74/14.94 % prep_unflattend: 0
% 14.74/14.94 % pred_elim_cands: 24
% 14.74/14.94 % pred_elim: 8
% 14.74/14.94 % pred_elim_cl: 8
% 14.74/14.94 % pred_elim_cycles: 40
% 14.74/14.94 % forced_gc_time: 0
% 14.74/14.94 % gc_basic_clause_elim: 0
% 14.74/14.94 % parsing_time: 0.005
% 14.74/14.94 % sem_filter_time: 0.
% 14.74/14.94 % pred_elim_time: 0.098
% 14.74/14.94 % out_proof_time: 0.
% 14.74/14.94 % monotx_time: 0.
% 14.74/14.94 % subtype_inf_time: 0.
% 14.74/14.94 % unif_index_cands_time: 0.01
% 14.74/14.94 % unif_index_add_time: 0.006
% 14.74/14.94 % total_time: 14.535
% 14.74/14.94 % num_of_symbols: 122
% 14.74/14.94 % num_of_terms: 15845
% 14.74/14.94
% 14.74/14.94 % ------ Propositional Solver
% 14.74/14.94
% 14.74/14.94 % prop_solver_calls: 19
% 14.74/14.94 % prop_fast_solver_calls: 2023
% 14.74/14.94 % prop_num_of_clauses: 1377
% 14.74/14.94 % prop_preprocess_simplified: 2803
% 14.74/14.94 % prop_fo_subsumed: 0
% 14.74/14.94 % prop_solver_time: 0.
% 14.74/14.94 % prop_fast_solver_time: 0.004
% 14.74/14.94 % prop_unsat_core_time: 0.
% 14.74/14.94
% 14.74/14.94 % ------ QBF
% 14.74/14.94
% 14.74/14.94 % qbf_q_res: 0
% 14.74/14.94 % qbf_num_tautologies: 0
% 14.74/14.94 % qbf_prep_cycles: 0
% 14.74/14.94
% 14.74/14.94 % ------ BMC1
% 14.74/14.94
% 14.74/14.94 % bmc1_current_bound: -1
% 14.74/14.94 % bmc1_last_solved_bound: -1
% 14.74/14.94 % bmc1_unsat_core_size: -1
% 14.74/14.94 % bmc1_unsat_core_parents_size: -1
% 14.74/14.94 % bmc1_merge_next_fun: 0
% 14.74/14.94 % bmc1_unsat_core_clauses_time: 0.
% 14.74/14.94
% 14.74/14.94 % ------ Instantiation
% 14.74/14.94
% 14.74/14.94 % inst_num_of_clauses: 709
% 14.74/14.94 % inst_num_in_passive: 0
% 14.74/14.94 % inst_num_in_active: 709
% 14.74/14.94 % inst_num_in_unprocessed: 0
% 14.74/14.94 % inst_num_of_loops: 885
% 14.74/14.94 % inst_num_of_learning_restarts: 0
% 14.74/14.94 % inst_num_moves_active_passive: 150
% 14.74/14.94 % inst_lit_activity: 110
% 14.74/14.94 % inst_lit_activity_moves: 0
% 14.74/14.94 % inst_num_tautologies: 0
% 14.74/14.94 % inst_num_prop_implied: 0
% 14.74/14.94 % inst_num_existing_simplified: 0
% 14.74/14.94 % inst_num_eq_res_simplified: 0
% 14.74/14.94 % inst_num_child_elim: 0
% 14.74/14.94 % inst_num_of_dismatching_blockings: 67
% 14.74/14.94 % inst_num_of_non_proper_insts: 960
% 14.74/14.94 % inst_num_of_duplicates: 395
% 14.74/14.94 % inst_inst_num_from_inst_to_res: 0
% 14.74/14.94 % inst_dismatching_checking_time: 0.
% 14.74/14.94
% 14.74/14.94 % ------ Resolution
% 14.74/14.94
% 14.74/14.94 % res_num_of_clauses: 147322
% 14.74/14.94 % res_num_in_passive: 144735
% 14.74/14.94 % res_num_in_active: 2591
% 14.74/14.94 % res_num_of_loops: 3000
% 14.74/14.94 % res_forward_subset_subsumed: 99138
% 14.74/14.94 % res_backward_subset_subsumed: 7
% 14.74/14.94 % res_forward_subsumed: 308
% 14.74/14.94 % res_backward_subsumed: 34
% 14.74/14.94 % res_forward_subsumption_resolution: 314
% 14.74/14.94 % res_backward_subsumption_resolution: 0
% 14.74/14.94 % res_clause_to_clause_subsumption: 6019
% 14.74/14.94 % res_orphan_elimination: 0
% 14.74/14.94 % res_tautology_del: 938
% 14.74/14.94 % res_num_eq_res_simplified: 0
% 14.74/14.94 % res_num_sel_changes: 0
% 14.74/14.94 % res_moves_from_active_to_pass: 0
% 14.74/14.94
% 14.74/14.94 % Status Unknown
% 14.79/14.99 % Orienting using strategy ClausalAll
% 14.79/14.99 % Orientation found
% 14.79/14.99 % 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_c1d306.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_80b229.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_b72367 | grep -v "SZS"
% 14.79/15.00
% 14.79/15.00 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 14.79/15.00
% 14.79/15.00 %
% 14.79/15.00 % ------ iProver source info
% 14.79/15.00
% 14.79/15.00 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 14.79/15.00 % git: non_committed_changes: true
% 14.79/15.00 % git: last_make_outside_of_git: true
% 14.79/15.00
% 14.79/15.00 %
% 14.79/15.00 % ------ Input Options
% 14.79/15.00
% 14.79/15.00 % --out_options all
% 14.79/15.00 % --tptp_safe_out true
% 14.79/15.00 % --problem_path ""
% 14.79/15.00 % --include_path ""
% 14.79/15.00 % --clausifier .//eprover
% 14.79/15.00 % --clausifier_options --tstp-format
% 14.79/15.00 % --stdin false
% 14.79/15.00 % --dbg_backtrace false
% 14.79/15.00 % --dbg_dump_prop_clauses false
% 14.79/15.00 % --dbg_dump_prop_clauses_file -
% 14.79/15.00 % --dbg_out_stat false
% 14.79/15.00
% 14.79/15.00 % ------ General Options
% 14.79/15.00
% 14.79/15.00 % --fof false
% 14.79/15.00 % --time_out_real 150.
% 14.79/15.00 % --time_out_prep_mult 0.2
% 14.79/15.00 % --time_out_virtual -1.
% 14.79/15.00 % --schedule none
% 14.79/15.00 % --ground_splitting input
% 14.79/15.00 % --splitting_nvd 16
% 14.79/15.00 % --non_eq_to_eq false
% 14.79/15.00 % --prep_gs_sim true
% 14.79/15.00 % --prep_unflatten false
% 14.79/15.00 % --prep_res_sim true
% 14.79/15.00 % --prep_upred true
% 14.79/15.00 % --res_sim_input true
% 14.79/15.00 % --clause_weak_htbl true
% 14.79/15.00 % --gc_record_bc_elim false
% 14.79/15.00 % --symbol_type_check false
% 14.79/15.00 % --clausify_out false
% 14.79/15.00 % --large_theory_mode false
% 14.79/15.00 % --prep_sem_filter none
% 14.79/15.00 % --prep_sem_filter_out false
% 14.79/15.00 % --preprocessed_out false
% 14.79/15.00 % --sub_typing false
% 14.79/15.00 % --brand_transform false
% 14.79/15.00 % --pure_diseq_elim true
% 14.79/15.00 % --min_unsat_core false
% 14.79/15.00 % --pred_elim true
% 14.79/15.00 % --add_important_lit false
% 14.79/15.00 % --soft_assumptions false
% 14.79/15.00 % --reset_solvers false
% 14.79/15.00 % --bc_imp_inh []
% 14.79/15.00 % --conj_cone_tolerance 1.5
% 14.79/15.00 % --prolific_symb_bound 500
% 14.79/15.00 % --lt_threshold 2000
% 14.79/15.00
% 14.79/15.00 % ------ SAT Options
% 14.79/15.00
% 14.79/15.00 % --sat_mode false
% 14.79/15.00 % --sat_fm_restart_options ""
% 14.79/15.00 % --sat_gr_def false
% 14.79/15.00 % --sat_epr_types true
% 14.79/15.00 % --sat_non_cyclic_types false
% 14.79/15.00 % --sat_finite_models false
% 14.79/15.00 % --sat_fm_lemmas false
% 14.79/15.00 % --sat_fm_prep false
% 14.79/15.00 % --sat_fm_uc_incr true
% 14.79/15.00 % --sat_out_model small
% 14.79/15.00 % --sat_out_clauses false
% 14.79/15.00
% 14.79/15.00 % ------ QBF Options
% 14.79/15.00
% 14.79/15.00 % --qbf_mode false
% 14.79/15.00 % --qbf_elim_univ true
% 14.79/15.00 % --qbf_sk_in true
% 14.79/15.00 % --qbf_pred_elim true
% 14.79/15.00 % --qbf_split 32
% 14.79/15.00
% 14.79/15.00 % ------ BMC1 Options
% 14.79/15.00
% 14.79/15.00 % --bmc1_incremental false
% 14.79/15.00 % --bmc1_axioms reachable_all
% 14.79/15.00 % --bmc1_min_bound 0
% 14.79/15.00 % --bmc1_max_bound -1
% 14.79/15.00 % --bmc1_max_bound_default -1
% 14.79/15.00 % --bmc1_symbol_reachability true
% 14.79/15.00 % --bmc1_property_lemmas false
% 14.79/15.00 % --bmc1_k_induction false
% 14.79/15.00 % --bmc1_non_equiv_states false
% 14.79/15.00 % --bmc1_deadlock false
% 14.79/15.00 % --bmc1_ucm false
% 14.79/15.00 % --bmc1_add_unsat_core none
% 14.79/15.00 % --bmc1_unsat_core_children false
% 14.79/15.00 % --bmc1_unsat_core_extrapolate_axioms false
% 14.79/15.00 % --bmc1_out_stat full
% 14.79/15.00 % --bmc1_ground_init false
% 14.79/15.00 % --bmc1_pre_inst_next_state false
% 14.79/15.00 % --bmc1_pre_inst_state false
% 14.79/15.00 % --bmc1_pre_inst_reach_state false
% 14.79/15.00 % --bmc1_out_unsat_core false
% 14.79/15.00 % --bmc1_aig_witness_out false
% 14.79/15.00 % --bmc1_verbose false
% 14.79/15.00 % --bmc1_dump_clauses_tptp false
% 14.83/15.06 % --bmc1_dump_unsat_core_tptp false
% 14.83/15.06 % --bmc1_dump_file -
% 14.83/15.06 % --bmc1_ucm_expand_uc_limit 128
% 14.83/15.06 % --bmc1_ucm_n_expand_iterations 6
% 14.83/15.06 % --bmc1_ucm_extend_mode 1
% 14.83/15.06 % --bmc1_ucm_init_mode 2
% 14.83/15.06 % --bmc1_ucm_cone_mode none
% 14.83/15.06 % --bmc1_ucm_reduced_relation_type 0
% 14.83/15.06 % --bmc1_ucm_relax_model 4
% 14.83/15.06 % --bmc1_ucm_full_tr_after_sat true
% 14.83/15.06 % --bmc1_ucm_expand_neg_assumptions false
% 14.83/15.06 % --bmc1_ucm_layered_model none
% 14.83/15.06 % --bmc1_ucm_max_lemma_size 10
% 14.83/15.06
% 14.83/15.06 % ------ AIG Options
% 14.83/15.06
% 14.83/15.06 % --aig_mode false
% 14.83/15.06
% 14.83/15.06 % ------ Instantiation Options
% 14.83/15.06
% 14.83/15.06 % --instantiation_flag true
% 14.83/15.06 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 14.83/15.06 % --inst_solver_per_active 750
% 14.83/15.06 % --inst_solver_calls_frac 0.5
% 14.83/15.06 % --inst_passive_queue_type priority_queues
% 14.83/15.06 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 14.83/15.06 % --inst_passive_queues_freq [25;2]
% 14.83/15.06 % --inst_dismatching true
% 14.83/15.06 % --inst_eager_unprocessed_to_passive true
% 14.83/15.06 % --inst_prop_sim_given true
% 14.83/15.06 % --inst_prop_sim_new false
% 14.83/15.06 % --inst_orphan_elimination true
% 14.83/15.06 % --inst_learning_loop_flag true
% 14.83/15.06 % --inst_learning_start 3000
% 14.83/15.06 % --inst_learning_factor 2
% 14.83/15.06 % --inst_start_prop_sim_after_learn 3
% 14.83/15.06 % --inst_sel_renew solver
% 14.83/15.06 % --inst_lit_activity_flag true
% 14.83/15.06 % --inst_out_proof true
% 14.83/15.06
% 14.83/15.06 % ------ Resolution Options
% 14.83/15.06
% 14.83/15.06 % --resolution_flag true
% 14.83/15.06 % --res_lit_sel kbo_max
% 14.83/15.06 % --res_to_prop_solver none
% 14.83/15.06 % --res_prop_simpl_new false
% 14.83/15.06 % --res_prop_simpl_given false
% 14.83/15.06 % --res_passive_queue_type priority_queues
% 14.83/15.06 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 14.83/15.06 % --res_passive_queues_freq [15;5]
% 14.83/15.06 % --res_forward_subs full
% 14.83/15.06 % --res_backward_subs full
% 14.83/15.06 % --res_forward_subs_resolution true
% 14.83/15.06 % --res_backward_subs_resolution true
% 14.83/15.06 % --res_orphan_elimination false
% 14.83/15.06 % --res_time_limit 1000.
% 14.83/15.06 % --res_out_proof true
% 14.83/15.06 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c1d306.s
% 14.83/15.06 % --modulo true
% 14.83/15.06
% 14.83/15.06 % ------ Combination Options
% 14.83/15.06
% 14.83/15.06 % --comb_res_mult 1000
% 14.83/15.06 % --comb_inst_mult 300
% 14.83/15.06 % ------
% 14.83/15.06
% 14.83/15.06 % ------ Parsing...% successful
% 14.83/15.06
% 14.83/15.06 % ------ 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 %
% 14.83/15.06
% 14.83/15.06 % ------ Proving...
% 14.83/15.06 % ------ Problem Properties
% 14.83/15.06
% 14.83/15.06 %
% 14.83/15.06 % EPR false
% 14.83/15.06 % Horn false
% 14.83/15.06 % Has equality false
% 14.83/15.06
% 14.83/15.06 % % ------ Input Options Time Limit: Unbounded
% 14.83/15.06
% 14.83/15.06
% 14.83/15.06 % % ------ Current options:
% 14.83/15.06
% 14.83/15.06 % ------ Input Options
% 14.83/15.06
% 14.83/15.06 % --out_options all
% 14.83/15.06 % --tptp_safe_out true
% 14.83/15.06 % --problem_path ""
% 14.83/15.06 % --include_path ""
% 14.83/15.06 % --clausifier .//eprover
% 14.83/15.06 % --clausifier_options --tstp-format
% 14.83/15.06 % --stdin false
% 14.83/15.06 % --dbg_backtrace false
% 14.83/15.06 % --dbg_dump_prop_clauses false
% 14.83/15.06 % --dbg_dump_prop_clauses_file -
% 14.83/15.06 % --dbg_out_stat false
% 14.83/15.06
% 14.83/15.06 % ------ General Options
% 14.83/15.06
% 14.83/15.06 % --fof false
% 14.83/15.06 % --time_out_real 150.
% 14.83/15.06 % --time_out_prep_mult 0.2
% 14.83/15.06 % --time_out_virtual -1.
% 14.83/15.06 % --schedule none
% 14.83/15.06 % --ground_splitting input
% 14.83/15.06 % --splitting_nvd 16
% 14.83/15.06 % --non_eq_to_eq false
% 14.83/15.06 % --prep_gs_sim true
% 14.83/15.06 % --prep_unflatten false
% 14.83/15.06 % --prep_res_sim true
% 14.83/15.06 % --prep_upred true
% 14.83/15.06 % --res_sim_input true
% 14.83/15.06 % --clause_weak_htbl true
% 14.83/15.06 % --gc_record_bc_elim false
% 14.83/15.06 % --symbol_type_check false
% 14.83/15.06 % --clausify_out false
% 14.83/15.06 % --large_theory_mode false
% 14.83/15.06 % --prep_sem_filter none
% 14.83/15.06 % --prep_sem_filter_out false
% 14.83/15.06 % --preprocessed_out false
% 14.83/15.06 % --sub_typing false
% 14.83/15.06 % --brand_transform false
% 14.83/15.06 % --pure_diseq_elim true
% 14.83/15.06 % --min_unsat_core false
% 14.83/15.06 % --pred_elim true
% 14.83/15.06 % --add_important_lit false
% 14.83/15.06 % --soft_assumptions false
% 14.83/15.06 % --reset_solvers false
% 14.83/15.06 % --bc_imp_inh []
% 14.83/15.06 % --conj_cone_tolerance 1.5
% 14.83/15.06 % --prolific_symb_bound 500
% 14.83/15.06 % --lt_threshold 2000
% 14.83/15.06
% 14.83/15.06 % ------ SAT Options
% 14.83/15.06
% 14.83/15.06 % --sat_mode false
% 14.83/15.06 % --sat_fm_restart_options ""
% 14.83/15.06 % --sat_gr_def false
% 14.83/15.06 % --sat_epr_types true
% 14.83/15.06 % --sat_non_cyclic_types false
% 14.83/15.06 % --sat_finite_models false
% 14.83/15.06 % --sat_fm_lemmas false
% 14.83/15.06 % --sat_fm_prep false
% 14.83/15.06 % --sat_fm_uc_incr true
% 14.83/15.06 % --sat_out_model small
% 14.83/15.06 % --sat_out_clauses false
% 14.83/15.06
% 14.83/15.06 % ------ QBF Options
% 14.83/15.06
% 14.83/15.06 % --qbf_mode false
% 14.83/15.06 % --qbf_elim_univ true
% 14.83/15.06 % --qbf_sk_in true
% 14.83/15.06 % --qbf_pred_elim true
% 14.83/15.06 % --qbf_split 32
% 14.83/15.06
% 14.83/15.06 % ------ BMC1 Options
% 14.83/15.06
% 14.83/15.06 % --bmc1_incremental false
% 14.83/15.06 % --bmc1_axioms reachable_all
% 14.83/15.06 % --bmc1_min_bound 0
% 14.83/15.06 % --bmc1_max_bound -1
% 14.83/15.07 % --bmc1_max_bound_default -1
% 14.83/15.07 % --bmc1_symbol_reachability true
% 14.83/15.07 % --bmc1_property_lemmas false
% 14.83/15.07 % --bmc1_k_induction false
% 14.83/15.07 % --bmc1_non_equiv_states false
% 14.83/15.07 % --bmc1_deadlock false
% 14.83/15.07 % --bmc1_ucm false
% 14.83/15.07 % --bmc1_add_unsat_core none
% 14.83/15.07 % --bmc1_unsat_core_children false
% 14.83/15.07 % --bmc1_unsat_core_extrapolate_axioms false
% 14.83/15.07 % --bmc1_out_stat full
% 14.83/15.07 % --bmc1_ground_init false
% 14.83/15.07 % --bmc1_pre_inst_next_state false
% 14.83/15.07 % --bmc1_pre_inst_state false
% 14.83/15.07 % --bmc1_pre_inst_reach_state false
% 14.83/15.07 % --bmc1_out_unsat_core false
% 14.83/15.07 % --bmc1_aig_witness_out false
% 14.83/15.07 % --bmc1_verbose false
% 14.83/15.07 % --bmc1_dump_clauses_tptp false
% 14.83/15.07 % --bmc1_dump_unsat_core_tptp false
% 14.83/15.07 % --bmc1_dump_file -
% 14.83/15.07 % --bmc1_ucm_expand_uc_limit 128
% 14.83/15.07 % --bmc1_ucm_n_expand_iterations 6
% 14.83/15.07 % --bmc1_ucm_extend_mode 1
% 14.83/15.07 % --bmc1_ucm_init_mode 2
% 14.83/15.07 % --bmc1_ucm_cone_mode none
% 14.83/15.07 % --bmc1_ucm_reduced_relation_type 0
% 14.83/15.07 % --bmc1_ucm_relax_model 4
% 14.83/15.07 % --bmc1_ucm_full_tr_after_sat true
% 14.83/15.07 % --bmc1_ucm_expand_neg_assumptions false
% 14.83/15.07 % --bmc1_ucm_layered_model none
% 14.83/15.07 % --bmc1_ucm_max_lemma_size 10
% 14.83/15.07
% 14.83/15.07 % ------ AIG Options
% 14.83/15.07
% 14.83/15.07 % --aig_mode false
% 14.83/15.07
% 14.83/15.07 % ------ Instantiation Options
% 14.83/15.07
% 14.83/15.07 % --instantiation_flag true
% 14.83/15.07 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 14.83/15.07 % --inst_solver_per_active 750
% 14.83/15.07 % --inst_solver_calls_frac 0.5
% 14.83/15.07 % --inst_passive_queue_type priority_queues
% 14.83/15.07 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 14.83/15.07 % --inst_passive_queues_freq [25;2]
% 14.83/15.07 % --inst_dismatching true
% 14.83/15.07 % --inst_eager_unprocessed_to_passive true
% 29.10/29.32 % --inst_prop_sim_given true
% 29.10/29.32 % --inst_prop_sim_new false
% 29.10/29.32 % --inst_orphan_elimination true
% 29.10/29.32 % --inst_learning_loop_flag true
% 29.10/29.32 % --inst_learning_start 3000
% 29.10/29.32 % --inst_learning_factor 2
% 29.10/29.32 % --inst_start_prop_sim_after_learn 3
% 29.10/29.32 % --inst_sel_renew solver
% 29.10/29.32 % --inst_lit_activity_flag true
% 29.10/29.32 % --inst_out_proof true
% 29.10/29.32
% 29.10/29.32 % ------ Resolution Options
% 29.10/29.32
% 29.10/29.32 % --resolution_flag true
% 29.10/29.32 % --res_lit_sel kbo_max
% 29.10/29.32 % --res_to_prop_solver none
% 29.10/29.32 % --res_prop_simpl_new false
% 29.10/29.32 % --res_prop_simpl_given false
% 29.10/29.32 % --res_passive_queue_type priority_queues
% 29.10/29.32 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 29.10/29.32 % --res_passive_queues_freq [15;5]
% 29.10/29.32 % --res_forward_subs full
% 29.10/29.32 % --res_backward_subs full
% 29.10/29.32 % --res_forward_subs_resolution true
% 29.10/29.32 % --res_backward_subs_resolution true
% 29.10/29.32 % --res_orphan_elimination false
% 29.10/29.32 % --res_time_limit 1000.
% 29.10/29.32 % --res_out_proof true
% 29.10/29.32 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c1d306.s
% 29.10/29.32 % --modulo true
% 29.10/29.32
% 29.10/29.32 % ------ Combination Options
% 29.10/29.32
% 29.10/29.32 % --comb_res_mult 1000
% 29.10/29.32 % --comb_inst_mult 300
% 29.10/29.32 % ------
% 29.10/29.32
% 29.10/29.32
% 29.10/29.32
% 29.10/29.32 % ------ Proving...
% 29.10/29.32 % warning: shown sat in sat incomplete mode
% 29.10/29.32 %
% 29.10/29.32
% 29.10/29.32
% 29.10/29.32 ------ Building Model...Done
% 29.10/29.32
% 29.10/29.32 %------ The model is defined over ground terms (initial term algebra).
% 29.10/29.32 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 29.10/29.32 %------ where \phi is a formula over the term algebra.
% 29.10/29.32 %------ If we have equality in the problem then it is also defined as a predicate above,
% 29.10/29.32 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 29.10/29.32 %------ See help for --sat_out_model for different model outputs.
% 29.10/29.32 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 29.10/29.32 %------ where the first argument stands for the sort ($i in the unsorted case)
% 29.10/29.32
% 29.10/29.32
% 29.10/29.32
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of ssSkC0
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 ( ssSkC0 <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of actual_world
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0] :
% 29.10/29.32 ( ~(actual_world(X0)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of state
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( state(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc73 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 |
% 29.10/29.32 ? [X2,X3] :
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skf13(skc71,X2,X3) )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of of
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( of(X0,X1,X2) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc74 & X2=skc75 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 |
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc81 & X2=skc80 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of man
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( man(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc75 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of be
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2,X3] :
% 29.10/29.32 ( ~(be(X0,X1,X2,X3)) <=>
% 29.10/29.32 (
% 29.10/29.32 ? [X4,X5] :
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc73 & X2=skf16(skc78,skc71,X4) & X3=skf12(skf11(skc71,X5),skc71,skc78) )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 |
% 29.10/29.32 ? [X4,X5,X6,X7] :
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skf13(skc71,X4,X5) & X2=skf16(skc78,skc71,X6) & X3=skf12(skf11(skc71,X7),skc71,skc78) )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of forename
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( forename(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc74 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of jules_forename
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(jules_forename(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of wheel
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( wheel(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc72 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of behind
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( behind(X0,X1,X2) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc72 & X2=skc72 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of frontseat
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( frontseat(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc78 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of ssSkP1
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( ~(ssSkP1(X0,X1,X2)) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc78 & X1=skc76 & X2=skc71 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of ssSkP2
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( ~(ssSkP2(X0,X1,X2)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of ssSkP0
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(ssSkP0(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of group
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( group(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc76 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 |
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc77 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of two
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( two(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc77 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of coat
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( coat(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skf16(skc78,skc71,skc76) )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of black
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(black(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of cheap
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(cheap(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of hollywood_placename
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( hollywood_placename(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc81 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of placename
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(placename(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of in
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( ~(in(X0,X1,X2)) <=>
% 29.10/29.32 (
% 29.10/29.32 ? [X3,X4] :
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skf17(skc71,X3,X4) & X2=skc80 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 |
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skf12(skf16(skc78,skc71,skc76),skc71,skc78) & X2=skc78 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 |
% 29.10/29.32 ? [X3] :
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skf12(skf16(skc78,skc71,X3),skc71,skc78) & X2=skc78 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 |
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X2=skc78 )
% 29.10/29.32 &
% 29.10/29.32 ( X1!=skf12(skf11(skc71,X1),skc71,skc78) )
% 29.10/29.32 &
% 29.10/29.32 ( X1!=skf12(skf16(skc78,skc71,skc76),skc71,skc78) )
% 29.10/29.32 &
% 29.10/29.32 ( X1!=skf12(skf16(skc78,skc71,X1),skc71,skc78) )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 |
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X2=skc80 )
% 29.10/29.32 &
% 29.10/29.32 ( X1!=skc79 )
% 29.10/29.32 &
% 29.10/29.32 ( X1!=skf12(skf11(skc71,X1),skc71,skc80) )
% 29.10/29.32 &
% 29.10/29.32 ( X1!=skf12(skf16(skc78,skc71,X1),skc71,skc80) )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of down
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( ~(down(X0,X1,X2)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of lonely
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( lonely(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc80 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of street
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(street(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of city
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(city(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of agent
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( ~(agent(X0,X1,X2)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of old
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( old(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc82 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of dirty
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(dirty(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of white
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(white(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of chevy
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( chevy(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc82 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of event
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( event(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc79 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 |
% 29.10/29.32 ? [X2,X3] :
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skf17(skc71,X2,X3) )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of present
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(present(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of barrel
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( barrel(X0,X1) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc79 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of member
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( member(X0,X1,X2) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skf16(skc78,skc71,skc76) & X2=skc76 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of patient
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( ~(patient(X0,X1,X2)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of nonreflexive
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(nonreflexive(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of wear
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(wear(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of fellow
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(fellow(X0,X1)) <=>
% 29.10/29.32 (
% 29.10/29.32 ? [X2] :
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skf11(skc71,X2) )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of young
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1] :
% 29.10/29.32 ( ~(young(X0,X1)) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of sP2_iProver_split
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( sP2_iProver_split(X0,X1,X2) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of sP5_iProver_split
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( sP5_iProver_split(X0,X1,X2) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc72 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of sP7_iProver_split
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2,X3,X4,X5] :
% 29.10/29.32 ( sP7_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of sP8_iProver_split
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( sP8_iProver_split(X0,X1,X2) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Negative definition of sP10_iProver_split
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2,X3,X4,X5] :
% 29.10/29.32 ( ~(sP10_iProver_split(X0,X1,X2,X3,X4,X5)) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc81 & X2=skc80 & X3=skc82 & X4=skc77 & X5=skc79 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of sP11_iProver_split
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( sP11_iProver_split(X0,X1,X2) <=>
% 29.10/29.32 (
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc76 )
% 29.10/29.32 &
% 29.10/29.32 ( X2!=skc79 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 |
% 29.10/29.32 (
% 29.10/29.32 ( X0=skc71 & X1=skc77 )
% 29.10/29.32 &
% 29.10/29.32 ( X2!=skc79 )
% 29.10/29.32 )
% 29.10/29.32
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of sP14_iProver_split
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( sP14_iProver_split(X0,X1,X2) <=>
% 29.10/29.32 $false
% 29.10/29.32 )
% 29.10/29.32 )
% 29.10/29.32 ).
% 29.10/29.32
% 29.10/29.32 %------ Positive definition of sP17_iProver_split
% 29.10/29.32 fof(lit_def,axiom,
% 29.10/29.32 (! [X0,X1,X2] :
% 29.10/29.32 ( sP17_iProver_split(X0,X1,X2) <=>
% 29.10/29.33 (
% 29.10/29.33 (
% 29.10/29.33 ( X0=skc71 & X1=skc72 )
% 29.10/29.33 )
% 29.10/29.33
% 29.10/29.33 )
% 29.10/29.33 )
% 29.10/29.33 )
% 29.10/29.33 ).
% 29.10/29.33
% 29.10/29.33 %------ Positive definition of sP19_iProver_split
% 29.10/29.33 fof(lit_def,axiom,
% 29.10/29.33 (! [X0,X1,X2,X3,X4,X5] :
% 29.10/29.33 ( sP19_iProver_split(X0,X1,X2,X3,X4,X5) <=>
% 29.10/29.33 $false
% 29.10/29.33 )
% 29.10/29.33 )
% 29.10/29.33 ).
% 29.10/29.33
% 29.10/29.33 %------ Positive definition of sP20_iProver_split
% 29.10/29.33 fof(lit_def,axiom,
% 29.10/29.33 (! [X0,X1,X2] :
% 29.10/29.33 ( sP20_iProver_split(X0,X1,X2) <=>
% 29.10/29.33 $false
% 29.10/29.33 )
% 29.10/29.33 )
% 29.10/29.33 ).
% 29.10/29.33
% 29.10/29.33 %------ Negative definition of sP22_iProver_split
% 29.10/29.33 fof(lit_def,axiom,
% 29.10/29.33 (! [X0,X1,X2,X3,X4,X5] :
% 29.10/29.33 ( ~(sP22_iProver_split(X0,X1,X2,X3,X4,X5)) <=>
% 29.10/29.33 (
% 29.10/29.33 (
% 29.10/29.33 ( X0=skc71 & X1=skc81 & X2=skc80 & X3=skc82 & X4=skc77 & X5=skc79 )
% 29.10/29.33 )
% 29.10/29.33
% 29.10/29.33 )
% 29.10/29.33 )
% 29.10/29.33 )
% 29.10/29.33 ).
% 29.10/29.33
% 29.10/29.33 %------ Positive definition of sP23_iProver_split
% 29.10/29.33 fof(lit_def,axiom,
% 29.10/29.33 (! [X0,X1,X2] :
% 29.10/29.33 ( sP23_iProver_split(X0,X1,X2) <=>
% 29.10/29.33 (
% 29.10/29.33 (
% 29.10/29.33 ( X0=skc71 & X1=skc76 )
% 29.10/29.33 &
% 29.10/29.33 ( X2!=skc79 )
% 29.10/29.33 )
% 29.10/29.33
% 29.10/29.33 |
% 29.10/29.33 (
% 29.10/29.33 ( X0=skc71 & X1=skc77 )
% 29.10/29.33 &
% 29.10/29.33 ( X2!=skc79 )
% 29.10/29.33 )
% 29.10/29.33
% 29.10/29.33 )
% 29.10/29.33 )
% 29.10/29.33 )
% 29.10/29.33 ).
% 29.10/29.33
% 29.10/29.33
% 29.10/29.33
% 29.10/29.33 % ------ Statistics
% 29.10/29.33
% 29.10/29.33 % ------ General
% 29.10/29.33
% 29.10/29.33 % num_of_input_clauses: 92
% 29.10/29.33 % num_of_input_neg_conjectures: 92
% 29.10/29.33 % num_of_splits: 24
% 29.10/29.33 % num_of_split_atoms: 24
% 29.10/29.33 % num_of_sem_filtered_clauses: 0
% 29.10/29.33 % num_of_subtypes: 0
% 29.10/29.33 % monotx_restored_types: 0
% 29.10/29.33 % sat_num_of_epr_types: 0
% 29.10/29.33 % sat_num_of_non_cyclic_types: 0
% 29.10/29.33 % sat_guarded_non_collapsed_types: 0
% 29.10/29.33 % is_epr: 0
% 29.10/29.33 % is_horn: 0
% 29.10/29.33 % has_eq: 0
% 29.10/29.33 % num_pure_diseq_elim: 0
% 29.10/29.33 % simp_replaced_by: 0
% 29.10/29.33 % res_preprocessed: 208
% 29.10/29.33 % prep_upred: 0
% 29.10/29.33 % prep_unflattend: 0
% 29.10/29.33 % pred_elim_cands: 24
% 29.10/29.33 % pred_elim: 8
% 29.10/29.33 % pred_elim_cl: 8
% 29.10/29.33 % pred_elim_cycles: 40
% 29.10/29.33 % forced_gc_time: 0
% 29.10/29.33 % gc_basic_clause_elim: 0
% 29.10/29.33 % parsing_time: 0.002
% 29.10/29.33 % sem_filter_time: 0.
% 29.10/29.33 % pred_elim_time: 0.046
% 29.10/29.33 % out_proof_time: 0.
% 29.10/29.33 % monotx_time: 0.
% 29.10/29.33 % subtype_inf_time: 0.
% 29.10/29.33 % unif_index_cands_time: 0.01
% 29.10/29.33 % unif_index_add_time: 0.006
% 29.10/29.33 % total_time: 14.329
% 29.10/29.33 % num_of_symbols: 122
% 29.10/29.33 % num_of_terms: 15845
% 29.10/29.33
% 29.10/29.33 % ------ Propositional Solver
% 29.10/29.33
% 29.10/29.33 % prop_solver_calls: 19
% 29.10/29.33 % prop_fast_solver_calls: 2023
% 29.10/29.33 % prop_num_of_clauses: 1377
% 29.10/29.33 % prop_preprocess_simplified: 2803
% 29.10/29.33 % prop_fo_subsumed: 0
% 29.10/29.33 % prop_solver_time: 0.
% 29.10/29.33 % prop_fast_solver_time: 0.001
% 29.10/29.33 % prop_unsat_core_time: 0.
% 29.10/29.33
% 29.10/29.33 % ------ QBF
% 29.10/29.33
% 29.10/29.33 % qbf_q_res: 0
% 29.10/29.33 % qbf_num_tautologies: 0
% 29.10/29.33 % qbf_prep_cycles: 0
% 29.10/29.33
% 29.10/29.33 % ------ BMC1
% 29.10/29.33
% 29.10/29.33 % bmc1_current_bound: -1
% 29.10/29.33 % bmc1_last_solved_bound: -1
% 29.10/29.33 % bmc1_unsat_core_size: -1
% 29.10/29.33 % bmc1_unsat_core_parents_size: -1
% 29.10/29.33 % bmc1_merge_next_fun: 0
% 29.10/29.33 % bmc1_unsat_core_clauses_time: 0.
% 29.10/29.33
% 29.10/29.33 % ------ Instantiation
% 29.10/29.33
% 29.10/29.33 % inst_num_of_clauses: 709
% 29.10/29.33 % inst_num_in_passive: 0
% 29.10/29.33 % inst_num_in_active: 709
% 29.10/29.33 % inst_num_in_unprocessed: 0
% 29.10/29.33 % inst_num_of_loops: 885
% 29.10/29.33 % inst_num_of_learning_restarts: 0
% 29.10/29.33 % inst_num_moves_active_passive: 150
% 29.10/29.33 % inst_lit_activity: 110
% 29.10/29.33 % inst_lit_activity_moves: 0
% 29.10/29.33 % inst_num_tautologies: 0
% 29.10/29.33 % inst_num_prop_implied: 0
% 29.10/29.33 % inst_num_existing_simplified: 0
% 29.10/29.33 % inst_num_eq_res_simplified: 0
% 29.10/29.33 % inst_num_child_elim: 0
% 29.10/29.33 % inst_num_of_dismatching_blockings: 67
% 29.10/29.33 % inst_num_of_non_proper_insts: 960
% 29.10/29.33 % inst_num_of_duplicates: 395
% 29.10/29.33 % inst_inst_num_from_inst_to_res: 0
% 29.10/29.33 % inst_dismatching_checking_time: 0.
% 29.10/29.33
% 29.10/29.33 % ------ Resolution
% 29.10/29.33
% 29.10/29.33 % res_num_of_clauses: 147322
% 29.10/29.33 % res_num_in_passive: 144735
% 29.10/29.33 % res_num_in_active: 2591
% 29.10/29.33 % res_num_of_loops: 3000
% 29.10/29.33 % res_forward_subset_subsumed: 99138
% 29.10/29.33 % res_backward_subset_subsumed: 7
% 29.10/29.33 % res_forward_subsumed: 308
% 29.10/29.33 % res_backward_subsumed: 34
% 29.10/29.33 % res_forward_subsumption_resolution: 314
% 29.10/29.33 % res_backward_subsumption_resolution: 0
% 29.10/29.33 % res_clause_to_clause_subsumption: 6019
% 29.10/29.33 % res_orphan_elimination: 0
% 29.10/29.33 % res_tautology_del: 938
% 29.10/29.33 % res_num_eq_res_simplified: 0
% 29.10/29.33 % res_num_sel_changes: 0
% 29.10/29.33 % res_moves_from_active_to_pass: 0
% 29.10/29.33
% 29.10/29.33 % Status Unknown
% 29.10/29.33 % Last status :
% 29.10/29.33 % SZS status Unknown
%------------------------------------------------------------------------------