TSTP Solution File: HWV003-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : HWV003-2 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n023.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.61s 1.06s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : HWV003-2 : TPTP v8.1.0. Released v2.7.0.
% 0.11/0.12 % Command : iprover_modulo %s %d
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jun 17 06:34:04 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.13/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.39 % Orientation found
% 0.13/0.39 % 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_41511c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_5dfc3f | grep -v "SZS"
% 0.19/0.41
% 0.19/0.41 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.41
% 0.19/0.41 %
% 0.19/0.41 % ------ iProver source info
% 0.19/0.41
% 0.19/0.41 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.41 % git: non_committed_changes: true
% 0.19/0.41 % git: last_make_outside_of_git: true
% 0.19/0.41
% 0.19/0.41 %
% 0.19/0.41 % ------ Input Options
% 0.19/0.41
% 0.19/0.41 % --out_options all
% 0.19/0.41 % --tptp_safe_out true
% 0.19/0.41 % --problem_path ""
% 0.19/0.41 % --include_path ""
% 0.19/0.41 % --clausifier .//eprover
% 0.19/0.41 % --clausifier_options --tstp-format
% 0.19/0.41 % --stdin false
% 0.19/0.41 % --dbg_backtrace false
% 0.19/0.41 % --dbg_dump_prop_clauses false
% 0.19/0.41 % --dbg_dump_prop_clauses_file -
% 0.19/0.41 % --dbg_out_stat false
% 0.19/0.41
% 0.19/0.41 % ------ General Options
% 0.19/0.41
% 0.19/0.41 % --fof false
% 0.19/0.41 % --time_out_real 150.
% 0.19/0.41 % --time_out_prep_mult 0.2
% 0.19/0.41 % --time_out_virtual -1.
% 0.19/0.41 % --schedule none
% 0.19/0.41 % --ground_splitting input
% 0.19/0.41 % --splitting_nvd 16
% 0.19/0.41 % --non_eq_to_eq false
% 0.19/0.41 % --prep_gs_sim true
% 0.19/0.41 % --prep_unflatten false
% 0.19/0.41 % --prep_res_sim true
% 0.19/0.41 % --prep_upred true
% 0.19/0.41 % --res_sim_input true
% 0.19/0.41 % --clause_weak_htbl true
% 0.19/0.41 % --gc_record_bc_elim false
% 0.19/0.41 % --symbol_type_check false
% 0.19/0.41 % --clausify_out false
% 0.19/0.41 % --large_theory_mode false
% 0.19/0.41 % --prep_sem_filter none
% 0.19/0.41 % --prep_sem_filter_out false
% 0.19/0.41 % --preprocessed_out false
% 0.19/0.41 % --sub_typing false
% 0.19/0.41 % --brand_transform false
% 0.19/0.41 % --pure_diseq_elim true
% 0.19/0.41 % --min_unsat_core false
% 0.19/0.41 % --pred_elim true
% 0.19/0.41 % --add_important_lit false
% 0.19/0.41 % --soft_assumptions false
% 0.19/0.41 % --reset_solvers false
% 0.19/0.41 % --bc_imp_inh []
% 0.19/0.41 % --conj_cone_tolerance 1.5
% 0.19/0.41 % --prolific_symb_bound 500
% 0.19/0.41 % --lt_threshold 2000
% 0.19/0.41
% 0.19/0.41 % ------ SAT Options
% 0.19/0.41
% 0.19/0.41 % --sat_mode false
% 0.19/0.41 % --sat_fm_restart_options ""
% 0.19/0.41 % --sat_gr_def false
% 0.19/0.41 % --sat_epr_types true
% 0.19/0.41 % --sat_non_cyclic_types false
% 0.19/0.41 % --sat_finite_models false
% 0.19/0.41 % --sat_fm_lemmas false
% 0.19/0.41 % --sat_fm_prep false
% 0.19/0.41 % --sat_fm_uc_incr true
% 0.19/0.41 % --sat_out_model small
% 0.19/0.41 % --sat_out_clauses false
% 0.19/0.41
% 0.19/0.41 % ------ QBF Options
% 0.19/0.41
% 0.19/0.41 % --qbf_mode false
% 0.19/0.41 % --qbf_elim_univ true
% 0.19/0.41 % --qbf_sk_in true
% 0.19/0.41 % --qbf_pred_elim true
% 0.19/0.41 % --qbf_split 32
% 0.19/0.41
% 0.19/0.41 % ------ BMC1 Options
% 0.19/0.41
% 0.19/0.41 % --bmc1_incremental false
% 0.19/0.41 % --bmc1_axioms reachable_all
% 0.19/0.41 % --bmc1_min_bound 0
% 0.19/0.41 % --bmc1_max_bound -1
% 0.19/0.41 % --bmc1_max_bound_default -1
% 0.19/0.41 % --bmc1_symbol_reachability true
% 0.19/0.41 % --bmc1_property_lemmas false
% 0.19/0.41 % --bmc1_k_induction false
% 0.19/0.41 % --bmc1_non_equiv_states false
% 0.19/0.41 % --bmc1_deadlock false
% 0.19/0.41 % --bmc1_ucm false
% 0.19/0.41 % --bmc1_add_unsat_core none
% 0.19/0.41 % --bmc1_unsat_core_children false
% 0.19/0.41 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.41 % --bmc1_out_stat full
% 0.19/0.41 % --bmc1_ground_init false
% 0.19/0.41 % --bmc1_pre_inst_next_state false
% 0.19/0.41 % --bmc1_pre_inst_state false
% 0.19/0.41 % --bmc1_pre_inst_reach_state false
% 0.19/0.41 % --bmc1_out_unsat_core false
% 0.19/0.41 % --bmc1_aig_witness_out false
% 0.19/0.41 % --bmc1_verbose false
% 0.19/0.41 % --bmc1_dump_clauses_tptp false
% 0.45/0.75 % --bmc1_dump_unsat_core_tptp false
% 0.45/0.75 % --bmc1_dump_file -
% 0.45/0.75 % --bmc1_ucm_expand_uc_limit 128
% 0.45/0.75 % --bmc1_ucm_n_expand_iterations 6
% 0.45/0.75 % --bmc1_ucm_extend_mode 1
% 0.45/0.75 % --bmc1_ucm_init_mode 2
% 0.45/0.75 % --bmc1_ucm_cone_mode none
% 0.45/0.75 % --bmc1_ucm_reduced_relation_type 0
% 0.45/0.75 % --bmc1_ucm_relax_model 4
% 0.45/0.75 % --bmc1_ucm_full_tr_after_sat true
% 0.45/0.75 % --bmc1_ucm_expand_neg_assumptions false
% 0.45/0.75 % --bmc1_ucm_layered_model none
% 0.45/0.75 % --bmc1_ucm_max_lemma_size 10
% 0.45/0.75
% 0.45/0.75 % ------ AIG Options
% 0.45/0.75
% 0.45/0.75 % --aig_mode false
% 0.45/0.75
% 0.45/0.75 % ------ Instantiation Options
% 0.45/0.75
% 0.45/0.75 % --instantiation_flag true
% 0.45/0.75 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.45/0.75 % --inst_solver_per_active 750
% 0.45/0.75 % --inst_solver_calls_frac 0.5
% 0.45/0.75 % --inst_passive_queue_type priority_queues
% 0.45/0.75 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.45/0.75 % --inst_passive_queues_freq [25;2]
% 0.45/0.75 % --inst_dismatching true
% 0.45/0.75 % --inst_eager_unprocessed_to_passive true
% 0.45/0.75 % --inst_prop_sim_given true
% 0.45/0.75 % --inst_prop_sim_new false
% 0.45/0.75 % --inst_orphan_elimination true
% 0.45/0.75 % --inst_learning_loop_flag true
% 0.45/0.75 % --inst_learning_start 3000
% 0.45/0.75 % --inst_learning_factor 2
% 0.45/0.75 % --inst_start_prop_sim_after_learn 3
% 0.45/0.75 % --inst_sel_renew solver
% 0.45/0.75 % --inst_lit_activity_flag true
% 0.45/0.75 % --inst_out_proof true
% 0.45/0.75
% 0.45/0.75 % ------ Resolution Options
% 0.45/0.75
% 0.45/0.75 % --resolution_flag true
% 0.45/0.75 % --res_lit_sel kbo_max
% 0.45/0.75 % --res_to_prop_solver none
% 0.45/0.75 % --res_prop_simpl_new false
% 0.45/0.75 % --res_prop_simpl_given false
% 0.45/0.75 % --res_passive_queue_type priority_queues
% 0.45/0.75 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.45/0.75 % --res_passive_queues_freq [15;5]
% 0.45/0.75 % --res_forward_subs full
% 0.45/0.75 % --res_backward_subs full
% 0.45/0.75 % --res_forward_subs_resolution true
% 0.45/0.75 % --res_backward_subs_resolution true
% 0.45/0.75 % --res_orphan_elimination false
% 0.45/0.75 % --res_time_limit 1000.
% 0.45/0.75 % --res_out_proof true
% 0.45/0.75 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_41511c.s
% 0.45/0.75 % --modulo true
% 0.45/0.75
% 0.45/0.75 % ------ Combination Options
% 0.45/0.75
% 0.45/0.75 % --comb_res_mult 1000
% 0.45/0.75 % --comb_inst_mult 300
% 0.45/0.75 % ------
% 0.45/0.75
% 0.45/0.75 % ------ Parsing...% successful
% 0.45/0.75
% 0.45/0.75 % ------ 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.45/0.75
% 0.45/0.75 % ------ Proving...
% 0.45/0.75 % ------ Problem Properties
% 0.45/0.75
% 0.45/0.75 %
% 0.45/0.75 % EPR false
% 0.45/0.75 % Horn true
% 0.45/0.75 % Has equality true
% 0.45/0.75
% 0.45/0.75 % % ------ Input Options Time Limit: Unbounded
% 0.45/0.75
% 0.45/0.75
% 0.45/0.75 Compiling...
% 0.45/0.75 Loading plugin: done.
% 0.45/0.75 Compiling...
% 0.45/0.75 Loading plugin: done.
% 0.45/0.75 Compiling...
% 0.45/0.75 Loading plugin: done.
% 0.45/0.75 % % ------ Current options:
% 0.45/0.75
% 0.45/0.75 % ------ Input Options
% 0.45/0.75
% 0.45/0.75 % --out_options all
% 0.45/0.75 % --tptp_safe_out true
% 0.45/0.75 % --problem_path ""
% 0.45/0.75 % --include_path ""
% 0.45/0.75 % --clausifier .//eprover
% 0.45/0.75 % --clausifier_options --tstp-format
% 0.45/0.75 % --stdin false
% 0.45/0.75 % --dbg_backtrace false
% 0.45/0.75 % --dbg_dump_prop_clauses false
% 0.45/0.75 % --dbg_dump_prop_clauses_file -
% 0.45/0.75 % --dbg_out_stat false
% 0.45/0.75
% 0.45/0.75 % ------ General Options
% 0.45/0.75
% 0.45/0.75 % --fof false
% 0.45/0.75 % --time_out_real 150.
% 0.45/0.75 % --time_out_prep_mult 0.2
% 0.45/0.75 % --time_out_virtual -1.
% 0.45/0.75 % --schedule none
% 0.45/0.75 % --ground_splitting input
% 0.45/0.75 % --splitting_nvd 16
% 0.45/0.75 % --non_eq_to_eq false
% 0.45/0.75 % --prep_gs_sim true
% 0.45/0.75 % --prep_unflatten false
% 0.45/0.75 % --prep_res_sim true
% 0.45/0.75 % --prep_upred true
% 0.45/0.75 % --res_sim_input true
% 0.45/0.75 % --clause_weak_htbl true
% 0.45/0.75 % --gc_record_bc_elim false
% 0.45/0.75 % --symbol_type_check false
% 0.45/0.75 % --clausify_out false
% 0.45/0.75 % --large_theory_mode false
% 0.45/0.75 % --prep_sem_filter none
% 0.45/0.75 % --prep_sem_filter_out false
% 0.45/0.75 % --preprocessed_out false
% 0.45/0.75 % --sub_typing false
% 0.45/0.75 % --brand_transform false
% 0.45/0.75 % --pure_diseq_elim true
% 0.45/0.75 % --min_unsat_core false
% 0.45/0.75 % --pred_elim true
% 0.45/0.75 % --add_important_lit false
% 0.45/0.75 % --soft_assumptions false
% 0.45/0.75 % --reset_solvers false
% 0.45/0.75 % --bc_imp_inh []
% 0.45/0.75 % --conj_cone_tolerance 1.5
% 0.45/0.75 % --prolific_symb_bound 500
% 0.45/0.75 % --lt_threshold 2000
% 0.45/0.75
% 0.45/0.75 % ------ SAT Options
% 0.45/0.75
% 0.45/0.75 % --sat_mode false
% 0.45/0.75 % --sat_fm_restart_options ""
% 0.45/0.75 % --sat_gr_def false
% 0.45/0.75 % --sat_epr_types true
% 0.45/0.75 % --sat_non_cyclic_types false
% 0.45/0.75 % --sat_finite_models false
% 0.45/0.75 % --sat_fm_lemmas false
% 0.45/0.75 % --sat_fm_prep false
% 0.45/0.75 % --sat_fm_uc_incr true
% 0.45/0.75 % --sat_out_model small
% 0.45/0.75 % --sat_out_clauses false
% 0.45/0.75
% 0.45/0.75 % ------ QBF Options
% 0.45/0.75
% 0.45/0.75 % --qbf_mode false
% 0.45/0.75 % --qbf_elim_univ true
% 0.45/0.75 % --qbf_sk_in true
% 0.45/0.75 % --qbf_pred_elim true
% 0.45/0.75 % --qbf_split 32
% 0.45/0.75
% 0.45/0.75 % ------ BMC1 Options
% 0.45/0.75
% 0.45/0.75 % --bmc1_incremental false
% 0.45/0.75 % --bmc1_axioms reachable_all
% 0.45/0.75 % --bmc1_min_bound 0
% 0.45/0.75 % --bmc1_max_bound -1
% 0.45/0.75 % --bmc1_max_bound_default -1
% 0.45/0.75 % --bmc1_symbol_reachability true
% 0.45/0.75 % --bmc1_property_lemmas false
% 0.45/0.75 % --bmc1_k_induction false
% 0.45/0.75 % --bmc1_non_equiv_states false
% 0.45/0.75 % --bmc1_deadlock false
% 0.45/0.75 % --bmc1_ucm false
% 0.45/0.75 % --bmc1_add_unsat_core none
% 0.45/0.75 % --bmc1_unsat_core_children false
% 0.45/0.75 % --bmc1_unsat_core_extrapolate_axioms false
% 0.45/0.75 % --bmc1_out_stat full
% 0.45/0.75 % --bmc1_ground_init false
% 0.45/0.75 % --bmc1_pre_inst_next_state false
% 0.45/0.75 % --bmc1_pre_inst_state false
% 0.45/0.75 % --bmc1_pre_inst_reach_state false
% 0.45/0.75 % --bmc1_out_unsat_core false
% 0.45/0.75 % --bmc1_aig_witness_out false
% 0.45/0.75 % --bmc1_verbose false
% 0.45/0.75 % --bmc1_dump_clauses_tptp false
% 0.45/0.75 % --bmc1_dump_unsat_core_tptp false
% 0.45/0.75 % --bmc1_dump_file -
% 0.45/0.75 % --bmc1_ucm_expand_uc_limit 128
% 0.45/0.75 % --bmc1_ucm_n_expand_iterations 6
% 0.45/0.75 % --bmc1_ucm_extend_mode 1
% 0.45/0.75 % --bmc1_ucm_init_mode 2
% 0.45/0.75 % --bmc1_ucm_cone_mode none
% 0.45/0.75 % --bmc1_ucm_reduced_relation_type 0
% 0.45/0.75 % --bmc1_ucm_relax_model 4
% 0.45/0.75 % --bmc1_ucm_full_tr_after_sat true
% 0.45/0.75 % --bmc1_ucm_expand_neg_assumptions false
% 0.45/0.75 % --bmc1_ucm_layered_model none
% 0.45/0.75 % --bmc1_ucm_max_lemma_size 10
% 0.45/0.75
% 0.45/0.75 % ------ AIG Options
% 0.45/0.75
% 0.45/0.75 % --aig_mode false
% 0.45/0.75
% 0.45/0.75 % ------ Instantiation Options
% 0.45/0.75
% 0.45/0.75 % --instantiation_flag true
% 0.45/0.75 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.45/0.75 % --inst_solver_per_active 750
% 0.45/0.75 % --inst_solver_calls_frac 0.5
% 0.45/0.75 % --inst_passive_queue_type priority_queues
% 0.45/0.75 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.45/0.75 % --inst_passive_queues_freq [25;2]
% 0.45/0.75 % --inst_dismatching true
% 0.45/0.75 % --inst_eager_unprocessed_to_passive true
% 0.45/0.75 % --inst_prop_sim_given true
% 0.45/0.75 % --inst_prop_sim_new false
% 0.45/0.75 % --inst_orphan_elimination true
% 0.45/0.75 % --inst_learning_loop_flag true
% 0.45/0.75 % --inst_learning_start 3000
% 0.45/0.75 % --inst_learning_factor 2
% 0.45/0.75 % --inst_start_prop_sim_after_learn 3
% 0.45/0.75 % --inst_sel_renew solver
% 0.45/0.75 % --inst_lit_activity_flag true
% 0.45/0.75 % --inst_out_proof true
% 0.45/0.75
% 0.45/0.75 % ------ Resolution Options
% 0.45/0.75
% 0.45/0.75 % --resolution_flag true
% 0.45/0.75 % --res_lit_sel kbo_max
% 0.45/0.75 % --res_to_prop_solver none
% 0.45/0.75 % --res_prop_simpl_new false
% 0.45/0.75 % --res_prop_simpl_given false
% 0.45/0.75 % --res_passive_queue_type priority_queues
% 0.45/0.75 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.45/0.75 % --res_passive_queues_freq [15;5]
% 0.45/0.75 % --res_forward_subs full
% 0.45/0.75 % --res_backward_subs full
% 0.45/0.75 % --res_forward_subs_resolution true
% 0.45/0.75 % --res_backward_subs_resolution true
% 0.45/0.75 % --res_orphan_elimination false
% 0.45/0.75 % --res_time_limit 1000.
% 0.45/0.75 % --res_out_proof true
% 0.45/0.75 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_41511c.s
% 0.45/0.75 % --modulo true
% 0.45/0.75
% 0.45/0.75 % ------ Combination Options
% 0.45/0.75
% 0.45/0.75 % --comb_res_mult 1000
% 0.45/0.75 % --comb_inst_mult 300
% 0.45/0.75 % ------
% 0.45/0.75
% 0.45/0.75
% 0.45/0.75
% 0.45/0.75 % ------ Proving...
% 0.45/0.75 % warning: shown sat in sat incomplete mode
% 0.45/0.75 %
% 0.45/0.75
% 0.45/0.75
% 0.45/0.75
% 0.45/0.75
% 0.45/0.75 cnf(c_35,negated_conjecture,
% 0.45/0.75 ( not(and(a,b)) = t1 ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_58) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_78,negated_conjecture,
% 0.45/0.75 ( not(and(a,b)) = t1 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_35]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_115,negated_conjecture,
% 0.45/0.75 ( not(and(a,b)) = t1 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_78]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_116,negated_conjecture,
% 0.45/0.75 ( not(and(a,b)) = t1 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_115]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_131,negated_conjecture,
% 0.45/0.75 ( not(and(a,b)) = t1 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_116]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_209,negated_conjecture,
% 0.45/0.75 ( not(and(a,b)) = t1 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_131]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_34,negated_conjecture,
% 0.45/0.75 ( not(and(a,t1)) = t2 ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_57) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_76,negated_conjecture,
% 0.45/0.75 ( not(and(a,t1)) = t2 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_34]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_114,negated_conjecture,
% 0.45/0.75 ( not(and(a,t1)) = t2 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_76]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_117,negated_conjecture,
% 0.45/0.75 ( not(and(a,t1)) = t2 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_114]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_130,negated_conjecture,
% 0.45/0.75 ( not(and(a,t1)) = t2 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_117]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_207,negated_conjecture,
% 0.45/0.75 ( not(and(a,t1)) = t2 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_130]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_33,negated_conjecture,
% 0.45/0.75 ( not(and(b,t1)) = t3 ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_56) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_74,negated_conjecture,
% 0.45/0.75 ( not(and(b,t1)) = t3 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_33]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_113,negated_conjecture,
% 0.45/0.75 ( not(and(b,t1)) = t3 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_74]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_118,negated_conjecture,
% 0.45/0.75 ( not(and(b,t1)) = t3 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_113]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_129,negated_conjecture,
% 0.45/0.75 ( not(and(b,t1)) = t3 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_118]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_205,negated_conjecture,
% 0.45/0.75 ( not(and(b,t1)) = t3 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_129]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_32,negated_conjecture,
% 0.45/0.75 ( not(and(t2,t3)) = t4 ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_55) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_72,negated_conjecture,
% 0.45/0.75 ( not(and(t2,t3)) = t4 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_32]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_112,negated_conjecture,
% 0.45/0.75 ( not(and(t2,t3)) = t4 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_72]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_119,negated_conjecture,
% 0.45/0.75 ( not(and(t2,t3)) = t4 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_112]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_128,negated_conjecture,
% 0.45/0.75 ( not(and(t2,t3)) = t4 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_119]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_203,negated_conjecture,
% 0.45/0.75 ( not(and(t2,t3)) = t4 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_128]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_31,negated_conjecture,
% 0.45/0.75 ( not(and(t4,cin)) = t5 ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_54) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_70,negated_conjecture,
% 0.45/0.75 ( not(and(t4,cin)) = t5 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_31]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_111,negated_conjecture,
% 0.45/0.75 ( not(and(t4,cin)) = t5 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_70]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_120,negated_conjecture,
% 0.45/0.75 ( not(and(t4,cin)) = t5 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_111]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_139,negated_conjecture,
% 0.45/0.75 ( not(and(t4,cin)) = t5 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_120]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_225,negated_conjecture,
% 0.45/0.75 ( not(and(t4,cin)) = t5 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_139]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_30,negated_conjecture,
% 0.45/0.75 ( not(and(t4,t5)) = t6 ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_53) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_68,negated_conjecture,
% 0.45/0.75 ( not(and(t4,t5)) = t6 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_30]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_110,negated_conjecture,
% 0.45/0.75 ( not(and(t4,t5)) = t6 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_68]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_121,negated_conjecture,
% 0.45/0.75 ( not(and(t4,t5)) = t6 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_110]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_138,negated_conjecture,
% 0.45/0.75 ( not(and(t4,t5)) = t6 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_121]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_223,negated_conjecture,
% 0.45/0.75 ( not(and(t4,t5)) = t6 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_138]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_29,negated_conjecture,
% 0.45/0.75 ( not(and(t5,cin)) = t7 ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_52) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_66,negated_conjecture,
% 0.45/0.75 ( not(and(t5,cin)) = t7 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_29]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_109,negated_conjecture,
% 0.45/0.75 ( not(and(t5,cin)) = t7 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_66]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_122,negated_conjecture,
% 0.45/0.75 ( not(and(t5,cin)) = t7 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_109]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_137,negated_conjecture,
% 0.45/0.75 ( not(and(t5,cin)) = t7 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_122]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_221,negated_conjecture,
% 0.45/0.75 ( not(and(t5,cin)) = t7 ),
% 0.45/0.75 inference(copy,[status(esa)],[c_137]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_28,negated_conjecture,
% 0.45/0.75 ( not(and(t6,t7)) = sum ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_51) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_64,negated_conjecture,
% 0.45/0.75 ( not(and(t6,t7)) = sum ),
% 0.45/0.75 inference(copy,[status(esa)],[c_28]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_108,negated_conjecture,
% 0.45/0.75 ( not(and(t6,t7)) = sum ),
% 0.45/0.75 inference(copy,[status(esa)],[c_64]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_123,negated_conjecture,
% 0.45/0.75 ( not(and(t6,t7)) = sum ),
% 0.45/0.75 inference(copy,[status(esa)],[c_108]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_136,negated_conjecture,
% 0.45/0.75 ( not(and(t6,t7)) = sum ),
% 0.45/0.75 inference(copy,[status(esa)],[c_123]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_219,negated_conjecture,
% 0.45/0.75 ( not(and(t6,t7)) = sum ),
% 0.45/0.75 inference(copy,[status(esa)],[c_136]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_27,negated_conjecture,
% 0.45/0.75 ( not(and(t1,t5)) = carry ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_50) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_62,negated_conjecture,
% 0.45/0.75 ( not(and(t1,t5)) = carry ),
% 0.45/0.75 inference(copy,[status(esa)],[c_27]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_107,negated_conjecture,
% 0.45/0.75 ( not(and(t1,t5)) = carry ),
% 0.45/0.75 inference(copy,[status(esa)],[c_62]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_124,negated_conjecture,
% 0.45/0.75 ( not(and(t1,t5)) = carry ),
% 0.45/0.75 inference(copy,[status(esa)],[c_107]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_135,negated_conjecture,
% 0.45/0.75 ( not(and(t1,t5)) = carry ),
% 0.45/0.75 inference(copy,[status(esa)],[c_124]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_217,negated_conjecture,
% 0.45/0.75 ( not(and(t1,t5)) = carry ),
% 0.45/0.75 inference(copy,[status(esa)],[c_135]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_26,negated_conjecture,
% 0.45/0.75 ( xor(xor(a,b),cin) = sum_def ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_49) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_60,negated_conjecture,
% 0.45/0.75 ( xor(xor(a,b),cin) = sum_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_26]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_106,negated_conjecture,
% 0.45/0.75 ( xor(xor(a,b),cin) = sum_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_60]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_125,negated_conjecture,
% 0.45/0.75 ( xor(xor(a,b),cin) = sum_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_106]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_134,negated_conjecture,
% 0.45/0.75 ( xor(xor(a,b),cin) = sum_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_125]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_215,negated_conjecture,
% 0.45/0.75 ( xor(xor(a,b),cin) = sum_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_134]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_25,negated_conjecture,
% 0.45/0.75 ( or(and(cin,or(a,b)),and(not(cin),and(a,b))) = carry_def ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_48) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_58,negated_conjecture,
% 0.45/0.75 ( or(and(cin,or(a,b)),and(not(cin),and(a,b))) = carry_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_25]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_105,negated_conjecture,
% 0.45/0.75 ( or(and(cin,or(a,b)),and(not(cin),and(a,b))) = carry_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_58]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_126,negated_conjecture,
% 0.45/0.75 ( or(and(cin,or(a,b)),and(not(cin),and(a,b))) = carry_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_105]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_133,negated_conjecture,
% 0.45/0.75 ( or(and(cin,or(a,b)),and(not(cin),and(a,b))) = carry_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_126]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_213,negated_conjecture,
% 0.45/0.75 ( or(and(cin,or(a,b)),and(not(cin),and(a,b))) = carry_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_133]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_24,negated_conjecture,
% 0.45/0.75 ( carry != carry_def | sum != sum_def ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_59) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_56,negated_conjecture,
% 0.45/0.75 ( carry != carry_def | sum != sum_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_24]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_104,negated_conjecture,
% 0.45/0.75 ( carry != carry_def | sum != sum_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_56]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_127,negated_conjecture,
% 0.45/0.75 ( carry != carry_def | sum != sum_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_104]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_132,negated_conjecture,
% 0.45/0.75 ( carry != carry_def | sum != sum_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_127]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_211,negated_conjecture,
% 0.45/0.75 ( carry != carry_def | sum != sum_def ),
% 0.45/0.75 inference(copy,[status(esa)],[c_132]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_18,plain,
% 0.45/0.75 ( xor(X0,X1) = xor(X1,X0) ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_101_0) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_196,plain,
% 0.45/0.75 ( xor(X0,X1) = xor(X1,X0) ),
% 0.45/0.75 inference(copy,[status(esa)],[c_18]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_12,plain,
% 0.45/0.75 ( and(X0,X1) = and(X1,X0) ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_107_0) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_189,plain,
% 0.45/0.75 ( and(X0,X1) = and(X1,X0) ),
% 0.45/0.75 inference(copy,[status(esa)],[c_12]) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_11,plain,
% 0.45/0.75 ( or(X0,X1) = or(X1,X0) ),
% 0.45/0.75 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_108_0) ).
% 0.45/0.75
% 0.45/0.75 cnf(c_187,plain,
% 0.45/0.75 ( or(X0,X1) = or(X1,X0) ),
% 0.45/0.75 inference(copy,[status(esa)],[c_11]) ).
% 0.45/0.75
% 0.45/0.75
% 0.45/0.75
% 0.45/0.75 % ------ Statistics
% 0.45/0.75
% 0.45/0.75 % ------ General
% 0.45/0.75
% 0.45/0.75 % num_of_input_clauses: 36
% 0.45/0.75 % num_of_input_neg_conjectures: 12
% 0.45/0.75 % num_of_splits: 0
% 0.45/0.75 % num_of_split_atoms: 0
% 0.45/0.75 % num_of_sem_filtered_clauses: 0
% 0.45/0.75 % num_of_subtypes: 0
% 0.45/0.75 % monotx_restored_types: 0
% 0.45/0.75 % sat_num_of_epr_types: 0
% 0.45/0.75 % sat_num_of_non_cyclic_types: 0
% 0.45/0.75 % sat_guarded_non_collapsed_types: 0
% 0.45/0.75 % is_epr: 0
% 0.45/0.75 % is_horn: 1
% 0.45/0.75 % has_eq: 1
% 0.45/0.75 % num_pure_diseq_elim: 0
% 0.45/0.75 % simp_replaced_by: 0
% 0.45/0.75 % res_preprocessed: 24
% 0.45/0.75 % prep_upred: 0
% 0.45/0.75 % prep_unflattend: 0
% 0.45/0.75 % pred_elim_cands: 0
% 0.45/0.75 % pred_elim: 0
% 0.45/0.75 % pred_elim_cl: 0
% 0.45/0.75 % pred_elim_cycles: 0
% 0.45/0.75 % forced_gc_time: 0
% 0.45/0.75 % gc_basic_clause_elim: 0
% 0.45/0.75 % parsing_time: 0.001
% 0.45/0.75 % sem_filter_time: 0.
% 0.45/0.75 % pred_elim_time: 0.
% 0.45/0.75 % out_proof_time: 0.
% 0.45/0.75 % monotx_time: 0.
% 0.45/0.75 % subtype_inf_time: 0.
% 0.45/0.75 % unif_index_cands_time: 0.
% 0.45/0.75 % unif_index_add_time: 0.
% 0.45/0.75 % total_time: 0.352
% 0.45/0.75 % num_of_symbols: 45
% 0.45/0.75 % num_of_terms: 226
% 0.45/0.75
% 0.45/0.75 % ------ Propositional Solver
% 0.45/0.75
% 0.45/0.75 % prop_solver_calls: 1
% 0.45/0.75 % prop_fast_solver_calls: 39
% 0.45/0.75 % prop_num_of_clauses: 56
% 0.45/0.75 % prop_preprocess_simplified: 156
% 0.45/0.75 % prop_fo_subsumed: 0
% 0.45/0.75 % prop_solver_time: 0.
% 0.45/0.75 % prop_fast_solver_time: 0.
% 0.45/0.75 % prop_unsat_core_time: 0.
% 0.45/0.75
% 0.45/0.75 % ------ QBF
% 0.45/0.75
% 0.45/0.75 % qbf_q_res: 0
% 0.45/0.75 % qbf_num_tautologies: 0
% 0.45/0.75 % qbf_prep_cycles: 0
% 0.45/0.75
% 0.45/0.75 % ------ BMC1
% 0.45/0.75
% 0.45/0.75 % bmc1_current_bound: -1
% 0.45/0.75 % bmc1_last_solved_bound: -1
% 0.45/0.75 % bmc1_unsat_core_size: -1
% 0.45/0.75 % bmc1_unsat_core_parents_size: -1
% 0.45/0.75 % bmc1_merge_next_fun: 0
% 0.45/0.75 % bmc1_unsat_core_clauses_time: 0.
% 0.45/0.75
% 0.45/0.75 % ------ Instantiation
% 0.45/0.75
% 0.45/0.75 % inst_num_of_clauses: 36
% 0.45/0.75 % inst_num_in_passive: 0
% 0.45/0.75 % inst_num_in_active: 0
% 0.45/0.75 % inst_num_in_unprocessed: 36
% 0.45/0.75 % inst_num_of_loops: 0
% 0.45/0.75 % inst_num_of_learning_restarts: 0
% 0.45/0.75 % inst_num_moves_active_passive: 0
% 0.45/0.75 % inst_lit_activity: 0
% 0.45/0.75 % inst_lit_activity_moves: 0
% 0.45/0.75 % inst_num_tautologies: 0
% 0.45/0.75 % inst_num_prop_implied: 0
% 0.45/0.75 % inst_num_existing_simplified: 0
% 0.45/0.75 % inst_num_eq_res_simplified: 0
% 0.45/0.75 % inst_num_child_elim: 0
% 0.45/0.75 % inst_num_of_dismatching_blockings: 0
% 0.45/0.75 % inst_num_of_non_proper_insts: 0
% 0.45/0.75 % inst_num_of_duplicates: 0
% 0.45/0.75 % inst_inst_num_from_inst_to_res: 0
% 0.45/0.75 % inst_dismatching_checking_time: 0.
% 0.45/0.75
% 0.45/0.75 % ------ Resolution
% 0.45/0.75
% 0.45/0.75 % res_num_of_clauses: 36
% 0.45/0.75 % res_num_in_passive: 0
% 0.45/0.75 % res_num_in_active: 15
% 0.45/0.75 % res_num_of_loops: 13
% 0.45/0.75 % res_forward_subset_subsumed: 0
% 0.45/0.75 % res_backward_subset_subsumed: 0
% 0.45/0.75 % res_forward_subsumed: 0
% 0.45/0.75 % res_backward_subsumed: 0
% 0.45/0.75 % res_forward_subsumption_resolution: 0
% 0.45/0.75 % res_backward_subsumption_resolution: 0
% 0.45/0.75 % res_clause_to_clause_subsumption: 0
% 0.45/0.75 % res_orphan_elimination: 0
% 0.45/0.75 % res_tautology_del: 0
% 0.45/0.75 % res_num_eq_res_simplified: 0
% 0.45/0.75 % res_num_sel_changes: 0
% 0.45/0.75 % res_moves_from_active_to_pass: 0
% 0.45/0.75
% 0.45/0.75 % Status Unknown
% 0.45/0.79 % Orienting using strategy ClausalAll
% 0.45/0.79 % Orientation found
% 0.45/0.79 % 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_41511c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_ea1482 | grep -v "SZS"
% 0.61/0.81
% 0.61/0.81 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.61/0.81
% 0.61/0.81 %
% 0.61/0.81 % ------ iProver source info
% 0.61/0.81
% 0.61/0.81 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.61/0.81 % git: non_committed_changes: true
% 0.61/0.81 % git: last_make_outside_of_git: true
% 0.61/0.81
% 0.61/0.81 %
% 0.61/0.81 % ------ Input Options
% 0.61/0.81
% 0.61/0.81 % --out_options all
% 0.61/0.81 % --tptp_safe_out true
% 0.61/0.81 % --problem_path ""
% 0.61/0.81 % --include_path ""
% 0.61/0.81 % --clausifier .//eprover
% 0.61/0.81 % --clausifier_options --tstp-format
% 0.61/0.81 % --stdin false
% 0.61/0.81 % --dbg_backtrace false
% 0.61/0.81 % --dbg_dump_prop_clauses false
% 0.61/0.81 % --dbg_dump_prop_clauses_file -
% 0.61/0.81 % --dbg_out_stat false
% 0.61/0.81
% 0.61/0.81 % ------ General Options
% 0.61/0.81
% 0.61/0.81 % --fof false
% 0.61/0.81 % --time_out_real 150.
% 0.61/0.81 % --time_out_prep_mult 0.2
% 0.61/0.81 % --time_out_virtual -1.
% 0.61/0.81 % --schedule none
% 0.61/0.81 % --ground_splitting input
% 0.61/0.81 % --splitting_nvd 16
% 0.61/0.81 % --non_eq_to_eq false
% 0.61/0.81 % --prep_gs_sim true
% 0.61/0.81 % --prep_unflatten false
% 0.61/0.81 % --prep_res_sim true
% 0.61/0.81 % --prep_upred true
% 0.61/0.81 % --res_sim_input true
% 0.61/0.81 % --clause_weak_htbl true
% 0.61/0.81 % --gc_record_bc_elim false
% 0.61/0.81 % --symbol_type_check false
% 0.61/0.81 % --clausify_out false
% 0.61/0.81 % --large_theory_mode false
% 0.61/0.81 % --prep_sem_filter none
% 0.61/0.81 % --prep_sem_filter_out false
% 0.61/0.81 % --preprocessed_out false
% 0.61/0.81 % --sub_typing false
% 0.61/0.81 % --brand_transform false
% 0.61/0.81 % --pure_diseq_elim true
% 0.61/0.81 % --min_unsat_core false
% 0.61/0.81 % --pred_elim true
% 0.61/0.81 % --add_important_lit false
% 0.61/0.81 % --soft_assumptions false
% 0.61/0.81 % --reset_solvers false
% 0.61/0.81 % --bc_imp_inh []
% 0.61/0.81 % --conj_cone_tolerance 1.5
% 0.61/0.81 % --prolific_symb_bound 500
% 0.61/0.81 % --lt_threshold 2000
% 0.61/0.81
% 0.61/0.81 % ------ SAT Options
% 0.61/0.81
% 0.61/0.81 % --sat_mode false
% 0.61/0.81 % --sat_fm_restart_options ""
% 0.61/0.81 % --sat_gr_def false
% 0.61/0.81 % --sat_epr_types true
% 0.61/0.81 % --sat_non_cyclic_types false
% 0.61/0.81 % --sat_finite_models false
% 0.61/0.81 % --sat_fm_lemmas false
% 0.61/0.81 % --sat_fm_prep false
% 0.61/0.81 % --sat_fm_uc_incr true
% 0.61/0.81 % --sat_out_model small
% 0.61/0.81 % --sat_out_clauses false
% 0.61/0.81
% 0.61/0.81 % ------ QBF Options
% 0.61/0.81
% 0.61/0.81 % --qbf_mode false
% 0.61/0.81 % --qbf_elim_univ true
% 0.61/0.81 % --qbf_sk_in true
% 0.61/0.81 % --qbf_pred_elim true
% 0.61/0.81 % --qbf_split 32
% 0.61/0.81
% 0.61/0.81 % ------ BMC1 Options
% 0.61/0.81
% 0.61/0.81 % --bmc1_incremental false
% 0.61/0.81 % --bmc1_axioms reachable_all
% 0.61/0.81 % --bmc1_min_bound 0
% 0.61/0.81 % --bmc1_max_bound -1
% 0.61/0.81 % --bmc1_max_bound_default -1
% 0.61/0.81 % --bmc1_symbol_reachability true
% 0.61/0.81 % --bmc1_property_lemmas false
% 0.61/0.81 % --bmc1_k_induction false
% 0.61/0.81 % --bmc1_non_equiv_states false
% 0.61/0.81 % --bmc1_deadlock false
% 0.61/0.81 % --bmc1_ucm false
% 0.61/0.81 % --bmc1_add_unsat_core none
% 0.61/0.81 % --bmc1_unsat_core_children false
% 0.61/0.81 % --bmc1_unsat_core_extrapolate_axioms false
% 0.61/0.81 % --bmc1_out_stat full
% 0.61/0.81 % --bmc1_ground_init false
% 0.61/0.81 % --bmc1_pre_inst_next_state false
% 0.61/0.81 % --bmc1_pre_inst_state false
% 0.61/0.81 % --bmc1_pre_inst_reach_state false
% 0.61/0.81 % --bmc1_out_unsat_core false
% 0.61/0.81 % --bmc1_aig_witness_out false
% 0.61/0.81 % --bmc1_verbose false
% 0.61/0.81 % --bmc1_dump_clauses_tptp false
% 0.61/1.05 % --bmc1_dump_unsat_core_tptp false
% 0.61/1.05 % --bmc1_dump_file -
% 0.61/1.05 % --bmc1_ucm_expand_uc_limit 128
% 0.61/1.05 % --bmc1_ucm_n_expand_iterations 6
% 0.61/1.05 % --bmc1_ucm_extend_mode 1
% 0.61/1.05 % --bmc1_ucm_init_mode 2
% 0.61/1.05 % --bmc1_ucm_cone_mode none
% 0.61/1.05 % --bmc1_ucm_reduced_relation_type 0
% 0.61/1.05 % --bmc1_ucm_relax_model 4
% 0.61/1.05 % --bmc1_ucm_full_tr_after_sat true
% 0.61/1.05 % --bmc1_ucm_expand_neg_assumptions false
% 0.61/1.05 % --bmc1_ucm_layered_model none
% 0.61/1.05 % --bmc1_ucm_max_lemma_size 10
% 0.61/1.05
% 0.61/1.05 % ------ AIG Options
% 0.61/1.05
% 0.61/1.05 % --aig_mode false
% 0.61/1.05
% 0.61/1.05 % ------ Instantiation Options
% 0.61/1.05
% 0.61/1.05 % --instantiation_flag true
% 0.61/1.05 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.61/1.05 % --inst_solver_per_active 750
% 0.61/1.05 % --inst_solver_calls_frac 0.5
% 0.61/1.05 % --inst_passive_queue_type priority_queues
% 0.61/1.05 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.61/1.05 % --inst_passive_queues_freq [25;2]
% 0.61/1.05 % --inst_dismatching true
% 0.61/1.05 % --inst_eager_unprocessed_to_passive true
% 0.61/1.05 % --inst_prop_sim_given true
% 0.61/1.05 % --inst_prop_sim_new false
% 0.61/1.05 % --inst_orphan_elimination true
% 0.61/1.05 % --inst_learning_loop_flag true
% 0.61/1.05 % --inst_learning_start 3000
% 0.61/1.05 % --inst_learning_factor 2
% 0.61/1.05 % --inst_start_prop_sim_after_learn 3
% 0.61/1.05 % --inst_sel_renew solver
% 0.61/1.05 % --inst_lit_activity_flag true
% 0.61/1.05 % --inst_out_proof true
% 0.61/1.05
% 0.61/1.05 % ------ Resolution Options
% 0.61/1.05
% 0.61/1.05 % --resolution_flag true
% 0.61/1.05 % --res_lit_sel kbo_max
% 0.61/1.05 % --res_to_prop_solver none
% 0.61/1.05 % --res_prop_simpl_new false
% 0.61/1.05 % --res_prop_simpl_given false
% 0.61/1.05 % --res_passive_queue_type priority_queues
% 0.61/1.05 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.61/1.05 % --res_passive_queues_freq [15;5]
% 0.61/1.05 % --res_forward_subs full
% 0.61/1.05 % --res_backward_subs full
% 0.61/1.05 % --res_forward_subs_resolution true
% 0.61/1.05 % --res_backward_subs_resolution true
% 0.61/1.05 % --res_orphan_elimination false
% 0.61/1.05 % --res_time_limit 1000.
% 0.61/1.05 % --res_out_proof true
% 0.61/1.05 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_41511c.s
% 0.61/1.05 % --modulo true
% 0.61/1.05
% 0.61/1.05 % ------ Combination Options
% 0.61/1.05
% 0.61/1.05 % --comb_res_mult 1000
% 0.61/1.05 % --comb_inst_mult 300
% 0.61/1.05 % ------
% 0.61/1.05
% 0.61/1.05 % ------ Parsing...% successful
% 0.61/1.05
% 0.61/1.05 % ------ 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.61/1.05
% 0.61/1.05 % ------ Proving...
% 0.61/1.05 % ------ Problem Properties
% 0.61/1.05
% 0.61/1.05 %
% 0.61/1.05 % EPR false
% 0.61/1.05 % Horn true
% 0.61/1.05 % Has equality true
% 0.61/1.05
% 0.61/1.05 % % ------ Input Options Time Limit: Unbounded
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05 Compiling...
% 0.61/1.05 Loading plugin: done.
% 0.61/1.05 Compiling...
% 0.61/1.05 Loading plugin: done.
% 0.61/1.05 % % ------ Current options:
% 0.61/1.05
% 0.61/1.05 % ------ Input Options
% 0.61/1.05
% 0.61/1.05 % --out_options all
% 0.61/1.05 % --tptp_safe_out true
% 0.61/1.05 % --problem_path ""
% 0.61/1.05 % --include_path ""
% 0.61/1.05 % --clausifier .//eprover
% 0.61/1.05 % --clausifier_options --tstp-format
% 0.61/1.05 % --stdin false
% 0.61/1.05 % --dbg_backtrace false
% 0.61/1.05 % --dbg_dump_prop_clauses false
% 0.61/1.05 % --dbg_dump_prop_clauses_file -
% 0.61/1.05 % --dbg_out_stat false
% 0.61/1.05
% 0.61/1.05 % ------ General Options
% 0.61/1.05
% 0.61/1.05 % --fof false
% 0.61/1.05 % --time_out_real 150.
% 0.61/1.05 % --time_out_prep_mult 0.2
% 0.61/1.05 % --time_out_virtual -1.
% 0.61/1.05 % --schedule none
% 0.61/1.05 % --ground_splitting input
% 0.61/1.05 % --splitting_nvd 16
% 0.61/1.05 % --non_eq_to_eq false
% 0.61/1.05 % --prep_gs_sim true
% 0.61/1.05 % --prep_unflatten false
% 0.61/1.05 % --prep_res_sim true
% 0.61/1.05 % --prep_upred true
% 0.61/1.05 % --res_sim_input true
% 0.61/1.05 % --clause_weak_htbl true
% 0.61/1.05 % --gc_record_bc_elim false
% 0.61/1.05 % --symbol_type_check false
% 0.61/1.05 % --clausify_out false
% 0.61/1.05 % --large_theory_mode false
% 0.61/1.05 % --prep_sem_filter none
% 0.61/1.05 % --prep_sem_filter_out false
% 0.61/1.05 % --preprocessed_out false
% 0.61/1.05 % --sub_typing false
% 0.61/1.05 % --brand_transform false
% 0.61/1.05 % --pure_diseq_elim true
% 0.61/1.05 % --min_unsat_core false
% 0.61/1.05 % --pred_elim true
% 0.61/1.05 % --add_important_lit false
% 0.61/1.05 % --soft_assumptions false
% 0.61/1.05 % --reset_solvers false
% 0.61/1.05 % --bc_imp_inh []
% 0.61/1.05 % --conj_cone_tolerance 1.5
% 0.61/1.05 % --prolific_symb_bound 500
% 0.61/1.05 % --lt_threshold 2000
% 0.61/1.05
% 0.61/1.05 % ------ SAT Options
% 0.61/1.05
% 0.61/1.05 % --sat_mode false
% 0.61/1.05 % --sat_fm_restart_options ""
% 0.61/1.05 % --sat_gr_def false
% 0.61/1.05 % --sat_epr_types true
% 0.61/1.05 % --sat_non_cyclic_types false
% 0.61/1.05 % --sat_finite_models false
% 0.61/1.05 % --sat_fm_lemmas false
% 0.61/1.05 % --sat_fm_prep false
% 0.61/1.05 % --sat_fm_uc_incr true
% 0.61/1.05 % --sat_out_model small
% 0.61/1.05 % --sat_out_clauses false
% 0.61/1.05
% 0.61/1.05 % ------ QBF Options
% 0.61/1.05
% 0.61/1.05 % --qbf_mode false
% 0.61/1.05 % --qbf_elim_univ true
% 0.61/1.05 % --qbf_sk_in true
% 0.61/1.05 % --qbf_pred_elim true
% 0.61/1.05 % --qbf_split 32
% 0.61/1.05
% 0.61/1.05 % ------ BMC1 Options
% 0.61/1.05
% 0.61/1.05 % --bmc1_incremental false
% 0.61/1.05 % --bmc1_axioms reachable_all
% 0.61/1.05 % --bmc1_min_bound 0
% 0.61/1.05 % --bmc1_max_bound -1
% 0.61/1.05 % --bmc1_max_bound_default -1
% 0.61/1.05 % --bmc1_symbol_reachability true
% 0.61/1.05 % --bmc1_property_lemmas false
% 0.61/1.05 % --bmc1_k_induction false
% 0.61/1.05 % --bmc1_non_equiv_states false
% 0.61/1.05 % --bmc1_deadlock false
% 0.61/1.05 % --bmc1_ucm false
% 0.61/1.05 % --bmc1_add_unsat_core none
% 0.61/1.05 % --bmc1_unsat_core_children false
% 0.61/1.05 % --bmc1_unsat_core_extrapolate_axioms false
% 0.61/1.05 % --bmc1_out_stat full
% 0.61/1.05 % --bmc1_ground_init false
% 0.61/1.05 % --bmc1_pre_inst_next_state false
% 0.61/1.05 % --bmc1_pre_inst_state false
% 0.61/1.05 % --bmc1_pre_inst_reach_state false
% 0.61/1.05 % --bmc1_out_unsat_core false
% 0.61/1.05 % --bmc1_aig_witness_out false
% 0.61/1.05 % --bmc1_verbose false
% 0.61/1.05 % --bmc1_dump_clauses_tptp false
% 0.61/1.05 % --bmc1_dump_unsat_core_tptp false
% 0.61/1.05 % --bmc1_dump_file -
% 0.61/1.05 % --bmc1_ucm_expand_uc_limit 128
% 0.61/1.05 % --bmc1_ucm_n_expand_iterations 6
% 0.61/1.05 % --bmc1_ucm_extend_mode 1
% 0.61/1.05 % --bmc1_ucm_init_mode 2
% 0.61/1.05 % --bmc1_ucm_cone_mode none
% 0.61/1.05 % --bmc1_ucm_reduced_relation_type 0
% 0.61/1.05 % --bmc1_ucm_relax_model 4
% 0.61/1.05 % --bmc1_ucm_full_tr_after_sat true
% 0.61/1.05 % --bmc1_ucm_expand_neg_assumptions false
% 0.61/1.05 % --bmc1_ucm_layered_model none
% 0.61/1.05 % --bmc1_ucm_max_lemma_size 10
% 0.61/1.05
% 0.61/1.05 % ------ AIG Options
% 0.61/1.05
% 0.61/1.05 % --aig_mode false
% 0.61/1.05
% 0.61/1.05 % ------ Instantiation Options
% 0.61/1.05
% 0.61/1.05 % --instantiation_flag true
% 0.61/1.05 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.61/1.05 % --inst_solver_per_active 750
% 0.61/1.05 % --inst_solver_calls_frac 0.5
% 0.61/1.05 % --inst_passive_queue_type priority_queues
% 0.61/1.05 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.61/1.05 % --inst_passive_queues_freq [25;2]
% 0.61/1.05 % --inst_dismatching true
% 0.61/1.05 % --inst_eager_unprocessed_to_passive true
% 0.61/1.05 % --inst_prop_sim_given true
% 0.61/1.05 % --inst_prop_sim_new false
% 0.61/1.05 % --inst_orphan_elimination true
% 0.61/1.05 % --inst_learning_loop_flag true
% 0.61/1.05 % --inst_learning_start 3000
% 0.61/1.05 % --inst_learning_factor 2
% 0.61/1.05 % --inst_start_prop_sim_after_learn 3
% 0.61/1.05 % --inst_sel_renew solver
% 0.61/1.05 % --inst_lit_activity_flag true
% 0.61/1.05 % --inst_out_proof true
% 0.61/1.05
% 0.61/1.05 % ------ Resolution Options
% 0.61/1.05
% 0.61/1.05 % --resolution_flag true
% 0.61/1.05 % --res_lit_sel kbo_max
% 0.61/1.05 % --res_to_prop_solver none
% 0.61/1.05 % --res_prop_simpl_new false
% 0.61/1.05 % --res_prop_simpl_given false
% 0.61/1.05 % --res_passive_queue_type priority_queues
% 0.61/1.05 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.61/1.05 % --res_passive_queues_freq [15;5]
% 0.61/1.05 % --res_forward_subs full
% 0.61/1.05 % --res_backward_subs full
% 0.61/1.05 % --res_forward_subs_resolution true
% 0.61/1.05 % --res_backward_subs_resolution true
% 0.61/1.05 % --res_orphan_elimination false
% 0.61/1.05 % --res_time_limit 1000.
% 0.61/1.05 % --res_out_proof true
% 0.61/1.05 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_41511c.s
% 0.61/1.05 % --modulo true
% 0.61/1.05
% 0.61/1.05 % ------ Combination Options
% 0.61/1.05
% 0.61/1.05 % --comb_res_mult 1000
% 0.61/1.05 % --comb_inst_mult 300
% 0.61/1.05 % ------
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05 % ------ Proving...
% 0.61/1.05 % warning: shown sat in sat incomplete mode
% 0.61/1.05 %
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05 cnf(c_35,negated_conjecture,
% 0.61/1.05 ( not(and(a,b)) = t1 ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_58) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_78,negated_conjecture,
% 0.61/1.05 ( not(and(a,b)) = t1 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_35]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_115,negated_conjecture,
% 0.61/1.05 ( not(and(a,b)) = t1 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_78]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_116,negated_conjecture,
% 0.61/1.05 ( not(and(a,b)) = t1 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_115]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_131,negated_conjecture,
% 0.61/1.05 ( not(and(a,b)) = t1 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_116]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_209,negated_conjecture,
% 0.61/1.05 ( not(and(a,b)) = t1 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_131]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_34,negated_conjecture,
% 0.61/1.05 ( not(and(a,t1)) = t2 ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_57) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_76,negated_conjecture,
% 0.61/1.05 ( not(and(a,t1)) = t2 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_34]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_114,negated_conjecture,
% 0.61/1.05 ( not(and(a,t1)) = t2 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_76]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_117,negated_conjecture,
% 0.61/1.05 ( not(and(a,t1)) = t2 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_114]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_130,negated_conjecture,
% 0.61/1.05 ( not(and(a,t1)) = t2 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_117]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_207,negated_conjecture,
% 0.61/1.05 ( not(and(a,t1)) = t2 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_130]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_33,negated_conjecture,
% 0.61/1.05 ( not(and(b,t1)) = t3 ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_56) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_74,negated_conjecture,
% 0.61/1.05 ( not(and(b,t1)) = t3 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_33]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_113,negated_conjecture,
% 0.61/1.05 ( not(and(b,t1)) = t3 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_74]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_118,negated_conjecture,
% 0.61/1.05 ( not(and(b,t1)) = t3 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_113]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_129,negated_conjecture,
% 0.61/1.05 ( not(and(b,t1)) = t3 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_118]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_205,negated_conjecture,
% 0.61/1.05 ( not(and(b,t1)) = t3 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_129]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_32,negated_conjecture,
% 0.61/1.05 ( not(and(t2,t3)) = t4 ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_55) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_72,negated_conjecture,
% 0.61/1.05 ( not(and(t2,t3)) = t4 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_32]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_112,negated_conjecture,
% 0.61/1.05 ( not(and(t2,t3)) = t4 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_72]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_119,negated_conjecture,
% 0.61/1.05 ( not(and(t2,t3)) = t4 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_112]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_128,negated_conjecture,
% 0.61/1.05 ( not(and(t2,t3)) = t4 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_119]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_203,negated_conjecture,
% 0.61/1.05 ( not(and(t2,t3)) = t4 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_128]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_31,negated_conjecture,
% 0.61/1.05 ( not(and(t4,cin)) = t5 ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_54) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_70,negated_conjecture,
% 0.61/1.05 ( not(and(t4,cin)) = t5 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_31]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_111,negated_conjecture,
% 0.61/1.05 ( not(and(t4,cin)) = t5 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_70]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_120,negated_conjecture,
% 0.61/1.05 ( not(and(t4,cin)) = t5 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_111]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_139,negated_conjecture,
% 0.61/1.05 ( not(and(t4,cin)) = t5 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_120]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_225,negated_conjecture,
% 0.61/1.05 ( not(and(t4,cin)) = t5 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_139]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_30,negated_conjecture,
% 0.61/1.05 ( not(and(t4,t5)) = t6 ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_53) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_68,negated_conjecture,
% 0.61/1.05 ( not(and(t4,t5)) = t6 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_30]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_110,negated_conjecture,
% 0.61/1.05 ( not(and(t4,t5)) = t6 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_68]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_121,negated_conjecture,
% 0.61/1.05 ( not(and(t4,t5)) = t6 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_110]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_138,negated_conjecture,
% 0.61/1.05 ( not(and(t4,t5)) = t6 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_121]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_223,negated_conjecture,
% 0.61/1.05 ( not(and(t4,t5)) = t6 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_138]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_29,negated_conjecture,
% 0.61/1.05 ( not(and(t5,cin)) = t7 ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_52) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_66,negated_conjecture,
% 0.61/1.05 ( not(and(t5,cin)) = t7 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_29]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_109,negated_conjecture,
% 0.61/1.05 ( not(and(t5,cin)) = t7 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_66]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_122,negated_conjecture,
% 0.61/1.05 ( not(and(t5,cin)) = t7 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_109]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_137,negated_conjecture,
% 0.61/1.05 ( not(and(t5,cin)) = t7 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_122]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_221,negated_conjecture,
% 0.61/1.05 ( not(and(t5,cin)) = t7 ),
% 0.61/1.05 inference(copy,[status(esa)],[c_137]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_28,negated_conjecture,
% 0.61/1.05 ( not(and(t6,t7)) = sum ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_51) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_64,negated_conjecture,
% 0.61/1.05 ( not(and(t6,t7)) = sum ),
% 0.61/1.05 inference(copy,[status(esa)],[c_28]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_108,negated_conjecture,
% 0.61/1.05 ( not(and(t6,t7)) = sum ),
% 0.61/1.05 inference(copy,[status(esa)],[c_64]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_123,negated_conjecture,
% 0.61/1.05 ( not(and(t6,t7)) = sum ),
% 0.61/1.05 inference(copy,[status(esa)],[c_108]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_136,negated_conjecture,
% 0.61/1.05 ( not(and(t6,t7)) = sum ),
% 0.61/1.05 inference(copy,[status(esa)],[c_123]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_219,negated_conjecture,
% 0.61/1.05 ( not(and(t6,t7)) = sum ),
% 0.61/1.05 inference(copy,[status(esa)],[c_136]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_27,negated_conjecture,
% 0.61/1.05 ( not(and(t1,t5)) = carry ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_50) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_62,negated_conjecture,
% 0.61/1.05 ( not(and(t1,t5)) = carry ),
% 0.61/1.05 inference(copy,[status(esa)],[c_27]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_107,negated_conjecture,
% 0.61/1.05 ( not(and(t1,t5)) = carry ),
% 0.61/1.05 inference(copy,[status(esa)],[c_62]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_124,negated_conjecture,
% 0.61/1.05 ( not(and(t1,t5)) = carry ),
% 0.61/1.05 inference(copy,[status(esa)],[c_107]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_135,negated_conjecture,
% 0.61/1.05 ( not(and(t1,t5)) = carry ),
% 0.61/1.05 inference(copy,[status(esa)],[c_124]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_217,negated_conjecture,
% 0.61/1.05 ( not(and(t1,t5)) = carry ),
% 0.61/1.05 inference(copy,[status(esa)],[c_135]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_26,negated_conjecture,
% 0.61/1.05 ( xor(xor(a,b),cin) = sum_def ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_49) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_60,negated_conjecture,
% 0.61/1.05 ( xor(xor(a,b),cin) = sum_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_26]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_106,negated_conjecture,
% 0.61/1.05 ( xor(xor(a,b),cin) = sum_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_60]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_125,negated_conjecture,
% 0.61/1.05 ( xor(xor(a,b),cin) = sum_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_106]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_134,negated_conjecture,
% 0.61/1.05 ( xor(xor(a,b),cin) = sum_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_125]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_215,negated_conjecture,
% 0.61/1.05 ( xor(xor(a,b),cin) = sum_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_134]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_25,negated_conjecture,
% 0.61/1.05 ( or(and(cin,or(a,b)),and(not(cin),and(a,b))) = carry_def ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_48) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_58,negated_conjecture,
% 0.61/1.05 ( or(and(cin,or(a,b)),and(not(cin),and(a,b))) = carry_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_25]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_105,negated_conjecture,
% 0.61/1.05 ( or(and(cin,or(a,b)),and(not(cin),and(a,b))) = carry_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_58]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_126,negated_conjecture,
% 0.61/1.05 ( or(and(cin,or(a,b)),and(not(cin),and(a,b))) = carry_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_105]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_133,negated_conjecture,
% 0.61/1.05 ( or(and(cin,or(a,b)),and(not(cin),and(a,b))) = carry_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_126]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_213,negated_conjecture,
% 0.61/1.05 ( or(and(cin,or(a,b)),and(not(cin),and(a,b))) = carry_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_133]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_24,negated_conjecture,
% 0.61/1.05 ( carry != carry_def | sum != sum_def ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_59) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_56,negated_conjecture,
% 0.61/1.05 ( carry != carry_def | sum != sum_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_24]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_104,negated_conjecture,
% 0.61/1.05 ( carry != carry_def | sum != sum_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_56]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_127,negated_conjecture,
% 0.61/1.05 ( carry != carry_def | sum != sum_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_104]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_132,negated_conjecture,
% 0.61/1.05 ( carry != carry_def | sum != sum_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_127]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_211,negated_conjecture,
% 0.61/1.05 ( carry != carry_def | sum != sum_def ),
% 0.61/1.05 inference(copy,[status(esa)],[c_132]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_13,plain,
% 0.61/1.05 ( xor(X0,X1) = xor(X1,X0) ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_106_0) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_191,plain,
% 0.61/1.05 ( xor(X0,X1) = xor(X1,X0) ),
% 0.61/1.05 inference(copy,[status(esa)],[c_13]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_12,plain,
% 0.61/1.05 ( and(X0,X1) = and(X1,X0) ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_107_0) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_189,plain,
% 0.61/1.05 ( and(X0,X1) = and(X1,X0) ),
% 0.61/1.05 inference(copy,[status(esa)],[c_12]) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_11,plain,
% 0.61/1.05 ( or(X0,X1) = or(X1,X0) ),
% 0.61/1.05 file('/export/starexec/sandbox2/tmp/iprover_modulo_0b3c9f.p', c_0_108_0) ).
% 0.61/1.05
% 0.61/1.05 cnf(c_187,plain,
% 0.61/1.05 ( or(X0,X1) = or(X1,X0) ),
% 0.61/1.05 inference(copy,[status(esa)],[c_11]) ).
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05 % ------ Statistics
% 0.61/1.05
% 0.61/1.05 % ------ General
% 0.61/1.05
% 0.61/1.05 % num_of_input_clauses: 36
% 0.61/1.05 % num_of_input_neg_conjectures: 12
% 0.61/1.05 % num_of_splits: 0
% 0.61/1.05 % num_of_split_atoms: 0
% 0.61/1.05 % num_of_sem_filtered_clauses: 0
% 0.61/1.05 % num_of_subtypes: 0
% 0.61/1.05 % monotx_restored_types: 0
% 0.61/1.05 % sat_num_of_epr_types: 0
% 0.61/1.05 % sat_num_of_non_cyclic_types: 0
% 0.61/1.05 % sat_guarded_non_collapsed_types: 0
% 0.61/1.05 % is_epr: 0
% 0.61/1.05 % is_horn: 1
% 0.61/1.05 % has_eq: 1
% 0.61/1.05 % num_pure_diseq_elim: 0
% 0.61/1.05 % simp_replaced_by: 0
% 0.61/1.05 % res_preprocessed: 24
% 0.61/1.05 % prep_upred: 0
% 0.61/1.05 % prep_unflattend: 0
% 0.61/1.05 % pred_elim_cands: 0
% 0.61/1.05 % pred_elim: 0
% 0.61/1.05 % pred_elim_cl: 0
% 0.61/1.05 % pred_elim_cycles: 0
% 0.61/1.05 % forced_gc_time: 0
% 0.61/1.05 % gc_basic_clause_elim: 0
% 0.61/1.05 % parsing_time: 0.001
% 0.61/1.05 % sem_filter_time: 0.
% 0.61/1.05 % pred_elim_time: 0.
% 0.61/1.05 % out_proof_time: 0.
% 0.61/1.05 % monotx_time: 0.
% 0.61/1.05 % subtype_inf_time: 0.
% 0.61/1.05 % unif_index_cands_time: 0.
% 0.61/1.05 % unif_index_add_time: 0.
% 0.61/1.05 % total_time: 0.262
% 0.61/1.05 % num_of_symbols: 45
% 0.61/1.05 % num_of_terms: 189
% 0.61/1.05
% 0.61/1.05 % ------ Propositional Solver
% 0.61/1.05
% 0.61/1.05 % prop_solver_calls: 1
% 0.61/1.05 % prop_fast_solver_calls: 39
% 0.61/1.05 % prop_num_of_clauses: 56
% 0.61/1.06 % prop_preprocess_simplified: 156
% 0.61/1.06 % prop_fo_subsumed: 0
% 0.61/1.06 % prop_solver_time: 0.
% 0.61/1.06 % prop_fast_solver_time: 0.
% 0.61/1.06 % prop_unsat_core_time: 0.
% 0.61/1.06
% 0.61/1.06 % ------ QBF
% 0.61/1.06
% 0.61/1.06 % qbf_q_res: 0
% 0.61/1.06 % qbf_num_tautologies: 0
% 0.61/1.06 % qbf_prep_cycles: 0
% 0.61/1.06
% 0.61/1.06 % ------ BMC1
% 0.61/1.06
% 0.61/1.06 % bmc1_current_bound: -1
% 0.61/1.06 % bmc1_last_solved_bound: -1
% 0.61/1.06 % bmc1_unsat_core_size: -1
% 0.61/1.06 % bmc1_unsat_core_parents_size: -1
% 0.61/1.06 % bmc1_merge_next_fun: 0
% 0.61/1.06 % bmc1_unsat_core_clauses_time: 0.
% 0.61/1.06
% 0.61/1.06 % ------ Instantiation
% 0.61/1.06
% 0.61/1.06 % inst_num_of_clauses: 36
% 0.61/1.06 % inst_num_in_passive: 0
% 0.61/1.06 % inst_num_in_active: 0
% 0.61/1.06 % inst_num_in_unprocessed: 36
% 0.61/1.06 % inst_num_of_loops: 0
% 0.61/1.06 % inst_num_of_learning_restarts: 0
% 0.61/1.06 % inst_num_moves_active_passive: 0
% 0.61/1.06 % inst_lit_activity: 0
% 0.61/1.06 % inst_lit_activity_moves: 0
% 0.61/1.06 % inst_num_tautologies: 0
% 0.61/1.06 % inst_num_prop_implied: 0
% 0.61/1.06 % inst_num_existing_simplified: 0
% 0.61/1.06 % inst_num_eq_res_simplified: 0
% 0.61/1.06 % inst_num_child_elim: 0
% 0.61/1.06 % inst_num_of_dismatching_blockings: 0
% 0.61/1.06 % inst_num_of_non_proper_insts: 0
% 0.61/1.06 % inst_num_of_duplicates: 0
% 0.61/1.06 % inst_inst_num_from_inst_to_res: 0
% 0.61/1.06 % inst_dismatching_checking_time: 0.
% 0.61/1.06
% 0.61/1.06 % ------ Resolution
% 0.61/1.06
% 0.61/1.06 % res_num_of_clauses: 36
% 0.61/1.06 % res_num_in_passive: 0
% 0.61/1.06 % res_num_in_active: 15
% 0.61/1.06 % res_num_of_loops: 13
% 0.61/1.06 % res_forward_subset_subsumed: 0
% 0.61/1.06 % res_backward_subset_subsumed: 0
% 0.61/1.06 % res_forward_subsumed: 0
% 0.61/1.06 % res_backward_subsumed: 0
% 0.61/1.06 % res_forward_subsumption_resolution: 0
% 0.61/1.06 % res_backward_subsumption_resolution: 0
% 0.61/1.06 % res_clause_to_clause_subsumption: 0
% 0.61/1.06 % res_orphan_elimination: 0
% 0.61/1.06 % res_tautology_del: 0
% 0.61/1.06 % res_num_eq_res_simplified: 0
% 0.61/1.06 % res_num_sel_changes: 0
% 0.61/1.06 % res_moves_from_active_to_pass: 0
% 0.61/1.06
% 0.61/1.06 % Status Unknown
% 0.61/1.06 % Last status :
% 0.61/1.06 % SZS status Unknown
%------------------------------------------------------------------------------