0.02/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.10	% Command    : iproveropt_run.sh %d %s
0.09/0.30	% Computer   : n011.cluster.edu
0.09/0.30	% Model      : x86_64 x86_64
0.09/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory     : 8042.1875MB
0.09/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 960
0.09/0.30	% WCLimit    : 120
0.09/0.30	% DateTime   : Thu Jul  2 06:36:01 EDT 2020
0.09/0.31	% CPUTime    : 
0.09/0.31	% Running in FOF mode
2.68/1.10	% SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.68/1.10	
2.68/1.10	%---------------- iProver v3.3 (CASC-J10 2020) ----------------%
2.68/1.10	
2.68/1.10	------  iProver source info
2.68/1.10	
2.68/1.10	git: date: 2020-06-30 10:37:57 +0100
2.68/1.10	git: sha1: e3013b43002810b07ddde22341e87fe21d0d6388
2.68/1.10	git: non_committed_changes: false
2.68/1.10	git: last_make_outside_of_git: false
2.68/1.10	
2.68/1.10	------ 
2.68/1.10	
2.68/1.10	------ Input Options
2.68/1.10	
2.68/1.10	--out_options                           all
2.68/1.10	--tptp_safe_out                         true
2.68/1.10	--problem_path                          ""
2.68/1.10	--include_path                          ""
2.68/1.10	--clausifier                            res/vclausify_rel
2.68/1.10	--clausifier_options                    --mode clausify
2.68/1.10	--stdin                                 false
2.68/1.10	--stats_out                             all
2.68/1.10	
2.68/1.10	------ General Options
2.68/1.10	
2.68/1.10	--fof                                   false
2.68/1.10	--time_out_real                         125.
2.68/1.10	--time_out_virtual                      -1.
2.68/1.10	--symbol_type_check                     false
2.68/1.10	--clausify_out                          false
2.68/1.10	--sig_cnt_out                           false
2.68/1.10	--trig_cnt_out                          false
2.68/1.10	--trig_cnt_out_tolerance                1.
2.68/1.10	--trig_cnt_out_sk_spl                   false
2.68/1.10	--abstr_cl_out                          false
2.68/1.10	
2.68/1.10	------ Global Options
2.68/1.10	
2.68/1.10	--schedule                              default
2.68/1.10	--add_important_lit                     false
2.68/1.10	--prop_solver_per_cl                    1000
2.68/1.10	--min_unsat_core                        false
2.68/1.10	--soft_assumptions                      false
2.68/1.10	--soft_lemma_size                       3
2.68/1.10	--prop_impl_unit_size                   0
2.68/1.10	--prop_impl_unit                        []
2.68/1.10	--share_sel_clauses                     true
2.68/1.10	--reset_solvers                         false
2.68/1.10	--bc_imp_inh                            [conj_cone]
2.68/1.10	--conj_cone_tolerance                   3.
2.68/1.10	--extra_neg_conj                        none
2.68/1.10	--large_theory_mode                     true
2.68/1.10	--prolific_symb_bound                   200
2.68/1.10	--lt_threshold                          2000
2.68/1.10	--clause_weak_htbl                      true
2.68/1.10	--gc_record_bc_elim                     false
2.68/1.10	
2.68/1.10	------ Preprocessing Options
2.68/1.10	
2.68/1.10	--preprocessing_flag                    true
2.68/1.10	--time_out_prep_mult                    0.1
2.68/1.10	--splitting_mode                        input
2.68/1.10	--splitting_grd                         true
2.68/1.10	--splitting_cvd                         false
2.68/1.10	--splitting_cvd_svl                     false
2.68/1.10	--splitting_nvd                         32
2.68/1.10	--sub_typing                            true
2.68/1.10	--prep_gs_sim                           true
2.68/1.10	--prep_unflatten                        true
2.68/1.10	--prep_res_sim                          true
2.68/1.10	--prep_upred                            true
2.68/1.10	--prep_sem_filter                       exhaustive
2.68/1.10	--prep_sem_filter_out                   false
2.68/1.10	--pred_elim                             true
2.68/1.10	--res_sim_input                         true
2.68/1.10	--eq_ax_congr_red                       true
2.68/1.10	--pure_diseq_elim                       true
2.68/1.10	--brand_transform                       false
2.68/1.10	--non_eq_to_eq                          false
2.68/1.10	--prep_def_merge                        true
2.68/1.10	--prep_def_merge_prop_impl              false
2.68/1.10	--prep_def_merge_mbd                    true
2.68/1.10	--prep_def_merge_tr_red                 false
2.68/1.10	--prep_def_merge_tr_cl                  false
2.68/1.10	--smt_preprocessing                     true
2.68/1.10	--smt_ac_axioms                         fast
2.68/1.10	--preprocessed_out                      false
2.68/1.10	--preprocessed_stats                    false
2.68/1.10	
2.68/1.10	------ Abstraction refinement Options
2.68/1.10	
2.68/1.10	--abstr_ref                             []
2.68/1.10	--abstr_ref_prep                        false
2.68/1.10	--abstr_ref_until_sat                   false
2.68/1.10	--abstr_ref_sig_restrict                funpre
2.68/1.10	--abstr_ref_af_restrict_to_split_sk     false
2.68/1.10	--abstr_ref_under                       []
2.68/1.10	
2.68/1.10	------ SAT Options
2.68/1.10	
2.68/1.10	--sat_mode                              false
2.68/1.10	--sat_fm_restart_options                ""
2.68/1.10	--sat_gr_def                            false
2.68/1.10	--sat_epr_types                         true
2.68/1.10	--sat_non_cyclic_types                  false
2.68/1.10	--sat_finite_models                     false
2.68/1.10	--sat_fm_lemmas                         false
2.68/1.10	--sat_fm_prep                           false
2.68/1.10	--sat_fm_uc_incr                        true
2.68/1.10	--sat_out_model                         small
2.68/1.10	--sat_out_clauses                       false
2.68/1.10	
2.68/1.10	------ QBF Options
2.68/1.10	
2.68/1.10	--qbf_mode                              false
2.68/1.10	--qbf_elim_univ                         false
2.68/1.10	--qbf_dom_inst                          none
2.68/1.10	--qbf_dom_pre_inst                      false
2.68/1.10	--qbf_sk_in                             false
2.68/1.10	--qbf_pred_elim                         true
2.68/1.10	--qbf_split                             512
2.68/1.10	
2.68/1.10	------ BMC1 Options
2.68/1.10	
2.68/1.10	--bmc1_incremental                      false
2.68/1.10	--bmc1_axioms                           reachable_all
2.68/1.10	--bmc1_min_bound                        0
2.68/1.10	--bmc1_max_bound                        -1
2.68/1.10	--bmc1_max_bound_default                -1
2.68/1.10	--bmc1_symbol_reachability              true
2.68/1.10	--bmc1_property_lemmas                  false
2.68/1.10	--bmc1_k_induction                      false
2.68/1.10	--bmc1_non_equiv_states                 false
2.68/1.10	--bmc1_deadlock                         false
2.68/1.10	--bmc1_ucm                              false
2.68/1.10	--bmc1_add_unsat_core                   none
2.68/1.10	--bmc1_unsat_core_children              false
2.68/1.10	--bmc1_unsat_core_extrapolate_axioms    false
2.68/1.10	--bmc1_out_stat                         full
2.68/1.10	--bmc1_ground_init                      false
2.68/1.10	--bmc1_pre_inst_next_state              false
2.68/1.10	--bmc1_pre_inst_state                   false
2.68/1.10	--bmc1_pre_inst_reach_state             false
2.68/1.10	--bmc1_out_unsat_core                   false
2.68/1.10	--bmc1_aig_witness_out                  false
2.68/1.10	--bmc1_verbose                          false
2.68/1.10	--bmc1_dump_clauses_tptp                false
2.68/1.10	--bmc1_dump_unsat_core_tptp             false
2.68/1.10	--bmc1_dump_file                        -
2.68/1.10	--bmc1_ucm_expand_uc_limit              128
2.68/1.10	--bmc1_ucm_n_expand_iterations          6
2.68/1.10	--bmc1_ucm_extend_mode                  1
2.68/1.10	--bmc1_ucm_init_mode                    2
2.68/1.10	--bmc1_ucm_cone_mode                    none
2.68/1.10	--bmc1_ucm_reduced_relation_type        0
2.68/1.10	--bmc1_ucm_relax_model                  4
2.68/1.10	--bmc1_ucm_full_tr_after_sat            true
2.68/1.10	--bmc1_ucm_expand_neg_assumptions       false
2.68/1.10	--bmc1_ucm_layered_model                none
2.68/1.10	--bmc1_ucm_max_lemma_size               10
2.68/1.10	
2.68/1.10	------ AIG Options
2.68/1.10	
2.68/1.10	--aig_mode                              false
2.68/1.10	
2.68/1.10	------ Instantiation Options
2.68/1.10	
2.68/1.10	--instantiation_flag                    true
2.68/1.10	--inst_sos_flag                         false
2.68/1.10	--inst_sos_phase                        true
2.68/1.10	--inst_sos_sth_lit_sel                  [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
2.68/1.10	--inst_lit_sel                          [+prop;+sign;+ground;-num_var;-num_symb]
2.68/1.10	--inst_lit_sel_side                     num_symb
2.68/1.10	--inst_solver_per_active                1400
2.68/1.10	--inst_solver_calls_frac                1.
2.68/1.10	--inst_passive_queue_type               priority_queues
2.68/1.10	--inst_passive_queues                   [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
2.68/1.10	--inst_passive_queues_freq              [25;2]
2.68/1.10	--inst_dismatching                      true
2.68/1.10	--inst_eager_unprocessed_to_passive     true
2.68/1.10	--inst_prop_sim_given                   true
2.68/1.10	--inst_prop_sim_new                     false
2.68/1.10	--inst_subs_new                         false
2.68/1.10	--inst_eq_res_simp                      false
2.68/1.10	--inst_subs_given                       false
2.68/1.10	--inst_orphan_elimination               true
2.68/1.10	--inst_learning_loop_flag               true
2.68/1.10	--inst_learning_start                   3000
2.68/1.10	--inst_learning_factor                  2
2.68/1.10	--inst_start_prop_sim_after_learn       3
2.68/1.10	--inst_sel_renew                        solver
2.68/1.10	--inst_lit_activity_flag                true
2.68/1.10	--inst_restr_to_given                   false
2.68/1.10	--inst_activity_threshold               500
2.68/1.10	--inst_out_proof                        true
2.68/1.10	
2.68/1.10	------ Resolution Options
2.68/1.10	
2.68/1.10	--resolution_flag                       true
2.68/1.10	--res_lit_sel                           adaptive
2.68/1.10	--res_lit_sel_side                      none
2.68/1.10	--res_ordering                          kbo
2.68/1.10	--res_to_prop_solver                    active
2.68/1.10	--res_prop_simpl_new                    false
2.68/1.10	--res_prop_simpl_given                  true
2.68/1.10	--res_passive_queue_type                priority_queues
2.68/1.10	--res_passive_queues                    [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
2.68/1.10	--res_passive_queues_freq               [15;5]
2.68/1.10	--res_forward_subs                      full
2.68/1.10	--res_backward_subs                     full
2.68/1.10	--res_forward_subs_resolution           true
2.68/1.10	--res_backward_subs_resolution          true
2.68/1.10	--res_orphan_elimination                true
2.68/1.10	--res_time_limit                        2.
2.68/1.10	--res_out_proof                         true
2.68/1.10	
2.68/1.10	------ Superposition Options
2.68/1.10	
2.68/1.10	--superposition_flag                    true
2.68/1.10	--sup_passive_queue_type                priority_queues
2.68/1.10	--sup_passive_queues                    [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]]
2.68/1.10	--sup_passive_queues_freq               [8;1;4]
2.68/1.10	--demod_completeness_check              fast
2.68/1.10	--demod_use_ground                      true
2.68/1.10	--sup_to_prop_solver                    passive
2.68/1.10	--sup_prop_simpl_new                    true
2.68/1.10	--sup_prop_simpl_given                  true
2.68/1.10	--sup_fun_splitting                     false
2.68/1.10	--sup_smt_interval                      50000
2.68/1.10	
2.68/1.10	------ Superposition Simplification Setup
2.68/1.10	
2.68/1.10	--sup_indices_passive                   []
2.68/1.10	--sup_indices_active                    [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex]
2.68/1.10	--sup_indices_immed                     [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex]
2.68/1.10	--sup_indices_input                     [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex]
2.68/1.10	--sup_full_triv                         [TrivRules;PropSubs]
2.68/1.10	--sup_full_fw                           [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes]
2.68/1.10	--sup_full_bw                           [BwDemod]
2.68/1.10	--sup_immed_triv                        [TrivRules]
2.68/1.10	--sup_immed_fw_main                     [Joinability;FwDemodLightNormLoopTriv;FwSubsumption]
2.68/1.10	--sup_immed_fw_immed                    [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes]
2.68/1.10	--sup_immed_bw_main                     []
2.68/1.10	--sup_immed_bw_immed                    [BwDemod;BwSubsumption;BwSubsumptionRes]
2.68/1.10	--sup_input_triv                        [Unflattening;TrivRules]
2.68/1.10	--sup_input_fw                          [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes]
2.68/1.10	--sup_input_bw                          [BwDemod;BwSubsumption;BwSubsumptionRes]
2.68/1.10	
2.68/1.10	------ Combination Options
2.68/1.10	
2.68/1.10	--comb_res_mult                         3
2.68/1.10	--comb_sup_mult                         2
2.68/1.10	--comb_inst_mult                        10
2.68/1.10	
2.68/1.10	------ Debug Options
2.68/1.10	
2.68/1.10	--dbg_backtrace                         false
2.68/1.10	--dbg_dump_prop_clauses                 false
2.68/1.10	--dbg_dump_prop_clauses_file            -
2.68/1.10	--dbg_out_stat                          false
2.68/1.10	------ Parsing...
2.68/1.10	------ Clausification by vclausify_rel  & Parsing by iProver...
2.68/1.10	
2.68/1.10	------ Preprocessing... sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sf_s  rm: 3 0s  sf_e  pe_s  pe_e 
2.68/1.10	
2.68/1.10	------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
2.68/1.10	
2.68/1.10	------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
2.68/1.10	------ Proving...
2.68/1.10	------ Problem Properties 
2.68/1.10	
2.68/1.10	
2.68/1.10	clauses                                 25
2.68/1.10	conjectures                             3
2.68/1.10	EPR                                     2
2.68/1.10	Horn                                    19
2.68/1.10	unary                                   4
2.68/1.10	binary                                  2
2.68/1.10	lits                                    70
2.68/1.10	lits eq                                 15
2.68/1.10	fd_pure                                 0
2.68/1.10	fd_pseudo                               0
2.68/1.10	fd_cond                                 0
2.68/1.10	fd_pseudo_cond                          0
2.68/1.10	AC symbols                              0
2.68/1.10	
2.68/1.10	------ Schedule dynamic 5 is on 
2.68/1.10	
2.68/1.10	------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
2.68/1.10	
2.68/1.10	
2.68/1.10	------ 
2.68/1.10	Current options:
2.68/1.10	------ 
2.68/1.10	
2.68/1.10	------ Input Options
2.68/1.10	
2.68/1.10	--out_options                           all
2.68/1.10	--tptp_safe_out                         true
2.68/1.10	--problem_path                          ""
2.68/1.10	--include_path                          ""
2.68/1.10	--clausifier                            res/vclausify_rel
2.68/1.10	--clausifier_options                    --mode clausify
2.68/1.10	--stdin                                 false
2.68/1.10	--stats_out                             all
2.68/1.10	
2.68/1.10	------ General Options
2.68/1.10	
2.68/1.10	--fof                                   false
2.68/1.10	--time_out_real                         125.
2.68/1.10	--time_out_virtual                      -1.
2.68/1.10	--symbol_type_check                     false
2.68/1.10	--clausify_out                          false
2.68/1.10	--sig_cnt_out                           false
2.68/1.10	--trig_cnt_out                          false
2.68/1.10	--trig_cnt_out_tolerance                1.
2.68/1.10	--trig_cnt_out_sk_spl                   false
2.68/1.10	--abstr_cl_out                          false
2.68/1.10	
2.68/1.10	------ Global Options
2.68/1.10	
2.68/1.10	--schedule                              default
2.68/1.10	--add_important_lit                     false
2.68/1.10	--prop_solver_per_cl                    1000
2.68/1.10	--min_unsat_core                        false
2.68/1.10	--soft_assumptions                      false
2.68/1.10	--soft_lemma_size                       3
2.68/1.10	--prop_impl_unit_size                   0
2.68/1.10	--prop_impl_unit                        []
2.68/1.10	--share_sel_clauses                     true
2.68/1.10	--reset_solvers                         false
2.68/1.10	--bc_imp_inh                            [conj_cone]
2.68/1.10	--conj_cone_tolerance                   3.
2.68/1.10	--extra_neg_conj                        none
2.68/1.10	--large_theory_mode                     true
2.68/1.10	--prolific_symb_bound                   200
2.68/1.10	--lt_threshold                          2000
2.68/1.10	--clause_weak_htbl                      true
2.68/1.10	--gc_record_bc_elim                     false
2.68/1.10	
2.68/1.10	------ Preprocessing Options
2.68/1.10	
2.68/1.10	--preprocessing_flag                    true
2.68/1.10	--time_out_prep_mult                    0.1
2.68/1.10	--splitting_mode                        input
2.68/1.10	--splitting_grd                         true
2.68/1.10	--splitting_cvd                         false
2.68/1.10	--splitting_cvd_svl                     false
2.68/1.10	--splitting_nvd                         32
2.68/1.10	--sub_typing                            true
2.68/1.10	--prep_gs_sim                           true
2.68/1.10	--prep_unflatten                        true
2.68/1.10	--prep_res_sim                          true
2.68/1.10	--prep_upred                            true
2.68/1.10	--prep_sem_filter                       exhaustive
2.68/1.10	--prep_sem_filter_out                   false
2.68/1.10	--pred_elim                             true
2.68/1.10	--res_sim_input                         true
2.68/1.10	--eq_ax_congr_red                       true
2.68/1.10	--pure_diseq_elim                       true
2.68/1.10	--brand_transform                       false
2.68/1.10	--non_eq_to_eq                          false
2.68/1.10	--prep_def_merge                        true
2.68/1.10	--prep_def_merge_prop_impl              false
2.68/1.10	--prep_def_merge_mbd                    true
2.68/1.10	--prep_def_merge_tr_red                 false
2.68/1.10	--prep_def_merge_tr_cl                  false
2.68/1.10	--smt_preprocessing                     true
2.68/1.10	--smt_ac_axioms                         fast
2.68/1.10	--preprocessed_out                      false
2.68/1.10	--preprocessed_stats                    false
2.68/1.10	
2.68/1.10	------ Abstraction refinement Options
2.68/1.10	
2.68/1.10	--abstr_ref                             []
2.68/1.10	--abstr_ref_prep                        false
2.68/1.10	--abstr_ref_until_sat                   false
2.68/1.10	--abstr_ref_sig_restrict                funpre
2.68/1.10	--abstr_ref_af_restrict_to_split_sk     false
2.68/1.10	--abstr_ref_under                       []
2.68/1.10	
2.68/1.10	------ SAT Options
2.68/1.10	
2.68/1.10	--sat_mode                              false
2.68/1.10	--sat_fm_restart_options                ""
2.68/1.10	--sat_gr_def                            false
2.68/1.10	--sat_epr_types                         true
2.68/1.10	--sat_non_cyclic_types                  false
2.68/1.10	--sat_finite_models                     false
2.68/1.10	--sat_fm_lemmas                         false
2.68/1.10	--sat_fm_prep                           false
2.68/1.10	--sat_fm_uc_incr                        true
2.68/1.10	--sat_out_model                         small
2.68/1.10	--sat_out_clauses                       false
2.68/1.10	
2.68/1.10	------ QBF Options
2.68/1.10	
2.68/1.10	--qbf_mode                              false
2.68/1.10	--qbf_elim_univ                         false
2.68/1.10	--qbf_dom_inst                          none
2.68/1.10	--qbf_dom_pre_inst                      false
2.68/1.10	--qbf_sk_in                             false
2.68/1.10	--qbf_pred_elim                         true
2.68/1.10	--qbf_split                             512
2.68/1.10	
2.68/1.10	------ BMC1 Options
2.68/1.10	
2.68/1.10	--bmc1_incremental                      false
2.68/1.10	--bmc1_axioms                           reachable_all
2.68/1.10	--bmc1_min_bound                        0
2.68/1.10	--bmc1_max_bound                        -1
2.68/1.10	--bmc1_max_bound_default                -1
2.68/1.10	--bmc1_symbol_reachability              true
2.68/1.10	--bmc1_property_lemmas                  false
2.68/1.10	--bmc1_k_induction                      false
2.68/1.10	--bmc1_non_equiv_states                 false
2.68/1.10	--bmc1_deadlock                         false
2.68/1.10	--bmc1_ucm                              false
2.68/1.10	--bmc1_add_unsat_core                   none
2.68/1.10	--bmc1_unsat_core_children              false
2.68/1.10	--bmc1_unsat_core_extrapolate_axioms    false
2.68/1.10	--bmc1_out_stat                         full
2.68/1.10	--bmc1_ground_init                      false
2.68/1.10	--bmc1_pre_inst_next_state              false
2.68/1.10	--bmc1_pre_inst_state                   false
2.68/1.10	--bmc1_pre_inst_reach_state             false
2.68/1.10	--bmc1_out_unsat_core                   false
2.68/1.10	--bmc1_aig_witness_out                  false
2.68/1.10	--bmc1_verbose                          false
2.68/1.10	--bmc1_dump_clauses_tptp                false
2.68/1.10	--bmc1_dump_unsat_core_tptp             false
2.68/1.10	--bmc1_dump_file                        -
2.68/1.10	--bmc1_ucm_expand_uc_limit              128
2.68/1.10	--bmc1_ucm_n_expand_iterations          6
2.68/1.10	--bmc1_ucm_extend_mode                  1
2.68/1.10	--bmc1_ucm_init_mode                    2
2.68/1.10	--bmc1_ucm_cone_mode                    none
2.68/1.10	--bmc1_ucm_reduced_relation_type        0
2.68/1.10	--bmc1_ucm_relax_model                  4
2.68/1.10	--bmc1_ucm_full_tr_after_sat            true
2.68/1.10	--bmc1_ucm_expand_neg_assumptions       false
2.68/1.10	--bmc1_ucm_layered_model                none
2.68/1.10	--bmc1_ucm_max_lemma_size               10
2.68/1.10	
2.68/1.10	------ AIG Options
2.68/1.10	
2.68/1.10	--aig_mode                              false
2.68/1.10	
2.68/1.10	------ Instantiation Options
2.68/1.10	
2.68/1.10	--instantiation_flag                    true
2.68/1.10	--inst_sos_flag                         false
2.68/1.10	--inst_sos_phase                        true
2.68/1.10	--inst_sos_sth_lit_sel                  [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
2.68/1.10	--inst_lit_sel                          [+prop;+sign;+ground;-num_var;-num_symb]
2.68/1.10	--inst_lit_sel_side                     none
2.68/1.10	--inst_solver_per_active                1400
2.68/1.10	--inst_solver_calls_frac                1.
2.68/1.10	--inst_passive_queue_type               priority_queues
2.68/1.10	--inst_passive_queues                   [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
2.68/1.10	--inst_passive_queues_freq              [25;2]
2.68/1.10	--inst_dismatching                      true
2.68/1.10	--inst_eager_unprocessed_to_passive     true
2.68/1.10	--inst_prop_sim_given                   true
2.68/1.10	--inst_prop_sim_new                     false
2.68/1.10	--inst_subs_new                         false
2.68/1.10	--inst_eq_res_simp                      false
2.68/1.10	--inst_subs_given                       false
2.68/1.10	--inst_orphan_elimination               true
2.68/1.10	--inst_learning_loop_flag               true
2.68/1.10	--inst_learning_start                   3000
2.68/1.10	--inst_learning_factor                  2
2.68/1.10	--inst_start_prop_sim_after_learn       3
2.68/1.10	--inst_sel_renew                        solver
2.68/1.10	--inst_lit_activity_flag                true
2.68/1.10	--inst_restr_to_given                   false
2.68/1.10	--inst_activity_threshold               500
2.68/1.10	--inst_out_proof                        true
2.68/1.10	
2.68/1.10	------ Resolution Options
2.68/1.10	
2.68/1.10	--resolution_flag                       false
2.68/1.10	--res_lit_sel                           adaptive
2.68/1.10	--res_lit_sel_side                      none
2.68/1.10	--res_ordering                          kbo
2.68/1.10	--res_to_prop_solver                    active
2.68/1.10	--res_prop_simpl_new                    false
2.68/1.10	--res_prop_simpl_given                  true
2.68/1.10	--res_passive_queue_type                priority_queues
2.68/1.10	--res_passive_queues                    [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
2.68/1.10	--res_passive_queues_freq               [15;5]
2.68/1.10	--res_forward_subs                      full
2.68/1.10	--res_backward_subs                     full
2.68/1.10	--res_forward_subs_resolution           true
2.68/1.10	--res_backward_subs_resolution          true
2.68/1.10	--res_orphan_elimination                true
2.68/1.10	--res_time_limit                        2.
2.68/1.10	--res_out_proof                         true
2.68/1.10	
2.68/1.10	------ Superposition Options
2.68/1.10	
2.68/1.10	--superposition_flag                    true
2.68/1.10	--sup_passive_queue_type                priority_queues
2.68/1.10	--sup_passive_queues                    [[-conj_dist;+horn;-num_symb];[+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb]]
2.68/1.10	--sup_passive_queues_freq               [8;1;4]
2.68/1.10	--demod_completeness_check              fast
2.68/1.10	--demod_use_ground                      true
2.68/1.10	--sup_to_prop_solver                    passive
2.68/1.10	--sup_prop_simpl_new                    true
2.68/1.10	--sup_prop_simpl_given                  true
2.68/1.10	--sup_fun_splitting                     false
2.68/1.10	--sup_smt_interval                      50000
2.68/1.10	
2.68/1.10	------ Superposition Simplification Setup
2.68/1.10	
2.68/1.10	--sup_indices_passive                   []
2.68/1.10	--sup_indices_active                    [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex]
2.68/1.10	--sup_indices_immed                     [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex]
2.68/1.10	--sup_indices_input                     [SubsumptionIndex;LightNormIndex;FwDemodIndex;BwDemodIndex]
2.68/1.10	--sup_full_triv                         [TrivRules;PropSubs]
2.68/1.10	--sup_full_fw                           [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes]
2.68/1.10	--sup_full_bw                           [BwDemod]
2.68/1.10	--sup_immed_triv                        [TrivRules]
2.68/1.10	--sup_immed_fw_main                     [Joinability;FwDemodLightNormLoopTriv;FwSubsumption]
2.68/1.10	--sup_immed_fw_immed                    [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes]
2.68/1.10	--sup_immed_bw_main                     []
2.68/1.10	--sup_immed_bw_immed                    [BwDemod;BwSubsumption;BwSubsumptionRes]
2.68/1.10	--sup_input_triv                        [Unflattening;TrivRules]
2.68/1.10	--sup_input_fw                          [FwDemodLightNormLoopTriv;FwSubsumption;FwSubsumptionRes]
2.68/1.10	--sup_input_bw                          [BwDemod;BwSubsumption;BwSubsumptionRes]
2.68/1.10	
2.68/1.10	------ Combination Options
2.68/1.10	
2.68/1.10	--comb_res_mult                         3
2.68/1.10	--comb_sup_mult                         2
2.68/1.10	--comb_inst_mult                        10
2.68/1.10	
2.68/1.10	------ Debug Options
2.68/1.10	
2.68/1.10	--dbg_backtrace                         false
2.68/1.10	--dbg_dump_prop_clauses                 false
2.68/1.10	--dbg_dump_prop_clauses_file            -
2.68/1.10	--dbg_out_stat                          false
2.68/1.10	
2.68/1.10	
2.68/1.10	
2.68/1.10	
2.68/1.10	------ Proving...
2.68/1.10	
2.68/1.10	
2.68/1.10	% SZS status Theorem for theBenchmark.p
2.68/1.10	
2.68/1.10	% SZS output start CNFRefutation for theBenchmark.p
2.68/1.10	
2.68/1.10	fof(f11,axiom,(
2.68/1.10	  ! [X0,X1] : ((environment(X0) & in_environment(X0,X1)) => (greater(cardinality_at_time(efficient_producers,X1),zero) | zero = cardinality_at_time(efficient_producers,X1)))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f41,plain,(
2.68/1.11	  ! [X0,X1] : ((greater(cardinality_at_time(efficient_producers,X1),zero) | zero = cardinality_at_time(efficient_producers,X1)) | (~environment(X0) | ~in_environment(X0,X1)))),
2.68/1.11	  inference(ennf_transformation,[],[f11])).
2.68/1.11	
2.68/1.11	fof(f42,plain,(
2.68/1.11	  ! [X0,X1] : (greater(cardinality_at_time(efficient_producers,X1),zero) | zero = cardinality_at_time(efficient_producers,X1) | ~environment(X0) | ~in_environment(X0,X1))),
2.68/1.11	  inference(flattening,[],[f41])).
2.68/1.11	
2.68/1.11	fof(f77,plain,(
2.68/1.11	  ( ! [X0,X1] : (greater(cardinality_at_time(efficient_producers,X1),zero) | zero = cardinality_at_time(efficient_producers,X1) | ~environment(X0) | ~in_environment(X0,X1)) )),
2.68/1.11	  inference(cnf_transformation,[],[f42])).
2.68/1.11	
2.68/1.11	fof(f5,conjecture,(
2.68/1.11	  ! [X0,X1] : ((in_environment(X0,X1) & greater_or_equal(X1,appear(efficient_producers,X0)) & environment(X0)) => greater(cardinality_at_time(efficient_producers,X1),zero))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f6,negated_conjecture,(
2.68/1.11	  ~! [X0,X1] : ((in_environment(X0,X1) & greater_or_equal(X1,appear(efficient_producers,X0)) & environment(X0)) => greater(cardinality_at_time(efficient_producers,X1),zero))),
2.68/1.11	  inference(negated_conjecture,[],[f5])).
2.68/1.11	
2.68/1.11	fof(f33,plain,(
2.68/1.11	  ? [X0,X1] : (~greater(cardinality_at_time(efficient_producers,X1),zero) & (in_environment(X0,X1) & greater_or_equal(X1,appear(efficient_producers,X0)) & environment(X0)))),
2.68/1.11	  inference(ennf_transformation,[],[f6])).
2.68/1.11	
2.68/1.11	fof(f34,plain,(
2.68/1.11	  ? [X0,X1] : (~greater(cardinality_at_time(efficient_producers,X1),zero) & in_environment(X0,X1) & greater_or_equal(X1,appear(efficient_producers,X0)) & environment(X0))),
2.68/1.11	  inference(flattening,[],[f33])).
2.68/1.11	
2.68/1.11	fof(f53,plain,(
2.68/1.11	  ? [X0,X1] : (~greater(cardinality_at_time(efficient_producers,X1),zero) & in_environment(X0,X1) & greater_or_equal(X1,appear(efficient_producers,X0)) & environment(X0)) => (~greater(cardinality_at_time(efficient_producers,sK1),zero) & in_environment(sK0,sK1) & greater_or_equal(sK1,appear(efficient_producers,sK0)) & environment(sK0))),
2.68/1.11	  introduced(choice_axiom,[])).
2.68/1.11	
2.68/1.11	fof(f54,plain,(
2.68/1.11	  ~greater(cardinality_at_time(efficient_producers,sK1),zero) & in_environment(sK0,sK1) & greater_or_equal(sK1,appear(efficient_producers,sK0)) & environment(sK0)),
2.68/1.11	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f34,f53])).
2.68/1.11	
2.68/1.11	fof(f65,plain,(
2.68/1.11	  environment(sK0)),
2.68/1.11	  inference(cnf_transformation,[],[f54])).
2.68/1.11	
2.68/1.11	fof(f68,plain,(
2.68/1.11	  ~greater(cardinality_at_time(efficient_producers,sK1),zero)),
2.68/1.11	  inference(cnf_transformation,[],[f54])).
2.68/1.11	
2.68/1.11	fof(f67,plain,(
2.68/1.11	  in_environment(sK0,sK1)),
2.68/1.11	  inference(cnf_transformation,[],[f54])).
2.68/1.11	
2.68/1.11	fof(f7,axiom,(
2.68/1.11	  ! [X0,X1] : ((zero = cardinality_at_time(efficient_producers,X1) & greater_or_equal(X1,appear(efficient_producers,X0)) & environment(X0)) => ? [X5] : (greater(X5,appear(efficient_producers,X0)) & in_environment(X0,X5) & greater(X1,X5) & greater(zero,growth_rate(efficient_producers,X5))))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f20,plain,(
2.68/1.11	  ! [X0,X1] : ((zero = cardinality_at_time(efficient_producers,X1) & greater_or_equal(X1,appear(efficient_producers,X0)) & environment(X0)) => ? [X2] : (greater(X2,appear(efficient_producers,X0)) & in_environment(X0,X2) & greater(X1,X2) & greater(zero,growth_rate(efficient_producers,X2))))),
2.68/1.11	  inference(rectify,[],[f7])).
2.68/1.11	
2.68/1.11	fof(f35,plain,(
2.68/1.11	  ! [X0,X1] : (? [X2] : (greater(X2,appear(efficient_producers,X0)) & in_environment(X0,X2) & greater(X1,X2) & greater(zero,growth_rate(efficient_producers,X2))) | (zero != cardinality_at_time(efficient_producers,X1) | ~greater_or_equal(X1,appear(efficient_producers,X0)) | ~environment(X0)))),
2.68/1.11	  inference(ennf_transformation,[],[f20])).
2.68/1.11	
2.68/1.11	fof(f36,plain,(
2.68/1.11	  ! [X0,X1] : (? [X2] : (greater(X2,appear(efficient_producers,X0)) & in_environment(X0,X2) & greater(X1,X2) & greater(zero,growth_rate(efficient_producers,X2))) | zero != cardinality_at_time(efficient_producers,X1) | ~greater_or_equal(X1,appear(efficient_producers,X0)) | ~environment(X0))),
2.68/1.11	  inference(flattening,[],[f35])).
2.68/1.11	
2.68/1.11	fof(f55,plain,(
2.68/1.11	  ! [X1,X0] : (? [X2] : (greater(X2,appear(efficient_producers,X0)) & in_environment(X0,X2) & greater(X1,X2) & greater(zero,growth_rate(efficient_producers,X2))) => (greater(sK2(X0,X1),appear(efficient_producers,X0)) & in_environment(X0,sK2(X0,X1)) & greater(X1,sK2(X0,X1)) & greater(zero,growth_rate(efficient_producers,sK2(X0,X1)))))),
2.68/1.11	  introduced(choice_axiom,[])).
2.68/1.11	
2.68/1.11	fof(f56,plain,(
2.68/1.11	  ! [X0,X1] : ((greater(sK2(X0,X1),appear(efficient_producers,X0)) & in_environment(X0,sK2(X0,X1)) & greater(X1,sK2(X0,X1)) & greater(zero,growth_rate(efficient_producers,sK2(X0,X1)))) | zero != cardinality_at_time(efficient_producers,X1) | ~greater_or_equal(X1,appear(efficient_producers,X0)) | ~environment(X0))),
2.68/1.11	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f36,f55])).
2.68/1.11	
2.68/1.11	fof(f71,plain,(
2.68/1.11	  ( ! [X0,X1] : (in_environment(X0,sK2(X0,X1)) | zero != cardinality_at_time(efficient_producers,X1) | ~greater_or_equal(X1,appear(efficient_producers,X0)) | ~environment(X0)) )),
2.68/1.11	  inference(cnf_transformation,[],[f56])).
2.68/1.11	
2.68/1.11	fof(f66,plain,(
2.68/1.11	  greater_or_equal(sK1,appear(efficient_producers,sK0))),
2.68/1.11	  inference(cnf_transformation,[],[f54])).
2.68/1.11	
2.68/1.11	fof(f16,axiom,(
2.68/1.11	  ! [X0,X1] : ((in_environment(X0,X1) & environment(X0)) => (greater_or_equal(X1,appear(an_organisation,X0)) | greater(appear(an_organisation,X0),X1)))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f51,plain,(
2.68/1.11	  ! [X0,X1] : ((greater_or_equal(X1,appear(an_organisation,X0)) | greater(appear(an_organisation,X0),X1)) | (~in_environment(X0,X1) | ~environment(X0)))),
2.68/1.11	  inference(ennf_transformation,[],[f16])).
2.68/1.11	
2.68/1.11	fof(f52,plain,(
2.68/1.11	  ! [X0,X1] : (greater_or_equal(X1,appear(an_organisation,X0)) | greater(appear(an_organisation,X0),X1) | ~in_environment(X0,X1) | ~environment(X0))),
2.68/1.11	  inference(flattening,[],[f51])).
2.68/1.11	
2.68/1.11	fof(f84,plain,(
2.68/1.11	  ( ! [X0,X1] : (greater_or_equal(X1,appear(an_organisation,X0)) | greater(appear(an_organisation,X0),X1) | ~in_environment(X0,X1) | ~environment(X0)) )),
2.68/1.11	  inference(cnf_transformation,[],[f52])).
2.68/1.11	
2.68/1.11	fof(f13,axiom,(
2.68/1.11	  ! [X0,X1] : ((greater_or_equal(X1,appear(an_organisation,X0)) & in_environment(X0,X1) & environment(X0)) => greater(number_of_organizations(X0,X1),zero))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f45,plain,(
2.68/1.11	  ! [X0,X1] : (greater(number_of_organizations(X0,X1),zero) | (~greater_or_equal(X1,appear(an_organisation,X0)) | ~in_environment(X0,X1) | ~environment(X0)))),
2.68/1.11	  inference(ennf_transformation,[],[f13])).
2.68/1.11	
2.68/1.11	fof(f46,plain,(
2.68/1.11	  ! [X0,X1] : (greater(number_of_organizations(X0,X1),zero) | ~greater_or_equal(X1,appear(an_organisation,X0)) | ~in_environment(X0,X1) | ~environment(X0))),
2.68/1.11	  inference(flattening,[],[f45])).
2.68/1.11	
2.68/1.11	fof(f79,plain,(
2.68/1.11	  ( ! [X0,X1] : (greater(number_of_organizations(X0,X1),zero) | ~greater_or_equal(X1,appear(an_organisation,X0)) | ~in_environment(X0,X1) | ~environment(X0)) )),
2.68/1.11	  inference(cnf_transformation,[],[f46])).
2.68/1.11	
2.68/1.11	fof(f14,axiom,(
2.68/1.11	  ! [X0,X1] : ((greater(appear(an_organisation,X0),X1) & in_environment(X0,X1) & environment(X0)) => zero = number_of_organizations(X0,X1))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f47,plain,(
2.68/1.11	  ! [X0,X1] : (zero = number_of_organizations(X0,X1) | (~greater(appear(an_organisation,X0),X1) | ~in_environment(X0,X1) | ~environment(X0)))),
2.68/1.11	  inference(ennf_transformation,[],[f14])).
2.68/1.11	
2.68/1.11	fof(f48,plain,(
2.68/1.11	  ! [X0,X1] : (zero = number_of_organizations(X0,X1) | ~greater(appear(an_organisation,X0),X1) | ~in_environment(X0,X1) | ~environment(X0))),
2.68/1.11	  inference(flattening,[],[f47])).
2.68/1.11	
2.68/1.11	fof(f80,plain,(
2.68/1.11	  ( ! [X0,X1] : (zero = number_of_organizations(X0,X1) | ~greater(appear(an_organisation,X0),X1) | ~in_environment(X0,X1) | ~environment(X0)) )),
2.68/1.11	  inference(cnf_transformation,[],[f48])).
2.68/1.11	
2.68/1.11	fof(f9,axiom,(
2.68/1.11	  ! [X0,X1] : ((greater(number_of_organizations(X0,X1),zero) & in_environment(X0,X1) & environment(X0)) => ((~greater(equilibrium(X0),X1) => constant(resources(X0,X1))) & (greater(equilibrium(X0),X1) => decreases(resources(X0,X1)))))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f38,plain,(
2.68/1.11	  ! [X0,X1] : (((constant(resources(X0,X1)) | greater(equilibrium(X0),X1)) & (decreases(resources(X0,X1)) | ~greater(equilibrium(X0),X1))) | (~greater(number_of_organizations(X0,X1),zero) | ~in_environment(X0,X1) | ~environment(X0)))),
2.68/1.11	  inference(ennf_transformation,[],[f9])).
2.68/1.11	
2.68/1.11	fof(f39,plain,(
2.68/1.11	  ! [X0,X1] : (((constant(resources(X0,X1)) | greater(equilibrium(X0),X1)) & (decreases(resources(X0,X1)) | ~greater(equilibrium(X0),X1))) | ~greater(number_of_organizations(X0,X1),zero) | ~in_environment(X0,X1) | ~environment(X0))),
2.68/1.11	  inference(flattening,[],[f38])).
2.68/1.11	
2.68/1.11	fof(f75,plain,(
2.68/1.11	  ( ! [X0,X1] : (constant(resources(X0,X1)) | greater(equilibrium(X0),X1) | ~greater(number_of_organizations(X0,X1),zero) | ~in_environment(X0,X1) | ~environment(X0)) )),
2.68/1.11	  inference(cnf_transformation,[],[f39])).
2.68/1.11	
2.68/1.11	fof(f74,plain,(
2.68/1.11	  ( ! [X0,X1] : (decreases(resources(X0,X1)) | ~greater(equilibrium(X0),X1) | ~greater(number_of_organizations(X0,X1),zero) | ~in_environment(X0,X1) | ~environment(X0)) )),
2.68/1.11	  inference(cnf_transformation,[],[f39])).
2.68/1.11	
2.68/1.11	fof(f4,axiom,(
2.68/1.11	  ! [X0,X4,X1] : ((subpopulation(X4,X0,X1) & greater(cardinality_at_time(X4,X1),zero) & environment(X0)) => (efficient_producers = X4 | first_movers = X4))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f19,plain,(
2.68/1.11	  ! [X0,X1,X2] : ((subpopulation(X1,X0,X2) & greater(cardinality_at_time(X1,X2),zero) & environment(X0)) => (efficient_producers = X1 | first_movers = X1))),
2.68/1.11	  inference(rectify,[],[f4])).
2.68/1.11	
2.68/1.11	fof(f31,plain,(
2.68/1.11	  ! [X0,X1,X2] : ((efficient_producers = X1 | first_movers = X1) | (~subpopulation(X1,X0,X2) | ~greater(cardinality_at_time(X1,X2),zero) | ~environment(X0)))),
2.68/1.11	  inference(ennf_transformation,[],[f19])).
2.68/1.11	
2.68/1.11	fof(f32,plain,(
2.68/1.11	  ! [X0,X1,X2] : (efficient_producers = X1 | first_movers = X1 | ~subpopulation(X1,X0,X2) | ~greater(cardinality_at_time(X1,X2),zero) | ~environment(X0))),
2.68/1.11	  inference(flattening,[],[f31])).
2.68/1.11	
2.68/1.11	fof(f64,plain,(
2.68/1.11	  ( ! [X2,X0,X1] : (efficient_producers = X1 | first_movers = X1 | ~subpopulation(X1,X0,X2) | ~greater(cardinality_at_time(X1,X2),zero) | ~environment(X0)) )),
2.68/1.11	  inference(cnf_transformation,[],[f32])).
2.68/1.11	
2.68/1.11	fof(f15,axiom,(
2.68/1.11	  ! [X0,X1] : ((in_environment(X0,X1) & ~decreases(number_of_organizations(X0,X1)) & environment(X0)) => ? [X4] : (greater(cardinality_at_time(X4,X1),zero) & ~greater(zero,growth_rate(X4,X1)) & subpopulation(X4,X0,X1)))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f24,plain,(
2.68/1.11	  ! [X0,X1] : ((in_environment(X0,X1) & ~decreases(number_of_organizations(X0,X1)) & environment(X0)) => ? [X2] : (greater(cardinality_at_time(X2,X1),zero) & ~greater(zero,growth_rate(X2,X1)) & subpopulation(X2,X0,X1)))),
2.68/1.11	  inference(rectify,[],[f15])).
2.68/1.11	
2.68/1.11	fof(f49,plain,(
2.68/1.11	  ! [X0,X1] : (? [X2] : (greater(cardinality_at_time(X2,X1),zero) & ~greater(zero,growth_rate(X2,X1)) & subpopulation(X2,X0,X1)) | (~in_environment(X0,X1) | decreases(number_of_organizations(X0,X1)) | ~environment(X0)))),
2.68/1.11	  inference(ennf_transformation,[],[f24])).
2.68/1.11	
2.68/1.11	fof(f50,plain,(
2.68/1.11	  ! [X0,X1] : (? [X2] : (greater(cardinality_at_time(X2,X1),zero) & ~greater(zero,growth_rate(X2,X1)) & subpopulation(X2,X0,X1)) | ~in_environment(X0,X1) | decreases(number_of_organizations(X0,X1)) | ~environment(X0))),
2.68/1.11	  inference(flattening,[],[f49])).
2.68/1.11	
2.68/1.11	fof(f57,plain,(
2.68/1.11	  ! [X1,X0] : (? [X2] : (greater(cardinality_at_time(X2,X1),zero) & ~greater(zero,growth_rate(X2,X1)) & subpopulation(X2,X0,X1)) => (greater(cardinality_at_time(sK3(X0,X1),X1),zero) & ~greater(zero,growth_rate(sK3(X0,X1),X1)) & subpopulation(sK3(X0,X1),X0,X1)))),
2.68/1.11	  introduced(choice_axiom,[])).
2.68/1.11	
2.68/1.11	fof(f58,plain,(
2.68/1.11	  ! [X0,X1] : ((greater(cardinality_at_time(sK3(X0,X1),X1),zero) & ~greater(zero,growth_rate(sK3(X0,X1),X1)) & subpopulation(sK3(X0,X1),X0,X1)) | ~in_environment(X0,X1) | decreases(number_of_organizations(X0,X1)) | ~environment(X0))),
2.68/1.11	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f50,f57])).
2.68/1.11	
2.68/1.11	fof(f81,plain,(
2.68/1.11	  ( ! [X0,X1] : (subpopulation(sK3(X0,X1),X0,X1) | ~in_environment(X0,X1) | decreases(number_of_organizations(X0,X1)) | ~environment(X0)) )),
2.68/1.11	  inference(cnf_transformation,[],[f58])).
2.68/1.11	
2.68/1.11	fof(f83,plain,(
2.68/1.11	  ( ! [X0,X1] : (greater(cardinality_at_time(sK3(X0,X1),X1),zero) | ~in_environment(X0,X1) | decreases(number_of_organizations(X0,X1)) | ~environment(X0)) )),
2.68/1.11	  inference(cnf_transformation,[],[f58])).
2.68/1.11	
2.68/1.11	fof(f3,axiom,(
2.68/1.11	  ! [X0,X1] : ((environment(X0) & in_environment(X0,X1)) => ((constant(resources(X0,X1)) => constant(number_of_organizations(X0,X1))) & (decreases(resources(X0,X1)) => ~decreases(number_of_organizations(X0,X1)))))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f29,plain,(
2.68/1.11	  ! [X0,X1] : (((constant(number_of_organizations(X0,X1)) | ~constant(resources(X0,X1))) & (~decreases(number_of_organizations(X0,X1)) | ~decreases(resources(X0,X1)))) | (~environment(X0) | ~in_environment(X0,X1)))),
2.68/1.11	  inference(ennf_transformation,[],[f3])).
2.68/1.11	
2.68/1.11	fof(f30,plain,(
2.68/1.11	  ! [X0,X1] : (((constant(number_of_organizations(X0,X1)) | ~constant(resources(X0,X1))) & (~decreases(number_of_organizations(X0,X1)) | ~decreases(resources(X0,X1)))) | ~environment(X0) | ~in_environment(X0,X1))),
2.68/1.11	  inference(flattening,[],[f29])).
2.68/1.11	
2.68/1.11	fof(f62,plain,(
2.68/1.11	  ( ! [X0,X1] : (~decreases(number_of_organizations(X0,X1)) | ~decreases(resources(X0,X1)) | ~environment(X0) | ~in_environment(X0,X1)) )),
2.68/1.11	  inference(cnf_transformation,[],[f30])).
2.68/1.11	
2.68/1.11	fof(f63,plain,(
2.68/1.11	  ( ! [X0,X1] : (constant(number_of_organizations(X0,X1)) | ~constant(resources(X0,X1)) | ~environment(X0) | ~in_environment(X0,X1)) )),
2.68/1.11	  inference(cnf_transformation,[],[f30])).
2.68/1.11	
2.68/1.11	fof(f10,axiom,(
2.68/1.11	  ! [X4] : (constant(X4) => ~decreases(X4))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f22,plain,(
2.68/1.11	  ! [X0] : (constant(X0) => ~decreases(X0))),
2.68/1.11	  inference(rectify,[],[f10])).
2.68/1.11	
2.68/1.11	fof(f40,plain,(
2.68/1.11	  ! [X0] : (~decreases(X0) | ~constant(X0))),
2.68/1.11	  inference(ennf_transformation,[],[f22])).
2.68/1.11	
2.68/1.11	fof(f76,plain,(
2.68/1.11	  ( ! [X0] : (~decreases(X0) | ~constant(X0)) )),
2.68/1.11	  inference(cnf_transformation,[],[f40])).
2.68/1.11	
2.68/1.11	fof(f69,plain,(
2.68/1.11	  ( ! [X0,X1] : (greater(zero,growth_rate(efficient_producers,sK2(X0,X1))) | zero != cardinality_at_time(efficient_producers,X1) | ~greater_or_equal(X1,appear(efficient_producers,X0)) | ~environment(X0)) )),
2.68/1.11	  inference(cnf_transformation,[],[f56])).
2.68/1.11	
2.68/1.11	fof(f1,axiom,(
2.68/1.11	  ! [X0,X1] : ((environment(X0) & in_environment(X0,X1)) => (subpopulation(efficient_producers,X0,X1) & subpopulation(first_movers,X0,X1)))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f25,plain,(
2.68/1.11	  ! [X0,X1] : ((subpopulation(efficient_producers,X0,X1) & subpopulation(first_movers,X0,X1)) | (~environment(X0) | ~in_environment(X0,X1)))),
2.68/1.11	  inference(ennf_transformation,[],[f1])).
2.68/1.11	
2.68/1.11	fof(f26,plain,(
2.68/1.11	  ! [X0,X1] : ((subpopulation(efficient_producers,X0,X1) & subpopulation(first_movers,X0,X1)) | ~environment(X0) | ~in_environment(X0,X1))),
2.68/1.11	  inference(flattening,[],[f25])).
2.68/1.11	
2.68/1.11	fof(f60,plain,(
2.68/1.11	  ( ! [X0,X1] : (subpopulation(efficient_producers,X0,X1) | ~environment(X0) | ~in_environment(X0,X1)) )),
2.68/1.11	  inference(cnf_transformation,[],[f26])).
2.68/1.11	
2.68/1.11	fof(f12,axiom,(
2.68/1.11	  ! [X0,X1,X4] : ((environment(X0) & in_environment(X0,X1) & zero = number_of_organizations(X0,X1) & subpopulation(X4,X0,X1)) => zero = cardinality_at_time(X4,X1))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f23,plain,(
2.68/1.11	  ! [X0,X1,X2] : ((environment(X0) & in_environment(X0,X1) & zero = number_of_organizations(X0,X1) & subpopulation(X2,X0,X1)) => zero = cardinality_at_time(X2,X1))),
2.68/1.11	  inference(rectify,[],[f12])).
2.68/1.11	
2.68/1.11	fof(f43,plain,(
2.68/1.11	  ! [X0,X1,X2] : (zero = cardinality_at_time(X2,X1) | (~environment(X0) | ~in_environment(X0,X1) | zero != number_of_organizations(X0,X1) | ~subpopulation(X2,X0,X1)))),
2.68/1.11	  inference(ennf_transformation,[],[f23])).
2.68/1.11	
2.68/1.11	fof(f44,plain,(
2.68/1.11	  ! [X0,X1,X2] : (zero = cardinality_at_time(X2,X1) | ~environment(X0) | ~in_environment(X0,X1) | zero != number_of_organizations(X0,X1) | ~subpopulation(X2,X0,X1))),
2.68/1.11	  inference(flattening,[],[f43])).
2.68/1.11	
2.68/1.11	fof(f78,plain,(
2.68/1.11	  ( ! [X2,X0,X1] : (zero = cardinality_at_time(X2,X1) | ~environment(X0) | ~in_environment(X0,X1) | zero != number_of_organizations(X0,X1) | ~subpopulation(X2,X0,X1)) )),
2.68/1.11	  inference(cnf_transformation,[],[f44])).
2.68/1.11	
2.68/1.11	fof(f8,axiom,(
2.68/1.11	  ! [X6,X1] : (zero = cardinality_at_time(X6,X1) => ~greater(zero,growth_rate(X6,X1)))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f21,plain,(
2.68/1.11	  ! [X0,X1] : (zero = cardinality_at_time(X0,X1) => ~greater(zero,growth_rate(X0,X1)))),
2.68/1.11	  inference(rectify,[],[f8])).
2.68/1.11	
2.68/1.11	fof(f37,plain,(
2.68/1.11	  ! [X0,X1] : (~greater(zero,growth_rate(X0,X1)) | zero != cardinality_at_time(X0,X1))),
2.68/1.11	  inference(ennf_transformation,[],[f21])).
2.68/1.11	
2.68/1.11	fof(f73,plain,(
2.68/1.11	  ( ! [X0,X1] : (~greater(zero,growth_rate(X0,X1)) | zero != cardinality_at_time(X0,X1)) )),
2.68/1.11	  inference(cnf_transformation,[],[f37])).
2.68/1.11	
2.68/1.11	fof(f17,axiom,(
2.68/1.11	  greater(resilience(efficient_producers),resilience(first_movers))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f85,plain,(
2.68/1.11	  greater(resilience(efficient_producers),resilience(first_movers))),
2.68/1.11	  inference(cnf_transformation,[],[f17])).
2.68/1.11	
2.68/1.11	fof(f2,axiom,(
2.68/1.11	  ! [X0,X2,X3,X1] : ((environment(X0) & greater(resilience(X3),resilience(X2)) & ~greater(zero,growth_rate(X2,X1)) & in_environment(X0,X1)) => ~greater(zero,growth_rate(X3,X1)))),
2.68/1.11	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
2.68/1.11	
2.68/1.11	fof(f18,plain,(
2.68/1.11	  ! [X0,X1,X2,X3] : ((environment(X0) & greater(resilience(X2),resilience(X1)) & ~greater(zero,growth_rate(X1,X3)) & in_environment(X0,X3)) => ~greater(zero,growth_rate(X2,X3)))),
2.68/1.11	  inference(rectify,[],[f2])).
2.68/1.11	
2.68/1.11	fof(f27,plain,(
2.68/1.11	  ! [X0,X1,X2,X3] : (~greater(zero,growth_rate(X2,X3)) | (~environment(X0) | ~greater(resilience(X2),resilience(X1)) | greater(zero,growth_rate(X1,X3)) | ~in_environment(X0,X3)))),
2.68/1.11	  inference(ennf_transformation,[],[f18])).
2.68/1.11	
2.68/1.11	fof(f28,plain,(
2.68/1.11	  ! [X0,X1,X2,X3] : (~greater(zero,growth_rate(X2,X3)) | ~environment(X0) | ~greater(resilience(X2),resilience(X1)) | greater(zero,growth_rate(X1,X3)) | ~in_environment(X0,X3))),
2.68/1.11	  inference(flattening,[],[f27])).
2.68/1.11	
2.68/1.11	fof(f61,plain,(
2.68/1.11	  ( ! [X2,X0,X3,X1] : (~greater(zero,growth_rate(X2,X3)) | ~environment(X0) | ~greater(resilience(X2),resilience(X1)) | greater(zero,growth_rate(X1,X3)) | ~in_environment(X0,X3)) )),
2.68/1.11	  inference(cnf_transformation,[],[f28])).
2.68/1.11	
2.68/1.11	fof(f82,plain,(
2.68/1.11	  ( ! [X0,X1] : (~greater(zero,growth_rate(sK3(X0,X1),X1)) | ~in_environment(X0,X1) | decreases(number_of_organizations(X0,X1)) | ~environment(X0)) )),
2.68/1.11	  inference(cnf_transformation,[],[f58])).
2.68/1.11	
2.68/1.11	cnf(c_18,plain,
2.68/1.11	    ( greater(cardinality_at_time(efficient_producers,X0),zero)
2.68/1.11	    | ~ in_environment(X1,X0)
2.68/1.11	    | ~ environment(X1)
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) = zero ),
2.68/1.11	    inference(cnf_transformation,[],[f77]) ).
2.68/1.11	
2.68/1.11	cnf(c_9,negated_conjecture,
2.68/1.11	    ( environment(sK0) ),
2.68/1.11	    inference(cnf_transformation,[],[f65]) ).
2.68/1.11	
2.68/1.11	cnf(c_901,plain,
2.68/1.11	    ( greater(cardinality_at_time(efficient_producers,X0),zero)
2.68/1.11	    | ~ in_environment(X1,X0)
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) = zero
2.68/1.11	    | sK0 != X1 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_18,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_902,plain,
2.68/1.11	    ( greater(cardinality_at_time(efficient_producers,X0),zero)
2.68/1.11	    | ~ in_environment(sK0,X0)
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) = zero ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_901]) ).
2.68/1.11	
2.68/1.11	cnf(c_2628,plain,
2.68/1.11	    ( greater(cardinality_at_time(efficient_producers,X0_50),zero)
2.68/1.11	    | ~ in_environment(sK0,X0_50)
2.68/1.11	    | cardinality_at_time(efficient_producers,X0_50) = zero ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_902]) ).
2.68/1.11	
2.68/1.11	cnf(c_3136,plain,
2.68/1.11	    ( cardinality_at_time(efficient_producers,X0_50) = zero
2.68/1.11	    | greater(cardinality_at_time(efficient_producers,X0_50),zero) = iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2628]) ).
2.68/1.11	
2.68/1.11	cnf(c_6,negated_conjecture,
2.68/1.11	    ( ~ greater(cardinality_at_time(efficient_producers,sK1),zero) ),
2.68/1.11	    inference(cnf_transformation,[],[f68]) ).
2.68/1.11	
2.68/1.11	cnf(c_2648,negated_conjecture,
2.68/1.11	    ( ~ greater(cardinality_at_time(efficient_producers,sK1),zero) ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_6]) ).
2.68/1.11	
2.68/1.11	cnf(c_3116,plain,
2.68/1.11	    ( greater(cardinality_at_time(efficient_producers,sK1),zero) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2648]) ).
2.68/1.11	
2.68/1.11	cnf(c_3586,plain,
2.68/1.11	    ( cardinality_at_time(efficient_producers,sK1) = zero
2.68/1.11	    | in_environment(sK0,sK1) != iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_3136,c_3116]) ).
2.68/1.11	
2.68/1.11	cnf(c_7,negated_conjecture,
2.68/1.11	    ( in_environment(sK0,sK1) ),
2.68/1.11	    inference(cnf_transformation,[],[f67]) ).
2.68/1.11	
2.68/1.11	cnf(c_3345,plain,
2.68/1.11	    ( greater(cardinality_at_time(efficient_producers,sK1),zero)
2.68/1.11	    | ~ in_environment(sK0,sK1)
2.68/1.11	    | cardinality_at_time(efficient_producers,sK1) = zero ),
2.68/1.11	    inference(instantiation,[status(thm)],[c_2628]) ).
2.68/1.11	
2.68/1.11	cnf(c_3617,plain,
2.68/1.11	    ( cardinality_at_time(efficient_producers,sK1) = zero ),
2.68/1.11	    inference(global_propositional_subsumption,
2.68/1.11	              [status(thm)],
2.68/1.11	              [c_3586,c_7,c_6,c_3345]) ).
2.68/1.11	
2.68/1.11	cnf(c_11,plain,
2.68/1.11	    ( ~ greater_or_equal(X0,appear(efficient_producers,X1))
2.68/1.11	    | in_environment(X1,sK2(X1,X0))
2.68/1.11	    | ~ environment(X1)
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) != zero ),
2.68/1.11	    inference(cnf_transformation,[],[f71]) ).
2.68/1.11	
2.68/1.11	cnf(c_946,plain,
2.68/1.11	    ( ~ greater_or_equal(X0,appear(efficient_producers,X1))
2.68/1.11	    | in_environment(X1,sK2(X1,X0))
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) != zero
2.68/1.11	    | sK0 != X1 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_11,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_947,plain,
2.68/1.11	    ( ~ greater_or_equal(X0,appear(efficient_producers,sK0))
2.68/1.11	    | in_environment(sK0,sK2(sK0,X0))
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) != zero ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_946]) ).
2.68/1.11	
2.68/1.11	cnf(c_2625,plain,
2.68/1.11	    ( ~ greater_or_equal(X0_50,appear(efficient_producers,sK0))
2.68/1.11	    | in_environment(sK0,sK2(sK0,X0_50))
2.68/1.11	    | cardinality_at_time(efficient_producers,X0_50) != zero ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_947]) ).
2.68/1.11	
2.68/1.11	cnf(c_3139,plain,
2.68/1.11	    ( cardinality_at_time(efficient_producers,X0_50) != zero
2.68/1.11	    | greater_or_equal(X0_50,appear(efficient_producers,sK0)) != iProver_top
2.68/1.11	    | in_environment(sK0,sK2(sK0,X0_50)) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2625]) ).
2.68/1.11	
2.68/1.11	cnf(c_3701,plain,
2.68/1.11	    ( greater_or_equal(sK1,appear(efficient_producers,sK0)) != iProver_top
2.68/1.11	    | in_environment(sK0,sK2(sK0,sK1)) = iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_3617,c_3139]) ).
2.68/1.11	
2.68/1.11	cnf(c_8,negated_conjecture,
2.68/1.11	    ( greater_or_equal(sK1,appear(efficient_producers,sK0)) ),
2.68/1.11	    inference(cnf_transformation,[],[f66]) ).
2.68/1.11	
2.68/1.11	cnf(c_1095,plain,
2.68/1.11	    ( in_environment(sK0,sK2(sK0,X0))
2.68/1.11	    | appear(efficient_producers,sK0) != appear(efficient_producers,sK0)
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) != zero
2.68/1.11	    | sK1 != X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_8,c_947]) ).
2.68/1.11	
2.68/1.11	cnf(c_1096,plain,
2.68/1.11	    ( in_environment(sK0,sK2(sK0,sK1))
2.68/1.11	    | cardinality_at_time(efficient_producers,sK1) != zero ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_1095]) ).
2.68/1.11	
2.68/1.11	cnf(c_1097,plain,
2.68/1.11	    ( cardinality_at_time(efficient_producers,sK1) != zero
2.68/1.11	    | in_environment(sK0,sK2(sK0,sK1)) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_1096]) ).
2.68/1.11	
2.68/1.11	cnf(c_1242,plain,
2.68/1.11	    ( greater(cardinality_at_time(efficient_producers,X0),zero)
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) = zero
2.68/1.11	    | sK0 != sK0
2.68/1.11	    | sK1 != X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_7,c_902]) ).
2.68/1.11	
2.68/1.11	cnf(c_1243,plain,
2.68/1.11	    ( greater(cardinality_at_time(efficient_producers,sK1),zero)
2.68/1.11	    | cardinality_at_time(efficient_producers,sK1) = zero ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_1242]) ).
2.68/1.11	
2.68/1.11	cnf(c_4117,plain,
2.68/1.11	    ( in_environment(sK0,sK2(sK0,sK1)) = iProver_top ),
2.68/1.11	    inference(global_propositional_subsumption,
2.68/1.11	              [status(thm)],
2.68/1.11	              [c_3701,c_6,c_1097,c_1243]) ).
2.68/1.11	
2.68/1.11	cnf(c_25,plain,
2.68/1.11	    ( greater_or_equal(X0,appear(an_organisation,X1))
2.68/1.11	    | greater(appear(an_organisation,X1),X0)
2.68/1.11	    | ~ in_environment(X1,X0)
2.68/1.11	    | ~ environment(X1) ),
2.68/1.11	    inference(cnf_transformation,[],[f84]) ).
2.68/1.11	
2.68/1.11	cnf(c_871,plain,
2.68/1.11	    ( greater_or_equal(X0,appear(an_organisation,X1))
2.68/1.11	    | greater(appear(an_organisation,X1),X0)
2.68/1.11	    | ~ in_environment(X1,X0)
2.68/1.11	    | sK0 != X1 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_25,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_872,plain,
2.68/1.11	    ( greater_or_equal(X0,appear(an_organisation,sK0))
2.68/1.11	    | greater(appear(an_organisation,sK0),X0)
2.68/1.11	    | ~ in_environment(sK0,X0) ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_871]) ).
2.68/1.11	
2.68/1.11	cnf(c_2630,plain,
2.68/1.11	    ( greater_or_equal(X0_50,appear(an_organisation,sK0))
2.68/1.11	    | greater(appear(an_organisation,sK0),X0_50)
2.68/1.11	    | ~ in_environment(sK0,X0_50) ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_872]) ).
2.68/1.11	
2.68/1.11	cnf(c_3134,plain,
2.68/1.11	    ( greater_or_equal(X0_50,appear(an_organisation,sK0)) = iProver_top
2.68/1.11	    | greater(appear(an_organisation,sK0),X0_50) = iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2630]) ).
2.68/1.11	
2.68/1.11	cnf(c_20,plain,
2.68/1.11	    ( ~ greater_or_equal(X0,appear(an_organisation,X1))
2.68/1.11	    | greater(number_of_organizations(X1,X0),zero)
2.68/1.11	    | ~ in_environment(X1,X0)
2.68/1.11	    | ~ environment(X1) ),
2.68/1.11	    inference(cnf_transformation,[],[f79]) ).
2.68/1.11	
2.68/1.11	cnf(c_886,plain,
2.68/1.11	    ( ~ greater_or_equal(X0,appear(an_organisation,X1))
2.68/1.11	    | greater(number_of_organizations(X1,X0),zero)
2.68/1.11	    | ~ in_environment(X1,X0)
2.68/1.11	    | sK0 != X1 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_20,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_887,plain,
2.68/1.11	    ( ~ greater_or_equal(X0,appear(an_organisation,sK0))
2.68/1.11	    | greater(number_of_organizations(sK0,X0),zero)
2.68/1.11	    | ~ in_environment(sK0,X0) ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_886]) ).
2.68/1.11	
2.68/1.11	cnf(c_2629,plain,
2.68/1.11	    ( ~ greater_or_equal(X0_50,appear(an_organisation,sK0))
2.68/1.11	    | greater(number_of_organizations(sK0,X0_50),zero)
2.68/1.11	    | ~ in_environment(sK0,X0_50) ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_887]) ).
2.68/1.11	
2.68/1.11	cnf(c_3135,plain,
2.68/1.11	    ( greater_or_equal(X0_50,appear(an_organisation,sK0)) != iProver_top
2.68/1.11	    | greater(number_of_organizations(sK0,X0_50),zero) = iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2629]) ).
2.68/1.11	
2.68/1.11	cnf(c_3909,plain,
2.68/1.11	    ( greater(appear(an_organisation,sK0),X0_50) = iProver_top
2.68/1.11	    | greater(number_of_organizations(sK0,X0_50),zero) = iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_3134,c_3135]) ).
2.68/1.11	
2.68/1.11	cnf(c_21,plain,
2.68/1.11	    ( ~ greater(appear(an_organisation,X0),X1)
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | ~ environment(X0)
2.68/1.11	    | number_of_organizations(X0,X1) = zero ),
2.68/1.11	    inference(cnf_transformation,[],[f80]) ).
2.68/1.11	
2.68/1.11	cnf(c_774,plain,
2.68/1.11	    ( ~ greater(appear(an_organisation,X0),X1)
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | number_of_organizations(X0,X1) = zero
2.68/1.11	    | sK0 != X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_21,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_775,plain,
2.68/1.11	    ( ~ greater(appear(an_organisation,sK0),X0)
2.68/1.11	    | ~ in_environment(sK0,X0)
2.68/1.11	    | number_of_organizations(sK0,X0) = zero ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_774]) ).
2.68/1.11	
2.68/1.11	cnf(c_2636,plain,
2.68/1.11	    ( ~ greater(appear(an_organisation,sK0),X0_50)
2.68/1.11	    | ~ in_environment(sK0,X0_50)
2.68/1.11	    | number_of_organizations(sK0,X0_50) = zero ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_775]) ).
2.68/1.11	
2.68/1.11	cnf(c_3128,plain,
2.68/1.11	    ( number_of_organizations(sK0,X0_50) = zero
2.68/1.11	    | greater(appear(an_organisation,sK0),X0_50) != iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2636]) ).
2.68/1.11	
2.68/1.11	cnf(c_4317,plain,
2.68/1.11	    ( number_of_organizations(sK0,X0_50) = zero
2.68/1.11	    | greater(number_of_organizations(sK0,X0_50),zero) = iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_3909,c_3128]) ).
2.68/1.11	
2.68/1.11	cnf(c_15,plain,
2.68/1.11	    ( ~ greater(number_of_organizations(X0,X1),zero)
2.68/1.11	    | greater(equilibrium(X0),X1)
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | constant(resources(X0,X1))
2.68/1.11	    | ~ environment(X0) ),
2.68/1.11	    inference(cnf_transformation,[],[f75]) ).
2.68/1.11	
2.68/1.11	cnf(c_807,plain,
2.68/1.11	    ( ~ greater(number_of_organizations(X0,X1),zero)
2.68/1.11	    | greater(equilibrium(X0),X1)
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | constant(resources(X0,X1))
2.68/1.11	    | sK0 != X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_15,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_808,plain,
2.68/1.11	    ( ~ greater(number_of_organizations(sK0,X0),zero)
2.68/1.11	    | greater(equilibrium(sK0),X0)
2.68/1.11	    | ~ in_environment(sK0,X0)
2.68/1.11	    | constant(resources(sK0,X0)) ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_807]) ).
2.68/1.11	
2.68/1.11	cnf(c_2634,plain,
2.68/1.11	    ( ~ greater(number_of_organizations(sK0,X0_50),zero)
2.68/1.11	    | greater(equilibrium(sK0),X0_50)
2.68/1.11	    | ~ in_environment(sK0,X0_50)
2.68/1.11	    | constant(resources(sK0,X0_50)) ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_808]) ).
2.68/1.11	
2.68/1.11	cnf(c_3130,plain,
2.68/1.11	    ( greater(number_of_organizations(sK0,X0_50),zero) != iProver_top
2.68/1.11	    | greater(equilibrium(sK0),X0_50) = iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | constant(resources(sK0,X0_50)) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2634]) ).
2.68/1.11	
2.68/1.11	cnf(c_4353,plain,
2.68/1.11	    ( number_of_organizations(sK0,X0_50) = zero
2.68/1.11	    | greater(equilibrium(sK0),X0_50) = iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | constant(resources(sK0,X0_50)) = iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_4317,c_3130]) ).
2.68/1.11	
2.68/1.11	cnf(c_16,plain,
2.68/1.11	    ( ~ greater(number_of_organizations(X0,X1),zero)
2.68/1.11	    | ~ greater(equilibrium(X0),X1)
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | decreases(resources(X0,X1))
2.68/1.11	    | ~ environment(X0) ),
2.68/1.11	    inference(cnf_transformation,[],[f74]) ).
2.68/1.11	
2.68/1.11	cnf(c_789,plain,
2.68/1.11	    ( ~ greater(number_of_organizations(X0,X1),zero)
2.68/1.11	    | ~ greater(equilibrium(X0),X1)
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | decreases(resources(X0,X1))
2.68/1.11	    | sK0 != X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_16,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_790,plain,
2.68/1.11	    ( ~ greater(number_of_organizations(sK0,X0),zero)
2.68/1.11	    | ~ greater(equilibrium(sK0),X0)
2.68/1.11	    | ~ in_environment(sK0,X0)
2.68/1.11	    | decreases(resources(sK0,X0)) ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_789]) ).
2.68/1.11	
2.68/1.11	cnf(c_2635,plain,
2.68/1.11	    ( ~ greater(number_of_organizations(sK0,X0_50),zero)
2.68/1.11	    | ~ greater(equilibrium(sK0),X0_50)
2.68/1.11	    | ~ in_environment(sK0,X0_50)
2.68/1.11	    | decreases(resources(sK0,X0_50)) ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_790]) ).
2.68/1.11	
2.68/1.11	cnf(c_3129,plain,
2.68/1.11	    ( greater(number_of_organizations(sK0,X0_50),zero) != iProver_top
2.68/1.11	    | greater(equilibrium(sK0),X0_50) != iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | decreases(resources(sK0,X0_50)) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2635]) ).
2.68/1.11	
2.68/1.11	cnf(c_4354,plain,
2.68/1.11	    ( number_of_organizations(sK0,X0_50) = zero
2.68/1.11	    | greater(equilibrium(sK0),X0_50) != iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | decreases(resources(sK0,X0_50)) = iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_4317,c_3129]) ).
2.68/1.11	
2.68/1.11	cnf(c_4415,plain,
2.68/1.11	    ( number_of_organizations(sK0,X0_50) = zero
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | decreases(resources(sK0,X0_50)) = iProver_top
2.68/1.11	    | constant(resources(sK0,X0_50)) = iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_4353,c_4354]) ).
2.68/1.11	
2.68/1.11	cnf(c_5,plain,
2.68/1.11	    ( ~ subpopulation(X0,X1,X2)
2.68/1.11	    | ~ greater(cardinality_at_time(X0,X2),zero)
2.68/1.11	    | ~ environment(X1)
2.68/1.11	    | first_movers = X0
2.68/1.11	    | efficient_producers = X0 ),
2.68/1.11	    inference(cnf_transformation,[],[f64]) ).
2.68/1.11	
2.68/1.11	cnf(c_24,plain,
2.68/1.11	    ( subpopulation(sK3(X0,X1),X0,X1)
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | decreases(number_of_organizations(X0,X1))
2.68/1.11	    | ~ environment(X0) ),
2.68/1.11	    inference(cnf_transformation,[],[f81]) ).
2.68/1.11	
2.68/1.11	cnf(c_362,plain,
2.68/1.11	    ( ~ greater(cardinality_at_time(X0,X1),zero)
2.68/1.11	    | ~ in_environment(X2,X3)
2.68/1.11	    | decreases(number_of_organizations(X2,X3))
2.68/1.11	    | ~ environment(X2)
2.68/1.11	    | ~ environment(X4)
2.68/1.11	    | X2 != X4
2.68/1.11	    | X3 != X1
2.68/1.11	    | sK3(X2,X3) != X0
2.68/1.11	    | first_movers = X0
2.68/1.11	    | efficient_producers = X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_5,c_24]) ).
2.68/1.11	
2.68/1.11	cnf(c_363,plain,
2.68/1.11	    ( ~ greater(cardinality_at_time(sK3(X0,X1),X1),zero)
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | decreases(number_of_organizations(X0,X1))
2.68/1.11	    | ~ environment(X0)
2.68/1.11	    | first_movers = sK3(X0,X1)
2.68/1.11	    | efficient_producers = sK3(X0,X1) ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_362]) ).
2.68/1.11	
2.68/1.11	cnf(c_22,plain,
2.68/1.11	    ( greater(cardinality_at_time(sK3(X0,X1),X1),zero)
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | decreases(number_of_organizations(X0,X1))
2.68/1.11	    | ~ environment(X0) ),
2.68/1.11	    inference(cnf_transformation,[],[f83]) ).
2.68/1.11	
2.68/1.11	cnf(c_367,plain,
2.68/1.11	    ( ~ in_environment(X0,X1)
2.68/1.11	    | decreases(number_of_organizations(X0,X1))
2.68/1.11	    | ~ environment(X0)
2.68/1.11	    | first_movers = sK3(X0,X1)
2.68/1.11	    | efficient_producers = sK3(X0,X1) ),
2.68/1.11	    inference(global_propositional_subsumption,
2.68/1.11	              [status(thm)],
2.68/1.11	              [c_363,c_22]) ).
2.68/1.11	
2.68/1.11	cnf(c_678,plain,
2.68/1.11	    ( ~ in_environment(X0,X1)
2.68/1.11	    | decreases(number_of_organizations(X0,X1))
2.68/1.11	    | sK3(X0,X1) = first_movers
2.68/1.11	    | sK3(X0,X1) = efficient_producers
2.68/1.11	    | sK0 != X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_367,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_679,plain,
2.68/1.11	    ( ~ in_environment(sK0,X0)
2.68/1.11	    | decreases(number_of_organizations(sK0,X0))
2.68/1.11	    | sK3(sK0,X0) = first_movers
2.68/1.11	    | sK3(sK0,X0) = efficient_producers ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_678]) ).
2.68/1.11	
2.68/1.11	cnf(c_2642,plain,
2.68/1.11	    ( ~ in_environment(sK0,X0_50)
2.68/1.11	    | decreases(number_of_organizations(sK0,X0_50))
2.68/1.11	    | sK3(sK0,X0_50) = first_movers
2.68/1.11	    | sK3(sK0,X0_50) = efficient_producers ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_679]) ).
2.68/1.11	
2.68/1.11	cnf(c_3122,plain,
2.68/1.11	    ( sK3(sK0,X0_50) = first_movers
2.68/1.11	    | sK3(sK0,X0_50) = efficient_producers
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | decreases(number_of_organizations(sK0,X0_50)) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2642]) ).
2.68/1.11	
2.68/1.11	cnf(c_4,plain,
2.68/1.11	    ( ~ in_environment(X0,X1)
2.68/1.11	    | ~ decreases(resources(X0,X1))
2.68/1.11	    | ~ decreases(number_of_organizations(X0,X1))
2.68/1.11	    | ~ environment(X0) ),
2.68/1.11	    inference(cnf_transformation,[],[f62]) ).
2.68/1.11	
2.68/1.11	cnf(c_825,plain,
2.68/1.11	    ( ~ in_environment(X0,X1)
2.68/1.11	    | ~ decreases(resources(X0,X1))
2.68/1.11	    | ~ decreases(number_of_organizations(X0,X1))
2.68/1.11	    | sK0 != X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_4,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_826,plain,
2.68/1.11	    ( ~ in_environment(sK0,X0)
2.68/1.11	    | ~ decreases(resources(sK0,X0))
2.68/1.11	    | ~ decreases(number_of_organizations(sK0,X0)) ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_825]) ).
2.68/1.11	
2.68/1.11	cnf(c_2633,plain,
2.68/1.11	    ( ~ in_environment(sK0,X0_50)
2.68/1.11	    | ~ decreases(resources(sK0,X0_50))
2.68/1.11	    | ~ decreases(number_of_organizations(sK0,X0_50)) ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_826]) ).
2.68/1.11	
2.68/1.11	cnf(c_3131,plain,
2.68/1.11	    ( in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | decreases(resources(sK0,X0_50)) != iProver_top
2.68/1.11	    | decreases(number_of_organizations(sK0,X0_50)) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2633]) ).
2.68/1.11	
2.68/1.11	cnf(c_3775,plain,
2.68/1.11	    ( sK3(sK0,X0_50) = first_movers
2.68/1.11	    | sK3(sK0,X0_50) = efficient_producers
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | decreases(resources(sK0,X0_50)) != iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_3122,c_3131]) ).
2.68/1.11	
2.68/1.11	cnf(c_4541,plain,
2.68/1.11	    ( sK3(sK0,X0_50) = first_movers
2.68/1.11	    | sK3(sK0,X0_50) = efficient_producers
2.68/1.11	    | number_of_organizations(sK0,X0_50) = zero
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | constant(resources(sK0,X0_50)) = iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_4415,c_3775]) ).
2.68/1.11	
2.68/1.11	cnf(c_3,plain,
2.68/1.11	    ( ~ in_environment(X0,X1)
2.68/1.11	    | ~ constant(resources(X0,X1))
2.68/1.11	    | constant(number_of_organizations(X0,X1))
2.68/1.11	    | ~ environment(X0) ),
2.68/1.11	    inference(cnf_transformation,[],[f63]) ).
2.68/1.11	
2.68/1.11	cnf(c_840,plain,
2.68/1.11	    ( ~ in_environment(X0,X1)
2.68/1.11	    | ~ constant(resources(X0,X1))
2.68/1.11	    | constant(number_of_organizations(X0,X1))
2.68/1.11	    | sK0 != X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_3,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_841,plain,
2.68/1.11	    ( ~ in_environment(sK0,X0)
2.68/1.11	    | ~ constant(resources(sK0,X0))
2.68/1.11	    | constant(number_of_organizations(sK0,X0)) ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_840]) ).
2.68/1.11	
2.68/1.11	cnf(c_2632,plain,
2.68/1.11	    ( ~ in_environment(sK0,X0_50)
2.68/1.11	    | ~ constant(resources(sK0,X0_50))
2.68/1.11	    | constant(number_of_organizations(sK0,X0_50)) ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_841]) ).
2.68/1.11	
2.68/1.11	cnf(c_2703,plain,
2.68/1.11	    ( in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | constant(resources(sK0,X0_50)) != iProver_top
2.68/1.11	    | constant(number_of_organizations(sK0,X0_50)) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2632]) ).
2.68/1.11	
2.68/1.11	cnf(c_17,plain,
2.68/1.11	    ( ~ decreases(X0) | ~ constant(X0) ),
2.68/1.11	    inference(cnf_transformation,[],[f76]) ).
2.68/1.11	
2.68/1.11	cnf(c_2644,plain,
2.68/1.11	    ( ~ decreases(X0_50) | ~ constant(X0_50) ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_17]) ).
2.68/1.11	
2.68/1.11	cnf(c_3120,plain,
2.68/1.11	    ( decreases(X0_50) != iProver_top
2.68/1.11	    | constant(X0_50) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2644]) ).
2.68/1.11	
2.68/1.11	cnf(c_3776,plain,
2.68/1.11	    ( sK3(sK0,X0_50) = first_movers
2.68/1.11	    | sK3(sK0,X0_50) = efficient_producers
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | constant(number_of_organizations(sK0,X0_50)) != iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_3122,c_3120]) ).
2.68/1.11	
2.68/1.11	cnf(c_4557,plain,
2.68/1.11	    ( in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | number_of_organizations(sK0,X0_50) = zero
2.68/1.11	    | sK3(sK0,X0_50) = efficient_producers
2.68/1.11	    | sK3(sK0,X0_50) = first_movers ),
2.68/1.11	    inference(global_propositional_subsumption,
2.68/1.11	              [status(thm)],
2.68/1.11	              [c_4541,c_2703,c_3776]) ).
2.68/1.11	
2.68/1.11	cnf(c_4558,plain,
2.68/1.11	    ( sK3(sK0,X0_50) = first_movers
2.68/1.11	    | sK3(sK0,X0_50) = efficient_producers
2.68/1.11	    | number_of_organizations(sK0,X0_50) = zero
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top ),
2.68/1.11	    inference(renaming,[status(thm)],[c_4557]) ).
2.68/1.11	
2.68/1.11	cnf(c_4568,plain,
2.68/1.11	    ( sK3(sK0,sK2(sK0,sK1)) = first_movers
2.68/1.11	    | sK3(sK0,sK2(sK0,sK1)) = efficient_producers
2.68/1.11	    | number_of_organizations(sK0,sK2(sK0,sK1)) = zero ),
2.68/1.11	    inference(superposition,[status(thm)],[c_4117,c_4558]) ).
2.68/1.11	
2.68/1.11	cnf(c_13,plain,
2.68/1.11	    ( ~ greater_or_equal(X0,appear(efficient_producers,X1))
2.68/1.11	    | greater(zero,growth_rate(efficient_producers,sK2(X1,X0)))
2.68/1.11	    | ~ environment(X1)
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) != zero ),
2.68/1.11	    inference(cnf_transformation,[],[f69]) ).
2.68/1.11	
2.68/1.11	cnf(c_916,plain,
2.68/1.11	    ( ~ greater_or_equal(X0,appear(efficient_producers,X1))
2.68/1.11	    | greater(zero,growth_rate(efficient_producers,sK2(X1,X0)))
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) != zero
2.68/1.11	    | sK0 != X1 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_13,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_917,plain,
2.68/1.11	    ( ~ greater_or_equal(X0,appear(efficient_producers,sK0))
2.68/1.11	    | greater(zero,growth_rate(efficient_producers,sK2(sK0,X0)))
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) != zero ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_916]) ).
2.68/1.11	
2.68/1.11	cnf(c_1115,plain,
2.68/1.11	    ( greater(zero,growth_rate(efficient_producers,sK2(sK0,X0)))
2.68/1.11	    | appear(efficient_producers,sK0) != appear(efficient_producers,sK0)
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) != zero
2.68/1.11	    | sK1 != X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_8,c_917]) ).
2.68/1.11	
2.68/1.11	cnf(c_1116,plain,
2.68/1.11	    ( greater(zero,growth_rate(efficient_producers,sK2(sK0,sK1)))
2.68/1.11	    | cardinality_at_time(efficient_producers,sK1) != zero ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_1115]) ).
2.68/1.11	
2.68/1.11	cnf(c_0,plain,
2.68/1.11	    ( subpopulation(efficient_producers,X0,X1)
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | ~ environment(X0) ),
2.68/1.11	    inference(cnf_transformation,[],[f60]) ).
2.68/1.11	
2.68/1.11	cnf(c_19,plain,
2.68/1.11	    ( ~ subpopulation(X0,X1,X2)
2.68/1.11	    | ~ in_environment(X1,X2)
2.68/1.11	    | ~ environment(X1)
2.68/1.11	    | cardinality_at_time(X0,X2) = zero
2.68/1.11	    | number_of_organizations(X1,X2) != zero ),
2.68/1.11	    inference(cnf_transformation,[],[f78]) ).
2.68/1.11	
2.68/1.11	cnf(c_301,plain,
2.68/1.11	    ( ~ in_environment(X0,X1)
2.68/1.11	    | ~ in_environment(X2,X3)
2.68/1.11	    | ~ environment(X0)
2.68/1.11	    | ~ environment(X2)
2.68/1.11	    | X2 != X0
2.68/1.11	    | X3 != X1
2.68/1.11	    | cardinality_at_time(X4,X3) = zero
2.68/1.11	    | number_of_organizations(X2,X3) != zero
2.68/1.11	    | efficient_producers != X4 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_0,c_19]) ).
2.68/1.11	
2.68/1.11	cnf(c_302,plain,
2.68/1.11	    ( ~ in_environment(X0,X1)
2.68/1.11	    | ~ environment(X0)
2.68/1.11	    | cardinality_at_time(efficient_producers,X1) = zero
2.68/1.11	    | number_of_organizations(X0,X1) != zero ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_301]) ).
2.68/1.11	
2.68/1.11	cnf(c_729,plain,
2.68/1.11	    ( ~ in_environment(X0,X1)
2.68/1.11	    | cardinality_at_time(efficient_producers,X1) = zero
2.68/1.11	    | number_of_organizations(X0,X1) != zero
2.68/1.11	    | sK0 != X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_302,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_730,plain,
2.68/1.11	    ( ~ in_environment(sK0,X0)
2.68/1.11	    | cardinality_at_time(efficient_producers,X0) = zero
2.68/1.11	    | number_of_organizations(sK0,X0) != zero ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_729]) ).
2.68/1.11	
2.68/1.11	cnf(c_2639,plain,
2.68/1.11	    ( ~ in_environment(sK0,X0_50)
2.68/1.11	    | cardinality_at_time(efficient_producers,X0_50) = zero
2.68/1.11	    | number_of_organizations(sK0,X0_50) != zero ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_730]) ).
2.68/1.11	
2.68/1.11	cnf(c_3447,plain,
2.68/1.11	    ( ~ in_environment(sK0,sK2(sK0,sK1))
2.68/1.11	    | cardinality_at_time(efficient_producers,sK2(sK0,sK1)) = zero
2.68/1.11	    | number_of_organizations(sK0,sK2(sK0,sK1)) != zero ),
2.68/1.11	    inference(instantiation,[status(thm)],[c_2639]) ).
2.68/1.11	
2.68/1.11	cnf(c_14,plain,
2.68/1.11	    ( ~ greater(zero,growth_rate(X0,X1))
2.68/1.11	    | cardinality_at_time(X0,X1) != zero ),
2.68/1.11	    inference(cnf_transformation,[],[f73]) ).
2.68/1.11	
2.68/1.11	cnf(c_2645,plain,
2.68/1.11	    ( ~ greater(zero,growth_rate(X0_51,X0_50))
2.68/1.11	    | cardinality_at_time(X0_51,X0_50) != zero ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_14]) ).
2.68/1.11	
2.68/1.11	cnf(c_3489,plain,
2.68/1.11	    ( ~ greater(zero,growth_rate(efficient_producers,sK2(sK0,sK1)))
2.68/1.11	    | cardinality_at_time(efficient_producers,sK2(sK0,sK1)) != zero ),
2.68/1.11	    inference(instantiation,[status(thm)],[c_2645]) ).
2.68/1.11	
2.68/1.11	cnf(c_4765,plain,
2.68/1.11	    ( sK3(sK0,sK2(sK0,sK1)) = efficient_producers
2.68/1.11	    | sK3(sK0,sK2(sK0,sK1)) = first_movers ),
2.68/1.11	    inference(global_propositional_subsumption,
2.68/1.11	              [status(thm)],
2.68/1.11	              [c_4568,c_6,c_1096,c_1116,c_1243,c_3447,c_3489]) ).
2.68/1.11	
2.68/1.11	cnf(c_4766,plain,
2.68/1.11	    ( sK3(sK0,sK2(sK0,sK1)) = first_movers
2.68/1.11	    | sK3(sK0,sK2(sK0,sK1)) = efficient_producers ),
2.68/1.11	    inference(renaming,[status(thm)],[c_4765]) ).
2.68/1.11	
2.68/1.11	cnf(c_759,plain,
2.68/1.11	    ( greater(cardinality_at_time(sK3(X0,X1),X1),zero)
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | decreases(number_of_organizations(X0,X1))
2.68/1.11	    | sK0 != X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_22,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_760,plain,
2.68/1.11	    ( greater(cardinality_at_time(sK3(sK0,X0),X0),zero)
2.68/1.11	    | ~ in_environment(sK0,X0)
2.68/1.11	    | decreases(number_of_organizations(sK0,X0)) ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_759]) ).
2.68/1.11	
2.68/1.11	cnf(c_2637,plain,
2.68/1.11	    ( greater(cardinality_at_time(sK3(sK0,X0_50),X0_50),zero)
2.68/1.11	    | ~ in_environment(sK0,X0_50)
2.68/1.11	    | decreases(number_of_organizations(sK0,X0_50)) ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_760]) ).
2.68/1.11	
2.68/1.11	cnf(c_3127,plain,
2.68/1.11	    ( greater(cardinality_at_time(sK3(sK0,X0_50),X0_50),zero) = iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | decreases(number_of_organizations(sK0,X0_50)) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2637]) ).
2.68/1.11	
2.68/1.11	cnf(c_4769,plain,
2.68/1.11	    ( sK3(sK0,sK2(sK0,sK1)) = efficient_producers
2.68/1.11	    | greater(cardinality_at_time(first_movers,sK2(sK0,sK1)),zero) = iProver_top
2.68/1.11	    | in_environment(sK0,sK2(sK0,sK1)) != iProver_top
2.68/1.11	    | decreases(number_of_organizations(sK0,sK2(sK0,sK1))) = iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_4766,c_3127]) ).
2.68/1.11	
2.68/1.11	cnf(c_3452,plain,
2.68/1.11	    ( ~ greater_or_equal(sK2(sK0,sK1),appear(an_organisation,sK0))
2.68/1.11	    | greater(number_of_organizations(sK0,sK2(sK0,sK1)),zero)
2.68/1.11	    | ~ in_environment(sK0,sK2(sK0,sK1)) ),
2.68/1.11	    inference(instantiation,[status(thm)],[c_2629]) ).
2.68/1.11	
2.68/1.11	cnf(c_3456,plain,
2.68/1.11	    ( greater_or_equal(sK2(sK0,sK1),appear(an_organisation,sK0)) != iProver_top
2.68/1.11	    | greater(number_of_organizations(sK0,sK2(sK0,sK1)),zero) = iProver_top
2.68/1.11	    | in_environment(sK0,sK2(sK0,sK1)) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_3452]) ).
2.68/1.11	
2.68/1.11	cnf(c_3451,plain,
2.68/1.11	    ( greater_or_equal(sK2(sK0,sK1),appear(an_organisation,sK0))
2.68/1.11	    | greater(appear(an_organisation,sK0),sK2(sK0,sK1))
2.68/1.11	    | ~ in_environment(sK0,sK2(sK0,sK1)) ),
2.68/1.11	    inference(instantiation,[status(thm)],[c_2630]) ).
2.68/1.11	
2.68/1.11	cnf(c_3458,plain,
2.68/1.11	    ( greater_or_equal(sK2(sK0,sK1),appear(an_organisation,sK0)) = iProver_top
2.68/1.11	    | greater(appear(an_organisation,sK0),sK2(sK0,sK1)) = iProver_top
2.68/1.11	    | in_environment(sK0,sK2(sK0,sK1)) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_3451]) ).
2.68/1.11	
2.68/1.11	cnf(c_3450,plain,
2.68/1.11	    ( ~ in_environment(sK0,sK2(sK0,sK1))
2.68/1.11	    | ~ constant(resources(sK0,sK2(sK0,sK1)))
2.68/1.11	    | constant(number_of_organizations(sK0,sK2(sK0,sK1))) ),
2.68/1.11	    inference(instantiation,[status(thm)],[c_2632]) ).
2.68/1.11	
2.68/1.11	cnf(c_3460,plain,
2.68/1.11	    ( in_environment(sK0,sK2(sK0,sK1)) != iProver_top
2.68/1.11	    | constant(resources(sK0,sK2(sK0,sK1))) != iProver_top
2.68/1.11	    | constant(number_of_organizations(sK0,sK2(sK0,sK1))) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_3450]) ).
2.68/1.11	
2.68/1.11	cnf(c_3449,plain,
2.68/1.11	    ( ~ in_environment(sK0,sK2(sK0,sK1))
2.68/1.11	    | ~ decreases(resources(sK0,sK2(sK0,sK1)))
2.68/1.11	    | ~ decreases(number_of_organizations(sK0,sK2(sK0,sK1))) ),
2.68/1.11	    inference(instantiation,[status(thm)],[c_2633]) ).
2.68/1.11	
2.68/1.11	cnf(c_3462,plain,
2.68/1.11	    ( in_environment(sK0,sK2(sK0,sK1)) != iProver_top
2.68/1.11	    | decreases(resources(sK0,sK2(sK0,sK1))) != iProver_top
2.68/1.11	    | decreases(number_of_organizations(sK0,sK2(sK0,sK1))) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_3449]) ).
2.68/1.11	
2.68/1.11	cnf(c_3448,plain,
2.68/1.11	    ( ~ greater(appear(an_organisation,sK0),sK2(sK0,sK1))
2.68/1.11	    | ~ in_environment(sK0,sK2(sK0,sK1))
2.68/1.11	    | number_of_organizations(sK0,sK2(sK0,sK1)) = zero ),
2.68/1.11	    inference(instantiation,[status(thm)],[c_2636]) ).
2.68/1.11	
2.68/1.11	cnf(c_3464,plain,
2.68/1.11	    ( number_of_organizations(sK0,sK2(sK0,sK1)) = zero
2.68/1.11	    | greater(appear(an_organisation,sK0),sK2(sK0,sK1)) != iProver_top
2.68/1.11	    | in_environment(sK0,sK2(sK0,sK1)) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_3448]) ).
2.68/1.11	
2.68/1.11	cnf(c_3445,plain,
2.68/1.11	    ( ~ greater(number_of_organizations(sK0,sK2(sK0,sK1)),zero)
2.68/1.11	    | greater(equilibrium(sK0),sK2(sK0,sK1))
2.68/1.11	    | ~ in_environment(sK0,sK2(sK0,sK1))
2.68/1.11	    | constant(resources(sK0,sK2(sK0,sK1))) ),
2.68/1.11	    inference(instantiation,[status(thm)],[c_2634]) ).
2.68/1.11	
2.68/1.11	cnf(c_3470,plain,
2.68/1.11	    ( greater(number_of_organizations(sK0,sK2(sK0,sK1)),zero) != iProver_top
2.68/1.11	    | greater(equilibrium(sK0),sK2(sK0,sK1)) = iProver_top
2.68/1.11	    | in_environment(sK0,sK2(sK0,sK1)) != iProver_top
2.68/1.11	    | constant(resources(sK0,sK2(sK0,sK1))) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_3445]) ).
2.68/1.11	
2.68/1.11	cnf(c_3444,plain,
2.68/1.11	    ( ~ greater(number_of_organizations(sK0,sK2(sK0,sK1)),zero)
2.68/1.11	    | ~ greater(equilibrium(sK0),sK2(sK0,sK1))
2.68/1.11	    | ~ in_environment(sK0,sK2(sK0,sK1))
2.68/1.11	    | decreases(resources(sK0,sK2(sK0,sK1))) ),
2.68/1.11	    inference(instantiation,[status(thm)],[c_2635]) ).
2.68/1.11	
2.68/1.11	cnf(c_3472,plain,
2.68/1.11	    ( greater(number_of_organizations(sK0,sK2(sK0,sK1)),zero) != iProver_top
2.68/1.11	    | greater(equilibrium(sK0),sK2(sK0,sK1)) != iProver_top
2.68/1.11	    | in_environment(sK0,sK2(sK0,sK1)) != iProver_top
2.68/1.11	    | decreases(resources(sK0,sK2(sK0,sK1))) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_3444]) ).
2.68/1.11	
2.68/1.11	cnf(c_3596,plain,
2.68/1.11	    ( ~ decreases(number_of_organizations(sK0,sK2(sK0,sK1)))
2.68/1.11	    | ~ constant(number_of_organizations(sK0,sK2(sK0,sK1))) ),
2.68/1.11	    inference(instantiation,[status(thm)],[c_2644]) ).
2.68/1.11	
2.68/1.11	cnf(c_3597,plain,
2.68/1.11	    ( decreases(number_of_organizations(sK0,sK2(sK0,sK1))) != iProver_top
2.68/1.11	    | constant(number_of_organizations(sK0,sK2(sK0,sK1))) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_3596]) ).
2.68/1.11	
2.68/1.11	cnf(c_2627,plain,
2.68/1.11	    ( ~ greater_or_equal(X0_50,appear(efficient_producers,sK0))
2.68/1.11	    | greater(zero,growth_rate(efficient_producers,sK2(sK0,X0_50)))
2.68/1.11	    | cardinality_at_time(efficient_producers,X0_50) != zero ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_917]) ).
2.68/1.11	
2.68/1.11	cnf(c_3137,plain,
2.68/1.11	    ( cardinality_at_time(efficient_producers,X0_50) != zero
2.68/1.11	    | greater_or_equal(X0_50,appear(efficient_producers,sK0)) != iProver_top
2.68/1.11	    | greater(zero,growth_rate(efficient_producers,sK2(sK0,X0_50))) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2627]) ).
2.68/1.11	
2.68/1.11	cnf(c_3732,plain,
2.68/1.11	    ( greater_or_equal(sK1,appear(efficient_producers,sK0)) != iProver_top
2.68/1.11	    | greater(zero,growth_rate(efficient_producers,sK2(sK0,sK1))) = iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_3617,c_3137]) ).
2.68/1.11	
2.68/1.11	cnf(c_1117,plain,
2.68/1.11	    ( cardinality_at_time(efficient_producers,sK1) != zero
2.68/1.11	    | greater(zero,growth_rate(efficient_producers,sK2(sK0,sK1))) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_1116]) ).
2.68/1.11	
2.68/1.11	cnf(c_4123,plain,
2.68/1.11	    ( greater(zero,growth_rate(efficient_producers,sK2(sK0,sK1))) = iProver_top ),
2.68/1.11	    inference(global_propositional_subsumption,
2.68/1.11	              [status(thm)],
2.68/1.11	              [c_3732,c_6,c_1117,c_1243]) ).
2.68/1.11	
2.68/1.11	cnf(c_26,plain,
2.68/1.11	    ( greater(resilience(efficient_producers),resilience(first_movers)) ),
2.68/1.11	    inference(cnf_transformation,[],[f85]) ).
2.68/1.11	
2.68/1.11	cnf(c_2643,plain,
2.68/1.11	    ( greater(resilience(efficient_producers),resilience(first_movers)) ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_26]) ).
2.68/1.11	
2.68/1.11	cnf(c_3121,plain,
2.68/1.11	    ( greater(resilience(efficient_producers),resilience(first_movers)) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2643]) ).
2.68/1.11	
2.68/1.11	cnf(c_2,plain,
2.68/1.11	    ( ~ greater(resilience(X0),resilience(X1))
2.68/1.11	    | ~ greater(zero,growth_rate(X0,X2))
2.68/1.11	    | greater(zero,growth_rate(X1,X2))
2.68/1.11	    | ~ in_environment(X3,X2)
2.68/1.11	    | ~ environment(X3) ),
2.68/1.11	    inference(cnf_transformation,[],[f61]) ).
2.68/1.11	
2.68/1.11	cnf(c_855,plain,
2.68/1.11	    ( ~ greater(resilience(X0),resilience(X1))
2.68/1.11	    | ~ greater(zero,growth_rate(X0,X2))
2.68/1.11	    | greater(zero,growth_rate(X1,X2))
2.68/1.11	    | ~ in_environment(X3,X2)
2.68/1.11	    | sK0 != X3 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_2,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_856,plain,
2.68/1.11	    ( ~ greater(resilience(X0),resilience(X1))
2.68/1.11	    | ~ greater(zero,growth_rate(X0,X2))
2.68/1.11	    | greater(zero,growth_rate(X1,X2))
2.68/1.11	    | ~ in_environment(sK0,X2) ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_855]) ).
2.68/1.11	
2.68/1.11	cnf(c_2631,plain,
2.68/1.11	    ( ~ greater(resilience(X0_51),resilience(X1_51))
2.68/1.11	    | ~ greater(zero,growth_rate(X0_51,X0_50))
2.68/1.11	    | greater(zero,growth_rate(X1_51,X0_50))
2.68/1.11	    | ~ in_environment(sK0,X0_50) ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_856]) ).
2.68/1.11	
2.68/1.11	cnf(c_3133,plain,
2.68/1.11	    ( greater(resilience(X0_51),resilience(X1_51)) != iProver_top
2.68/1.11	    | greater(zero,growth_rate(X0_51,X0_50)) != iProver_top
2.68/1.11	    | greater(zero,growth_rate(X1_51,X0_50)) = iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2631]) ).
2.68/1.11	
2.68/1.11	cnf(c_3962,plain,
2.68/1.11	    ( greater(zero,growth_rate(first_movers,X0_50)) = iProver_top
2.68/1.11	    | greater(zero,growth_rate(efficient_producers,X0_50)) != iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_3121,c_3133]) ).
2.68/1.11	
2.68/1.11	cnf(c_4208,plain,
2.68/1.11	    ( greater(zero,growth_rate(first_movers,sK2(sK0,sK1))) = iProver_top
2.68/1.11	    | in_environment(sK0,sK2(sK0,sK1)) != iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_4123,c_3962]) ).
2.68/1.11	
2.68/1.11	cnf(c_23,plain,
2.68/1.11	    ( ~ greater(zero,growth_rate(sK3(X0,X1),X1))
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | decreases(number_of_organizations(X0,X1))
2.68/1.11	    | ~ environment(X0) ),
2.68/1.11	    inference(cnf_transformation,[],[f82]) ).
2.68/1.11	
2.68/1.11	cnf(c_744,plain,
2.68/1.11	    ( ~ greater(zero,growth_rate(sK3(X0,X1),X1))
2.68/1.11	    | ~ in_environment(X0,X1)
2.68/1.11	    | decreases(number_of_organizations(X0,X1))
2.68/1.11	    | sK0 != X0 ),
2.68/1.11	    inference(resolution_lifted,[status(thm)],[c_23,c_9]) ).
2.68/1.11	
2.68/1.11	cnf(c_745,plain,
2.68/1.11	    ( ~ greater(zero,growth_rate(sK3(sK0,X0),X0))
2.68/1.11	    | ~ in_environment(sK0,X0)
2.68/1.11	    | decreases(number_of_organizations(sK0,X0)) ),
2.68/1.11	    inference(unflattening,[status(thm)],[c_744]) ).
2.68/1.11	
2.68/1.11	cnf(c_2638,plain,
2.68/1.11	    ( ~ greater(zero,growth_rate(sK3(sK0,X0_50),X0_50))
2.68/1.11	    | ~ in_environment(sK0,X0_50)
2.68/1.11	    | decreases(number_of_organizations(sK0,X0_50)) ),
2.68/1.11	    inference(subtyping,[status(esa)],[c_745]) ).
2.68/1.11	
2.68/1.11	cnf(c_3126,plain,
2.68/1.11	    ( greater(zero,growth_rate(sK3(sK0,X0_50),X0_50)) != iProver_top
2.68/1.11	    | in_environment(sK0,X0_50) != iProver_top
2.68/1.11	    | decreases(number_of_organizations(sK0,X0_50)) = iProver_top ),
2.68/1.11	    inference(predicate_to_equality,[status(thm)],[c_2638]) ).
2.68/1.11	
2.68/1.11	cnf(c_4770,plain,
2.68/1.11	    ( sK3(sK0,sK2(sK0,sK1)) = efficient_producers
2.68/1.11	    | greater(zero,growth_rate(first_movers,sK2(sK0,sK1))) != iProver_top
2.68/1.11	    | in_environment(sK0,sK2(sK0,sK1)) != iProver_top
2.68/1.11	    | decreases(number_of_organizations(sK0,sK2(sK0,sK1))) = iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_4766,c_3126]) ).
2.68/1.11	
2.68/1.11	cnf(c_4863,plain,
2.68/1.11	    ( sK3(sK0,sK2(sK0,sK1)) = efficient_producers ),
2.68/1.11	    inference(global_propositional_subsumption,
2.68/1.11	              [status(thm)],
2.68/1.11	              [c_4769,c_6,c_1096,c_1097,c_1116,c_1243,c_3456,c_3458,
2.68/1.11	               c_3460,c_3462,c_3464,c_3447,c_3470,c_3472,c_3489,c_3597,
2.68/1.11	               c_4208,c_4770]) ).
2.68/1.11	
2.68/1.11	cnf(c_4868,plain,
2.68/1.11	    ( greater(zero,growth_rate(efficient_producers,sK2(sK0,sK1))) != iProver_top
2.68/1.11	    | in_environment(sK0,sK2(sK0,sK1)) != iProver_top
2.68/1.11	    | decreases(number_of_organizations(sK0,sK2(sK0,sK1))) = iProver_top ),
2.68/1.11	    inference(superposition,[status(thm)],[c_4863,c_3126]) ).
2.68/1.11	
2.68/1.11	cnf(contradiction,plain,
2.68/1.11	    ( $false ),
2.68/1.11	    inference(minisat,
2.68/1.11	              [status(thm)],
2.68/1.11	              [c_4868,c_3597,c_3489,c_3472,c_3470,c_3447,c_3464,c_3462,
2.68/1.11	               c_3460,c_3458,c_3456,c_1243,c_1117,c_1116,c_1097,c_1096,
2.68/1.11	               c_6]) ).
2.68/1.11	
2.68/1.11	
2.68/1.11	% SZS output end CNFRefutation for theBenchmark.p
2.68/1.11	
2.68/1.11	------                               Statistics
2.68/1.11	
2.68/1.11	------ General
2.68/1.11	
2.68/1.11	abstr_ref_over_cycles:                  0
2.68/1.11	abstr_ref_under_cycles:                 0
2.68/1.11	gc_basic_clause_elim:                   0
2.68/1.11	forced_gc_time:                         0
2.68/1.11	parsing_time:                           0.011
2.68/1.11	unif_index_cands_time:                  0.
2.68/1.11	unif_index_add_time:                    0.
2.68/1.11	orderings_time:                         0.
2.68/1.11	out_proof_time:                         0.022
2.68/1.11	total_time:                             0.213
2.68/1.11	num_of_symbols:                         53
2.68/1.11	num_of_terms:                           2639
2.68/1.11	
2.68/1.11	------ Preprocessing
2.68/1.11	
2.68/1.11	num_of_splits:                          0
2.68/1.11	num_of_split_atoms:                     0
2.68/1.11	num_of_reused_defs:                     0
2.68/1.11	num_eq_ax_congr_red:                    26
2.68/1.11	num_of_sem_filtered_clauses:            1
2.68/1.11	num_of_subtypes:                        3
2.68/1.11	monotx_restored_types:                  0
2.68/1.11	sat_num_of_epr_types:                   0
2.68/1.11	sat_num_of_non_cyclic_types:            0
2.68/1.11	sat_guarded_non_collapsed_types:        0
2.68/1.11	num_pure_diseq_elim:                    0
2.68/1.11	simp_replaced_by:                       0
2.68/1.11	res_preprocessed:                       129
2.68/1.11	prep_upred:                             0
2.68/1.11	prep_unflattend:                        124
2.68/1.11	smt_new_axioms:                         0
2.68/1.11	pred_elim_cands:                        5
2.68/1.11	pred_elim:                              2
2.68/1.11	pred_elim_cl:                           2
2.68/1.11	pred_elim_cycles:                       7
2.68/1.11	merged_defs:                            0
2.68/1.11	merged_defs_ncl:                        0
2.68/1.11	bin_hyper_res:                          0
2.68/1.11	prep_cycles:                            4
2.68/1.11	pred_elim_time:                         0.055
2.68/1.11	splitting_time:                         0.
2.68/1.11	sem_filter_time:                        0.
2.68/1.11	monotx_time:                            0.
2.68/1.11	subtype_inf_time:                       0.
2.68/1.11	
2.68/1.11	------ Problem properties
2.68/1.11	
2.68/1.11	clauses:                                25
2.68/1.11	conjectures:                            3
2.68/1.11	epr:                                    2
2.68/1.11	horn:                                   19
2.68/1.11	ground:                                 4
2.68/1.11	unary:                                  4
2.68/1.11	binary:                                 2
2.68/1.11	lits:                                   70
2.68/1.11	lits_eq:                                15
2.68/1.11	fd_pure:                                0
2.68/1.11	fd_pseudo:                              0
2.68/1.11	fd_cond:                                0
2.68/1.11	fd_pseudo_cond:                         0
2.68/1.11	ac_symbols:                             0
2.68/1.11	
2.68/1.11	------ Propositional Solver
2.68/1.11	
2.68/1.11	prop_solver_calls:                      26
2.68/1.11	prop_fast_solver_calls:                 1323
2.68/1.11	smt_solver_calls:                       0
2.68/1.11	smt_fast_solver_calls:                  0
2.68/1.11	prop_num_of_clauses:                    1019
2.68/1.11	prop_preprocess_simplified:             5002
2.68/1.11	prop_fo_subsumed:                       24
2.68/1.11	prop_solver_time:                       0.
2.68/1.11	smt_solver_time:                        0.
2.68/1.11	smt_fast_solver_time:                   0.
2.68/1.11	prop_fast_solver_time:                  0.
2.68/1.11	prop_unsat_core_time:                   0.
2.68/1.11	
2.68/1.11	------ QBF
2.68/1.11	
2.68/1.11	qbf_q_res:                              0
2.68/1.11	qbf_num_tautologies:                    0
2.68/1.11	qbf_prep_cycles:                        0
2.68/1.11	
2.68/1.11	------ BMC1
2.68/1.11	
2.68/1.11	bmc1_current_bound:                     -1
2.68/1.11	bmc1_last_solved_bound:                 -1
2.68/1.11	bmc1_unsat_core_size:                   -1
2.68/1.11	bmc1_unsat_core_parents_size:           -1
2.68/1.11	bmc1_merge_next_fun:                    0
2.68/1.11	bmc1_unsat_core_clauses_time:           0.
2.68/1.11	
2.68/1.11	------ Instantiation
2.68/1.11	
2.68/1.11	inst_num_of_clauses:                    317
2.68/1.11	inst_num_in_passive:                    9
2.68/1.11	inst_num_in_active:                     229
2.68/1.11	inst_num_in_unprocessed:                79
2.68/1.11	inst_num_of_loops:                      250
2.68/1.11	inst_num_of_learning_restarts:          0
2.68/1.11	inst_num_moves_active_passive:          18
2.68/1.11	inst_lit_activity:                      0
2.68/1.11	inst_lit_activity_moves:                0
2.68/1.11	inst_num_tautologies:                   0
2.68/1.11	inst_num_prop_implied:                  0
2.68/1.11	inst_num_existing_simplified:           0
2.68/1.11	inst_num_eq_res_simplified:             0
2.68/1.11	inst_num_child_elim:                    0
2.68/1.11	inst_num_of_dismatching_blockings:      41
2.68/1.11	inst_num_of_non_proper_insts:           291
2.68/1.11	inst_num_of_duplicates:                 0
2.68/1.11	inst_inst_num_from_inst_to_res:         0
2.68/1.11	inst_dismatching_checking_time:         0.
2.68/1.11	
2.68/1.11	------ Resolution
2.68/1.11	
2.68/1.11	res_num_of_clauses:                     0
2.68/1.11	res_num_in_passive:                     0
2.68/1.11	res_num_in_active:                      0
2.68/1.11	res_num_of_loops:                       133
2.68/1.11	res_forward_subset_subsumed:            40
2.68/1.11	res_backward_subset_subsumed:           0
2.68/1.11	res_forward_subsumed:                   0
2.68/1.11	res_backward_subsumed:                  0
2.68/1.11	res_forward_subsumption_resolution:     0
2.68/1.11	res_backward_subsumption_resolution:    0
2.68/1.11	res_clause_to_clause_subsumption:       96
2.68/1.11	res_orphan_elimination:                 0
2.68/1.11	res_tautology_del:                      68
2.68/1.11	res_num_eq_res_simplified:              0
2.68/1.11	res_num_sel_changes:                    0
2.68/1.11	res_moves_from_active_to_pass:          0
2.68/1.11	
2.68/1.11	------ Superposition
2.68/1.11	
2.68/1.11	sup_time_total:                         0.
2.68/1.11	sup_time_generating:                    0.
2.68/1.11	sup_time_sim_full:                      0.
2.68/1.11	sup_time_sim_immed:                     0.
2.68/1.11	
2.68/1.11	sup_num_of_clauses:                     50
2.68/1.11	sup_num_in_active:                      47
2.68/1.11	sup_num_in_passive:                     3
2.68/1.11	sup_num_of_loops:                       48
2.68/1.11	sup_fw_superposition:                   9
2.68/1.11	sup_bw_superposition:                   21
2.68/1.11	sup_immediate_simplified:               1
2.68/1.11	sup_given_eliminated:                   0
2.68/1.11	comparisons_done:                       0
2.68/1.11	comparisons_avoided:                    9
2.68/1.11	
2.68/1.11	------ Simplifications
2.68/1.11	
2.68/1.11	
2.68/1.11	sim_fw_subset_subsumed:                 1
2.68/1.11	sim_bw_subset_subsumed:                 1
2.68/1.11	sim_fw_subsumed:                        0
2.68/1.11	sim_bw_subsumed:                        0
2.68/1.11	sim_fw_subsumption_res:                 0
2.68/1.11	sim_bw_subsumption_res:                 0
2.68/1.11	sim_tautology_del:                      1
2.68/1.11	sim_eq_tautology_del:                   0
2.68/1.11	sim_eq_res_simp:                        0
2.68/1.11	sim_fw_demodulated:                     0
2.68/1.11	sim_bw_demodulated:                     2
2.68/1.11	sim_light_normalised:                   0
2.68/1.11	sim_joinable_taut:                      0
2.68/1.11	sim_joinable_simp:                      0
2.68/1.11	sim_ac_normalised:                      0
2.68/1.11	sim_smt_subsumption:                    0
2.68/1.11	
2.68/1.12	EOF