TSTP Solution File: MGT005-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT005-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n020.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:40 EDT 2022
% Result : Unknown 169.29s 169.47s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : MGT005-2 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 10:43:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.21/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.41 % Orientation found
% 0.21/0.41 % 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_85c8ca.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c91b1b.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_6d72d4 | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 0.21/0.45 % --inst_prop_sim_given true
% 0.21/0.45 % --inst_prop_sim_new false
% 0.21/0.45 % --inst_orphan_elimination true
% 0.21/0.45 % --inst_learning_loop_flag true
% 0.21/0.45 % --inst_learning_start 3000
% 0.21/0.45 % --inst_learning_factor 2
% 0.21/0.45 % --inst_start_prop_sim_after_learn 3
% 0.21/0.45 % --inst_sel_renew solver
% 0.21/0.45 % --inst_lit_activity_flag true
% 0.21/0.45 % --inst_out_proof true
% 0.21/0.45
% 0.21/0.45 % ------ Resolution Options
% 0.21/0.45
% 0.21/0.45 % --resolution_flag true
% 0.21/0.45 % --res_lit_sel kbo_max
% 0.21/0.45 % --res_to_prop_solver none
% 0.21/0.45 % --res_prop_simpl_new false
% 0.21/0.45 % --res_prop_simpl_given false
% 0.21/0.45 % --res_passive_queue_type priority_queues
% 0.21/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.45 % --res_passive_queues_freq [15;5]
% 0.21/0.45 % --res_forward_subs full
% 0.21/0.45 % --res_backward_subs full
% 0.21/0.45 % --res_forward_subs_resolution true
% 0.21/0.45 % --res_backward_subs_resolution true
% 0.21/0.45 % --res_orphan_elimination false
% 0.21/0.45 % --res_time_limit 1000.
% 0.21/0.45 % --res_out_proof true
% 0.21/0.45 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_85c8ca.s
% 0.21/0.45 % --modulo true
% 0.21/0.45
% 0.21/0.45 % ------ Combination Options
% 0.21/0.45
% 0.21/0.45 % --comb_res_mult 1000
% 0.21/0.45 % --comb_inst_mult 300
% 0.21/0.45 % ------
% 0.21/0.45
% 0.21/0.45 % ------ Parsing...% successful
% 0.21/0.45
% 0.21/0.45 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.21/0.45
% 0.21/0.45 % ------ Proving...
% 0.21/0.45 % ------ Problem Properties
% 0.21/0.45
% 0.21/0.45 %
% 0.21/0.45 % EPR false
% 0.21/0.45 % Horn false
% 0.21/0.45 % Has equality true
% 0.21/0.45
% 0.21/0.45 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % % ------ Current options:
% 0.21/0.45
% 0.21/0.45 % ------ Input Options
% 0.21/0.45
% 0.21/0.45 % --out_options all
% 0.21/0.45 % --tptp_safe_out true
% 0.21/0.45 % --problem_path ""
% 0.21/0.45 % --include_path ""
% 0.21/0.45 % --clausifier .//eprover
% 0.21/0.45 % --clausifier_options --tstp-format
% 0.21/0.45 % --stdin false
% 0.21/0.45 % --dbg_backtrace false
% 0.21/0.45 % --dbg_dump_prop_clauses false
% 0.21/0.45 % --dbg_dump_prop_clauses_file -
% 0.21/0.45 % --dbg_out_stat false
% 0.21/0.45
% 0.21/0.45 % ------ General Options
% 0.21/0.45
% 0.21/0.45 % --fof false
% 0.21/0.45 % --time_out_real 150.
% 0.21/0.45 % --time_out_prep_mult 0.2
% 0.21/0.45 % --time_out_virtual -1.
% 0.21/0.45 % --schedule none
% 0.21/0.45 % --ground_splitting input
% 0.21/0.45 % --splitting_nvd 16
% 0.21/0.45 % --non_eq_to_eq false
% 0.21/0.45 % --prep_gs_sim true
% 0.21/0.45 % --prep_unflatten false
% 0.21/0.45 % --prep_res_sim true
% 0.21/0.45 % --prep_upred true
% 0.21/0.45 % --res_sim_input true
% 0.21/0.45 % --clause_weak_htbl true
% 0.21/0.45 % --gc_record_bc_elim false
% 0.21/0.45 % --symbol_type_check false
% 0.21/0.45 % --clausify_out false
% 0.21/0.45 % --large_theory_mode false
% 0.21/0.45 % --prep_sem_filter none
% 0.21/0.45 % --prep_sem_filter_out false
% 0.21/0.45 % --preprocessed_out false
% 0.21/0.45 % --sub_typing false
% 0.21/0.45 % --brand_transform false
% 0.21/0.45 % --pure_diseq_elim true
% 0.21/0.45 % --min_unsat_core false
% 0.21/0.45 % --pred_elim true
% 0.21/0.45 % --add_important_lit false
% 0.21/0.45 % --soft_assumptions false
% 0.21/0.45 % --reset_solvers false
% 0.21/0.45 % --bc_imp_inh []
% 0.21/0.45 % --conj_cone_tolerance 1.5
% 0.21/0.45 % --prolific_symb_bound 500
% 0.21/0.45 % --lt_threshold 2000
% 0.21/0.45
% 0.21/0.45 % ------ SAT Options
% 0.21/0.45
% 0.21/0.45 % --sat_mode false
% 0.21/0.45 % --sat_fm_restart_options ""
% 0.21/0.45 % --sat_gr_def false
% 0.21/0.45 % --sat_epr_types true
% 0.21/0.45 % --sat_non_cyclic_types false
% 0.21/0.45 % --sat_finite_models false
% 0.21/0.45 % --sat_fm_lemmas false
% 0.21/0.45 % --sat_fm_prep false
% 0.21/0.45 % --sat_fm_uc_incr true
% 0.21/0.45 % --sat_out_model small
% 0.21/0.45 % --sat_out_clauses false
% 0.21/0.45
% 0.21/0.45 % ------ QBF Options
% 0.21/0.45
% 0.21/0.45 % --qbf_mode false
% 0.21/0.45 % --qbf_elim_univ true
% 0.21/0.45 % --qbf_sk_in true
% 0.21/0.45 % --qbf_pred_elim true
% 0.21/0.45 % --qbf_split 32
% 0.21/0.45
% 0.21/0.45 % ------ BMC1 Options
% 0.21/0.45
% 0.21/0.45 % --bmc1_incremental false
% 0.21/0.45 % --bmc1_axioms reachable_all
% 0.21/0.45 % --bmc1_min_bound 0
% 0.21/0.45 % --bmc1_max_bound -1
% 0.21/0.45 % --bmc1_max_bound_default -1
% 0.21/0.45 % --bmc1_symbol_reachability true
% 0.21/0.45 % --bmc1_property_lemmas false
% 0.21/0.45 % --bmc1_k_induction false
% 0.21/0.45 % --bmc1_non_equiv_states false
% 0.21/0.45 % --bmc1_deadlock false
% 0.21/0.45 % --bmc1_ucm false
% 0.21/0.45 % --bmc1_add_unsat_core none
% 0.21/0.45 % --bmc1_unsat_core_children false
% 0.21/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.45 % --bmc1_out_stat full
% 0.21/0.45 % --bmc1_ground_init false
% 0.21/0.45 % --bmc1_pre_inst_next_state false
% 0.21/0.45 % --bmc1_pre_inst_state false
% 0.21/0.45 % --bmc1_pre_inst_reach_state false
% 0.21/0.45 % --bmc1_out_unsat_core false
% 0.21/0.45 % --bmc1_aig_witness_out false
% 0.21/0.45 % --bmc1_verbose false
% 0.21/0.45 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 0.21/0.45 % --inst_prop_sim_given true
% 60.50/60.70 % --inst_prop_sim_new false
% 60.50/60.70 % --inst_orphan_elimination true
% 60.50/60.70 % --inst_learning_loop_flag true
% 60.50/60.70 % --inst_learning_start 3000
% 60.50/60.70 % --inst_learning_factor 2
% 60.50/60.70 % --inst_start_prop_sim_after_learn 3
% 60.50/60.70 % --inst_sel_renew solver
% 60.50/60.70 % --inst_lit_activity_flag true
% 60.50/60.70 % --inst_out_proof true
% 60.50/60.70
% 60.50/60.70 % ------ Resolution Options
% 60.50/60.70
% 60.50/60.70 % --resolution_flag true
% 60.50/60.70 % --res_lit_sel kbo_max
% 60.50/60.70 % --res_to_prop_solver none
% 60.50/60.70 % --res_prop_simpl_new false
% 60.50/60.70 % --res_prop_simpl_given false
% 60.50/60.70 % --res_passive_queue_type priority_queues
% 60.50/60.70 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 60.50/60.70 % --res_passive_queues_freq [15;5]
% 60.50/60.70 % --res_forward_subs full
% 60.50/60.70 % --res_backward_subs full
% 60.50/60.70 % --res_forward_subs_resolution true
% 60.50/60.70 % --res_backward_subs_resolution true
% 60.50/60.70 % --res_orphan_elimination false
% 60.50/60.70 % --res_time_limit 1000.
% 60.50/60.70 % --res_out_proof true
% 60.50/60.70 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_85c8ca.s
% 60.50/60.70 % --modulo true
% 60.50/60.70
% 60.50/60.70 % ------ Combination Options
% 60.50/60.70
% 60.50/60.70 % --comb_res_mult 1000
% 60.50/60.70 % --comb_inst_mult 300
% 60.50/60.70 % ------
% 60.50/60.70
% 60.50/60.70
% 60.50/60.70
% 60.50/60.70 % ------ Proving...
% 60.50/60.70 % warning: shown sat in sat incomplete mode
% 60.50/60.70 %
% 60.50/60.70
% 60.50/60.70
% 60.50/60.70 ------ Building Model...Done
% 60.50/60.70
% 60.50/60.70 %------ The model is defined over ground terms (initial term algebra).
% 60.50/60.70 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 60.50/60.70 %------ where \phi is a formula over the term algebra.
% 60.50/60.70 %------ If we have equality in the problem then it is also defined as a predicate above,
% 60.50/60.70 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 60.50/60.70 %------ See help for --sat_out_model for different model outputs.
% 60.50/60.70 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 60.50/60.70 %------ where the first argument stands for the sort ($i in the unsorted case)
% 60.50/60.70
% 60.50/60.70
% 60.50/60.70
% 60.50/60.70
% 60.50/60.70 %------ Positive definition of equality_sorted
% 60.50/60.70 fof(lit_def,axiom,
% 60.50/60.70 (! [X0,X0,X1] :
% 60.50/60.70 ( equality_sorted(X0,X0,X1) <=>
% 60.50/60.70 (
% 60.50/60.70 (
% 60.50/60.70 ( X0=$i & X0=p1 & X1=p2 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=$i & X0=sk14 & X1=sk16 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=$i & X0=sk1(sk16,sk5) & X1=sk1(sk16,sk6) )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 ).
% 60.50/60.70
% 60.50/60.70 %------ Positive definition of greater
% 60.50/60.70 fof(lit_def,axiom,
% 60.50/60.70 (! [X0,X1] :
% 60.50/60.70 ( greater(X0,X1) <=>
% 60.50/60.70 (
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk17 & X1=sk15 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk17 & X1=sk16 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk13 & X1=sk12 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk16 & X1=sk15 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk9 & X1=sk1(sk16,sk5) )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk9 & X1=sk1(sk17,sk6) )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk9 & X1=sk1(sk17,sk5) )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk9 & X1=sk1(sk16,sk6) )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk1(sk15,sk6) & X1=sk1(sk17,sk6) )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk1(sk15,sk6) & X1=sk1(sk16,sk6) )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk1(sk15,sk5) & X1=sk1(sk16,sk5) )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk1(sk15,sk5) & X1=sk1(sk17,sk5) )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk1(sk17,sk5) & X1=sk1(sk16,sk5) )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk1(sk16,sk6) & X1=sk1(sk17,sk6) )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 ).
% 60.50/60.70
% 60.50/60.70 %------ Positive definition of survival_chance
% 60.50/60.70 fof(lit_def,axiom,
% 60.50/60.70 (! [X0,X1,X2] :
% 60.50/60.70 ( survival_chance(X0,X1,X2) <=>
% 60.50/60.70 (
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk6 & X1=sk11 & X2=sk14 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk6 & X1=sk9 & X2=sk15 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk6 & X1=sk1(sk15,sk6) & X2=sk15 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk6 & X1=sk1(sk17,sk6) & X2=sk17 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk6 & X1=sk1(sk16,sk6) & X2=sk16 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk5 & X1=sk10 & X2=sk14 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk5 & X1=sk9 & X2=sk15 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk5 & X1=sk1(sk16,sk5) & X2=sk16 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk5 & X1=sk1(sk15,sk5) & X2=sk15 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk5 & X1=sk1(sk17,sk5) & X2=sk17 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 ).
% 60.50/60.70
% 60.50/60.70 %------ Positive definition of organization
% 60.50/60.70 fof(lit_def,axiom,
% 60.50/60.70 (! [X0,X1] :
% 60.50/60.70 ( organization(X0,X1) <=>
% 60.50/60.70 (
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk6 & X1=sk17 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk6 & X1=sk15 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk6 & X1=sk16 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk5 & X1=sk17 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk5 & X1=sk15 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk5 & X1=sk16 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 ).
% 60.50/60.70
% 60.50/60.70 %------ Positive definition of reorganization
% 60.50/60.70 fof(lit_def,axiom,
% 60.50/60.70 (! [X0,X1,X2] :
% 60.50/60.70 ( reorganization(X0,X1,X2) <=>
% 60.50/60.70 (
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk6 & X1=sk15 & X2=sk17 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk5 & X1=sk15 & X2=sk16 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 ).
% 60.50/60.70
% 60.50/60.70 %------ Positive definition of complexity
% 60.50/60.70 fof(lit_def,axiom,
% 60.50/60.70 (! [X0,X1,X2] :
% 60.50/60.70 ( complexity(X0,X1,X2) <=>
% 60.50/60.70 (
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk6 & X1=sk13 & X2=sk15 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 |
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk5 & X1=sk12 & X2=sk15 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 ).
% 60.50/60.70
% 60.50/60.70 %------ Negative definition of reorganization_type
% 60.50/60.70 fof(lit_def,axiom,
% 60.50/60.70 (! [X0,X1,X2] :
% 60.50/60.70 ( ~(reorganization_type(X0,X1,X2)) <=>
% 60.50/60.70 $false
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 ).
% 60.50/60.70
% 60.50/60.70 %------ Negative definition of class
% 60.50/60.70 fof(lit_def,axiom,
% 60.50/60.70 (! [X0,X1,X2] :
% 60.50/60.70 ( ~(class(X0,X1,X2)) <=>
% 60.50/60.70 $false
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 ).
% 60.50/60.70
% 60.50/60.70 %------ Positive definition of reorganization_free
% 60.50/60.70 fof(lit_def,axiom,
% 60.50/60.70 (! [X0,X1,X2] :
% 60.50/60.70 ( reorganization_free(X0,X1,X2) <=>
% 60.50/60.70 (
% 60.50/60.70 (
% 60.50/60.70 ( X0=sk5 & X1=sk16 & X2=sk17 )
% 60.50/60.70 )
% 60.50/60.70
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 )
% 60.50/60.70 ).
% 60.50/60.70
% 60.50/60.70
% 60.50/60.70
% 60.50/60.70 % ------ Statistics
% 60.50/60.70
% 60.50/60.70 % ------ General
% 60.50/60.70
% 60.50/60.70 % num_of_input_clauses: 52
% 60.50/60.70 % num_of_input_neg_conjectures: 22
% 60.50/60.70 % num_of_splits: 0
% 60.50/60.70 % num_of_split_atoms: 0
% 60.50/60.70 % num_of_sem_filtered_clauses: 0
% 60.50/60.70 % num_of_subtypes: 0
% 60.50/60.70 % monotx_restored_types: 0
% 60.50/60.70 % sat_num_of_epr_types: 0
% 60.50/60.70 % sat_num_of_non_cyclic_types: 0
% 60.50/60.70 % sat_guarded_non_collapsed_types: 0
% 60.50/60.70 % is_epr: 0
% 60.50/60.70 % is_horn: 0
% 60.50/60.70 % has_eq: 1
% 60.50/60.70 % num_pure_diseq_elim: 0
% 60.50/60.70 % simp_replaced_by: 0
% 60.50/60.70 % res_preprocessed: 53
% 60.50/60.70 % prep_upred: 0
% 60.50/60.70 % prep_unflattend: 0
% 60.50/60.70 % pred_elim_cands: 0
% 60.50/60.70 % pred_elim: 0
% 60.50/60.70 % pred_elim_cl: 0
% 60.50/60.71 % pred_elim_cycles: 0
% 60.50/60.71 % forced_gc_time: 0
% 60.50/60.71 % gc_basic_clause_elim: 0
% 60.50/60.71 % parsing_time: 0.003
% 60.50/60.71 % sem_filter_time: 0.
% 60.50/60.71 % pred_elim_time: 0.
% 60.50/60.71 % out_proof_time: 0.
% 60.50/60.71 % monotx_time: 0.
% 60.50/60.71 % subtype_inf_time: 0.
% 60.50/60.71 % unif_index_cands_time: 0.086
% 60.50/60.71 % unif_index_add_time: 0.033
% 60.50/60.71 % total_time: 60.284
% 60.50/60.71 % num_of_symbols: 52
% 60.50/60.71 % num_of_terms: 34946
% 60.50/60.71
% 60.50/60.71 % ------ Propositional Solver
% 60.50/60.71
% 60.50/60.71 % prop_solver_calls: 32
% 60.50/60.71 % prop_fast_solver_calls: 246
% 60.50/60.71 % prop_num_of_clauses: 5181
% 60.50/60.71 % prop_preprocess_simplified: 14871
% 60.50/60.71 % prop_fo_subsumed: 2
% 60.50/60.71 % prop_solver_time: 0.002
% 60.50/60.71 % prop_fast_solver_time: 0.
% 60.50/60.71 % prop_unsat_core_time: 0.
% 60.50/60.71
% 60.50/60.71 % ------ QBF
% 60.50/60.71
% 60.50/60.71 % qbf_q_res: 0
% 60.50/60.71 % qbf_num_tautologies: 0
% 60.50/60.71 % qbf_prep_cycles: 0
% 60.50/60.71
% 60.50/60.71 % ------ BMC1
% 60.50/60.71
% 60.50/60.71 % bmc1_current_bound: -1
% 60.50/60.71 % bmc1_last_solved_bound: -1
% 60.50/60.71 % bmc1_unsat_core_size: -1
% 60.50/60.71 % bmc1_unsat_core_parents_size: -1
% 60.50/60.71 % bmc1_merge_next_fun: 0
% 60.50/60.71 % bmc1_unsat_core_clauses_time: 0.
% 60.50/60.71
% 60.50/60.71 % ------ Instantiation
% 60.50/60.71
% 60.50/60.71 % inst_num_of_clauses: 1929
% 60.50/60.71 % inst_num_in_passive: 0
% 60.50/60.71 % inst_num_in_active: 1928
% 60.50/60.71 % inst_num_in_unprocessed: 0
% 60.50/60.71 % inst_num_of_loops: 1939
% 60.50/60.71 % inst_num_of_learning_restarts: 1
% 60.50/60.71 % inst_num_moves_active_passive: 0
% 60.50/60.71 % inst_lit_activity: 523
% 60.50/60.71 % inst_lit_activity_moves: 0
% 60.50/60.71 % inst_num_tautologies: 1
% 60.50/60.71 % inst_num_prop_implied: 0
% 60.50/60.71 % inst_num_existing_simplified: 0
% 60.50/60.71 % inst_num_eq_res_simplified: 0
% 60.50/60.71 % inst_num_child_elim: 0
% 60.50/60.71 % inst_num_of_dismatching_blockings: 0
% 60.50/60.71 % inst_num_of_non_proper_insts: 1538
% 60.50/60.71 % inst_num_of_duplicates: 59
% 60.50/60.71 % inst_inst_num_from_inst_to_res: 0
% 60.50/60.71 % inst_dismatching_checking_time: 0.006
% 60.50/60.71
% 60.50/60.71 % ------ Resolution
% 60.50/60.71
% 60.50/60.71 % res_num_of_clauses: 150421
% 60.50/60.71 % res_num_in_passive: 141434
% 60.50/60.71 % res_num_in_active: 8730
% 60.50/60.71 % res_num_of_loops: 17000
% 60.50/60.71 % res_forward_subset_subsumed: 25885
% 60.50/60.71 % res_backward_subset_subsumed: 38
% 60.50/60.71 % res_forward_subsumed: 7354
% 60.50/60.71 % res_backward_subsumed: 572
% 60.50/60.71 % res_forward_subsumption_resolution: 1737
% 60.50/60.71 % res_backward_subsumption_resolution: 8
% 60.50/60.71 % res_clause_to_clause_subsumption: 3450905
% 60.50/60.71 % res_orphan_elimination: 0
% 60.50/60.71 % res_tautology_del: 22343
% 60.50/60.71 % res_num_eq_res_simplified: 0
% 60.50/60.71 % res_num_sel_changes: 0
% 60.50/60.71 % res_moves_from_active_to_pass: 0
% 60.50/60.71
% 60.50/60.71 % Status Unknown
% 60.54/60.73 % Orienting using strategy ClausalAll
% 60.54/60.73 % Orientation found
% 60.54/60.73 % 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_85c8ca.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c91b1b.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_ef4499 | grep -v "SZS"
% 60.54/60.74
% 60.54/60.74 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 60.54/60.74
% 60.54/60.74 %
% 60.54/60.74 % ------ iProver source info
% 60.54/60.74
% 60.54/60.74 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 60.54/60.74 % git: non_committed_changes: true
% 60.54/60.74 % git: last_make_outside_of_git: true
% 60.54/60.74
% 60.54/60.74 %
% 60.54/60.74 % ------ Input Options
% 60.54/60.74
% 60.54/60.74 % --out_options all
% 60.54/60.74 % --tptp_safe_out true
% 60.54/60.74 % --problem_path ""
% 60.54/60.74 % --include_path ""
% 60.54/60.74 % --clausifier .//eprover
% 60.54/60.74 % --clausifier_options --tstp-format
% 60.54/60.74 % --stdin false
% 60.54/60.74 % --dbg_backtrace false
% 60.54/60.74 % --dbg_dump_prop_clauses false
% 60.54/60.74 % --dbg_dump_prop_clauses_file -
% 60.54/60.74 % --dbg_out_stat false
% 60.54/60.74
% 60.54/60.74 % ------ General Options
% 60.54/60.74
% 60.54/60.74 % --fof false
% 60.54/60.74 % --time_out_real 150.
% 60.54/60.74 % --time_out_prep_mult 0.2
% 60.54/60.74 % --time_out_virtual -1.
% 60.54/60.74 % --schedule none
% 60.54/60.74 % --ground_splitting input
% 60.54/60.74 % --splitting_nvd 16
% 60.54/60.74 % --non_eq_to_eq false
% 60.54/60.74 % --prep_gs_sim true
% 60.54/60.74 % --prep_unflatten false
% 60.54/60.74 % --prep_res_sim true
% 60.54/60.74 % --prep_upred true
% 60.54/60.74 % --res_sim_input true
% 60.54/60.74 % --clause_weak_htbl true
% 60.54/60.74 % --gc_record_bc_elim false
% 60.54/60.74 % --symbol_type_check false
% 60.54/60.74 % --clausify_out false
% 60.54/60.74 % --large_theory_mode false
% 60.54/60.74 % --prep_sem_filter none
% 60.54/60.74 % --prep_sem_filter_out false
% 60.54/60.74 % --preprocessed_out false
% 60.54/60.74 % --sub_typing false
% 60.54/60.74 % --brand_transform false
% 60.54/60.74 % --pure_diseq_elim true
% 60.54/60.74 % --min_unsat_core false
% 60.54/60.74 % --pred_elim true
% 60.54/60.74 % --add_important_lit false
% 60.54/60.74 % --soft_assumptions false
% 60.54/60.74 % --reset_solvers false
% 60.54/60.74 % --bc_imp_inh []
% 60.54/60.74 % --conj_cone_tolerance 1.5
% 60.54/60.74 % --prolific_symb_bound 500
% 60.54/60.74 % --lt_threshold 2000
% 60.54/60.74
% 60.54/60.74 % ------ SAT Options
% 60.54/60.74
% 60.54/60.74 % --sat_mode false
% 60.54/60.74 % --sat_fm_restart_options ""
% 60.54/60.74 % --sat_gr_def false
% 60.54/60.74 % --sat_epr_types true
% 60.54/60.74 % --sat_non_cyclic_types false
% 60.54/60.74 % --sat_finite_models false
% 60.54/60.74 % --sat_fm_lemmas false
% 60.54/60.74 % --sat_fm_prep false
% 60.54/60.74 % --sat_fm_uc_incr true
% 60.54/60.74 % --sat_out_model small
% 60.54/60.74 % --sat_out_clauses false
% 60.54/60.74
% 60.54/60.74 % ------ QBF Options
% 60.54/60.74
% 60.54/60.74 % --qbf_mode false
% 60.54/60.74 % --qbf_elim_univ true
% 60.54/60.74 % --qbf_sk_in true
% 60.54/60.74 % --qbf_pred_elim true
% 60.54/60.74 % --qbf_split 32
% 60.54/60.74
% 60.54/60.74 % ------ BMC1 Options
% 60.54/60.74
% 60.54/60.74 % --bmc1_incremental false
% 60.54/60.74 % --bmc1_axioms reachable_all
% 60.54/60.74 % --bmc1_min_bound 0
% 60.54/60.74 % --bmc1_max_bound -1
% 60.54/60.74 % --bmc1_max_bound_default -1
% 60.54/60.74 % --bmc1_symbol_reachability true
% 60.54/60.74 % --bmc1_property_lemmas false
% 60.54/60.74 % --bmc1_k_induction false
% 60.54/60.74 % --bmc1_non_equiv_states false
% 60.54/60.74 % --bmc1_deadlock false
% 60.54/60.74 % --bmc1_ucm false
% 60.54/60.74 % --bmc1_add_unsat_core none
% 60.54/60.74 % --bmc1_unsat_core_children false
% 60.54/60.74 % --bmc1_unsat_core_extrapolate_axioms false
% 60.54/60.74 % --bmc1_out_stat full
% 60.54/60.74 % --bmc1_ground_init false
% 60.54/60.74 % --bmc1_pre_inst_next_state false
% 60.54/60.74 % --bmc1_pre_inst_state false
% 60.54/60.74 % --bmc1_pre_inst_reach_state false
% 60.54/60.74 % --bmc1_out_unsat_core false
% 60.54/60.74 % --bmc1_aig_witness_out false
% 60.54/60.74 % --bmc1_verbose false
% 60.54/60.74 % --bmc1_dump_clauses_tptp false
% 60.54/60.75 % --bmc1_dump_unsat_core_tptp false
% 60.54/60.75 % --bmc1_dump_file -
% 60.54/60.75 % --bmc1_ucm_expand_uc_limit 128
% 60.54/60.75 % --bmc1_ucm_n_expand_iterations 6
% 60.54/60.75 % --bmc1_ucm_extend_mode 1
% 60.54/60.75 % --bmc1_ucm_init_mode 2
% 60.54/60.75 % --bmc1_ucm_cone_mode none
% 60.54/60.75 % --bmc1_ucm_reduced_relation_type 0
% 60.54/60.75 % --bmc1_ucm_relax_model 4
% 60.54/60.75 % --bmc1_ucm_full_tr_after_sat true
% 60.54/60.75 % --bmc1_ucm_expand_neg_assumptions false
% 60.54/60.75 % --bmc1_ucm_layered_model none
% 60.54/60.75 % --bmc1_ucm_max_lemma_size 10
% 60.54/60.75
% 60.54/60.75 % ------ AIG Options
% 60.54/60.75
% 60.54/60.75 % --aig_mode false
% 60.54/60.75
% 60.54/60.75 % ------ Instantiation Options
% 60.54/60.75
% 60.54/60.75 % --instantiation_flag true
% 60.54/60.75 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 60.54/60.75 % --inst_solver_per_active 750
% 60.54/60.75 % --inst_solver_calls_frac 0.5
% 60.54/60.75 % --inst_passive_queue_type priority_queues
% 60.54/60.75 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 60.54/60.75 % --inst_passive_queues_freq [25;2]
% 60.54/60.75 % --inst_dismatching true
% 60.54/60.75 % --inst_eager_unprocessed_to_passive true
% 60.54/60.75 % --inst_prop_sim_given true
% 60.54/60.75 % --inst_prop_sim_new false
% 60.54/60.75 % --inst_orphan_elimination true
% 60.54/60.75 % --inst_learning_loop_flag true
% 60.54/60.75 % --inst_learning_start 3000
% 60.54/60.75 % --inst_learning_factor 2
% 60.54/60.75 % --inst_start_prop_sim_after_learn 3
% 60.54/60.75 % --inst_sel_renew solver
% 60.54/60.75 % --inst_lit_activity_flag true
% 60.54/60.75 % --inst_out_proof true
% 60.54/60.75
% 60.54/60.75 % ------ Resolution Options
% 60.54/60.75
% 60.54/60.75 % --resolution_flag true
% 60.54/60.75 % --res_lit_sel kbo_max
% 60.54/60.75 % --res_to_prop_solver none
% 60.54/60.75 % --res_prop_simpl_new false
% 60.54/60.75 % --res_prop_simpl_given false
% 60.54/60.75 % --res_passive_queue_type priority_queues
% 60.54/60.75 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 60.54/60.75 % --res_passive_queues_freq [15;5]
% 60.54/60.75 % --res_forward_subs full
% 60.54/60.75 % --res_backward_subs full
% 60.54/60.75 % --res_forward_subs_resolution true
% 60.54/60.75 % --res_backward_subs_resolution true
% 60.54/60.75 % --res_orphan_elimination false
% 60.54/60.75 % --res_time_limit 1000.
% 60.54/60.75 % --res_out_proof true
% 60.54/60.75 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_85c8ca.s
% 60.54/60.75 % --modulo true
% 60.54/60.75
% 60.54/60.75 % ------ Combination Options
% 60.54/60.75
% 60.54/60.75 % --comb_res_mult 1000
% 60.54/60.75 % --comb_inst_mult 300
% 60.54/60.75 % ------
% 60.54/60.75
% 60.54/60.75 % ------ Parsing...% successful
% 60.54/60.75
% 60.54/60.75 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 60.54/60.75
% 60.54/60.75 % ------ Proving...
% 60.54/60.75 % ------ Problem Properties
% 60.54/60.75
% 60.54/60.75 %
% 60.54/60.75 % EPR false
% 60.54/60.75 % Horn false
% 60.54/60.75 % Has equality true
% 60.54/60.75
% 60.54/60.75 % % ------ Input Options Time Limit: Unbounded
% 60.54/60.75
% 60.54/60.75
% 60.54/60.75 % % ------ Current options:
% 60.54/60.75
% 60.54/60.75 % ------ Input Options
% 60.54/60.75
% 60.54/60.75 % --out_options all
% 60.54/60.75 % --tptp_safe_out true
% 60.54/60.75 % --problem_path ""
% 60.54/60.75 % --include_path ""
% 60.54/60.75 % --clausifier .//eprover
% 60.54/60.75 % --clausifier_options --tstp-format
% 60.54/60.75 % --stdin false
% 60.54/60.75 % --dbg_backtrace false
% 60.54/60.75 % --dbg_dump_prop_clauses false
% 60.54/60.75 % --dbg_dump_prop_clauses_file -
% 60.54/60.75 % --dbg_out_stat false
% 60.54/60.75
% 60.54/60.75 % ------ General Options
% 60.54/60.75
% 60.54/60.75 % --fof false
% 60.54/60.75 % --time_out_real 150.
% 60.54/60.75 % --time_out_prep_mult 0.2
% 60.54/60.75 % --time_out_virtual -1.
% 60.54/60.75 % --schedule none
% 60.54/60.75 % --ground_splitting input
% 60.54/60.75 % --splitting_nvd 16
% 60.54/60.75 % --non_eq_to_eq false
% 60.54/60.75 % --prep_gs_sim true
% 60.54/60.75 % --prep_unflatten false
% 60.54/60.75 % --prep_res_sim true
% 60.54/60.75 % --prep_upred true
% 60.54/60.75 % --res_sim_input true
% 60.54/60.75 % --clause_weak_htbl true
% 60.54/60.75 % --gc_record_bc_elim false
% 60.54/60.75 % --symbol_type_check false
% 60.54/60.75 % --clausify_out false
% 60.54/60.75 % --large_theory_mode false
% 60.54/60.75 % --prep_sem_filter none
% 60.54/60.75 % --prep_sem_filter_out false
% 60.54/60.75 % --preprocessed_out false
% 60.54/60.75 % --sub_typing false
% 60.54/60.75 % --brand_transform false
% 60.54/60.75 % --pure_diseq_elim true
% 60.54/60.75 % --min_unsat_core false
% 60.54/60.75 % --pred_elim true
% 60.54/60.75 % --add_important_lit false
% 60.54/60.75 % --soft_assumptions false
% 60.54/60.75 % --reset_solvers false
% 60.54/60.75 % --bc_imp_inh []
% 60.54/60.75 % --conj_cone_tolerance 1.5
% 60.54/60.75 % --prolific_symb_bound 500
% 60.54/60.75 % --lt_threshold 2000
% 60.54/60.75
% 60.54/60.75 % ------ SAT Options
% 60.54/60.75
% 60.54/60.75 % --sat_mode false
% 60.54/60.75 % --sat_fm_restart_options ""
% 60.54/60.75 % --sat_gr_def false
% 60.54/60.75 % --sat_epr_types true
% 60.54/60.75 % --sat_non_cyclic_types false
% 60.54/60.75 % --sat_finite_models false
% 60.54/60.75 % --sat_fm_lemmas false
% 60.54/60.75 % --sat_fm_prep false
% 60.54/60.75 % --sat_fm_uc_incr true
% 60.54/60.75 % --sat_out_model small
% 60.54/60.75 % --sat_out_clauses false
% 60.54/60.75
% 60.54/60.75 % ------ QBF Options
% 60.54/60.75
% 60.54/60.75 % --qbf_mode false
% 60.54/60.75 % --qbf_elim_univ true
% 60.54/60.75 % --qbf_sk_in true
% 60.54/60.75 % --qbf_pred_elim true
% 60.54/60.75 % --qbf_split 32
% 60.54/60.75
% 60.54/60.75 % ------ BMC1 Options
% 60.54/60.75
% 60.54/60.75 % --bmc1_incremental false
% 60.54/60.75 % --bmc1_axioms reachable_all
% 60.54/60.75 % --bmc1_min_bound 0
% 60.54/60.75 % --bmc1_max_bound -1
% 60.54/60.75 % --bmc1_max_bound_default -1
% 60.54/60.75 % --bmc1_symbol_reachability true
% 60.54/60.75 % --bmc1_property_lemmas false
% 60.54/60.75 % --bmc1_k_induction false
% 60.54/60.75 % --bmc1_non_equiv_states false
% 60.54/60.75 % --bmc1_deadlock false
% 60.54/60.75 % --bmc1_ucm false
% 60.54/60.75 % --bmc1_add_unsat_core none
% 60.54/60.75 % --bmc1_unsat_core_children false
% 60.54/60.75 % --bmc1_unsat_core_extrapolate_axioms false
% 60.54/60.75 % --bmc1_out_stat full
% 60.54/60.75 % --bmc1_ground_init false
% 60.54/60.75 % --bmc1_pre_inst_next_state false
% 60.54/60.75 % --bmc1_pre_inst_state false
% 60.54/60.75 % --bmc1_pre_inst_reach_state false
% 60.54/60.75 % --bmc1_out_unsat_core false
% 60.54/60.75 % --bmc1_aig_witness_out false
% 60.54/60.75 % --bmc1_verbose false
% 60.54/60.75 % --bmc1_dump_clauses_tptp false
% 60.54/60.75 % --bmc1_dump_unsat_core_tptp false
% 60.54/60.75 % --bmc1_dump_file -
% 60.54/60.75 % --bmc1_ucm_expand_uc_limit 128
% 60.54/60.75 % --bmc1_ucm_n_expand_iterations 6
% 60.54/60.75 % --bmc1_ucm_extend_mode 1
% 60.54/60.75 % --bmc1_ucm_init_mode 2
% 60.54/60.75 % --bmc1_ucm_cone_mode none
% 60.54/60.75 % --bmc1_ucm_reduced_relation_type 0
% 60.54/60.75 % --bmc1_ucm_relax_model 4
% 60.54/60.75 % --bmc1_ucm_full_tr_after_sat true
% 60.54/60.75 % --bmc1_ucm_expand_neg_assumptions false
% 60.54/60.75 % --bmc1_ucm_layered_model none
% 60.54/60.75 % --bmc1_ucm_max_lemma_size 10
% 60.54/60.75
% 60.54/60.75 % ------ AIG Options
% 60.54/60.75
% 60.54/60.75 % --aig_mode false
% 60.54/60.75
% 60.54/60.75 % ------ Instantiation Options
% 60.54/60.75
% 60.54/60.75 % --instantiation_flag true
% 60.54/60.75 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 60.54/60.75 % --inst_solver_per_active 750
% 60.54/60.75 % --inst_solver_calls_frac 0.5
% 60.54/60.75 % --inst_passive_queue_type priority_queues
% 60.54/60.75 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 60.54/60.75 % --inst_passive_queues_freq [25;2]
% 60.54/60.75 % --inst_dismatching true
% 60.54/60.75 % --inst_eager_unprocessed_to_passive true
% 60.54/60.75 % --inst_prop_sim_given true
% 169.29/169.46 % --inst_prop_sim_new false
% 169.29/169.46 % --inst_orphan_elimination true
% 169.29/169.46 % --inst_learning_loop_flag true
% 169.29/169.46 % --inst_learning_start 3000
% 169.29/169.46 % --inst_learning_factor 2
% 169.29/169.46 % --inst_start_prop_sim_after_learn 3
% 169.29/169.46 % --inst_sel_renew solver
% 169.29/169.46 % --inst_lit_activity_flag true
% 169.29/169.46 % --inst_out_proof true
% 169.29/169.46
% 169.29/169.46 % ------ Resolution Options
% 169.29/169.46
% 169.29/169.46 % --resolution_flag true
% 169.29/169.46 % --res_lit_sel kbo_max
% 169.29/169.46 % --res_to_prop_solver none
% 169.29/169.46 % --res_prop_simpl_new false
% 169.29/169.46 % --res_prop_simpl_given false
% 169.29/169.46 % --res_passive_queue_type priority_queues
% 169.29/169.46 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 169.29/169.46 % --res_passive_queues_freq [15;5]
% 169.29/169.46 % --res_forward_subs full
% 169.29/169.46 % --res_backward_subs full
% 169.29/169.46 % --res_forward_subs_resolution true
% 169.29/169.46 % --res_backward_subs_resolution true
% 169.29/169.46 % --res_orphan_elimination false
% 169.29/169.46 % --res_time_limit 1000.
% 169.29/169.46 % --res_out_proof true
% 169.29/169.46 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_85c8ca.s
% 169.29/169.46 % --modulo true
% 169.29/169.46
% 169.29/169.46 % ------ Combination Options
% 169.29/169.46
% 169.29/169.46 % --comb_res_mult 1000
% 169.29/169.46 % --comb_inst_mult 300
% 169.29/169.46 % ------
% 169.29/169.46
% 169.29/169.46
% 169.29/169.46
% 169.29/169.46 % ------ Proving...
% 169.29/169.46 % warning: shown sat in sat incomplete mode
% 169.29/169.46 %
% 169.29/169.46
% 169.29/169.46
% 169.29/169.46 ------ Building Model...Done
% 169.29/169.46
% 169.29/169.46 %------ The model is defined over ground terms (initial term algebra).
% 169.29/169.46 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 169.29/169.46 %------ where \phi is a formula over the term algebra.
% 169.29/169.46 %------ If we have equality in the problem then it is also defined as a predicate above,
% 169.29/169.46 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 169.29/169.46 %------ See help for --sat_out_model for different model outputs.
% 169.29/169.46 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 169.29/169.46 %------ where the first argument stands for the sort ($i in the unsorted case)
% 169.29/169.46
% 169.29/169.46
% 169.29/169.46
% 169.29/169.46
% 169.29/169.46 %------ Positive definition of equality_sorted
% 169.29/169.46 fof(lit_def,axiom,
% 169.29/169.46 (! [X0,X0,X1] :
% 169.29/169.46 ( equality_sorted(X0,X0,X1) <=>
% 169.29/169.46 (
% 169.29/169.46 (
% 169.29/169.46 ( X0=$i & X0=sk14 & X1=sk16 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=$i & X0=sk1(sk16,sk5) & X1=sk1(sk16,sk6) )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 ).
% 169.29/169.46
% 169.29/169.46 %------ Positive definition of greater
% 169.29/169.46 fof(lit_def,axiom,
% 169.29/169.46 (! [X0,X1] :
% 169.29/169.46 ( greater(X0,X1) <=>
% 169.29/169.46 (
% 169.29/169.46 (
% 169.29/169.46 ( X0=p1 & X1=p2 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk17 & X1=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk17 & X1=sk16 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk13 & X1=sk12 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk16 & X1=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk9 & X1=sk1(sk17,sk6) )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk9 & X1=sk1(sk17,sk5) )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk9 & X1=sk1(sk16,sk5) )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk9 & X1=sk1(sk16,sk6) )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk1(sk17,sk5) & X1=sk1(sk16,sk5) )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk1(sk15,sk6) & X1=sk1(sk17,sk6) )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk1(sk15,sk6) & X1=sk1(sk16,sk6) )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk1(sk15,sk5) & X1=sk1(sk17,sk5) )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk1(sk15,sk5) & X1=sk1(sk16,sk5) )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk1(sk16,sk6) & X1=sk1(sk17,sk6) )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X1=p2 )
% 169.29/169.46 &
% 169.29/169.46 ( X0!=p2 )
% 169.29/169.46 &
% 169.29/169.46 ( X0!=sk15 )
% 169.29/169.46 &
% 169.29/169.46 ( X0!=sk12 )
% 169.29/169.46 &
% 169.29/169.46 ( X0!=sk16 )
% 169.29/169.46 &
% 169.29/169.46 ( X0!=sk1(sk17,sk6) )
% 169.29/169.46 &
% 169.29/169.46 ( X0!=sk1(sk17,sk5) )
% 169.29/169.46 &
% 169.29/169.46 ( X0!=sk1(sk16,sk5) )
% 169.29/169.46 &
% 169.29/169.46 ( X0!=sk1(sk16,sk6) )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 ).
% 169.29/169.46
% 169.29/169.46 %------ Positive definition of reorganization
% 169.29/169.46 fof(lit_def,axiom,
% 169.29/169.46 (! [X0,X1,X2] :
% 169.29/169.46 ( reorganization(X0,X1,X2) <=>
% 169.29/169.46 (
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk6 & X1=sk15 & X2=sk17 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk15 & X2=sk16 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 ).
% 169.29/169.46
% 169.29/169.46 %------ Positive definition of organization
% 169.29/169.46 fof(lit_def,axiom,
% 169.29/169.46 (! [X0,X1] :
% 169.29/169.46 ( organization(X0,X1) <=>
% 169.29/169.46 (
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk6 & X1=sk17 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk6 & X1=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk6 & X1=sk16 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk17 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk16 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 ).
% 169.29/169.46
% 169.29/169.46 %------ Positive definition of survival_chance
% 169.29/169.46 fof(lit_def,axiom,
% 169.29/169.46 (! [X0,X1,X2] :
% 169.29/169.46 ( survival_chance(X0,X1,X2) <=>
% 169.29/169.46 (
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk6 & X1=sk11 & X2=sk14 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk6 & X1=sk9 & X2=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk6 & X1=sk1(sk17,sk6) & X2=sk17 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk6 & X1=sk1(sk15,sk6) & X2=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk6 & X1=sk1(sk16,sk6) & X2=sk16 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk10 & X2=sk14 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk9 & X2=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk1(sk17,sk5) & X2=sk17 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk1(sk15,sk5) & X2=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk1(sk16,sk5) & X2=sk16 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 ).
% 169.29/169.46
% 169.29/169.46 %------ Positive definition of complexity
% 169.29/169.46 fof(lit_def,axiom,
% 169.29/169.46 (! [X0,X1,X2] :
% 169.29/169.46 ( complexity(X0,X1,X2) <=>
% 169.29/169.46 (
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk6 & X1=sk13 & X2=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk12 & X2=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 ).
% 169.29/169.46
% 169.29/169.46 %------ Positive definition of reorganization_type
% 169.29/169.46 fof(lit_def,axiom,
% 169.29/169.46 (! [X0,X1,X2] :
% 169.29/169.46 ( reorganization_type(X0,X1,X2) <=>
% 169.29/169.46 (
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk6 & X1=sk7 & X2=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk7 & X2=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 ).
% 169.29/169.46
% 169.29/169.46 %------ Positive definition of class
% 169.29/169.46 fof(lit_def,axiom,
% 169.29/169.46 (! [X0,X1,X2] :
% 169.29/169.46 ( class(X0,X1,X2) <=>
% 169.29/169.46 (
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk6 & X1=sk8 & X2=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 |
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk8 & X2=sk15 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 ).
% 169.29/169.46
% 169.29/169.46 %------ Positive definition of reorganization_free
% 169.29/169.46 fof(lit_def,axiom,
% 169.29/169.46 (! [X0,X1,X2] :
% 169.29/169.46 ( reorganization_free(X0,X1,X2) <=>
% 169.29/169.46 (
% 169.29/169.46 (
% 169.29/169.46 ( X0=sk5 & X1=sk16 & X2=sk17 )
% 169.29/169.46 )
% 169.29/169.46
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 )
% 169.29/169.46 ).
% 169.29/169.46
% 169.29/169.46
% 169.29/169.46
% 169.29/169.46 % ------ Statistics
% 169.29/169.46
% 169.29/169.46 % ------ General
% 169.29/169.46
% 169.29/169.46 % num_of_input_clauses: 52
% 169.29/169.47 % num_of_input_neg_conjectures: 22
% 169.29/169.47 % num_of_splits: 0
% 169.29/169.47 % num_of_split_atoms: 0
% 169.29/169.47 % num_of_sem_filtered_clauses: 0
% 169.29/169.47 % num_of_subtypes: 0
% 169.29/169.47 % monotx_restored_types: 0
% 169.29/169.47 % sat_num_of_epr_types: 0
% 169.29/169.47 % sat_num_of_non_cyclic_types: 0
% 169.29/169.47 % sat_guarded_non_collapsed_types: 0
% 169.29/169.47 % is_epr: 0
% 169.29/169.47 % is_horn: 0
% 169.29/169.47 % has_eq: 1
% 169.29/169.47 % num_pure_diseq_elim: 0
% 169.29/169.47 % simp_replaced_by: 0
% 169.29/169.47 % res_preprocessed: 53
% 169.29/169.47 % prep_upred: 0
% 169.29/169.47 % prep_unflattend: 0
% 169.29/169.47 % pred_elim_cands: 0
% 169.29/169.47 % pred_elim: 0
% 169.29/169.47 % pred_elim_cl: 0
% 169.29/169.47 % pred_elim_cycles: 0
% 169.29/169.47 % forced_gc_time: 0
% 169.29/169.47 % gc_basic_clause_elim: 0
% 169.29/169.47 % parsing_time: 0.001
% 169.29/169.47 % sem_filter_time: 0.
% 169.29/169.47 % pred_elim_time: 0.
% 169.29/169.47 % out_proof_time: 0.
% 169.29/169.47 % monotx_time: 0.
% 169.29/169.47 % subtype_inf_time: 0.
% 169.29/169.47 % unif_index_cands_time: 0.117
% 169.29/169.47 % unif_index_add_time: 0.02
% 169.29/169.47 % total_time: 108.727
% 169.29/169.47 % num_of_symbols: 52
% 169.29/169.47 % num_of_terms: 60039
% 169.29/169.47
% 169.29/169.47 % ------ Propositional Solver
% 169.29/169.47
% 169.29/169.47 % prop_solver_calls: 21
% 169.29/169.47 % prop_fast_solver_calls: 246
% 169.29/169.47 % prop_num_of_clauses: 4611
% 169.29/169.47 % prop_preprocess_simplified: 6881
% 169.29/169.47 % prop_fo_subsumed: 2
% 169.29/169.47 % prop_solver_time: 0.001
% 169.29/169.47 % prop_fast_solver_time: 0.
% 169.29/169.47 % prop_unsat_core_time: 0.
% 169.29/169.47
% 169.29/169.47 % ------ QBF
% 169.29/169.47
% 169.29/169.47 % qbf_q_res: 0
% 169.29/169.47 % qbf_num_tautologies: 0
% 169.29/169.47 % qbf_prep_cycles: 0
% 169.29/169.47
% 169.29/169.47 % ------ BMC1
% 169.29/169.47
% 169.29/169.47 % bmc1_current_bound: -1
% 169.29/169.47 % bmc1_last_solved_bound: -1
% 169.29/169.47 % bmc1_unsat_core_size: -1
% 169.29/169.47 % bmc1_unsat_core_parents_size: -1
% 169.29/169.47 % bmc1_merge_next_fun: 0
% 169.29/169.47 % bmc1_unsat_core_clauses_time: 0.
% 169.29/169.47
% 169.29/169.47 % ------ Instantiation
% 169.29/169.47
% 169.29/169.47 % inst_num_of_clauses: 2858
% 169.29/169.47 % inst_num_in_passive: 0
% 169.29/169.47 % inst_num_in_active: 2824
% 169.29/169.47 % inst_num_in_unprocessed: 0
% 169.29/169.47 % inst_num_of_loops: 2881
% 169.29/169.47 % inst_num_of_learning_restarts: 0
% 169.29/169.47 % inst_num_moves_active_passive: 8
% 169.29/169.47 % inst_lit_activity: 1056
% 169.29/169.47 % inst_lit_activity_moves: 0
% 169.29/169.47 % inst_num_tautologies: 32
% 169.29/169.47 % inst_num_prop_implied: 0
% 169.29/169.47 % inst_num_existing_simplified: 2
% 169.29/169.47 % inst_num_eq_res_simplified: 2
% 169.29/169.47 % inst_num_child_elim: 0
% 169.29/169.47 % inst_num_of_dismatching_blockings: 0
% 169.29/169.47 % inst_num_of_non_proper_insts: 2002
% 169.29/169.47 % inst_num_of_duplicates: 270
% 169.29/169.47 % inst_inst_num_from_inst_to_res: 0
% 169.29/169.47 % inst_dismatching_checking_time: 0.004
% 169.29/169.47
% 169.29/169.47 % ------ Resolution
% 169.29/169.47
% 169.29/169.47 % res_num_of_clauses: 448355
% 169.29/169.47 % res_num_in_passive: 442061
% 169.29/169.47 % res_num_in_active: 6286
% 169.29/169.47 % res_num_of_loops: 10000
% 169.29/169.47 % res_forward_subset_subsumed: 109533
% 169.29/169.47 % res_backward_subset_subsumed: 163
% 169.29/169.47 % res_forward_subsumed: 3490
% 169.29/169.47 % res_backward_subsumed: 70
% 169.29/169.47 % res_forward_subsumption_resolution: 472
% 169.29/169.47 % res_backward_subsumption_resolution: 17
% 169.29/169.47 % res_clause_to_clause_subsumption: 2404934
% 169.29/169.47 % res_orphan_elimination: 0
% 169.29/169.47 % res_tautology_del: 46874
% 169.29/169.47 % res_num_eq_res_simplified: 0
% 169.29/169.47 % res_num_sel_changes: 0
% 169.29/169.47 % res_moves_from_active_to_pass: 0
% 169.29/169.47
% 169.29/169.47 % Status Unknown
% 169.29/169.47 % Last status :
% 169.29/169.47 % SZS status Unknown
%------------------------------------------------------------------------------