%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWW403-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n023.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 00:29:48 EDT 2022
% Result : Unknown 1.51s 1.81s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW403-1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.14/0.33 % Computer : n023.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 5 16:22:24 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.34 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_067e25.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_e10e86 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.52 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.52 % --bmc1_dump_file -
% 0.20/0.52 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.52 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.52 % --bmc1_ucm_extend_mode 1
% 0.20/0.52 % --bmc1_ucm_init_mode 2
% 0.20/0.52 % --bmc1_ucm_cone_mode none
% 0.20/0.52 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.52 % --bmc1_ucm_relax_model 4
% 0.20/0.52 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.52 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.52 % --bmc1_ucm_layered_model none
% 0.20/0.52 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.52
% 0.20/0.52 % ------ AIG Options
% 0.20/0.52
% 0.20/0.52 % --aig_mode false
% 0.20/0.52
% 0.20/0.52 % ------ Instantiation Options
% 0.20/0.52
% 0.20/0.52 % --instantiation_flag true
% 0.20/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.52 % --inst_solver_per_active 750
% 0.20/0.52 % --inst_solver_calls_frac 0.5
% 0.20/0.52 % --inst_passive_queue_type priority_queues
% 0.20/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.52 % --inst_passive_queues_freq [25;2]
% 0.20/0.52 % --inst_dismatching true
% 0.20/0.52 % --inst_eager_unprocessed_to_passive true
% 0.20/0.52 % --inst_prop_sim_given true
% 0.20/0.52 % --inst_prop_sim_new false
% 0.20/0.52 % --inst_orphan_elimination true
% 0.20/0.52 % --inst_learning_loop_flag true
% 0.20/0.52 % --inst_learning_start 3000
% 0.20/0.52 % --inst_learning_factor 2
% 0.20/0.52 % --inst_start_prop_sim_after_learn 3
% 0.20/0.52 % --inst_sel_renew solver
% 0.20/0.52 % --inst_lit_activity_flag true
% 0.20/0.52 % --inst_out_proof true
% 0.20/0.52
% 0.20/0.52 % ------ Resolution Options
% 0.20/0.52
% 0.20/0.52 % --resolution_flag true
% 0.20/0.52 % --res_lit_sel kbo_max
% 0.20/0.52 % --res_to_prop_solver none
% 0.20/0.52 % --res_prop_simpl_new false
% 0.20/0.52 % --res_prop_simpl_given false
% 0.20/0.52 % --res_passive_queue_type priority_queues
% 0.20/0.52 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.52 % --res_passive_queues_freq [15;5]
% 0.20/0.52 % --res_forward_subs full
% 0.20/0.52 % --res_backward_subs full
% 0.20/0.52 % --res_forward_subs_resolution true
% 0.20/0.52 % --res_backward_subs_resolution true
% 0.20/0.52 % --res_orphan_elimination false
% 0.20/0.52 % --res_time_limit 1000.
% 0.20/0.52 % --res_out_proof true
% 0.20/0.52 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_067e25.s
% 0.20/0.52 % --modulo true
% 0.20/0.52
% 0.20/0.52 % ------ Combination Options
% 0.20/0.52
% 0.20/0.52 % --comb_res_mult 1000
% 0.20/0.52 % --comb_inst_mult 300
% 0.20/0.52 % ------
% 0.20/0.52
% 0.20/0.52 % ------ Parsing...% successful
% 0.20/0.52
% 0.20/0.52 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.52
% 0.20/0.52 % ------ Proving...
% 0.20/0.52 % ------ Problem Properties
% 0.20/0.52
% 0.20/0.52 %
% 0.20/0.52 % EPR false
% 0.20/0.52 % Horn false
% 0.20/0.52 % Has equality true
% 0.20/0.52
% 0.20/0.52 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Compiling...
% 0.20/0.52 Loading plugin: done.
% 0.20/0.52 % % ------ Current options:
% 0.20/0.52
% 0.20/0.52 % ------ Input Options
% 0.20/0.52
% 0.20/0.52 % --out_options all
% 0.20/0.52 % --tptp_safe_out true
% 0.20/0.52 % --problem_path ""
% 0.20/0.52 % --include_path ""
% 0.20/0.52 % --clausifier .//eprover
% 0.20/0.52 % --clausifier_options --tstp-format
% 0.20/0.52 % --stdin false
% 0.20/0.52 % --dbg_backtrace false
% 0.20/0.52 % --dbg_dump_prop_clauses false
% 0.20/0.52 % --dbg_dump_prop_clauses_file -
% 0.20/0.52 % --dbg_out_stat false
% 0.20/0.52
% 0.20/0.52 % ------ General Options
% 0.20/0.52
% 0.20/0.52 % --fof false
% 0.20/0.52 % --time_out_real 150.
% 0.20/0.52 % --time_out_prep_mult 0.2
% 0.20/0.52 % --time_out_virtual -1.
% 0.20/0.52 % --schedule none
% 0.20/0.52 % --ground_splitting input
% 0.20/0.52 % --splitting_nvd 16
% 0.20/0.52 % --non_eq_to_eq false
% 0.20/0.52 % --prep_gs_sim true
% 0.20/0.52 % --prep_unflatten false
% 0.20/0.52 % --prep_res_sim true
% 0.20/0.52 % --prep_upred true
% 0.20/0.52 % --res_sim_input true
% 0.20/0.52 % --clause_weak_htbl true
% 0.20/0.52 % --gc_record_bc_elim false
% 0.20/0.52 % --symbol_type_check false
% 0.20/0.52 % --clausify_out false
% 0.20/0.52 % --large_theory_mode false
% 0.20/0.52 % --prep_sem_filter none
% 0.20/0.52 % --prep_sem_filter_out false
% 0.20/0.52 % --preprocessed_out false
% 0.20/0.52 % --sub_typing false
% 0.20/0.52 % --brand_transform false
% 0.20/0.52 % --pure_diseq_elim true
% 0.20/0.52 % --min_unsat_core false
% 0.20/0.52 % --pred_elim true
% 0.20/0.52 % --add_important_lit false
% 0.20/0.52 % --soft_assumptions false
% 0.20/0.52 % --reset_solvers false
% 0.20/0.52 % --bc_imp_inh []
% 0.20/0.52 % --conj_cone_tolerance 1.5
% 0.20/0.52 % --prolific_symb_bound 500
% 0.20/0.52 % --lt_threshold 2000
% 0.20/0.52
% 0.20/0.52 % ------ SAT Options
% 0.20/0.52
% 0.20/0.52 % --sat_mode false
% 0.20/0.52 % --sat_fm_restart_options ""
% 0.20/0.52 % --sat_gr_def false
% 0.20/0.52 % --sat_epr_types true
% 0.20/0.52 % --sat_non_cyclic_types false
% 0.20/0.52 % --sat_finite_models false
% 0.20/0.52 % --sat_fm_lemmas false
% 0.20/0.52 % --sat_fm_prep false
% 0.20/0.52 % --sat_fm_uc_incr true
% 0.20/0.52 % --sat_out_model small
% 0.20/0.52 % --sat_out_clauses false
% 0.20/0.52
% 0.20/0.52 % ------ QBF Options
% 0.20/0.52
% 0.20/0.52 % --qbf_mode false
% 0.20/0.52 % --qbf_elim_univ true
% 0.20/0.52 % --qbf_sk_in true
% 0.20/0.52 % --qbf_pred_elim true
% 0.20/0.52 % --qbf_split 32
% 0.20/0.52
% 0.20/0.52 % ------ BMC1 Options
% 0.20/0.52
% 0.20/0.52 % --bmc1_incremental false
% 0.20/0.52 % --bmc1_axioms reachable_all
% 0.20/0.52 % --bmc1_min_bound 0
% 0.20/0.52 % --bmc1_max_bound -1
% 0.20/0.52 % --bmc1_max_bound_default -1
% 0.20/0.52 % --bmc1_symbol_reachability true
% 0.20/0.52 % --bmc1_property_lemmas false
% 0.20/0.52 % --bmc1_k_induction false
% 0.20/0.52 % --bmc1_non_equiv_states false
% 0.20/0.52 % --bmc1_deadlock false
% 0.20/0.52 % --bmc1_ucm false
% 0.20/0.52 % --bmc1_add_unsat_core none
% 0.20/0.52 % --bmc1_unsat_core_children false
% 0.20/0.52 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.52 % --bmc1_out_stat full
% 0.20/0.52 % --bmc1_ground_init false
% 0.20/0.52 % --bmc1_pre_inst_next_state false
% 0.20/0.52 % --bmc1_pre_inst_state false
% 0.20/0.52 % --bmc1_pre_inst_reach_state false
% 0.20/0.52 % --bmc1_out_unsat_core false
% 0.20/0.52 % --bmc1_aig_witness_out false
% 0.20/0.52 % --bmc1_verbose false
% 0.20/0.52 % --bmc1_dump_clauses_tptp false
% 0.20/0.52 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.52 % --bmc1_dump_file -
% 0.20/0.52 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.52 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.52 % --bmc1_ucm_extend_mode 1
% 0.20/0.52 % --bmc1_ucm_init_mode 2
% 0.20/0.52 % --bmc1_ucm_cone_mode none
% 0.20/0.52 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.52 % --bmc1_ucm_relax_model 4
% 0.20/0.52 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.52 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.52 % --bmc1_ucm_layered_model none
% 0.20/0.52 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.52
% 0.20/0.52 % ------ AIG Options
% 0.20/0.52
% 0.20/0.52 % --aig_mode false
% 0.20/0.52
% 0.20/0.52 % ------ Instantiation Options
% 0.20/0.52
% 0.20/0.52 % --instantiation_flag true
% 0.20/0.52 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.52 % --inst_solver_per_active 750
% 0.20/0.52 % --inst_solver_calls_frac 0.5
% 0.20/0.52 % --inst_passive_queue_type priority_queues
% 0.20/0.52 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.52 % --inst_passive_queues_freq [25;2]
% 0.20/0.52 % --inst_dismatching true
% 0.20/0.52 % --inst_eager_unprocessed_to_passive true
% 1.37/1.61 % --inst_prop_sim_given true
% 1.37/1.61 % --inst_prop_sim_new false
% 1.37/1.61 % --inst_orphan_elimination true
% 1.37/1.61 % --inst_learning_loop_flag true
% 1.37/1.61 % --inst_learning_start 3000
% 1.37/1.61 % --inst_learning_factor 2
% 1.37/1.61 % --inst_start_prop_sim_after_learn 3
% 1.37/1.61 % --inst_sel_renew solver
% 1.37/1.61 % --inst_lit_activity_flag true
% 1.37/1.61 % --inst_out_proof true
% 1.37/1.61
% 1.37/1.61 % ------ Resolution Options
% 1.37/1.61
% 1.37/1.61 % --resolution_flag true
% 1.37/1.61 % --res_lit_sel kbo_max
% 1.37/1.61 % --res_to_prop_solver none
% 1.37/1.61 % --res_prop_simpl_new false
% 1.37/1.61 % --res_prop_simpl_given false
% 1.37/1.61 % --res_passive_queue_type priority_queues
% 1.37/1.61 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.37/1.61 % --res_passive_queues_freq [15;5]
% 1.37/1.61 % --res_forward_subs full
% 1.37/1.61 % --res_backward_subs full
% 1.37/1.61 % --res_forward_subs_resolution true
% 1.37/1.61 % --res_backward_subs_resolution true
% 1.37/1.61 % --res_orphan_elimination false
% 1.37/1.61 % --res_time_limit 1000.
% 1.37/1.61 % --res_out_proof true
% 1.37/1.61 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_067e25.s
% 1.37/1.61 % --modulo true
% 1.37/1.61
% 1.37/1.61 % ------ Combination Options
% 1.37/1.61
% 1.37/1.61 % --comb_res_mult 1000
% 1.37/1.61 % --comb_inst_mult 300
% 1.37/1.61 % ------
% 1.37/1.61
% 1.37/1.61
% 1.37/1.61
% 1.37/1.61 % ------ Proving...
% 1.37/1.61 % warning: shown sat in sat incomplete mode
% 1.37/1.61 %
% 1.37/1.61
% 1.37/1.61
% 1.37/1.61 ------ Building Model...Done
% 1.37/1.61
% 1.37/1.61 %------ The model is defined over ground terms (initial term algebra).
% 1.37/1.61 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.37/1.61 %------ where \phi is a formula over the term algebra.
% 1.37/1.61 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.37/1.61 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.37/1.61 %------ See help for --sat_out_model for different model outputs.
% 1.37/1.61 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.37/1.61 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.37/1.61
% 1.37/1.61
% 1.37/1.61
% 1.37/1.61
% 1.37/1.61 %------ Positive definition of equality_sorted
% 1.37/1.61 fof(lit_def,axiom,
% 1.37/1.61 (! [X0,X0,X1] :
% 1.37/1.61 ( equality_sorted(X0,X0,X1) <=>
% 1.37/1.61 (
% 1.37/1.61 ? [X2] :
% 1.37/1.61 (
% 1.37/1.61 ( X0=$i & X0=sep(lseg(X2,X2),X1) )
% 1.37/1.61 )
% 1.37/1.61
% 1.37/1.61 |
% 1.37/1.61 ? [X2,X3,X4] :
% 1.37/1.61 (
% 1.37/1.61 ( X0=$i & X0=sep(X2,sep(X3,X4)) & X1=sep(X3,sep(X2,X4)) )
% 1.37/1.61 )
% 1.37/1.61
% 1.37/1.61 )
% 1.37/1.61 )
% 1.37/1.61 )
% 1.37/1.61 ).
% 1.37/1.61
% 1.37/1.61 %------ Positive definition of heap
% 1.37/1.61 fof(lit_def,axiom,
% 1.37/1.61 (! [X0] :
% 1.37/1.61 ( heap(X0) <=>
% 1.37/1.61 (
% 1.37/1.61 (
% 1.37/1.61 ( X0=sep(lseg(x1,x4),sep(next(x4,x1),emp)) )
% 1.37/1.61 )
% 1.37/1.61
% 1.37/1.61 )
% 1.37/1.61 )
% 1.37/1.61 )
% 1.37/1.61 ).
% 1.37/1.61
% 1.37/1.61
% 1.37/1.61
% 1.37/1.61 % ------ Statistics
% 1.37/1.61
% 1.37/1.61 % ------ General
% 1.37/1.61
% 1.37/1.61 % num_of_input_clauses: 29
% 1.37/1.61 % num_of_input_neg_conjectures: 1
% 1.37/1.61 % num_of_splits: 0
% 1.37/1.61 % num_of_split_atoms: 0
% 1.37/1.61 % num_of_sem_filtered_clauses: 0
% 1.37/1.61 % num_of_subtypes: 0
% 1.37/1.61 % monotx_restored_types: 0
% 1.37/1.61 % sat_num_of_epr_types: 0
% 1.37/1.61 % sat_num_of_non_cyclic_types: 0
% 1.37/1.61 % sat_guarded_non_collapsed_types: 0
% 1.37/1.61 % is_epr: 0
% 1.37/1.61 % is_horn: 0
% 1.37/1.61 % has_eq: 1
% 1.37/1.61 % num_pure_diseq_elim: 0
% 1.37/1.61 % simp_replaced_by: 0
% 1.37/1.61 % res_preprocessed: 9
% 1.37/1.61 % prep_upred: 0
% 1.37/1.61 % prep_unflattend: 0
% 1.37/1.61 % pred_elim_cands: 0
% 1.37/1.61 % pred_elim: 0
% 1.37/1.61 % pred_elim_cl: 0
% 1.37/1.61 % pred_elim_cycles: 0
% 1.37/1.61 % forced_gc_time: 0
% 1.37/1.61 % gc_basic_clause_elim: 0
% 1.37/1.61 % parsing_time: 0.001
% 1.37/1.61 % sem_filter_time: 0.
% 1.37/1.61 % pred_elim_time: 0.
% 1.37/1.61 % out_proof_time: 0.
% 1.37/1.61 % monotx_time: 0.
% 1.37/1.61 % subtype_inf_time: 0.
% 1.37/1.61 % unif_index_cands_time: 0.
% 1.37/1.61 % unif_index_add_time: 0.003
% 1.37/1.61 % total_time: 1.205
% 1.37/1.61 % num_of_symbols: 36
% 1.37/1.61 % num_of_terms: 13815
% 1.37/1.61
% 1.37/1.61 % ------ Propositional Solver
% 1.37/1.61
% 1.37/1.61 % prop_solver_calls: 2
% 1.37/1.61 % prop_fast_solver_calls: 17
% 1.37/1.61 % prop_num_of_clauses: 36
% 1.37/1.61 % prop_preprocess_simplified: 157
% 1.37/1.61 % prop_fo_subsumed: 0
% 1.37/1.61 % prop_solver_time: 0.
% 1.37/1.61 % prop_fast_solver_time: 0.
% 1.37/1.61 % prop_unsat_core_time: 0.
% 1.37/1.61
% 1.37/1.61 % ------ QBF
% 1.37/1.61
% 1.37/1.61 % qbf_q_res: 0
% 1.37/1.61 % qbf_num_tautologies: 0
% 1.37/1.61 % qbf_prep_cycles: 0
% 1.37/1.61
% 1.37/1.61 % ------ BMC1
% 1.37/1.61
% 1.37/1.61 % bmc1_current_bound: -1
% 1.37/1.61 % bmc1_last_solved_bound: -1
% 1.37/1.61 % bmc1_unsat_core_size: -1
% 1.37/1.61 % bmc1_unsat_core_parents_size: -1
% 1.37/1.61 % bmc1_merge_next_fun: 0
% 1.37/1.61 % bmc1_unsat_core_clauses_time: 0.
% 1.37/1.61
% 1.37/1.61 % ------ Instantiation
% 1.37/1.61
% 1.37/1.61 % inst_num_of_clauses: 29
% 1.37/1.61 % inst_num_in_passive: 0
% 1.37/1.61 % inst_num_in_active: 29
% 1.37/1.61 % inst_num_in_unprocessed: 0
% 1.37/1.61 % inst_num_of_loops: 31
% 1.37/1.61 % inst_num_of_learning_restarts: 0
% 1.37/1.61 % inst_num_moves_active_passive: 0
% 1.37/1.61 % inst_lit_activity: 5
% 1.37/1.61 % inst_lit_activity_moves: 0
% 1.37/1.61 % inst_num_tautologies: 0
% 1.37/1.61 % inst_num_prop_implied: 0
% 1.37/1.61 % inst_num_existing_simplified: 0
% 1.37/1.61 % inst_num_eq_res_simplified: 0
% 1.37/1.61 % inst_num_child_elim: 0
% 1.37/1.61 % inst_num_of_dismatching_blockings: 0
% 1.37/1.61 % inst_num_of_non_proper_insts: 0
% 1.37/1.61 % inst_num_of_duplicates: 0
% 1.37/1.61 % inst_inst_num_from_inst_to_res: 0
% 1.37/1.61 % inst_dismatching_checking_time: 0.
% 1.37/1.61
% 1.37/1.61 % ------ Resolution
% 1.37/1.61
% 1.37/1.61 % res_num_of_clauses: 1053
% 1.37/1.61 % res_num_in_passive: 471
% 1.37/1.61 % res_num_in_active: 571
% 1.37/1.61 % res_num_of_loops: 1000
% 1.37/1.61 % res_forward_subset_subsumed: 10
% 1.37/1.61 % res_backward_subset_subsumed: 0
% 1.37/1.61 % res_forward_subsumed: 440
% 1.37/1.61 % res_backward_subsumed: 0
% 1.37/1.61 % res_forward_subsumption_resolution: 6
% 1.37/1.61 % res_backward_subsumption_resolution: 0
% 1.37/1.61 % res_clause_to_clause_subsumption: 14649
% 1.37/1.61 % res_orphan_elimination: 0
% 1.37/1.61 % res_tautology_del: 0
% 1.37/1.61 % res_num_eq_res_simplified: 0
% 1.37/1.61 % res_num_sel_changes: 0
% 1.37/1.61 % res_moves_from_active_to_pass: 0
% 1.37/1.61
% 1.37/1.61 % Status Unknown
% 1.47/1.65 % Orienting using strategy ClausalAll
% 1.47/1.65 % Orientation found
% 1.47/1.65 % 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_067e25.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_0f8ed6 | grep -v "SZS"
% 1.47/1.67
% 1.47/1.67 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.47/1.67
% 1.47/1.67 %
% 1.47/1.67 % ------ iProver source info
% 1.47/1.67
% 1.47/1.67 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.47/1.67 % git: non_committed_changes: true
% 1.47/1.67 % git: last_make_outside_of_git: true
% 1.47/1.67
% 1.47/1.67 %
% 1.47/1.67 % ------ Input Options
% 1.47/1.67
% 1.47/1.67 % --out_options all
% 1.47/1.67 % --tptp_safe_out true
% 1.47/1.67 % --problem_path ""
% 1.47/1.67 % --include_path ""
% 1.47/1.67 % --clausifier .//eprover
% 1.47/1.67 % --clausifier_options --tstp-format
% 1.47/1.67 % --stdin false
% 1.47/1.67 % --dbg_backtrace false
% 1.47/1.67 % --dbg_dump_prop_clauses false
% 1.47/1.67 % --dbg_dump_prop_clauses_file -
% 1.47/1.67 % --dbg_out_stat false
% 1.47/1.67
% 1.47/1.67 % ------ General Options
% 1.47/1.67
% 1.47/1.67 % --fof false
% 1.47/1.67 % --time_out_real 150.
% 1.47/1.67 % --time_out_prep_mult 0.2
% 1.47/1.67 % --time_out_virtual -1.
% 1.47/1.67 % --schedule none
% 1.47/1.67 % --ground_splitting input
% 1.47/1.67 % --splitting_nvd 16
% 1.47/1.67 % --non_eq_to_eq false
% 1.47/1.67 % --prep_gs_sim true
% 1.47/1.67 % --prep_unflatten false
% 1.47/1.67 % --prep_res_sim true
% 1.47/1.67 % --prep_upred true
% 1.47/1.67 % --res_sim_input true
% 1.47/1.67 % --clause_weak_htbl true
% 1.47/1.67 % --gc_record_bc_elim false
% 1.47/1.67 % --symbol_type_check false
% 1.47/1.67 % --clausify_out false
% 1.47/1.67 % --large_theory_mode false
% 1.47/1.67 % --prep_sem_filter none
% 1.47/1.67 % --prep_sem_filter_out false
% 1.47/1.67 % --preprocessed_out false
% 1.47/1.67 % --sub_typing false
% 1.47/1.67 % --brand_transform false
% 1.47/1.67 % --pure_diseq_elim true
% 1.47/1.67 % --min_unsat_core false
% 1.47/1.67 % --pred_elim true
% 1.47/1.67 % --add_important_lit false
% 1.47/1.67 % --soft_assumptions false
% 1.47/1.67 % --reset_solvers false
% 1.47/1.67 % --bc_imp_inh []
% 1.47/1.67 % --conj_cone_tolerance 1.5
% 1.47/1.67 % --prolific_symb_bound 500
% 1.47/1.67 % --lt_threshold 2000
% 1.47/1.67
% 1.47/1.67 % ------ SAT Options
% 1.47/1.67
% 1.47/1.67 % --sat_mode false
% 1.47/1.67 % --sat_fm_restart_options ""
% 1.47/1.67 % --sat_gr_def false
% 1.47/1.67 % --sat_epr_types true
% 1.47/1.67 % --sat_non_cyclic_types false
% 1.47/1.67 % --sat_finite_models false
% 1.47/1.67 % --sat_fm_lemmas false
% 1.47/1.67 % --sat_fm_prep false
% 1.47/1.67 % --sat_fm_uc_incr true
% 1.47/1.67 % --sat_out_model small
% 1.47/1.67 % --sat_out_clauses false
% 1.47/1.67
% 1.47/1.67 % ------ QBF Options
% 1.47/1.67
% 1.47/1.67 % --qbf_mode false
% 1.47/1.67 % --qbf_elim_univ true
% 1.47/1.67 % --qbf_sk_in true
% 1.47/1.67 % --qbf_pred_elim true
% 1.47/1.67 % --qbf_split 32
% 1.47/1.67
% 1.47/1.67 % ------ BMC1 Options
% 1.47/1.67
% 1.47/1.67 % --bmc1_incremental false
% 1.47/1.67 % --bmc1_axioms reachable_all
% 1.47/1.67 % --bmc1_min_bound 0
% 1.47/1.67 % --bmc1_max_bound -1
% 1.47/1.67 % --bmc1_max_bound_default -1
% 1.47/1.67 % --bmc1_symbol_reachability true
% 1.47/1.67 % --bmc1_property_lemmas false
% 1.47/1.67 % --bmc1_k_induction false
% 1.47/1.67 % --bmc1_non_equiv_states false
% 1.47/1.67 % --bmc1_deadlock false
% 1.47/1.67 % --bmc1_ucm false
% 1.47/1.67 % --bmc1_add_unsat_core none
% 1.47/1.67 % --bmc1_unsat_core_children false
% 1.47/1.67 % --bmc1_unsat_core_extrapolate_axioms false
% 1.47/1.67 % --bmc1_out_stat full
% 1.47/1.67 % --bmc1_ground_init false
% 1.47/1.67 % --bmc1_pre_inst_next_state false
% 1.47/1.67 % --bmc1_pre_inst_state false
% 1.47/1.67 % --bmc1_pre_inst_reach_state false
% 1.47/1.67 % --bmc1_out_unsat_core false
% 1.47/1.67 % --bmc1_aig_witness_out false
% 1.47/1.67 % --bmc1_verbose false
% 1.47/1.67 % --bmc1_dump_clauses_tptp false
% 1.51/1.80 % --bmc1_dump_unsat_core_tptp false
% 1.51/1.80 % --bmc1_dump_file -
% 1.51/1.80 % --bmc1_ucm_expand_uc_limit 128
% 1.51/1.80 % --bmc1_ucm_n_expand_iterations 6
% 1.51/1.80 % --bmc1_ucm_extend_mode 1
% 1.51/1.80 % --bmc1_ucm_init_mode 2
% 1.51/1.80 % --bmc1_ucm_cone_mode none
% 1.51/1.80 % --bmc1_ucm_reduced_relation_type 0
% 1.51/1.80 % --bmc1_ucm_relax_model 4
% 1.51/1.80 % --bmc1_ucm_full_tr_after_sat true
% 1.51/1.80 % --bmc1_ucm_expand_neg_assumptions false
% 1.51/1.80 % --bmc1_ucm_layered_model none
% 1.51/1.80 % --bmc1_ucm_max_lemma_size 10
% 1.51/1.80
% 1.51/1.80 % ------ AIG Options
% 1.51/1.80
% 1.51/1.80 % --aig_mode false
% 1.51/1.80
% 1.51/1.80 % ------ Instantiation Options
% 1.51/1.80
% 1.51/1.80 % --instantiation_flag true
% 1.51/1.80 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.51/1.80 % --inst_solver_per_active 750
% 1.51/1.80 % --inst_solver_calls_frac 0.5
% 1.51/1.80 % --inst_passive_queue_type priority_queues
% 1.51/1.80 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.51/1.80 % --inst_passive_queues_freq [25;2]
% 1.51/1.80 % --inst_dismatching true
% 1.51/1.80 % --inst_eager_unprocessed_to_passive true
% 1.51/1.80 % --inst_prop_sim_given true
% 1.51/1.80 % --inst_prop_sim_new false
% 1.51/1.80 % --inst_orphan_elimination true
% 1.51/1.80 % --inst_learning_loop_flag true
% 1.51/1.80 % --inst_learning_start 3000
% 1.51/1.80 % --inst_learning_factor 2
% 1.51/1.80 % --inst_start_prop_sim_after_learn 3
% 1.51/1.80 % --inst_sel_renew solver
% 1.51/1.80 % --inst_lit_activity_flag true
% 1.51/1.80 % --inst_out_proof true
% 1.51/1.80
% 1.51/1.80 % ------ Resolution Options
% 1.51/1.80
% 1.51/1.80 % --resolution_flag true
% 1.51/1.80 % --res_lit_sel kbo_max
% 1.51/1.80 % --res_to_prop_solver none
% 1.51/1.80 % --res_prop_simpl_new false
% 1.51/1.80 % --res_prop_simpl_given false
% 1.51/1.80 % --res_passive_queue_type priority_queues
% 1.51/1.80 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.51/1.80 % --res_passive_queues_freq [15;5]
% 1.51/1.80 % --res_forward_subs full
% 1.51/1.80 % --res_backward_subs full
% 1.51/1.80 % --res_forward_subs_resolution true
% 1.51/1.80 % --res_backward_subs_resolution true
% 1.51/1.80 % --res_orphan_elimination false
% 1.51/1.80 % --res_time_limit 1000.
% 1.51/1.80 % --res_out_proof true
% 1.51/1.80 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_067e25.s
% 1.51/1.80 % --modulo true
% 1.51/1.80
% 1.51/1.80 % ------ Combination Options
% 1.51/1.80
% 1.51/1.80 % --comb_res_mult 1000
% 1.51/1.80 % --comb_inst_mult 300
% 1.51/1.80 % ------
% 1.51/1.80
% 1.51/1.80 % ------ Parsing...% successful
% 1.51/1.80
% 1.51/1.80 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 1.51/1.80
% 1.51/1.80 % ------ Proving...
% 1.51/1.80 % ------ Problem Properties
% 1.51/1.80
% 1.51/1.80 %
% 1.51/1.80 % EPR false
% 1.51/1.80 % Horn false
% 1.51/1.80 % Has equality true
% 1.51/1.80
% 1.51/1.80 % % ------ Input Options Time Limit: Unbounded
% 1.51/1.80
% 1.51/1.80
% 1.51/1.80 Compiling...
% 1.51/1.80 Loading plugin: done.
% 1.51/1.80 % % ------ Current options:
% 1.51/1.80
% 1.51/1.80 % ------ Input Options
% 1.51/1.80
% 1.51/1.80 % --out_options all
% 1.51/1.80 % --tptp_safe_out true
% 1.51/1.80 % --problem_path ""
% 1.51/1.80 % --include_path ""
% 1.51/1.80 % --clausifier .//eprover
% 1.51/1.80 % --clausifier_options --tstp-format
% 1.51/1.80 % --stdin false
% 1.51/1.80 % --dbg_backtrace false
% 1.51/1.80 % --dbg_dump_prop_clauses false
% 1.51/1.80 % --dbg_dump_prop_clauses_file -
% 1.51/1.80 % --dbg_out_stat false
% 1.51/1.80
% 1.51/1.80 % ------ General Options
% 1.51/1.80
% 1.51/1.80 % --fof false
% 1.51/1.80 % --time_out_real 150.
% 1.51/1.80 % --time_out_prep_mult 0.2
% 1.51/1.80 % --time_out_virtual -1.
% 1.51/1.80 % --schedule none
% 1.51/1.80 % --ground_splitting input
% 1.51/1.80 % --splitting_nvd 16
% 1.51/1.80 % --non_eq_to_eq false
% 1.51/1.80 % --prep_gs_sim true
% 1.51/1.80 % --prep_unflatten false
% 1.51/1.80 % --prep_res_sim true
% 1.51/1.80 % --prep_upred true
% 1.51/1.80 % --res_sim_input true
% 1.51/1.80 % --clause_weak_htbl true
% 1.51/1.80 % --gc_record_bc_elim false
% 1.51/1.80 % --symbol_type_check false
% 1.51/1.80 % --clausify_out false
% 1.51/1.80 % --large_theory_mode false
% 1.51/1.80 % --prep_sem_filter none
% 1.51/1.80 % --prep_sem_filter_out false
% 1.51/1.80 % --preprocessed_out false
% 1.51/1.80 % --sub_typing false
% 1.51/1.80 % --brand_transform false
% 1.51/1.80 % --pure_diseq_elim true
% 1.51/1.80 % --min_unsat_core false
% 1.51/1.80 % --pred_elim true
% 1.51/1.80 % --add_important_lit false
% 1.51/1.80 % --soft_assumptions false
% 1.51/1.80 % --reset_solvers false
% 1.51/1.80 % --bc_imp_inh []
% 1.51/1.80 % --conj_cone_tolerance 1.5
% 1.51/1.80 % --prolific_symb_bound 500
% 1.51/1.80 % --lt_threshold 2000
% 1.51/1.80
% 1.51/1.80 % ------ SAT Options
% 1.51/1.80
% 1.51/1.80 % --sat_mode false
% 1.51/1.80 % --sat_fm_restart_options ""
% 1.51/1.80 % --sat_gr_def false
% 1.51/1.80 % --sat_epr_types true
% 1.51/1.80 % --sat_non_cyclic_types false
% 1.51/1.80 % --sat_finite_models false
% 1.51/1.80 % --sat_fm_lemmas false
% 1.51/1.80 % --sat_fm_prep false
% 1.51/1.80 % --sat_fm_uc_incr true
% 1.51/1.80 % --sat_out_model small
% 1.51/1.80 % --sat_out_clauses false
% 1.51/1.80
% 1.51/1.80 % ------ QBF Options
% 1.51/1.80
% 1.51/1.80 % --qbf_mode false
% 1.51/1.80 % --qbf_elim_univ true
% 1.51/1.80 % --qbf_sk_in true
% 1.51/1.80 % --qbf_pred_elim true
% 1.51/1.80 % --qbf_split 32
% 1.51/1.80
% 1.51/1.80 % ------ BMC1 Options
% 1.51/1.80
% 1.51/1.80 % --bmc1_incremental false
% 1.51/1.80 % --bmc1_axioms reachable_all
% 1.51/1.80 % --bmc1_min_bound 0
% 1.51/1.80 % --bmc1_max_bound -1
% 1.51/1.80 % --bmc1_max_bound_default -1
% 1.51/1.80 % --bmc1_symbol_reachability true
% 1.51/1.80 % --bmc1_property_lemmas false
% 1.51/1.80 % --bmc1_k_induction false
% 1.51/1.80 % --bmc1_non_equiv_states false
% 1.51/1.80 % --bmc1_deadlock false
% 1.51/1.80 % --bmc1_ucm false
% 1.51/1.80 % --bmc1_add_unsat_core none
% 1.51/1.80 % --bmc1_unsat_core_children false
% 1.51/1.80 % --bmc1_unsat_core_extrapolate_axioms false
% 1.51/1.80 % --bmc1_out_stat full
% 1.51/1.80 % --bmc1_ground_init false
% 1.51/1.80 % --bmc1_pre_inst_next_state false
% 1.51/1.80 % --bmc1_pre_inst_state false
% 1.51/1.80 % --bmc1_pre_inst_reach_state false
% 1.51/1.80 % --bmc1_out_unsat_core false
% 1.51/1.80 % --bmc1_aig_witness_out false
% 1.51/1.80 % --bmc1_verbose false
% 1.51/1.80 % --bmc1_dump_clauses_tptp false
% 1.51/1.80 % --bmc1_dump_unsat_core_tptp false
% 1.51/1.80 % --bmc1_dump_file -
% 1.51/1.80 % --bmc1_ucm_expand_uc_limit 128
% 1.51/1.80 % --bmc1_ucm_n_expand_iterations 6
% 1.51/1.80 % --bmc1_ucm_extend_mode 1
% 1.51/1.80 % --bmc1_ucm_init_mode 2
% 1.51/1.80 % --bmc1_ucm_cone_mode none
% 1.51/1.80 % --bmc1_ucm_reduced_relation_type 0
% 1.51/1.80 % --bmc1_ucm_relax_model 4
% 1.51/1.80 % --bmc1_ucm_full_tr_after_sat true
% 1.51/1.80 % --bmc1_ucm_expand_neg_assumptions false
% 1.51/1.80 % --bmc1_ucm_layered_model none
% 1.51/1.80 % --bmc1_ucm_max_lemma_size 10
% 1.51/1.80
% 1.51/1.80 % ------ AIG Options
% 1.51/1.80
% 1.51/1.80 % --aig_mode false
% 1.51/1.80
% 1.51/1.80 % ------ Instantiation Options
% 1.51/1.80
% 1.51/1.80 % --instantiation_flag true
% 1.51/1.80 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.51/1.80 % --inst_solver_per_active 750
% 1.51/1.80 % --inst_solver_calls_frac 0.5
% 1.51/1.80 % --inst_passive_queue_type priority_queues
% 1.51/1.80 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.51/1.80 % --inst_passive_queues_freq [25;2]
% 1.51/1.80 % --inst_dismatching true
% 1.51/1.80 % --inst_eager_unprocessed_to_passive true
% 1.51/1.80 % --inst_prop_sim_given true
% 1.51/1.80 % --inst_prop_sim_new false
% 1.51/1.80 % --inst_orphan_elimination true
% 1.51/1.80 % --inst_learning_loop_flag true
% 1.51/1.80 % --inst_learning_start 3000
% 1.51/1.80 % --inst_learning_factor 2
% 1.51/1.80 % --inst_start_prop_sim_after_learn 3
% 1.51/1.80 % --inst_sel_renew solver
% 1.51/1.80 % --inst_lit_activity_flag true
% 1.51/1.80 % --inst_out_proof true
% 1.51/1.80
% 1.51/1.80 % ------ Resolution Options
% 1.51/1.80
% 1.51/1.80 % --resolution_flag true
% 1.51/1.80 % --res_lit_sel kbo_max
% 1.51/1.80 % --res_to_prop_solver none
% 1.51/1.80 % --res_prop_simpl_new false
% 1.51/1.80 % --res_prop_simpl_given false
% 1.51/1.80 % --res_passive_queue_type priority_queues
% 1.51/1.80 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.51/1.80 % --res_passive_queues_freq [15;5]
% 1.51/1.80 % --res_forward_subs full
% 1.51/1.80 % --res_backward_subs full
% 1.51/1.80 % --res_forward_subs_resolution true
% 1.51/1.80 % --res_backward_subs_resolution true
% 1.51/1.80 % --res_orphan_elimination false
% 1.51/1.80 % --res_time_limit 1000.
% 1.51/1.80 % --res_out_proof true
% 1.51/1.80 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_067e25.s
% 1.51/1.80 % --modulo true
% 1.51/1.80
% 1.51/1.80 % ------ Combination Options
% 1.51/1.80
% 1.51/1.80 % --comb_res_mult 1000
% 1.51/1.80 % --comb_inst_mult 300
% 1.51/1.80 % ------
% 1.51/1.80
% 1.51/1.80
% 1.51/1.80
% 1.51/1.80 % ------ Proving...
% 1.51/1.80 % warning: shown sat in sat incomplete mode
% 1.51/1.80 %
% 1.51/1.80
% 1.51/1.80
% 1.51/1.80
% 1.51/1.80
% 1.51/1.80 cnf(c_27,plain,
% 1.51/1.80 ( nil != x1 ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_39) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_50,plain,( nil != x1 ),inference(copy,[status(esa)],[c_27]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_64,plain,( nil != x1 ),inference(copy,[status(esa)],[c_50]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_67,plain,( nil != x1 ),inference(copy,[status(esa)],[c_64]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_80,plain,( nil != x1 ),inference(copy,[status(esa)],[c_67]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_164,plain,( nil != x1 ),inference(copy,[status(esa)],[c_80]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_10,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X1 | X0 = X2 ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_48_0) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_130,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X1 | X0 = X2 ),
% 1.51/1.80 inference(copy,[status(esa)],[c_10]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_214,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(nil,X0),sep(lseg(nil,x1),X1))) | nil = X0 ),
% 1.51/1.80 inference(resolution,[status(thm)],[c_164,c_130]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_215,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(nil,X0),sep(lseg(nil,x1),X1))) | nil = X0 ),
% 1.51/1.80 inference(rewriting,[status(thm)],[c_214]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_26,plain,
% 1.51/1.80 ( x2 != nil ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_38) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_48,plain,( x2 != nil ),inference(copy,[status(esa)],[c_26]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_63,plain,( x2 != nil ),inference(copy,[status(esa)],[c_48]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_68,plain,( x2 != nil ),inference(copy,[status(esa)],[c_63]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_79,plain,( x2 != nil ),inference(copy,[status(esa)],[c_68]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_162,plain,( x2 != nil ),inference(copy,[status(esa)],[c_79]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_206,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(x2,X0),sep(lseg(x2,nil),X1))) | x2 = X0 ),
% 1.51/1.80 inference(resolution,[status(thm)],[c_162,c_130]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_207,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(x2,X0),sep(lseg(x2,nil),X1))) | x2 = X0 ),
% 1.51/1.80 inference(rewriting,[status(thm)],[c_206]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_25,plain,
% 1.51/1.80 ( x3 != nil ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_37) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_46,plain,( x3 != nil ),inference(copy,[status(esa)],[c_25]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_62,plain,( x3 != nil ),inference(copy,[status(esa)],[c_46]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_69,plain,( x3 != nil ),inference(copy,[status(esa)],[c_62]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_78,plain,( x3 != nil ),inference(copy,[status(esa)],[c_69]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_160,plain,( x3 != nil ),inference(copy,[status(esa)],[c_78]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_198,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(x3,X0),sep(lseg(x3,nil),X1))) | x3 = X0 ),
% 1.51/1.80 inference(resolution,[status(thm)],[c_160,c_130]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_199,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(x3,X0),sep(lseg(x3,nil),X1))) | x3 = X0 ),
% 1.51/1.80 inference(rewriting,[status(thm)],[c_198]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_23,plain,
% 1.51/1.80 ( x3 != x2 ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_35) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_42,plain,( x3 != x2 ),inference(copy,[status(esa)],[c_23]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_60,plain,( x3 != x2 ),inference(copy,[status(esa)],[c_42]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_71,plain,( x3 != x2 ),inference(copy,[status(esa)],[c_60]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_76,plain,( x3 != x2 ),inference(copy,[status(esa)],[c_71]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_156,plain,( x3 != x2 ),inference(copy,[status(esa)],[c_76]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_190,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(x3,X0),sep(lseg(x3,x2),X1))) | x3 = X0 ),
% 1.51/1.80 inference(resolution,[status(thm)],[c_156,c_130]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_191,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(x3,X0),sep(lseg(x3,x2),X1))) | x3 = X0 ),
% 1.51/1.80 inference(rewriting,[status(thm)],[c_190]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_24,plain,
% 1.51/1.80 ( x4 != nil ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_36) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_44,plain,( x4 != nil ),inference(copy,[status(esa)],[c_24]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_61,plain,( x4 != nil ),inference(copy,[status(esa)],[c_44]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_70,plain,( x4 != nil ),inference(copy,[status(esa)],[c_61]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_77,plain,( x4 != nil ),inference(copy,[status(esa)],[c_70]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_158,plain,( x4 != nil ),inference(copy,[status(esa)],[c_77]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_176,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(x4,X0),sep(lseg(x4,nil),X1))) | x4 = X0 ),
% 1.51/1.80 inference(resolution,[status(thm)],[c_158,c_130]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_177,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(x4,X0),sep(lseg(x4,nil),X1))) | x4 = X0 ),
% 1.51/1.80 inference(rewriting,[status(thm)],[c_176]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_22,plain,
% 1.51/1.80 ( x4 != x2 ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_34) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_40,plain,( x4 != x2 ),inference(copy,[status(esa)],[c_22]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_59,plain,( x4 != x2 ),inference(copy,[status(esa)],[c_40]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_72,plain,( x4 != x2 ),inference(copy,[status(esa)],[c_59]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_75,plain,( x4 != x2 ),inference(copy,[status(esa)],[c_72]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_154,plain,( x4 != x2 ),inference(copy,[status(esa)],[c_75]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_172,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(x4,X0),sep(lseg(x4,x2),X1))) | x4 = X0 ),
% 1.51/1.80 inference(resolution,[status(thm)],[c_154,c_130]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_173,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(x4,X0),sep(lseg(x4,x2),X1))) | x4 = X0 ),
% 1.51/1.80 inference(rewriting,[status(thm)],[c_172]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_13,plain,
% 1.51/1.80 ( heap(sep(lseg(X0,X1),X2))
% 1.51/1.80 | X0 = X3
% 1.51/1.80 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))) ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_46_2) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_136,plain,
% 1.51/1.80 ( heap(sep(lseg(X0,X1),X2))
% 1.51/1.80 | X0 = X3
% 1.51/1.80 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_13]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_137,plain,
% 1.51/1.80 ( heap(sep(lseg(X0,X1),X2))
% 1.51/1.80 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2)))
% 1.51/1.80 | X0 = X3 ),
% 1.51/1.80 inference(rewriting,[status(thm)],[c_136]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_28,plain,
% 1.51/1.80 ( heap(sep(lseg(x1,x4),sep(next(x4,x1),emp))) ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_33) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_52,plain,
% 1.51/1.80 ( heap(sep(lseg(x1,x4),sep(next(x4,x1),emp))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_28]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_65,plain,
% 1.51/1.80 ( heap(sep(lseg(x1,x4),sep(next(x4,x1),emp))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_52]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_66,plain,
% 1.51/1.80 ( heap(sep(lseg(x1,x4),sep(next(x4,x1),emp))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_65]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_81,plain,
% 1.51/1.80 ( heap(sep(lseg(x1,x4),sep(next(x4,x1),emp))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_66]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_166,plain,
% 1.51/1.80 ( heap(sep(lseg(x1,x4),sep(next(x4,x1),emp))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_81]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_21,negated_conjecture,
% 1.51/1.80 ( ~ heap(sep(lseg(x5,x4),sep(next(x4,x5),emp))) ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_32) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_54,negated_conjecture,
% 1.51/1.80 ( ~ heap(sep(lseg(x5,x4),sep(next(x4,x5),emp))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_21]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_58,negated_conjecture,
% 1.51/1.80 ( ~ heap(sep(lseg(x5,x4),sep(next(x4,x5),emp))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_54]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_73,negated_conjecture,
% 1.51/1.80 ( ~ heap(sep(lseg(x5,x4),sep(next(x4,x5),emp))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_58]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_74,negated_conjecture,
% 1.51/1.80 ( ~ heap(sep(lseg(x5,x4),sep(next(x4,x5),emp))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_73]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_152,negated_conjecture,
% 1.51/1.80 ( ~ heap(sep(lseg(x5,x4),sep(next(x4,x5),emp))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_74]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_18,plain,
% 1.51/1.80 ( heap(sep(lseg(X0,X1),sep(lseg(X1,X2),X3)))
% 1.51/1.80 | X1 = X2
% 1.51/1.80 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(lseg(X1,X2),X3)))) ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_44_2) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_146,plain,
% 1.51/1.80 ( heap(sep(lseg(X0,X1),sep(lseg(X1,X2),X3)))
% 1.51/1.80 | X1 = X2
% 1.51/1.80 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(lseg(X1,X2),X3)))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_18]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_147,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(lseg(X2,X3),X4))))
% 1.51/1.80 | heap(sep(lseg(X0,X2),sep(lseg(X2,X3),X4)))
% 1.51/1.80 | X2 = X3 ),
% 1.51/1.80 inference(rewriting,[status(thm)],[c_146]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_16,plain,
% 1.51/1.80 ( heap(sep(lseg(X0,X1),sep(next(X1,X2),X3)))
% 1.51/1.80 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(next(X1,X2),X3)))) ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_45_1) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_142,plain,
% 1.51/1.80 ( heap(sep(lseg(X0,X1),sep(next(X1,X2),X3)))
% 1.51/1.80 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(next(X1,X2),X3)))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_16]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_143,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(next(X2,X3),X4))))
% 1.51/1.80 | heap(sep(lseg(X0,X2),sep(next(X2,X3),X4))) ),
% 1.51/1.80 inference(rewriting,[status(thm)],[c_142]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_11,plain,
% 1.51/1.80 ( heap(sep(lseg(X0,nil),X1))
% 1.51/1.80 | ~ heap(sep(lseg(X0,X2),sep(lseg(X2,nil),X1))) ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_47_1) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_132,plain,
% 1.51/1.80 ( heap(sep(lseg(X0,nil),X1))
% 1.51/1.80 | ~ heap(sep(lseg(X0,X2),sep(lseg(X2,nil),X1))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_11]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_8,plain,
% 1.51/1.80 ( X0 = X1 | X0 = X2 | ~ heap(sep(lseg(X0,X2),sep(lseg(X0,X1),X3))) ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_48_2) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_126,plain,
% 1.51/1.80 ( X0 = X1 | X0 = X2 | ~ heap(sep(lseg(X0,X2),sep(lseg(X0,X1),X3))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_8]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_127,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X2 | X0 = X1 ),
% 1.51/1.80 inference(rewriting,[status(thm)],[c_126]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_6,plain,
% 1.51/1.80 ( X0 = X1 | ~ heap(sep(next(X0,X2),sep(lseg(X0,X1),X3))) ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_49_1) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_122,plain,
% 1.51/1.80 ( X0 = X1 | ~ heap(sep(next(X0,X2),sep(lseg(X0,X1),X3))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_6]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_123,plain,
% 1.51/1.80 ( ~ heap(sep(next(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X2 ),
% 1.51/1.80 inference(rewriting,[status(thm)],[c_122]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_4,plain,
% 1.51/1.80 ( X0 = nil | ~ heap(sep(lseg(nil,X0),X1)) ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_51_1) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_118,plain,
% 1.51/1.80 ( X0 = nil | ~ heap(sep(lseg(nil,X0),X1)) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_4]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_119,plain,
% 1.51/1.80 ( ~ heap(sep(lseg(nil,X0),X1)) | X0 = nil ),
% 1.51/1.80 inference(rewriting,[status(thm)],[c_118]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_3,plain,
% 1.51/1.80 ( ~ heap(sep(next(X0,X1),sep(next(X0,X2),X3))) ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_50_0) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_116,plain,
% 1.51/1.80 ( ~ heap(sep(next(X0,X1),sep(next(X0,X2),X3))) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_3]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_2,plain,
% 1.51/1.80 ( ~ heap(sep(next(nil,X0),X1)) ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_52_0) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_114,plain,
% 1.51/1.80 ( ~ heap(sep(next(nil,X0),X1)) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_2]) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_1,plain,
% 1.51/1.80 ( sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)) ),
% 1.51/1.80 file('/export/starexec/sandbox/tmp/iprover_modulo_7fbf8c.p', c_0_53_0) ).
% 1.51/1.80
% 1.51/1.80 cnf(c_112,plain,
% 1.51/1.80 ( sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)) ),
% 1.51/1.80 inference(copy,[status(esa)],[c_1]) ).
% 1.51/1.80
% 1.51/1.80
% 1.51/1.80
% 1.51/1.80 % ------ Statistics
% 1.51/1.80
% 1.51/1.80 % ------ General
% 1.51/1.80
% 1.51/1.80 % num_of_input_clauses: 29
% 1.51/1.80 % num_of_input_neg_conjectures: 1
% 1.51/1.80 % num_of_splits: 0
% 1.51/1.80 % num_of_split_atoms: 0
% 1.51/1.80 % num_of_sem_filtered_clauses: 0
% 1.51/1.80 % num_of_subtypes: 0
% 1.51/1.80 % monotx_restored_types: 0
% 1.51/1.80 % sat_num_of_epr_types: 0
% 1.51/1.80 % sat_num_of_non_cyclic_types: 0
% 1.51/1.80 % sat_guarded_non_collapsed_types: 0
% 1.51/1.80 % is_epr: 0
% 1.51/1.80 % is_horn: 0
% 1.51/1.80 % has_eq: 1
% 1.51/1.80 % num_pure_diseq_elim: 0
% 1.51/1.80 % simp_replaced_by: 0
% 1.51/1.80 % res_preprocessed: 9
% 1.51/1.80 % prep_upred: 0
% 1.51/1.80 % prep_unflattend: 0
% 1.51/1.80 % pred_elim_cands: 0
% 1.51/1.80 % pred_elim: 0
% 1.51/1.80 % pred_elim_cl: 0
% 1.51/1.80 % pred_elim_cycles: 0
% 1.51/1.80 % forced_gc_time: 0
% 1.51/1.80 % gc_basic_clause_elim: 0
% 1.51/1.80 % parsing_time: 0.
% 1.51/1.80 % sem_filter_time: 0.
% 1.51/1.80 % pred_elim_time: 0.
% 1.51/1.80 % out_proof_time: 0.
% 1.51/1.80 % monotx_time: 0.
% 1.51/1.80 % subtype_inf_time: 0.
% 1.51/1.80 % unif_index_cands_time: 0.
% 1.51/1.80 % unif_index_add_time: 0.
% 1.51/1.80 % total_time: 0.144
% 1.51/1.80 % num_of_symbols: 36
% 1.51/1.80 % num_of_terms: 220
% 1.51/1.80
% 1.51/1.80 % ------ Propositional Solver
% 1.51/1.80
% 1.51/1.80 % prop_solver_calls: 1
% 1.51/1.80 % prop_fast_solver_calls: 17
% 1.51/1.80 % prop_num_of_clauses: 36
% 1.51/1.80 % prop_preprocess_simplified: 107
% 1.51/1.80 % prop_fo_subsumed: 0
% 1.51/1.80 % prop_solver_time: 0.
% 1.51/1.80 % prop_fast_solver_time: 0.
% 1.51/1.80 % prop_unsat_core_time: 0.
% 1.51/1.80
% 1.51/1.80 % ------ QBF
% 1.51/1.80
% 1.51/1.80 % qbf_q_res: 0
% 1.51/1.80 % qbf_num_tautologies: 0
% 1.51/1.80 % qbf_prep_cycles: 0
% 1.51/1.80
% 1.51/1.80 % ------ BMC1
% 1.51/1.80
% 1.51/1.80 % bmc1_current_bound: -1
% 1.51/1.80 % bmc1_last_solved_bound: -1
% 1.51/1.80 % bmc1_unsat_core_size: -1
% 1.51/1.80 % bmc1_unsat_core_parents_size: -1
% 1.51/1.80 % bmc1_merge_next_fun: 0
% 1.51/1.80 % bmc1_unsat_core_clauses_time: 0.
% 1.51/1.80
% 1.51/1.80 % ------ Instantiation
% 1.51/1.80
% 1.51/1.80 % inst_num_of_clauses: 29
% 1.51/1.80 % inst_num_in_passive: 0
% 1.51/1.80 % inst_num_in_active: 0
% 1.51/1.80 % inst_num_in_unprocessed: 29
% 1.51/1.80 % inst_num_of_loops: 0
% 1.51/1.80 % inst_num_of_learning_restarts: 0
% 1.51/1.80 % inst_num_moves_active_passive: 0
% 1.51/1.80 % inst_lit_activity: 0
% 1.51/1.80 % inst_lit_activity_moves: 0
% 1.51/1.80 % inst_num_tautologies: 0
% 1.51/1.80 % inst_num_prop_implied: 0
% 1.51/1.80 % inst_num_existing_simplified: 0
% 1.51/1.80 % inst_num_eq_res_simplified: 0
% 1.51/1.80 % inst_num_child_elim: 0
% 1.51/1.80 % inst_num_of_dismatching_blockings: 0
% 1.51/1.80 % inst_num_of_non_proper_insts: 0
% 1.51/1.80 % inst_num_of_duplicates: 0
% 1.51/1.80 % inst_inst_num_from_inst_to_res: 0
% 1.51/1.80 % inst_dismatching_checking_time: 0.
% 1.51/1.80
% 1.51/1.80 % ------ Resolution
% 1.51/1.80
% 1.51/1.80 % res_num_of_clauses: 36
% 1.51/1.80 % res_num_in_passive: 0
% 1.51/1.80 % res_num_in_active: 25
% 1.51/1.80 % res_num_of_loops: 15
% 1.51/1.80 % res_forward_subset_subsumed: 9
% 1.51/1.80 % res_backward_subset_subsumed: 0
% 1.51/1.80 % res_forward_subsumed: 0
% 1.51/1.80 % res_backward_subsumed: 0
% 1.51/1.80 % res_forward_subsumption_resolution: 0
% 1.51/1.80 % res_backward_subsumption_resolution: 0
% 1.51/1.80 % res_clause_to_clause_subsumption: 1
% 1.51/1.80 % res_orphan_elimination: 0
% 1.51/1.80 % res_tautology_del: 0
% 1.51/1.80 % res_num_eq_res_simplified: 0
% 1.51/1.80 % res_num_sel_changes: 0
% 1.51/1.80 % res_moves_from_active_to_pass: 0
% 1.51/1.80
% 1.51/1.80 % Status Unknown
% 1.51/1.80 % Last status :
% 1.51/1.80 % SZS status Unknown
%------------------------------------------------------------------------------