TSTP Solution File: MGT034+2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT034+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n026.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 : Sun Jul 17 22:13:53 EDT 2022
% Result : Unknown 2.24s 2.41s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT034+2 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 9 10:36:33 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Running in mono-core mode
% 0.22/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.22/0.42 % FOF problem with conjecture
% 0.22/0.42 % 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_070f8e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_5cdb32.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_e54156 | grep -v "SZS"
% 0.22/0.44
% 0.22/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.44
% 0.22/0.44 %
% 0.22/0.44 % ------ iProver source info
% 0.22/0.44
% 0.22/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.44 % git: non_committed_changes: true
% 0.22/0.44 % git: last_make_outside_of_git: true
% 0.22/0.44
% 0.22/0.44 %
% 0.22/0.44 % ------ Input Options
% 0.22/0.44
% 0.22/0.44 % --out_options all
% 0.22/0.44 % --tptp_safe_out true
% 0.22/0.44 % --problem_path ""
% 0.22/0.44 % --include_path ""
% 0.22/0.44 % --clausifier .//eprover
% 0.22/0.44 % --clausifier_options --tstp-format
% 0.22/0.44 % --stdin false
% 0.22/0.44 % --dbg_backtrace false
% 0.22/0.44 % --dbg_dump_prop_clauses false
% 0.22/0.44 % --dbg_dump_prop_clauses_file -
% 0.22/0.44 % --dbg_out_stat false
% 0.22/0.44
% 0.22/0.44 % ------ General Options
% 0.22/0.44
% 0.22/0.44 % --fof false
% 0.22/0.44 % --time_out_real 150.
% 0.22/0.44 % --time_out_prep_mult 0.2
% 0.22/0.44 % --time_out_virtual -1.
% 0.22/0.44 % --schedule none
% 0.22/0.44 % --ground_splitting input
% 0.22/0.44 % --splitting_nvd 16
% 0.22/0.44 % --non_eq_to_eq false
% 0.22/0.44 % --prep_gs_sim true
% 0.22/0.44 % --prep_unflatten false
% 0.22/0.44 % --prep_res_sim true
% 0.22/0.44 % --prep_upred true
% 0.22/0.44 % --res_sim_input true
% 0.22/0.44 % --clause_weak_htbl true
% 0.22/0.44 % --gc_record_bc_elim false
% 0.22/0.44 % --symbol_type_check false
% 0.22/0.44 % --clausify_out false
% 0.22/0.44 % --large_theory_mode false
% 0.22/0.44 % --prep_sem_filter none
% 0.22/0.44 % --prep_sem_filter_out false
% 0.22/0.44 % --preprocessed_out false
% 0.22/0.44 % --sub_typing false
% 0.22/0.44 % --brand_transform false
% 0.22/0.44 % --pure_diseq_elim true
% 0.22/0.44 % --min_unsat_core false
% 0.22/0.44 % --pred_elim true
% 0.22/0.44 % --add_important_lit false
% 0.22/0.44 % --soft_assumptions false
% 0.22/0.44 % --reset_solvers false
% 0.22/0.44 % --bc_imp_inh []
% 0.22/0.44 % --conj_cone_tolerance 1.5
% 0.22/0.44 % --prolific_symb_bound 500
% 0.22/0.44 % --lt_threshold 2000
% 0.22/0.44
% 0.22/0.44 % ------ SAT Options
% 0.22/0.44
% 0.22/0.44 % --sat_mode false
% 0.22/0.44 % --sat_fm_restart_options ""
% 0.22/0.44 % --sat_gr_def false
% 0.22/0.44 % --sat_epr_types true
% 0.22/0.44 % --sat_non_cyclic_types false
% 0.22/0.44 % --sat_finite_models false
% 0.22/0.44 % --sat_fm_lemmas false
% 0.22/0.44 % --sat_fm_prep false
% 0.22/0.44 % --sat_fm_uc_incr true
% 0.22/0.44 % --sat_out_model small
% 0.22/0.44 % --sat_out_clauses false
% 0.22/0.44
% 0.22/0.44 % ------ QBF Options
% 0.22/0.44
% 0.22/0.44 % --qbf_mode false
% 0.22/0.44 % --qbf_elim_univ true
% 0.22/0.44 % --qbf_sk_in true
% 0.22/0.44 % --qbf_pred_elim true
% 0.22/0.44 % --qbf_split 32
% 0.22/0.44
% 0.22/0.44 % ------ BMC1 Options
% 0.22/0.45
% 0.22/0.45 % --bmc1_incremental false
% 0.22/0.45 % --bmc1_axioms reachable_all
% 0.22/0.45 % --bmc1_min_bound 0
% 0.22/0.45 % --bmc1_max_bound -1
% 0.22/0.45 % --bmc1_max_bound_default -1
% 0.22/0.45 % --bmc1_symbol_reachability true
% 0.22/0.45 % --bmc1_property_lemmas false
% 0.22/0.45 % --bmc1_k_induction false
% 0.22/0.45 % --bmc1_non_equiv_states false
% 0.22/0.45 % --bmc1_deadlock false
% 0.22/0.45 % --bmc1_ucm false
% 0.22/0.45 % --bmc1_add_unsat_core none
% 0.22/0.45 % --bmc1_unsat_core_children false
% 0.22/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.45 % --bmc1_out_stat full
% 0.22/0.45 % --bmc1_ground_init false
% 0.22/0.45 % --bmc1_pre_inst_next_state false
% 0.22/0.45 % --bmc1_pre_inst_state false
% 0.22/0.45 % --bmc1_pre_inst_reach_state false
% 0.22/0.45 % --bmc1_out_unsat_core false
% 0.22/0.45 % --bmc1_aig_witness_out false
% 0.22/0.45 % --bmc1_verbose false
% 0.22/0.45 % --bmc1_dump_clauses_tptp false
% 0.22/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.45 % --bmc1_dump_file -
% 0.22/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.45 % --bmc1_ucm_extend_mode 1
% 0.22/0.45 % --bmc1_ucm_init_mode 2
% 0.22/0.45 % --bmc1_ucm_cone_mode none
% 0.22/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.45 % --bmc1_ucm_relax_model 4
% 0.22/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.45 % --bmc1_ucm_layered_model none
% 0.22/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.45
% 0.22/0.45 % ------ AIG Options
% 0.22/0.45
% 0.22/0.45 % --aig_mode false
% 0.22/0.45
% 0.22/0.45 % ------ Instantiation Options
% 0.22/0.45
% 0.22/0.45 % --instantiation_flag true
% 0.22/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.45 % --inst_solver_per_active 750
% 0.22/0.45 % --inst_solver_calls_frac 0.5
% 0.22/0.45 % --inst_passive_queue_type priority_queues
% 0.22/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.45 % --inst_passive_queues_freq [25;2]
% 0.22/0.45 % --inst_dismatching true
% 0.22/0.45 % --inst_eager_unprocessed_to_passive true
% 0.22/0.45 % --inst_prop_sim_given true
% 0.22/0.45 % --inst_prop_sim_new false
% 0.22/0.45 % --inst_orphan_elimination true
% 0.22/0.45 % --inst_learning_loop_flag true
% 0.22/0.45 % --inst_learning_start 3000
% 0.22/0.45 % --inst_learning_factor 2
% 0.22/0.45 % --inst_start_prop_sim_after_learn 3
% 0.22/0.45 % --inst_sel_renew solver
% 0.22/0.45 % --inst_lit_activity_flag true
% 0.22/0.45 % --inst_out_proof true
% 0.22/0.45
% 0.22/0.45 % ------ Resolution Options
% 0.22/0.45
% 0.22/0.45 % --resolution_flag true
% 0.22/0.45 % --res_lit_sel kbo_max
% 0.22/0.45 % --res_to_prop_solver none
% 0.22/0.45 % --res_prop_simpl_new false
% 0.22/0.45 % --res_prop_simpl_given false
% 0.22/0.45 % --res_passive_queue_type priority_queues
% 0.22/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.45 % --res_passive_queues_freq [15;5]
% 0.22/0.45 % --res_forward_subs full
% 0.22/0.45 % --res_backward_subs full
% 0.22/0.45 % --res_forward_subs_resolution true
% 0.22/0.45 % --res_backward_subs_resolution true
% 0.22/0.45 % --res_orphan_elimination false
% 0.22/0.45 % --res_time_limit 1000.
% 0.22/0.45 % --res_out_proof true
% 0.22/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_070f8e.s
% 0.22/0.45 % --modulo true
% 0.22/0.45
% 0.22/0.45 % ------ Combination Options
% 0.22/0.45
% 0.22/0.45 % --comb_res_mult 1000
% 0.22/0.45 % --comb_inst_mult 300
% 0.22/0.45 % ------
% 0.22/0.45
% 0.22/0.45 % ------ Parsing...% successful
% 0.22/0.45
% 0.22/0.45 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.22/0.45
% 0.22/0.45 % ------ Proving...
% 0.22/0.45 % ------ Problem Properties
% 0.22/0.45
% 0.22/0.45 %
% 0.22/0.45 % EPR false
% 0.22/0.45 % Horn false
% 0.22/0.45 % Has equality true
% 0.22/0.45
% 0.22/0.45 % % ------ Input Options Time Limit: Unbounded
% 0.22/0.45
% 0.22/0.45
% 0.22/0.45 % % ------ Current options:
% 0.22/0.45
% 0.22/0.45 % ------ Input Options
% 0.22/0.45
% 0.22/0.45 % --out_options all
% 0.22/0.45 % --tptp_safe_out true
% 0.22/0.45 % --problem_path ""
% 0.22/0.45 % --include_path ""
% 0.22/0.45 % --clausifier .//eprover
% 0.22/0.45 % --clausifier_options --tstp-format
% 0.22/0.45 % --stdin false
% 0.22/0.45 % --dbg_backtrace false
% 0.22/0.45 % --dbg_dump_prop_clauses false
% 0.22/0.45 % --dbg_dump_prop_clauses_file -
% 0.22/0.45 % --dbg_out_stat false
% 0.22/0.45
% 0.22/0.45 % ------ General Options
% 0.22/0.45
% 0.22/0.45 % --fof false
% 0.22/0.45 % --time_out_real 150.
% 0.22/0.45 % --time_out_prep_mult 0.2
% 0.22/0.45 % --time_out_virtual -1.
% 0.22/0.45 % --schedule none
% 0.22/0.45 % --ground_splitting input
% 0.22/0.45 % --splitting_nvd 16
% 0.22/0.45 % --non_eq_to_eq false
% 0.22/0.45 % --prep_gs_sim true
% 0.22/0.45 % --prep_unflatten false
% 0.22/0.45 % --prep_res_sim true
% 0.22/0.45 % --prep_upred true
% 0.22/0.45 % --res_sim_input true
% 0.22/0.45 % --clause_weak_htbl true
% 0.22/0.45 % --gc_record_bc_elim false
% 0.22/0.45 % --symbol_type_check false
% 0.22/0.45 % --clausify_out false
% 0.22/0.45 % --large_theory_mode false
% 0.22/0.45 % --prep_sem_filter none
% 0.22/0.45 % --prep_sem_filter_out false
% 0.22/0.45 % --preprocessed_out false
% 0.22/0.45 % --sub_typing false
% 0.22/0.45 % --brand_transform false
% 0.22/0.45 % --pure_diseq_elim true
% 0.22/0.45 % --min_unsat_core false
% 0.22/0.45 % --pred_elim true
% 0.22/0.45 % --add_important_lit false
% 0.22/0.45 % --soft_assumptions false
% 0.22/0.45 % --reset_solvers false
% 0.22/0.45 % --bc_imp_inh []
% 0.22/0.45 % --conj_cone_tolerance 1.5
% 0.22/0.45 % --prolific_symb_bound 500
% 0.22/0.45 % --lt_threshold 2000
% 0.22/0.45
% 0.22/0.45 % ------ SAT Options
% 0.22/0.45
% 0.22/0.45 % --sat_mode false
% 0.22/0.45 % --sat_fm_restart_options ""
% 0.22/0.45 % --sat_gr_def false
% 0.22/0.45 % --sat_epr_types true
% 0.22/0.45 % --sat_non_cyclic_types false
% 0.22/0.45 % --sat_finite_models false
% 0.22/0.45 % --sat_fm_lemmas false
% 0.22/0.45 % --sat_fm_prep false
% 0.22/0.45 % --sat_fm_uc_incr true
% 0.22/0.45 % --sat_out_model small
% 0.22/0.45 % --sat_out_clauses false
% 0.22/0.45
% 0.22/0.45 % ------ QBF Options
% 0.22/0.45
% 0.22/0.45 % --qbf_mode false
% 0.22/0.45 % --qbf_elim_univ true
% 0.22/0.45 % --qbf_sk_in true
% 0.22/0.45 % --qbf_pred_elim true
% 0.22/0.45 % --qbf_split 32
% 0.22/0.45
% 0.22/0.45 % ------ BMC1 Options
% 0.22/0.45
% 0.22/0.45 % --bmc1_incremental false
% 0.22/0.45 % --bmc1_axioms reachable_all
% 0.22/0.45 % --bmc1_min_bound 0
% 0.22/0.45 % --bmc1_max_bound -1
% 0.22/0.45 % --bmc1_max_bound_default -1
% 0.22/0.45 % --bmc1_symbol_reachability true
% 0.22/0.45 % --bmc1_property_lemmas false
% 0.22/0.45 % --bmc1_k_induction false
% 0.22/0.45 % --bmc1_non_equiv_states false
% 0.22/0.45 % --bmc1_deadlock false
% 0.22/0.45 % --bmc1_ucm false
% 0.22/0.45 % --bmc1_add_unsat_core none
% 0.22/0.45 % --bmc1_unsat_core_children false
% 0.22/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.45 % --bmc1_out_stat full
% 0.22/0.45 % --bmc1_ground_init false
% 0.22/0.45 % --bmc1_pre_inst_next_state false
% 0.22/0.45 % --bmc1_pre_inst_state false
% 0.22/0.45 % --bmc1_pre_inst_reach_state false
% 0.22/0.45 % --bmc1_out_unsat_core false
% 0.22/0.45 % --bmc1_aig_witness_out false
% 0.22/0.45 % --bmc1_verbose false
% 0.22/0.45 % --bmc1_dump_clauses_tptp false
% 0.22/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.45 % --bmc1_dump_file -
% 0.22/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.45 % --bmc1_ucm_extend_mode 1
% 0.22/0.45 % --bmc1_ucm_init_mode 2
% 0.22/0.45 % --bmc1_ucm_cone_mode none
% 0.22/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.45 % --bmc1_ucm_relax_model 4
% 0.22/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.45 % --bmc1_ucm_layered_model none
% 0.22/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.45
% 0.22/0.45 % ------ AIG Options
% 0.22/0.45
% 0.22/0.45 % --aig_mode false
% 0.22/0.45
% 0.22/0.45 % ------ Instantiation Options
% 0.22/0.45
% 0.22/0.45 % --instantiation_flag true
% 0.22/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.45 % --inst_solver_per_active 750
% 0.22/0.45 % --inst_solver_calls_frac 0.5
% 0.22/0.45 % --inst_passive_queue_type priority_queues
% 0.22/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.45 % --inst_passive_queues_freq [25;2]
% 0.22/0.45 % --inst_dismatching true
% 0.22/0.45 % --inst_eager_unprocessed_to_passive true
% 0.22/0.45 % --inst_prop_sim_given true
% 1.08/1.24 % --inst_prop_sim_new false
% 1.08/1.24 % --inst_orphan_elimination true
% 1.08/1.24 % --inst_learning_loop_flag true
% 1.08/1.24 % --inst_learning_start 3000
% 1.08/1.24 % --inst_learning_factor 2
% 1.08/1.24 % --inst_start_prop_sim_after_learn 3
% 1.08/1.24 % --inst_sel_renew solver
% 1.08/1.24 % --inst_lit_activity_flag true
% 1.08/1.24 % --inst_out_proof true
% 1.08/1.24
% 1.08/1.24 % ------ Resolution Options
% 1.08/1.24
% 1.08/1.24 % --resolution_flag true
% 1.08/1.24 % --res_lit_sel kbo_max
% 1.08/1.24 % --res_to_prop_solver none
% 1.08/1.24 % --res_prop_simpl_new false
% 1.08/1.24 % --res_prop_simpl_given false
% 1.08/1.24 % --res_passive_queue_type priority_queues
% 1.08/1.24 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.08/1.24 % --res_passive_queues_freq [15;5]
% 1.08/1.24 % --res_forward_subs full
% 1.08/1.24 % --res_backward_subs full
% 1.08/1.24 % --res_forward_subs_resolution true
% 1.08/1.24 % --res_backward_subs_resolution true
% 1.08/1.24 % --res_orphan_elimination false
% 1.08/1.24 % --res_time_limit 1000.
% 1.08/1.24 % --res_out_proof true
% 1.08/1.24 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_070f8e.s
% 1.08/1.24 % --modulo true
% 1.08/1.24
% 1.08/1.24 % ------ Combination Options
% 1.08/1.24
% 1.08/1.24 % --comb_res_mult 1000
% 1.08/1.24 % --comb_inst_mult 300
% 1.08/1.24 % ------
% 1.08/1.24
% 1.08/1.24
% 1.08/1.24
% 1.08/1.24 % ------ Proving...
% 1.08/1.24 % warning: shown sat in sat incomplete mode
% 1.08/1.24 %
% 1.08/1.24
% 1.08/1.24
% 1.08/1.24 ------ Building Model...Done
% 1.08/1.24
% 1.08/1.24 %------ The model is defined over ground terms (initial term algebra).
% 1.08/1.24 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.08/1.24 %------ where \phi is a formula over the term algebra.
% 1.08/1.24 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.08/1.24 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.08/1.24 %------ See help for --sat_out_model for different model outputs.
% 1.08/1.24 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.08/1.24 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.08/1.24
% 1.08/1.24
% 1.08/1.24
% 1.08/1.24
% 1.08/1.24 %------ Positive definition of equality_sorted
% 1.08/1.24 fof(lit_def,axiom,
% 1.08/1.24 (! [X0,X0,X1] :
% 1.08/1.24 ( equality_sorted(X0,X0,X1) <=>
% 1.08/1.24 (
% 1.08/1.24 (
% 1.08/1.24 ( X0=$i & X0=difference(growth_rate(first_movers,critical_point(sk3_esk1_0)),growth_rate(efficient_producers,critical_point(sk3_esk1_0))) & X1=zero )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 ).
% 1.08/1.24
% 1.08/1.24 %------ Positive definition of greater
% 1.08/1.24 fof(lit_def,axiom,
% 1.08/1.24 (! [X0,X1] :
% 1.08/1.24 ( greater(X0,X1) <=>
% 1.08/1.24 (
% 1.08/1.24 (
% 1.08/1.24 ( X0=sk3_esk2_0 & X1=appear(efficient_producers,sk3_esk1_0) )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 |
% 1.08/1.24 (
% 1.08/1.24 ( X0=critical_point(sk3_esk1_0) & X1=sk3_esk2_0 )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 |
% 1.08/1.24 (
% 1.08/1.24 ( X0=critical_point(sk3_esk1_0) & X1=appear(efficient_producers,sk3_esk1_0) )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 |
% 1.08/1.24 (
% 1.08/1.24 ( X0=appear(first_movers,sk3_esk1_0) & X1=start_time(sk3_esk1_0) )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 ).
% 1.08/1.24
% 1.08/1.24 %------ Positive definition of decreases
% 1.08/1.24 fof(lit_def,axiom,
% 1.08/1.24 (! [X0] :
% 1.08/1.24 ( decreases(X0) <=>
% 1.08/1.24 $false
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 ).
% 1.08/1.24
% 1.08/1.24 %------ Positive definition of greater_or_equal
% 1.08/1.24 fof(lit_def,axiom,
% 1.08/1.24 (! [X0,X1] :
% 1.08/1.24 ( greater_or_equal(X0,X1) <=>
% 1.08/1.24 (
% 1.08/1.24 (
% 1.08/1.24 ( X0=sk3_esk2_0 & X1=appear(efficient_producers,sk3_esk1_0) )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 |
% 1.08/1.24 (
% 1.08/1.24 ( X0=critical_point(sk3_esk1_0) & X1=sk3_esk2_0 )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 |
% 1.08/1.24 (
% 1.08/1.24 ( X0=critical_point(sk3_esk1_0) & X1=appear(efficient_producers,sk3_esk1_0) )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 |
% 1.08/1.24 (
% 1.08/1.24 ( X0=appear(first_movers,sk3_esk1_0) & X1=start_time(sk3_esk1_0) )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 |
% 1.08/1.24 (
% 1.08/1.24 ( X0=difference(growth_rate(first_movers,critical_point(sk3_esk1_0)),growth_rate(efficient_producers,critical_point(sk3_esk1_0))) & X1=zero )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 ).
% 1.08/1.24
% 1.08/1.24 %------ Positive definition of in_environment
% 1.08/1.24 fof(lit_def,axiom,
% 1.08/1.24 (! [X0,X1] :
% 1.08/1.24 ( in_environment(X0,X1) <=>
% 1.08/1.24 (
% 1.08/1.24 (
% 1.08/1.24 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 |
% 1.08/1.24 (
% 1.08/1.24 ( X0=sk3_esk1_0 & X1=critical_point(sk3_esk1_0) )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 |
% 1.08/1.24 (
% 1.08/1.24 ( X0=sk3_esk1_0 & X1=start_time(sk3_esk1_0) )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 ).
% 1.08/1.24
% 1.08/1.24 %------ Positive definition of environment
% 1.08/1.24 fof(lit_def,axiom,
% 1.08/1.24 (! [X0] :
% 1.08/1.24 ( environment(X0) <=>
% 1.08/1.24 (
% 1.08/1.24 (
% 1.08/1.24 ( X0=sk3_esk1_0 )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 ).
% 1.08/1.24
% 1.08/1.24 %------ Positive definition of subpopulations
% 1.08/1.24 fof(lit_def,axiom,
% 1.08/1.24 (! [X0,X1,X2,X3] :
% 1.08/1.24 ( subpopulations(X0,X1,X2,X3) <=>
% 1.08/1.24 (
% 1.08/1.24 (
% 1.08/1.24 ( X0=first_movers & X1=efficient_producers & X2=sk3_esk1_0 & X3=critical_point(sk3_esk1_0) )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 |
% 1.08/1.24 (
% 1.08/1.24 ( X0=efficient_producers & X1=first_movers & X2=sk3_esk1_0 & X3=critical_point(sk3_esk1_0) )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 ).
% 1.08/1.24
% 1.08/1.24 %------ Negative definition of selection_favors
% 1.08/1.24 fof(lit_def,axiom,
% 1.08/1.24 (! [X0,X1,X2] :
% 1.08/1.24 ( ~(selection_favors(X0,X1,X2)) <=>
% 1.08/1.24 (
% 1.08/1.24 (
% 1.08/1.24 ( X0=first_movers & X1=efficient_producers & X2=sk3_esk2_0 )
% 1.08/1.24 )
% 1.08/1.24
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 )
% 1.08/1.24 ).
% 1.08/1.24
% 1.08/1.24
% 1.08/1.24
% 1.08/1.24 % ------ Statistics
% 1.08/1.24
% 1.08/1.24 % ------ General
% 1.08/1.24
% 1.08/1.24 % num_of_input_clauses: 36
% 1.08/1.24 % num_of_input_neg_conjectures: 5
% 1.08/1.24 % num_of_splits: 0
% 1.08/1.24 % num_of_split_atoms: 0
% 1.08/1.24 % num_of_sem_filtered_clauses: 0
% 1.08/1.24 % num_of_subtypes: 0
% 1.08/1.24 % monotx_restored_types: 0
% 1.08/1.24 % sat_num_of_epr_types: 0
% 1.08/1.24 % sat_num_of_non_cyclic_types: 0
% 1.08/1.24 % sat_guarded_non_collapsed_types: 0
% 1.08/1.24 % is_epr: 0
% 1.08/1.24 % is_horn: 0
% 1.08/1.24 % has_eq: 1
% 1.08/1.24 % num_pure_diseq_elim: 0
% 1.08/1.24 % simp_replaced_by: 0
% 1.08/1.24 % res_preprocessed: 14
% 1.08/1.24 % prep_upred: 0
% 1.08/1.24 % prep_unflattend: 0
% 1.08/1.24 % pred_elim_cands: 2
% 1.08/1.24 % pred_elim: 1
% 1.08/1.24 % pred_elim_cl: 1
% 1.08/1.24 % pred_elim_cycles: 2
% 1.08/1.24 % forced_gc_time: 0
% 1.08/1.24 % gc_basic_clause_elim: 0
% 1.08/1.24 % parsing_time: 0.003
% 1.08/1.24 % sem_filter_time: 0.
% 1.08/1.24 % pred_elim_time: 0.
% 1.08/1.24 % out_proof_time: 0.
% 1.08/1.24 % monotx_time: 0.
% 1.08/1.24 % subtype_inf_time: 0.
% 1.08/1.24 % unif_index_cands_time: 0.
% 1.08/1.24 % unif_index_add_time: 0.001
% 1.08/1.24 % total_time: 0.81
% 1.08/1.24 % num_of_symbols: 45
% 1.08/1.24 % num_of_terms: 818
% 1.08/1.24
% 1.08/1.24 % ------ Propositional Solver
% 1.08/1.24
% 1.08/1.24 % prop_solver_calls: 10
% 1.08/1.24 % prop_fast_solver_calls: 49
% 1.08/1.24 % prop_num_of_clauses: 142
% 1.08/1.24 % prop_preprocess_simplified: 331
% 1.08/1.24 % prop_fo_subsumed: 0
% 1.08/1.24 % prop_solver_time: 0.
% 1.08/1.24 % prop_fast_solver_time: 0.
% 1.08/1.24 % prop_unsat_core_time: 0.
% 1.08/1.24
% 1.08/1.24 % ------ QBF
% 1.08/1.24
% 1.08/1.24 % qbf_q_res: 0
% 1.08/1.24 % qbf_num_tautologies: 0
% 1.08/1.24 % qbf_prep_cycles: 0
% 1.08/1.24
% 1.08/1.24 % ------ BMC1
% 1.08/1.24
% 1.08/1.24 % bmc1_current_bound: -1
% 1.08/1.24 % bmc1_last_solved_bound: -1
% 1.08/1.24 % bmc1_unsat_core_size: -1
% 1.08/1.24 % bmc1_unsat_core_parents_size: -1
% 1.08/1.24 % bmc1_merge_next_fun: 0
% 1.08/1.24 % bmc1_unsat_core_clauses_time: 0.
% 1.08/1.24
% 1.08/1.24 % ------ Instantiation
% 1.08/1.24
% 1.08/1.24 % inst_num_of_clauses: 106
% 1.08/1.24 % inst_num_in_passive: 0
% 1.08/1.24 % inst_num_in_active: 106
% 1.08/1.24 % inst_num_in_unprocessed: 0
% 1.08/1.24 % inst_num_of_loops: 129
% 1.08/1.24 % inst_num_of_learning_restarts: 0
% 1.08/1.24 % inst_num_moves_active_passive: 14
% 1.08/1.24 % inst_lit_activity: 22
% 1.08/1.24 % inst_lit_activity_moves: 0
% 1.08/1.24 % inst_num_tautologies: 0
% 1.08/1.24 % inst_num_prop_implied: 0
% 1.08/1.24 % inst_num_existing_simplified: 0
% 1.08/1.24 % inst_num_eq_res_simplified: 0
% 1.08/1.24 % inst_num_child_elim: 0
% 1.08/1.24 % inst_num_of_dismatching_blockings: 0
% 1.08/1.24 % inst_num_of_non_proper_insts: 117
% 1.08/1.24 % inst_num_of_duplicates: 9
% 1.08/1.24 % inst_inst_num_from_inst_to_res: 0
% 1.08/1.24 % inst_dismatching_checking_time: 0.
% 1.08/1.24
% 1.08/1.24 % ------ Resolution
% 1.08/1.24
% 1.08/1.24 % res_num_of_clauses: 1098
% 1.08/1.24 % res_num_in_passive: 623
% 1.08/1.24 % res_num_in_active: 457
% 1.08/1.24 % res_num_of_loops: 1000
% 1.08/1.24 % res_forward_subset_subsumed: 159
% 1.08/1.24 % res_backward_subset_subsumed: 2
% 1.08/1.24 % res_forward_subsumed: 475
% 1.08/1.24 % res_backward_subsumed: 84
% 1.08/1.24 % res_forward_subsumption_resolution: 135
% 1.08/1.24 % res_backward_subsumption_resolution: 0
% 1.08/1.24 % res_clause_to_clause_subsumption: 88190
% 1.08/1.24 % res_orphan_elimination: 0
% 1.08/1.24 % res_tautology_del: 0
% 1.08/1.24 % res_num_eq_res_simplified: 3
% 1.08/1.24 % res_num_sel_changes: 0
% 1.08/1.24 % res_moves_from_active_to_pass: 0
% 1.08/1.24
% 1.08/1.24 % Status Unknown
% 1.08/1.28 % Orienting using strategy ClausalAll
% 1.08/1.28 % FOF problem with conjecture
% 1.08/1.28 % 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_070f8e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_5cdb32.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_38ee1f | grep -v "SZS"
% 1.08/1.30
% 1.08/1.30 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.08/1.30
% 1.08/1.30 %
% 1.08/1.30 % ------ iProver source info
% 1.08/1.30
% 1.08/1.30 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.08/1.30 % git: non_committed_changes: true
% 1.08/1.30 % git: last_make_outside_of_git: true
% 1.08/1.30
% 1.08/1.30 %
% 1.08/1.30 % ------ Input Options
% 1.08/1.30
% 1.08/1.30 % --out_options all
% 1.08/1.30 % --tptp_safe_out true
% 1.08/1.30 % --problem_path ""
% 1.08/1.30 % --include_path ""
% 1.08/1.30 % --clausifier .//eprover
% 1.08/1.30 % --clausifier_options --tstp-format
% 1.08/1.30 % --stdin false
% 1.08/1.30 % --dbg_backtrace false
% 1.08/1.30 % --dbg_dump_prop_clauses false
% 1.08/1.30 % --dbg_dump_prop_clauses_file -
% 1.08/1.30 % --dbg_out_stat false
% 1.08/1.30
% 1.08/1.30 % ------ General Options
% 1.08/1.30
% 1.08/1.30 % --fof false
% 1.08/1.30 % --time_out_real 150.
% 1.08/1.30 % --time_out_prep_mult 0.2
% 1.08/1.30 % --time_out_virtual -1.
% 1.08/1.30 % --schedule none
% 1.08/1.30 % --ground_splitting input
% 1.08/1.30 % --splitting_nvd 16
% 1.08/1.30 % --non_eq_to_eq false
% 1.08/1.30 % --prep_gs_sim true
% 1.08/1.30 % --prep_unflatten false
% 1.08/1.30 % --prep_res_sim true
% 1.08/1.30 % --prep_upred true
% 1.08/1.30 % --res_sim_input true
% 1.08/1.30 % --clause_weak_htbl true
% 1.08/1.30 % --gc_record_bc_elim false
% 1.08/1.30 % --symbol_type_check false
% 1.08/1.30 % --clausify_out false
% 1.08/1.30 % --large_theory_mode false
% 1.08/1.30 % --prep_sem_filter none
% 1.08/1.30 % --prep_sem_filter_out false
% 1.08/1.30 % --preprocessed_out false
% 1.08/1.30 % --sub_typing false
% 1.08/1.30 % --brand_transform false
% 1.08/1.30 % --pure_diseq_elim true
% 1.08/1.30 % --min_unsat_core false
% 1.08/1.30 % --pred_elim true
% 1.08/1.30 % --add_important_lit false
% 1.08/1.30 % --soft_assumptions false
% 1.08/1.30 % --reset_solvers false
% 1.08/1.30 % --bc_imp_inh []
% 1.08/1.30 % --conj_cone_tolerance 1.5
% 1.08/1.30 % --prolific_symb_bound 500
% 1.08/1.30 % --lt_threshold 2000
% 1.08/1.30
% 1.08/1.30 % ------ SAT Options
% 1.08/1.30
% 1.08/1.30 % --sat_mode false
% 1.08/1.30 % --sat_fm_restart_options ""
% 1.08/1.30 % --sat_gr_def false
% 1.08/1.30 % --sat_epr_types true
% 1.08/1.30 % --sat_non_cyclic_types false
% 1.08/1.30 % --sat_finite_models false
% 1.08/1.30 % --sat_fm_lemmas false
% 1.08/1.30 % --sat_fm_prep false
% 1.08/1.30 % --sat_fm_uc_incr true
% 1.08/1.30 % --sat_out_model small
% 1.08/1.30 % --sat_out_clauses false
% 1.08/1.30
% 1.08/1.30 % ------ QBF Options
% 1.08/1.30
% 1.08/1.30 % --qbf_mode false
% 1.08/1.30 % --qbf_elim_univ true
% 1.08/1.30 % --qbf_sk_in true
% 1.08/1.30 % --qbf_pred_elim true
% 1.08/1.30 % --qbf_split 32
% 1.08/1.30
% 1.08/1.30 % ------ BMC1 Options
% 1.08/1.30
% 1.08/1.30 % --bmc1_incremental false
% 1.08/1.30 % --bmc1_axioms reachable_all
% 1.08/1.30 % --bmc1_min_bound 0
% 1.08/1.30 % --bmc1_max_bound -1
% 1.08/1.30 % --bmc1_max_bound_default -1
% 1.08/1.30 % --bmc1_symbol_reachability true
% 1.08/1.30 % --bmc1_property_lemmas false
% 1.08/1.30 % --bmc1_k_induction false
% 1.08/1.30 % --bmc1_non_equiv_states false
% 1.08/1.30 % --bmc1_deadlock false
% 1.08/1.30 % --bmc1_ucm false
% 1.08/1.30 % --bmc1_add_unsat_core none
% 1.08/1.30 % --bmc1_unsat_core_children false
% 1.08/1.30 % --bmc1_unsat_core_extrapolate_axioms false
% 1.08/1.30 % --bmc1_out_stat full
% 1.08/1.30 % --bmc1_ground_init false
% 1.08/1.30 % --bmc1_pre_inst_next_state false
% 1.08/1.30 % --bmc1_pre_inst_state false
% 1.08/1.30 % --bmc1_pre_inst_reach_state false
% 1.08/1.30 % --bmc1_out_unsat_core false
% 1.08/1.30 % --bmc1_aig_witness_out false
% 1.08/1.30 % --bmc1_verbose false
% 1.08/1.30 % --bmc1_dump_clauses_tptp false
% 1.08/1.31 % --bmc1_dump_unsat_core_tptp false
% 1.08/1.31 % --bmc1_dump_file -
% 1.08/1.31 % --bmc1_ucm_expand_uc_limit 128
% 1.08/1.31 % --bmc1_ucm_n_expand_iterations 6
% 1.08/1.31 % --bmc1_ucm_extend_mode 1
% 1.08/1.31 % --bmc1_ucm_init_mode 2
% 1.08/1.31 % --bmc1_ucm_cone_mode none
% 1.08/1.31 % --bmc1_ucm_reduced_relation_type 0
% 1.08/1.31 % --bmc1_ucm_relax_model 4
% 1.08/1.31 % --bmc1_ucm_full_tr_after_sat true
% 1.08/1.31 % --bmc1_ucm_expand_neg_assumptions false
% 1.08/1.31 % --bmc1_ucm_layered_model none
% 1.08/1.31 % --bmc1_ucm_max_lemma_size 10
% 1.08/1.31
% 1.08/1.31 % ------ AIG Options
% 1.08/1.31
% 1.08/1.31 % --aig_mode false
% 1.08/1.31
% 1.08/1.31 % ------ Instantiation Options
% 1.08/1.31
% 1.08/1.31 % --instantiation_flag true
% 1.08/1.31 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.08/1.31 % --inst_solver_per_active 750
% 1.08/1.31 % --inst_solver_calls_frac 0.5
% 1.08/1.31 % --inst_passive_queue_type priority_queues
% 1.08/1.31 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.08/1.31 % --inst_passive_queues_freq [25;2]
% 1.08/1.31 % --inst_dismatching true
% 1.08/1.31 % --inst_eager_unprocessed_to_passive true
% 1.08/1.31 % --inst_prop_sim_given true
% 1.08/1.31 % --inst_prop_sim_new false
% 1.08/1.31 % --inst_orphan_elimination true
% 1.08/1.31 % --inst_learning_loop_flag true
% 1.08/1.31 % --inst_learning_start 3000
% 1.08/1.31 % --inst_learning_factor 2
% 1.08/1.31 % --inst_start_prop_sim_after_learn 3
% 1.08/1.31 % --inst_sel_renew solver
% 1.08/1.31 % --inst_lit_activity_flag true
% 1.08/1.31 % --inst_out_proof true
% 1.08/1.31
% 1.08/1.31 % ------ Resolution Options
% 1.08/1.31
% 1.08/1.31 % --resolution_flag true
% 1.08/1.31 % --res_lit_sel kbo_max
% 1.08/1.31 % --res_to_prop_solver none
% 1.08/1.31 % --res_prop_simpl_new false
% 1.08/1.31 % --res_prop_simpl_given false
% 1.08/1.31 % --res_passive_queue_type priority_queues
% 1.08/1.31 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.08/1.31 % --res_passive_queues_freq [15;5]
% 1.08/1.31 % --res_forward_subs full
% 1.08/1.31 % --res_backward_subs full
% 1.08/1.31 % --res_forward_subs_resolution true
% 1.08/1.31 % --res_backward_subs_resolution true
% 1.08/1.31 % --res_orphan_elimination false
% 1.08/1.31 % --res_time_limit 1000.
% 1.08/1.31 % --res_out_proof true
% 1.08/1.31 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_070f8e.s
% 1.08/1.31 % --modulo true
% 1.08/1.31
% 1.08/1.31 % ------ Combination Options
% 1.08/1.31
% 1.08/1.31 % --comb_res_mult 1000
% 1.08/1.31 % --comb_inst_mult 300
% 1.08/1.31 % ------
% 1.08/1.31
% 1.08/1.31 % ------ Parsing...% successful
% 1.08/1.31
% 1.08/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe_e snvd_s sp: 0 0s snvd_e %
% 1.08/1.31
% 1.08/1.31 % ------ Proving...
% 1.08/1.31 % ------ Problem Properties
% 1.08/1.31
% 1.08/1.31 %
% 1.08/1.31 % EPR false
% 1.08/1.31 % Horn false
% 1.08/1.31 % Has equality true
% 1.08/1.31
% 1.08/1.31 % % ------ Input Options Time Limit: Unbounded
% 1.08/1.31
% 1.08/1.31
% 1.08/1.31 % % ------ Current options:
% 1.08/1.31
% 1.08/1.31 % ------ Input Options
% 1.08/1.31
% 1.08/1.31 % --out_options all
% 1.08/1.31 % --tptp_safe_out true
% 1.08/1.31 % --problem_path ""
% 1.08/1.31 % --include_path ""
% 1.08/1.31 % --clausifier .//eprover
% 1.08/1.31 % --clausifier_options --tstp-format
% 1.08/1.31 % --stdin false
% 1.08/1.31 % --dbg_backtrace false
% 1.08/1.31 % --dbg_dump_prop_clauses false
% 1.08/1.31 % --dbg_dump_prop_clauses_file -
% 1.08/1.31 % --dbg_out_stat false
% 1.08/1.31
% 1.08/1.31 % ------ General Options
% 1.08/1.31
% 1.08/1.31 % --fof false
% 1.08/1.31 % --time_out_real 150.
% 1.08/1.31 % --time_out_prep_mult 0.2
% 1.08/1.31 % --time_out_virtual -1.
% 1.08/1.31 % --schedule none
% 1.08/1.31 % --ground_splitting input
% 1.08/1.31 % --splitting_nvd 16
% 1.08/1.31 % --non_eq_to_eq false
% 1.08/1.31 % --prep_gs_sim true
% 1.08/1.31 % --prep_unflatten false
% 1.08/1.31 % --prep_res_sim true
% 1.08/1.31 % --prep_upred true
% 1.08/1.31 % --res_sim_input true
% 1.08/1.31 % --clause_weak_htbl true
% 1.08/1.31 % --gc_record_bc_elim false
% 1.08/1.31 % --symbol_type_check false
% 1.08/1.31 % --clausify_out false
% 1.08/1.31 % --large_theory_mode false
% 1.08/1.31 % --prep_sem_filter none
% 1.08/1.31 % --prep_sem_filter_out false
% 1.08/1.31 % --preprocessed_out false
% 1.08/1.31 % --sub_typing false
% 1.08/1.31 % --brand_transform false
% 1.08/1.31 % --pure_diseq_elim true
% 1.08/1.31 % --min_unsat_core false
% 1.08/1.31 % --pred_elim true
% 1.08/1.31 % --add_important_lit false
% 1.08/1.31 % --soft_assumptions false
% 1.08/1.31 % --reset_solvers false
% 1.08/1.31 % --bc_imp_inh []
% 1.08/1.31 % --conj_cone_tolerance 1.5
% 1.08/1.31 % --prolific_symb_bound 500
% 1.08/1.31 % --lt_threshold 2000
% 1.08/1.31
% 1.08/1.31 % ------ SAT Options
% 1.08/1.31
% 1.08/1.31 % --sat_mode false
% 1.08/1.31 % --sat_fm_restart_options ""
% 1.08/1.31 % --sat_gr_def false
% 1.08/1.31 % --sat_epr_types true
% 1.08/1.31 % --sat_non_cyclic_types false
% 1.08/1.31 % --sat_finite_models false
% 1.08/1.31 % --sat_fm_lemmas false
% 1.08/1.31 % --sat_fm_prep false
% 1.08/1.31 % --sat_fm_uc_incr true
% 1.08/1.31 % --sat_out_model small
% 1.08/1.31 % --sat_out_clauses false
% 1.08/1.31
% 1.08/1.31 % ------ QBF Options
% 1.08/1.31
% 1.08/1.31 % --qbf_mode false
% 1.08/1.31 % --qbf_elim_univ true
% 1.08/1.31 % --qbf_sk_in true
% 1.08/1.31 % --qbf_pred_elim true
% 1.08/1.31 % --qbf_split 32
% 1.08/1.31
% 1.08/1.31 % ------ BMC1 Options
% 1.08/1.31
% 1.08/1.31 % --bmc1_incremental false
% 1.08/1.31 % --bmc1_axioms reachable_all
% 1.08/1.31 % --bmc1_min_bound 0
% 1.08/1.31 % --bmc1_max_bound -1
% 1.08/1.31 % --bmc1_max_bound_default -1
% 1.08/1.31 % --bmc1_symbol_reachability true
% 1.08/1.31 % --bmc1_property_lemmas false
% 1.08/1.31 % --bmc1_k_induction false
% 1.08/1.31 % --bmc1_non_equiv_states false
% 1.08/1.31 % --bmc1_deadlock false
% 1.08/1.31 % --bmc1_ucm false
% 1.08/1.31 % --bmc1_add_unsat_core none
% 1.08/1.31 % --bmc1_unsat_core_children false
% 1.08/1.31 % --bmc1_unsat_core_extrapolate_axioms false
% 1.08/1.31 % --bmc1_out_stat full
% 1.08/1.31 % --bmc1_ground_init false
% 1.08/1.31 % --bmc1_pre_inst_next_state false
% 1.08/1.31 % --bmc1_pre_inst_state false
% 1.08/1.31 % --bmc1_pre_inst_reach_state false
% 1.08/1.31 % --bmc1_out_unsat_core false
% 1.08/1.31 % --bmc1_aig_witness_out false
% 1.08/1.31 % --bmc1_verbose false
% 1.08/1.31 % --bmc1_dump_clauses_tptp false
% 1.08/1.31 % --bmc1_dump_unsat_core_tptp false
% 1.08/1.31 % --bmc1_dump_file -
% 1.08/1.31 % --bmc1_ucm_expand_uc_limit 128
% 1.08/1.31 % --bmc1_ucm_n_expand_iterations 6
% 1.08/1.31 % --bmc1_ucm_extend_mode 1
% 1.08/1.31 % --bmc1_ucm_init_mode 2
% 1.08/1.31 % --bmc1_ucm_cone_mode none
% 1.08/1.31 % --bmc1_ucm_reduced_relation_type 0
% 1.08/1.31 % --bmc1_ucm_relax_model 4
% 1.08/1.31 % --bmc1_ucm_full_tr_after_sat true
% 1.08/1.31 % --bmc1_ucm_expand_neg_assumptions false
% 1.08/1.31 % --bmc1_ucm_layered_model none
% 1.08/1.31 % --bmc1_ucm_max_lemma_size 10
% 1.08/1.31
% 1.08/1.31 % ------ AIG Options
% 1.08/1.31
% 1.08/1.31 % --aig_mode false
% 1.08/1.31
% 1.08/1.31 % ------ Instantiation Options
% 1.08/1.31
% 1.08/1.31 % --instantiation_flag true
% 1.08/1.31 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.08/1.31 % --inst_solver_per_active 750
% 1.08/1.31 % --inst_solver_calls_frac 0.5
% 1.08/1.31 % --inst_passive_queue_type priority_queues
% 1.08/1.31 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.08/1.31 % --inst_passive_queues_freq [25;2]
% 1.08/1.31 % --inst_dismatching true
% 1.08/1.31 % --inst_eager_unprocessed_to_passive true
% 1.08/1.31 % --inst_prop_sim_given true
% 2.24/2.41 % --inst_prop_sim_new false
% 2.24/2.41 % --inst_orphan_elimination true
% 2.24/2.41 % --inst_learning_loop_flag true
% 2.24/2.41 % --inst_learning_start 3000
% 2.24/2.41 % --inst_learning_factor 2
% 2.24/2.41 % --inst_start_prop_sim_after_learn 3
% 2.24/2.41 % --inst_sel_renew solver
% 2.24/2.41 % --inst_lit_activity_flag true
% 2.24/2.41 % --inst_out_proof true
% 2.24/2.41
% 2.24/2.41 % ------ Resolution Options
% 2.24/2.41
% 2.24/2.41 % --resolution_flag true
% 2.24/2.41 % --res_lit_sel kbo_max
% 2.24/2.41 % --res_to_prop_solver none
% 2.24/2.41 % --res_prop_simpl_new false
% 2.24/2.41 % --res_prop_simpl_given false
% 2.24/2.41 % --res_passive_queue_type priority_queues
% 2.24/2.41 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.24/2.41 % --res_passive_queues_freq [15;5]
% 2.24/2.41 % --res_forward_subs full
% 2.24/2.41 % --res_backward_subs full
% 2.24/2.41 % --res_forward_subs_resolution true
% 2.24/2.41 % --res_backward_subs_resolution true
% 2.24/2.41 % --res_orphan_elimination false
% 2.24/2.41 % --res_time_limit 1000.
% 2.24/2.41 % --res_out_proof true
% 2.24/2.41 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_070f8e.s
% 2.24/2.41 % --modulo true
% 2.24/2.41
% 2.24/2.41 % ------ Combination Options
% 2.24/2.41
% 2.24/2.41 % --comb_res_mult 1000
% 2.24/2.41 % --comb_inst_mult 300
% 2.24/2.41 % ------
% 2.24/2.41
% 2.24/2.41
% 2.24/2.41
% 2.24/2.41 % ------ Proving...
% 2.24/2.41 % warning: shown sat in sat incomplete mode
% 2.24/2.41 %
% 2.24/2.41
% 2.24/2.41
% 2.24/2.41 ------ Building Model...Done
% 2.24/2.41
% 2.24/2.41 %------ The model is defined over ground terms (initial term algebra).
% 2.24/2.41 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.24/2.41 %------ where \phi is a formula over the term algebra.
% 2.24/2.41 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.24/2.41 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.24/2.41 %------ See help for --sat_out_model for different model outputs.
% 2.24/2.41 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.24/2.41 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.24/2.41
% 2.24/2.41
% 2.24/2.41
% 2.24/2.41
% 2.24/2.41 %------ Positive definition of equality_sorted
% 2.24/2.41 fof(lit_def,axiom,
% 2.24/2.41 (! [X0,X0,X1] :
% 2.24/2.41 ( equality_sorted(X0,X0,X1) <=>
% 2.24/2.41 (
% 2.24/2.41 (
% 2.24/2.41 ( X0=$i & X0=difference(growth_rate(first_movers,critical_point(sk2_esk1_0)),growth_rate(efficient_producers,critical_point(sk2_esk1_0))) & X1=zero )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 ).
% 2.24/2.41
% 2.24/2.41 %------ Positive definition of greater_or_equal
% 2.24/2.41 fof(lit_def,axiom,
% 2.24/2.41 (! [X0,X1] :
% 2.24/2.41 ( greater_or_equal(X0,X1) <=>
% 2.24/2.41 (
% 2.24/2.41 (
% 2.24/2.41 ( X0=sk2_esk2_0 & X1=appear(efficient_producers,sk2_esk1_0) )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 |
% 2.24/2.41 (
% 2.24/2.41 ( X0=critical_point(sk2_esk1_0) & X1=sk2_esk2_0 )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 |
% 2.24/2.41 (
% 2.24/2.41 ( X0=critical_point(sk2_esk1_0) & X1=appear(efficient_producers,sk2_esk1_0) )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 |
% 2.24/2.41 (
% 2.24/2.41 ( X0=appear(first_movers,sk2_esk1_0) & X1=start_time(sk2_esk1_0) )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 |
% 2.24/2.41 (
% 2.24/2.41 ( X0=difference(growth_rate(first_movers,critical_point(sk2_esk1_0)),growth_rate(efficient_producers,critical_point(sk2_esk1_0))) & X1=zero )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 ).
% 2.24/2.41
% 2.24/2.41 %------ Positive definition of environment
% 2.24/2.41 fof(lit_def,axiom,
% 2.24/2.41 (! [X0] :
% 2.24/2.41 ( environment(X0) <=>
% 2.24/2.41 (
% 2.24/2.41 (
% 2.24/2.41 ( X0=sk2_esk1_0 )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 ).
% 2.24/2.41
% 2.24/2.41 %------ Positive definition of in_environment
% 2.24/2.41 fof(lit_def,axiom,
% 2.24/2.41 (! [X0,X1] :
% 2.24/2.41 ( in_environment(X0,X1) <=>
% 2.24/2.41 (
% 2.24/2.41 (
% 2.24/2.41 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 |
% 2.24/2.41 (
% 2.24/2.41 ( X0=sk2_esk1_0 & X1=critical_point(sk2_esk1_0) )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 |
% 2.24/2.41 (
% 2.24/2.41 ( X0=sk2_esk1_0 & X1=start_time(sk2_esk1_0) )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 ).
% 2.24/2.41
% 2.24/2.41 %------ Positive definition of greater
% 2.24/2.41 fof(lit_def,axiom,
% 2.24/2.41 (! [X0,X1] :
% 2.24/2.41 ( greater(X0,X1) <=>
% 2.24/2.41 (
% 2.24/2.41 (
% 2.24/2.41 ( X0=sk2_esk2_0 & X1=appear(efficient_producers,sk2_esk1_0) )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 |
% 2.24/2.41 (
% 2.24/2.41 ( X0=critical_point(sk2_esk1_0) & X1=sk2_esk2_0 )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 |
% 2.24/2.41 (
% 2.24/2.41 ( X0=critical_point(sk2_esk1_0) & X1=appear(efficient_producers,sk2_esk1_0) )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 |
% 2.24/2.41 (
% 2.24/2.41 ( X0=appear(first_movers,sk2_esk1_0) & X1=start_time(sk2_esk1_0) )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 ).
% 2.24/2.41
% 2.24/2.41 %------ Positive definition of subpopulations
% 2.24/2.41 fof(lit_def,axiom,
% 2.24/2.41 (! [X0,X1,X2,X3] :
% 2.24/2.41 ( subpopulations(X0,X1,X2,X3) <=>
% 2.24/2.41 (
% 2.24/2.41 (
% 2.24/2.41 ( X0=first_movers & X1=efficient_producers & X2=sk2_esk1_0 & X3=critical_point(sk2_esk1_0) )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 |
% 2.24/2.41 (
% 2.24/2.41 ( X0=efficient_producers & X1=first_movers & X2=sk2_esk1_0 & X3=critical_point(sk2_esk1_0) )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 ).
% 2.24/2.41
% 2.24/2.41 %------ Positive definition of decreases
% 2.24/2.41 fof(lit_def,axiom,
% 2.24/2.41 (! [X0] :
% 2.24/2.41 ( decreases(X0) <=>
% 2.24/2.41 $false
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 ).
% 2.24/2.41
% 2.24/2.41 %------ Positive definition of selection_favors
% 2.24/2.41 fof(lit_def,axiom,
% 2.24/2.41 (! [X0,X1,X2] :
% 2.24/2.41 ( selection_favors(X0,X1,X2) <=>
% 2.24/2.41 (
% 2.24/2.41 (
% 2.24/2.41 ( X0=first_movers & X1=efficient_producers & X2=critical_point(sk2_esk1_0) )
% 2.24/2.41 )
% 2.24/2.41
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 )
% 2.24/2.41 ).
% 2.24/2.41
% 2.24/2.41
% 2.24/2.41
% 2.24/2.41 % ------ Statistics
% 2.24/2.41
% 2.24/2.41 % ------ General
% 2.24/2.41
% 2.24/2.41 % num_of_input_clauses: 77
% 2.24/2.41 % num_of_input_neg_conjectures: 5
% 2.24/2.41 % num_of_splits: 0
% 2.24/2.41 % num_of_split_atoms: 0
% 2.24/2.41 % num_of_sem_filtered_clauses: 0
% 2.24/2.41 % num_of_subtypes: 0
% 2.24/2.41 % monotx_restored_types: 0
% 2.24/2.41 % sat_num_of_epr_types: 0
% 2.24/2.41 % sat_num_of_non_cyclic_types: 0
% 2.24/2.41 % sat_guarded_non_collapsed_types: 0
% 2.24/2.41 % is_epr: 0
% 2.24/2.41 % is_horn: 0
% 2.24/2.41 % has_eq: 1
% 2.24/2.41 % num_pure_diseq_elim: 0
% 2.24/2.41 % simp_replaced_by: 0
% 2.24/2.41 % res_preprocessed: 14
% 2.24/2.41 % prep_upred: 0
% 2.24/2.41 % prep_unflattend: 0
% 2.24/2.41 % pred_elim_cands: 2
% 2.24/2.41 % pred_elim: 1
% 2.24/2.41 % pred_elim_cl: 1
% 2.24/2.41 % pred_elim_cycles: 2
% 2.24/2.41 % forced_gc_time: 0
% 2.24/2.41 % gc_basic_clause_elim: 0
% 2.24/2.41 % parsing_time: 0.002
% 2.24/2.41 % sem_filter_time: 0.
% 2.24/2.41 % pred_elim_time: 0.
% 2.24/2.41 % out_proof_time: 0.
% 2.24/2.41 % monotx_time: 0.
% 2.24/2.41 % subtype_inf_time: 0.
% 2.24/2.41 % unif_index_cands_time: 0.001
% 2.24/2.41 % unif_index_add_time: 0.001
% 2.24/2.41 % total_time: 1.119
% 2.24/2.41 % num_of_symbols: 45
% 2.24/2.41 % num_of_terms: 1120
% 2.24/2.41
% 2.24/2.41 % ------ Propositional Solver
% 2.24/2.41
% 2.24/2.41 % prop_solver_calls: 8
% 2.24/2.41 % prop_fast_solver_calls: 49
% 2.24/2.41 % prop_num_of_clauses: 157
% 2.24/2.41 % prop_preprocess_simplified: 610
% 2.24/2.41 % prop_fo_subsumed: 0
% 2.24/2.41 % prop_solver_time: 0.
% 2.24/2.41 % prop_fast_solver_time: 0.
% 2.24/2.41 % prop_unsat_core_time: 0.
% 2.24/2.41
% 2.24/2.41 % ------ QBF
% 2.24/2.41
% 2.24/2.41 % qbf_q_res: 0
% 2.24/2.41 % qbf_num_tautologies: 0
% 2.24/2.41 % qbf_prep_cycles: 0
% 2.24/2.41
% 2.24/2.41 % ------ BMC1
% 2.24/2.41
% 2.24/2.41 % bmc1_current_bound: -1
% 2.24/2.41 % bmc1_last_solved_bound: -1
% 2.24/2.41 % bmc1_unsat_core_size: -1
% 2.24/2.41 % bmc1_unsat_core_parents_size: -1
% 2.24/2.41 % bmc1_merge_next_fun: 0
% 2.24/2.41 % bmc1_unsat_core_clauses_time: 0.
% 2.24/2.41
% 2.24/2.41 % ------ Instantiation
% 2.24/2.41
% 2.24/2.41 % inst_num_of_clauses: 159
% 2.24/2.41 % inst_num_in_passive: 0
% 2.24/2.41 % inst_num_in_active: 158
% 2.24/2.41 % inst_num_in_unprocessed: 0
% 2.24/2.41 % inst_num_of_loops: 173
% 2.24/2.41 % inst_num_of_learning_restarts: 0
% 2.24/2.41 % inst_num_moves_active_passive: 6
% 2.24/2.41 % inst_lit_activity: 53
% 2.24/2.41 % inst_lit_activity_moves: 0
% 2.24/2.41 % inst_num_tautologies: 1
% 2.24/2.41 % inst_num_prop_implied: 0
% 2.24/2.41 % inst_num_existing_simplified: 0
% 2.24/2.41 % inst_num_eq_res_simplified: 0
% 2.24/2.41 % inst_num_child_elim: 0
% 2.24/2.41 % inst_num_of_dismatching_blockings: 0
% 2.24/2.41 % inst_num_of_non_proper_insts: 126
% 2.24/2.41 % inst_num_of_duplicates: 74
% 2.24/2.41 % inst_inst_num_from_inst_to_res: 0
% 2.24/2.41 % inst_dismatching_checking_time: 0.
% 2.24/2.41
% 2.24/2.41 % ------ Resolution
% 2.24/2.41
% 2.24/2.41 % res_num_of_clauses: 6665
% 2.24/2.41 % res_num_in_passive: 5984
% 2.24/2.41 % res_num_in_active: 627
% 2.24/2.41 % res_num_of_loops: 1000
% 2.24/2.41 % res_forward_subset_subsumed: 5489
% 2.24/2.41 % res_backward_subset_subsumed: 0
% 2.24/2.41 % res_forward_subsumed: 393
% 2.24/2.41 % res_backward_subsumed: 2
% 2.24/2.41 % res_forward_subsumption_resolution: 32
% 2.24/2.41 % res_backward_subsumption_resolution: 0
% 2.24/2.41 % res_clause_to_clause_subsumption: 29908
% 2.24/2.41 % res_orphan_elimination: 0
% 2.24/2.41 % res_tautology_del: 173
% 2.24/2.41 % res_num_eq_res_simplified: 0
% 2.24/2.41 % res_num_sel_changes: 0
% 2.24/2.41 % res_moves_from_active_to_pass: 0
% 2.24/2.41
% 2.24/2.41 % Status Unknown
% 2.24/2.41 % Last status :
% 2.24/2.41 % SZS status Unknown
%------------------------------------------------------------------------------