%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWW437-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n029.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:53 EDT 2022
% Result : Unknown 1.86s 2.17s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW437-1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 4 23:57:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.43 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.43 % Orientation found
% 0.20/0.43 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_957010.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_d23210.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_e8ee2a | grep -v "SZS"
% 0.20/0.45
% 0.20/0.45 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.45
% 0.20/0.45 %
% 0.20/0.45 % ------ iProver source info
% 0.20/0.45
% 0.20/0.45 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.45 % git: non_committed_changes: true
% 0.20/0.45 % git: last_make_outside_of_git: true
% 0.20/0.45
% 0.20/0.45 %
% 0.20/0.45 % ------ Input Options
% 0.20/0.45
% 0.20/0.45 % --out_options all
% 0.20/0.45 % --tptp_safe_out true
% 0.20/0.45 % --problem_path ""
% 0.20/0.45 % --include_path ""
% 0.20/0.45 % --clausifier .//eprover
% 0.20/0.45 % --clausifier_options --tstp-format
% 0.20/0.45 % --stdin false
% 0.20/0.45 % --dbg_backtrace false
% 0.20/0.45 % --dbg_dump_prop_clauses false
% 0.20/0.45 % --dbg_dump_prop_clauses_file -
% 0.20/0.45 % --dbg_out_stat false
% 0.20/0.45
% 0.20/0.45 % ------ General Options
% 0.20/0.45
% 0.20/0.45 % --fof false
% 0.20/0.45 % --time_out_real 150.
% 0.20/0.45 % --time_out_prep_mult 0.2
% 0.20/0.45 % --time_out_virtual -1.
% 0.20/0.45 % --schedule none
% 0.20/0.45 % --ground_splitting input
% 0.20/0.45 % --splitting_nvd 16
% 0.20/0.45 % --non_eq_to_eq false
% 0.20/0.45 % --prep_gs_sim true
% 0.20/0.45 % --prep_unflatten false
% 0.20/0.45 % --prep_res_sim true
% 0.20/0.45 % --prep_upred true
% 0.20/0.45 % --res_sim_input true
% 0.20/0.45 % --clause_weak_htbl true
% 0.20/0.45 % --gc_record_bc_elim false
% 0.20/0.45 % --symbol_type_check false
% 0.20/0.45 % --clausify_out false
% 0.20/0.45 % --large_theory_mode false
% 0.20/0.45 % --prep_sem_filter none
% 0.20/0.45 % --prep_sem_filter_out false
% 0.20/0.45 % --preprocessed_out false
% 0.20/0.45 % --sub_typing false
% 0.20/0.45 % --brand_transform false
% 0.20/0.45 % --pure_diseq_elim true
% 0.20/0.45 % --min_unsat_core false
% 0.20/0.45 % --pred_elim true
% 0.20/0.45 % --add_important_lit false
% 0.20/0.45 % --soft_assumptions false
% 0.20/0.45 % --reset_solvers false
% 0.20/0.45 % --bc_imp_inh []
% 0.20/0.45 % --conj_cone_tolerance 1.5
% 0.20/0.45 % --prolific_symb_bound 500
% 0.20/0.45 % --lt_threshold 2000
% 0.20/0.45
% 0.20/0.45 % ------ SAT Options
% 0.20/0.45
% 0.20/0.45 % --sat_mode false
% 0.20/0.45 % --sat_fm_restart_options ""
% 0.20/0.45 % --sat_gr_def false
% 0.20/0.45 % --sat_epr_types true
% 0.20/0.45 % --sat_non_cyclic_types false
% 0.20/0.45 % --sat_finite_models false
% 0.20/0.45 % --sat_fm_lemmas false
% 0.20/0.45 % --sat_fm_prep false
% 0.20/0.45 % --sat_fm_uc_incr true
% 0.20/0.45 % --sat_out_model small
% 0.20/0.45 % --sat_out_clauses false
% 0.20/0.45
% 0.20/0.45 % ------ QBF Options
% 0.20/0.45
% 0.20/0.45 % --qbf_mode false
% 0.20/0.45 % --qbf_elim_univ true
% 0.20/0.45 % --qbf_sk_in true
% 0.20/0.45 % --qbf_pred_elim true
% 0.20/0.45 % --qbf_split 32
% 0.20/0.45
% 0.20/0.45 % ------ BMC1 Options
% 0.20/0.45
% 0.20/0.45 % --bmc1_incremental false
% 0.20/0.45 % --bmc1_axioms reachable_all
% 0.20/0.45 % --bmc1_min_bound 0
% 0.20/0.45 % --bmc1_max_bound -1
% 0.20/0.45 % --bmc1_max_bound_default -1
% 0.20/0.45 % --bmc1_symbol_reachability true
% 0.20/0.45 % --bmc1_property_lemmas false
% 0.20/0.45 % --bmc1_k_induction false
% 0.20/0.45 % --bmc1_non_equiv_states false
% 0.20/0.45 % --bmc1_deadlock false
% 0.20/0.45 % --bmc1_ucm false
% 0.20/0.45 % --bmc1_add_unsat_core none
% 0.20/0.45 % --bmc1_unsat_core_children false
% 0.20/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.45 % --bmc1_out_stat full
% 0.20/0.45 % --bmc1_ground_init false
% 0.20/0.45 % --bmc1_pre_inst_next_state false
% 0.20/0.45 % --bmc1_pre_inst_state false
% 0.20/0.45 % --bmc1_pre_inst_reach_state false
% 0.20/0.45 % --bmc1_out_unsat_core false
% 0.20/0.45 % --bmc1_aig_witness_out false
% 0.20/0.45 % --bmc1_verbose false
% 0.20/0.45 % --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_957010.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.72/1.98 % --inst_prop_sim_given true
% 1.72/1.98 % --inst_prop_sim_new false
% 1.72/1.98 % --inst_orphan_elimination true
% 1.72/1.98 % --inst_learning_loop_flag true
% 1.72/1.98 % --inst_learning_start 3000
% 1.72/1.98 % --inst_learning_factor 2
% 1.72/1.98 % --inst_start_prop_sim_after_learn 3
% 1.72/1.98 % --inst_sel_renew solver
% 1.72/1.98 % --inst_lit_activity_flag true
% 1.72/1.98 % --inst_out_proof true
% 1.72/1.98
% 1.72/1.98 % ------ Resolution Options
% 1.72/1.98
% 1.72/1.98 % --resolution_flag true
% 1.72/1.98 % --res_lit_sel kbo_max
% 1.72/1.98 % --res_to_prop_solver none
% 1.72/1.98 % --res_prop_simpl_new false
% 1.72/1.98 % --res_prop_simpl_given false
% 1.72/1.98 % --res_passive_queue_type priority_queues
% 1.72/1.98 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.72/1.98 % --res_passive_queues_freq [15;5]
% 1.72/1.98 % --res_forward_subs full
% 1.72/1.98 % --res_backward_subs full
% 1.72/1.98 % --res_forward_subs_resolution true
% 1.72/1.98 % --res_backward_subs_resolution true
% 1.72/1.98 % --res_orphan_elimination false
% 1.72/1.98 % --res_time_limit 1000.
% 1.72/1.98 % --res_out_proof true
% 1.72/1.98 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_957010.s
% 1.72/1.98 % --modulo true
% 1.72/1.98
% 1.72/1.98 % ------ Combination Options
% 1.72/1.98
% 1.72/1.98 % --comb_res_mult 1000
% 1.72/1.98 % --comb_inst_mult 300
% 1.72/1.98 % ------
% 1.72/1.98
% 1.72/1.98
% 1.72/1.98
% 1.72/1.98 % ------ Proving...
% 1.72/1.98 % warning: shown sat in sat incomplete mode
% 1.72/1.98 %
% 1.72/1.98
% 1.72/1.98
% 1.72/1.98 ------ Building Model...Done
% 1.72/1.98
% 1.72/1.98 %------ The model is defined over ground terms (initial term algebra).
% 1.72/1.98 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.72/1.98 %------ where \phi is a formula over the term algebra.
% 1.72/1.98 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.72/1.98 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.72/1.98 %------ See help for --sat_out_model for different model outputs.
% 1.72/1.98 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.72/1.98 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.72/1.98
% 1.72/1.98
% 1.72/1.98
% 1.72/1.98
% 1.72/1.98 %------ Positive definition of equality_sorted
% 1.72/1.98 fof(lit_def,axiom,
% 1.72/1.98 (! [X0,X0,X1] :
% 1.72/1.98 ( equality_sorted(X0,X0,X1) <=>
% 1.72/1.98 (
% 1.72/1.98 ? [X2] :
% 1.72/1.98 (
% 1.72/1.98 ( X0=$i & X0=sep(lseg(X2,X2),X1) )
% 1.72/1.98 )
% 1.72/1.98
% 1.72/1.98 |
% 1.72/1.98 ? [X2,X3,X4] :
% 1.72/1.98 (
% 1.72/1.98 ( X0=$i & X0=sep(X2,sep(X3,X4)) & X1=sep(X3,sep(X2,X4)) )
% 1.72/1.98 )
% 1.72/1.98
% 1.72/1.98 )
% 1.72/1.98 )
% 1.72/1.98 )
% 1.72/1.98 ).
% 1.72/1.98
% 1.72/1.98 %------ Positive definition of heap
% 1.72/1.98 fof(lit_def,axiom,
% 1.72/1.98 (! [X0] :
% 1.72/1.98 ( heap(X0) <=>
% 1.72/1.98 (
% 1.72/1.98 (
% 1.72/1.98 ( X0=sep(lseg(x5,x1),sep(lseg(x12,x8),sep(lseg(x2,x6),sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x10,x15),sep(lseg(x10,x5),sep(lseg(x7,x1),sep(lseg(x3,x12),sep(lseg(x3,x16),sep(lseg(x11,x8),emp))))))))))) )
% 1.72/1.98 )
% 1.72/1.98
% 1.72/1.98 )
% 1.72/1.98 )
% 1.72/1.98 )
% 1.72/1.98 ).
% 1.72/1.98
% 1.72/1.98
% 1.72/1.98
% 1.72/1.98 % ------ Statistics
% 1.72/1.98
% 1.72/1.98 % ------ General
% 1.72/1.98
% 1.72/1.98 % num_of_input_clauses: 49
% 1.72/1.98 % num_of_input_neg_conjectures: 1
% 1.72/1.98 % num_of_splits: 0
% 1.72/1.98 % num_of_split_atoms: 0
% 1.72/1.98 % num_of_sem_filtered_clauses: 0
% 1.72/1.98 % num_of_subtypes: 0
% 1.72/1.98 % monotx_restored_types: 0
% 1.72/1.98 % sat_num_of_epr_types: 0
% 1.72/1.98 % sat_num_of_non_cyclic_types: 0
% 1.72/1.98 % sat_guarded_non_collapsed_types: 0
% 1.72/1.98 % is_epr: 0
% 1.72/1.98 % is_horn: 0
% 1.72/1.98 % has_eq: 1
% 1.72/1.98 % num_pure_diseq_elim: 0
% 1.72/1.98 % simp_replaced_by: 0
% 1.72/1.98 % res_preprocessed: 29
% 1.72/1.98 % prep_upred: 0
% 1.72/1.98 % prep_unflattend: 0
% 1.72/1.98 % pred_elim_cands: 0
% 1.72/1.98 % pred_elim: 0
% 1.72/1.98 % pred_elim_cl: 0
% 1.72/1.98 % pred_elim_cycles: 0
% 1.72/1.98 % forced_gc_time: 0
% 1.72/1.99 % gc_basic_clause_elim: 0
% 1.72/1.99 % parsing_time: 0.002
% 1.72/1.99 % sem_filter_time: 0.
% 1.72/1.99 % pred_elim_time: 0.
% 1.72/1.99 % out_proof_time: 0.
% 1.72/1.99 % monotx_time: 0.
% 1.72/1.99 % subtype_inf_time: 0.
% 1.72/1.99 % unif_index_cands_time: 0.001
% 1.72/1.99 % unif_index_add_time: 0.003
% 1.72/1.99 % total_time: 1.549
% 1.72/1.99 % num_of_symbols: 47
% 1.72/1.99 % num_of_terms: 13266
% 1.72/1.99
% 1.72/1.99 % ------ Propositional Solver
% 1.72/1.99
% 1.72/1.99 % prop_solver_calls: 2
% 1.72/1.99 % prop_fast_solver_calls: 60
% 1.72/1.99 % prop_num_of_clauses: 56
% 1.72/1.99 % prop_preprocess_simplified: 297
% 1.72/1.99 % prop_fo_subsumed: 0
% 1.72/1.99 % prop_solver_time: 0.
% 1.72/1.99 % prop_fast_solver_time: 0.
% 1.72/1.99 % prop_unsat_core_time: 0.
% 1.72/1.99
% 1.72/1.99 % ------ QBF
% 1.72/1.99
% 1.72/1.99 % qbf_q_res: 0
% 1.72/1.99 % qbf_num_tautologies: 0
% 1.72/1.99 % qbf_prep_cycles: 0
% 1.72/1.99
% 1.72/1.99 % ------ BMC1
% 1.72/1.99
% 1.72/1.99 % bmc1_current_bound: -1
% 1.72/1.99 % bmc1_last_solved_bound: -1
% 1.72/1.99 % bmc1_unsat_core_size: -1
% 1.72/1.99 % bmc1_unsat_core_parents_size: -1
% 1.72/1.99 % bmc1_merge_next_fun: 0
% 1.72/1.99 % bmc1_unsat_core_clauses_time: 0.
% 1.72/1.99
% 1.72/1.99 % ------ Instantiation
% 1.72/1.99
% 1.72/1.99 % inst_num_of_clauses: 49
% 1.72/1.99 % inst_num_in_passive: 0
% 1.72/1.99 % inst_num_in_active: 49
% 1.72/1.99 % inst_num_in_unprocessed: 0
% 1.72/1.99 % inst_num_of_loops: 51
% 1.72/1.99 % inst_num_of_learning_restarts: 0
% 1.72/1.99 % inst_num_moves_active_passive: 0
% 1.72/1.99 % inst_lit_activity: 5
% 1.72/1.99 % inst_lit_activity_moves: 0
% 1.72/1.99 % inst_num_tautologies: 0
% 1.72/1.99 % inst_num_prop_implied: 0
% 1.72/1.99 % inst_num_existing_simplified: 0
% 1.72/1.99 % inst_num_eq_res_simplified: 0
% 1.72/1.99 % inst_num_child_elim: 0
% 1.72/1.99 % inst_num_of_dismatching_blockings: 0
% 1.72/1.99 % inst_num_of_non_proper_insts: 0
% 1.72/1.99 % inst_num_of_duplicates: 0
% 1.72/1.99 % inst_inst_num_from_inst_to_res: 0
% 1.72/1.99 % inst_dismatching_checking_time: 0.
% 1.72/1.99
% 1.72/1.99 % ------ Resolution
% 1.72/1.99
% 1.72/1.99 % res_num_of_clauses: 914
% 1.72/1.99 % res_num_in_passive: 392
% 1.72/1.99 % res_num_in_active: 511
% 1.72/1.99 % res_num_of_loops: 1000
% 1.72/1.99 % res_forward_subset_subsumed: 9
% 1.72/1.99 % res_backward_subset_subsumed: 0
% 1.72/1.99 % res_forward_subsumed: 500
% 1.72/1.99 % res_backward_subsumed: 0
% 1.72/1.99 % res_forward_subsumption_resolution: 26
% 1.72/1.99 % res_backward_subsumption_resolution: 0
% 1.72/1.99 % res_clause_to_clause_subsumption: 8182
% 1.72/1.99 % res_orphan_elimination: 0
% 1.72/1.99 % res_tautology_del: 0
% 1.72/1.99 % res_num_eq_res_simplified: 0
% 1.72/1.99 % res_num_sel_changes: 0
% 1.72/1.99 % res_moves_from_active_to_pass: 0
% 1.72/1.99
% 1.72/1.99 % Status Unknown
% 1.82/2.02 % Orienting using strategy ClausalAll
% 1.82/2.02 % Orientation found
% 1.82/2.02 % 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_957010.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_d23210.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_6da8a5 | grep -v "SZS"
% 1.82/2.04
% 1.82/2.04 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.82/2.04
% 1.82/2.04 %
% 1.82/2.04 % ------ iProver source info
% 1.82/2.04
% 1.82/2.04 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.82/2.04 % git: non_committed_changes: true
% 1.82/2.04 % git: last_make_outside_of_git: true
% 1.82/2.04
% 1.82/2.04 %
% 1.82/2.04 % ------ Input Options
% 1.82/2.04
% 1.82/2.04 % --out_options all
% 1.82/2.04 % --tptp_safe_out true
% 1.82/2.04 % --problem_path ""
% 1.82/2.04 % --include_path ""
% 1.82/2.04 % --clausifier .//eprover
% 1.82/2.04 % --clausifier_options --tstp-format
% 1.82/2.04 % --stdin false
% 1.82/2.04 % --dbg_backtrace false
% 1.82/2.04 % --dbg_dump_prop_clauses false
% 1.82/2.04 % --dbg_dump_prop_clauses_file -
% 1.82/2.04 % --dbg_out_stat false
% 1.82/2.04
% 1.82/2.04 % ------ General Options
% 1.82/2.04
% 1.82/2.04 % --fof false
% 1.82/2.04 % --time_out_real 150.
% 1.82/2.04 % --time_out_prep_mult 0.2
% 1.82/2.04 % --time_out_virtual -1.
% 1.82/2.04 % --schedule none
% 1.82/2.04 % --ground_splitting input
% 1.82/2.04 % --splitting_nvd 16
% 1.82/2.04 % --non_eq_to_eq false
% 1.82/2.04 % --prep_gs_sim true
% 1.82/2.04 % --prep_unflatten false
% 1.82/2.04 % --prep_res_sim true
% 1.82/2.04 % --prep_upred true
% 1.82/2.04 % --res_sim_input true
% 1.82/2.04 % --clause_weak_htbl true
% 1.82/2.04 % --gc_record_bc_elim false
% 1.82/2.04 % --symbol_type_check false
% 1.82/2.04 % --clausify_out false
% 1.82/2.04 % --large_theory_mode false
% 1.82/2.04 % --prep_sem_filter none
% 1.82/2.04 % --prep_sem_filter_out false
% 1.82/2.04 % --preprocessed_out false
% 1.82/2.04 % --sub_typing false
% 1.82/2.04 % --brand_transform false
% 1.82/2.04 % --pure_diseq_elim true
% 1.82/2.04 % --min_unsat_core false
% 1.82/2.04 % --pred_elim true
% 1.82/2.04 % --add_important_lit false
% 1.82/2.04 % --soft_assumptions false
% 1.82/2.04 % --reset_solvers false
% 1.82/2.04 % --bc_imp_inh []
% 1.82/2.04 % --conj_cone_tolerance 1.5
% 1.82/2.04 % --prolific_symb_bound 500
% 1.82/2.04 % --lt_threshold 2000
% 1.82/2.04
% 1.82/2.04 % ------ SAT Options
% 1.82/2.04
% 1.82/2.04 % --sat_mode false
% 1.82/2.04 % --sat_fm_restart_options ""
% 1.82/2.04 % --sat_gr_def false
% 1.82/2.04 % --sat_epr_types true
% 1.82/2.04 % --sat_non_cyclic_types false
% 1.82/2.04 % --sat_finite_models false
% 1.82/2.04 % --sat_fm_lemmas false
% 1.82/2.04 % --sat_fm_prep false
% 1.82/2.04 % --sat_fm_uc_incr true
% 1.82/2.04 % --sat_out_model small
% 1.82/2.04 % --sat_out_clauses false
% 1.82/2.04
% 1.82/2.04 % ------ QBF Options
% 1.82/2.04
% 1.82/2.04 % --qbf_mode false
% 1.82/2.04 % --qbf_elim_univ true
% 1.82/2.04 % --qbf_sk_in true
% 1.82/2.04 % --qbf_pred_elim true
% 1.82/2.04 % --qbf_split 32
% 1.82/2.04
% 1.82/2.04 % ------ BMC1 Options
% 1.82/2.04
% 1.82/2.04 % --bmc1_incremental false
% 1.82/2.04 % --bmc1_axioms reachable_all
% 1.82/2.04 % --bmc1_min_bound 0
% 1.82/2.04 % --bmc1_max_bound -1
% 1.82/2.04 % --bmc1_max_bound_default -1
% 1.82/2.04 % --bmc1_symbol_reachability true
% 1.82/2.04 % --bmc1_property_lemmas false
% 1.82/2.04 % --bmc1_k_induction false
% 1.82/2.04 % --bmc1_non_equiv_states false
% 1.82/2.04 % --bmc1_deadlock false
% 1.82/2.04 % --bmc1_ucm false
% 1.82/2.04 % --bmc1_add_unsat_core none
% 1.82/2.04 % --bmc1_unsat_core_children false
% 1.82/2.04 % --bmc1_unsat_core_extrapolate_axioms false
% 1.82/2.04 % --bmc1_out_stat full
% 1.82/2.04 % --bmc1_ground_init false
% 1.82/2.04 % --bmc1_pre_inst_next_state false
% 1.82/2.04 % --bmc1_pre_inst_state false
% 1.82/2.04 % --bmc1_pre_inst_reach_state false
% 1.82/2.04 % --bmc1_out_unsat_core false
% 1.82/2.04 % --bmc1_aig_witness_out false
% 1.82/2.04 % --bmc1_verbose false
% 1.82/2.04 % --bmc1_dump_clauses_tptp false
% 1.86/2.16 % --bmc1_dump_unsat_core_tptp false
% 1.86/2.16 % --bmc1_dump_file -
% 1.86/2.16 % --bmc1_ucm_expand_uc_limit 128
% 1.86/2.16 % --bmc1_ucm_n_expand_iterations 6
% 1.86/2.16 % --bmc1_ucm_extend_mode 1
% 1.86/2.16 % --bmc1_ucm_init_mode 2
% 1.86/2.16 % --bmc1_ucm_cone_mode none
% 1.86/2.16 % --bmc1_ucm_reduced_relation_type 0
% 1.86/2.16 % --bmc1_ucm_relax_model 4
% 1.86/2.16 % --bmc1_ucm_full_tr_after_sat true
% 1.86/2.16 % --bmc1_ucm_expand_neg_assumptions false
% 1.86/2.16 % --bmc1_ucm_layered_model none
% 1.86/2.16 % --bmc1_ucm_max_lemma_size 10
% 1.86/2.16
% 1.86/2.16 % ------ AIG Options
% 1.86/2.16
% 1.86/2.16 % --aig_mode false
% 1.86/2.16
% 1.86/2.16 % ------ Instantiation Options
% 1.86/2.16
% 1.86/2.16 % --instantiation_flag true
% 1.86/2.16 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.86/2.16 % --inst_solver_per_active 750
% 1.86/2.16 % --inst_solver_calls_frac 0.5
% 1.86/2.16 % --inst_passive_queue_type priority_queues
% 1.86/2.16 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.86/2.16 % --inst_passive_queues_freq [25;2]
% 1.86/2.16 % --inst_dismatching true
% 1.86/2.16 % --inst_eager_unprocessed_to_passive true
% 1.86/2.16 % --inst_prop_sim_given true
% 1.86/2.16 % --inst_prop_sim_new false
% 1.86/2.16 % --inst_orphan_elimination true
% 1.86/2.16 % --inst_learning_loop_flag true
% 1.86/2.16 % --inst_learning_start 3000
% 1.86/2.16 % --inst_learning_factor 2
% 1.86/2.16 % --inst_start_prop_sim_after_learn 3
% 1.86/2.16 % --inst_sel_renew solver
% 1.86/2.16 % --inst_lit_activity_flag true
% 1.86/2.16 % --inst_out_proof true
% 1.86/2.16
% 1.86/2.16 % ------ Resolution Options
% 1.86/2.16
% 1.86/2.16 % --resolution_flag true
% 1.86/2.16 % --res_lit_sel kbo_max
% 1.86/2.16 % --res_to_prop_solver none
% 1.86/2.16 % --res_prop_simpl_new false
% 1.86/2.16 % --res_prop_simpl_given false
% 1.86/2.16 % --res_passive_queue_type priority_queues
% 1.86/2.16 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.86/2.16 % --res_passive_queues_freq [15;5]
% 1.86/2.16 % --res_forward_subs full
% 1.86/2.16 % --res_backward_subs full
% 1.86/2.16 % --res_forward_subs_resolution true
% 1.86/2.16 % --res_backward_subs_resolution true
% 1.86/2.16 % --res_orphan_elimination false
% 1.86/2.16 % --res_time_limit 1000.
% 1.86/2.16 % --res_out_proof true
% 1.86/2.16 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_957010.s
% 1.86/2.16 % --modulo true
% 1.86/2.16
% 1.86/2.16 % ------ Combination Options
% 1.86/2.16
% 1.86/2.16 % --comb_res_mult 1000
% 1.86/2.16 % --comb_inst_mult 300
% 1.86/2.16 % ------
% 1.86/2.16
% 1.86/2.16 % ------ Parsing...% successful
% 1.86/2.16
% 1.86/2.16 % ------ 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.86/2.16
% 1.86/2.16 % ------ Proving...
% 1.86/2.16 % ------ Problem Properties
% 1.86/2.16
% 1.86/2.16 %
% 1.86/2.16 % EPR false
% 1.86/2.16 % Horn false
% 1.86/2.16 % Has equality true
% 1.86/2.16
% 1.86/2.16 % % ------ Input Options Time Limit: Unbounded
% 1.86/2.16
% 1.86/2.16
% 1.86/2.16 Compiling...
% 1.86/2.16 Loading plugin: done.
% 1.86/2.16 % % ------ Current options:
% 1.86/2.16
% 1.86/2.16 % ------ Input Options
% 1.86/2.16
% 1.86/2.16 % --out_options all
% 1.86/2.16 % --tptp_safe_out true
% 1.86/2.16 % --problem_path ""
% 1.86/2.16 % --include_path ""
% 1.86/2.16 % --clausifier .//eprover
% 1.86/2.16 % --clausifier_options --tstp-format
% 1.86/2.16 % --stdin false
% 1.86/2.16 % --dbg_backtrace false
% 1.86/2.16 % --dbg_dump_prop_clauses false
% 1.86/2.16 % --dbg_dump_prop_clauses_file -
% 1.86/2.16 % --dbg_out_stat false
% 1.86/2.16
% 1.86/2.16 % ------ General Options
% 1.86/2.16
% 1.86/2.16 % --fof false
% 1.86/2.16 % --time_out_real 150.
% 1.86/2.16 % --time_out_prep_mult 0.2
% 1.86/2.16 % --time_out_virtual -1.
% 1.86/2.16 % --schedule none
% 1.86/2.16 % --ground_splitting input
% 1.86/2.16 % --splitting_nvd 16
% 1.86/2.16 % --non_eq_to_eq false
% 1.86/2.16 % --prep_gs_sim true
% 1.86/2.16 % --prep_unflatten false
% 1.86/2.16 % --prep_res_sim true
% 1.86/2.16 % --prep_upred true
% 1.86/2.16 % --res_sim_input true
% 1.86/2.16 % --clause_weak_htbl true
% 1.86/2.16 % --gc_record_bc_elim false
% 1.86/2.16 % --symbol_type_check false
% 1.86/2.16 % --clausify_out false
% 1.86/2.16 % --large_theory_mode false
% 1.86/2.16 % --prep_sem_filter none
% 1.86/2.16 % --prep_sem_filter_out false
% 1.86/2.16 % --preprocessed_out false
% 1.86/2.16 % --sub_typing false
% 1.86/2.16 % --brand_transform false
% 1.86/2.16 % --pure_diseq_elim true
% 1.86/2.16 % --min_unsat_core false
% 1.86/2.16 % --pred_elim true
% 1.86/2.16 % --add_important_lit false
% 1.86/2.16 % --soft_assumptions false
% 1.86/2.16 % --reset_solvers false
% 1.86/2.16 % --bc_imp_inh []
% 1.86/2.16 % --conj_cone_tolerance 1.5
% 1.86/2.16 % --prolific_symb_bound 500
% 1.86/2.16 % --lt_threshold 2000
% 1.86/2.16
% 1.86/2.16 % ------ SAT Options
% 1.86/2.16
% 1.86/2.16 % --sat_mode false
% 1.86/2.16 % --sat_fm_restart_options ""
% 1.86/2.16 % --sat_gr_def false
% 1.86/2.16 % --sat_epr_types true
% 1.86/2.16 % --sat_non_cyclic_types false
% 1.86/2.16 % --sat_finite_models false
% 1.86/2.16 % --sat_fm_lemmas false
% 1.86/2.16 % --sat_fm_prep false
% 1.86/2.16 % --sat_fm_uc_incr true
% 1.86/2.16 % --sat_out_model small
% 1.86/2.16 % --sat_out_clauses false
% 1.86/2.16
% 1.86/2.16 % ------ QBF Options
% 1.86/2.16
% 1.86/2.16 % --qbf_mode false
% 1.86/2.16 % --qbf_elim_univ true
% 1.86/2.16 % --qbf_sk_in true
% 1.86/2.16 % --qbf_pred_elim true
% 1.86/2.16 % --qbf_split 32
% 1.86/2.16
% 1.86/2.16 % ------ BMC1 Options
% 1.86/2.16
% 1.86/2.16 % --bmc1_incremental false
% 1.86/2.16 % --bmc1_axioms reachable_all
% 1.86/2.16 % --bmc1_min_bound 0
% 1.86/2.16 % --bmc1_max_bound -1
% 1.86/2.16 % --bmc1_max_bound_default -1
% 1.86/2.16 % --bmc1_symbol_reachability true
% 1.86/2.16 % --bmc1_property_lemmas false
% 1.86/2.16 % --bmc1_k_induction false
% 1.86/2.16 % --bmc1_non_equiv_states false
% 1.86/2.16 % --bmc1_deadlock false
% 1.86/2.16 % --bmc1_ucm false
% 1.86/2.16 % --bmc1_add_unsat_core none
% 1.86/2.16 % --bmc1_unsat_core_children false
% 1.86/2.16 % --bmc1_unsat_core_extrapolate_axioms false
% 1.86/2.16 % --bmc1_out_stat full
% 1.86/2.16 % --bmc1_ground_init false
% 1.86/2.16 % --bmc1_pre_inst_next_state false
% 1.86/2.16 % --bmc1_pre_inst_state false
% 1.86/2.16 % --bmc1_pre_inst_reach_state false
% 1.86/2.16 % --bmc1_out_unsat_core false
% 1.86/2.16 % --bmc1_aig_witness_out false
% 1.86/2.16 % --bmc1_verbose false
% 1.86/2.16 % --bmc1_dump_clauses_tptp false
% 1.86/2.16 % --bmc1_dump_unsat_core_tptp false
% 1.86/2.16 % --bmc1_dump_file -
% 1.86/2.16 % --bmc1_ucm_expand_uc_limit 128
% 1.86/2.16 % --bmc1_ucm_n_expand_iterations 6
% 1.86/2.16 % --bmc1_ucm_extend_mode 1
% 1.86/2.16 % --bmc1_ucm_init_mode 2
% 1.86/2.16 % --bmc1_ucm_cone_mode none
% 1.86/2.16 % --bmc1_ucm_reduced_relation_type 0
% 1.86/2.16 % --bmc1_ucm_relax_model 4
% 1.86/2.16 % --bmc1_ucm_full_tr_after_sat true
% 1.86/2.16 % --bmc1_ucm_expand_neg_assumptions false
% 1.86/2.16 % --bmc1_ucm_layered_model none
% 1.86/2.16 % --bmc1_ucm_max_lemma_size 10
% 1.86/2.16
% 1.86/2.16 % ------ AIG Options
% 1.86/2.16
% 1.86/2.16 % --aig_mode false
% 1.86/2.16
% 1.86/2.16 % ------ Instantiation Options
% 1.86/2.16
% 1.86/2.16 % --instantiation_flag true
% 1.86/2.16 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.86/2.16 % --inst_solver_per_active 750
% 1.86/2.16 % --inst_solver_calls_frac 0.5
% 1.86/2.16 % --inst_passive_queue_type priority_queues
% 1.86/2.16 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.86/2.16 % --inst_passive_queues_freq [25;2]
% 1.86/2.16 % --inst_dismatching true
% 1.86/2.16 % --inst_eager_unprocessed_to_passive true
% 1.86/2.16 % --inst_prop_sim_given true
% 1.86/2.16 % --inst_prop_sim_new false
% 1.86/2.16 % --inst_orphan_elimination true
% 1.86/2.16 % --inst_learning_loop_flag true
% 1.86/2.16 % --inst_learning_start 3000
% 1.86/2.16 % --inst_learning_factor 2
% 1.86/2.16 % --inst_start_prop_sim_after_learn 3
% 1.86/2.16 % --inst_sel_renew solver
% 1.86/2.16 % --inst_lit_activity_flag true
% 1.86/2.16 % --inst_out_proof true
% 1.86/2.16
% 1.86/2.16 % ------ Resolution Options
% 1.86/2.16
% 1.86/2.16 % --resolution_flag true
% 1.86/2.16 % --res_lit_sel kbo_max
% 1.86/2.16 % --res_to_prop_solver none
% 1.86/2.16 % --res_prop_simpl_new false
% 1.86/2.16 % --res_prop_simpl_given false
% 1.86/2.16 % --res_passive_queue_type priority_queues
% 1.86/2.16 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.86/2.16 % --res_passive_queues_freq [15;5]
% 1.86/2.16 % --res_forward_subs full
% 1.86/2.16 % --res_backward_subs full
% 1.86/2.16 % --res_forward_subs_resolution true
% 1.86/2.16 % --res_backward_subs_resolution true
% 1.86/2.16 % --res_orphan_elimination false
% 1.86/2.16 % --res_time_limit 1000.
% 1.86/2.16 % --res_out_proof true
% 1.86/2.16 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_957010.s
% 1.86/2.16 % --modulo true
% 1.86/2.16
% 1.86/2.16 % ------ Combination Options
% 1.86/2.16
% 1.86/2.16 % --comb_res_mult 1000
% 1.86/2.16 % --comb_inst_mult 300
% 1.86/2.16 % ------
% 1.86/2.16
% 1.86/2.16
% 1.86/2.16
% 1.86/2.16 % ------ Proving...
% 1.86/2.16 % warning: shown sat in sat incomplete mode
% 1.86/2.16 %
% 1.86/2.16
% 1.86/2.16
% 1.86/2.16
% 1.86/2.16
% 1.86/2.16 cnf(c_31,plain,
% 1.86/2.16 ( x1 != x2 ),
% 1.86/2.16 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_123) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_78,plain,( x1 != x2 ),inference(copy,[status(esa)],[c_31]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_128,plain,( x1 != x2 ),inference(copy,[status(esa)],[c_78]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_163,plain,( x1 != x2 ),inference(copy,[status(esa)],[c_128]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_201,plain,( x1 != x2 ),inference(copy,[status(esa)],[c_163]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_346,plain,( x1 != x2 ),inference(copy,[status(esa)],[c_201]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_10,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X1 | X0 = X2 ),
% 1.86/2.16 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_48_0) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_270,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X1 | X0 = X2 ),
% 1.86/2.16 inference(copy,[status(esa)],[c_10]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_454,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x1,X0),sep(lseg(x1,x2),X1))) | x1 = X0 ),
% 1.86/2.16 inference(resolution,[status(thm)],[c_346,c_270]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_455,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x1,X0),sep(lseg(x1,x2),X1))) | x1 = X0 ),
% 1.86/2.16 inference(rewriting,[status(thm)],[c_454]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_30,plain,
% 1.86/2.16 ( x4 != x7 ),
% 1.86/2.16 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_122) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_76,plain,( x4 != x7 ),inference(copy,[status(esa)],[c_30]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_127,plain,( x4 != x7 ),inference(copy,[status(esa)],[c_76]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_164,plain,( x4 != x7 ),inference(copy,[status(esa)],[c_127]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_200,plain,( x4 != x7 ),inference(copy,[status(esa)],[c_164]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_344,plain,( x4 != x7 ),inference(copy,[status(esa)],[c_200]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_450,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x4,X0),sep(lseg(x4,x7),X1))) | x4 = X0 ),
% 1.86/2.16 inference(resolution,[status(thm)],[c_344,c_270]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_451,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x4,X0),sep(lseg(x4,x7),X1))) | x4 = X0 ),
% 1.86/2.16 inference(rewriting,[status(thm)],[c_450]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_29,plain,
% 1.86/2.16 ( x4 != x9 ),
% 1.86/2.16 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_121) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_74,plain,( x4 != x9 ),inference(copy,[status(esa)],[c_29]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_126,plain,( x4 != x9 ),inference(copy,[status(esa)],[c_74]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_165,plain,( x4 != x9 ),inference(copy,[status(esa)],[c_126]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_199,plain,( x4 != x9 ),inference(copy,[status(esa)],[c_165]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_342,plain,( x4 != x9 ),inference(copy,[status(esa)],[c_199]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_446,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x4,X0),sep(lseg(x4,x9),X1))) | x4 = X0 ),
% 1.86/2.16 inference(resolution,[status(thm)],[c_342,c_270]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_447,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x4,X0),sep(lseg(x4,x9),X1))) | x4 = X0 ),
% 1.86/2.16 inference(rewriting,[status(thm)],[c_446]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_28,plain,
% 1.86/2.16 ( x14 != x4 ),
% 1.86/2.16 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_120) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_72,plain,( x14 != x4 ),inference(copy,[status(esa)],[c_28]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_125,plain,( x14 != x4 ),inference(copy,[status(esa)],[c_72]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_166,plain,( x14 != x4 ),inference(copy,[status(esa)],[c_125]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_198,plain,( x14 != x4 ),inference(copy,[status(esa)],[c_166]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_340,plain,( x14 != x4 ),inference(copy,[status(esa)],[c_198]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_442,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x14,X0),sep(lseg(x14,x4),X1))) | x14 = X0 ),
% 1.86/2.16 inference(resolution,[status(thm)],[c_340,c_270]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_443,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x14,X0),sep(lseg(x14,x4),X1))) | x14 = X0 ),
% 1.86/2.16 inference(rewriting,[status(thm)],[c_442]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_27,plain,
% 1.86/2.16 ( x10 != x16 ),
% 1.86/2.16 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_119) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_70,plain,( x10 != x16 ),inference(copy,[status(esa)],[c_27]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_124,plain,( x10 != x16 ),inference(copy,[status(esa)],[c_70]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_167,plain,( x10 != x16 ),inference(copy,[status(esa)],[c_124]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_197,plain,( x10 != x16 ),inference(copy,[status(esa)],[c_167]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_338,plain,( x10 != x16 ),inference(copy,[status(esa)],[c_197]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_438,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x10,X0),sep(lseg(x10,x16),X1))) | x10 = X0 ),
% 1.86/2.16 inference(resolution,[status(thm)],[c_338,c_270]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_439,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x10,X0),sep(lseg(x10,x16),X1))) | x10 = X0 ),
% 1.86/2.16 inference(rewriting,[status(thm)],[c_438]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_26,plain,
% 1.86/2.16 ( x10 != x12 ),
% 1.86/2.16 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_118) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_68,plain,( x10 != x12 ),inference(copy,[status(esa)],[c_26]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_123,plain,( x10 != x12 ),inference(copy,[status(esa)],[c_68]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_168,plain,( x10 != x12 ),inference(copy,[status(esa)],[c_123]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_196,plain,( x10 != x12 ),inference(copy,[status(esa)],[c_168]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_336,plain,( x10 != x12 ),inference(copy,[status(esa)],[c_196]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_434,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x10,X0),sep(lseg(x10,x12),X1))) | x10 = X0 ),
% 1.86/2.16 inference(resolution,[status(thm)],[c_336,c_270]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_435,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x10,X0),sep(lseg(x10,x12),X1))) | x10 = X0 ),
% 1.86/2.16 inference(rewriting,[status(thm)],[c_434]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_25,plain,
% 1.86/2.16 ( x10 != x14 ),
% 1.86/2.16 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_117) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_66,plain,( x10 != x14 ),inference(copy,[status(esa)],[c_25]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_122,plain,( x10 != x14 ),inference(copy,[status(esa)],[c_66]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_169,plain,( x10 != x14 ),inference(copy,[status(esa)],[c_122]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_195,plain,( x10 != x14 ),inference(copy,[status(esa)],[c_169]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_334,plain,( x10 != x14 ),inference(copy,[status(esa)],[c_195]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_430,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x10,X0),sep(lseg(x10,x14),X1))) | x10 = X0 ),
% 1.86/2.16 inference(resolution,[status(thm)],[c_334,c_270]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_431,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x10,X0),sep(lseg(x10,x14),X1))) | x10 = X0 ),
% 1.86/2.16 inference(rewriting,[status(thm)],[c_430]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_24,plain,
% 1.86/2.16 ( x13 != x16 ),
% 1.86/2.16 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_116) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_64,plain,( x13 != x16 ),inference(copy,[status(esa)],[c_24]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_121,plain,( x13 != x16 ),inference(copy,[status(esa)],[c_64]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_170,plain,( x13 != x16 ),inference(copy,[status(esa)],[c_121]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_194,plain,( x13 != x16 ),inference(copy,[status(esa)],[c_170]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_332,plain,( x13 != x16 ),inference(copy,[status(esa)],[c_194]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_426,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x13,X0),sep(lseg(x13,x16),X1))) | x13 = X0 ),
% 1.86/2.16 inference(resolution,[status(thm)],[c_332,c_270]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_427,plain,
% 1.86/2.16 ( ~ heap(sep(lseg(x13,X0),sep(lseg(x13,x16),X1))) | x13 = X0 ),
% 1.86/2.16 inference(rewriting,[status(thm)],[c_426]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_23,plain,
% 1.86/2.16 ( x14 != x13 ),
% 1.86/2.16 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_115) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_62,plain,( x14 != x13 ),inference(copy,[status(esa)],[c_23]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_120,plain,( x14 != x13 ),inference(copy,[status(esa)],[c_62]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_171,plain,( x14 != x13 ),inference(copy,[status(esa)],[c_120]) ).
% 1.86/2.16
% 1.86/2.16 cnf(c_193,plain,( x14 != x13 ),inference(copy,[status(esa)],[c_171]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_330,plain,( x14 != x13 ),inference(copy,[status(esa)],[c_193]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_422,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x14,X0),sep(lseg(x14,x13),X1))) | x14 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_330,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_423,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x14,X0),sep(lseg(x14,x13),X1))) | x14 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_422]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_22,plain,
% 1.86/2.17 ( x5 != x16 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_114) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_60,plain,( x5 != x16 ),inference(copy,[status(esa)],[c_22]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_119,plain,( x5 != x16 ),inference(copy,[status(esa)],[c_60]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_172,plain,( x5 != x16 ),inference(copy,[status(esa)],[c_119]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_192,plain,( x5 != x16 ),inference(copy,[status(esa)],[c_172]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_328,plain,( x5 != x16 ),inference(copy,[status(esa)],[c_192]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_418,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x5,X0),sep(lseg(x5,x16),X1))) | x5 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_328,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_419,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x5,X0),sep(lseg(x5,x16),X1))) | x5 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_418]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_47,plain,
% 1.86/2.17 ( x6 != x7 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_139) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_110,plain,( x6 != x7 ),inference(copy,[status(esa)],[c_47]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_144,plain,( x6 != x7 ),inference(copy,[status(esa)],[c_110]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_147,plain,( x6 != x7 ),inference(copy,[status(esa)],[c_144]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_189,plain,( x6 != x7 ),inference(copy,[status(esa)],[c_147]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_322,plain,( x6 != x7 ),inference(copy,[status(esa)],[c_189]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_414,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x6,X0),sep(lseg(x6,x7),X1))) | x6 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_322,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_415,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x6,X0),sep(lseg(x6,x7),X1))) | x6 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_414]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_46,plain,
% 1.86/2.17 ( x9 != x6 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_138) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_108,plain,( x9 != x6 ),inference(copy,[status(esa)],[c_46]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_143,plain,( x9 != x6 ),inference(copy,[status(esa)],[c_108]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_148,plain,( x9 != x6 ),inference(copy,[status(esa)],[c_143]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_188,plain,( x9 != x6 ),inference(copy,[status(esa)],[c_148]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_320,plain,( x9 != x6 ),inference(copy,[status(esa)],[c_188]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_410,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x9,X0),sep(lseg(x9,x6),X1))) | x9 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_320,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_411,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x9,X0),sep(lseg(x9,x6),X1))) | x9 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_410]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_45,plain,
% 1.86/2.17 ( x16 != x11 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_137) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_106,plain,( x16 != x11 ),inference(copy,[status(esa)],[c_45]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_142,plain,( x16 != x11 ),inference(copy,[status(esa)],[c_106]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_149,plain,( x16 != x11 ),inference(copy,[status(esa)],[c_142]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_187,plain,( x16 != x11 ),inference(copy,[status(esa)],[c_149]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_318,plain,( x16 != x11 ),inference(copy,[status(esa)],[c_187]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_406,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x16,X0),sep(lseg(x16,x11),X1))) | x16 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_318,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_407,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x16,X0),sep(lseg(x16,x11),X1))) | x16 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_406]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_44,plain,
% 1.86/2.17 ( x12 != x11 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_136) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_104,plain,( x12 != x11 ),inference(copy,[status(esa)],[c_44]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_141,plain,( x12 != x11 ),inference(copy,[status(esa)],[c_104]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_150,plain,( x12 != x11 ),inference(copy,[status(esa)],[c_141]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_186,plain,( x12 != x11 ),inference(copy,[status(esa)],[c_150]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_316,plain,( x12 != x11 ),inference(copy,[status(esa)],[c_186]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_402,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x12,X0),sep(lseg(x12,x11),X1))) | x12 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_316,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_403,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x12,X0),sep(lseg(x12,x11),X1))) | x12 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_402]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_43,plain,
% 1.86/2.17 ( x3 != x6 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_135) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_102,plain,( x3 != x6 ),inference(copy,[status(esa)],[c_43]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_140,plain,( x3 != x6 ),inference(copy,[status(esa)],[c_102]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_151,plain,( x3 != x6 ),inference(copy,[status(esa)],[c_140]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_185,plain,( x3 != x6 ),inference(copy,[status(esa)],[c_151]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_314,plain,( x3 != x6 ),inference(copy,[status(esa)],[c_185]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_398,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x3,X0),sep(lseg(x3,x6),X1))) | x3 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_314,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_399,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x3,X0),sep(lseg(x3,x6),X1))) | x3 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_398]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_42,plain,
% 1.86/2.17 ( x8 != x3 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_134) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_100,plain,( x8 != x3 ),inference(copy,[status(esa)],[c_42]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_139,plain,( x8 != x3 ),inference(copy,[status(esa)],[c_100]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_152,plain,( x8 != x3 ),inference(copy,[status(esa)],[c_139]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_184,plain,( x8 != x3 ),inference(copy,[status(esa)],[c_152]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_312,plain,( x8 != x3 ),inference(copy,[status(esa)],[c_184]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_394,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x8,X0),sep(lseg(x8,x3),X1))) | x8 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_312,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_395,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x8,X0),sep(lseg(x8,x3),X1))) | x8 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_394]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_41,plain,
% 1.86/2.17 ( x3 != x11 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_133) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_98,plain,( x3 != x11 ),inference(copy,[status(esa)],[c_41]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_138,plain,( x3 != x11 ),inference(copy,[status(esa)],[c_98]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_153,plain,( x3 != x11 ),inference(copy,[status(esa)],[c_138]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_183,plain,( x3 != x11 ),inference(copy,[status(esa)],[c_153]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_310,plain,( x3 != x11 ),inference(copy,[status(esa)],[c_183]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_390,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x3,X0),sep(lseg(x3,x11),X1))) | x3 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_310,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_391,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x3,X0),sep(lseg(x3,x11),X1))) | x3 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_390]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_40,plain,
% 1.86/2.17 ( x4 != x3 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_132) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_96,plain,( x4 != x3 ),inference(copy,[status(esa)],[c_40]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_137,plain,( x4 != x3 ),inference(copy,[status(esa)],[c_96]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_154,plain,( x4 != x3 ),inference(copy,[status(esa)],[c_137]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_182,plain,( x4 != x3 ),inference(copy,[status(esa)],[c_154]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_308,plain,( x4 != x3 ),inference(copy,[status(esa)],[c_182]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_386,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x4,X0),sep(lseg(x4,x3),X1))) | x4 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_308,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_387,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x4,X0),sep(lseg(x4,x3),X1))) | x4 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_386]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_39,plain,
% 1.86/2.17 ( x8 != x7 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_131) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_94,plain,( x8 != x7 ),inference(copy,[status(esa)],[c_39]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_136,plain,( x8 != x7 ),inference(copy,[status(esa)],[c_94]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_155,plain,( x8 != x7 ),inference(copy,[status(esa)],[c_136]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_181,plain,( x8 != x7 ),inference(copy,[status(esa)],[c_155]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_306,plain,( x8 != x7 ),inference(copy,[status(esa)],[c_181]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_382,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x8,X0),sep(lseg(x8,x7),X1))) | x8 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_306,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_383,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x8,X0),sep(lseg(x8,x7),X1))) | x8 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_382]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_38,plain,
% 1.86/2.17 ( x16 != x7 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_130) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_92,plain,( x16 != x7 ),inference(copy,[status(esa)],[c_38]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_135,plain,( x16 != x7 ),inference(copy,[status(esa)],[c_92]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_156,plain,( x16 != x7 ),inference(copy,[status(esa)],[c_135]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_180,plain,( x16 != x7 ),inference(copy,[status(esa)],[c_156]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_304,plain,( x16 != x7 ),inference(copy,[status(esa)],[c_180]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_378,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x16,X0),sep(lseg(x16,x7),X1))) | x16 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_304,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_379,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x16,X0),sep(lseg(x16,x7),X1))) | x16 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_378]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_37,plain,
% 1.86/2.17 ( x15 != x7 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_129) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_90,plain,( x15 != x7 ),inference(copy,[status(esa)],[c_37]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_134,plain,( x15 != x7 ),inference(copy,[status(esa)],[c_90]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_157,plain,( x15 != x7 ),inference(copy,[status(esa)],[c_134]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_179,plain,( x15 != x7 ),inference(copy,[status(esa)],[c_157]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_302,plain,( x15 != x7 ),inference(copy,[status(esa)],[c_179]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_374,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x15,X0),sep(lseg(x15,x7),X1))) | x15 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_302,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_375,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x15,X0),sep(lseg(x15,x7),X1))) | x15 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_374]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_36,plain,
% 1.86/2.17 ( x2 != x7 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_128) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_88,plain,( x2 != x7 ),inference(copy,[status(esa)],[c_36]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_133,plain,( x2 != x7 ),inference(copy,[status(esa)],[c_88]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_158,plain,( x2 != x7 ),inference(copy,[status(esa)],[c_133]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_178,plain,( x2 != x7 ),inference(copy,[status(esa)],[c_158]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_300,plain,( x2 != x7 ),inference(copy,[status(esa)],[c_178]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_370,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x2,X0),sep(lseg(x2,x7),X1))) | x2 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_300,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_371,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x2,X0),sep(lseg(x2,x7),X1))) | x2 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_370]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_35,plain,
% 1.86/2.17 ( x8 != x9 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_127) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_86,plain,( x8 != x9 ),inference(copy,[status(esa)],[c_35]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_132,plain,( x8 != x9 ),inference(copy,[status(esa)],[c_86]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_159,plain,( x8 != x9 ),inference(copy,[status(esa)],[c_132]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_177,plain,( x8 != x9 ),inference(copy,[status(esa)],[c_159]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_298,plain,( x8 != x9 ),inference(copy,[status(esa)],[c_177]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_366,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x8,X0),sep(lseg(x8,x9),X1))) | x8 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_298,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_367,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x8,X0),sep(lseg(x8,x9),X1))) | x8 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_366]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_34,plain,
% 1.86/2.17 ( x1 != x11 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_126) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_84,plain,( x1 != x11 ),inference(copy,[status(esa)],[c_34]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_131,plain,( x1 != x11 ),inference(copy,[status(esa)],[c_84]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_160,plain,( x1 != x11 ),inference(copy,[status(esa)],[c_131]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_176,plain,( x1 != x11 ),inference(copy,[status(esa)],[c_160]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_296,plain,( x1 != x11 ),inference(copy,[status(esa)],[c_176]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_362,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x1,X0),sep(lseg(x1,x11),X1))) | x1 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_296,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_363,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x1,X0),sep(lseg(x1,x11),X1))) | x1 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_362]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_33,plain,
% 1.86/2.17 ( x13 != x1 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_125) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_82,plain,( x13 != x1 ),inference(copy,[status(esa)],[c_33]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_130,plain,( x13 != x1 ),inference(copy,[status(esa)],[c_82]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_161,plain,( x13 != x1 ),inference(copy,[status(esa)],[c_130]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_175,plain,( x13 != x1 ),inference(copy,[status(esa)],[c_161]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_294,plain,( x13 != x1 ),inference(copy,[status(esa)],[c_175]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_358,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x13,X0),sep(lseg(x13,x1),X1))) | x13 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_294,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_359,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x13,X0),sep(lseg(x13,x1),X1))) | x13 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_358]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_32,plain,
% 1.86/2.17 ( x1 != x12 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_124) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_80,plain,( x1 != x12 ),inference(copy,[status(esa)],[c_32]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_129,plain,( x1 != x12 ),inference(copy,[status(esa)],[c_80]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_162,plain,( x1 != x12 ),inference(copy,[status(esa)],[c_129]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_174,plain,( x1 != x12 ),inference(copy,[status(esa)],[c_162]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_292,plain,( x1 != x12 ),inference(copy,[status(esa)],[c_174]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_354,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x1,X0),sep(lseg(x1,x12),X1))) | x1 = X0 ),
% 1.86/2.17 inference(resolution,[status(thm)],[c_292,c_270]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_355,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(x1,X0),sep(lseg(x1,x12),X1))) | x1 = X0 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_354]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_13,plain,
% 1.86/2.17 ( heap(sep(lseg(X0,X1),X2))
% 1.86/2.17 | X0 = X3
% 1.86/2.17 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))) ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_46_2) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_276,plain,
% 1.86/2.17 ( heap(sep(lseg(X0,X1),X2))
% 1.86/2.17 | X0 = X3
% 1.86/2.17 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_13]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_277,plain,
% 1.86/2.17 ( heap(sep(lseg(X0,X1),X2))
% 1.86/2.17 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2)))
% 1.86/2.17 | X0 = X3 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_276]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_48,plain,
% 1.86/2.17 ( heap(sep(lseg(x5,x1),sep(lseg(x12,x8),sep(lseg(x2,x6),sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x10,x15),sep(lseg(x10,x5),sep(lseg(x7,x1),sep(lseg(x3,x12),sep(lseg(x3,x16),sep(lseg(x11,x8),emp)))))))))))) ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_112) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_112,plain,
% 1.86/2.17 ( heap(sep(lseg(x5,x1),sep(lseg(x12,x8),sep(lseg(x2,x6),sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x10,x15),sep(lseg(x10,x5),sep(lseg(x7,x1),sep(lseg(x3,x12),sep(lseg(x3,x16),sep(lseg(x11,x8),emp)))))))))))) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_48]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_145,plain,
% 1.86/2.17 ( heap(sep(lseg(x5,x1),sep(lseg(x12,x8),sep(lseg(x2,x6),sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x10,x15),sep(lseg(x10,x5),sep(lseg(x7,x1),sep(lseg(x3,x12),sep(lseg(x3,x16),sep(lseg(x11,x8),emp)))))))))))) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_112]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_146,plain,
% 1.86/2.17 ( heap(sep(lseg(x5,x1),sep(lseg(x12,x8),sep(lseg(x2,x6),sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x10,x15),sep(lseg(x10,x5),sep(lseg(x7,x1),sep(lseg(x3,x12),sep(lseg(x3,x16),sep(lseg(x11,x8),emp)))))))))))) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_145]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_190,plain,
% 1.86/2.17 ( heap(sep(lseg(x5,x1),sep(lseg(x12,x8),sep(lseg(x2,x6),sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x10,x15),sep(lseg(x10,x5),sep(lseg(x7,x1),sep(lseg(x3,x12),sep(lseg(x3,x16),sep(lseg(x11,x8),emp)))))))))))) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_146]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_324,plain,
% 1.86/2.17 ( heap(sep(lseg(x5,x1),sep(lseg(x12,x8),sep(lseg(x2,x6),sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x10,x15),sep(lseg(x10,x5),sep(lseg(x7,x1),sep(lseg(x3,x12),sep(lseg(x3,x16),sep(lseg(x11,x8),emp)))))))))))) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_190]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_21,negated_conjecture,
% 1.86/2.17 ( ~ heap(emp) | x1 = x1 ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_113) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_114,negated_conjecture,
% 1.86/2.17 ( ~ heap(emp) | x1 = x1 ),
% 1.86/2.17 inference(copy,[status(esa)],[c_21]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_118,negated_conjecture,
% 1.86/2.17 ( ~ heap(emp) | x1 = x1 ),
% 1.86/2.17 inference(copy,[status(esa)],[c_114]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_173,negated_conjecture,
% 1.86/2.17 ( ~ heap(emp) | x1 = x1 ),
% 1.86/2.17 inference(copy,[status(esa)],[c_118]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_191,negated_conjecture,
% 1.86/2.17 ( ~ heap(emp) | x1 = x1 ),
% 1.86/2.17 inference(copy,[status(esa)],[c_173]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_326,negated_conjecture,
% 1.86/2.17 ( ~ heap(emp) | x1 = x1 ),
% 1.86/2.17 inference(copy,[status(esa)],[c_191]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_18,plain,
% 1.86/2.17 ( heap(sep(lseg(X0,X1),sep(lseg(X1,X2),X3)))
% 1.86/2.17 | X1 = X2
% 1.86/2.17 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(lseg(X1,X2),X3)))) ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_44_2) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_286,plain,
% 1.86/2.17 ( heap(sep(lseg(X0,X1),sep(lseg(X1,X2),X3)))
% 1.86/2.17 | X1 = X2
% 1.86/2.17 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(lseg(X1,X2),X3)))) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_18]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_287,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(lseg(X2,X3),X4))))
% 1.86/2.17 | heap(sep(lseg(X0,X2),sep(lseg(X2,X3),X4)))
% 1.86/2.17 | X2 = X3 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_286]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_16,plain,
% 1.86/2.17 ( heap(sep(lseg(X0,X1),sep(next(X1,X2),X3)))
% 1.86/2.17 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(next(X1,X2),X3)))) ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_45_1) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_282,plain,
% 1.86/2.17 ( heap(sep(lseg(X0,X1),sep(next(X1,X2),X3)))
% 1.86/2.17 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(next(X1,X2),X3)))) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_16]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_283,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(next(X2,X3),X4))))
% 1.86/2.17 | heap(sep(lseg(X0,X2),sep(next(X2,X3),X4))) ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_282]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_11,plain,
% 1.86/2.17 ( heap(sep(lseg(X0,nil),X1))
% 1.86/2.17 | ~ heap(sep(lseg(X0,X2),sep(lseg(X2,nil),X1))) ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_47_1) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_272,plain,
% 1.86/2.17 ( heap(sep(lseg(X0,nil),X1))
% 1.86/2.17 | ~ heap(sep(lseg(X0,X2),sep(lseg(X2,nil),X1))) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_11]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_8,plain,
% 1.86/2.17 ( X0 = X1 | X0 = X2 | ~ heap(sep(lseg(X0,X2),sep(lseg(X0,X1),X3))) ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_48_2) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_266,plain,
% 1.86/2.17 ( X0 = X1 | X0 = X2 | ~ heap(sep(lseg(X0,X2),sep(lseg(X0,X1),X3))) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_8]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_267,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X2 | X0 = X1 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_266]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_6,plain,
% 1.86/2.17 ( X0 = X1 | ~ heap(sep(next(X0,X2),sep(lseg(X0,X1),X3))) ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_49_1) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_262,plain,
% 1.86/2.17 ( X0 = X1 | ~ heap(sep(next(X0,X2),sep(lseg(X0,X1),X3))) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_6]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_263,plain,
% 1.86/2.17 ( ~ heap(sep(next(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X2 ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_262]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_4,plain,
% 1.86/2.17 ( X0 = nil | ~ heap(sep(lseg(nil,X0),X1)) ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_51_1) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_258,plain,
% 1.86/2.17 ( X0 = nil | ~ heap(sep(lseg(nil,X0),X1)) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_4]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_259,plain,
% 1.86/2.17 ( ~ heap(sep(lseg(nil,X0),X1)) | X0 = nil ),
% 1.86/2.17 inference(rewriting,[status(thm)],[c_258]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_3,plain,
% 1.86/2.17 ( ~ heap(sep(next(X0,X1),sep(next(X0,X2),X3))) ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_50_0) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_256,plain,
% 1.86/2.17 ( ~ heap(sep(next(X0,X1),sep(next(X0,X2),X3))) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_3]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_2,plain,
% 1.86/2.17 ( ~ heap(sep(next(nil,X0),X1)) ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_52_0) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_254,plain,
% 1.86/2.17 ( ~ heap(sep(next(nil,X0),X1)) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_2]) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_1,plain,
% 1.86/2.17 ( sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)) ),
% 1.86/2.17 file('/export/starexec/sandbox/tmp/iprover_modulo_d23210.p', c_0_53_0) ).
% 1.86/2.17
% 1.86/2.17 cnf(c_252,plain,
% 1.86/2.17 ( sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)) ),
% 1.86/2.17 inference(copy,[status(esa)],[c_1]) ).
% 1.86/2.17
% 1.86/2.17
% 1.86/2.17
% 1.86/2.17 % ------ Statistics
% 1.86/2.17
% 1.86/2.17 % ------ General
% 1.86/2.17
% 1.86/2.17 % num_of_input_clauses: 49
% 1.86/2.17 % num_of_input_neg_conjectures: 1
% 1.86/2.17 % num_of_splits: 0
% 1.86/2.17 % num_of_split_atoms: 0
% 1.86/2.17 % num_of_sem_filtered_clauses: 0
% 1.86/2.17 % num_of_subtypes: 0
% 1.86/2.17 % monotx_restored_types: 0
% 1.86/2.17 % sat_num_of_epr_types: 0
% 1.86/2.17 % sat_num_of_non_cyclic_types: 0
% 1.86/2.17 % sat_guarded_non_collapsed_types: 0
% 1.86/2.17 % is_epr: 0
% 1.86/2.17 % is_horn: 0
% 1.86/2.17 % has_eq: 1
% 1.86/2.17 % num_pure_diseq_elim: 0
% 1.86/2.17 % simp_replaced_by: 0
% 1.86/2.17 % res_preprocessed: 29
% 1.86/2.17 % prep_upred: 0
% 1.86/2.17 % prep_unflattend: 0
% 1.86/2.17 % pred_elim_cands: 0
% 1.86/2.17 % pred_elim: 0
% 1.86/2.17 % pred_elim_cl: 0
% 1.86/2.17 % pred_elim_cycles: 0
% 1.86/2.17 % forced_gc_time: 0
% 1.86/2.17 % gc_basic_clause_elim: 0
% 1.86/2.17 % parsing_time: 0.001
% 1.86/2.17 % sem_filter_time: 0.
% 1.86/2.17 % pred_elim_time: 0.
% 1.86/2.17 % out_proof_time: 0.
% 1.86/2.17 % monotx_time: 0.
% 1.86/2.17 % subtype_inf_time: 0.
% 1.86/2.17 % unif_index_cands_time: 0.
% 1.86/2.17 % unif_index_add_time: 0.
% 1.86/2.17 % total_time: 0.142
% 1.86/2.17 % num_of_symbols: 47
% 1.86/2.17 % num_of_terms: 417
% 1.86/2.17
% 1.86/2.17 % ------ Propositional Solver
% 1.86/2.17
% 1.86/2.17 % prop_solver_calls: 1
% 1.86/2.17 % prop_fast_solver_calls: 60
% 1.86/2.17 % prop_num_of_clauses: 56
% 1.86/2.17 % prop_preprocess_simplified: 227
% 1.86/2.17 % prop_fo_subsumed: 0
% 1.86/2.17 % prop_solver_time: 0.
% 1.86/2.17 % prop_fast_solver_time: 0.
% 1.86/2.17 % prop_unsat_core_time: 0.
% 1.86/2.17
% 1.86/2.17 % ------ QBF
% 1.86/2.17
% 1.86/2.17 % qbf_q_res: 0
% 1.86/2.17 % qbf_num_tautologies: 0
% 1.86/2.17 % qbf_prep_cycles: 0
% 1.86/2.17
% 1.86/2.17 % ------ BMC1
% 1.86/2.17
% 1.86/2.17 % bmc1_current_bound: -1
% 1.86/2.17 % bmc1_last_solved_bound: -1
% 1.86/2.17 % bmc1_unsat_core_size: -1
% 1.86/2.17 % bmc1_unsat_core_parents_size: -1
% 1.86/2.17 % bmc1_merge_next_fun: 0
% 1.86/2.17 % bmc1_unsat_core_clauses_time: 0.
% 1.86/2.17
% 1.86/2.17 % ------ Instantiation
% 1.86/2.17
% 1.86/2.17 % inst_num_of_clauses: 49
% 1.86/2.17 % inst_num_in_passive: 0
% 1.86/2.17 % inst_num_in_active: 0
% 1.86/2.17 % inst_num_in_unprocessed: 49
% 1.86/2.17 % inst_num_of_loops: 0
% 1.86/2.17 % inst_num_of_learning_restarts: 0
% 1.86/2.17 % inst_num_moves_active_passive: 0
% 1.86/2.17 % inst_lit_activity: 0
% 1.86/2.17 % inst_lit_activity_moves: 0
% 1.86/2.17 % inst_num_tautologies: 0
% 1.86/2.17 % inst_num_prop_implied: 0
% 1.86/2.17 % inst_num_existing_simplified: 0
% 1.86/2.17 % inst_num_eq_res_simplified: 0
% 1.86/2.17 % inst_num_child_elim: 0
% 1.86/2.17 % inst_num_of_dismatching_blockings: 0
% 1.86/2.17 % inst_num_of_non_proper_insts: 0
% 1.86/2.17 % inst_num_of_duplicates: 0
% 1.86/2.17 % inst_inst_num_from_inst_to_res: 0
% 1.86/2.17 % inst_dismatching_checking_time: 0.
% 1.86/2.17
% 1.86/2.17 % ------ Resolution
% 1.86/2.17
% 1.86/2.17 % res_num_of_clauses: 76
% 1.86/2.17 % res_num_in_passive: 0
% 1.86/2.17 % res_num_in_active: 65
% 1.86/2.17 % res_num_of_loops: 55
% 1.86/2.17 % res_forward_subset_subsumed: 9
% 1.86/2.17 % res_backward_subset_subsumed: 0
% 1.86/2.17 % res_forward_subsumed: 0
% 1.86/2.17 % res_backward_subsumed: 0
% 1.86/2.17 % res_forward_subsumption_resolution: 0
% 1.86/2.17 % res_backward_subsumption_resolution: 0
% 1.86/2.17 % res_clause_to_clause_subsumption: 0
% 1.86/2.17 % res_orphan_elimination: 0
% 1.86/2.17 % res_tautology_del: 0
% 1.86/2.17 % res_num_eq_res_simplified: 0
% 1.86/2.17 % res_num_sel_changes: 0
% 1.86/2.17 % res_moves_from_active_to_pass: 0
% 1.86/2.17
% 1.86/2.17 % Status Unknown
% 1.86/2.17 % Last status :
% 1.86/2.17 % SZS status Unknown
%------------------------------------------------------------------------------