TSTP Solution File: MGT062-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT062-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n025.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:06 EDT 2022
% Result : Unknown 1.26s 1.61s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT062-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 11:23:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.19/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.40 % Orientation found
% 0.19/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_b63881.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_3f6893.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_439714 | grep -v "SZS"
% 0.19/0.42
% 0.19/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ iProver source info
% 0.19/0.42
% 0.19/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.42 % git: non_committed_changes: true
% 0.19/0.42 % git: last_make_outside_of_git: true
% 0.19/0.42
% 0.19/0.42 %
% 0.19/0.42 % ------ Input Options
% 0.19/0.42
% 0.19/0.42 % --out_options all
% 0.19/0.42 % --tptp_safe_out true
% 0.19/0.42 % --problem_path ""
% 0.19/0.42 % --include_path ""
% 0.19/0.42 % --clausifier .//eprover
% 0.19/0.42 % --clausifier_options --tstp-format
% 0.19/0.42 % --stdin false
% 0.19/0.42 % --dbg_backtrace false
% 0.19/0.42 % --dbg_dump_prop_clauses false
% 0.19/0.42 % --dbg_dump_prop_clauses_file -
% 0.19/0.42 % --dbg_out_stat false
% 0.19/0.42
% 0.19/0.42 % ------ General Options
% 0.19/0.42
% 0.19/0.42 % --fof false
% 0.19/0.42 % --time_out_real 150.
% 0.19/0.42 % --time_out_prep_mult 0.2
% 0.19/0.42 % --time_out_virtual -1.
% 0.19/0.42 % --schedule none
% 0.19/0.42 % --ground_splitting input
% 0.19/0.42 % --splitting_nvd 16
% 0.19/0.42 % --non_eq_to_eq false
% 0.19/0.42 % --prep_gs_sim true
% 0.19/0.42 % --prep_unflatten false
% 0.19/0.42 % --prep_res_sim true
% 0.19/0.42 % --prep_upred true
% 0.19/0.42 % --res_sim_input true
% 0.19/0.42 % --clause_weak_htbl true
% 0.19/0.42 % --gc_record_bc_elim false
% 0.19/0.42 % --symbol_type_check false
% 0.19/0.42 % --clausify_out false
% 0.19/0.42 % --large_theory_mode false
% 0.19/0.42 % --prep_sem_filter none
% 0.19/0.42 % --prep_sem_filter_out false
% 0.19/0.42 % --preprocessed_out false
% 0.19/0.42 % --sub_typing false
% 0.19/0.42 % --brand_transform false
% 0.19/0.42 % --pure_diseq_elim true
% 0.19/0.42 % --min_unsat_core false
% 0.19/0.42 % --pred_elim true
% 0.19/0.42 % --add_important_lit false
% 0.19/0.42 % --soft_assumptions false
% 0.19/0.42 % --reset_solvers false
% 0.19/0.42 % --bc_imp_inh []
% 0.19/0.42 % --conj_cone_tolerance 1.5
% 0.19/0.42 % --prolific_symb_bound 500
% 0.19/0.42 % --lt_threshold 2000
% 0.19/0.42
% 0.19/0.42 % ------ SAT Options
% 0.19/0.42
% 0.19/0.42 % --sat_mode false
% 0.19/0.42 % --sat_fm_restart_options ""
% 0.19/0.42 % --sat_gr_def false
% 0.19/0.42 % --sat_epr_types true
% 0.19/0.42 % --sat_non_cyclic_types false
% 0.19/0.42 % --sat_finite_models false
% 0.19/0.42 % --sat_fm_lemmas false
% 0.19/0.42 % --sat_fm_prep false
% 0.19/0.42 % --sat_fm_uc_incr true
% 0.19/0.42 % --sat_out_model small
% 0.19/0.42 % --sat_out_clauses false
% 0.19/0.42
% 0.19/0.42 % ------ QBF Options
% 0.19/0.42
% 0.19/0.42 % --qbf_mode false
% 0.19/0.42 % --qbf_elim_univ true
% 0.19/0.42 % --qbf_sk_in true
% 0.19/0.42 % --qbf_pred_elim true
% 0.19/0.42 % --qbf_split 32
% 0.19/0.42
% 0.19/0.42 % ------ BMC1 Options
% 0.19/0.42
% 0.19/0.42 % --bmc1_incremental false
% 0.19/0.42 % --bmc1_axioms reachable_all
% 0.19/0.42 % --bmc1_min_bound 0
% 0.19/0.42 % --bmc1_max_bound -1
% 0.19/0.42 % --bmc1_max_bound_default -1
% 0.19/0.42 % --bmc1_symbol_reachability true
% 0.19/0.42 % --bmc1_property_lemmas false
% 0.19/0.42 % --bmc1_k_induction false
% 0.19/0.42 % --bmc1_non_equiv_states false
% 0.19/0.42 % --bmc1_deadlock false
% 0.19/0.42 % --bmc1_ucm false
% 0.19/0.42 % --bmc1_add_unsat_core none
% 0.19/0.42 % --bmc1_unsat_core_children false
% 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.42 % --bmc1_out_stat full
% 0.19/0.42 % --bmc1_ground_init false
% 0.19/0.42 % --bmc1_pre_inst_next_state false
% 0.19/0.42 % --bmc1_pre_inst_state false
% 0.19/0.42 % --bmc1_pre_inst_reach_state false
% 0.19/0.42 % --bmc1_out_unsat_core false
% 0.19/0.42 % --bmc1_aig_witness_out false
% 0.19/0.42 % --bmc1_verbose false
% 0.19/0.42 % --bmc1_dump_clauses_tptp false
% 0.19/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.43 % --bmc1_dump_file -
% 0.19/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.43 % --bmc1_ucm_extend_mode 1
% 0.19/0.43 % --bmc1_ucm_init_mode 2
% 0.19/0.43 % --bmc1_ucm_cone_mode none
% 0.19/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.43 % --bmc1_ucm_relax_model 4
% 0.19/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.43 % --bmc1_ucm_layered_model none
% 0.19/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.43
% 0.19/0.43 % ------ AIG Options
% 0.19/0.43
% 0.19/0.43 % --aig_mode false
% 0.19/0.43
% 0.19/0.43 % ------ Instantiation Options
% 0.19/0.43
% 0.19/0.43 % --instantiation_flag true
% 0.19/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.43 % --inst_solver_per_active 750
% 0.19/0.43 % --inst_solver_calls_frac 0.5
% 0.19/0.43 % --inst_passive_queue_type priority_queues
% 0.19/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.43 % --inst_passive_queues_freq [25;2]
% 0.19/0.43 % --inst_dismatching true
% 0.19/0.43 % --inst_eager_unprocessed_to_passive true
% 0.19/0.43 % --inst_prop_sim_given true
% 0.19/0.43 % --inst_prop_sim_new false
% 0.19/0.43 % --inst_orphan_elimination true
% 0.19/0.43 % --inst_learning_loop_flag true
% 0.19/0.43 % --inst_learning_start 3000
% 0.19/0.43 % --inst_learning_factor 2
% 0.19/0.43 % --inst_start_prop_sim_after_learn 3
% 0.19/0.43 % --inst_sel_renew solver
% 0.19/0.43 % --inst_lit_activity_flag true
% 0.19/0.43 % --inst_out_proof true
% 0.19/0.43
% 0.19/0.43 % ------ Resolution Options
% 0.19/0.43
% 0.19/0.43 % --resolution_flag true
% 0.19/0.43 % --res_lit_sel kbo_max
% 0.19/0.43 % --res_to_prop_solver none
% 0.19/0.43 % --res_prop_simpl_new false
% 0.19/0.43 % --res_prop_simpl_given false
% 0.19/0.43 % --res_passive_queue_type priority_queues
% 0.19/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.19/0.43 % --res_passive_queues_freq [15;5]
% 0.19/0.43 % --res_forward_subs full
% 0.19/0.43 % --res_backward_subs full
% 0.19/0.43 % --res_forward_subs_resolution true
% 0.19/0.43 % --res_backward_subs_resolution true
% 0.19/0.43 % --res_orphan_elimination false
% 0.19/0.43 % --res_time_limit 1000.
% 0.19/0.43 % --res_out_proof true
% 0.19/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_b63881.s
% 0.19/0.43 % --modulo true
% 0.19/0.43
% 0.19/0.43 % ------ Combination Options
% 0.19/0.43
% 0.19/0.43 % --comb_res_mult 1000
% 0.19/0.43 % --comb_inst_mult 300
% 0.19/0.43 % ------
% 0.19/0.43
% 0.19/0.43 % ------ Parsing...% successful
% 0.19/0.43
% 0.19/0.43 % ------ 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.19/0.43
% 0.19/0.43 % ------ Proving...
% 0.19/0.43 % ------ Problem Properties
% 0.19/0.43
% 0.19/0.43 %
% 0.19/0.43 % EPR false
% 0.19/0.43 % Horn false
% 0.19/0.43 % Has equality true
% 0.19/0.43
% 0.19/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 % % ------ Current options:
% 0.19/0.43
% 0.19/0.43 % ------ Input Options
% 0.19/0.43
% 0.19/0.43 % --out_options all
% 0.19/0.43 % --tptp_safe_out true
% 0.19/0.43 % --problem_path ""
% 0.19/0.43 % --include_path ""
% 0.19/0.43 % --clausifier .//eprover
% 0.19/0.43 % --clausifier_options --tstp-format
% 0.19/0.43 % --stdin false
% 0.19/0.43 % --dbg_backtrace false
% 0.19/0.43 % --dbg_dump_prop_clauses false
% 0.19/0.43 % --dbg_dump_prop_clauses_file -
% 0.19/0.43 % --dbg_out_stat false
% 0.19/0.43
% 0.19/0.43 % ------ General Options
% 0.19/0.43
% 0.19/0.43 % --fof false
% 0.19/0.43 % --time_out_real 150.
% 0.19/0.43 % --time_out_prep_mult 0.2
% 0.19/0.43 % --time_out_virtual -1.
% 0.19/0.43 % --schedule none
% 0.19/0.43 % --ground_splitting input
% 0.19/0.43 % --splitting_nvd 16
% 0.19/0.43 % --non_eq_to_eq false
% 0.19/0.43 % --prep_gs_sim true
% 0.19/0.43 % --prep_unflatten false
% 0.19/0.43 % --prep_res_sim true
% 0.19/0.43 % --prep_upred true
% 0.19/0.43 % --res_sim_input true
% 0.19/0.43 % --clause_weak_htbl true
% 0.19/0.43 % --gc_record_bc_elim false
% 0.19/0.43 % --symbol_type_check false
% 0.19/0.43 % --clausify_out false
% 0.19/0.43 % --large_theory_mode false
% 0.19/0.43 % --prep_sem_filter none
% 0.19/0.43 % --prep_sem_filter_out false
% 0.19/0.43 % --preprocessed_out false
% 0.19/0.43 % --sub_typing false
% 0.19/0.43 % --brand_transform false
% 0.19/0.43 % --pure_diseq_elim true
% 0.19/0.43 % --min_unsat_core false
% 0.19/0.43 % --pred_elim true
% 0.19/0.43 % --add_important_lit false
% 0.19/0.43 % --soft_assumptions false
% 0.19/0.43 % --reset_solvers false
% 0.19/0.43 % --bc_imp_inh []
% 0.19/0.43 % --conj_cone_tolerance 1.5
% 0.19/0.43 % --prolific_symb_bound 500
% 0.19/0.43 % --lt_threshold 2000
% 0.19/0.43
% 0.19/0.43 % ------ SAT Options
% 0.19/0.43
% 0.19/0.43 % --sat_mode false
% 0.19/0.43 % --sat_fm_restart_options ""
% 0.19/0.43 % --sat_gr_def false
% 0.19/0.43 % --sat_epr_types true
% 0.19/0.43 % --sat_non_cyclic_types false
% 0.19/0.43 % --sat_finite_models false
% 0.19/0.43 % --sat_fm_lemmas false
% 0.19/0.43 % --sat_fm_prep false
% 0.19/0.43 % --sat_fm_uc_incr true
% 0.19/0.43 % --sat_out_model small
% 0.19/0.43 % --sat_out_clauses false
% 0.19/0.43
% 0.19/0.43 % ------ QBF Options
% 0.19/0.43
% 0.19/0.43 % --qbf_mode false
% 0.19/0.43 % --qbf_elim_univ true
% 0.19/0.43 % --qbf_sk_in true
% 0.19/0.43 % --qbf_pred_elim true
% 0.19/0.43 % --qbf_split 32
% 0.19/0.43
% 0.19/0.43 % ------ BMC1 Options
% 0.19/0.43
% 0.19/0.43 % --bmc1_incremental false
% 0.19/0.43 % --bmc1_axioms reachable_all
% 0.19/0.43 % --bmc1_min_bound 0
% 0.19/0.43 % --bmc1_max_bound -1
% 0.19/0.43 % --bmc1_max_bound_default -1
% 0.19/0.43 % --bmc1_symbol_reachability true
% 0.19/0.43 % --bmc1_property_lemmas false
% 0.19/0.43 % --bmc1_k_induction false
% 0.19/0.43 % --bmc1_non_equiv_states false
% 0.19/0.43 % --bmc1_deadlock false
% 0.19/0.43 % --bmc1_ucm false
% 0.19/0.43 % --bmc1_add_unsat_core none
% 0.19/0.43 % --bmc1_unsat_core_children false
% 0.19/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.43 % --bmc1_out_stat full
% 0.19/0.43 % --bmc1_ground_init false
% 0.19/0.43 % --bmc1_pre_inst_next_state false
% 0.19/0.43 % --bmc1_pre_inst_state false
% 0.19/0.43 % --bmc1_pre_inst_reach_state false
% 0.19/0.43 % --bmc1_out_unsat_core false
% 0.19/0.43 % --bmc1_aig_witness_out false
% 0.19/0.43 % --bmc1_verbose false
% 0.19/0.43 % --bmc1_dump_clauses_tptp false
% 0.19/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.19/0.43 % --bmc1_dump_file -
% 0.19/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.19/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.19/0.44 % --bmc1_ucm_extend_mode 1
% 0.19/0.44 % --bmc1_ucm_init_mode 2
% 0.19/0.44 % --bmc1_ucm_cone_mode none
% 0.19/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.19/0.44 % --bmc1_ucm_relax_model 4
% 0.19/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.19/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.19/0.44 % --bmc1_ucm_layered_model none
% 0.19/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.19/0.44
% 0.19/0.44 % ------ AIG Options
% 0.19/0.44
% 0.19/0.44 % --aig_mode false
% 0.19/0.44
% 0.19/0.44 % ------ Instantiation Options
% 0.19/0.44
% 0.19/0.44 % --instantiation_flag true
% 0.19/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.19/0.44 % --inst_solver_per_active 750
% 0.19/0.44 % --inst_solver_calls_frac 0.5
% 0.19/0.44 % --inst_passive_queue_type priority_queues
% 0.19/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.19/0.44 % --inst_passive_queues_freq [25;2]
% 0.19/0.44 % --inst_dismatching true
% 0.19/0.44 % --inst_eager_unprocessed_to_passive true
% 0.19/0.44 % --inst_prop_sim_given true
% 1.21/1.39 % --inst_prop_sim_new false
% 1.21/1.39 % --inst_orphan_elimination true
% 1.21/1.39 % --inst_learning_loop_flag true
% 1.21/1.39 % --inst_learning_start 3000
% 1.21/1.39 % --inst_learning_factor 2
% 1.21/1.39 % --inst_start_prop_sim_after_learn 3
% 1.21/1.39 % --inst_sel_renew solver
% 1.21/1.39 % --inst_lit_activity_flag true
% 1.21/1.39 % --inst_out_proof true
% 1.21/1.39
% 1.21/1.39 % ------ Resolution Options
% 1.21/1.39
% 1.21/1.39 % --resolution_flag true
% 1.21/1.39 % --res_lit_sel kbo_max
% 1.21/1.39 % --res_to_prop_solver none
% 1.21/1.39 % --res_prop_simpl_new false
% 1.21/1.39 % --res_prop_simpl_given false
% 1.21/1.39 % --res_passive_queue_type priority_queues
% 1.21/1.39 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.21/1.39 % --res_passive_queues_freq [15;5]
% 1.21/1.39 % --res_forward_subs full
% 1.21/1.39 % --res_backward_subs full
% 1.21/1.39 % --res_forward_subs_resolution true
% 1.21/1.39 % --res_backward_subs_resolution true
% 1.21/1.39 % --res_orphan_elimination false
% 1.21/1.39 % --res_time_limit 1000.
% 1.21/1.39 % --res_out_proof true
% 1.21/1.39 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_b63881.s
% 1.21/1.39 % --modulo true
% 1.21/1.39
% 1.21/1.39 % ------ Combination Options
% 1.21/1.39
% 1.21/1.39 % --comb_res_mult 1000
% 1.21/1.39 % --comb_inst_mult 300
% 1.21/1.39 % ------
% 1.21/1.39
% 1.21/1.39
% 1.21/1.39
% 1.21/1.39 % ------ Proving...
% 1.21/1.39 % warning: shown sat in sat incomplete mode
% 1.21/1.39 %
% 1.21/1.39
% 1.21/1.39
% 1.21/1.39 ------ Building Model...Done
% 1.21/1.39
% 1.21/1.39 %------ The model is defined over ground terms (initial term algebra).
% 1.21/1.39 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.21/1.39 %------ where \phi is a formula over the term algebra.
% 1.21/1.39 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.21/1.39 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.21/1.39 %------ See help for --sat_out_model for different model outputs.
% 1.21/1.39 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.21/1.39 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.21/1.39
% 1.21/1.39
% 1.21/1.39
% 1.21/1.39
% 1.21/1.39 %------ Negative definition of equality_sorted
% 1.21/1.39 fof(lit_def,axiom,
% 1.21/1.39 (! [X0,X0,X1] :
% 1.21/1.39 ( ~(equality_sorted(X0,X0,X1)) <=>
% 1.21/1.39 (
% 1.21/1.39 ? [X2] :
% 1.21/1.39 (
% 1.21/1.39 ( X0=$i & X0=age(sk2,X2) & X1=zero )
% 1.21/1.39 &
% 1.21/1.39 ( X2!=sk3 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 ? [X2] :
% 1.21/1.39 (
% 1.21/1.39 ( X0=$i & X0=age(sk2,X2) & X1=tau )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 ).
% 1.21/1.39
% 1.21/1.39 %------ Positive definition of greater
% 1.21/1.39 fof(lit_def,axiom,
% 1.21/1.39 (! [X0,X1] :
% 1.21/1.39 ( greater(X0,X1) <=>
% 1.21/1.39 (
% 1.21/1.39 (
% 1.21/1.39 ( X0=sigma & X1=zero )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=tau & X1=zero )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=mod2 & X1=mod1 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=age(sk2,sk5) & X1=zero )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=age(sk2,sk5) & X1=sigma )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 ? [X2] :
% 1.21/1.39 (
% 1.21/1.39 ( X0=age(sk2,X2) )
% 1.21/1.39 &
% 1.21/1.39 ( X1!=sigma )
% 1.21/1.39 &
% 1.21/1.39 ( X1!=sigma | X2!=sk3 )
% 1.21/1.39 &
% 1.21/1.39 ( X1!=tau )
% 1.21/1.39 &
% 1.21/1.39 ( X1!=mod2 )
% 1.21/1.39 &
% 1.21/1.39 ( X1!=age(sk2,sk5) )
% 1.21/1.39 &
% 1.21/1.39 ( X1!=age(sk2,X1) )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 ? [X2] :
% 1.21/1.39 (
% 1.21/1.39 ( X0=age(sk2,X2) & X1=zero )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 ? [X2] :
% 1.21/1.39 (
% 1.21/1.39 ( X0=age(sk2,X2) & X1=sigma )
% 1.21/1.39 &
% 1.21/1.39 ( X2!=sk3 )
% 1.21/1.39 &
% 1.21/1.39 ( X2!=sk5 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 ? [X2] :
% 1.21/1.39 (
% 1.21/1.39 ( X0=age(sk2,X2) & X1=tau )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X1=zero )
% 1.21/1.39 &
% 1.21/1.39 ( X0!=zero )
% 1.21/1.39 &
% 1.21/1.39 ( X0!=sigma )
% 1.21/1.39 &
% 1.21/1.39 ( X0!=mod1 )
% 1.21/1.39 &
% 1.21/1.39 ( X0!=age(sk2,X0) )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 ).
% 1.21/1.39
% 1.21/1.39 %------ Positive definition of dissimilar
% 1.21/1.39 fof(lit_def,axiom,
% 1.21/1.39 (! [X0,X1,X2] :
% 1.21/1.39 ( dissimilar(X0,X1,X2) <=>
% 1.21/1.39 (
% 1.21/1.39 (
% 1.21/1.39 ( X0=sk2 & X1=sk3 )
% 1.21/1.39 &
% 1.21/1.39 ( X2!=sk3 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=sk2 & X1=sk3 & X2=sk5 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=sk2 & X2=sk3 )
% 1.21/1.39 &
% 1.21/1.39 ( X1!=sk3 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 ).
% 1.21/1.39
% 1.21/1.39 %------ Positive definition of organization
% 1.21/1.39 fof(lit_def,axiom,
% 1.21/1.39 (! [X0] :
% 1.21/1.39 ( organization(X0) <=>
% 1.21/1.39 (
% 1.21/1.39 (
% 1.21/1.39 ( X0=sk2 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 ).
% 1.21/1.39
% 1.21/1.39 %------ Positive definition of is_aligned
% 1.21/1.39 fof(lit_def,axiom,
% 1.21/1.39 (! [X0,X1] :
% 1.21/1.39 ( is_aligned(X0,X1) <=>
% 1.21/1.39 (
% 1.21/1.39 (
% 1.21/1.39 ( X0=sk2 & X1=sk3 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 ).
% 1.21/1.39
% 1.21/1.39 %------ Positive definition of robust_position
% 1.21/1.39 fof(lit_def,axiom,
% 1.21/1.39 (! [X0] :
% 1.21/1.39 ( robust_position(X0) <=>
% 1.21/1.39 $true
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 ).
% 1.21/1.39
% 1.21/1.39 %------ Positive definition of smaller_or_equal
% 1.21/1.39 fof(lit_def,axiom,
% 1.21/1.39 (! [X0,X1] :
% 1.21/1.39 ( smaller_or_equal(X0,X1) <=>
% 1.21/1.39 (
% 1.21/1.39 (
% 1.21/1.39 ( X0!=age(sk2,X0) | X1!=zero )
% 1.21/1.39 &
% 1.21/1.39 ( X0!=age(sk2,X0) | X1!=tau )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=age(sk2,sk4) & X1=sigma )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=age(sk2,sk3) & X1=zero )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 ).
% 1.21/1.39
% 1.21/1.39 %------ Positive definition of positional_advantage
% 1.21/1.39 fof(lit_def,axiom,
% 1.21/1.39 (! [X0,X1] :
% 1.21/1.39 ( positional_advantage(X0,X1) <=>
% 1.21/1.39 (
% 1.21/1.39 (
% 1.21/1.39 ( X0=sk2 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=sk2 & X1=sk3 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 ).
% 1.21/1.39
% 1.21/1.39 %------ Positive definition of has_immunity
% 1.21/1.39 fof(lit_def,axiom,
% 1.21/1.39 (! [X0,X1] :
% 1.21/1.39 ( has_immunity(X0,X1) <=>
% 1.21/1.39 $false
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 ).
% 1.21/1.39
% 1.21/1.39 %------ Positive definition of smaller
% 1.21/1.39 fof(lit_def,axiom,
% 1.21/1.39 (! [X0,X1] :
% 1.21/1.39 ( smaller(X0,X1) <=>
% 1.21/1.39 (
% 1.21/1.39 (
% 1.21/1.39 ( X0=zero )
% 1.21/1.39 &
% 1.21/1.39 ( X1!=zero )
% 1.21/1.39 &
% 1.21/1.39 ( X1!=mod1 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=zero & X1=sigma )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=zero & X1=tau )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=sigma & X1=age(sk2,sk5) )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 ? [X2] :
% 1.21/1.39 (
% 1.21/1.39 ( X0=sigma & X1=age(sk2,X2) )
% 1.21/1.39 &
% 1.21/1.39 ( X2!=sk3 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 ? [X2] :
% 1.21/1.39 (
% 1.21/1.39 ( X0=tau & X1=age(sk2,X2) )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 (
% 1.21/1.39 ( X0=mod1 & X1=mod2 )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 |
% 1.21/1.39 ? [X2] :
% 1.21/1.39 (
% 1.21/1.39 ( X1=age(sk2,X2) )
% 1.21/1.39 &
% 1.21/1.39 ( X0!=sigma | X2!=sk3 )
% 1.21/1.39 &
% 1.21/1.39 ( X0!=mod2 )
% 1.21/1.39 &
% 1.21/1.39 ( X0!=age(sk2,sk5) )
% 1.21/1.39 &
% 1.21/1.39 ( X0!=age(sk2,X0) )
% 1.21/1.39 )
% 1.21/1.39
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 ).
% 1.21/1.39
% 1.21/1.39 %------ Negative definition of greater_or_equal
% 1.21/1.39 fof(lit_def,axiom,
% 1.21/1.39 (! [X0,X1] :
% 1.21/1.39 ( ~(greater_or_equal(X0,X1)) <=>
% 1.21/1.39 $false
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 ).
% 1.21/1.39
% 1.21/1.39 %------ Positive definition of has_endowment
% 1.21/1.39 fof(lit_def,axiom,
% 1.21/1.39 (! [X0] :
% 1.21/1.39 ( has_endowment(X0) <=>
% 1.21/1.39 $false
% 1.21/1.39 )
% 1.21/1.39 )
% 1.21/1.39 ).
% 1.21/1.39
% 1.21/1.39
% 1.21/1.39
% 1.21/1.39 % ------ Statistics
% 1.21/1.39
% 1.21/1.39 % ------ General
% 1.21/1.39
% 1.21/1.39 % num_of_input_clauses: 116
% 1.21/1.39 % num_of_input_neg_conjectures: 10
% 1.21/1.39 % num_of_splits: 0
% 1.21/1.39 % num_of_split_atoms: 0
% 1.21/1.39 % num_of_sem_filtered_clauses: 0
% 1.21/1.39 % num_of_subtypes: 0
% 1.21/1.39 % monotx_restored_types: 0
% 1.21/1.39 % sat_num_of_epr_types: 0
% 1.21/1.39 % sat_num_of_non_cyclic_types: 0
% 1.21/1.39 % sat_guarded_non_collapsed_types: 0
% 1.21/1.39 % is_epr: 0
% 1.21/1.39 % is_horn: 0
% 1.21/1.39 % has_eq: 1
% 1.21/1.39 % num_pure_diseq_elim: 0
% 1.21/1.39 % simp_replaced_by: 0
% 1.21/1.39 % res_preprocessed: 20
% 1.21/1.39 % prep_upred: 0
% 1.21/1.39 % prep_unflattend: 0
% 1.21/1.39 % pred_elim_cands: 0
% 1.21/1.39 % pred_elim: 0
% 1.21/1.39 % pred_elim_cl: 0
% 1.21/1.39 % pred_elim_cycles: 0
% 1.21/1.39 % forced_gc_time: 0
% 1.21/1.39 % gc_basic_clause_elim: 0
% 1.21/1.39 % parsing_time: 0.005
% 1.21/1.39 % sem_filter_time: 0.
% 1.21/1.39 % pred_elim_time: 0.
% 1.21/1.39 % out_proof_time: 0.
% 1.21/1.39 % monotx_time: 0.
% 1.21/1.39 % subtype_inf_time: 0.
% 1.21/1.39 % unif_index_cands_time: 0.002
% 1.21/1.39 % unif_index_add_time: 0.001
% 1.21/1.39 % total_time: 0.98
% 1.21/1.39 % num_of_symbols: 51
% 1.21/1.39 % num_of_terms: 1098
% 1.21/1.39
% 1.21/1.39 % ------ Propositional Solver
% 1.21/1.39
% 1.21/1.39 % prop_solver_calls: 9
% 1.21/1.39 % prop_fast_solver_calls: 33
% 1.21/1.39 % prop_num_of_clauses: 279
% 1.21/1.39 % prop_preprocess_simplified: 996
% 1.21/1.39 % prop_fo_subsumed: 0
% 1.21/1.39 % prop_solver_time: 0.
% 1.21/1.39 % prop_fast_solver_time: 0.
% 1.21/1.39 % prop_unsat_core_time: 0.
% 1.21/1.39
% 1.21/1.39 % ------ QBF
% 1.21/1.39
% 1.21/1.39 % qbf_q_res: 0
% 1.21/1.39 % qbf_num_tautologies: 0
% 1.21/1.39 % qbf_prep_cycles: 0
% 1.21/1.39
% 1.21/1.39 % ------ BMC1
% 1.21/1.39
% 1.21/1.39 % bmc1_current_bound: -1
% 1.21/1.39 % bmc1_last_solved_bound: -1
% 1.21/1.39 % bmc1_unsat_core_size: -1
% 1.21/1.39 % bmc1_unsat_core_parents_size: -1
% 1.21/1.39 % bmc1_merge_next_fun: 0
% 1.21/1.39 % bmc1_unsat_core_clauses_time: 0.
% 1.21/1.39
% 1.21/1.39 % ------ Instantiation
% 1.21/1.39
% 1.21/1.39 % inst_num_of_clauses: 276
% 1.21/1.39 % inst_num_in_passive: 0
% 1.21/1.39 % inst_num_in_active: 258
% 1.21/1.39 % inst_num_in_unprocessed: 0
% 1.21/1.39 % inst_num_of_loops: 295
% 1.21/1.39 % inst_num_of_learning_restarts: 0
% 1.21/1.39 % inst_num_moves_active_passive: 9
% 1.21/1.39 % inst_lit_activity: 45
% 1.21/1.39 % inst_lit_activity_moves: 0
% 1.21/1.39 % inst_num_tautologies: 18
% 1.21/1.39 % inst_num_prop_implied: 0
% 1.21/1.39 % inst_num_existing_simplified: 0
% 1.21/1.39 % inst_num_eq_res_simplified: 0
% 1.21/1.39 % inst_num_child_elim: 0
% 1.21/1.39 % inst_num_of_dismatching_blockings: 27
% 1.21/1.39 % inst_num_of_non_proper_insts: 408
% 1.21/1.39 % inst_num_of_duplicates: 173
% 1.21/1.39 % inst_inst_num_from_inst_to_res: 0
% 1.21/1.39 % inst_dismatching_checking_time: 0.
% 1.21/1.39
% 1.21/1.39 % ------ Resolution
% 1.21/1.39
% 1.21/1.39 % res_num_of_clauses: 12014
% 1.21/1.39 % res_num_in_passive: 11323
% 1.21/1.39 % res_num_in_active: 610
% 1.21/1.39 % res_num_of_loops: 1000
% 1.21/1.39 % res_forward_subset_subsumed: 11009
% 1.21/1.39 % res_backward_subset_subsumed: 4
% 1.21/1.39 % res_forward_subsumed: 423
% 1.21/1.39 % res_backward_subsumed: 4
% 1.21/1.39 % res_forward_subsumption_resolution: 1
% 1.21/1.39 % res_backward_subsumption_resolution: 0
% 1.21/1.39 % res_clause_to_clause_subsumption: 39853
% 1.21/1.39 % res_orphan_elimination: 0
% 1.21/1.39 % res_tautology_del: 45
% 1.21/1.39 % res_num_eq_res_simplified: 0
% 1.21/1.39 % res_num_sel_changes: 0
% 1.21/1.39 % res_moves_from_active_to_pass: 0
% 1.21/1.39
% 1.21/1.39 % Status Unknown
% 1.21/1.42 % Orienting using strategy ClausalAll
% 1.21/1.42 % Orientation found
% 1.21/1.42 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_b63881.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_3f6893.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_7ad9ea | grep -v "SZS"
% 1.21/1.43
% 1.21/1.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.21/1.43
% 1.21/1.43 %
% 1.21/1.43 % ------ iProver source info
% 1.21/1.43
% 1.21/1.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.21/1.43 % git: non_committed_changes: true
% 1.21/1.43 % git: last_make_outside_of_git: true
% 1.21/1.43
% 1.21/1.43 %
% 1.21/1.43 % ------ Input Options
% 1.21/1.43
% 1.21/1.43 % --out_options all
% 1.21/1.43 % --tptp_safe_out true
% 1.21/1.43 % --problem_path ""
% 1.21/1.43 % --include_path ""
% 1.21/1.43 % --clausifier .//eprover
% 1.21/1.43 % --clausifier_options --tstp-format
% 1.21/1.43 % --stdin false
% 1.21/1.43 % --dbg_backtrace false
% 1.21/1.43 % --dbg_dump_prop_clauses false
% 1.21/1.43 % --dbg_dump_prop_clauses_file -
% 1.21/1.43 % --dbg_out_stat false
% 1.21/1.43
% 1.21/1.43 % ------ General Options
% 1.21/1.43
% 1.21/1.43 % --fof false
% 1.21/1.43 % --time_out_real 150.
% 1.21/1.43 % --time_out_prep_mult 0.2
% 1.21/1.43 % --time_out_virtual -1.
% 1.21/1.43 % --schedule none
% 1.21/1.43 % --ground_splitting input
% 1.21/1.43 % --splitting_nvd 16
% 1.21/1.43 % --non_eq_to_eq false
% 1.21/1.43 % --prep_gs_sim true
% 1.21/1.43 % --prep_unflatten false
% 1.21/1.43 % --prep_res_sim true
% 1.21/1.43 % --prep_upred true
% 1.21/1.43 % --res_sim_input true
% 1.21/1.43 % --clause_weak_htbl true
% 1.21/1.43 % --gc_record_bc_elim false
% 1.21/1.43 % --symbol_type_check false
% 1.21/1.43 % --clausify_out false
% 1.21/1.43 % --large_theory_mode false
% 1.21/1.43 % --prep_sem_filter none
% 1.21/1.43 % --prep_sem_filter_out false
% 1.21/1.43 % --preprocessed_out false
% 1.21/1.43 % --sub_typing false
% 1.21/1.43 % --brand_transform false
% 1.21/1.43 % --pure_diseq_elim true
% 1.21/1.43 % --min_unsat_core false
% 1.21/1.43 % --pred_elim true
% 1.21/1.43 % --add_important_lit false
% 1.21/1.43 % --soft_assumptions false
% 1.21/1.43 % --reset_solvers false
% 1.21/1.43 % --bc_imp_inh []
% 1.21/1.43 % --conj_cone_tolerance 1.5
% 1.21/1.43 % --prolific_symb_bound 500
% 1.21/1.43 % --lt_threshold 2000
% 1.21/1.43
% 1.21/1.43 % ------ SAT Options
% 1.21/1.43
% 1.21/1.43 % --sat_mode false
% 1.21/1.43 % --sat_fm_restart_options ""
% 1.21/1.43 % --sat_gr_def false
% 1.21/1.43 % --sat_epr_types true
% 1.21/1.43 % --sat_non_cyclic_types false
% 1.21/1.43 % --sat_finite_models false
% 1.21/1.43 % --sat_fm_lemmas false
% 1.21/1.43 % --sat_fm_prep false
% 1.21/1.43 % --sat_fm_uc_incr true
% 1.21/1.43 % --sat_out_model small
% 1.21/1.43 % --sat_out_clauses false
% 1.21/1.43
% 1.21/1.43 % ------ QBF Options
% 1.21/1.43
% 1.21/1.43 % --qbf_mode false
% 1.21/1.43 % --qbf_elim_univ true
% 1.21/1.43 % --qbf_sk_in true
% 1.21/1.43 % --qbf_pred_elim true
% 1.21/1.43 % --qbf_split 32
% 1.21/1.43
% 1.21/1.43 % ------ BMC1 Options
% 1.21/1.43
% 1.21/1.43 % --bmc1_incremental false
% 1.21/1.43 % --bmc1_axioms reachable_all
% 1.21/1.43 % --bmc1_min_bound 0
% 1.21/1.43 % --bmc1_max_bound -1
% 1.21/1.43 % --bmc1_max_bound_default -1
% 1.21/1.43 % --bmc1_symbol_reachability true
% 1.21/1.43 % --bmc1_property_lemmas false
% 1.21/1.43 % --bmc1_k_induction false
% 1.21/1.43 % --bmc1_non_equiv_states false
% 1.21/1.43 % --bmc1_deadlock false
% 1.21/1.43 % --bmc1_ucm false
% 1.21/1.43 % --bmc1_add_unsat_core none
% 1.21/1.43 % --bmc1_unsat_core_children false
% 1.21/1.43 % --bmc1_unsat_core_extrapolate_axioms false
% 1.21/1.43 % --bmc1_out_stat full
% 1.21/1.43 % --bmc1_ground_init false
% 1.21/1.43 % --bmc1_pre_inst_next_state false
% 1.21/1.43 % --bmc1_pre_inst_state false
% 1.21/1.43 % --bmc1_pre_inst_reach_state false
% 1.21/1.43 % --bmc1_out_unsat_core false
% 1.21/1.43 % --bmc1_aig_witness_out false
% 1.21/1.43 % --bmc1_verbose false
% 1.21/1.43 % --bmc1_dump_clauses_tptp false
% 1.21/1.44 % --bmc1_dump_unsat_core_tptp false
% 1.21/1.44 % --bmc1_dump_file -
% 1.21/1.44 % --bmc1_ucm_expand_uc_limit 128
% 1.21/1.44 % --bmc1_ucm_n_expand_iterations 6
% 1.21/1.44 % --bmc1_ucm_extend_mode 1
% 1.21/1.44 % --bmc1_ucm_init_mode 2
% 1.21/1.44 % --bmc1_ucm_cone_mode none
% 1.21/1.44 % --bmc1_ucm_reduced_relation_type 0
% 1.21/1.44 % --bmc1_ucm_relax_model 4
% 1.21/1.44 % --bmc1_ucm_full_tr_after_sat true
% 1.21/1.44 % --bmc1_ucm_expand_neg_assumptions false
% 1.21/1.44 % --bmc1_ucm_layered_model none
% 1.21/1.44 % --bmc1_ucm_max_lemma_size 10
% 1.21/1.44
% 1.21/1.44 % ------ AIG Options
% 1.21/1.44
% 1.21/1.44 % --aig_mode false
% 1.21/1.44
% 1.21/1.44 % ------ Instantiation Options
% 1.21/1.44
% 1.21/1.44 % --instantiation_flag true
% 1.21/1.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.21/1.44 % --inst_solver_per_active 750
% 1.21/1.44 % --inst_solver_calls_frac 0.5
% 1.21/1.44 % --inst_passive_queue_type priority_queues
% 1.21/1.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.21/1.44 % --inst_passive_queues_freq [25;2]
% 1.21/1.44 % --inst_dismatching true
% 1.21/1.44 % --inst_eager_unprocessed_to_passive true
% 1.21/1.44 % --inst_prop_sim_given true
% 1.21/1.44 % --inst_prop_sim_new false
% 1.21/1.44 % --inst_orphan_elimination true
% 1.21/1.44 % --inst_learning_loop_flag true
% 1.21/1.44 % --inst_learning_start 3000
% 1.21/1.44 % --inst_learning_factor 2
% 1.21/1.44 % --inst_start_prop_sim_after_learn 3
% 1.21/1.44 % --inst_sel_renew solver
% 1.21/1.44 % --inst_lit_activity_flag true
% 1.21/1.44 % --inst_out_proof true
% 1.21/1.44
% 1.21/1.44 % ------ Resolution Options
% 1.21/1.44
% 1.21/1.44 % --resolution_flag true
% 1.21/1.44 % --res_lit_sel kbo_max
% 1.21/1.44 % --res_to_prop_solver none
% 1.21/1.44 % --res_prop_simpl_new false
% 1.21/1.44 % --res_prop_simpl_given false
% 1.21/1.44 % --res_passive_queue_type priority_queues
% 1.21/1.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.21/1.44 % --res_passive_queues_freq [15;5]
% 1.21/1.44 % --res_forward_subs full
% 1.21/1.44 % --res_backward_subs full
% 1.21/1.44 % --res_forward_subs_resolution true
% 1.21/1.44 % --res_backward_subs_resolution true
% 1.21/1.44 % --res_orphan_elimination false
% 1.21/1.44 % --res_time_limit 1000.
% 1.21/1.44 % --res_out_proof true
% 1.21/1.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_b63881.s
% 1.21/1.44 % --modulo true
% 1.21/1.44
% 1.21/1.44 % ------ Combination Options
% 1.21/1.44
% 1.21/1.44 % --comb_res_mult 1000
% 1.21/1.44 % --comb_inst_mult 300
% 1.21/1.44 % ------
% 1.21/1.44
% 1.21/1.44 % ------ Parsing...% successful
% 1.21/1.44
% 1.21/1.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 %
% 1.21/1.44
% 1.21/1.44 % ------ Proving...
% 1.21/1.44 % ------ Problem Properties
% 1.21/1.44
% 1.21/1.44 %
% 1.21/1.44 % EPR false
% 1.21/1.44 % Horn false
% 1.21/1.44 % Has equality true
% 1.21/1.44
% 1.21/1.44 % % ------ Input Options Time Limit: Unbounded
% 1.21/1.44
% 1.21/1.44
% 1.21/1.44 % % ------ Current options:
% 1.21/1.44
% 1.21/1.44 % ------ Input Options
% 1.21/1.44
% 1.21/1.44 % --out_options all
% 1.21/1.44 % --tptp_safe_out true
% 1.21/1.44 % --problem_path ""
% 1.21/1.44 % --include_path ""
% 1.21/1.44 % --clausifier .//eprover
% 1.21/1.44 % --clausifier_options --tstp-format
% 1.21/1.44 % --stdin false
% 1.21/1.44 % --dbg_backtrace false
% 1.21/1.44 % --dbg_dump_prop_clauses false
% 1.21/1.44 % --dbg_dump_prop_clauses_file -
% 1.21/1.44 % --dbg_out_stat false
% 1.21/1.44
% 1.21/1.44 % ------ General Options
% 1.21/1.44
% 1.21/1.44 % --fof false
% 1.21/1.44 % --time_out_real 150.
% 1.21/1.44 % --time_out_prep_mult 0.2
% 1.21/1.44 % --time_out_virtual -1.
% 1.21/1.44 % --schedule none
% 1.21/1.44 % --ground_splitting input
% 1.21/1.44 % --splitting_nvd 16
% 1.21/1.44 % --non_eq_to_eq false
% 1.21/1.44 % --prep_gs_sim true
% 1.21/1.44 % --prep_unflatten false
% 1.21/1.44 % --prep_res_sim true
% 1.21/1.44 % --prep_upred true
% 1.21/1.44 % --res_sim_input true
% 1.21/1.44 % --clause_weak_htbl true
% 1.21/1.44 % --gc_record_bc_elim false
% 1.21/1.44 % --symbol_type_check false
% 1.21/1.44 % --clausify_out false
% 1.21/1.44 % --large_theory_mode false
% 1.21/1.44 % --prep_sem_filter none
% 1.21/1.44 % --prep_sem_filter_out false
% 1.21/1.44 % --preprocessed_out false
% 1.21/1.44 % --sub_typing false
% 1.21/1.44 % --brand_transform false
% 1.21/1.44 % --pure_diseq_elim true
% 1.21/1.44 % --min_unsat_core false
% 1.21/1.44 % --pred_elim true
% 1.21/1.44 % --add_important_lit false
% 1.21/1.44 % --soft_assumptions false
% 1.21/1.44 % --reset_solvers false
% 1.21/1.44 % --bc_imp_inh []
% 1.21/1.44 % --conj_cone_tolerance 1.5
% 1.21/1.44 % --prolific_symb_bound 500
% 1.21/1.44 % --lt_threshold 2000
% 1.21/1.44
% 1.21/1.44 % ------ SAT Options
% 1.21/1.44
% 1.21/1.44 % --sat_mode false
% 1.21/1.44 % --sat_fm_restart_options ""
% 1.21/1.44 % --sat_gr_def false
% 1.21/1.44 % --sat_epr_types true
% 1.21/1.44 % --sat_non_cyclic_types false
% 1.21/1.44 % --sat_finite_models false
% 1.21/1.44 % --sat_fm_lemmas false
% 1.21/1.44 % --sat_fm_prep false
% 1.21/1.44 % --sat_fm_uc_incr true
% 1.21/1.44 % --sat_out_model small
% 1.21/1.44 % --sat_out_clauses false
% 1.21/1.44
% 1.21/1.44 % ------ QBF Options
% 1.21/1.44
% 1.21/1.44 % --qbf_mode false
% 1.21/1.44 % --qbf_elim_univ true
% 1.21/1.44 % --qbf_sk_in true
% 1.21/1.44 % --qbf_pred_elim true
% 1.21/1.44 % --qbf_split 32
% 1.21/1.44
% 1.21/1.44 % ------ BMC1 Options
% 1.21/1.44
% 1.21/1.44 % --bmc1_incremental false
% 1.21/1.44 % --bmc1_axioms reachable_all
% 1.21/1.44 % --bmc1_min_bound 0
% 1.21/1.44 % --bmc1_max_bound -1
% 1.21/1.44 % --bmc1_max_bound_default -1
% 1.21/1.44 % --bmc1_symbol_reachability true
% 1.21/1.44 % --bmc1_property_lemmas false
% 1.21/1.44 % --bmc1_k_induction false
% 1.21/1.44 % --bmc1_non_equiv_states false
% 1.21/1.44 % --bmc1_deadlock false
% 1.21/1.44 % --bmc1_ucm false
% 1.21/1.44 % --bmc1_add_unsat_core none
% 1.21/1.44 % --bmc1_unsat_core_children false
% 1.21/1.44 % --bmc1_unsat_core_extrapolate_axioms false
% 1.21/1.44 % --bmc1_out_stat full
% 1.21/1.44 % --bmc1_ground_init false
% 1.21/1.44 % --bmc1_pre_inst_next_state false
% 1.21/1.44 % --bmc1_pre_inst_state false
% 1.21/1.44 % --bmc1_pre_inst_reach_state false
% 1.21/1.44 % --bmc1_out_unsat_core false
% 1.21/1.44 % --bmc1_aig_witness_out false
% 1.21/1.44 % --bmc1_verbose false
% 1.21/1.44 % --bmc1_dump_clauses_tptp false
% 1.21/1.44 % --bmc1_dump_unsat_core_tptp false
% 1.21/1.44 % --bmc1_dump_file -
% 1.21/1.44 % --bmc1_ucm_expand_uc_limit 128
% 1.21/1.44 % --bmc1_ucm_n_expand_iterations 6
% 1.21/1.44 % --bmc1_ucm_extend_mode 1
% 1.21/1.44 % --bmc1_ucm_init_mode 2
% 1.21/1.44 % --bmc1_ucm_cone_mode none
% 1.21/1.44 % --bmc1_ucm_reduced_relation_type 0
% 1.21/1.44 % --bmc1_ucm_relax_model 4
% 1.21/1.44 % --bmc1_ucm_full_tr_after_sat true
% 1.21/1.44 % --bmc1_ucm_expand_neg_assumptions false
% 1.21/1.44 % --bmc1_ucm_layered_model none
% 1.21/1.44 % --bmc1_ucm_max_lemma_size 10
% 1.21/1.44
% 1.21/1.44 % ------ AIG Options
% 1.21/1.44
% 1.21/1.44 % --aig_mode false
% 1.21/1.44
% 1.21/1.44 % ------ Instantiation Options
% 1.21/1.44
% 1.21/1.44 % --instantiation_flag true
% 1.21/1.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.21/1.44 % --inst_solver_per_active 750
% 1.21/1.44 % --inst_solver_calls_frac 0.5
% 1.21/1.44 % --inst_passive_queue_type priority_queues
% 1.21/1.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.21/1.44 % --inst_passive_queues_freq [25;2]
% 1.21/1.44 % --inst_dismatching true
% 1.21/1.44 % --inst_eager_unprocessed_to_passive true
% 1.21/1.44 % --inst_prop_sim_given true
% 1.26/1.60 % --inst_prop_sim_new false
% 1.26/1.60 % --inst_orphan_elimination true
% 1.26/1.60 % --inst_learning_loop_flag true
% 1.26/1.60 % --inst_learning_start 3000
% 1.26/1.60 % --inst_learning_factor 2
% 1.26/1.60 % --inst_start_prop_sim_after_learn 3
% 1.26/1.60 % --inst_sel_renew solver
% 1.26/1.60 % --inst_lit_activity_flag true
% 1.26/1.60 % --inst_out_proof true
% 1.26/1.60
% 1.26/1.60 % ------ Resolution Options
% 1.26/1.60
% 1.26/1.60 % --resolution_flag true
% 1.26/1.60 % --res_lit_sel kbo_max
% 1.26/1.60 % --res_to_prop_solver none
% 1.26/1.60 % --res_prop_simpl_new false
% 1.26/1.60 % --res_prop_simpl_given false
% 1.26/1.60 % --res_passive_queue_type priority_queues
% 1.26/1.60 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.26/1.60 % --res_passive_queues_freq [15;5]
% 1.26/1.60 % --res_forward_subs full
% 1.26/1.60 % --res_backward_subs full
% 1.26/1.60 % --res_forward_subs_resolution true
% 1.26/1.60 % --res_backward_subs_resolution true
% 1.26/1.60 % --res_orphan_elimination false
% 1.26/1.60 % --res_time_limit 1000.
% 1.26/1.60 % --res_out_proof true
% 1.26/1.60 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_b63881.s
% 1.26/1.60 % --modulo true
% 1.26/1.60
% 1.26/1.60 % ------ Combination Options
% 1.26/1.60
% 1.26/1.60 % --comb_res_mult 1000
% 1.26/1.60 % --comb_inst_mult 300
% 1.26/1.60 % ------
% 1.26/1.60
% 1.26/1.60
% 1.26/1.60
% 1.26/1.60 % ------ Proving...
% 1.26/1.60 % warning: shown sat in sat incomplete mode
% 1.26/1.60 %
% 1.26/1.60
% 1.26/1.60
% 1.26/1.60 ------ Building Model...Done
% 1.26/1.60
% 1.26/1.60 %------ The model is defined over ground terms (initial term algebra).
% 1.26/1.60 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.26/1.60 %------ where \phi is a formula over the term algebra.
% 1.26/1.60 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.26/1.60 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.26/1.60 %------ See help for --sat_out_model for different model outputs.
% 1.26/1.60 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.26/1.60 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.26/1.60
% 1.26/1.60
% 1.26/1.60
% 1.26/1.60
% 1.26/1.60 %------ Negative definition of equality_sorted
% 1.26/1.60 fof(lit_def,axiom,
% 1.26/1.60 (! [X0,X0,X1] :
% 1.26/1.60 ( ~(equality_sorted(X0,X0,X1)) <=>
% 1.26/1.60 (
% 1.26/1.60 ? [X2] :
% 1.26/1.60 (
% 1.26/1.60 ( X0=$i & X0=age(sk2,X2) & X1=zero )
% 1.26/1.60 &
% 1.26/1.60 ( X2!=sk3 )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 ).
% 1.26/1.60
% 1.26/1.60 %------ Positive definition of greater
% 1.26/1.60 fof(lit_def,axiom,
% 1.26/1.60 (! [X0,X1] :
% 1.26/1.60 ( greater(X0,X1) <=>
% 1.26/1.60 (
% 1.26/1.60 (
% 1.26/1.60 ( X0=mod2 & X1=mod1 )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 (
% 1.26/1.60 ( X0=tau & X1=zero )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 (
% 1.26/1.60 ( X0=sigma & X1=zero )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 (
% 1.26/1.60 ( X0=age(sk2,sk5) & X1=zero )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 (
% 1.26/1.60 ( X0=age(sk2,sk5) & X1=sigma )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 ? [X2] :
% 1.26/1.60 (
% 1.26/1.60 ( X0=age(sk2,X2) & X1=zero )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 ? [X2] :
% 1.26/1.60 (
% 1.26/1.60 ( X0=age(sk2,X2) & X1=sigma )
% 1.26/1.60 &
% 1.26/1.60 ( X2!=sk3 )
% 1.26/1.60 &
% 1.26/1.60 ( X2!=sk5 )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 (
% 1.26/1.60 ( X1=zero )
% 1.26/1.60 &
% 1.26/1.60 ( X0!=mod1 )
% 1.26/1.60 &
% 1.26/1.60 ( X0!=zero )
% 1.26/1.60 &
% 1.26/1.60 ( X0!=tau )
% 1.26/1.60 &
% 1.26/1.60 ( X0!=sigma )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 ).
% 1.26/1.60
% 1.26/1.60 %------ Negative definition of smaller_or_equal
% 1.26/1.60 fof(lit_def,axiom,
% 1.26/1.60 (! [X0,X1] :
% 1.26/1.60 ( ~(smaller_or_equal(X0,X1)) <=>
% 1.26/1.60 (
% 1.26/1.60 ? [X2] :
% 1.26/1.60 (
% 1.26/1.60 ( X0=age(sk2,X2) & X1=zero )
% 1.26/1.60 &
% 1.26/1.60 ( X2!=sk3 )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 ).
% 1.26/1.60
% 1.26/1.60 %------ Positive definition of greater_or_equal
% 1.26/1.60 fof(lit_def,axiom,
% 1.26/1.60 (! [X0,X1] :
% 1.26/1.60 ( greater_or_equal(X0,X1) <=>
% 1.26/1.60 $true
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 ).
% 1.26/1.60
% 1.26/1.60 %------ Positive definition of smaller
% 1.26/1.60 fof(lit_def,axiom,
% 1.26/1.60 (! [X0,X1] :
% 1.26/1.60 ( smaller(X0,X1) <=>
% 1.26/1.60 (
% 1.26/1.60 (
% 1.26/1.60 ( X0=mod1 & X1=mod2 )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 (
% 1.26/1.60 ( X0=zero )
% 1.26/1.60 &
% 1.26/1.60 ( X1!=mod1 )
% 1.26/1.60 &
% 1.26/1.60 ( X1!=zero )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 (
% 1.26/1.60 ( X0=zero & X1=tau )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 (
% 1.26/1.60 ( X0=zero & X1=sigma )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 (
% 1.26/1.60 ( X0=sigma & X1=age(sk2,sk5) )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 ? [X2] :
% 1.26/1.60 (
% 1.26/1.60 ( X0=sigma & X1=age(sk2,X2) )
% 1.26/1.60 &
% 1.26/1.60 ( X2!=sk3 )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 ).
% 1.26/1.60
% 1.26/1.60 %------ Positive definition of organization
% 1.26/1.60 fof(lit_def,axiom,
% 1.26/1.60 (! [X0] :
% 1.26/1.60 ( organization(X0) <=>
% 1.26/1.60 (
% 1.26/1.60 (
% 1.26/1.60 ( X0=sk2 )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 ).
% 1.26/1.60
% 1.26/1.60 %------ Positive definition of has_immunity
% 1.26/1.60 fof(lit_def,axiom,
% 1.26/1.60 (! [X0,X1] :
% 1.26/1.60 ( has_immunity(X0,X1) <=>
% 1.26/1.60 $false
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 ).
% 1.26/1.60
% 1.26/1.60 %------ Positive definition of has_endowment
% 1.26/1.60 fof(lit_def,axiom,
% 1.26/1.60 (! [X0] :
% 1.26/1.60 ( has_endowment(X0) <=>
% 1.26/1.60 $false
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 ).
% 1.26/1.60
% 1.26/1.60 %------ Positive definition of is_aligned
% 1.26/1.60 fof(lit_def,axiom,
% 1.26/1.60 (! [X0,X1] :
% 1.26/1.60 ( is_aligned(X0,X1) <=>
% 1.26/1.60 (
% 1.26/1.60 (
% 1.26/1.60 ( X0=sk2 & X1=sk3 )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 ).
% 1.26/1.60
% 1.26/1.60 %------ Positive definition of positional_advantage
% 1.26/1.60 fof(lit_def,axiom,
% 1.26/1.60 (! [X0,X1] :
% 1.26/1.60 ( positional_advantage(X0,X1) <=>
% 1.26/1.60 $false
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 ).
% 1.26/1.60
% 1.26/1.60 %------ Negative definition of robust_position
% 1.26/1.60 fof(lit_def,axiom,
% 1.26/1.60 (! [X0] :
% 1.26/1.60 ( ~(robust_position(X0)) <=>
% 1.26/1.60 $false
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 ).
% 1.26/1.60
% 1.26/1.60 %------ Positive definition of dissimilar
% 1.26/1.60 fof(lit_def,axiom,
% 1.26/1.60 (! [X0,X1,X2] :
% 1.26/1.60 ( dissimilar(X0,X1,X2) <=>
% 1.26/1.60 (
% 1.26/1.60 (
% 1.26/1.60 ( X0=sk2 & X1=sk3 )
% 1.26/1.60 &
% 1.26/1.60 ( X2!=sk3 )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 (
% 1.26/1.60 ( X0=sk2 & X1=sk3 & X2=sk5 )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 |
% 1.26/1.60 (
% 1.26/1.60 ( X0=sk2 & X2=sk3 )
% 1.26/1.60 &
% 1.26/1.60 ( X1!=sk3 )
% 1.26/1.60 )
% 1.26/1.60
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 )
% 1.26/1.60 ).
% 1.26/1.60
% 1.26/1.60
% 1.26/1.60
% 1.26/1.60 % ------ Statistics
% 1.26/1.60
% 1.26/1.60 % ------ General
% 1.26/1.60
% 1.26/1.60 % num_of_input_clauses: 116
% 1.26/1.60 % num_of_input_neg_conjectures: 10
% 1.26/1.60 % num_of_splits: 0
% 1.26/1.60 % num_of_split_atoms: 0
% 1.26/1.60 % num_of_sem_filtered_clauses: 0
% 1.26/1.60 % num_of_subtypes: 0
% 1.26/1.60 % monotx_restored_types: 0
% 1.26/1.60 % sat_num_of_epr_types: 0
% 1.26/1.60 % sat_num_of_non_cyclic_types: 0
% 1.26/1.60 % sat_guarded_non_collapsed_types: 0
% 1.26/1.60 % is_epr: 0
% 1.26/1.60 % is_horn: 0
% 1.26/1.60 % has_eq: 1
% 1.26/1.60 % num_pure_diseq_elim: 0
% 1.26/1.60 % simp_replaced_by: 0
% 1.26/1.60 % res_preprocessed: 20
% 1.26/1.60 % prep_upred: 0
% 1.26/1.60 % prep_unflattend: 0
% 1.26/1.60 % pred_elim_cands: 0
% 1.26/1.60 % pred_elim: 0
% 1.26/1.60 % pred_elim_cl: 0
% 1.26/1.60 % pred_elim_cycles: 0
% 1.26/1.60 % forced_gc_time: 0
% 1.26/1.60 % gc_basic_clause_elim: 0
% 1.26/1.60 % parsing_time: 0.003
% 1.26/1.60 % sem_filter_time: 0.
% 1.26/1.60 % pred_elim_time: 0.
% 1.26/1.60 % out_proof_time: 0.
% 1.26/1.60 % monotx_time: 0.
% 1.26/1.60 % subtype_inf_time: 0.
% 1.26/1.60 % unif_index_cands_time: 0.
% 1.26/1.60 % unif_index_add_time: 0.
% 1.26/1.60 % total_time: 0.181
% 1.26/1.60 % num_of_symbols: 51
% 1.26/1.60 % num_of_terms: 717
% 1.26/1.60
% 1.26/1.60 % ------ Propositional Solver
% 1.26/1.60
% 1.26/1.60 % prop_solver_calls: 6
% 1.26/1.60 % prop_fast_solver_calls: 33
% 1.26/1.60 % prop_num_of_clauses: 196
% 1.26/1.60 % prop_preprocess_simplified: 873
% 1.26/1.60 % prop_fo_subsumed: 0
% 1.26/1.60 % prop_solver_time: 0.
% 1.26/1.60 % prop_fast_solver_time: 0.
% 1.26/1.60 % prop_unsat_core_time: 0.
% 1.26/1.60
% 1.26/1.60 % ------ QBF
% 1.26/1.60
% 1.26/1.60 % qbf_q_res: 0
% 1.26/1.60 % qbf_num_tautologies: 0
% 1.26/1.60 % qbf_prep_cycles: 0
% 1.26/1.60
% 1.26/1.60 % ------ BMC1
% 1.26/1.60
% 1.26/1.60 % bmc1_current_bound: -1
% 1.26/1.60 % bmc1_last_solved_bound: -1
% 1.26/1.60 % bmc1_unsat_core_size: -1
% 1.26/1.60 % bmc1_unsat_core_parents_size: -1
% 1.26/1.60 % bmc1_merge_next_fun: 0
% 1.26/1.60 % bmc1_unsat_core_clauses_time: 0.
% 1.26/1.60
% 1.26/1.60 % ------ Instantiation
% 1.26/1.60
% 1.26/1.60 % inst_num_of_clauses: 219
% 1.26/1.60 % inst_num_in_passive: 0
% 1.26/1.60 % inst_num_in_active: 202
% 1.26/1.60 % inst_num_in_unprocessed: 0
% 1.26/1.60 % inst_num_of_loops: 241
% 1.26/1.60 % inst_num_of_learning_restarts: 0
% 1.26/1.60 % inst_num_moves_active_passive: 14
% 1.26/1.60 % inst_lit_activity: 45
% 1.26/1.60 % inst_lit_activity_moves: 0
% 1.26/1.60 % inst_num_tautologies: 17
% 1.26/1.60 % inst_num_prop_implied: 0
% 1.26/1.60 % inst_num_existing_simplified: 0
% 1.26/1.60 % inst_num_eq_res_simplified: 0
% 1.26/1.60 % inst_num_child_elim: 0
% 1.26/1.60 % inst_num_of_dismatching_blockings: 12
% 1.26/1.60 % inst_num_of_non_proper_insts: 259
% 1.26/1.60 % inst_num_of_duplicates: 106
% 1.26/1.60 % inst_inst_num_from_inst_to_res: 0
% 1.26/1.60 % inst_dismatching_checking_time: 0.
% 1.26/1.60
% 1.26/1.60 % ------ Resolution
% 1.26/1.60
% 1.26/1.60 % res_num_of_clauses: 1236
% 1.26/1.60 % res_num_in_passive: 812
% 1.26/1.60 % res_num_in_active: 340
% 1.26/1.60 % res_num_of_loops: 1000
% 1.26/1.60 % res_forward_subset_subsumed: 2608
% 1.26/1.60 % res_backward_subset_subsumed: 32
% 1.26/1.60 % res_forward_subsumed: 666
% 1.26/1.60 % res_backward_subsumed: 25
% 1.26/1.60 % res_forward_subsumption_resolution: 12
% 1.26/1.60 % res_backward_subsumption_resolution: 0
% 1.26/1.60 % res_clause_to_clause_subsumption: 17168
% 1.26/1.60 % res_orphan_elimination: 0
% 1.26/1.60 % res_tautology_del: 95
% 1.26/1.60 % res_num_eq_res_simplified: 0
% 1.26/1.60 % res_num_sel_changes: 0
% 1.26/1.60 % res_moves_from_active_to_pass: 0
% 1.26/1.60
% 1.26/1.60 % Status Unknown
% 1.26/1.60 % Last status :
% 1.26/1.60 % SZS status Unknown
%------------------------------------------------------------------------------