TSTP Solution File: MGT031-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT031-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n021.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:51 EDT 2022
% Result : Unknown 13.23s 13.48s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT031-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 07:35:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.40 % Orientation found
% 0.12/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/sandbox2/tmp/iprover_proof_89cc75.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_250466.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_6ea3ed | 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/sandbox2/tmp/iprover_proof_89cc75.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:2: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/sandbox2/tmp/iprover_proof_89cc75.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_30,negated_conjecture,
% 0.20/0.43 ( appear(an_organisation,sk2) != appear(first_movers,sk2) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_22) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_48,negated_conjecture,
% 0.20/0.43 ( appear(an_organisation,sk2) != appear(first_movers,sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_30]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_62,negated_conjecture,
% 0.20/0.43 ( appear(an_organisation,sk2) != appear(first_movers,sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_48]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_67,negated_conjecture,
% 0.20/0.43 ( appear(an_organisation,sk2) != appear(first_movers,sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_62]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_71,negated_conjecture,
% 0.20/0.43 ( appear(an_organisation,sk2) != appear(first_movers,sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_67]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_162,plain,
% 0.20/0.43 ( appear(an_organisation,sk2) != appear(first_movers,sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_71]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_21,plain,
% 0.20/0.43 ( ~ greater_or_equal(X0,X1) | greater(X0,X1) | X0 = X1 ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_47_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_146,plain,
% 0.20/0.43 ( ~ greater_or_equal(X0,X1) | greater(X0,X1) | X0 = X1 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_21]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_147,plain,
% 0.20/0.43 ( greater(X0,X1) | ~ greater_or_equal(X0,X1) | X0 = X1 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_146]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_172,plain,
% 0.20/0.43 ( greater(appear(an_organisation,sk2),appear(first_movers,sk2))
% 0.20/0.43 | ~ greater_or_equal(appear(an_organisation,sk2),appear(first_movers,sk2)) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_162,c_147]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_173,plain,
% 0.20/0.43 ( greater(appear(an_organisation,sk2),appear(first_movers,sk2))
% 0.20/0.43 | ~ greater_or_equal(appear(an_organisation,sk2),appear(first_movers,sk2)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_172]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_10,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1)
% 0.20/0.43 | ~ greater(appear(first_movers,X0),X1)
% 0.20/0.43 | ~ greater(cardinality_at_time(first_movers,X1),zero) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_43_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_124,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1)
% 0.20/0.43 | ~ greater(appear(first_movers,X0),X1)
% 0.20/0.43 | ~ greater(cardinality_at_time(first_movers,X1),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_125,plain,
% 0.20/0.43 ( ~ greater(cardinality_at_time(first_movers,X0),zero)
% 0.20/0.43 | ~ greater(appear(first_movers,X1),X0)
% 0.20/0.43 | ~ environment(X1)
% 0.20/0.43 | ~ in_environment(X1,X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_124]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_6,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1)
% 0.20/0.43 | ~ greater(appear(efficient_producers,X0),X1)
% 0.20/0.43 | ~ greater(cardinality_at_time(efficient_producers,X1),zero) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_42_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_116,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | ~ in_environment(X0,X1)
% 0.20/0.43 | ~ greater(appear(efficient_producers,X0),X1)
% 0.20/0.43 | ~ greater(cardinality_at_time(efficient_producers,X1),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_117,plain,
% 0.20/0.43 ( ~ greater(cardinality_at_time(efficient_producers,X0),zero)
% 0.20/0.43 | ~ greater(appear(efficient_producers,X1),X0)
% 0.20/0.43 | ~ environment(X1)
% 0.20/0.43 | ~ in_environment(X1,X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_116]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_3,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | subpopulation(sk1(X1,X0),X0,X1) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_41_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_110,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | subpopulation(sk1(X1,X0),X0,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_111,plain,
% 0.20/0.43 ( ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | subpopulation(sk1(X1,X0),X0,X1) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_110]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_32,negated_conjecture,
% 0.20/0.43 ( environment(sk2) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_24) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_52,negated_conjecture,
% 0.20/0.43 ( environment(sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_32]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_64,negated_conjecture,
% 0.20/0.43 ( environment(sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_52]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_65,negated_conjecture,
% 0.20/0.43 ( environment(sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_64]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_70,negated_conjecture,
% 0.20/0.43 ( environment(sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_65]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_160,negated_conjecture,
% 0.20/0.43 ( environment(sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_70]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_31,negated_conjecture,
% 0.20/0.43 ( in_environment(sk2,appear(an_organisation,sk2)) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_23) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_50,negated_conjecture,
% 0.20/0.43 ( in_environment(sk2,appear(an_organisation,sk2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_63,negated_conjecture,
% 0.20/0.43 ( in_environment(sk2,appear(an_organisation,sk2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_50]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_66,negated_conjecture,
% 0.20/0.43 ( in_environment(sk2,appear(an_organisation,sk2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_63]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_72,negated_conjecture,
% 0.20/0.43 ( in_environment(sk2,appear(an_organisation,sk2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_66]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_164,negated_conjecture,
% 0.20/0.43 ( in_environment(sk2,appear(an_organisation,sk2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_72]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_26,plain,
% 0.20/0.43 ( X0 != X1 | greater_or_equal(X0,X1) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_49_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_156,plain,
% 0.20/0.43 ( X0 != X1 | greater_or_equal(X0,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_26]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_157,plain,
% 0.20/0.43 ( greater_or_equal(X0,X1) | X0 != X1 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_156]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_24,plain,
% 0.20/0.43 ( ~ greater(X0,X1) | greater_or_equal(X0,X1) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_48_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_152,plain,
% 0.20/0.43 ( ~ greater(X0,X1) | greater_or_equal(X0,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_24]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_20,plain,
% 0.20/0.43 ( greater(X0,X1) | ~ greater(X2,X1) | ~ greater(X0,X2) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_46_2) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_144,plain,
% 0.20/0.43 ( greater(X0,X1) | ~ greater(X2,X1) | ~ greater(X0,X2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_19,plain,
% 0.20/0.43 ( ~ greater(X0,X1) | greater(X0,X2) | ~ greater(X1,X2) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_46_1) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_142,plain,
% 0.20/0.43 ( ~ greater(X0,X1) | greater(X0,X2) | ~ greater(X1,X2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_19]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_18,plain,
% 0.20/0.43 ( ~ greater(X0,X1) | ~ greater(X1,X2) | greater(X0,X2) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_46_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_140,plain,
% 0.20/0.43 ( ~ greater(X0,X1) | ~ greater(X1,X2) | greater(X0,X2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_16,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 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_45_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_136,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(copy,[status(esa)],[c_16]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_14,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | greater(number_of_organizations(e,appear(an_organisation,X0)),zero) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_44_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_132,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | greater(number_of_organizations(e,appear(an_organisation,X0)),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_133,plain,
% 0.20/0.43 ( greater(number_of_organizations(e,appear(an_organisation,X0)),zero)
% 0.20/0.43 | ~ environment(X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_132]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_0,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | greater(cardinality_at_time(sk1(X1,X0),X1),zero) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_250466.p', c_0_40_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_104,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | ~ greater(number_of_organizations(X0,X1),zero)
% 0.20/0.43 | greater(cardinality_at_time(sk1(X1,X0),X1),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_105,plain,
% 0.20/0.43 ( greater(cardinality_at_time(sk1(X0,X1),X0),zero)
% 0.20/0.43 | ~ greater(number_of_organizations(X1,X0),zero)
% 0.20/0.43 | ~ environment(X1) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_104]) ).
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 33
% 0.20/0.43 % num_of_input_neg_conjectures: 3
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 0
% 0.20/0.43 % is_horn: 0
% 0.20/0.43 % has_eq: 1
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 8
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 2
% 0.20/0.43 % pred_elim: 2
% 0.20/0.43 % pred_elim_cl: 2
% 0.20/0.43 % pred_elim_cycles: 3
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.001
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % unif_index_add_time: 0.
% 0.20/0.43 % total_time: 0.024
% 0.20/0.43 % num_of_symbols: 40
% 0.20/0.43 % num_of_terms: 144
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 1
% 0.20/0.43 % prop_fast_solver_calls: 23
% 0.20/0.43 % prop_num_of_clauses: 31
% 0.20/0.43 % prop_preprocess_simplified: 135
% 0.20/0.43 % prop_fo_subsumed: 0
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: 31
% 0.20/0.43 % inst_num_in_passive: 0
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 31
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: 36
% 0.20/0.43 % res_num_in_passive: 0
% 0.20/0.43 % res_num_in_active: 16
% 0.20/0.43 % res_num_of_loops: 5
% 0.20/0.43 % res_forward_subset_subsumed: 17
% 0.20/0.43 % res_backward_subset_subsumed: 0
% 0.20/0.43 % res_forward_subsumed: 0
% 0.20/0.43 % res_backward_subsumed: 0
% 0.20/0.43 % res_forward_subsumption_resolution: 0
% 0.20/0.43 % res_backward_subsumption_resolution: 0
% 0.20/0.43 % res_clause_to_clause_subsumption: 0
% 0.20/0.43 % res_orphan_elimination: 0
% 0.20/0.43 % res_tautology_del: 1
% 0.20/0.43 % res_num_eq_res_simplified: 0
% 0.20/0.43 % res_num_sel_changes: 0
% 0.20/0.43 % res_moves_from_active_to_pass: 0
% 0.20/0.43
% 0.20/0.43 % Status Unknown
% 0.20/0.47 % Orienting using strategy ClausalAll
% 0.20/0.47 % Orientation found
% 0.20/0.47 % 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/sandbox2/tmp/iprover_proof_89cc75.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_250466.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_d15837 | 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.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 0.20/0.50 % --inst_prop_sim_new false
% 0.20/0.50 % --inst_orphan_elimination true
% 0.20/0.50 % --inst_learning_loop_flag true
% 0.20/0.50 % --inst_learning_start 3000
% 0.20/0.50 % --inst_learning_factor 2
% 0.20/0.50 % --inst_start_prop_sim_after_learn 3
% 0.20/0.50 % --inst_sel_renew solver
% 0.20/0.50 % --inst_lit_activity_flag true
% 0.20/0.50 % --inst_out_proof true
% 0.20/0.50
% 0.20/0.50 % ------ Resolution Options
% 0.20/0.50
% 0.20/0.50 % --resolution_flag true
% 0.20/0.50 % --res_lit_sel kbo_max
% 0.20/0.50 % --res_to_prop_solver none
% 0.20/0.50 % --res_prop_simpl_new false
% 0.20/0.50 % --res_prop_simpl_given false
% 0.20/0.50 % --res_passive_queue_type priority_queues
% 0.20/0.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.50 % --res_passive_queues_freq [15;5]
% 0.20/0.50 % --res_forward_subs full
% 0.20/0.50 % --res_backward_subs full
% 0.20/0.50 % --res_forward_subs_resolution true
% 0.20/0.50 % --res_backward_subs_resolution true
% 0.20/0.50 % --res_orphan_elimination false
% 0.20/0.50 % --res_time_limit 1000.
% 0.20/0.50 % --res_out_proof true
% 0.20/0.50 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_89cc75.s
% 0.20/0.50 % --modulo true
% 0.20/0.50
% 0.20/0.50 % ------ Combination Options
% 0.20/0.50
% 0.20/0.50 % --comb_res_mult 1000
% 0.20/0.50 % --comb_inst_mult 300
% 0.20/0.50 % ------
% 0.20/0.50
% 0.20/0.50 % ------ Parsing...% successful
% 0.20/0.50
% 0.20/0.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.50
% 0.20/0.50 % ------ Proving...
% 0.20/0.50 % ------ Problem Properties
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % EPR false
% 0.20/0.50 % Horn false
% 0.20/0.50 % Has equality true
% 0.20/0.50
% 0.20/0.50 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 % % ------ Current options:
% 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.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 13.23/13.48 % --inst_prop_sim_new false
% 13.23/13.48 % --inst_orphan_elimination true
% 13.23/13.48 % --inst_learning_loop_flag true
% 13.23/13.48 % --inst_learning_start 3000
% 13.23/13.48 % --inst_learning_factor 2
% 13.23/13.48 % --inst_start_prop_sim_after_learn 3
% 13.23/13.48 % --inst_sel_renew solver
% 13.23/13.48 % --inst_lit_activity_flag true
% 13.23/13.48 % --inst_out_proof true
% 13.23/13.48
% 13.23/13.48 % ------ Resolution Options
% 13.23/13.48
% 13.23/13.48 % --resolution_flag true
% 13.23/13.48 % --res_lit_sel kbo_max
% 13.23/13.48 % --res_to_prop_solver none
% 13.23/13.48 % --res_prop_simpl_new false
% 13.23/13.48 % --res_prop_simpl_given false
% 13.23/13.48 % --res_passive_queue_type priority_queues
% 13.23/13.48 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 13.23/13.48 % --res_passive_queues_freq [15;5]
% 13.23/13.48 % --res_forward_subs full
% 13.23/13.48 % --res_backward_subs full
% 13.23/13.48 % --res_forward_subs_resolution true
% 13.23/13.48 % --res_backward_subs_resolution true
% 13.23/13.48 % --res_orphan_elimination false
% 13.23/13.48 % --res_time_limit 1000.
% 13.23/13.48 % --res_out_proof true
% 13.23/13.48 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_89cc75.s
% 13.23/13.48 % --modulo true
% 13.23/13.48
% 13.23/13.48 % ------ Combination Options
% 13.23/13.48
% 13.23/13.48 % --comb_res_mult 1000
% 13.23/13.48 % --comb_inst_mult 300
% 13.23/13.48 % ------
% 13.23/13.48
% 13.23/13.48
% 13.23/13.48
% 13.23/13.48 % ------ Proving...
% 13.23/13.48 % warning: shown sat in sat incomplete mode
% 13.23/13.48 %
% 13.23/13.48
% 13.23/13.48
% 13.23/13.48 ------ Building Model...Done
% 13.23/13.48
% 13.23/13.48 %------ The model is defined over ground terms (initial term algebra).
% 13.23/13.48 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 13.23/13.48 %------ where \phi is a formula over the term algebra.
% 13.23/13.48 %------ If we have equality in the problem then it is also defined as a predicate above,
% 13.23/13.48 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 13.23/13.48 %------ See help for --sat_out_model for different model outputs.
% 13.23/13.48 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 13.23/13.48 %------ where the first argument stands for the sort ($i in the unsorted case)
% 13.23/13.48
% 13.23/13.48
% 13.23/13.48
% 13.23/13.48
% 13.23/13.48 %------ Positive definition of equality_sorted
% 13.23/13.48 fof(lit_def,axiom,
% 13.23/13.48 (! [X0,X0,X1] :
% 13.23/13.48 ( equality_sorted(X0,X0,X1) <=>
% 13.23/13.48 $false
% 13.23/13.48 )
% 13.23/13.48 )
% 13.23/13.48 ).
% 13.23/13.48
% 13.23/13.48 %------ Positive definition of greater_or_equal
% 13.23/13.48 fof(lit_def,axiom,
% 13.23/13.48 (! [X0,X1] :
% 13.23/13.48 ( greater_or_equal(X0,X1) <=>
% 13.23/13.48 (
% 13.23/13.48 (
% 13.23/13.48 ( X0=appear(first_movers,sk2) & X1=appear(an_organisation,sk2) )
% 13.23/13.48 )
% 13.23/13.48
% 13.23/13.48 |
% 13.23/13.48 (
% 13.23/13.48 ( X0=number_of_organizations(e,appear(an_organisation,sk2)) )
% 13.23/13.48 &
% 13.23/13.48 ( X1!=appear(first_movers,sk2) )
% 13.23/13.48 &
% 13.23/13.48 ( X1!=number_of_organizations(e,appear(an_organisation,sk2)) )
% 13.23/13.48 )
% 13.23/13.48
% 13.23/13.48 |
% 13.23/13.48 (
% 13.23/13.48 ( X0=number_of_organizations(e,appear(an_organisation,sk2)) & X1=zero )
% 13.23/13.48 )
% 13.23/13.48
% 13.23/13.48 )
% 13.23/13.48 )
% 13.23/13.48 )
% 13.23/13.48 ).
% 13.23/13.48
% 13.23/13.48 %------ Positive definition of greater
% 13.23/13.48 fof(lit_def,axiom,
% 13.23/13.48 (! [X0,X1] :
% 13.23/13.48 ( greater(X0,X1) <=>
% 13.23/13.48 (
% 13.23/13.48 (
% 13.23/13.48 ( X0=appear(first_movers,sk2) & X1=appear(an_organisation,sk2) )
% 13.23/13.48 )
% 13.23/13.48
% 13.23/13.48 |
% 13.23/13.48 (
% 13.23/13.48 ( X0=number_of_organizations(e,appear(an_organisation,sk2)) )
% 13.23/13.48 &
% 13.23/13.48 ( X1!=appear(first_movers,sk2) )
% 13.23/13.48 &
% 13.23/13.48 ( X1!=number_of_organizations(e,appear(an_organisation,sk2)) )
% 13.23/13.48 )
% 13.23/13.48
% 13.23/13.48 |
% 13.23/13.48 (
% 13.23/13.48 ( X0=number_of_organizations(e,appear(an_organisation,sk2)) & X1=zero )
% 13.23/13.48 )
% 13.23/13.48
% 13.23/13.48 )
% 13.23/13.48 )
% 13.23/13.48 )
% 13.23/13.48 ).
% 13.23/13.48
% 13.23/13.48 %------ Positive definition of environment
% 13.23/13.48 fof(lit_def,axiom,
% 13.23/13.48 (! [X0] :
% 13.23/13.48 ( environment(X0) <=>
% 13.23/13.48 (
% 13.23/13.48 (
% 13.23/13.48 ( X0=sk2 )
% 13.23/13.48 )
% 13.23/13.48
% 13.23/13.48 )
% 13.23/13.48 )
% 13.23/13.48 )
% 13.23/13.48 ).
% 13.23/13.48
% 13.23/13.48 %------ Positive definition of in_environment
% 13.23/13.48 fof(lit_def,axiom,
% 13.23/13.48 (! [X0,X1] :
% 13.23/13.48 ( in_environment(X0,X1) <=>
% 13.23/13.48 (
% 13.23/13.48 (
% 13.23/13.48 ( X0=sk2 & X1=appear(an_organisation,sk2) )
% 13.23/13.48 )
% 13.23/13.48
% 13.23/13.48 )
% 13.23/13.48 )
% 13.23/13.48 )
% 13.23/13.48 ).
% 13.23/13.48
% 13.23/13.48
% 13.23/13.48
% 13.23/13.48 % ------ Statistics
% 13.23/13.48
% 13.23/13.48 % ------ General
% 13.23/13.48
% 13.23/13.48 % num_of_input_clauses: 33
% 13.23/13.48 % num_of_input_neg_conjectures: 3
% 13.23/13.48 % num_of_splits: 0
% 13.23/13.48 % num_of_split_atoms: 0
% 13.23/13.48 % num_of_sem_filtered_clauses: 0
% 13.23/13.48 % num_of_subtypes: 0
% 13.23/13.48 % monotx_restored_types: 0
% 13.23/13.48 % sat_num_of_epr_types: 0
% 13.23/13.48 % sat_num_of_non_cyclic_types: 0
% 13.23/13.48 % sat_guarded_non_collapsed_types: 0
% 13.23/13.48 % is_epr: 0
% 13.23/13.48 % is_horn: 0
% 13.23/13.48 % has_eq: 1
% 13.23/13.48 % num_pure_diseq_elim: 0
% 13.23/13.48 % simp_replaced_by: 0
% 13.23/13.48 % res_preprocessed: 8
% 13.23/13.48 % prep_upred: 0
% 13.23/13.48 % prep_unflattend: 0
% 13.23/13.48 % pred_elim_cands: 2
% 13.23/13.48 % pred_elim: 2
% 13.23/13.48 % pred_elim_cl: 2
% 13.23/13.48 % pred_elim_cycles: 3
% 13.23/13.48 % forced_gc_time: 0
% 13.23/13.48 % gc_basic_clause_elim: 0
% 13.23/13.48 % parsing_time: 0.001
% 13.23/13.48 % sem_filter_time: 0.
% 13.23/13.48 % pred_elim_time: 0.
% 13.23/13.48 % out_proof_time: 0.
% 13.23/13.48 % monotx_time: 0.
% 13.23/13.48 % subtype_inf_time: 0.
% 13.23/13.48 % unif_index_cands_time: 0.
% 13.23/13.48 % unif_index_add_time: 0.001
% 13.23/13.48 % total_time: 13.003
% 13.23/13.48 % num_of_symbols: 40
% 13.23/13.48 % num_of_terms: 1449
% 13.23/13.48
% 13.23/13.48 % ------ Propositional Solver
% 13.23/13.48
% 13.23/13.48 % prop_solver_calls: 5
% 13.23/13.48 % prop_fast_solver_calls: 23
% 13.23/13.48 % prop_num_of_clauses: 67
% 13.23/13.48 % prop_preprocess_simplified: 254
% 13.23/13.48 % prop_fo_subsumed: 0
% 13.23/13.48 % prop_solver_time: 0.
% 13.23/13.48 % prop_fast_solver_time: 0.
% 13.23/13.48 % prop_unsat_core_time: 0.
% 13.23/13.48
% 13.23/13.48 % ------ QBF
% 13.23/13.48
% 13.23/13.48 % qbf_q_res: 0
% 13.23/13.48 % qbf_num_tautologies: 0
% 13.23/13.48 % qbf_prep_cycles: 0
% 13.23/13.48
% 13.23/13.48 % ------ BMC1
% 13.23/13.48
% 13.23/13.48 % bmc1_current_bound: -1
% 13.23/13.48 % bmc1_last_solved_bound: -1
% 13.23/13.48 % bmc1_unsat_core_size: -1
% 13.23/13.48 % bmc1_unsat_core_parents_size: -1
% 13.23/13.48 % bmc1_merge_next_fun: 0
% 13.23/13.48 % bmc1_unsat_core_clauses_time: 0.
% 13.23/13.48
% 13.23/13.48 % ------ Instantiation
% 13.23/13.48
% 13.23/13.48 % inst_num_of_clauses: 64
% 13.23/13.48 % inst_num_in_passive: 0
% 13.23/13.48 % inst_num_in_active: 60
% 13.23/13.48 % inst_num_in_unprocessed: 0
% 13.23/13.48 % inst_num_of_loops: 72
% 13.23/13.48 % inst_num_of_learning_restarts: 0
% 13.23/13.48 % inst_num_moves_active_passive: 1
% 13.23/13.48 % inst_lit_activity: 18
% 13.23/13.48 % inst_lit_activity_moves: 0
% 13.23/13.48 % inst_num_tautologies: 4
% 13.23/13.48 % inst_num_prop_implied: 0
% 13.23/13.48 % inst_num_existing_simplified: 0
% 13.23/13.48 % inst_num_eq_res_simplified: 0
% 13.23/13.48 % inst_num_child_elim: 0
% 13.23/13.48 % inst_num_of_dismatching_blockings: 0
% 13.23/13.48 % inst_num_of_non_proper_insts: 43
% 13.23/13.48 % inst_num_of_duplicates: 40
% 13.23/13.48 % inst_inst_num_from_inst_to_res: 0
% 13.23/13.48 % inst_dismatching_checking_time: 0.
% 13.23/13.48
% 13.23/13.48 % ------ Resolution
% 13.23/13.48
% 13.23/13.48 % res_num_of_clauses: 886
% 13.23/13.48 % res_num_in_passive: 39
% 13.23/13.48 % res_num_in_active: 827
% 13.23/13.48 % res_num_of_loops: 1000
% 13.23/13.48 % res_forward_subset_subsumed: 1412
% 13.23/13.48 % res_backward_subset_subsumed: 0
% 13.23/13.48 % res_forward_subsumed: 185
% 13.23/13.48 % res_backward_subsumed: 0
% 13.23/13.48 % res_forward_subsumption_resolution: 0
% 13.23/13.48 % res_backward_subsumption_resolution: 0
% 13.23/13.48 % res_clause_to_clause_subsumption: 270036
% 13.23/13.48 % res_orphan_elimination: 0
% 13.23/13.48 % res_tautology_del: 0
% 13.23/13.48 % res_num_eq_res_simplified: 0
% 13.23/13.48 % res_num_sel_changes: 0
% 13.23/13.48 % res_moves_from_active_to_pass: 0
% 13.23/13.48
% 13.23/13.48 % Status Unknown
% 13.23/13.48 % Last status :
% 13.23/13.48 % SZS status Unknown
%------------------------------------------------------------------------------