TSTP Solution File: HWV003-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : HWV003-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n018.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 : Sat Jul 16 17:19:08 EDT 2022
% Result : Unknown 0.74s 0.93s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV003-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n018.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 22:29:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.21/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.41 % Orientation found
% 0.21/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/sandbox/tmp/iprover_proof_398856.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_6ab909.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_a38edf | 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.60 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.60 % --bmc1_dump_file -
% 0.21/0.60 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.60 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.60 % --bmc1_ucm_extend_mode 1
% 0.21/0.60 % --bmc1_ucm_init_mode 2
% 0.21/0.60 % --bmc1_ucm_cone_mode none
% 0.21/0.60 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.60 % --bmc1_ucm_relax_model 4
% 0.21/0.60 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.60 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.60 % --bmc1_ucm_layered_model none
% 0.21/0.60 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.60
% 0.21/0.60 % ------ AIG Options
% 0.21/0.60
% 0.21/0.60 % --aig_mode false
% 0.21/0.60
% 0.21/0.60 % ------ Instantiation Options
% 0.21/0.60
% 0.21/0.60 % --instantiation_flag true
% 0.21/0.60 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.60 % --inst_solver_per_active 750
% 0.21/0.60 % --inst_solver_calls_frac 0.5
% 0.21/0.60 % --inst_passive_queue_type priority_queues
% 0.21/0.60 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.60 % --inst_passive_queues_freq [25;2]
% 0.21/0.60 % --inst_dismatching true
% 0.21/0.60 % --inst_eager_unprocessed_to_passive true
% 0.21/0.60 % --inst_prop_sim_given true
% 0.21/0.60 % --inst_prop_sim_new false
% 0.21/0.60 % --inst_orphan_elimination true
% 0.21/0.60 % --inst_learning_loop_flag true
% 0.21/0.60 % --inst_learning_start 3000
% 0.21/0.60 % --inst_learning_factor 2
% 0.21/0.60 % --inst_start_prop_sim_after_learn 3
% 0.21/0.60 % --inst_sel_renew solver
% 0.21/0.60 % --inst_lit_activity_flag true
% 0.21/0.60 % --inst_out_proof true
% 0.21/0.60
% 0.21/0.60 % ------ Resolution Options
% 0.21/0.60
% 0.21/0.60 % --resolution_flag true
% 0.21/0.60 % --res_lit_sel kbo_max
% 0.21/0.60 % --res_to_prop_solver none
% 0.21/0.60 % --res_prop_simpl_new false
% 0.21/0.60 % --res_prop_simpl_given false
% 0.21/0.60 % --res_passive_queue_type priority_queues
% 0.21/0.60 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.60 % --res_passive_queues_freq [15;5]
% 0.21/0.60 % --res_forward_subs full
% 0.21/0.60 % --res_backward_subs full
% 0.21/0.60 % --res_forward_subs_resolution true
% 0.21/0.60 % --res_backward_subs_resolution true
% 0.21/0.60 % --res_orphan_elimination false
% 0.21/0.60 % --res_time_limit 1000.
% 0.21/0.60 % --res_out_proof true
% 0.21/0.60 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_398856.s
% 0.21/0.60 % --modulo true
% 0.21/0.60
% 0.21/0.60 % ------ Combination Options
% 0.21/0.60
% 0.21/0.60 % --comb_res_mult 1000
% 0.21/0.60 % --comb_inst_mult 300
% 0.21/0.60 % ------
% 0.21/0.60
% 0.21/0.60 % ------ Parsing...% successful
% 0.21/0.60
% 0.21/0.60 % ------ 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.21/0.60
% 0.21/0.60 % ------ Proving...
% 0.21/0.60 % ------ Problem Properties
% 0.21/0.60
% 0.21/0.60 %
% 0.21/0.60 % EPR false
% 0.21/0.60 % Horn true
% 0.21/0.60 % Has equality true
% 0.21/0.60
% 0.21/0.60 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.60
% 0.21/0.60
% 0.21/0.60 Compiling...
% 0.21/0.60 Loading plugin: done.
% 0.21/0.60 % % ------ Current options:
% 0.21/0.60
% 0.21/0.60 % ------ Input Options
% 0.21/0.60
% 0.21/0.60 % --out_options all
% 0.21/0.60 % --tptp_safe_out true
% 0.21/0.60 % --problem_path ""
% 0.21/0.60 % --include_path ""
% 0.21/0.60 % --clausifier .//eprover
% 0.21/0.60 % --clausifier_options --tstp-format
% 0.21/0.60 % --stdin false
% 0.21/0.60 % --dbg_backtrace false
% 0.21/0.60 % --dbg_dump_prop_clauses false
% 0.21/0.60 % --dbg_dump_prop_clauses_file -
% 0.21/0.60 % --dbg_out_stat false
% 0.21/0.60
% 0.21/0.60 % ------ General Options
% 0.21/0.60
% 0.21/0.60 % --fof false
% 0.21/0.60 % --time_out_real 150.
% 0.21/0.60 % --time_out_prep_mult 0.2
% 0.21/0.60 % --time_out_virtual -1.
% 0.21/0.60 % --schedule none
% 0.21/0.60 % --ground_splitting input
% 0.21/0.60 % --splitting_nvd 16
% 0.21/0.60 % --non_eq_to_eq false
% 0.21/0.60 % --prep_gs_sim true
% 0.21/0.60 % --prep_unflatten false
% 0.21/0.60 % --prep_res_sim true
% 0.21/0.60 % --prep_upred true
% 0.21/0.60 % --res_sim_input true
% 0.21/0.60 % --clause_weak_htbl true
% 0.21/0.60 % --gc_record_bc_elim false
% 0.21/0.60 % --symbol_type_check false
% 0.21/0.60 % --clausify_out false
% 0.21/0.60 % --large_theory_mode false
% 0.21/0.60 % --prep_sem_filter none
% 0.21/0.60 % --prep_sem_filter_out false
% 0.21/0.60 % --preprocessed_out false
% 0.21/0.60 % --sub_typing false
% 0.21/0.60 % --brand_transform false
% 0.21/0.60 % --pure_diseq_elim true
% 0.21/0.60 % --min_unsat_core false
% 0.21/0.60 % --pred_elim true
% 0.21/0.60 % --add_important_lit false
% 0.21/0.60 % --soft_assumptions false
% 0.21/0.60 % --reset_solvers false
% 0.21/0.60 % --bc_imp_inh []
% 0.21/0.60 % --conj_cone_tolerance 1.5
% 0.21/0.60 % --prolific_symb_bound 500
% 0.21/0.60 % --lt_threshold 2000
% 0.21/0.60
% 0.21/0.60 % ------ SAT Options
% 0.21/0.60
% 0.21/0.60 % --sat_mode false
% 0.21/0.60 % --sat_fm_restart_options ""
% 0.21/0.60 % --sat_gr_def false
% 0.21/0.60 % --sat_epr_types true
% 0.21/0.60 % --sat_non_cyclic_types false
% 0.21/0.60 % --sat_finite_models false
% 0.21/0.60 % --sat_fm_lemmas false
% 0.21/0.60 % --sat_fm_prep false
% 0.21/0.60 % --sat_fm_uc_incr true
% 0.21/0.60 % --sat_out_model small
% 0.21/0.60 % --sat_out_clauses false
% 0.21/0.60
% 0.21/0.60 % ------ QBF Options
% 0.21/0.60
% 0.21/0.60 % --qbf_mode false
% 0.21/0.60 % --qbf_elim_univ true
% 0.21/0.60 % --qbf_sk_in true
% 0.21/0.60 % --qbf_pred_elim true
% 0.21/0.60 % --qbf_split 32
% 0.21/0.60
% 0.21/0.60 % ------ BMC1 Options
% 0.21/0.60
% 0.21/0.60 % --bmc1_incremental false
% 0.21/0.60 % --bmc1_axioms reachable_all
% 0.21/0.60 % --bmc1_min_bound 0
% 0.21/0.60 % --bmc1_max_bound -1
% 0.21/0.60 % --bmc1_max_bound_default -1
% 0.21/0.60 % --bmc1_symbol_reachability true
% 0.21/0.60 % --bmc1_property_lemmas false
% 0.21/0.60 % --bmc1_k_induction false
% 0.21/0.60 % --bmc1_non_equiv_states false
% 0.21/0.60 % --bmc1_deadlock false
% 0.21/0.60 % --bmc1_ucm false
% 0.21/0.60 % --bmc1_add_unsat_core none
% 0.21/0.60 % --bmc1_unsat_core_children false
% 0.21/0.60 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.60 % --bmc1_out_stat full
% 0.21/0.60 % --bmc1_ground_init false
% 0.21/0.60 % --bmc1_pre_inst_next_state false
% 0.21/0.60 % --bmc1_pre_inst_state false
% 0.21/0.60 % --bmc1_pre_inst_reach_state false
% 0.21/0.60 % --bmc1_out_unsat_core false
% 0.21/0.60 % --bmc1_aig_witness_out false
% 0.21/0.60 % --bmc1_verbose false
% 0.21/0.60 % --bmc1_dump_clauses_tptp false
% 0.21/0.60 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.60 % --bmc1_dump_file -
% 0.21/0.60 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.60 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.60 % --bmc1_ucm_extend_mode 1
% 0.21/0.60 % --bmc1_ucm_init_mode 2
% 0.21/0.60 % --bmc1_ucm_cone_mode none
% 0.21/0.60 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.60 % --bmc1_ucm_relax_model 4
% 0.21/0.60 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.60 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.60 % --bmc1_ucm_layered_model none
% 0.21/0.60 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.60
% 0.21/0.60 % ------ AIG Options
% 0.21/0.60
% 0.21/0.60 % --aig_mode false
% 0.21/0.60
% 0.21/0.60 % ------ Instantiation Options
% 0.21/0.60
% 0.21/0.60 % --instantiation_flag true
% 0.21/0.60 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.60 % --inst_solver_per_active 750
% 0.21/0.60 % --inst_solver_calls_frac 0.5
% 0.21/0.60 % --inst_passive_queue_type priority_queues
% 0.21/0.60 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.60 % --inst_passive_queues_freq [25;2]
% 0.21/0.60 % --inst_dismatching true
% 0.21/0.60 % --inst_eager_unprocessed_to_passive true
% 0.21/0.60 % --inst_prop_sim_given true
% 0.21/0.60 % --inst_prop_sim_new false
% 0.21/0.60 % --inst_orphan_elimination true
% 0.21/0.60 % --inst_learning_loop_flag true
% 0.21/0.60 % --inst_learning_start 3000
% 0.21/0.60 % --inst_learning_factor 2
% 0.21/0.60 % --inst_start_prop_sim_after_learn 3
% 0.21/0.60 % --inst_sel_renew solver
% 0.21/0.60 % --inst_lit_activity_flag true
% 0.21/0.60 % --inst_out_proof true
% 0.21/0.60
% 0.21/0.60 % ------ Resolution Options
% 0.21/0.60
% 0.21/0.60 % --resolution_flag true
% 0.21/0.60 % --res_lit_sel kbo_max
% 0.21/0.60 % --res_to_prop_solver none
% 0.21/0.60 % --res_prop_simpl_new false
% 0.21/0.60 % --res_prop_simpl_given false
% 0.21/0.60 % --res_passive_queue_type priority_queues
% 0.21/0.60 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.60 % --res_passive_queues_freq [15;5]
% 0.21/0.60 % --res_forward_subs full
% 0.21/0.60 % --res_backward_subs full
% 0.21/0.60 % --res_forward_subs_resolution true
% 0.21/0.60 % --res_backward_subs_resolution true
% 0.21/0.60 % --res_orphan_elimination false
% 0.21/0.60 % --res_time_limit 1000.
% 0.21/0.60 % --res_out_proof true
% 0.21/0.60 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_398856.s
% 0.21/0.60 % --modulo true
% 0.21/0.60
% 0.21/0.60 % ------ Combination Options
% 0.21/0.60
% 0.21/0.60 % --comb_res_mult 1000
% 0.21/0.60 % --comb_inst_mult 300
% 0.21/0.60 % ------
% 0.21/0.60
% 0.21/0.60
% 0.21/0.60
% 0.21/0.60 % ------ Proving...
% 0.21/0.60 % warning: shown sat in sat incomplete mode
% 0.21/0.60 %
% 0.21/0.60
% 0.21/0.60
% 0.21/0.60
% 0.21/0.60
% 0.21/0.60 cnf(c_45,negated_conjecture,
% 0.21/0.60 ( not(and(a,b)) = a11 ),
% 0.21/0.60 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_88) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_107,negated_conjecture,
% 0.21/0.60 ( not(and(a,b)) = a11 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_45]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_163,negated_conjecture,
% 0.21/0.60 ( not(and(a,b)) = a11 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_107]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_166,negated_conjecture,
% 0.21/0.60 ( not(and(a,b)) = a11 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_163]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_196,negated_conjecture,
% 0.21/0.60 ( not(and(a,b)) = a11 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_166]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_303,negated_conjecture,
% 0.21/0.60 ( not(and(a,b)) = a11 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_196]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_304,plain,
% 0.21/0.60 ( or(not(a),not(b)) = a11 ),
% 0.21/0.60 inference(rewriting,[status(thm)],[c_303]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_44,negated_conjecture,
% 0.21/0.60 ( not(and(a11,a)) = a12 ),
% 0.21/0.60 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_87) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_105,negated_conjecture,
% 0.21/0.60 ( not(and(a11,a)) = a12 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_44]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_162,negated_conjecture,
% 0.21/0.60 ( not(and(a11,a)) = a12 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_105]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_167,negated_conjecture,
% 0.21/0.60 ( not(and(a11,a)) = a12 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_162]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_195,negated_conjecture,
% 0.21/0.60 ( not(and(a11,a)) = a12 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_167]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_301,negated_conjecture,
% 0.21/0.60 ( not(and(a11,a)) = a12 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_195]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_302,plain,
% 0.21/0.60 ( or(not(a11),not(a)) = a12 ),
% 0.21/0.60 inference(rewriting,[status(thm)],[c_301]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_43,negated_conjecture,
% 0.21/0.60 ( not(and(a11,b)) = a13 ),
% 0.21/0.60 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_86) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_103,negated_conjecture,
% 0.21/0.60 ( not(and(a11,b)) = a13 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_43]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_161,negated_conjecture,
% 0.21/0.60 ( not(and(a11,b)) = a13 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_103]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_168,negated_conjecture,
% 0.21/0.60 ( not(and(a11,b)) = a13 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_161]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_194,negated_conjecture,
% 0.21/0.60 ( not(and(a11,b)) = a13 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_168]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_299,negated_conjecture,
% 0.21/0.60 ( not(and(a11,b)) = a13 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_194]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_300,plain,
% 0.21/0.60 ( or(not(a11),not(b)) = a13 ),
% 0.21/0.60 inference(rewriting,[status(thm)],[c_299]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_42,negated_conjecture,
% 0.21/0.60 ( not(and(a12,a13)) = a14 ),
% 0.21/0.60 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_85) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_101,negated_conjecture,
% 0.21/0.60 ( not(and(a12,a13)) = a14 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_42]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_160,negated_conjecture,
% 0.21/0.60 ( not(and(a12,a13)) = a14 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_101]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_169,negated_conjecture,
% 0.21/0.60 ( not(and(a12,a13)) = a14 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_160]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_193,negated_conjecture,
% 0.21/0.60 ( not(and(a12,a13)) = a14 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_169]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_297,negated_conjecture,
% 0.21/0.60 ( not(and(a12,a13)) = a14 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_193]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_298,plain,
% 0.21/0.60 ( or(not(a12),not(a13)) = a14 ),
% 0.21/0.60 inference(rewriting,[status(thm)],[c_297]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_41,negated_conjecture,
% 0.21/0.60 ( not(and(a14,carryin)) = a15 ),
% 0.21/0.60 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_84) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_99,negated_conjecture,
% 0.21/0.60 ( not(and(a14,carryin)) = a15 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_41]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_159,negated_conjecture,
% 0.21/0.60 ( not(and(a14,carryin)) = a15 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_99]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_170,negated_conjecture,
% 0.21/0.60 ( not(and(a14,carryin)) = a15 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_159]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_192,negated_conjecture,
% 0.21/0.60 ( not(and(a14,carryin)) = a15 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_170]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_295,negated_conjecture,
% 0.21/0.60 ( not(and(a14,carryin)) = a15 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_192]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_296,plain,
% 0.21/0.60 ( or(not(a14),not(carryin)) = a15 ),
% 0.21/0.60 inference(rewriting,[status(thm)],[c_295]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_40,negated_conjecture,
% 0.21/0.60 ( not(and(a14,a15)) = a16 ),
% 0.21/0.60 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_83) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_97,negated_conjecture,
% 0.21/0.60 ( not(and(a14,a15)) = a16 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_40]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_158,negated_conjecture,
% 0.21/0.60 ( not(and(a14,a15)) = a16 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_97]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_171,negated_conjecture,
% 0.21/0.60 ( not(and(a14,a15)) = a16 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_158]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_191,negated_conjecture,
% 0.21/0.60 ( not(and(a14,a15)) = a16 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_171]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_293,negated_conjecture,
% 0.21/0.60 ( not(and(a14,a15)) = a16 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_191]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_294,plain,
% 0.21/0.60 ( or(not(a14),not(a15)) = a16 ),
% 0.21/0.60 inference(rewriting,[status(thm)],[c_293]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_39,negated_conjecture,
% 0.21/0.60 ( not(and(a15,carryin)) = a17 ),
% 0.21/0.60 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_82) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_95,negated_conjecture,
% 0.21/0.60 ( not(and(a15,carryin)) = a17 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_39]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_157,negated_conjecture,
% 0.21/0.60 ( not(and(a15,carryin)) = a17 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_95]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_172,negated_conjecture,
% 0.21/0.60 ( not(and(a15,carryin)) = a17 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_157]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_190,negated_conjecture,
% 0.21/0.60 ( not(and(a15,carryin)) = a17 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_172]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_291,negated_conjecture,
% 0.21/0.60 ( not(and(a15,carryin)) = a17 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_190]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_292,plain,
% 0.21/0.60 ( or(not(a15),not(carryin)) = a17 ),
% 0.21/0.60 inference(rewriting,[status(thm)],[c_291]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_38,negated_conjecture,
% 0.21/0.60 ( not(and(a16,a17)) = s1 ),
% 0.21/0.60 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_81) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_93,negated_conjecture,
% 0.21/0.60 ( not(and(a16,a17)) = s1 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_38]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_156,negated_conjecture,
% 0.21/0.60 ( not(and(a16,a17)) = s1 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_93]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_173,negated_conjecture,
% 0.21/0.60 ( not(and(a16,a17)) = s1 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_156]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_189,negated_conjecture,
% 0.21/0.60 ( not(and(a16,a17)) = s1 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_173]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_289,negated_conjecture,
% 0.21/0.60 ( not(and(a16,a17)) = s1 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_189]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_290,plain,
% 0.21/0.60 ( or(not(a16),not(a17)) = s1 ),
% 0.21/0.60 inference(rewriting,[status(thm)],[c_289]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_37,negated_conjecture,
% 0.21/0.60 ( not(and(a11,a15)) = c1 ),
% 0.21/0.60 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_80) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_91,negated_conjecture,
% 0.21/0.60 ( not(and(a11,a15)) = c1 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_37]) ).
% 0.21/0.60
% 0.21/0.60 cnf(c_155,negated_conjecture,
% 0.21/0.60 ( not(and(a11,a15)) = c1 ),
% 0.21/0.60 inference(copy,[status(esa)],[c_91]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_174,negated_conjecture,
% 0.21/0.61 ( not(and(a11,a15)) = c1 ),
% 0.21/0.61 inference(copy,[status(esa)],[c_155]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_188,negated_conjecture,
% 0.21/0.61 ( not(and(a11,a15)) = c1 ),
% 0.21/0.61 inference(copy,[status(esa)],[c_174]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_287,negated_conjecture,
% 0.21/0.61 ( not(and(a11,a15)) = c1 ),
% 0.21/0.61 inference(copy,[status(esa)],[c_188]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_288,plain,
% 0.21/0.61 ( or(not(a11),not(a15)) = c1 ),
% 0.21/0.61 inference(rewriting,[status(thm)],[c_287]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_32,negated_conjecture,
% 0.21/0.61 ( xor(xor(X0,X1),X2) = sum(X0,X1,X2) ),
% 0.21/0.61 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_75) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_81,negated_conjecture,
% 0.21/0.61 ( xor(xor(X0,X1),X2) = sum(X0,X1,X2) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_32]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_150,negated_conjecture,
% 0.21/0.61 ( xor(xor(X0,X1),X2) = sum(X0,X1,X2) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_81]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_179,negated_conjecture,
% 0.21/0.61 ( xor(xor(X0,X1),X2) = sum(X0,X1,X2) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_150]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_183,negated_conjecture,
% 0.21/0.61 ( xor(xor(X0,X1),X2) = sum(X0,X1,X2) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_179]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_277,negated_conjecture,
% 0.21/0.61 ( xor(xor(X0,X1),X2) = sum(X0,X1,X2) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_183]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_278,plain,
% 0.21/0.61 ( or(and(or(and(X0,not(X1)),and(X1,not(X0))),not(X2)),and(X2,and(or(not(X0),X1),or(not(X1),X0)))) = sum(X0,X1,X2) ),
% 0.21/0.61 inference(rewriting,[status(thm)],[c_277]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_46,negated_conjecture,
% 0.21/0.61 ( circuit(s1,c1) ),
% 0.21/0.61 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_89) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_109,negated_conjecture,
% 0.21/0.61 ( circuit(s1,c1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_46]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_164,negated_conjecture,
% 0.21/0.61 ( circuit(s1,c1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_109]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_165,negated_conjecture,
% 0.21/0.61 ( circuit(s1,c1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_164]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_197,negated_conjecture,
% 0.21/0.61 ( circuit(s1,c1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_165]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_305,negated_conjecture,
% 0.21/0.61 ( circuit(s1,c1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_197]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_36,negated_conjecture,
% 0.21/0.61 ( and(X0,X1) = and(X1,X0) ),
% 0.21/0.61 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_79) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_89,negated_conjecture,
% 0.21/0.61 ( and(X0,X1) = and(X1,X0) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_36]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_154,negated_conjecture,
% 0.21/0.61 ( and(X0,X1) = and(X1,X0) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_89]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_175,negated_conjecture,
% 0.21/0.61 ( and(X0,X1) = and(X1,X0) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_154]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_187,negated_conjecture,
% 0.21/0.61 ( and(X0,X1) = and(X1,X0) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_175]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_285,negated_conjecture,
% 0.21/0.61 ( and(X0,X1) = and(X1,X0) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_187]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_35,negated_conjecture,
% 0.21/0.61 ( or(X0,X1) = or(X1,X0) ),
% 0.21/0.61 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_78) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_87,negated_conjecture,
% 0.21/0.61 ( or(X0,X1) = or(X1,X0) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_35]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_153,negated_conjecture,
% 0.21/0.61 ( or(X0,X1) = or(X1,X0) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_87]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_176,negated_conjecture,
% 0.21/0.61 ( or(X0,X1) = or(X1,X0) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_153]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_186,negated_conjecture,
% 0.21/0.61 ( or(X0,X1) = or(X1,X0) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_176]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_283,negated_conjecture,
% 0.21/0.61 ( or(X0,X1) = or(X1,X0) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_186]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_34,negated_conjecture,
% 0.21/0.61 ( and(and(X0,X1),X2) = and(and(X0,X2),X1) ),
% 0.21/0.61 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_77) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_85,negated_conjecture,
% 0.21/0.61 ( and(and(X0,X1),X2) = and(and(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_34]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_152,negated_conjecture,
% 0.21/0.61 ( and(and(X0,X1),X2) = and(and(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_85]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_177,negated_conjecture,
% 0.21/0.61 ( and(and(X0,X1),X2) = and(and(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_152]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_185,negated_conjecture,
% 0.21/0.61 ( and(and(X0,X1),X2) = and(and(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_177]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_281,negated_conjecture,
% 0.21/0.61 ( and(and(X0,X1),X2) = and(and(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_185]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_33,negated_conjecture,
% 0.21/0.61 ( or(or(X0,X1),X2) = or(or(X0,X2),X1) ),
% 0.21/0.61 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_76) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_83,negated_conjecture,
% 0.21/0.61 ( or(or(X0,X1),X2) = or(or(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_33]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_151,negated_conjecture,
% 0.21/0.61 ( or(or(X0,X1),X2) = or(or(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_83]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_178,negated_conjecture,
% 0.21/0.61 ( or(or(X0,X1),X2) = or(or(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_151]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_184,negated_conjecture,
% 0.21/0.61 ( or(or(X0,X1),X2) = or(or(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_178]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_279,negated_conjecture,
% 0.21/0.61 ( or(or(X0,X1),X2) = or(or(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_184]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_31,negated_conjecture,
% 0.21/0.61 ( or(and(X0,X1),and(X2,X1)) = and(or(X0,X2),X1) ),
% 0.21/0.61 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_74) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_79,negated_conjecture,
% 0.21/0.61 ( or(and(X0,X1),and(X2,X1)) = and(or(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_31]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_149,negated_conjecture,
% 0.21/0.61 ( or(and(X0,X1),and(X2,X1)) = and(or(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_79]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_180,negated_conjecture,
% 0.21/0.61 ( or(and(X0,X1),and(X2,X1)) = and(or(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_149]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_200,negated_conjecture,
% 0.21/0.61 ( or(and(X0,X1),and(X2,X1)) = and(or(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_180]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_311,negated_conjecture,
% 0.21/0.61 ( or(and(X0,X1),and(X2,X1)) = and(or(X0,X2),X1) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_200]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_30,negated_conjecture,
% 0.21/0.61 ( or(and(X0,or(X1,X2)),and(not(X0),and(X1,X2))) = carryout(X0,X1,X2) ),
% 0.21/0.61 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_73) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_77,negated_conjecture,
% 0.21/0.61 ( or(and(X0,or(X1,X2)),and(not(X0),and(X1,X2))) = carryout(X0,X1,X2) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_30]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_148,negated_conjecture,
% 0.21/0.61 ( or(and(X0,or(X1,X2)),and(not(X0),and(X1,X2))) = carryout(X0,X1,X2) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_77]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_181,negated_conjecture,
% 0.21/0.61 ( or(and(X0,or(X1,X2)),and(not(X0),and(X1,X2))) = carryout(X0,X1,X2) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_148]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_199,negated_conjecture,
% 0.21/0.61 ( or(and(X0,or(X1,X2)),and(not(X0),and(X1,X2))) = carryout(X0,X1,X2) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_181]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_309,negated_conjecture,
% 0.21/0.61 ( or(and(X0,or(X1,X2)),and(not(X0),and(X1,X2))) = carryout(X0,X1,X2) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_199]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_29,negated_conjecture,
% 0.21/0.61 ( ~ circuit(sum(a,b,carryin),carryout(a,b,carryin)) ),
% 0.21/0.61 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_72) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_75,negated_conjecture,
% 0.21/0.61 ( ~ circuit(sum(a,b,carryin),carryout(a,b,carryin)) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_29]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_147,negated_conjecture,
% 0.21/0.61 ( ~ circuit(sum(a,b,carryin),carryout(a,b,carryin)) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_75]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_182,negated_conjecture,
% 0.21/0.61 ( ~ circuit(sum(a,b,carryin),carryout(a,b,carryin)) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_147]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_198,negated_conjecture,
% 0.21/0.61 ( ~ circuit(sum(a,b,carryin),carryout(a,b,carryin)) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_182]) ).
% 0.21/0.61
% 0.21/0.61 cnf(c_307,negated_conjecture,
% 0.21/0.61 ( ~ circuit(sum(a,b,carryin),carryout(a,b,carryin)) ),
% 0.21/0.61 inference(copy,[status(esa)],[c_198]) ).
% 0.21/0.61
% 0.21/0.61
% 0.21/0.61
% 0.21/0.61 % ------ Statistics
% 0.21/0.61
% 0.21/0.61 % ------ General
% 0.21/0.61
% 0.21/0.61 % num_of_input_clauses: 47
% 0.21/0.61 % num_of_input_neg_conjectures: 18
% 0.21/0.61 % num_of_splits: 0
% 0.21/0.61 % num_of_split_atoms: 0
% 0.21/0.61 % num_of_sem_filtered_clauses: 0
% 0.21/0.61 % num_of_subtypes: 0
% 0.21/0.61 % monotx_restored_types: 0
% 0.21/0.61 % sat_num_of_epr_types: 0
% 0.21/0.61 % sat_num_of_non_cyclic_types: 0
% 0.21/0.61 % sat_guarded_non_collapsed_types: 0
% 0.21/0.61 % is_epr: 0
% 0.21/0.61 % is_horn: 1
% 0.21/0.61 % has_eq: 1
% 0.21/0.61 % num_pure_diseq_elim: 0
% 0.21/0.61 % simp_replaced_by: 0
% 0.21/0.61 % res_preprocessed: 36
% 0.21/0.61 % prep_upred: 0
% 0.21/0.61 % prep_unflattend: 0
% 0.21/0.61 % pred_elim_cands: 0
% 0.21/0.61 % pred_elim: 0
% 0.21/0.61 % pred_elim_cl: 0
% 0.21/0.61 % pred_elim_cycles: 0
% 0.21/0.61 % forced_gc_time: 0
% 0.21/0.61 % gc_basic_clause_elim: 0
% 0.21/0.61 % parsing_time: 0.001
% 0.21/0.61 % sem_filter_time: 0.
% 0.21/0.61 % pred_elim_time: 0.
% 0.21/0.61 % out_proof_time: 0.
% 0.21/0.61 % monotx_time: 0.
% 0.21/0.61 % subtype_inf_time: 0.
% 0.21/0.61 % unif_index_cands_time: 0.
% 0.21/0.61 % unif_index_add_time: 0.
% 0.21/0.61 % total_time: 0.189
% 0.21/0.61 % num_of_symbols: 46
% 0.21/0.61 % num_of_terms: 320
% 0.21/0.61
% 0.21/0.61 % ------ Propositional Solver
% 0.21/0.61
% 0.21/0.61 % prop_solver_calls: 1
% 0.21/0.61 % prop_fast_solver_calls: 54
% 0.21/0.61 % prop_num_of_clauses: 75
% 0.21/0.61 % prop_preprocess_simplified: 287
% 0.21/0.61 % prop_fo_subsumed: 0
% 0.21/0.61 % prop_solver_time: 0.
% 0.21/0.61 % prop_fast_solver_time: 0.
% 0.21/0.61 % prop_unsat_core_time: 0.
% 0.21/0.61
% 0.21/0.61 % ------ QBF
% 0.21/0.61
% 0.21/0.61 % qbf_q_res: 0
% 0.21/0.61 % qbf_num_tautologies: 0
% 0.21/0.61 % qbf_prep_cycles: 0
% 0.21/0.61
% 0.21/0.61 % ------ BMC1
% 0.21/0.61
% 0.21/0.61 % bmc1_current_bound: -1
% 0.21/0.61 % bmc1_last_solved_bound: -1
% 0.21/0.61 % bmc1_unsat_core_size: -1
% 0.21/0.61 % bmc1_unsat_core_parents_size: -1
% 0.21/0.61 % bmc1_merge_next_fun: 0
% 0.21/0.61 % bmc1_unsat_core_clauses_time: 0.
% 0.21/0.61
% 0.21/0.61 % ------ Instantiation
% 0.21/0.61
% 0.21/0.61 % inst_num_of_clauses: 47
% 0.21/0.61 % inst_num_in_passive: 0
% 0.21/0.61 % inst_num_in_active: 0
% 0.21/0.61 % inst_num_in_unprocessed: 47
% 0.21/0.61 % inst_num_of_loops: 0
% 0.21/0.61 % inst_num_of_learning_restarts: 0
% 0.21/0.61 % inst_num_moves_active_passive: 0
% 0.21/0.61 % inst_lit_activity: 0
% 0.21/0.61 % inst_lit_activity_moves: 0
% 0.21/0.61 % inst_num_tautologies: 0
% 0.21/0.61 % inst_num_prop_implied: 0
% 0.21/0.61 % inst_num_existing_simplified: 0
% 0.21/0.61 % inst_num_eq_res_simplified: 0
% 0.21/0.61 % inst_num_child_elim: 0
% 0.21/0.61 % inst_num_of_dismatching_blockings: 0
% 0.21/0.61 % inst_num_of_non_proper_insts: 0
% 0.21/0.61 % inst_num_of_duplicates: 0
% 0.21/0.61 % inst_inst_num_from_inst_to_res: 0
% 0.21/0.61 % inst_dismatching_checking_time: 0.
% 0.21/0.61
% 0.21/0.61 % ------ Resolution
% 0.21/0.61
% 0.21/0.61 % res_num_of_clauses: 57
% 0.21/0.61 % res_num_in_passive: 0
% 0.21/0.61 % res_num_in_active: 18
% 0.21/0.61 % res_num_of_loops: 19
% 0.21/0.61 % res_forward_subset_subsumed: 0
% 0.21/0.61 % res_backward_subset_subsumed: 0
% 0.21/0.61 % res_forward_subsumed: 0
% 0.21/0.61 % res_backward_subsumed: 0
% 0.21/0.61 % res_forward_subsumption_resolution: 0
% 0.21/0.61 % res_backward_subsumption_resolution: 0
% 0.21/0.61 % res_clause_to_clause_subsumption: 2
% 0.21/0.61 % res_orphan_elimination: 0
% 0.21/0.61 % res_tautology_del: 0
% 0.21/0.61 % res_num_eq_res_simplified: 0
% 0.21/0.61 % res_num_sel_changes: 0
% 0.21/0.61 % res_moves_from_active_to_pass: 0
% 0.21/0.61
% 0.21/0.61 % Status Unknown
% 0.46/0.65 % Orienting using strategy ClausalAll
% 0.46/0.65 % Orientation found
% 0.46/0.65 % 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_398856.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_6ab909.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_80bd58 | grep -v "SZS"
% 0.46/0.68
% 0.46/0.68 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.46/0.68
% 0.46/0.68 %
% 0.46/0.68 % ------ iProver source info
% 0.46/0.68
% 0.46/0.68 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.46/0.68 % git: non_committed_changes: true
% 0.46/0.68 % git: last_make_outside_of_git: true
% 0.46/0.68
% 0.46/0.68 %
% 0.46/0.68 % ------ Input Options
% 0.46/0.68
% 0.46/0.68 % --out_options all
% 0.46/0.68 % --tptp_safe_out true
% 0.46/0.68 % --problem_path ""
% 0.46/0.68 % --include_path ""
% 0.46/0.68 % --clausifier .//eprover
% 0.46/0.68 % --clausifier_options --tstp-format
% 0.46/0.68 % --stdin false
% 0.46/0.68 % --dbg_backtrace false
% 0.46/0.68 % --dbg_dump_prop_clauses false
% 0.46/0.68 % --dbg_dump_prop_clauses_file -
% 0.46/0.68 % --dbg_out_stat false
% 0.46/0.68
% 0.46/0.68 % ------ General Options
% 0.46/0.68
% 0.46/0.68 % --fof false
% 0.46/0.68 % --time_out_real 150.
% 0.46/0.68 % --time_out_prep_mult 0.2
% 0.46/0.68 % --time_out_virtual -1.
% 0.46/0.68 % --schedule none
% 0.46/0.68 % --ground_splitting input
% 0.46/0.68 % --splitting_nvd 16
% 0.46/0.68 % --non_eq_to_eq false
% 0.46/0.68 % --prep_gs_sim true
% 0.46/0.68 % --prep_unflatten false
% 0.46/0.68 % --prep_res_sim true
% 0.46/0.68 % --prep_upred true
% 0.46/0.68 % --res_sim_input true
% 0.46/0.68 % --clause_weak_htbl true
% 0.46/0.68 % --gc_record_bc_elim false
% 0.46/0.68 % --symbol_type_check false
% 0.46/0.68 % --clausify_out false
% 0.46/0.68 % --large_theory_mode false
% 0.46/0.68 % --prep_sem_filter none
% 0.46/0.68 % --prep_sem_filter_out false
% 0.46/0.68 % --preprocessed_out false
% 0.46/0.68 % --sub_typing false
% 0.46/0.68 % --brand_transform false
% 0.46/0.68 % --pure_diseq_elim true
% 0.46/0.68 % --min_unsat_core false
% 0.46/0.68 % --pred_elim true
% 0.46/0.68 % --add_important_lit false
% 0.46/0.68 % --soft_assumptions false
% 0.46/0.68 % --reset_solvers false
% 0.46/0.68 % --bc_imp_inh []
% 0.46/0.68 % --conj_cone_tolerance 1.5
% 0.46/0.68 % --prolific_symb_bound 500
% 0.46/0.68 % --lt_threshold 2000
% 0.46/0.68
% 0.46/0.68 % ------ SAT Options
% 0.46/0.68
% 0.46/0.68 % --sat_mode false
% 0.46/0.68 % --sat_fm_restart_options ""
% 0.46/0.68 % --sat_gr_def false
% 0.46/0.68 % --sat_epr_types true
% 0.46/0.68 % --sat_non_cyclic_types false
% 0.46/0.68 % --sat_finite_models false
% 0.46/0.68 % --sat_fm_lemmas false
% 0.46/0.68 % --sat_fm_prep false
% 0.46/0.68 % --sat_fm_uc_incr true
% 0.46/0.68 % --sat_out_model small
% 0.46/0.68 % --sat_out_clauses false
% 0.46/0.68
% 0.46/0.68 % ------ QBF Options
% 0.46/0.68
% 0.46/0.68 % --qbf_mode false
% 0.46/0.68 % --qbf_elim_univ true
% 0.46/0.68 % --qbf_sk_in true
% 0.46/0.68 % --qbf_pred_elim true
% 0.46/0.68 % --qbf_split 32
% 0.46/0.68
% 0.46/0.68 % ------ BMC1 Options
% 0.46/0.68
% 0.46/0.68 % --bmc1_incremental false
% 0.46/0.68 % --bmc1_axioms reachable_all
% 0.46/0.68 % --bmc1_min_bound 0
% 0.46/0.68 % --bmc1_max_bound -1
% 0.46/0.68 % --bmc1_max_bound_default -1
% 0.46/0.68 % --bmc1_symbol_reachability true
% 0.46/0.68 % --bmc1_property_lemmas false
% 0.46/0.68 % --bmc1_k_induction false
% 0.46/0.68 % --bmc1_non_equiv_states false
% 0.46/0.68 % --bmc1_deadlock false
% 0.46/0.68 % --bmc1_ucm false
% 0.46/0.68 % --bmc1_add_unsat_core none
% 0.46/0.68 % --bmc1_unsat_core_children false
% 0.46/0.68 % --bmc1_unsat_core_extrapolate_axioms false
% 0.46/0.68 % --bmc1_out_stat full
% 0.46/0.68 % --bmc1_ground_init false
% 0.46/0.68 % --bmc1_pre_inst_next_state false
% 0.46/0.68 % --bmc1_pre_inst_state false
% 0.46/0.68 % --bmc1_pre_inst_reach_state false
% 0.46/0.68 % --bmc1_out_unsat_core false
% 0.46/0.68 % --bmc1_aig_witness_out false
% 0.46/0.68 % --bmc1_verbose false
% 0.46/0.68 % --bmc1_dump_clauses_tptp false
% 0.50/0.92 % --bmc1_dump_unsat_core_tptp false
% 0.50/0.92 % --bmc1_dump_file -
% 0.50/0.92 % --bmc1_ucm_expand_uc_limit 128
% 0.50/0.92 % --bmc1_ucm_n_expand_iterations 6
% 0.50/0.92 % --bmc1_ucm_extend_mode 1
% 0.50/0.92 % --bmc1_ucm_init_mode 2
% 0.50/0.92 % --bmc1_ucm_cone_mode none
% 0.50/0.92 % --bmc1_ucm_reduced_relation_type 0
% 0.50/0.92 % --bmc1_ucm_relax_model 4
% 0.50/0.92 % --bmc1_ucm_full_tr_after_sat true
% 0.50/0.92 % --bmc1_ucm_expand_neg_assumptions false
% 0.50/0.92 % --bmc1_ucm_layered_model none
% 0.50/0.92 % --bmc1_ucm_max_lemma_size 10
% 0.50/0.92
% 0.50/0.92 % ------ AIG Options
% 0.50/0.92
% 0.50/0.92 % --aig_mode false
% 0.50/0.92
% 0.50/0.92 % ------ Instantiation Options
% 0.50/0.92
% 0.50/0.92 % --instantiation_flag true
% 0.50/0.92 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.50/0.92 % --inst_solver_per_active 750
% 0.50/0.92 % --inst_solver_calls_frac 0.5
% 0.50/0.92 % --inst_passive_queue_type priority_queues
% 0.50/0.92 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.50/0.92 % --inst_passive_queues_freq [25;2]
% 0.50/0.92 % --inst_dismatching true
% 0.50/0.92 % --inst_eager_unprocessed_to_passive true
% 0.50/0.92 % --inst_prop_sim_given true
% 0.50/0.92 % --inst_prop_sim_new false
% 0.50/0.92 % --inst_orphan_elimination true
% 0.50/0.92 % --inst_learning_loop_flag true
% 0.50/0.92 % --inst_learning_start 3000
% 0.50/0.92 % --inst_learning_factor 2
% 0.50/0.92 % --inst_start_prop_sim_after_learn 3
% 0.50/0.92 % --inst_sel_renew solver
% 0.50/0.92 % --inst_lit_activity_flag true
% 0.50/0.92 % --inst_out_proof true
% 0.50/0.92
% 0.50/0.92 % ------ Resolution Options
% 0.50/0.92
% 0.50/0.92 % --resolution_flag true
% 0.50/0.92 % --res_lit_sel kbo_max
% 0.50/0.92 % --res_to_prop_solver none
% 0.50/0.92 % --res_prop_simpl_new false
% 0.50/0.92 % --res_prop_simpl_given false
% 0.50/0.92 % --res_passive_queue_type priority_queues
% 0.50/0.92 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.50/0.92 % --res_passive_queues_freq [15;5]
% 0.50/0.92 % --res_forward_subs full
% 0.50/0.92 % --res_backward_subs full
% 0.50/0.92 % --res_forward_subs_resolution true
% 0.50/0.92 % --res_backward_subs_resolution true
% 0.50/0.92 % --res_orphan_elimination false
% 0.50/0.92 % --res_time_limit 1000.
% 0.50/0.92 % --res_out_proof true
% 0.50/0.92 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_398856.s
% 0.50/0.92 % --modulo true
% 0.50/0.92
% 0.50/0.92 % ------ Combination Options
% 0.50/0.92
% 0.50/0.92 % --comb_res_mult 1000
% 0.50/0.92 % --comb_inst_mult 300
% 0.50/0.92 % ------
% 0.50/0.92
% 0.50/0.92 % ------ Parsing...% successful
% 0.50/0.92
% 0.50/0.92 % ------ 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.50/0.92
% 0.50/0.92 % ------ Proving...
% 0.50/0.92 % ------ Problem Properties
% 0.50/0.92
% 0.50/0.92 %
% 0.50/0.92 % EPR false
% 0.50/0.92 % Horn true
% 0.50/0.92 % Has equality true
% 0.50/0.92
% 0.50/0.92 % % ------ Input Options Time Limit: Unbounded
% 0.50/0.92
% 0.50/0.92
% 0.50/0.92 Compiling...
% 0.50/0.92 Loading plugin: done.
% 0.50/0.92 % % ------ Current options:
% 0.50/0.92
% 0.50/0.92 % ------ Input Options
% 0.50/0.92
% 0.50/0.92 % --out_options all
% 0.50/0.92 % --tptp_safe_out true
% 0.50/0.92 % --problem_path ""
% 0.50/0.92 % --include_path ""
% 0.50/0.92 % --clausifier .//eprover
% 0.50/0.92 % --clausifier_options --tstp-format
% 0.50/0.92 % --stdin false
% 0.50/0.92 % --dbg_backtrace false
% 0.50/0.92 % --dbg_dump_prop_clauses false
% 0.50/0.92 % --dbg_dump_prop_clauses_file -
% 0.50/0.92 % --dbg_out_stat false
% 0.50/0.92
% 0.50/0.92 % ------ General Options
% 0.50/0.92
% 0.50/0.92 % --fof false
% 0.50/0.92 % --time_out_real 150.
% 0.50/0.92 % --time_out_prep_mult 0.2
% 0.50/0.92 % --time_out_virtual -1.
% 0.50/0.92 % --schedule none
% 0.50/0.92 % --ground_splitting input
% 0.50/0.92 % --splitting_nvd 16
% 0.50/0.92 % --non_eq_to_eq false
% 0.50/0.92 % --prep_gs_sim true
% 0.50/0.92 % --prep_unflatten false
% 0.50/0.92 % --prep_res_sim true
% 0.50/0.92 % --prep_upred true
% 0.50/0.92 % --res_sim_input true
% 0.50/0.92 % --clause_weak_htbl true
% 0.50/0.92 % --gc_record_bc_elim false
% 0.50/0.92 % --symbol_type_check false
% 0.50/0.92 % --clausify_out false
% 0.50/0.92 % --large_theory_mode false
% 0.50/0.92 % --prep_sem_filter none
% 0.50/0.92 % --prep_sem_filter_out false
% 0.50/0.92 % --preprocessed_out false
% 0.50/0.92 % --sub_typing false
% 0.50/0.92 % --brand_transform false
% 0.50/0.92 % --pure_diseq_elim true
% 0.50/0.92 % --min_unsat_core false
% 0.50/0.92 % --pred_elim true
% 0.50/0.92 % --add_important_lit false
% 0.50/0.92 % --soft_assumptions false
% 0.50/0.92 % --reset_solvers false
% 0.50/0.92 % --bc_imp_inh []
% 0.50/0.92 % --conj_cone_tolerance 1.5
% 0.50/0.92 % --prolific_symb_bound 500
% 0.50/0.92 % --lt_threshold 2000
% 0.50/0.92
% 0.50/0.92 % ------ SAT Options
% 0.50/0.92
% 0.50/0.92 % --sat_mode false
% 0.50/0.92 % --sat_fm_restart_options ""
% 0.50/0.92 % --sat_gr_def false
% 0.50/0.92 % --sat_epr_types true
% 0.50/0.92 % --sat_non_cyclic_types false
% 0.50/0.92 % --sat_finite_models false
% 0.50/0.92 % --sat_fm_lemmas false
% 0.50/0.92 % --sat_fm_prep false
% 0.50/0.92 % --sat_fm_uc_incr true
% 0.50/0.92 % --sat_out_model small
% 0.50/0.92 % --sat_out_clauses false
% 0.50/0.92
% 0.50/0.92 % ------ QBF Options
% 0.50/0.92
% 0.50/0.92 % --qbf_mode false
% 0.50/0.92 % --qbf_elim_univ true
% 0.50/0.92 % --qbf_sk_in true
% 0.50/0.92 % --qbf_pred_elim true
% 0.50/0.92 % --qbf_split 32
% 0.50/0.92
% 0.50/0.92 % ------ BMC1 Options
% 0.50/0.92
% 0.50/0.92 % --bmc1_incremental false
% 0.50/0.92 % --bmc1_axioms reachable_all
% 0.50/0.92 % --bmc1_min_bound 0
% 0.50/0.92 % --bmc1_max_bound -1
% 0.50/0.92 % --bmc1_max_bound_default -1
% 0.50/0.92 % --bmc1_symbol_reachability true
% 0.50/0.92 % --bmc1_property_lemmas false
% 0.50/0.92 % --bmc1_k_induction false
% 0.50/0.92 % --bmc1_non_equiv_states false
% 0.50/0.92 % --bmc1_deadlock false
% 0.50/0.92 % --bmc1_ucm false
% 0.50/0.92 % --bmc1_add_unsat_core none
% 0.50/0.92 % --bmc1_unsat_core_children false
% 0.50/0.92 % --bmc1_unsat_core_extrapolate_axioms false
% 0.50/0.92 % --bmc1_out_stat full
% 0.50/0.92 % --bmc1_ground_init false
% 0.50/0.92 % --bmc1_pre_inst_next_state false
% 0.50/0.92 % --bmc1_pre_inst_state false
% 0.50/0.92 % --bmc1_pre_inst_reach_state false
% 0.50/0.92 % --bmc1_out_unsat_core false
% 0.50/0.92 % --bmc1_aig_witness_out false
% 0.50/0.92 % --bmc1_verbose false
% 0.50/0.92 % --bmc1_dump_clauses_tptp false
% 0.50/0.92 % --bmc1_dump_unsat_core_tptp false
% 0.50/0.92 % --bmc1_dump_file -
% 0.50/0.92 % --bmc1_ucm_expand_uc_limit 128
% 0.50/0.92 % --bmc1_ucm_n_expand_iterations 6
% 0.50/0.92 % --bmc1_ucm_extend_mode 1
% 0.50/0.92 % --bmc1_ucm_init_mode 2
% 0.50/0.92 % --bmc1_ucm_cone_mode none
% 0.50/0.92 % --bmc1_ucm_reduced_relation_type 0
% 0.50/0.92 % --bmc1_ucm_relax_model 4
% 0.50/0.92 % --bmc1_ucm_full_tr_after_sat true
% 0.50/0.92 % --bmc1_ucm_expand_neg_assumptions false
% 0.50/0.92 % --bmc1_ucm_layered_model none
% 0.50/0.92 % --bmc1_ucm_max_lemma_size 10
% 0.50/0.92
% 0.50/0.92 % ------ AIG Options
% 0.50/0.92
% 0.50/0.92 % --aig_mode false
% 0.50/0.92
% 0.50/0.92 % ------ Instantiation Options
% 0.50/0.92
% 0.50/0.92 % --instantiation_flag true
% 0.50/0.92 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.50/0.92 % --inst_solver_per_active 750
% 0.50/0.92 % --inst_solver_calls_frac 0.5
% 0.50/0.92 % --inst_passive_queue_type priority_queues
% 0.50/0.92 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.50/0.92 % --inst_passive_queues_freq [25;2]
% 0.50/0.92 % --inst_dismatching true
% 0.50/0.92 % --inst_eager_unprocessed_to_passive true
% 0.50/0.92 % --inst_prop_sim_given true
% 0.50/0.92 % --inst_prop_sim_new false
% 0.50/0.92 % --inst_orphan_elimination true
% 0.50/0.92 % --inst_learning_loop_flag true
% 0.50/0.92 % --inst_learning_start 3000
% 0.50/0.92 % --inst_learning_factor 2
% 0.50/0.92 % --inst_start_prop_sim_after_learn 3
% 0.50/0.92 % --inst_sel_renew solver
% 0.50/0.92 % --inst_lit_activity_flag true
% 0.50/0.92 % --inst_out_proof true
% 0.50/0.92
% 0.50/0.92 % ------ Resolution Options
% 0.50/0.92
% 0.50/0.92 % --resolution_flag true
% 0.50/0.92 % --res_lit_sel kbo_max
% 0.50/0.92 % --res_to_prop_solver none
% 0.50/0.92 % --res_prop_simpl_new false
% 0.50/0.92 % --res_prop_simpl_given false
% 0.50/0.92 % --res_passive_queue_type priority_queues
% 0.50/0.92 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.50/0.92 % --res_passive_queues_freq [15;5]
% 0.50/0.92 % --res_forward_subs full
% 0.50/0.92 % --res_backward_subs full
% 0.50/0.92 % --res_forward_subs_resolution true
% 0.50/0.92 % --res_backward_subs_resolution true
% 0.50/0.92 % --res_orphan_elimination false
% 0.50/0.92 % --res_time_limit 1000.
% 0.50/0.92 % --res_out_proof true
% 0.50/0.92 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_398856.s
% 0.50/0.92 % --modulo true
% 0.50/0.92
% 0.50/0.92 % ------ Combination Options
% 0.50/0.92
% 0.50/0.92 % --comb_res_mult 1000
% 0.50/0.92 % --comb_inst_mult 300
% 0.50/0.92 % ------
% 0.50/0.92
% 0.50/0.92
% 0.50/0.92
% 0.50/0.92 % ------ Proving...
% 0.50/0.92 % warning: shown sat in sat incomplete mode
% 0.50/0.92 %
% 0.50/0.92
% 0.50/0.92
% 0.50/0.92
% 0.50/0.92
% 0.50/0.92 cnf(c_45,negated_conjecture,
% 0.50/0.92 ( not(and(a,b)) = a11 ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_88) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_107,negated_conjecture,
% 0.50/0.92 ( not(and(a,b)) = a11 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_45]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_163,negated_conjecture,
% 0.50/0.92 ( not(and(a,b)) = a11 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_107]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_166,negated_conjecture,
% 0.50/0.92 ( not(and(a,b)) = a11 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_163]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_196,negated_conjecture,
% 0.50/0.92 ( not(and(a,b)) = a11 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_166]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_303,negated_conjecture,
% 0.50/0.92 ( not(and(a,b)) = a11 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_196]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_304,plain,
% 0.50/0.92 ( or(not(a),not(b)) = a11 ),
% 0.50/0.92 inference(rewriting,[status(thm)],[c_303]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_44,negated_conjecture,
% 0.50/0.92 ( not(and(a11,a)) = a12 ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_87) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_105,negated_conjecture,
% 0.50/0.92 ( not(and(a11,a)) = a12 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_44]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_162,negated_conjecture,
% 0.50/0.92 ( not(and(a11,a)) = a12 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_105]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_167,negated_conjecture,
% 0.50/0.92 ( not(and(a11,a)) = a12 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_162]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_195,negated_conjecture,
% 0.50/0.92 ( not(and(a11,a)) = a12 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_167]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_301,negated_conjecture,
% 0.50/0.92 ( not(and(a11,a)) = a12 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_195]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_302,plain,
% 0.50/0.92 ( or(not(a11),not(a)) = a12 ),
% 0.50/0.92 inference(rewriting,[status(thm)],[c_301]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_43,negated_conjecture,
% 0.50/0.92 ( not(and(a11,b)) = a13 ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_86) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_103,negated_conjecture,
% 0.50/0.92 ( not(and(a11,b)) = a13 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_43]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_161,negated_conjecture,
% 0.50/0.92 ( not(and(a11,b)) = a13 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_103]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_168,negated_conjecture,
% 0.50/0.92 ( not(and(a11,b)) = a13 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_161]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_194,negated_conjecture,
% 0.50/0.92 ( not(and(a11,b)) = a13 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_168]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_299,negated_conjecture,
% 0.50/0.92 ( not(and(a11,b)) = a13 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_194]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_300,plain,
% 0.50/0.92 ( or(not(a11),not(b)) = a13 ),
% 0.50/0.92 inference(rewriting,[status(thm)],[c_299]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_42,negated_conjecture,
% 0.50/0.92 ( not(and(a12,a13)) = a14 ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_85) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_101,negated_conjecture,
% 0.50/0.92 ( not(and(a12,a13)) = a14 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_42]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_160,negated_conjecture,
% 0.50/0.92 ( not(and(a12,a13)) = a14 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_101]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_169,negated_conjecture,
% 0.50/0.92 ( not(and(a12,a13)) = a14 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_160]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_193,negated_conjecture,
% 0.50/0.92 ( not(and(a12,a13)) = a14 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_169]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_297,negated_conjecture,
% 0.50/0.92 ( not(and(a12,a13)) = a14 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_193]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_298,plain,
% 0.50/0.92 ( or(not(a12),not(a13)) = a14 ),
% 0.50/0.92 inference(rewriting,[status(thm)],[c_297]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_41,negated_conjecture,
% 0.50/0.92 ( not(and(a14,carryin)) = a15 ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_84) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_99,negated_conjecture,
% 0.50/0.92 ( not(and(a14,carryin)) = a15 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_41]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_159,negated_conjecture,
% 0.50/0.92 ( not(and(a14,carryin)) = a15 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_99]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_170,negated_conjecture,
% 0.50/0.92 ( not(and(a14,carryin)) = a15 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_159]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_192,negated_conjecture,
% 0.50/0.92 ( not(and(a14,carryin)) = a15 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_170]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_295,negated_conjecture,
% 0.50/0.92 ( not(and(a14,carryin)) = a15 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_192]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_296,plain,
% 0.50/0.92 ( or(not(a14),not(carryin)) = a15 ),
% 0.50/0.92 inference(rewriting,[status(thm)],[c_295]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_40,negated_conjecture,
% 0.50/0.92 ( not(and(a14,a15)) = a16 ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_83) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_97,negated_conjecture,
% 0.50/0.92 ( not(and(a14,a15)) = a16 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_40]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_158,negated_conjecture,
% 0.50/0.92 ( not(and(a14,a15)) = a16 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_97]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_171,negated_conjecture,
% 0.50/0.92 ( not(and(a14,a15)) = a16 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_158]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_191,negated_conjecture,
% 0.50/0.92 ( not(and(a14,a15)) = a16 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_171]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_293,negated_conjecture,
% 0.50/0.92 ( not(and(a14,a15)) = a16 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_191]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_294,plain,
% 0.50/0.92 ( or(not(a14),not(a15)) = a16 ),
% 0.50/0.92 inference(rewriting,[status(thm)],[c_293]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_39,negated_conjecture,
% 0.50/0.92 ( not(and(a15,carryin)) = a17 ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_82) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_95,negated_conjecture,
% 0.50/0.92 ( not(and(a15,carryin)) = a17 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_39]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_157,negated_conjecture,
% 0.50/0.92 ( not(and(a15,carryin)) = a17 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_95]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_172,negated_conjecture,
% 0.50/0.92 ( not(and(a15,carryin)) = a17 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_157]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_190,negated_conjecture,
% 0.50/0.92 ( not(and(a15,carryin)) = a17 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_172]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_291,negated_conjecture,
% 0.50/0.92 ( not(and(a15,carryin)) = a17 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_190]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_292,plain,
% 0.50/0.92 ( or(not(a15),not(carryin)) = a17 ),
% 0.50/0.92 inference(rewriting,[status(thm)],[c_291]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_38,negated_conjecture,
% 0.50/0.92 ( not(and(a16,a17)) = s1 ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_81) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_93,negated_conjecture,
% 0.50/0.92 ( not(and(a16,a17)) = s1 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_38]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_156,negated_conjecture,
% 0.50/0.92 ( not(and(a16,a17)) = s1 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_93]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_173,negated_conjecture,
% 0.50/0.92 ( not(and(a16,a17)) = s1 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_156]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_189,negated_conjecture,
% 0.50/0.92 ( not(and(a16,a17)) = s1 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_173]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_289,negated_conjecture,
% 0.50/0.92 ( not(and(a16,a17)) = s1 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_189]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_290,plain,
% 0.50/0.92 ( or(not(a16),not(a17)) = s1 ),
% 0.50/0.92 inference(rewriting,[status(thm)],[c_289]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_37,negated_conjecture,
% 0.50/0.92 ( not(and(a11,a15)) = c1 ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_80) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_91,negated_conjecture,
% 0.50/0.92 ( not(and(a11,a15)) = c1 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_37]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_155,negated_conjecture,
% 0.50/0.92 ( not(and(a11,a15)) = c1 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_91]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_174,negated_conjecture,
% 0.50/0.92 ( not(and(a11,a15)) = c1 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_155]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_188,negated_conjecture,
% 0.50/0.92 ( not(and(a11,a15)) = c1 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_174]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_287,negated_conjecture,
% 0.50/0.92 ( not(and(a11,a15)) = c1 ),
% 0.50/0.92 inference(copy,[status(esa)],[c_188]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_288,plain,
% 0.50/0.92 ( or(not(a11),not(a15)) = c1 ),
% 0.50/0.92 inference(rewriting,[status(thm)],[c_287]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_46,negated_conjecture,
% 0.50/0.92 ( circuit(s1,c1) ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_89) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_109,negated_conjecture,
% 0.50/0.92 ( circuit(s1,c1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_46]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_164,negated_conjecture,
% 0.50/0.92 ( circuit(s1,c1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_109]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_165,negated_conjecture,
% 0.50/0.92 ( circuit(s1,c1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_164]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_197,negated_conjecture,
% 0.50/0.92 ( circuit(s1,c1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_165]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_305,negated_conjecture,
% 0.50/0.92 ( circuit(s1,c1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_197]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_36,negated_conjecture,
% 0.50/0.92 ( and(X0,X1) = and(X1,X0) ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_79) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_89,negated_conjecture,
% 0.50/0.92 ( and(X0,X1) = and(X1,X0) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_36]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_154,negated_conjecture,
% 0.50/0.92 ( and(X0,X1) = and(X1,X0) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_89]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_175,negated_conjecture,
% 0.50/0.92 ( and(X0,X1) = and(X1,X0) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_154]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_187,negated_conjecture,
% 0.50/0.92 ( and(X0,X1) = and(X1,X0) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_175]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_285,negated_conjecture,
% 0.50/0.92 ( and(X0,X1) = and(X1,X0) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_187]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_35,negated_conjecture,
% 0.50/0.92 ( or(X0,X1) = or(X1,X0) ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_78) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_87,negated_conjecture,
% 0.50/0.92 ( or(X0,X1) = or(X1,X0) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_35]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_153,negated_conjecture,
% 0.50/0.92 ( or(X0,X1) = or(X1,X0) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_87]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_176,negated_conjecture,
% 0.50/0.92 ( or(X0,X1) = or(X1,X0) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_153]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_186,negated_conjecture,
% 0.50/0.92 ( or(X0,X1) = or(X1,X0) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_176]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_283,negated_conjecture,
% 0.50/0.92 ( or(X0,X1) = or(X1,X0) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_186]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_34,negated_conjecture,
% 0.50/0.92 ( and(and(X0,X1),X2) = and(and(X0,X2),X1) ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_77) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_85,negated_conjecture,
% 0.50/0.92 ( and(and(X0,X1),X2) = and(and(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_34]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_152,negated_conjecture,
% 0.50/0.92 ( and(and(X0,X1),X2) = and(and(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_85]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_177,negated_conjecture,
% 0.50/0.92 ( and(and(X0,X1),X2) = and(and(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_152]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_185,negated_conjecture,
% 0.50/0.92 ( and(and(X0,X1),X2) = and(and(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_177]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_281,negated_conjecture,
% 0.50/0.92 ( and(and(X0,X1),X2) = and(and(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_185]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_33,negated_conjecture,
% 0.50/0.92 ( or(or(X0,X1),X2) = or(or(X0,X2),X1) ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_76) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_83,negated_conjecture,
% 0.50/0.92 ( or(or(X0,X1),X2) = or(or(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_33]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_151,negated_conjecture,
% 0.50/0.92 ( or(or(X0,X1),X2) = or(or(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_83]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_178,negated_conjecture,
% 0.50/0.92 ( or(or(X0,X1),X2) = or(or(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_151]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_184,negated_conjecture,
% 0.50/0.92 ( or(or(X0,X1),X2) = or(or(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_178]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_279,negated_conjecture,
% 0.50/0.92 ( or(or(X0,X1),X2) = or(or(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_184]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_32,negated_conjecture,
% 0.50/0.92 ( xor(xor(X0,X1),X2) = sum(X0,X1,X2) ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_75) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_81,negated_conjecture,
% 0.50/0.92 ( xor(xor(X0,X1),X2) = sum(X0,X1,X2) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_32]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_150,negated_conjecture,
% 0.50/0.92 ( xor(xor(X0,X1),X2) = sum(X0,X1,X2) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_81]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_179,negated_conjecture,
% 0.50/0.92 ( xor(xor(X0,X1),X2) = sum(X0,X1,X2) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_150]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_183,negated_conjecture,
% 0.50/0.92 ( xor(xor(X0,X1),X2) = sum(X0,X1,X2) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_179]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_277,negated_conjecture,
% 0.50/0.92 ( xor(xor(X0,X1),X2) = sum(X0,X1,X2) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_183]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_31,negated_conjecture,
% 0.50/0.92 ( or(and(X0,X1),and(X2,X1)) = and(or(X0,X2),X1) ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_74) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_79,negated_conjecture,
% 0.50/0.92 ( or(and(X0,X1),and(X2,X1)) = and(or(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_31]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_149,negated_conjecture,
% 0.50/0.92 ( or(and(X0,X1),and(X2,X1)) = and(or(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_79]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_180,negated_conjecture,
% 0.50/0.92 ( or(and(X0,X1),and(X2,X1)) = and(or(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_149]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_200,negated_conjecture,
% 0.50/0.92 ( or(and(X0,X1),and(X2,X1)) = and(or(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_180]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_311,negated_conjecture,
% 0.50/0.92 ( or(and(X0,X1),and(X2,X1)) = and(or(X0,X2),X1) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_200]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_30,negated_conjecture,
% 0.50/0.92 ( or(and(X0,or(X1,X2)),and(not(X0),and(X1,X2))) = carryout(X0,X1,X2) ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_73) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_77,negated_conjecture,
% 0.50/0.92 ( or(and(X0,or(X1,X2)),and(not(X0),and(X1,X2))) = carryout(X0,X1,X2) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_30]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_148,negated_conjecture,
% 0.50/0.92 ( or(and(X0,or(X1,X2)),and(not(X0),and(X1,X2))) = carryout(X0,X1,X2) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_77]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_181,negated_conjecture,
% 0.50/0.92 ( or(and(X0,or(X1,X2)),and(not(X0),and(X1,X2))) = carryout(X0,X1,X2) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_148]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_199,negated_conjecture,
% 0.50/0.92 ( or(and(X0,or(X1,X2)),and(not(X0),and(X1,X2))) = carryout(X0,X1,X2) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_181]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_309,negated_conjecture,
% 0.50/0.92 ( or(and(X0,or(X1,X2)),and(not(X0),and(X1,X2))) = carryout(X0,X1,X2) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_199]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_29,negated_conjecture,
% 0.50/0.92 ( ~ circuit(sum(a,b,carryin),carryout(a,b,carryin)) ),
% 0.50/0.92 file('/export/starexec/sandbox/tmp/iprover_modulo_6ab909.p', c_0_72) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_75,negated_conjecture,
% 0.50/0.92 ( ~ circuit(sum(a,b,carryin),carryout(a,b,carryin)) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_29]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_147,negated_conjecture,
% 0.50/0.92 ( ~ circuit(sum(a,b,carryin),carryout(a,b,carryin)) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_75]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_182,negated_conjecture,
% 0.50/0.92 ( ~ circuit(sum(a,b,carryin),carryout(a,b,carryin)) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_147]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_198,negated_conjecture,
% 0.50/0.92 ( ~ circuit(sum(a,b,carryin),carryout(a,b,carryin)) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_182]) ).
% 0.50/0.92
% 0.50/0.92 cnf(c_307,negated_conjecture,
% 0.50/0.92 ( ~ circuit(sum(a,b,carryin),carryout(a,b,carryin)) ),
% 0.50/0.92 inference(copy,[status(esa)],[c_198]) ).
% 0.50/0.92
% 0.50/0.92
% 0.50/0.92
% 0.50/0.92 % ------ Statistics
% 0.50/0.92
% 0.50/0.92 % ------ General
% 0.50/0.92
% 0.50/0.92 % num_of_input_clauses: 47
% 0.50/0.92 % num_of_input_neg_conjectures: 18
% 0.50/0.92 % num_of_splits: 0
% 0.50/0.92 % num_of_split_atoms: 0
% 0.50/0.92 % num_of_sem_filtered_clauses: 0
% 0.50/0.92 % num_of_subtypes: 0
% 0.50/0.92 % monotx_restored_types: 0
% 0.50/0.92 % sat_num_of_epr_types: 0
% 0.50/0.92 % sat_num_of_non_cyclic_types: 0
% 0.50/0.92 % sat_guarded_non_collapsed_types: 0
% 0.50/0.92 % is_epr: 0
% 0.50/0.92 % is_horn: 1
% 0.50/0.92 % has_eq: 1
% 0.50/0.92 % num_pure_diseq_elim: 0
% 0.50/0.92 % simp_replaced_by: 0
% 0.50/0.92 % res_preprocessed: 36
% 0.50/0.92 % prep_upred: 0
% 0.50/0.92 % prep_unflattend: 0
% 0.50/0.92 % pred_elim_cands: 0
% 0.50/0.92 % pred_elim: 0
% 0.50/0.93 % pred_elim_cl: 0
% 0.50/0.93 % pred_elim_cycles: 0
% 0.50/0.93 % forced_gc_time: 0
% 0.50/0.93 % gc_basic_clause_elim: 0
% 0.50/0.93 % parsing_time: 0.001
% 0.50/0.93 % sem_filter_time: 0.
% 0.50/0.93 % pred_elim_time: 0.
% 0.50/0.93 % out_proof_time: 0.
% 0.50/0.93 % monotx_time: 0.
% 0.50/0.93 % subtype_inf_time: 0.
% 0.50/0.93 % unif_index_cands_time: 0.
% 0.50/0.93 % unif_index_add_time: 0.
% 0.50/0.93 % total_time: 0.266
% 0.50/0.93 % num_of_symbols: 46
% 0.50/0.93 % num_of_terms: 266
% 0.50/0.93
% 0.50/0.93 % ------ Propositional Solver
% 0.50/0.93
% 0.50/0.93 % prop_solver_calls: 1
% 0.50/0.93 % prop_fast_solver_calls: 54
% 0.50/0.93 % prop_num_of_clauses: 75
% 0.50/0.93 % prop_preprocess_simplified: 287
% 0.50/0.93 % prop_fo_subsumed: 0
% 0.50/0.93 % prop_solver_time: 0.
% 0.50/0.93 % prop_fast_solver_time: 0.
% 0.50/0.93 % prop_unsat_core_time: 0.
% 0.50/0.93
% 0.50/0.93 % ------ QBF
% 0.50/0.93
% 0.50/0.93 % qbf_q_res: 0
% 0.50/0.93 % qbf_num_tautologies: 0
% 0.50/0.93 % qbf_prep_cycles: 0
% 0.50/0.93
% 0.50/0.93 % ------ BMC1
% 0.50/0.93
% 0.50/0.93 % bmc1_current_bound: -1
% 0.50/0.93 % bmc1_last_solved_bound: -1
% 0.50/0.93 % bmc1_unsat_core_size: -1
% 0.50/0.93 % bmc1_unsat_core_parents_size: -1
% 0.50/0.93 % bmc1_merge_next_fun: 0
% 0.50/0.93 % bmc1_unsat_core_clauses_time: 0.
% 0.50/0.93
% 0.50/0.93 % ------ Instantiation
% 0.50/0.93
% 0.50/0.93 % inst_num_of_clauses: 47
% 0.50/0.93 % inst_num_in_passive: 0
% 0.50/0.93 % inst_num_in_active: 0
% 0.50/0.93 % inst_num_in_unprocessed: 47
% 0.50/0.93 % inst_num_of_loops: 0
% 0.50/0.93 % inst_num_of_learning_restarts: 0
% 0.50/0.93 % inst_num_moves_active_passive: 0
% 0.50/0.93 % inst_lit_activity: 0
% 0.50/0.93 % inst_lit_activity_moves: 0
% 0.50/0.93 % inst_num_tautologies: 0
% 0.50/0.93 % inst_num_prop_implied: 0
% 0.50/0.93 % inst_num_existing_simplified: 0
% 0.50/0.93 % inst_num_eq_res_simplified: 0
% 0.50/0.93 % inst_num_child_elim: 0
% 0.50/0.93 % inst_num_of_dismatching_blockings: 0
% 0.50/0.93 % inst_num_of_non_proper_insts: 0
% 0.50/0.93 % inst_num_of_duplicates: 0
% 0.50/0.93 % inst_inst_num_from_inst_to_res: 0
% 0.50/0.93 % inst_dismatching_checking_time: 0.
% 0.50/0.93
% 0.50/0.93 % ------ Resolution
% 0.50/0.93
% 0.50/0.93 % res_num_of_clauses: 56
% 0.50/0.93 % res_num_in_passive: 0
% 0.50/0.93 % res_num_in_active: 18
% 0.50/0.93 % res_num_of_loops: 19
% 0.50/0.93 % res_forward_subset_subsumed: 0
% 0.50/0.93 % res_backward_subset_subsumed: 0
% 0.50/0.93 % res_forward_subsumed: 0
% 0.50/0.93 % res_backward_subsumed: 0
% 0.50/0.93 % res_forward_subsumption_resolution: 0
% 0.50/0.93 % res_backward_subsumption_resolution: 0
% 0.50/0.93 % res_clause_to_clause_subsumption: 2
% 0.50/0.93 % res_orphan_elimination: 0
% 0.50/0.93 % res_tautology_del: 0
% 0.50/0.93 % res_num_eq_res_simplified: 0
% 0.50/0.93 % res_num_sel_changes: 0
% 0.50/0.93 % res_moves_from_active_to_pass: 0
% 0.50/0.93
% 0.50/0.93 % Status Unknown
% 0.50/0.93 % Last status :
% 0.50/0.93 % SZS status Unknown
%------------------------------------------------------------------------------