TSTP Solution File: SYN521+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN521+1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n010.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 : Thu Jul 21 07:29:18 EDT 2022
% Result : Unknown 1.07s 1.25s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN521+1 : TPTP v8.1.0. Released v2.1.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 11 15:01:00 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Running in mono-core mode
% 0.21/0.43 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.43 % FOF problem with conjecture
% 0.21/0.43 % 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/sandbox/tmp/iprover_proof_5dca67.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_bcc896.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_c167b0 | grep -v "SZS"
% 0.21/0.45
% 0.21/0.45 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.45
% 0.21/0.45 %
% 0.21/0.45 % ------ iProver source info
% 0.21/0.45
% 0.21/0.45 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.45 % git: non_committed_changes: true
% 0.21/0.45 % git: last_make_outside_of_git: true
% 0.21/0.45
% 0.21/0.45 %
% 0.21/0.45 % ------ Input Options
% 0.21/0.45
% 0.21/0.45 % --out_options all
% 0.21/0.45 % --tptp_safe_out true
% 0.21/0.45 % --problem_path ""
% 0.21/0.45 % --include_path ""
% 0.21/0.45 % --clausifier .//eprover
% 0.21/0.45 % --clausifier_options --tstp-format
% 0.21/0.45 % --stdin false
% 0.21/0.45 % --dbg_backtrace false
% 0.21/0.45 % --dbg_dump_prop_clauses false
% 0.21/0.45 % --dbg_dump_prop_clauses_file -
% 0.21/0.45 % --dbg_out_stat false
% 0.21/0.45
% 0.21/0.45 % ------ General Options
% 0.21/0.45
% 0.21/0.45 % --fof false
% 0.21/0.45 % --time_out_real 150.
% 0.21/0.45 % --time_out_prep_mult 0.2
% 0.21/0.45 % --time_out_virtual -1.
% 0.21/0.45 % --schedule none
% 0.21/0.45 % --ground_splitting input
% 0.21/0.45 % --splitting_nvd 16
% 0.21/0.45 % --non_eq_to_eq false
% 0.21/0.45 % --prep_gs_sim true
% 0.21/0.45 % --prep_unflatten false
% 0.21/0.45 % --prep_res_sim true
% 0.21/0.45 % --prep_upred true
% 0.21/0.45 % --res_sim_input true
% 0.21/0.45 % --clause_weak_htbl true
% 0.21/0.45 % --gc_record_bc_elim false
% 0.21/0.45 % --symbol_type_check false
% 0.21/0.45 % --clausify_out false
% 0.21/0.45 % --large_theory_mode false
% 0.21/0.45 % --prep_sem_filter none
% 0.21/0.45 % --prep_sem_filter_out false
% 0.21/0.45 % --preprocessed_out false
% 0.21/0.45 % --sub_typing false
% 0.21/0.45 % --brand_transform false
% 0.21/0.45 % --pure_diseq_elim true
% 0.21/0.45 % --min_unsat_core false
% 0.21/0.45 % --pred_elim true
% 0.21/0.45 % --add_important_lit false
% 0.21/0.45 % --soft_assumptions false
% 0.21/0.45 % --reset_solvers false
% 0.21/0.45 % --bc_imp_inh []
% 0.21/0.45 % --conj_cone_tolerance 1.5
% 0.21/0.45 % --prolific_symb_bound 500
% 0.21/0.45 % --lt_threshold 2000
% 0.21/0.45
% 0.21/0.45 % ------ SAT Options
% 0.21/0.45
% 0.21/0.45 % --sat_mode false
% 0.21/0.45 % --sat_fm_restart_options ""
% 0.21/0.45 % --sat_gr_def false
% 0.21/0.45 % --sat_epr_types true
% 0.21/0.45 % --sat_non_cyclic_types false
% 0.21/0.45 % --sat_finite_models false
% 0.21/0.45 % --sat_fm_lemmas false
% 0.21/0.45 % --sat_fm_prep false
% 0.21/0.45 % --sat_fm_uc_incr true
% 0.21/0.45 % --sat_out_model small
% 0.21/0.45 % --sat_out_clauses false
% 0.21/0.45
% 0.21/0.45 % ------ QBF Options
% 0.21/0.45
% 0.21/0.45 % --qbf_mode false
% 0.21/0.45 % --qbf_elim_univ true
% 0.21/0.45 % --qbf_sk_in true
% 0.21/0.45 % --qbf_pred_elim true
% 0.21/0.45 % --qbf_split 32
% 0.21/0.45
% 0.21/0.45 % ------ BMC1 Options
% 0.21/0.46
% 0.21/0.46 % --bmc1_incremental false
% 0.21/0.46 % --bmc1_axioms reachable_all
% 0.21/0.46 % --bmc1_min_bound 0
% 0.21/0.46 % --bmc1_max_bound -1
% 0.21/0.46 % --bmc1_max_bound_default -1
% 0.21/0.46 % --bmc1_symbol_reachability true
% 0.21/0.46 % --bmc1_property_lemmas false
% 0.21/0.46 % --bmc1_k_induction false
% 0.21/0.46 % --bmc1_non_equiv_states false
% 0.21/0.46 % --bmc1_deadlock false
% 0.21/0.46 % --bmc1_ucm false
% 0.21/0.46 % --bmc1_add_unsat_core none
% 0.21/0.46 % --bmc1_unsat_core_children false
% 0.21/0.46 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.46 % --bmc1_out_stat full
% 0.21/0.46 % --bmc1_ground_init false
% 0.21/0.46 % --bmc1_pre_inst_next_state false
% 0.21/0.46 % --bmc1_pre_inst_state false
% 0.21/0.46 % --bmc1_pre_inst_reach_state false
% 0.21/0.46 % --bmc1_out_unsat_core false
% 0.21/0.46 % --bmc1_aig_witness_out false
% 0.21/0.46 % --bmc1_verbose false
% 0.21/0.46 % --bmc1_dump_clauses_tptp false
% 0.21/0.54 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.54 % --bmc1_dump_file -
% 0.21/0.54 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.54 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.54 % --bmc1_ucm_extend_mode 1
% 0.21/0.54 % --bmc1_ucm_init_mode 2
% 0.21/0.54 % --bmc1_ucm_cone_mode none
% 0.21/0.54 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.54 % --bmc1_ucm_relax_model 4
% 0.21/0.54 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.54 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.54 % --bmc1_ucm_layered_model none
% 0.21/0.54 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.54
% 0.21/0.54 % ------ AIG Options
% 0.21/0.54
% 0.21/0.54 % --aig_mode false
% 0.21/0.54
% 0.21/0.54 % ------ Instantiation Options
% 0.21/0.54
% 0.21/0.54 % --instantiation_flag true
% 0.21/0.54 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.54 % --inst_solver_per_active 750
% 0.21/0.54 % --inst_solver_calls_frac 0.5
% 0.21/0.54 % --inst_passive_queue_type priority_queues
% 0.21/0.54 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.54 % --inst_passive_queues_freq [25;2]
% 0.21/0.54 % --inst_dismatching true
% 0.21/0.54 % --inst_eager_unprocessed_to_passive true
% 0.21/0.54 % --inst_prop_sim_given true
% 0.21/0.54 % --inst_prop_sim_new false
% 0.21/0.54 % --inst_orphan_elimination true
% 0.21/0.54 % --inst_learning_loop_flag true
% 0.21/0.54 % --inst_learning_start 3000
% 0.21/0.54 % --inst_learning_factor 2
% 0.21/0.54 % --inst_start_prop_sim_after_learn 3
% 0.21/0.54 % --inst_sel_renew solver
% 0.21/0.54 % --inst_lit_activity_flag true
% 0.21/0.54 % --inst_out_proof true
% 0.21/0.54
% 0.21/0.54 % ------ Resolution Options
% 0.21/0.54
% 0.21/0.54 % --resolution_flag true
% 0.21/0.54 % --res_lit_sel kbo_max
% 0.21/0.54 % --res_to_prop_solver none
% 0.21/0.54 % --res_prop_simpl_new false
% 0.21/0.54 % --res_prop_simpl_given false
% 0.21/0.54 % --res_passive_queue_type priority_queues
% 0.21/0.54 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.54 % --res_passive_queues_freq [15;5]
% 0.21/0.54 % --res_forward_subs full
% 0.21/0.54 % --res_backward_subs full
% 0.21/0.54 % --res_forward_subs_resolution true
% 0.21/0.54 % --res_backward_subs_resolution true
% 0.21/0.54 % --res_orphan_elimination false
% 0.21/0.54 % --res_time_limit 1000.
% 0.21/0.54 % --res_out_proof true
% 0.21/0.54 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5dca67.s
% 0.21/0.54 % --modulo true
% 0.21/0.54
% 0.21/0.54 % ------ Combination Options
% 0.21/0.54
% 0.21/0.54 % --comb_res_mult 1000
% 0.21/0.54 % --comb_inst_mult 300
% 0.21/0.54 % ------
% 0.21/0.54
% 0.21/0.54 % ------ Parsing...% successful
% 0.21/0.54
% 0.21/0.54 % ------ Preprocessing... gs_s sp: 156 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.21/0.54
% 0.21/0.54 % ------ Proving...
% 0.21/0.54 % ------ Problem Properties
% 0.21/0.54
% 0.21/0.54 %
% 0.21/0.54 % EPR true
% 0.21/0.54 % Horn false
% 0.21/0.54 % Has equality false
% 0.21/0.54
% 0.21/0.54 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.54
% 0.21/0.54
% 0.21/0.54 % % ------ Current options:
% 0.21/0.54
% 0.21/0.54 % ------ Input Options
% 0.21/0.54
% 0.21/0.54 % --out_options all
% 0.21/0.54 % --tptp_safe_out true
% 0.21/0.54 % --problem_path ""
% 0.21/0.54 % --include_path ""
% 0.21/0.54 % --clausifier .//eprover
% 0.21/0.54 % --clausifier_options --tstp-format
% 0.21/0.54 % --stdin false
% 0.21/0.54 % --dbg_backtrace false
% 0.21/0.54 % --dbg_dump_prop_clauses false
% 0.21/0.54 % --dbg_dump_prop_clauses_file -
% 0.21/0.54 % --dbg_out_stat false
% 0.21/0.54
% 0.21/0.54 % ------ General Options
% 0.21/0.54
% 0.21/0.54 % --fof false
% 0.21/0.54 % --time_out_real 150.
% 0.21/0.54 % --time_out_prep_mult 0.2
% 0.21/0.54 % --time_out_virtual -1.
% 0.21/0.54 % --schedule none
% 0.21/0.54 % --ground_splitting input
% 0.21/0.54 % --splitting_nvd 16
% 0.21/0.54 % --non_eq_to_eq false
% 0.21/0.54 % --prep_gs_sim true
% 0.21/0.54 % --prep_unflatten false
% 0.21/0.54 % --prep_res_sim true
% 0.21/0.54 % --prep_upred true
% 0.21/0.54 % --res_sim_input true
% 0.21/0.54 % --clause_weak_htbl true
% 0.21/0.54 % --gc_record_bc_elim false
% 0.21/0.54 % --symbol_type_check false
% 0.21/0.54 % --clausify_out false
% 0.21/0.54 % --large_theory_mode false
% 0.21/0.54 % --prep_sem_filter none
% 0.21/0.54 % --prep_sem_filter_out false
% 0.21/0.54 % --preprocessed_out false
% 0.21/0.54 % --sub_typing false
% 0.21/0.54 % --brand_transform false
% 0.21/0.54 % --pure_diseq_elim true
% 0.21/0.54 % --min_unsat_core false
% 0.21/0.54 % --pred_elim true
% 0.21/0.54 % --add_important_lit false
% 0.21/0.54 % --soft_assumptions false
% 0.21/0.54 % --reset_solvers false
% 0.21/0.54 % --bc_imp_inh []
% 0.21/0.54 % --conj_cone_tolerance 1.5
% 0.21/0.54 % --prolific_symb_bound 500
% 0.21/0.54 % --lt_threshold 2000
% 0.21/0.54
% 0.21/0.54 % ------ SAT Options
% 0.21/0.54
% 0.21/0.54 % --sat_mode false
% 0.21/0.54 % --sat_fm_restart_options ""
% 0.21/0.54 % --sat_gr_def false
% 0.21/0.54 % --sat_epr_types true
% 0.21/0.54 % --sat_non_cyclic_types false
% 0.21/0.54 % --sat_finite_models false
% 0.21/0.54 % --sat_fm_lemmas false
% 0.21/0.54 % --sat_fm_prep false
% 0.21/0.54 % --sat_fm_uc_incr true
% 0.21/0.54 % --sat_out_model small
% 0.21/0.54 % --sat_out_clauses false
% 0.21/0.54
% 0.21/0.54 % ------ QBF Options
% 0.21/0.54
% 0.21/0.54 % --qbf_mode false
% 0.21/0.54 % --qbf_elim_univ true
% 0.21/0.54 % --qbf_sk_in true
% 0.21/0.54 % --qbf_pred_elim true
% 0.21/0.54 % --qbf_split 32
% 0.21/0.54
% 0.21/0.54 % ------ BMC1 Options
% 0.21/0.54
% 0.21/0.54 % --bmc1_incremental false
% 0.21/0.54 % --bmc1_axioms reachable_all
% 0.21/0.54 % --bmc1_min_bound 0
% 0.21/0.54 % --bmc1_max_bound -1
% 0.21/0.54 % --bmc1_max_bound_default -1
% 0.21/0.54 % --bmc1_symbol_reachability true
% 0.21/0.54 % --bmc1_property_lemmas false
% 0.21/0.54 % --bmc1_k_induction false
% 0.21/0.54 % --bmc1_non_equiv_states false
% 0.21/0.54 % --bmc1_deadlock false
% 0.21/0.54 % --bmc1_ucm false
% 0.21/0.54 % --bmc1_add_unsat_core none
% 0.21/0.54 % --bmc1_unsat_core_children false
% 0.21/0.54 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.54 % --bmc1_out_stat full
% 0.21/0.54 % --bmc1_ground_init false
% 0.21/0.54 % --bmc1_pre_inst_next_state false
% 0.21/0.54 % --bmc1_pre_inst_state false
% 0.21/0.54 % --bmc1_pre_inst_reach_state false
% 0.21/0.54 % --bmc1_out_unsat_core false
% 0.21/0.54 % --bmc1_aig_witness_out false
% 0.21/0.54 % --bmc1_verbose false
% 0.21/0.54 % --bmc1_dump_clauses_tptp false
% 0.21/0.54 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.54 % --bmc1_dump_file -
% 0.21/0.54 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.54 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.54 % --bmc1_ucm_extend_mode 1
% 0.21/0.54 % --bmc1_ucm_init_mode 2
% 0.21/0.54 % --bmc1_ucm_cone_mode none
% 0.21/0.54 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.54 % --bmc1_ucm_relax_model 4
% 0.21/0.54 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.54 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.54 % --bmc1_ucm_layered_model none
% 0.21/0.54 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.54
% 0.21/0.54 % ------ AIG Options
% 0.21/0.54
% 0.21/0.54 % --aig_mode false
% 0.21/0.54
% 0.21/0.54 % ------ Instantiation Options
% 0.21/0.54
% 0.21/0.54 % --instantiation_flag true
% 0.21/0.54 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.54 % --inst_solver_per_active 750
% 0.21/0.54 % --inst_solver_calls_frac 0.5
% 0.21/0.54 % --inst_passive_queue_type priority_queues
% 0.21/0.54 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.54 % --inst_passive_queues_freq [25;2]
% 0.21/0.54 % --inst_dismatching true
% 0.21/0.54 % --inst_eager_unprocessed_to_passive true
% 0.70/0.88 % --inst_prop_sim_given true
% 0.70/0.88 % --inst_prop_sim_new false
% 0.70/0.88 % --inst_orphan_elimination true
% 0.70/0.88 % --inst_learning_loop_flag true
% 0.70/0.88 % --inst_learning_start 3000
% 0.70/0.88 % --inst_learning_factor 2
% 0.70/0.88 % --inst_start_prop_sim_after_learn 3
% 0.70/0.88 % --inst_sel_renew solver
% 0.70/0.88 % --inst_lit_activity_flag true
% 0.70/0.88 % --inst_out_proof true
% 0.70/0.88
% 0.70/0.88 % ------ Resolution Options
% 0.70/0.88
% 0.70/0.88 % --resolution_flag true
% 0.70/0.88 % --res_lit_sel kbo_max
% 0.70/0.88 % --res_to_prop_solver none
% 0.70/0.88 % --res_prop_simpl_new false
% 0.70/0.88 % --res_prop_simpl_given false
% 0.70/0.88 % --res_passive_queue_type priority_queues
% 0.70/0.88 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.70/0.88 % --res_passive_queues_freq [15;5]
% 0.70/0.88 % --res_forward_subs full
% 0.70/0.88 % --res_backward_subs full
% 0.70/0.88 % --res_forward_subs_resolution true
% 0.70/0.88 % --res_backward_subs_resolution true
% 0.70/0.88 % --res_orphan_elimination false
% 0.70/0.88 % --res_time_limit 1000.
% 0.70/0.88 % --res_out_proof true
% 0.70/0.88 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5dca67.s
% 0.70/0.88 % --modulo true
% 0.70/0.88
% 0.70/0.88 % ------ Combination Options
% 0.70/0.88
% 0.70/0.88 % --comb_res_mult 1000
% 0.70/0.88 % --comb_inst_mult 300
% 0.70/0.88 % ------
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88 % ------ Proving...
% 0.70/0.88 % warning: shown sat in sat incomplete mode
% 0.70/0.88 %
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88 ------ Building Model...Done
% 0.70/0.88
% 0.70/0.88 %------ The model is defined over ground terms (initial term algebra).
% 0.70/0.88 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 0.70/0.88 %------ where \phi is a formula over the term algebra.
% 0.70/0.88 %------ If we have equality in the problem then it is also defined as a predicate above,
% 0.70/0.88 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 0.70/0.88 %------ See help for --sat_out_model for different model outputs.
% 0.70/0.88 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 0.70/0.88 %------ where the first argument stands for the sort ($i in the unsorted case)
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of c3_0
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( c3_0 <=>
% 0.70/0.88 $true
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of c5_2
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 (! [X0,X1] :
% 0.70/0.88 ( c5_2(X0,X1) <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of c1_2
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 (! [X0,X1] :
% 0.70/0.88 ( c1_2(X0,X1) <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Negative definition of ndr1_1
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 (! [X0] :
% 0.70/0.88 ( ~(ndr1_1(X0)) <=>
% 0.70/0.88 (
% 0.70/0.88 (
% 0.70/0.88 ( X0=a100 )
% 0.70/0.88 )
% 0.70/0.88
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of c2_2
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 (! [X0,X1] :
% 0.70/0.88 ( c2_2(X0,X1) <=>
% 0.70/0.88 (
% 0.70/0.88 (
% 0.70/0.88 ( X0=a93 & X1=a94 )
% 0.70/0.88 )
% 0.70/0.88
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of epred3_0
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( epred3_0 <=>
% 0.70/0.88 $true
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of c4_2
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 (! [X0,X1] :
% 0.70/0.88 ( c4_2(X0,X1) <=>
% 0.70/0.88 (
% 0.70/0.88 (
% 0.70/0.88 ( X0=a82 & X1=a83 )
% 0.70/0.88 )
% 0.70/0.88
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of epred1_0
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( epred1_0 <=>
% 0.70/0.88 $true
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Negative definition of c4_1
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 (! [X0] :
% 0.70/0.88 ( ~(c4_1(X0)) <=>
% 0.70/0.88 (
% 0.70/0.88 (
% 0.70/0.88 ( X0=a90 )
% 0.70/0.88 )
% 0.70/0.88
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of ndr1_0
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( ndr1_0 <=>
% 0.70/0.88 $true
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of c3_1
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 (! [X0] :
% 0.70/0.88 ( c3_1(X0) <=>
% 0.70/0.88 (
% 0.70/0.88 (
% 0.70/0.88 ( X0=a93 )
% 0.70/0.88 )
% 0.70/0.88
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of c2_1
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 (! [X0] :
% 0.70/0.88 ( c2_1(X0) <=>
% 0.70/0.88 (
% 0.70/0.88 (
% 0.70/0.88 ( X0=a100 )
% 0.70/0.88 )
% 0.70/0.88
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of c5_0
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( c5_0 <=>
% 0.70/0.88 $true
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of c2_0
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( c2_0 <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of c4_0
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( c4_0 <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Negative definition of c1_1
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 (! [X0] :
% 0.70/0.88 ( ~(c1_1(X0)) <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of epred2_0
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( epred2_0 <=>
% 0.70/0.88 $true
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of c1_0
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( c1_0 <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP1_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP1_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP2_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP2_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP4_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP4_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP5_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP5_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP6_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP6_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP7_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP7_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP8_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP8_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP12_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP12_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP13_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP13_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP14_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP14_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP21_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP21_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP22_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP22_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP23_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP23_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP24_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP24_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP25_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP25_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88 %------ Positive definition of sP26_iProver_split
% 0.70/0.88 fof(lit_def,axiom,
% 0.70/0.88 ( sP26_iProver_split <=>
% 0.70/0.88 $false
% 0.70/0.88 )
% 0.70/0.88 ).
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88 % ------ Statistics
% 0.70/0.88
% 0.70/0.88 % ------ General
% 0.70/0.88
% 0.70/0.88 % num_of_input_clauses: 221
% 0.70/0.88 % num_of_input_neg_conjectures: 95
% 0.70/0.88 % num_of_splits: 156
% 0.70/0.88 % num_of_split_atoms: 27
% 0.70/0.88 % num_of_sem_filtered_clauses: 0
% 0.70/0.88 % num_of_subtypes: 0
% 0.70/0.88 % monotx_restored_types: 0
% 0.70/0.88 % sat_num_of_epr_types: 0
% 0.70/0.88 % sat_num_of_non_cyclic_types: 0
% 0.70/0.88 % sat_guarded_non_collapsed_types: 0
% 0.70/0.88 % is_epr: 1
% 0.70/0.88 % is_horn: 0
% 0.70/0.88 % has_eq: 0
% 0.70/0.88 % num_pure_diseq_elim: 0
% 0.70/0.88 % simp_replaced_by: 0
% 0.70/0.88 % res_preprocessed: 418
% 0.70/0.88 % prep_upred: 0
% 0.70/0.88 % prep_unflattend: 0
% 0.70/0.88 % pred_elim_cands: 27
% 0.70/0.88 % pred_elim: 11
% 0.70/0.88 % pred_elim_cl: 31
% 0.70/0.88 % pred_elim_cycles: 27
% 0.70/0.88 % forced_gc_time: 0
% 0.70/0.88 % gc_basic_clause_elim: 0
% 0.70/0.88 % parsing_time: 0.008
% 0.70/0.88 % sem_filter_time: 0.
% 0.70/0.88 % pred_elim_time: 0.041
% 0.70/0.88 % out_proof_time: 0.
% 0.70/0.88 % monotx_time: 0.
% 0.70/0.88 % subtype_inf_time: 0.
% 0.70/0.88 % unif_index_cands_time: 0.
% 0.70/0.88 % unif_index_add_time: 0.
% 0.70/0.88 % total_time: 0.443
% 0.70/0.88 % num_of_symbols: 106
% 0.70/0.88 % num_of_terms: 586
% 0.70/0.88
% 0.70/0.88 % ------ Propositional Solver
% 0.70/0.88
% 0.70/0.88 % prop_solver_calls: 2
% 0.70/0.88 % prop_fast_solver_calls: 2917
% 0.70/0.88 % prop_num_of_clauses: 513
% 0.70/0.88 % prop_preprocess_simplified: 2733
% 0.70/0.88 % prop_fo_subsumed: 198
% 0.70/0.88 % prop_solver_time: 0.
% 0.70/0.88 % prop_fast_solver_time: 0.003
% 0.70/0.88 % prop_unsat_core_time: 0.
% 0.70/0.88
% 0.70/0.88 % ------ QBF
% 0.70/0.88
% 0.70/0.88 % qbf_q_res: 0
% 0.70/0.88 % qbf_num_tautologies: 0
% 0.70/0.88 % qbf_prep_cycles: 0
% 0.70/0.88
% 0.70/0.88 % ------ BMC1
% 0.70/0.88
% 0.70/0.88 % bmc1_current_bound: -1
% 0.70/0.88 % bmc1_last_solved_bound: -1
% 0.70/0.88 % bmc1_unsat_core_size: -1
% 0.70/0.88 % bmc1_unsat_core_parents_size: -1
% 0.70/0.88 % bmc1_merge_next_fun: 0
% 0.70/0.88 % bmc1_unsat_core_clauses_time: 0.
% 0.70/0.88
% 0.70/0.88 % ------ Instantiation
% 0.70/0.88
% 0.70/0.88 % inst_num_of_clauses: 168
% 0.70/0.88 % inst_num_in_passive: 0
% 0.70/0.88 % inst_num_in_active: 168
% 0.70/0.88 % inst_num_in_unprocessed: 0
% 0.70/0.88 % inst_num_of_loops: 170
% 0.70/0.88 % inst_num_of_learning_restarts: 0
% 0.70/0.88 % inst_num_moves_active_passive: 0
% 0.70/0.88 % inst_lit_activity: 31
% 0.70/0.88 % inst_lit_activity_moves: 0
% 0.70/0.88 % inst_num_tautologies: 0
% 0.70/0.88 % inst_num_prop_implied: 0
% 0.70/0.88 % inst_num_existing_simplified: 0
% 0.70/0.88 % inst_num_eq_res_simplified: 0
% 0.70/0.88 % inst_num_child_elim: 0
% 0.70/0.88 % inst_num_of_dismatching_blockings: 0
% 0.70/0.88 % inst_num_of_non_proper_insts: 0
% 0.70/0.88 % inst_num_of_duplicates: 0
% 0.70/0.88 % inst_inst_num_from_inst_to_res: 0
% 0.70/0.88 % inst_dismatching_checking_time: 0.
% 0.70/0.88
% 0.70/0.88 % ------ Resolution
% 0.70/0.88
% 0.70/0.88 % res_num_of_clauses: 584
% 0.70/0.88 % res_num_in_passive: 185
% 0.70/0.88 % res_num_in_active: 381
% 0.70/0.88 % res_num_of_loops: 1000
% 0.70/0.88 % res_forward_subset_subsumed: 73
% 0.70/0.88 % res_backward_subset_subsumed: 19
% 0.70/0.88 % res_forward_subsumed: 579
% 0.70/0.88 % res_backward_subsumed: 27
% 0.70/0.88 % res_forward_subsumption_resolution: 319
% 0.70/0.88 % res_backward_subsumption_resolution: 4
% 0.70/0.88 % res_clause_to_clause_subsumption: 2471
% 0.70/0.88 % res_orphan_elimination: 0
% 0.70/0.88 % res_tautology_del: 741
% 0.70/0.88 % res_num_eq_res_simplified: 0
% 0.70/0.88 % res_num_sel_changes: 0
% 0.70/0.88 % res_moves_from_active_to_pass: 0
% 0.70/0.88
% 0.70/0.88 % Status Unknown
% 0.74/0.94 % Orienting using strategy ClausalAll
% 0.74/0.94 % FOF problem with conjecture
% 0.74/0.94 % 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/sandbox/tmp/iprover_proof_5dca67.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_bcc896.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_56ba33 | grep -v "SZS"
% 0.74/0.95
% 0.74/0.95 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.74/0.95
% 0.74/0.95 %
% 0.74/0.95 % ------ iProver source info
% 0.74/0.95
% 0.74/0.95 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.74/0.95 % git: non_committed_changes: true
% 0.74/0.95 % git: last_make_outside_of_git: true
% 0.74/0.95
% 0.74/0.95 %
% 0.74/0.95 % ------ Input Options
% 0.74/0.95
% 0.74/0.95 % --out_options all
% 0.74/0.95 % --tptp_safe_out true
% 0.74/0.95 % --problem_path ""
% 0.74/0.95 % --include_path ""
% 0.74/0.95 % --clausifier .//eprover
% 0.74/0.95 % --clausifier_options --tstp-format
% 0.74/0.95 % --stdin false
% 0.74/0.95 % --dbg_backtrace false
% 0.74/0.95 % --dbg_dump_prop_clauses false
% 0.74/0.95 % --dbg_dump_prop_clauses_file -
% 0.74/0.95 % --dbg_out_stat false
% 0.74/0.95
% 0.74/0.95 % ------ General Options
% 0.74/0.95
% 0.74/0.95 % --fof false
% 0.74/0.95 % --time_out_real 150.
% 0.74/0.95 % --time_out_prep_mult 0.2
% 0.74/0.95 % --time_out_virtual -1.
% 0.74/0.95 % --schedule none
% 0.74/0.95 % --ground_splitting input
% 0.74/0.95 % --splitting_nvd 16
% 0.74/0.95 % --non_eq_to_eq false
% 0.74/0.95 % --prep_gs_sim true
% 0.74/0.95 % --prep_unflatten false
% 0.74/0.95 % --prep_res_sim true
% 0.74/0.95 % --prep_upred true
% 0.74/0.95 % --res_sim_input true
% 0.74/0.95 % --clause_weak_htbl true
% 0.74/0.95 % --gc_record_bc_elim false
% 0.74/0.95 % --symbol_type_check false
% 0.74/0.95 % --clausify_out false
% 0.74/0.95 % --large_theory_mode false
% 0.74/0.95 % --prep_sem_filter none
% 0.74/0.95 % --prep_sem_filter_out false
% 0.74/0.95 % --preprocessed_out false
% 0.74/0.95 % --sub_typing false
% 0.74/0.95 % --brand_transform false
% 0.74/0.95 % --pure_diseq_elim true
% 0.74/0.95 % --min_unsat_core false
% 0.74/0.95 % --pred_elim true
% 0.74/0.95 % --add_important_lit false
% 0.74/0.95 % --soft_assumptions false
% 0.74/0.95 % --reset_solvers false
% 0.74/0.95 % --bc_imp_inh []
% 0.74/0.95 % --conj_cone_tolerance 1.5
% 0.74/0.95 % --prolific_symb_bound 500
% 0.74/0.95 % --lt_threshold 2000
% 0.74/0.95
% 0.74/0.95 % ------ SAT Options
% 0.74/0.95
% 0.74/0.95 % --sat_mode false
% 0.74/0.95 % --sat_fm_restart_options ""
% 0.74/0.95 % --sat_gr_def false
% 0.74/0.95 % --sat_epr_types true
% 0.74/0.95 % --sat_non_cyclic_types false
% 0.74/0.95 % --sat_finite_models false
% 0.74/0.95 % --sat_fm_lemmas false
% 0.74/0.95 % --sat_fm_prep false
% 0.74/0.95 % --sat_fm_uc_incr true
% 0.74/0.95 % --sat_out_model small
% 0.74/0.95 % --sat_out_clauses false
% 0.74/0.95
% 0.74/0.95 % ------ QBF Options
% 0.74/0.95
% 0.74/0.95 % --qbf_mode false
% 0.74/0.95 % --qbf_elim_univ true
% 0.74/0.95 % --qbf_sk_in true
% 0.74/0.95 % --qbf_pred_elim true
% 0.74/0.95 % --qbf_split 32
% 0.74/0.95
% 0.74/0.95 % ------ BMC1 Options
% 0.74/0.95
% 0.74/0.95 % --bmc1_incremental false
% 0.74/0.95 % --bmc1_axioms reachable_all
% 0.74/0.95 % --bmc1_min_bound 0
% 0.74/0.95 % --bmc1_max_bound -1
% 0.74/0.95 % --bmc1_max_bound_default -1
% 0.74/0.95 % --bmc1_symbol_reachability true
% 0.74/0.95 % --bmc1_property_lemmas false
% 0.74/0.95 % --bmc1_k_induction false
% 0.74/0.95 % --bmc1_non_equiv_states false
% 0.74/0.95 % --bmc1_deadlock false
% 0.74/0.95 % --bmc1_ucm false
% 0.74/0.95 % --bmc1_add_unsat_core none
% 0.74/0.95 % --bmc1_unsat_core_children false
% 0.74/0.95 % --bmc1_unsat_core_extrapolate_axioms false
% 0.74/0.95 % --bmc1_out_stat full
% 0.74/0.95 % --bmc1_ground_init false
% 0.74/0.95 % --bmc1_pre_inst_next_state false
% 0.74/0.95 % --bmc1_pre_inst_state false
% 0.74/0.95 % --bmc1_pre_inst_reach_state false
% 0.74/0.95 % --bmc1_out_unsat_core false
% 0.74/0.95 % --bmc1_aig_witness_out false
% 0.74/0.95 % --bmc1_verbose false
% 0.74/0.95 % --bmc1_dump_clauses_tptp false
% 0.74/0.99 % --bmc1_dump_unsat_core_tptp false
% 0.74/0.99 % --bmc1_dump_file -
% 0.74/0.99 % --bmc1_ucm_expand_uc_limit 128
% 0.74/0.99 % --bmc1_ucm_n_expand_iterations 6
% 0.74/0.99 % --bmc1_ucm_extend_mode 1
% 0.74/0.99 % --bmc1_ucm_init_mode 2
% 0.74/0.99 % --bmc1_ucm_cone_mode none
% 0.74/0.99 % --bmc1_ucm_reduced_relation_type 0
% 0.74/0.99 % --bmc1_ucm_relax_model 4
% 0.74/0.99 % --bmc1_ucm_full_tr_after_sat true
% 0.74/0.99 % --bmc1_ucm_expand_neg_assumptions false
% 0.74/0.99 % --bmc1_ucm_layered_model none
% 0.74/0.99 % --bmc1_ucm_max_lemma_size 10
% 0.74/0.99
% 0.74/0.99 % ------ AIG Options
% 0.74/0.99
% 0.74/0.99 % --aig_mode false
% 0.74/0.99
% 0.74/0.99 % ------ Instantiation Options
% 0.74/0.99
% 0.74/0.99 % --instantiation_flag true
% 0.74/0.99 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.74/0.99 % --inst_solver_per_active 750
% 0.74/0.99 % --inst_solver_calls_frac 0.5
% 0.74/0.99 % --inst_passive_queue_type priority_queues
% 0.74/0.99 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.74/0.99 % --inst_passive_queues_freq [25;2]
% 0.74/0.99 % --inst_dismatching true
% 0.74/0.99 % --inst_eager_unprocessed_to_passive true
% 0.74/0.99 % --inst_prop_sim_given true
% 0.74/0.99 % --inst_prop_sim_new false
% 0.74/0.99 % --inst_orphan_elimination true
% 0.74/0.99 % --inst_learning_loop_flag true
% 0.74/0.99 % --inst_learning_start 3000
% 0.74/0.99 % --inst_learning_factor 2
% 0.74/0.99 % --inst_start_prop_sim_after_learn 3
% 0.74/0.99 % --inst_sel_renew solver
% 0.74/0.99 % --inst_lit_activity_flag true
% 0.74/0.99 % --inst_out_proof true
% 0.74/0.99
% 0.74/0.99 % ------ Resolution Options
% 0.74/0.99
% 0.74/0.99 % --resolution_flag true
% 0.74/0.99 % --res_lit_sel kbo_max
% 0.74/0.99 % --res_to_prop_solver none
% 0.74/0.99 % --res_prop_simpl_new false
% 0.74/0.99 % --res_prop_simpl_given false
% 0.74/0.99 % --res_passive_queue_type priority_queues
% 0.74/0.99 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.74/0.99 % --res_passive_queues_freq [15;5]
% 0.74/0.99 % --res_forward_subs full
% 0.74/0.99 % --res_backward_subs full
% 0.74/0.99 % --res_forward_subs_resolution true
% 0.74/0.99 % --res_backward_subs_resolution true
% 0.74/0.99 % --res_orphan_elimination false
% 0.74/0.99 % --res_time_limit 1000.
% 0.74/0.99 % --res_out_proof true
% 0.74/0.99 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5dca67.s
% 0.74/0.99 % --modulo true
% 0.74/0.99
% 0.74/0.99 % ------ Combination Options
% 0.74/0.99
% 0.74/0.99 % --comb_res_mult 1000
% 0.74/0.99 % --comb_inst_mult 300
% 0.74/0.99 % ------
% 0.74/0.99
% 0.74/0.99 % ------ Parsing...% successful
% 0.74/0.99
% 0.74/0.99 % ------ Preprocessing... gs_s sp: 156 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.74/0.99
% 0.74/0.99 % ------ Proving...
% 0.74/0.99 % ------ Problem Properties
% 0.74/0.99
% 0.74/0.99 %
% 0.74/0.99 % EPR true
% 0.74/0.99 % Horn false
% 0.74/0.99 % Has equality false
% 0.74/0.99
% 0.74/0.99 % % ------ Input Options Time Limit: Unbounded
% 0.74/0.99
% 0.74/0.99
% 0.74/0.99 % % ------ Current options:
% 0.74/0.99
% 0.74/0.99 % ------ Input Options
% 0.74/0.99
% 0.74/0.99 % --out_options all
% 0.74/0.99 % --tptp_safe_out true
% 0.74/0.99 % --problem_path ""
% 0.74/0.99 % --include_path ""
% 0.74/0.99 % --clausifier .//eprover
% 0.74/0.99 % --clausifier_options --tstp-format
% 0.74/0.99 % --stdin false
% 0.74/0.99 % --dbg_backtrace false
% 0.74/0.99 % --dbg_dump_prop_clauses false
% 0.74/0.99 % --dbg_dump_prop_clauses_file -
% 0.74/0.99 % --dbg_out_stat false
% 0.74/0.99
% 0.74/0.99 % ------ General Options
% 0.74/0.99
% 0.74/0.99 % --fof false
% 0.74/0.99 % --time_out_real 150.
% 0.74/0.99 % --time_out_prep_mult 0.2
% 0.74/0.99 % --time_out_virtual -1.
% 0.74/0.99 % --schedule none
% 0.74/0.99 % --ground_splitting input
% 0.74/0.99 % --splitting_nvd 16
% 0.74/0.99 % --non_eq_to_eq false
% 0.74/0.99 % --prep_gs_sim true
% 0.74/0.99 % --prep_unflatten false
% 0.74/0.99 % --prep_res_sim true
% 0.74/0.99 % --prep_upred true
% 0.74/0.99 % --res_sim_input true
% 0.74/0.99 % --clause_weak_htbl true
% 0.74/0.99 % --gc_record_bc_elim false
% 0.74/0.99 % --symbol_type_check false
% 0.74/0.99 % --clausify_out false
% 0.74/0.99 % --large_theory_mode false
% 0.74/0.99 % --prep_sem_filter none
% 0.74/0.99 % --prep_sem_filter_out false
% 0.74/0.99 % --preprocessed_out false
% 0.74/0.99 % --sub_typing false
% 0.74/0.99 % --brand_transform false
% 0.74/0.99 % --pure_diseq_elim true
% 0.74/0.99 % --min_unsat_core false
% 0.74/0.99 % --pred_elim true
% 0.74/0.99 % --add_important_lit false
% 0.74/0.99 % --soft_assumptions false
% 0.74/0.99 % --reset_solvers false
% 0.74/0.99 % --bc_imp_inh []
% 0.74/0.99 % --conj_cone_tolerance 1.5
% 0.74/0.99 % --prolific_symb_bound 500
% 0.74/0.99 % --lt_threshold 2000
% 0.74/0.99
% 0.74/0.99 % ------ SAT Options
% 0.74/0.99
% 0.74/0.99 % --sat_mode false
% 0.74/0.99 % --sat_fm_restart_options ""
% 0.74/0.99 % --sat_gr_def false
% 0.74/0.99 % --sat_epr_types true
% 0.74/0.99 % --sat_non_cyclic_types false
% 0.74/0.99 % --sat_finite_models false
% 0.74/0.99 % --sat_fm_lemmas false
% 0.74/0.99 % --sat_fm_prep false
% 0.74/0.99 % --sat_fm_uc_incr true
% 0.74/0.99 % --sat_out_model small
% 0.74/0.99 % --sat_out_clauses false
% 0.74/0.99
% 0.74/0.99 % ------ QBF Options
% 0.74/0.99
% 0.74/0.99 % --qbf_mode false
% 0.74/0.99 % --qbf_elim_univ true
% 0.74/0.99 % --qbf_sk_in true
% 0.74/0.99 % --qbf_pred_elim true
% 0.74/0.99 % --qbf_split 32
% 0.74/0.99
% 0.74/0.99 % ------ BMC1 Options
% 0.74/0.99
% 0.74/0.99 % --bmc1_incremental false
% 0.74/0.99 % --bmc1_axioms reachable_all
% 0.74/0.99 % --bmc1_min_bound 0
% 0.74/0.99 % --bmc1_max_bound -1
% 0.74/0.99 % --bmc1_max_bound_default -1
% 0.74/0.99 % --bmc1_symbol_reachability true
% 0.74/0.99 % --bmc1_property_lemmas false
% 0.74/0.99 % --bmc1_k_induction false
% 0.74/0.99 % --bmc1_non_equiv_states false
% 0.74/0.99 % --bmc1_deadlock false
% 0.74/0.99 % --bmc1_ucm false
% 0.74/0.99 % --bmc1_add_unsat_core none
% 0.74/0.99 % --bmc1_unsat_core_children false
% 0.74/0.99 % --bmc1_unsat_core_extrapolate_axioms false
% 0.74/0.99 % --bmc1_out_stat full
% 0.74/0.99 % --bmc1_ground_init false
% 0.74/0.99 % --bmc1_pre_inst_next_state false
% 0.74/0.99 % --bmc1_pre_inst_state false
% 0.74/0.99 % --bmc1_pre_inst_reach_state false
% 0.74/0.99 % --bmc1_out_unsat_core false
% 0.74/0.99 % --bmc1_aig_witness_out false
% 0.74/0.99 % --bmc1_verbose false
% 0.74/0.99 % --bmc1_dump_clauses_tptp false
% 0.74/0.99 % --bmc1_dump_unsat_core_tptp false
% 0.74/0.99 % --bmc1_dump_file -
% 0.74/0.99 % --bmc1_ucm_expand_uc_limit 128
% 0.74/0.99 % --bmc1_ucm_n_expand_iterations 6
% 0.74/0.99 % --bmc1_ucm_extend_mode 1
% 0.74/0.99 % --bmc1_ucm_init_mode 2
% 0.74/0.99 % --bmc1_ucm_cone_mode none
% 0.74/0.99 % --bmc1_ucm_reduced_relation_type 0
% 0.74/0.99 % --bmc1_ucm_relax_model 4
% 0.74/0.99 % --bmc1_ucm_full_tr_after_sat true
% 0.74/0.99 % --bmc1_ucm_expand_neg_assumptions false
% 0.74/0.99 % --bmc1_ucm_layered_model none
% 0.74/0.99 % --bmc1_ucm_max_lemma_size 10
% 0.74/0.99
% 0.74/0.99 % ------ AIG Options
% 0.74/0.99
% 0.74/0.99 % --aig_mode false
% 0.74/0.99
% 0.74/0.99 % ------ Instantiation Options
% 0.74/0.99
% 0.74/0.99 % --instantiation_flag true
% 0.74/0.99 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.74/0.99 % --inst_solver_per_active 750
% 0.74/0.99 % --inst_solver_calls_frac 0.5
% 0.74/0.99 % --inst_passive_queue_type priority_queues
% 0.74/0.99 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.74/0.99 % --inst_passive_queues_freq [25;2]
% 0.74/0.99 % --inst_dismatching true
% 0.74/0.99 % --inst_eager_unprocessed_to_passive true
% 1.07/1.25 % --inst_prop_sim_given true
% 1.07/1.25 % --inst_prop_sim_new false
% 1.07/1.25 % --inst_orphan_elimination true
% 1.07/1.25 % --inst_learning_loop_flag true
% 1.07/1.25 % --inst_learning_start 3000
% 1.07/1.25 % --inst_learning_factor 2
% 1.07/1.25 % --inst_start_prop_sim_after_learn 3
% 1.07/1.25 % --inst_sel_renew solver
% 1.07/1.25 % --inst_lit_activity_flag true
% 1.07/1.25 % --inst_out_proof true
% 1.07/1.25
% 1.07/1.25 % ------ Resolution Options
% 1.07/1.25
% 1.07/1.25 % --resolution_flag true
% 1.07/1.25 % --res_lit_sel kbo_max
% 1.07/1.25 % --res_to_prop_solver none
% 1.07/1.25 % --res_prop_simpl_new false
% 1.07/1.25 % --res_prop_simpl_given false
% 1.07/1.25 % --res_passive_queue_type priority_queues
% 1.07/1.25 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.07/1.25 % --res_passive_queues_freq [15;5]
% 1.07/1.25 % --res_forward_subs full
% 1.07/1.25 % --res_backward_subs full
% 1.07/1.25 % --res_forward_subs_resolution true
% 1.07/1.25 % --res_backward_subs_resolution true
% 1.07/1.25 % --res_orphan_elimination false
% 1.07/1.25 % --res_time_limit 1000.
% 1.07/1.25 % --res_out_proof true
% 1.07/1.25 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5dca67.s
% 1.07/1.25 % --modulo true
% 1.07/1.25
% 1.07/1.25 % ------ Combination Options
% 1.07/1.25
% 1.07/1.25 % --comb_res_mult 1000
% 1.07/1.25 % --comb_inst_mult 300
% 1.07/1.25 % ------
% 1.07/1.25
% 1.07/1.25
% 1.07/1.25
% 1.07/1.25 % ------ Proving...
% 1.07/1.25 % warning: shown sat in sat incomplete mode
% 1.07/1.25 %
% 1.07/1.25
% 1.07/1.25
% 1.07/1.25 ------ Building Model...Done
% 1.07/1.25
% 1.07/1.25 %------ The model is defined over ground terms (initial term algebra).
% 1.07/1.25 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.07/1.25 %------ where \phi is a formula over the term algebra.
% 1.07/1.25 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.07/1.25 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.07/1.25 %------ See help for --sat_out_model for different model outputs.
% 1.07/1.25 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.07/1.25 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.07/1.25
% 1.07/1.25
% 1.07/1.25
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of c3_0
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( c3_0 <=>
% 1.07/1.25 $true
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of c5_2
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 (! [X0,X1] :
% 1.07/1.25 ( c5_2(X0,X1) <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of c1_2
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 (! [X0,X1] :
% 1.07/1.25 ( c1_2(X0,X1) <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Negative definition of ndr1_1
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 (! [X0] :
% 1.07/1.25 ( ~(ndr1_1(X0)) <=>
% 1.07/1.25 (
% 1.07/1.25 (
% 1.07/1.25 ( X0=a100 )
% 1.07/1.25 )
% 1.07/1.25
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of c2_2
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 (! [X0,X1] :
% 1.07/1.25 ( c2_2(X0,X1) <=>
% 1.07/1.25 (
% 1.07/1.25 (
% 1.07/1.25 ( X0=a93 & X1=a94 )
% 1.07/1.25 )
% 1.07/1.25
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of epred3_0
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( epred3_0 <=>
% 1.07/1.25 $true
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of c4_2
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 (! [X0,X1] :
% 1.07/1.25 ( c4_2(X0,X1) <=>
% 1.07/1.25 (
% 1.07/1.25 (
% 1.07/1.25 ( X0=a82 & X1=a83 )
% 1.07/1.25 )
% 1.07/1.25
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of epred1_0
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( epred1_0 <=>
% 1.07/1.25 $true
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Negative definition of c4_1
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 (! [X0] :
% 1.07/1.25 ( ~(c4_1(X0)) <=>
% 1.07/1.25 (
% 1.07/1.25 (
% 1.07/1.25 ( X0=a90 )
% 1.07/1.25 )
% 1.07/1.25
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of ndr1_0
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( ndr1_0 <=>
% 1.07/1.25 $true
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of c3_1
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 (! [X0] :
% 1.07/1.25 ( c3_1(X0) <=>
% 1.07/1.25 (
% 1.07/1.25 (
% 1.07/1.25 ( X0=a93 )
% 1.07/1.25 )
% 1.07/1.25
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of c2_1
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 (! [X0] :
% 1.07/1.25 ( c2_1(X0) <=>
% 1.07/1.25 (
% 1.07/1.25 (
% 1.07/1.25 ( X0=a100 )
% 1.07/1.25 )
% 1.07/1.25
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of c5_0
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( c5_0 <=>
% 1.07/1.25 $true
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of c2_0
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( c2_0 <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of c4_0
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( c4_0 <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Negative definition of c1_1
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 (! [X0] :
% 1.07/1.25 ( ~(c1_1(X0)) <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of epred2_0
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( epred2_0 <=>
% 1.07/1.25 $true
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of c1_0
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( c1_0 <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP1_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP1_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP2_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP2_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP4_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP4_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP5_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP5_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP6_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP6_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP7_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP7_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP8_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP8_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP12_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP12_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP13_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP13_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP14_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP14_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP21_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP21_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP22_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP22_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP23_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP23_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP24_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP24_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP25_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP25_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25 %------ Positive definition of sP26_iProver_split
% 1.07/1.25 fof(lit_def,axiom,
% 1.07/1.25 ( sP26_iProver_split <=>
% 1.07/1.25 $false
% 1.07/1.25 )
% 1.07/1.25 ).
% 1.07/1.25
% 1.07/1.25
% 1.07/1.25
% 1.07/1.25 % ------ Statistics
% 1.07/1.25
% 1.07/1.25 % ------ General
% 1.07/1.25
% 1.07/1.25 % num_of_input_clauses: 221
% 1.07/1.25 % num_of_input_neg_conjectures: 95
% 1.07/1.25 % num_of_splits: 156
% 1.07/1.25 % num_of_split_atoms: 27
% 1.07/1.25 % num_of_sem_filtered_clauses: 0
% 1.07/1.25 % num_of_subtypes: 0
% 1.07/1.25 % monotx_restored_types: 0
% 1.07/1.25 % sat_num_of_epr_types: 0
% 1.07/1.25 % sat_num_of_non_cyclic_types: 0
% 1.07/1.25 % sat_guarded_non_collapsed_types: 0
% 1.07/1.25 % is_epr: 1
% 1.07/1.25 % is_horn: 0
% 1.07/1.25 % has_eq: 0
% 1.07/1.25 % num_pure_diseq_elim: 0
% 1.07/1.25 % simp_replaced_by: 0
% 1.07/1.25 % res_preprocessed: 418
% 1.07/1.25 % prep_upred: 0
% 1.07/1.25 % prep_unflattend: 0
% 1.07/1.25 % pred_elim_cands: 27
% 1.07/1.25 % pred_elim: 11
% 1.07/1.25 % pred_elim_cl: 31
% 1.07/1.25 % pred_elim_cycles: 27
% 1.07/1.25 % forced_gc_time: 0
% 1.07/1.25 % gc_basic_clause_elim: 0
% 1.07/1.25 % parsing_time: 0.004
% 1.07/1.25 % sem_filter_time: 0.
% 1.07/1.25 % pred_elim_time: 0.018
% 1.07/1.25 % out_proof_time: 0.
% 1.07/1.25 % monotx_time: 0.
% 1.07/1.25 % subtype_inf_time: 0.
% 1.07/1.25 % unif_index_cands_time: 0.
% 1.07/1.25 % unif_index_add_time: 0.
% 1.07/1.25 % total_time: 0.304
% 1.07/1.25 % num_of_symbols: 106
% 1.07/1.25 % num_of_terms: 586
% 1.07/1.25
% 1.07/1.25 % ------ Propositional Solver
% 1.07/1.25
% 1.07/1.25 % prop_solver_calls: 2
% 1.07/1.25 % prop_fast_solver_calls: 2917
% 1.07/1.25 % prop_num_of_clauses: 513
% 1.07/1.25 % prop_preprocess_simplified: 2733
% 1.07/1.25 % prop_fo_subsumed: 198
% 1.07/1.25 % prop_solver_time: 0.
% 1.07/1.25 % prop_fast_solver_time: 0.001
% 1.07/1.25 % prop_unsat_core_time: 0.
% 1.07/1.25
% 1.07/1.25 % ------ QBF
% 1.07/1.25
% 1.07/1.25 % qbf_q_res: 0
% 1.07/1.25 % qbf_num_tautologies: 0
% 1.07/1.25 % qbf_prep_cycles: 0
% 1.07/1.25
% 1.07/1.25 % ------ BMC1
% 1.07/1.25
% 1.07/1.25 % bmc1_current_bound: -1
% 1.07/1.25 % bmc1_last_solved_bound: -1
% 1.07/1.25 % bmc1_unsat_core_size: -1
% 1.07/1.25 % bmc1_unsat_core_parents_size: -1
% 1.07/1.25 % bmc1_merge_next_fun: 0
% 1.07/1.25 % bmc1_unsat_core_clauses_time: 0.
% 1.07/1.25
% 1.07/1.25 % ------ Instantiation
% 1.07/1.25
% 1.07/1.25 % inst_num_of_clauses: 168
% 1.07/1.25 % inst_num_in_passive: 0
% 1.07/1.25 % inst_num_in_active: 168
% 1.07/1.25 % inst_num_in_unprocessed: 0
% 1.07/1.25 % inst_num_of_loops: 170
% 1.07/1.25 % inst_num_of_learning_restarts: 0
% 1.07/1.25 % inst_num_moves_active_passive: 0
% 1.07/1.25 % inst_lit_activity: 31
% 1.07/1.25 % inst_lit_activity_moves: 0
% 1.07/1.25 % inst_num_tautologies: 0
% 1.07/1.25 % inst_num_prop_implied: 0
% 1.07/1.25 % inst_num_existing_simplified: 0
% 1.07/1.25 % inst_num_eq_res_simplified: 0
% 1.07/1.25 % inst_num_child_elim: 0
% 1.07/1.25 % inst_num_of_dismatching_blockings: 0
% 1.07/1.25 % inst_num_of_non_proper_insts: 0
% 1.07/1.25 % inst_num_of_duplicates: 0
% 1.07/1.25 % inst_inst_num_from_inst_to_res: 0
% 1.07/1.25 % inst_dismatching_checking_time: 0.
% 1.07/1.25
% 1.07/1.25 % ------ Resolution
% 1.07/1.25
% 1.07/1.25 % res_num_of_clauses: 584
% 1.07/1.25 % res_num_in_passive: 185
% 1.07/1.25 % res_num_in_active: 381
% 1.07/1.25 % res_num_of_loops: 1000
% 1.07/1.25 % res_forward_subset_subsumed: 73
% 1.07/1.25 % res_backward_subset_subsumed: 19
% 1.07/1.25 % res_forward_subsumed: 579
% 1.07/1.25 % res_backward_subsumed: 27
% 1.07/1.25 % res_forward_subsumption_resolution: 319
% 1.07/1.25 % res_backward_subsumption_resolution: 4
% 1.07/1.25 % res_clause_to_clause_subsumption: 2471
% 1.07/1.25 % res_orphan_elimination: 0
% 1.07/1.25 % res_tautology_del: 741
% 1.07/1.25 % res_num_eq_res_simplified: 0
% 1.07/1.25 % res_num_sel_changes: 0
% 1.07/1.25 % res_moves_from_active_to_pass: 0
% 1.07/1.25
% 1.07/1.25 % Status Unknown
% 1.07/1.25 % Last status :
% 1.07/1.25 % SZS status Unknown
%------------------------------------------------------------------------------