TSTP Solution File: SWW445-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWW445-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:55 EDT 2022
% Result : Unknown 2.25s 2.44s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW445-1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 6 05:48:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % Orientation found
% 0.20/0.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_996b1a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_9823e1.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_d68a58 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.36/0.54 % --bmc1_dump_unsat_core_tptp false
% 0.36/0.54 % --bmc1_dump_file -
% 0.36/0.54 % --bmc1_ucm_expand_uc_limit 128
% 0.36/0.54 % --bmc1_ucm_n_expand_iterations 6
% 0.36/0.54 % --bmc1_ucm_extend_mode 1
% 0.36/0.54 % --bmc1_ucm_init_mode 2
% 0.36/0.54 % --bmc1_ucm_cone_mode none
% 0.36/0.54 % --bmc1_ucm_reduced_relation_type 0
% 0.36/0.54 % --bmc1_ucm_relax_model 4
% 0.36/0.54 % --bmc1_ucm_full_tr_after_sat true
% 0.36/0.54 % --bmc1_ucm_expand_neg_assumptions false
% 0.36/0.54 % --bmc1_ucm_layered_model none
% 0.36/0.54 % --bmc1_ucm_max_lemma_size 10
% 0.36/0.54
% 0.36/0.54 % ------ AIG Options
% 0.36/0.54
% 0.36/0.54 % --aig_mode false
% 0.36/0.54
% 0.36/0.54 % ------ Instantiation Options
% 0.36/0.54
% 0.36/0.54 % --instantiation_flag true
% 0.36/0.54 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.36/0.54 % --inst_solver_per_active 750
% 0.36/0.54 % --inst_solver_calls_frac 0.5
% 0.36/0.54 % --inst_passive_queue_type priority_queues
% 0.36/0.54 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.36/0.54 % --inst_passive_queues_freq [25;2]
% 0.36/0.54 % --inst_dismatching true
% 0.36/0.54 % --inst_eager_unprocessed_to_passive true
% 0.36/0.54 % --inst_prop_sim_given true
% 0.36/0.54 % --inst_prop_sim_new false
% 0.36/0.54 % --inst_orphan_elimination true
% 0.36/0.54 % --inst_learning_loop_flag true
% 0.36/0.54 % --inst_learning_start 3000
% 0.36/0.54 % --inst_learning_factor 2
% 0.36/0.54 % --inst_start_prop_sim_after_learn 3
% 0.36/0.54 % --inst_sel_renew solver
% 0.36/0.54 % --inst_lit_activity_flag true
% 0.36/0.54 % --inst_out_proof true
% 0.36/0.54
% 0.36/0.54 % ------ Resolution Options
% 0.36/0.54
% 0.36/0.54 % --resolution_flag true
% 0.36/0.54 % --res_lit_sel kbo_max
% 0.36/0.54 % --res_to_prop_solver none
% 0.36/0.54 % --res_prop_simpl_new false
% 0.36/0.54 % --res_prop_simpl_given false
% 0.36/0.54 % --res_passive_queue_type priority_queues
% 0.36/0.54 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.36/0.54 % --res_passive_queues_freq [15;5]
% 0.36/0.54 % --res_forward_subs full
% 0.36/0.54 % --res_backward_subs full
% 0.36/0.54 % --res_forward_subs_resolution true
% 0.36/0.54 % --res_backward_subs_resolution true
% 0.36/0.54 % --res_orphan_elimination false
% 0.36/0.54 % --res_time_limit 1000.
% 0.36/0.54 % --res_out_proof true
% 0.36/0.54 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_996b1a.s
% 0.36/0.54 % --modulo true
% 0.36/0.54
% 0.36/0.54 % ------ Combination Options
% 0.36/0.54
% 0.36/0.54 % --comb_res_mult 1000
% 0.36/0.54 % --comb_inst_mult 300
% 0.36/0.54 % ------
% 0.36/0.54
% 0.36/0.54 % ------ Parsing...% successful
% 0.36/0.54
% 0.36/0.54 % ------ 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.36/0.54
% 0.36/0.54 % ------ Proving...
% 0.36/0.54 % ------ Problem Properties
% 0.36/0.54
% 0.36/0.54 %
% 0.36/0.54 % EPR false
% 0.36/0.54 % Horn false
% 0.36/0.54 % Has equality true
% 0.36/0.54
% 0.36/0.54 % % ------ Input Options Time Limit: Unbounded
% 0.36/0.54
% 0.36/0.54
% 0.36/0.54 Compiling...
% 0.36/0.54 Loading plugin: done.
% 0.36/0.54 % % ------ Current options:
% 0.36/0.54
% 0.36/0.54 % ------ Input Options
% 0.36/0.54
% 0.36/0.54 % --out_options all
% 0.36/0.54 % --tptp_safe_out true
% 0.36/0.54 % --problem_path ""
% 0.36/0.54 % --include_path ""
% 0.36/0.54 % --clausifier .//eprover
% 0.36/0.54 % --clausifier_options --tstp-format
% 0.36/0.54 % --stdin false
% 0.36/0.54 % --dbg_backtrace false
% 0.36/0.54 % --dbg_dump_prop_clauses false
% 0.36/0.54 % --dbg_dump_prop_clauses_file -
% 0.36/0.54 % --dbg_out_stat false
% 0.36/0.54
% 0.36/0.54 % ------ General Options
% 0.36/0.54
% 0.36/0.54 % --fof false
% 0.36/0.54 % --time_out_real 150.
% 0.36/0.54 % --time_out_prep_mult 0.2
% 0.36/0.54 % --time_out_virtual -1.
% 0.36/0.54 % --schedule none
% 0.36/0.54 % --ground_splitting input
% 0.36/0.54 % --splitting_nvd 16
% 0.36/0.54 % --non_eq_to_eq false
% 0.36/0.54 % --prep_gs_sim true
% 0.36/0.54 % --prep_unflatten false
% 0.36/0.54 % --prep_res_sim true
% 0.36/0.54 % --prep_upred true
% 0.36/0.54 % --res_sim_input true
% 0.36/0.54 % --clause_weak_htbl true
% 0.36/0.54 % --gc_record_bc_elim false
% 0.36/0.54 % --symbol_type_check false
% 0.36/0.54 % --clausify_out false
% 0.36/0.54 % --large_theory_mode false
% 0.36/0.54 % --prep_sem_filter none
% 0.36/0.54 % --prep_sem_filter_out false
% 0.36/0.54 % --preprocessed_out false
% 0.36/0.54 % --sub_typing false
% 0.36/0.54 % --brand_transform false
% 0.36/0.54 % --pure_diseq_elim true
% 0.36/0.54 % --min_unsat_core false
% 0.36/0.54 % --pred_elim true
% 0.36/0.54 % --add_important_lit false
% 0.36/0.54 % --soft_assumptions false
% 0.36/0.54 % --reset_solvers false
% 0.36/0.54 % --bc_imp_inh []
% 0.36/0.54 % --conj_cone_tolerance 1.5
% 0.36/0.54 % --prolific_symb_bound 500
% 0.36/0.54 % --lt_threshold 2000
% 0.36/0.54
% 0.36/0.54 % ------ SAT Options
% 0.36/0.54
% 0.36/0.54 % --sat_mode false
% 0.36/0.54 % --sat_fm_restart_options ""
% 0.36/0.54 % --sat_gr_def false
% 0.36/0.54 % --sat_epr_types true
% 0.36/0.54 % --sat_non_cyclic_types false
% 0.36/0.54 % --sat_finite_models false
% 0.36/0.54 % --sat_fm_lemmas false
% 0.36/0.54 % --sat_fm_prep false
% 0.36/0.54 % --sat_fm_uc_incr true
% 0.36/0.54 % --sat_out_model small
% 0.36/0.54 % --sat_out_clauses false
% 0.36/0.54
% 0.36/0.54 % ------ QBF Options
% 0.36/0.54
% 0.36/0.54 % --qbf_mode false
% 0.36/0.54 % --qbf_elim_univ true
% 0.36/0.54 % --qbf_sk_in true
% 0.36/0.54 % --qbf_pred_elim true
% 0.36/0.54 % --qbf_split 32
% 0.36/0.54
% 0.36/0.54 % ------ BMC1 Options
% 0.36/0.54
% 0.36/0.54 % --bmc1_incremental false
% 0.36/0.54 % --bmc1_axioms reachable_all
% 0.36/0.54 % --bmc1_min_bound 0
% 0.36/0.54 % --bmc1_max_bound -1
% 0.36/0.54 % --bmc1_max_bound_default -1
% 0.36/0.54 % --bmc1_symbol_reachability true
% 0.36/0.54 % --bmc1_property_lemmas false
% 0.36/0.54 % --bmc1_k_induction false
% 0.36/0.54 % --bmc1_non_equiv_states false
% 0.36/0.54 % --bmc1_deadlock false
% 0.36/0.54 % --bmc1_ucm false
% 0.36/0.54 % --bmc1_add_unsat_core none
% 0.36/0.54 % --bmc1_unsat_core_children false
% 0.36/0.54 % --bmc1_unsat_core_extrapolate_axioms false
% 0.36/0.54 % --bmc1_out_stat full
% 0.36/0.54 % --bmc1_ground_init false
% 0.36/0.54 % --bmc1_pre_inst_next_state false
% 0.36/0.54 % --bmc1_pre_inst_state false
% 0.36/0.54 % --bmc1_pre_inst_reach_state false
% 0.36/0.54 % --bmc1_out_unsat_core false
% 0.36/0.54 % --bmc1_aig_witness_out false
% 0.36/0.54 % --bmc1_verbose false
% 0.36/0.54 % --bmc1_dump_clauses_tptp false
% 0.36/0.54 % --bmc1_dump_unsat_core_tptp false
% 0.36/0.54 % --bmc1_dump_file -
% 0.36/0.54 % --bmc1_ucm_expand_uc_limit 128
% 0.36/0.54 % --bmc1_ucm_n_expand_iterations 6
% 0.36/0.54 % --bmc1_ucm_extend_mode 1
% 0.36/0.54 % --bmc1_ucm_init_mode 2
% 0.36/0.54 % --bmc1_ucm_cone_mode none
% 0.36/0.54 % --bmc1_ucm_reduced_relation_type 0
% 0.36/0.54 % --bmc1_ucm_relax_model 4
% 0.36/0.54 % --bmc1_ucm_full_tr_after_sat true
% 0.36/0.54 % --bmc1_ucm_expand_neg_assumptions false
% 0.36/0.54 % --bmc1_ucm_layered_model none
% 0.36/0.54 % --bmc1_ucm_max_lemma_size 10
% 0.36/0.54
% 0.36/0.54 % ------ AIG Options
% 0.36/0.54
% 0.36/0.54 % --aig_mode false
% 0.36/0.54
% 0.36/0.54 % ------ Instantiation Options
% 0.36/0.54
% 0.36/0.54 % --instantiation_flag true
% 0.36/0.54 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.36/0.54 % --inst_solver_per_active 750
% 0.36/0.54 % --inst_solver_calls_frac 0.5
% 0.36/0.54 % --inst_passive_queue_type priority_queues
% 0.36/0.54 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.36/0.54 % --inst_passive_queues_freq [25;2]
% 0.36/0.54 % --inst_dismatching true
% 0.36/0.54 % --inst_eager_unprocessed_to_passive true
% 1.99/2.23 % --inst_prop_sim_given true
% 1.99/2.23 % --inst_prop_sim_new false
% 1.99/2.23 % --inst_orphan_elimination true
% 1.99/2.23 % --inst_learning_loop_flag true
% 1.99/2.23 % --inst_learning_start 3000
% 1.99/2.23 % --inst_learning_factor 2
% 1.99/2.23 % --inst_start_prop_sim_after_learn 3
% 1.99/2.23 % --inst_sel_renew solver
% 1.99/2.23 % --inst_lit_activity_flag true
% 1.99/2.23 % --inst_out_proof true
% 1.99/2.23
% 1.99/2.23 % ------ Resolution Options
% 1.99/2.23
% 1.99/2.23 % --resolution_flag true
% 1.99/2.23 % --res_lit_sel kbo_max
% 1.99/2.23 % --res_to_prop_solver none
% 1.99/2.23 % --res_prop_simpl_new false
% 1.99/2.23 % --res_prop_simpl_given false
% 1.99/2.23 % --res_passive_queue_type priority_queues
% 1.99/2.23 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.99/2.23 % --res_passive_queues_freq [15;5]
% 1.99/2.23 % --res_forward_subs full
% 1.99/2.23 % --res_backward_subs full
% 1.99/2.23 % --res_forward_subs_resolution true
% 1.99/2.23 % --res_backward_subs_resolution true
% 1.99/2.23 % --res_orphan_elimination false
% 1.99/2.23 % --res_time_limit 1000.
% 1.99/2.23 % --res_out_proof true
% 1.99/2.23 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_996b1a.s
% 1.99/2.23 % --modulo true
% 1.99/2.23
% 1.99/2.23 % ------ Combination Options
% 1.99/2.23
% 1.99/2.23 % --comb_res_mult 1000
% 1.99/2.23 % --comb_inst_mult 300
% 1.99/2.23 % ------
% 1.99/2.23
% 1.99/2.23
% 1.99/2.23
% 1.99/2.23 % ------ Proving...
% 1.99/2.23 % warning: shown sat in sat incomplete mode
% 1.99/2.23 %
% 1.99/2.23
% 1.99/2.23
% 1.99/2.23 ------ Building Model...Done
% 1.99/2.23
% 1.99/2.23 %------ The model is defined over ground terms (initial term algebra).
% 1.99/2.23 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.99/2.23 %------ where \phi is a formula over the term algebra.
% 1.99/2.23 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.99/2.23 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.99/2.23 %------ See help for --sat_out_model for different model outputs.
% 1.99/2.23 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.99/2.23 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.99/2.23
% 1.99/2.23
% 1.99/2.23
% 1.99/2.23
% 1.99/2.23 %------ Positive definition of equality_sorted
% 1.99/2.23 fof(lit_def,axiom,
% 1.99/2.23 (! [X0,X0,X1] :
% 1.99/2.23 ( equality_sorted(X0,X0,X1) <=>
% 1.99/2.23 (
% 1.99/2.23 ? [X2] :
% 1.99/2.23 (
% 1.99/2.23 ( X0=$i & X0=sep(lseg(X2,X2),X1) )
% 1.99/2.23 )
% 1.99/2.23
% 1.99/2.23 |
% 1.99/2.23 ? [X2,X3,X4] :
% 1.99/2.23 (
% 1.99/2.23 ( X0=$i & X0=sep(X2,sep(X3,X4)) & X1=sep(X3,sep(X2,X4)) )
% 1.99/2.23 )
% 1.99/2.23
% 1.99/2.23 )
% 1.99/2.23 )
% 1.99/2.23 )
% 1.99/2.23 ).
% 1.99/2.23
% 1.99/2.23 %------ Positive definition of heap
% 1.99/2.23 fof(lit_def,axiom,
% 1.99/2.23 (! [X0] :
% 1.99/2.23 ( heap(X0) <=>
% 1.99/2.23 (
% 1.99/2.23 (
% 1.99/2.23 ( X0=sep(lseg(x5,x17),sep(lseg(x19,x1),sep(lseg(x4,x12),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x12,x11),sep(lseg(x2,x18),sep(lseg(x17,x14),sep(lseg(x7,x16),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x6,x17),sep(lseg(x6,x19),emp)))))))))))))) )
% 1.99/2.23 )
% 1.99/2.23
% 1.99/2.23 )
% 1.99/2.23 )
% 1.99/2.23 )
% 1.99/2.23 ).
% 1.99/2.23
% 1.99/2.23
% 1.99/2.23
% 1.99/2.23 % ------ Statistics
% 1.99/2.23
% 1.99/2.23 % ------ General
% 1.99/2.23
% 1.99/2.23 % num_of_input_clauses: 41
% 1.99/2.23 % num_of_input_neg_conjectures: 1
% 1.99/2.23 % num_of_splits: 0
% 1.99/2.23 % num_of_split_atoms: 0
% 1.99/2.23 % num_of_sem_filtered_clauses: 0
% 1.99/2.23 % num_of_subtypes: 0
% 1.99/2.23 % monotx_restored_types: 0
% 1.99/2.23 % sat_num_of_epr_types: 0
% 1.99/2.23 % sat_num_of_non_cyclic_types: 0
% 1.99/2.23 % sat_guarded_non_collapsed_types: 0
% 1.99/2.23 % is_epr: 0
% 1.99/2.23 % is_horn: 0
% 1.99/2.23 % has_eq: 1
% 1.99/2.23 % num_pure_diseq_elim: 0
% 1.99/2.23 % simp_replaced_by: 0
% 1.99/2.23 % res_preprocessed: 21
% 1.99/2.23 % prep_upred: 0
% 1.99/2.23 % prep_unflattend: 0
% 1.99/2.23 % pred_elim_cands: 0
% 1.99/2.23 % pred_elim: 0
% 1.99/2.23 % pred_elim_cl: 0
% 1.99/2.23 % pred_elim_cycles: 0
% 1.99/2.23 % forced_gc_time: 0
% 1.99/2.23 % gc_basic_clause_elim: 0
% 1.99/2.23 % parsing_time: 0.002
% 1.99/2.23 % sem_filter_time: 0.
% 1.99/2.23 % pred_elim_time: 0.
% 1.99/2.23 % out_proof_time: 0.
% 1.99/2.23 % monotx_time: 0.
% 1.99/2.23 % subtype_inf_time: 0.
% 1.99/2.23 % unif_index_cands_time: 0.
% 1.99/2.23 % unif_index_add_time: 0.003
% 1.99/2.23 % total_time: 1.815
% 1.99/2.23 % num_of_symbols: 51
% 1.99/2.23 % num_of_terms: 15670
% 1.99/2.23
% 1.99/2.23 % ------ Propositional Solver
% 1.99/2.23
% 1.99/2.23 % prop_solver_calls: 2
% 1.99/2.23 % prop_fast_solver_calls: 44
% 1.99/2.23 % prop_num_of_clauses: 48
% 1.99/2.23 % prop_preprocess_simplified: 241
% 1.99/2.23 % prop_fo_subsumed: 0
% 1.99/2.23 % prop_solver_time: 0.
% 1.99/2.23 % prop_fast_solver_time: 0.
% 1.99/2.23 % prop_unsat_core_time: 0.
% 1.99/2.23
% 1.99/2.23 % ------ QBF
% 1.99/2.23
% 1.99/2.23 % qbf_q_res: 0
% 1.99/2.23 % qbf_num_tautologies: 0
% 1.99/2.23 % qbf_prep_cycles: 0
% 1.99/2.23
% 1.99/2.23 % ------ BMC1
% 1.99/2.23
% 1.99/2.23 % bmc1_current_bound: -1
% 1.99/2.23 % bmc1_last_solved_bound: -1
% 1.99/2.23 % bmc1_unsat_core_size: -1
% 1.99/2.23 % bmc1_unsat_core_parents_size: -1
% 1.99/2.23 % bmc1_merge_next_fun: 0
% 1.99/2.23 % bmc1_unsat_core_clauses_time: 0.
% 1.99/2.23
% 1.99/2.23 % ------ Instantiation
% 1.99/2.23
% 1.99/2.23 % inst_num_of_clauses: 41
% 1.99/2.23 % inst_num_in_passive: 0
% 1.99/2.23 % inst_num_in_active: 41
% 1.99/2.23 % inst_num_in_unprocessed: 0
% 1.99/2.23 % inst_num_of_loops: 43
% 1.99/2.23 % inst_num_of_learning_restarts: 0
% 1.99/2.23 % inst_num_moves_active_passive: 0
% 1.99/2.23 % inst_lit_activity: 5
% 1.99/2.23 % inst_lit_activity_moves: 0
% 1.99/2.23 % inst_num_tautologies: 0
% 1.99/2.23 % inst_num_prop_implied: 0
% 1.99/2.23 % inst_num_existing_simplified: 0
% 1.99/2.23 % inst_num_eq_res_simplified: 0
% 1.99/2.23 % inst_num_child_elim: 0
% 1.99/2.23 % inst_num_of_dismatching_blockings: 0
% 1.99/2.23 % inst_num_of_non_proper_insts: 0
% 1.99/2.23 % inst_num_of_duplicates: 0
% 1.99/2.23 % inst_inst_num_from_inst_to_res: 0
% 1.99/2.23 % inst_dismatching_checking_time: 0.
% 1.99/2.23
% 1.99/2.23 % ------ Resolution
% 1.99/2.23
% 1.99/2.23 % res_num_of_clauses: 894
% 1.99/2.23 % res_num_in_passive: 385
% 1.99/2.23 % res_num_in_active: 498
% 1.99/2.23 % res_num_of_loops: 1000
% 1.99/2.23 % res_forward_subset_subsumed: 9
% 1.99/2.23 % res_backward_subset_subsumed: 0
% 1.99/2.23 % res_forward_subsumed: 513
% 1.99/2.23 % res_backward_subsumed: 0
% 1.99/2.23 % res_forward_subsumption_resolution: 18
% 1.99/2.23 % res_backward_subsumption_resolution: 0
% 1.99/2.23 % res_clause_to_clause_subsumption: 11850
% 1.99/2.23 % res_orphan_elimination: 0
% 1.99/2.23 % res_tautology_del: 0
% 1.99/2.23 % res_num_eq_res_simplified: 0
% 1.99/2.23 % res_num_sel_changes: 0
% 1.99/2.23 % res_moves_from_active_to_pass: 0
% 1.99/2.23
% 1.99/2.23 % Status Unknown
% 2.08/2.27 % Orienting using strategy ClausalAll
% 2.08/2.27 % Orientation found
% 2.08/2.27 % 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_996b1a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_9823e1.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_7651bc | grep -v "SZS"
% 2.08/2.29
% 2.08/2.29 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 2.08/2.29
% 2.08/2.29 %
% 2.08/2.29 % ------ iProver source info
% 2.08/2.29
% 2.08/2.29 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 2.08/2.29 % git: non_committed_changes: true
% 2.08/2.29 % git: last_make_outside_of_git: true
% 2.08/2.29
% 2.08/2.29 %
% 2.08/2.29 % ------ Input Options
% 2.08/2.29
% 2.08/2.29 % --out_options all
% 2.08/2.29 % --tptp_safe_out true
% 2.08/2.29 % --problem_path ""
% 2.08/2.29 % --include_path ""
% 2.08/2.29 % --clausifier .//eprover
% 2.08/2.29 % --clausifier_options --tstp-format
% 2.08/2.29 % --stdin false
% 2.08/2.29 % --dbg_backtrace false
% 2.08/2.29 % --dbg_dump_prop_clauses false
% 2.08/2.29 % --dbg_dump_prop_clauses_file -
% 2.08/2.29 % --dbg_out_stat false
% 2.08/2.29
% 2.08/2.29 % ------ General Options
% 2.08/2.29
% 2.08/2.29 % --fof false
% 2.08/2.29 % --time_out_real 150.
% 2.08/2.29 % --time_out_prep_mult 0.2
% 2.08/2.29 % --time_out_virtual -1.
% 2.08/2.29 % --schedule none
% 2.08/2.29 % --ground_splitting input
% 2.08/2.29 % --splitting_nvd 16
% 2.08/2.29 % --non_eq_to_eq false
% 2.08/2.29 % --prep_gs_sim true
% 2.08/2.29 % --prep_unflatten false
% 2.08/2.29 % --prep_res_sim true
% 2.08/2.29 % --prep_upred true
% 2.08/2.29 % --res_sim_input true
% 2.08/2.29 % --clause_weak_htbl true
% 2.08/2.29 % --gc_record_bc_elim false
% 2.08/2.29 % --symbol_type_check false
% 2.08/2.29 % --clausify_out false
% 2.08/2.29 % --large_theory_mode false
% 2.08/2.29 % --prep_sem_filter none
% 2.08/2.29 % --prep_sem_filter_out false
% 2.08/2.29 % --preprocessed_out false
% 2.08/2.29 % --sub_typing false
% 2.08/2.29 % --brand_transform false
% 2.08/2.29 % --pure_diseq_elim true
% 2.08/2.29 % --min_unsat_core false
% 2.08/2.29 % --pred_elim true
% 2.08/2.29 % --add_important_lit false
% 2.08/2.29 % --soft_assumptions false
% 2.08/2.29 % --reset_solvers false
% 2.08/2.29 % --bc_imp_inh []
% 2.08/2.29 % --conj_cone_tolerance 1.5
% 2.08/2.29 % --prolific_symb_bound 500
% 2.08/2.29 % --lt_threshold 2000
% 2.08/2.29
% 2.08/2.29 % ------ SAT Options
% 2.08/2.29
% 2.08/2.29 % --sat_mode false
% 2.08/2.29 % --sat_fm_restart_options ""
% 2.08/2.29 % --sat_gr_def false
% 2.08/2.29 % --sat_epr_types true
% 2.08/2.29 % --sat_non_cyclic_types false
% 2.08/2.29 % --sat_finite_models false
% 2.08/2.29 % --sat_fm_lemmas false
% 2.08/2.29 % --sat_fm_prep false
% 2.08/2.29 % --sat_fm_uc_incr true
% 2.08/2.29 % --sat_out_model small
% 2.08/2.29 % --sat_out_clauses false
% 2.08/2.29
% 2.08/2.29 % ------ QBF Options
% 2.08/2.29
% 2.08/2.29 % --qbf_mode false
% 2.08/2.29 % --qbf_elim_univ true
% 2.08/2.29 % --qbf_sk_in true
% 2.08/2.29 % --qbf_pred_elim true
% 2.08/2.29 % --qbf_split 32
% 2.08/2.29
% 2.08/2.29 % ------ BMC1 Options
% 2.08/2.29
% 2.08/2.29 % --bmc1_incremental false
% 2.08/2.29 % --bmc1_axioms reachable_all
% 2.08/2.29 % --bmc1_min_bound 0
% 2.08/2.29 % --bmc1_max_bound -1
% 2.08/2.29 % --bmc1_max_bound_default -1
% 2.08/2.29 % --bmc1_symbol_reachability true
% 2.08/2.29 % --bmc1_property_lemmas false
% 2.08/2.29 % --bmc1_k_induction false
% 2.08/2.29 % --bmc1_non_equiv_states false
% 2.08/2.29 % --bmc1_deadlock false
% 2.08/2.29 % --bmc1_ucm false
% 2.08/2.29 % --bmc1_add_unsat_core none
% 2.08/2.29 % --bmc1_unsat_core_children false
% 2.08/2.29 % --bmc1_unsat_core_extrapolate_axioms false
% 2.08/2.29 % --bmc1_out_stat full
% 2.08/2.29 % --bmc1_ground_init false
% 2.08/2.29 % --bmc1_pre_inst_next_state false
% 2.08/2.29 % --bmc1_pre_inst_state false
% 2.08/2.29 % --bmc1_pre_inst_reach_state false
% 2.08/2.29 % --bmc1_out_unsat_core false
% 2.08/2.29 % --bmc1_aig_witness_out false
% 2.08/2.29 % --bmc1_verbose false
% 2.08/2.29 % --bmc1_dump_clauses_tptp false
% 2.13/2.43 % --bmc1_dump_unsat_core_tptp false
% 2.13/2.43 % --bmc1_dump_file -
% 2.13/2.43 % --bmc1_ucm_expand_uc_limit 128
% 2.13/2.43 % --bmc1_ucm_n_expand_iterations 6
% 2.13/2.43 % --bmc1_ucm_extend_mode 1
% 2.13/2.43 % --bmc1_ucm_init_mode 2
% 2.13/2.43 % --bmc1_ucm_cone_mode none
% 2.13/2.43 % --bmc1_ucm_reduced_relation_type 0
% 2.13/2.43 % --bmc1_ucm_relax_model 4
% 2.13/2.43 % --bmc1_ucm_full_tr_after_sat true
% 2.13/2.43 % --bmc1_ucm_expand_neg_assumptions false
% 2.13/2.43 % --bmc1_ucm_layered_model none
% 2.13/2.43 % --bmc1_ucm_max_lemma_size 10
% 2.13/2.43
% 2.13/2.43 % ------ AIG Options
% 2.13/2.43
% 2.13/2.43 % --aig_mode false
% 2.13/2.43
% 2.13/2.43 % ------ Instantiation Options
% 2.13/2.43
% 2.13/2.43 % --instantiation_flag true
% 2.13/2.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.13/2.43 % --inst_solver_per_active 750
% 2.13/2.43 % --inst_solver_calls_frac 0.5
% 2.13/2.43 % --inst_passive_queue_type priority_queues
% 2.13/2.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.13/2.43 % --inst_passive_queues_freq [25;2]
% 2.13/2.43 % --inst_dismatching true
% 2.13/2.43 % --inst_eager_unprocessed_to_passive true
% 2.13/2.43 % --inst_prop_sim_given true
% 2.13/2.43 % --inst_prop_sim_new false
% 2.13/2.43 % --inst_orphan_elimination true
% 2.13/2.43 % --inst_learning_loop_flag true
% 2.13/2.43 % --inst_learning_start 3000
% 2.13/2.43 % --inst_learning_factor 2
% 2.13/2.43 % --inst_start_prop_sim_after_learn 3
% 2.13/2.43 % --inst_sel_renew solver
% 2.13/2.43 % --inst_lit_activity_flag true
% 2.13/2.43 % --inst_out_proof true
% 2.13/2.43
% 2.13/2.43 % ------ Resolution Options
% 2.13/2.43
% 2.13/2.43 % --resolution_flag true
% 2.13/2.43 % --res_lit_sel kbo_max
% 2.13/2.43 % --res_to_prop_solver none
% 2.13/2.43 % --res_prop_simpl_new false
% 2.13/2.43 % --res_prop_simpl_given false
% 2.13/2.43 % --res_passive_queue_type priority_queues
% 2.13/2.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.13/2.43 % --res_passive_queues_freq [15;5]
% 2.13/2.43 % --res_forward_subs full
% 2.13/2.43 % --res_backward_subs full
% 2.13/2.43 % --res_forward_subs_resolution true
% 2.13/2.43 % --res_backward_subs_resolution true
% 2.13/2.43 % --res_orphan_elimination false
% 2.13/2.43 % --res_time_limit 1000.
% 2.13/2.43 % --res_out_proof true
% 2.13/2.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_996b1a.s
% 2.13/2.43 % --modulo true
% 2.13/2.43
% 2.13/2.43 % ------ Combination Options
% 2.13/2.43
% 2.13/2.43 % --comb_res_mult 1000
% 2.13/2.43 % --comb_inst_mult 300
% 2.13/2.43 % ------
% 2.13/2.43
% 2.13/2.43 % ------ Parsing...% successful
% 2.13/2.43
% 2.13/2.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 2.13/2.43
% 2.13/2.43 % ------ Proving...
% 2.13/2.43 % ------ Problem Properties
% 2.13/2.43
% 2.13/2.43 %
% 2.13/2.43 % EPR false
% 2.13/2.43 % Horn false
% 2.13/2.43 % Has equality true
% 2.13/2.43
% 2.13/2.43 % % ------ Input Options Time Limit: Unbounded
% 2.13/2.43
% 2.13/2.43
% 2.13/2.43 Compiling...
% 2.13/2.43 Loading plugin: done.
% 2.13/2.43 % % ------ Current options:
% 2.13/2.43
% 2.13/2.43 % ------ Input Options
% 2.13/2.43
% 2.13/2.43 % --out_options all
% 2.13/2.43 % --tptp_safe_out true
% 2.13/2.43 % --problem_path ""
% 2.13/2.43 % --include_path ""
% 2.13/2.43 % --clausifier .//eprover
% 2.13/2.43 % --clausifier_options --tstp-format
% 2.13/2.43 % --stdin false
% 2.13/2.43 % --dbg_backtrace false
% 2.13/2.43 % --dbg_dump_prop_clauses false
% 2.13/2.43 % --dbg_dump_prop_clauses_file -
% 2.13/2.43 % --dbg_out_stat false
% 2.13/2.43
% 2.13/2.43 % ------ General Options
% 2.13/2.43
% 2.13/2.43 % --fof false
% 2.13/2.43 % --time_out_real 150.
% 2.13/2.43 % --time_out_prep_mult 0.2
% 2.13/2.43 % --time_out_virtual -1.
% 2.13/2.43 % --schedule none
% 2.13/2.43 % --ground_splitting input
% 2.13/2.43 % --splitting_nvd 16
% 2.13/2.43 % --non_eq_to_eq false
% 2.13/2.43 % --prep_gs_sim true
% 2.13/2.43 % --prep_unflatten false
% 2.13/2.43 % --prep_res_sim true
% 2.13/2.43 % --prep_upred true
% 2.13/2.43 % --res_sim_input true
% 2.13/2.43 % --clause_weak_htbl true
% 2.13/2.43 % --gc_record_bc_elim false
% 2.13/2.43 % --symbol_type_check false
% 2.13/2.43 % --clausify_out false
% 2.13/2.43 % --large_theory_mode false
% 2.13/2.43 % --prep_sem_filter none
% 2.13/2.43 % --prep_sem_filter_out false
% 2.13/2.43 % --preprocessed_out false
% 2.13/2.43 % --sub_typing false
% 2.13/2.43 % --brand_transform false
% 2.13/2.43 % --pure_diseq_elim true
% 2.13/2.43 % --min_unsat_core false
% 2.13/2.43 % --pred_elim true
% 2.13/2.43 % --add_important_lit false
% 2.13/2.43 % --soft_assumptions false
% 2.13/2.43 % --reset_solvers false
% 2.13/2.43 % --bc_imp_inh []
% 2.13/2.43 % --conj_cone_tolerance 1.5
% 2.13/2.43 % --prolific_symb_bound 500
% 2.13/2.43 % --lt_threshold 2000
% 2.13/2.43
% 2.13/2.43 % ------ SAT Options
% 2.13/2.43
% 2.13/2.43 % --sat_mode false
% 2.13/2.43 % --sat_fm_restart_options ""
% 2.13/2.43 % --sat_gr_def false
% 2.13/2.43 % --sat_epr_types true
% 2.13/2.43 % --sat_non_cyclic_types false
% 2.13/2.43 % --sat_finite_models false
% 2.13/2.43 % --sat_fm_lemmas false
% 2.13/2.43 % --sat_fm_prep false
% 2.13/2.43 % --sat_fm_uc_incr true
% 2.13/2.43 % --sat_out_model small
% 2.13/2.43 % --sat_out_clauses false
% 2.13/2.43
% 2.13/2.43 % ------ QBF Options
% 2.13/2.43
% 2.13/2.43 % --qbf_mode false
% 2.13/2.43 % --qbf_elim_univ true
% 2.13/2.43 % --qbf_sk_in true
% 2.13/2.43 % --qbf_pred_elim true
% 2.13/2.43 % --qbf_split 32
% 2.13/2.43
% 2.13/2.43 % ------ BMC1 Options
% 2.13/2.43
% 2.13/2.43 % --bmc1_incremental false
% 2.13/2.43 % --bmc1_axioms reachable_all
% 2.13/2.43 % --bmc1_min_bound 0
% 2.13/2.43 % --bmc1_max_bound -1
% 2.13/2.43 % --bmc1_max_bound_default -1
% 2.13/2.43 % --bmc1_symbol_reachability true
% 2.13/2.43 % --bmc1_property_lemmas false
% 2.13/2.43 % --bmc1_k_induction false
% 2.13/2.43 % --bmc1_non_equiv_states false
% 2.13/2.43 % --bmc1_deadlock false
% 2.13/2.43 % --bmc1_ucm false
% 2.13/2.43 % --bmc1_add_unsat_core none
% 2.13/2.43 % --bmc1_unsat_core_children false
% 2.13/2.43 % --bmc1_unsat_core_extrapolate_axioms false
% 2.13/2.43 % --bmc1_out_stat full
% 2.13/2.43 % --bmc1_ground_init false
% 2.13/2.43 % --bmc1_pre_inst_next_state false
% 2.13/2.43 % --bmc1_pre_inst_state false
% 2.13/2.43 % --bmc1_pre_inst_reach_state false
% 2.13/2.43 % --bmc1_out_unsat_core false
% 2.13/2.43 % --bmc1_aig_witness_out false
% 2.13/2.43 % --bmc1_verbose false
% 2.13/2.43 % --bmc1_dump_clauses_tptp false
% 2.13/2.43 % --bmc1_dump_unsat_core_tptp false
% 2.13/2.43 % --bmc1_dump_file -
% 2.13/2.43 % --bmc1_ucm_expand_uc_limit 128
% 2.13/2.43 % --bmc1_ucm_n_expand_iterations 6
% 2.13/2.43 % --bmc1_ucm_extend_mode 1
% 2.13/2.43 % --bmc1_ucm_init_mode 2
% 2.13/2.43 % --bmc1_ucm_cone_mode none
% 2.13/2.43 % --bmc1_ucm_reduced_relation_type 0
% 2.13/2.43 % --bmc1_ucm_relax_model 4
% 2.13/2.43 % --bmc1_ucm_full_tr_after_sat true
% 2.13/2.43 % --bmc1_ucm_expand_neg_assumptions false
% 2.13/2.43 % --bmc1_ucm_layered_model none
% 2.13/2.43 % --bmc1_ucm_max_lemma_size 10
% 2.13/2.43
% 2.13/2.43 % ------ AIG Options
% 2.13/2.43
% 2.13/2.43 % --aig_mode false
% 2.13/2.43
% 2.13/2.43 % ------ Instantiation Options
% 2.13/2.43
% 2.13/2.43 % --instantiation_flag true
% 2.13/2.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.13/2.43 % --inst_solver_per_active 750
% 2.13/2.43 % --inst_solver_calls_frac 0.5
% 2.13/2.43 % --inst_passive_queue_type priority_queues
% 2.13/2.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.13/2.43 % --inst_passive_queues_freq [25;2]
% 2.13/2.43 % --inst_dismatching true
% 2.13/2.43 % --inst_eager_unprocessed_to_passive true
% 2.13/2.43 % --inst_prop_sim_given true
% 2.13/2.43 % --inst_prop_sim_new false
% 2.13/2.43 % --inst_orphan_elimination true
% 2.13/2.43 % --inst_learning_loop_flag true
% 2.13/2.43 % --inst_learning_start 3000
% 2.13/2.43 % --inst_learning_factor 2
% 2.13/2.43 % --inst_start_prop_sim_after_learn 3
% 2.13/2.43 % --inst_sel_renew solver
% 2.13/2.43 % --inst_lit_activity_flag true
% 2.13/2.43 % --inst_out_proof true
% 2.13/2.43
% 2.13/2.43 % ------ Resolution Options
% 2.13/2.43
% 2.13/2.43 % --resolution_flag true
% 2.13/2.43 % --res_lit_sel kbo_max
% 2.13/2.43 % --res_to_prop_solver none
% 2.13/2.43 % --res_prop_simpl_new false
% 2.13/2.43 % --res_prop_simpl_given false
% 2.13/2.43 % --res_passive_queue_type priority_queues
% 2.13/2.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.13/2.43 % --res_passive_queues_freq [15;5]
% 2.13/2.43 % --res_forward_subs full
% 2.13/2.43 % --res_backward_subs full
% 2.13/2.43 % --res_forward_subs_resolution true
% 2.13/2.43 % --res_backward_subs_resolution true
% 2.13/2.43 % --res_orphan_elimination false
% 2.13/2.43 % --res_time_limit 1000.
% 2.13/2.43 % --res_out_proof true
% 2.13/2.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_996b1a.s
% 2.13/2.43 % --modulo true
% 2.13/2.43
% 2.13/2.43 % ------ Combination Options
% 2.13/2.43
% 2.13/2.43 % --comb_res_mult 1000
% 2.13/2.43 % --comb_inst_mult 300
% 2.13/2.43 % ------
% 2.13/2.43
% 2.13/2.43
% 2.13/2.43
% 2.13/2.43 % ------ Proving...
% 2.13/2.43 % warning: shown sat in sat incomplete mode
% 2.13/2.43 %
% 2.13/2.43
% 2.13/2.43
% 2.13/2.43
% 2.13/2.43
% 2.13/2.43 cnf(c_31,plain,
% 2.13/2.43 ( x11 != x4 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_91) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_70,plain,( x11 != x4 ),inference(copy,[status(esa)],[c_31]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_104,plain,( x11 != x4 ),inference(copy,[status(esa)],[c_70]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_123,plain,( x11 != x4 ),inference(copy,[status(esa)],[c_104]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_153,plain,( x11 != x4 ),inference(copy,[status(esa)],[c_123]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_274,plain,( x11 != x4 ),inference(copy,[status(esa)],[c_153]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_10,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X1 | X0 = X2 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_48_0) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_214,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X1 | X0 = X2 ),
% 2.13/2.43 inference(copy,[status(esa)],[c_10]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_350,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x11,X0),sep(lseg(x11,x4),X1))) | x11 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_274,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_351,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x11,X0),sep(lseg(x11,x4),X1))) | x11 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_350]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_30,plain,
% 2.13/2.43 ( x13 != x4 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_90) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_68,plain,( x13 != x4 ),inference(copy,[status(esa)],[c_30]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_103,plain,( x13 != x4 ),inference(copy,[status(esa)],[c_68]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_124,plain,( x13 != x4 ),inference(copy,[status(esa)],[c_103]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_152,plain,( x13 != x4 ),inference(copy,[status(esa)],[c_124]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_272,plain,( x13 != x4 ),inference(copy,[status(esa)],[c_152]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_346,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x13,X0),sep(lseg(x13,x4),X1))) | x13 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_272,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_347,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x13,X0),sep(lseg(x13,x4),X1))) | x13 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_346]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_29,plain,
% 2.13/2.43 ( x4 != x19 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_89) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_66,plain,( x4 != x19 ),inference(copy,[status(esa)],[c_29]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_102,plain,( x4 != x19 ),inference(copy,[status(esa)],[c_66]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_125,plain,( x4 != x19 ),inference(copy,[status(esa)],[c_102]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_151,plain,( x4 != x19 ),inference(copy,[status(esa)],[c_125]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_270,plain,( x4 != x19 ),inference(copy,[status(esa)],[c_151]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_342,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x4,X0),sep(lseg(x4,x19),X1))) | x4 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_270,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_343,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x4,X0),sep(lseg(x4,x19),X1))) | x4 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_342]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_28,plain,
% 2.13/2.43 ( x16 != x1 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_88) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_64,plain,( x16 != x1 ),inference(copy,[status(esa)],[c_28]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_101,plain,( x16 != x1 ),inference(copy,[status(esa)],[c_64]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_126,plain,( x16 != x1 ),inference(copy,[status(esa)],[c_101]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_150,plain,( x16 != x1 ),inference(copy,[status(esa)],[c_126]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_268,plain,( x16 != x1 ),inference(copy,[status(esa)],[c_150]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_338,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x16,X0),sep(lseg(x16,x1),X1))) | x16 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_268,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_339,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x16,X0),sep(lseg(x16,x1),X1))) | x16 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_338]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_27,plain,
% 2.13/2.43 ( x1 != x20 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_87) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_62,plain,( x1 != x20 ),inference(copy,[status(esa)],[c_27]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_100,plain,( x1 != x20 ),inference(copy,[status(esa)],[c_62]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_127,plain,( x1 != x20 ),inference(copy,[status(esa)],[c_100]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_149,plain,( x1 != x20 ),inference(copy,[status(esa)],[c_127]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_266,plain,( x1 != x20 ),inference(copy,[status(esa)],[c_149]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_334,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x1,X0),sep(lseg(x1,x20),X1))) | x1 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_266,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_335,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x1,X0),sep(lseg(x1,x20),X1))) | x1 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_334]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_26,plain,
% 2.13/2.43 ( x18 != x13 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_86) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_60,plain,( x18 != x13 ),inference(copy,[status(esa)],[c_26]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_99,plain,( x18 != x13 ),inference(copy,[status(esa)],[c_60]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_128,plain,( x18 != x13 ),inference(copy,[status(esa)],[c_99]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_148,plain,( x18 != x13 ),inference(copy,[status(esa)],[c_128]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_264,plain,( x18 != x13 ),inference(copy,[status(esa)],[c_148]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_330,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x18,X0),sep(lseg(x18,x13),X1))) | x18 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_264,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_331,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x18,X0),sep(lseg(x18,x13),X1))) | x18 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_330]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_25,plain,
% 2.13/2.43 ( x13 != x17 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_85) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_58,plain,( x13 != x17 ),inference(copy,[status(esa)],[c_25]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_98,plain,( x13 != x17 ),inference(copy,[status(esa)],[c_58]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_129,plain,( x13 != x17 ),inference(copy,[status(esa)],[c_98]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_147,plain,( x13 != x17 ),inference(copy,[status(esa)],[c_129]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_262,plain,( x13 != x17 ),inference(copy,[status(esa)],[c_147]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_326,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x13,X0),sep(lseg(x13,x17),X1))) | x13 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_262,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_327,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x13,X0),sep(lseg(x13,x17),X1))) | x13 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_326]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_24,plain,
% 2.13/2.43 ( x10 != x19 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_84) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_56,plain,( x10 != x19 ),inference(copy,[status(esa)],[c_24]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_97,plain,( x10 != x19 ),inference(copy,[status(esa)],[c_56]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_130,plain,( x10 != x19 ),inference(copy,[status(esa)],[c_97]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_146,plain,( x10 != x19 ),inference(copy,[status(esa)],[c_130]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_260,plain,( x10 != x19 ),inference(copy,[status(esa)],[c_146]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_322,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x10,X0),sep(lseg(x10,x19),X1))) | x10 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_260,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_323,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x10,X0),sep(lseg(x10,x19),X1))) | x10 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_322]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_23,plain,
% 2.13/2.43 ( x10 != x20 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_83) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_54,plain,( x10 != x20 ),inference(copy,[status(esa)],[c_23]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_96,plain,( x10 != x20 ),inference(copy,[status(esa)],[c_54]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_131,plain,( x10 != x20 ),inference(copy,[status(esa)],[c_96]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_145,plain,( x10 != x20 ),inference(copy,[status(esa)],[c_131]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_258,plain,( x10 != x20 ),inference(copy,[status(esa)],[c_145]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_318,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x10,X0),sep(lseg(x10,x20),X1))) | x10 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_258,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_319,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x10,X0),sep(lseg(x10,x20),X1))) | x10 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_318]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_22,plain,
% 2.13/2.43 ( x16 != x19 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_82) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_52,plain,( x16 != x19 ),inference(copy,[status(esa)],[c_22]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_95,plain,( x16 != x19 ),inference(copy,[status(esa)],[c_52]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_132,plain,( x16 != x19 ),inference(copy,[status(esa)],[c_95]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_144,plain,( x16 != x19 ),inference(copy,[status(esa)],[c_132]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_256,plain,( x16 != x19 ),inference(copy,[status(esa)],[c_144]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_314,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x16,X0),sep(lseg(x16,x19),X1))) | x16 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_256,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_315,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x16,X0),sep(lseg(x16,x19),X1))) | x16 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_314]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_39,plain,
% 2.13/2.43 ( x6 != x19 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_99) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_86,plain,( x6 != x19 ),inference(copy,[status(esa)],[c_39]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_112,plain,( x6 != x19 ),inference(copy,[status(esa)],[c_86]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_115,plain,( x6 != x19 ),inference(copy,[status(esa)],[c_112]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_141,plain,( x6 != x19 ),inference(copy,[status(esa)],[c_115]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_250,plain,( x6 != x19 ),inference(copy,[status(esa)],[c_141]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_310,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x6,X0),sep(lseg(x6,x19),X1))) | x6 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_250,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_311,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x6,X0),sep(lseg(x6,x19),X1))) | x6 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_310]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_38,plain,
% 2.13/2.43 ( x7 != x3 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_98) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_84,plain,( x7 != x3 ),inference(copy,[status(esa)],[c_38]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_111,plain,( x7 != x3 ),inference(copy,[status(esa)],[c_84]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_116,plain,( x7 != x3 ),inference(copy,[status(esa)],[c_111]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_140,plain,( x7 != x3 ),inference(copy,[status(esa)],[c_116]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_248,plain,( x7 != x3 ),inference(copy,[status(esa)],[c_140]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_306,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x7,X0),sep(lseg(x7,x3),X1))) | x7 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_248,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_307,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x7,X0),sep(lseg(x7,x3),X1))) | x7 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_306]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_37,plain,
% 2.13/2.43 ( x20 != x3 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_97) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_82,plain,( x20 != x3 ),inference(copy,[status(esa)],[c_37]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_110,plain,( x20 != x3 ),inference(copy,[status(esa)],[c_82]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_117,plain,( x20 != x3 ),inference(copy,[status(esa)],[c_110]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_139,plain,( x20 != x3 ),inference(copy,[status(esa)],[c_117]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_246,plain,( x20 != x3 ),inference(copy,[status(esa)],[c_139]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_302,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x20,X0),sep(lseg(x20,x3),X1))) | x20 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_246,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_303,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x20,X0),sep(lseg(x20,x3),X1))) | x20 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_302]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_36,plain,
% 2.13/2.43 ( x20 != x7 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_96) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_80,plain,( x20 != x7 ),inference(copy,[status(esa)],[c_36]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_109,plain,( x20 != x7 ),inference(copy,[status(esa)],[c_80]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_118,plain,( x20 != x7 ),inference(copy,[status(esa)],[c_109]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_138,plain,( x20 != x7 ),inference(copy,[status(esa)],[c_118]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_244,plain,( x20 != x7 ),inference(copy,[status(esa)],[c_138]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_298,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x20,X0),sep(lseg(x20,x7),X1))) | x20 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_244,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_299,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x20,X0),sep(lseg(x20,x7),X1))) | x20 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_298]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_35,plain,
% 2.13/2.43 ( x9 != x19 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_95) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_78,plain,( x9 != x19 ),inference(copy,[status(esa)],[c_35]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_108,plain,( x9 != x19 ),inference(copy,[status(esa)],[c_78]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_119,plain,( x9 != x19 ),inference(copy,[status(esa)],[c_108]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_137,plain,( x9 != x19 ),inference(copy,[status(esa)],[c_119]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_242,plain,( x9 != x19 ),inference(copy,[status(esa)],[c_137]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_294,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x9,X0),sep(lseg(x9,x19),X1))) | x9 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_242,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_295,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x9,X0),sep(lseg(x9,x19),X1))) | x9 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_294]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_34,plain,
% 2.13/2.43 ( x2 != x20 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_94) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_76,plain,( x2 != x20 ),inference(copy,[status(esa)],[c_34]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_107,plain,( x2 != x20 ),inference(copy,[status(esa)],[c_76]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_120,plain,( x2 != x20 ),inference(copy,[status(esa)],[c_107]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_136,plain,( x2 != x20 ),inference(copy,[status(esa)],[c_120]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_240,plain,( x2 != x20 ),inference(copy,[status(esa)],[c_136]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_290,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x2,X0),sep(lseg(x2,x20),X1))) | x2 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_240,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_291,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x2,X0),sep(lseg(x2,x20),X1))) | x2 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_290]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_33,plain,
% 2.13/2.43 ( x8 != x19 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_93) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_74,plain,( x8 != x19 ),inference(copy,[status(esa)],[c_33]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_106,plain,( x8 != x19 ),inference(copy,[status(esa)],[c_74]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_121,plain,( x8 != x19 ),inference(copy,[status(esa)],[c_106]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_135,plain,( x8 != x19 ),inference(copy,[status(esa)],[c_121]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_238,plain,( x8 != x19 ),inference(copy,[status(esa)],[c_135]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_286,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x8,X0),sep(lseg(x8,x19),X1))) | x8 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_238,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_287,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x8,X0),sep(lseg(x8,x19),X1))) | x8 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_286]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_32,plain,
% 2.13/2.43 ( x17 != x8 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_92) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_72,plain,( x17 != x8 ),inference(copy,[status(esa)],[c_32]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_105,plain,( x17 != x8 ),inference(copy,[status(esa)],[c_72]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_122,plain,( x17 != x8 ),inference(copy,[status(esa)],[c_105]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_134,plain,( x17 != x8 ),inference(copy,[status(esa)],[c_122]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_236,plain,( x17 != x8 ),inference(copy,[status(esa)],[c_134]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_282,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x17,X0),sep(lseg(x17,x8),X1))) | x17 = X0 ),
% 2.13/2.43 inference(resolution,[status(thm)],[c_236,c_214]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_283,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(x17,X0),sep(lseg(x17,x8),X1))) | x17 = X0 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_282]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_13,plain,
% 2.13/2.43 ( heap(sep(lseg(X0,X1),X2))
% 2.13/2.43 | X0 = X3
% 2.13/2.43 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))) ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_46_2) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_220,plain,
% 2.13/2.43 ( heap(sep(lseg(X0,X1),X2))
% 2.13/2.43 | X0 = X3
% 2.13/2.43 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_13]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_221,plain,
% 2.13/2.43 ( heap(sep(lseg(X0,X1),X2))
% 2.13/2.43 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2)))
% 2.13/2.43 | X0 = X3 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_220]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_40,plain,
% 2.13/2.43 ( heap(sep(lseg(x5,x17),sep(lseg(x19,x1),sep(lseg(x4,x12),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x12,x11),sep(lseg(x2,x18),sep(lseg(x17,x14),sep(lseg(x7,x16),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x6,x17),sep(lseg(x6,x19),emp))))))))))))))) ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_80) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_88,plain,
% 2.13/2.43 ( heap(sep(lseg(x5,x17),sep(lseg(x19,x1),sep(lseg(x4,x12),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x12,x11),sep(lseg(x2,x18),sep(lseg(x17,x14),sep(lseg(x7,x16),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x6,x17),sep(lseg(x6,x19),emp))))))))))))))) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_40]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_113,plain,
% 2.13/2.43 ( heap(sep(lseg(x5,x17),sep(lseg(x19,x1),sep(lseg(x4,x12),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x12,x11),sep(lseg(x2,x18),sep(lseg(x17,x14),sep(lseg(x7,x16),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x6,x17),sep(lseg(x6,x19),emp))))))))))))))) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_88]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_114,plain,
% 2.13/2.43 ( heap(sep(lseg(x5,x17),sep(lseg(x19,x1),sep(lseg(x4,x12),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x12,x11),sep(lseg(x2,x18),sep(lseg(x17,x14),sep(lseg(x7,x16),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x6,x17),sep(lseg(x6,x19),emp))))))))))))))) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_113]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_142,plain,
% 2.13/2.43 ( heap(sep(lseg(x5,x17),sep(lseg(x19,x1),sep(lseg(x4,x12),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x12,x11),sep(lseg(x2,x18),sep(lseg(x17,x14),sep(lseg(x7,x16),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x6,x17),sep(lseg(x6,x19),emp))))))))))))))) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_114]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_252,plain,
% 2.13/2.43 ( heap(sep(lseg(x5,x17),sep(lseg(x19,x1),sep(lseg(x4,x12),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x12,x11),sep(lseg(x2,x18),sep(lseg(x17,x14),sep(lseg(x7,x16),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x6,x17),sep(lseg(x6,x19),emp))))))))))))))) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_142]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_21,negated_conjecture,
% 2.13/2.43 ( ~ heap(emp) | x1 = x1 ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_81) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_90,negated_conjecture,
% 2.13/2.43 ( ~ heap(emp) | x1 = x1 ),
% 2.13/2.43 inference(copy,[status(esa)],[c_21]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_94,negated_conjecture,
% 2.13/2.43 ( ~ heap(emp) | x1 = x1 ),
% 2.13/2.43 inference(copy,[status(esa)],[c_90]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_133,negated_conjecture,
% 2.13/2.43 ( ~ heap(emp) | x1 = x1 ),
% 2.13/2.43 inference(copy,[status(esa)],[c_94]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_143,negated_conjecture,
% 2.13/2.43 ( ~ heap(emp) | x1 = x1 ),
% 2.13/2.43 inference(copy,[status(esa)],[c_133]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_254,negated_conjecture,
% 2.13/2.43 ( ~ heap(emp) | x1 = x1 ),
% 2.13/2.43 inference(copy,[status(esa)],[c_143]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_18,plain,
% 2.13/2.43 ( heap(sep(lseg(X0,X1),sep(lseg(X1,X2),X3)))
% 2.13/2.43 | X1 = X2
% 2.13/2.43 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(lseg(X1,X2),X3)))) ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_44_2) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_230,plain,
% 2.13/2.43 ( heap(sep(lseg(X0,X1),sep(lseg(X1,X2),X3)))
% 2.13/2.43 | X1 = X2
% 2.13/2.43 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(lseg(X1,X2),X3)))) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_18]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_231,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(lseg(X2,X3),X4))))
% 2.13/2.43 | heap(sep(lseg(X0,X2),sep(lseg(X2,X3),X4)))
% 2.13/2.43 | X2 = X3 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_230]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_16,plain,
% 2.13/2.43 ( heap(sep(lseg(X0,X1),sep(next(X1,X2),X3)))
% 2.13/2.43 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(next(X1,X2),X3)))) ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_45_1) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_226,plain,
% 2.13/2.43 ( heap(sep(lseg(X0,X1),sep(next(X1,X2),X3)))
% 2.13/2.43 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(next(X1,X2),X3)))) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_16]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_227,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(next(X2,X3),X4))))
% 2.13/2.43 | heap(sep(lseg(X0,X2),sep(next(X2,X3),X4))) ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_226]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_11,plain,
% 2.13/2.43 ( heap(sep(lseg(X0,nil),X1))
% 2.13/2.43 | ~ heap(sep(lseg(X0,X2),sep(lseg(X2,nil),X1))) ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_47_1) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_216,plain,
% 2.13/2.43 ( heap(sep(lseg(X0,nil),X1))
% 2.13/2.43 | ~ heap(sep(lseg(X0,X2),sep(lseg(X2,nil),X1))) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_11]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_8,plain,
% 2.13/2.43 ( X0 = X1 | X0 = X2 | ~ heap(sep(lseg(X0,X2),sep(lseg(X0,X1),X3))) ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_48_2) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_210,plain,
% 2.13/2.43 ( X0 = X1 | X0 = X2 | ~ heap(sep(lseg(X0,X2),sep(lseg(X0,X1),X3))) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_8]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_211,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X2 | X0 = X1 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_210]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_6,plain,
% 2.13/2.43 ( X0 = X1 | ~ heap(sep(next(X0,X2),sep(lseg(X0,X1),X3))) ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_49_1) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_206,plain,
% 2.13/2.43 ( X0 = X1 | ~ heap(sep(next(X0,X2),sep(lseg(X0,X1),X3))) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_6]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_207,plain,
% 2.13/2.43 ( ~ heap(sep(next(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X2 ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_206]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_4,plain,
% 2.13/2.43 ( X0 = nil | ~ heap(sep(lseg(nil,X0),X1)) ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_51_1) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_202,plain,
% 2.13/2.43 ( X0 = nil | ~ heap(sep(lseg(nil,X0),X1)) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_4]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_203,plain,
% 2.13/2.43 ( ~ heap(sep(lseg(nil,X0),X1)) | X0 = nil ),
% 2.13/2.43 inference(rewriting,[status(thm)],[c_202]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_3,plain,
% 2.13/2.43 ( ~ heap(sep(next(X0,X1),sep(next(X0,X2),X3))) ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_50_0) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_200,plain,
% 2.13/2.43 ( ~ heap(sep(next(X0,X1),sep(next(X0,X2),X3))) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_3]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_2,plain,
% 2.13/2.43 ( ~ heap(sep(next(nil,X0),X1)) ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_52_0) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_198,plain,
% 2.13/2.43 ( ~ heap(sep(next(nil,X0),X1)) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_2]) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_1,plain,
% 2.13/2.43 ( sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)) ),
% 2.13/2.43 file('/export/starexec/sandbox/tmp/iprover_modulo_9823e1.p', c_0_53_0) ).
% 2.13/2.43
% 2.13/2.43 cnf(c_196,plain,
% 2.13/2.43 ( sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)) ),
% 2.13/2.43 inference(copy,[status(esa)],[c_1]) ).
% 2.13/2.43
% 2.13/2.43
% 2.13/2.43
% 2.13/2.43 % ------ Statistics
% 2.13/2.43
% 2.13/2.43 % ------ General
% 2.13/2.43
% 2.13/2.43 % num_of_input_clauses: 41
% 2.13/2.43 % num_of_input_neg_conjectures: 1
% 2.13/2.43 % num_of_splits: 0
% 2.13/2.43 % num_of_split_atoms: 0
% 2.13/2.43 % num_of_sem_filtered_clauses: 0
% 2.13/2.43 % num_of_subtypes: 0
% 2.13/2.43 % monotx_restored_types: 0
% 2.13/2.43 % sat_num_of_epr_types: 0
% 2.13/2.43 % sat_num_of_non_cyclic_types: 0
% 2.13/2.43 % sat_guarded_non_collapsed_types: 0
% 2.13/2.43 % is_epr: 0
% 2.13/2.43 % is_horn: 0
% 2.13/2.43 % has_eq: 1
% 2.13/2.43 % num_pure_diseq_elim: 0
% 2.13/2.43 % simp_replaced_by: 0
% 2.13/2.43 % res_preprocessed: 21
% 2.13/2.43 % prep_upred: 0
% 2.13/2.43 % prep_unflattend: 0
% 2.13/2.43 % pred_elim_cands: 0
% 2.13/2.43 % pred_elim: 0
% 2.13/2.43 % pred_elim_cl: 0
% 2.13/2.43 % pred_elim_cycles: 0
% 2.13/2.43 % forced_gc_time: 0
% 2.13/2.43 % gc_basic_clause_elim: 0
% 2.13/2.43 % parsing_time: 0.001
% 2.13/2.43 % sem_filter_time: 0.
% 2.13/2.43 % pred_elim_time: 0.
% 2.13/2.43 % out_proof_time: 0.
% 2.13/2.43 % monotx_time: 0.
% 2.13/2.43 % subtype_inf_time: 0.
% 2.13/2.43 % unif_index_cands_time: 0.
% 2.13/2.43 % unif_index_add_time: 0.
% 2.13/2.43 % total_time: 0.153
% 2.13/2.43 % num_of_symbols: 51
% 2.13/2.43 % num_of_terms: 371
% 2.13/2.43
% 2.13/2.43 % ------ Propositional Solver
% 2.13/2.43
% 2.13/2.43 % prop_solver_calls: 1
% 2.13/2.43 % prop_fast_solver_calls: 44
% 2.13/2.43 % prop_num_of_clauses: 48
% 2.13/2.43 % prop_preprocess_simplified: 179
% 2.13/2.43 % prop_fo_subsumed: 0
% 2.13/2.43 % prop_solver_time: 0.
% 2.13/2.43 % prop_fast_solver_time: 0.
% 2.13/2.43 % prop_unsat_core_time: 0.
% 2.13/2.43
% 2.13/2.43 % ------ QBF
% 2.13/2.43
% 2.13/2.43 % qbf_q_res: 0
% 2.13/2.43 % qbf_num_tautologies: 0
% 2.13/2.43 % qbf_prep_cycles: 0
% 2.13/2.43
% 2.13/2.43 % ------ BMC1
% 2.13/2.43
% 2.13/2.43 % bmc1_current_bound: -1
% 2.13/2.43 % bmc1_last_solved_bound: -1
% 2.13/2.43 % bmc1_unsat_core_size: -1
% 2.13/2.43 % bmc1_unsat_core_parents_size: -1
% 2.13/2.43 % bmc1_merge_next_fun: 0
% 2.13/2.43 % bmc1_unsat_core_clauses_time: 0.
% 2.13/2.43
% 2.13/2.43 % ------ Instantiation
% 2.13/2.43
% 2.13/2.43 % inst_num_of_clauses: 41
% 2.13/2.43 % inst_num_in_passive: 0
% 2.13/2.43 % inst_num_in_active: 0
% 2.13/2.44 % inst_num_in_unprocessed: 41
% 2.13/2.44 % inst_num_of_loops: 0
% 2.13/2.44 % inst_num_of_learning_restarts: 0
% 2.13/2.44 % inst_num_moves_active_passive: 0
% 2.13/2.44 % inst_lit_activity: 0
% 2.13/2.44 % inst_lit_activity_moves: 0
% 2.13/2.44 % inst_num_tautologies: 0
% 2.13/2.44 % inst_num_prop_implied: 0
% 2.13/2.44 % inst_num_existing_simplified: 0
% 2.13/2.44 % inst_num_eq_res_simplified: 0
% 2.13/2.44 % inst_num_child_elim: 0
% 2.13/2.44 % inst_num_of_dismatching_blockings: 0
% 2.13/2.44 % inst_num_of_non_proper_insts: 0
% 2.13/2.44 % inst_num_of_duplicates: 0
% 2.13/2.44 % inst_inst_num_from_inst_to_res: 0
% 2.13/2.44 % inst_dismatching_checking_time: 0.
% 2.13/2.44
% 2.13/2.44 % ------ Resolution
% 2.13/2.44
% 2.13/2.44 % res_num_of_clauses: 60
% 2.13/2.44 % res_num_in_passive: 0
% 2.13/2.44 % res_num_in_active: 49
% 2.13/2.44 % res_num_of_loops: 39
% 2.13/2.44 % res_forward_subset_subsumed: 9
% 2.13/2.44 % res_backward_subset_subsumed: 0
% 2.13/2.44 % res_forward_subsumed: 0
% 2.13/2.44 % res_backward_subsumed: 0
% 2.13/2.44 % res_forward_subsumption_resolution: 0
% 2.13/2.44 % res_backward_subsumption_resolution: 0
% 2.13/2.44 % res_clause_to_clause_subsumption: 0
% 2.13/2.44 % res_orphan_elimination: 0
% 2.13/2.44 % res_tautology_del: 0
% 2.13/2.44 % res_num_eq_res_simplified: 0
% 2.13/2.44 % res_num_sel_changes: 0
% 2.13/2.44 % res_moves_from_active_to_pass: 0
% 2.13/2.44
% 2.13/2.44 % Status Unknown
% 2.25/2.44 % Last status :
% 2.25/2.44 % SZS status Unknown
%------------------------------------------------------------------------------