TSTP Solution File: MGT039+2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT039+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:13:57 EDT 2022
% Result : Unknown 7.10s 7.27s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT039+2 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 9 12:22:33 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.21/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.42 % FOF problem with conjecture
% 0.21/0.42 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8e9c4c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_9b7847.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_b1845f | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.45
% 0.21/0.45 % --bmc1_incremental false
% 0.21/0.45 % --bmc1_axioms reachable_all
% 0.21/0.45 % --bmc1_min_bound 0
% 0.21/0.45 % --bmc1_max_bound -1
% 0.21/0.45 % --bmc1_max_bound_default -1
% 0.21/0.45 % --bmc1_symbol_reachability true
% 0.21/0.45 % --bmc1_property_lemmas false
% 0.21/0.45 % --bmc1_k_induction false
% 0.21/0.45 % --bmc1_non_equiv_states false
% 0.21/0.45 % --bmc1_deadlock false
% 0.21/0.45 % --bmc1_ucm false
% 0.21/0.45 % --bmc1_add_unsat_core none
% 0.21/0.45 % --bmc1_unsat_core_children false
% 0.21/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.45 % --bmc1_out_stat full
% 0.21/0.45 % --bmc1_ground_init false
% 0.21/0.45 % --bmc1_pre_inst_next_state false
% 0.21/0.45 % --bmc1_pre_inst_state false
% 0.21/0.45 % --bmc1_pre_inst_reach_state false
% 0.21/0.45 % --bmc1_out_unsat_core false
% 0.21/0.45 % --bmc1_aig_witness_out false
% 0.21/0.45 % --bmc1_verbose false
% 0.21/0.45 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 0.21/0.45 % --inst_prop_sim_given true
% 0.21/0.45 % --inst_prop_sim_new false
% 0.21/0.45 % --inst_orphan_elimination true
% 0.21/0.45 % --inst_learning_loop_flag true
% 0.21/0.45 % --inst_learning_start 3000
% 0.21/0.45 % --inst_learning_factor 2
% 0.21/0.45 % --inst_start_prop_sim_after_learn 3
% 0.21/0.45 % --inst_sel_renew solver
% 0.21/0.45 % --inst_lit_activity_flag true
% 0.21/0.45 % --inst_out_proof true
% 0.21/0.45
% 0.21/0.45 % ------ Resolution Options
% 0.21/0.45
% 0.21/0.45 % --resolution_flag true
% 0.21/0.45 % --res_lit_sel kbo_max
% 0.21/0.45 % --res_to_prop_solver none
% 0.21/0.45 % --res_prop_simpl_new false
% 0.21/0.45 % --res_prop_simpl_given false
% 0.21/0.45 % --res_passive_queue_type priority_queues
% 0.21/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.45 % --res_passive_queues_freq [15;5]
% 0.21/0.45 % --res_forward_subs full
% 0.21/0.45 % --res_backward_subs full
% 0.21/0.45 % --res_forward_subs_resolution true
% 0.21/0.45 % --res_backward_subs_resolution true
% 0.21/0.45 % --res_orphan_elimination false
% 0.21/0.45 % --res_time_limit 1000.
% 0.21/0.45 % --res_out_proof true
% 0.21/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8e9c4c.s
% 0.21/0.45 % --modulo true
% 0.21/0.45
% 0.21/0.45 % ------ Combination Options
% 0.21/0.45
% 0.21/0.45 % --comb_res_mult 1000
% 0.21/0.45 % --comb_inst_mult 300
% 0.21/0.45 % ------
% 0.21/0.45
% 0.21/0.45 % ------ Parsing...% successful
% 0.21/0.45
% 0.21/0.45 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.21/0.45
% 0.21/0.45 % ------ Proving...
% 0.21/0.45 % ------ Problem Properties
% 0.21/0.45
% 0.21/0.45 %
% 0.21/0.45 % EPR false
% 0.21/0.45 % Horn false
% 0.21/0.45 % Has equality true
% 0.21/0.45
% 0.21/0.45 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % % ------ Current options:
% 0.21/0.45
% 0.21/0.45 % ------ Input Options
% 0.21/0.45
% 0.21/0.45 % --out_options all
% 0.21/0.45 % --tptp_safe_out true
% 0.21/0.45 % --problem_path ""
% 0.21/0.45 % --include_path ""
% 0.21/0.45 % --clausifier .//eprover
% 0.21/0.45 % --clausifier_options --tstp-format
% 0.21/0.45 % --stdin false
% 0.21/0.45 % --dbg_backtrace false
% 0.21/0.45 % --dbg_dump_prop_clauses false
% 0.21/0.45 % --dbg_dump_prop_clauses_file -
% 0.21/0.45 % --dbg_out_stat false
% 0.21/0.45
% 0.21/0.45 % ------ General Options
% 0.21/0.45
% 0.21/0.45 % --fof false
% 0.21/0.45 % --time_out_real 150.
% 0.21/0.45 % --time_out_prep_mult 0.2
% 0.21/0.45 % --time_out_virtual -1.
% 0.21/0.45 % --schedule none
% 0.21/0.45 % --ground_splitting input
% 0.21/0.45 % --splitting_nvd 16
% 0.21/0.45 % --non_eq_to_eq false
% 0.21/0.45 % --prep_gs_sim true
% 0.21/0.45 % --prep_unflatten false
% 0.21/0.45 % --prep_res_sim true
% 0.21/0.45 % --prep_upred true
% 0.21/0.45 % --res_sim_input true
% 0.21/0.45 % --clause_weak_htbl true
% 0.21/0.45 % --gc_record_bc_elim false
% 0.21/0.45 % --symbol_type_check false
% 0.21/0.45 % --clausify_out false
% 0.21/0.45 % --large_theory_mode false
% 0.21/0.45 % --prep_sem_filter none
% 0.21/0.45 % --prep_sem_filter_out false
% 0.21/0.45 % --preprocessed_out false
% 0.21/0.45 % --sub_typing false
% 0.21/0.45 % --brand_transform false
% 0.21/0.45 % --pure_diseq_elim true
% 0.21/0.45 % --min_unsat_core false
% 0.21/0.45 % --pred_elim true
% 0.21/0.45 % --add_important_lit false
% 0.21/0.45 % --soft_assumptions false
% 0.21/0.45 % --reset_solvers false
% 0.21/0.45 % --bc_imp_inh []
% 0.21/0.45 % --conj_cone_tolerance 1.5
% 0.21/0.45 % --prolific_symb_bound 500
% 0.21/0.45 % --lt_threshold 2000
% 0.21/0.45
% 0.21/0.45 % ------ SAT Options
% 0.21/0.45
% 0.21/0.45 % --sat_mode false
% 0.21/0.45 % --sat_fm_restart_options ""
% 0.21/0.45 % --sat_gr_def false
% 0.21/0.45 % --sat_epr_types true
% 0.21/0.45 % --sat_non_cyclic_types false
% 0.21/0.45 % --sat_finite_models false
% 0.21/0.45 % --sat_fm_lemmas false
% 0.21/0.45 % --sat_fm_prep false
% 0.21/0.45 % --sat_fm_uc_incr true
% 0.21/0.45 % --sat_out_model small
% 0.21/0.45 % --sat_out_clauses false
% 0.21/0.45
% 0.21/0.45 % ------ QBF Options
% 0.21/0.45
% 0.21/0.45 % --qbf_mode false
% 0.21/0.45 % --qbf_elim_univ true
% 0.21/0.45 % --qbf_sk_in true
% 0.21/0.45 % --qbf_pred_elim true
% 0.21/0.45 % --qbf_split 32
% 0.21/0.45
% 0.21/0.45 % ------ BMC1 Options
% 0.21/0.45
% 0.21/0.45 % --bmc1_incremental false
% 0.21/0.45 % --bmc1_axioms reachable_all
% 0.21/0.45 % --bmc1_min_bound 0
% 0.21/0.45 % --bmc1_max_bound -1
% 0.21/0.45 % --bmc1_max_bound_default -1
% 0.21/0.45 % --bmc1_symbol_reachability true
% 0.21/0.45 % --bmc1_property_lemmas false
% 0.21/0.45 % --bmc1_k_induction false
% 0.21/0.45 % --bmc1_non_equiv_states false
% 0.21/0.45 % --bmc1_deadlock false
% 0.21/0.45 % --bmc1_ucm false
% 0.21/0.45 % --bmc1_add_unsat_core none
% 0.21/0.45 % --bmc1_unsat_core_children false
% 0.21/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.45 % --bmc1_out_stat full
% 0.21/0.45 % --bmc1_ground_init false
% 0.21/0.45 % --bmc1_pre_inst_next_state false
% 0.21/0.45 % --bmc1_pre_inst_state false
% 0.21/0.45 % --bmc1_pre_inst_reach_state false
% 0.21/0.45 % --bmc1_out_unsat_core false
% 0.21/0.45 % --bmc1_aig_witness_out false
% 0.21/0.45 % --bmc1_verbose false
% 0.21/0.45 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 7.00/7.20 % --inst_prop_sim_given true
% 7.00/7.20 % --inst_prop_sim_new false
% 7.00/7.20 % --inst_orphan_elimination true
% 7.00/7.20 % --inst_learning_loop_flag true
% 7.00/7.20 % --inst_learning_start 3000
% 7.00/7.20 % --inst_learning_factor 2
% 7.00/7.20 % --inst_start_prop_sim_after_learn 3
% 7.00/7.20 % --inst_sel_renew solver
% 7.00/7.20 % --inst_lit_activity_flag true
% 7.00/7.20 % --inst_out_proof true
% 7.00/7.20
% 7.00/7.20 % ------ Resolution Options
% 7.00/7.20
% 7.00/7.20 % --resolution_flag true
% 7.00/7.20 % --res_lit_sel kbo_max
% 7.00/7.20 % --res_to_prop_solver none
% 7.00/7.20 % --res_prop_simpl_new false
% 7.00/7.20 % --res_prop_simpl_given false
% 7.00/7.20 % --res_passive_queue_type priority_queues
% 7.00/7.20 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 7.00/7.20 % --res_passive_queues_freq [15;5]
% 7.00/7.20 % --res_forward_subs full
% 7.00/7.20 % --res_backward_subs full
% 7.00/7.20 % --res_forward_subs_resolution true
% 7.00/7.20 % --res_backward_subs_resolution true
% 7.00/7.20 % --res_orphan_elimination false
% 7.00/7.20 % --res_time_limit 1000.
% 7.00/7.20 % --res_out_proof true
% 7.00/7.20 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8e9c4c.s
% 7.00/7.20 % --modulo true
% 7.00/7.20
% 7.00/7.20 % ------ Combination Options
% 7.00/7.20
% 7.00/7.20 % --comb_res_mult 1000
% 7.00/7.20 % --comb_inst_mult 300
% 7.00/7.20 % ------
% 7.00/7.20
% 7.00/7.20
% 7.00/7.20
% 7.00/7.20 % ------ Proving...
% 7.00/7.20 % warning: shown sat in sat incomplete mode
% 7.00/7.20 %
% 7.00/7.20
% 7.00/7.20
% 7.00/7.20 ------ Building Model...Done
% 7.00/7.20
% 7.00/7.20 %------ The model is defined over ground terms (initial term algebra).
% 7.00/7.20 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 7.00/7.20 %------ where \phi is a formula over the term algebra.
% 7.00/7.20 %------ If we have equality in the problem then it is also defined as a predicate above,
% 7.00/7.20 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 7.00/7.20 %------ See help for --sat_out_model for different model outputs.
% 7.00/7.20 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 7.00/7.20 %------ where the first argument stands for the sort ($i in the unsorted case)
% 7.00/7.20
% 7.00/7.20
% 7.00/7.20
% 7.00/7.20
% 7.00/7.20 %------ Positive definition of equality_sorted
% 7.00/7.20 fof(lit_def,axiom,
% 7.00/7.20 (! [X0,X0,X1] :
% 7.00/7.20 ( equality_sorted(X0,X0,X1) <=>
% 7.00/7.20 (
% 7.00/7.20 (
% 7.00/7.20 ( X0=$i & X0=end_time(sk1_esk1_1(sk3_esk1_0)) & X1=sk2_esk1_2(sk3_esk1_0,sk1_esk1_1(sk3_esk1_0)) )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 |
% 7.00/7.20 (
% 7.00/7.20 ( X0=$i & X0=critical_point(sk1_esk1_1(sk3_esk1_0)) & X1=appear(efficient_producers,sk1_esk1_1(sk3_esk1_0)) )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 |
% 7.00/7.20 (
% 7.00/7.20 ( X0=$i & X0=critical_point(sk1_esk1_1(sk3_esk1_0)) & X1=start_time(sk1_esk1_1(sk3_esk1_0)) )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 ).
% 7.00/7.20
% 7.00/7.20 %------ Positive definition of greater
% 7.00/7.20 fof(lit_def,axiom,
% 7.00/7.20 (! [X0,X1] :
% 7.00/7.20 ( greater(X0,X1) <=>
% 7.00/7.20 (
% 7.00/7.20 (
% 7.00/7.20 ( X0=sk2_esk1_2(sk3_esk1_0,sk1_esk1_1(sk3_esk1_0)) & X1=critical_point(sk1_esk1_1(sk3_esk1_0)) )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 |
% 7.00/7.20 (
% 7.00/7.20 ( X0=cardinality_at_time(first_movers,sk2_esk1_2(sk3_esk1_0,sk1_esk1_1(sk3_esk1_0))) & X1=zero )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 ).
% 7.00/7.20
% 7.00/7.20 %------ Positive definition of slow_change
% 7.00/7.20 fof(lit_def,axiom,
% 7.00/7.20 (! [X0] :
% 7.00/7.20 ( slow_change(X0) <=>
% 7.00/7.20 (
% 7.00/7.20 (
% 7.00/7.20 ( X0=sk3_esk1_0 )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 ).
% 7.00/7.20
% 7.00/7.20 %------ Positive definition of observational_period
% 7.00/7.20 fof(lit_def,axiom,
% 7.00/7.20 (! [X0] :
% 7.00/7.20 ( observational_period(X0) <=>
% 7.00/7.20 (
% 7.00/7.20 (
% 7.00/7.20 ( X0=sk3_esk1_0 )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 ).
% 7.00/7.20
% 7.00/7.20 %------ Positive definition of in_environment
% 7.00/7.20 fof(lit_def,axiom,
% 7.00/7.20 (! [X0,X1] :
% 7.00/7.20 ( in_environment(X0,X1) <=>
% 7.00/7.20 (
% 7.00/7.20 (
% 7.00/7.20 ( X0=sk3_esk1_0 & X1=sk1_esk1_1(sk3_esk1_0) )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 |
% 7.00/7.20 (
% 7.00/7.20 ( X0=sk1_esk1_1(sk3_esk1_0) & X1=sk2_esk1_2(sk3_esk1_0,sk1_esk1_1(sk3_esk1_0)) )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 ).
% 7.00/7.20
% 7.00/7.20 %------ Positive definition of environment
% 7.00/7.20 fof(lit_def,axiom,
% 7.00/7.20 (! [X0] :
% 7.00/7.20 ( environment(X0) <=>
% 7.00/7.20 (
% 7.00/7.20 (
% 7.00/7.20 ( X0=sk1_esk1_1(sk3_esk1_0) )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 ).
% 7.00/7.20
% 7.00/7.20 %------ Negative definition of subpopulation
% 7.00/7.20 fof(lit_def,axiom,
% 7.00/7.20 (! [X0,X1,X2] :
% 7.00/7.20 ( ~(subpopulation(X0,X1,X2)) <=>
% 7.00/7.20 $false
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 ).
% 7.00/7.20
% 7.00/7.20 %------ Negative definition of propagation_strategy
% 7.00/7.20 fof(lit_def,axiom,
% 7.00/7.20 (! [X0] :
% 7.00/7.20 ( ~(propagation_strategy(X0)) <=>
% 7.00/7.20 $false
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 ).
% 7.00/7.20
% 7.00/7.20 %------ Positive definition of greater_or_equal
% 7.00/7.20 fof(lit_def,axiom,
% 7.00/7.20 (! [X0,X1] :
% 7.00/7.20 ( greater_or_equal(X0,X1) <=>
% 7.00/7.20 (
% 7.00/7.20 (
% 7.00/7.20 ( X0=end_time(sk1_esk1_1(sk3_esk1_0)) & X1=sk2_esk1_2(sk3_esk1_0,sk1_esk1_1(sk3_esk1_0)) )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 |
% 7.00/7.20 (
% 7.00/7.20 ( X0=critical_point(sk1_esk1_1(sk3_esk1_0)) & X1=appear(efficient_producers,sk1_esk1_1(sk3_esk1_0)) )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 |
% 7.00/7.20 (
% 7.00/7.20 ( X0=critical_point(sk1_esk1_1(sk3_esk1_0)) & X1=start_time(sk1_esk1_1(sk3_esk1_0)) )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 |
% 7.00/7.20 (
% 7.00/7.20 ( X0=sk2_esk1_2(sk3_esk1_0,sk1_esk1_1(sk3_esk1_0)) & X1=critical_point(sk1_esk1_1(sk3_esk1_0)) )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 |
% 7.00/7.20 (
% 7.00/7.20 ( X0=cardinality_at_time(first_movers,sk2_esk1_2(sk3_esk1_0,sk1_esk1_1(sk3_esk1_0))) & X1=zero )
% 7.00/7.20 )
% 7.00/7.20
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 ).
% 7.00/7.20
% 7.00/7.20 %------ Positive definition of selection_favors
% 7.00/7.20 fof(lit_def,axiom,
% 7.00/7.20 (! [X0,X1,X2] :
% 7.00/7.20 ( selection_favors(X0,X1,X2) <=>
% 7.00/7.20 $false
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 ).
% 7.00/7.20
% 7.00/7.20 %------ Positive definition of subpopulations
% 7.00/7.20 fof(lit_def,axiom,
% 7.00/7.20 (! [X0,X1,X2,X3] :
% 7.00/7.20 ( subpopulations(X0,X1,X2,X3) <=>
% 7.00/7.20 $false
% 7.00/7.20 )
% 7.00/7.20 )
% 7.00/7.20 ).
% 7.00/7.20
% 7.00/7.20
% 7.00/7.20
% 7.00/7.20 % ------ Statistics
% 7.00/7.20
% 7.00/7.20 % ------ General
% 7.00/7.20
% 7.00/7.20 % num_of_input_clauses: 40
% 7.00/7.20 % num_of_input_neg_conjectures: 3
% 7.00/7.20 % num_of_splits: 0
% 7.00/7.20 % num_of_split_atoms: 0
% 7.00/7.20 % num_of_sem_filtered_clauses: 0
% 7.00/7.20 % num_of_subtypes: 0
% 7.00/7.20 % monotx_restored_types: 0
% 7.00/7.20 % sat_num_of_epr_types: 0
% 7.00/7.20 % sat_num_of_non_cyclic_types: 0
% 7.00/7.20 % sat_guarded_non_collapsed_types: 0
% 7.00/7.20 % is_epr: 0
% 7.00/7.20 % is_horn: 0
% 7.00/7.20 % has_eq: 1
% 7.00/7.20 % num_pure_diseq_elim: 0
% 7.00/7.20 % simp_replaced_by: 0
% 7.00/7.20 % res_preprocessed: 9
% 7.00/7.20 % prep_upred: 0
% 7.00/7.20 % prep_unflattend: 0
% 7.00/7.20 % pred_elim_cands: 5
% 7.00/7.20 % pred_elim: 5
% 7.00/7.20 % pred_elim_cl: 3
% 7.00/7.20 % pred_elim_cycles: 5
% 7.00/7.20 % forced_gc_time: 0
% 7.00/7.20 % gc_basic_clause_elim: 0
% 7.00/7.20 % parsing_time: 0.002
% 7.00/7.20 % sem_filter_time: 0.
% 7.00/7.20 % pred_elim_time: 0.
% 7.00/7.20 % out_proof_time: 0.
% 7.00/7.20 % monotx_time: 0.
% 7.00/7.20 % subtype_inf_time: 0.
% 7.00/7.20 % unif_index_cands_time: 0.002
% 7.00/7.20 % unif_index_add_time: 0.005
% 7.00/7.20 % total_time: 6.769
% 7.00/7.20 % num_of_symbols: 47
% 7.00/7.20 % num_of_terms: 2208
% 7.00/7.20
% 7.00/7.20 % ------ Propositional Solver
% 7.00/7.20
% 7.00/7.20 % prop_solver_calls: 7
% 7.00/7.20 % prop_fast_solver_calls: 33
% 7.00/7.20 % prop_num_of_clauses: 119
% 7.00/7.20 % prop_preprocess_simplified: 284
% 7.00/7.20 % prop_fo_subsumed: 0
% 7.00/7.20 % prop_solver_time: 0.
% 7.00/7.20 % prop_fast_solver_time: 0.
% 7.00/7.20 % prop_unsat_core_time: 0.
% 7.00/7.20
% 7.00/7.20 % ------ QBF
% 7.00/7.20
% 7.00/7.20 % qbf_q_res: 0
% 7.00/7.20 % qbf_num_tautologies: 0
% 7.00/7.20 % qbf_prep_cycles: 0
% 7.00/7.20
% 7.00/7.20 % ------ BMC1
% 7.00/7.20
% 7.00/7.20 % bmc1_current_bound: -1
% 7.00/7.20 % bmc1_last_solved_bound: -1
% 7.00/7.20 % bmc1_unsat_core_size: -1
% 7.00/7.20 % bmc1_unsat_core_parents_size: -1
% 7.00/7.20 % bmc1_merge_next_fun: 0
% 7.00/7.20 % bmc1_unsat_core_clauses_time: 0.
% 7.00/7.20
% 7.00/7.20 % ------ Instantiation
% 7.00/7.20
% 7.00/7.20 % inst_num_of_clauses: 86
% 7.00/7.20 % inst_num_in_passive: 0
% 7.00/7.20 % inst_num_in_active: 86
% 7.00/7.20 % inst_num_in_unprocessed: 0
% 7.00/7.20 % inst_num_of_loops: 99
% 7.00/7.20 % inst_num_of_learning_restarts: 0
% 7.00/7.20 % inst_num_moves_active_passive: 4
% 7.00/7.20 % inst_lit_activity: 38
% 7.00/7.20 % inst_lit_activity_moves: 0
% 7.00/7.20 % inst_num_tautologies: 0
% 7.00/7.20 % inst_num_prop_implied: 0
% 7.00/7.20 % inst_num_existing_simplified: 0
% 7.00/7.20 % inst_num_eq_res_simplified: 0
% 7.00/7.20 % inst_num_child_elim: 0
% 7.00/7.20 % inst_num_of_dismatching_blockings: 0
% 7.00/7.20 % inst_num_of_non_proper_insts: 54
% 7.00/7.20 % inst_num_of_duplicates: 12
% 7.00/7.20 % inst_inst_num_from_inst_to_res: 0
% 7.00/7.20 % inst_dismatching_checking_time: 0.
% 7.00/7.20
% 7.00/7.20 % ------ Resolution
% 7.00/7.20
% 7.00/7.20 % res_num_of_clauses: 924
% 7.00/7.20 % res_num_in_passive: 143
% 7.00/7.20 % res_num_in_active: 752
% 7.00/7.20 % res_num_of_loops: 1000
% 7.00/7.20 % res_forward_subset_subsumed: 12
% 7.00/7.20 % res_backward_subset_subsumed: 0
% 7.00/7.20 % res_forward_subsumed: 270
% 7.00/7.20 % res_backward_subsumed: 0
% 7.00/7.20 % res_forward_subsumption_resolution: 273
% 7.00/7.20 % res_backward_subsumption_resolution: 0
% 7.00/7.20 % res_clause_to_clause_subsumption: 28553
% 7.00/7.20 % res_orphan_elimination: 0
% 7.00/7.20 % res_tautology_del: 0
% 7.00/7.20 % res_num_eq_res_simplified: 0
% 7.00/7.20 % res_num_sel_changes: 0
% 7.00/7.20 % res_moves_from_active_to_pass: 0
% 7.00/7.20
% 7.00/7.20 % Status Unknown
% 7.00/7.24 % Orienting using strategy ClausalAll
% 7.00/7.24 % FOF problem with conjecture
% 7.00/7.24 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8e9c4c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_9b7847.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_30a4d4 | grep -v "SZS"
% 7.00/7.26
% 7.00/7.26 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 7.00/7.26
% 7.00/7.26 %
% 7.00/7.26 % ------ iProver source info
% 7.00/7.26
% 7.00/7.26 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 7.00/7.26 % git: non_committed_changes: true
% 7.00/7.26 % git: last_make_outside_of_git: true
% 7.00/7.26
% 7.00/7.26 %
% 7.00/7.26 % ------ Input Options
% 7.00/7.26
% 7.00/7.26 % --out_options all
% 7.00/7.26 % --tptp_safe_out true
% 7.00/7.26 % --problem_path ""
% 7.00/7.26 % --include_path ""
% 7.00/7.26 % --clausifier .//eprover
% 7.00/7.26 % --clausifier_options --tstp-format
% 7.00/7.26 % --stdin false
% 7.00/7.26 % --dbg_backtrace false
% 7.00/7.26 % --dbg_dump_prop_clauses false
% 7.00/7.26 % --dbg_dump_prop_clauses_file -
% 7.00/7.26 % --dbg_out_stat false
% 7.00/7.26
% 7.00/7.26 % ------ General Options
% 7.00/7.26
% 7.00/7.26 % --fof false
% 7.00/7.26 % --time_out_real 150.
% 7.00/7.26 % --time_out_prep_mult 0.2
% 7.00/7.26 % --time_out_virtual -1.
% 7.00/7.26 % --schedule none
% 7.00/7.26 % --ground_splitting input
% 7.00/7.26 % --splitting_nvd 16
% 7.00/7.26 % --non_eq_to_eq false
% 7.00/7.26 % --prep_gs_sim true
% 7.00/7.26 % --prep_unflatten false
% 7.00/7.26 % --prep_res_sim true
% 7.00/7.26 % --prep_upred true
% 7.00/7.26 % --res_sim_input true
% 7.00/7.26 % --clause_weak_htbl true
% 7.00/7.26 % --gc_record_bc_elim false
% 7.00/7.26 % --symbol_type_check false
% 7.00/7.26 % --clausify_out false
% 7.00/7.26 % --large_theory_mode false
% 7.00/7.26 % --prep_sem_filter none
% 7.00/7.26 % --prep_sem_filter_out false
% 7.00/7.26 % --preprocessed_out false
% 7.00/7.26 % --sub_typing false
% 7.00/7.26 % --brand_transform false
% 7.00/7.26 % --pure_diseq_elim true
% 7.00/7.26 % --min_unsat_core false
% 7.00/7.26 % --pred_elim true
% 7.00/7.26 % --add_important_lit false
% 7.00/7.26 % --soft_assumptions false
% 7.00/7.26 % --reset_solvers false
% 7.00/7.26 % --bc_imp_inh []
% 7.00/7.26 % --conj_cone_tolerance 1.5
% 7.00/7.26 % --prolific_symb_bound 500
% 7.00/7.26 % --lt_threshold 2000
% 7.00/7.26
% 7.00/7.26 % ------ SAT Options
% 7.00/7.26
% 7.00/7.26 % --sat_mode false
% 7.00/7.26 % --sat_fm_restart_options ""
% 7.00/7.26 % --sat_gr_def false
% 7.00/7.26 % --sat_epr_types true
% 7.00/7.26 % --sat_non_cyclic_types false
% 7.00/7.26 % --sat_finite_models false
% 7.00/7.26 % --sat_fm_lemmas false
% 7.00/7.26 % --sat_fm_prep false
% 7.00/7.26 % --sat_fm_uc_incr true
% 7.00/7.26 % --sat_out_model small
% 7.00/7.26 % --sat_out_clauses false
% 7.00/7.26
% 7.00/7.26 % ------ QBF Options
% 7.00/7.26
% 7.00/7.26 % --qbf_mode false
% 7.00/7.26 % --qbf_elim_univ true
% 7.00/7.26 % --qbf_sk_in true
% 7.00/7.26 % --qbf_pred_elim true
% 7.00/7.26 % --qbf_split 32
% 7.00/7.26
% 7.00/7.26 % ------ BMC1 Options
% 7.00/7.26
% 7.00/7.26 % --bmc1_incremental false
% 7.00/7.26 % --bmc1_axioms reachable_all
% 7.00/7.26 % --bmc1_min_bound 0
% 7.00/7.26 % --bmc1_max_bound -1
% 7.00/7.26 % --bmc1_max_bound_default -1
% 7.00/7.26 % --bmc1_symbol_reachability true
% 7.00/7.26 % --bmc1_property_lemmas false
% 7.00/7.26 % --bmc1_k_induction false
% 7.00/7.26 % --bmc1_non_equiv_states false
% 7.00/7.26 % --bmc1_deadlock false
% 7.00/7.26 % --bmc1_ucm false
% 7.00/7.26 % --bmc1_add_unsat_core none
% 7.00/7.26 % --bmc1_unsat_core_children false
% 7.00/7.26 % --bmc1_unsat_core_extrapolate_axioms false
% 7.00/7.26 % --bmc1_out_stat full
% 7.00/7.26 % --bmc1_ground_init false
% 7.00/7.26 % --bmc1_pre_inst_next_state false
% 7.00/7.26 % --bmc1_pre_inst_state false
% 7.00/7.26 % --bmc1_pre_inst_reach_state false
% 7.00/7.26 % --bmc1_out_unsat_core false
% 7.00/7.26 % --bmc1_aig_witness_out false
% 7.00/7.26 % --bmc1_verbose false
% 7.00/7.26 % --bmc1_dump_clauses_tptp false
% 7.10/7.27 % --bmc1_dump_unsat_core_tptp false
% 7.10/7.27 % --bmc1_dump_file -
% 7.10/7.27 % --bmc1_ucm_expand_uc_limit 128
% 7.10/7.27 % --bmc1_ucm_n_expand_iterations 6
% 7.10/7.27 % --bmc1_ucm_extend_mode 1
% 7.10/7.27 % --bmc1_ucm_init_mode 2
% 7.10/7.27 % --bmc1_ucm_cone_mode none
% 7.10/7.27 % --bmc1_ucm_reduced_relation_type 0
% 7.10/7.27 % --bmc1_ucm_relax_model 4
% 7.10/7.27 % --bmc1_ucm_full_tr_after_sat true
% 7.10/7.27 % --bmc1_ucm_expand_neg_assumptions false
% 7.10/7.27 % --bmc1_ucm_layered_model none
% 7.10/7.27 % --bmc1_ucm_max_lemma_size 10
% 7.10/7.27
% 7.10/7.27 % ------ AIG Options
% 7.10/7.27
% 7.10/7.27 % --aig_mode false
% 7.10/7.27
% 7.10/7.27 % ------ Instantiation Options
% 7.10/7.27
% 7.10/7.27 % --instantiation_flag true
% 7.10/7.27 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 7.10/7.27 % --inst_solver_per_active 750
% 7.10/7.27 % --inst_solver_calls_frac 0.5
% 7.10/7.27 % --inst_passive_queue_type priority_queues
% 7.10/7.27 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 7.10/7.27 % --inst_passive_queues_freq [25;2]
% 7.10/7.27 % --inst_dismatching true
% 7.10/7.27 % --inst_eager_unprocessed_to_passive true
% 7.10/7.27 % --inst_prop_sim_given true
% 7.10/7.27 % --inst_prop_sim_new false
% 7.10/7.27 % --inst_orphan_elimination true
% 7.10/7.27 % --inst_learning_loop_flag true
% 7.10/7.27 % --inst_learning_start 3000
% 7.10/7.27 % --inst_learning_factor 2
% 7.10/7.27 % --inst_start_prop_sim_after_learn 3
% 7.10/7.27 % --inst_sel_renew solver
% 7.10/7.27 % --inst_lit_activity_flag true
% 7.10/7.27 % --inst_out_proof true
% 7.10/7.27
% 7.10/7.27 % ------ Resolution Options
% 7.10/7.27
% 7.10/7.27 % --resolution_flag true
% 7.10/7.27 % --res_lit_sel kbo_max
% 7.10/7.27 % --res_to_prop_solver none
% 7.10/7.27 % --res_prop_simpl_new false
% 7.10/7.27 % --res_prop_simpl_given false
% 7.10/7.27 % --res_passive_queue_type priority_queues
% 7.10/7.27 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 7.10/7.27 % --res_passive_queues_freq [15;5]
% 7.10/7.27 % --res_forward_subs full
% 7.10/7.27 % --res_backward_subs full
% 7.10/7.27 % --res_forward_subs_resolution true
% 7.10/7.27 % --res_backward_subs_resolution true
% 7.10/7.27 % --res_orphan_elimination false
% 7.10/7.27 % --res_time_limit 1000.
% 7.10/7.27 % --res_out_proof true
% 7.10/7.27 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8e9c4c.s
% 7.10/7.27 % --modulo true
% 7.10/7.27
% 7.10/7.27 % ------ Combination Options
% 7.10/7.27
% 7.10/7.27 % --comb_res_mult 1000
% 7.10/7.27 % --comb_inst_mult 300
% 7.10/7.27 % ------
% 7.10/7.27
% 7.10/7.27 % ------ Parsing...% successful
% 7.10/7.27
% 7.10/7.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e snvd_s sp: 0 0s snvd_e %
% 7.10/7.27
% 7.10/7.27 % ------ Proving...
% 7.10/7.27 % ------ Problem Properties
% 7.10/7.27
% 7.10/7.27 %
% 7.10/7.27 % EPR false
% 7.10/7.27 % Horn false
% 7.10/7.27 % Has equality true
% 7.10/7.27
% 7.10/7.27 % % ------ Input Options Time Limit: Unbounded
% 7.10/7.27
% 7.10/7.27
% 7.10/7.27 % % ------ Current options:
% 7.10/7.27
% 7.10/7.27 % ------ Input Options
% 7.10/7.27
% 7.10/7.27 % --out_options all
% 7.10/7.27 % --tptp_safe_out true
% 7.10/7.27 % --problem_path ""
% 7.10/7.27 % --include_path ""
% 7.10/7.27 % --clausifier .//eprover
% 7.10/7.27 % --clausifier_options --tstp-format
% 7.10/7.27 % --stdin false
% 7.10/7.27 % --dbg_backtrace false
% 7.10/7.27 % --dbg_dump_prop_clauses false
% 7.10/7.27 % --dbg_dump_prop_clauses_file -
% 7.10/7.27 % --dbg_out_stat false
% 7.10/7.27
% 7.10/7.27 % ------ General Options
% 7.10/7.27
% 7.10/7.27 % --fof false
% 7.10/7.27 % --time_out_real 150.
% 7.10/7.27 % --time_out_prep_mult 0.2
% 7.10/7.27 % --time_out_virtual -1.
% 7.10/7.27 % --schedule none
% 7.10/7.27 % --ground_splitting input
% 7.10/7.27 % --splitting_nvd 16
% 7.10/7.27 % --non_eq_to_eq false
% 7.10/7.27 % --prep_gs_sim true
% 7.10/7.27 % --prep_unflatten false
% 7.10/7.27 % --prep_res_sim true
% 7.10/7.27 % --prep_upred true
% 7.10/7.27 % --res_sim_input true
% 7.10/7.27 % --clause_weak_htbl true
% 7.10/7.27 % --gc_record_bc_elim false
% 7.10/7.27 % --symbol_type_check false
% 7.10/7.27 % --clausify_out false
% 7.10/7.27 % --large_theory_mode false
% 7.10/7.27 % --prep_sem_filter none
% 7.10/7.27 % --prep_sem_filter_out false
% 7.10/7.27 % --preprocessed_out false
% 7.10/7.27 % --sub_typing false
% 7.10/7.27 % --brand_transform false
% 7.10/7.27 % --pure_diseq_elim true
% 7.10/7.27 % --min_unsat_core false
% 7.10/7.27 % --pred_elim true
% 7.10/7.27 % --add_important_lit false
% 7.10/7.27 % --soft_assumptions false
% 7.10/7.27 % --reset_solvers false
% 7.10/7.27 % --bc_imp_inh []
% 7.10/7.27 % --conj_cone_tolerance 1.5
% 7.10/7.27 % --prolific_symb_bound 500
% 7.10/7.27 % --lt_threshold 2000
% 7.10/7.27
% 7.10/7.27 % ------ SAT Options
% 7.10/7.27
% 7.10/7.27 % --sat_mode false
% 7.10/7.27 % --sat_fm_restart_options ""
% 7.10/7.27 % --sat_gr_def false
% 7.10/7.27 % --sat_epr_types true
% 7.10/7.27 % --sat_non_cyclic_types false
% 7.10/7.27 % --sat_finite_models false
% 7.10/7.27 % --sat_fm_lemmas false
% 7.10/7.27 % --sat_fm_prep false
% 7.10/7.27 % --sat_fm_uc_incr true
% 7.10/7.27 % --sat_out_model small
% 7.10/7.27 % --sat_out_clauses false
% 7.10/7.27
% 7.10/7.27 % ------ QBF Options
% 7.10/7.27
% 7.10/7.27 % --qbf_mode false
% 7.10/7.27 % --qbf_elim_univ true
% 7.10/7.27 % --qbf_sk_in true
% 7.10/7.27 % --qbf_pred_elim true
% 7.10/7.27 % --qbf_split 32
% 7.10/7.27
% 7.10/7.27 % ------ BMC1 Options
% 7.10/7.27
% 7.10/7.27 % --bmc1_incremental false
% 7.10/7.27 % --bmc1_axioms reachable_all
% 7.10/7.27 % --bmc1_min_bound 0
% 7.10/7.27 % --bmc1_max_bound -1
% 7.10/7.27 % --bmc1_max_bound_default -1
% 7.10/7.27 % --bmc1_symbol_reachability true
% 7.10/7.27 % --bmc1_property_lemmas false
% 7.10/7.27 % --bmc1_k_induction false
% 7.10/7.27 % --bmc1_non_equiv_states false
% 7.10/7.27 % --bmc1_deadlock false
% 7.10/7.27 % --bmc1_ucm false
% 7.10/7.27 % --bmc1_add_unsat_core none
% 7.10/7.27 % --bmc1_unsat_core_children false
% 7.10/7.27 % --bmc1_unsat_core_extrapolate_axioms false
% 7.10/7.27 % --bmc1_out_stat full
% 7.10/7.27 % --bmc1_ground_init false
% 7.10/7.27 % --bmc1_pre_inst_next_state false
% 7.10/7.27 % --bmc1_pre_inst_state false
% 7.10/7.27 % --bmc1_pre_inst_reach_state false
% 7.10/7.27 % --bmc1_out_unsat_core false
% 7.10/7.27 % --bmc1_aig_witness_out false
% 7.10/7.27 % --bmc1_verbose false
% 7.10/7.27 % --bmc1_dump_clauses_tptp false
% 7.10/7.27 % --bmc1_dump_unsat_core_tptp false
% 7.10/7.27 % --bmc1_dump_file -
% 7.10/7.27 % --bmc1_ucm_expand_uc_limit 128
% 7.10/7.27 % --bmc1_ucm_n_expand_iterations 6
% 7.10/7.27 % --bmc1_ucm_extend_mode 1
% 7.10/7.27 % --bmc1_ucm_init_mode 2
% 7.10/7.27 % --bmc1_ucm_cone_mode none
% 7.10/7.27 % --bmc1_ucm_reduced_relation_type 0
% 7.10/7.27 % --bmc1_ucm_relax_model 4
% 7.10/7.27 % --bmc1_ucm_full_tr_after_sat true
% 7.10/7.27 % --bmc1_ucm_expand_neg_assumptions false
% 7.10/7.27 % --bmc1_ucm_layered_model none
% 7.10/7.27 % --bmc1_ucm_max_lemma_size 10
% 7.10/7.27
% 7.10/7.27 % ------ AIG Options
% 7.10/7.27
% 7.10/7.27 % --aig_mode false
% 7.10/7.27
% 7.10/7.27 % ------ Instantiation Options
% 7.10/7.27
% 7.10/7.27 % --instantiation_flag true
% 7.10/7.27 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 7.10/7.27 % --inst_solver_per_active 750
% 7.10/7.27 % --inst_solver_calls_frac 0.5
% 7.10/7.27 % --inst_passive_queue_type priority_queues
% 7.10/7.27 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 7.10/7.27 % --inst_passive_queues_freq [25;2]
% 7.10/7.27 % --inst_dismatching true
% 7.10/7.27 % --inst_eager_unprocessed_to_passive true
% 7.10/7.27 % --inst_prop_sim_given true
% 7.10/7.27 % --inst_prop_sim_new false
% 7.10/7.27 % --inst_orphan_elimination true
% 7.10/7.27 % --inst_learning_loop_flag true
% 7.10/7.27 % --inst_learning_start 3000
% 7.10/7.27 % --inst_learning_factor 2
% 7.10/7.27 % --inst_start_prop_sim_after_learn 3
% 7.10/7.27 % --inst_sel_renew solver
% 7.10/7.27 % --inst_lit_activity_flag true
% 7.10/7.27 % --inst_out_proof true
% 7.10/7.27
% 7.10/7.27 % ------ Resolution Options
% 7.10/7.27
% 7.10/7.27 % --resolution_flag true
% 7.10/7.27 % --res_lit_sel kbo_max
% 7.10/7.27 % --res_to_prop_solver none
% 7.10/7.27 % --res_prop_simpl_new false
% 7.10/7.27 % --res_prop_simpl_given false
% 7.10/7.27 % --res_passive_queue_type priority_queues
% 7.10/7.27 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 7.10/7.27 % --res_passive_queues_freq [15;5]
% 7.10/7.27 % --res_forward_subs full
% 7.10/7.27 % --res_backward_subs full
% 7.10/7.27 % --res_forward_subs_resolution true
% 7.10/7.27 % --res_backward_subs_resolution true
% 7.10/7.27 % --res_orphan_elimination false
% 7.10/7.27 % --res_time_limit 1000.
% 7.10/7.27 % --res_out_proof true
% 7.10/7.27 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_8e9c4c.s
% 7.10/7.27 % --modulo true
% 7.10/7.27
% 7.10/7.27 % ------ Combination Options
% 7.10/7.27
% 7.10/7.27 % --comb_res_mult 1000
% 7.10/7.27 % --comb_inst_mult 300
% 7.10/7.27 % ------
% 7.10/7.27
% 7.10/7.27
% 7.10/7.27
% 7.10/7.27 % ------ Proving...
% 7.10/7.27 % warning: shown sat in sat incomplete mode
% 7.10/7.27 %
% 7.10/7.27
% 7.10/7.27
% 7.10/7.27
% 7.10/7.27
% 7.10/7.27 cnf(c_72,plain,
% 7.10/7.27 ( selection_favors(X0,X1,X2)
% 7.10/7.27 | ~ greater(growth_rate(X0,X2),growth_rate(X1,X2))
% 7.10/7.27 | ~ subpopulations(X1,X0,X3,X2)
% 7.10/7.27 | ~ environment(X3) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_70_3) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_360,plain,
% 7.10/7.27 ( selection_favors(X0,X1,X2)
% 7.10/7.27 | ~ greater(growth_rate(X0,X2),growth_rate(X1,X2))
% 7.10/7.27 | ~ subpopulations(X1,X0,X3,X2)
% 7.10/7.27 | ~ environment(X3) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_72]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_361,plain,
% 7.10/7.27 ( ~ environment(X0)
% 7.10/7.27 | ~ greater(growth_rate(X1,X2),growth_rate(X3,X2))
% 7.10/7.27 | selection_favors(X1,X3,X2)
% 7.10/7.27 | ~ subpopulations(X3,X1,X0,X2) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_360]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_67,plain,
% 7.10/7.27 ( subpopulations(first_movers,efficient_producers,X0,X1)
% 7.10/7.27 | ~ greater(cardinality_at_time(efficient_producers,X1),zero)
% 7.10/7.27 | ~ greater(cardinality_at_time(first_movers,X1),zero)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_71_4) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_350,plain,
% 7.10/7.27 ( subpopulations(first_movers,efficient_producers,X0,X1)
% 7.10/7.27 | ~ greater(cardinality_at_time(efficient_producers,X1),zero)
% 7.10/7.27 | ~ greater(cardinality_at_time(first_movers,X1),zero)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_67]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_351,plain,
% 7.10/7.27 ( ~ environment(X0)
% 7.10/7.27 | ~ greater(cardinality_at_time(first_movers,X1),zero)
% 7.10/7.27 | ~ greater(cardinality_at_time(efficient_producers,X1),zero)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | subpopulations(first_movers,efficient_producers,X0,X1) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_350]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_63,plain,
% 7.10/7.27 ( ~ environment(X0)
% 7.10/7.27 | ~ subpopulation(X1,X0,X2)
% 7.10/7.27 | selection_favors(X1,X3,X2)
% 7.10/7.27 | cardinality_at_time(X3,X2) != zero
% 7.10/7.27 | ~ greater(cardinality_at_time(X1,X2),zero)
% 7.10/7.27 | ~ subpopulation(X3,X0,X2) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_72_3) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_342,plain,
% 7.10/7.27 ( ~ environment(X0)
% 7.10/7.27 | ~ subpopulation(X1,X0,X2)
% 7.10/7.27 | selection_favors(X1,X3,X2)
% 7.10/7.27 | cardinality_at_time(X3,X2) != zero
% 7.10/7.27 | ~ greater(cardinality_at_time(X1,X2),zero)
% 7.10/7.27 | ~ subpopulation(X3,X0,X2) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_63]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_343,plain,
% 7.10/7.27 ( ~ environment(X0)
% 7.10/7.27 | ~ greater(cardinality_at_time(X1,X2),zero)
% 7.10/7.27 | selection_favors(X1,X3,X2)
% 7.10/7.27 | ~ subpopulation(X1,X0,X2)
% 7.10/7.27 | ~ subpopulation(X3,X0,X2)
% 7.10/7.27 | cardinality_at_time(X3,X2) != zero ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_342]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_61,plain,
% 7.10/7.27 ( selection_favors(X0,X1,X2)
% 7.10/7.27 | cardinality_at_time(X1,X2) != zero
% 7.10/7.27 | ~ greater(cardinality_at_time(X0,X2),zero)
% 7.10/7.27 | ~ subpopulation(X1,X3,X2)
% 7.10/7.27 | ~ subpopulation(X0,X3,X2)
% 7.10/7.27 | ~ environment(X3) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_72_5) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_338,plain,
% 7.10/7.27 ( selection_favors(X0,X1,X2)
% 7.10/7.27 | cardinality_at_time(X1,X2) != zero
% 7.10/7.27 | ~ greater(cardinality_at_time(X0,X2),zero)
% 7.10/7.27 | ~ subpopulation(X1,X3,X2)
% 7.10/7.27 | ~ subpopulation(X0,X3,X2)
% 7.10/7.27 | ~ environment(X3) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_61]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_339,plain,
% 7.10/7.27 ( ~ environment(X0)
% 7.10/7.27 | ~ greater(cardinality_at_time(X1,X2),zero)
% 7.10/7.27 | selection_favors(X1,X3,X2)
% 7.10/7.27 | ~ subpopulation(X3,X0,X2)
% 7.10/7.27 | ~ subpopulation(X1,X0,X2)
% 7.10/7.27 | cardinality_at_time(X3,X2) != zero ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_338]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_56,plain,
% 7.10/7.27 ( selection_favors(efficient_producers,first_movers,X0)
% 7.10/7.27 | ~ observational_period(X0)
% 7.10/7.27 | ~ propagation_strategy(first_movers)
% 7.10/7.27 | ~ propagation_strategy(efficient_producers)
% 7.10/7.27 | ~ selection_favors(efficient_producers,first_movers,end_time(sk1_esk1_1(X0))) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_73_4) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_328,plain,
% 7.10/7.27 ( selection_favors(efficient_producers,first_movers,X0)
% 7.10/7.27 | ~ observational_period(X0)
% 7.10/7.27 | ~ propagation_strategy(first_movers)
% 7.10/7.27 | ~ propagation_strategy(efficient_producers)
% 7.10/7.27 | ~ selection_favors(efficient_producers,first_movers,end_time(sk1_esk1_1(X0))) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_56]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_329,plain,
% 7.10/7.27 ( ~ propagation_strategy(first_movers)
% 7.10/7.27 | ~ propagation_strategy(efficient_producers)
% 7.10/7.27 | ~ observational_period(X0)
% 7.10/7.27 | ~ selection_favors(efficient_producers,first_movers,end_time(sk1_esk1_1(X0)))
% 7.10/7.27 | selection_favors(efficient_producers,first_movers,X0) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_328]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_51,plain,
% 7.10/7.27 ( greater(sk1_esk2_2(X0,X1),critical_point(X1))
% 7.10/7.27 | ~ slow_change(X0)
% 7.10/7.27 | ~ observational_period(X0)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | ~ environment(X1) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_74_4) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_318,plain,
% 7.10/7.27 ( greater(sk1_esk2_2(X0,X1),critical_point(X1))
% 7.10/7.27 | ~ slow_change(X0)
% 7.10/7.27 | ~ observational_period(X0)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | ~ environment(X1) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_51]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_319,plain,
% 7.10/7.27 ( ~ environment(X0)
% 7.10/7.27 | greater(sk1_esk2_2(X1,X0),critical_point(X0))
% 7.10/7.27 | ~ in_environment(X1,X0)
% 7.10/7.27 | ~ observational_period(X1)
% 7.10/7.27 | ~ slow_change(X1) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_318]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_46,plain,
% 7.10/7.27 ( selection_favors(efficient_producers,first_movers,X0)
% 7.10/7.27 | in_environment(X0,sk1_esk1_1(X0))
% 7.10/7.27 | ~ observational_period(X0)
% 7.10/7.27 | ~ propagation_strategy(first_movers)
% 7.10/7.27 | ~ propagation_strategy(efficient_producers) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_75_4) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_308,plain,
% 7.10/7.27 ( selection_favors(efficient_producers,first_movers,X0)
% 7.10/7.27 | in_environment(X0,sk1_esk1_1(X0))
% 7.10/7.27 | ~ observational_period(X0)
% 7.10/7.27 | ~ propagation_strategy(first_movers)
% 7.10/7.27 | ~ propagation_strategy(efficient_producers) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_46]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_309,plain,
% 7.10/7.27 ( ~ propagation_strategy(first_movers)
% 7.10/7.27 | ~ propagation_strategy(efficient_producers)
% 7.10/7.27 | in_environment(X0,sk1_esk1_1(X0))
% 7.10/7.27 | ~ observational_period(X0)
% 7.10/7.27 | selection_favors(efficient_producers,first_movers,X0) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_308]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_42,plain,
% 7.10/7.27 ( in_environment(X0,X1)
% 7.10/7.27 | ~ greater_or_equal(end_time(X0),X1)
% 7.10/7.27 | ~ greater_or_equal(X1,start_time(X0))
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_76_3) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_300,plain,
% 7.10/7.27 ( in_environment(X0,X1)
% 7.10/7.27 | ~ greater_or_equal(end_time(X0),X1)
% 7.10/7.27 | ~ greater_or_equal(X1,start_time(X0))
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_42]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_301,plain,
% 7.10/7.27 ( ~ greater_or_equal(end_time(X0),X1)
% 7.10/7.27 | ~ greater_or_equal(X1,start_time(X0))
% 7.10/7.27 | ~ environment(X0)
% 7.10/7.27 | in_environment(X0,X1) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_300]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_37,plain,
% 7.10/7.27 ( in_environment(X0,sk1_esk2_2(X1,X0))
% 7.10/7.27 | ~ slow_change(X1)
% 7.10/7.27 | ~ observational_period(X1)
% 7.10/7.27 | ~ in_environment(X1,X0)
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_77_4) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_290,plain,
% 7.10/7.27 ( in_environment(X0,sk1_esk2_2(X1,X0))
% 7.10/7.27 | ~ slow_change(X1)
% 7.10/7.27 | ~ observational_period(X1)
% 7.10/7.27 | ~ in_environment(X1,X0)
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_37]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_291,plain,
% 7.10/7.27 ( ~ environment(X0)
% 7.10/7.27 | in_environment(X0,sk1_esk2_2(X1,X0))
% 7.10/7.27 | ~ in_environment(X1,X0)
% 7.10/7.27 | ~ observational_period(X1)
% 7.10/7.27 | ~ slow_change(X1) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_290]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_27,plain,
% 7.10/7.27 ( greater_or_equal(end_time(X0),X1)
% 7.10/7.27 | greater(X1,end_time(X0))
% 7.10/7.27 | ~ greater(X1,start_time(X0))
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_80_3) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_270,plain,
% 7.10/7.27 ( greater_or_equal(end_time(X0),X1)
% 7.10/7.27 | greater(X1,end_time(X0))
% 7.10/7.27 | ~ greater(X1,start_time(X0))
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_27]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_271,plain,
% 7.10/7.27 ( greater_or_equal(end_time(X0),X1)
% 7.10/7.27 | ~ environment(X0)
% 7.10/7.27 | ~ greater(X1,start_time(X0))
% 7.10/7.27 | greater(X1,end_time(X0)) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_270]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_22,plain,
% 7.10/7.27 ( selection_favors(efficient_producers,first_movers,X0)
% 7.10/7.27 | environment(sk1_esk1_1(X0))
% 7.10/7.27 | ~ observational_period(X0)
% 7.10/7.27 | ~ propagation_strategy(first_movers)
% 7.10/7.27 | ~ propagation_strategy(efficient_producers) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_81_4) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_260,plain,
% 7.10/7.27 ( selection_favors(efficient_producers,first_movers,X0)
% 7.10/7.27 | environment(sk1_esk1_1(X0))
% 7.10/7.27 | ~ observational_period(X0)
% 7.10/7.27 | ~ propagation_strategy(first_movers)
% 7.10/7.27 | ~ propagation_strategy(efficient_producers) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_22]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_261,plain,
% 7.10/7.27 ( ~ propagation_strategy(first_movers)
% 7.10/7.27 | ~ propagation_strategy(efficient_producers)
% 7.10/7.27 | environment(sk1_esk1_1(X0))
% 7.10/7.27 | ~ observational_period(X0)
% 7.10/7.27 | selection_favors(efficient_producers,first_movers,X0) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_260]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_19,plain,
% 7.10/7.27 ( greater_or_equal(cardinality_at_time(first_movers,X0),zero)
% 7.10/7.27 | ~ in_environment(X1,X0)
% 7.10/7.27 | ~ environment(X1) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_82_2) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_254,plain,
% 7.10/7.27 ( greater_or_equal(cardinality_at_time(first_movers,X0),zero)
% 7.10/7.27 | ~ in_environment(X1,X0)
% 7.10/7.27 | ~ environment(X1) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_19]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_255,plain,
% 7.10/7.27 ( greater_or_equal(cardinality_at_time(first_movers,X0),zero)
% 7.10/7.27 | ~ environment(X1)
% 7.10/7.27 | ~ in_environment(X1,X0) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_254]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_11,plain,
% 7.10/7.27 ( greater_or_equal(end_time(X0),X1)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_85_2) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_238,plain,
% 7.10/7.27 ( greater_or_equal(end_time(X0),X1)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_11]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_239,plain,
% 7.10/7.27 ( greater_or_equal(end_time(X0),X1)
% 7.10/7.27 | ~ environment(X0)
% 7.10/7.27 | ~ in_environment(X0,X1) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_238]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_81,negated_conjecture,
% 7.10/7.27 ( slow_change(sk2_esk1_0) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_20) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_114,negated_conjecture,
% 7.10/7.27 ( slow_change(sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_81]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_127,negated_conjecture,
% 7.10/7.27 ( slow_change(sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_114]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_128,negated_conjecture,
% 7.10/7.27 ( slow_change(sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_127]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_135,negated_conjecture,
% 7.10/7.27 ( slow_change(sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_128]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_370,negated_conjecture,
% 7.10/7.27 ( slow_change(sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_135]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_80,negated_conjecture,
% 7.10/7.27 ( observational_period(sk2_esk1_0) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_19) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_112,negated_conjecture,
% 7.10/7.27 ( observational_period(sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_80]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_126,negated_conjecture,
% 7.10/7.27 ( observational_period(sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_112]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_129,negated_conjecture,
% 7.10/7.27 ( observational_period(sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_126]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_134,negated_conjecture,
% 7.10/7.27 ( observational_period(sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_129]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_368,negated_conjecture,
% 7.10/7.27 ( observational_period(sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_134]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_79,negated_conjecture,
% 7.10/7.27 ( ~ selection_favors(efficient_producers,first_movers,sk2_esk1_0) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_18) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_110,negated_conjecture,
% 7.10/7.27 ( ~ selection_favors(efficient_producers,first_movers,sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_79]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_125,negated_conjecture,
% 7.10/7.27 ( ~ selection_favors(efficient_producers,first_movers,sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_110]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_130,negated_conjecture,
% 7.10/7.27 ( ~ selection_favors(efficient_producers,first_movers,sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_125]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_136,negated_conjecture,
% 7.10/7.27 ( ~ selection_favors(efficient_producers,first_movers,sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_130]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_372,negated_conjecture,
% 7.10/7.27 ( ~ selection_favors(efficient_producers,first_movers,sk2_esk1_0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_136]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_34,plain,
% 7.10/7.27 ( subpopulation(first_movers,X0,X1)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_78_2) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_284,plain,
% 7.10/7.27 ( subpopulation(first_movers,X0,X1)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_34]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_285,plain,
% 7.10/7.27 ( ~ environment(X0)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | subpopulation(first_movers,X0,X1) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_284]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_31,plain,
% 7.10/7.27 ( subpopulation(efficient_producers,X0,X1)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_79_2) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_278,plain,
% 7.10/7.27 ( subpopulation(efficient_producers,X0,X1)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_31]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_279,plain,
% 7.10/7.27 ( ~ environment(X0)
% 7.10/7.27 | ~ in_environment(X0,X1)
% 7.10/7.27 | subpopulation(efficient_producers,X0,X1) ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_278]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_18,plain,
% 7.10/7.27 ( ~ greater(X0,X1) | ~ greater(X1,X2) | greater(X0,X2) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_83_0) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_252,plain,
% 7.10/7.27 ( ~ greater(X0,X1) | ~ greater(X1,X2) | greater(X0,X2) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_18]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_17,plain,
% 7.10/7.27 ( ~ greater(X0,X1) | greater(X0,X2) | ~ greater(X1,X2) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_83_1) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_250,plain,
% 7.10/7.27 ( ~ greater(X0,X1) | greater(X0,X2) | ~ greater(X1,X2) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_17]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_16,plain,
% 7.10/7.27 ( greater(X0,X1) | ~ greater(X2,X1) | ~ greater(X0,X2) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_83_2) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_248,plain,
% 7.10/7.27 ( greater(X0,X1) | ~ greater(X2,X1) | ~ greater(X0,X2) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_16]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_14,plain,
% 7.10/7.27 ( greater_or_equal(critical_point(X0),appear(efficient_producers,X0))
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_84_1) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_244,plain,
% 7.10/7.27 ( greater_or_equal(critical_point(X0),appear(efficient_producers,X0))
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_14]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_8,plain,
% 7.10/7.27 ( X0 = X1 | greater(X0,X1) | ~ greater_or_equal(X0,X1) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_86_2) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_232,plain,
% 7.10/7.27 ( X0 = X1 | greater(X0,X1) | ~ greater_or_equal(X0,X1) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_8]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_233,plain,
% 7.10/7.27 ( ~ greater_or_equal(X0,X1) | greater(X0,X1) | X0 = X1 ),
% 7.10/7.27 inference(rewriting,[status(thm)],[c_232]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_6,plain,
% 7.10/7.27 ( greater_or_equal(X0,X1) | ~ greater(X0,X1) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_87_1) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_228,plain,
% 7.10/7.27 ( greater_or_equal(X0,X1) | ~ greater(X0,X1) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_6]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_4,plain,
% 7.10/7.27 ( greater_or_equal(critical_point(X0),start_time(X0))
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_88_1) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_224,plain,
% 7.10/7.27 ( greater_or_equal(critical_point(X0),start_time(X0))
% 7.10/7.27 | ~ environment(X0) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_4]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_2,plain,
% 7.10/7.27 ( greater_or_equal(X0,X1) | X0 != X1 ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_89_1) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_220,plain,
% 7.10/7.27 ( greater_or_equal(X0,X1) | X0 != X1 ),
% 7.10/7.27 inference(copy,[status(esa)],[c_2]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_1,plain,
% 7.10/7.27 ( propagation_strategy(efficient_producers) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_90_0) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_218,plain,
% 7.10/7.27 ( propagation_strategy(efficient_producers) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_1]) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_0,plain,
% 7.10/7.27 ( propagation_strategy(first_movers) ),
% 7.10/7.27 file('/export/starexec/sandbox/tmp/iprover_modulo_9b7847.p', c_0_91_0) ).
% 7.10/7.27
% 7.10/7.27 cnf(c_216,plain,
% 7.10/7.27 ( propagation_strategy(first_movers) ),
% 7.10/7.27 inference(copy,[status(esa)],[c_0]) ).
% 7.10/7.27
% 7.10/7.27
% 7.10/7.27
% 7.10/7.27 % ------ Statistics
% 7.10/7.27
% 7.10/7.27 % ------ General
% 7.10/7.27
% 7.10/7.27 % num_of_input_clauses: 82
% 7.10/7.27 % num_of_input_neg_conjectures: 3
% 7.10/7.27 % num_of_splits: 0
% 7.10/7.27 % num_of_split_atoms: 0
% 7.10/7.27 % num_of_sem_filtered_clauses: 0
% 7.10/7.27 % num_of_subtypes: 0
% 7.10/7.27 % monotx_restored_types: 0
% 7.10/7.27 % sat_num_of_epr_types: 0
% 7.10/7.27 % sat_num_of_non_cyclic_types: 0
% 7.10/7.27 % sat_guarded_non_collapsed_types: 0
% 7.10/7.27 % is_epr: 0
% 7.10/7.27 % is_horn: 0
% 7.10/7.27 % has_eq: 1
% 7.10/7.27 % num_pure_diseq_elim: 0
% 7.10/7.27 % simp_replaced_by: 0
% 7.10/7.27 % res_preprocessed: 9
% 7.10/7.27 % prep_upred: 0
% 7.10/7.27 % prep_unflattend: 0
% 7.10/7.27 % pred_elim_cands: 5
% 7.10/7.27 % pred_elim: 5
% 7.10/7.27 % pred_elim_cl: 3
% 7.10/7.27 % pred_elim_cycles: 5
% 7.10/7.27 % forced_gc_time: 0
% 7.10/7.27 % gc_basic_clause_elim: 0
% 7.10/7.27 % parsing_time: 0.002
% 7.10/7.27 % sem_filter_time: 0.
% 7.10/7.27 % pred_elim_time: 0.
% 7.10/7.27 % out_proof_time: 0.
% 7.10/7.27 % monotx_time: 0.
% 7.10/7.27 % subtype_inf_time: 0.
% 7.10/7.27 % unif_index_cands_time: 0.
% 7.10/7.27 % unif_index_add_time: 0.
% 7.10/7.27 % total_time: 0.019
% 7.10/7.27 % num_of_symbols: 47
% 7.10/7.27 % num_of_terms: 236
% 7.10/7.27
% 7.10/7.27 % ------ Propositional Solver
% 7.10/7.27
% 7.10/7.27 % prop_solver_calls: 1
% 7.10/7.27 % prop_fast_solver_calls: 33
% 7.10/7.27 % prop_num_of_clauses: 57
% 7.10/7.27 % prop_preprocess_simplified: 309
% 7.10/7.27 % prop_fo_subsumed: 0
% 7.10/7.27 % prop_solver_time: 0.
% 7.10/7.27 % prop_fast_solver_time: 0.
% 7.10/7.27 % prop_unsat_core_time: 0.
% 7.10/7.27
% 7.10/7.27 % ------ QBF
% 7.10/7.27
% 7.10/7.27 % qbf_q_res: 0
% 7.10/7.27 % qbf_num_tautologies: 0
% 7.10/7.27 % qbf_prep_cycles: 0
% 7.10/7.27
% 7.10/7.27 % ------ BMC1
% 7.10/7.27
% 7.10/7.27 % bmc1_current_bound: -1
% 7.10/7.27 % bmc1_last_solved_bound: -1
% 7.10/7.27 % bmc1_unsat_core_size: -1
% 7.10/7.27 % bmc1_unsat_core_parents_size: -1
% 7.10/7.27 % bmc1_merge_next_fun: 0
% 7.10/7.27 % bmc1_unsat_core_clauses_time: 0.
% 7.10/7.27
% 7.10/7.27 % ------ Instantiation
% 7.10/7.27
% 7.10/7.27 % inst_num_of_clauses: 79
% 7.10/7.27 % inst_num_in_passive: 0
% 7.10/7.27 % inst_num_in_active: 0
% 7.10/7.27 % inst_num_in_unprocessed: 79
% 7.10/7.27 % inst_num_of_loops: 0
% 7.10/7.27 % inst_num_of_learning_restarts: 0
% 7.10/7.27 % inst_num_moves_active_passive: 0
% 7.10/7.27 % inst_lit_activity: 0
% 7.10/7.27 % inst_lit_activity_moves: 0
% 7.10/7.27 % inst_num_tautologies: 0
% 7.10/7.27 % inst_num_prop_implied: 0
% 7.10/7.27 % inst_num_existing_simplified: 0
% 7.10/7.27 % inst_num_eq_res_simplified: 0
% 7.10/7.27 % inst_num_child_elim: 0
% 7.10/7.27 % inst_num_of_dismatching_blockings: 0
% 7.10/7.27 % inst_num_of_non_proper_insts: 0
% 7.10/7.27 % inst_num_of_duplicates: 0
% 7.10/7.27 % inst_inst_num_from_inst_to_res: 0
% 7.10/7.27 % inst_dismatching_checking_time: 0.
% 7.10/7.27
% 7.10/7.27 % ------ Resolution
% 7.10/7.27
% 7.10/7.27 % res_num_of_clauses: 92
% 7.10/7.27 % res_num_in_passive: 0
% 7.10/7.27 % res_num_in_active: 28
% 7.10/7.27 % res_num_of_loops: 4
% 7.10/7.27 % res_forward_subset_subsumed: 51
% 7.10/7.27 % res_backward_subset_subsumed: 0
% 7.10/7.27 % res_forward_subsumed: 0
% 7.10/7.27 % res_backward_subsumed: 0
% 7.10/7.27 % res_forward_subsumption_resolution: 0
% 7.10/7.27 % res_backward_subsumption_resolution: 0
% 7.10/7.27 % res_clause_to_clause_subsumption: 0
% 7.10/7.27 % res_orphan_elimination: 0
% 7.10/7.27 % res_tautology_del: 0
% 7.10/7.27 % res_num_eq_res_simplified: 0
% 7.10/7.27 % res_num_sel_changes: 0
% 7.10/7.27 % res_moves_from_active_to_pass: 0
% 7.10/7.27
% 7.10/7.27 % Status Unknown
% 7.10/7.27 % Last status :
% 7.10/7.27 % SZS status Unknown
%------------------------------------------------------------------------------