TSTP Solution File: SWW417-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWW417-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n028.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:50 EDT 2022
% Result : Unknown 7.16s 7.51s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SWW417-1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.10 % Command : iprover_modulo %s %d
% 0.10/0.30 % Computer : n028.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sat Jun 4 12:55:26 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.15/0.31 % Running in mono-core mode
% 0.15/0.37 % Orienting using strategy Equiv(ClausalAll)
% 0.15/0.37 % Orientation found
% 0.15/0.37 % 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_ad95e8.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_3fa247 | grep -v "SZS"
% 0.15/0.39
% 0.15/0.39 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.15/0.39
% 0.15/0.39 %
% 0.15/0.39 % ------ iProver source info
% 0.15/0.39
% 0.15/0.39 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.15/0.39 % git: non_committed_changes: true
% 0.15/0.39 % git: last_make_outside_of_git: true
% 0.15/0.39
% 0.15/0.39 %
% 0.15/0.39 % ------ Input Options
% 0.15/0.39
% 0.15/0.39 % --out_options all
% 0.15/0.39 % --tptp_safe_out true
% 0.15/0.39 % --problem_path ""
% 0.15/0.39 % --include_path ""
% 0.15/0.39 % --clausifier .//eprover
% 0.15/0.39 % --clausifier_options --tstp-format
% 0.15/0.39 % --stdin false
% 0.15/0.39 % --dbg_backtrace false
% 0.15/0.39 % --dbg_dump_prop_clauses false
% 0.15/0.39 % --dbg_dump_prop_clauses_file -
% 0.15/0.39 % --dbg_out_stat false
% 0.15/0.39
% 0.15/0.39 % ------ General Options
% 0.15/0.39
% 0.15/0.39 % --fof false
% 0.15/0.39 % --time_out_real 150.
% 0.15/0.39 % --time_out_prep_mult 0.2
% 0.15/0.39 % --time_out_virtual -1.
% 0.15/0.39 % --schedule none
% 0.15/0.39 % --ground_splitting input
% 0.15/0.39 % --splitting_nvd 16
% 0.15/0.39 % --non_eq_to_eq false
% 0.15/0.39 % --prep_gs_sim true
% 0.15/0.39 % --prep_unflatten false
% 0.15/0.39 % --prep_res_sim true
% 0.15/0.39 % --prep_upred true
% 0.15/0.39 % --res_sim_input true
% 0.15/0.39 % --clause_weak_htbl true
% 0.15/0.39 % --gc_record_bc_elim false
% 0.15/0.39 % --symbol_type_check false
% 0.15/0.39 % --clausify_out false
% 0.15/0.39 % --large_theory_mode false
% 0.15/0.39 % --prep_sem_filter none
% 0.15/0.39 % --prep_sem_filter_out false
% 0.15/0.39 % --preprocessed_out false
% 0.15/0.39 % --sub_typing false
% 0.15/0.39 % --brand_transform false
% 0.15/0.39 % --pure_diseq_elim true
% 0.15/0.39 % --min_unsat_core false
% 0.15/0.39 % --pred_elim true
% 0.15/0.39 % --add_important_lit false
% 0.15/0.39 % --soft_assumptions false
% 0.15/0.39 % --reset_solvers false
% 0.15/0.39 % --bc_imp_inh []
% 0.15/0.39 % --conj_cone_tolerance 1.5
% 0.15/0.39 % --prolific_symb_bound 500
% 0.15/0.39 % --lt_threshold 2000
% 0.15/0.39
% 0.15/0.39 % ------ SAT Options
% 0.15/0.39
% 0.15/0.39 % --sat_mode false
% 0.15/0.39 % --sat_fm_restart_options ""
% 0.15/0.39 % --sat_gr_def false
% 0.15/0.39 % --sat_epr_types true
% 0.15/0.39 % --sat_non_cyclic_types false
% 0.15/0.39 % --sat_finite_models false
% 0.15/0.39 % --sat_fm_lemmas false
% 0.15/0.39 % --sat_fm_prep false
% 0.15/0.39 % --sat_fm_uc_incr true
% 0.15/0.39 % --sat_out_model small
% 0.15/0.39 % --sat_out_clauses false
% 0.15/0.39
% 0.15/0.39 % ------ QBF Options
% 0.15/0.39
% 0.15/0.39 % --qbf_mode false
% 0.15/0.39 % --qbf_elim_univ true
% 0.15/0.39 % --qbf_sk_in true
% 0.15/0.39 % --qbf_pred_elim true
% 0.15/0.39 % --qbf_split 32
% 0.15/0.39
% 0.15/0.39 % ------ BMC1 Options
% 0.15/0.39
% 0.15/0.39 % --bmc1_incremental false
% 0.15/0.39 % --bmc1_axioms reachable_all
% 0.15/0.39 % --bmc1_min_bound 0
% 0.15/0.39 % --bmc1_max_bound -1
% 0.15/0.39 % --bmc1_max_bound_default -1
% 0.15/0.39 % --bmc1_symbol_reachability true
% 0.15/0.39 % --bmc1_property_lemmas false
% 0.15/0.39 % --bmc1_k_induction false
% 0.15/0.39 % --bmc1_non_equiv_states false
% 0.15/0.39 % --bmc1_deadlock false
% 0.15/0.39 % --bmc1_ucm false
% 0.15/0.39 % --bmc1_add_unsat_core none
% 0.15/0.39 % --bmc1_unsat_core_children false
% 0.15/0.39 % --bmc1_unsat_core_extrapolate_axioms false
% 0.15/0.39 % --bmc1_out_stat full
% 0.15/0.39 % --bmc1_ground_init false
% 0.15/0.39 % --bmc1_pre_inst_next_state false
% 0.15/0.39 % --bmc1_pre_inst_state false
% 0.15/0.39 % --bmc1_pre_inst_reach_state false
% 0.15/0.39 % --bmc1_out_unsat_core false
% 0.15/0.39 % --bmc1_aig_witness_out false
% 0.15/0.39 % --bmc1_verbose false
% 0.15/0.39 % --bmc1_dump_clauses_tptp false
% 0.15/0.48 % --bmc1_dump_unsat_core_tptp false
% 0.15/0.48 % --bmc1_dump_file -
% 0.15/0.48 % --bmc1_ucm_expand_uc_limit 128
% 0.15/0.48 % --bmc1_ucm_n_expand_iterations 6
% 0.15/0.48 % --bmc1_ucm_extend_mode 1
% 0.15/0.48 % --bmc1_ucm_init_mode 2
% 0.15/0.48 % --bmc1_ucm_cone_mode none
% 0.15/0.48 % --bmc1_ucm_reduced_relation_type 0
% 0.15/0.48 % --bmc1_ucm_relax_model 4
% 0.15/0.48 % --bmc1_ucm_full_tr_after_sat true
% 0.15/0.48 % --bmc1_ucm_expand_neg_assumptions false
% 0.15/0.48 % --bmc1_ucm_layered_model none
% 0.15/0.48 % --bmc1_ucm_max_lemma_size 10
% 0.15/0.48
% 0.15/0.48 % ------ AIG Options
% 0.15/0.48
% 0.15/0.48 % --aig_mode false
% 0.15/0.48
% 0.15/0.48 % ------ Instantiation Options
% 0.15/0.48
% 0.15/0.48 % --instantiation_flag true
% 0.15/0.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.15/0.48 % --inst_solver_per_active 750
% 0.15/0.48 % --inst_solver_calls_frac 0.5
% 0.15/0.48 % --inst_passive_queue_type priority_queues
% 0.15/0.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.15/0.48 % --inst_passive_queues_freq [25;2]
% 0.15/0.48 % --inst_dismatching true
% 0.15/0.48 % --inst_eager_unprocessed_to_passive true
% 0.15/0.48 % --inst_prop_sim_given true
% 0.15/0.48 % --inst_prop_sim_new false
% 0.15/0.48 % --inst_orphan_elimination true
% 0.15/0.48 % --inst_learning_loop_flag true
% 0.15/0.48 % --inst_learning_start 3000
% 0.15/0.48 % --inst_learning_factor 2
% 0.15/0.48 % --inst_start_prop_sim_after_learn 3
% 0.15/0.48 % --inst_sel_renew solver
% 0.15/0.48 % --inst_lit_activity_flag true
% 0.15/0.48 % --inst_out_proof true
% 0.15/0.48
% 0.15/0.48 % ------ Resolution Options
% 0.15/0.48
% 0.15/0.48 % --resolution_flag true
% 0.15/0.48 % --res_lit_sel kbo_max
% 0.15/0.48 % --res_to_prop_solver none
% 0.15/0.48 % --res_prop_simpl_new false
% 0.15/0.48 % --res_prop_simpl_given false
% 0.15/0.48 % --res_passive_queue_type priority_queues
% 0.15/0.48 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.15/0.48 % --res_passive_queues_freq [15;5]
% 0.15/0.48 % --res_forward_subs full
% 0.15/0.48 % --res_backward_subs full
% 0.15/0.48 % --res_forward_subs_resolution true
% 0.15/0.48 % --res_backward_subs_resolution true
% 0.15/0.48 % --res_orphan_elimination false
% 0.15/0.48 % --res_time_limit 1000.
% 0.15/0.48 % --res_out_proof true
% 0.15/0.48 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ad95e8.s
% 0.15/0.48 % --modulo true
% 0.15/0.48
% 0.15/0.48 % ------ Combination Options
% 0.15/0.48
% 0.15/0.48 % --comb_res_mult 1000
% 0.15/0.48 % --comb_inst_mult 300
% 0.15/0.48 % ------
% 0.15/0.48
% 0.15/0.48 % ------ Parsing...% successful
% 0.15/0.48
% 0.15/0.48 % ------ 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.15/0.48
% 0.15/0.48 % ------ Proving...
% 0.15/0.48 % ------ Problem Properties
% 0.15/0.48
% 0.15/0.48 %
% 0.15/0.48 % EPR false
% 0.15/0.48 % Horn false
% 0.15/0.48 % Has equality true
% 0.15/0.48
% 0.15/0.48 % % ------ Input Options Time Limit: Unbounded
% 0.15/0.48
% 0.15/0.48
% 0.15/0.48 Compiling...
% 0.15/0.48 Loading plugin: done.
% 0.15/0.48 % % ------ Current options:
% 0.15/0.48
% 0.15/0.48 % ------ Input Options
% 0.15/0.48
% 0.15/0.48 % --out_options all
% 0.15/0.48 % --tptp_safe_out true
% 0.15/0.48 % --problem_path ""
% 0.15/0.48 % --include_path ""
% 0.15/0.48 % --clausifier .//eprover
% 0.15/0.48 % --clausifier_options --tstp-format
% 0.15/0.48 % --stdin false
% 0.15/0.48 % --dbg_backtrace false
% 0.15/0.48 % --dbg_dump_prop_clauses false
% 0.15/0.48 % --dbg_dump_prop_clauses_file -
% 0.15/0.48 % --dbg_out_stat false
% 0.15/0.48
% 0.15/0.48 % ------ General Options
% 0.15/0.48
% 0.15/0.48 % --fof false
% 0.15/0.48 % --time_out_real 150.
% 0.15/0.48 % --time_out_prep_mult 0.2
% 0.15/0.48 % --time_out_virtual -1.
% 0.15/0.48 % --schedule none
% 0.15/0.48 % --ground_splitting input
% 0.15/0.48 % --splitting_nvd 16
% 0.15/0.48 % --non_eq_to_eq false
% 0.15/0.48 % --prep_gs_sim true
% 0.15/0.48 % --prep_unflatten false
% 0.15/0.48 % --prep_res_sim true
% 0.15/0.48 % --prep_upred true
% 0.15/0.48 % --res_sim_input true
% 0.15/0.48 % --clause_weak_htbl true
% 0.15/0.48 % --gc_record_bc_elim false
% 0.15/0.48 % --symbol_type_check false
% 0.15/0.48 % --clausify_out false
% 0.15/0.48 % --large_theory_mode false
% 0.15/0.48 % --prep_sem_filter none
% 0.15/0.48 % --prep_sem_filter_out false
% 0.15/0.48 % --preprocessed_out false
% 0.15/0.48 % --sub_typing false
% 0.15/0.48 % --brand_transform false
% 0.15/0.48 % --pure_diseq_elim true
% 0.15/0.48 % --min_unsat_core false
% 0.15/0.48 % --pred_elim true
% 0.15/0.48 % --add_important_lit false
% 0.15/0.48 % --soft_assumptions false
% 0.15/0.48 % --reset_solvers false
% 0.15/0.48 % --bc_imp_inh []
% 0.15/0.48 % --conj_cone_tolerance 1.5
% 0.15/0.48 % --prolific_symb_bound 500
% 0.15/0.48 % --lt_threshold 2000
% 0.15/0.48
% 0.15/0.48 % ------ SAT Options
% 0.15/0.48
% 0.15/0.48 % --sat_mode false
% 0.15/0.48 % --sat_fm_restart_options ""
% 0.15/0.48 % --sat_gr_def false
% 0.15/0.48 % --sat_epr_types true
% 0.15/0.48 % --sat_non_cyclic_types false
% 0.15/0.48 % --sat_finite_models false
% 0.15/0.48 % --sat_fm_lemmas false
% 0.15/0.48 % --sat_fm_prep false
% 0.15/0.48 % --sat_fm_uc_incr true
% 0.15/0.48 % --sat_out_model small
% 0.15/0.48 % --sat_out_clauses false
% 0.15/0.48
% 0.15/0.48 % ------ QBF Options
% 0.15/0.48
% 0.15/0.48 % --qbf_mode false
% 0.15/0.48 % --qbf_elim_univ true
% 0.15/0.48 % --qbf_sk_in true
% 0.15/0.48 % --qbf_pred_elim true
% 0.15/0.48 % --qbf_split 32
% 0.15/0.48
% 0.15/0.48 % ------ BMC1 Options
% 0.15/0.48
% 0.15/0.48 % --bmc1_incremental false
% 0.15/0.48 % --bmc1_axioms reachable_all
% 0.15/0.48 % --bmc1_min_bound 0
% 0.15/0.48 % --bmc1_max_bound -1
% 0.15/0.48 % --bmc1_max_bound_default -1
% 0.15/0.48 % --bmc1_symbol_reachability true
% 0.15/0.48 % --bmc1_property_lemmas false
% 0.15/0.48 % --bmc1_k_induction false
% 0.15/0.48 % --bmc1_non_equiv_states false
% 0.15/0.48 % --bmc1_deadlock false
% 0.15/0.48 % --bmc1_ucm false
% 0.15/0.48 % --bmc1_add_unsat_core none
% 0.15/0.48 % --bmc1_unsat_core_children false
% 0.15/0.48 % --bmc1_unsat_core_extrapolate_axioms false
% 0.15/0.48 % --bmc1_out_stat full
% 0.15/0.48 % --bmc1_ground_init false
% 0.15/0.48 % --bmc1_pre_inst_next_state false
% 0.15/0.48 % --bmc1_pre_inst_state false
% 0.15/0.48 % --bmc1_pre_inst_reach_state false
% 0.15/0.48 % --bmc1_out_unsat_core false
% 0.15/0.48 % --bmc1_aig_witness_out false
% 0.15/0.48 % --bmc1_verbose false
% 0.15/0.48 % --bmc1_dump_clauses_tptp false
% 0.15/0.48 % --bmc1_dump_unsat_core_tptp false
% 0.15/0.48 % --bmc1_dump_file -
% 0.15/0.48 % --bmc1_ucm_expand_uc_limit 128
% 0.15/0.48 % --bmc1_ucm_n_expand_iterations 6
% 0.15/0.48 % --bmc1_ucm_extend_mode 1
% 0.15/0.48 % --bmc1_ucm_init_mode 2
% 0.15/0.48 % --bmc1_ucm_cone_mode none
% 0.15/0.48 % --bmc1_ucm_reduced_relation_type 0
% 0.15/0.48 % --bmc1_ucm_relax_model 4
% 0.15/0.48 % --bmc1_ucm_full_tr_after_sat true
% 0.15/0.48 % --bmc1_ucm_expand_neg_assumptions false
% 0.15/0.48 % --bmc1_ucm_layered_model none
% 0.15/0.48 % --bmc1_ucm_max_lemma_size 10
% 0.15/0.48
% 0.15/0.48 % ------ AIG Options
% 0.15/0.48
% 0.15/0.48 % --aig_mode false
% 0.15/0.48
% 0.15/0.48 % ------ Instantiation Options
% 0.15/0.48
% 0.15/0.48 % --instantiation_flag true
% 0.15/0.48 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.15/0.48 % --inst_solver_per_active 750
% 0.15/0.48 % --inst_solver_calls_frac 0.5
% 0.15/0.48 % --inst_passive_queue_type priority_queues
% 0.15/0.48 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.15/0.48 % --inst_passive_queues_freq [25;2]
% 0.15/0.48 % --inst_dismatching true
% 0.15/0.48 % --inst_eager_unprocessed_to_passive true
% 7.06/7.29 % --inst_prop_sim_given true
% 7.06/7.29 % --inst_prop_sim_new false
% 7.06/7.29 % --inst_orphan_elimination true
% 7.06/7.29 % --inst_learning_loop_flag true
% 7.06/7.29 % --inst_learning_start 3000
% 7.06/7.29 % --inst_learning_factor 2
% 7.06/7.29 % --inst_start_prop_sim_after_learn 3
% 7.06/7.29 % --inst_sel_renew solver
% 7.06/7.29 % --inst_lit_activity_flag true
% 7.06/7.29 % --inst_out_proof true
% 7.06/7.29
% 7.06/7.29 % ------ Resolution Options
% 7.06/7.29
% 7.06/7.29 % --resolution_flag true
% 7.06/7.29 % --res_lit_sel kbo_max
% 7.06/7.29 % --res_to_prop_solver none
% 7.06/7.29 % --res_prop_simpl_new false
% 7.06/7.29 % --res_prop_simpl_given false
% 7.06/7.29 % --res_passive_queue_type priority_queues
% 7.06/7.29 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 7.06/7.29 % --res_passive_queues_freq [15;5]
% 7.06/7.29 % --res_forward_subs full
% 7.06/7.29 % --res_backward_subs full
% 7.06/7.29 % --res_forward_subs_resolution true
% 7.06/7.29 % --res_backward_subs_resolution true
% 7.06/7.29 % --res_orphan_elimination false
% 7.06/7.29 % --res_time_limit 1000.
% 7.06/7.29 % --res_out_proof true
% 7.06/7.29 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ad95e8.s
% 7.06/7.29 % --modulo true
% 7.06/7.29
% 7.06/7.29 % ------ Combination Options
% 7.06/7.29
% 7.06/7.29 % --comb_res_mult 1000
% 7.06/7.29 % --comb_inst_mult 300
% 7.06/7.29 % ------
% 7.06/7.29
% 7.06/7.29
% 7.06/7.29
% 7.06/7.29 % ------ Proving...
% 7.06/7.29 % warning: shown sat in sat incomplete mode
% 7.06/7.29 %
% 7.06/7.29
% 7.06/7.29
% 7.06/7.29 ------ Building Model...Done
% 7.06/7.29
% 7.06/7.29 %------ The model is defined over ground terms (initial term algebra).
% 7.06/7.29 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 7.06/7.29 %------ where \phi is a formula over the term algebra.
% 7.06/7.29 %------ If we have equality in the problem then it is also defined as a predicate above,
% 7.06/7.29 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 7.06/7.29 %------ See help for --sat_out_model for different model outputs.
% 7.06/7.29 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 7.06/7.29 %------ where the first argument stands for the sort ($i in the unsorted case)
% 7.06/7.29
% 7.06/7.29
% 7.06/7.29
% 7.06/7.29
% 7.06/7.29 %------ Positive definition of equality_sorted
% 7.06/7.29 fof(lit_def,axiom,
% 7.06/7.29 (! [X0,X0,X1] :
% 7.06/7.29 ( equality_sorted(X0,X0,X1) <=>
% 7.06/7.29 (
% 7.06/7.29 ? [X2] :
% 7.06/7.29 (
% 7.06/7.29 ( X0=$i & X0=sep(lseg(X2,X2),X1) )
% 7.06/7.29 )
% 7.06/7.29
% 7.06/7.29 |
% 7.06/7.29 ? [X2,X3,X4] :
% 7.06/7.29 (
% 7.06/7.29 ( X0=$i & X0=sep(X2,sep(X3,X4)) & X1=sep(X3,sep(X2,X4)) )
% 7.06/7.29 )
% 7.06/7.29
% 7.06/7.29 )
% 7.06/7.29 )
% 7.06/7.29 )
% 7.06/7.29 ).
% 7.06/7.29
% 7.06/7.29 %------ Positive definition of heap
% 7.06/7.29 fof(lit_def,axiom,
% 7.06/7.29 (! [X0] :
% 7.06/7.29 ( heap(X0) <=>
% 7.06/7.29 (
% 7.06/7.29 (
% 7.06/7.29 ( X0=sep(lseg(x2,nil),sep(next(x1,x2),emp)) )
% 7.06/7.29 )
% 7.06/7.29
% 7.06/7.29 )
% 7.06/7.29 )
% 7.06/7.29 )
% 7.06/7.29 ).
% 7.06/7.29
% 7.06/7.29
% 7.06/7.29
% 7.06/7.29 % ------ Statistics
% 7.06/7.29
% 7.06/7.29 % ------ General
% 7.06/7.29
% 7.06/7.29 % num_of_input_clauses: 25
% 7.06/7.29 % num_of_input_neg_conjectures: 1
% 7.06/7.29 % num_of_splits: 0
% 7.06/7.29 % num_of_split_atoms: 0
% 7.06/7.29 % num_of_sem_filtered_clauses: 0
% 7.06/7.29 % num_of_subtypes: 0
% 7.06/7.29 % monotx_restored_types: 0
% 7.06/7.29 % sat_num_of_epr_types: 0
% 7.06/7.29 % sat_num_of_non_cyclic_types: 0
% 7.06/7.29 % sat_guarded_non_collapsed_types: 0
% 7.06/7.29 % is_epr: 0
% 7.06/7.29 % is_horn: 0
% 7.06/7.29 % has_eq: 1
% 7.06/7.29 % num_pure_diseq_elim: 0
% 7.06/7.29 % simp_replaced_by: 0
% 7.06/7.29 % res_preprocessed: 5
% 7.06/7.29 % prep_upred: 0
% 7.06/7.29 % prep_unflattend: 0
% 7.06/7.29 % pred_elim_cands: 0
% 7.06/7.29 % pred_elim: 0
% 7.06/7.29 % pred_elim_cl: 0
% 7.06/7.29 % pred_elim_cycles: 0
% 7.06/7.29 % forced_gc_time: 0
% 7.06/7.29 % gc_basic_clause_elim: 0
% 7.06/7.29 % parsing_time: 0.001
% 7.06/7.29 % sem_filter_time: 0.
% 7.06/7.29 % pred_elim_time: 0.
% 7.06/7.29 % out_proof_time: 0.
% 7.06/7.29 % monotx_time: 0.
% 7.06/7.29 % subtype_inf_time: 0.
% 7.06/7.29 % unif_index_cands_time: 0.003
% 7.06/7.29 % unif_index_add_time: 0.013
% 7.06/7.29 % total_time: 6.915
% 7.06/7.29 % num_of_symbols: 33
% 7.06/7.29 % num_of_terms: 15572
% 7.06/7.29
% 7.06/7.29 % ------ Propositional Solver
% 7.06/7.29
% 7.06/7.29 % prop_solver_calls: 2
% 7.06/7.29 % prop_fast_solver_calls: 9
% 7.06/7.29 % prop_num_of_clauses: 32
% 7.06/7.29 % prop_preprocess_simplified: 129
% 7.06/7.29 % prop_fo_subsumed: 0
% 7.06/7.29 % prop_solver_time: 0.
% 7.06/7.29 % prop_fast_solver_time: 0.
% 7.06/7.29 % prop_unsat_core_time: 0.
% 7.06/7.29
% 7.06/7.29 % ------ QBF
% 7.06/7.29
% 7.06/7.29 % qbf_q_res: 0
% 7.06/7.29 % qbf_num_tautologies: 0
% 7.06/7.29 % qbf_prep_cycles: 0
% 7.06/7.29
% 7.06/7.29 % ------ BMC1
% 7.06/7.29
% 7.06/7.29 % bmc1_current_bound: -1
% 7.06/7.29 % bmc1_last_solved_bound: -1
% 7.06/7.29 % bmc1_unsat_core_size: -1
% 7.06/7.30 % bmc1_unsat_core_parents_size: -1
% 7.06/7.30 % bmc1_merge_next_fun: 0
% 7.06/7.30 % bmc1_unsat_core_clauses_time: 0.
% 7.06/7.30
% 7.06/7.30 % ------ Instantiation
% 7.06/7.30
% 7.06/7.30 % inst_num_of_clauses: 25
% 7.06/7.30 % inst_num_in_passive: 0
% 7.06/7.30 % inst_num_in_active: 25
% 7.06/7.30 % inst_num_in_unprocessed: 0
% 7.06/7.30 % inst_num_of_loops: 27
% 7.06/7.30 % inst_num_of_learning_restarts: 0
% 7.06/7.30 % inst_num_moves_active_passive: 0
% 7.06/7.30 % inst_lit_activity: 5
% 7.06/7.30 % inst_lit_activity_moves: 0
% 7.06/7.30 % inst_num_tautologies: 0
% 7.06/7.30 % inst_num_prop_implied: 0
% 7.06/7.30 % inst_num_existing_simplified: 0
% 7.06/7.30 % inst_num_eq_res_simplified: 0
% 7.06/7.30 % inst_num_child_elim: 0
% 7.06/7.30 % inst_num_of_dismatching_blockings: 0
% 7.06/7.30 % inst_num_of_non_proper_insts: 0
% 7.06/7.30 % inst_num_of_duplicates: 0
% 7.06/7.30 % inst_inst_num_from_inst_to_res: 0
% 7.06/7.30 % inst_dismatching_checking_time: 0.
% 7.06/7.30
% 7.06/7.30 % ------ Resolution
% 7.06/7.30
% 7.06/7.30 % res_num_of_clauses: 1270
% 7.06/7.30 % res_num_in_passive: 627
% 7.06/7.30 % res_num_in_active: 632
% 7.06/7.30 % res_num_of_loops: 1000
% 7.06/7.30 % res_forward_subset_subsumed: 10
% 7.06/7.30 % res_backward_subset_subsumed: 0
% 7.06/7.30 % res_forward_subsumed: 379
% 7.06/7.30 % res_backward_subsumed: 0
% 7.06/7.30 % res_forward_subsumption_resolution: 2
% 7.06/7.30 % res_backward_subsumption_resolution: 0
% 7.06/7.30 % res_clause_to_clause_subsumption: 32644
% 7.06/7.30 % res_orphan_elimination: 0
% 7.06/7.30 % res_tautology_del: 0
% 7.06/7.30 % res_num_eq_res_simplified: 0
% 7.06/7.30 % res_num_sel_changes: 0
% 7.06/7.30 % res_moves_from_active_to_pass: 0
% 7.06/7.30
% 7.06/7.30 % Status Unknown
% 7.11/7.34 % Orienting using strategy ClausalAll
% 7.11/7.34 % Orientation found
% 7.11/7.34 % 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_ad95e8.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_da2960 | grep -v "SZS"
% 7.11/7.36
% 7.11/7.36 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 7.11/7.36
% 7.11/7.36 %
% 7.11/7.36 % ------ iProver source info
% 7.11/7.36
% 7.11/7.36 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 7.11/7.36 % git: non_committed_changes: true
% 7.11/7.36 % git: last_make_outside_of_git: true
% 7.11/7.36
% 7.11/7.36 %
% 7.11/7.36 % ------ Input Options
% 7.11/7.36
% 7.11/7.36 % --out_options all
% 7.11/7.36 % --tptp_safe_out true
% 7.11/7.36 % --problem_path ""
% 7.11/7.36 % --include_path ""
% 7.11/7.36 % --clausifier .//eprover
% 7.11/7.36 % --clausifier_options --tstp-format
% 7.11/7.36 % --stdin false
% 7.11/7.36 % --dbg_backtrace false
% 7.11/7.36 % --dbg_dump_prop_clauses false
% 7.11/7.36 % --dbg_dump_prop_clauses_file -
% 7.11/7.36 % --dbg_out_stat false
% 7.11/7.36
% 7.11/7.36 % ------ General Options
% 7.11/7.36
% 7.11/7.36 % --fof false
% 7.11/7.36 % --time_out_real 150.
% 7.11/7.36 % --time_out_prep_mult 0.2
% 7.11/7.36 % --time_out_virtual -1.
% 7.11/7.36 % --schedule none
% 7.11/7.36 % --ground_splitting input
% 7.11/7.36 % --splitting_nvd 16
% 7.11/7.36 % --non_eq_to_eq false
% 7.11/7.36 % --prep_gs_sim true
% 7.11/7.36 % --prep_unflatten false
% 7.11/7.36 % --prep_res_sim true
% 7.11/7.36 % --prep_upred true
% 7.11/7.36 % --res_sim_input true
% 7.11/7.36 % --clause_weak_htbl true
% 7.11/7.36 % --gc_record_bc_elim false
% 7.11/7.36 % --symbol_type_check false
% 7.11/7.36 % --clausify_out false
% 7.11/7.36 % --large_theory_mode false
% 7.11/7.36 % --prep_sem_filter none
% 7.11/7.36 % --prep_sem_filter_out false
% 7.11/7.36 % --preprocessed_out false
% 7.11/7.36 % --sub_typing false
% 7.11/7.36 % --brand_transform false
% 7.11/7.36 % --pure_diseq_elim true
% 7.11/7.36 % --min_unsat_core false
% 7.11/7.36 % --pred_elim true
% 7.11/7.36 % --add_important_lit false
% 7.11/7.36 % --soft_assumptions false
% 7.11/7.36 % --reset_solvers false
% 7.11/7.36 % --bc_imp_inh []
% 7.11/7.36 % --conj_cone_tolerance 1.5
% 7.11/7.36 % --prolific_symb_bound 500
% 7.11/7.36 % --lt_threshold 2000
% 7.11/7.36
% 7.11/7.36 % ------ SAT Options
% 7.11/7.36
% 7.11/7.36 % --sat_mode false
% 7.11/7.36 % --sat_fm_restart_options ""
% 7.11/7.36 % --sat_gr_def false
% 7.11/7.36 % --sat_epr_types true
% 7.11/7.36 % --sat_non_cyclic_types false
% 7.11/7.36 % --sat_finite_models false
% 7.11/7.36 % --sat_fm_lemmas false
% 7.11/7.36 % --sat_fm_prep false
% 7.11/7.36 % --sat_fm_uc_incr true
% 7.11/7.36 % --sat_out_model small
% 7.11/7.36 % --sat_out_clauses false
% 7.11/7.36
% 7.11/7.36 % ------ QBF Options
% 7.11/7.36
% 7.11/7.36 % --qbf_mode false
% 7.11/7.36 % --qbf_elim_univ true
% 7.11/7.36 % --qbf_sk_in true
% 7.11/7.36 % --qbf_pred_elim true
% 7.11/7.36 % --qbf_split 32
% 7.11/7.36
% 7.11/7.36 % ------ BMC1 Options
% 7.11/7.36
% 7.11/7.36 % --bmc1_incremental false
% 7.11/7.36 % --bmc1_axioms reachable_all
% 7.11/7.36 % --bmc1_min_bound 0
% 7.11/7.36 % --bmc1_max_bound -1
% 7.11/7.36 % --bmc1_max_bound_default -1
% 7.11/7.36 % --bmc1_symbol_reachability true
% 7.11/7.36 % --bmc1_property_lemmas false
% 7.11/7.36 % --bmc1_k_induction false
% 7.11/7.36 % --bmc1_non_equiv_states false
% 7.11/7.36 % --bmc1_deadlock false
% 7.11/7.36 % --bmc1_ucm false
% 7.11/7.36 % --bmc1_add_unsat_core none
% 7.11/7.36 % --bmc1_unsat_core_children false
% 7.11/7.36 % --bmc1_unsat_core_extrapolate_axioms false
% 7.11/7.36 % --bmc1_out_stat full
% 7.11/7.36 % --bmc1_ground_init false
% 7.11/7.36 % --bmc1_pre_inst_next_state false
% 7.11/7.36 % --bmc1_pre_inst_state false
% 7.11/7.36 % --bmc1_pre_inst_reach_state false
% 7.11/7.36 % --bmc1_out_unsat_core false
% 7.11/7.36 % --bmc1_aig_witness_out false
% 7.11/7.36 % --bmc1_verbose false
% 7.11/7.36 % --bmc1_dump_clauses_tptp false
% 7.16/7.50 % --bmc1_dump_unsat_core_tptp false
% 7.16/7.50 % --bmc1_dump_file -
% 7.16/7.50 % --bmc1_ucm_expand_uc_limit 128
% 7.16/7.50 % --bmc1_ucm_n_expand_iterations 6
% 7.16/7.50 % --bmc1_ucm_extend_mode 1
% 7.16/7.50 % --bmc1_ucm_init_mode 2
% 7.16/7.50 % --bmc1_ucm_cone_mode none
% 7.16/7.50 % --bmc1_ucm_reduced_relation_type 0
% 7.16/7.50 % --bmc1_ucm_relax_model 4
% 7.16/7.50 % --bmc1_ucm_full_tr_after_sat true
% 7.16/7.50 % --bmc1_ucm_expand_neg_assumptions false
% 7.16/7.50 % --bmc1_ucm_layered_model none
% 7.16/7.50 % --bmc1_ucm_max_lemma_size 10
% 7.16/7.50
% 7.16/7.50 % ------ AIG Options
% 7.16/7.50
% 7.16/7.50 % --aig_mode false
% 7.16/7.50
% 7.16/7.50 % ------ Instantiation Options
% 7.16/7.50
% 7.16/7.50 % --instantiation_flag true
% 7.16/7.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 7.16/7.50 % --inst_solver_per_active 750
% 7.16/7.50 % --inst_solver_calls_frac 0.5
% 7.16/7.50 % --inst_passive_queue_type priority_queues
% 7.16/7.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 7.16/7.50 % --inst_passive_queues_freq [25;2]
% 7.16/7.50 % --inst_dismatching true
% 7.16/7.50 % --inst_eager_unprocessed_to_passive true
% 7.16/7.50 % --inst_prop_sim_given true
% 7.16/7.50 % --inst_prop_sim_new false
% 7.16/7.50 % --inst_orphan_elimination true
% 7.16/7.50 % --inst_learning_loop_flag true
% 7.16/7.50 % --inst_learning_start 3000
% 7.16/7.50 % --inst_learning_factor 2
% 7.16/7.50 % --inst_start_prop_sim_after_learn 3
% 7.16/7.50 % --inst_sel_renew solver
% 7.16/7.50 % --inst_lit_activity_flag true
% 7.16/7.50 % --inst_out_proof true
% 7.16/7.50
% 7.16/7.50 % ------ Resolution Options
% 7.16/7.50
% 7.16/7.50 % --resolution_flag true
% 7.16/7.50 % --res_lit_sel kbo_max
% 7.16/7.50 % --res_to_prop_solver none
% 7.16/7.50 % --res_prop_simpl_new false
% 7.16/7.50 % --res_prop_simpl_given false
% 7.16/7.50 % --res_passive_queue_type priority_queues
% 7.16/7.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 7.16/7.50 % --res_passive_queues_freq [15;5]
% 7.16/7.50 % --res_forward_subs full
% 7.16/7.50 % --res_backward_subs full
% 7.16/7.50 % --res_forward_subs_resolution true
% 7.16/7.50 % --res_backward_subs_resolution true
% 7.16/7.50 % --res_orphan_elimination false
% 7.16/7.50 % --res_time_limit 1000.
% 7.16/7.50 % --res_out_proof true
% 7.16/7.50 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ad95e8.s
% 7.16/7.50 % --modulo true
% 7.16/7.50
% 7.16/7.50 % ------ Combination Options
% 7.16/7.50
% 7.16/7.50 % --comb_res_mult 1000
% 7.16/7.50 % --comb_inst_mult 300
% 7.16/7.50 % ------
% 7.16/7.50
% 7.16/7.50 % ------ Parsing...% successful
% 7.16/7.50
% 7.16/7.50 % ------ 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 %
% 7.16/7.50
% 7.16/7.50 % ------ Proving...
% 7.16/7.50 % ------ Problem Properties
% 7.16/7.50
% 7.16/7.50 %
% 7.16/7.50 % EPR false
% 7.16/7.50 % Horn false
% 7.16/7.50 % Has equality true
% 7.16/7.50
% 7.16/7.50 % % ------ Input Options Time Limit: Unbounded
% 7.16/7.50
% 7.16/7.50
% 7.16/7.50 Compiling...
% 7.16/7.50 Loading plugin: done.
% 7.16/7.50 % % ------ Current options:
% 7.16/7.50
% 7.16/7.50 % ------ Input Options
% 7.16/7.50
% 7.16/7.50 % --out_options all
% 7.16/7.50 % --tptp_safe_out true
% 7.16/7.50 % --problem_path ""
% 7.16/7.50 % --include_path ""
% 7.16/7.50 % --clausifier .//eprover
% 7.16/7.50 % --clausifier_options --tstp-format
% 7.16/7.50 % --stdin false
% 7.16/7.50 % --dbg_backtrace false
% 7.16/7.50 % --dbg_dump_prop_clauses false
% 7.16/7.50 % --dbg_dump_prop_clauses_file -
% 7.16/7.50 % --dbg_out_stat false
% 7.16/7.50
% 7.16/7.50 % ------ General Options
% 7.16/7.50
% 7.16/7.50 % --fof false
% 7.16/7.50 % --time_out_real 150.
% 7.16/7.50 % --time_out_prep_mult 0.2
% 7.16/7.50 % --time_out_virtual -1.
% 7.16/7.50 % --schedule none
% 7.16/7.50 % --ground_splitting input
% 7.16/7.50 % --splitting_nvd 16
% 7.16/7.50 % --non_eq_to_eq false
% 7.16/7.50 % --prep_gs_sim true
% 7.16/7.50 % --prep_unflatten false
% 7.16/7.50 % --prep_res_sim true
% 7.16/7.50 % --prep_upred true
% 7.16/7.50 % --res_sim_input true
% 7.16/7.50 % --clause_weak_htbl true
% 7.16/7.50 % --gc_record_bc_elim false
% 7.16/7.50 % --symbol_type_check false
% 7.16/7.50 % --clausify_out false
% 7.16/7.50 % --large_theory_mode false
% 7.16/7.50 % --prep_sem_filter none
% 7.16/7.50 % --prep_sem_filter_out false
% 7.16/7.50 % --preprocessed_out false
% 7.16/7.50 % --sub_typing false
% 7.16/7.50 % --brand_transform false
% 7.16/7.50 % --pure_diseq_elim true
% 7.16/7.50 % --min_unsat_core false
% 7.16/7.50 % --pred_elim true
% 7.16/7.50 % --add_important_lit false
% 7.16/7.50 % --soft_assumptions false
% 7.16/7.50 % --reset_solvers false
% 7.16/7.50 % --bc_imp_inh []
% 7.16/7.50 % --conj_cone_tolerance 1.5
% 7.16/7.50 % --prolific_symb_bound 500
% 7.16/7.50 % --lt_threshold 2000
% 7.16/7.50
% 7.16/7.50 % ------ SAT Options
% 7.16/7.50
% 7.16/7.50 % --sat_mode false
% 7.16/7.50 % --sat_fm_restart_options ""
% 7.16/7.50 % --sat_gr_def false
% 7.16/7.50 % --sat_epr_types true
% 7.16/7.50 % --sat_non_cyclic_types false
% 7.16/7.50 % --sat_finite_models false
% 7.16/7.50 % --sat_fm_lemmas false
% 7.16/7.50 % --sat_fm_prep false
% 7.16/7.50 % --sat_fm_uc_incr true
% 7.16/7.50 % --sat_out_model small
% 7.16/7.50 % --sat_out_clauses false
% 7.16/7.50
% 7.16/7.50 % ------ QBF Options
% 7.16/7.50
% 7.16/7.50 % --qbf_mode false
% 7.16/7.50 % --qbf_elim_univ true
% 7.16/7.50 % --qbf_sk_in true
% 7.16/7.50 % --qbf_pred_elim true
% 7.16/7.50 % --qbf_split 32
% 7.16/7.50
% 7.16/7.50 % ------ BMC1 Options
% 7.16/7.50
% 7.16/7.50 % --bmc1_incremental false
% 7.16/7.50 % --bmc1_axioms reachable_all
% 7.16/7.50 % --bmc1_min_bound 0
% 7.16/7.50 % --bmc1_max_bound -1
% 7.16/7.50 % --bmc1_max_bound_default -1
% 7.16/7.50 % --bmc1_symbol_reachability true
% 7.16/7.50 % --bmc1_property_lemmas false
% 7.16/7.50 % --bmc1_k_induction false
% 7.16/7.50 % --bmc1_non_equiv_states false
% 7.16/7.50 % --bmc1_deadlock false
% 7.16/7.50 % --bmc1_ucm false
% 7.16/7.50 % --bmc1_add_unsat_core none
% 7.16/7.50 % --bmc1_unsat_core_children false
% 7.16/7.50 % --bmc1_unsat_core_extrapolate_axioms false
% 7.16/7.50 % --bmc1_out_stat full
% 7.16/7.50 % --bmc1_ground_init false
% 7.16/7.50 % --bmc1_pre_inst_next_state false
% 7.16/7.50 % --bmc1_pre_inst_state false
% 7.16/7.50 % --bmc1_pre_inst_reach_state false
% 7.16/7.50 % --bmc1_out_unsat_core false
% 7.16/7.50 % --bmc1_aig_witness_out false
% 7.16/7.50 % --bmc1_verbose false
% 7.16/7.50 % --bmc1_dump_clauses_tptp false
% 7.16/7.50 % --bmc1_dump_unsat_core_tptp false
% 7.16/7.50 % --bmc1_dump_file -
% 7.16/7.50 % --bmc1_ucm_expand_uc_limit 128
% 7.16/7.50 % --bmc1_ucm_n_expand_iterations 6
% 7.16/7.50 % --bmc1_ucm_extend_mode 1
% 7.16/7.50 % --bmc1_ucm_init_mode 2
% 7.16/7.50 % --bmc1_ucm_cone_mode none
% 7.16/7.50 % --bmc1_ucm_reduced_relation_type 0
% 7.16/7.50 % --bmc1_ucm_relax_model 4
% 7.16/7.50 % --bmc1_ucm_full_tr_after_sat true
% 7.16/7.50 % --bmc1_ucm_expand_neg_assumptions false
% 7.16/7.50 % --bmc1_ucm_layered_model none
% 7.16/7.50 % --bmc1_ucm_max_lemma_size 10
% 7.16/7.50
% 7.16/7.50 % ------ AIG Options
% 7.16/7.50
% 7.16/7.50 % --aig_mode false
% 7.16/7.50
% 7.16/7.50 % ------ Instantiation Options
% 7.16/7.50
% 7.16/7.50 % --instantiation_flag true
% 7.16/7.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 7.16/7.50 % --inst_solver_per_active 750
% 7.16/7.50 % --inst_solver_calls_frac 0.5
% 7.16/7.50 % --inst_passive_queue_type priority_queues
% 7.16/7.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 7.16/7.50 % --inst_passive_queues_freq [25;2]
% 7.16/7.50 % --inst_dismatching true
% 7.16/7.50 % --inst_eager_unprocessed_to_passive true
% 7.16/7.50 % --inst_prop_sim_given true
% 7.16/7.50 % --inst_prop_sim_new false
% 7.16/7.50 % --inst_orphan_elimination true
% 7.16/7.50 % --inst_learning_loop_flag true
% 7.16/7.50 % --inst_learning_start 3000
% 7.16/7.50 % --inst_learning_factor 2
% 7.16/7.50 % --inst_start_prop_sim_after_learn 3
% 7.16/7.50 % --inst_sel_renew solver
% 7.16/7.50 % --inst_lit_activity_flag true
% 7.16/7.50 % --inst_out_proof true
% 7.16/7.50
% 7.16/7.50 % ------ Resolution Options
% 7.16/7.50
% 7.16/7.50 % --resolution_flag true
% 7.16/7.50 % --res_lit_sel kbo_max
% 7.16/7.50 % --res_to_prop_solver none
% 7.16/7.50 % --res_prop_simpl_new false
% 7.16/7.50 % --res_prop_simpl_given false
% 7.16/7.50 % --res_passive_queue_type priority_queues
% 7.16/7.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 7.16/7.50 % --res_passive_queues_freq [15;5]
% 7.16/7.50 % --res_forward_subs full
% 7.16/7.50 % --res_backward_subs full
% 7.16/7.50 % --res_forward_subs_resolution true
% 7.16/7.50 % --res_backward_subs_resolution true
% 7.16/7.50 % --res_orphan_elimination false
% 7.16/7.50 % --res_time_limit 1000.
% 7.16/7.50 % --res_out_proof true
% 7.16/7.50 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ad95e8.s
% 7.16/7.50 % --modulo true
% 7.16/7.50
% 7.16/7.50 % ------ Combination Options
% 7.16/7.50
% 7.16/7.50 % --comb_res_mult 1000
% 7.16/7.50 % --comb_inst_mult 300
% 7.16/7.50 % ------
% 7.16/7.50
% 7.16/7.50
% 7.16/7.50
% 7.16/7.50 % ------ Proving...
% 7.16/7.50 % warning: shown sat in sat incomplete mode
% 7.16/7.50 %
% 7.16/7.50
% 7.16/7.50
% 7.16/7.50
% 7.16/7.50
% 7.16/7.50 cnf(c_23,plain,
% 7.16/7.50 ( nil != x1 ),
% 7.16/7.50 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_19) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_38,plain,( nil != x1 ),inference(copy,[status(esa)],[c_23]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_48,plain,( nil != x1 ),inference(copy,[status(esa)],[c_38]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_51,plain,( nil != x1 ),inference(copy,[status(esa)],[c_48]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_56,plain,( nil != x1 ),inference(copy,[status(esa)],[c_51]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_128,plain,( nil != x1 ),inference(copy,[status(esa)],[c_56]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_10,plain,
% 7.16/7.50 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X1 | X0 = X2 ),
% 7.16/7.50 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_48_0) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_102,plain,
% 7.16/7.50 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X1 | X0 = X2 ),
% 7.16/7.50 inference(copy,[status(esa)],[c_10]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_140,plain,
% 7.16/7.50 ( ~ heap(sep(lseg(nil,X0),sep(lseg(nil,x1),X1))) | nil = X0 ),
% 7.16/7.50 inference(resolution,[status(thm)],[c_128,c_102]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_141,plain,
% 7.16/7.50 ( ~ heap(sep(lseg(nil,X0),sep(lseg(nil,x1),X1))) | nil = X0 ),
% 7.16/7.50 inference(rewriting,[status(thm)],[c_140]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_22,plain,
% 7.16/7.50 ( x2 != x1 ),
% 7.16/7.50 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_18) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_36,plain,( x2 != x1 ),inference(copy,[status(esa)],[c_22]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_47,plain,( x2 != x1 ),inference(copy,[status(esa)],[c_36]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_52,plain,( x2 != x1 ),inference(copy,[status(esa)],[c_47]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_55,plain,( x2 != x1 ),inference(copy,[status(esa)],[c_52]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_126,plain,( x2 != x1 ),inference(copy,[status(esa)],[c_55]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_136,plain,
% 7.16/7.50 ( ~ heap(sep(lseg(x2,X0),sep(lseg(x2,x1),X1))) | x2 = X0 ),
% 7.16/7.50 inference(resolution,[status(thm)],[c_126,c_102]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_137,plain,
% 7.16/7.50 ( ~ heap(sep(lseg(x2,X0),sep(lseg(x2,x1),X1))) | x2 = X0 ),
% 7.16/7.50 inference(rewriting,[status(thm)],[c_136]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_13,plain,
% 7.16/7.50 ( heap(sep(lseg(X0,X1),X2))
% 7.16/7.50 | X0 = X3
% 7.16/7.50 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))) ),
% 7.16/7.50 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_46_2) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_108,plain,
% 7.16/7.50 ( heap(sep(lseg(X0,X1),X2))
% 7.16/7.50 | X0 = X3
% 7.16/7.50 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))) ),
% 7.16/7.50 inference(copy,[status(esa)],[c_13]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_109,plain,
% 7.16/7.50 ( heap(sep(lseg(X0,X1),X2))
% 7.16/7.50 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2)))
% 7.16/7.50 | X0 = X3 ),
% 7.16/7.50 inference(rewriting,[status(thm)],[c_108]) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_24,plain,
% 7.16/7.50 ( heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))) ),
% 7.16/7.50 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_16) ).
% 7.16/7.50
% 7.16/7.50 cnf(c_40,plain,
% 7.16/7.50 ( heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))) ),
% 7.16/7.50 inference(copy,[status(esa)],[c_24]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_49,plain,
% 7.16/7.51 ( heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_40]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_50,plain,
% 7.16/7.51 ( heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_49]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_57,plain,
% 7.16/7.51 ( heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_50]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_130,plain,
% 7.16/7.51 ( heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_57]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_21,negated_conjecture,
% 7.16/7.51 ( ~ heap(sep(lseg(x1,nil),emp)) ),
% 7.16/7.51 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_17) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_42,negated_conjecture,
% 7.16/7.51 ( ~ heap(sep(lseg(x1,nil),emp)) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_21]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_46,negated_conjecture,
% 7.16/7.51 ( ~ heap(sep(lseg(x1,nil),emp)) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_42]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_53,negated_conjecture,
% 7.16/7.51 ( ~ heap(sep(lseg(x1,nil),emp)) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_46]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_54,negated_conjecture,
% 7.16/7.51 ( ~ heap(sep(lseg(x1,nil),emp)) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_53]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_124,negated_conjecture,
% 7.16/7.51 ( ~ heap(sep(lseg(x1,nil),emp)) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_54]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_18,plain,
% 7.16/7.51 ( heap(sep(lseg(X0,X1),sep(lseg(X1,X2),X3)))
% 7.16/7.51 | X1 = X2
% 7.16/7.51 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(lseg(X1,X2),X3)))) ),
% 7.16/7.51 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_44_2) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_118,plain,
% 7.16/7.51 ( heap(sep(lseg(X0,X1),sep(lseg(X1,X2),X3)))
% 7.16/7.51 | X1 = X2
% 7.16/7.51 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(lseg(X1,X2),X3)))) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_18]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_119,plain,
% 7.16/7.51 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(lseg(X2,X3),X4))))
% 7.16/7.51 | heap(sep(lseg(X0,X2),sep(lseg(X2,X3),X4)))
% 7.16/7.51 | X2 = X3 ),
% 7.16/7.51 inference(rewriting,[status(thm)],[c_118]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_16,plain,
% 7.16/7.51 ( heap(sep(lseg(X0,X1),sep(next(X1,X2),X3)))
% 7.16/7.51 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(next(X1,X2),X3)))) ),
% 7.16/7.51 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_45_1) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_114,plain,
% 7.16/7.51 ( heap(sep(lseg(X0,X1),sep(next(X1,X2),X3)))
% 7.16/7.51 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(next(X1,X2),X3)))) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_16]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_115,plain,
% 7.16/7.51 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(next(X2,X3),X4))))
% 7.16/7.51 | heap(sep(lseg(X0,X2),sep(next(X2,X3),X4))) ),
% 7.16/7.51 inference(rewriting,[status(thm)],[c_114]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_11,plain,
% 7.16/7.51 ( heap(sep(lseg(X0,nil),X1))
% 7.16/7.51 | ~ heap(sep(lseg(X0,X2),sep(lseg(X2,nil),X1))) ),
% 7.16/7.51 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_47_1) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_104,plain,
% 7.16/7.51 ( heap(sep(lseg(X0,nil),X1))
% 7.16/7.51 | ~ heap(sep(lseg(X0,X2),sep(lseg(X2,nil),X1))) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_11]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_8,plain,
% 7.16/7.51 ( X0 = X1 | X0 = X2 | ~ heap(sep(lseg(X0,X2),sep(lseg(X0,X1),X3))) ),
% 7.16/7.51 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_48_2) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_98,plain,
% 7.16/7.51 ( X0 = X1 | X0 = X2 | ~ heap(sep(lseg(X0,X2),sep(lseg(X0,X1),X3))) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_8]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_99,plain,
% 7.16/7.51 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X2 | X0 = X1 ),
% 7.16/7.51 inference(rewriting,[status(thm)],[c_98]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_6,plain,
% 7.16/7.51 ( X0 = X1 | ~ heap(sep(next(X0,X2),sep(lseg(X0,X1),X3))) ),
% 7.16/7.51 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_49_1) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_94,plain,
% 7.16/7.51 ( X0 = X1 | ~ heap(sep(next(X0,X2),sep(lseg(X0,X1),X3))) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_6]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_95,plain,
% 7.16/7.51 ( ~ heap(sep(next(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X2 ),
% 7.16/7.51 inference(rewriting,[status(thm)],[c_94]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_4,plain,
% 7.16/7.51 ( X0 = nil | ~ heap(sep(lseg(nil,X0),X1)) ),
% 7.16/7.51 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_51_1) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_90,plain,
% 7.16/7.51 ( X0 = nil | ~ heap(sep(lseg(nil,X0),X1)) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_4]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_91,plain,
% 7.16/7.51 ( ~ heap(sep(lseg(nil,X0),X1)) | X0 = nil ),
% 7.16/7.51 inference(rewriting,[status(thm)],[c_90]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_3,plain,
% 7.16/7.51 ( ~ heap(sep(next(X0,X1),sep(next(X0,X2),X3))) ),
% 7.16/7.51 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_50_0) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_88,plain,
% 7.16/7.51 ( ~ heap(sep(next(X0,X1),sep(next(X0,X2),X3))) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_3]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_2,plain,
% 7.16/7.51 ( ~ heap(sep(next(nil,X0),X1)) ),
% 7.16/7.51 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_52_0) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_86,plain,
% 7.16/7.51 ( ~ heap(sep(next(nil,X0),X1)) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_2]) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_1,plain,
% 7.16/7.51 ( sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)) ),
% 7.16/7.51 file('/export/starexec/sandbox/tmp/iprover_modulo_1f6aab.p', c_0_53_0) ).
% 7.16/7.51
% 7.16/7.51 cnf(c_84,plain,
% 7.16/7.51 ( sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)) ),
% 7.16/7.51 inference(copy,[status(esa)],[c_1]) ).
% 7.16/7.51
% 7.16/7.51
% 7.16/7.51
% 7.16/7.51 % ------ Statistics
% 7.16/7.51
% 7.16/7.51 % ------ General
% 7.16/7.51
% 7.16/7.51 % num_of_input_clauses: 25
% 7.16/7.51 % num_of_input_neg_conjectures: 1
% 7.16/7.51 % num_of_splits: 0
% 7.16/7.51 % num_of_split_atoms: 0
% 7.16/7.51 % num_of_sem_filtered_clauses: 0
% 7.16/7.51 % num_of_subtypes: 0
% 7.16/7.51 % monotx_restored_types: 0
% 7.16/7.51 % sat_num_of_epr_types: 0
% 7.16/7.51 % sat_num_of_non_cyclic_types: 0
% 7.16/7.51 % sat_guarded_non_collapsed_types: 0
% 7.16/7.51 % is_epr: 0
% 7.16/7.51 % is_horn: 0
% 7.16/7.51 % has_eq: 1
% 7.16/7.51 % num_pure_diseq_elim: 0
% 7.16/7.51 % simp_replaced_by: 0
% 7.16/7.51 % res_preprocessed: 5
% 7.16/7.51 % prep_upred: 0
% 7.16/7.51 % prep_unflattend: 0
% 7.16/7.51 % pred_elim_cands: 0
% 7.16/7.51 % pred_elim: 0
% 7.16/7.51 % pred_elim_cl: 0
% 7.16/7.51 % pred_elim_cycles: 0
% 7.16/7.51 % forced_gc_time: 0
% 7.16/7.51 % gc_basic_clause_elim: 0
% 7.16/7.51 % parsing_time: 0.001
% 7.16/7.51 % sem_filter_time: 0.
% 7.16/7.51 % pred_elim_time: 0.
% 7.16/7.51 % out_proof_time: 0.
% 7.16/7.51 % monotx_time: 0.
% 7.16/7.51 % subtype_inf_time: 0.
% 7.16/7.51 % unif_index_cands_time: 0.
% 7.16/7.51 % unif_index_add_time: 0.
% 7.16/7.51 % total_time: 0.161
% 7.16/7.51 % num_of_symbols: 33
% 7.16/7.51 % num_of_terms: 181
% 7.16/7.51
% 7.16/7.51 % ------ Propositional Solver
% 7.16/7.51
% 7.16/7.51 % prop_solver_calls: 1
% 7.16/7.51 % prop_fast_solver_calls: 9
% 7.16/7.51 % prop_num_of_clauses: 32
% 7.16/7.51 % prop_preprocess_simplified: 83
% 7.16/7.51 % prop_fo_subsumed: 0
% 7.16/7.51 % prop_solver_time: 0.
% 7.16/7.51 % prop_fast_solver_time: 0.
% 7.16/7.51 % prop_unsat_core_time: 0.
% 7.16/7.51
% 7.16/7.51 % ------ QBF
% 7.16/7.51
% 7.16/7.51 % qbf_q_res: 0
% 7.16/7.51 % qbf_num_tautologies: 0
% 7.16/7.51 % qbf_prep_cycles: 0
% 7.16/7.51
% 7.16/7.51 % ------ BMC1
% 7.16/7.51
% 7.16/7.51 % bmc1_current_bound: -1
% 7.16/7.51 % bmc1_last_solved_bound: -1
% 7.16/7.51 % bmc1_unsat_core_size: -1
% 7.16/7.51 % bmc1_unsat_core_parents_size: -1
% 7.16/7.51 % bmc1_merge_next_fun: 0
% 7.16/7.51 % bmc1_unsat_core_clauses_time: 0.
% 7.16/7.51
% 7.16/7.51 % ------ Instantiation
% 7.16/7.51
% 7.16/7.51 % inst_num_of_clauses: 25
% 7.16/7.51 % inst_num_in_passive: 0
% 7.16/7.51 % inst_num_in_active: 0
% 7.16/7.51 % inst_num_in_unprocessed: 25
% 7.16/7.51 % inst_num_of_loops: 0
% 7.16/7.51 % inst_num_of_learning_restarts: 0
% 7.16/7.51 % inst_num_moves_active_passive: 0
% 7.16/7.51 % inst_lit_activity: 0
% 7.16/7.51 % inst_lit_activity_moves: 0
% 7.16/7.51 % inst_num_tautologies: 0
% 7.16/7.51 % inst_num_prop_implied: 0
% 7.16/7.51 % inst_num_existing_simplified: 0
% 7.16/7.51 % inst_num_eq_res_simplified: 0
% 7.16/7.51 % inst_num_child_elim: 0
% 7.16/7.51 % inst_num_of_dismatching_blockings: 0
% 7.16/7.51 % inst_num_of_non_proper_insts: 0
% 7.16/7.51 % inst_num_of_duplicates: 0
% 7.16/7.51 % inst_inst_num_from_inst_to_res: 0
% 7.16/7.51 % inst_dismatching_checking_time: 0.
% 7.16/7.51
% 7.16/7.51 % ------ Resolution
% 7.16/7.51
% 7.16/7.51 % res_num_of_clauses: 28
% 7.16/7.51 % res_num_in_passive: 0
% 7.16/7.51 % res_num_in_active: 17
% 7.16/7.51 % res_num_of_loops: 7
% 7.16/7.51 % res_forward_subset_subsumed: 9
% 7.16/7.51 % res_backward_subset_subsumed: 0
% 7.16/7.51 % res_forward_subsumed: 0
% 7.16/7.51 % res_backward_subsumed: 0
% 7.16/7.51 % res_forward_subsumption_resolution: 0
% 7.16/7.51 % res_backward_subsumption_resolution: 0
% 7.16/7.51 % res_clause_to_clause_subsumption: 1
% 7.16/7.51 % res_orphan_elimination: 0
% 7.16/7.51 % res_tautology_del: 0
% 7.16/7.51 % res_num_eq_res_simplified: 0
% 7.16/7.51 % res_num_sel_changes: 0
% 7.16/7.51 % res_moves_from_active_to_pass: 0
% 7.16/7.51
% 7.16/7.51 % Status Unknown
% 7.16/7.51 % Last status :
% 7.16/7.51 % SZS status Unknown
%------------------------------------------------------------------------------