TSTP Solution File: NLP027+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP027+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n008.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:38:44 EDT 2022
% Result : Unknown 6.66s 6.90s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NLP027+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 1 07:30:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.51 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.51 % FOF problem with conjecture
% 0.20/0.51 % 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_5c78bd.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_aaea0e.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_711bfc | grep -v "SZS"
% 0.20/0.54
% 0.20/0.54 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.54
% 0.20/0.54 %
% 0.20/0.54 % ------ iProver source info
% 0.20/0.54
% 0.20/0.54 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.54 % git: non_committed_changes: true
% 0.20/0.54 % git: last_make_outside_of_git: true
% 0.20/0.54
% 0.20/0.54 %
% 0.20/0.54 % ------ Input Options
% 0.20/0.54
% 0.20/0.54 % --out_options all
% 0.20/0.54 % --tptp_safe_out true
% 0.20/0.54 % --problem_path ""
% 0.20/0.54 % --include_path ""
% 0.20/0.54 % --clausifier .//eprover
% 0.20/0.54 % --clausifier_options --tstp-format
% 0.20/0.54 % --stdin false
% 0.20/0.54 % --dbg_backtrace false
% 0.20/0.54 % --dbg_dump_prop_clauses false
% 0.20/0.54 % --dbg_dump_prop_clauses_file -
% 0.20/0.54 % --dbg_out_stat false
% 0.20/0.54
% 0.20/0.54 % ------ General Options
% 0.20/0.54
% 0.20/0.54 % --fof false
% 0.20/0.54 % --time_out_real 150.
% 0.20/0.54 % --time_out_prep_mult 0.2
% 0.20/0.54 % --time_out_virtual -1.
% 0.20/0.54 % --schedule none
% 0.20/0.54 % --ground_splitting input
% 0.20/0.54 % --splitting_nvd 16
% 0.20/0.54 % --non_eq_to_eq false
% 0.20/0.54 % --prep_gs_sim true
% 0.20/0.54 % --prep_unflatten false
% 0.20/0.54 % --prep_res_sim true
% 0.20/0.54 % --prep_upred true
% 0.20/0.54 % --res_sim_input true
% 0.20/0.54 % --clause_weak_htbl true
% 0.20/0.54 % --gc_record_bc_elim false
% 0.20/0.54 % --symbol_type_check false
% 0.20/0.54 % --clausify_out false
% 0.20/0.54 % --large_theory_mode false
% 0.20/0.54 % --prep_sem_filter none
% 0.20/0.54 % --prep_sem_filter_out false
% 0.20/0.54 % --preprocessed_out false
% 0.20/0.54 % --sub_typing false
% 0.20/0.54 % --brand_transform false
% 0.20/0.54 % --pure_diseq_elim true
% 0.20/0.54 % --min_unsat_core false
% 0.20/0.54 % --pred_elim true
% 0.20/0.54 % --add_important_lit false
% 0.20/0.54 % --soft_assumptions false
% 0.20/0.54 % --reset_solvers false
% 0.20/0.54 % --bc_imp_inh []
% 0.20/0.54 % --conj_cone_tolerance 1.5
% 0.20/0.54 % --prolific_symb_bound 500
% 0.20/0.54 % --lt_threshold 2000
% 0.20/0.54
% 0.20/0.54 % ------ SAT Options
% 0.20/0.54
% 0.20/0.54 % --sat_mode false
% 0.20/0.54 % --sat_fm_restart_options ""
% 0.20/0.54 % --sat_gr_def false
% 0.20/0.54 % --sat_epr_types true
% 0.20/0.54 % --sat_non_cyclic_types false
% 0.20/0.54 % --sat_finite_models false
% 0.20/0.54 % --sat_fm_lemmas false
% 0.20/0.54 % --sat_fm_prep false
% 0.20/0.54 % --sat_fm_uc_incr true
% 0.20/0.54 % --sat_out_model small
% 0.20/0.54 % --sat_out_clauses false
% 0.20/0.54
% 0.20/0.54 % ------ QBF Options
% 0.20/0.54
% 0.20/0.54 % --qbf_mode false
% 0.20/0.54 % --qbf_elim_univ true
% 0.20/0.54 % --qbf_sk_in true
% 0.20/0.54 % --qbf_pred_elim true
% 0.20/0.54 % --qbf_split 32
% 0.20/0.54
% 0.20/0.54 % ------ BMC1 Options
% 0.20/0.54
% 0.20/0.54 % --bmc1_incremental false
% 0.20/0.54 % --bmc1_axioms reachable_all
% 0.20/0.54 % --bmc1_min_bound 0
% 0.20/0.54 % --bmc1_max_bound -1
% 0.20/0.54 % --bmc1_max_bound_default -1
% 0.20/0.54 % --bmc1_symbol_reachability true
% 0.20/0.54 % --bmc1_property_lemmas false
% 0.20/0.54 % --bmc1_k_induction false
% 0.20/0.54 % --bmc1_non_equiv_states false
% 0.20/0.54 % --bmc1_deadlock false
% 0.20/0.54 % --bmc1_ucm false
% 0.20/0.54 % --bmc1_add_unsat_core none
% 0.20/0.54 % --bmc1_unsat_core_children false
% 0.20/0.54 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.54 % --bmc1_out_stat full
% 0.20/0.54 % --bmc1_ground_init false
% 0.20/0.54 % --bmc1_pre_inst_next_state false
% 0.20/0.54 % --bmc1_pre_inst_state false
% 0.20/0.54 % --bmc1_pre_inst_reach_state false
% 0.20/0.54 % --bmc1_out_unsat_core false
% 0.20/0.54 % --bmc1_aig_witness_out false
% 0.20/0.54 % --bmc1_verbose false
% 0.20/0.54 % --bmc1_dump_clauses_tptp false
% 1.30/1.47 % --bmc1_dump_unsat_core_tptp false
% 1.30/1.47 % --bmc1_dump_file -
% 1.30/1.47 % --bmc1_ucm_expand_uc_limit 128
% 1.30/1.47 % --bmc1_ucm_n_expand_iterations 6
% 1.30/1.47 % --bmc1_ucm_extend_mode 1
% 1.30/1.47 % --bmc1_ucm_init_mode 2
% 1.30/1.47 % --bmc1_ucm_cone_mode none
% 1.30/1.47 % --bmc1_ucm_reduced_relation_type 0
% 1.30/1.47 % --bmc1_ucm_relax_model 4
% 1.30/1.47 % --bmc1_ucm_full_tr_after_sat true
% 1.30/1.47 % --bmc1_ucm_expand_neg_assumptions false
% 1.30/1.47 % --bmc1_ucm_layered_model none
% 1.30/1.47 % --bmc1_ucm_max_lemma_size 10
% 1.30/1.47
% 1.30/1.47 % ------ AIG Options
% 1.30/1.47
% 1.30/1.47 % --aig_mode false
% 1.30/1.47
% 1.30/1.47 % ------ Instantiation Options
% 1.30/1.47
% 1.30/1.47 % --instantiation_flag true
% 1.30/1.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.30/1.47 % --inst_solver_per_active 750
% 1.30/1.47 % --inst_solver_calls_frac 0.5
% 1.30/1.47 % --inst_passive_queue_type priority_queues
% 1.30/1.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.30/1.47 % --inst_passive_queues_freq [25;2]
% 1.30/1.47 % --inst_dismatching true
% 1.30/1.47 % --inst_eager_unprocessed_to_passive true
% 1.30/1.47 % --inst_prop_sim_given true
% 1.30/1.47 % --inst_prop_sim_new false
% 1.30/1.47 % --inst_orphan_elimination true
% 1.30/1.47 % --inst_learning_loop_flag true
% 1.30/1.47 % --inst_learning_start 3000
% 1.30/1.47 % --inst_learning_factor 2
% 1.30/1.47 % --inst_start_prop_sim_after_learn 3
% 1.30/1.47 % --inst_sel_renew solver
% 1.30/1.47 % --inst_lit_activity_flag true
% 1.30/1.47 % --inst_out_proof true
% 1.30/1.47
% 1.30/1.47 % ------ Resolution Options
% 1.30/1.47
% 1.30/1.47 % --resolution_flag true
% 1.30/1.47 % --res_lit_sel kbo_max
% 1.30/1.47 % --res_to_prop_solver none
% 1.30/1.47 % --res_prop_simpl_new false
% 1.30/1.47 % --res_prop_simpl_given false
% 1.30/1.47 % --res_passive_queue_type priority_queues
% 1.30/1.47 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.30/1.47 % --res_passive_queues_freq [15;5]
% 1.30/1.47 % --res_forward_subs full
% 1.30/1.47 % --res_backward_subs full
% 1.30/1.47 % --res_forward_subs_resolution true
% 1.30/1.47 % --res_backward_subs_resolution true
% 1.30/1.47 % --res_orphan_elimination false
% 1.30/1.47 % --res_time_limit 1000.
% 1.30/1.47 % --res_out_proof true
% 1.30/1.47 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5c78bd.s
% 1.30/1.47 % --modulo true
% 1.30/1.47
% 1.30/1.47 % ------ Combination Options
% 1.30/1.47
% 1.30/1.47 % --comb_res_mult 1000
% 1.30/1.47 % --comb_inst_mult 300
% 1.30/1.47 % ------
% 1.30/1.47
% 1.30/1.47 % ------ Parsing...% successful
% 1.30/1.47
% 1.30/1.47 % ------ Preprocessing... gs_s sp: 1760 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 1.30/1.47
% 1.30/1.47 % ------ Proving...
% 1.30/1.47 % ------ Problem Properties
% 1.30/1.47
% 1.30/1.47 %
% 1.30/1.47 % EPR false
% 1.30/1.47 % Horn false
% 1.30/1.47 % Has equality false
% 1.30/1.47
% 1.30/1.47 % % ------ Input Options Time Limit: Unbounded
% 1.30/1.47
% 1.30/1.47
% 1.30/1.47 % % ------ Current options:
% 1.30/1.47
% 1.30/1.47 % ------ Input Options
% 1.30/1.47
% 1.30/1.47 % --out_options all
% 1.30/1.47 % --tptp_safe_out true
% 1.30/1.47 % --problem_path ""
% 1.30/1.47 % --include_path ""
% 1.30/1.47 % --clausifier .//eprover
% 1.30/1.47 % --clausifier_options --tstp-format
% 1.30/1.47 % --stdin false
% 1.30/1.47 % --dbg_backtrace false
% 1.30/1.47 % --dbg_dump_prop_clauses false
% 1.30/1.47 % --dbg_dump_prop_clauses_file -
% 1.30/1.47 % --dbg_out_stat false
% 1.30/1.47
% 1.30/1.47 % ------ General Options
% 1.30/1.47
% 1.30/1.47 % --fof false
% 1.30/1.47 % --time_out_real 150.
% 1.30/1.47 % --time_out_prep_mult 0.2
% 1.30/1.47 % --time_out_virtual -1.
% 1.30/1.47 % --schedule none
% 1.30/1.47 % --ground_splitting input
% 1.30/1.47 % --splitting_nvd 16
% 1.30/1.47 % --non_eq_to_eq false
% 1.30/1.47 % --prep_gs_sim true
% 1.30/1.47 % --prep_unflatten false
% 1.30/1.47 % --prep_res_sim true
% 1.30/1.47 % --prep_upred true
% 1.30/1.47 % --res_sim_input true
% 1.30/1.47 % --clause_weak_htbl true
% 1.30/1.47 % --gc_record_bc_elim false
% 1.30/1.47 % --symbol_type_check false
% 1.30/1.47 % --clausify_out false
% 1.30/1.47 % --large_theory_mode false
% 1.30/1.47 % --prep_sem_filter none
% 1.30/1.47 % --prep_sem_filter_out false
% 1.30/1.47 % --preprocessed_out false
% 1.30/1.47 % --sub_typing false
% 1.30/1.47 % --brand_transform false
% 1.30/1.47 % --pure_diseq_elim true
% 1.30/1.47 % --min_unsat_core false
% 1.30/1.47 % --pred_elim true
% 1.30/1.47 % --add_important_lit false
% 1.30/1.47 % --soft_assumptions false
% 1.30/1.47 % --reset_solvers false
% 1.30/1.47 % --bc_imp_inh []
% 1.30/1.47 % --conj_cone_tolerance 1.5
% 1.30/1.47 % --prolific_symb_bound 500
% 1.30/1.47 % --lt_threshold 2000
% 1.30/1.47
% 1.30/1.47 % ------ SAT Options
% 1.30/1.47
% 1.30/1.47 % --sat_mode false
% 1.30/1.47 % --sat_fm_restart_options ""
% 1.30/1.47 % --sat_gr_def false
% 1.30/1.47 % --sat_epr_types true
% 1.30/1.47 % --sat_non_cyclic_types false
% 1.30/1.47 % --sat_finite_models false
% 1.30/1.47 % --sat_fm_lemmas false
% 1.30/1.47 % --sat_fm_prep false
% 1.30/1.47 % --sat_fm_uc_incr true
% 1.30/1.47 % --sat_out_model small
% 1.30/1.47 % --sat_out_clauses false
% 1.30/1.47
% 1.30/1.47 % ------ QBF Options
% 1.30/1.47
% 1.30/1.47 % --qbf_mode false
% 1.30/1.47 % --qbf_elim_univ true
% 1.30/1.47 % --qbf_sk_in true
% 1.30/1.47 % --qbf_pred_elim true
% 1.30/1.47 % --qbf_split 32
% 1.30/1.47
% 1.30/1.47 % ------ BMC1 Options
% 1.30/1.47
% 1.30/1.47 % --bmc1_incremental false
% 1.30/1.47 % --bmc1_axioms reachable_all
% 1.30/1.47 % --bmc1_min_bound 0
% 1.30/1.47 % --bmc1_max_bound -1
% 1.30/1.47 % --bmc1_max_bound_default -1
% 1.30/1.47 % --bmc1_symbol_reachability true
% 1.30/1.47 % --bmc1_property_lemmas false
% 1.30/1.47 % --bmc1_k_induction false
% 1.30/1.47 % --bmc1_non_equiv_states false
% 1.30/1.47 % --bmc1_deadlock false
% 1.30/1.47 % --bmc1_ucm false
% 1.30/1.47 % --bmc1_add_unsat_core none
% 1.30/1.47 % --bmc1_unsat_core_children false
% 1.30/1.47 % --bmc1_unsat_core_extrapolate_axioms false
% 1.30/1.47 % --bmc1_out_stat full
% 1.30/1.47 % --bmc1_ground_init false
% 1.30/1.47 % --bmc1_pre_inst_next_state false
% 1.30/1.47 % --bmc1_pre_inst_state false
% 1.30/1.47 % --bmc1_pre_inst_reach_state false
% 1.30/1.47 % --bmc1_out_unsat_core false
% 1.30/1.47 % --bmc1_aig_witness_out false
% 1.30/1.47 % --bmc1_verbose false
% 1.30/1.47 % --bmc1_dump_clauses_tptp false
% 1.30/1.47 % --bmc1_dump_unsat_core_tptp false
% 1.30/1.47 % --bmc1_dump_file -
% 1.30/1.47 % --bmc1_ucm_expand_uc_limit 128
% 1.30/1.47 % --bmc1_ucm_n_expand_iterations 6
% 1.30/1.47 % --bmc1_ucm_extend_mode 1
% 1.30/1.47 % --bmc1_ucm_init_mode 2
% 1.30/1.47 % --bmc1_ucm_cone_mode none
% 1.30/1.47 % --bmc1_ucm_reduced_relation_type 0
% 1.30/1.47 % --bmc1_ucm_relax_model 4
% 1.30/1.47 % --bmc1_ucm_full_tr_after_sat true
% 1.30/1.47 % --bmc1_ucm_expand_neg_assumptions false
% 1.30/1.47 % --bmc1_ucm_layered_model none
% 1.30/1.47 % --bmc1_ucm_max_lemma_size 10
% 1.30/1.47
% 1.30/1.47 % ------ AIG Options
% 1.30/1.47
% 1.30/1.47 % --aig_mode false
% 1.30/1.47
% 1.30/1.47 % ------ Instantiation Options
% 1.30/1.47
% 1.30/1.47 % --instantiation_flag true
% 1.30/1.47 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.30/1.47 % --inst_solver_per_active 750
% 1.30/1.47 % --inst_solver_calls_frac 0.5
% 1.30/1.47 % --inst_passive_queue_type priority_queues
% 1.30/1.47 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.30/1.47 % --inst_passive_queues_freq [25;2]
% 1.30/1.47 % --inst_dismatching true
% 1.30/1.47 % --inst_eager_unprocessed_to_passive true
% 1.30/1.47 % --inst_prop_sim_given true
% 3.45/3.71 % --inst_prop_sim_new false
% 3.45/3.71 % --inst_orphan_elimination true
% 3.45/3.71 % --inst_learning_loop_flag true
% 3.45/3.71 % --inst_learning_start 3000
% 3.45/3.71 % --inst_learning_factor 2
% 3.45/3.71 % --inst_start_prop_sim_after_learn 3
% 3.45/3.71 % --inst_sel_renew solver
% 3.45/3.71 % --inst_lit_activity_flag true
% 3.45/3.71 % --inst_out_proof true
% 3.45/3.71
% 3.45/3.71 % ------ Resolution Options
% 3.45/3.71
% 3.45/3.71 % --resolution_flag true
% 3.45/3.71 % --res_lit_sel kbo_max
% 3.45/3.71 % --res_to_prop_solver none
% 3.45/3.71 % --res_prop_simpl_new false
% 3.45/3.71 % --res_prop_simpl_given false
% 3.45/3.71 % --res_passive_queue_type priority_queues
% 3.45/3.71 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.45/3.71 % --res_passive_queues_freq [15;5]
% 3.45/3.71 % --res_forward_subs full
% 3.45/3.71 % --res_backward_subs full
% 3.45/3.71 % --res_forward_subs_resolution true
% 3.45/3.71 % --res_backward_subs_resolution true
% 3.45/3.71 % --res_orphan_elimination false
% 3.45/3.71 % --res_time_limit 1000.
% 3.45/3.71 % --res_out_proof true
% 3.45/3.71 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5c78bd.s
% 3.45/3.71 % --modulo true
% 3.45/3.71
% 3.45/3.71 % ------ Combination Options
% 3.45/3.71
% 3.45/3.71 % --comb_res_mult 1000
% 3.45/3.71 % --comb_inst_mult 300
% 3.45/3.71 % ------
% 3.45/3.71
% 3.45/3.71
% 3.45/3.71
% 3.45/3.71 % ------ Proving...
% 3.45/3.71 % warning: shown sat in sat incomplete mode
% 3.45/3.71 %
% 3.45/3.71
% 3.45/3.71
% 3.45/3.71 ------ Building Model...Done
% 3.45/3.71
% 3.45/3.71 %------ The model is defined over ground terms (initial term algebra).
% 3.45/3.71 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.45/3.71 %------ where \phi is a formula over the term algebra.
% 3.45/3.71 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.45/3.71 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.45/3.71 %------ See help for --sat_out_model for different model outputs.
% 3.45/3.71 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.45/3.71 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.45/3.71
% 3.45/3.71
% 3.45/3.71
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of member
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 (! [X0,X1,X2] :
% 3.45/3.71 ( member(X0,X1,X2) <=>
% 3.45/3.71 (
% 3.45/3.71 (
% 3.45/3.71 ( X0=sk3_esk1_0 & X1=sk3_esk6_2(sk3_esk1_0,sk3_esk3_0) & X2=sk3_esk3_0 )
% 3.45/3.71 )
% 3.45/3.71
% 3.45/3.71 |
% 3.45/3.71 (
% 3.45/3.71 ( X0=sk3_esk1_0 & X1=sk3_esk7_3(sk3_esk1_0,sk3_esk3_0,sk3_esk3_0) & X2=sk3_esk3_0 )
% 3.45/3.71 )
% 3.45/3.71
% 3.45/3.71 )
% 3.45/3.71 )
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Negative definition of actual_world
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 (! [X0] :
% 3.45/3.71 ( ~(actual_world(X0)) <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sit
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 (! [X0,X1] :
% 3.45/3.71 ( sit(X0,X1) <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of table
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 (! [X0,X1] :
% 3.45/3.71 ( table(X0,X1) <=>
% 3.45/3.71 (
% 3.45/3.71 (
% 3.45/3.71 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 3.45/3.71 )
% 3.45/3.71
% 3.45/3.71 )
% 3.45/3.71 )
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of three
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 (! [X0,X1] :
% 3.45/3.71 ( three(X0,X1) <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of group
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 (! [X0,X1] :
% 3.45/3.71 ( group(X0,X1) <=>
% 3.45/3.71 (
% 3.45/3.71 (
% 3.45/3.71 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 3.45/3.71 )
% 3.45/3.71
% 3.45/3.71 |
% 3.45/3.71 (
% 3.45/3.71 ( X0=sk3_esk1_0 & X1=sk3_esk4_1(sk3_esk6_2(sk3_esk1_0,sk3_esk3_0)) )
% 3.45/3.71 )
% 3.45/3.71
% 3.45/3.71 |
% 3.45/3.71 (
% 3.45/3.71 ( X0=sk3_esk10_0 & X1=sk3_esk11_0 )
% 3.45/3.71 )
% 3.45/3.71
% 3.45/3.71 )
% 3.45/3.71 )
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Negative definition of young
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 (! [X0,X1] :
% 3.45/3.71 ( ~(young(X0,X1)) <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Negative definition of guy
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 (! [X0,X1] :
% 3.45/3.71 ( ~(guy(X0,X1)) <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of hamburger
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 (! [X0,X1] :
% 3.45/3.71 ( hamburger(X0,X1) <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP0_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP0_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP1_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP1_iProver_split <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP2_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP2_iProver_split <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP3_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP3_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP4_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP4_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP5_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP5_iProver_split <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP6_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP6_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP7_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP7_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP8_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP8_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP9_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP9_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP10_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP10_iProver_split <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP11_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP11_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP12_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP12_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP13_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP13_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP14_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP14_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP15_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP15_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP16_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP16_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP17_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP17_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP18_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP18_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP19_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP19_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP20_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP20_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP21_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP21_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP22_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP22_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP23_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP23_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP24_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP24_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP25_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP25_iProver_split <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP26_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP26_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP27_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP27_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP28_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP28_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP29_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP29_iProver_split <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP30_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP30_iProver_split <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP31_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP31_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP32_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP32_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP33_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP33_iProver_split <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP34_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP34_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP35_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP35_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP36_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP36_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP37_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP37_iProver_split <=>
% 3.45/3.71 $false
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP38_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP38_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP39_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP39_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP40_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP40_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP41_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP41_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP42_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP42_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP43_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP43_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP44_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP44_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP45_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP45_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP46_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP46_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP47_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP47_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP48_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP48_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP49_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP49_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP50_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP50_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP51_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP51_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP52_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP52_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71 %------ Positive definition of sP53_iProver_split
% 3.45/3.71 fof(lit_def,axiom,
% 3.45/3.71 ( sP53_iProver_split <=>
% 3.45/3.71 $true
% 3.45/3.71 )
% 3.45/3.71 ).
% 3.45/3.71
% 3.45/3.71
% 3.45/3.71
% 3.45/3.71 % ------ Statistics
% 3.45/3.71
% 3.45/3.71 % ------ General
% 3.45/3.71
% 3.45/3.71 % num_of_input_clauses: 576
% 3.45/3.71 % num_of_input_neg_conjectures: 576
% 3.45/3.71 % num_of_splits: 1760
% 3.45/3.71 % num_of_split_atoms: 54
% 3.45/3.71 % num_of_sem_filtered_clauses: 0
% 3.45/3.71 % num_of_subtypes: 0
% 3.45/3.71 % monotx_restored_types: 0
% 3.45/3.71 % sat_num_of_epr_types: 0
% 3.45/3.71 % sat_num_of_non_cyclic_types: 0
% 3.45/3.71 % sat_guarded_non_collapsed_types: 0
% 3.45/3.71 % is_epr: 0
% 3.45/3.71 % is_horn: 0
% 3.45/3.71 % has_eq: 0
% 3.45/3.71 % num_pure_diseq_elim: 0
% 3.45/3.71 % simp_replaced_by: 0
% 3.45/3.71 % res_preprocessed: 2912
% 3.45/3.71 % prep_upred: 0
% 3.45/3.71 % prep_unflattend: 0
% 3.45/3.71 % pred_elim_cands: 54
% 3.45/3.71 % pred_elim: 0
% 3.45/3.71 % pred_elim_cl: 0
% 3.45/3.71 % pred_elim_cycles: 54
% 3.45/3.71 % forced_gc_time: 0
% 3.45/3.71 % gc_basic_clause_elim: 0
% 3.45/3.71 % parsing_time: 0.083
% 3.45/3.71 % sem_filter_time: 0.
% 3.45/3.71 % pred_elim_time: 0.647
% 3.45/3.71 % out_proof_time: 0.
% 3.45/3.71 % monotx_time: 0.
% 3.45/3.71 % subtype_inf_time: 0.
% 3.45/3.71 % unif_index_cands_time: 0.002
% 3.45/3.71 % unif_index_add_time: 0.003
% 3.45/3.71 % total_time: 3.187
% 3.45/3.71 % num_of_symbols: 111
% 3.45/3.71 % num_of_terms: 2410
% 3.45/3.71
% 3.45/3.71 % ------ Propositional Solver
% 3.45/3.71
% 3.45/3.71 % prop_solver_calls: 6
% 3.45/3.71 % prop_fast_solver_calls: 24366
% 3.45/3.71 % prop_num_of_clauses: 3748
% 3.45/3.71 % prop_preprocess_simplified: 18348
% 3.45/3.71 % prop_fo_subsumed: 0
% 3.45/3.71 % prop_solver_time: 0.
% 3.45/3.71 % prop_fast_solver_time: 0.023
% 3.45/3.71 % prop_unsat_core_time: 0.
% 3.45/3.71
% 3.45/3.71 % ------ QBF
% 3.45/3.71
% 3.45/3.71 % qbf_q_res: 0
% 3.45/3.71 % qbf_num_tautologies: 0
% 3.45/3.71 % qbf_prep_cycles: 0
% 3.45/3.71
% 3.45/3.71 % ------ BMC1
% 3.45/3.71
% 3.45/3.71 % bmc1_current_bound: -1
% 3.45/3.71 % bmc1_last_solved_bound: -1
% 3.45/3.71 % bmc1_unsat_core_size: -1
% 3.45/3.71 % bmc1_unsat_core_parents_size: -1
% 3.45/3.71 % bmc1_merge_next_fun: 0
% 3.45/3.71 % bmc1_unsat_core_clauses_time: 0.
% 3.45/3.71
% 3.45/3.71 % ------ Instantiation
% 3.45/3.71
% 3.45/3.71 % inst_num_of_clauses: 815
% 3.45/3.71 % inst_num_in_passive: 0
% 3.45/3.71 % inst_num_in_active: 815
% 3.45/3.71 % inst_num_in_unprocessed: 0
% 3.45/3.71 % inst_num_of_loops: 1024
% 3.45/3.71 % inst_num_of_learning_restarts: 0
% 3.45/3.71 % inst_num_moves_active_passive: 202
% 3.45/3.71 % inst_lit_activity: 120
% 3.45/3.71 % inst_lit_activity_moves: 0
% 3.45/3.71 % inst_num_tautologies: 0
% 3.45/3.71 % inst_num_prop_implied: 0
% 3.45/3.71 % inst_num_existing_simplified: 0
% 3.45/3.71 % inst_num_eq_res_simplified: 0
% 3.45/3.71 % inst_num_child_elim: 0
% 3.45/3.71 % inst_num_of_dismatching_blockings: 0
% 3.45/3.71 % inst_num_of_non_proper_insts: 220
% 3.45/3.71 % inst_num_of_duplicates: 36
% 3.45/3.71 % inst_inst_num_from_inst_to_res: 0
% 3.45/3.71 % inst_dismatching_checking_time: 0.
% 3.45/3.71
% 3.45/3.71 % ------ Resolution
% 3.45/3.71
% 3.45/3.71 % res_num_of_clauses: 5182
% 3.45/3.71 % res_num_in_passive: 3554
% 3.45/3.71 % res_num_in_active: 1827
% 3.45/3.71 % res_num_of_loops: 4000
% 3.45/3.71 % res_forward_subset_subsumed: 3238
% 3.45/3.71 % res_backward_subset_subsumed: 791
% 3.45/3.71 % res_forward_subsumed: 2088
% 3.45/3.71 % res_backward_subsumed: 36
% 3.45/3.71 % res_forward_subsumption_resolution: 1252
% 3.45/3.71 % res_backward_subsumption_resolution: 2
% 3.45/3.71 % res_clause_to_clause_subsumption: 10975
% 3.45/3.71 % res_orphan_elimination: 0
% 3.45/3.71 % res_tautology_del: 731
% 3.45/3.71 % res_num_eq_res_simplified: 0
% 3.45/3.71 % res_num_sel_changes: 0
% 3.45/3.71 % res_moves_from_active_to_pass: 0
% 3.45/3.71
% 3.45/3.71 % Status Unknown
% 3.56/3.85 % Orienting using strategy ClausalAll
% 3.56/3.85 % FOF problem with conjecture
% 3.56/3.85 % 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_5c78bd.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_aaea0e.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_1cb1d5 | grep -v "SZS"
% 3.56/3.87
% 3.56/3.87 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 3.56/3.87
% 3.56/3.87 %
% 3.56/3.87 % ------ iProver source info
% 3.56/3.87
% 3.56/3.87 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 3.56/3.87 % git: non_committed_changes: true
% 3.56/3.87 % git: last_make_outside_of_git: true
% 3.56/3.87
% 3.56/3.87 %
% 3.56/3.87 % ------ Input Options
% 3.56/3.87
% 3.56/3.87 % --out_options all
% 3.56/3.87 % --tptp_safe_out true
% 3.56/3.87 % --problem_path ""
% 3.56/3.87 % --include_path ""
% 3.56/3.87 % --clausifier .//eprover
% 3.56/3.87 % --clausifier_options --tstp-format
% 3.56/3.87 % --stdin false
% 3.56/3.87 % --dbg_backtrace false
% 3.56/3.87 % --dbg_dump_prop_clauses false
% 3.56/3.87 % --dbg_dump_prop_clauses_file -
% 3.56/3.87 % --dbg_out_stat false
% 3.56/3.87
% 3.56/3.87 % ------ General Options
% 3.56/3.87
% 3.56/3.87 % --fof false
% 3.56/3.87 % --time_out_real 150.
% 3.56/3.87 % --time_out_prep_mult 0.2
% 3.56/3.87 % --time_out_virtual -1.
% 3.56/3.87 % --schedule none
% 3.56/3.87 % --ground_splitting input
% 3.56/3.87 % --splitting_nvd 16
% 3.56/3.87 % --non_eq_to_eq false
% 3.56/3.87 % --prep_gs_sim true
% 3.56/3.87 % --prep_unflatten false
% 3.56/3.87 % --prep_res_sim true
% 3.56/3.87 % --prep_upred true
% 3.56/3.87 % --res_sim_input true
% 3.56/3.87 % --clause_weak_htbl true
% 3.56/3.87 % --gc_record_bc_elim false
% 3.56/3.87 % --symbol_type_check false
% 3.56/3.87 % --clausify_out false
% 3.56/3.87 % --large_theory_mode false
% 3.56/3.87 % --prep_sem_filter none
% 3.56/3.87 % --prep_sem_filter_out false
% 3.56/3.87 % --preprocessed_out false
% 3.56/3.87 % --sub_typing false
% 3.56/3.87 % --brand_transform false
% 3.56/3.87 % --pure_diseq_elim true
% 3.56/3.87 % --min_unsat_core false
% 3.56/3.87 % --pred_elim true
% 3.56/3.87 % --add_important_lit false
% 3.56/3.87 % --soft_assumptions false
% 3.56/3.87 % --reset_solvers false
% 3.56/3.87 % --bc_imp_inh []
% 3.56/3.87 % --conj_cone_tolerance 1.5
% 3.56/3.87 % --prolific_symb_bound 500
% 3.56/3.87 % --lt_threshold 2000
% 3.56/3.87
% 3.56/3.87 % ------ SAT Options
% 3.56/3.87
% 3.56/3.87 % --sat_mode false
% 3.56/3.87 % --sat_fm_restart_options ""
% 3.56/3.87 % --sat_gr_def false
% 3.56/3.87 % --sat_epr_types true
% 3.56/3.87 % --sat_non_cyclic_types false
% 3.56/3.87 % --sat_finite_models false
% 3.56/3.87 % --sat_fm_lemmas false
% 3.56/3.87 % --sat_fm_prep false
% 3.56/3.87 % --sat_fm_uc_incr true
% 3.56/3.87 % --sat_out_model small
% 3.56/3.87 % --sat_out_clauses false
% 3.56/3.87
% 3.56/3.87 % ------ QBF Options
% 3.56/3.87
% 3.56/3.87 % --qbf_mode false
% 3.56/3.87 % --qbf_elim_univ true
% 3.56/3.87 % --qbf_sk_in true
% 3.56/3.87 % --qbf_pred_elim true
% 3.56/3.87 % --qbf_split 32
% 3.56/3.87
% 3.56/3.87 % ------ BMC1 Options
% 3.56/3.87
% 3.56/3.87 % --bmc1_incremental false
% 3.56/3.87 % --bmc1_axioms reachable_all
% 3.56/3.87 % --bmc1_min_bound 0
% 3.56/3.87 % --bmc1_max_bound -1
% 3.56/3.87 % --bmc1_max_bound_default -1
% 3.56/3.87 % --bmc1_symbol_reachability true
% 3.56/3.87 % --bmc1_property_lemmas false
% 3.56/3.87 % --bmc1_k_induction false
% 3.56/3.87 % --bmc1_non_equiv_states false
% 3.56/3.87 % --bmc1_deadlock false
% 3.56/3.87 % --bmc1_ucm false
% 3.56/3.87 % --bmc1_add_unsat_core none
% 3.56/3.87 % --bmc1_unsat_core_children false
% 3.56/3.87 % --bmc1_unsat_core_extrapolate_axioms false
% 3.56/3.87 % --bmc1_out_stat full
% 3.56/3.87 % --bmc1_ground_init false
% 3.56/3.87 % --bmc1_pre_inst_next_state false
% 3.56/3.87 % --bmc1_pre_inst_state false
% 3.56/3.87 % --bmc1_pre_inst_reach_state false
% 3.56/3.87 % --bmc1_out_unsat_core false
% 3.56/3.87 % --bmc1_aig_witness_out false
% 3.56/3.87 % --bmc1_verbose false
% 3.56/3.87 % --bmc1_dump_clauses_tptp false
% 4.48/4.65 % --bmc1_dump_unsat_core_tptp false
% 4.48/4.65 % --bmc1_dump_file -
% 4.48/4.65 % --bmc1_ucm_expand_uc_limit 128
% 4.48/4.65 % --bmc1_ucm_n_expand_iterations 6
% 4.48/4.65 % --bmc1_ucm_extend_mode 1
% 4.48/4.65 % --bmc1_ucm_init_mode 2
% 4.48/4.65 % --bmc1_ucm_cone_mode none
% 4.48/4.65 % --bmc1_ucm_reduced_relation_type 0
% 4.48/4.65 % --bmc1_ucm_relax_model 4
% 4.48/4.65 % --bmc1_ucm_full_tr_after_sat true
% 4.48/4.65 % --bmc1_ucm_expand_neg_assumptions false
% 4.48/4.65 % --bmc1_ucm_layered_model none
% 4.48/4.65 % --bmc1_ucm_max_lemma_size 10
% 4.48/4.65
% 4.48/4.65 % ------ AIG Options
% 4.48/4.65
% 4.48/4.65 % --aig_mode false
% 4.48/4.65
% 4.48/4.65 % ------ Instantiation Options
% 4.48/4.65
% 4.48/4.65 % --instantiation_flag true
% 4.48/4.65 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 4.48/4.65 % --inst_solver_per_active 750
% 4.48/4.65 % --inst_solver_calls_frac 0.5
% 4.48/4.65 % --inst_passive_queue_type priority_queues
% 4.48/4.65 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 4.48/4.65 % --inst_passive_queues_freq [25;2]
% 4.48/4.65 % --inst_dismatching true
% 4.48/4.65 % --inst_eager_unprocessed_to_passive true
% 4.48/4.65 % --inst_prop_sim_given true
% 4.48/4.65 % --inst_prop_sim_new false
% 4.48/4.65 % --inst_orphan_elimination true
% 4.48/4.65 % --inst_learning_loop_flag true
% 4.48/4.65 % --inst_learning_start 3000
% 4.48/4.65 % --inst_learning_factor 2
% 4.48/4.65 % --inst_start_prop_sim_after_learn 3
% 4.48/4.65 % --inst_sel_renew solver
% 4.48/4.65 % --inst_lit_activity_flag true
% 4.48/4.65 % --inst_out_proof true
% 4.48/4.65
% 4.48/4.65 % ------ Resolution Options
% 4.48/4.65
% 4.48/4.65 % --resolution_flag true
% 4.48/4.65 % --res_lit_sel kbo_max
% 4.48/4.65 % --res_to_prop_solver none
% 4.48/4.65 % --res_prop_simpl_new false
% 4.48/4.65 % --res_prop_simpl_given false
% 4.48/4.65 % --res_passive_queue_type priority_queues
% 4.48/4.65 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 4.48/4.65 % --res_passive_queues_freq [15;5]
% 4.48/4.65 % --res_forward_subs full
% 4.48/4.65 % --res_backward_subs full
% 4.48/4.65 % --res_forward_subs_resolution true
% 4.48/4.65 % --res_backward_subs_resolution true
% 4.48/4.65 % --res_orphan_elimination false
% 4.48/4.65 % --res_time_limit 1000.
% 4.48/4.65 % --res_out_proof true
% 4.48/4.65 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5c78bd.s
% 4.48/4.65 % --modulo true
% 4.48/4.65
% 4.48/4.65 % ------ Combination Options
% 4.48/4.65
% 4.48/4.65 % --comb_res_mult 1000
% 4.48/4.65 % --comb_inst_mult 300
% 4.48/4.65 % ------
% 4.48/4.65
% 4.48/4.65 % ------ Parsing...% successful
% 4.48/4.65
% 4.48/4.65 % ------ Preprocessing... gs_s sp: 1760 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 4.48/4.65
% 4.48/4.65 % ------ Proving...
% 4.48/4.65 % ------ Problem Properties
% 4.48/4.65
% 4.48/4.65 %
% 4.48/4.65 % EPR false
% 4.48/4.65 % Horn false
% 4.48/4.65 % Has equality false
% 4.48/4.65
% 4.48/4.65 % % ------ Input Options Time Limit: Unbounded
% 4.48/4.65
% 4.48/4.65
% 4.48/4.65 % % ------ Current options:
% 4.48/4.65
% 4.48/4.65 % ------ Input Options
% 4.48/4.65
% 4.48/4.65 % --out_options all
% 4.48/4.65 % --tptp_safe_out true
% 4.48/4.65 % --problem_path ""
% 4.48/4.65 % --include_path ""
% 4.48/4.65 % --clausifier .//eprover
% 4.48/4.65 % --clausifier_options --tstp-format
% 4.48/4.65 % --stdin false
% 4.48/4.65 % --dbg_backtrace false
% 4.48/4.65 % --dbg_dump_prop_clauses false
% 4.48/4.65 % --dbg_dump_prop_clauses_file -
% 4.48/4.65 % --dbg_out_stat false
% 4.48/4.65
% 4.48/4.65 % ------ General Options
% 4.48/4.65
% 4.48/4.65 % --fof false
% 4.48/4.65 % --time_out_real 150.
% 4.48/4.65 % --time_out_prep_mult 0.2
% 4.48/4.65 % --time_out_virtual -1.
% 4.48/4.65 % --schedule none
% 4.48/4.65 % --ground_splitting input
% 4.48/4.65 % --splitting_nvd 16
% 4.48/4.65 % --non_eq_to_eq false
% 4.48/4.65 % --prep_gs_sim true
% 4.48/4.65 % --prep_unflatten false
% 4.48/4.65 % --prep_res_sim true
% 4.48/4.65 % --prep_upred true
% 4.48/4.65 % --res_sim_input true
% 4.48/4.65 % --clause_weak_htbl true
% 4.48/4.65 % --gc_record_bc_elim false
% 4.48/4.65 % --symbol_type_check false
% 4.48/4.65 % --clausify_out false
% 4.48/4.65 % --large_theory_mode false
% 4.48/4.65 % --prep_sem_filter none
% 4.48/4.65 % --prep_sem_filter_out false
% 4.48/4.65 % --preprocessed_out false
% 4.48/4.65 % --sub_typing false
% 4.48/4.65 % --brand_transform false
% 4.48/4.65 % --pure_diseq_elim true
% 4.48/4.65 % --min_unsat_core false
% 4.48/4.65 % --pred_elim true
% 4.48/4.65 % --add_important_lit false
% 4.48/4.65 % --soft_assumptions false
% 4.48/4.65 % --reset_solvers false
% 4.48/4.65 % --bc_imp_inh []
% 4.48/4.65 % --conj_cone_tolerance 1.5
% 4.48/4.65 % --prolific_symb_bound 500
% 4.48/4.65 % --lt_threshold 2000
% 4.48/4.65
% 4.48/4.65 % ------ SAT Options
% 4.48/4.65
% 4.48/4.65 % --sat_mode false
% 4.48/4.65 % --sat_fm_restart_options ""
% 4.48/4.65 % --sat_gr_def false
% 4.48/4.65 % --sat_epr_types true
% 4.48/4.65 % --sat_non_cyclic_types false
% 4.48/4.65 % --sat_finite_models false
% 4.48/4.65 % --sat_fm_lemmas false
% 4.48/4.65 % --sat_fm_prep false
% 4.48/4.65 % --sat_fm_uc_incr true
% 4.48/4.65 % --sat_out_model small
% 4.48/4.65 % --sat_out_clauses false
% 4.48/4.65
% 4.48/4.65 % ------ QBF Options
% 4.48/4.65
% 4.48/4.65 % --qbf_mode false
% 4.48/4.65 % --qbf_elim_univ true
% 4.48/4.65 % --qbf_sk_in true
% 4.48/4.65 % --qbf_pred_elim true
% 4.48/4.65 % --qbf_split 32
% 4.48/4.65
% 4.48/4.65 % ------ BMC1 Options
% 4.48/4.65
% 4.48/4.65 % --bmc1_incremental false
% 4.48/4.65 % --bmc1_axioms reachable_all
% 4.48/4.65 % --bmc1_min_bound 0
% 4.48/4.65 % --bmc1_max_bound -1
% 4.48/4.65 % --bmc1_max_bound_default -1
% 4.48/4.65 % --bmc1_symbol_reachability true
% 4.48/4.65 % --bmc1_property_lemmas false
% 4.48/4.65 % --bmc1_k_induction false
% 4.48/4.65 % --bmc1_non_equiv_states false
% 4.48/4.65 % --bmc1_deadlock false
% 4.48/4.65 % --bmc1_ucm false
% 4.48/4.65 % --bmc1_add_unsat_core none
% 4.48/4.65 % --bmc1_unsat_core_children false
% 4.48/4.65 % --bmc1_unsat_core_extrapolate_axioms false
% 4.48/4.65 % --bmc1_out_stat full
% 4.48/4.65 % --bmc1_ground_init false
% 4.48/4.65 % --bmc1_pre_inst_next_state false
% 4.48/4.65 % --bmc1_pre_inst_state false
% 4.48/4.65 % --bmc1_pre_inst_reach_state false
% 4.48/4.65 % --bmc1_out_unsat_core false
% 4.48/4.65 % --bmc1_aig_witness_out false
% 4.48/4.65 % --bmc1_verbose false
% 4.48/4.65 % --bmc1_dump_clauses_tptp false
% 4.48/4.65 % --bmc1_dump_unsat_core_tptp false
% 4.48/4.65 % --bmc1_dump_file -
% 4.48/4.65 % --bmc1_ucm_expand_uc_limit 128
% 4.48/4.65 % --bmc1_ucm_n_expand_iterations 6
% 4.48/4.65 % --bmc1_ucm_extend_mode 1
% 4.48/4.65 % --bmc1_ucm_init_mode 2
% 4.48/4.65 % --bmc1_ucm_cone_mode none
% 4.48/4.65 % --bmc1_ucm_reduced_relation_type 0
% 4.48/4.65 % --bmc1_ucm_relax_model 4
% 4.48/4.65 % --bmc1_ucm_full_tr_after_sat true
% 4.48/4.65 % --bmc1_ucm_expand_neg_assumptions false
% 4.48/4.65 % --bmc1_ucm_layered_model none
% 4.48/4.65 % --bmc1_ucm_max_lemma_size 10
% 4.48/4.65
% 4.48/4.65 % ------ AIG Options
% 4.48/4.65
% 4.48/4.65 % --aig_mode false
% 4.48/4.65
% 4.48/4.65 % ------ Instantiation Options
% 4.48/4.65
% 4.48/4.65 % --instantiation_flag true
% 4.48/4.65 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 4.48/4.65 % --inst_solver_per_active 750
% 4.48/4.65 % --inst_solver_calls_frac 0.5
% 4.48/4.65 % --inst_passive_queue_type priority_queues
% 4.48/4.65 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 4.48/4.65 % --inst_passive_queues_freq [25;2]
% 4.48/4.65 % --inst_dismatching true
% 4.48/4.65 % --inst_eager_unprocessed_to_passive true
% 4.48/4.65 % --inst_prop_sim_given true
% 6.66/6.89 % --inst_prop_sim_new false
% 6.66/6.89 % --inst_orphan_elimination true
% 6.66/6.89 % --inst_learning_loop_flag true
% 6.66/6.89 % --inst_learning_start 3000
% 6.66/6.89 % --inst_learning_factor 2
% 6.66/6.89 % --inst_start_prop_sim_after_learn 3
% 6.66/6.89 % --inst_sel_renew solver
% 6.66/6.89 % --inst_lit_activity_flag true
% 6.66/6.89 % --inst_out_proof true
% 6.66/6.89
% 6.66/6.89 % ------ Resolution Options
% 6.66/6.89
% 6.66/6.89 % --resolution_flag true
% 6.66/6.89 % --res_lit_sel kbo_max
% 6.66/6.89 % --res_to_prop_solver none
% 6.66/6.89 % --res_prop_simpl_new false
% 6.66/6.89 % --res_prop_simpl_given false
% 6.66/6.89 % --res_passive_queue_type priority_queues
% 6.66/6.89 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 6.66/6.89 % --res_passive_queues_freq [15;5]
% 6.66/6.89 % --res_forward_subs full
% 6.66/6.89 % --res_backward_subs full
% 6.66/6.89 % --res_forward_subs_resolution true
% 6.66/6.89 % --res_backward_subs_resolution true
% 6.66/6.89 % --res_orphan_elimination false
% 6.66/6.89 % --res_time_limit 1000.
% 6.66/6.89 % --res_out_proof true
% 6.66/6.89 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5c78bd.s
% 6.66/6.89 % --modulo true
% 6.66/6.89
% 6.66/6.89 % ------ Combination Options
% 6.66/6.89
% 6.66/6.89 % --comb_res_mult 1000
% 6.66/6.89 % --comb_inst_mult 300
% 6.66/6.89 % ------
% 6.66/6.89
% 6.66/6.89
% 6.66/6.89
% 6.66/6.89 % ------ Proving...
% 6.66/6.89 % warning: shown sat in sat incomplete mode
% 6.66/6.89 %
% 6.66/6.89
% 6.66/6.89
% 6.66/6.89 ------ Building Model...Done
% 6.66/6.89
% 6.66/6.89 %------ The model is defined over ground terms (initial term algebra).
% 6.66/6.89 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 6.66/6.89 %------ where \phi is a formula over the term algebra.
% 6.66/6.89 %------ If we have equality in the problem then it is also defined as a predicate above,
% 6.66/6.89 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 6.66/6.89 %------ See help for --sat_out_model for different model outputs.
% 6.66/6.89 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 6.66/6.89 %------ where the first argument stands for the sort ($i in the unsorted case)
% 6.66/6.89
% 6.66/6.89
% 6.66/6.89
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of member
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 (! [X0,X1,X2] :
% 6.66/6.89 ( member(X0,X1,X2) <=>
% 6.66/6.89 (
% 6.66/6.89 (
% 6.66/6.89 ( X0=sk2_esk1_0 & X1=sk2_esk6_2(sk2_esk1_0,sk2_esk3_0) & X2=sk2_esk3_0 )
% 6.66/6.89 )
% 6.66/6.89
% 6.66/6.89 |
% 6.66/6.89 (
% 6.66/6.89 ( X0=sk2_esk1_0 & X1=sk2_esk7_3(sk2_esk1_0,sk2_esk3_0,sk2_esk3_0) & X2=sk2_esk3_0 )
% 6.66/6.89 )
% 6.66/6.89
% 6.66/6.89 )
% 6.66/6.89 )
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Negative definition of actual_world
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 (! [X0] :
% 6.66/6.89 ( ~(actual_world(X0)) <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sit
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 (! [X0,X1] :
% 6.66/6.89 ( sit(X0,X1) <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of table
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 (! [X0,X1] :
% 6.66/6.89 ( table(X0,X1) <=>
% 6.66/6.89 (
% 6.66/6.89 (
% 6.66/6.89 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 6.66/6.89 )
% 6.66/6.89
% 6.66/6.89 )
% 6.66/6.89 )
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of three
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 (! [X0,X1] :
% 6.66/6.89 ( three(X0,X1) <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of group
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 (! [X0,X1] :
% 6.66/6.89 ( group(X0,X1) <=>
% 6.66/6.89 (
% 6.66/6.89 (
% 6.66/6.89 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 6.66/6.89 )
% 6.66/6.89
% 6.66/6.89 |
% 6.66/6.89 (
% 6.66/6.89 ( X0=sk2_esk1_0 & X1=sk2_esk4_1(sk2_esk6_2(sk2_esk1_0,sk2_esk3_0)) )
% 6.66/6.89 )
% 6.66/6.89
% 6.66/6.89 |
% 6.66/6.89 (
% 6.66/6.89 ( X0=sk2_esk10_0 & X1=sk2_esk11_0 )
% 6.66/6.89 )
% 6.66/6.89
% 6.66/6.89 )
% 6.66/6.89 )
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Negative definition of young
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 (! [X0,X1] :
% 6.66/6.89 ( ~(young(X0,X1)) <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Negative definition of guy
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 (! [X0,X1] :
% 6.66/6.89 ( ~(guy(X0,X1)) <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of hamburger
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 (! [X0,X1] :
% 6.66/6.89 ( hamburger(X0,X1) <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP0_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP0_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP1_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP1_iProver_split <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP2_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP2_iProver_split <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP3_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP3_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP4_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP4_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP5_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP5_iProver_split <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP6_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP6_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP7_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP7_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP8_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP8_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP9_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP9_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP10_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP10_iProver_split <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP11_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP11_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP12_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP12_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP13_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP13_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP14_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP14_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP15_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP15_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP16_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP16_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP17_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP17_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP18_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP18_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP19_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP19_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP20_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP20_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP21_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP21_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP22_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP22_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP23_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP23_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP24_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP24_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP25_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP25_iProver_split <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP26_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP26_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP27_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP27_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP28_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP28_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP29_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP29_iProver_split <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP30_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP30_iProver_split <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP31_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP31_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP32_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP32_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP33_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP33_iProver_split <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP34_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP34_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP35_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP35_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP36_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP36_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP37_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP37_iProver_split <=>
% 6.66/6.89 $false
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP38_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP38_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP39_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP39_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP40_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP40_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP41_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP41_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP42_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP42_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP43_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP43_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP44_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP44_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP45_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP45_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP46_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP46_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP47_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP47_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP48_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP48_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP49_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP49_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP50_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP50_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP51_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP51_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP52_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP52_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89 %------ Positive definition of sP53_iProver_split
% 6.66/6.89 fof(lit_def,axiom,
% 6.66/6.89 ( sP53_iProver_split <=>
% 6.66/6.89 $true
% 6.66/6.89 )
% 6.66/6.89 ).
% 6.66/6.89
% 6.66/6.89
% 6.66/6.89
% 6.66/6.89 % ------ Statistics
% 6.66/6.89
% 6.66/6.89 % ------ General
% 6.66/6.89
% 6.66/6.89 % num_of_input_clauses: 576
% 6.66/6.89 % num_of_input_neg_conjectures: 576
% 6.66/6.89 % num_of_splits: 1760
% 6.66/6.89 % num_of_split_atoms: 54
% 6.66/6.89 % num_of_sem_filtered_clauses: 0
% 6.66/6.89 % num_of_subtypes: 0
% 6.66/6.89 % monotx_restored_types: 0
% 6.66/6.89 % sat_num_of_epr_types: 0
% 6.66/6.89 % sat_num_of_non_cyclic_types: 0
% 6.66/6.89 % sat_guarded_non_collapsed_types: 0
% 6.66/6.89 % is_epr: 0
% 6.66/6.89 % is_horn: 0
% 6.66/6.89 % has_eq: 0
% 6.66/6.89 % num_pure_diseq_elim: 0
% 6.66/6.89 % simp_replaced_by: 0
% 6.66/6.89 % res_preprocessed: 2912
% 6.66/6.89 % prep_upred: 0
% 6.66/6.89 % prep_unflattend: 0
% 6.66/6.89 % pred_elim_cands: 54
% 6.66/6.89 % pred_elim: 0
% 6.66/6.89 % pred_elim_cl: 0
% 6.66/6.89 % pred_elim_cycles: 54
% 6.66/6.89 % forced_gc_time: 0
% 6.66/6.89 % gc_basic_clause_elim: 0
% 6.66/6.89 % parsing_time: 0.038
% 6.66/6.89 % sem_filter_time: 0.
% 6.66/6.89 % pred_elim_time: 0.597
% 6.66/6.89 % out_proof_time: 0.
% 6.66/6.89 % monotx_time: 0.
% 6.66/6.89 % subtype_inf_time: 0.
% 6.66/6.89 % unif_index_cands_time: 0.002
% 6.66/6.89 % unif_index_add_time: 0.003
% 6.66/6.89 % total_time: 3.035
% 6.66/6.89 % num_of_symbols: 111
% 6.66/6.89 % num_of_terms: 2410
% 6.66/6.89
% 6.66/6.89 % ------ Propositional Solver
% 6.66/6.89
% 6.66/6.89 % prop_solver_calls: 6
% 6.66/6.89 % prop_fast_solver_calls: 24366
% 6.66/6.89 % prop_num_of_clauses: 3748
% 6.66/6.89 % prop_preprocess_simplified: 18348
% 6.66/6.89 % prop_fo_subsumed: 0
% 6.66/6.89 % prop_solver_time: 0.
% 6.66/6.89 % prop_fast_solver_time: 0.019
% 6.66/6.89 % prop_unsat_core_time: 0.
% 6.66/6.89
% 6.66/6.89 % ------ QBF
% 6.66/6.89
% 6.66/6.89 % qbf_q_res: 0
% 6.66/6.89 % qbf_num_tautologies: 0
% 6.66/6.89 % qbf_prep_cycles: 0
% 6.66/6.89
% 6.66/6.89 % ------ BMC1
% 6.66/6.89
% 6.66/6.89 % bmc1_current_bound: -1
% 6.66/6.89 % bmc1_last_solved_bound: -1
% 6.66/6.89 % bmc1_unsat_core_size: -1
% 6.66/6.89 % bmc1_unsat_core_parents_size: -1
% 6.66/6.89 % bmc1_merge_next_fun: 0
% 6.66/6.89 % bmc1_unsat_core_clauses_time: 0.
% 6.66/6.89
% 6.66/6.89 % ------ Instantiation
% 6.66/6.89
% 6.66/6.89 % inst_num_of_clauses: 815
% 6.66/6.89 % inst_num_in_passive: 0
% 6.66/6.89 % inst_num_in_active: 815
% 6.66/6.89 % inst_num_in_unprocessed: 0
% 6.66/6.89 % inst_num_of_loops: 1024
% 6.66/6.89 % inst_num_of_learning_restarts: 0
% 6.66/6.89 % inst_num_moves_active_passive: 202
% 6.66/6.89 % inst_lit_activity: 120
% 6.66/6.89 % inst_lit_activity_moves: 0
% 6.66/6.89 % inst_num_tautologies: 0
% 6.66/6.89 % inst_num_prop_implied: 0
% 6.66/6.89 % inst_num_existing_simplified: 0
% 6.66/6.89 % inst_num_eq_res_simplified: 0
% 6.66/6.89 % inst_num_child_elim: 0
% 6.66/6.89 % inst_num_of_dismatching_blockings: 0
% 6.66/6.89 % inst_num_of_non_proper_insts: 220
% 6.66/6.89 % inst_num_of_duplicates: 36
% 6.66/6.89 % inst_inst_num_from_inst_to_res: 0
% 6.66/6.89 % inst_dismatching_checking_time: 0.
% 6.66/6.89
% 6.66/6.89 % ------ Resolution
% 6.66/6.89
% 6.66/6.89 % res_num_of_clauses: 5182
% 6.66/6.89 % res_num_in_passive: 3554
% 6.66/6.89 % res_num_in_active: 1827
% 6.66/6.89 % res_num_of_loops: 4000
% 6.66/6.89 % res_forward_subset_subsumed: 3238
% 6.66/6.89 % res_backward_subset_subsumed: 791
% 6.66/6.89 % res_forward_subsumed: 2088
% 6.66/6.89 % res_backward_subsumed: 36
% 6.66/6.89 % res_forward_subsumption_resolution: 1252
% 6.66/6.89 % res_backward_subsumption_resolution: 2
% 6.66/6.89 % res_clause_to_clause_subsumption: 10975
% 6.66/6.89 % res_orphan_elimination: 0
% 6.66/6.89 % res_tautology_del: 731
% 6.66/6.89 % res_num_eq_res_simplified: 0
% 6.66/6.89 % res_num_sel_changes: 0
% 6.66/6.89 % res_moves_from_active_to_pass: 0
% 6.66/6.89
% 6.66/6.89 % Status Unknown
% 6.66/6.89 % Last status :
% 6.66/6.89 % SZS status Unknown
%------------------------------------------------------------------------------