TSTP Solution File: KLE050+4 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : KLE050+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n022.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 : Sun Jul 17 02:05:13 EDT 2022
% Result : Unknown 1.49s 1.73s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE050+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 14:07:17 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.12/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.41 % FOF problem with conjecture
% 0.12/0.41 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_368a8c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c02794.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_1f132f | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.20/0.69 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.69 % --bmc1_dump_file -
% 0.20/0.69 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.69 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.69 % --bmc1_ucm_extend_mode 1
% 0.20/0.69 % --bmc1_ucm_init_mode 2
% 0.20/0.69 % --bmc1_ucm_cone_mode none
% 0.20/0.69 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.69 % --bmc1_ucm_relax_model 4
% 0.20/0.69 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.69 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.69 % --bmc1_ucm_layered_model none
% 0.20/0.69 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.69
% 0.20/0.69 % ------ AIG Options
% 0.20/0.69
% 0.20/0.69 % --aig_mode false
% 0.20/0.69
% 0.20/0.69 % ------ Instantiation Options
% 0.20/0.69
% 0.20/0.69 % --instantiation_flag true
% 0.20/0.69 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.69 % --inst_solver_per_active 750
% 0.20/0.69 % --inst_solver_calls_frac 0.5
% 0.20/0.69 % --inst_passive_queue_type priority_queues
% 0.20/0.69 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.69 % --inst_passive_queues_freq [25;2]
% 0.20/0.69 % --inst_dismatching true
% 0.20/0.69 % --inst_eager_unprocessed_to_passive true
% 0.20/0.69 % --inst_prop_sim_given true
% 0.20/0.69 % --inst_prop_sim_new false
% 0.20/0.69 % --inst_orphan_elimination true
% 0.20/0.69 % --inst_learning_loop_flag true
% 0.20/0.69 % --inst_learning_start 3000
% 0.20/0.69 % --inst_learning_factor 2
% 0.20/0.69 % --inst_start_prop_sim_after_learn 3
% 0.20/0.69 % --inst_sel_renew solver
% 0.20/0.69 % --inst_lit_activity_flag true
% 0.20/0.69 % --inst_out_proof true
% 0.20/0.69
% 0.20/0.69 % ------ Resolution Options
% 0.20/0.69
% 0.20/0.69 % --resolution_flag true
% 0.20/0.69 % --res_lit_sel kbo_max
% 0.20/0.69 % --res_to_prop_solver none
% 0.20/0.69 % --res_prop_simpl_new false
% 0.20/0.69 % --res_prop_simpl_given false
% 0.20/0.69 % --res_passive_queue_type priority_queues
% 0.20/0.69 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.69 % --res_passive_queues_freq [15;5]
% 0.20/0.69 % --res_forward_subs full
% 0.20/0.69 % --res_backward_subs full
% 0.20/0.69 % --res_forward_subs_resolution true
% 0.20/0.69 % --res_backward_subs_resolution true
% 0.20/0.69 % --res_orphan_elimination false
% 0.20/0.69 % --res_time_limit 1000.
% 0.20/0.69 % --res_out_proof true
% 0.20/0.69 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_368a8c.s
% 0.20/0.69 % --modulo true
% 0.20/0.69
% 0.20/0.69 % ------ Combination Options
% 0.20/0.69
% 0.20/0.69 % --comb_res_mult 1000
% 0.20/0.69 % --comb_inst_mult 300
% 0.20/0.69 % ------
% 0.20/0.69
% 0.20/0.69 % ------ Parsing...% successful
% 0.20/0.69
% 0.20/0.69 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.69
% 0.20/0.69 % ------ Proving...
% 0.20/0.69 % ------ Problem Properties
% 0.20/0.69
% 0.20/0.69 %
% 0.20/0.69 % EPR false
% 0.20/0.69 % Horn false
% 0.20/0.69 % Has equality true
% 0.20/0.69
% 0.20/0.69 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.69
% 0.20/0.69
% 0.20/0.69 Compiling...
% 0.20/0.69 Loading plugin: done.
% 0.20/0.69 Compiling...
% 0.20/0.69 Loading plugin: done.
% 0.20/0.69 % % ------ Current options:
% 0.20/0.69
% 0.20/0.69 % ------ Input Options
% 0.20/0.69
% 0.20/0.69 % --out_options all
% 0.20/0.69 % --tptp_safe_out true
% 0.20/0.69 % --problem_path ""
% 0.20/0.69 % --include_path ""
% 0.20/0.69 % --clausifier .//eprover
% 0.20/0.69 % --clausifier_options --tstp-format
% 0.20/0.69 % --stdin false
% 0.20/0.69 % --dbg_backtrace false
% 0.20/0.69 % --dbg_dump_prop_clauses false
% 0.20/0.69 % --dbg_dump_prop_clauses_file -
% 0.20/0.69 % --dbg_out_stat false
% 0.20/0.69
% 0.20/0.69 % ------ General Options
% 0.20/0.69
% 0.20/0.69 % --fof false
% 0.20/0.69 % --time_out_real 150.
% 0.20/0.69 % --time_out_prep_mult 0.2
% 0.20/0.69 % --time_out_virtual -1.
% 0.20/0.69 % --schedule none
% 0.20/0.69 % --ground_splitting input
% 0.20/0.69 % --splitting_nvd 16
% 0.20/0.69 % --non_eq_to_eq false
% 0.20/0.69 % --prep_gs_sim true
% 0.20/0.69 % --prep_unflatten false
% 0.20/0.69 % --prep_res_sim true
% 0.20/0.69 % --prep_upred true
% 0.20/0.69 % --res_sim_input true
% 0.20/0.69 % --clause_weak_htbl true
% 0.20/0.69 % --gc_record_bc_elim false
% 0.20/0.69 % --symbol_type_check false
% 0.20/0.69 % --clausify_out false
% 0.20/0.69 % --large_theory_mode false
% 0.20/0.69 % --prep_sem_filter none
% 0.20/0.69 % --prep_sem_filter_out false
% 0.20/0.69 % --preprocessed_out false
% 0.20/0.69 % --sub_typing false
% 0.20/0.69 % --brand_transform false
% 0.20/0.69 % --pure_diseq_elim true
% 0.20/0.69 % --min_unsat_core false
% 0.20/0.69 % --pred_elim true
% 0.20/0.69 % --add_important_lit false
% 0.20/0.69 % --soft_assumptions false
% 0.20/0.69 % --reset_solvers false
% 0.20/0.69 % --bc_imp_inh []
% 0.20/0.69 % --conj_cone_tolerance 1.5
% 0.20/0.69 % --prolific_symb_bound 500
% 0.20/0.69 % --lt_threshold 2000
% 0.20/0.69
% 0.20/0.69 % ------ SAT Options
% 0.20/0.69
% 0.20/0.69 % --sat_mode false
% 0.20/0.69 % --sat_fm_restart_options ""
% 0.20/0.69 % --sat_gr_def false
% 0.20/0.69 % --sat_epr_types true
% 0.20/0.69 % --sat_non_cyclic_types false
% 0.20/0.69 % --sat_finite_models false
% 0.20/0.69 % --sat_fm_lemmas false
% 0.20/0.69 % --sat_fm_prep false
% 0.20/0.69 % --sat_fm_uc_incr true
% 0.20/0.69 % --sat_out_model small
% 0.20/0.69 % --sat_out_clauses false
% 0.20/0.69
% 0.20/0.69 % ------ QBF Options
% 0.20/0.69
% 0.20/0.69 % --qbf_mode false
% 0.20/0.69 % --qbf_elim_univ true
% 0.20/0.69 % --qbf_sk_in true
% 0.20/0.69 % --qbf_pred_elim true
% 0.20/0.69 % --qbf_split 32
% 0.20/0.69
% 0.20/0.69 % ------ BMC1 Options
% 0.20/0.69
% 0.20/0.69 % --bmc1_incremental false
% 0.20/0.69 % --bmc1_axioms reachable_all
% 0.20/0.69 % --bmc1_min_bound 0
% 0.20/0.69 % --bmc1_max_bound -1
% 0.20/0.69 % --bmc1_max_bound_default -1
% 0.20/0.69 % --bmc1_symbol_reachability true
% 0.20/0.69 % --bmc1_property_lemmas false
% 0.20/0.69 % --bmc1_k_induction false
% 0.20/0.69 % --bmc1_non_equiv_states false
% 0.20/0.69 % --bmc1_deadlock false
% 0.20/0.69 % --bmc1_ucm false
% 0.20/0.69 % --bmc1_add_unsat_core none
% 0.20/0.69 % --bmc1_unsat_core_children false
% 0.20/0.69 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.69 % --bmc1_out_stat full
% 0.20/0.69 % --bmc1_ground_init false
% 0.20/0.69 % --bmc1_pre_inst_next_state false
% 0.20/0.69 % --bmc1_pre_inst_state false
% 0.20/0.69 % --bmc1_pre_inst_reach_state false
% 0.20/0.69 % --bmc1_out_unsat_core false
% 0.20/0.69 % --bmc1_aig_witness_out false
% 0.20/0.69 % --bmc1_verbose false
% 0.20/0.69 % --bmc1_dump_clauses_tptp false
% 0.20/0.69 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.69 % --bmc1_dump_file -
% 0.20/0.69 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.69 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.69 % --bmc1_ucm_extend_mode 1
% 0.20/0.69 % --bmc1_ucm_init_mode 2
% 0.20/0.69 % --bmc1_ucm_cone_mode none
% 0.20/0.69 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.69 % --bmc1_ucm_relax_model 4
% 0.20/0.69 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.69 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.69 % --bmc1_ucm_layered_model none
% 0.20/0.69 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.69
% 0.20/0.69 % ------ AIG Options
% 0.20/0.69
% 0.20/0.69 % --aig_mode false
% 0.20/0.69
% 0.20/0.69 % ------ Instantiation Options
% 0.20/0.69
% 0.20/0.69 % --instantiation_flag true
% 0.20/0.69 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.69 % --inst_solver_per_active 750
% 0.20/0.69 % --inst_solver_calls_frac 0.5
% 0.20/0.69 % --inst_passive_queue_type priority_queues
% 0.20/0.69 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.69 % --inst_passive_queues_freq [25;2]
% 0.20/0.69 % --inst_dismatching true
% 0.20/0.69 % --inst_eager_unprocessed_to_passive true
% 0.20/0.69 % --inst_prop_sim_given true
% 0.20/0.69 % --inst_prop_sim_new false
% 0.20/0.69 % --inst_orphan_elimination true
% 0.20/0.69 % --inst_learning_loop_flag true
% 0.20/0.69 % --inst_learning_start 3000
% 0.20/0.69 % --inst_learning_factor 2
% 0.20/0.69 % --inst_start_prop_sim_after_learn 3
% 0.20/0.69 % --inst_sel_renew solver
% 0.20/0.69 % --inst_lit_activity_flag true
% 0.20/0.69 % --inst_out_proof true
% 0.20/0.69
% 0.20/0.69 % ------ Resolution Options
% 0.20/0.69
% 0.20/0.69 % --resolution_flag true
% 0.20/0.69 % --res_lit_sel kbo_max
% 0.20/0.69 % --res_to_prop_solver none
% 0.20/0.69 % --res_prop_simpl_new false
% 0.20/0.69 % --res_prop_simpl_given false
% 0.20/0.69 % --res_passive_queue_type priority_queues
% 0.20/0.69 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.69 % --res_passive_queues_freq [15;5]
% 0.20/0.69 % --res_forward_subs full
% 0.20/0.69 % --res_backward_subs full
% 0.20/0.69 % --res_forward_subs_resolution true
% 0.20/0.69 % --res_backward_subs_resolution true
% 0.20/0.69 % --res_orphan_elimination false
% 0.20/0.69 % --res_time_limit 1000.
% 0.20/0.69 % --res_out_proof true
% 0.20/0.69 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_368a8c.s
% 0.20/0.69 % --modulo true
% 0.20/0.69
% 0.20/0.69 % ------ Combination Options
% 0.20/0.69
% 0.20/0.69 % --comb_res_mult 1000
% 0.20/0.69 % --comb_inst_mult 300
% 0.20/0.69 % ------
% 0.20/0.69
% 0.20/0.69
% 0.20/0.69
% 0.20/0.69 % ------ Proving...
% 0.20/0.69 % warning: shown sat in sat incomplete mode
% 0.20/0.69 %
% 0.20/0.69
% 0.20/0.69
% 0.20/0.69
% 0.20/0.69
% 0.20/0.69 cnf(c_30,negated_conjecture,
% 0.20/0.69 ( test(sk3_esk4_0) ),
% 0.20/0.69 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_8) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_60,negated_conjecture,
% 0.20/0.69 ( test(sk3_esk4_0) ),
% 0.20/0.69 inference(copy,[status(esa)],[c_30]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_70,negated_conjecture,
% 0.20/0.69 ( test(sk3_esk4_0) ),
% 0.20/0.69 inference(copy,[status(esa)],[c_60]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_71,negated_conjecture,
% 0.20/0.69 ( test(sk3_esk4_0) ),
% 0.20/0.69 inference(copy,[status(esa)],[c_70]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_76,negated_conjecture,
% 0.20/0.69 ( test(sk3_esk4_0) ),
% 0.20/0.69 inference(copy,[status(esa)],[c_71]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_158,plain,( test(sk3_esk4_0) ),inference(copy,[status(esa)],[c_76]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_14,plain,
% 0.20/0.69 ( complement(sk1_esk1_1(X0),X0) | ~ test(X0) ),
% 0.20/0.69 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_120_0) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_126,plain,
% 0.20/0.69 ( complement(sk1_esk1_1(X0),X0) | ~ test(X0) ),
% 0.20/0.69 inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_127,plain,
% 0.20/0.69 ( ~ test(X0) | complement(sk1_esk1_1(X0),X0) ),
% 0.20/0.69 inference(rewriting,[status(thm)],[c_126]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_172,plain,
% 0.20/0.69 ( complement(sk1_esk1_1(sk3_esk4_0),sk3_esk4_0) ),
% 0.20/0.69 inference(resolution,[status(thm)],[c_158,c_127]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_173,plain,
% 0.20/0.69 ( complement(sk1_esk1_1(sk3_esk4_0),sk3_esk4_0) ),
% 0.20/0.69 inference(rewriting,[status(thm)],[c_172]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_20,plain,
% 0.20/0.69 ( multiplication(X0,X1) = zero | ~ complement(X0,X1) ),
% 0.20/0.69 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_114_0) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_138,plain,
% 0.20/0.69 ( multiplication(X0,X1) = zero | ~ complement(X0,X1) ),
% 0.20/0.69 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_139,plain,
% 0.20/0.69 ( ~ complement(X0,X1) | multiplication(X0,X1) = zero ),
% 0.20/0.69 inference(rewriting,[status(thm)],[c_138]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_192,plain,
% 0.20/0.69 ( multiplication(sk1_esk1_1(sk3_esk4_0),sk3_esk4_0) = zero ),
% 0.20/0.69 inference(resolution,[status(thm)],[c_173,c_139]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_193,plain,
% 0.20/0.69 ( multiplication(sk1_esk1_1(sk3_esk4_0),sk3_esk4_0) = zero ),
% 0.20/0.69 inference(rewriting,[status(thm)],[c_192]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_29,negated_conjecture,
% 0.20/0.69 ( test(sk3_esk3_0) ),
% 0.20/0.69 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_7) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_58,negated_conjecture,
% 0.20/0.69 ( test(sk3_esk3_0) ),
% 0.20/0.69 inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_69,negated_conjecture,
% 0.20/0.69 ( test(sk3_esk3_0) ),
% 0.20/0.69 inference(copy,[status(esa)],[c_58]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_72,negated_conjecture,
% 0.20/0.69 ( test(sk3_esk3_0) ),
% 0.20/0.69 inference(copy,[status(esa)],[c_69]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_75,negated_conjecture,
% 0.20/0.69 ( test(sk3_esk3_0) ),
% 0.20/0.69 inference(copy,[status(esa)],[c_72]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_156,plain,( test(sk3_esk3_0) ),inference(copy,[status(esa)],[c_75]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_164,plain,
% 0.20/0.69 ( complement(sk1_esk1_1(sk3_esk3_0),sk3_esk3_0) ),
% 0.20/0.69 inference(resolution,[status(thm)],[c_156,c_127]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_165,plain,
% 0.20/0.69 ( complement(sk1_esk1_1(sk3_esk3_0),sk3_esk3_0) ),
% 0.20/0.69 inference(rewriting,[status(thm)],[c_164]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_184,plain,
% 0.20/0.69 ( multiplication(sk1_esk1_1(sk3_esk3_0),sk3_esk3_0) = zero ),
% 0.20/0.69 inference(resolution,[status(thm)],[c_165,c_139]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_185,plain,
% 0.20/0.69 ( multiplication(sk1_esk1_1(sk3_esk3_0),sk3_esk3_0) = zero ),
% 0.20/0.69 inference(rewriting,[status(thm)],[c_184]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_28,negated_conjecture,
% 0.20/0.69 ( ~ leq(addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0)),multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)))
% 0.20/0.69 | ~ leq(multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)),addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0))) ),
% 0.20/0.69 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_6) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_56,negated_conjecture,
% 0.20/0.69 ( ~ leq(addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0)),multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)))
% 0.20/0.69 | ~ leq(multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)),addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0))) ),
% 0.20/0.69 inference(copy,[status(esa)],[c_28]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_68,negated_conjecture,
% 0.20/0.69 ( ~ leq(addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0)),multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)))
% 0.20/0.69 | ~ leq(multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)),addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0))) ),
% 0.20/0.69 inference(copy,[status(esa)],[c_56]) ).
% 0.20/0.69
% 0.20/0.69 cnf(c_73,negated_conjecture,
% 0.20/0.69 ( ~ leq(addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0)),multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)))
% 0.20/0.69 | ~ leq(multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)),addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0))) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_68]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_74,negated_conjecture,
% 0.20/0.70 ( ~ leq(addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0)),multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)))
% 0.20/0.70 | ~ leq(multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)),addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0))) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_73]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_154,negated_conjecture,
% 0.20/0.70 ( ~ leq(addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0)),multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)))
% 0.20/0.70 | ~ leq(multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)),addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0))) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_74]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_24,plain,
% 0.20/0.70 ( addition(X0,X1) != X1 | leq(X0,X1) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_110_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_146,plain,
% 0.20/0.70 ( addition(X0,X1) != X1 | leq(X0,X1) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_24]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_147,plain,
% 0.20/0.70 ( leq(X0,X1) | addition(X0,X1) != X1 ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_146]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_180,plain,
% 0.20/0.70 ( ~ leq(multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)),addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0)))
% 0.20/0.70 | addition(addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0)),multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0))) != multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)) ),
% 0.20/0.70 inference(resolution,[status(thm)],[c_154,c_147]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_181,plain,
% 0.20/0.70 ( ~ leq(multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)),addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0)))
% 0.20/0.70 | addition(addition(multiplication(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),addition(sk3_esk3_0,sk3_esk4_0)),star(addition(multiplication(sk3_esk4_0,sk3_esk2_0),multiplication(c(sk3_esk4_0),sk3_esk1_0)))),c(addition(sk3_esk3_0,sk3_esk4_0))),c(sk3_esk3_0)),multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0))) != multiplication(star(multiplication(multiplication(multiplication(sk3_esk3_0,sk3_esk1_0),star(multiplication(sk3_esk4_0,sk3_esk2_0))),c(sk3_esk4_0))),c(sk3_esk3_0)) ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_180]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_16,plain,
% 0.20/0.70 ( c(X0) != X1 | complement(X0,X1) | ~ test(X0) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_118_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_130,plain,
% 0.20/0.70 ( c(X0) != X1 | complement(X0,X1) | ~ test(X0) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_131,plain,
% 0.20/0.70 ( ~ test(X0) | complement(X0,X1) | c(X0) != X1 ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_130]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_171,plain,
% 0.20/0.70 ( complement(sk3_esk4_0,X0) | c(sk3_esk4_0) != X0 ),
% 0.20/0.70 inference(resolution,[status(thm)],[c_158,c_131]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_174,plain,
% 0.20/0.70 ( complement(sk3_esk4_0,X0) | c(sk3_esk4_0) != X0 ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_171]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_23,plain,
% 0.20/0.70 ( ~ complement(X0,X1) | c(X0) = X1 | ~ test(X0) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_111_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_144,plain,
% 0.20/0.70 ( ~ complement(X0,X1) | c(X0) = X1 | ~ test(X0) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_23]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_145,plain,
% 0.20/0.70 ( ~ test(X0) | ~ complement(X0,X1) | c(X0) = X1 ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_144]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_170,plain,
% 0.20/0.70 ( ~ complement(sk3_esk4_0,X0) | c(sk3_esk4_0) = X0 ),
% 0.20/0.70 inference(resolution,[status(thm)],[c_158,c_145]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_175,plain,
% 0.20/0.70 ( ~ complement(sk3_esk4_0,X0) | c(sk3_esk4_0) = X0 ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_170]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_163,plain,
% 0.20/0.70 ( complement(sk3_esk3_0,X0) | c(sk3_esk3_0) != X0 ),
% 0.20/0.70 inference(resolution,[status(thm)],[c_156,c_131]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_166,plain,
% 0.20/0.70 ( complement(sk3_esk3_0,X0) | c(sk3_esk3_0) != X0 ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_163]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_162,plain,
% 0.20/0.70 ( ~ complement(sk3_esk3_0,X0) | c(sk3_esk3_0) = X0 ),
% 0.20/0.70 inference(resolution,[status(thm)],[c_156,c_145]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_167,plain,
% 0.20/0.70 ( ~ complement(sk3_esk3_0,X0) | c(sk3_esk3_0) = X0 ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_162]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_27,plain,
% 0.20/0.70 ( leq(multiplication(X0,star(X1)),X2)
% 0.20/0.70 | ~ leq(addition(multiplication(X2,X1),X0),X2) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_103_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_152,plain,
% 0.20/0.70 ( leq(multiplication(X0,star(X1)),X2)
% 0.20/0.70 | ~ leq(addition(multiplication(X2,X1),X0),X2) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_27]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_153,plain,
% 0.20/0.70 ( ~ leq(addition(multiplication(X0,X1),X2),X0)
% 0.20/0.70 | leq(multiplication(X2,star(X1)),X0) ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_152]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_26,plain,
% 0.20/0.70 ( leq(multiplication(star(X0),X1),X2)
% 0.20/0.70 | ~ leq(addition(multiplication(X0,X2),X1),X2) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_104_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_150,plain,
% 0.20/0.70 ( leq(multiplication(star(X0),X1),X2)
% 0.20/0.70 | ~ leq(addition(multiplication(X0,X2),X1),X2) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_26]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_151,plain,
% 0.20/0.70 ( ~ leq(addition(multiplication(X0,X1),X2),X1)
% 0.20/0.70 | leq(multiplication(star(X0),X2),X1) ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_150]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_25,plain,
% 0.20/0.70 ( multiplication(X0,X1) != zero
% 0.20/0.70 | multiplication(X1,X0) != zero
% 0.20/0.70 | addition(X0,X1) != one
% 0.20/0.70 | complement(X1,X0) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_105_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_148,plain,
% 0.20/0.70 ( multiplication(X0,X1) != zero
% 0.20/0.70 | multiplication(X1,X0) != zero
% 0.20/0.70 | addition(X0,X1) != one
% 0.20/0.70 | complement(X1,X0) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_25]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_149,plain,
% 0.20/0.70 ( complement(X0,X1)
% 0.20/0.70 | addition(X1,X0) != one
% 0.20/0.70 | multiplication(X1,X0) != zero
% 0.20/0.70 | multiplication(X0,X1) != zero ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_148]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_22,plain,
% 0.20/0.70 ( addition(X0,X1) = X1 | ~ leq(X0,X1) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_112_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_142,plain,
% 0.20/0.70 ( addition(X0,X1) = X1 | ~ leq(X0,X1) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_22]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_143,plain,
% 0.20/0.70 ( ~ leq(X0,X1) | addition(X0,X1) = X1 ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_142]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_21,plain,
% 0.20/0.70 ( multiplication(X0,X1) = zero | ~ complement(X1,X0) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_113_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_140,plain,
% 0.20/0.70 ( multiplication(X0,X1) = zero | ~ complement(X1,X0) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_21]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_141,plain,
% 0.20/0.70 ( ~ complement(X0,X1) | multiplication(X1,X0) = zero ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_140]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_19,plain,
% 0.20/0.70 ( addition(X0,X1) = one | ~ complement(X1,X0) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_115_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_136,plain,
% 0.20/0.70 ( addition(X0,X1) = one | ~ complement(X1,X0) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_19]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_137,plain,
% 0.20/0.70 ( ~ complement(X0,X1) | addition(X1,X0) = one ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_136]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_15,plain,
% 0.20/0.70 ( ~ complement(X0,X1) | test(X1) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_119_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_128,plain,
% 0.20/0.70 ( ~ complement(X0,X1) | test(X1) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_129,plain,
% 0.20/0.70 ( test(X0) | ~ complement(X1,X0) ),
% 0.20/0.70 inference(rewriting,[status(thm)],[c_128]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_18,plain,
% 0.20/0.70 ( ~ test(X0)
% 0.20/0.70 | ~ test(X1)
% 0.20/0.70 | c(multiplication(X0,X1)) = addition(c(X0),c(X1)) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_116_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_134,plain,
% 0.20/0.70 ( ~ test(X0)
% 0.20/0.70 | ~ test(X1)
% 0.20/0.70 | c(multiplication(X0,X1)) = addition(c(X0),c(X1)) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_17,plain,
% 0.20/0.70 ( ~ test(X0)
% 0.20/0.70 | ~ test(X1)
% 0.20/0.70 | c(addition(X0,X1)) = multiplication(c(X0),c(X1)) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_117_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_132,plain,
% 0.20/0.70 ( ~ test(X0)
% 0.20/0.70 | ~ test(X1)
% 0.20/0.70 | c(addition(X0,X1)) = multiplication(c(X0),c(X1)) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_17]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_13,plain,
% 0.20/0.70 ( test(X0) | c(X0) = zero ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_122_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_124,plain,
% 0.20/0.70 ( test(X0) | c(X0) = zero ),
% 0.20/0.70 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_8,plain,
% 0.20/0.70 ( addition(X0,X1) = addition(X1,X0) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_121_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_118,plain,
% 0.20/0.70 ( addition(X0,X1) = addition(X1,X0) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_7,plain,
% 0.20/0.70 ( leq(addition(one,multiplication(star(X0),X0)),star(X0)) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_123_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_116,plain,
% 0.20/0.70 ( leq(addition(one,multiplication(star(X0),X0)),star(X0)) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_6,plain,
% 0.20/0.70 ( leq(addition(one,multiplication(X0,star(X0))),star(X0)) ),
% 0.20/0.70 file('/export/starexec/sandbox2/tmp/iprover_modulo_c02794.p', c_0_124_0) ).
% 0.20/0.70
% 0.20/0.70 cnf(c_114,plain,
% 0.20/0.70 ( leq(addition(one,multiplication(X0,star(X0))),star(X0)) ),
% 0.20/0.70 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.70
% 0.20/0.70
% 0.20/0.70
% 0.20/0.70 % ------ Statistics
% 0.20/0.70
% 0.20/0.70 % ------ General
% 0.20/0.70
% 0.20/0.70 % num_of_input_clauses: 31
% 0.20/0.70 % num_of_input_neg_conjectures: 3
% 0.20/0.70 % num_of_splits: 0
% 0.20/0.70 % num_of_split_atoms: 0
% 0.20/0.70 % num_of_sem_filtered_clauses: 0
% 0.20/0.70 % num_of_subtypes: 0
% 0.20/0.70 % monotx_restored_types: 0
% 0.20/0.70 % sat_num_of_epr_types: 0
% 0.20/0.70 % sat_num_of_non_cyclic_types: 0
% 0.20/0.70 % sat_guarded_non_collapsed_types: 0
% 0.20/0.70 % is_epr: 0
% 0.20/0.70 % is_horn: 0
% 0.20/0.70 % has_eq: 1
% 0.20/0.70 % num_pure_diseq_elim: 0
% 0.20/0.70 % simp_replaced_by: 0
% 0.20/0.70 % res_preprocessed: 6
% 0.20/0.70 % prep_upred: 0
% 0.20/0.70 % prep_unflattend: 0
% 0.20/0.70 % pred_elim_cands: 0
% 0.20/0.70 % pred_elim: 0
% 0.20/0.70 % pred_elim_cl: 0
% 0.20/0.70 % pred_elim_cycles: 0
% 0.20/0.70 % forced_gc_time: 0
% 0.20/0.70 % gc_basic_clause_elim: 0
% 0.20/0.70 % parsing_time: 0.001
% 0.20/0.70 % sem_filter_time: 0.
% 0.20/0.70 % pred_elim_time: 0.
% 0.20/0.70 % out_proof_time: 0.
% 0.20/0.70 % monotx_time: 0.
% 0.20/0.70 % subtype_inf_time: 0.
% 0.20/0.70 % unif_index_cands_time: 0.
% 0.20/0.70 % unif_index_add_time: 0.
% 0.20/0.70 % total_time: 0.278
% 0.20/0.70 % num_of_symbols: 39
% 0.20/0.70 % num_of_terms: 245
% 0.20/0.70
% 0.20/0.70 % ------ Propositional Solver
% 0.20/0.70
% 0.20/0.70 % prop_solver_calls: 1
% 0.20/0.70 % prop_fast_solver_calls: 12
% 0.20/0.70 % prop_num_of_clauses: 56
% 0.20/0.70 % prop_preprocess_simplified: 86
% 0.20/0.70 % prop_fo_subsumed: 0
% 0.20/0.70 % prop_solver_time: 0.
% 0.20/0.70 % prop_fast_solver_time: 0.
% 0.20/0.70 % prop_unsat_core_time: 0.
% 0.20/0.70
% 0.20/0.70 % ------ QBF
% 0.20/0.70
% 0.20/0.70 % qbf_q_res: 0
% 0.20/0.70 % qbf_num_tautologies: 0
% 0.20/0.70 % qbf_prep_cycles: 0
% 0.20/0.70
% 0.20/0.70 % ------ BMC1
% 0.20/0.70
% 0.20/0.70 % bmc1_current_bound: -1
% 0.20/0.70 % bmc1_last_solved_bound: -1
% 0.20/0.70 % bmc1_unsat_core_size: -1
% 0.20/0.70 % bmc1_unsat_core_parents_size: -1
% 0.20/0.70 % bmc1_merge_next_fun: 0
% 0.20/0.70 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.70
% 0.20/0.70 % ------ Instantiation
% 0.20/0.70
% 0.20/0.70 % inst_num_of_clauses: 31
% 0.20/0.70 % inst_num_in_passive: 0
% 0.20/0.70 % inst_num_in_active: 0
% 0.20/0.70 % inst_num_in_unprocessed: 31
% 0.20/0.70 % inst_num_of_loops: 0
% 0.20/0.70 % inst_num_of_learning_restarts: 0
% 0.20/0.70 % inst_num_moves_active_passive: 0
% 0.20/0.70 % inst_lit_activity: 0
% 0.20/0.70 % inst_lit_activity_moves: 0
% 0.20/0.70 % inst_num_tautologies: 0
% 0.20/0.70 % inst_num_prop_implied: 0
% 0.20/0.70 % inst_num_existing_simplified: 0
% 0.20/0.70 % inst_num_eq_res_simplified: 0
% 0.20/0.70 % inst_num_child_elim: 0
% 0.20/0.70 % inst_num_of_dismatching_blockings: 0
% 0.20/0.70 % inst_num_of_non_proper_insts: 0
% 0.20/0.70 % inst_num_of_duplicates: 0
% 0.20/0.70 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.70 % inst_dismatching_checking_time: 0.
% 0.20/0.70
% 0.20/0.70 % ------ Resolution
% 0.20/0.70
% 0.20/0.70 % res_num_of_clauses: 52
% 0.20/0.70 % res_num_in_passive: 0
% 0.20/0.70 % res_num_in_active: 30
% 0.20/0.70 % res_num_of_loops: 15
% 0.20/0.70 % res_forward_subset_subsumed: 4
% 0.20/0.70 % res_backward_subset_subsumed: 0
% 0.20/0.70 % res_forward_subsumed: 2
% 0.20/0.70 % res_backward_subsumed: 0
% 0.20/0.70 % res_forward_subsumption_resolution: 0
% 0.20/0.70 % res_backward_subsumption_resolution: 0
% 0.20/0.70 % res_clause_to_clause_subsumption: 8
% 0.20/0.70 % res_orphan_elimination: 0
% 0.20/0.70 % res_tautology_del: 2
% 0.20/0.70 % res_num_eq_res_simplified: 0
% 0.20/0.70 % res_num_sel_changes: 0
% 0.20/0.70 % res_moves_from_active_to_pass: 0
% 0.20/0.70
% 0.20/0.70 % Status Unknown
% 0.51/0.74 % Orienting using strategy ClausalAll
% 0.51/0.74 % FOF problem with conjecture
% 0.51/0.74 % 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_368a8c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c02794.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_16679c | grep -v "SZS"
% 0.51/0.77
% 0.51/0.77 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.51/0.77
% 0.51/0.77 %
% 0.51/0.77 % ------ iProver source info
% 0.51/0.77
% 0.51/0.77 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.51/0.77 % git: non_committed_changes: true
% 0.51/0.77 % git: last_make_outside_of_git: true
% 0.51/0.77
% 0.51/0.77 %
% 0.51/0.77 % ------ Input Options
% 0.51/0.77
% 0.51/0.77 % --out_options all
% 0.51/0.77 % --tptp_safe_out true
% 0.51/0.77 % --problem_path ""
% 0.51/0.77 % --include_path ""
% 0.51/0.77 % --clausifier .//eprover
% 0.51/0.77 % --clausifier_options --tstp-format
% 0.51/0.77 % --stdin false
% 0.51/0.77 % --dbg_backtrace false
% 0.51/0.77 % --dbg_dump_prop_clauses false
% 0.51/0.77 % --dbg_dump_prop_clauses_file -
% 0.51/0.77 % --dbg_out_stat false
% 0.51/0.77
% 0.51/0.77 % ------ General Options
% 0.51/0.77
% 0.51/0.77 % --fof false
% 0.51/0.77 % --time_out_real 150.
% 0.51/0.77 % --time_out_prep_mult 0.2
% 0.51/0.77 % --time_out_virtual -1.
% 0.51/0.77 % --schedule none
% 0.51/0.77 % --ground_splitting input
% 0.51/0.77 % --splitting_nvd 16
% 0.51/0.77 % --non_eq_to_eq false
% 0.51/0.77 % --prep_gs_sim true
% 0.51/0.77 % --prep_unflatten false
% 0.51/0.77 % --prep_res_sim true
% 0.51/0.77 % --prep_upred true
% 0.51/0.77 % --res_sim_input true
% 0.51/0.77 % --clause_weak_htbl true
% 0.51/0.77 % --gc_record_bc_elim false
% 0.51/0.77 % --symbol_type_check false
% 0.51/0.77 % --clausify_out false
% 0.51/0.77 % --large_theory_mode false
% 0.51/0.77 % --prep_sem_filter none
% 0.51/0.77 % --prep_sem_filter_out false
% 0.51/0.77 % --preprocessed_out false
% 0.51/0.77 % --sub_typing false
% 0.51/0.77 % --brand_transform false
% 0.51/0.77 % --pure_diseq_elim true
% 0.51/0.77 % --min_unsat_core false
% 0.51/0.77 % --pred_elim true
% 0.51/0.77 % --add_important_lit false
% 0.51/0.77 % --soft_assumptions false
% 0.51/0.77 % --reset_solvers false
% 0.51/0.77 % --bc_imp_inh []
% 0.51/0.77 % --conj_cone_tolerance 1.5
% 0.51/0.77 % --prolific_symb_bound 500
% 0.51/0.77 % --lt_threshold 2000
% 0.51/0.77
% 0.51/0.77 % ------ SAT Options
% 0.51/0.77
% 0.51/0.77 % --sat_mode false
% 0.51/0.77 % --sat_fm_restart_options ""
% 0.51/0.77 % --sat_gr_def false
% 0.51/0.77 % --sat_epr_types true
% 0.51/0.77 % --sat_non_cyclic_types false
% 0.51/0.77 % --sat_finite_models false
% 0.51/0.77 % --sat_fm_lemmas false
% 0.51/0.77 % --sat_fm_prep false
% 0.51/0.77 % --sat_fm_uc_incr true
% 0.51/0.77 % --sat_out_model small
% 0.51/0.77 % --sat_out_clauses false
% 0.51/0.77
% 0.51/0.77 % ------ QBF Options
% 0.51/0.77
% 0.51/0.77 % --qbf_mode false
% 0.51/0.77 % --qbf_elim_univ true
% 0.51/0.77 % --qbf_sk_in true
% 0.51/0.77 % --qbf_pred_elim true
% 0.51/0.77 % --qbf_split 32
% 0.51/0.77
% 0.51/0.77 % ------ BMC1 Options
% 0.51/0.77
% 0.51/0.77 % --bmc1_incremental false
% 0.51/0.77 % --bmc1_axioms reachable_all
% 0.51/0.77 % --bmc1_min_bound 0
% 0.51/0.77 % --bmc1_max_bound -1
% 0.51/0.77 % --bmc1_max_bound_default -1
% 0.51/0.77 % --bmc1_symbol_reachability true
% 0.51/0.77 % --bmc1_property_lemmas false
% 0.51/0.77 % --bmc1_k_induction false
% 0.51/0.77 % --bmc1_non_equiv_states false
% 0.51/0.77 % --bmc1_deadlock false
% 0.51/0.77 % --bmc1_ucm false
% 0.51/0.77 % --bmc1_add_unsat_core none
% 0.51/0.77 % --bmc1_unsat_core_children false
% 0.51/0.77 % --bmc1_unsat_core_extrapolate_axioms false
% 0.51/0.77 % --bmc1_out_stat full
% 0.51/0.77 % --bmc1_ground_init false
% 0.51/0.77 % --bmc1_pre_inst_next_state false
% 0.51/0.77 % --bmc1_pre_inst_state false
% 0.51/0.77 % --bmc1_pre_inst_reach_state false
% 0.51/0.77 % --bmc1_out_unsat_core false
% 0.51/0.77 % --bmc1_aig_witness_out false
% 0.51/0.77 % --bmc1_verbose false
% 0.51/0.77 % --bmc1_dump_clauses_tptp false
% 0.55/1.00 % --bmc1_dump_unsat_core_tptp false
% 0.55/1.00 % --bmc1_dump_file -
% 0.55/1.00 % --bmc1_ucm_expand_uc_limit 128
% 0.55/1.00 % --bmc1_ucm_n_expand_iterations 6
% 0.55/1.00 % --bmc1_ucm_extend_mode 1
% 0.55/1.00 % --bmc1_ucm_init_mode 2
% 0.55/1.00 % --bmc1_ucm_cone_mode none
% 0.55/1.00 % --bmc1_ucm_reduced_relation_type 0
% 0.55/1.00 % --bmc1_ucm_relax_model 4
% 0.55/1.00 % --bmc1_ucm_full_tr_after_sat true
% 0.55/1.00 % --bmc1_ucm_expand_neg_assumptions false
% 0.55/1.00 % --bmc1_ucm_layered_model none
% 0.55/1.00 % --bmc1_ucm_max_lemma_size 10
% 0.55/1.00
% 0.55/1.00 % ------ AIG Options
% 0.55/1.00
% 0.55/1.00 % --aig_mode false
% 0.55/1.00
% 0.55/1.00 % ------ Instantiation Options
% 0.55/1.00
% 0.55/1.00 % --instantiation_flag true
% 0.55/1.00 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.55/1.00 % --inst_solver_per_active 750
% 0.55/1.00 % --inst_solver_calls_frac 0.5
% 0.55/1.00 % --inst_passive_queue_type priority_queues
% 0.55/1.00 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.55/1.00 % --inst_passive_queues_freq [25;2]
% 0.55/1.00 % --inst_dismatching true
% 0.55/1.00 % --inst_eager_unprocessed_to_passive true
% 0.55/1.00 % --inst_prop_sim_given true
% 0.55/1.00 % --inst_prop_sim_new false
% 0.55/1.00 % --inst_orphan_elimination true
% 0.55/1.00 % --inst_learning_loop_flag true
% 0.55/1.00 % --inst_learning_start 3000
% 0.55/1.00 % --inst_learning_factor 2
% 0.55/1.00 % --inst_start_prop_sim_after_learn 3
% 0.55/1.00 % --inst_sel_renew solver
% 0.55/1.00 % --inst_lit_activity_flag true
% 0.55/1.00 % --inst_out_proof true
% 0.55/1.00
% 0.55/1.00 % ------ Resolution Options
% 0.55/1.00
% 0.55/1.00 % --resolution_flag true
% 0.55/1.00 % --res_lit_sel kbo_max
% 0.55/1.00 % --res_to_prop_solver none
% 0.55/1.00 % --res_prop_simpl_new false
% 0.55/1.00 % --res_prop_simpl_given false
% 0.55/1.00 % --res_passive_queue_type priority_queues
% 0.55/1.00 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.55/1.00 % --res_passive_queues_freq [15;5]
% 0.55/1.00 % --res_forward_subs full
% 0.55/1.00 % --res_backward_subs full
% 0.55/1.00 % --res_forward_subs_resolution true
% 0.55/1.00 % --res_backward_subs_resolution true
% 0.55/1.00 % --res_orphan_elimination false
% 0.55/1.00 % --res_time_limit 1000.
% 0.55/1.00 % --res_out_proof true
% 0.55/1.00 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_368a8c.s
% 0.55/1.00 % --modulo true
% 0.55/1.00
% 0.55/1.00 % ------ Combination Options
% 0.55/1.00
% 0.55/1.00 % --comb_res_mult 1000
% 0.55/1.00 % --comb_inst_mult 300
% 0.55/1.00 % ------
% 0.55/1.00
% 0.55/1.00 % ------ Parsing...% successful
% 0.55/1.00
% 0.55/1.00 % ------ 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.55/1.00
% 0.55/1.00 % ------ Proving...
% 0.55/1.00 % ------ Problem Properties
% 0.55/1.00
% 0.55/1.00 %
% 0.55/1.00 % EPR false
% 0.55/1.00 % Horn false
% 0.55/1.00 % Has equality true
% 0.55/1.00
% 0.55/1.00 % % ------ Input Options Time Limit: Unbounded
% 0.55/1.00
% 0.55/1.00
% 0.55/1.00 Compiling...
% 0.55/1.00 Loading plugin: done.
% 0.55/1.00 Compiling...
% 0.55/1.00 Loading plugin: done.
% 0.55/1.00 % % ------ Current options:
% 0.55/1.00
% 0.55/1.00 % ------ Input Options
% 0.55/1.00
% 0.55/1.00 % --out_options all
% 0.55/1.00 % --tptp_safe_out true
% 0.55/1.00 % --problem_path ""
% 0.55/1.00 % --include_path ""
% 0.55/1.00 % --clausifier .//eprover
% 0.55/1.00 % --clausifier_options --tstp-format
% 0.55/1.00 % --stdin false
% 0.55/1.00 % --dbg_backtrace false
% 0.55/1.00 % --dbg_dump_prop_clauses false
% 0.55/1.00 % --dbg_dump_prop_clauses_file -
% 0.55/1.00 % --dbg_out_stat false
% 0.55/1.00
% 0.55/1.00 % ------ General Options
% 0.55/1.00
% 0.55/1.00 % --fof false
% 0.55/1.00 % --time_out_real 150.
% 0.55/1.00 % --time_out_prep_mult 0.2
% 0.55/1.00 % --time_out_virtual -1.
% 0.55/1.00 % --schedule none
% 0.55/1.00 % --ground_splitting input
% 0.55/1.00 % --splitting_nvd 16
% 0.55/1.00 % --non_eq_to_eq false
% 0.55/1.00 % --prep_gs_sim true
% 0.55/1.00 % --prep_unflatten false
% 0.55/1.00 % --prep_res_sim true
% 0.55/1.00 % --prep_upred true
% 0.55/1.00 % --res_sim_input true
% 0.55/1.00 % --clause_weak_htbl true
% 0.55/1.00 % --gc_record_bc_elim false
% 0.55/1.00 % --symbol_type_check false
% 0.55/1.00 % --clausify_out false
% 0.55/1.00 % --large_theory_mode false
% 0.55/1.00 % --prep_sem_filter none
% 0.55/1.00 % --prep_sem_filter_out false
% 0.55/1.00 % --preprocessed_out false
% 0.55/1.00 % --sub_typing false
% 0.55/1.00 % --brand_transform false
% 0.55/1.00 % --pure_diseq_elim true
% 0.55/1.00 % --min_unsat_core false
% 0.55/1.00 % --pred_elim true
% 0.55/1.00 % --add_important_lit false
% 0.55/1.00 % --soft_assumptions false
% 0.55/1.00 % --reset_solvers false
% 0.55/1.00 % --bc_imp_inh []
% 0.55/1.00 % --conj_cone_tolerance 1.5
% 0.55/1.00 % --prolific_symb_bound 500
% 0.55/1.00 % --lt_threshold 2000
% 0.55/1.00
% 0.55/1.00 % ------ SAT Options
% 0.55/1.00
% 0.55/1.00 % --sat_mode false
% 0.55/1.00 % --sat_fm_restart_options ""
% 0.55/1.00 % --sat_gr_def false
% 0.55/1.00 % --sat_epr_types true
% 0.55/1.00 % --sat_non_cyclic_types false
% 0.55/1.00 % --sat_finite_models false
% 0.55/1.00 % --sat_fm_lemmas false
% 0.55/1.00 % --sat_fm_prep false
% 0.55/1.00 % --sat_fm_uc_incr true
% 0.55/1.00 % --sat_out_model small
% 0.55/1.00 % --sat_out_clauses false
% 0.55/1.00
% 0.55/1.00 % ------ QBF Options
% 0.55/1.00
% 0.55/1.00 % --qbf_mode false
% 0.55/1.00 % --qbf_elim_univ true
% 0.55/1.00 % --qbf_sk_in true
% 0.55/1.00 % --qbf_pred_elim true
% 0.55/1.00 % --qbf_split 32
% 0.55/1.00
% 0.55/1.00 % ------ BMC1 Options
% 0.55/1.00
% 0.55/1.00 % --bmc1_incremental false
% 0.55/1.00 % --bmc1_axioms reachable_all
% 0.55/1.00 % --bmc1_min_bound 0
% 0.55/1.00 % --bmc1_max_bound -1
% 0.55/1.00 % --bmc1_max_bound_default -1
% 0.55/1.00 % --bmc1_symbol_reachability true
% 0.55/1.00 % --bmc1_property_lemmas false
% 0.55/1.00 % --bmc1_k_induction false
% 0.55/1.00 % --bmc1_non_equiv_states false
% 0.55/1.00 % --bmc1_deadlock false
% 0.55/1.00 % --bmc1_ucm false
% 0.55/1.00 % --bmc1_add_unsat_core none
% 0.55/1.00 % --bmc1_unsat_core_children false
% 0.55/1.00 % --bmc1_unsat_core_extrapolate_axioms false
% 0.55/1.00 % --bmc1_out_stat full
% 0.55/1.00 % --bmc1_ground_init false
% 0.55/1.00 % --bmc1_pre_inst_next_state false
% 0.55/1.00 % --bmc1_pre_inst_state false
% 0.55/1.00 % --bmc1_pre_inst_reach_state false
% 0.55/1.00 % --bmc1_out_unsat_core false
% 0.55/1.00 % --bmc1_aig_witness_out false
% 0.55/1.00 % --bmc1_verbose false
% 0.55/1.00 % --bmc1_dump_clauses_tptp false
% 0.55/1.00 % --bmc1_dump_unsat_core_tptp false
% 0.55/1.00 % --bmc1_dump_file -
% 0.55/1.00 % --bmc1_ucm_expand_uc_limit 128
% 0.55/1.00 % --bmc1_ucm_n_expand_iterations 6
% 0.55/1.00 % --bmc1_ucm_extend_mode 1
% 0.55/1.00 % --bmc1_ucm_init_mode 2
% 0.55/1.00 % --bmc1_ucm_cone_mode none
% 0.55/1.00 % --bmc1_ucm_reduced_relation_type 0
% 0.55/1.00 % --bmc1_ucm_relax_model 4
% 0.55/1.00 % --bmc1_ucm_full_tr_after_sat true
% 0.55/1.00 % --bmc1_ucm_expand_neg_assumptions false
% 0.55/1.00 % --bmc1_ucm_layered_model none
% 0.55/1.00 % --bmc1_ucm_max_lemma_size 10
% 0.55/1.00
% 0.55/1.00 % ------ AIG Options
% 0.55/1.00
% 0.55/1.00 % --aig_mode false
% 0.55/1.00
% 0.55/1.00 % ------ Instantiation Options
% 0.55/1.00
% 0.55/1.00 % --instantiation_flag true
% 0.55/1.00 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.55/1.00 % --inst_solver_per_active 750
% 0.55/1.00 % --inst_solver_calls_frac 0.5
% 0.55/1.00 % --inst_passive_queue_type priority_queues
% 0.55/1.00 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.55/1.00 % --inst_passive_queues_freq [25;2]
% 0.55/1.00 % --inst_dismatching true
% 1.49/1.72 % --inst_eager_unprocessed_to_passive true
% 1.49/1.72 % --inst_prop_sim_given true
% 1.49/1.72 % --inst_prop_sim_new false
% 1.49/1.72 % --inst_orphan_elimination true
% 1.49/1.72 % --inst_learning_loop_flag true
% 1.49/1.72 % --inst_learning_start 3000
% 1.49/1.72 % --inst_learning_factor 2
% 1.49/1.72 % --inst_start_prop_sim_after_learn 3
% 1.49/1.72 % --inst_sel_renew solver
% 1.49/1.72 % --inst_lit_activity_flag true
% 1.49/1.72 % --inst_out_proof true
% 1.49/1.72
% 1.49/1.72 % ------ Resolution Options
% 1.49/1.72
% 1.49/1.72 % --resolution_flag true
% 1.49/1.72 % --res_lit_sel kbo_max
% 1.49/1.72 % --res_to_prop_solver none
% 1.49/1.72 % --res_prop_simpl_new false
% 1.49/1.72 % --res_prop_simpl_given false
% 1.49/1.72 % --res_passive_queue_type priority_queues
% 1.49/1.72 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.49/1.72 % --res_passive_queues_freq [15;5]
% 1.49/1.72 % --res_forward_subs full
% 1.49/1.72 % --res_backward_subs full
% 1.49/1.72 % --res_forward_subs_resolution true
% 1.49/1.72 % --res_backward_subs_resolution true
% 1.49/1.72 % --res_orphan_elimination false
% 1.49/1.72 % --res_time_limit 1000.
% 1.49/1.72 % --res_out_proof true
% 1.49/1.72 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_368a8c.s
% 1.49/1.72 % --modulo true
% 1.49/1.72
% 1.49/1.72 % ------ Combination Options
% 1.49/1.72
% 1.49/1.72 % --comb_res_mult 1000
% 1.49/1.72 % --comb_inst_mult 300
% 1.49/1.72 % ------
% 1.49/1.72
% 1.49/1.72
% 1.49/1.72
% 1.49/1.72 % ------ Proving...
% 1.49/1.72 % warning: shown sat in sat incomplete mode
% 1.49/1.72 %
% 1.49/1.72
% 1.49/1.72
% 1.49/1.72 ------ Building Model...Done
% 1.49/1.72
% 1.49/1.72 %------ The model is defined over ground terms (initial term algebra).
% 1.49/1.72 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.49/1.72 %------ where \phi is a formula over the term algebra.
% 1.49/1.72 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.49/1.72 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.49/1.72 %------ See help for --sat_out_model for different model outputs.
% 1.49/1.72 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.49/1.72 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.49/1.72
% 1.49/1.72
% 1.49/1.72
% 1.49/1.72
% 1.49/1.72 %------ Negative definition of equality_sorted
% 1.49/1.72 fof(lit_def,axiom,
% 1.49/1.72 (! [X0,X0,X1] :
% 1.49/1.72 ( ~(equality_sorted(X0,X0,X1)) <=>
% 1.49/1.72 (
% 1.49/1.72 (
% 1.49/1.72 ( X0=$i & X0=c(sk2_esk4_0) )
% 1.49/1.72 &
% 1.49/1.72 ( X1!=zero )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X0=$i & X0=c(sk2_esk4_0) & X1=zero )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X0=$i & X0=c(sk2_esk3_0) )
% 1.49/1.72 &
% 1.49/1.72 ( X1!=zero )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X0=$i & X0=c(sk2_esk3_0) & X1=zero )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X0=$i & X0=addition(multiplication(star(multiplication(multiplication(multiplication(sk2_esk3_0,sk2_esk1_0),star(multiplication(sk2_esk4_0,sk2_esk2_0))),c(sk2_esk4_0))),c(sk2_esk3_0)),addition(multiplication(multiplication(multiplication(multiplication(sk2_esk3_0,sk2_esk1_0),addition(sk2_esk3_0,sk2_esk4_0)),star(addition(multiplication(sk2_esk4_0,sk2_esk2_0),multiplication(c(sk2_esk4_0),sk2_esk1_0)))),c(addition(sk2_esk3_0,sk2_esk4_0))),c(sk2_esk3_0))) & X1=addition(multiplication(multiplication(multiplication(multiplication(sk2_esk3_0,sk2_esk1_0),addition(sk2_esk3_0,sk2_esk4_0)),star(addition(multiplication(sk2_esk4_0,sk2_esk2_0),multiplication(c(sk2_esk4_0),sk2_esk1_0)))),c(addition(sk2_esk3_0,sk2_esk4_0))),c(sk2_esk3_0)) )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X0=$i & X0=multiplication(one,one) & X1=zero )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X0=$i & X0=c(one) )
% 1.49/1.72 &
% 1.49/1.72 ( X1!=zero )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X0=$i & X0=c(one) & X1=zero )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 ? [X2,X3] :
% 1.49/1.72 (
% 1.49/1.72 ( X0=$i & X0=addition(X2,X3) & X1=one )
% 1.49/1.72 &
% 1.49/1.72 ( X2!=one | X3!=zero )
% 1.49/1.72 &
% 1.49/1.72 ( X2!=one | X3!=one )
% 1.49/1.72 &
% 1.49/1.72 ( X2!=one | X3!=sk1_esk1_1(one) )
% 1.49/1.72 &
% 1.49/1.72 ( X2!=sk2_esk3_0 | X3!=sk1_esk1_1(sk2_esk3_0) )
% 1.49/1.72 &
% 1.49/1.72 ( X2!=sk2_esk4_0 | X3!=sk1_esk1_1(sk2_esk4_0) )
% 1.49/1.72 &
% 1.49/1.72 ( X3!=one )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 ? [X2,X3] :
% 1.49/1.72 (
% 1.49/1.72 ( X0=$i & X0=addition(addition(multiplication(X2,X1),X3),X1) )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 ? [X2,X3] :
% 1.49/1.72 (
% 1.49/1.72 ( X0=$i & X0=addition(addition(multiplication(X1,X2),X3),X1) )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 ? [X2] :
% 1.49/1.72 (
% 1.49/1.72 ( X0=$i & X0=addition(X2,one) & X1=one )
% 1.49/1.72 &
% 1.49/1.72 ( X2!=one )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 )
% 1.49/1.72 )
% 1.49/1.72 )
% 1.49/1.72 ).
% 1.49/1.72
% 1.49/1.72 %------ Negative definition of leq
% 1.49/1.72 fof(lit_def,axiom,
% 1.49/1.72 (! [X0,X1] :
% 1.49/1.72 ( ~(leq(X0,X1)) <=>
% 1.49/1.72 (
% 1.49/1.72 (
% 1.49/1.72 ( X0=multiplication(star(multiplication(multiplication(multiplication(sk2_esk3_0,sk2_esk1_0),star(multiplication(sk2_esk4_0,sk2_esk2_0))),c(sk2_esk4_0))),c(sk2_esk3_0)) & X1=addition(multiplication(multiplication(multiplication(multiplication(sk2_esk3_0,sk2_esk1_0),addition(sk2_esk3_0,sk2_esk4_0)),star(addition(multiplication(sk2_esk4_0,sk2_esk2_0),multiplication(c(sk2_esk4_0),sk2_esk1_0)))),c(addition(sk2_esk3_0,sk2_esk4_0))),c(sk2_esk3_0)) )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 ? [X2,X3] :
% 1.49/1.72 (
% 1.49/1.72 ( X0=addition(multiplication(X2,X1),X3) )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 ? [X2,X3] :
% 1.49/1.72 (
% 1.49/1.72 ( X0=addition(multiplication(X1,X2),X3) )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X1=one )
% 1.49/1.72 &
% 1.49/1.72 ( X0!=one )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 )
% 1.49/1.72 )
% 1.49/1.72 )
% 1.49/1.72 ).
% 1.49/1.72
% 1.49/1.72 %------ Positive definition of test
% 1.49/1.72 fof(lit_def,axiom,
% 1.49/1.72 (! [X0] :
% 1.49/1.72 ( test(X0) <=>
% 1.49/1.72 (
% 1.49/1.72 (
% 1.49/1.72 ( X0=one )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X0=sk2_esk3_0 )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X0=sk2_esk4_0 )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 )
% 1.49/1.72 )
% 1.49/1.72 )
% 1.49/1.72 ).
% 1.49/1.72
% 1.49/1.72 %------ Positive definition of complement
% 1.49/1.72 fof(lit_def,axiom,
% 1.49/1.72 (! [X0,X1] :
% 1.49/1.72 ( complement(X0,X1) <=>
% 1.49/1.72 (
% 1.49/1.72 (
% 1.49/1.72 ( X0=zero & X1=one )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X0=sk1_esk1_1(sk2_esk3_0) & X1=sk2_esk3_0 )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X0=sk1_esk1_1(sk2_esk4_0) & X1=sk2_esk4_0 )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 |
% 1.49/1.72 (
% 1.49/1.72 ( X0=sk1_esk1_1(one) & X1=one )
% 1.49/1.72 )
% 1.49/1.72
% 1.49/1.72 )
% 1.49/1.72 )
% 1.49/1.72 )
% 1.49/1.72 ).
% 1.49/1.72
% 1.49/1.72
% 1.49/1.72
% 1.49/1.72 % ------ Statistics
% 1.49/1.72
% 1.49/1.72 % ------ General
% 1.49/1.72
% 1.49/1.72 % num_of_input_clauses: 52
% 1.49/1.72 % num_of_input_neg_conjectures: 3
% 1.49/1.73 % num_of_splits: 0
% 1.49/1.73 % num_of_split_atoms: 0
% 1.49/1.73 % num_of_sem_filtered_clauses: 0
% 1.49/1.73 % num_of_subtypes: 0
% 1.49/1.73 % monotx_restored_types: 0
% 1.49/1.73 % sat_num_of_epr_types: 0
% 1.49/1.73 % sat_num_of_non_cyclic_types: 0
% 1.49/1.73 % sat_guarded_non_collapsed_types: 0
% 1.49/1.73 % is_epr: 0
% 1.49/1.73 % is_horn: 0
% 1.49/1.73 % has_eq: 1
% 1.49/1.73 % num_pure_diseq_elim: 0
% 1.49/1.73 % simp_replaced_by: 0
% 1.49/1.73 % res_preprocessed: 6
% 1.49/1.73 % prep_upred: 0
% 1.49/1.73 % prep_unflattend: 0
% 1.49/1.73 % pred_elim_cands: 0
% 1.49/1.73 % pred_elim: 0
% 1.49/1.73 % pred_elim_cl: 0
% 1.49/1.73 % pred_elim_cycles: 0
% 1.49/1.73 % forced_gc_time: 0
% 1.49/1.73 % gc_basic_clause_elim: 0
% 1.49/1.73 % parsing_time: 0.002
% 1.49/1.73 % sem_filter_time: 0.
% 1.49/1.73 % pred_elim_time: 0.
% 1.49/1.73 % out_proof_time: 0.
% 1.49/1.73 % monotx_time: 0.
% 1.49/1.73 % subtype_inf_time: 0.
% 1.49/1.73 % unif_index_cands_time: 0.
% 1.49/1.73 % unif_index_add_time: 0.003
% 1.49/1.73 % total_time: 0.976
% 1.49/1.73 % num_of_symbols: 39
% 1.49/1.73 % num_of_terms: 4905
% 1.49/1.73
% 1.49/1.73 % ------ Propositional Solver
% 1.49/1.73
% 1.49/1.73 % prop_solver_calls: 7
% 1.49/1.73 % prop_fast_solver_calls: 12
% 1.49/1.73 % prop_num_of_clauses: 148
% 1.49/1.73 % prop_preprocess_simplified: 373
% 1.49/1.73 % prop_fo_subsumed: 0
% 1.49/1.73 % prop_solver_time: 0.
% 1.49/1.73 % prop_fast_solver_time: 0.
% 1.49/1.73 % prop_unsat_core_time: 0.
% 1.49/1.73
% 1.49/1.73 % ------ QBF
% 1.49/1.73
% 1.49/1.73 % qbf_q_res: 0
% 1.49/1.73 % qbf_num_tautologies: 0
% 1.49/1.73 % qbf_prep_cycles: 0
% 1.49/1.73
% 1.49/1.73 % ------ BMC1
% 1.49/1.73
% 1.49/1.73 % bmc1_current_bound: -1
% 1.49/1.73 % bmc1_last_solved_bound: -1
% 1.49/1.73 % bmc1_unsat_core_size: -1
% 1.49/1.73 % bmc1_unsat_core_parents_size: -1
% 1.49/1.73 % bmc1_merge_next_fun: 0
% 1.49/1.73 % bmc1_unsat_core_clauses_time: 0.
% 1.49/1.73
% 1.49/1.73 % ------ Instantiation
% 1.49/1.73
% 1.49/1.73 % inst_num_of_clauses: 124
% 1.49/1.73 % inst_num_in_passive: 0
% 1.49/1.73 % inst_num_in_active: 124
% 1.49/1.73 % inst_num_in_unprocessed: 0
% 1.49/1.73 % inst_num_of_loops: 130
% 1.49/1.73 % inst_num_of_learning_restarts: 0
% 1.49/1.73 % inst_num_moves_active_passive: 0
% 1.49/1.73 % inst_lit_activity: 37
% 1.49/1.73 % inst_lit_activity_moves: 0
% 1.49/1.73 % inst_num_tautologies: 0
% 1.49/1.73 % inst_num_prop_implied: 0
% 1.49/1.73 % inst_num_existing_simplified: 0
% 1.49/1.73 % inst_num_eq_res_simplified: 0
% 1.49/1.73 % inst_num_child_elim: 0
% 1.49/1.73 % inst_num_of_dismatching_blockings: 9
% 1.49/1.73 % inst_num_of_non_proper_insts: 119
% 1.49/1.73 % inst_num_of_duplicates: 102
% 1.49/1.73 % inst_inst_num_from_inst_to_res: 0
% 1.49/1.73 % inst_dismatching_checking_time: 0.
% 1.49/1.73
% 1.49/1.73 % ------ Resolution
% 1.49/1.73
% 1.49/1.73 % res_num_of_clauses: 1003
% 1.49/1.73 % res_num_in_passive: 244
% 1.49/1.73 % res_num_in_active: 725
% 1.49/1.73 % res_num_of_loops: 1000
% 1.49/1.73 % res_forward_subset_subsumed: 428
% 1.49/1.73 % res_backward_subset_subsumed: 0
% 1.49/1.73 % res_forward_subsumed: 296
% 1.49/1.73 % res_backward_subsumed: 0
% 1.49/1.73 % res_forward_subsumption_resolution: 0
% 1.49/1.73 % res_backward_subsumption_resolution: 0
% 1.49/1.73 % res_clause_to_clause_subsumption: 4975
% 1.49/1.73 % res_orphan_elimination: 0
% 1.49/1.73 % res_tautology_del: 0
% 1.49/1.73 % res_num_eq_res_simplified: 0
% 1.49/1.73 % res_num_sel_changes: 0
% 1.49/1.73 % res_moves_from_active_to_pass: 0
% 1.49/1.73
% 1.49/1.73 % Status Unknown
% 1.49/1.73 % Last status :
% 1.49/1.73 % SZS status Unknown
%------------------------------------------------------------------------------