TSTP Solution File: NLP102+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP102+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n015.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:40:10 EDT 2022
% Result : Unknown 13.34s 13.55s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP102+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 30 18:09:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.21/0.48 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.48 % FOF problem with conjecture
% 0.21/0.48 % 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_3bc875.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_cd9086.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_fbc6da | grep -v "SZS"
% 0.21/0.51
% 0.21/0.51 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.51
% 0.21/0.51 %
% 0.21/0.51 % ------ iProver source info
% 0.21/0.51
% 0.21/0.51 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.51 % git: non_committed_changes: true
% 0.21/0.51 % git: last_make_outside_of_git: true
% 0.21/0.51
% 0.21/0.51 %
% 0.21/0.51 % ------ Input Options
% 0.21/0.51
% 0.21/0.51 % --out_options all
% 0.21/0.51 % --tptp_safe_out true
% 0.21/0.51 % --problem_path ""
% 0.21/0.51 % --include_path ""
% 0.21/0.51 % --clausifier .//eprover
% 0.21/0.51 % --clausifier_options --tstp-format
% 0.21/0.51 % --stdin false
% 0.21/0.51 % --dbg_backtrace false
% 0.21/0.51 % --dbg_dump_prop_clauses false
% 0.21/0.51 % --dbg_dump_prop_clauses_file -
% 0.21/0.51 % --dbg_out_stat false
% 0.21/0.51
% 0.21/0.51 % ------ General Options
% 0.21/0.51
% 0.21/0.51 % --fof false
% 0.21/0.51 % --time_out_real 150.
% 0.21/0.51 % --time_out_prep_mult 0.2
% 0.21/0.51 % --time_out_virtual -1.
% 0.21/0.51 % --schedule none
% 0.21/0.51 % --ground_splitting input
% 0.21/0.51 % --splitting_nvd 16
% 0.21/0.51 % --non_eq_to_eq false
% 0.21/0.51 % --prep_gs_sim true
% 0.21/0.51 % --prep_unflatten false
% 0.21/0.51 % --prep_res_sim true
% 0.21/0.51 % --prep_upred true
% 0.21/0.51 % --res_sim_input true
% 0.21/0.51 % --clause_weak_htbl true
% 0.21/0.51 % --gc_record_bc_elim false
% 0.21/0.51 % --symbol_type_check false
% 0.21/0.51 % --clausify_out false
% 0.21/0.51 % --large_theory_mode false
% 0.21/0.51 % --prep_sem_filter none
% 0.21/0.51 % --prep_sem_filter_out false
% 0.21/0.51 % --preprocessed_out false
% 0.21/0.51 % --sub_typing false
% 0.21/0.51 % --brand_transform false
% 0.21/0.51 % --pure_diseq_elim true
% 0.21/0.51 % --min_unsat_core false
% 0.21/0.51 % --pred_elim true
% 0.21/0.51 % --add_important_lit false
% 0.21/0.51 % --soft_assumptions false
% 0.21/0.51 % --reset_solvers false
% 0.21/0.51 % --bc_imp_inh []
% 0.21/0.51 % --conj_cone_tolerance 1.5
% 0.21/0.51 % --prolific_symb_bound 500
% 0.21/0.51 % --lt_threshold 2000
% 0.21/0.51
% 0.21/0.51 % ------ SAT Options
% 0.21/0.51
% 0.21/0.51 % --sat_mode false
% 0.21/0.51 % --sat_fm_restart_options ""
% 0.21/0.51 % --sat_gr_def false
% 0.21/0.51 % --sat_epr_types true
% 0.21/0.51 % --sat_non_cyclic_types false
% 0.21/0.51 % --sat_finite_models false
% 0.21/0.51 % --sat_fm_lemmas false
% 0.21/0.51 % --sat_fm_prep false
% 0.21/0.51 % --sat_fm_uc_incr true
% 0.21/0.51 % --sat_out_model small
% 0.21/0.51 % --sat_out_clauses false
% 0.21/0.51
% 0.21/0.51 % ------ QBF Options
% 0.21/0.51
% 0.21/0.51 % --qbf_mode false
% 0.21/0.51 % --qbf_elim_univ true
% 0.21/0.51 % --qbf_sk_in true
% 0.21/0.51 % --qbf_pred_elim true
% 0.21/0.51 % --qbf_split 32
% 0.21/0.51
% 0.21/0.51 % ------ BMC1 Options
% 0.21/0.51
% 0.21/0.51 % --bmc1_incremental false
% 0.21/0.51 % --bmc1_axioms reachable_all
% 0.21/0.51 % --bmc1_min_bound 0
% 0.21/0.51 % --bmc1_max_bound -1
% 0.21/0.51 % --bmc1_max_bound_default -1
% 0.21/0.51 % --bmc1_symbol_reachability true
% 0.21/0.51 % --bmc1_property_lemmas false
% 0.21/0.51 % --bmc1_k_induction false
% 0.21/0.51 % --bmc1_non_equiv_states false
% 0.21/0.51 % --bmc1_deadlock false
% 0.21/0.51 % --bmc1_ucm false
% 0.21/0.51 % --bmc1_add_unsat_core none
% 0.21/0.51 % --bmc1_unsat_core_children false
% 0.21/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.51 % --bmc1_out_stat full
% 0.21/0.51 % --bmc1_ground_init false
% 0.21/0.51 % --bmc1_pre_inst_next_state false
% 0.21/0.51 % --bmc1_pre_inst_state false
% 0.21/0.51 % --bmc1_pre_inst_reach_state false
% 0.21/0.51 % --bmc1_out_unsat_core false
% 0.21/0.51 % --bmc1_aig_witness_out false
% 0.21/0.51 % --bmc1_verbose false
% 0.21/0.51 % --bmc1_dump_clauses_tptp false
% 0.75/0.98 % --bmc1_dump_unsat_core_tptp false
% 0.75/0.98 % --bmc1_dump_file -
% 0.75/0.98 % --bmc1_ucm_expand_uc_limit 128
% 0.75/0.98 % --bmc1_ucm_n_expand_iterations 6
% 0.75/0.98 % --bmc1_ucm_extend_mode 1
% 0.75/0.98 % --bmc1_ucm_init_mode 2
% 0.75/0.98 % --bmc1_ucm_cone_mode none
% 0.75/0.98 % --bmc1_ucm_reduced_relation_type 0
% 0.75/0.98 % --bmc1_ucm_relax_model 4
% 0.75/0.98 % --bmc1_ucm_full_tr_after_sat true
% 0.75/0.98 % --bmc1_ucm_expand_neg_assumptions false
% 0.75/0.98 % --bmc1_ucm_layered_model none
% 0.75/0.98 % --bmc1_ucm_max_lemma_size 10
% 0.75/0.98
% 0.75/0.98 % ------ AIG Options
% 0.75/0.98
% 0.75/0.98 % --aig_mode false
% 0.75/0.98
% 0.75/0.98 % ------ Instantiation Options
% 0.75/0.98
% 0.75/0.98 % --instantiation_flag true
% 0.75/0.98 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.75/0.98 % --inst_solver_per_active 750
% 0.75/0.98 % --inst_solver_calls_frac 0.5
% 0.75/0.98 % --inst_passive_queue_type priority_queues
% 0.75/0.98 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.75/0.98 % --inst_passive_queues_freq [25;2]
% 0.75/0.98 % --inst_dismatching true
% 0.75/0.98 % --inst_eager_unprocessed_to_passive true
% 0.75/0.98 % --inst_prop_sim_given true
% 0.75/0.98 % --inst_prop_sim_new false
% 0.75/0.98 % --inst_orphan_elimination true
% 0.75/0.98 % --inst_learning_loop_flag true
% 0.75/0.98 % --inst_learning_start 3000
% 0.75/0.98 % --inst_learning_factor 2
% 0.75/0.98 % --inst_start_prop_sim_after_learn 3
% 0.75/0.98 % --inst_sel_renew solver
% 0.75/0.98 % --inst_lit_activity_flag true
% 0.75/0.98 % --inst_out_proof true
% 0.75/0.98
% 0.75/0.98 % ------ Resolution Options
% 0.75/0.98
% 0.75/0.98 % --resolution_flag true
% 0.75/0.98 % --res_lit_sel kbo_max
% 0.75/0.98 % --res_to_prop_solver none
% 0.75/0.98 % --res_prop_simpl_new false
% 0.75/0.98 % --res_prop_simpl_given false
% 0.75/0.98 % --res_passive_queue_type priority_queues
% 0.75/0.98 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.75/0.98 % --res_passive_queues_freq [15;5]
% 0.75/0.98 % --res_forward_subs full
% 0.75/0.98 % --res_backward_subs full
% 0.75/0.98 % --res_forward_subs_resolution true
% 0.75/0.98 % --res_backward_subs_resolution true
% 0.75/0.98 % --res_orphan_elimination false
% 0.75/0.98 % --res_time_limit 1000.
% 0.75/0.98 % --res_out_proof true
% 0.75/0.98 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_3bc875.s
% 0.75/0.98 % --modulo true
% 0.75/0.98
% 0.75/0.98 % ------ Combination Options
% 0.75/0.98
% 0.75/0.98 % --comb_res_mult 1000
% 0.75/0.98 % --comb_inst_mult 300
% 0.75/0.98 % ------
% 0.75/0.98
% 0.75/0.98 % ------ Parsing...% successful
% 0.75/0.98
% 0.75/0.98 % ------ Preprocessing... gs_s sp: 640 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.75/0.98
% 0.75/0.98 % ------ Proving...
% 0.75/0.98 % ------ Problem Properties
% 0.75/0.98
% 0.75/0.98 %
% 0.75/0.98 % EPR false
% 0.75/0.98 % Horn false
% 0.75/0.98 % Has equality false
% 0.75/0.98
% 0.75/0.98 % % ------ Input Options Time Limit: Unbounded
% 0.75/0.98
% 0.75/0.98
% 0.75/0.98 % % ------ Current options:
% 0.75/0.98
% 0.75/0.98 % ------ Input Options
% 0.75/0.98
% 0.75/0.98 % --out_options all
% 0.75/0.98 % --tptp_safe_out true
% 0.75/0.98 % --problem_path ""
% 0.75/0.98 % --include_path ""
% 0.75/0.98 % --clausifier .//eprover
% 0.75/0.98 % --clausifier_options --tstp-format
% 0.75/0.98 % --stdin false
% 0.75/0.98 % --dbg_backtrace false
% 0.75/0.98 % --dbg_dump_prop_clauses false
% 0.75/0.98 % --dbg_dump_prop_clauses_file -
% 0.75/0.98 % --dbg_out_stat false
% 0.75/0.98
% 0.75/0.98 % ------ General Options
% 0.75/0.98
% 0.75/0.98 % --fof false
% 0.75/0.98 % --time_out_real 150.
% 0.75/0.98 % --time_out_prep_mult 0.2
% 0.75/0.98 % --time_out_virtual -1.
% 0.75/0.98 % --schedule none
% 0.75/0.98 % --ground_splitting input
% 0.75/0.98 % --splitting_nvd 16
% 0.75/0.98 % --non_eq_to_eq false
% 0.75/0.98 % --prep_gs_sim true
% 0.75/0.98 % --prep_unflatten false
% 0.75/0.98 % --prep_res_sim true
% 0.75/0.98 % --prep_upred true
% 0.75/0.98 % --res_sim_input true
% 0.75/0.98 % --clause_weak_htbl true
% 0.75/0.98 % --gc_record_bc_elim false
% 0.75/0.98 % --symbol_type_check false
% 0.75/0.98 % --clausify_out false
% 0.75/0.98 % --large_theory_mode false
% 0.75/0.98 % --prep_sem_filter none
% 0.75/0.98 % --prep_sem_filter_out false
% 0.75/0.98 % --preprocessed_out false
% 0.75/0.98 % --sub_typing false
% 0.75/0.98 % --brand_transform false
% 0.75/0.98 % --pure_diseq_elim true
% 0.75/0.98 % --min_unsat_core false
% 0.75/0.98 % --pred_elim true
% 0.75/0.98 % --add_important_lit false
% 0.75/0.98 % --soft_assumptions false
% 0.75/0.98 % --reset_solvers false
% 0.75/0.98 % --bc_imp_inh []
% 0.75/0.98 % --conj_cone_tolerance 1.5
% 0.75/0.98 % --prolific_symb_bound 500
% 0.75/0.98 % --lt_threshold 2000
% 0.75/0.98
% 0.75/0.98 % ------ SAT Options
% 0.75/0.98
% 0.75/0.98 % --sat_mode false
% 0.75/0.98 % --sat_fm_restart_options ""
% 0.75/0.98 % --sat_gr_def false
% 0.75/0.98 % --sat_epr_types true
% 0.75/0.98 % --sat_non_cyclic_types false
% 0.75/0.98 % --sat_finite_models false
% 0.75/0.98 % --sat_fm_lemmas false
% 0.75/0.98 % --sat_fm_prep false
% 0.75/0.98 % --sat_fm_uc_incr true
% 0.75/0.98 % --sat_out_model small
% 0.75/0.98 % --sat_out_clauses false
% 0.75/0.98
% 0.75/0.98 % ------ QBF Options
% 0.75/0.98
% 0.75/0.98 % --qbf_mode false
% 0.75/0.98 % --qbf_elim_univ true
% 0.75/0.98 % --qbf_sk_in true
% 0.75/0.98 % --qbf_pred_elim true
% 0.75/0.98 % --qbf_split 32
% 0.75/0.98
% 0.75/0.98 % ------ BMC1 Options
% 0.75/0.98
% 0.75/0.98 % --bmc1_incremental false
% 0.75/0.98 % --bmc1_axioms reachable_all
% 0.75/0.98 % --bmc1_min_bound 0
% 0.75/0.98 % --bmc1_max_bound -1
% 0.75/0.98 % --bmc1_max_bound_default -1
% 0.75/0.98 % --bmc1_symbol_reachability true
% 0.75/0.98 % --bmc1_property_lemmas false
% 0.75/0.98 % --bmc1_k_induction false
% 0.75/0.98 % --bmc1_non_equiv_states false
% 0.75/0.98 % --bmc1_deadlock false
% 0.75/0.98 % --bmc1_ucm false
% 0.75/0.98 % --bmc1_add_unsat_core none
% 0.75/0.98 % --bmc1_unsat_core_children false
% 0.75/0.98 % --bmc1_unsat_core_extrapolate_axioms false
% 0.75/0.98 % --bmc1_out_stat full
% 0.75/0.98 % --bmc1_ground_init false
% 0.75/0.98 % --bmc1_pre_inst_next_state false
% 0.75/0.98 % --bmc1_pre_inst_state false
% 0.75/0.98 % --bmc1_pre_inst_reach_state false
% 0.75/0.98 % --bmc1_out_unsat_core false
% 0.75/0.98 % --bmc1_aig_witness_out false
% 0.75/0.98 % --bmc1_verbose false
% 0.75/0.98 % --bmc1_dump_clauses_tptp false
% 0.75/0.98 % --bmc1_dump_unsat_core_tptp false
% 0.75/0.98 % --bmc1_dump_file -
% 0.75/0.98 % --bmc1_ucm_expand_uc_limit 128
% 0.75/0.98 % --bmc1_ucm_n_expand_iterations 6
% 0.75/0.98 % --bmc1_ucm_extend_mode 1
% 0.75/0.98 % --bmc1_ucm_init_mode 2
% 0.75/0.98 % --bmc1_ucm_cone_mode none
% 0.75/0.98 % --bmc1_ucm_reduced_relation_type 0
% 0.75/0.98 % --bmc1_ucm_relax_model 4
% 0.75/0.98 % --bmc1_ucm_full_tr_after_sat true
% 0.75/0.98 % --bmc1_ucm_expand_neg_assumptions false
% 0.75/0.98 % --bmc1_ucm_layered_model none
% 0.75/0.98 % --bmc1_ucm_max_lemma_size 10
% 0.75/0.98
% 0.75/0.98 % ------ AIG Options
% 0.75/0.98
% 0.75/0.98 % --aig_mode false
% 0.75/0.98
% 0.75/0.98 % ------ Instantiation Options
% 0.75/0.98
% 0.75/0.98 % --instantiation_flag true
% 0.75/0.98 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.75/0.98 % --inst_solver_per_active 750
% 0.75/0.98 % --inst_solver_calls_frac 0.5
% 0.75/0.98 % --inst_passive_queue_type priority_queues
% 0.75/0.98 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.75/0.98 % --inst_passive_queues_freq [25;2]
% 0.75/0.98 % --inst_dismatching true
% 0.75/0.98 % --inst_eager_unprocessed_to_passive true
% 0.75/0.98 % --inst_prop_sim_given true
% 6.83/7.03 % --inst_prop_sim_new false
% 6.83/7.03 % --inst_orphan_elimination true
% 6.83/7.03 % --inst_learning_loop_flag true
% 6.83/7.03 % --inst_learning_start 3000
% 6.83/7.03 % --inst_learning_factor 2
% 6.83/7.03 % --inst_start_prop_sim_after_learn 3
% 6.83/7.03 % --inst_sel_renew solver
% 6.83/7.03 % --inst_lit_activity_flag true
% 6.83/7.03 % --inst_out_proof true
% 6.83/7.03
% 6.83/7.03 % ------ Resolution Options
% 6.83/7.03
% 6.83/7.03 % --resolution_flag true
% 6.83/7.03 % --res_lit_sel kbo_max
% 6.83/7.03 % --res_to_prop_solver none
% 6.83/7.03 % --res_prop_simpl_new false
% 6.83/7.03 % --res_prop_simpl_given false
% 6.83/7.03 % --res_passive_queue_type priority_queues
% 6.83/7.03 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 6.83/7.03 % --res_passive_queues_freq [15;5]
% 6.83/7.03 % --res_forward_subs full
% 6.83/7.03 % --res_backward_subs full
% 6.83/7.03 % --res_forward_subs_resolution true
% 6.83/7.03 % --res_backward_subs_resolution true
% 6.83/7.03 % --res_orphan_elimination false
% 6.83/7.03 % --res_time_limit 1000.
% 6.83/7.03 % --res_out_proof true
% 6.83/7.03 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_3bc875.s
% 6.83/7.03 % --modulo true
% 6.83/7.03
% 6.83/7.03 % ------ Combination Options
% 6.83/7.03
% 6.83/7.03 % --comb_res_mult 1000
% 6.83/7.03 % --comb_inst_mult 300
% 6.83/7.03 % ------
% 6.83/7.03
% 6.83/7.03
% 6.83/7.03
% 6.83/7.03 % ------ Proving...
% 6.83/7.03 % warning: shown sat in sat incomplete mode
% 6.83/7.03 %
% 6.83/7.03
% 6.83/7.03
% 6.83/7.03 ------ Building Model...Done
% 6.83/7.03
% 6.83/7.03 %------ The model is defined over ground terms (initial term algebra).
% 6.83/7.03 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 6.83/7.03 %------ where \phi is a formula over the term algebra.
% 6.83/7.03 %------ If we have equality in the problem then it is also defined as a predicate above,
% 6.83/7.03 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 6.83/7.03 %------ See help for --sat_out_model for different model outputs.
% 6.83/7.03 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 6.83/7.03 %------ where the first argument stands for the sort ($i in the unsorted case)
% 6.83/7.03
% 6.83/7.03
% 6.83/7.03
% 6.83/7.03
% 6.83/7.03 %------ Negative definition of actual_world
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 (! [X0] :
% 6.83/7.03 ( ~(actual_world(X0)) <=>
% 6.83/7.03 $false
% 6.83/7.03 )
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of coffee
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 (! [X0,X1] :
% 6.83/7.03 ( coffee(X0,X1) <=>
% 6.83/7.03 (
% 6.83/7.03 (
% 6.83/7.03 ( X0=sk3_esk9_0 & X1=sk3_esk10_0 )
% 6.83/7.03 )
% 6.83/7.03
% 6.83/7.03 )
% 6.83/7.03 )
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of see
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 (! [X0,X1] :
% 6.83/7.03 ( see(X0,X1) <=>
% 6.83/7.03 $false
% 6.83/7.03 )
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of nonreflexive
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 (! [X0,X1] :
% 6.83/7.03 ( nonreflexive(X0,X1) <=>
% 6.83/7.03 $false
% 6.83/7.03 )
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of restaurant
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 (! [X0,X1] :
% 6.83/7.03 ( restaurant(X0,X1) <=>
% 6.83/7.03 $false
% 6.83/7.03 )
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of customer
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 (! [X0,X1] :
% 6.83/7.03 ( customer(X0,X1) <=>
% 6.83/7.03 $false
% 6.83/7.03 )
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP0_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP0_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP1_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP1_iProver_split <=>
% 6.83/7.03 $false
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP2_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP2_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP3_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP3_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP4_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP4_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP5_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP5_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP6_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP6_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP7_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP7_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP8_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP8_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP9_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP9_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP10_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP10_iProver_split <=>
% 6.83/7.03 $false
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP11_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP11_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP12_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP12_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP13_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP13_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP14_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP14_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP15_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP15_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP16_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP16_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP17_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP17_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP18_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP18_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP19_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP19_iProver_split <=>
% 6.83/7.03 $false
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP20_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP20_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP21_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP21_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP22_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP22_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP23_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP23_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP24_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP24_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP25_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP25_iProver_split <=>
% 6.83/7.03 $false
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03 %------ Positive definition of sP26_iProver_split
% 6.83/7.03 fof(lit_def,axiom,
% 6.83/7.03 ( sP26_iProver_split <=>
% 6.83/7.03 $true
% 6.83/7.03 )
% 6.83/7.03 ).
% 6.83/7.03
% 6.83/7.03
% 6.83/7.03
% 6.83/7.03 % ------ Statistics
% 6.83/7.03
% 6.83/7.03 % ------ General
% 6.83/7.03
% 6.83/7.03 % num_of_input_clauses: 360
% 6.83/7.03 % num_of_input_neg_conjectures: 360
% 6.83/7.03 % num_of_splits: 640
% 6.83/7.03 % num_of_split_atoms: 27
% 6.83/7.03 % num_of_sem_filtered_clauses: 0
% 6.83/7.03 % num_of_subtypes: 0
% 6.83/7.03 % monotx_restored_types: 0
% 6.83/7.03 % sat_num_of_epr_types: 0
% 6.83/7.03 % sat_num_of_non_cyclic_types: 0
% 6.83/7.03 % sat_guarded_non_collapsed_types: 0
% 6.83/7.03 % is_epr: 0
% 6.83/7.03 % is_horn: 0
% 6.83/7.03 % has_eq: 0
% 6.83/7.03 % num_pure_diseq_elim: 0
% 6.83/7.03 % simp_replaced_by: 0
% 6.83/7.03 % res_preprocessed: 1360
% 6.83/7.03 % prep_upred: 0
% 6.83/7.03 % prep_unflattend: 0
% 6.83/7.03 % pred_elim_cands: 27
% 6.83/7.03 % pred_elim: 0
% 6.83/7.03 % pred_elim_cl: 0
% 6.83/7.03 % pred_elim_cycles: 27
% 6.83/7.03 % forced_gc_time: 0
% 6.83/7.03 % gc_basic_clause_elim: 0
% 6.83/7.03 % parsing_time: 0.033
% 6.83/7.03 % sem_filter_time: 0.
% 6.83/7.03 % pred_elim_time: 0.3
% 6.83/7.03 % out_proof_time: 0.
% 6.83/7.03 % monotx_time: 0.
% 6.83/7.03 % subtype_inf_time: 0.
% 6.83/7.03 % unif_index_cands_time: 0.003
% 6.83/7.03 % unif_index_add_time: 0.003
% 6.83/7.03 % total_time: 6.538
% 6.83/7.03 % num_of_symbols: 79
% 6.83/7.03 % num_of_terms: 1225
% 6.83/7.03
% 6.83/7.03 % ------ Propositional Solver
% 6.83/7.03
% 6.83/7.03 % prop_solver_calls: 3
% 6.83/7.03 % prop_fast_solver_calls: 10422
% 6.83/7.03 % prop_num_of_clauses: 1621
% 6.83/7.03 % prop_preprocess_simplified: 9531
% 6.83/7.03 % prop_fo_subsumed: 0
% 6.83/7.03 % prop_solver_time: 0.
% 6.83/7.03 % prop_fast_solver_time: 0.016
% 6.83/7.03 % prop_unsat_core_time: 0.
% 6.83/7.03
% 6.83/7.03 % ------ QBF
% 6.83/7.03
% 6.83/7.03 % qbf_q_res: 0
% 6.83/7.03 % qbf_num_tautologies: 0
% 6.83/7.03 % qbf_prep_cycles: 0
% 6.83/7.03
% 6.83/7.03 % ------ BMC1
% 6.83/7.03
% 6.83/7.03 % bmc1_current_bound: -1
% 6.83/7.03 % bmc1_last_solved_bound: -1
% 6.83/7.03 % bmc1_unsat_core_size: -1
% 6.83/7.03 % bmc1_unsat_core_parents_size: -1
% 6.83/7.03 % bmc1_merge_next_fun: 0
% 6.83/7.03 % bmc1_unsat_core_clauses_time: 0.
% 6.83/7.03
% 6.83/7.03 % ------ Instantiation
% 6.83/7.03
% 6.83/7.03 % inst_num_of_clauses: 424
% 6.83/7.03 % inst_num_in_passive: 0
% 6.83/7.03 % inst_num_in_active: 424
% 6.83/7.03 % inst_num_in_unprocessed: 0
% 6.83/7.03 % inst_num_of_loops: 490
% 6.83/7.03 % inst_num_of_learning_restarts: 0
% 6.83/7.03 % inst_num_moves_active_passive: 62
% 6.83/7.03 % inst_lit_activity: 143
% 6.83/7.03 % inst_lit_activity_moves: 0
% 6.83/7.03 % inst_num_tautologies: 0
% 6.83/7.03 % inst_num_prop_implied: 0
% 6.83/7.03 % inst_num_existing_simplified: 0
% 6.83/7.03 % inst_num_eq_res_simplified: 0
% 6.83/7.03 % inst_num_child_elim: 0
% 6.83/7.03 % inst_num_of_dismatching_blockings: 0
% 6.83/7.03 % inst_num_of_non_proper_insts: 45
% 6.83/7.03 % inst_num_of_duplicates: 0
% 6.83/7.03 % inst_inst_num_from_inst_to_res: 0
% 6.83/7.03 % inst_dismatching_checking_time: 0.
% 6.83/7.03
% 6.83/7.03 % ------ Resolution
% 6.83/7.03
% 6.83/7.03 % res_num_of_clauses: 2167
% 6.83/7.03 % res_num_in_passive: 884
% 6.83/7.03 % res_num_in_active: 1338
% 6.83/7.03 % res_num_of_loops: 2000
% 6.83/7.03 % res_forward_subset_subsumed: 1700
% 6.83/7.03 % res_backward_subset_subsumed: 339
% 6.83/7.03 % res_forward_subsumed: 372
% 6.83/7.03 % res_backward_subsumed: 8
% 6.83/7.03 % res_forward_subsumption_resolution: 1452
% 6.83/7.03 % res_backward_subsumption_resolution: 0
% 6.83/7.03 % res_clause_to_clause_subsumption: 4537
% 6.83/7.03 % res_orphan_elimination: 0
% 6.83/7.03 % res_tautology_del: 370
% 6.83/7.03 % res_num_eq_res_simplified: 0
% 6.83/7.03 % res_num_sel_changes: 0
% 6.83/7.03 % res_moves_from_active_to_pass: 0
% 6.83/7.03
% 6.83/7.03 % Status Unknown
% 6.87/7.11 % Orienting using strategy ClausalAll
% 6.87/7.11 % FOF problem with conjecture
% 6.87/7.11 % 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_3bc875.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_cd9086.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_843d8c | grep -v "SZS"
% 6.87/7.12
% 6.87/7.12 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 6.87/7.12
% 6.87/7.12 %
% 6.87/7.12 % ------ iProver source info
% 6.87/7.12
% 6.87/7.12 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 6.87/7.12 % git: non_committed_changes: true
% 6.87/7.12 % git: last_make_outside_of_git: true
% 6.87/7.12
% 6.87/7.12 %
% 6.87/7.12 % ------ Input Options
% 6.87/7.12
% 6.87/7.12 % --out_options all
% 6.87/7.12 % --tptp_safe_out true
% 6.87/7.12 % --problem_path ""
% 6.87/7.12 % --include_path ""
% 6.87/7.12 % --clausifier .//eprover
% 6.87/7.12 % --clausifier_options --tstp-format
% 6.87/7.12 % --stdin false
% 6.87/7.12 % --dbg_backtrace false
% 6.87/7.12 % --dbg_dump_prop_clauses false
% 6.87/7.12 % --dbg_dump_prop_clauses_file -
% 6.87/7.12 % --dbg_out_stat false
% 6.87/7.12
% 6.87/7.12 % ------ General Options
% 6.87/7.12
% 6.87/7.12 % --fof false
% 6.87/7.12 % --time_out_real 150.
% 6.87/7.12 % --time_out_prep_mult 0.2
% 6.87/7.12 % --time_out_virtual -1.
% 6.87/7.12 % --schedule none
% 6.87/7.12 % --ground_splitting input
% 6.87/7.12 % --splitting_nvd 16
% 6.87/7.12 % --non_eq_to_eq false
% 6.87/7.12 % --prep_gs_sim true
% 6.87/7.12 % --prep_unflatten false
% 6.87/7.12 % --prep_res_sim true
% 6.87/7.12 % --prep_upred true
% 6.87/7.12 % --res_sim_input true
% 6.87/7.12 % --clause_weak_htbl true
% 6.87/7.12 % --gc_record_bc_elim false
% 6.87/7.12 % --symbol_type_check false
% 6.87/7.12 % --clausify_out false
% 6.87/7.12 % --large_theory_mode false
% 6.87/7.12 % --prep_sem_filter none
% 6.87/7.12 % --prep_sem_filter_out false
% 6.87/7.12 % --preprocessed_out false
% 6.87/7.12 % --sub_typing false
% 6.87/7.12 % --brand_transform false
% 6.87/7.12 % --pure_diseq_elim true
% 6.87/7.12 % --min_unsat_core false
% 6.87/7.12 % --pred_elim true
% 6.87/7.12 % --add_important_lit false
% 6.87/7.12 % --soft_assumptions false
% 6.87/7.12 % --reset_solvers false
% 6.87/7.12 % --bc_imp_inh []
% 6.87/7.12 % --conj_cone_tolerance 1.5
% 6.87/7.12 % --prolific_symb_bound 500
% 6.87/7.12 % --lt_threshold 2000
% 6.87/7.12
% 6.87/7.12 % ------ SAT Options
% 6.87/7.12
% 6.87/7.12 % --sat_mode false
% 6.87/7.12 % --sat_fm_restart_options ""
% 6.87/7.12 % --sat_gr_def false
% 6.87/7.12 % --sat_epr_types true
% 6.87/7.12 % --sat_non_cyclic_types false
% 6.87/7.12 % --sat_finite_models false
% 6.87/7.12 % --sat_fm_lemmas false
% 6.87/7.12 % --sat_fm_prep false
% 6.87/7.12 % --sat_fm_uc_incr true
% 6.87/7.12 % --sat_out_model small
% 6.87/7.12 % --sat_out_clauses false
% 6.87/7.12
% 6.87/7.12 % ------ QBF Options
% 6.87/7.12
% 6.87/7.12 % --qbf_mode false
% 6.87/7.12 % --qbf_elim_univ true
% 6.87/7.12 % --qbf_sk_in true
% 6.87/7.12 % --qbf_pred_elim true
% 6.87/7.12 % --qbf_split 32
% 6.87/7.12
% 6.87/7.12 % ------ BMC1 Options
% 6.87/7.12
% 6.87/7.12 % --bmc1_incremental false
% 6.87/7.12 % --bmc1_axioms reachable_all
% 6.87/7.12 % --bmc1_min_bound 0
% 6.87/7.12 % --bmc1_max_bound -1
% 6.87/7.12 % --bmc1_max_bound_default -1
% 6.87/7.12 % --bmc1_symbol_reachability true
% 6.87/7.12 % --bmc1_property_lemmas false
% 6.87/7.12 % --bmc1_k_induction false
% 6.87/7.12 % --bmc1_non_equiv_states false
% 6.87/7.12 % --bmc1_deadlock false
% 6.87/7.12 % --bmc1_ucm false
% 6.87/7.12 % --bmc1_add_unsat_core none
% 6.87/7.12 % --bmc1_unsat_core_children false
% 6.87/7.12 % --bmc1_unsat_core_extrapolate_axioms false
% 6.87/7.12 % --bmc1_out_stat full
% 6.87/7.12 % --bmc1_ground_init false
% 6.87/7.12 % --bmc1_pre_inst_next_state false
% 6.87/7.12 % --bmc1_pre_inst_state false
% 6.87/7.12 % --bmc1_pre_inst_reach_state false
% 6.87/7.12 % --bmc1_out_unsat_core false
% 6.87/7.12 % --bmc1_aig_witness_out false
% 6.87/7.12 % --bmc1_verbose false
% 6.87/7.12 % --bmc1_dump_clauses_tptp false
% 7.32/7.55 % --bmc1_dump_unsat_core_tptp false
% 7.32/7.55 % --bmc1_dump_file -
% 7.32/7.55 % --bmc1_ucm_expand_uc_limit 128
% 7.32/7.55 % --bmc1_ucm_n_expand_iterations 6
% 7.32/7.55 % --bmc1_ucm_extend_mode 1
% 7.32/7.55 % --bmc1_ucm_init_mode 2
% 7.32/7.55 % --bmc1_ucm_cone_mode none
% 7.32/7.55 % --bmc1_ucm_reduced_relation_type 0
% 7.32/7.55 % --bmc1_ucm_relax_model 4
% 7.32/7.55 % --bmc1_ucm_full_tr_after_sat true
% 7.32/7.55 % --bmc1_ucm_expand_neg_assumptions false
% 7.32/7.55 % --bmc1_ucm_layered_model none
% 7.32/7.55 % --bmc1_ucm_max_lemma_size 10
% 7.32/7.55
% 7.32/7.55 % ------ AIG Options
% 7.32/7.55
% 7.32/7.55 % --aig_mode false
% 7.32/7.55
% 7.32/7.55 % ------ Instantiation Options
% 7.32/7.55
% 7.32/7.55 % --instantiation_flag true
% 7.32/7.55 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 7.32/7.55 % --inst_solver_per_active 750
% 7.32/7.55 % --inst_solver_calls_frac 0.5
% 7.32/7.55 % --inst_passive_queue_type priority_queues
% 7.32/7.55 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 7.32/7.55 % --inst_passive_queues_freq [25;2]
% 7.32/7.55 % --inst_dismatching true
% 7.32/7.55 % --inst_eager_unprocessed_to_passive true
% 7.32/7.55 % --inst_prop_sim_given true
% 7.32/7.55 % --inst_prop_sim_new false
% 7.32/7.55 % --inst_orphan_elimination true
% 7.32/7.55 % --inst_learning_loop_flag true
% 7.32/7.55 % --inst_learning_start 3000
% 7.32/7.55 % --inst_learning_factor 2
% 7.32/7.55 % --inst_start_prop_sim_after_learn 3
% 7.32/7.55 % --inst_sel_renew solver
% 7.32/7.55 % --inst_lit_activity_flag true
% 7.32/7.55 % --inst_out_proof true
% 7.32/7.55
% 7.32/7.55 % ------ Resolution Options
% 7.32/7.55
% 7.32/7.55 % --resolution_flag true
% 7.32/7.55 % --res_lit_sel kbo_max
% 7.32/7.55 % --res_to_prop_solver none
% 7.32/7.55 % --res_prop_simpl_new false
% 7.32/7.55 % --res_prop_simpl_given false
% 7.32/7.55 % --res_passive_queue_type priority_queues
% 7.32/7.55 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 7.32/7.55 % --res_passive_queues_freq [15;5]
% 7.32/7.55 % --res_forward_subs full
% 7.32/7.55 % --res_backward_subs full
% 7.32/7.55 % --res_forward_subs_resolution true
% 7.32/7.55 % --res_backward_subs_resolution true
% 7.32/7.55 % --res_orphan_elimination false
% 7.32/7.55 % --res_time_limit 1000.
% 7.32/7.55 % --res_out_proof true
% 7.32/7.55 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_3bc875.s
% 7.32/7.55 % --modulo true
% 7.32/7.55
% 7.32/7.55 % ------ Combination Options
% 7.32/7.55
% 7.32/7.55 % --comb_res_mult 1000
% 7.32/7.55 % --comb_inst_mult 300
% 7.32/7.55 % ------
% 7.32/7.55
% 7.32/7.55 % ------ Parsing...% successful
% 7.32/7.55
% 7.32/7.55 % ------ Preprocessing... gs_s sp: 640 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 7.32/7.55
% 7.32/7.55 % ------ Proving...
% 7.32/7.55 % ------ Problem Properties
% 7.32/7.55
% 7.32/7.55 %
% 7.32/7.55 % EPR false
% 7.32/7.55 % Horn false
% 7.32/7.55 % Has equality false
% 7.32/7.55
% 7.32/7.55 % % ------ Input Options Time Limit: Unbounded
% 7.32/7.55
% 7.32/7.55
% 7.32/7.55 % % ------ Current options:
% 7.32/7.55
% 7.32/7.55 % ------ Input Options
% 7.32/7.55
% 7.32/7.55 % --out_options all
% 7.32/7.55 % --tptp_safe_out true
% 7.32/7.55 % --problem_path ""
% 7.32/7.55 % --include_path ""
% 7.32/7.55 % --clausifier .//eprover
% 7.32/7.55 % --clausifier_options --tstp-format
% 7.32/7.55 % --stdin false
% 7.32/7.55 % --dbg_backtrace false
% 7.32/7.55 % --dbg_dump_prop_clauses false
% 7.32/7.55 % --dbg_dump_prop_clauses_file -
% 7.32/7.55 % --dbg_out_stat false
% 7.32/7.55
% 7.32/7.55 % ------ General Options
% 7.32/7.55
% 7.32/7.55 % --fof false
% 7.32/7.55 % --time_out_real 150.
% 7.32/7.55 % --time_out_prep_mult 0.2
% 7.32/7.55 % --time_out_virtual -1.
% 7.32/7.55 % --schedule none
% 7.32/7.55 % --ground_splitting input
% 7.32/7.55 % --splitting_nvd 16
% 7.32/7.55 % --non_eq_to_eq false
% 7.32/7.55 % --prep_gs_sim true
% 7.32/7.55 % --prep_unflatten false
% 7.32/7.55 % --prep_res_sim true
% 7.32/7.55 % --prep_upred true
% 7.32/7.55 % --res_sim_input true
% 7.32/7.55 % --clause_weak_htbl true
% 7.32/7.55 % --gc_record_bc_elim false
% 7.32/7.55 % --symbol_type_check false
% 7.32/7.55 % --clausify_out false
% 7.32/7.55 % --large_theory_mode false
% 7.32/7.55 % --prep_sem_filter none
% 7.32/7.55 % --prep_sem_filter_out false
% 7.32/7.55 % --preprocessed_out false
% 7.32/7.55 % --sub_typing false
% 7.32/7.55 % --brand_transform false
% 7.32/7.55 % --pure_diseq_elim true
% 7.32/7.55 % --min_unsat_core false
% 7.32/7.55 % --pred_elim true
% 7.32/7.55 % --add_important_lit false
% 7.32/7.55 % --soft_assumptions false
% 7.32/7.55 % --reset_solvers false
% 7.32/7.55 % --bc_imp_inh []
% 7.32/7.55 % --conj_cone_tolerance 1.5
% 7.32/7.55 % --prolific_symb_bound 500
% 7.32/7.55 % --lt_threshold 2000
% 7.32/7.55
% 7.32/7.55 % ------ SAT Options
% 7.32/7.55
% 7.32/7.55 % --sat_mode false
% 7.32/7.55 % --sat_fm_restart_options ""
% 7.32/7.55 % --sat_gr_def false
% 7.32/7.55 % --sat_epr_types true
% 7.32/7.55 % --sat_non_cyclic_types false
% 7.32/7.55 % --sat_finite_models false
% 7.32/7.55 % --sat_fm_lemmas false
% 7.32/7.55 % --sat_fm_prep false
% 7.32/7.55 % --sat_fm_uc_incr true
% 7.32/7.55 % --sat_out_model small
% 7.32/7.55 % --sat_out_clauses false
% 7.32/7.55
% 7.32/7.55 % ------ QBF Options
% 7.32/7.55
% 7.32/7.55 % --qbf_mode false
% 7.32/7.55 % --qbf_elim_univ true
% 7.32/7.55 % --qbf_sk_in true
% 7.32/7.55 % --qbf_pred_elim true
% 7.32/7.55 % --qbf_split 32
% 7.32/7.55
% 7.32/7.55 % ------ BMC1 Options
% 7.32/7.55
% 7.32/7.55 % --bmc1_incremental false
% 7.32/7.55 % --bmc1_axioms reachable_all
% 7.32/7.55 % --bmc1_min_bound 0
% 7.32/7.55 % --bmc1_max_bound -1
% 7.32/7.55 % --bmc1_max_bound_default -1
% 7.32/7.55 % --bmc1_symbol_reachability true
% 7.32/7.55 % --bmc1_property_lemmas false
% 7.32/7.55 % --bmc1_k_induction false
% 7.32/7.55 % --bmc1_non_equiv_states false
% 7.32/7.55 % --bmc1_deadlock false
% 7.32/7.55 % --bmc1_ucm false
% 7.32/7.55 % --bmc1_add_unsat_core none
% 7.32/7.55 % --bmc1_unsat_core_children false
% 7.32/7.55 % --bmc1_unsat_core_extrapolate_axioms false
% 7.32/7.55 % --bmc1_out_stat full
% 7.32/7.55 % --bmc1_ground_init false
% 7.32/7.55 % --bmc1_pre_inst_next_state false
% 7.32/7.55 % --bmc1_pre_inst_state false
% 7.32/7.55 % --bmc1_pre_inst_reach_state false
% 7.32/7.55 % --bmc1_out_unsat_core false
% 7.32/7.55 % --bmc1_aig_witness_out false
% 7.32/7.55 % --bmc1_verbose false
% 7.32/7.55 % --bmc1_dump_clauses_tptp false
% 7.32/7.55 % --bmc1_dump_unsat_core_tptp false
% 7.32/7.55 % --bmc1_dump_file -
% 7.32/7.55 % --bmc1_ucm_expand_uc_limit 128
% 7.32/7.55 % --bmc1_ucm_n_expand_iterations 6
% 7.32/7.55 % --bmc1_ucm_extend_mode 1
% 7.32/7.55 % --bmc1_ucm_init_mode 2
% 7.32/7.55 % --bmc1_ucm_cone_mode none
% 7.32/7.55 % --bmc1_ucm_reduced_relation_type 0
% 7.32/7.55 % --bmc1_ucm_relax_model 4
% 7.32/7.55 % --bmc1_ucm_full_tr_after_sat true
% 7.32/7.55 % --bmc1_ucm_expand_neg_assumptions false
% 7.32/7.55 % --bmc1_ucm_layered_model none
% 7.32/7.55 % --bmc1_ucm_max_lemma_size 10
% 7.32/7.55
% 7.32/7.55 % ------ AIG Options
% 7.32/7.55
% 7.32/7.55 % --aig_mode false
% 7.32/7.55
% 7.32/7.55 % ------ Instantiation Options
% 7.32/7.55
% 7.32/7.55 % --instantiation_flag true
% 7.32/7.55 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 7.32/7.55 % --inst_solver_per_active 750
% 7.32/7.55 % --inst_solver_calls_frac 0.5
% 7.32/7.55 % --inst_passive_queue_type priority_queues
% 7.32/7.55 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 7.32/7.55 % --inst_passive_queues_freq [25;2]
% 7.32/7.55 % --inst_dismatching true
% 7.32/7.55 % --inst_eager_unprocessed_to_passive true
% 7.32/7.55 % --inst_prop_sim_given true
% 13.34/13.54 % --inst_prop_sim_new false
% 13.34/13.54 % --inst_orphan_elimination true
% 13.34/13.54 % --inst_learning_loop_flag true
% 13.34/13.54 % --inst_learning_start 3000
% 13.34/13.54 % --inst_learning_factor 2
% 13.34/13.54 % --inst_start_prop_sim_after_learn 3
% 13.34/13.54 % --inst_sel_renew solver
% 13.34/13.54 % --inst_lit_activity_flag true
% 13.34/13.54 % --inst_out_proof true
% 13.34/13.54
% 13.34/13.54 % ------ Resolution Options
% 13.34/13.54
% 13.34/13.54 % --resolution_flag true
% 13.34/13.54 % --res_lit_sel kbo_max
% 13.34/13.54 % --res_to_prop_solver none
% 13.34/13.54 % --res_prop_simpl_new false
% 13.34/13.54 % --res_prop_simpl_given false
% 13.34/13.54 % --res_passive_queue_type priority_queues
% 13.34/13.54 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 13.34/13.54 % --res_passive_queues_freq [15;5]
% 13.34/13.54 % --res_forward_subs full
% 13.34/13.54 % --res_backward_subs full
% 13.34/13.54 % --res_forward_subs_resolution true
% 13.34/13.54 % --res_backward_subs_resolution true
% 13.34/13.54 % --res_orphan_elimination false
% 13.34/13.54 % --res_time_limit 1000.
% 13.34/13.54 % --res_out_proof true
% 13.34/13.54 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_3bc875.s
% 13.34/13.54 % --modulo true
% 13.34/13.54
% 13.34/13.54 % ------ Combination Options
% 13.34/13.54
% 13.34/13.54 % --comb_res_mult 1000
% 13.34/13.54 % --comb_inst_mult 300
% 13.34/13.54 % ------
% 13.34/13.54
% 13.34/13.54
% 13.34/13.54
% 13.34/13.54 % ------ Proving...
% 13.34/13.54 % warning: shown sat in sat incomplete mode
% 13.34/13.54 %
% 13.34/13.54
% 13.34/13.54
% 13.34/13.54 ------ Building Model...Done
% 13.34/13.54
% 13.34/13.54 %------ The model is defined over ground terms (initial term algebra).
% 13.34/13.54 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 13.34/13.54 %------ where \phi is a formula over the term algebra.
% 13.34/13.54 %------ If we have equality in the problem then it is also defined as a predicate above,
% 13.34/13.54 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 13.34/13.54 %------ See help for --sat_out_model for different model outputs.
% 13.34/13.54 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 13.34/13.54 %------ where the first argument stands for the sort ($i in the unsorted case)
% 13.34/13.54
% 13.34/13.54
% 13.34/13.54
% 13.34/13.54
% 13.34/13.54 %------ Negative definition of actual_world
% 13.34/13.54 fof(lit_def,axiom,
% 13.34/13.54 (! [X0] :
% 13.34/13.54 ( ~(actual_world(X0)) <=>
% 13.34/13.54 $false
% 13.34/13.54 )
% 13.34/13.54 )
% 13.34/13.54 ).
% 13.34/13.54
% 13.34/13.54 %------ Positive definition of coffee
% 13.34/13.54 fof(lit_def,axiom,
% 13.34/13.54 (! [X0,X1] :
% 13.34/13.54 ( coffee(X0,X1) <=>
% 13.34/13.54 (
% 13.34/13.54 (
% 13.34/13.54 ( X0=sk2_esk9_0 & X1=sk2_esk10_0 )
% 13.34/13.54 )
% 13.34/13.54
% 13.34/13.54 )
% 13.34/13.54 )
% 13.34/13.54 )
% 13.34/13.54 ).
% 13.34/13.54
% 13.34/13.54 %------ Positive definition of see
% 13.34/13.54 fof(lit_def,axiom,
% 13.34/13.54 (! [X0,X1] :
% 13.34/13.54 ( see(X0,X1) <=>
% 13.34/13.54 $false
% 13.34/13.54 )
% 13.34/13.54 )
% 13.34/13.54 ).
% 13.34/13.54
% 13.34/13.54 %------ Positive definition of nonreflexive
% 13.34/13.54 fof(lit_def,axiom,
% 13.34/13.54 (! [X0,X1] :
% 13.34/13.54 ( nonreflexive(X0,X1) <=>
% 13.34/13.54 $false
% 13.34/13.54 )
% 13.34/13.54 )
% 13.34/13.54 ).
% 13.34/13.54
% 13.34/13.54 %------ Positive definition of restaurant
% 13.34/13.54 fof(lit_def,axiom,
% 13.34/13.54 (! [X0,X1] :
% 13.34/13.54 ( restaurant(X0,X1) <=>
% 13.34/13.54 $false
% 13.34/13.54 )
% 13.34/13.54 )
% 13.34/13.54 ).
% 13.34/13.54
% 13.34/13.54 %------ Positive definition of customer
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 (! [X0,X1] :
% 13.34/13.55 ( customer(X0,X1) <=>
% 13.34/13.55 $false
% 13.34/13.55 )
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP0_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP0_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP1_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP1_iProver_split <=>
% 13.34/13.55 $false
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP2_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP2_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP3_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP3_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP4_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP4_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP5_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP5_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP6_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP6_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP7_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP7_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP8_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP8_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP9_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP9_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP10_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP10_iProver_split <=>
% 13.34/13.55 $false
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP11_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP11_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP12_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP12_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP13_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP13_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP14_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP14_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP15_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP15_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP16_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP16_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP17_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP17_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP18_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP18_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP19_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP19_iProver_split <=>
% 13.34/13.55 $false
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP20_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP20_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP21_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP21_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP22_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP22_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP23_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP23_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP24_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP24_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP25_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP25_iProver_split <=>
% 13.34/13.55 $false
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55 %------ Positive definition of sP26_iProver_split
% 13.34/13.55 fof(lit_def,axiom,
% 13.34/13.55 ( sP26_iProver_split <=>
% 13.34/13.55 $true
% 13.34/13.55 )
% 13.34/13.55 ).
% 13.34/13.55
% 13.34/13.55
% 13.34/13.55
% 13.34/13.55 % ------ Statistics
% 13.34/13.55
% 13.34/13.55 % ------ General
% 13.34/13.55
% 13.34/13.55 % num_of_input_clauses: 360
% 13.34/13.55 % num_of_input_neg_conjectures: 360
% 13.34/13.55 % num_of_splits: 640
% 13.34/13.55 % num_of_split_atoms: 27
% 13.34/13.55 % num_of_sem_filtered_clauses: 0
% 13.34/13.55 % num_of_subtypes: 0
% 13.34/13.55 % monotx_restored_types: 0
% 13.34/13.55 % sat_num_of_epr_types: 0
% 13.34/13.55 % sat_num_of_non_cyclic_types: 0
% 13.34/13.55 % sat_guarded_non_collapsed_types: 0
% 13.34/13.55 % is_epr: 0
% 13.34/13.55 % is_horn: 0
% 13.34/13.55 % has_eq: 0
% 13.34/13.55 % num_pure_diseq_elim: 0
% 13.34/13.55 % simp_replaced_by: 0
% 13.34/13.55 % res_preprocessed: 1360
% 13.34/13.55 % prep_upred: 0
% 13.34/13.55 % prep_unflattend: 0
% 13.34/13.55 % pred_elim_cands: 27
% 13.34/13.55 % pred_elim: 0
% 13.34/13.55 % pred_elim_cl: 0
% 13.34/13.55 % pred_elim_cycles: 27
% 13.34/13.55 % forced_gc_time: 0
% 13.34/13.55 % gc_basic_clause_elim: 0
% 13.34/13.55 % parsing_time: 0.03
% 13.34/13.55 % sem_filter_time: 0.
% 13.34/13.55 % pred_elim_time: 0.272
% 13.34/13.55 % out_proof_time: 0.
% 13.34/13.55 % monotx_time: 0.
% 13.34/13.55 % subtype_inf_time: 0.
% 13.34/13.55 % unif_index_cands_time: 0.002
% 13.34/13.55 % unif_index_add_time: 0.003
% 13.34/13.55 % total_time: 6.433
% 13.34/13.55 % num_of_symbols: 79
% 13.34/13.55 % num_of_terms: 1225
% 13.34/13.55
% 13.34/13.55 % ------ Propositional Solver
% 13.34/13.55
% 13.34/13.55 % prop_solver_calls: 3
% 13.34/13.55 % prop_fast_solver_calls: 10422
% 13.34/13.55 % prop_num_of_clauses: 1621
% 13.34/13.55 % prop_preprocess_simplified: 9531
% 13.34/13.55 % prop_fo_subsumed: 0
% 13.34/13.55 % prop_solver_time: 0.
% 13.34/13.55 % prop_fast_solver_time: 0.014
% 13.34/13.55 % prop_unsat_core_time: 0.
% 13.34/13.55
% 13.34/13.55 % ------ QBF
% 13.34/13.55
% 13.34/13.55 % qbf_q_res: 0
% 13.34/13.55 % qbf_num_tautologies: 0
% 13.34/13.55 % qbf_prep_cycles: 0
% 13.34/13.55
% 13.34/13.55 % ------ BMC1
% 13.34/13.55
% 13.34/13.55 % bmc1_current_bound: -1
% 13.34/13.55 % bmc1_last_solved_bound: -1
% 13.34/13.55 % bmc1_unsat_core_size: -1
% 13.34/13.55 % bmc1_unsat_core_parents_size: -1
% 13.34/13.55 % bmc1_merge_next_fun: 0
% 13.34/13.55 % bmc1_unsat_core_clauses_time: 0.
% 13.34/13.55
% 13.34/13.55 % ------ Instantiation
% 13.34/13.55
% 13.34/13.55 % inst_num_of_clauses: 424
% 13.34/13.55 % inst_num_in_passive: 0
% 13.34/13.55 % inst_num_in_active: 424
% 13.34/13.55 % inst_num_in_unprocessed: 0
% 13.34/13.55 % inst_num_of_loops: 490
% 13.34/13.55 % inst_num_of_learning_restarts: 0
% 13.34/13.55 % inst_num_moves_active_passive: 62
% 13.34/13.55 % inst_lit_activity: 143
% 13.34/13.55 % inst_lit_activity_moves: 0
% 13.34/13.55 % inst_num_tautologies: 0
% 13.34/13.55 % inst_num_prop_implied: 0
% 13.34/13.55 % inst_num_existing_simplified: 0
% 13.34/13.55 % inst_num_eq_res_simplified: 0
% 13.34/13.55 % inst_num_child_elim: 0
% 13.34/13.55 % inst_num_of_dismatching_blockings: 0
% 13.34/13.55 % inst_num_of_non_proper_insts: 45
% 13.34/13.55 % inst_num_of_duplicates: 0
% 13.34/13.55 % inst_inst_num_from_inst_to_res: 0
% 13.34/13.55 % inst_dismatching_checking_time: 0.
% 13.34/13.55
% 13.34/13.55 % ------ Resolution
% 13.34/13.55
% 13.34/13.55 % res_num_of_clauses: 2167
% 13.34/13.55 % res_num_in_passive: 884
% 13.34/13.55 % res_num_in_active: 1338
% 13.34/13.55 % res_num_of_loops: 2000
% 13.34/13.55 % res_forward_subset_subsumed: 1700
% 13.34/13.55 % res_backward_subset_subsumed: 339
% 13.34/13.55 % res_forward_subsumed: 372
% 13.34/13.55 % res_backward_subsumed: 8
% 13.34/13.55 % res_forward_subsumption_resolution: 1452
% 13.34/13.55 % res_backward_subsumption_resolution: 0
% 13.34/13.55 % res_clause_to_clause_subsumption: 4537
% 13.34/13.55 % res_orphan_elimination: 0
% 13.34/13.55 % res_tautology_del: 370
% 13.34/13.55 % res_num_eq_res_simplified: 0
% 13.34/13.55 % res_num_sel_changes: 0
% 13.34/13.55 % res_moves_from_active_to_pass: 0
% 13.34/13.55
% 13.34/13.55 % Status Unknown
% 13.34/13.55 % Last status :
% 13.34/13.55 % SZS status Unknown
%------------------------------------------------------------------------------