TSTP Solution File: MGT056+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT056+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n017.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:14:04 EDT 2022
% Result : Unknown 2.05s 2.28s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT056+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 11:05:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % FOF problem with conjecture
% 0.20/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_97184d.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_ce1ca8.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_a8d920 | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.20/0.44 % --inst_prop_sim_new false
% 0.20/0.44 % --inst_orphan_elimination true
% 0.20/0.44 % --inst_learning_loop_flag true
% 0.20/0.44 % --inst_learning_start 3000
% 0.20/0.44 % --inst_learning_factor 2
% 0.20/0.44 % --inst_start_prop_sim_after_learn 3
% 0.20/0.44 % --inst_sel_renew solver
% 0.20/0.44 % --inst_lit_activity_flag true
% 0.20/0.44 % --inst_out_proof true
% 0.20/0.44
% 0.20/0.44 % ------ Resolution Options
% 0.20/0.44
% 0.20/0.44 % --resolution_flag true
% 0.20/0.44 % --res_lit_sel kbo_max
% 0.20/0.44 % --res_to_prop_solver none
% 0.20/0.44 % --res_prop_simpl_new false
% 0.20/0.44 % --res_prop_simpl_given false
% 0.20/0.44 % --res_passive_queue_type priority_queues
% 0.20/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.44 % --res_passive_queues_freq [15;5]
% 0.20/0.44 % --res_forward_subs full
% 0.20/0.44 % --res_backward_subs full
% 0.20/0.44 % --res_forward_subs_resolution true
% 0.20/0.44 % --res_backward_subs_resolution true
% 0.20/0.44 % --res_orphan_elimination false
% 0.20/0.44 % --res_time_limit 1000.
% 0.20/0.44 % --res_out_proof true
% 0.20/0.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_97184d.s
% 0.20/0.44 % --modulo true
% 0.20/0.44
% 0.20/0.44 % ------ Combination Options
% 0.20/0.44
% 0.20/0.44 % --comb_res_mult 1000
% 0.20/0.44 % --comb_inst_mult 300
% 0.20/0.44 % ------
% 0.20/0.44
% 0.20/0.44 % ------ Parsing...% successful
% 0.20/0.44
% 0.20/0.44 % ------ 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.20/0.44
% 0.20/0.44 % ------ Proving...
% 0.20/0.44 % ------ Problem Properties
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % EPR false
% 0.20/0.44 % Horn false
% 0.20/0.44 % Has equality true
% 0.20/0.44
% 0.20/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % % ------ Current options:
% 0.20/0.44
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.44 % --bmc1_dump_file -
% 0.20/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.44 % --bmc1_ucm_extend_mode 1
% 0.20/0.44 % --bmc1_ucm_init_mode 2
% 0.20/0.44 % --bmc1_ucm_cone_mode none
% 0.20/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.44 % --bmc1_ucm_relax_model 4
% 0.20/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.44 % --bmc1_ucm_layered_model none
% 0.20/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.44
% 0.20/0.44 % ------ AIG Options
% 0.20/0.44
% 0.20/0.44 % --aig_mode false
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation Options
% 0.20/0.44
% 0.20/0.44 % --instantiation_flag true
% 0.20/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.44 % --inst_solver_per_active 750
% 0.20/0.44 % --inst_solver_calls_frac 0.5
% 0.20/0.44 % --inst_passive_queue_type priority_queues
% 0.20/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.44 % --inst_passive_queues_freq [25;2]
% 0.20/0.44 % --inst_dismatching true
% 0.20/0.44 % --inst_eager_unprocessed_to_passive true
% 0.20/0.44 % --inst_prop_sim_given true
% 0.90/1.13 % --inst_prop_sim_new false
% 0.90/1.13 % --inst_orphan_elimination true
% 0.90/1.13 % --inst_learning_loop_flag true
% 0.90/1.13 % --inst_learning_start 3000
% 0.90/1.13 % --inst_learning_factor 2
% 0.90/1.13 % --inst_start_prop_sim_after_learn 3
% 0.90/1.13 % --inst_sel_renew solver
% 0.90/1.13 % --inst_lit_activity_flag true
% 0.90/1.13 % --inst_out_proof true
% 0.90/1.13
% 0.90/1.13 % ------ Resolution Options
% 0.90/1.13
% 0.90/1.13 % --resolution_flag true
% 0.90/1.13 % --res_lit_sel kbo_max
% 0.90/1.13 % --res_to_prop_solver none
% 0.90/1.13 % --res_prop_simpl_new false
% 0.90/1.13 % --res_prop_simpl_given false
% 0.90/1.13 % --res_passive_queue_type priority_queues
% 0.90/1.13 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.90/1.13 % --res_passive_queues_freq [15;5]
% 0.90/1.13 % --res_forward_subs full
% 0.90/1.13 % --res_backward_subs full
% 0.90/1.13 % --res_forward_subs_resolution true
% 0.90/1.13 % --res_backward_subs_resolution true
% 0.90/1.13 % --res_orphan_elimination false
% 0.90/1.13 % --res_time_limit 1000.
% 0.90/1.13 % --res_out_proof true
% 0.90/1.13 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_97184d.s
% 0.90/1.13 % --modulo true
% 0.90/1.13
% 0.90/1.13 % ------ Combination Options
% 0.90/1.13
% 0.90/1.13 % --comb_res_mult 1000
% 0.90/1.13 % --comb_inst_mult 300
% 0.90/1.13 % ------
% 0.90/1.13
% 0.90/1.13
% 0.90/1.13
% 0.90/1.13 % ------ Proving...
% 0.90/1.13 % warning: shown sat in sat incomplete mode
% 0.90/1.13 %
% 0.90/1.13
% 0.90/1.13
% 0.90/1.13 ------ Building Model...Done
% 0.90/1.13
% 0.90/1.13 %------ The model is defined over ground terms (initial term algebra).
% 0.90/1.13 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 0.90/1.13 %------ where \phi is a formula over the term algebra.
% 0.90/1.13 %------ If we have equality in the problem then it is also defined as a predicate above,
% 0.90/1.13 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 0.90/1.13 %------ See help for --sat_out_model for different model outputs.
% 0.90/1.13 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 0.90/1.13 %------ where the first argument stands for the sort ($i in the unsorted case)
% 0.90/1.13
% 0.90/1.13
% 0.90/1.13
% 0.90/1.13
% 0.90/1.13 %------ Negative definition of equality_sorted
% 0.90/1.13 fof(lit_def,axiom,
% 0.90/1.13 (! [X0,X0,X1] :
% 0.90/1.13 ( ~(equality_sorted(X0,X0,X1)) <=>
% 0.90/1.13 (
% 0.90/1.13 (
% 0.90/1.13 ( X0=$i & X0=hazard_of_mortality(sk3_esk1_0,sk3_esk2_0) & X1=hazard_of_mortality(sk3_esk1_0,sk3_esk3_0) )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=$i & X0=age(sk3_esk1_0,sk3_esk4_0) & X1=eta )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=$i & X0=age(sk3_esk1_0,sk3_esk2_0) & X1=eta )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 ).
% 0.90/1.13
% 0.90/1.13 %------ Positive definition of greater
% 0.90/1.13 fof(lit_def,axiom,
% 0.90/1.13 (! [X0,X1] :
% 0.90/1.13 ( greater(X0,X1) <=>
% 0.90/1.13 (
% 0.90/1.13 (
% 0.90/1.13 ( X0=hazard_of_mortality(sk3_esk1_0,sk3_esk2_0) & X1=hazard_of_mortality(sk3_esk1_0,sk3_esk3_0) )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 ? [X2] :
% 0.90/1.13 (
% 0.90/1.13 ( X0=hazard_of_mortality(sk3_esk1_0,sk3_esk2_0) & X1=hazard_of_mortality(sk3_esk1_0,X2) )
% 0.90/1.13 &
% 0.90/1.13 ( X2!=sk3_esk2_0 )
% 0.90/1.13 &
% 0.90/1.13 ( X2!=sk3_esk3_0 )
% 0.90/1.13 &
% 0.90/1.13 ( X2!=sk3_esk4_0 )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=hazard_of_mortality(sk3_esk1_0,sk3_esk4_0) & X1=hazard_of_mortality(sk3_esk1_0,sk3_esk3_0) )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 ? [X2] :
% 0.90/1.13 (
% 0.90/1.13 ( X0=hazard_of_mortality(sk3_esk1_0,sk3_esk4_0) & X1=hazard_of_mortality(sk3_esk1_0,X2) )
% 0.90/1.13 &
% 0.90/1.13 ( X2!=sk3_esk2_0 )
% 0.90/1.13 &
% 0.90/1.13 ( X2!=sk3_esk3_0 )
% 0.90/1.13 &
% 0.90/1.13 ( X2!=sk3_esk4_0 )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=age(sk3_esk1_0,sk3_esk4_0) )
% 0.90/1.13 &
% 0.90/1.13 ( X1!=eta )
% 0.90/1.13 &
% 0.90/1.13 ( X1!=age(sk3_esk1_0,sk3_esk4_0) )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=age(sk3_esk1_0,sk3_esk4_0) & X1=eta )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=age(sk3_esk1_0,sk3_esk2_0) & X1=eta )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=sigma & X1=zero )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 ).
% 0.90/1.13
% 0.90/1.13 %------ Positive definition of smaller
% 0.90/1.13 fof(lit_def,axiom,
% 0.90/1.13 (! [X0,X1] :
% 0.90/1.13 ( smaller(X0,X1) <=>
% 0.90/1.13 (
% 0.90/1.13 (
% 0.90/1.13 ( X0=eta & X1=age(sk3_esk1_0,sk3_esk4_0) )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=eta & X1=age(sk3_esk1_0,sk3_esk2_0) )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=hazard_of_mortality(sk3_esk1_0,sk3_esk3_0) & X1=hazard_of_mortality(sk3_esk1_0,sk3_esk2_0) )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=hazard_of_mortality(sk3_esk1_0,sk3_esk3_0) & X1=hazard_of_mortality(sk3_esk1_0,sk3_esk4_0) )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=zero & X1=sigma )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 ? [X2] :
% 0.90/1.13 (
% 0.90/1.13 ( X0=hazard_of_mortality(sk3_esk1_0,X2) & X1=hazard_of_mortality(sk3_esk1_0,sk3_esk2_0) )
% 0.90/1.13 &
% 0.90/1.13 ( X2!=sk3_esk2_0 )
% 0.90/1.13 &
% 0.90/1.13 ( X2!=sk3_esk4_0 )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 ? [X2] :
% 0.90/1.13 (
% 0.90/1.13 ( X0=hazard_of_mortality(sk3_esk1_0,X2) & X1=hazard_of_mortality(sk3_esk1_0,sk3_esk4_0) )
% 0.90/1.13 &
% 0.90/1.13 ( X2!=sk3_esk2_0 )
% 0.90/1.13 &
% 0.90/1.13 ( X2!=sk3_esk4_0 )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X1=age(sk3_esk1_0,sk3_esk4_0) )
% 0.90/1.13 &
% 0.90/1.13 ( X0!=age(sk3_esk1_0,sk3_esk4_0) )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 ).
% 0.90/1.13
% 0.90/1.13 %------ Positive definition of has_endowment
% 0.90/1.13 fof(lit_def,axiom,
% 0.90/1.13 (! [X0] :
% 0.90/1.13 ( has_endowment(X0) <=>
% 0.90/1.13 (
% 0.90/1.13 (
% 0.90/1.13 ( X0=sk3_esk1_0 )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 ).
% 0.90/1.13
% 0.90/1.13 %------ Positive definition of organization
% 0.90/1.13 fof(lit_def,axiom,
% 0.90/1.13 (! [X0] :
% 0.90/1.13 ( organization(X0) <=>
% 0.90/1.13 (
% 0.90/1.13 (
% 0.90/1.13 ( X0=sk3_esk1_0 )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 ).
% 0.90/1.13
% 0.90/1.13 %------ Negative definition of smaller_or_equal
% 0.90/1.13 fof(lit_def,axiom,
% 0.90/1.13 (! [X0,X1] :
% 0.90/1.13 ( ~(smaller_or_equal(X0,X1)) <=>
% 0.90/1.13 (
% 0.90/1.13 (
% 0.90/1.13 ( X0=hazard_of_mortality(sk3_esk1_0,sk3_esk2_0) & X1=hazard_of_mortality(sk3_esk1_0,sk3_esk3_0) )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=age(sk3_esk1_0,sk3_esk4_0) & X1=eta )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=age(sk3_esk1_0,sk3_esk2_0) & X1=eta )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 ).
% 0.90/1.13
% 0.90/1.13 %------ Negative definition of greater_or_equal
% 0.90/1.13 fof(lit_def,axiom,
% 0.90/1.13 (! [X0,X1] :
% 0.90/1.13 ( ~(greater_or_equal(X0,X1)) <=>
% 0.90/1.13 $false
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 ).
% 0.90/1.13
% 0.90/1.13 %------ Negative definition of has_immunity
% 0.90/1.13 fof(lit_def,axiom,
% 0.90/1.13 (! [X0,X1] :
% 0.90/1.13 ( ~(has_immunity(X0,X1)) <=>
% 0.90/1.13 (
% 0.90/1.13 (
% 0.90/1.13 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 |
% 0.90/1.13 (
% 0.90/1.13 ( X0=sk3_esk1_0 & X1=sk3_esk4_0 )
% 0.90/1.13 )
% 0.90/1.13
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 )
% 0.90/1.13 ).
% 0.90/1.13
% 0.90/1.13
% 0.90/1.13
% 0.90/1.13 % ------ Statistics
% 0.90/1.13
% 0.90/1.13 % ------ General
% 0.90/1.13
% 0.90/1.13 % num_of_input_clauses: 31
% 0.90/1.13 % num_of_input_neg_conjectures: 8
% 0.90/1.13 % num_of_splits: 0
% 0.90/1.13 % num_of_split_atoms: 0
% 0.90/1.13 % num_of_sem_filtered_clauses: 0
% 0.90/1.13 % num_of_subtypes: 0
% 0.90/1.13 % monotx_restored_types: 0
% 0.90/1.13 % sat_num_of_epr_types: 0
% 0.90/1.13 % sat_num_of_non_cyclic_types: 0
% 0.90/1.13 % sat_guarded_non_collapsed_types: 0
% 0.90/1.13 % is_epr: 0
% 0.90/1.13 % is_horn: 0
% 0.90/1.13 % has_eq: 1
% 0.90/1.13 % num_pure_diseq_elim: 0
% 0.90/1.13 % simp_replaced_by: 0
% 0.90/1.13 % res_preprocessed: 16
% 0.90/1.13 % prep_upred: 0
% 0.90/1.13 % prep_unflattend: 0
% 0.90/1.13 % pred_elim_cands: 0
% 0.90/1.13 % pred_elim: 0
% 0.90/1.13 % pred_elim_cl: 0
% 0.90/1.13 % pred_elim_cycles: 0
% 0.90/1.13 % forced_gc_time: 0
% 0.90/1.13 % gc_basic_clause_elim: 0
% 0.90/1.13 % parsing_time: 0.001
% 0.90/1.13 % sem_filter_time: 0.
% 0.90/1.13 % pred_elim_time: 0.
% 0.90/1.13 % out_proof_time: 0.
% 0.90/1.13 % monotx_time: 0.
% 0.90/1.13 % subtype_inf_time: 0.
% 0.90/1.13 % unif_index_cands_time: 0.001
% 0.90/1.13 % unif_index_add_time: 0.001
% 0.90/1.13 % total_time: 0.713
% 0.90/1.13 % num_of_symbols: 43
% 0.90/1.13 % num_of_terms: 1221
% 0.90/1.13
% 0.90/1.13 % ------ Propositional Solver
% 0.90/1.13
% 0.90/1.13 % prop_solver_calls: 13
% 0.90/1.13 % prop_fast_solver_calls: 27
% 0.90/1.13 % prop_num_of_clauses: 170
% 0.90/1.13 % prop_preprocess_simplified: 378
% 0.90/1.13 % prop_fo_subsumed: 0
% 0.90/1.13 % prop_solver_time: 0.
% 0.90/1.13 % prop_fast_solver_time: 0.
% 0.90/1.13 % prop_unsat_core_time: 0.
% 0.90/1.13
% 0.90/1.13 % ------ QBF
% 0.90/1.13
% 0.90/1.13 % qbf_q_res: 0
% 0.90/1.13 % qbf_num_tautologies: 0
% 0.90/1.13 % qbf_prep_cycles: 0
% 0.90/1.13
% 0.90/1.13 % ------ BMC1
% 0.90/1.13
% 0.90/1.13 % bmc1_current_bound: -1
% 0.90/1.13 % bmc1_last_solved_bound: -1
% 0.90/1.13 % bmc1_unsat_core_size: -1
% 0.90/1.13 % bmc1_unsat_core_parents_size: -1
% 0.90/1.13 % bmc1_merge_next_fun: 0
% 0.90/1.13 % bmc1_unsat_core_clauses_time: 0.
% 0.90/1.13
% 0.90/1.13 % ------ Instantiation
% 0.90/1.13
% 0.90/1.13 % inst_num_of_clauses: 152
% 0.90/1.13 % inst_num_in_passive: 0
% 0.90/1.13 % inst_num_in_active: 141
% 0.90/1.13 % inst_num_in_unprocessed: 0
% 0.90/1.13 % inst_num_of_loops: 201
% 0.90/1.13 % inst_num_of_learning_restarts: 0
% 0.90/1.13 % inst_num_moves_active_passive: 36
% 0.90/1.13 % inst_lit_activity: 22
% 0.90/1.13 % inst_lit_activity_moves: 0
% 0.90/1.13 % inst_num_tautologies: 11
% 0.90/1.13 % inst_num_prop_implied: 0
% 0.90/1.13 % inst_num_existing_simplified: 0
% 0.90/1.13 % inst_num_eq_res_simplified: 0
% 0.90/1.13 % inst_num_child_elim: 0
% 0.90/1.13 % inst_num_of_dismatching_blockings: 21
% 0.90/1.13 % inst_num_of_non_proper_insts: 231
% 0.90/1.13 % inst_num_of_duplicates: 64
% 0.90/1.13 % inst_inst_num_from_inst_to_res: 0
% 0.90/1.13 % inst_dismatching_checking_time: 0.
% 0.90/1.13
% 0.90/1.13 % ------ Resolution
% 0.90/1.13
% 0.90/1.13 % res_num_of_clauses: 1857
% 0.90/1.13 % res_num_in_passive: 1200
% 0.90/1.13 % res_num_in_active: 642
% 0.90/1.13 % res_num_of_loops: 1000
% 0.90/1.13 % res_forward_subset_subsumed: 437
% 0.90/1.13 % res_backward_subset_subsumed: 0
% 0.90/1.13 % res_forward_subsumed: 375
% 0.90/1.13 % res_backward_subsumed: 3
% 0.90/1.13 % res_forward_subsumption_resolution: 16
% 0.90/1.13 % res_backward_subsumption_resolution: 0
% 0.90/1.13 % res_clause_to_clause_subsumption: 72848
% 0.90/1.13 % res_orphan_elimination: 0
% 0.90/1.13 % res_tautology_del: 17
% 0.90/1.13 % res_num_eq_res_simplified: 0
% 0.90/1.13 % res_num_sel_changes: 0
% 0.90/1.13 % res_moves_from_active_to_pass: 0
% 0.90/1.13
% 0.90/1.14 % Status Unknown
% 0.90/1.17 % Orienting using strategy ClausalAll
% 0.90/1.17 % FOF problem with conjecture
% 0.90/1.17 % 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_97184d.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_ce1ca8.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_982065 | grep -v "SZS"
% 1.01/1.19
% 1.01/1.19 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.01/1.19
% 1.01/1.19 %
% 1.01/1.19 % ------ iProver source info
% 1.01/1.19
% 1.01/1.19 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.01/1.19 % git: non_committed_changes: true
% 1.01/1.19 % git: last_make_outside_of_git: true
% 1.01/1.19
% 1.01/1.19 %
% 1.01/1.19 % ------ Input Options
% 1.01/1.19
% 1.01/1.19 % --out_options all
% 1.01/1.19 % --tptp_safe_out true
% 1.01/1.19 % --problem_path ""
% 1.01/1.19 % --include_path ""
% 1.01/1.19 % --clausifier .//eprover
% 1.01/1.19 % --clausifier_options --tstp-format
% 1.01/1.19 % --stdin false
% 1.01/1.19 % --dbg_backtrace false
% 1.01/1.19 % --dbg_dump_prop_clauses false
% 1.01/1.19 % --dbg_dump_prop_clauses_file -
% 1.01/1.19 % --dbg_out_stat false
% 1.01/1.19
% 1.01/1.19 % ------ General Options
% 1.01/1.19
% 1.01/1.19 % --fof false
% 1.01/1.19 % --time_out_real 150.
% 1.01/1.19 % --time_out_prep_mult 0.2
% 1.01/1.19 % --time_out_virtual -1.
% 1.01/1.19 % --schedule none
% 1.01/1.19 % --ground_splitting input
% 1.01/1.19 % --splitting_nvd 16
% 1.01/1.19 % --non_eq_to_eq false
% 1.01/1.19 % --prep_gs_sim true
% 1.01/1.19 % --prep_unflatten false
% 1.01/1.19 % --prep_res_sim true
% 1.01/1.19 % --prep_upred true
% 1.01/1.19 % --res_sim_input true
% 1.01/1.19 % --clause_weak_htbl true
% 1.01/1.19 % --gc_record_bc_elim false
% 1.01/1.19 % --symbol_type_check false
% 1.01/1.19 % --clausify_out false
% 1.01/1.19 % --large_theory_mode false
% 1.01/1.19 % --prep_sem_filter none
% 1.01/1.19 % --prep_sem_filter_out false
% 1.01/1.19 % --preprocessed_out false
% 1.01/1.19 % --sub_typing false
% 1.01/1.19 % --brand_transform false
% 1.01/1.19 % --pure_diseq_elim true
% 1.01/1.19 % --min_unsat_core false
% 1.01/1.19 % --pred_elim true
% 1.01/1.19 % --add_important_lit false
% 1.01/1.19 % --soft_assumptions false
% 1.01/1.19 % --reset_solvers false
% 1.01/1.19 % --bc_imp_inh []
% 1.01/1.19 % --conj_cone_tolerance 1.5
% 1.01/1.19 % --prolific_symb_bound 500
% 1.01/1.19 % --lt_threshold 2000
% 1.01/1.19
% 1.01/1.19 % ------ SAT Options
% 1.01/1.19
% 1.01/1.19 % --sat_mode false
% 1.01/1.19 % --sat_fm_restart_options ""
% 1.01/1.19 % --sat_gr_def false
% 1.01/1.19 % --sat_epr_types true
% 1.01/1.19 % --sat_non_cyclic_types false
% 1.01/1.19 % --sat_finite_models false
% 1.01/1.19 % --sat_fm_lemmas false
% 1.01/1.19 % --sat_fm_prep false
% 1.01/1.19 % --sat_fm_uc_incr true
% 1.01/1.19 % --sat_out_model small
% 1.01/1.19 % --sat_out_clauses false
% 1.01/1.19
% 1.01/1.19 % ------ QBF Options
% 1.01/1.19
% 1.01/1.19 % --qbf_mode false
% 1.01/1.19 % --qbf_elim_univ true
% 1.01/1.19 % --qbf_sk_in true
% 1.01/1.19 % --qbf_pred_elim true
% 1.01/1.19 % --qbf_split 32
% 1.01/1.19
% 1.01/1.19 % ------ BMC1 Options
% 1.01/1.19
% 1.01/1.19 % --bmc1_incremental false
% 1.01/1.19 % --bmc1_axioms reachable_all
% 1.01/1.19 % --bmc1_min_bound 0
% 1.01/1.19 % --bmc1_max_bound -1
% 1.01/1.19 % --bmc1_max_bound_default -1
% 1.01/1.19 % --bmc1_symbol_reachability true
% 1.01/1.19 % --bmc1_property_lemmas false
% 1.01/1.19 % --bmc1_k_induction false
% 1.01/1.19 % --bmc1_non_equiv_states false
% 1.01/1.19 % --bmc1_deadlock false
% 1.01/1.19 % --bmc1_ucm false
% 1.01/1.19 % --bmc1_add_unsat_core none
% 1.01/1.19 % --bmc1_unsat_core_children false
% 1.01/1.19 % --bmc1_unsat_core_extrapolate_axioms false
% 1.01/1.19 % --bmc1_out_stat full
% 1.01/1.19 % --bmc1_ground_init false
% 1.01/1.19 % --bmc1_pre_inst_next_state false
% 1.01/1.19 % --bmc1_pre_inst_state false
% 1.01/1.19 % --bmc1_pre_inst_reach_state false
% 1.01/1.19 % --bmc1_out_unsat_core false
% 1.01/1.19 % --bmc1_aig_witness_out false
% 1.01/1.19 % --bmc1_verbose false
% 1.01/1.19 % --bmc1_dump_clauses_tptp false
% 1.01/1.20 % --bmc1_dump_unsat_core_tptp false
% 1.01/1.20 % --bmc1_dump_file -
% 1.01/1.20 % --bmc1_ucm_expand_uc_limit 128
% 1.01/1.20 % --bmc1_ucm_n_expand_iterations 6
% 1.01/1.20 % --bmc1_ucm_extend_mode 1
% 1.01/1.20 % --bmc1_ucm_init_mode 2
% 1.01/1.20 % --bmc1_ucm_cone_mode none
% 1.01/1.20 % --bmc1_ucm_reduced_relation_type 0
% 1.01/1.20 % --bmc1_ucm_relax_model 4
% 1.01/1.20 % --bmc1_ucm_full_tr_after_sat true
% 1.01/1.20 % --bmc1_ucm_expand_neg_assumptions false
% 1.01/1.20 % --bmc1_ucm_layered_model none
% 1.01/1.20 % --bmc1_ucm_max_lemma_size 10
% 1.01/1.20
% 1.01/1.20 % ------ AIG Options
% 1.01/1.20
% 1.01/1.20 % --aig_mode false
% 1.01/1.20
% 1.01/1.20 % ------ Instantiation Options
% 1.01/1.20
% 1.01/1.20 % --instantiation_flag true
% 1.01/1.20 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.01/1.20 % --inst_solver_per_active 750
% 1.01/1.20 % --inst_solver_calls_frac 0.5
% 1.01/1.20 % --inst_passive_queue_type priority_queues
% 1.01/1.20 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.01/1.20 % --inst_passive_queues_freq [25;2]
% 1.01/1.20 % --inst_dismatching true
% 1.01/1.20 % --inst_eager_unprocessed_to_passive true
% 1.01/1.20 % --inst_prop_sim_given true
% 1.01/1.20 % --inst_prop_sim_new false
% 1.01/1.20 % --inst_orphan_elimination true
% 1.01/1.20 % --inst_learning_loop_flag true
% 1.01/1.20 % --inst_learning_start 3000
% 1.01/1.20 % --inst_learning_factor 2
% 1.01/1.20 % --inst_start_prop_sim_after_learn 3
% 1.01/1.20 % --inst_sel_renew solver
% 1.01/1.20 % --inst_lit_activity_flag true
% 1.01/1.20 % --inst_out_proof true
% 1.01/1.20
% 1.01/1.20 % ------ Resolution Options
% 1.01/1.20
% 1.01/1.20 % --resolution_flag true
% 1.01/1.20 % --res_lit_sel kbo_max
% 1.01/1.20 % --res_to_prop_solver none
% 1.01/1.20 % --res_prop_simpl_new false
% 1.01/1.20 % --res_prop_simpl_given false
% 1.01/1.20 % --res_passive_queue_type priority_queues
% 1.01/1.20 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.01/1.20 % --res_passive_queues_freq [15;5]
% 1.01/1.20 % --res_forward_subs full
% 1.01/1.20 % --res_backward_subs full
% 1.01/1.20 % --res_forward_subs_resolution true
% 1.01/1.20 % --res_backward_subs_resolution true
% 1.01/1.20 % --res_orphan_elimination false
% 1.01/1.20 % --res_time_limit 1000.
% 1.01/1.20 % --res_out_proof true
% 1.01/1.20 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_97184d.s
% 1.01/1.20 % --modulo true
% 1.01/1.20
% 1.01/1.20 % ------ Combination Options
% 1.01/1.20
% 1.01/1.20 % --comb_res_mult 1000
% 1.01/1.20 % --comb_inst_mult 300
% 1.01/1.20 % ------
% 1.01/1.20
% 1.01/1.20 % ------ Parsing...% successful
% 1.01/1.20
% 1.01/1.20 % ------ 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 %
% 1.01/1.20
% 1.01/1.20 % ------ Proving...
% 1.01/1.20 % ------ Problem Properties
% 1.01/1.20
% 1.01/1.20 %
% 1.01/1.20 % EPR false
% 1.01/1.20 % Horn false
% 1.01/1.20 % Has equality true
% 1.01/1.20
% 1.01/1.20 % % ------ Input Options Time Limit: Unbounded
% 1.01/1.20
% 1.01/1.20
% 1.01/1.20 % % ------ Current options:
% 1.01/1.20
% 1.01/1.20 % ------ Input Options
% 1.01/1.20
% 1.01/1.20 % --out_options all
% 1.01/1.20 % --tptp_safe_out true
% 1.01/1.20 % --problem_path ""
% 1.01/1.20 % --include_path ""
% 1.01/1.20 % --clausifier .//eprover
% 1.01/1.20 % --clausifier_options --tstp-format
% 1.01/1.20 % --stdin false
% 1.01/1.20 % --dbg_backtrace false
% 1.01/1.20 % --dbg_dump_prop_clauses false
% 1.01/1.20 % --dbg_dump_prop_clauses_file -
% 1.01/1.20 % --dbg_out_stat false
% 1.01/1.20
% 1.01/1.20 % ------ General Options
% 1.01/1.20
% 1.01/1.20 % --fof false
% 1.01/1.20 % --time_out_real 150.
% 1.01/1.20 % --time_out_prep_mult 0.2
% 1.01/1.20 % --time_out_virtual -1.
% 1.01/1.20 % --schedule none
% 1.01/1.20 % --ground_splitting input
% 1.01/1.20 % --splitting_nvd 16
% 1.01/1.20 % --non_eq_to_eq false
% 1.01/1.20 % --prep_gs_sim true
% 1.01/1.20 % --prep_unflatten false
% 1.01/1.20 % --prep_res_sim true
% 1.01/1.20 % --prep_upred true
% 1.01/1.20 % --res_sim_input true
% 1.01/1.20 % --clause_weak_htbl true
% 1.01/1.20 % --gc_record_bc_elim false
% 1.01/1.20 % --symbol_type_check false
% 1.01/1.20 % --clausify_out false
% 1.01/1.20 % --large_theory_mode false
% 1.01/1.20 % --prep_sem_filter none
% 1.01/1.20 % --prep_sem_filter_out false
% 1.01/1.20 % --preprocessed_out false
% 1.01/1.20 % --sub_typing false
% 1.01/1.20 % --brand_transform false
% 1.01/1.20 % --pure_diseq_elim true
% 1.01/1.20 % --min_unsat_core false
% 1.01/1.20 % --pred_elim true
% 1.01/1.20 % --add_important_lit false
% 1.01/1.20 % --soft_assumptions false
% 1.01/1.20 % --reset_solvers false
% 1.01/1.20 % --bc_imp_inh []
% 1.01/1.20 % --conj_cone_tolerance 1.5
% 1.01/1.20 % --prolific_symb_bound 500
% 1.01/1.20 % --lt_threshold 2000
% 1.01/1.20
% 1.01/1.20 % ------ SAT Options
% 1.01/1.20
% 1.01/1.20 % --sat_mode false
% 1.01/1.20 % --sat_fm_restart_options ""
% 1.01/1.20 % --sat_gr_def false
% 1.01/1.20 % --sat_epr_types true
% 1.01/1.20 % --sat_non_cyclic_types false
% 1.01/1.20 % --sat_finite_models false
% 1.01/1.20 % --sat_fm_lemmas false
% 1.01/1.20 % --sat_fm_prep false
% 1.01/1.20 % --sat_fm_uc_incr true
% 1.01/1.20 % --sat_out_model small
% 1.01/1.20 % --sat_out_clauses false
% 1.01/1.20
% 1.01/1.20 % ------ QBF Options
% 1.01/1.20
% 1.01/1.20 % --qbf_mode false
% 1.01/1.20 % --qbf_elim_univ true
% 1.01/1.20 % --qbf_sk_in true
% 1.01/1.20 % --qbf_pred_elim true
% 1.01/1.20 % --qbf_split 32
% 1.01/1.20
% 1.01/1.20 % ------ BMC1 Options
% 1.01/1.20
% 1.01/1.20 % --bmc1_incremental false
% 1.01/1.20 % --bmc1_axioms reachable_all
% 1.01/1.20 % --bmc1_min_bound 0
% 1.01/1.20 % --bmc1_max_bound -1
% 1.01/1.20 % --bmc1_max_bound_default -1
% 1.01/1.20 % --bmc1_symbol_reachability true
% 1.01/1.20 % --bmc1_property_lemmas false
% 1.01/1.20 % --bmc1_k_induction false
% 1.01/1.20 % --bmc1_non_equiv_states false
% 1.01/1.20 % --bmc1_deadlock false
% 1.01/1.20 % --bmc1_ucm false
% 1.01/1.20 % --bmc1_add_unsat_core none
% 1.01/1.20 % --bmc1_unsat_core_children false
% 1.01/1.20 % --bmc1_unsat_core_extrapolate_axioms false
% 1.01/1.20 % --bmc1_out_stat full
% 1.01/1.20 % --bmc1_ground_init false
% 1.01/1.20 % --bmc1_pre_inst_next_state false
% 1.01/1.20 % --bmc1_pre_inst_state false
% 1.01/1.20 % --bmc1_pre_inst_reach_state false
% 1.01/1.20 % --bmc1_out_unsat_core false
% 1.01/1.20 % --bmc1_aig_witness_out false
% 1.01/1.20 % --bmc1_verbose false
% 1.01/1.20 % --bmc1_dump_clauses_tptp false
% 1.01/1.20 % --bmc1_dump_unsat_core_tptp false
% 1.01/1.20 % --bmc1_dump_file -
% 1.01/1.20 % --bmc1_ucm_expand_uc_limit 128
% 1.01/1.20 % --bmc1_ucm_n_expand_iterations 6
% 1.01/1.20 % --bmc1_ucm_extend_mode 1
% 1.01/1.20 % --bmc1_ucm_init_mode 2
% 1.01/1.20 % --bmc1_ucm_cone_mode none
% 1.01/1.20 % --bmc1_ucm_reduced_relation_type 0
% 1.01/1.20 % --bmc1_ucm_relax_model 4
% 1.01/1.20 % --bmc1_ucm_full_tr_after_sat true
% 1.01/1.20 % --bmc1_ucm_expand_neg_assumptions false
% 1.01/1.20 % --bmc1_ucm_layered_model none
% 1.01/1.20 % --bmc1_ucm_max_lemma_size 10
% 1.01/1.20
% 1.01/1.20 % ------ AIG Options
% 1.01/1.20
% 1.01/1.20 % --aig_mode false
% 1.01/1.20
% 1.01/1.20 % ------ Instantiation Options
% 1.01/1.20
% 1.01/1.20 % --instantiation_flag true
% 1.01/1.20 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.01/1.20 % --inst_solver_per_active 750
% 1.01/1.20 % --inst_solver_calls_frac 0.5
% 1.01/1.20 % --inst_passive_queue_type priority_queues
% 1.01/1.20 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.01/1.20 % --inst_passive_queues_freq [25;2]
% 1.01/1.20 % --inst_dismatching true
% 1.01/1.20 % --inst_eager_unprocessed_to_passive true
% 1.01/1.20 % --inst_prop_sim_given true
% 2.05/2.28 % --inst_prop_sim_new false
% 2.05/2.28 % --inst_orphan_elimination true
% 2.05/2.28 % --inst_learning_loop_flag true
% 2.05/2.28 % --inst_learning_start 3000
% 2.05/2.28 % --inst_learning_factor 2
% 2.05/2.28 % --inst_start_prop_sim_after_learn 3
% 2.05/2.28 % --inst_sel_renew solver
% 2.05/2.28 % --inst_lit_activity_flag true
% 2.05/2.28 % --inst_out_proof true
% 2.05/2.28
% 2.05/2.28 % ------ Resolution Options
% 2.05/2.28
% 2.05/2.28 % --resolution_flag true
% 2.05/2.28 % --res_lit_sel kbo_max
% 2.05/2.28 % --res_to_prop_solver none
% 2.05/2.28 % --res_prop_simpl_new false
% 2.05/2.28 % --res_prop_simpl_given false
% 2.05/2.28 % --res_passive_queue_type priority_queues
% 2.05/2.28 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.05/2.28 % --res_passive_queues_freq [15;5]
% 2.05/2.28 % --res_forward_subs full
% 2.05/2.28 % --res_backward_subs full
% 2.05/2.28 % --res_forward_subs_resolution true
% 2.05/2.28 % --res_backward_subs_resolution true
% 2.05/2.28 % --res_orphan_elimination false
% 2.05/2.28 % --res_time_limit 1000.
% 2.05/2.28 % --res_out_proof true
% 2.05/2.28 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_97184d.s
% 2.05/2.28 % --modulo true
% 2.05/2.28
% 2.05/2.28 % ------ Combination Options
% 2.05/2.28
% 2.05/2.28 % --comb_res_mult 1000
% 2.05/2.28 % --comb_inst_mult 300
% 2.05/2.28 % ------
% 2.05/2.28
% 2.05/2.28
% 2.05/2.28
% 2.05/2.28 % ------ Proving...
% 2.05/2.28 % warning: shown sat in sat incomplete mode
% 2.05/2.28 %
% 2.05/2.28
% 2.05/2.28
% 2.05/2.28 ------ Building Model...Done
% 2.05/2.28
% 2.05/2.28 %------ The model is defined over ground terms (initial term algebra).
% 2.05/2.28 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.05/2.28 %------ where \phi is a formula over the term algebra.
% 2.05/2.28 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.05/2.28 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.05/2.28 %------ See help for --sat_out_model for different model outputs.
% 2.05/2.28 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.05/2.28 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.05/2.28
% 2.05/2.28
% 2.05/2.28
% 2.05/2.28
% 2.05/2.28 %------ Negative definition of equality_sorted
% 2.05/2.28 fof(lit_def,axiom,
% 2.05/2.28 (! [X0,X0,X1] :
% 2.05/2.28 ( ~(equality_sorted(X0,X0,X1)) <=>
% 2.05/2.28 (
% 2.05/2.28 (
% 2.05/2.28 ( X0=$i & X0=hazard_of_mortality(sk2_esk1_0,sk2_esk2_0) & X1=hazard_of_mortality(sk2_esk1_0,sk2_esk3_0) )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=$i & X0=age(sk2_esk1_0,sk2_esk4_0) & X1=eta )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=$i & X0=age(sk2_esk1_0,sk2_esk2_0) & X1=eta )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 ).
% 2.05/2.28
% 2.05/2.28 %------ Positive definition of has_endowment
% 2.05/2.28 fof(lit_def,axiom,
% 2.05/2.28 (! [X0] :
% 2.05/2.28 ( has_endowment(X0) <=>
% 2.05/2.28 (
% 2.05/2.28 (
% 2.05/2.28 ( X0=sk2_esk1_0 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 ).
% 2.05/2.28
% 2.05/2.28 %------ Positive definition of organization
% 2.05/2.28 fof(lit_def,axiom,
% 2.05/2.28 (! [X0] :
% 2.05/2.28 ( organization(X0) <=>
% 2.05/2.28 (
% 2.05/2.28 (
% 2.05/2.28 ( X0=sk2_esk1_0 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 ).
% 2.05/2.28
% 2.05/2.28 %------ Negative definition of smaller_or_equal
% 2.05/2.28 fof(lit_def,axiom,
% 2.05/2.28 (! [X0,X1] :
% 2.05/2.28 ( ~(smaller_or_equal(X0,X1)) <=>
% 2.05/2.28 (
% 2.05/2.28 (
% 2.05/2.28 ( X0=hazard_of_mortality(sk2_esk1_0,sk2_esk2_0) & X1=hazard_of_mortality(sk2_esk1_0,sk2_esk3_0) )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=age(sk2_esk1_0,sk2_esk4_0) & X1=eta )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=age(sk2_esk1_0,sk2_esk2_0) & X1=eta )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 ).
% 2.05/2.28
% 2.05/2.28 %------ Negative definition of greater_or_equal
% 2.05/2.28 fof(lit_def,axiom,
% 2.05/2.28 (! [X0,X1] :
% 2.05/2.28 ( ~(greater_or_equal(X0,X1)) <=>
% 2.05/2.28 $false
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 ).
% 2.05/2.28
% 2.05/2.28 %------ Positive definition of smaller
% 2.05/2.28 fof(lit_def,axiom,
% 2.05/2.28 (! [X0,X1] :
% 2.05/2.28 ( smaller(X0,X1) <=>
% 2.05/2.28 (
% 2.05/2.28 (
% 2.05/2.28 ( X0=eta & X1=age(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=eta & X1=age(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=hazard_of_mortality(sk2_esk1_0,sk2_esk3_0) & X1=hazard_of_mortality(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=hazard_of_mortality(sk2_esk1_0,sk2_esk3_0) & X1=hazard_of_mortality(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=zero & X1=sigma )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 ? [X2] :
% 2.05/2.28 (
% 2.05/2.28 ( X0=hazard_of_mortality(sk2_esk1_0,X2) & X1=hazard_of_mortality(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X2!=sk2_esk2_0 )
% 2.05/2.28 &
% 2.05/2.28 ( X2!=sk2_esk4_0 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 ? [X2] :
% 2.05/2.28 (
% 2.05/2.28 ( X0=hazard_of_mortality(sk2_esk1_0,X2) & X1=hazard_of_mortality(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X2!=sk2_esk2_0 )
% 2.05/2.28 &
% 2.05/2.28 ( X2!=sk2_esk4_0 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X1=age(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X0!=hazard_of_mortality(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X0!=hazard_of_mortality(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X0!=age(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X0!=age(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X0!=sigma )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X1=age(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X0!=hazard_of_mortality(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X0!=hazard_of_mortality(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X0!=age(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X0!=age(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X0!=sigma )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 ).
% 2.05/2.28
% 2.05/2.28 %------ Positive definition of greater
% 2.05/2.28 fof(lit_def,axiom,
% 2.05/2.28 (! [X0,X1] :
% 2.05/2.28 ( greater(X0,X1) <=>
% 2.05/2.28 (
% 2.05/2.28 (
% 2.05/2.28 ( X0=hazard_of_mortality(sk2_esk1_0,sk2_esk2_0) & X1=hazard_of_mortality(sk2_esk1_0,sk2_esk3_0) )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 ? [X2] :
% 2.05/2.28 (
% 2.05/2.28 ( X0=hazard_of_mortality(sk2_esk1_0,sk2_esk2_0) & X1=hazard_of_mortality(sk2_esk1_0,X2) )
% 2.05/2.28 &
% 2.05/2.28 ( X2!=sk2_esk2_0 )
% 2.05/2.28 &
% 2.05/2.28 ( X2!=sk2_esk3_0 )
% 2.05/2.28 &
% 2.05/2.28 ( X2!=sk2_esk4_0 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=hazard_of_mortality(sk2_esk1_0,sk2_esk4_0) & X1=hazard_of_mortality(sk2_esk1_0,sk2_esk3_0) )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 ? [X2] :
% 2.05/2.28 (
% 2.05/2.28 ( X0=hazard_of_mortality(sk2_esk1_0,sk2_esk4_0) & X1=hazard_of_mortality(sk2_esk1_0,X2) )
% 2.05/2.28 &
% 2.05/2.28 ( X2!=sk2_esk2_0 )
% 2.05/2.28 &
% 2.05/2.28 ( X2!=sk2_esk3_0 )
% 2.05/2.28 &
% 2.05/2.28 ( X2!=sk2_esk4_0 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=age(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X1!=eta )
% 2.05/2.28 &
% 2.05/2.28 ( X1!=hazard_of_mortality(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X1!=hazard_of_mortality(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X1!=age(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X1!=age(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X1!=sigma )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=age(sk2_esk1_0,sk2_esk4_0) & X1=eta )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=age(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X1!=eta )
% 2.05/2.28 &
% 2.05/2.28 ( X1!=hazard_of_mortality(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X1!=hazard_of_mortality(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X1!=age(sk2_esk1_0,sk2_esk4_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X1!=age(sk2_esk1_0,sk2_esk2_0) )
% 2.05/2.28 &
% 2.05/2.28 ( X1!=sigma )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=age(sk2_esk1_0,sk2_esk2_0) & X1=eta )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=sigma & X1=zero )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 ).
% 2.05/2.28
% 2.05/2.28 %------ Negative definition of has_immunity
% 2.05/2.28 fof(lit_def,axiom,
% 2.05/2.28 (! [X0,X1] :
% 2.05/2.28 ( ~(has_immunity(X0,X1)) <=>
% 2.05/2.28 (
% 2.05/2.28 (
% 2.05/2.28 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 |
% 2.05/2.28 (
% 2.05/2.28 ( X0=sk2_esk1_0 & X1=sk2_esk4_0 )
% 2.05/2.28 )
% 2.05/2.28
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 )
% 2.05/2.28 ).
% 2.05/2.28
% 2.05/2.28
% 2.05/2.28
% 2.05/2.28 % ------ Statistics
% 2.05/2.28
% 2.05/2.28 % ------ General
% 2.05/2.28
% 2.05/2.28 % num_of_input_clauses: 66
% 2.05/2.28 % num_of_input_neg_conjectures: 8
% 2.05/2.28 % num_of_splits: 0
% 2.05/2.28 % num_of_split_atoms: 0
% 2.05/2.28 % num_of_sem_filtered_clauses: 0
% 2.05/2.28 % num_of_subtypes: 0
% 2.05/2.28 % monotx_restored_types: 0
% 2.05/2.28 % sat_num_of_epr_types: 0
% 2.05/2.28 % sat_num_of_non_cyclic_types: 0
% 2.05/2.28 % sat_guarded_non_collapsed_types: 0
% 2.05/2.28 % is_epr: 0
% 2.05/2.28 % is_horn: 0
% 2.05/2.28 % has_eq: 1
% 2.05/2.28 % num_pure_diseq_elim: 0
% 2.05/2.28 % simp_replaced_by: 0
% 2.05/2.28 % res_preprocessed: 16
% 2.05/2.28 % prep_upred: 0
% 2.05/2.28 % prep_unflattend: 0
% 2.05/2.28 % pred_elim_cands: 0
% 2.05/2.28 % pred_elim: 0
% 2.05/2.28 % pred_elim_cl: 0
% 2.05/2.28 % pred_elim_cycles: 0
% 2.05/2.28 % forced_gc_time: 0
% 2.05/2.28 % gc_basic_clause_elim: 0
% 2.05/2.28 % parsing_time: 0.002
% 2.05/2.28 % sem_filter_time: 0.
% 2.05/2.28 % pred_elim_time: 0.
% 2.05/2.28 % out_proof_time: 0.
% 2.05/2.28 % monotx_time: 0.
% 2.05/2.28 % subtype_inf_time: 0.
% 2.05/2.28 % unif_index_cands_time: 0.003
% 2.05/2.28 % unif_index_add_time: 0.002
% 2.05/2.28 % total_time: 1.102
% 2.05/2.28 % num_of_symbols: 43
% 2.05/2.28 % num_of_terms: 982
% 2.05/2.28
% 2.05/2.28 % ------ Propositional Solver
% 2.05/2.28
% 2.05/2.28 % prop_solver_calls: 13
% 2.05/2.28 % prop_fast_solver_calls: 27
% 2.05/2.28 % prop_num_of_clauses: 245
% 2.05/2.28 % prop_preprocess_simplified: 753
% 2.05/2.28 % prop_fo_subsumed: 0
% 2.05/2.28 % prop_solver_time: 0.
% 2.05/2.28 % prop_fast_solver_time: 0.
% 2.05/2.28 % prop_unsat_core_time: 0.
% 2.05/2.28
% 2.05/2.28 % ------ QBF
% 2.05/2.28
% 2.05/2.28 % qbf_q_res: 0
% 2.05/2.28 % qbf_num_tautologies: 0
% 2.05/2.28 % qbf_prep_cycles: 0
% 2.05/2.28
% 2.05/2.28 % ------ BMC1
% 2.05/2.28
% 2.05/2.28 % bmc1_current_bound: -1
% 2.05/2.28 % bmc1_last_solved_bound: -1
% 2.05/2.28 % bmc1_unsat_core_size: -1
% 2.05/2.28 % bmc1_unsat_core_parents_size: -1
% 2.05/2.28 % bmc1_merge_next_fun: 0
% 2.05/2.28 % bmc1_unsat_core_clauses_time: 0.
% 2.05/2.28
% 2.05/2.28 % ------ Instantiation
% 2.05/2.28
% 2.05/2.28 % inst_num_of_clauses: 278
% 2.05/2.28 % inst_num_in_passive: 0
% 2.05/2.28 % inst_num_in_active: 245
% 2.05/2.28 % inst_num_in_unprocessed: 0
% 2.05/2.28 % inst_num_of_loops: 317
% 2.05/2.28 % inst_num_of_learning_restarts: 0
% 2.05/2.28 % inst_num_moves_active_passive: 25
% 2.05/2.28 % inst_lit_activity: 36
% 2.05/2.28 % inst_lit_activity_moves: 0
% 2.05/2.28 % inst_num_tautologies: 33
% 2.05/2.28 % inst_num_prop_implied: 0
% 2.05/2.28 % inst_num_existing_simplified: 0
% 2.05/2.28 % inst_num_eq_res_simplified: 0
% 2.05/2.28 % inst_num_child_elim: 0
% 2.05/2.28 % inst_num_of_dismatching_blockings: 39
% 2.05/2.28 % inst_num_of_non_proper_insts: 490
% 2.05/2.28 % inst_num_of_duplicates: 252
% 2.05/2.28 % inst_inst_num_from_inst_to_res: 0
% 2.05/2.28 % inst_dismatching_checking_time: 0.
% 2.05/2.28
% 2.05/2.28 % ------ Resolution
% 2.05/2.28
% 2.05/2.28 % res_num_of_clauses: 6469
% 2.05/2.28 % res_num_in_passive: 5560
% 2.05/2.28 % res_num_in_active: 890
% 2.05/2.28 % res_num_of_loops: 2000
% 2.05/2.28 % res_forward_subset_subsumed: 8429
% 2.05/2.28 % res_backward_subset_subsumed: 49
% 2.05/2.28 % res_forward_subsumed: 1086
% 2.05/2.28 % res_backward_subsumed: 42
% 2.05/2.28 % res_forward_subsumption_resolution: 15
% 2.05/2.28 % res_backward_subsumption_resolution: 0
% 2.05/2.28 % res_clause_to_clause_subsumption: 88006
% 2.05/2.28 % res_orphan_elimination: 0
% 2.05/2.28 % res_tautology_del: 537
% 2.05/2.28 % res_num_eq_res_simplified: 0
% 2.05/2.28 % res_num_sel_changes: 0
% 2.05/2.28 % res_moves_from_active_to_pass: 0
% 2.05/2.28
% 2.05/2.28 % Status Unknown
% 2.05/2.28 % Last status :
% 2.05/2.28 % SZS status Unknown
%------------------------------------------------------------------------------