TSTP Solution File: SWW421-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWW421-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n025.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:51 EDT 2022
% Result : Unknown 2.14s 2.46s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWW421-1 : TPTP v8.1.0. Released v5.2.0.
% 0.08/0.14 % Command : iprover_modulo %s %d
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 5 21:44:32 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % Running in mono-core mode
% 0.22/0.43 % Orienting using strategy Equiv(ClausalAll)
% 0.22/0.43 % Orientation found
% 0.22/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/sandbox2/tmp/iprover_proof_3c5a55.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_cdd0a4 | grep -v "SZS"
% 0.22/0.45
% 0.22/0.45 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.45
% 0.22/0.45 %
% 0.22/0.45 % ------ iProver source info
% 0.22/0.45
% 0.22/0.45 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.45 % git: non_committed_changes: true
% 0.22/0.45 % git: last_make_outside_of_git: true
% 0.22/0.45
% 0.22/0.45 %
% 0.22/0.45 % ------ Input Options
% 0.22/0.45
% 0.22/0.45 % --out_options all
% 0.22/0.45 % --tptp_safe_out true
% 0.22/0.45 % --problem_path ""
% 0.22/0.45 % --include_path ""
% 0.22/0.45 % --clausifier .//eprover
% 0.22/0.45 % --clausifier_options --tstp-format
% 0.22/0.45 % --stdin false
% 0.22/0.45 % --dbg_backtrace false
% 0.22/0.45 % --dbg_dump_prop_clauses false
% 0.22/0.45 % --dbg_dump_prop_clauses_file -
% 0.22/0.45 % --dbg_out_stat false
% 0.22/0.45
% 0.22/0.45 % ------ General Options
% 0.22/0.45
% 0.22/0.45 % --fof false
% 0.22/0.45 % --time_out_real 150.
% 0.22/0.45 % --time_out_prep_mult 0.2
% 0.22/0.45 % --time_out_virtual -1.
% 0.22/0.45 % --schedule none
% 0.22/0.45 % --ground_splitting input
% 0.22/0.45 % --splitting_nvd 16
% 0.22/0.45 % --non_eq_to_eq false
% 0.22/0.45 % --prep_gs_sim true
% 0.22/0.45 % --prep_unflatten false
% 0.22/0.45 % --prep_res_sim true
% 0.22/0.45 % --prep_upred true
% 0.22/0.45 % --res_sim_input true
% 0.22/0.45 % --clause_weak_htbl true
% 0.22/0.45 % --gc_record_bc_elim false
% 0.22/0.45 % --symbol_type_check false
% 0.22/0.45 % --clausify_out false
% 0.22/0.45 % --large_theory_mode false
% 0.22/0.45 % --prep_sem_filter none
% 0.22/0.45 % --prep_sem_filter_out false
% 0.22/0.45 % --preprocessed_out false
% 0.22/0.45 % --sub_typing false
% 0.22/0.45 % --brand_transform false
% 0.22/0.45 % --pure_diseq_elim true
% 0.22/0.45 % --min_unsat_core false
% 0.22/0.45 % --pred_elim true
% 0.22/0.45 % --add_important_lit false
% 0.22/0.45 % --soft_assumptions false
% 0.22/0.45 % --reset_solvers false
% 0.22/0.45 % --bc_imp_inh []
% 0.22/0.45 % --conj_cone_tolerance 1.5
% 0.22/0.45 % --prolific_symb_bound 500
% 0.22/0.45 % --lt_threshold 2000
% 0.22/0.45
% 0.22/0.45 % ------ SAT Options
% 0.22/0.45
% 0.22/0.45 % --sat_mode false
% 0.22/0.45 % --sat_fm_restart_options ""
% 0.22/0.45 % --sat_gr_def false
% 0.22/0.45 % --sat_epr_types true
% 0.22/0.45 % --sat_non_cyclic_types false
% 0.22/0.45 % --sat_finite_models false
% 0.22/0.45 % --sat_fm_lemmas false
% 0.22/0.45 % --sat_fm_prep false
% 0.22/0.45 % --sat_fm_uc_incr true
% 0.22/0.45 % --sat_out_model small
% 0.22/0.45 % --sat_out_clauses false
% 0.22/0.45
% 0.22/0.45 % ------ QBF Options
% 0.22/0.45
% 0.22/0.45 % --qbf_mode false
% 0.22/0.45 % --qbf_elim_univ true
% 0.22/0.45 % --qbf_sk_in true
% 0.22/0.45 % --qbf_pred_elim true
% 0.22/0.45 % --qbf_split 32
% 0.22/0.45
% 0.22/0.45 % ------ BMC1 Options
% 0.22/0.45
% 0.22/0.45 % --bmc1_incremental false
% 0.22/0.45 % --bmc1_axioms reachable_all
% 0.22/0.45 % --bmc1_min_bound 0
% 0.22/0.45 % --bmc1_max_bound -1
% 0.22/0.45 % --bmc1_max_bound_default -1
% 0.22/0.45 % --bmc1_symbol_reachability true
% 0.22/0.45 % --bmc1_property_lemmas false
% 0.22/0.45 % --bmc1_k_induction false
% 0.22/0.45 % --bmc1_non_equiv_states false
% 0.22/0.45 % --bmc1_deadlock false
% 0.22/0.45 % --bmc1_ucm false
% 0.22/0.45 % --bmc1_add_unsat_core none
% 0.22/0.45 % --bmc1_unsat_core_children false
% 0.22/0.45 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.45 % --bmc1_out_stat full
% 0.22/0.45 % --bmc1_ground_init false
% 0.22/0.45 % --bmc1_pre_inst_next_state false
% 0.22/0.45 % --bmc1_pre_inst_state false
% 0.22/0.45 % --bmc1_pre_inst_reach_state false
% 0.22/0.45 % --bmc1_out_unsat_core false
% 0.22/0.45 % --bmc1_aig_witness_out false
% 0.22/0.45 % --bmc1_verbose false
% 0.22/0.45 % --bmc1_dump_clauses_tptp false
% 0.22/0.57 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.57 % --bmc1_dump_file -
% 0.22/0.57 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.57 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.57 % --bmc1_ucm_extend_mode 1
% 0.22/0.57 % --bmc1_ucm_init_mode 2
% 0.22/0.57 % --bmc1_ucm_cone_mode none
% 0.22/0.57 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.57 % --bmc1_ucm_relax_model 4
% 0.22/0.57 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.57 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.57 % --bmc1_ucm_layered_model none
% 0.22/0.57 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.57
% 0.22/0.57 % ------ AIG Options
% 0.22/0.57
% 0.22/0.57 % --aig_mode false
% 0.22/0.57
% 0.22/0.57 % ------ Instantiation Options
% 0.22/0.57
% 0.22/0.57 % --instantiation_flag true
% 0.22/0.57 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.57 % --inst_solver_per_active 750
% 0.22/0.57 % --inst_solver_calls_frac 0.5
% 0.22/0.57 % --inst_passive_queue_type priority_queues
% 0.22/0.57 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.57 % --inst_passive_queues_freq [25;2]
% 0.22/0.57 % --inst_dismatching true
% 0.22/0.57 % --inst_eager_unprocessed_to_passive true
% 0.22/0.57 % --inst_prop_sim_given true
% 0.22/0.57 % --inst_prop_sim_new false
% 0.22/0.57 % --inst_orphan_elimination true
% 0.22/0.57 % --inst_learning_loop_flag true
% 0.22/0.57 % --inst_learning_start 3000
% 0.22/0.57 % --inst_learning_factor 2
% 0.22/0.57 % --inst_start_prop_sim_after_learn 3
% 0.22/0.57 % --inst_sel_renew solver
% 0.22/0.57 % --inst_lit_activity_flag true
% 0.22/0.57 % --inst_out_proof true
% 0.22/0.57
% 0.22/0.57 % ------ Resolution Options
% 0.22/0.57
% 0.22/0.57 % --resolution_flag true
% 0.22/0.57 % --res_lit_sel kbo_max
% 0.22/0.57 % --res_to_prop_solver none
% 0.22/0.57 % --res_prop_simpl_new false
% 0.22/0.57 % --res_prop_simpl_given false
% 0.22/0.57 % --res_passive_queue_type priority_queues
% 0.22/0.57 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.57 % --res_passive_queues_freq [15;5]
% 0.22/0.57 % --res_forward_subs full
% 0.22/0.57 % --res_backward_subs full
% 0.22/0.57 % --res_forward_subs_resolution true
% 0.22/0.57 % --res_backward_subs_resolution true
% 0.22/0.57 % --res_orphan_elimination false
% 0.22/0.57 % --res_time_limit 1000.
% 0.22/0.57 % --res_out_proof true
% 0.22/0.57 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_3c5a55.s
% 0.22/0.57 % --modulo true
% 0.22/0.57
% 0.22/0.57 % ------ Combination Options
% 0.22/0.57
% 0.22/0.57 % --comb_res_mult 1000
% 0.22/0.57 % --comb_inst_mult 300
% 0.22/0.57 % ------
% 0.22/0.57
% 0.22/0.57 % ------ Parsing...% successful
% 0.22/0.57
% 0.22/0.57 % ------ 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.22/0.57
% 0.22/0.57 % ------ Proving...
% 0.22/0.57 % ------ Problem Properties
% 0.22/0.57
% 0.22/0.57 %
% 0.22/0.57 % EPR false
% 0.22/0.57 % Horn false
% 0.22/0.57 % Has equality true
% 0.22/0.57
% 0.22/0.57 % % ------ Input Options Time Limit: Unbounded
% 0.22/0.57
% 0.22/0.57
% 0.22/0.57 Compiling...
% 0.22/0.57 Loading plugin: done.
% 0.22/0.57 % % ------ Current options:
% 0.22/0.57
% 0.22/0.57 % ------ Input Options
% 0.22/0.57
% 0.22/0.57 % --out_options all
% 0.22/0.57 % --tptp_safe_out true
% 0.22/0.57 % --problem_path ""
% 0.22/0.57 % --include_path ""
% 0.22/0.57 % --clausifier .//eprover
% 0.22/0.57 % --clausifier_options --tstp-format
% 0.22/0.57 % --stdin false
% 0.22/0.57 % --dbg_backtrace false
% 0.22/0.57 % --dbg_dump_prop_clauses false
% 0.22/0.57 % --dbg_dump_prop_clauses_file -
% 0.22/0.57 % --dbg_out_stat false
% 0.22/0.57
% 0.22/0.57 % ------ General Options
% 0.22/0.57
% 0.22/0.57 % --fof false
% 0.22/0.57 % --time_out_real 150.
% 0.22/0.57 % --time_out_prep_mult 0.2
% 0.22/0.57 % --time_out_virtual -1.
% 0.22/0.57 % --schedule none
% 0.22/0.57 % --ground_splitting input
% 0.22/0.57 % --splitting_nvd 16
% 0.22/0.57 % --non_eq_to_eq false
% 0.22/0.57 % --prep_gs_sim true
% 0.22/0.57 % --prep_unflatten false
% 0.22/0.57 % --prep_res_sim true
% 0.22/0.57 % --prep_upred true
% 0.22/0.57 % --res_sim_input true
% 0.22/0.57 % --clause_weak_htbl true
% 0.22/0.57 % --gc_record_bc_elim false
% 0.22/0.57 % --symbol_type_check false
% 0.22/0.57 % --clausify_out false
% 0.22/0.57 % --large_theory_mode false
% 0.22/0.57 % --prep_sem_filter none
% 0.22/0.57 % --prep_sem_filter_out false
% 0.22/0.57 % --preprocessed_out false
% 0.22/0.57 % --sub_typing false
% 0.22/0.57 % --brand_transform false
% 0.22/0.57 % --pure_diseq_elim true
% 0.22/0.57 % --min_unsat_core false
% 0.22/0.57 % --pred_elim true
% 0.22/0.57 % --add_important_lit false
% 0.22/0.57 % --soft_assumptions false
% 0.22/0.57 % --reset_solvers false
% 0.22/0.57 % --bc_imp_inh []
% 0.22/0.57 % --conj_cone_tolerance 1.5
% 0.22/0.57 % --prolific_symb_bound 500
% 0.22/0.57 % --lt_threshold 2000
% 0.22/0.57
% 0.22/0.57 % ------ SAT Options
% 0.22/0.57
% 0.22/0.57 % --sat_mode false
% 0.22/0.57 % --sat_fm_restart_options ""
% 0.22/0.57 % --sat_gr_def false
% 0.22/0.57 % --sat_epr_types true
% 0.22/0.57 % --sat_non_cyclic_types false
% 0.22/0.57 % --sat_finite_models false
% 0.22/0.57 % --sat_fm_lemmas false
% 0.22/0.57 % --sat_fm_prep false
% 0.22/0.57 % --sat_fm_uc_incr true
% 0.22/0.57 % --sat_out_model small
% 0.22/0.57 % --sat_out_clauses false
% 0.22/0.57
% 0.22/0.57 % ------ QBF Options
% 0.22/0.57
% 0.22/0.57 % --qbf_mode false
% 0.22/0.57 % --qbf_elim_univ true
% 0.22/0.57 % --qbf_sk_in true
% 0.22/0.57 % --qbf_pred_elim true
% 0.22/0.57 % --qbf_split 32
% 0.22/0.57
% 0.22/0.57 % ------ BMC1 Options
% 0.22/0.57
% 0.22/0.57 % --bmc1_incremental false
% 0.22/0.57 % --bmc1_axioms reachable_all
% 0.22/0.57 % --bmc1_min_bound 0
% 0.22/0.57 % --bmc1_max_bound -1
% 0.22/0.57 % --bmc1_max_bound_default -1
% 0.22/0.57 % --bmc1_symbol_reachability true
% 0.22/0.57 % --bmc1_property_lemmas false
% 0.22/0.57 % --bmc1_k_induction false
% 0.22/0.57 % --bmc1_non_equiv_states false
% 0.22/0.57 % --bmc1_deadlock false
% 0.22/0.57 % --bmc1_ucm false
% 0.22/0.57 % --bmc1_add_unsat_core none
% 0.22/0.57 % --bmc1_unsat_core_children false
% 0.22/0.57 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.57 % --bmc1_out_stat full
% 0.22/0.57 % --bmc1_ground_init false
% 0.22/0.57 % --bmc1_pre_inst_next_state false
% 0.22/0.57 % --bmc1_pre_inst_state false
% 0.22/0.57 % --bmc1_pre_inst_reach_state false
% 0.22/0.57 % --bmc1_out_unsat_core false
% 0.22/0.57 % --bmc1_aig_witness_out false
% 0.22/0.57 % --bmc1_verbose false
% 0.22/0.57 % --bmc1_dump_clauses_tptp false
% 0.22/0.57 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.57 % --bmc1_dump_file -
% 0.22/0.57 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.57 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.57 % --bmc1_ucm_extend_mode 1
% 0.22/0.57 % --bmc1_ucm_init_mode 2
% 0.22/0.57 % --bmc1_ucm_cone_mode none
% 0.22/0.57 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.57 % --bmc1_ucm_relax_model 4
% 0.22/0.57 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.57 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.57 % --bmc1_ucm_layered_model none
% 0.22/0.57 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.57
% 0.22/0.57 % ------ AIG Options
% 0.22/0.57
% 0.22/0.57 % --aig_mode false
% 0.22/0.57
% 0.22/0.57 % ------ Instantiation Options
% 0.22/0.57
% 0.22/0.57 % --instantiation_flag true
% 0.22/0.57 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.57 % --inst_solver_per_active 750
% 0.22/0.57 % --inst_solver_calls_frac 0.5
% 0.22/0.57 % --inst_passive_queue_type priority_queues
% 0.22/0.57 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.57 % --inst_passive_queues_freq [25;2]
% 0.22/0.57 % --inst_dismatching true
% 0.22/0.57 % --inst_eager_unprocessed_to_passive true
% 2.03/2.24 % --inst_prop_sim_given true
% 2.03/2.24 % --inst_prop_sim_new false
% 2.03/2.24 % --inst_orphan_elimination true
% 2.03/2.24 % --inst_learning_loop_flag true
% 2.03/2.24 % --inst_learning_start 3000
% 2.03/2.24 % --inst_learning_factor 2
% 2.03/2.24 % --inst_start_prop_sim_after_learn 3
% 2.03/2.24 % --inst_sel_renew solver
% 2.03/2.24 % --inst_lit_activity_flag true
% 2.03/2.24 % --inst_out_proof true
% 2.03/2.24
% 2.03/2.24 % ------ Resolution Options
% 2.03/2.24
% 2.03/2.24 % --resolution_flag true
% 2.03/2.24 % --res_lit_sel kbo_max
% 2.03/2.24 % --res_to_prop_solver none
% 2.03/2.24 % --res_prop_simpl_new false
% 2.03/2.24 % --res_prop_simpl_given false
% 2.03/2.24 % --res_passive_queue_type priority_queues
% 2.03/2.24 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.03/2.24 % --res_passive_queues_freq [15;5]
% 2.03/2.24 % --res_forward_subs full
% 2.03/2.24 % --res_backward_subs full
% 2.03/2.24 % --res_forward_subs_resolution true
% 2.03/2.24 % --res_backward_subs_resolution true
% 2.03/2.24 % --res_orphan_elimination false
% 2.03/2.24 % --res_time_limit 1000.
% 2.03/2.24 % --res_out_proof true
% 2.03/2.24 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_3c5a55.s
% 2.03/2.24 % --modulo true
% 2.03/2.24
% 2.03/2.24 % ------ Combination Options
% 2.03/2.24
% 2.03/2.24 % --comb_res_mult 1000
% 2.03/2.24 % --comb_inst_mult 300
% 2.03/2.24 % ------
% 2.03/2.24
% 2.03/2.24
% 2.03/2.24
% 2.03/2.24 % ------ Proving...
% 2.03/2.24 % warning: shown sat in sat incomplete mode
% 2.03/2.24 %
% 2.03/2.24
% 2.03/2.24
% 2.03/2.24 ------ Building Model...Done
% 2.03/2.24
% 2.03/2.24 %------ The model is defined over ground terms (initial term algebra).
% 2.03/2.24 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.03/2.24 %------ where \phi is a formula over the term algebra.
% 2.03/2.24 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.03/2.24 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.03/2.24 %------ See help for --sat_out_model for different model outputs.
% 2.03/2.24 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.03/2.24 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.03/2.24
% 2.03/2.24
% 2.03/2.24
% 2.03/2.24
% 2.03/2.24 %------ Positive definition of equality_sorted
% 2.03/2.24 fof(lit_def,axiom,
% 2.03/2.24 (! [X0,X0,X1] :
% 2.03/2.24 ( equality_sorted(X0,X0,X1) <=>
% 2.03/2.24 (
% 2.03/2.24 ? [X2] :
% 2.03/2.24 (
% 2.03/2.24 ( X0=$i & X0=sep(lseg(X2,X2),X1) )
% 2.03/2.24 )
% 2.03/2.24
% 2.03/2.24 |
% 2.03/2.24 ? [X2,X3,X4] :
% 2.03/2.24 (
% 2.03/2.24 ( X0=$i & X0=sep(X2,sep(X3,X4)) & X1=sep(X3,sep(X2,X4)) )
% 2.03/2.24 )
% 2.03/2.24
% 2.03/2.24 )
% 2.03/2.24 )
% 2.03/2.24 )
% 2.03/2.24 ).
% 2.03/2.24
% 2.03/2.24 %------ Positive definition of heap
% 2.03/2.24 fof(lit_def,axiom,
% 2.03/2.24 (! [X0] :
% 2.03/2.24 ( heap(X0) <=>
% 2.03/2.24 (
% 2.03/2.24 (
% 2.03/2.24 ( X0=sep(lseg(x2,x3),sep(next(x1,x2),emp)) )
% 2.03/2.24 )
% 2.03/2.24
% 2.03/2.24 )
% 2.03/2.24 )
% 2.03/2.24 )
% 2.03/2.24 ).
% 2.03/2.24
% 2.03/2.24
% 2.03/2.24
% 2.03/2.24 % ------ Statistics
% 2.03/2.24
% 2.03/2.24 % ------ General
% 2.03/2.24
% 2.03/2.24 % num_of_input_clauses: 26
% 2.03/2.24 % num_of_input_neg_conjectures: 1
% 2.03/2.24 % num_of_splits: 0
% 2.03/2.24 % num_of_split_atoms: 0
% 2.03/2.24 % num_of_sem_filtered_clauses: 0
% 2.03/2.24 % num_of_subtypes: 0
% 2.03/2.24 % monotx_restored_types: 0
% 2.03/2.24 % sat_num_of_epr_types: 0
% 2.03/2.24 % sat_num_of_non_cyclic_types: 0
% 2.03/2.24 % sat_guarded_non_collapsed_types: 0
% 2.03/2.24 % is_epr: 0
% 2.03/2.24 % is_horn: 0
% 2.03/2.24 % has_eq: 1
% 2.03/2.24 % num_pure_diseq_elim: 0
% 2.03/2.24 % simp_replaced_by: 0
% 2.03/2.24 % res_preprocessed: 6
% 2.03/2.24 % prep_upred: 0
% 2.03/2.24 % prep_unflattend: 0
% 2.03/2.24 % pred_elim_cands: 0
% 2.03/2.24 % pred_elim: 0
% 2.03/2.24 % pred_elim_cl: 0
% 2.03/2.24 % pred_elim_cycles: 0
% 2.03/2.24 % forced_gc_time: 0
% 2.03/2.24 % gc_basic_clause_elim: 0
% 2.03/2.24 % parsing_time: 0.002
% 2.03/2.24 % sem_filter_time: 0.
% 2.03/2.24 % pred_elim_time: 0.
% 2.03/2.24 % out_proof_time: 0.
% 2.03/2.24 % monotx_time: 0.
% 2.03/2.24 % subtype_inf_time: 0.
% 2.03/2.24 % unif_index_cands_time: 0.001
% 2.03/2.24 % unif_index_add_time: 0.005
% 2.03/2.24 % total_time: 1.801
% 2.03/2.24 % num_of_symbols: 34
% 2.03/2.24 % num_of_terms: 13575
% 2.03/2.24
% 2.03/2.24 % ------ Propositional Solver
% 2.03/2.24
% 2.03/2.24 % prop_solver_calls: 2
% 2.03/2.24 % prop_fast_solver_calls: 11
% 2.03/2.24 % prop_num_of_clauses: 33
% 2.03/2.24 % prop_preprocess_simplified: 136
% 2.03/2.24 % prop_fo_subsumed: 0
% 2.03/2.24 % prop_solver_time: 0.
% 2.03/2.24 % prop_fast_solver_time: 0.
% 2.03/2.24 % prop_unsat_core_time: 0.
% 2.03/2.24
% 2.03/2.24 % ------ QBF
% 2.03/2.24
% 2.03/2.24 % qbf_q_res: 0
% 2.03/2.24 % qbf_num_tautologies: 0
% 2.03/2.24 % qbf_prep_cycles: 0
% 2.03/2.24
% 2.03/2.24 % ------ BMC1
% 2.03/2.24
% 2.03/2.24 % bmc1_current_bound: -1
% 2.03/2.24 % bmc1_last_solved_bound: -1
% 2.03/2.24 % bmc1_unsat_core_size: -1
% 2.03/2.24 % bmc1_unsat_core_parents_size: -1
% 2.03/2.24 % bmc1_merge_next_fun: 0
% 2.03/2.24 % bmc1_unsat_core_clauses_time: 0.
% 2.03/2.24
% 2.03/2.24 % ------ Instantiation
% 2.03/2.24
% 2.03/2.24 % inst_num_of_clauses: 26
% 2.03/2.24 % inst_num_in_passive: 0
% 2.03/2.24 % inst_num_in_active: 26
% 2.03/2.24 % inst_num_in_unprocessed: 0
% 2.03/2.24 % inst_num_of_loops: 28
% 2.03/2.24 % inst_num_of_learning_restarts: 0
% 2.03/2.24 % inst_num_moves_active_passive: 0
% 2.03/2.24 % inst_lit_activity: 5
% 2.03/2.24 % inst_lit_activity_moves: 0
% 2.03/2.24 % inst_num_tautologies: 0
% 2.03/2.24 % inst_num_prop_implied: 0
% 2.03/2.24 % inst_num_existing_simplified: 0
% 2.03/2.24 % inst_num_eq_res_simplified: 0
% 2.03/2.24 % inst_num_child_elim: 0
% 2.03/2.24 % inst_num_of_dismatching_blockings: 0
% 2.03/2.24 % inst_num_of_non_proper_insts: 0
% 2.03/2.24 % inst_num_of_duplicates: 0
% 2.03/2.24 % inst_inst_num_from_inst_to_res: 0
% 2.03/2.24 % inst_dismatching_checking_time: 0.
% 2.03/2.24
% 2.03/2.24 % ------ Resolution
% 2.03/2.24
% 2.03/2.24 % res_num_of_clauses: 821
% 2.03/2.24 % res_num_in_passive: 314
% 2.03/2.24 % res_num_in_active: 496
% 2.03/2.24 % res_num_of_loops: 1000
% 2.03/2.24 % res_forward_subset_subsumed: 9
% 2.03/2.24 % res_backward_subset_subsumed: 0
% 2.03/2.24 % res_forward_subsumed: 515
% 2.03/2.24 % res_backward_subsumed: 0
% 2.03/2.24 % res_forward_subsumption_resolution: 3
% 2.03/2.24 % res_backward_subsumption_resolution: 0
% 2.03/2.24 % res_clause_to_clause_subsumption: 18036
% 2.03/2.24 % res_orphan_elimination: 0
% 2.03/2.24 % res_tautology_del: 0
% 2.03/2.24 % res_num_eq_res_simplified: 0
% 2.03/2.24 % res_num_sel_changes: 0
% 2.03/2.24 % res_moves_from_active_to_pass: 0
% 2.03/2.24
% 2.03/2.24 % Status Unknown
% 2.03/2.29 % Orienting using strategy ClausalAll
% 2.03/2.29 % Orientation found
% 2.03/2.29 % 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/sandbox2/tmp/iprover_proof_3c5a55.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_2bcc38 | grep -v "SZS"
% 2.03/2.30
% 2.03/2.30 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 2.03/2.30
% 2.03/2.30 %
% 2.03/2.30 % ------ iProver source info
% 2.03/2.30
% 2.03/2.30 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 2.03/2.30 % git: non_committed_changes: true
% 2.03/2.30 % git: last_make_outside_of_git: true
% 2.03/2.30
% 2.03/2.30 %
% 2.03/2.30 % ------ Input Options
% 2.03/2.30
% 2.03/2.30 % --out_options all
% 2.03/2.30 % --tptp_safe_out true
% 2.03/2.30 % --problem_path ""
% 2.03/2.30 % --include_path ""
% 2.03/2.30 % --clausifier .//eprover
% 2.03/2.30 % --clausifier_options --tstp-format
% 2.03/2.30 % --stdin false
% 2.03/2.30 % --dbg_backtrace false
% 2.03/2.30 % --dbg_dump_prop_clauses false
% 2.03/2.30 % --dbg_dump_prop_clauses_file -
% 2.03/2.30 % --dbg_out_stat false
% 2.03/2.30
% 2.03/2.30 % ------ General Options
% 2.03/2.30
% 2.03/2.30 % --fof false
% 2.03/2.30 % --time_out_real 150.
% 2.03/2.30 % --time_out_prep_mult 0.2
% 2.03/2.30 % --time_out_virtual -1.
% 2.03/2.30 % --schedule none
% 2.03/2.30 % --ground_splitting input
% 2.03/2.30 % --splitting_nvd 16
% 2.03/2.30 % --non_eq_to_eq false
% 2.03/2.30 % --prep_gs_sim true
% 2.03/2.30 % --prep_unflatten false
% 2.03/2.30 % --prep_res_sim true
% 2.03/2.30 % --prep_upred true
% 2.03/2.30 % --res_sim_input true
% 2.03/2.30 % --clause_weak_htbl true
% 2.03/2.30 % --gc_record_bc_elim false
% 2.03/2.30 % --symbol_type_check false
% 2.03/2.30 % --clausify_out false
% 2.03/2.30 % --large_theory_mode false
% 2.03/2.30 % --prep_sem_filter none
% 2.03/2.30 % --prep_sem_filter_out false
% 2.03/2.30 % --preprocessed_out false
% 2.03/2.30 % --sub_typing false
% 2.03/2.30 % --brand_transform false
% 2.03/2.30 % --pure_diseq_elim true
% 2.03/2.30 % --min_unsat_core false
% 2.03/2.30 % --pred_elim true
% 2.03/2.30 % --add_important_lit false
% 2.03/2.30 % --soft_assumptions false
% 2.03/2.30 % --reset_solvers false
% 2.03/2.30 % --bc_imp_inh []
% 2.03/2.30 % --conj_cone_tolerance 1.5
% 2.03/2.30 % --prolific_symb_bound 500
% 2.03/2.30 % --lt_threshold 2000
% 2.03/2.30
% 2.03/2.30 % ------ SAT Options
% 2.03/2.30
% 2.03/2.30 % --sat_mode false
% 2.03/2.30 % --sat_fm_restart_options ""
% 2.03/2.30 % --sat_gr_def false
% 2.03/2.30 % --sat_epr_types true
% 2.03/2.30 % --sat_non_cyclic_types false
% 2.03/2.30 % --sat_finite_models false
% 2.03/2.30 % --sat_fm_lemmas false
% 2.03/2.30 % --sat_fm_prep false
% 2.03/2.30 % --sat_fm_uc_incr true
% 2.03/2.30 % --sat_out_model small
% 2.03/2.30 % --sat_out_clauses false
% 2.03/2.30
% 2.03/2.30 % ------ QBF Options
% 2.03/2.30
% 2.03/2.30 % --qbf_mode false
% 2.03/2.30 % --qbf_elim_univ true
% 2.03/2.30 % --qbf_sk_in true
% 2.03/2.30 % --qbf_pred_elim true
% 2.03/2.30 % --qbf_split 32
% 2.03/2.30
% 2.03/2.30 % ------ BMC1 Options
% 2.03/2.30
% 2.03/2.30 % --bmc1_incremental false
% 2.03/2.30 % --bmc1_axioms reachable_all
% 2.03/2.30 % --bmc1_min_bound 0
% 2.03/2.30 % --bmc1_max_bound -1
% 2.03/2.30 % --bmc1_max_bound_default -1
% 2.03/2.30 % --bmc1_symbol_reachability true
% 2.03/2.30 % --bmc1_property_lemmas false
% 2.03/2.30 % --bmc1_k_induction false
% 2.03/2.30 % --bmc1_non_equiv_states false
% 2.03/2.30 % --bmc1_deadlock false
% 2.03/2.30 % --bmc1_ucm false
% 2.03/2.30 % --bmc1_add_unsat_core none
% 2.03/2.30 % --bmc1_unsat_core_children false
% 2.03/2.30 % --bmc1_unsat_core_extrapolate_axioms false
% 2.03/2.30 % --bmc1_out_stat full
% 2.03/2.30 % --bmc1_ground_init false
% 2.03/2.30 % --bmc1_pre_inst_next_state false
% 2.03/2.30 % --bmc1_pre_inst_state false
% 2.03/2.30 % --bmc1_pre_inst_reach_state false
% 2.03/2.30 % --bmc1_out_unsat_core false
% 2.03/2.30 % --bmc1_aig_witness_out false
% 2.03/2.30 % --bmc1_verbose false
% 2.03/2.30 % --bmc1_dump_clauses_tptp false
% 2.14/2.46 % --bmc1_dump_unsat_core_tptp false
% 2.14/2.46 % --bmc1_dump_file -
% 2.14/2.46 % --bmc1_ucm_expand_uc_limit 128
% 2.14/2.46 % --bmc1_ucm_n_expand_iterations 6
% 2.14/2.46 % --bmc1_ucm_extend_mode 1
% 2.14/2.46 % --bmc1_ucm_init_mode 2
% 2.14/2.46 % --bmc1_ucm_cone_mode none
% 2.14/2.46 % --bmc1_ucm_reduced_relation_type 0
% 2.14/2.46 % --bmc1_ucm_relax_model 4
% 2.14/2.46 % --bmc1_ucm_full_tr_after_sat true
% 2.14/2.46 % --bmc1_ucm_expand_neg_assumptions false
% 2.14/2.46 % --bmc1_ucm_layered_model none
% 2.14/2.46 % --bmc1_ucm_max_lemma_size 10
% 2.14/2.46
% 2.14/2.46 % ------ AIG Options
% 2.14/2.46
% 2.14/2.46 % --aig_mode false
% 2.14/2.46
% 2.14/2.46 % ------ Instantiation Options
% 2.14/2.46
% 2.14/2.46 % --instantiation_flag true
% 2.14/2.46 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.14/2.46 % --inst_solver_per_active 750
% 2.14/2.46 % --inst_solver_calls_frac 0.5
% 2.14/2.46 % --inst_passive_queue_type priority_queues
% 2.14/2.46 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.14/2.46 % --inst_passive_queues_freq [25;2]
% 2.14/2.46 % --inst_dismatching true
% 2.14/2.46 % --inst_eager_unprocessed_to_passive true
% 2.14/2.46 % --inst_prop_sim_given true
% 2.14/2.46 % --inst_prop_sim_new false
% 2.14/2.46 % --inst_orphan_elimination true
% 2.14/2.46 % --inst_learning_loop_flag true
% 2.14/2.46 % --inst_learning_start 3000
% 2.14/2.46 % --inst_learning_factor 2
% 2.14/2.46 % --inst_start_prop_sim_after_learn 3
% 2.14/2.46 % --inst_sel_renew solver
% 2.14/2.46 % --inst_lit_activity_flag true
% 2.14/2.46 % --inst_out_proof true
% 2.14/2.46
% 2.14/2.46 % ------ Resolution Options
% 2.14/2.46
% 2.14/2.46 % --resolution_flag true
% 2.14/2.46 % --res_lit_sel kbo_max
% 2.14/2.46 % --res_to_prop_solver none
% 2.14/2.46 % --res_prop_simpl_new false
% 2.14/2.46 % --res_prop_simpl_given false
% 2.14/2.46 % --res_passive_queue_type priority_queues
% 2.14/2.46 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.14/2.46 % --res_passive_queues_freq [15;5]
% 2.14/2.46 % --res_forward_subs full
% 2.14/2.46 % --res_backward_subs full
% 2.14/2.46 % --res_forward_subs_resolution true
% 2.14/2.46 % --res_backward_subs_resolution true
% 2.14/2.46 % --res_orphan_elimination false
% 2.14/2.46 % --res_time_limit 1000.
% 2.14/2.46 % --res_out_proof true
% 2.14/2.46 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_3c5a55.s
% 2.14/2.46 % --modulo true
% 2.14/2.46
% 2.14/2.46 % ------ Combination Options
% 2.14/2.46
% 2.14/2.46 % --comb_res_mult 1000
% 2.14/2.46 % --comb_inst_mult 300
% 2.14/2.46 % ------
% 2.14/2.46
% 2.14/2.46 % ------ Parsing...% successful
% 2.14/2.46
% 2.14/2.46 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 2.14/2.46
% 2.14/2.46 % ------ Proving...
% 2.14/2.46 % ------ Problem Properties
% 2.14/2.46
% 2.14/2.46 %
% 2.14/2.46 % EPR false
% 2.14/2.46 % Horn false
% 2.14/2.46 % Has equality true
% 2.14/2.46
% 2.14/2.46 % % ------ Input Options Time Limit: Unbounded
% 2.14/2.46
% 2.14/2.46
% 2.14/2.46 Compiling...
% 2.14/2.46 Loading plugin: done.
% 2.14/2.46 % % ------ Current options:
% 2.14/2.46
% 2.14/2.46 % ------ Input Options
% 2.14/2.46
% 2.14/2.46 % --out_options all
% 2.14/2.46 % --tptp_safe_out true
% 2.14/2.46 % --problem_path ""
% 2.14/2.46 % --include_path ""
% 2.14/2.46 % --clausifier .//eprover
% 2.14/2.46 % --clausifier_options --tstp-format
% 2.14/2.46 % --stdin false
% 2.14/2.46 % --dbg_backtrace false
% 2.14/2.46 % --dbg_dump_prop_clauses false
% 2.14/2.46 % --dbg_dump_prop_clauses_file -
% 2.14/2.46 % --dbg_out_stat false
% 2.14/2.46
% 2.14/2.46 % ------ General Options
% 2.14/2.46
% 2.14/2.46 % --fof false
% 2.14/2.46 % --time_out_real 150.
% 2.14/2.46 % --time_out_prep_mult 0.2
% 2.14/2.46 % --time_out_virtual -1.
% 2.14/2.46 % --schedule none
% 2.14/2.46 % --ground_splitting input
% 2.14/2.46 % --splitting_nvd 16
% 2.14/2.46 % --non_eq_to_eq false
% 2.14/2.46 % --prep_gs_sim true
% 2.14/2.46 % --prep_unflatten false
% 2.14/2.46 % --prep_res_sim true
% 2.14/2.46 % --prep_upred true
% 2.14/2.46 % --res_sim_input true
% 2.14/2.46 % --clause_weak_htbl true
% 2.14/2.46 % --gc_record_bc_elim false
% 2.14/2.46 % --symbol_type_check false
% 2.14/2.46 % --clausify_out false
% 2.14/2.46 % --large_theory_mode false
% 2.14/2.46 % --prep_sem_filter none
% 2.14/2.46 % --prep_sem_filter_out false
% 2.14/2.46 % --preprocessed_out false
% 2.14/2.46 % --sub_typing false
% 2.14/2.46 % --brand_transform false
% 2.14/2.46 % --pure_diseq_elim true
% 2.14/2.46 % --min_unsat_core false
% 2.14/2.46 % --pred_elim true
% 2.14/2.46 % --add_important_lit false
% 2.14/2.46 % --soft_assumptions false
% 2.14/2.46 % --reset_solvers false
% 2.14/2.46 % --bc_imp_inh []
% 2.14/2.46 % --conj_cone_tolerance 1.5
% 2.14/2.46 % --prolific_symb_bound 500
% 2.14/2.46 % --lt_threshold 2000
% 2.14/2.46
% 2.14/2.46 % ------ SAT Options
% 2.14/2.46
% 2.14/2.46 % --sat_mode false
% 2.14/2.46 % --sat_fm_restart_options ""
% 2.14/2.46 % --sat_gr_def false
% 2.14/2.46 % --sat_epr_types true
% 2.14/2.46 % --sat_non_cyclic_types false
% 2.14/2.46 % --sat_finite_models false
% 2.14/2.46 % --sat_fm_lemmas false
% 2.14/2.46 % --sat_fm_prep false
% 2.14/2.46 % --sat_fm_uc_incr true
% 2.14/2.46 % --sat_out_model small
% 2.14/2.46 % --sat_out_clauses false
% 2.14/2.46
% 2.14/2.46 % ------ QBF Options
% 2.14/2.46
% 2.14/2.46 % --qbf_mode false
% 2.14/2.46 % --qbf_elim_univ true
% 2.14/2.46 % --qbf_sk_in true
% 2.14/2.46 % --qbf_pred_elim true
% 2.14/2.46 % --qbf_split 32
% 2.14/2.46
% 2.14/2.46 % ------ BMC1 Options
% 2.14/2.46
% 2.14/2.46 % --bmc1_incremental false
% 2.14/2.46 % --bmc1_axioms reachable_all
% 2.14/2.46 % --bmc1_min_bound 0
% 2.14/2.46 % --bmc1_max_bound -1
% 2.14/2.46 % --bmc1_max_bound_default -1
% 2.14/2.46 % --bmc1_symbol_reachability true
% 2.14/2.46 % --bmc1_property_lemmas false
% 2.14/2.46 % --bmc1_k_induction false
% 2.14/2.46 % --bmc1_non_equiv_states false
% 2.14/2.46 % --bmc1_deadlock false
% 2.14/2.46 % --bmc1_ucm false
% 2.14/2.46 % --bmc1_add_unsat_core none
% 2.14/2.46 % --bmc1_unsat_core_children false
% 2.14/2.46 % --bmc1_unsat_core_extrapolate_axioms false
% 2.14/2.46 % --bmc1_out_stat full
% 2.14/2.46 % --bmc1_ground_init false
% 2.14/2.46 % --bmc1_pre_inst_next_state false
% 2.14/2.46 % --bmc1_pre_inst_state false
% 2.14/2.46 % --bmc1_pre_inst_reach_state false
% 2.14/2.46 % --bmc1_out_unsat_core false
% 2.14/2.46 % --bmc1_aig_witness_out false
% 2.14/2.46 % --bmc1_verbose false
% 2.14/2.46 % --bmc1_dump_clauses_tptp false
% 2.14/2.46 % --bmc1_dump_unsat_core_tptp false
% 2.14/2.46 % --bmc1_dump_file -
% 2.14/2.46 % --bmc1_ucm_expand_uc_limit 128
% 2.14/2.46 % --bmc1_ucm_n_expand_iterations 6
% 2.14/2.46 % --bmc1_ucm_extend_mode 1
% 2.14/2.46 % --bmc1_ucm_init_mode 2
% 2.14/2.46 % --bmc1_ucm_cone_mode none
% 2.14/2.46 % --bmc1_ucm_reduced_relation_type 0
% 2.14/2.46 % --bmc1_ucm_relax_model 4
% 2.14/2.46 % --bmc1_ucm_full_tr_after_sat true
% 2.14/2.46 % --bmc1_ucm_expand_neg_assumptions false
% 2.14/2.46 % --bmc1_ucm_layered_model none
% 2.14/2.46 % --bmc1_ucm_max_lemma_size 10
% 2.14/2.46
% 2.14/2.46 % ------ AIG Options
% 2.14/2.46
% 2.14/2.46 % --aig_mode false
% 2.14/2.46
% 2.14/2.46 % ------ Instantiation Options
% 2.14/2.46
% 2.14/2.46 % --instantiation_flag true
% 2.14/2.46 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.14/2.46 % --inst_solver_per_active 750
% 2.14/2.46 % --inst_solver_calls_frac 0.5
% 2.14/2.46 % --inst_passive_queue_type priority_queues
% 2.14/2.46 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.14/2.46 % --inst_passive_queues_freq [25;2]
% 2.14/2.46 % --inst_dismatching true
% 2.14/2.46 % --inst_eager_unprocessed_to_passive true
% 2.14/2.46 % --inst_prop_sim_given true
% 2.14/2.46 % --inst_prop_sim_new false
% 2.14/2.46 % --inst_orphan_elimination true
% 2.14/2.46 % --inst_learning_loop_flag true
% 2.14/2.46 % --inst_learning_start 3000
% 2.14/2.46 % --inst_learning_factor 2
% 2.14/2.46 % --inst_start_prop_sim_after_learn 3
% 2.14/2.46 % --inst_sel_renew solver
% 2.14/2.46 % --inst_lit_activity_flag true
% 2.14/2.46 % --inst_out_proof true
% 2.14/2.46
% 2.14/2.46 % ------ Resolution Options
% 2.14/2.46
% 2.14/2.46 % --resolution_flag true
% 2.14/2.46 % --res_lit_sel kbo_max
% 2.14/2.46 % --res_to_prop_solver none
% 2.14/2.46 % --res_prop_simpl_new false
% 2.14/2.46 % --res_prop_simpl_given false
% 2.14/2.46 % --res_passive_queue_type priority_queues
% 2.14/2.46 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.14/2.46 % --res_passive_queues_freq [15;5]
% 2.14/2.46 % --res_forward_subs full
% 2.14/2.46 % --res_backward_subs full
% 2.14/2.46 % --res_forward_subs_resolution true
% 2.14/2.46 % --res_backward_subs_resolution true
% 2.14/2.46 % --res_orphan_elimination false
% 2.14/2.46 % --res_time_limit 1000.
% 2.14/2.46 % --res_out_proof true
% 2.14/2.46 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_3c5a55.s
% 2.14/2.46 % --modulo true
% 2.14/2.46
% 2.14/2.46 % ------ Combination Options
% 2.14/2.46
% 2.14/2.46 % --comb_res_mult 1000
% 2.14/2.46 % --comb_inst_mult 300
% 2.14/2.46 % ------
% 2.14/2.46
% 2.14/2.46
% 2.14/2.46
% 2.14/2.46 % ------ Proving...
% 2.14/2.46 % warning: shown sat in sat incomplete mode
% 2.14/2.46 %
% 2.14/2.46
% 2.14/2.46
% 2.14/2.46
% 2.14/2.46
% 2.14/2.46 cnf(c_24,plain,
% 2.14/2.46 ( x1 != nil ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_24) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_41,plain,( x1 != nil ),inference(copy,[status(esa)],[c_24]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_52,plain,( x1 != nil ),inference(copy,[status(esa)],[c_41]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_55,plain,( x1 != nil ),inference(copy,[status(esa)],[c_52]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_62,plain,( x1 != nil ),inference(copy,[status(esa)],[c_55]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_137,plain,( x1 != nil ),inference(copy,[status(esa)],[c_62]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_10,plain,
% 2.14/2.46 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X1 | X0 = X2 ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_48_0) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_109,plain,
% 2.14/2.46 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X1 | X0 = X2 ),
% 2.14/2.46 inference(copy,[status(esa)],[c_10]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_153,plain,
% 2.14/2.46 ( ~ heap(sep(lseg(x1,X0),sep(lseg(x1,nil),X1))) | x1 = X0 ),
% 2.14/2.46 inference(resolution,[status(thm)],[c_137,c_109]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_154,plain,
% 2.14/2.46 ( ~ heap(sep(lseg(x1,X0),sep(lseg(x1,nil),X1))) | x1 = X0 ),
% 2.14/2.46 inference(rewriting,[status(thm)],[c_153]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_23,plain,
% 2.14/2.46 ( x2 != x1 ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_23) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_39,plain,( x2 != x1 ),inference(copy,[status(esa)],[c_23]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_51,plain,( x2 != x1 ),inference(copy,[status(esa)],[c_39]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_56,plain,( x2 != x1 ),inference(copy,[status(esa)],[c_51]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_61,plain,( x2 != x1 ),inference(copy,[status(esa)],[c_56]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_135,plain,( x2 != x1 ),inference(copy,[status(esa)],[c_61]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_149,plain,
% 2.14/2.46 ( ~ heap(sep(lseg(x2,X0),sep(lseg(x2,x1),X1))) | x2 = X0 ),
% 2.14/2.46 inference(resolution,[status(thm)],[c_135,c_109]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_150,plain,
% 2.14/2.46 ( ~ heap(sep(lseg(x2,X0),sep(lseg(x2,x1),X1))) | x2 = X0 ),
% 2.14/2.46 inference(rewriting,[status(thm)],[c_149]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_22,plain,
% 2.14/2.46 ( x3 != x1 ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_22) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_37,plain,( x3 != x1 ),inference(copy,[status(esa)],[c_22]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_50,plain,( x3 != x1 ),inference(copy,[status(esa)],[c_37]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_57,plain,( x3 != x1 ),inference(copy,[status(esa)],[c_50]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_60,plain,( x3 != x1 ),inference(copy,[status(esa)],[c_57]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_133,plain,( x3 != x1 ),inference(copy,[status(esa)],[c_60]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_145,plain,
% 2.14/2.46 ( ~ heap(sep(lseg(x3,X0),sep(lseg(x3,x1),X1))) | x3 = X0 ),
% 2.14/2.46 inference(resolution,[status(thm)],[c_133,c_109]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_146,plain,
% 2.14/2.46 ( ~ heap(sep(lseg(x3,X0),sep(lseg(x3,x1),X1))) | x3 = X0 ),
% 2.14/2.46 inference(rewriting,[status(thm)],[c_145]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_13,plain,
% 2.14/2.46 ( heap(sep(lseg(X0,X1),X2))
% 2.14/2.46 | X0 = X3
% 2.14/2.46 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))) ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_46_2) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_115,plain,
% 2.14/2.46 ( heap(sep(lseg(X0,X1),X2))
% 2.14/2.46 | X0 = X3
% 2.14/2.46 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2))) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_13]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_116,plain,
% 2.14/2.46 ( heap(sep(lseg(X0,X1),X2))
% 2.14/2.46 | ~ heap(sep(next(X0,X3),sep(lseg(X3,X1),X2)))
% 2.14/2.46 | X0 = X3 ),
% 2.14/2.46 inference(rewriting,[status(thm)],[c_115]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_25,plain,
% 2.14/2.46 ( heap(sep(lseg(x2,x3),sep(next(x1,x2),emp))) ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_20) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_43,plain,
% 2.14/2.46 ( heap(sep(lseg(x2,x3),sep(next(x1,x2),emp))) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_25]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_53,plain,
% 2.14/2.46 ( heap(sep(lseg(x2,x3),sep(next(x1,x2),emp))) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_43]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_54,plain,
% 2.14/2.46 ( heap(sep(lseg(x2,x3),sep(next(x1,x2),emp))) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_53]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_63,plain,
% 2.14/2.46 ( heap(sep(lseg(x2,x3),sep(next(x1,x2),emp))) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_54]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_139,plain,
% 2.14/2.46 ( heap(sep(lseg(x2,x3),sep(next(x1,x2),emp))) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_63]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_21,negated_conjecture,
% 2.14/2.46 ( ~ heap(sep(lseg(x1,x3),emp)) ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_21) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_45,negated_conjecture,
% 2.14/2.46 ( ~ heap(sep(lseg(x1,x3),emp)) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_21]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_49,negated_conjecture,
% 2.14/2.46 ( ~ heap(sep(lseg(x1,x3),emp)) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_45]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_58,negated_conjecture,
% 2.14/2.46 ( ~ heap(sep(lseg(x1,x3),emp)) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_49]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_59,negated_conjecture,
% 2.14/2.46 ( ~ heap(sep(lseg(x1,x3),emp)) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_58]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_131,negated_conjecture,
% 2.14/2.46 ( ~ heap(sep(lseg(x1,x3),emp)) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_59]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_18,plain,
% 2.14/2.46 ( heap(sep(lseg(X0,X1),sep(lseg(X1,X2),X3)))
% 2.14/2.46 | X1 = X2
% 2.14/2.46 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(lseg(X1,X2),X3)))) ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_44_2) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_125,plain,
% 2.14/2.46 ( heap(sep(lseg(X0,X1),sep(lseg(X1,X2),X3)))
% 2.14/2.46 | X1 = X2
% 2.14/2.46 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(lseg(X1,X2),X3)))) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_18]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_126,plain,
% 2.14/2.46 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(lseg(X2,X3),X4))))
% 2.14/2.46 | heap(sep(lseg(X0,X2),sep(lseg(X2,X3),X4)))
% 2.14/2.46 | X2 = X3 ),
% 2.14/2.46 inference(rewriting,[status(thm)],[c_125]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_16,plain,
% 2.14/2.46 ( heap(sep(lseg(X0,X1),sep(next(X1,X2),X3)))
% 2.14/2.46 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(next(X1,X2),X3)))) ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_45_1) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_121,plain,
% 2.14/2.46 ( heap(sep(lseg(X0,X1),sep(next(X1,X2),X3)))
% 2.14/2.46 | ~ heap(sep(lseg(X0,X4),sep(lseg(X4,X1),sep(next(X1,X2),X3)))) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_16]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_122,plain,
% 2.14/2.46 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(next(X2,X3),X4))))
% 2.14/2.46 | heap(sep(lseg(X0,X2),sep(next(X2,X3),X4))) ),
% 2.14/2.46 inference(rewriting,[status(thm)],[c_121]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_11,plain,
% 2.14/2.46 ( heap(sep(lseg(X0,nil),X1))
% 2.14/2.46 | ~ heap(sep(lseg(X0,X2),sep(lseg(X2,nil),X1))) ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_47_1) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_111,plain,
% 2.14/2.46 ( heap(sep(lseg(X0,nil),X1))
% 2.14/2.46 | ~ heap(sep(lseg(X0,X2),sep(lseg(X2,nil),X1))) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_11]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_8,plain,
% 2.14/2.46 ( X0 = X1 | X0 = X2 | ~ heap(sep(lseg(X0,X2),sep(lseg(X0,X1),X3))) ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_48_2) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_105,plain,
% 2.14/2.46 ( X0 = X1 | X0 = X2 | ~ heap(sep(lseg(X0,X2),sep(lseg(X0,X1),X3))) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_8]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_106,plain,
% 2.14/2.46 ( ~ heap(sep(lseg(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X2 | X0 = X1 ),
% 2.14/2.46 inference(rewriting,[status(thm)],[c_105]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_6,plain,
% 2.14/2.46 ( X0 = X1 | ~ heap(sep(next(X0,X2),sep(lseg(X0,X1),X3))) ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_49_1) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_101,plain,
% 2.14/2.46 ( X0 = X1 | ~ heap(sep(next(X0,X2),sep(lseg(X0,X1),X3))) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_6]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_102,plain,
% 2.14/2.46 ( ~ heap(sep(next(X0,X1),sep(lseg(X0,X2),X3))) | X0 = X2 ),
% 2.14/2.46 inference(rewriting,[status(thm)],[c_101]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_4,plain,
% 2.14/2.46 ( X0 = nil | ~ heap(sep(lseg(nil,X0),X1)) ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_51_1) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_97,plain,
% 2.14/2.46 ( X0 = nil | ~ heap(sep(lseg(nil,X0),X1)) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_4]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_98,plain,
% 2.14/2.46 ( ~ heap(sep(lseg(nil,X0),X1)) | X0 = nil ),
% 2.14/2.46 inference(rewriting,[status(thm)],[c_97]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_3,plain,
% 2.14/2.46 ( ~ heap(sep(next(X0,X1),sep(next(X0,X2),X3))) ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_50_0) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_95,plain,
% 2.14/2.46 ( ~ heap(sep(next(X0,X1),sep(next(X0,X2),X3))) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_3]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_2,plain,
% 2.14/2.46 ( ~ heap(sep(next(nil,X0),X1)) ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_52_0) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_93,plain,
% 2.14/2.46 ( ~ heap(sep(next(nil,X0),X1)) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_2]) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_1,plain,
% 2.14/2.46 ( sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)) ),
% 2.14/2.46 file('/export/starexec/sandbox2/tmp/iprover_modulo_c6f966.p', c_0_53_0) ).
% 2.14/2.46
% 2.14/2.46 cnf(c_91,plain,
% 2.14/2.46 ( sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)) ),
% 2.14/2.46 inference(copy,[status(esa)],[c_1]) ).
% 2.14/2.46
% 2.14/2.46
% 2.14/2.46
% 2.14/2.46 % ------ Statistics
% 2.14/2.46
% 2.14/2.46 % ------ General
% 2.14/2.46
% 2.14/2.46 % num_of_input_clauses: 26
% 2.14/2.46 % num_of_input_neg_conjectures: 1
% 2.14/2.46 % num_of_splits: 0
% 2.14/2.46 % num_of_split_atoms: 0
% 2.14/2.46 % num_of_sem_filtered_clauses: 0
% 2.14/2.46 % num_of_subtypes: 0
% 2.14/2.46 % monotx_restored_types: 0
% 2.14/2.46 % sat_num_of_epr_types: 0
% 2.14/2.46 % sat_num_of_non_cyclic_types: 0
% 2.14/2.46 % sat_guarded_non_collapsed_types: 0
% 2.14/2.46 % is_epr: 0
% 2.14/2.46 % is_horn: 0
% 2.14/2.46 % has_eq: 1
% 2.14/2.46 % num_pure_diseq_elim: 0
% 2.14/2.46 % simp_replaced_by: 0
% 2.14/2.46 % res_preprocessed: 6
% 2.14/2.46 % prep_upred: 0
% 2.14/2.46 % prep_unflattend: 0
% 2.14/2.46 % pred_elim_cands: 0
% 2.14/2.46 % pred_elim: 0
% 2.14/2.46 % pred_elim_cl: 0
% 2.14/2.46 % pred_elim_cycles: 0
% 2.14/2.46 % forced_gc_time: 0
% 2.14/2.46 % gc_basic_clause_elim: 0
% 2.14/2.46 % parsing_time: 0.
% 2.14/2.46 % sem_filter_time: 0.
% 2.14/2.46 % pred_elim_time: 0.
% 2.14/2.46 % out_proof_time: 0.
% 2.14/2.46 % monotx_time: 0.
% 2.14/2.46 % subtype_inf_time: 0.
% 2.14/2.46 % unif_index_cands_time: 0.
% 2.14/2.46 % unif_index_add_time: 0.
% 2.14/2.46 % total_time: 0.166
% 2.14/2.46 % num_of_symbols: 34
% 2.14/2.46 % num_of_terms: 193
% 2.14/2.46
% 2.14/2.46 % ------ Propositional Solver
% 2.14/2.46
% 2.14/2.46 % prop_solver_calls: 1
% 2.14/2.46 % prop_fast_solver_calls: 11
% 2.14/2.46 % prop_num_of_clauses: 33
% 2.14/2.46 % prop_preprocess_simplified: 89
% 2.14/2.46 % prop_fo_subsumed: 0
% 2.14/2.46 % prop_solver_time: 0.
% 2.14/2.46 % prop_fast_solver_time: 0.
% 2.14/2.46 % prop_unsat_core_time: 0.
% 2.14/2.46
% 2.14/2.46 % ------ QBF
% 2.14/2.46
% 2.14/2.46 % qbf_q_res: 0
% 2.14/2.46 % qbf_num_tautologies: 0
% 2.14/2.46 % qbf_prep_cycles: 0
% 2.14/2.46
% 2.14/2.46 % ------ BMC1
% 2.14/2.46
% 2.14/2.46 % bmc1_current_bound: -1
% 2.14/2.46 % bmc1_last_solved_bound: -1
% 2.14/2.46 % bmc1_unsat_core_size: -1
% 2.14/2.46 % bmc1_unsat_core_parents_size: -1
% 2.14/2.46 % bmc1_merge_next_fun: 0
% 2.14/2.46 % bmc1_unsat_core_clauses_time: 0.
% 2.14/2.46
% 2.14/2.46 % ------ Instantiation
% 2.14/2.46
% 2.14/2.46 % inst_num_of_clauses: 26
% 2.14/2.46 % inst_num_in_passive: 0
% 2.14/2.46 % inst_num_in_active: 0
% 2.14/2.46 % inst_num_in_unprocessed: 26
% 2.14/2.46 % inst_num_of_loops: 0
% 2.14/2.46 % inst_num_of_learning_restarts: 0
% 2.14/2.46 % inst_num_moves_active_passive: 0
% 2.14/2.46 % inst_lit_activity: 0
% 2.14/2.46 % inst_lit_activity_moves: 0
% 2.14/2.46 % inst_num_tautologies: 0
% 2.14/2.46 % inst_num_prop_implied: 0
% 2.14/2.46 % inst_num_existing_simplified: 0
% 2.14/2.46 % inst_num_eq_res_simplified: 0
% 2.14/2.46 % inst_num_child_elim: 0
% 2.14/2.46 % inst_num_of_dismatching_blockings: 0
% 2.14/2.46 % inst_num_of_non_proper_insts: 0
% 2.14/2.46 % inst_num_of_duplicates: 0
% 2.14/2.46 % inst_inst_num_from_inst_to_res: 0
% 2.14/2.46 % inst_dismatching_checking_time: 0.
% 2.14/2.46
% 2.14/2.46 % ------ Resolution
% 2.14/2.46
% 2.14/2.46 % res_num_of_clauses: 30
% 2.14/2.46 % res_num_in_passive: 0
% 2.14/2.46 % res_num_in_active: 19
% 2.14/2.46 % res_num_of_loops: 9
% 2.14/2.46 % res_forward_subset_subsumed: 9
% 2.14/2.46 % res_backward_subset_subsumed: 0
% 2.14/2.46 % res_forward_subsumed: 0
% 2.14/2.46 % res_backward_subsumed: 0
% 2.14/2.46 % res_forward_subsumption_resolution: 0
% 2.14/2.46 % res_backward_subsumption_resolution: 0
% 2.14/2.46 % res_clause_to_clause_subsumption: 0
% 2.14/2.46 % res_orphan_elimination: 0
% 2.14/2.46 % res_tautology_del: 0
% 2.14/2.46 % res_num_eq_res_simplified: 0
% 2.14/2.46 % res_num_sel_changes: 0
% 2.14/2.46 % res_moves_from_active_to_pass: 0
% 2.14/2.46
% 2.14/2.46 % Status Unknown
% 2.14/2.46 % Last status :
% 2.14/2.46 % SZS status Unknown
%------------------------------------------------------------------------------