TSTP Solution File: LCL643+1.001 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : LCL643+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n008.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 11:36:54 EDT 2022
% Result : Unknown 19.43s 19.67s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LCL643+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n008.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 : Sun Jul 3 23:28:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.20/0.47 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.47 % FOF problem with conjecture
% 0.20/0.47 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_40aa0a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_6c0630.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_1f6426 | grep -v "SZS"
% 0.20/0.49
% 0.20/0.49 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.49
% 0.20/0.49 %
% 0.20/0.49 % ------ iProver source info
% 0.20/0.49
% 0.20/0.49 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.49 % git: non_committed_changes: true
% 0.20/0.49 % git: last_make_outside_of_git: true
% 0.20/0.49
% 0.20/0.49 %
% 0.20/0.49 % ------ Input Options
% 0.20/0.49
% 0.20/0.49 % --out_options all
% 0.20/0.49 % --tptp_safe_out true
% 0.20/0.49 % --problem_path ""
% 0.20/0.49 % --include_path ""
% 0.20/0.49 % --clausifier .//eprover
% 0.20/0.49 % --clausifier_options --tstp-format
% 0.20/0.49 % --stdin false
% 0.20/0.49 % --dbg_backtrace false
% 0.20/0.49 % --dbg_dump_prop_clauses false
% 0.20/0.49 % --dbg_dump_prop_clauses_file -
% 0.20/0.49 % --dbg_out_stat false
% 0.20/0.49
% 0.20/0.49 % ------ General Options
% 0.20/0.49
% 0.20/0.49 % --fof false
% 0.20/0.49 % --time_out_real 150.
% 0.20/0.49 % --time_out_prep_mult 0.2
% 0.20/0.49 % --time_out_virtual -1.
% 0.20/0.49 % --schedule none
% 0.20/0.49 % --ground_splitting input
% 0.20/0.49 % --splitting_nvd 16
% 0.20/0.49 % --non_eq_to_eq false
% 0.20/0.49 % --prep_gs_sim true
% 0.20/0.49 % --prep_unflatten false
% 0.20/0.49 % --prep_res_sim true
% 0.20/0.49 % --prep_upred true
% 0.20/0.49 % --res_sim_input true
% 0.20/0.49 % --clause_weak_htbl true
% 0.20/0.49 % --gc_record_bc_elim false
% 0.20/0.49 % --symbol_type_check false
% 0.20/0.49 % --clausify_out false
% 0.20/0.49 % --large_theory_mode false
% 0.20/0.49 % --prep_sem_filter none
% 0.20/0.49 % --prep_sem_filter_out false
% 0.20/0.49 % --preprocessed_out false
% 0.20/0.49 % --sub_typing false
% 0.20/0.49 % --brand_transform false
% 0.20/0.49 % --pure_diseq_elim true
% 0.20/0.49 % --min_unsat_core false
% 0.20/0.49 % --pred_elim true
% 0.20/0.49 % --add_important_lit false
% 0.20/0.49 % --soft_assumptions false
% 0.20/0.49 % --reset_solvers false
% 0.20/0.49 % --bc_imp_inh []
% 0.20/0.49 % --conj_cone_tolerance 1.5
% 0.20/0.49 % --prolific_symb_bound 500
% 0.20/0.49 % --lt_threshold 2000
% 0.20/0.49
% 0.20/0.49 % ------ SAT Options
% 0.20/0.49
% 0.20/0.49 % --sat_mode false
% 0.20/0.49 % --sat_fm_restart_options ""
% 0.20/0.49 % --sat_gr_def false
% 0.20/0.49 % --sat_epr_types true
% 0.20/0.49 % --sat_non_cyclic_types false
% 0.20/0.49 % --sat_finite_models false
% 0.20/0.49 % --sat_fm_lemmas false
% 0.20/0.49 % --sat_fm_prep false
% 0.20/0.49 % --sat_fm_uc_incr true
% 0.20/0.49 % --sat_out_model small
% 0.20/0.49 % --sat_out_clauses false
% 0.20/0.49
% 0.20/0.49 % ------ QBF Options
% 0.20/0.49
% 0.20/0.49 % --qbf_mode false
% 0.20/0.49 % --qbf_elim_univ true
% 0.20/0.49 % --qbf_sk_in true
% 0.20/0.49 % --qbf_pred_elim true
% 0.20/0.49 % --qbf_split 32
% 0.20/0.49
% 0.20/0.49 % ------ BMC1 Options
% 0.20/0.49
% 0.20/0.49 % --bmc1_incremental false
% 0.20/0.49 % --bmc1_axioms reachable_all
% 0.20/0.49 % --bmc1_min_bound 0
% 0.20/0.49 % --bmc1_max_bound -1
% 0.20/0.49 % --bmc1_max_bound_default -1
% 0.20/0.49 % --bmc1_symbol_reachability true
% 0.20/0.49 % --bmc1_property_lemmas false
% 0.20/0.49 % --bmc1_k_induction false
% 0.20/0.49 % --bmc1_non_equiv_states false
% 0.20/0.49 % --bmc1_deadlock false
% 0.20/0.49 % --bmc1_ucm false
% 0.20/0.49 % --bmc1_add_unsat_core none
% 0.20/0.49 % --bmc1_unsat_core_children false
% 0.20/0.49 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.49 % --bmc1_out_stat full
% 0.20/0.49 % --bmc1_ground_init false
% 0.20/0.49 % --bmc1_pre_inst_next_state false
% 0.20/0.49 % --bmc1_pre_inst_state false
% 0.20/0.49 % --bmc1_pre_inst_reach_state false
% 0.20/0.49 % --bmc1_out_unsat_core false
% 0.20/0.49 % --bmc1_aig_witness_out false
% 0.20/0.49 % --bmc1_verbose false
% 0.20/0.49 % --bmc1_dump_clauses_tptp false
% 0.77/0.96 % --bmc1_dump_unsat_core_tptp false
% 0.77/0.96 % --bmc1_dump_file -
% 0.77/0.96 % --bmc1_ucm_expand_uc_limit 128
% 0.77/0.96 % --bmc1_ucm_n_expand_iterations 6
% 0.77/0.96 % --bmc1_ucm_extend_mode 1
% 0.77/0.96 % --bmc1_ucm_init_mode 2
% 0.77/0.96 % --bmc1_ucm_cone_mode none
% 0.77/0.96 % --bmc1_ucm_reduced_relation_type 0
% 0.77/0.96 % --bmc1_ucm_relax_model 4
% 0.77/0.96 % --bmc1_ucm_full_tr_after_sat true
% 0.77/0.96 % --bmc1_ucm_expand_neg_assumptions false
% 0.77/0.96 % --bmc1_ucm_layered_model none
% 0.77/0.96 % --bmc1_ucm_max_lemma_size 10
% 0.77/0.96
% 0.77/0.96 % ------ AIG Options
% 0.77/0.96
% 0.77/0.96 % --aig_mode false
% 0.77/0.96
% 0.77/0.96 % ------ Instantiation Options
% 0.77/0.96
% 0.77/0.96 % --instantiation_flag true
% 0.77/0.96 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.77/0.96 % --inst_solver_per_active 750
% 0.77/0.96 % --inst_solver_calls_frac 0.5
% 0.77/0.96 % --inst_passive_queue_type priority_queues
% 0.77/0.96 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.77/0.96 % --inst_passive_queues_freq [25;2]
% 0.77/0.96 % --inst_dismatching true
% 0.77/0.96 % --inst_eager_unprocessed_to_passive true
% 0.77/0.96 % --inst_prop_sim_given true
% 0.77/0.96 % --inst_prop_sim_new false
% 0.77/0.96 % --inst_orphan_elimination true
% 0.77/0.96 % --inst_learning_loop_flag true
% 0.77/0.96 % --inst_learning_start 3000
% 0.77/0.96 % --inst_learning_factor 2
% 0.77/0.96 % --inst_start_prop_sim_after_learn 3
% 0.77/0.96 % --inst_sel_renew solver
% 0.77/0.96 % --inst_lit_activity_flag true
% 0.77/0.96 % --inst_out_proof true
% 0.77/0.96
% 0.77/0.96 % ------ Resolution Options
% 0.77/0.96
% 0.77/0.96 % --resolution_flag true
% 0.77/0.96 % --res_lit_sel kbo_max
% 0.77/0.96 % --res_to_prop_solver none
% 0.77/0.96 % --res_prop_simpl_new false
% 0.77/0.96 % --res_prop_simpl_given false
% 0.77/0.96 % --res_passive_queue_type priority_queues
% 0.77/0.96 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.77/0.96 % --res_passive_queues_freq [15;5]
% 0.77/0.96 % --res_forward_subs full
% 0.77/0.96 % --res_backward_subs full
% 0.77/0.96 % --res_forward_subs_resolution true
% 0.77/0.96 % --res_backward_subs_resolution true
% 0.77/0.96 % --res_orphan_elimination false
% 0.77/0.96 % --res_time_limit 1000.
% 0.77/0.96 % --res_out_proof true
% 0.77/0.96 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_40aa0a.s
% 0.77/0.96 % --modulo true
% 0.77/0.96
% 0.77/0.96 % ------ Combination Options
% 0.77/0.96
% 0.77/0.96 % --comb_res_mult 1000
% 0.77/0.96 % --comb_inst_mult 300
% 0.77/0.96 % ------
% 0.77/0.96
% 0.77/0.96 % ------ Parsing...% successful
% 0.77/0.96
% 0.77/0.96 % ------ Preprocessing... gs_s sp: 1152 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.77/0.96
% 0.77/0.96 % ------ Proving...
% 0.77/0.96 % ------ Problem Properties
% 0.77/0.96
% 0.77/0.96 %
% 0.77/0.96 % EPR false
% 0.77/0.96 % Horn false
% 0.77/0.96 % Has equality false
% 0.77/0.96
% 0.77/0.96 % % ------ Input Options Time Limit: Unbounded
% 0.77/0.96
% 0.77/0.96
% 0.77/0.96 % % ------ Current options:
% 0.77/0.96
% 0.77/0.96 % ------ Input Options
% 0.77/0.96
% 0.77/0.96 % --out_options all
% 0.77/0.96 % --tptp_safe_out true
% 0.77/0.96 % --problem_path ""
% 0.77/0.96 % --include_path ""
% 0.77/0.96 % --clausifier .//eprover
% 0.77/0.96 % --clausifier_options --tstp-format
% 0.77/0.96 % --stdin false
% 0.77/0.96 % --dbg_backtrace false
% 0.77/0.96 % --dbg_dump_prop_clauses false
% 0.77/0.96 % --dbg_dump_prop_clauses_file -
% 0.77/0.96 % --dbg_out_stat false
% 0.77/0.96
% 0.77/0.96 % ------ General Options
% 0.77/0.96
% 0.77/0.96 % --fof false
% 0.77/0.96 % --time_out_real 150.
% 0.77/0.96 % --time_out_prep_mult 0.2
% 0.77/0.96 % --time_out_virtual -1.
% 0.77/0.96 % --schedule none
% 0.77/0.96 % --ground_splitting input
% 0.77/0.96 % --splitting_nvd 16
% 0.77/0.96 % --non_eq_to_eq false
% 0.77/0.96 % --prep_gs_sim true
% 0.77/0.96 % --prep_unflatten false
% 0.77/0.96 % --prep_res_sim true
% 0.77/0.96 % --prep_upred true
% 0.77/0.96 % --res_sim_input true
% 0.77/0.96 % --clause_weak_htbl true
% 0.77/0.96 % --gc_record_bc_elim false
% 0.77/0.96 % --symbol_type_check false
% 0.77/0.96 % --clausify_out false
% 0.77/0.96 % --large_theory_mode false
% 0.77/0.96 % --prep_sem_filter none
% 0.77/0.96 % --prep_sem_filter_out false
% 0.77/0.96 % --preprocessed_out false
% 0.77/0.96 % --sub_typing false
% 0.77/0.96 % --brand_transform false
% 0.77/0.96 % --pure_diseq_elim true
% 0.77/0.96 % --min_unsat_core false
% 0.77/0.96 % --pred_elim true
% 0.77/0.96 % --add_important_lit false
% 0.77/0.96 % --soft_assumptions false
% 0.77/0.96 % --reset_solvers false
% 0.77/0.96 % --bc_imp_inh []
% 0.77/0.96 % --conj_cone_tolerance 1.5
% 0.77/0.96 % --prolific_symb_bound 500
% 0.77/0.96 % --lt_threshold 2000
% 0.77/0.96
% 0.77/0.96 % ------ SAT Options
% 0.77/0.96
% 0.77/0.96 % --sat_mode false
% 0.77/0.96 % --sat_fm_restart_options ""
% 0.77/0.96 % --sat_gr_def false
% 0.77/0.96 % --sat_epr_types true
% 0.77/0.96 % --sat_non_cyclic_types false
% 0.77/0.96 % --sat_finite_models false
% 0.77/0.96 % --sat_fm_lemmas false
% 0.77/0.96 % --sat_fm_prep false
% 0.77/0.96 % --sat_fm_uc_incr true
% 0.77/0.96 % --sat_out_model small
% 0.77/0.96 % --sat_out_clauses false
% 0.77/0.96
% 0.77/0.96 % ------ QBF Options
% 0.77/0.96
% 0.77/0.96 % --qbf_mode false
% 0.77/0.96 % --qbf_elim_univ true
% 0.77/0.96 % --qbf_sk_in true
% 0.77/0.96 % --qbf_pred_elim true
% 0.77/0.96 % --qbf_split 32
% 0.77/0.96
% 0.77/0.96 % ------ BMC1 Options
% 0.77/0.96
% 0.77/0.96 % --bmc1_incremental false
% 0.77/0.96 % --bmc1_axioms reachable_all
% 0.77/0.96 % --bmc1_min_bound 0
% 0.77/0.96 % --bmc1_max_bound -1
% 0.77/0.96 % --bmc1_max_bound_default -1
% 0.77/0.96 % --bmc1_symbol_reachability true
% 0.77/0.96 % --bmc1_property_lemmas false
% 0.77/0.96 % --bmc1_k_induction false
% 0.77/0.96 % --bmc1_non_equiv_states false
% 0.77/0.96 % --bmc1_deadlock false
% 0.77/0.96 % --bmc1_ucm false
% 0.77/0.96 % --bmc1_add_unsat_core none
% 0.77/0.96 % --bmc1_unsat_core_children false
% 0.77/0.96 % --bmc1_unsat_core_extrapolate_axioms false
% 0.77/0.96 % --bmc1_out_stat full
% 0.77/0.96 % --bmc1_ground_init false
% 0.77/0.96 % --bmc1_pre_inst_next_state false
% 0.77/0.96 % --bmc1_pre_inst_state false
% 0.77/0.96 % --bmc1_pre_inst_reach_state false
% 0.77/0.96 % --bmc1_out_unsat_core false
% 0.77/0.96 % --bmc1_aig_witness_out false
% 0.77/0.96 % --bmc1_verbose false
% 0.77/0.96 % --bmc1_dump_clauses_tptp false
% 0.77/0.96 % --bmc1_dump_unsat_core_tptp false
% 0.77/0.96 % --bmc1_dump_file -
% 0.77/0.96 % --bmc1_ucm_expand_uc_limit 128
% 0.77/0.96 % --bmc1_ucm_n_expand_iterations 6
% 0.77/0.96 % --bmc1_ucm_extend_mode 1
% 0.77/0.96 % --bmc1_ucm_init_mode 2
% 0.77/0.96 % --bmc1_ucm_cone_mode none
% 0.77/0.96 % --bmc1_ucm_reduced_relation_type 0
% 0.77/0.96 % --bmc1_ucm_relax_model 4
% 0.77/0.96 % --bmc1_ucm_full_tr_after_sat true
% 0.77/0.96 % --bmc1_ucm_expand_neg_assumptions false
% 0.77/0.96 % --bmc1_ucm_layered_model none
% 0.77/0.96 % --bmc1_ucm_max_lemma_size 10
% 0.77/0.96
% 0.77/0.96 % ------ AIG Options
% 0.77/0.96
% 0.77/0.96 % --aig_mode false
% 0.77/0.96
% 0.77/0.96 % ------ Instantiation Options
% 0.77/0.96
% 0.77/0.96 % --instantiation_flag true
% 0.77/0.96 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.77/0.96 % --inst_solver_per_active 750
% 0.77/0.96 % --inst_solver_calls_frac 0.5
% 0.77/0.96 % --inst_passive_queue_type priority_queues
% 0.77/0.96 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.77/0.96 % --inst_passive_queues_freq [25;2]
% 0.77/0.96 % --inst_dismatching true
% 0.77/0.96 % --inst_eager_unprocessed_to_passive true
% 0.77/0.96 % --inst_prop_sim_given true
% 9.84/10.04 % --inst_prop_sim_new false
% 9.84/10.04 % --inst_orphan_elimination true
% 9.84/10.04 % --inst_learning_loop_flag true
% 9.84/10.04 % --inst_learning_start 3000
% 9.84/10.04 % --inst_learning_factor 2
% 9.84/10.04 % --inst_start_prop_sim_after_learn 3
% 9.84/10.04 % --inst_sel_renew solver
% 9.84/10.04 % --inst_lit_activity_flag true
% 9.84/10.04 % --inst_out_proof true
% 9.84/10.04
% 9.84/10.04 % ------ Resolution Options
% 9.84/10.04
% 9.84/10.04 % --resolution_flag true
% 9.84/10.04 % --res_lit_sel kbo_max
% 9.84/10.04 % --res_to_prop_solver none
% 9.84/10.04 % --res_prop_simpl_new false
% 9.84/10.04 % --res_prop_simpl_given false
% 9.84/10.04 % --res_passive_queue_type priority_queues
% 9.84/10.04 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 9.84/10.04 % --res_passive_queues_freq [15;5]
% 9.84/10.04 % --res_forward_subs full
% 9.84/10.04 % --res_backward_subs full
% 9.84/10.04 % --res_forward_subs_resolution true
% 9.84/10.04 % --res_backward_subs_resolution true
% 9.84/10.04 % --res_orphan_elimination false
% 9.84/10.04 % --res_time_limit 1000.
% 9.84/10.04 % --res_out_proof true
% 9.84/10.04 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_40aa0a.s
% 9.84/10.04 % --modulo true
% 9.84/10.04
% 9.84/10.04 % ------ Combination Options
% 9.84/10.04
% 9.84/10.04 % --comb_res_mult 1000
% 9.84/10.04 % --comb_inst_mult 300
% 9.84/10.04 % ------
% 9.84/10.04
% 9.84/10.04
% 9.84/10.04
% 9.84/10.04 % ------ Proving...
% 9.84/10.04 % warning: shown sat in sat incomplete mode
% 9.84/10.04 %
% 9.84/10.04
% 9.84/10.04
% 9.84/10.04 ------ Building Model...Done
% 9.84/10.04
% 9.84/10.04 %------ The model is defined over ground terms (initial term algebra).
% 9.84/10.04 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 9.84/10.04 %------ where \phi is a formula over the term algebra.
% 9.84/10.04 %------ If we have equality in the problem then it is also defined as a predicate above,
% 9.84/10.04 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 9.84/10.04 %------ See help for --sat_out_model for different model outputs.
% 9.84/10.04 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 9.84/10.04 %------ where the first argument stands for the sort ($i in the unsorted case)
% 9.84/10.04
% 9.84/10.04
% 9.84/10.04
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of p2
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 (! [X0] :
% 9.84/10.04 ( p2(X0) <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of r1
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 (! [X0,X1] :
% 9.84/10.04 ( r1(X0,X1) <=>
% 9.84/10.04 (
% 9.84/10.04 (
% 9.84/10.04 ( X0=sk3_esk14_0 & X1=sk3_esk15_0 )
% 9.84/10.04 )
% 9.84/10.04
% 9.84/10.04 )
% 9.84/10.04 )
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of p3
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 (! [X0] :
% 9.84/10.04 ( p3(X0) <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of p1
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 (! [X0] :
% 9.84/10.04 ( p1(X0) <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP0_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP0_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP1_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP1_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP2_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP2_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP3_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP3_iProver_split <=>
% 9.84/10.04 $true
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP4_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP4_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP5_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP5_iProver_split <=>
% 9.84/10.04 $true
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP6_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP6_iProver_split <=>
% 9.84/10.04 $true
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP7_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP7_iProver_split <=>
% 9.84/10.04 $true
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP8_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP8_iProver_split <=>
% 9.84/10.04 $true
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP9_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP9_iProver_split <=>
% 9.84/10.04 $true
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP10_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP10_iProver_split <=>
% 9.84/10.04 $true
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP11_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP11_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP12_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP12_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP13_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP13_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP14_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP14_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP15_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP15_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP16_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP16_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP17_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP17_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP18_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP18_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP19_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP19_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP20_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP20_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP21_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP21_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP22_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP22_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP23_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP23_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP24_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP24_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP25_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP25_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04 %------ Positive definition of sP26_iProver_split
% 9.84/10.04 fof(lit_def,axiom,
% 9.84/10.04 ( sP26_iProver_split <=>
% 9.84/10.04 $false
% 9.84/10.04 )
% 9.84/10.04 ).
% 9.84/10.04
% 9.84/10.04
% 9.84/10.04
% 9.84/10.04 % ------ Statistics
% 9.84/10.04
% 9.84/10.04 % ------ General
% 9.84/10.04
% 9.84/10.04 % num_of_input_clauses: 562
% 9.84/10.04 % num_of_input_neg_conjectures: 306
% 9.84/10.04 % num_of_splits: 1152
% 9.84/10.04 % num_of_split_atoms: 27
% 9.84/10.04 % num_of_sem_filtered_clauses: 0
% 9.84/10.04 % num_of_subtypes: 0
% 9.84/10.04 % monotx_restored_types: 0
% 9.84/10.04 % sat_num_of_epr_types: 0
% 9.84/10.04 % sat_num_of_non_cyclic_types: 0
% 9.84/10.04 % sat_guarded_non_collapsed_types: 0
% 9.84/10.04 % is_epr: 0
% 9.84/10.04 % is_horn: 0
% 9.84/10.04 % has_eq: 0
% 9.84/10.04 % num_pure_diseq_elim: 0
% 9.84/10.04 % simp_replaced_by: 0
% 9.84/10.04 % res_preprocessed: 2020
% 9.84/10.04 % prep_upred: 0
% 9.84/10.04 % prep_unflattend: 0
% 9.84/10.04 % pred_elim_cands: 27
% 9.84/10.04 % pred_elim: 0
% 9.84/10.04 % pred_elim_cl: 0
% 9.84/10.04 % pred_elim_cycles: 27
% 9.84/10.04 % forced_gc_time: 0
% 9.84/10.04 % gc_basic_clause_elim: 0
% 9.84/10.04 % parsing_time: 0.058
% 9.84/10.04 % sem_filter_time: 0.
% 9.84/10.04 % pred_elim_time: 0.267
% 9.84/10.04 % out_proof_time: 0.
% 9.84/10.04 % monotx_time: 0.
% 9.84/10.04 % subtype_inf_time: 0.
% 9.84/10.04 % unif_index_cands_time: 0.008
% 9.84/10.04 % unif_index_add_time: 0.003
% 9.84/10.04 % total_time: 9.567
% 9.84/10.04 % num_of_symbols: 84
% 9.84/10.04 % num_of_terms: 6422
% 9.84/10.04
% 9.84/10.04 % ------ Propositional Solver
% 9.84/10.04
% 9.84/10.04 % prop_solver_calls: 3
% 9.84/10.04 % prop_fast_solver_calls: 19489
% 9.84/10.04 % prop_num_of_clauses: 1638
% 9.84/10.04 % prop_preprocess_simplified: 15051
% 9.84/10.04 % prop_fo_subsumed: 0
% 9.84/10.04 % prop_solver_time: 0.
% 9.84/10.04 % prop_fast_solver_time: 0.021
% 9.84/10.04 % prop_unsat_core_time: 0.
% 9.84/10.04
% 9.84/10.04 % ------ QBF
% 9.84/10.04
% 9.84/10.04 % qbf_q_res: 0
% 9.84/10.04 % qbf_num_tautologies: 0
% 9.84/10.04 % qbf_prep_cycles: 0
% 9.84/10.04
% 9.84/10.04 % ------ BMC1
% 9.84/10.04
% 9.84/10.04 % bmc1_current_bound: -1
% 9.84/10.04 % bmc1_last_solved_bound: -1
% 9.84/10.04 % bmc1_unsat_core_size: -1
% 9.84/10.04 % bmc1_unsat_core_parents_size: -1
% 9.84/10.04 % bmc1_merge_next_fun: 0
% 9.84/10.04 % bmc1_unsat_core_clauses_time: 0.
% 9.84/10.04
% 9.84/10.04 % ------ Instantiation
% 9.84/10.04
% 9.84/10.04 % inst_num_of_clauses: 593
% 9.84/10.04 % inst_num_in_passive: 0
% 9.84/10.04 % inst_num_in_active: 593
% 9.84/10.04 % inst_num_in_unprocessed: 0
% 9.84/10.04 % inst_num_of_loops: 629
% 9.84/10.04 % inst_num_of_learning_restarts: 0
% 9.84/10.04 % inst_num_moves_active_passive: 33
% 9.84/10.04 % inst_lit_activity: 279
% 9.84/10.04 % inst_lit_activity_moves: 0
% 9.84/10.04 % inst_num_tautologies: 0
% 9.84/10.04 % inst_num_prop_implied: 0
% 9.84/10.04 % inst_num_existing_simplified: 0
% 9.84/10.04 % inst_num_eq_res_simplified: 0
% 9.84/10.04 % inst_num_child_elim: 0
% 9.84/10.04 % inst_num_of_dismatching_blockings: 0
% 9.84/10.04 % inst_num_of_non_proper_insts: 4
% 9.84/10.04 % inst_num_of_duplicates: 0
% 9.84/10.04 % inst_inst_num_from_inst_to_res: 0
% 9.84/10.04 % inst_dismatching_checking_time: 0.
% 9.84/10.04
% 9.84/10.04 % ------ Resolution
% 9.84/10.04
% 9.84/10.04 % res_num_of_clauses: 76509
% 9.84/10.04 % res_num_in_passive: 76062
% 9.84/10.04 % res_num_in_active: 2134
% 9.84/10.04 % res_num_of_loops: 3000
% 9.84/10.04 % res_forward_subset_subsumed: 19076
% 9.84/10.04 % res_backward_subset_subsumed: 1810
% 9.84/10.04 % res_forward_subsumed: 762
% 9.84/10.04 % res_backward_subsumed: 64
% 9.84/10.04 % res_forward_subsumption_resolution: 1141
% 9.84/10.04 % res_backward_subsumption_resolution: 32
% 9.84/10.04 % res_clause_to_clause_subsumption: 27301
% 9.84/10.04 % res_orphan_elimination: 0
% 9.84/10.04 % res_tautology_del: 44825
% 9.84/10.04 % res_num_eq_res_simplified: 0
% 9.84/10.05 % res_num_sel_changes: 0
% 9.84/10.05 % res_moves_from_active_to_pass: 0
% 9.84/10.05
% 9.84/10.05 % Status Unknown
% 9.91/10.16 % Orienting using strategy ClausalAll
% 9.91/10.16 % FOF problem with conjecture
% 9.91/10.16 % 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_40aa0a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_6c0630.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_e88157 | grep -v "SZS"
% 9.91/10.17
% 9.91/10.17 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 9.91/10.17
% 9.91/10.17 %
% 9.91/10.17 % ------ iProver source info
% 9.91/10.17
% 9.91/10.17 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 9.91/10.17 % git: non_committed_changes: true
% 9.91/10.17 % git: last_make_outside_of_git: true
% 9.91/10.17
% 9.91/10.17 %
% 9.91/10.17 % ------ Input Options
% 9.91/10.17
% 9.91/10.17 % --out_options all
% 9.91/10.17 % --tptp_safe_out true
% 9.91/10.17 % --problem_path ""
% 9.91/10.17 % --include_path ""
% 9.91/10.17 % --clausifier .//eprover
% 9.91/10.17 % --clausifier_options --tstp-format
% 9.91/10.17 % --stdin false
% 9.91/10.17 % --dbg_backtrace false
% 9.91/10.17 % --dbg_dump_prop_clauses false
% 9.91/10.17 % --dbg_dump_prop_clauses_file -
% 9.91/10.17 % --dbg_out_stat false
% 9.91/10.17
% 9.91/10.17 % ------ General Options
% 9.91/10.17
% 9.91/10.17 % --fof false
% 9.91/10.17 % --time_out_real 150.
% 9.91/10.17 % --time_out_prep_mult 0.2
% 9.91/10.17 % --time_out_virtual -1.
% 9.91/10.17 % --schedule none
% 9.91/10.17 % --ground_splitting input
% 9.91/10.17 % --splitting_nvd 16
% 9.91/10.17 % --non_eq_to_eq false
% 9.91/10.17 % --prep_gs_sim true
% 9.91/10.17 % --prep_unflatten false
% 9.91/10.17 % --prep_res_sim true
% 9.91/10.17 % --prep_upred true
% 9.91/10.17 % --res_sim_input true
% 9.91/10.17 % --clause_weak_htbl true
% 9.91/10.17 % --gc_record_bc_elim false
% 9.91/10.17 % --symbol_type_check false
% 9.91/10.17 % --clausify_out false
% 9.91/10.17 % --large_theory_mode false
% 9.91/10.17 % --prep_sem_filter none
% 9.91/10.17 % --prep_sem_filter_out false
% 9.91/10.17 % --preprocessed_out false
% 9.91/10.17 % --sub_typing false
% 9.91/10.17 % --brand_transform false
% 9.91/10.17 % --pure_diseq_elim true
% 9.91/10.17 % --min_unsat_core false
% 9.91/10.17 % --pred_elim true
% 9.91/10.17 % --add_important_lit false
% 9.91/10.17 % --soft_assumptions false
% 9.91/10.17 % --reset_solvers false
% 9.91/10.17 % --bc_imp_inh []
% 9.91/10.17 % --conj_cone_tolerance 1.5
% 9.91/10.17 % --prolific_symb_bound 500
% 9.91/10.17 % --lt_threshold 2000
% 9.91/10.17
% 9.91/10.17 % ------ SAT Options
% 9.91/10.17
% 9.91/10.17 % --sat_mode false
% 9.91/10.17 % --sat_fm_restart_options ""
% 9.91/10.17 % --sat_gr_def false
% 9.91/10.17 % --sat_epr_types true
% 9.91/10.17 % --sat_non_cyclic_types false
% 9.91/10.17 % --sat_finite_models false
% 9.91/10.17 % --sat_fm_lemmas false
% 9.91/10.17 % --sat_fm_prep false
% 9.91/10.17 % --sat_fm_uc_incr true
% 9.91/10.17 % --sat_out_model small
% 9.91/10.17 % --sat_out_clauses false
% 9.91/10.17
% 9.91/10.17 % ------ QBF Options
% 9.91/10.17
% 9.91/10.17 % --qbf_mode false
% 9.91/10.17 % --qbf_elim_univ true
% 9.91/10.17 % --qbf_sk_in true
% 9.91/10.17 % --qbf_pred_elim true
% 9.91/10.17 % --qbf_split 32
% 9.91/10.17
% 9.91/10.17 % ------ BMC1 Options
% 9.91/10.17
% 9.91/10.17 % --bmc1_incremental false
% 9.91/10.17 % --bmc1_axioms reachable_all
% 9.91/10.17 % --bmc1_min_bound 0
% 9.91/10.17 % --bmc1_max_bound -1
% 9.91/10.17 % --bmc1_max_bound_default -1
% 9.91/10.17 % --bmc1_symbol_reachability true
% 9.91/10.17 % --bmc1_property_lemmas false
% 9.91/10.17 % --bmc1_k_induction false
% 9.91/10.17 % --bmc1_non_equiv_states false
% 9.91/10.17 % --bmc1_deadlock false
% 9.91/10.17 % --bmc1_ucm false
% 9.91/10.17 % --bmc1_add_unsat_core none
% 9.91/10.17 % --bmc1_unsat_core_children false
% 9.91/10.17 % --bmc1_unsat_core_extrapolate_axioms false
% 9.91/10.17 % --bmc1_out_stat full
% 9.91/10.17 % --bmc1_ground_init false
% 9.91/10.17 % --bmc1_pre_inst_next_state false
% 9.91/10.17 % --bmc1_pre_inst_state false
% 9.91/10.17 % --bmc1_pre_inst_reach_state false
% 9.91/10.17 % --bmc1_out_unsat_core false
% 9.91/10.17 % --bmc1_aig_witness_out false
% 9.91/10.17 % --bmc1_verbose false
% 9.91/10.17 % --bmc1_dump_clauses_tptp false
% 10.02/10.49 % --bmc1_dump_unsat_core_tptp false
% 10.02/10.49 % --bmc1_dump_file -
% 10.02/10.49 % --bmc1_ucm_expand_uc_limit 128
% 10.02/10.49 % --bmc1_ucm_n_expand_iterations 6
% 10.02/10.49 % --bmc1_ucm_extend_mode 1
% 10.02/10.49 % --bmc1_ucm_init_mode 2
% 10.02/10.49 % --bmc1_ucm_cone_mode none
% 10.02/10.49 % --bmc1_ucm_reduced_relation_type 0
% 10.02/10.49 % --bmc1_ucm_relax_model 4
% 10.02/10.49 % --bmc1_ucm_full_tr_after_sat true
% 10.02/10.49 % --bmc1_ucm_expand_neg_assumptions false
% 10.02/10.49 % --bmc1_ucm_layered_model none
% 10.02/10.49 % --bmc1_ucm_max_lemma_size 10
% 10.02/10.49
% 10.02/10.49 % ------ AIG Options
% 10.02/10.49
% 10.02/10.49 % --aig_mode false
% 10.02/10.49
% 10.02/10.49 % ------ Instantiation Options
% 10.02/10.49
% 10.02/10.49 % --instantiation_flag true
% 10.02/10.49 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 10.02/10.49 % --inst_solver_per_active 750
% 10.02/10.49 % --inst_solver_calls_frac 0.5
% 10.02/10.49 % --inst_passive_queue_type priority_queues
% 10.02/10.49 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 10.02/10.49 % --inst_passive_queues_freq [25;2]
% 10.02/10.49 % --inst_dismatching true
% 10.02/10.49 % --inst_eager_unprocessed_to_passive true
% 10.02/10.49 % --inst_prop_sim_given true
% 10.02/10.49 % --inst_prop_sim_new false
% 10.02/10.49 % --inst_orphan_elimination true
% 10.02/10.49 % --inst_learning_loop_flag true
% 10.02/10.49 % --inst_learning_start 3000
% 10.02/10.49 % --inst_learning_factor 2
% 10.02/10.49 % --inst_start_prop_sim_after_learn 3
% 10.02/10.49 % --inst_sel_renew solver
% 10.02/10.49 % --inst_lit_activity_flag true
% 10.02/10.49 % --inst_out_proof true
% 10.02/10.49
% 10.02/10.49 % ------ Resolution Options
% 10.02/10.49
% 10.02/10.49 % --resolution_flag true
% 10.02/10.49 % --res_lit_sel kbo_max
% 10.02/10.49 % --res_to_prop_solver none
% 10.02/10.49 % --res_prop_simpl_new false
% 10.02/10.49 % --res_prop_simpl_given false
% 10.02/10.49 % --res_passive_queue_type priority_queues
% 10.02/10.49 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 10.02/10.49 % --res_passive_queues_freq [15;5]
% 10.02/10.49 % --res_forward_subs full
% 10.02/10.49 % --res_backward_subs full
% 10.02/10.49 % --res_forward_subs_resolution true
% 10.02/10.49 % --res_backward_subs_resolution true
% 10.02/10.49 % --res_orphan_elimination false
% 10.02/10.49 % --res_time_limit 1000.
% 10.02/10.49 % --res_out_proof true
% 10.02/10.49 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_40aa0a.s
% 10.02/10.49 % --modulo true
% 10.02/10.49
% 10.02/10.49 % ------ Combination Options
% 10.02/10.49
% 10.02/10.49 % --comb_res_mult 1000
% 10.02/10.49 % --comb_inst_mult 300
% 10.02/10.49 % ------
% 10.02/10.49
% 10.02/10.49 % ------ Parsing...% successful
% 10.02/10.49
% 10.02/10.49 % ------ Preprocessing... gs_s sp: 1152 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 10.02/10.49
% 10.02/10.49 % ------ Proving...
% 10.02/10.49 % ------ Problem Properties
% 10.02/10.49
% 10.02/10.49 %
% 10.02/10.49 % EPR false
% 10.02/10.49 % Horn false
% 10.02/10.49 % Has equality false
% 10.02/10.49
% 10.02/10.49 % % ------ Input Options Time Limit: Unbounded
% 10.02/10.49
% 10.02/10.49
% 10.02/10.49 % % ------ Current options:
% 10.02/10.49
% 10.02/10.49 % ------ Input Options
% 10.02/10.49
% 10.02/10.49 % --out_options all
% 10.02/10.49 % --tptp_safe_out true
% 10.02/10.49 % --problem_path ""
% 10.02/10.49 % --include_path ""
% 10.02/10.49 % --clausifier .//eprover
% 10.02/10.49 % --clausifier_options --tstp-format
% 10.02/10.49 % --stdin false
% 10.02/10.49 % --dbg_backtrace false
% 10.02/10.49 % --dbg_dump_prop_clauses false
% 10.02/10.49 % --dbg_dump_prop_clauses_file -
% 10.02/10.49 % --dbg_out_stat false
% 10.02/10.49
% 10.02/10.49 % ------ General Options
% 10.02/10.49
% 10.02/10.49 % --fof false
% 10.02/10.49 % --time_out_real 150.
% 10.02/10.49 % --time_out_prep_mult 0.2
% 10.02/10.49 % --time_out_virtual -1.
% 10.02/10.49 % --schedule none
% 10.02/10.49 % --ground_splitting input
% 10.02/10.49 % --splitting_nvd 16
% 10.02/10.49 % --non_eq_to_eq false
% 10.02/10.49 % --prep_gs_sim true
% 10.02/10.49 % --prep_unflatten false
% 10.02/10.49 % --prep_res_sim true
% 10.02/10.49 % --prep_upred true
% 10.02/10.49 % --res_sim_input true
% 10.02/10.49 % --clause_weak_htbl true
% 10.02/10.49 % --gc_record_bc_elim false
% 10.02/10.49 % --symbol_type_check false
% 10.02/10.49 % --clausify_out false
% 10.02/10.49 % --large_theory_mode false
% 10.02/10.49 % --prep_sem_filter none
% 10.02/10.49 % --prep_sem_filter_out false
% 10.02/10.49 % --preprocessed_out false
% 10.02/10.49 % --sub_typing false
% 10.02/10.49 % --brand_transform false
% 10.02/10.49 % --pure_diseq_elim true
% 10.02/10.49 % --min_unsat_core false
% 10.02/10.49 % --pred_elim true
% 10.02/10.49 % --add_important_lit false
% 10.02/10.49 % --soft_assumptions false
% 10.02/10.49 % --reset_solvers false
% 10.02/10.49 % --bc_imp_inh []
% 10.02/10.49 % --conj_cone_tolerance 1.5
% 10.02/10.49 % --prolific_symb_bound 500
% 10.02/10.49 % --lt_threshold 2000
% 10.02/10.49
% 10.02/10.49 % ------ SAT Options
% 10.02/10.49
% 10.02/10.49 % --sat_mode false
% 10.02/10.49 % --sat_fm_restart_options ""
% 10.02/10.49 % --sat_gr_def false
% 10.02/10.49 % --sat_epr_types true
% 10.02/10.49 % --sat_non_cyclic_types false
% 10.02/10.49 % --sat_finite_models false
% 10.02/10.49 % --sat_fm_lemmas false
% 10.02/10.49 % --sat_fm_prep false
% 10.02/10.49 % --sat_fm_uc_incr true
% 10.02/10.49 % --sat_out_model small
% 10.02/10.49 % --sat_out_clauses false
% 10.02/10.49
% 10.02/10.49 % ------ QBF Options
% 10.02/10.49
% 10.02/10.49 % --qbf_mode false
% 10.02/10.49 % --qbf_elim_univ true
% 10.02/10.49 % --qbf_sk_in true
% 10.02/10.49 % --qbf_pred_elim true
% 10.02/10.49 % --qbf_split 32
% 10.02/10.49
% 10.02/10.49 % ------ BMC1 Options
% 10.02/10.49
% 10.02/10.49 % --bmc1_incremental false
% 10.02/10.49 % --bmc1_axioms reachable_all
% 10.02/10.49 % --bmc1_min_bound 0
% 10.02/10.49 % --bmc1_max_bound -1
% 10.02/10.49 % --bmc1_max_bound_default -1
% 10.02/10.49 % --bmc1_symbol_reachability true
% 10.02/10.49 % --bmc1_property_lemmas false
% 10.02/10.49 % --bmc1_k_induction false
% 10.02/10.49 % --bmc1_non_equiv_states false
% 10.02/10.49 % --bmc1_deadlock false
% 10.02/10.49 % --bmc1_ucm false
% 10.02/10.49 % --bmc1_add_unsat_core none
% 10.02/10.49 % --bmc1_unsat_core_children false
% 10.02/10.49 % --bmc1_unsat_core_extrapolate_axioms false
% 10.02/10.49 % --bmc1_out_stat full
% 10.02/10.49 % --bmc1_ground_init false
% 10.02/10.49 % --bmc1_pre_inst_next_state false
% 10.02/10.49 % --bmc1_pre_inst_state false
% 10.02/10.49 % --bmc1_pre_inst_reach_state false
% 10.02/10.49 % --bmc1_out_unsat_core false
% 10.02/10.49 % --bmc1_aig_witness_out false
% 10.02/10.49 % --bmc1_verbose false
% 10.02/10.49 % --bmc1_dump_clauses_tptp false
% 10.02/10.49 % --bmc1_dump_unsat_core_tptp false
% 10.02/10.49 % --bmc1_dump_file -
% 10.02/10.49 % --bmc1_ucm_expand_uc_limit 128
% 10.02/10.49 % --bmc1_ucm_n_expand_iterations 6
% 10.02/10.49 % --bmc1_ucm_extend_mode 1
% 10.02/10.49 % --bmc1_ucm_init_mode 2
% 10.02/10.49 % --bmc1_ucm_cone_mode none
% 10.02/10.49 % --bmc1_ucm_reduced_relation_type 0
% 10.02/10.49 % --bmc1_ucm_relax_model 4
% 10.02/10.49 % --bmc1_ucm_full_tr_after_sat true
% 10.02/10.49 % --bmc1_ucm_expand_neg_assumptions false
% 10.02/10.49 % --bmc1_ucm_layered_model none
% 10.02/10.49 % --bmc1_ucm_max_lemma_size 10
% 10.02/10.49
% 10.02/10.49 % ------ AIG Options
% 10.02/10.49
% 10.02/10.49 % --aig_mode false
% 10.02/10.49
% 10.02/10.49 % ------ Instantiation Options
% 10.02/10.49
% 10.02/10.49 % --instantiation_flag true
% 10.02/10.49 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 10.02/10.49 % --inst_solver_per_active 750
% 10.02/10.49 % --inst_solver_calls_frac 0.5
% 10.02/10.49 % --inst_passive_queue_type priority_queues
% 10.02/10.49 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 10.02/10.49 % --inst_passive_queues_freq [25;2]
% 10.02/10.49 % --inst_dismatching true
% 10.02/10.49 % --inst_eager_unprocessed_to_passive true
% 10.02/10.49 % --inst_prop_sim_given true
% 19.43/19.67 % --inst_prop_sim_new false
% 19.43/19.67 % --inst_orphan_elimination true
% 19.43/19.67 % --inst_learning_loop_flag true
% 19.43/19.67 % --inst_learning_start 3000
% 19.43/19.67 % --inst_learning_factor 2
% 19.43/19.67 % --inst_start_prop_sim_after_learn 3
% 19.43/19.67 % --inst_sel_renew solver
% 19.43/19.67 % --inst_lit_activity_flag true
% 19.43/19.67 % --inst_out_proof true
% 19.43/19.67
% 19.43/19.67 % ------ Resolution Options
% 19.43/19.67
% 19.43/19.67 % --resolution_flag true
% 19.43/19.67 % --res_lit_sel kbo_max
% 19.43/19.67 % --res_to_prop_solver none
% 19.43/19.67 % --res_prop_simpl_new false
% 19.43/19.67 % --res_prop_simpl_given false
% 19.43/19.67 % --res_passive_queue_type priority_queues
% 19.43/19.67 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 19.43/19.67 % --res_passive_queues_freq [15;5]
% 19.43/19.67 % --res_forward_subs full
% 19.43/19.67 % --res_backward_subs full
% 19.43/19.67 % --res_forward_subs_resolution true
% 19.43/19.67 % --res_backward_subs_resolution true
% 19.43/19.67 % --res_orphan_elimination false
% 19.43/19.67 % --res_time_limit 1000.
% 19.43/19.67 % --res_out_proof true
% 19.43/19.67 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_40aa0a.s
% 19.43/19.67 % --modulo true
% 19.43/19.67
% 19.43/19.67 % ------ Combination Options
% 19.43/19.67
% 19.43/19.67 % --comb_res_mult 1000
% 19.43/19.67 % --comb_inst_mult 300
% 19.43/19.67 % ------
% 19.43/19.67
% 19.43/19.67
% 19.43/19.67
% 19.43/19.67 % ------ Proving...
% 19.43/19.67 % warning: shown sat in sat incomplete mode
% 19.43/19.67 %
% 19.43/19.67
% 19.43/19.67
% 19.43/19.67 ------ Building Model...Done
% 19.43/19.67
% 19.43/19.67 %------ The model is defined over ground terms (initial term algebra).
% 19.43/19.67 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 19.43/19.67 %------ where \phi is a formula over the term algebra.
% 19.43/19.67 %------ If we have equality in the problem then it is also defined as a predicate above,
% 19.43/19.67 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 19.43/19.67 %------ See help for --sat_out_model for different model outputs.
% 19.43/19.67 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 19.43/19.67 %------ where the first argument stands for the sort ($i in the unsorted case)
% 19.43/19.67
% 19.43/19.67
% 19.43/19.67
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of p2
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 (! [X0] :
% 19.43/19.67 ( p2(X0) <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of r1
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 (! [X0,X1] :
% 19.43/19.67 ( r1(X0,X1) <=>
% 19.43/19.67 (
% 19.43/19.67 (
% 19.43/19.67 ( X0=sk2_esk14_0 & X1=sk2_esk15_0 )
% 19.43/19.67 )
% 19.43/19.67
% 19.43/19.67 )
% 19.43/19.67 )
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of p3
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 (! [X0] :
% 19.43/19.67 ( p3(X0) <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of p1
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 (! [X0] :
% 19.43/19.67 ( p1(X0) <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP0_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP0_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP1_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP1_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP2_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP2_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP3_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP3_iProver_split <=>
% 19.43/19.67 $true
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP4_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP4_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP5_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP5_iProver_split <=>
% 19.43/19.67 $true
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP6_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP6_iProver_split <=>
% 19.43/19.67 $true
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP7_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP7_iProver_split <=>
% 19.43/19.67 $true
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP8_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP8_iProver_split <=>
% 19.43/19.67 $true
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP9_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP9_iProver_split <=>
% 19.43/19.67 $true
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP10_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP10_iProver_split <=>
% 19.43/19.67 $true
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP11_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP11_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP12_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP12_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP13_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP13_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP14_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP14_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP15_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP15_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP16_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP16_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP17_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP17_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP18_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP18_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP19_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP19_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP20_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP20_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP21_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP21_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP22_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP22_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP23_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP23_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP24_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP24_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP25_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP25_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67 %------ Positive definition of sP26_iProver_split
% 19.43/19.67 fof(lit_def,axiom,
% 19.43/19.67 ( sP26_iProver_split <=>
% 19.43/19.67 $false
% 19.43/19.67 )
% 19.43/19.67 ).
% 19.43/19.67
% 19.43/19.67
% 19.43/19.67
% 19.43/19.67 % ------ Statistics
% 19.43/19.67
% 19.43/19.67 % ------ General
% 19.43/19.67
% 19.43/19.67 % num_of_input_clauses: 562
% 19.43/19.67 % num_of_input_neg_conjectures: 306
% 19.43/19.67 % num_of_splits: 1152
% 19.43/19.67 % num_of_split_atoms: 27
% 19.43/19.67 % num_of_sem_filtered_clauses: 0
% 19.43/19.67 % num_of_subtypes: 0
% 19.43/19.67 % monotx_restored_types: 0
% 19.43/19.67 % sat_num_of_epr_types: 0
% 19.43/19.67 % sat_num_of_non_cyclic_types: 0
% 19.43/19.67 % sat_guarded_non_collapsed_types: 0
% 19.43/19.67 % is_epr: 0
% 19.43/19.67 % is_horn: 0
% 19.43/19.67 % has_eq: 0
% 19.43/19.67 % num_pure_diseq_elim: 0
% 19.43/19.67 % simp_replaced_by: 0
% 19.43/19.67 % res_preprocessed: 2020
% 19.43/19.67 % prep_upred: 0
% 19.43/19.67 % prep_unflattend: 0
% 19.43/19.67 % pred_elim_cands: 27
% 19.43/19.67 % pred_elim: 0
% 19.43/19.67 % pred_elim_cl: 0
% 19.43/19.67 % pred_elim_cycles: 27
% 19.43/19.67 % forced_gc_time: 0
% 19.43/19.67 % gc_basic_clause_elim: 0
% 19.43/19.67 % parsing_time: 0.027
% 19.43/19.67 % sem_filter_time: 0.
% 19.43/19.67 % pred_elim_time: 0.206
% 19.43/19.67 % out_proof_time: 0.
% 19.43/19.67 % monotx_time: 0.
% 19.43/19.67 % subtype_inf_time: 0.
% 19.43/19.67 % unif_index_cands_time: 0.008
% 19.43/19.67 % unif_index_add_time: 0.003
% 19.43/19.67 % total_time: 9.506
% 19.43/19.67 % num_of_symbols: 84
% 19.43/19.67 % num_of_terms: 6422
% 19.43/19.67
% 19.43/19.67 % ------ Propositional Solver
% 19.43/19.67
% 19.43/19.67 % prop_solver_calls: 3
% 19.43/19.67 % prop_fast_solver_calls: 19489
% 19.43/19.67 % prop_num_of_clauses: 1638
% 19.43/19.67 % prop_preprocess_simplified: 15051
% 19.43/19.67 % prop_fo_subsumed: 0
% 19.43/19.67 % prop_solver_time: 0.
% 19.43/19.67 % prop_fast_solver_time: 0.015
% 19.43/19.67 % prop_unsat_core_time: 0.
% 19.43/19.67
% 19.43/19.67 % ------ QBF
% 19.43/19.67
% 19.43/19.67 % qbf_q_res: 0
% 19.43/19.67 % qbf_num_tautologies: 0
% 19.43/19.67 % qbf_prep_cycles: 0
% 19.43/19.67
% 19.43/19.67 % ------ BMC1
% 19.43/19.67
% 19.43/19.67 % bmc1_current_bound: -1
% 19.43/19.67 % bmc1_last_solved_bound: -1
% 19.43/19.67 % bmc1_unsat_core_size: -1
% 19.43/19.67 % bmc1_unsat_core_parents_size: -1
% 19.43/19.67 % bmc1_merge_next_fun: 0
% 19.43/19.67 % bmc1_unsat_core_clauses_time: 0.
% 19.43/19.67
% 19.43/19.67 % ------ Instantiation
% 19.43/19.67
% 19.43/19.67 % inst_num_of_clauses: 593
% 19.43/19.67 % inst_num_in_passive: 0
% 19.43/19.67 % inst_num_in_active: 593
% 19.43/19.67 % inst_num_in_unprocessed: 0
% 19.43/19.67 % inst_num_of_loops: 629
% 19.43/19.67 % inst_num_of_learning_restarts: 0
% 19.43/19.67 % inst_num_moves_active_passive: 33
% 19.43/19.67 % inst_lit_activity: 279
% 19.43/19.67 % inst_lit_activity_moves: 0
% 19.43/19.67 % inst_num_tautologies: 0
% 19.43/19.67 % inst_num_prop_implied: 0
% 19.43/19.67 % inst_num_existing_simplified: 0
% 19.43/19.67 % inst_num_eq_res_simplified: 0
% 19.43/19.67 % inst_num_child_elim: 0
% 19.43/19.67 % inst_num_of_dismatching_blockings: 0
% 19.43/19.67 % inst_num_of_non_proper_insts: 4
% 19.43/19.67 % inst_num_of_duplicates: 0
% 19.43/19.67 % inst_inst_num_from_inst_to_res: 0
% 19.43/19.67 % inst_dismatching_checking_time: 0.
% 19.43/19.67
% 19.43/19.67 % ------ Resolution
% 19.43/19.67
% 19.43/19.67 % res_num_of_clauses: 76509
% 19.43/19.67 % res_num_in_passive: 76062
% 19.43/19.67 % res_num_in_active: 2134
% 19.43/19.67 % res_num_of_loops: 3000
% 19.43/19.67 % res_forward_subset_subsumed: 19076
% 19.43/19.67 % res_backward_subset_subsumed: 1810
% 19.43/19.67 % res_forward_subsumed: 762
% 19.43/19.67 % res_backward_subsumed: 64
% 19.43/19.67 % res_forward_subsumption_resolution: 1141
% 19.43/19.67 % res_backward_subsumption_resolution: 32
% 19.43/19.67 % res_clause_to_clause_subsumption: 27301
% 19.43/19.67 % res_orphan_elimination: 0
% 19.43/19.67 % res_tautology_del: 44825
% 19.43/19.67 % res_num_eq_res_simplified: 0
% 19.43/19.67 % res_num_sel_changes: 0
% 19.43/19.67 % res_moves_from_active_to_pass: 0
% 19.43/19.67
% 19.43/19.67 % Status Unknown
% 19.43/19.67 % Last status :
% 19.43/19.67 % SZS status Unknown
%------------------------------------------------------------------------------