TSTP Solution File: SWV365+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWV365+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n020.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 : Wed Jul 20 19:15:52 EDT 2022
% Result : Unknown 0.86s 1.11s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV365+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 13:17:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.21/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.42 % FOF problem with conjecture
% 0.21/0.42 % 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_ba4033.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_a893b0.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_7b5ce7 | grep -v "SZS"
% 0.21/0.44
% 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ iProver source info
% 0.21/0.44
% 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.44 % git: non_committed_changes: true
% 0.21/0.44 % git: last_make_outside_of_git: true
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.45 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.45 % --bmc1_dump_file -
% 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.45 % --bmc1_ucm_extend_mode 1
% 0.21/0.45 % --bmc1_ucm_init_mode 2
% 0.21/0.45 % --bmc1_ucm_cone_mode none
% 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.45 % --bmc1_ucm_relax_model 4
% 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.45 % --bmc1_ucm_layered_model none
% 0.21/0.45 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.45
% 0.21/0.45 % ------ AIG Options
% 0.21/0.45
% 0.21/0.45 % --aig_mode false
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation Options
% 0.21/0.45
% 0.21/0.45 % --instantiation_flag true
% 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.45 % --inst_solver_per_active 750
% 0.21/0.45 % --inst_solver_calls_frac 0.5
% 0.21/0.45 % --inst_passive_queue_type priority_queues
% 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.45 % --inst_passive_queues_freq [25;2]
% 0.21/0.45 % --inst_dismatching true
% 0.21/0.45 % --inst_eager_unprocessed_to_passive true
% 0.21/0.45 % --inst_prop_sim_given true
% 0.21/0.45 % --inst_prop_sim_new false
% 0.21/0.45 % --inst_orphan_elimination true
% 0.21/0.45 % --inst_learning_loop_flag true
% 0.21/0.45 % --inst_learning_start 3000
% 0.21/0.45 % --inst_learning_factor 2
% 0.21/0.45 % --inst_start_prop_sim_after_learn 3
% 0.21/0.45 % --inst_sel_renew solver
% 0.21/0.45 % --inst_lit_activity_flag true
% 0.21/0.45 % --inst_out_proof true
% 0.21/0.45
% 0.21/0.45 % ------ Resolution Options
% 0.21/0.45
% 0.21/0.45 % --resolution_flag true
% 0.21/0.45 % --res_lit_sel kbo_max
% 0.21/0.45 % --res_to_prop_solver none
% 0.21/0.45 % --res_prop_simpl_new false
% 0.21/0.45 % --res_prop_simpl_given false
% 0.21/0.45 % --res_passive_queue_type priority_queues
% 0.21/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.45 % --res_passive_queues_freq [15;5]
% 0.21/0.45 % --res_forward_subs full
% 0.21/0.45 % --res_backward_subs full
% 0.21/0.45 % --res_forward_subs_resolution true
% 0.21/0.45 % --res_backward_subs_resolution true
% 0.21/0.45 % --res_orphan_elimination false
% 0.21/0.45 % --res_time_limit 1000.
% 0.21/0.45 % --res_out_proof true
% 0.21/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ba4033.s
% 0.21/0.45 % --modulo true
% 0.21/0.45
% 0.21/0.45 % ------ Combination Options
% 0.21/0.45
% 0.21/0.45 % --comb_res_mult 1000
% 0.21/0.45 % --comb_inst_mult 300
% 0.21/0.45 % ------
% 0.21/0.45
% 0.21/0.45 % ------ Parsing...%
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 % ------ Statistics
% 0.21/0.45
% 0.21/0.45 % ------ General
% 0.21/0.45
% 0.21/0.45 % num_of_input_clauses: 66
% 0.21/0.45 % num_of_input_neg_conjectures: 0
% 0.21/0.45 % num_of_splits: 0
% 0.21/0.45 % num_of_split_atoms: 0
% 0.21/0.45 % num_of_sem_filtered_clauses: 0
% 0.21/0.45 % num_of_subtypes: 0
% 0.21/0.45 % monotx_restored_types: 0
% 0.21/0.45 % sat_num_of_epr_types: 0
% 0.21/0.45 % sat_num_of_non_cyclic_types: 0
% 0.21/0.45 % sat_guarded_non_collapsed_types: 0
% 0.21/0.45 % is_epr: 0
% 0.21/0.45 % is_horn: 0
% 0.21/0.45 % has_eq: 0
% 0.21/0.45 % num_pure_diseq_elim: 0
% 0.21/0.45 % simp_replaced_by: 0
% 0.21/0.45 % res_preprocessed: 0
% 0.21/0.45 % prep_upred: 0
% 0.21/0.45 % prep_unflattend: 0
% 0.21/0.45 % pred_elim_cands: 0
% 0.21/0.45 % pred_elim: 0
% 0.21/0.45 % pred_elim_cl: 0
% 0.21/0.45 % pred_elim_cycles: 0
% 0.21/0.45 % forced_gc_time: 0
% 0.21/0.45 % gc_basic_clause_elim: 0
% 0.21/0.45 % parsing_time: 0.
% 0.21/0.45 % sem_filter_time: 0.
% 0.21/0.45 % pred_elim_time: 0.
% 0.21/0.45 % out_proof_time: 0.
% 0.21/0.45 % monotx_time: 0.
% 0.21/0.45 % subtype_inf_time: 0.
% 0.21/0.45 % unif_index_cands_time: 0.
% 0.21/0.45 % unFatal error: exception Failure("Parse error in: /export/starexec/sandbox/tmp/iprover_modulo_a893b0.p line: 69 near token: '!='")
% 0.21/0.45 if_index_add_time: 0.
% 0.21/0.45 % total_time: 0.02
% 0.21/0.45 % num_of_symbols: 72
% 0.21/0.45 % num_of_terms: 241
% 0.21/0.45
% 0.21/0.45 % ------ Propositional Solver
% 0.21/0.45
% 0.21/0.45 % prop_solver_calls: 0
% 0.21/0.45 % prop_fast_solver_calls: 0
% 0.21/0.45 % prop_num_of_clauses: 0
% 0.21/0.45 % prop_preprocess_simplified: 0
% 0.21/0.45 % prop_fo_subsumed: 0
% 0.21/0.45 % prop_solver_time: 0.
% 0.21/0.45 % prop_fast_solver_time: 0.
% 0.21/0.45 % prop_unsat_core_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ QBF
% 0.21/0.45
% 0.21/0.45 % qbf_q_res: 0
% 0.21/0.45 % qbf_num_tautologies: 0
% 0.21/0.45 % qbf_prep_cycles: 0
% 0.21/0.45
% 0.21/0.45 % ------ BMC1
% 0.21/0.45
% 0.21/0.45 % bmc1_current_bound: -1
% 0.21/0.45 % bmc1_last_solved_bound: -1
% 0.21/0.45 % bmc1_unsat_core_size: -1
% 0.21/0.45 % bmc1_unsat_core_parents_size: -1
% 0.21/0.45 % bmc1_merge_next_fun: 0
% 0.21/0.45 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ Instantiation
% 0.21/0.45
% 0.21/0.45 % inst_num_of_clauses: undef
% 0.21/0.45 % inst_num_in_passive: undef
% 0.21/0.45 % inst_num_in_active: 0
% 0.21/0.45 % inst_num_in_unprocessed: 0
% 0.21/0.45 % inst_num_of_loops: 0
% 0.21/0.45 % inst_num_of_learning_restarts: 0
% 0.21/0.45 % inst_num_moves_active_passive: 0
% 0.21/0.45 % inst_lit_activity: 0
% 0.21/0.45 % inst_lit_activity_moves: 0
% 0.21/0.45 % inst_num_tautologies: 0
% 0.21/0.45 % inst_num_prop_implied: 0
% 0.21/0.45 % inst_num_existing_simplified: 0
% 0.21/0.45 % inst_num_eq_res_simplified: 0
% 0.21/0.45 % inst_num_child_elim: 0
% 0.21/0.45 % inst_num_of_dismatching_blockings: 0
% 0.21/0.45 % inst_num_of_non_proper_insts: 0
% 0.21/0.45 % inst_num_of_duplicates: 0
% 0.21/0.45 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.45 % inst_dismatching_checking_time: 0.
% 0.21/0.45
% 0.21/0.45 % ------ Resolution
% 0.21/0.45
% 0.21/0.45 % res_num_of_clauses: undef
% 0.21/0.45 % res_num_in_passive: undef
% 0.21/0.45 % res_num_in_active: 0
% 0.21/0.45 % res_num_of_loops: 0
% 0.21/0.45 % res_forward_subset_subsumed: 0
% 0.21/0.45 % res_backward_subset_subsumed: 0
% 0.21/0.45 % res_forward_subsumed: 0
% 0.21/0.45 % res_backward_subsumed: 0
% 0.21/0.45 % res_forward_subsumption_resolution: 0
% 0.21/0.45 % res_backward_subsumption_resolution: 0
% 0.21/0.45 % res_clause_to_clause_subsumption: 0
% 0.21/0.45 % res_orphan_elimination: 0
% 0.21/0.45 % res_tautology_del: 0
% 0.21/0.45 % res_num_eq_res_simplified: 0
% 0.21/0.45 % res_num_sel_changes: 0
% 0.21/0.45 % res_moves_from_active_to_pass: 0
% 0.21/0.45
% 0.21/0.45 % Status Unknown
% 0.21/0.50 % Orienting using strategy ClausalAll
% 0.21/0.50 % FOF problem with conjecture
% 0.21/0.50 % 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_ba4033.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_a893b0.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_48fa78 | grep -v "SZS"
% 0.21/0.52
% 0.21/0.52 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.52
% 0.21/0.52 %
% 0.21/0.52 % ------ iProver source info
% 0.21/0.52
% 0.21/0.52 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.52 % git: non_committed_changes: true
% 0.21/0.52 % git: last_make_outside_of_git: true
% 0.21/0.52
% 0.21/0.52 %
% 0.21/0.52 % ------ Input Options
% 0.21/0.52
% 0.21/0.52 % --out_options all
% 0.21/0.52 % --tptp_safe_out true
% 0.21/0.52 % --problem_path ""
% 0.21/0.52 % --include_path ""
% 0.21/0.52 % --clausifier .//eprover
% 0.21/0.52 % --clausifier_options --tstp-format
% 0.21/0.52 % --stdin false
% 0.21/0.52 % --dbg_backtrace false
% 0.21/0.52 % --dbg_dump_prop_clauses false
% 0.21/0.52 % --dbg_dump_prop_clauses_file -
% 0.21/0.52 % --dbg_out_stat false
% 0.21/0.52
% 0.21/0.52 % ------ General Options
% 0.21/0.52
% 0.21/0.52 % --fof false
% 0.21/0.52 % --time_out_real 150.
% 0.21/0.52 % --time_out_prep_mult 0.2
% 0.21/0.52 % --time_out_virtual -1.
% 0.21/0.52 % --schedule none
% 0.21/0.52 % --ground_splitting input
% 0.21/0.52 % --splitting_nvd 16
% 0.21/0.52 % --non_eq_to_eq false
% 0.21/0.52 % --prep_gs_sim true
% 0.21/0.52 % --prep_unflatten false
% 0.21/0.52 % --prep_res_sim true
% 0.21/0.52 % --prep_upred true
% 0.21/0.52 % --res_sim_input true
% 0.21/0.52 % --clause_weak_htbl true
% 0.21/0.52 % --gc_record_bc_elim false
% 0.21/0.52 % --symbol_type_check false
% 0.21/0.52 % --clausify_out false
% 0.21/0.52 % --large_theory_mode false
% 0.21/0.52 % --prep_sem_filter none
% 0.21/0.52 % --prep_sem_filter_out false
% 0.21/0.52 % --preprocessed_out false
% 0.21/0.52 % --sub_typing false
% 0.21/0.52 % --brand_transform false
% 0.21/0.52 % --pure_diseq_elim true
% 0.21/0.52 % --min_unsat_core false
% 0.21/0.52 % --pred_elim true
% 0.21/0.52 % --add_important_lit false
% 0.21/0.52 % --soft_assumptions false
% 0.21/0.52 % --reset_solvers false
% 0.21/0.52 % --bc_imp_inh []
% 0.21/0.52 % --conj_cone_tolerance 1.5
% 0.21/0.52 % --prolific_symb_bound 500
% 0.21/0.52 % --lt_threshold 2000
% 0.21/0.52
% 0.21/0.52 % ------ SAT Options
% 0.21/0.52
% 0.21/0.52 % --sat_mode false
% 0.21/0.52 % --sat_fm_restart_options ""
% 0.21/0.52 % --sat_gr_def false
% 0.21/0.52 % --sat_epr_types true
% 0.21/0.52 % --sat_non_cyclic_types false
% 0.21/0.52 % --sat_finite_models false
% 0.21/0.52 % --sat_fm_lemmas false
% 0.21/0.52 % --sat_fm_prep false
% 0.21/0.52 % --sat_fm_uc_incr true
% 0.21/0.52 % --sat_out_model small
% 0.21/0.52 % --sat_out_clauses false
% 0.21/0.52
% 0.21/0.52 % ------ QBF Options
% 0.21/0.52
% 0.21/0.52 % --qbf_mode false
% 0.21/0.52 % --qbf_elim_univ true
% 0.21/0.52 % --qbf_sk_in true
% 0.21/0.52 % --qbf_pred_elim true
% 0.21/0.52 % --qbf_split 32
% 0.21/0.52
% 0.21/0.52 % ------ BMC1 Options
% 0.21/0.52
% 0.21/0.52 % --bmc1_incremental false
% 0.21/0.52 % --bmc1_axioms reachable_all
% 0.21/0.52 % --bmc1_min_bound 0
% 0.21/0.52 % --bmc1_max_bound -1
% 0.21/0.52 % --bmc1_max_bound_default -1
% 0.21/0.52 % --bmc1_symbol_reachability true
% 0.21/0.52 % --bmc1_property_lemmas false
% 0.21/0.52 % --bmc1_k_induction false
% 0.21/0.52 % --bmc1_non_equiv_states false
% 0.21/0.52 % --bmc1_deadlock false
% 0.21/0.52 % --bmc1_ucm false
% 0.21/0.52 % --bmc1_add_unsat_core none
% 0.21/0.52 % --bmc1_unsat_core_children false
% 0.21/0.52 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.52 % --bmc1_out_stat full
% 0.21/0.52 % --bmc1_ground_init false
% 0.21/0.52 % --bmc1_pre_inst_next_state false
% 0.21/0.52 % --bmc1_pre_inst_state false
% 0.21/0.52 % --bmc1_pre_inst_reach_state false
% 0.21/0.52 % --bmc1_out_unsat_core false
% 0.21/0.52 % --bmc1_aig_witness_out false
% 0.21/0.52 % --bmc1_verbose false
% 0.21/0.52 % --bmc1_dump_clauses_tptp false
% 0.86/1.10 % --bmc1_dump_unsat_core_tptp false
% 0.86/1.10 % --bmc1_dump_file -
% 0.86/1.10 % --bmc1_ucm_expand_uc_limit 128
% 0.86/1.10 % --bmc1_ucm_n_expand_iterations 6
% 0.86/1.10 % --bmc1_ucm_extend_mode 1
% 0.86/1.10 % --bmc1_ucm_init_mode 2
% 0.86/1.10 % --bmc1_ucm_cone_mode none
% 0.86/1.10 % --bmc1_ucm_reduced_relation_type 0
% 0.86/1.10 % --bmc1_ucm_relax_model 4
% 0.86/1.10 % --bmc1_ucm_full_tr_after_sat true
% 0.86/1.10 % --bmc1_ucm_expand_neg_assumptions false
% 0.86/1.10 % --bmc1_ucm_layered_model none
% 0.86/1.10 % --bmc1_ucm_max_lemma_size 10
% 0.86/1.10
% 0.86/1.10 % ------ AIG Options
% 0.86/1.10
% 0.86/1.10 % --aig_mode false
% 0.86/1.10
% 0.86/1.10 % ------ Instantiation Options
% 0.86/1.10
% 0.86/1.10 % --instantiation_flag true
% 0.86/1.10 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.86/1.10 % --inst_solver_per_active 750
% 0.86/1.10 % --inst_solver_calls_frac 0.5
% 0.86/1.10 % --inst_passive_queue_type priority_queues
% 0.86/1.10 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.86/1.10 % --inst_passive_queues_freq [25;2]
% 0.86/1.10 % --inst_dismatching true
% 0.86/1.10 % --inst_eager_unprocessed_to_passive true
% 0.86/1.10 % --inst_prop_sim_given true
% 0.86/1.10 % --inst_prop_sim_new false
% 0.86/1.10 % --inst_orphan_elimination true
% 0.86/1.10 % --inst_learning_loop_flag true
% 0.86/1.10 % --inst_learning_start 3000
% 0.86/1.10 % --inst_learning_factor 2
% 0.86/1.10 % --inst_start_prop_sim_after_learn 3
% 0.86/1.10 % --inst_sel_renew solver
% 0.86/1.10 % --inst_lit_activity_flag true
% 0.86/1.10 % --inst_out_proof true
% 0.86/1.10
% 0.86/1.10 % ------ Resolution Options
% 0.86/1.10
% 0.86/1.10 % --resolution_flag true
% 0.86/1.10 % --res_lit_sel kbo_max
% 0.86/1.10 % --res_to_prop_solver none
% 0.86/1.10 % --res_prop_simpl_new false
% 0.86/1.10 % --res_prop_simpl_given false
% 0.86/1.10 % --res_passive_queue_type priority_queues
% 0.86/1.10 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.86/1.10 % --res_passive_queues_freq [15;5]
% 0.86/1.10 % --res_forward_subs full
% 0.86/1.10 % --res_backward_subs full
% 0.86/1.10 % --res_forward_subs_resolution true
% 0.86/1.10 % --res_backward_subs_resolution true
% 0.86/1.10 % --res_orphan_elimination false
% 0.86/1.10 % --res_time_limit 1000.
% 0.86/1.10 % --res_out_proof true
% 0.86/1.10 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ba4033.s
% 0.86/1.10 % --modulo true
% 0.86/1.10
% 0.86/1.10 % ------ Combination Options
% 0.86/1.10
% 0.86/1.10 % --comb_res_mult 1000
% 0.86/1.10 % --comb_inst_mult 300
% 0.86/1.10 % ------
% 0.86/1.10
% 0.86/1.10 % ------ Parsing...% successful
% 0.86/1.10
% 0.86/1.10 % ------ 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.86/1.10
% 0.86/1.10 % ------ Proving...
% 0.86/1.10 % ------ Problem Properties
% 0.86/1.10
% 0.86/1.10 %
% 0.86/1.10 % EPR false
% 0.86/1.10 % Horn false
% 0.86/1.10 % Has equality true
% 0.86/1.10
% 0.86/1.10 % % ------ Input Options Time Limit: Unbounded
% 0.86/1.10
% 0.86/1.10
% 0.86/1.10 Compiling...
% 0.86/1.10 Loading plugin: done.
% 0.86/1.10 Compiling...
% 0.86/1.10 Loading plugin: done.
% 0.86/1.10 Compiling...
% 0.86/1.10 Loading plugin: done.
% 0.86/1.10 Compiling...
% 0.86/1.10 Loading plugin: done.
% 0.86/1.10 Compiling...
% 0.86/1.10 Loading plugin: done.
% 0.86/1.10 % % ------ Current options:
% 0.86/1.10
% 0.86/1.10 % ------ Input Options
% 0.86/1.10
% 0.86/1.10 % --out_options all
% 0.86/1.10 % --tptp_safe_out true
% 0.86/1.10 % --problem_path ""
% 0.86/1.10 % --include_path ""
% 0.86/1.10 % --clausifier .//eprover
% 0.86/1.10 % --clausifier_options --tstp-format
% 0.86/1.10 % --stdin false
% 0.86/1.10 % --dbg_backtrace false
% 0.86/1.10 % --dbg_dump_prop_clauses false
% 0.86/1.10 % --dbg_dump_prop_clauses_file -
% 0.86/1.10 % --dbg_out_stat false
% 0.86/1.10
% 0.86/1.10 % ------ General Options
% 0.86/1.10
% 0.86/1.10 % --fof false
% 0.86/1.10 % --time_out_real 150.
% 0.86/1.10 % --time_out_prep_mult 0.2
% 0.86/1.10 % --time_out_virtual -1.
% 0.86/1.10 % --schedule none
% 0.86/1.10 % --ground_splitting input
% 0.86/1.10 % --splitting_nvd 16
% 0.86/1.10 % --non_eq_to_eq false
% 0.86/1.10 % --prep_gs_sim true
% 0.86/1.10 % --prep_unflatten false
% 0.86/1.10 % --prep_res_sim true
% 0.86/1.10 % --prep_upred true
% 0.86/1.10 % --res_sim_input true
% 0.86/1.10 % --clause_weak_htbl true
% 0.86/1.10 % --gc_record_bc_elim false
% 0.86/1.10 % --symbol_type_check false
% 0.86/1.10 % --clausify_out false
% 0.86/1.10 % --large_theory_mode false
% 0.86/1.10 % --prep_sem_filter none
% 0.86/1.10 % --prep_sem_filter_out false
% 0.86/1.10 % --preprocessed_out false
% 0.86/1.10 % --sub_typing false
% 0.86/1.10 % --brand_transform false
% 0.86/1.10 % --pure_diseq_elim true
% 0.86/1.10 % --min_unsat_core false
% 0.86/1.10 % --pred_elim true
% 0.86/1.10 % --add_important_lit false
% 0.86/1.10 % --soft_assumptions false
% 0.86/1.10 % --reset_solvers false
% 0.86/1.10 % --bc_imp_inh []
% 0.86/1.10 % --conj_cone_tolerance 1.5
% 0.86/1.10 % --prolific_symb_bound 500
% 0.86/1.10 % --lt_threshold 2000
% 0.86/1.10
% 0.86/1.10 % ------ SAT Options
% 0.86/1.10
% 0.86/1.10 % --sat_mode false
% 0.86/1.10 % --sat_fm_restart_options ""
% 0.86/1.10 % --sat_gr_def false
% 0.86/1.10 % --sat_epr_types true
% 0.86/1.10 % --sat_non_cyclic_types false
% 0.86/1.10 % --sat_finite_models false
% 0.86/1.10 % --sat_fm_lemmas false
% 0.86/1.10 % --sat_fm_prep false
% 0.86/1.10 % --sat_fm_uc_incr true
% 0.86/1.10 % --sat_out_model small
% 0.86/1.10 % --sat_out_clauses false
% 0.86/1.10
% 0.86/1.10 % ------ QBF Options
% 0.86/1.10
% 0.86/1.10 % --qbf_mode false
% 0.86/1.10 % --qbf_elim_univ true
% 0.86/1.10 % --qbf_sk_in true
% 0.86/1.10 % --qbf_pred_elim true
% 0.86/1.10 % --qbf_split 32
% 0.86/1.10
% 0.86/1.10 % ------ BMC1 Options
% 0.86/1.10
% 0.86/1.10 % --bmc1_incremental false
% 0.86/1.10 % --bmc1_axioms reachable_all
% 0.86/1.10 % --bmc1_min_bound 0
% 0.86/1.10 % --bmc1_max_bound -1
% 0.86/1.10 % --bmc1_max_bound_default -1
% 0.86/1.10 % --bmc1_symbol_reachability true
% 0.86/1.10 % --bmc1_property_lemmas false
% 0.86/1.10 % --bmc1_k_induction false
% 0.86/1.10 % --bmc1_non_equiv_states false
% 0.86/1.10 % --bmc1_deadlock false
% 0.86/1.10 % --bmc1_ucm false
% 0.86/1.10 % --bmc1_add_unsat_core none
% 0.86/1.10 % --bmc1_unsat_core_children false
% 0.86/1.10 % --bmc1_unsat_core_extrapolate_axioms false
% 0.86/1.10 % --bmc1_out_stat full
% 0.86/1.10 % --bmc1_ground_init false
% 0.86/1.10 % --bmc1_pre_inst_next_state false
% 0.86/1.10 % --bmc1_pre_inst_state false
% 0.86/1.10 % --bmc1_pre_inst_reach_state false
% 0.86/1.10 % --bmc1_out_unsat_core false
% 0.86/1.10 % --bmc1_aig_witness_out false
% 0.86/1.10 % --bmc1_verbose false
% 0.86/1.10 % --bmc1_dump_clauses_tptp false
% 0.86/1.10 % --bmc1_dump_unsat_core_tptp false
% 0.86/1.10 % --bmc1_dump_file -
% 0.86/1.10 % --bmc1_ucm_expand_uc_limit 128
% 0.86/1.10 % --bmc1_ucm_n_expand_iterations 6
% 0.86/1.10 % --bmc1_ucm_extend_mode 1
% 0.86/1.10 % --bmc1_ucm_init_mode 2
% 0.86/1.10 % --bmc1_ucm_cone_mode none
% 0.86/1.10 % --bmc1_ucm_reduced_relation_type 0
% 0.86/1.10 % --bmc1_ucm_relax_model 4
% 0.86/1.10 % --bmc1_ucm_full_tr_after_sat true
% 0.86/1.10 % --bmc1_ucm_expand_neg_assumptions false
% 0.86/1.10 % --bmc1_ucm_layered_model none
% 0.86/1.10 % --bmc1_ucm_max_lemma_size 10
% 0.86/1.10
% 0.86/1.10 % ------ AIG Options
% 0.86/1.10
% 0.86/1.10 % --aig_mode false
% 0.86/1.10
% 0.86/1.10 % ------ Instantiation Options
% 0.86/1.10
% 0.86/1.10 % --instantiation_flag true
% 0.86/1.10 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.86/1.10 % --inst_solver_per_active 750
% 0.86/1.10 % --inst_solver_calls_frac 0.5
% 0.86/1.10 % --inst_passive_queue_type priority_queues
% 0.86/1.10 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.86/1.10 % --inst_passive_queues_freq [25;2]
% 0.86/1.10 % --inst_dismatching true
% 0.86/1.10 % --inst_eager_unprocessed_to_passive true
% 0.86/1.10 % --inst_prop_sim_given true
% 0.86/1.10 % --inst_prop_sim_new false
% 0.86/1.10 % --inst_orphan_elimination true
% 0.86/1.10 % --inst_learning_loop_flag true
% 0.86/1.10 % --inst_learning_start 3000
% 0.86/1.10 % --inst_learning_factor 2
% 0.86/1.10 % --inst_start_prop_sim_after_learn 3
% 0.86/1.10 % --inst_sel_renew solver
% 0.86/1.10 % --inst_lit_activity_flag true
% 0.86/1.10 % --inst_out_proof true
% 0.86/1.10
% 0.86/1.10 % ------ Resolution Options
% 0.86/1.10
% 0.86/1.10 % --resolution_flag true
% 0.86/1.10 % --res_lit_sel kbo_max
% 0.86/1.10 % --res_to_prop_solver none
% 0.86/1.10 % --res_prop_simpl_new false
% 0.86/1.10 % --res_prop_simpl_given false
% 0.86/1.10 % --res_passive_queue_type priority_queues
% 0.86/1.10 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.86/1.10 % --res_passive_queues_freq [15;5]
% 0.86/1.10 % --res_forward_subs full
% 0.86/1.10 % --res_backward_subs full
% 0.86/1.10 % --res_forward_subs_resolution true
% 0.86/1.10 % --res_backward_subs_resolution true
% 0.86/1.10 % --res_orphan_elimination false
% 0.86/1.10 % --res_time_limit 1000.
% 0.86/1.10 % --res_out_proof true
% 0.86/1.10 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_ba4033.s
% 0.86/1.10 % --modulo true
% 0.86/1.10
% 0.86/1.10 % ------ Combination Options
% 0.86/1.10
% 0.86/1.10 % --comb_res_mult 1000
% 0.86/1.10 % --comb_inst_mult 300
% 0.86/1.10 % ------
% 0.86/1.10
% 0.86/1.10
% 0.86/1.10
% 0.86/1.10 % ------ Proving...
% 0.86/1.10 % warning: shown sat in sat incomplete mode
% 0.86/1.10 %
% 0.86/1.10
% 0.86/1.10
% 0.86/1.10
% 0.86/1.10
% 0.86/1.10 cnf(c_173,plain,
% 0.86/1.10 ( check_cpq(triple(X0,X1,X2))
% 0.86/1.10 | ~ less_than(X3,X4)
% 0.86/1.10 | ~ check_cpq(triple(X0,insert_slb(X1,pair(X4,X3)),X2)) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_272_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_776,plain,
% 0.86/1.10 ( check_cpq(triple(X0,X1,X2))
% 0.86/1.10 | ~ less_than(X3,X4)
% 0.86/1.10 | ~ check_cpq(triple(X0,insert_slb(X1,pair(X4,X3)),X2)) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_173]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_777,plain,
% 0.86/1.10 ( ~ less_than(X0,X1)
% 0.86/1.10 | ~ check_cpq(triple(X2,insert_slb(X3,pair(X1,X0)),X4))
% 0.86/1.10 | check_cpq(triple(X2,X3,X4)) ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_776]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_170,plain,
% 0.86/1.10 ( check_cpq(triple(X0,insert_slb(X1,pair(X2,X3)),X4))
% 0.86/1.10 | ~ less_than(X3,X2)
% 0.86/1.10 | ~ check_cpq(triple(X0,X1,X4)) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_274_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_770,plain,
% 0.86/1.10 ( check_cpq(triple(X0,insert_slb(X1,pair(X2,X3)),X4))
% 0.86/1.10 | ~ less_than(X3,X2)
% 0.86/1.10 | ~ check_cpq(triple(X0,X1,X4)) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_170]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_771,plain,
% 0.86/1.10 ( ~ less_than(X0,X1)
% 0.86/1.10 | check_cpq(triple(X2,insert_slb(X3,pair(X1,X0)),X4))
% 0.86/1.10 | ~ check_cpq(triple(X2,X3,X4)) ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_770]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_164,plain,
% 0.86/1.10 ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) = findmin_cpq_eff(triple(X0,X1,X2))
% 0.86/1.10 | X1 = create_slb
% 0.86/1.10 | ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
% 0.86/1.10 | ~ contains_slb(X1,findmin_pqp_res(X0)) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_276_3) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_758,plain,
% 0.86/1.10 ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) = findmin_cpq_eff(triple(X0,X1,X2))
% 0.86/1.10 | X1 = create_slb
% 0.86/1.10 | ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
% 0.86/1.10 | ~ contains_slb(X1,findmin_pqp_res(X0)) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_164]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_759,plain,
% 0.86/1.10 ( ~ less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))
% 0.86/1.10 | ~ contains_slb(X0,findmin_pqp_res(X1))
% 0.86/1.10 | triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2) = findmin_cpq_eff(triple(X1,X0,X2))
% 0.86/1.10 | X0 = create_slb ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_758]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_157,plain,
% 0.86/1.10 ( triple(remove_pqp(X0,X1),remove_slb(X2,X1),X3) = remove_cpq(triple(X0,X2,X3),X1)
% 0.86/1.10 | ~ less_than(lookup_slb(X2,X1),X1)
% 0.86/1.10 | ~ contains_slb(X2,X1) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_278_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_744,plain,
% 0.86/1.10 ( triple(remove_pqp(X0,X1),remove_slb(X2,X1),X3) = remove_cpq(triple(X0,X2,X3),X1)
% 0.86/1.10 | ~ less_than(lookup_slb(X2,X1),X1)
% 0.86/1.10 | ~ contains_slb(X2,X1) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_157]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_745,plain,
% 0.86/1.10 ( ~ less_than(lookup_slb(X0,X1),X1)
% 0.86/1.10 | ~ contains_slb(X0,X1)
% 0.86/1.10 | triple(remove_pqp(X2,X1),remove_slb(X0,X1),X3) = remove_cpq(triple(X2,X0,X3),X1) ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_744]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_145,plain,
% 0.86/1.10 ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
% 0.86/1.10 | contains_slb(X1,findmin_pqp_res(X0))
% 0.86/1.10 | X1 = create_slb ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_283_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_720,plain,
% 0.86/1.10 ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
% 0.86/1.10 | contains_slb(X1,findmin_pqp_res(X0))
% 0.86/1.10 | X1 = create_slb ),
% 0.86/1.10 inference(copy,[status(esa)],[c_145]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_721,plain,
% 0.86/1.10 ( contains_slb(X0,findmin_pqp_res(X1))
% 0.86/1.10 | findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad)
% 0.86/1.10 | X0 = create_slb ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_720]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_125,plain,
% 0.86/1.10 ( X0 != X1 | pair_in_list(insert_slb(X2,pair(X0,X3)),X1,X4) | X3 != X4 ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_294_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_680,plain,
% 0.86/1.10 ( X0 != X1 | pair_in_list(insert_slb(X2,pair(X0,X3)),X1,X4) | X3 != X4 ),
% 0.86/1.10 inference(copy,[status(esa)],[c_125]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_681,plain,
% 0.86/1.10 ( pair_in_list(insert_slb(X0,pair(X1,X2)),X3,X4) | X1 != X3 | X2 != X4 ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_680]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_70,plain,
% 0.86/1.10 ( strictly_less_than(X0,X1) | less_than(X1,X0) | ~ less_than(X0,X1) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_323_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_570,plain,
% 0.86/1.10 ( strictly_less_than(X0,X1) | less_than(X1,X0) | ~ less_than(X0,X1) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_70]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_571,plain,
% 0.86/1.10 ( less_than(X0,X1) | ~ less_than(X1,X0) | strictly_less_than(X1,X0) ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_570]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_54,plain,
% 0.86/1.10 ( phi(X0) | ~ check_cpq(X1) | ~ ok(X1) | ~ succ_cpq(X0,X1) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_330_3) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_538,plain,
% 0.86/1.10 ( phi(X0) | ~ check_cpq(X1) | ~ ok(X1) | ~ succ_cpq(X0,X1) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_54]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_539,plain,
% 0.86/1.10 ( ~ succ_cpq(X0,X1) | ~ check_cpq(X1) | ~ ok(X1) | phi(X0) ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_538]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_176,negated_conjecture,
% 0.86/1.10 ( i(triple(sk2_esk2_0,create_slb,sk2_esk4_0)) != i(triple(sk2_esk1_0,create_slb,sk2_esk3_0)) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_4) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_257,negated_conjecture,
% 0.86/1.10 ( i(triple(sk2_esk2_0,create_slb,sk2_esk4_0)) != i(triple(sk2_esk1_0,create_slb,sk2_esk3_0)) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_176]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_261,negated_conjecture,
% 0.86/1.10 ( i(triple(sk2_esk2_0,create_slb,sk2_esk4_0)) != i(triple(sk2_esk1_0,create_slb,sk2_esk3_0)) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_257]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_262,negated_conjecture,
% 0.86/1.10 ( i(triple(sk2_esk2_0,create_slb,sk2_esk4_0)) != i(triple(sk2_esk1_0,create_slb,sk2_esk3_0)) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_261]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_263,negated_conjecture,
% 0.86/1.10 ( i(triple(sk2_esk2_0,create_slb,sk2_esk4_0)) != i(triple(sk2_esk1_0,create_slb,sk2_esk3_0)) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_262]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_782,negated_conjecture,
% 0.86/1.10 ( i(triple(sk2_esk2_0,create_slb,sk2_esk4_0)) != i(triple(sk2_esk1_0,create_slb,sk2_esk3_0)) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_263]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_168,plain,
% 0.86/1.10 ( ~ check_cpq(triple(X0,insert_slb(X1,pair(X2,X3)),X4))
% 0.86/1.10 | ~ strictly_less_than(X2,X3) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_275_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_766,plain,
% 0.86/1.10 ( ~ check_cpq(triple(X0,insert_slb(X1,pair(X2,X3)),X4))
% 0.86/1.10 | ~ strictly_less_than(X2,X3) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_168]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_160,plain,
% 0.86/1.10 ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
% 0.86/1.10 | X1 = create_slb
% 0.86/1.10 | ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
% 0.86/1.10 | ~ contains_slb(X1,findmin_pqp_res(X0)) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_277_3) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_750,plain,
% 0.86/1.10 ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
% 0.86/1.10 | X1 = create_slb
% 0.86/1.10 | ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
% 0.86/1.10 | ~ contains_slb(X1,findmin_pqp_res(X0)) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_160]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_751,plain,
% 0.86/1.10 ( ~ contains_slb(X0,findmin_pqp_res(X1))
% 0.86/1.10 | ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X0,findmin_pqp_res(X1)))
% 0.86/1.10 | findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad)
% 0.86/1.10 | X0 = create_slb ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_750]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_154,plain,
% 0.86/1.10 ( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad)
% 0.86/1.10 | ~ strictly_less_than(X3,lookup_slb(X1,X3))
% 0.86/1.10 | ~ contains_slb(X1,X3) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_279_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_738,plain,
% 0.86/1.10 ( remove_cpq(triple(X0,X1,X2),X3) = triple(remove_pqp(X0,X3),remove_slb(X1,X3),bad)
% 0.86/1.10 | ~ strictly_less_than(X3,lookup_slb(X1,X3))
% 0.86/1.10 | ~ contains_slb(X1,X3) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_154]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_739,plain,
% 0.86/1.10 ( ~ contains_slb(X0,X1)
% 0.86/1.10 | ~ strictly_less_than(X1,lookup_slb(X0,X1))
% 0.86/1.10 | remove_cpq(triple(X2,X0,X3),X1) = triple(remove_pqp(X2,X1),remove_slb(X0,X1),bad) ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_738]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_151,plain,
% 0.86/1.10 ( pair_in_list(X0,X1,X2)
% 0.86/1.10 | X3 = X1
% 0.86/1.10 | ~ pair_in_list(insert_slb(X0,pair(X3,X4)),X1,X2) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_281_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_732,plain,
% 0.86/1.10 ( pair_in_list(X0,X1,X2)
% 0.86/1.10 | X3 = X1
% 0.86/1.10 | ~ pair_in_list(insert_slb(X0,pair(X3,X4)),X1,X2) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_151]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_733,plain,
% 0.86/1.10 ( ~ pair_in_list(insert_slb(X0,pair(X1,X2)),X3,X4)
% 0.86/1.10 | pair_in_list(X0,X3,X4)
% 0.86/1.10 | X1 = X3 ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_732]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_148,plain,
% 0.86/1.10 ( pair_in_list(X0,X1,X2)
% 0.86/1.10 | X3 = X2
% 0.86/1.10 | ~ pair_in_list(insert_slb(X0,pair(X4,X3)),X1,X2) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_282_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_726,plain,
% 0.86/1.10 ( pair_in_list(X0,X1,X2)
% 0.86/1.10 | X3 = X2
% 0.86/1.10 | ~ pair_in_list(insert_slb(X0,pair(X4,X3)),X1,X2) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_148]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_727,plain,
% 0.86/1.10 ( ~ pair_in_list(insert_slb(X0,pair(X1,X2)),X3,X4)
% 0.86/1.10 | pair_in_list(X0,X3,X4)
% 0.86/1.10 | X2 = X4 ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_726]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_143,plain,
% 0.86/1.10 ( pair_in_list(insert_slb(X0,pair(X1,X2)),X3,X4)
% 0.86/1.10 | ~ pair_in_list(X0,X3,X4) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_284_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_716,plain,
% 0.86/1.10 ( pair_in_list(insert_slb(X0,pair(X1,X2)),X3,X4)
% 0.86/1.10 | ~ pair_in_list(X0,X3,X4) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_143]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_141,plain,
% 0.86/1.10 ( contains_slb(X0,X1) | ~ contains_cpq(triple(X2,X0,X3),X1) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_285_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_712,plain,
% 0.86/1.10 ( contains_slb(X0,X1) | ~ contains_cpq(triple(X2,X0,X3),X1) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_141]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_139,plain,
% 0.86/1.10 ( remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad)
% 0.86/1.10 | contains_slb(X1,X3) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_286_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_708,plain,
% 0.86/1.10 ( remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad)
% 0.86/1.10 | contains_slb(X1,X3) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_139]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_709,plain,
% 0.86/1.10 ( contains_slb(X0,X1)
% 0.86/1.10 | remove_cpq(triple(X2,X0,X3),X1) = triple(X2,X0,bad) ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_708]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_136,plain,
% 0.86/1.10 ( remove_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(remove_slb(X0,X3),pair(X1,X2))
% 0.86/1.10 | X1 = X3
% 0.86/1.10 | ~ contains_slb(X0,X3) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_287_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_702,plain,
% 0.86/1.10 ( remove_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(remove_slb(X0,X3),pair(X1,X2))
% 0.86/1.10 | X1 = X3
% 0.86/1.10 | ~ contains_slb(X0,X3) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_136]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_703,plain,
% 0.86/1.10 ( ~ contains_slb(X0,X1)
% 0.86/1.10 | remove_slb(insert_slb(X0,pair(X2,X3)),X1) = insert_slb(remove_slb(X0,X1),pair(X2,X3))
% 0.86/1.10 | X2 = X1 ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_702]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_134,plain,
% 0.86/1.10 ( update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X2))
% 0.86/1.10 | ~ less_than(X3,X2) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_288_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_698,plain,
% 0.86/1.10 ( update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X2))
% 0.86/1.10 | ~ less_than(X3,X2) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_134]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_699,plain,
% 0.86/1.10 ( ~ less_than(X0,X1)
% 0.86/1.10 | update_slb(insert_slb(X2,pair(X3,X1)),X0) = insert_slb(update_slb(X2,X0),pair(X3,X1)) ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_698]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_132,plain,
% 0.86/1.10 ( update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X3))
% 0.86/1.10 | ~ strictly_less_than(X2,X3) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_289_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_694,plain,
% 0.86/1.10 ( update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X3))
% 0.86/1.10 | ~ strictly_less_than(X2,X3) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_132]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_695,plain,
% 0.86/1.10 ( ~ strictly_less_than(X0,X1)
% 0.86/1.10 | update_slb(insert_slb(X2,pair(X3,X0)),X1) = insert_slb(update_slb(X2,X1),pair(X3,X1)) ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_694]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_129,plain,
% 0.86/1.10 ( X0 = X1
% 0.86/1.10 | contains_slb(X2,X1)
% 0.86/1.10 | ~ contains_slb(insert_slb(X2,pair(X0,X3)),X1) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_291_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_688,plain,
% 0.86/1.10 ( X0 = X1
% 0.86/1.10 | contains_slb(X2,X1)
% 0.86/1.10 | ~ contains_slb(insert_slb(X2,pair(X0,X3)),X1) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_129]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_689,plain,
% 0.86/1.10 ( ~ contains_slb(insert_slb(X0,pair(X1,X2)),X3)
% 0.86/1.10 | contains_slb(X0,X3)
% 0.86/1.10 | X1 = X3 ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_688]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_127,plain,
% 0.86/1.10 ( contains_cpq(triple(X0,X1,X2),X3) | ~ contains_slb(X1,X3) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_293_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_684,plain,
% 0.86/1.10 ( contains_cpq(triple(X0,X1,X2),X3) | ~ contains_slb(X1,X3) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_127]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_685,plain,
% 0.86/1.10 ( ~ contains_slb(X0,X1) | contains_cpq(triple(X2,X0,X3),X1) ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_684]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_124,plain,
% 0.86/1.10 ( pair_in_list(insert_slb(X0,pair(X1,X2)),X3,X4) | X2 != X4 | X1 != X3 ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_294_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_678,plain,
% 0.86/1.10 ( pair_in_list(insert_slb(X0,pair(X1,X2)),X3,X4) | X2 != X4 | X1 != X3 ),
% 0.86/1.10 inference(copy,[status(esa)],[c_124]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_121,plain,
% 0.86/1.10 ( lookup_slb(insert_slb(X0,pair(X1,X2)),X3) = lookup_slb(X0,X3)
% 0.86/1.10 | X1 = X3
% 0.86/1.10 | ~ contains_slb(X0,X3) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_295_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_672,plain,
% 0.86/1.10 ( lookup_slb(insert_slb(X0,pair(X1,X2)),X3) = lookup_slb(X0,X3)
% 0.86/1.10 | X1 = X3
% 0.86/1.10 | ~ contains_slb(X0,X3) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_121]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_673,plain,
% 0.86/1.10 ( ~ contains_slb(X0,X1)
% 0.86/1.10 | lookup_slb(insert_slb(X0,pair(X2,X3)),X1) = lookup_slb(X0,X1)
% 0.86/1.10 | X2 = X1 ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_672]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_119,plain,
% 0.86/1.10 ( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
% 0.86/1.10 | X1 = create_slb ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_296_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_668,plain,
% 0.86/1.10 ( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
% 0.86/1.10 | X1 = create_slb ),
% 0.86/1.10 inference(copy,[status(esa)],[c_119]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_117,plain,
% 0.86/1.10 ( contains_slb(insert_slb(X0,pair(X1,X2)),X3) | ~ contains_slb(X0,X3) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_297_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_664,plain,
% 0.86/1.10 ( contains_slb(insert_slb(X0,pair(X1,X2)),X3) | ~ contains_slb(X0,X3) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_117]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_115,plain,
% 0.86/1.10 ( X0 = bad | ok(triple(X1,X2,X0)) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_298_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_660,plain,
% 0.86/1.10 ( X0 = bad | ok(triple(X1,X2,X0)) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_115]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_661,plain,
% 0.86/1.10 ( ok(triple(X0,X1,X2)) | X2 = bad ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_660]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_112,plain,
% 0.86/1.10 ( remove_pq(insert_pq(X0,X1),X2) = insert_pq(remove_pq(X0,X2),X1)
% 0.86/1.10 | X1 = X2
% 0.86/1.10 | ~ contains_pq(X0,X2) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_302_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_654,plain,
% 0.86/1.10 ( remove_pq(insert_pq(X0,X1),X2) = insert_pq(remove_pq(X0,X2),X1)
% 0.86/1.10 | X1 = X2
% 0.86/1.10 | ~ contains_pq(X0,X2) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_112]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_655,plain,
% 0.86/1.10 ( ~ contains_pq(X0,X1)
% 0.86/1.10 | remove_pq(insert_pq(X0,X2),X1) = insert_pq(remove_pq(X0,X1),X2)
% 0.86/1.10 | X2 = X1 ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_654]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_110,plain,
% 0.86/1.10 ( contains_slb(insert_slb(X0,pair(X1,X2)),X3) | X1 != X3 ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_303_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_650,plain,
% 0.86/1.10 ( contains_slb(insert_slb(X0,pair(X1,X2)),X3) | X1 != X3 ),
% 0.86/1.10 inference(copy,[status(esa)],[c_110]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_107,plain,
% 0.86/1.10 ( X0 = X1 | contains_pq(X2,X1) | ~ contains_pq(insert_pq(X2,X0),X1) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_308_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_644,plain,
% 0.86/1.10 ( X0 = X1 | contains_pq(X2,X1) | ~ contains_pq(insert_pq(X2,X0),X1) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_107]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_645,plain,
% 0.86/1.10 ( ~ contains_pq(insert_pq(X0,X1),X2) | contains_pq(X0,X2) | X1 = X2 ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_644]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_105,plain,
% 0.86/1.10 ( issmallestelement_pq(X0,X1) | ~ less_than(X1,sk1_esk1_2(X0,X1)) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_310_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_640,plain,
% 0.86/1.10 ( issmallestelement_pq(X0,X1) | ~ less_than(X1,sk1_esk1_2(X0,X1)) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_105]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_641,plain,
% 0.86/1.10 ( ~ less_than(X0,sk1_esk1_2(X1,X0)) | issmallestelement_pq(X1,X0) ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_640]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_102,plain,
% 0.86/1.10 ( removemin_pq_eff(X0,X1) = remove_pq(X0,X1)
% 0.86/1.10 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.10 | ~ contains_pq(X0,X1) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_311_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_634,plain,
% 0.86/1.10 ( removemin_pq_eff(X0,X1) = remove_pq(X0,X1)
% 0.86/1.10 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.10 | ~ contains_pq(X0,X1) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_102]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_635,plain,
% 0.86/1.10 ( ~ contains_pq(X0,X1)
% 0.86/1.10 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.10 | removemin_pq_eff(X0,X1) = remove_pq(X0,X1) ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_634]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_100,plain,
% 0.86/1.10 ( succ_cpq(X0,remove_cpq(X1,X2)) | ~ succ_cpq(X0,X1) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_312_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_630,plain,
% 0.86/1.10 ( succ_cpq(X0,remove_cpq(X1,X2)) | ~ succ_cpq(X0,X1) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_100]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_98,plain,
% 0.86/1.10 ( succ_cpq(X0,insert_cpq(X1,X2)) | ~ succ_cpq(X0,X1) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_313_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_626,plain,
% 0.86/1.10 ( succ_cpq(X0,insert_cpq(X1,X2)) | ~ succ_cpq(X0,X1) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_98]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_96,plain,
% 0.86/1.10 ( contains_pq(insert_pq(X0,X1),X2) | ~ contains_pq(X0,X2) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_314_1) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_622,plain,
% 0.86/1.10 ( contains_pq(insert_pq(X0,X1),X2) | ~ contains_pq(X0,X2) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_96]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_93,plain,
% 0.86/1.10 ( removemin_pq_res(X0,X1) = X1
% 0.86/1.10 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.10 | ~ contains_pq(X0,X1) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_315_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_616,plain,
% 0.86/1.10 ( removemin_pq_res(X0,X1) = X1
% 0.86/1.10 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.10 | ~ contains_pq(X0,X1) ),
% 0.86/1.10 inference(copy,[status(esa)],[c_93]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_617,plain,
% 0.86/1.10 ( ~ contains_pq(X0,X1)
% 0.86/1.10 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.10 | removemin_pq_res(X0,X1) = X1 ),
% 0.86/1.10 inference(rewriting,[status(thm)],[c_616]) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_90,plain,
% 0.86/1.10 ( findmin_pq_res(X0,X1) = X1
% 0.86/1.10 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.10 | ~ contains_pq(X0,X1) ),
% 0.86/1.10 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_316_2) ).
% 0.86/1.10
% 0.86/1.10 cnf(c_610,plain,
% 0.86/1.11 ( findmin_pq_res(X0,X1) = X1
% 0.86/1.11 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.11 | ~ contains_pq(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_90]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_611,plain,
% 0.86/1.11 ( ~ contains_pq(X0,X1)
% 0.86/1.11 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.11 | findmin_pq_res(X0,X1) = X1 ),
% 0.86/1.11 inference(rewriting,[status(thm)],[c_610]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_87,plain,
% 0.86/1.11 ( findmin_pq_eff(X0,X1) = X0
% 0.86/1.11 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.11 | ~ contains_pq(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_317_2) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_604,plain,
% 0.86/1.11 ( findmin_pq_eff(X0,X1) = X0
% 0.86/1.11 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.11 | ~ contains_pq(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_87]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_605,plain,
% 0.86/1.11 ( ~ contains_pq(X0,X1)
% 0.86/1.11 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.11 | findmin_pq_eff(X0,X1) = X0 ),
% 0.86/1.11 inference(rewriting,[status(thm)],[c_604]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_84,plain,
% 0.86/1.11 ( pi_sharp_removemin(X0,X1)
% 0.86/1.11 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.11 | ~ contains_pq(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_318_2) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_598,plain,
% 0.86/1.11 ( pi_sharp_removemin(X0,X1)
% 0.86/1.11 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.11 | ~ contains_pq(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_84]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_599,plain,
% 0.86/1.11 ( ~ contains_pq(X0,X1)
% 0.86/1.11 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.11 | pi_sharp_removemin(X0,X1) ),
% 0.86/1.11 inference(rewriting,[status(thm)],[c_598]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_81,plain,
% 0.86/1.11 ( pi_sharp_find_min(X0,X1)
% 0.86/1.11 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.11 | ~ contains_pq(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_319_2) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_592,plain,
% 0.86/1.11 ( pi_sharp_find_min(X0,X1)
% 0.86/1.11 | ~ issmallestelement_pq(X0,X1)
% 0.86/1.11 | ~ contains_pq(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_81]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_593,plain,
% 0.86/1.11 ( ~ contains_pq(X0,X1)
% 0.86/1.11 | pi_sharp_find_min(X0,X1)
% 0.86/1.11 | ~ issmallestelement_pq(X0,X1) ),
% 0.86/1.11 inference(rewriting,[status(thm)],[c_592]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_78,plain,
% 0.86/1.11 ( less_than(X0,X1)
% 0.86/1.11 | ~ contains_pq(X2,X1)
% 0.86/1.11 | ~ issmallestelement_pq(X2,X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_320_2) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_586,plain,
% 0.86/1.11 ( less_than(X0,X1)
% 0.86/1.11 | ~ contains_pq(X2,X1)
% 0.86/1.11 | ~ issmallestelement_pq(X2,X0) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_78]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_77,plain,
% 0.86/1.11 ( ~ less_than(X0,X1) | ~ less_than(X1,X2) | less_than(X0,X2) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_321_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_584,plain,
% 0.86/1.11 ( ~ less_than(X0,X1) | ~ less_than(X1,X2) | less_than(X0,X2) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_77]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_76,plain,
% 0.86/1.11 ( ~ less_than(X0,X1) | less_than(X0,X2) | ~ less_than(X1,X2) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_321_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_582,plain,
% 0.86/1.11 ( ~ less_than(X0,X1) | less_than(X0,X2) | ~ less_than(X1,X2) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_76]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_75,plain,
% 0.86/1.11 ( less_than(X0,X1) | ~ less_than(X2,X1) | ~ less_than(X0,X2) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_321_2) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_580,plain,
% 0.86/1.11 ( less_than(X0,X1) | ~ less_than(X2,X1) | ~ less_than(X0,X2) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_75]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_73,plain,
% 0.86/1.11 ( issmallestelement_pq(X0,X1) | contains_pq(X0,sk1_esk1_2(X0,X1)) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_322_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_576,plain,
% 0.86/1.11 ( issmallestelement_pq(X0,X1) | contains_pq(X0,sk1_esk1_2(X0,X1)) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_73]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_577,plain,
% 0.86/1.11 ( contains_pq(X0,sk1_esk1_2(X0,X1)) | issmallestelement_pq(X0,X1) ),
% 0.86/1.11 inference(rewriting,[status(thm)],[c_576]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_71,plain,
% 0.86/1.11 ( ~ less_than(X0,X1) | strictly_less_than(X0,X1) | less_than(X1,X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_323_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_572,plain,
% 0.86/1.11 ( ~ less_than(X0,X1) | strictly_less_than(X0,X1) | less_than(X1,X0) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_71]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_573,plain,
% 0.86/1.11 ( ~ less_than(X0,X1) | less_than(X1,X0) | strictly_less_than(X0,X1) ),
% 0.86/1.11 inference(rewriting,[status(thm)],[c_572]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_68,plain,
% 0.86/1.11 ( pi_remove(X0,X1) | ~ pi_sharp_remove(i(X0),X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_324_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_566,plain,
% 0.86/1.11 ( pi_remove(X0,X1) | ~ pi_sharp_remove(i(X0),X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_68]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_567,plain,
% 0.86/1.11 ( ~ pi_sharp_remove(i(X0),X1) | pi_remove(X0,X1) ),
% 0.86/1.11 inference(rewriting,[status(thm)],[c_566]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_66,plain,
% 0.86/1.11 ( ~ strictly_less_than(X0,X1) | ~ less_than(X1,X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_325_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_562,plain,
% 0.86/1.11 ( ~ strictly_less_than(X0,X1) | ~ less_than(X1,X0) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_66]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_563,plain,
% 0.86/1.11 ( ~ less_than(X0,X1) | ~ strictly_less_than(X1,X0) ),
% 0.86/1.11 inference(rewriting,[status(thm)],[c_562]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_64,plain,
% 0.86/1.11 ( contains_pq(insert_pq(X0,X1),X2) | X1 != X2 ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_326_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_558,plain,
% 0.86/1.11 ( contains_pq(insert_pq(X0,X1),X2) | X1 != X2 ),
% 0.86/1.11 inference(copy,[status(esa)],[c_64]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_62,plain,
% 0.86/1.11 ( pi_sharp_remove(i(X0),X1) | ~ pi_remove(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_327_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_554,plain,
% 0.86/1.11 ( pi_sharp_remove(i(X0),X1) | ~ pi_remove(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_62]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_60,plain,
% 0.86/1.11 ( succ_cpq(X0,removemin_cpq_eff(X1)) | ~ succ_cpq(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_328_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_550,plain,
% 0.86/1.11 ( succ_cpq(X0,removemin_cpq_eff(X1)) | ~ succ_cpq(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_60]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_58,plain,
% 0.86/1.11 ( succ_cpq(X0,findmin_cpq_eff(X1)) | ~ succ_cpq(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_329_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_546,plain,
% 0.86/1.11 ( succ_cpq(X0,findmin_cpq_eff(X1)) | ~ succ_cpq(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_58]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_52,plain,
% 0.86/1.11 ( contains_pq(X0,X1) | ~ pi_sharp_removemin(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_332_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_534,plain,
% 0.86/1.11 ( contains_pq(X0,X1) | ~ pi_sharp_removemin(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_52]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_50,plain,
% 0.86/1.11 ( issmallestelement_pq(X0,X1) | ~ pi_sharp_removemin(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_333_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_530,plain,
% 0.86/1.11 ( issmallestelement_pq(X0,X1) | ~ pi_sharp_removemin(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_50]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_48,plain,
% 0.86/1.11 ( contains_pq(X0,X1) | ~ pi_sharp_find_min(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_334_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_526,plain,
% 0.86/1.11 ( contains_pq(X0,X1) | ~ pi_sharp_find_min(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_48]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_46,plain,
% 0.86/1.11 ( issmallestelement_pq(X0,X1) | ~ pi_sharp_find_min(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_335_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_522,plain,
% 0.86/1.11 ( issmallestelement_pq(X0,X1) | ~ pi_sharp_find_min(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_46]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_523,plain,
% 0.86/1.11 ( ~ pi_sharp_find_min(X0,X1) | issmallestelement_pq(X0,X1) ),
% 0.86/1.11 inference(rewriting,[status(thm)],[c_522]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_44,plain,
% 0.86/1.11 ( contains_pq(X0,X1) | ~ pi_sharp_remove(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_336_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_518,plain,
% 0.86/1.11 ( contains_pq(X0,X1) | ~ pi_sharp_remove(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_44]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_42,plain,
% 0.86/1.11 ( pi_sharp_remove(X0,X1) | ~ contains_pq(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_337_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_514,plain,
% 0.86/1.11 ( pi_sharp_remove(X0,X1) | ~ contains_pq(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_42]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_515,plain,
% 0.86/1.11 ( ~ contains_pq(X0,X1) | pi_sharp_remove(X0,X1) ),
% 0.86/1.11 inference(rewriting,[status(thm)],[c_514]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_40,plain,
% 0.86/1.11 ( less_than(X0,X1) | ~ strictly_less_than(X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_338_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_510,plain,
% 0.86/1.11 ( less_than(X0,X1) | ~ strictly_less_than(X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_40]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_38,plain,
% 0.86/1.11 ( pi_removemin(X0) | ~ pi_sharp_find_min(i(X0),X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_339_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_506,plain,
% 0.86/1.11 ( pi_removemin(X0) | ~ pi_sharp_find_min(i(X0),X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_38]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_507,plain,
% 0.86/1.11 ( ~ pi_sharp_find_min(i(X0),X1) | pi_removemin(X0) ),
% 0.86/1.11 inference(rewriting,[status(thm)],[c_506]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_36,plain,
% 0.86/1.11 ( pi_find_min(X0) | ~ pi_sharp_find_min(i(X0),X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_340_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_502,plain,
% 0.86/1.11 ( pi_find_min(X0) | ~ pi_sharp_find_min(i(X0),X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_36]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_34,plain,
% 0.86/1.11 ( pi_sharp_find_min(i(X0),sk1_esk3_1(X0)) | ~ pi_removemin(X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_341_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_498,plain,
% 0.86/1.11 ( pi_sharp_find_min(i(X0),sk1_esk3_1(X0)) | ~ pi_removemin(X0) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_34]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_32,plain,
% 0.86/1.11 ( pi_sharp_find_min(i(X0),sk1_esk2_1(X0)) | ~ pi_find_min(X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_342_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_494,plain,
% 0.86/1.11 ( pi_sharp_find_min(i(X0),sk1_esk2_1(X0)) | ~ pi_find_min(X0) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_32]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_495,plain,
% 0.86/1.11 ( ~ pi_find_min(X0) | pi_sharp_find_min(i(X0),sk1_esk2_1(X0)) ),
% 0.86/1.11 inference(rewriting,[status(thm)],[c_494]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_30,plain,
% 0.86/1.11 ( less_than(X0,X1) | less_than(X1,X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_345_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_490,plain,
% 0.86/1.11 ( less_than(X0,X1) | less_than(X1,X0) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_30]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_28,plain,
% 0.86/1.11 ( succ_cpq(X0,sk1_esk4_1(X0)) | ~ phi(X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_346_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_486,plain,
% 0.86/1.11 ( succ_cpq(X0,sk1_esk4_1(X0)) | ~ phi(X0) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_28]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_26,plain,
% 0.86/1.11 ( ok(sk1_esk4_1(X0)) | ~ phi(X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_349_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_482,plain,
% 0.86/1.11 ( ok(sk1_esk4_1(X0)) | ~ phi(X0) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_26]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_24,plain,
% 0.86/1.11 ( check_cpq(sk1_esk4_1(X0)) | ~ phi(X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_350_1) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_478,plain,
% 0.86/1.11 ( check_cpq(sk1_esk4_1(X0)) | ~ phi(X0) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_24]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_23,plain,
% 0.86/1.11 ( ~ ok(triple(X0,X1,bad)) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_290_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_476,plain,
% 0.86/1.11 ( ~ ok(triple(X0,X1,bad)) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_23]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_22,plain,
% 0.86/1.11 ( ~ pair_in_list(create_slb,X0,X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_306_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_474,plain,
% 0.86/1.11 ( ~ pair_in_list(create_slb,X0,X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_22]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_21,plain,
% 0.86/1.11 ( ~ contains_slb(create_slb,X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_347_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_472,plain,
% 0.86/1.11 ( ~ contains_slb(create_slb,X0) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_21]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_20,plain,
% 0.86/1.11 ( ~ contains_pq(create_pq,X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_348_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_470,plain,
% 0.86/1.11 ( ~ contains_pq(create_pq,X0) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_20]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_19,plain,
% 0.86/1.11 ( ~ isnonempty_slb(create_slb) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_356_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_468,plain,
% 0.86/1.11 ( ~ isnonempty_slb(create_slb) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_19]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_18,plain,
% 0.86/1.11 ( ~ isnonempty_pq(create_pq) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_357_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_466,plain,
% 0.86/1.11 ( ~ isnonempty_pq(create_pq) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_18]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_12,plain,
% 0.86/1.11 ( check_cpq(triple(X0,create_slb,X1)) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_301_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_459,plain,
% 0.86/1.11 ( check_cpq(triple(X0,create_slb,X1)) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_12]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_9,plain,
% 0.86/1.11 ( isnonempty_slb(insert_slb(X0,pair(X1,X2))) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_307_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_455,plain,
% 0.86/1.11 ( isnonempty_slb(insert_slb(X0,pair(X1,X2))) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_9]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_8,plain,
% 0.86/1.11 ( insert_pq(insert_pq(X0,X1),X2) = insert_pq(insert_pq(X0,X2),X1) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_309_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_453,plain,
% 0.86/1.11 ( insert_pq(insert_pq(X0,X1),X2) = insert_pq(insert_pq(X0,X2),X1) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_8]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_5,plain,
% 0.86/1.11 ( isnonempty_pq(insert_pq(X0,X1)) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_344_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_449,plain,
% 0.86/1.11 ( isnonempty_pq(insert_pq(X0,X1)) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_5]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_4,plain,
% 0.86/1.11 ( succ_cpq(X0,X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_351_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_447,plain,( succ_cpq(X0,X0) ),inference(copy,[status(esa)],[c_4]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_3,plain,
% 0.86/1.11 ( less_than(X0,X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_352_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_445,plain,( less_than(X0,X0) ),inference(copy,[status(esa)],[c_3]) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_1,plain,
% 0.86/1.11 ( less_than(bottom,X0) ),
% 0.86/1.11 file('/export/starexec/sandbox/tmp/iprover_modulo_a893b0.p', c_0_354_0) ).
% 0.86/1.11
% 0.86/1.11 cnf(c_442,plain,
% 0.86/1.11 ( less_than(bottom,X0) ),
% 0.86/1.11 inference(copy,[status(esa)],[c_1]) ).
% 0.86/1.11
% 0.86/1.11
% 0.86/1.11
% 0.86/1.11 % ------ Statistics
% 0.86/1.11
% 0.86/1.11 % ------ General
% 0.86/1.11
% 0.86/1.11 % num_of_input_clauses: 177
% 0.86/1.11 % num_of_input_neg_conjectures: 1
% 0.86/1.11 % num_of_splits: 0
% 0.86/1.11 % num_of_split_atoms: 0
% 0.86/1.11 % num_of_sem_filtered_clauses: 0
% 0.86/1.11 % num_of_subtypes: 0
% 0.86/1.11 % monotx_restored_types: 0
% 0.86/1.11 % sat_num_of_epr_types: 0
% 0.86/1.11 % sat_num_of_non_cyclic_types: 0
% 0.86/1.11 % sat_guarded_non_collapsed_types: 0
% 0.86/1.11 % is_epr: 0
% 0.86/1.11 % is_horn: 0
% 0.86/1.11 % has_eq: 1
% 0.86/1.11 % num_pure_diseq_elim: 0
% 0.86/1.11 % simp_replaced_by: 0
% 0.86/1.11 % res_preprocessed: 2
% 0.86/1.11 % prep_upred: 0
% 0.86/1.11 % prep_unflattend: 0
% 0.86/1.11 % pred_elim_cands: 0
% 0.86/1.11 % pred_elim: 0
% 0.86/1.11 % pred_elim_cl: 0
% 0.86/1.11 % pred_elim_cycles: 0
% 0.86/1.11 % forced_gc_time: 0
% 0.86/1.11 % gc_basic_clause_elim: 0
% 0.86/1.11 % parsing_time: 0.007
% 0.86/1.11 % sem_filter_time: 0.
% 0.86/1.11 % pred_elim_time: 0.
% 0.86/1.11 % out_proof_time: 0.
% 0.86/1.11 % monotx_time: 0.
% 0.86/1.11 % subtype_inf_time: 0.
% 0.86/1.11 % unif_index_cands_time: 0.
% 0.86/1.11 % unif_index_add_time: 0.
% 0.86/1.11 % total_time: 0.602
% 0.86/1.11 % num_of_symbols: 78
% 0.86/1.11 % num_of_terms: 547
% 0.86/1.11
% 0.86/1.11 % ------ Propositional Solver
% 0.86/1.11
% 0.86/1.11 % prop_solver_calls: 1
% 0.86/1.11 % prop_fast_solver_calls: 3
% 0.86/1.11 % prop_num_of_clauses: 201
% 0.86/1.11 % prop_preprocess_simplified: 509
% 0.86/1.11 % prop_fo_subsumed: 0
% 0.86/1.11 % prop_solver_time: 0.
% 0.86/1.11 % prop_fast_solver_time: 0.
% 0.86/1.11 % prop_unsat_core_time: 0.
% 0.86/1.11
% 0.86/1.11 % ------ QBF
% 0.86/1.11
% 0.86/1.11 % qbf_q_res: 0
% 0.86/1.11 % qbf_num_tautologies: 0
% 0.86/1.11 % qbf_prep_cycles: 0
% 0.86/1.11
% 0.86/1.11 % ------ BMC1
% 0.86/1.11
% 0.86/1.11 % bmc1_current_bound: -1
% 0.86/1.11 % bmc1_last_solved_bound: -1
% 0.86/1.11 % bmc1_unsat_core_size: -1
% 0.86/1.11 % bmc1_unsat_core_parents_size: -1
% 0.86/1.11 % bmc1_merge_next_fun: 0
% 0.86/1.11 % bmc1_unsat_core_clauses_time: 0.
% 0.86/1.11
% 0.86/1.11 % ------ Instantiation
% 0.86/1.11
% 0.86/1.11 % inst_num_of_clauses: 176
% 0.86/1.11 % inst_num_in_passive: 0
% 0.86/1.11 % inst_num_in_active: 0
% 0.86/1.11 % inst_num_in_unprocessed: 177
% 0.86/1.11 % inst_num_of_loops: 0
% 0.86/1.11 % inst_num_of_learning_restarts: 0
% 0.86/1.11 % inst_num_moves_active_passive: 0
% 0.86/1.11 % inst_lit_activity: 0
% 0.86/1.11 % inst_lit_activity_moves: 0
% 0.86/1.11 % inst_num_tautologies: 0
% 0.86/1.11 % inst_num_prop_implied: 0
% 0.86/1.11 % inst_num_existing_simplified: 0
% 0.86/1.11 % inst_num_eq_res_simplified: 0
% 0.86/1.11 % inst_num_child_elim: 0
% 0.86/1.11 % inst_num_of_dismatching_blockings: 0
% 0.86/1.11 % inst_num_of_non_proper_insts: 0
% 0.86/1.11 % inst_num_of_duplicates: 0
% 0.86/1.11 % inst_inst_num_from_inst_to_res: 0
% 0.86/1.11 % inst_dismatching_checking_time: 0.
% 0.86/1.11
% 0.86/1.11 % ------ Resolution
% 0.86/1.11
% 0.86/1.11 % res_num_of_clauses: 184
% 0.86/1.11 % res_num_in_passive: 0
% 0.86/1.11 % res_num_in_active: 80
% 0.86/1.11 % res_num_of_loops: 2
% 0.86/1.11 % res_forward_subset_subsumed: 86
% 0.86/1.11 % res_backward_subset_subsumed: 0
% 0.86/1.11 % res_forward_subsumed: 0
% 0.86/1.11 % res_backward_subsumed: 0
% 0.86/1.11 % res_forward_subsumption_resolution: 0
% 0.86/1.11 % res_backward_subsumption_resolution: 0
% 0.86/1.11 % res_clause_to_clause_subsumption: 0
% 0.86/1.11 % res_orphan_elimination: 0
% 0.86/1.11 % res_tautology_del: 0
% 0.86/1.11 % res_num_eq_res_simplified: 0
% 0.86/1.11 % res_num_sel_changes: 0
% 0.86/1.11 % res_moves_from_active_to_pass: 0
% 0.86/1.11
% 0.86/1.11 % Status Unknown
% 0.86/1.11 % Last status :
% 0.86/1.11 % SZS status Unknown
%------------------------------------------------------------------------------