TSTP Solution File: MGT033+2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT033+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n023.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:52 EDT 2022
% Result : Unknown 1.26s 1.44s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT033+2 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 08:14:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % FOF problem with conjecture
% 0.20/0.40 % 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_a0254e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e742ff.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_60e482 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0254e.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn false
% 0.20/0.43 % Has equality true
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0254e.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % warning: shown sat in sat incomplete mode
% 0.20/0.43 %
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 cnf(c_27,plain,
% 0.20/0.43 ( greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1)
% 0.20/0.43 | ~ greater_or_equal(X1,appear(an_organisation,X0)) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_21) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_55,plain,
% 0.20/0.43 ( greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1)
% 0.20/0.43 | ~ greater_or_equal(X1,appear(an_organisation,X0)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_27]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_80,plain,
% 0.20/0.43 ( greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1)
% 0.20/0.43 | ~ greater_or_equal(X1,appear(an_organisation,X0)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_55]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_93,plain,
% 0.20/0.43 ( greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1)
% 0.20/0.43 | ~ greater_or_equal(X1,appear(an_organisation,X0)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_80]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_97,plain,
% 0.20/0.43 ( greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1)
% 0.20/0.43 | ~ greater_or_equal(X1,appear(an_organisation,X0)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_93]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_191,plain,
% 0.20/0.43 ( greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1)
% 0.20/0.43 | ~ greater_or_equal(X1,appear(an_organisation,X0)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_97]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_33,negated_conjecture,
% 0.20/0.43 ( environment(sk3_esk1_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_27) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_67,negated_conjecture,
% 0.20/0.43 ( environment(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_33]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_86,negated_conjecture,
% 0.20/0.43 ( environment(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_67]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_87,negated_conjecture,
% 0.20/0.43 ( environment(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_86]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_96,negated_conjecture,
% 0.20/0.43 ( environment(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_87]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_189,negated_conjecture,
% 0.20/0.43 ( environment(sk3_esk1_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_96]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_18,plain,
% 0.20/0.43 ( greater_or_equal(appear(first_movers,X0),appear(an_organisation,X0))
% 0.20/0.43 | ~ environment(X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_60_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_171,plain,
% 0.20/0.43 ( greater_or_equal(appear(first_movers,X0),appear(an_organisation,X0))
% 0.20/0.43 | ~ environment(X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_172,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | greater_or_equal(appear(first_movers,X0),appear(an_organisation,X0)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_171]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_204,plain,
% 0.20/0.43 ( greater_or_equal(appear(first_movers,sk3_esk1_0),appear(an_organisation,sk3_esk1_0)) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_189,c_172]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_209,plain,
% 0.20/0.43 ( greater_or_equal(appear(first_movers,sk3_esk1_0),appear(an_organisation,sk3_esk1_0)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_204]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_277,plain,
% 0.20/0.43 ( greater(number_of_organizations(sk3_esk1_0,appear(first_movers,sk3_esk1_0)),zero)
% 0.20/0.43 | ~ environment(sk3_esk1_0)
% 0.20/0.43 | ~ in_environment(sk3_esk1_0,appear(first_movers,sk3_esk1_0)) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_191,c_209]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_278,plain,
% 0.20/0.43 ( greater(number_of_organizations(sk3_esk1_0,appear(first_movers,sk3_esk1_0)),zero)
% 0.20/0.43 | ~ environment(sk3_esk1_0)
% 0.20/0.43 | ~ in_environment(sk3_esk1_0,appear(first_movers,sk3_esk1_0)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_277]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_300,plain,
% 0.20/0.43 ( greater(number_of_organizations(sk3_esk1_0,appear(first_movers,sk3_esk1_0)),zero)
% 0.20/0.43 | ~ in_environment(sk3_esk1_0,appear(first_movers,sk3_esk1_0)) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_278,c_189]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_301,plain,
% 0.20/0.43 ( greater(number_of_organizations(sk3_esk1_0,appear(first_movers,sk3_esk1_0)),zero)
% 0.20/0.43 | ~ in_environment(sk3_esk1_0,appear(first_movers,sk3_esk1_0)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_300]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_12,plain,
% 0.20/0.43 ( X0 != X1 | greater_or_equal(X0,X1) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_66_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_159,plain,
% 0.20/0.43 ( X0 != X1 | greater_or_equal(X0,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_160,plain,
% 0.20/0.43 ( greater_or_equal(X0,X1) | X0 != X1 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_159]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_274,plain,
% 0.20/0.43 ( greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1)
% 0.20/0.43 | X1 != appear(an_organisation,X0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_191,c_160]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_275,plain,
% 0.20/0.43 ( greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1)
% 0.20/0.43 | X1 != appear(an_organisation,X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_274]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_15,plain,
% 0.20/0.43 ( ~ greater(X0,X1) | greater_or_equal(X0,X1) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_63_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_165,plain,
% 0.20/0.43 ( ~ greater(X0,X1) | greater_or_equal(X0,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_273,plain,
% 0.20/0.43 ( greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | ~ greater(X1,appear(an_organisation,X0))
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_191,c_165]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_276,plain,
% 0.20/0.43 ( greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | ~ greater(X1,appear(an_organisation,X0))
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_273]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_14,plain,
% 0.20/0.43 ( greater(X0,X1) | X0 = X1 | ~ greater_or_equal(X0,X1) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_64_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_163,plain,
% 0.20/0.43 ( greater(X0,X1) | X0 = X1 | ~ greater_or_equal(X0,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_164,plain,
% 0.20/0.43 ( greater(X0,X1) | ~ greater_or_equal(X0,X1) | X0 = X1 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_163]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_231,plain,
% 0.20/0.43 ( greater(appear(first_movers,sk3_esk1_0),appear(an_organisation,sk3_esk1_0))
% 0.20/0.43 | appear(first_movers,sk3_esk1_0) = appear(an_organisation,sk3_esk1_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_209,c_164]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_232,plain,
% 0.20/0.43 ( greater(appear(first_movers,sk3_esk1_0),appear(an_organisation,sk3_esk1_0))
% 0.20/0.43 | appear(first_movers,sk3_esk1_0) = appear(an_organisation,sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_231]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_16,plain,
% 0.20/0.43 ( greater_or_equal(appear(first_movers,X0),start_time(X0))
% 0.20/0.43 | ~ environment(X0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_62_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_167,plain,
% 0.20/0.43 ( greater_or_equal(appear(first_movers,X0),start_time(X0))
% 0.20/0.43 | ~ environment(X0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_168,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | greater_or_equal(appear(first_movers,X0),start_time(X0)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_167]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_205,plain,
% 0.20/0.43 ( greater_or_equal(appear(first_movers,sk3_esk1_0),start_time(sk3_esk1_0)) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_189,c_168]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_208,plain,
% 0.20/0.43 ( greater_or_equal(appear(first_movers,sk3_esk1_0),start_time(sk3_esk1_0)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_205]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_227,plain,
% 0.20/0.43 ( greater(appear(first_movers,sk3_esk1_0),start_time(sk3_esk1_0))
% 0.20/0.43 | appear(first_movers,sk3_esk1_0) = start_time(sk3_esk1_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_208,c_164]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_228,plain,
% 0.20/0.43 ( greater(appear(first_movers,sk3_esk1_0),start_time(sk3_esk1_0))
% 0.20/0.43 | appear(first_movers,sk3_esk1_0) = start_time(sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_227]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_30,negated_conjecture,
% 0.20/0.43 ( greater_or_equal(sk3_esk2_0,appear(first_movers,sk3_esk1_0)) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_24) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_61,negated_conjecture,
% 0.20/0.43 ( greater_or_equal(sk3_esk2_0,appear(first_movers,sk3_esk1_0)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_30]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_83,negated_conjecture,
% 0.20/0.43 ( greater_or_equal(sk3_esk2_0,appear(first_movers,sk3_esk1_0)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_61]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_90,negated_conjecture,
% 0.20/0.43 ( greater_or_equal(sk3_esk2_0,appear(first_movers,sk3_esk1_0)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_83]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_100,negated_conjecture,
% 0.20/0.43 ( greater_or_equal(sk3_esk2_0,appear(first_movers,sk3_esk1_0)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_90]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_197,negated_conjecture,
% 0.20/0.43 ( greater_or_equal(sk3_esk2_0,appear(first_movers,sk3_esk1_0)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_100]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_219,plain,
% 0.20/0.43 ( greater(sk3_esk2_0,appear(first_movers,sk3_esk1_0))
% 0.20/0.43 | sk3_esk2_0 = appear(first_movers,sk3_esk1_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_197,c_164]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_220,plain,
% 0.20/0.43 ( greater(sk3_esk2_0,appear(first_movers,sk3_esk1_0))
% 0.20/0.43 | sk3_esk2_0 = appear(first_movers,sk3_esk1_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_219]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_29,negated_conjecture,
% 0.20/0.43 ( ~ selection_favors(first_movers,efficient_producers,sk3_esk2_0) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_22) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_59,negated_conjecture,
% 0.20/0.43 ( ~ selection_favors(first_movers,efficient_producers,sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_82,negated_conjecture,
% 0.20/0.43 ( ~ selection_favors(first_movers,efficient_producers,sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_59]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_91,negated_conjecture,
% 0.20/0.43 ( ~ selection_favors(first_movers,efficient_producers,sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_82]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_99,negated_conjecture,
% 0.20/0.43 ( ~ selection_favors(first_movers,efficient_producers,sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_91]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_195,negated_conjecture,
% 0.20/0.43 ( ~ selection_favors(first_movers,efficient_producers,sk3_esk2_0) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_99]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_25,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | ~ subpopulation(X1,X0,X2)
% 0.20/0.43 | ~ subpopulation(X3,X0,X2)
% 0.20/0.43 | ~ greater(cardinality_at_time(X1,X2),zero)
% 0.20/0.43 | cardinality_at_time(X3,X2) != zero
% 0.20/0.43 | selection_favors(X1,X3,X2) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_53_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_185,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | ~ subpopulation(X1,X0,X2)
% 0.20/0.43 | ~ subpopulation(X3,X0,X2)
% 0.20/0.43 | ~ greater(cardinality_at_time(X1,X2),zero)
% 0.20/0.43 | cardinality_at_time(X3,X2) != zero
% 0.20/0.43 | selection_favors(X1,X3,X2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_25]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_186,plain,
% 0.20/0.43 ( ~ greater(cardinality_at_time(X0,X1),zero)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ subpopulation(X0,X2,X1)
% 0.20/0.43 | ~ subpopulation(X3,X2,X1)
% 0.20/0.43 | selection_favors(X0,X3,X1)
% 0.20/0.43 | cardinality_at_time(X3,X1) != zero ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_185]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_215,plain,
% 0.20/0.43 ( ~ greater(cardinality_at_time(X0,first_movers),zero)
% 0.20/0.43 | ~ environment(sk3_esk2_0)
% 0.20/0.43 | ~ subpopulation(efficient_producers,sk3_esk2_0,first_movers)
% 0.20/0.44 | ~ subpopulation(X0,sk3_esk2_0,first_movers)
% 0.20/0.44 | selection_favors(X0,efficient_producers,first_movers)
% 0.20/0.44 | cardinality_at_time(efficient_producers,first_movers) != zero ),
% 0.20/0.44 inference(resolution,[status(thm)],[c_195,c_186]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_216,plain,
% 0.20/0.44 ( ~ greater(cardinality_at_time(X0,first_movers),zero)
% 0.20/0.44 | ~ environment(sk3_esk2_0)
% 0.20/0.44 | ~ subpopulation(efficient_producers,sk3_esk2_0,first_movers)
% 0.20/0.44 | ~ subpopulation(X0,sk3_esk2_0,first_movers)
% 0.20/0.44 | selection_favors(X0,efficient_producers,first_movers)
% 0.20/0.44 | cardinality_at_time(efficient_producers,first_movers) != zero ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_215]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_13,plain,
% 0.20/0.44 ( in_environment(X0,start_time(X0)) | ~ environment(X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_65_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_161,plain,
% 0.20/0.44 ( in_environment(X0,start_time(X0)) | ~ environment(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_162,plain,
% 0.20/0.44 ( ~ environment(X0) | in_environment(X0,start_time(X0)) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_161]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_206,plain,
% 0.20/0.44 ( in_environment(sk3_esk1_0,start_time(sk3_esk1_0)) ),
% 0.20/0.44 inference(resolution,[status(thm)],[c_189,c_162]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_207,plain,
% 0.20/0.44 ( in_environment(sk3_esk1_0,start_time(sk3_esk1_0)) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_206]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_22,plain,
% 0.20/0.44 ( greater(number_of_organizations(e,appear(an_organisation,X0)),zero)
% 0.20/0.44 | ~ environment(X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_56_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_179,plain,
% 0.20/0.44 ( greater(number_of_organizations(e,appear(an_organisation,X0)),zero)
% 0.20/0.44 | ~ environment(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_22]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_203,plain,
% 0.20/0.44 ( greater(number_of_organizations(e,appear(an_organisation,sk3_esk1_0)),zero) ),
% 0.20/0.44 inference(resolution,[status(thm)],[c_189,c_179]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_210,plain,
% 0.20/0.44 ( greater(number_of_organizations(e,appear(an_organisation,sk3_esk1_0)),zero) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_203]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_24,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ in_environment(X0,X1)
% 0.20/0.44 | ~ in_environment(X0,X2)
% 0.20/0.44 | ~ greater_or_equal(X2,X3)
% 0.20/0.44 | ~ greater_or_equal(X3,X1)
% 0.20/0.44 | in_environment(X0,X3) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_54_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_183,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ in_environment(X0,X1)
% 0.20/0.44 | ~ in_environment(X0,X2)
% 0.20/0.44 | ~ greater_or_equal(X2,X3)
% 0.20/0.44 | ~ greater_or_equal(X3,X1)
% 0.20/0.44 | in_environment(X0,X3) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_24]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_184,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ in_environment(X0,X1)
% 0.20/0.44 | ~ in_environment(X0,X2)
% 0.20/0.44 | in_environment(X0,X3)
% 0.20/0.44 | ~ greater_or_equal(X2,X3)
% 0.20/0.44 | ~ greater_or_equal(X3,X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_183]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_23,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ in_environment(X0,X1)
% 0.20/0.44 | ~ greater(appear(X2,X0),X1)
% 0.20/0.44 | cardinality_at_time(X2,X1) = zero ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_55_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_181,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ in_environment(X0,X1)
% 0.20/0.44 | ~ greater(appear(X2,X0),X1)
% 0.20/0.44 | cardinality_at_time(X2,X1) = zero ),
% 0.20/0.44 inference(copy,[status(esa)],[c_23]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_182,plain,
% 0.20/0.44 ( ~ greater(appear(X0,X1),X2)
% 0.20/0.44 | ~ environment(X1)
% 0.20/0.44 | ~ in_environment(X1,X2)
% 0.20/0.44 | cardinality_at_time(X0,X2) = zero ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_181]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_21,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.44 | in_environment(X0,X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_57_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_177,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.44 | in_environment(X0,X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_21]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_178,plain,
% 0.20/0.44 ( ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.44 | ~ environment(X0)
% 0.20/0.44 | in_environment(X0,X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_177]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_3,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.44 | subpopulation(sk2_esk1_2(X0,X1),X0,X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_11_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_141,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.44 | subpopulation(sk2_esk1_2(X0,X1),X0,X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_142,plain,
% 0.20/0.44 ( ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.44 | ~ environment(X0)
% 0.20/0.44 | subpopulation(sk2_esk1_2(X0,X1),X0,X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_141]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_32,negated_conjecture,
% 0.20/0.44 ( in_environment(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_26) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_65,negated_conjecture,
% 0.20/0.44 ( in_environment(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_32]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_85,negated_conjecture,
% 0.20/0.44 ( in_environment(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_65]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_88,negated_conjecture,
% 0.20/0.44 ( in_environment(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_85]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_95,negated_conjecture,
% 0.20/0.44 ( in_environment(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_88]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_187,negated_conjecture,
% 0.20/0.44 ( in_environment(sk3_esk1_0,sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_95]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_31,negated_conjecture,
% 0.20/0.44 ( greater(appear(efficient_producers,sk3_esk1_0),sk3_esk2_0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_25) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_63,negated_conjecture,
% 0.20/0.44 ( greater(appear(efficient_producers,sk3_esk1_0),sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_84,negated_conjecture,
% 0.20/0.44 ( greater(appear(efficient_producers,sk3_esk1_0),sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_63]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_89,negated_conjecture,
% 0.20/0.44 ( greater(appear(efficient_producers,sk3_esk1_0),sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_84]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_101,negated_conjecture,
% 0.20/0.44 ( greater(appear(efficient_producers,sk3_esk1_0),sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_89]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_199,negated_conjecture,
% 0.20/0.44 ( greater(appear(efficient_producers,sk3_esk1_0),sk3_esk2_0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_101]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_28,plain,
% 0.20/0.44 ( greater(appear(efficient_producers,e),appear(first_movers,X0))
% 0.20/0.44 | ~ environment(X0) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_23) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_57,plain,
% 0.20/0.44 ( greater(appear(efficient_producers,e),appear(first_movers,X0))
% 0.20/0.44 | ~ environment(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_28]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_81,plain,
% 0.20/0.44 ( greater(appear(efficient_producers,e),appear(first_movers,X0))
% 0.20/0.44 | ~ environment(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_57]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_92,plain,
% 0.20/0.44 ( greater(appear(efficient_producers,e),appear(first_movers,X0))
% 0.20/0.44 | ~ environment(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_81]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_98,plain,
% 0.20/0.44 ( greater(appear(efficient_producers,e),appear(first_movers,X0))
% 0.20/0.44 | ~ environment(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_92]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_193,plain,
% 0.20/0.44 ( greater(appear(efficient_producers,e),appear(first_movers,X0))
% 0.20/0.44 | ~ environment(X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_98]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_20,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ in_environment(X0,appear(first_movers,X0))
% 0.20/0.44 | in_environment(X0,appear(an_organisation,X0)) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_58_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_175,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ in_environment(X0,appear(first_movers,X0))
% 0.20/0.44 | in_environment(X0,appear(an_organisation,X0)) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_19,plain,
% 0.20/0.44 ( ~ greater(cardinality_at_time(X0,X1),zero)
% 0.20/0.44 | cardinality_at_time(X0,t) != zero ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_59_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_173,plain,
% 0.20/0.44 ( ~ greater(cardinality_at_time(X0,X1),zero)
% 0.20/0.44 | cardinality_at_time(X0,t) != zero ),
% 0.20/0.44 inference(copy,[status(esa)],[c_19]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_17,plain,
% 0.20/0.44 ( ~ greater(X0,X1) | ~ greater(X1,X2) | greater(X0,X2) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_61_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_169,plain,
% 0.20/0.44 ( ~ greater(X0,X1) | ~ greater(X1,X2) | greater(X0,X2) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_17]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_9,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ in_environment(X0,X1)
% 0.20/0.44 | subpopulation(efficient_producers,X0,X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_13_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_153,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ in_environment(X0,X1)
% 0.20/0.44 | subpopulation(efficient_producers,X0,X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_154,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | subpopulation(efficient_producers,X0,X1)
% 0.20/0.44 | ~ in_environment(X0,X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_153]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_6,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ in_environment(X0,X1)
% 0.20/0.44 | subpopulation(first_movers,X0,X1) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_12_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_147,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ in_environment(X0,X1)
% 0.20/0.44 | subpopulation(first_movers,X0,X1) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_148,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | subpopulation(first_movers,X0,X1)
% 0.20/0.44 | ~ in_environment(X0,X1) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_147]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_0,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.44 | greater(cardinality_at_time(sk2_esk1_2(X0,X1),X1),zero) ),
% 0.20/0.44 file('/export/starexec/sandbox/tmp/iprover_modulo_e742ff.p', c_0_10_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_135,plain,
% 0.20/0.44 ( ~ environment(X0)
% 0.20/0.44 | ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.44 | greater(cardinality_at_time(sk2_esk1_2(X0,X1),X1),zero) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_136,plain,
% 0.20/0.44 ( greater(cardinality_at_time(sk2_esk1_2(X0,X1),X1),zero)
% 0.20/0.44 | ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.44 | ~ environment(X0) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_135]) ).
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % ------ Statistics
% 0.20/0.44
% 0.20/0.44 % ------ General
% 0.20/0.44
% 0.20/0.44 % num_of_input_clauses: 34
% 0.20/0.44 % num_of_input_neg_conjectures: 5
% 0.20/0.44 % num_of_splits: 0
% 0.20/0.44 % num_of_split_atoms: 0
% 0.20/0.44 % num_of_sem_filtered_clauses: 0
% 0.20/0.44 % num_of_subtypes: 0
% 0.20/0.44 % monotx_restored_types: 0
% 0.20/0.44 % sat_num_of_epr_types: 0
% 0.20/0.44 % sat_num_of_non_cyclic_types: 0
% 0.20/0.44 % sat_guarded_non_collapsed_types: 0
% 0.20/0.44 % is_epr: 0
% 0.20/0.44 % is_horn: 0
% 0.20/0.44 % has_eq: 1
% 0.20/0.44 % num_pure_diseq_elim: 0
% 0.20/0.44 % simp_replaced_by: 0
% 0.20/0.44 % res_preprocessed: 13
% 0.20/0.44 % prep_upred: 0
% 0.20/0.44 % prep_unflattend: 0
% 0.20/0.44 % pred_elim_cands: 1
% 0.20/0.44 % pred_elim: 1
% 0.20/0.44 % pred_elim_cl: 1
% 0.20/0.44 % pred_elim_cycles: 2
% 0.20/0.44 % forced_gc_time: 0
% 0.20/0.44 % gc_basic_clause_elim: 0
% 0.20/0.44 % parsing_time: 0.001
% 0.20/0.44 % sem_filter_time: 0.
% 0.20/0.44 % pred_elim_time: 0.
% 0.20/0.44 % out_proof_time: 0.
% 0.20/0.44 % monotx_time: 0.
% 0.20/0.44 % subtype_inf_time: 0.
% 0.20/0.44 % unif_index_cands_time: 0.
% 0.20/0.44 % unif_index_add_time: 0.
% 0.20/0.44 % total_time: 0.03
% 0.20/0.44 % num_of_symbols: 44
% 0.20/0.44 % num_of_terms: 246
% 0.20/0.44
% 0.20/0.44 % ------ Propositional Solver
% 0.20/0.44
% 0.20/0.44 % prop_solver_calls: 1
% 0.20/0.44 % prop_fast_solver_calls: 37
% 0.20/0.44 % prop_num_of_clauses: 45
% 0.20/0.44 % prop_preprocess_simplified: 149
% 0.20/0.44 % prop_fo_subsumed: 0
% 0.20/0.44 % prop_solver_time: 0.
% 0.20/0.44 % prop_fast_solver_time: 0.
% 0.20/0.44 % prop_unsat_core_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ QBF
% 0.20/0.44
% 0.20/0.44 % qbf_q_res: 0
% 0.20/0.44 % qbf_num_tautologies: 0
% 0.20/0.44 % qbf_prep_cycles: 0
% 0.20/0.44
% 0.20/0.44 % ------ BMC1
% 0.20/0.44
% 0.20/0.44 % bmc1_current_bound: -1
% 0.20/0.44 % bmc1_last_solved_bound: -1
% 0.20/0.44 % bmc1_unsat_core_size: -1
% 0.20/0.44 % bmc1_unsat_core_parents_size: -1
% 0.20/0.44 % bmc1_merge_next_fun: 0
% 0.20/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation
% 0.20/0.44
% 0.20/0.44 % inst_num_of_clauses: 33
% 0.20/0.44 % inst_num_in_passive: 0
% 0.20/0.44 % inst_num_in_active: 0
% 0.20/0.44 % inst_num_in_unprocessed: 33
% 0.20/0.44 % inst_num_of_loops: 0
% 0.20/0.44 % inst_num_of_learning_restarts: 0
% 0.20/0.44 % inst_num_moves_active_passive: 0
% 0.20/0.44 % inst_lit_activity: 0
% 0.20/0.44 % inst_lit_activity_moves: 0
% 0.20/0.44 % inst_num_tautologies: 0
% 0.20/0.44 % inst_num_prop_implied: 0
% 0.20/0.44 % inst_num_existing_simplified: 0
% 0.20/0.44 % inst_num_eq_res_simplified: 0
% 0.20/0.44 % inst_num_child_elim: 0
% 0.20/0.44 % inst_num_of_dismatching_blockings: 0
% 0.20/0.44 % inst_num_of_non_proper_insts: 0
% 0.20/0.44 % inst_num_of_duplicates: 0
% 0.20/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.44 % inst_dismatching_checking_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Resolution
% 0.20/0.44
% 0.20/0.44 % res_num_of_clauses: 54
% 0.20/0.44 % res_num_in_passive: 0
% 0.20/0.44 % res_num_in_active: 36
% 0.20/0.44 % res_num_of_loops: 21
% 0.20/0.44 % res_forward_subset_subsumed: 8
% 0.20/0.44 % res_backward_subset_subsumed: 0
% 0.20/0.44 % res_forward_subsumed: 2
% 0.20/0.44 % res_backward_subsumed: 0
% 0.20/0.44 % res_forward_subsumption_resolution: 1
% 0.20/0.44 % res_backward_subsumption_resolution: 0
% 0.20/0.44 % res_clause_to_clause_subsumption: 4
% 0.20/0.44 % res_orphan_elimination: 0
% 0.20/0.44 % res_tautology_del: 0
% 0.20/0.44 % res_num_eq_res_simplified: 0
% 0.20/0.44 % res_num_sel_changes: 0
% 0.20/0.44 % res_moves_from_active_to_pass: 0
% 0.20/0.44
% 0.20/0.44 % Status Unknown
% 0.20/0.48 % Orienting using strategy ClausalAll
% 0.20/0.48 % FOF problem with conjecture
% 0.20/0.48 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0254e.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_e742ff.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_e15a3f | grep -v "SZS"
% 0.20/0.50
% 0.20/0.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ iProver source info
% 0.20/0.50
% 0.20/0.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.50 % git: non_committed_changes: true
% 0.20/0.50 % git: last_make_outside_of_git: true
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.20/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.51 % --bmc1_dump_file -
% 0.20/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.51 % --bmc1_ucm_extend_mode 1
% 0.20/0.51 % --bmc1_ucm_init_mode 2
% 0.20/0.51 % --bmc1_ucm_cone_mode none
% 0.20/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.51 % --bmc1_ucm_relax_model 4
% 0.20/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.51 % --bmc1_ucm_layered_model none
% 0.20/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.51
% 0.20/0.51 % ------ AIG Options
% 0.20/0.51
% 0.20/0.51 % --aig_mode false
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation Options
% 0.20/0.51
% 0.20/0.51 % --instantiation_flag true
% 0.20/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.51 % --inst_solver_per_active 750
% 0.20/0.51 % --inst_solver_calls_frac 0.5
% 0.20/0.51 % --inst_passive_queue_type priority_queues
% 0.20/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.51 % --inst_passive_queues_freq [25;2]
% 0.20/0.51 % --inst_dismatching true
% 0.20/0.51 % --inst_eager_unprocessed_to_passive true
% 0.20/0.51 % --inst_prop_sim_given true
% 0.20/0.51 % --inst_prop_sim_new false
% 0.20/0.51 % --inst_orphan_elimination true
% 0.20/0.51 % --inst_learning_loop_flag true
% 0.20/0.51 % --inst_learning_start 3000
% 0.20/0.51 % --inst_learning_factor 2
% 0.20/0.51 % --inst_start_prop_sim_after_learn 3
% 0.20/0.51 % --inst_sel_renew solver
% 0.20/0.51 % --inst_lit_activity_flag true
% 0.20/0.51 % --inst_out_proof true
% 0.20/0.51
% 0.20/0.51 % ------ Resolution Options
% 0.20/0.51
% 0.20/0.51 % --resolution_flag true
% 0.20/0.51 % --res_lit_sel kbo_max
% 0.20/0.51 % --res_to_prop_solver none
% 0.20/0.51 % --res_prop_simpl_new false
% 0.20/0.51 % --res_prop_simpl_given false
% 0.20/0.51 % --res_passive_queue_type priority_queues
% 0.20/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.51 % --res_passive_queues_freq [15;5]
% 0.20/0.51 % --res_forward_subs full
% 0.20/0.51 % --res_backward_subs full
% 0.20/0.51 % --res_forward_subs_resolution true
% 0.20/0.51 % --res_backward_subs_resolution true
% 0.20/0.51 % --res_orphan_elimination false
% 0.20/0.51 % --res_time_limit 1000.
% 0.20/0.51 % --res_out_proof true
% 0.20/0.51 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0254e.s
% 0.20/0.51 % --modulo true
% 0.20/0.51
% 0.20/0.51 % ------ Combination Options
% 0.20/0.51
% 0.20/0.51 % --comb_res_mult 1000
% 0.20/0.51 % --comb_inst_mult 300
% 0.20/0.51 % ------
% 0.20/0.51
% 0.20/0.51 % ------ Parsing...% successful
% 0.20/0.51
% 0.20/0.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.51
% 0.20/0.51 % ------ Proving...
% 0.20/0.51 % ------ Problem Properties
% 0.20/0.51
% 0.20/0.51 %
% 0.20/0.51 % EPR false
% 0.20/0.51 % Horn false
% 0.20/0.51 % Has equality true
% 0.20/0.51
% 0.20/0.51 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 % % ------ Current options:
% 0.20/0.51
% 0.20/0.51 % ------ Input Options
% 0.20/0.51
% 0.20/0.51 % --out_options all
% 0.20/0.51 % --tptp_safe_out true
% 0.20/0.51 % --problem_path ""
% 0.20/0.51 % --include_path ""
% 0.20/0.51 % --clausifier .//eprover
% 0.20/0.51 % --clausifier_options --tstp-format
% 0.20/0.51 % --stdin false
% 0.20/0.51 % --dbg_backtrace false
% 0.20/0.51 % --dbg_dump_prop_clauses false
% 0.20/0.51 % --dbg_dump_prop_clauses_file -
% 0.20/0.51 % --dbg_out_stat false
% 0.20/0.51
% 0.20/0.51 % ------ General Options
% 0.20/0.51
% 0.20/0.51 % --fof false
% 0.20/0.51 % --time_out_real 150.
% 0.20/0.51 % --time_out_prep_mult 0.2
% 0.20/0.51 % --time_out_virtual -1.
% 0.20/0.51 % --schedule none
% 0.20/0.51 % --ground_splitting input
% 0.20/0.51 % --splitting_nvd 16
% 0.20/0.51 % --non_eq_to_eq false
% 0.20/0.51 % --prep_gs_sim true
% 0.20/0.51 % --prep_unflatten false
% 0.20/0.51 % --prep_res_sim true
% 0.20/0.51 % --prep_upred true
% 0.20/0.51 % --res_sim_input true
% 0.20/0.51 % --clause_weak_htbl true
% 0.20/0.51 % --gc_record_bc_elim false
% 0.20/0.51 % --symbol_type_check false
% 0.20/0.51 % --clausify_out false
% 0.20/0.51 % --large_theory_mode false
% 0.20/0.51 % --prep_sem_filter none
% 0.20/0.51 % --prep_sem_filter_out false
% 0.20/0.51 % --preprocessed_out false
% 0.20/0.51 % --sub_typing false
% 0.20/0.51 % --brand_transform false
% 0.20/0.51 % --pure_diseq_elim true
% 0.20/0.51 % --min_unsat_core false
% 0.20/0.51 % --pred_elim true
% 0.20/0.51 % --add_important_lit false
% 0.20/0.51 % --soft_assumptions false
% 0.20/0.51 % --reset_solvers false
% 0.20/0.51 % --bc_imp_inh []
% 0.20/0.51 % --conj_cone_tolerance 1.5
% 0.20/0.51 % --prolific_symb_bound 500
% 0.20/0.51 % --lt_threshold 2000
% 0.20/0.51
% 0.20/0.51 % ------ SAT Options
% 0.20/0.51
% 0.20/0.51 % --sat_mode false
% 0.20/0.51 % --sat_fm_restart_options ""
% 0.20/0.51 % --sat_gr_def false
% 0.20/0.51 % --sat_epr_types true
% 0.20/0.51 % --sat_non_cyclic_types false
% 0.20/0.51 % --sat_finite_models false
% 0.20/0.51 % --sat_fm_lemmas false
% 0.20/0.51 % --sat_fm_prep false
% 0.20/0.51 % --sat_fm_uc_incr true
% 0.20/0.51 % --sat_out_model small
% 0.20/0.51 % --sat_out_clauses false
% 0.20/0.51
% 0.20/0.51 % ------ QBF Options
% 0.20/0.51
% 0.20/0.51 % --qbf_mode false
% 0.20/0.51 % --qbf_elim_univ true
% 0.20/0.51 % --qbf_sk_in true
% 0.20/0.51 % --qbf_pred_elim true
% 0.20/0.51 % --qbf_split 32
% 0.20/0.51
% 0.20/0.51 % ------ BMC1 Options
% 0.20/0.51
% 0.20/0.51 % --bmc1_incremental false
% 0.20/0.51 % --bmc1_axioms reachable_all
% 0.20/0.51 % --bmc1_min_bound 0
% 0.20/0.51 % --bmc1_max_bound -1
% 0.20/0.51 % --bmc1_max_bound_default -1
% 0.20/0.51 % --bmc1_symbol_reachability true
% 0.20/0.51 % --bmc1_property_lemmas false
% 0.20/0.51 % --bmc1_k_induction false
% 0.20/0.51 % --bmc1_non_equiv_states false
% 0.20/0.51 % --bmc1_deadlock false
% 0.20/0.51 % --bmc1_ucm false
% 0.20/0.51 % --bmc1_add_unsat_core none
% 0.20/0.51 % --bmc1_unsat_core_children false
% 0.20/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.51 % --bmc1_out_stat full
% 0.20/0.51 % --bmc1_ground_init false
% 0.20/0.51 % --bmc1_pre_inst_next_state false
% 0.20/0.51 % --bmc1_pre_inst_state false
% 0.20/0.51 % --bmc1_pre_inst_reach_state false
% 0.20/0.51 % --bmc1_out_unsat_core false
% 0.20/0.51 % --bmc1_aig_witness_out false
% 0.20/0.51 % --bmc1_verbose false
% 0.20/0.51 % --bmc1_dump_clauses_tptp false
% 0.20/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.51 % --bmc1_dump_file -
% 0.20/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.51 % --bmc1_ucm_extend_mode 1
% 0.20/0.51 % --bmc1_ucm_init_mode 2
% 0.20/0.51 % --bmc1_ucm_cone_mode none
% 0.20/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.51 % --bmc1_ucm_relax_model 4
% 0.20/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.51 % --bmc1_ucm_layered_model none
% 0.20/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.51
% 0.20/0.51 % ------ AIG Options
% 0.20/0.51
% 0.20/0.51 % --aig_mode false
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation Options
% 0.20/0.51
% 0.20/0.51 % --instantiation_flag true
% 0.20/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.51 % --inst_solver_per_active 750
% 0.20/0.51 % --inst_solver_calls_frac 0.5
% 0.20/0.51 % --inst_passive_queue_type priority_queues
% 0.20/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.51 % --inst_passive_queues_freq [25;2]
% 0.20/0.51 % --inst_dismatching true
% 0.20/0.51 % --inst_eager_unprocessed_to_passive true
% 0.20/0.51 % --inst_prop_sim_given true
% 1.26/1.44 % --inst_prop_sim_new false
% 1.26/1.44 % --inst_orphan_elimination true
% 1.26/1.44 % --inst_learning_loop_flag true
% 1.26/1.44 % --inst_learning_start 3000
% 1.26/1.44 % --inst_learning_factor 2
% 1.26/1.44 % --inst_start_prop_sim_after_learn 3
% 1.26/1.44 % --inst_sel_renew solver
% 1.26/1.44 % --inst_lit_activity_flag true
% 1.26/1.44 % --inst_out_proof true
% 1.26/1.44
% 1.26/1.44 % ------ Resolution Options
% 1.26/1.44
% 1.26/1.44 % --resolution_flag true
% 1.26/1.44 % --res_lit_sel kbo_max
% 1.26/1.44 % --res_to_prop_solver none
% 1.26/1.44 % --res_prop_simpl_new false
% 1.26/1.44 % --res_prop_simpl_given false
% 1.26/1.44 % --res_passive_queue_type priority_queues
% 1.26/1.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.26/1.44 % --res_passive_queues_freq [15;5]
% 1.26/1.44 % --res_forward_subs full
% 1.26/1.44 % --res_backward_subs full
% 1.26/1.44 % --res_forward_subs_resolution true
% 1.26/1.44 % --res_backward_subs_resolution true
% 1.26/1.44 % --res_orphan_elimination false
% 1.26/1.44 % --res_time_limit 1000.
% 1.26/1.44 % --res_out_proof true
% 1.26/1.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_a0254e.s
% 1.26/1.44 % --modulo true
% 1.26/1.44
% 1.26/1.44 % ------ Combination Options
% 1.26/1.44
% 1.26/1.44 % --comb_res_mult 1000
% 1.26/1.44 % --comb_inst_mult 300
% 1.26/1.44 % ------
% 1.26/1.44
% 1.26/1.44
% 1.26/1.44
% 1.26/1.44 % ------ Proving...
% 1.26/1.44 % warning: shown sat in sat incomplete mode
% 1.26/1.44 %
% 1.26/1.44
% 1.26/1.44
% 1.26/1.44 ------ Building Model...Done
% 1.26/1.44
% 1.26/1.44 %------ The model is defined over ground terms (initial term algebra).
% 1.26/1.44 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.26/1.44 %------ where \phi is a formula over the term algebra.
% 1.26/1.44 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.26/1.44 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.26/1.44 %------ See help for --sat_out_model for different model outputs.
% 1.26/1.44 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.26/1.44 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.26/1.44
% 1.26/1.44
% 1.26/1.44
% 1.26/1.44
% 1.26/1.44 %------ Positive definition of equality_sorted
% 1.26/1.44 fof(lit_def,axiom,
% 1.26/1.44 (! [X0,X0,X1] :
% 1.26/1.44 ( equality_sorted(X0,X0,X1) <=>
% 1.26/1.44 (
% 1.26/1.44 (
% 1.26/1.44 ( X0=$i & X0=sk2_esk2_0 & X1=appear(first_movers,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=$i & X0=appear(first_movers,sk2_esk1_0) & X1=appear(an_organisation,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=$i & X0=appear(first_movers,sk2_esk1_0) & X1=start_time(sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=$i & X0=cardinality_at_time(efficient_producers,sk2_esk2_0) & X1=zero )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 ).
% 1.26/1.44
% 1.26/1.44 %------ Positive definition of greater_or_equal
% 1.26/1.44 fof(lit_def,axiom,
% 1.26/1.44 (! [X0,X1] :
% 1.26/1.44 ( greater_or_equal(X0,X1) <=>
% 1.26/1.44 (
% 1.26/1.44 (
% 1.26/1.44 ( X0=appear(efficient_producers,e) & X1=appear(first_movers,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=sk2_esk2_0 & X1=appear(first_movers,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=appear(first_movers,sk2_esk1_0) & X1=appear(an_organisation,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=appear(first_movers,sk2_esk1_0) & X1=start_time(sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=appear(efficient_producers,sk2_esk1_0) & X1=sk2_esk2_0 )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=number_of_organizations(e,appear(an_organisation,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=appear(efficient_producers,e) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=sk2_esk2_0 )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=appear(efficient_producers,sk2_esk1_0) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=number_of_organizations(e,appear(an_organisation,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=start_time(sk2_esk1_0) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=number_of_organizations(sk2_esk1_0,appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=cardinality_at_time(sk1_esk1_2(sk2_esk1_0,appear(first_movers,sk2_esk1_0)),appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=number_of_organizations(e,appear(an_organisation,sk2_esk1_0)) & X1=zero )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=cardinality_at_time(efficient_producers,sk2_esk2_0) & X1=zero )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=number_of_organizations(sk2_esk1_0,appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=appear(efficient_producers,e) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=sk2_esk2_0 )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=appear(efficient_producers,sk2_esk1_0) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=number_of_organizations(e,appear(an_organisation,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=start_time(sk2_esk1_0) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=number_of_organizations(sk2_esk1_0,appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=cardinality_at_time(sk1_esk1_2(sk2_esk1_0,appear(first_movers,sk2_esk1_0)),appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=number_of_organizations(sk2_esk1_0,appear(first_movers,sk2_esk1_0)) & X1=zero )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=cardinality_at_time(sk1_esk1_2(sk2_esk1_0,appear(first_movers,sk2_esk1_0)),appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=appear(efficient_producers,e) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=sk2_esk2_0 )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=appear(efficient_producers,sk2_esk1_0) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=number_of_organizations(e,appear(an_organisation,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=start_time(sk2_esk1_0) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=number_of_organizations(sk2_esk1_0,appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=cardinality_at_time(sk1_esk1_2(sk2_esk1_0,appear(first_movers,sk2_esk1_0)),appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=cardinality_at_time(sk1_esk1_2(sk2_esk1_0,appear(first_movers,sk2_esk1_0)),appear(first_movers,sk2_esk1_0)) & X1=zero )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 ).
% 1.26/1.44
% 1.26/1.44 %------ Positive definition of environment
% 1.26/1.44 fof(lit_def,axiom,
% 1.26/1.44 (! [X0] :
% 1.26/1.44 ( environment(X0) <=>
% 1.26/1.44 (
% 1.26/1.44 (
% 1.26/1.44 ( X0=sk2_esk1_0 )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 ).
% 1.26/1.44
% 1.26/1.44 %------ Positive definition of in_environment
% 1.26/1.44 fof(lit_def,axiom,
% 1.26/1.44 (! [X0,X1] :
% 1.26/1.44 ( in_environment(X0,X1) <=>
% 1.26/1.44 (
% 1.26/1.44 (
% 1.26/1.44 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=sk2_esk1_0 & X1=appear(first_movers,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=sk2_esk1_0 & X1=appear(an_organisation,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=sk2_esk1_0 & X1=start_time(sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 ).
% 1.26/1.44
% 1.26/1.44 %------ Positive definition of greater
% 1.26/1.44 fof(lit_def,axiom,
% 1.26/1.44 (! [X0,X1] :
% 1.26/1.44 ( greater(X0,X1) <=>
% 1.26/1.44 (
% 1.26/1.44 (
% 1.26/1.44 ( X0=appear(efficient_producers,e) & X1=appear(first_movers,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=appear(efficient_producers,sk2_esk1_0) & X1=sk2_esk2_0 )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=number_of_organizations(e,appear(an_organisation,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=appear(efficient_producers,e) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=sk2_esk2_0 )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=appear(efficient_producers,sk2_esk1_0) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=number_of_organizations(e,appear(an_organisation,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=start_time(sk2_esk1_0) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=number_of_organizations(sk2_esk1_0,appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=cardinality_at_time(sk1_esk1_2(sk2_esk1_0,appear(first_movers,sk2_esk1_0)),appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=number_of_organizations(e,appear(an_organisation,sk2_esk1_0)) & X1=zero )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=number_of_organizations(sk2_esk1_0,appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=zero )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=appear(efficient_producers,e) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=sk2_esk2_0 )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=appear(efficient_producers,sk2_esk1_0) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=number_of_organizations(e,appear(an_organisation,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=start_time(sk2_esk1_0) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=number_of_organizations(sk2_esk1_0,appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=cardinality_at_time(sk1_esk1_2(sk2_esk1_0,appear(first_movers,sk2_esk1_0)),appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=number_of_organizations(sk2_esk1_0,appear(first_movers,sk2_esk1_0)) & X1=zero )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=cardinality_at_time(sk1_esk1_2(sk2_esk1_0,appear(first_movers,sk2_esk1_0)),appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=appear(efficient_producers,e) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=sk2_esk2_0 )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=appear(efficient_producers,sk2_esk1_0) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=number_of_organizations(e,appear(an_organisation,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=start_time(sk2_esk1_0) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=number_of_organizations(sk2_esk1_0,appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 &
% 1.26/1.44 ( X1!=cardinality_at_time(sk1_esk1_2(sk2_esk1_0,appear(first_movers,sk2_esk1_0)),appear(first_movers,sk2_esk1_0)) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=cardinality_at_time(sk1_esk1_2(sk2_esk1_0,appear(first_movers,sk2_esk1_0)),appear(first_movers,sk2_esk1_0)) & X1=zero )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 ).
% 1.26/1.44
% 1.26/1.44 %------ Positive definition of subpopulation
% 1.26/1.44 fof(lit_def,axiom,
% 1.26/1.44 (! [X0,X1,X2] :
% 1.26/1.44 ( subpopulation(X0,X1,X2) <=>
% 1.26/1.44 (
% 1.26/1.44 (
% 1.26/1.44 ( X0=first_movers & X1=sk2_esk1_0 & X2=sk2_esk2_0 )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=first_movers & X1=sk2_esk1_0 & X2=appear(first_movers,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=first_movers & X1=sk2_esk1_0 & X2=appear(an_organisation,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=first_movers & X1=sk2_esk1_0 & X2=start_time(sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=efficient_producers & X1=sk2_esk1_0 & X2=sk2_esk2_0 )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=efficient_producers & X1=sk2_esk1_0 & X2=appear(first_movers,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=efficient_producers & X1=sk2_esk1_0 & X2=appear(an_organisation,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=efficient_producers & X1=sk2_esk1_0 & X2=start_time(sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 |
% 1.26/1.44 (
% 1.26/1.44 ( X0=sk1_esk1_2(sk2_esk1_0,appear(first_movers,sk2_esk1_0)) & X1=sk2_esk1_0 & X2=appear(first_movers,sk2_esk1_0) )
% 1.26/1.44 )
% 1.26/1.44
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 ).
% 1.26/1.44
% 1.26/1.44 %------ Positive definition of selection_favors
% 1.26/1.44 fof(lit_def,axiom,
% 1.26/1.44 (! [X0,X1,X2] :
% 1.26/1.44 ( selection_favors(X0,X1,X2) <=>
% 1.26/1.44 $false
% 1.26/1.44 )
% 1.26/1.44 )
% 1.26/1.44 ).
% 1.26/1.44
% 1.26/1.44
% 1.26/1.44
% 1.26/1.44 % ------ Statistics
% 1.26/1.44
% 1.26/1.44 % ------ General
% 1.26/1.44
% 1.26/1.44 % num_of_input_clauses: 62
% 1.26/1.44 % num_of_input_neg_conjectures: 5
% 1.26/1.44 % num_of_splits: 0
% 1.26/1.44 % num_of_split_atoms: 0
% 1.26/1.44 % num_of_sem_filtered_clauses: 0
% 1.26/1.44 % num_of_subtypes: 0
% 1.26/1.44 % monotx_restored_types: 0
% 1.26/1.44 % sat_num_of_epr_types: 0
% 1.26/1.44 % sat_num_of_non_cyclic_types: 0
% 1.26/1.44 % sat_guarded_non_collapsed_types: 0
% 1.26/1.44 % is_epr: 0
% 1.26/1.44 % is_horn: 0
% 1.26/1.44 % has_eq: 1
% 1.26/1.44 % num_pure_diseq_elim: 0
% 1.26/1.44 % simp_replaced_by: 0
% 1.26/1.44 % res_preprocessed: 13
% 1.26/1.44 % prep_upred: 0
% 1.26/1.44 % prep_unflattend: 0
% 1.26/1.44 % pred_elim_cands: 1
% 1.26/1.44 % pred_elim: 1
% 1.26/1.44 % pred_elim_cl: 1
% 1.26/1.44 % pred_elim_cycles: 2
% 1.26/1.44 % forced_gc_time: 0
% 1.26/1.44 % gc_basic_clause_elim: 0
% 1.26/1.44 % parsing_time: 0.003
% 1.26/1.44 % sem_filter_time: 0.
% 1.26/1.44 % pred_elim_time: 0.
% 1.26/1.44 % out_proof_time: 0.
% 1.26/1.44 % monotx_time: 0.
% 1.26/1.44 % subtype_inf_time: 0.
% 1.26/1.44 % unif_index_cands_time: 0.002
% 1.26/1.44 % unif_index_add_time: 0.001
% 1.26/1.44 % total_time: 0.95
% 1.26/1.44 % num_of_symbols: 44
% 1.26/1.44 % num_of_terms: 1947
% 1.26/1.44
% 1.26/1.44 % ------ Propositional Solver
% 1.26/1.44
% 1.26/1.44 % prop_solver_calls: 11
% 1.26/1.44 % prop_fast_solver_calls: 37
% 1.26/1.44 % prop_num_of_clauses: 413
% 1.26/1.44 % prop_preprocess_simplified: 952
% 1.26/1.44 % prop_fo_subsumed: 0
% 1.26/1.44 % prop_solver_time: 0.
% 1.26/1.44 % prop_fast_solver_time: 0.
% 1.26/1.44 % prop_unsat_core_time: 0.
% 1.26/1.44
% 1.26/1.44 % ------ QBF
% 1.26/1.44
% 1.26/1.44 % qbf_q_res: 0
% 1.26/1.44 % qbf_num_tautologies: 0
% 1.26/1.44 % qbf_prep_cycles: 0
% 1.26/1.44
% 1.26/1.44 % ------ BMC1
% 1.26/1.44
% 1.26/1.44 % bmc1_current_bound: -1
% 1.26/1.44 % bmc1_last_solved_bound: -1
% 1.26/1.44 % bmc1_unsat_core_size: -1
% 1.26/1.44 % bmc1_unsat_core_parents_size: -1
% 1.26/1.44 % bmc1_merge_next_fun: 0
% 1.26/1.44 % bmc1_unsat_core_clauses_time: 0.
% 1.26/1.44
% 1.26/1.44 % ------ Instantiation
% 1.26/1.44
% 1.26/1.44 % inst_num_of_clauses: 409
% 1.26/1.44 % inst_num_in_passive: 0
% 1.26/1.44 % inst_num_in_active: 370
% 1.26/1.44 % inst_num_in_unprocessed: 0
% 1.26/1.44 % inst_num_of_loops: 423
% 1.26/1.44 % inst_num_of_learning_restarts: 0
% 1.26/1.44 % inst_num_moves_active_passive: 4
% 1.26/1.44 % inst_lit_activity: 44
% 1.26/1.44 % inst_lit_activity_moves: 0
% 1.26/1.44 % inst_num_tautologies: 39
% 1.26/1.44 % inst_num_prop_implied: 0
% 1.26/1.44 % inst_num_existing_simplified: 0
% 1.26/1.44 % inst_num_eq_res_simplified: 0
% 1.26/1.44 % inst_num_child_elim: 0
% 1.26/1.44 % inst_num_of_dismatching_blockings: 0
% 1.26/1.44 % inst_num_of_non_proper_insts: 598
% 1.26/1.44 % inst_num_of_duplicates: 353
% 1.26/1.44 % inst_inst_num_from_inst_to_res: 0
% 1.26/1.44 % inst_dismatching_checking_time: 0.
% 1.26/1.44
% 1.26/1.44 % ------ Resolution
% 1.26/1.44
% 1.26/1.44 % res_num_of_clauses: 3937
% 1.26/1.44 % res_num_in_passive: 3163
% 1.26/1.44 % res_num_in_active: 761
% 1.26/1.44 % res_num_of_loops: 2000
% 1.26/1.44 % res_forward_subset_subsumed: 2529
% 1.26/1.44 % res_backward_subset_subsumed: 32
% 1.26/1.44 % res_forward_subsumed: 1257
% 1.26/1.44 % res_backward_subsumed: 6
% 1.26/1.44 % res_forward_subsumption_resolution: 40
% 1.26/1.44 % res_backward_subsumption_resolution: 0
% 1.26/1.44 % res_clause_to_clause_subsumption: 64500
% 1.26/1.44 % res_orphan_elimination: 0
% 1.26/1.44 % res_tautology_del: 73
% 1.26/1.44 % res_num_eq_res_simplified: 0
% 1.26/1.44 % res_num_sel_changes: 0
% 1.26/1.44 % res_moves_from_active_to_pass: 0
% 1.26/1.44
% 1.26/1.44 % Status Unknown
% 1.26/1.44 % Last status :
% 1.26/1.44 % SZS status Unknown
%------------------------------------------------------------------------------