TSTP Solution File: HWC002-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : HWC002-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n027.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 13:07:11 EDT 2022
% Result : Unknown 22.24s 22.48s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : HWC002-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 13:02:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % Orientation found
% 0.20/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_107e63.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_9169fd.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_5b0aef | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.40/0.72 % --bmc1_dump_unsat_core_tptp false
% 0.40/0.72 % --bmc1_dump_file -
% 0.40/0.72 % --bmc1_ucm_expand_uc_limit 128
% 0.40/0.72 % --bmc1_ucm_n_expand_iterations 6
% 0.40/0.72 % --bmc1_ucm_extend_mode 1
% 0.40/0.72 % --bmc1_ucm_init_mode 2
% 0.40/0.72 % --bmc1_ucm_cone_mode none
% 0.40/0.72 % --bmc1_ucm_reduced_relation_type 0
% 0.40/0.72 % --bmc1_ucm_relax_model 4
% 0.40/0.72 % --bmc1_ucm_full_tr_after_sat true
% 0.40/0.72 % --bmc1_ucm_expand_neg_assumptions false
% 0.40/0.72 % --bmc1_ucm_layered_model none
% 0.40/0.72 % --bmc1_ucm_max_lemma_size 10
% 0.40/0.72
% 0.40/0.72 % ------ AIG Options
% 0.40/0.72
% 0.40/0.72 % --aig_mode false
% 0.40/0.72
% 0.40/0.72 % ------ Instantiation Options
% 0.40/0.72
% 0.40/0.72 % --instantiation_flag true
% 0.40/0.72 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.40/0.72 % --inst_solver_per_active 750
% 0.40/0.72 % --inst_solver_calls_frac 0.5
% 0.40/0.72 % --inst_passive_queue_type priority_queues
% 0.40/0.72 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.40/0.72 % --inst_passive_queues_freq [25;2]
% 0.40/0.72 % --inst_dismatching true
% 0.40/0.72 % --inst_eager_unprocessed_to_passive true
% 0.40/0.72 % --inst_prop_sim_given true
% 0.40/0.72 % --inst_prop_sim_new false
% 0.40/0.72 % --inst_orphan_elimination true
% 0.40/0.72 % --inst_learning_loop_flag true
% 0.40/0.72 % --inst_learning_start 3000
% 0.40/0.72 % --inst_learning_factor 2
% 0.40/0.72 % --inst_start_prop_sim_after_learn 3
% 0.40/0.72 % --inst_sel_renew solver
% 0.40/0.72 % --inst_lit_activity_flag true
% 0.40/0.72 % --inst_out_proof true
% 0.40/0.72
% 0.40/0.72 % ------ Resolution Options
% 0.40/0.72
% 0.40/0.72 % --resolution_flag true
% 0.40/0.72 % --res_lit_sel kbo_max
% 0.40/0.72 % --res_to_prop_solver none
% 0.40/0.72 % --res_prop_simpl_new false
% 0.40/0.72 % --res_prop_simpl_given false
% 0.40/0.72 % --res_passive_queue_type priority_queues
% 0.40/0.72 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.40/0.72 % --res_passive_queues_freq [15;5]
% 0.40/0.72 % --res_forward_subs full
% 0.40/0.72 % --res_backward_subs full
% 0.40/0.72 % --res_forward_subs_resolution true
% 0.40/0.72 % --res_backward_subs_resolution true
% 0.40/0.72 % --res_orphan_elimination false
% 0.40/0.72 % --res_time_limit 1000.
% 0.40/0.72 % --res_out_proof true
% 0.40/0.72 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_107e63.s
% 0.40/0.72 % --modulo true
% 0.40/0.72
% 0.40/0.72 % ------ Combination Options
% 0.40/0.72
% 0.40/0.72 % --comb_res_mult 1000
% 0.40/0.72 % --comb_inst_mult 300
% 0.40/0.72 % ------
% 0.40/0.72
% 0.40/0.72 % ------ Parsing...% successful
% 0.40/0.72
% 0.40/0.72 % ------ 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.40/0.72
% 0.40/0.72 % ------ Proving...
% 0.40/0.72 % ------ Problem Properties
% 0.40/0.72
% 0.40/0.72 %
% 0.40/0.72 % EPR false
% 0.40/0.72 % Horn true
% 0.40/0.72 % Has equality true
% 0.40/0.72
% 0.40/0.72 % % ------ Input Options Time Limit: Unbounded
% 0.40/0.72
% 0.40/0.72
% 0.40/0.72 Compiling...
% 0.40/0.72 Loading plugin: done.
% 0.40/0.72 Compiling...
% 0.40/0.72 Loading plugin: done.
% 0.40/0.72 % % ------ Current options:
% 0.40/0.72
% 0.40/0.72 % ------ Input Options
% 0.40/0.72
% 0.40/0.72 % --out_options all
% 0.40/0.72 % --tptp_safe_out true
% 0.40/0.72 % --problem_path ""
% 0.40/0.72 % --include_path ""
% 0.40/0.72 % --clausifier .//eprover
% 0.40/0.72 % --clausifier_options --tstp-format
% 0.40/0.72 % --stdin false
% 0.40/0.72 % --dbg_backtrace false
% 0.40/0.72 % --dbg_dump_prop_clauses false
% 0.40/0.72 % --dbg_dump_prop_clauses_file -
% 0.40/0.72 % --dbg_out_stat false
% 0.40/0.72
% 0.40/0.72 % ------ General Options
% 0.40/0.72
% 0.40/0.72 % --fof false
% 0.40/0.72 % --time_out_real 150.
% 0.40/0.72 % --time_out_prep_mult 0.2
% 0.40/0.72 % --time_out_virtual -1.
% 0.40/0.72 % --schedule none
% 0.40/0.72 % --ground_splitting input
% 0.40/0.72 % --splitting_nvd 16
% 0.40/0.72 % --non_eq_to_eq false
% 0.40/0.72 % --prep_gs_sim true
% 0.40/0.72 % --prep_unflatten false
% 0.40/0.72 % --prep_res_sim true
% 0.40/0.72 % --prep_upred true
% 0.40/0.72 % --res_sim_input true
% 0.40/0.72 % --clause_weak_htbl true
% 0.40/0.72 % --gc_record_bc_elim false
% 0.40/0.72 % --symbol_type_check false
% 0.40/0.72 % --clausify_out false
% 0.40/0.72 % --large_theory_mode false
% 0.40/0.72 % --prep_sem_filter none
% 0.40/0.72 % --prep_sem_filter_out false
% 0.40/0.72 % --preprocessed_out false
% 0.40/0.72 % --sub_typing false
% 0.40/0.72 % --brand_transform false
% 0.40/0.72 % --pure_diseq_elim true
% 0.40/0.72 % --min_unsat_core false
% 0.40/0.72 % --pred_elim true
% 0.40/0.72 % --add_important_lit false
% 0.40/0.72 % --soft_assumptions false
% 0.40/0.72 % --reset_solvers false
% 0.40/0.72 % --bc_imp_inh []
% 0.40/0.72 % --conj_cone_tolerance 1.5
% 0.40/0.72 % --prolific_symb_bound 500
% 0.40/0.72 % --lt_threshold 2000
% 0.40/0.72
% 0.40/0.72 % ------ SAT Options
% 0.40/0.72
% 0.40/0.72 % --sat_mode false
% 0.40/0.72 % --sat_fm_restart_options ""
% 0.40/0.72 % --sat_gr_def false
% 0.40/0.72 % --sat_epr_types true
% 0.40/0.72 % --sat_non_cyclic_types false
% 0.40/0.72 % --sat_finite_models false
% 0.40/0.72 % --sat_fm_lemmas false
% 0.40/0.72 % --sat_fm_prep false
% 0.40/0.72 % --sat_fm_uc_incr true
% 0.40/0.72 % --sat_out_model small
% 0.40/0.72 % --sat_out_clauses false
% 0.40/0.72
% 0.40/0.72 % ------ QBF Options
% 0.40/0.72
% 0.40/0.72 % --qbf_mode false
% 0.40/0.72 % --qbf_elim_univ true
% 0.40/0.72 % --qbf_sk_in true
% 0.40/0.72 % --qbf_pred_elim true
% 0.40/0.72 % --qbf_split 32
% 0.40/0.72
% 0.40/0.72 % ------ BMC1 Options
% 0.40/0.72
% 0.40/0.72 % --bmc1_incremental false
% 0.40/0.72 % --bmc1_axioms reachable_all
% 0.40/0.72 % --bmc1_min_bound 0
% 0.40/0.72 % --bmc1_max_bound -1
% 0.40/0.72 % --bmc1_max_bound_default -1
% 0.40/0.72 % --bmc1_symbol_reachability true
% 0.40/0.72 % --bmc1_property_lemmas false
% 0.40/0.72 % --bmc1_k_induction false
% 0.40/0.72 % --bmc1_non_equiv_states false
% 0.40/0.72 % --bmc1_deadlock false
% 0.40/0.72 % --bmc1_ucm false
% 0.40/0.72 % --bmc1_add_unsat_core none
% 0.40/0.72 % --bmc1_unsat_core_children false
% 0.40/0.72 % --bmc1_unsat_core_extrapolate_axioms false
% 0.40/0.72 % --bmc1_out_stat full
% 0.40/0.72 % --bmc1_ground_init false
% 0.40/0.72 % --bmc1_pre_inst_next_state false
% 0.40/0.72 % --bmc1_pre_inst_state false
% 0.40/0.72 % --bmc1_pre_inst_reach_state false
% 0.40/0.72 % --bmc1_out_unsat_core false
% 0.40/0.72 % --bmc1_aig_witness_out false
% 0.40/0.72 % --bmc1_verbose false
% 0.40/0.72 % --bmc1_dump_clauses_tptp false
% 0.40/0.72 % --bmc1_dump_unsat_core_tptp false
% 0.40/0.72 % --bmc1_dump_file -
% 0.40/0.72 % --bmc1_ucm_expand_uc_limit 128
% 0.40/0.72 % --bmc1_ucm_n_expand_iterations 6
% 0.40/0.72 % --bmc1_ucm_extend_mode 1
% 0.40/0.72 % --bmc1_ucm_init_mode 2
% 0.40/0.72 % --bmc1_ucm_cone_mode none
% 0.40/0.72 % --bmc1_ucm_reduced_relation_type 0
% 0.40/0.72 % --bmc1_ucm_relax_model 4
% 0.40/0.72 % --bmc1_ucm_full_tr_after_sat true
% 0.40/0.72 % --bmc1_ucm_expand_neg_assumptions false
% 0.40/0.72 % --bmc1_ucm_layered_model none
% 0.40/0.72 % --bmc1_ucm_max_lemma_size 10
% 0.40/0.72
% 0.40/0.72 % ------ AIG Options
% 0.40/0.72
% 0.40/0.72 % --aig_mode false
% 0.40/0.72
% 0.40/0.72 % ------ Instantiation Options
% 0.40/0.72
% 0.40/0.72 % --instantiation_flag true
% 0.40/0.72 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.40/0.72 % --inst_solver_per_active 750
% 0.40/0.72 % --inst_solver_calls_frac 0.5
% 0.40/0.72 % --inst_passive_queue_type priority_queues
% 0.40/0.72 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.40/0.72 % --inst_passive_queues_freq [25;2]
% 0.40/0.72 % --inst_dismatching true
% 0.40/0.72 % --inst_eager_unprocessed_to_passive true
% 0.40/0.72 % --inst_prop_sim_given true
% 0.40/0.72 % --inst_prop_sim_new false
% 0.40/0.72 % --inst_orphan_elimination true
% 0.40/0.72 % --inst_learning_loop_flag true
% 0.40/0.72 % --inst_learning_start 3000
% 0.40/0.72 % --inst_learning_factor 2
% 0.40/0.72 % --inst_start_prop_sim_after_learn 3
% 0.40/0.72 % --inst_sel_renew solver
% 0.40/0.72 % --inst_lit_activity_flag true
% 0.40/0.72 % --inst_out_proof true
% 0.40/0.72
% 0.40/0.72 % ------ Resolution Options
% 0.40/0.72
% 0.40/0.72 % --resolution_flag true
% 0.40/0.72 % --res_lit_sel kbo_max
% 0.40/0.72 % --res_to_prop_solver none
% 0.40/0.72 % --res_prop_simpl_new false
% 0.40/0.72 % --res_prop_simpl_given false
% 0.40/0.72 % --res_passive_queue_type priority_queues
% 0.40/0.72 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.40/0.72 % --res_passive_queues_freq [15;5]
% 0.40/0.72 % --res_forward_subs full
% 0.40/0.72 % --res_backward_subs full
% 0.40/0.72 % --res_forward_subs_resolution true
% 0.40/0.72 % --res_backward_subs_resolution true
% 0.40/0.72 % --res_orphan_elimination false
% 0.40/0.72 % --res_time_limit 1000.
% 0.40/0.72 % --res_out_proof true
% 0.40/0.72 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_107e63.s
% 0.40/0.72 % --modulo true
% 0.40/0.72
% 0.40/0.72 % ------ Combination Options
% 0.40/0.72
% 0.40/0.72 % --comb_res_mult 1000
% 0.40/0.72 % --comb_inst_mult 300
% 0.40/0.72 % ------
% 0.40/0.72
% 0.40/0.72
% 0.40/0.72
% 0.40/0.72 % ------ Proving...
% 0.40/0.72 % warning: shown sat in sat incomplete mode
% 0.40/0.72 %
% 0.40/0.72
% 0.40/0.72
% 0.40/0.72
% 0.40/0.72
% 0.40/0.72 cnf(c_52,plain,
% 0.40/0.72 ( circuit(top(connect(table(n0,n0,n1,n1),nil)),nil,bottom(connect(table(n0,n1,n0,n1),nil))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_9) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_76,plain,
% 0.40/0.72 ( circuit(top(connect(table(n0,n0,n1,n1),nil)),nil,bottom(connect(table(n0,n1,n0,n1),nil))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_52]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_83,plain,
% 0.40/0.72 ( circuit(top(connect(table(n0,n0,n1,n1),nil)),nil,bottom(connect(table(n0,n1,n0,n1),nil))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_76]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_84,plain,
% 0.40/0.72 ( circuit(top(connect(table(n0,n0,n1,n1),nil)),nil,bottom(connect(table(n0,n1,n0,n1),nil))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_83]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_87,plain,
% 0.40/0.72 ( circuit(top(connect(table(n0,n0,n1,n1),nil)),nil,bottom(connect(table(n0,n1,n0,n1),nil))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_84]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_225,plain,
% 0.40/0.72 ( circuit(top(connect(table(n0,n0,n1,n1),nil)),nil,bottom(connect(table(n0,n1,n0,n1),nil))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_87]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_51,negated_conjecture,
% 0.40/0.72 ( ~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_8) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_78,negated_conjecture,
% 0.40/0.72 ( ~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_51]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_82,negated_conjecture,
% 0.40/0.72 ( ~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_78]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_85,negated_conjecture,
% 0.40/0.72 ( ~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_82]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_86,negated_conjecture,
% 0.40/0.72 ( ~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_85]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_223,negated_conjecture,
% 0.40/0.72 ( ~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_86]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_46,plain,
% 0.40/0.72 ( circuit(top(X0),X1,bottom(X0)) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_88_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_217,plain,
% 0.40/0.72 ( circuit(top(X0),X1,bottom(X0)) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_46]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_28,plain,
% 0.40/0.72 ( ~ circuit(top(X0),middle(X1),bottom(X2))
% 0.40/0.72 | circuit(top(X0),middle(not(X1)),bottom(X2)) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_74_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_197,plain,
% 0.40/0.72 ( ~ circuit(top(X0),middle(X1),bottom(X2))
% 0.40/0.72 | circuit(top(X0),middle(not(X1)),bottom(X2)) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_28]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_198,plain,
% 0.40/0.72 ( circuit(top(X0),middle(not(X1)),bottom(X2))
% 0.40/0.72 | ~ circuit(top(X0),middle(X1),bottom(X2)) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_197]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_26,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3)))
% 0.40/0.72 | circuit(top(X1),middle(or(X0,X2)),bottom(X3)) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_73_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_193,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3)))
% 0.40/0.72 | circuit(top(X1),middle(or(X0,X2)),bottom(X3)) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_26]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_24,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3)))
% 0.40/0.72 | circuit(top(X1),middle(and(X0,X2)),bottom(X3)) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_72_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_189,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3)))
% 0.40/0.72 | circuit(top(X1),middle(and(X0,X2)),bottom(X3)) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_24]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_22,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3)))
% 0.40/0.72 | circuit(top(connect(not(X0),X1)),nil,bottom(connect(not(X2),X3))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_71_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_185,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3)))
% 0.40/0.72 | circuit(top(connect(not(X0),X1)),nil,bottom(connect(not(X2),X3))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_22]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_186,plain,
% 0.40/0.72 ( circuit(top(connect(not(X0),X1)),nil,bottom(connect(not(X2),X3)))
% 0.40/0.72 | ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3))) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_185]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_20,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3)))
% 0.40/0.72 | circuit(top(connect(X0,X1)),middle(or(X0,X2)),bottom(connect(X2,X3))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_70_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_181,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3)))
% 0.40/0.72 | circuit(top(connect(X0,X1)),middle(or(X0,X2)),bottom(connect(X2,X3))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_20]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_182,plain,
% 0.40/0.72 ( circuit(top(connect(X0,X1)),middle(or(X0,X2)),bottom(connect(X2,X3)))
% 0.40/0.72 | ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3))) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_181]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_18,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3)))
% 0.40/0.72 | circuit(top(connect(X0,X1)),middle(and(X0,X2)),bottom(connect(X2,X3))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_69_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_177,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3)))
% 0.40/0.72 | circuit(top(connect(X0,X1)),middle(and(X0,X2)),bottom(connect(X2,X3))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_18]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_178,plain,
% 0.40/0.72 ( circuit(top(connect(X0,X1)),middle(and(X0,X2)),bottom(connect(X2,X3)))
% 0.40/0.72 | ~ circuit(top(connect(X0,X1)),nil,bottom(connect(X2,X3))) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_177]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_16,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(not(X0),X1)),middle(X2),bottom(connect(not(X3),X4))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_68_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_173,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(not(X0),X1)),middle(X2),bottom(connect(not(X3),X4))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_16]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_174,plain,
% 0.40/0.72 ( circuit(top(connect(not(X0),X1)),middle(X2),bottom(connect(not(X3),X4)))
% 0.40/0.72 | ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4))) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_173]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_14,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(or(X2,X0),X1)),nil,bottom(connect(or(X2,X3),X4))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_67_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_169,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(or(X2,X0),X1)),nil,bottom(connect(or(X2,X3),X4))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_14]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_170,plain,
% 0.40/0.72 ( circuit(top(connect(or(X0,X1),X2)),nil,bottom(connect(or(X0,X3),X4)))
% 0.40/0.72 | ~ circuit(top(connect(X1,X2)),middle(X0),bottom(connect(X3,X4))) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_169]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_12,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(and(X2,X0),X1)),nil,bottom(connect(and(X2,X3),X4))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_66_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_165,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(and(X2,X0),X1)),nil,bottom(connect(and(X2,X3),X4))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_12]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_166,plain,
% 0.40/0.72 ( circuit(top(connect(and(X0,X1),X2)),nil,bottom(connect(and(X0,X3),X4)))
% 0.40/0.72 | ~ circuit(top(connect(X1,X2)),middle(X0),bottom(connect(X3,X4))) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_165]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_10,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(or(X2,X0),X1)),middle(X2),bottom(connect(or(X2,X3),X4))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_65_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_161,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(or(X2,X0),X1)),middle(X2),bottom(connect(or(X2,X3),X4))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_10]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_162,plain,
% 0.40/0.72 ( circuit(top(connect(or(X0,X1),X2)),middle(X0),bottom(connect(or(X0,X3),X4)))
% 0.40/0.72 | ~ circuit(top(connect(X1,X2)),middle(X0),bottom(connect(X3,X4))) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_161]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_8,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(and(X2,X0),X1)),middle(X2),bottom(connect(and(X2,X3),X4))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_64_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_157,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(and(X2,X0),X1)),middle(X2),bottom(connect(and(X2,X3),X4))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_8]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_158,plain,
% 0.40/0.72 ( circuit(top(connect(and(X0,X1),X2)),middle(X0),bottom(connect(and(X0,X3),X4)))
% 0.40/0.72 | ~ circuit(top(connect(X1,X2)),middle(X0),bottom(connect(X3,X4))) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_157]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_6,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(or(X2,X0),connect(X0,X1))),nil,bottom(connect(or(X2,X3),connect(X3,X4)))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_63_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_153,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(or(X2,X0),connect(X0,X1))),nil,bottom(connect(or(X2,X3),connect(X3,X4)))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_6]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_154,plain,
% 0.40/0.72 ( circuit(top(connect(or(X0,X1),connect(X1,X2))),nil,bottom(connect(or(X0,X3),connect(X3,X4))))
% 0.40/0.72 | ~ circuit(top(connect(X1,X2)),middle(X0),bottom(connect(X3,X4))) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_153]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_4,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(and(X2,X0),connect(X0,X1))),nil,bottom(connect(and(X2,X3),connect(X3,X4)))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_62_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_149,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,X1)),middle(X2),bottom(connect(X3,X4)))
% 0.40/0.72 | circuit(top(connect(and(X2,X0),connect(X0,X1))),nil,bottom(connect(and(X2,X3),connect(X3,X4)))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_4]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_150,plain,
% 0.40/0.72 ( circuit(top(connect(and(X0,X1),connect(X1,X2))),nil,bottom(connect(and(X0,X3),connect(X3,X4))))
% 0.40/0.72 | ~ circuit(top(connect(X1,X2)),middle(X0),bottom(connect(X3,X4))) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_149]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_2,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,connect(X1,X2))),middle(X3),bottom(connect(X4,connect(X5,X6))))
% 0.40/0.72 | circuit(top(connect(or(X0,X1),X2)),middle(X3),bottom(connect(or(X4,X5),X6))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_61_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_145,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,connect(X1,X2))),middle(X3),bottom(connect(X4,connect(X5,X6))))
% 0.40/0.72 | circuit(top(connect(or(X0,X1),X2)),middle(X3),bottom(connect(or(X4,X5),X6))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_2]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_146,plain,
% 0.40/0.72 ( circuit(top(connect(or(X0,X1),X2)),middle(X3),bottom(connect(or(X4,X5),X6)))
% 0.40/0.72 | ~ circuit(top(connect(X0,connect(X1,X2))),middle(X3),bottom(connect(X4,connect(X5,X6)))) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_145]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_0,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,connect(X1,X2))),middle(X3),bottom(connect(X4,connect(X5,X6))))
% 0.40/0.72 | circuit(top(connect(and(X0,X1),X2)),middle(X3),bottom(connect(and(X4,X5),X6))) ),
% 0.40/0.72 file('/export/starexec/sandbox/tmp/iprover_modulo_9169fd.p', c_0_60_0) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_141,plain,
% 0.40/0.72 ( ~ circuit(top(connect(X0,connect(X1,X2))),middle(X3),bottom(connect(X4,connect(X5,X6))))
% 0.40/0.72 | circuit(top(connect(and(X0,X1),X2)),middle(X3),bottom(connect(and(X4,X5),X6))) ),
% 0.40/0.72 inference(copy,[status(esa)],[c_0]) ).
% 0.40/0.72
% 0.40/0.72 cnf(c_142,plain,
% 0.40/0.72 ( circuit(top(connect(and(X0,X1),X2)),middle(X3),bottom(connect(and(X4,X5),X6)))
% 0.40/0.72 | ~ circuit(top(connect(X0,connect(X1,X2))),middle(X3),bottom(connect(X4,connect(X5,X6)))) ),
% 0.40/0.72 inference(rewriting,[status(thm)],[c_141]) ).
% 0.40/0.72
% 0.40/0.72
% 0.40/0.72
% 0.40/0.72 % ------ Statistics
% 0.40/0.72
% 0.40/0.72 % ------ General
% 0.40/0.72
% 0.40/0.72 % num_of_input_clauses: 53
% 0.40/0.72 % num_of_input_neg_conjectures: 1
% 0.40/0.72 % num_of_splits: 0
% 0.40/0.72 % num_of_split_atoms: 0
% 0.40/0.72 % num_of_sem_filtered_clauses: 0
% 0.40/0.72 % num_of_subtypes: 0
% 0.40/0.72 % monotx_restored_types: 0
% 0.40/0.72 % sat_num_of_epr_types: 0
% 0.40/0.72 % sat_num_of_non_cyclic_types: 0
% 0.40/0.72 % sat_guarded_non_collapsed_types: 0
% 0.40/0.72 % is_epr: 0
% 0.40/0.72 % is_horn: 1
% 0.40/0.72 % has_eq: 1
% 0.40/0.72 % num_pure_diseq_elim: 0
% 0.40/0.72 % simp_replaced_by: 0
% 0.40/0.72 % res_preprocessed: 3
% 0.40/0.72 % prep_upred: 0
% 0.40/0.72 % prep_unflattend: 0
% 0.40/0.72 % pred_elim_cands: 0
% 0.40/0.72 % pred_elim: 0
% 0.40/0.72 % pred_elim_cl: 0
% 0.40/0.72 % pred_elim_cycles: 0
% 0.40/0.72 % forced_gc_time: 0
% 0.40/0.72 % gc_basic_clause_elim: 0
% 0.40/0.72 % parsing_time: 0.004
% 0.40/0.72 % sem_filter_time: 0.
% 0.40/0.72 % pred_elim_time: 0.
% 0.40/0.72 % out_proof_time: 0.
% 0.40/0.72 % monotx_time: 0.
% 0.40/0.72 % subtype_inf_time: 0.
% 0.40/0.72 % unif_index_cands_time: 0.
% 0.40/0.72 % unif_index_add_time: 0.
% 0.40/0.72 % total_time: 0.303
% 0.40/0.72 % num_of_symbols: 37
% 0.40/0.72 % num_of_terms: 295
% 0.40/0.72
% 0.40/0.72 % ------ Propositional Solver
% 0.40/0.72
% 0.40/0.72 % prop_solver_calls: 1
% 0.40/0.72 % prop_fast_solver_calls: 5
% 0.40/0.72 % prop_num_of_clauses: 69
% 0.40/0.72 % prop_preprocess_simplified: 126
% 0.40/0.72 % prop_fo_subsumed: 0
% 0.40/0.72 % prop_solver_time: 0.
% 0.40/0.72 % prop_fast_solver_time: 0.
% 0.40/0.72 % prop_unsat_core_time: 0.
% 0.40/0.72
% 0.40/0.72 % ------ QBF
% 0.40/0.72
% 0.40/0.72 % qbf_q_res: 0
% 0.40/0.72 % qbf_num_tautologies: 0
% 0.40/0.72 % qbf_prep_cycles: 0
% 0.40/0.72
% 0.40/0.72 % ------ BMC1
% 0.40/0.72
% 0.40/0.72 % bmc1_current_bound: -1
% 0.40/0.72 % bmc1_last_solved_bound: -1
% 0.40/0.72 % bmc1_unsat_core_size: -1
% 0.40/0.72 % bmc1_unsat_core_parents_size: -1
% 0.40/0.72 % bmc1_merge_next_fun: 0
% 0.40/0.72 % bmc1_unsat_core_clauses_time: 0.
% 0.40/0.72
% 0.40/0.72 % ------ Instantiation
% 0.40/0.72
% 0.40/0.72 % inst_num_of_clauses: 53
% 0.40/0.72 % inst_num_in_passive: 0
% 0.40/0.72 % inst_num_in_active: 0
% 0.40/0.72 % inst_num_in_unprocessed: 53
% 0.40/0.72 % inst_num_of_loops: 0
% 0.40/0.72 % inst_num_of_learning_restarts: 0
% 0.40/0.72 % inst_num_moves_active_passive: 0
% 0.40/0.72 % inst_lit_activity: 0
% 0.40/0.72 % inst_lit_activity_moves: 0
% 0.40/0.72 % inst_num_tautologies: 0
% 0.40/0.72 % inst_num_prop_implied: 0
% 0.40/0.72 % inst_num_existing_simplified: 0
% 0.40/0.72 % inst_num_eq_res_simplified: 0
% 0.40/0.72 % inst_num_child_elim: 0
% 0.40/0.72 % inst_num_of_dismatching_blockings: 0
% 0.40/0.72 % inst_num_of_non_proper_insts: 0
% 0.40/0.72 % inst_num_of_duplicates: 0
% 0.40/0.72 % inst_inst_num_from_inst_to_res: 0
% 0.40/0.72 % inst_dismatching_checking_time: 0.
% 0.40/0.72
% 0.40/0.72 % ------ Resolution
% 0.40/0.72
% 0.40/0.72 % res_num_of_clauses: 53
% 0.40/0.72 % res_num_in_passive: 0
% 0.40/0.72 % res_num_in_active: 18
% 0.40/0.72 % res_num_of_loops: 3
% 0.40/0.72 % res_forward_subset_subsumed: 15
% 0.40/0.72 % res_backward_subset_subsumed: 0
% 0.40/0.72 % res_forward_subsumed: 0
% 0.40/0.72 % res_backward_subsumed: 0
% 0.40/0.72 % res_forward_subsumption_resolution: 0
% 0.40/0.72 % res_backward_subsumption_resolution: 0
% 0.40/0.72 % res_clause_to_clause_subsumption: 4
% 0.40/0.72 % res_orphan_elimination: 0
% 0.40/0.72 % res_tautology_del: 0
% 0.40/0.72 % res_num_eq_res_simplified: 0
% 0.40/0.72 % res_num_sel_changes: 0
% 0.40/0.72 % res_moves_from_active_to_pass: 0
% 0.40/0.72
% 0.40/0.73 % Status Unknown
% 0.57/0.77 % Orienting using strategy ClausalAll
% 0.57/0.77 % Orientation found
% 0.57/0.77 % 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_107e63.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_9169fd.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_b8910f | grep -v "SZS"
% 0.57/0.79
% 0.57/0.79 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.57/0.79
% 0.57/0.79 %
% 0.57/0.79 % ------ iProver source info
% 0.57/0.79
% 0.57/0.79 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.57/0.79 % git: non_committed_changes: true
% 0.57/0.79 % git: last_make_outside_of_git: true
% 0.57/0.79
% 0.57/0.79 %
% 0.57/0.79 % ------ Input Options
% 0.57/0.79
% 0.57/0.79 % --out_options all
% 0.57/0.79 % --tptp_safe_out true
% 0.57/0.79 % --problem_path ""
% 0.57/0.79 % --include_path ""
% 0.57/0.79 % --clausifier .//eprover
% 0.57/0.79 % --clausifier_options --tstp-format
% 0.57/0.79 % --stdin false
% 0.57/0.79 % --dbg_backtrace false
% 0.57/0.79 % --dbg_dump_prop_clauses false
% 0.57/0.79 % --dbg_dump_prop_clauses_file -
% 0.57/0.79 % --dbg_out_stat false
% 0.57/0.79
% 0.57/0.79 % ------ General Options
% 0.57/0.79
% 0.57/0.79 % --fof false
% 0.57/0.79 % --time_out_real 150.
% 0.57/0.79 % --time_out_prep_mult 0.2
% 0.57/0.79 % --time_out_virtual -1.
% 0.57/0.79 % --schedule none
% 0.57/0.79 % --ground_splitting input
% 0.57/0.79 % --splitting_nvd 16
% 0.57/0.79 % --non_eq_to_eq false
% 0.57/0.79 % --prep_gs_sim true
% 0.57/0.79 % --prep_unflatten false
% 0.57/0.79 % --prep_res_sim true
% 0.57/0.79 % --prep_upred true
% 0.57/0.79 % --res_sim_input true
% 0.57/0.79 % --clause_weak_htbl true
% 0.57/0.79 % --gc_record_bc_elim false
% 0.57/0.79 % --symbol_type_check false
% 0.57/0.79 % --clausify_out false
% 0.57/0.79 % --large_theory_mode false
% 0.57/0.79 % --prep_sem_filter none
% 0.57/0.79 % --prep_sem_filter_out false
% 0.57/0.79 % --preprocessed_out false
% 0.57/0.79 % --sub_typing false
% 0.57/0.79 % --brand_transform false
% 0.57/0.79 % --pure_diseq_elim true
% 0.57/0.79 % --min_unsat_core false
% 0.57/0.79 % --pred_elim true
% 0.57/0.79 % --add_important_lit false
% 0.57/0.79 % --soft_assumptions false
% 0.57/0.79 % --reset_solvers false
% 0.57/0.79 % --bc_imp_inh []
% 0.57/0.79 % --conj_cone_tolerance 1.5
% 0.57/0.79 % --prolific_symb_bound 500
% 0.57/0.79 % --lt_threshold 2000
% 0.57/0.79
% 0.57/0.79 % ------ SAT Options
% 0.57/0.79
% 0.57/0.79 % --sat_mode false
% 0.57/0.79 % --sat_fm_restart_options ""
% 0.57/0.79 % --sat_gr_def false
% 0.57/0.79 % --sat_epr_types true
% 0.57/0.79 % --sat_non_cyclic_types false
% 0.57/0.79 % --sat_finite_models false
% 0.57/0.79 % --sat_fm_lemmas false
% 0.57/0.79 % --sat_fm_prep false
% 0.57/0.79 % --sat_fm_uc_incr true
% 0.57/0.79 % --sat_out_model small
% 0.57/0.79 % --sat_out_clauses false
% 0.57/0.79
% 0.57/0.79 % ------ QBF Options
% 0.57/0.79
% 0.57/0.79 % --qbf_mode false
% 0.57/0.79 % --qbf_elim_univ true
% 0.57/0.79 % --qbf_sk_in true
% 0.57/0.79 % --qbf_pred_elim true
% 0.57/0.79 % --qbf_split 32
% 0.57/0.79
% 0.57/0.79 % ------ BMC1 Options
% 0.57/0.79
% 0.57/0.79 % --bmc1_incremental false
% 0.57/0.79 % --bmc1_axioms reachable_all
% 0.57/0.79 % --bmc1_min_bound 0
% 0.57/0.79 % --bmc1_max_bound -1
% 0.57/0.79 % --bmc1_max_bound_default -1
% 0.57/0.79 % --bmc1_symbol_reachability true
% 0.57/0.79 % --bmc1_property_lemmas false
% 0.57/0.79 % --bmc1_k_induction false
% 0.57/0.79 % --bmc1_non_equiv_states false
% 0.57/0.79 % --bmc1_deadlock false
% 0.57/0.79 % --bmc1_ucm false
% 0.57/0.79 % --bmc1_add_unsat_core none
% 0.57/0.79 % --bmc1_unsat_core_children false
% 0.57/0.79 % --bmc1_unsat_core_extrapolate_axioms false
% 0.57/0.79 % --bmc1_out_stat full
% 0.57/0.79 % --bmc1_ground_init false
% 0.57/0.79 % --bmc1_pre_inst_next_state false
% 0.57/0.79 % --bmc1_pre_inst_state false
% 0.57/0.79 % --bmc1_pre_inst_reach_state false
% 0.57/0.79 % --bmc1_out_unsat_core false
% 0.57/0.79 % --bmc1_aig_witness_out false
% 0.57/0.79 % --bmc1_verbose false
% 0.57/0.79 % --bmc1_dump_clauses_tptp false
% 0.61/1.07 % --bmc1_dump_unsat_core_tptp false
% 0.61/1.07 % --bmc1_dump_file -
% 0.61/1.07 % --bmc1_ucm_expand_uc_limit 128
% 0.61/1.07 % --bmc1_ucm_n_expand_iterations 6
% 0.61/1.07 % --bmc1_ucm_extend_mode 1
% 0.61/1.07 % --bmc1_ucm_init_mode 2
% 0.61/1.07 % --bmc1_ucm_cone_mode none
% 0.61/1.07 % --bmc1_ucm_reduced_relation_type 0
% 0.61/1.07 % --bmc1_ucm_relax_model 4
% 0.61/1.07 % --bmc1_ucm_full_tr_after_sat true
% 0.61/1.07 % --bmc1_ucm_expand_neg_assumptions false
% 0.61/1.07 % --bmc1_ucm_layered_model none
% 0.61/1.07 % --bmc1_ucm_max_lemma_size 10
% 0.61/1.07
% 0.61/1.07 % ------ AIG Options
% 0.61/1.07
% 0.61/1.07 % --aig_mode false
% 0.61/1.07
% 0.61/1.07 % ------ Instantiation Options
% 0.61/1.07
% 0.61/1.07 % --instantiation_flag true
% 0.61/1.07 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.61/1.07 % --inst_solver_per_active 750
% 0.61/1.07 % --inst_solver_calls_frac 0.5
% 0.61/1.07 % --inst_passive_queue_type priority_queues
% 0.61/1.07 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.61/1.07 % --inst_passive_queues_freq [25;2]
% 0.61/1.07 % --inst_dismatching true
% 0.61/1.07 % --inst_eager_unprocessed_to_passive true
% 0.61/1.07 % --inst_prop_sim_given true
% 0.61/1.07 % --inst_prop_sim_new false
% 0.61/1.07 % --inst_orphan_elimination true
% 0.61/1.07 % --inst_learning_loop_flag true
% 0.61/1.07 % --inst_learning_start 3000
% 0.61/1.07 % --inst_learning_factor 2
% 0.61/1.07 % --inst_start_prop_sim_after_learn 3
% 0.61/1.07 % --inst_sel_renew solver
% 0.61/1.07 % --inst_lit_activity_flag true
% 0.61/1.07 % --inst_out_proof true
% 0.61/1.07
% 0.61/1.07 % ------ Resolution Options
% 0.61/1.07
% 0.61/1.07 % --resolution_flag true
% 0.61/1.07 % --res_lit_sel kbo_max
% 0.61/1.07 % --res_to_prop_solver none
% 0.61/1.07 % --res_prop_simpl_new false
% 0.61/1.07 % --res_prop_simpl_given false
% 0.61/1.07 % --res_passive_queue_type priority_queues
% 0.61/1.07 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.61/1.07 % --res_passive_queues_freq [15;5]
% 0.61/1.07 % --res_forward_subs full
% 0.61/1.07 % --res_backward_subs full
% 0.61/1.07 % --res_forward_subs_resolution true
% 0.61/1.07 % --res_backward_subs_resolution true
% 0.61/1.07 % --res_orphan_elimination false
% 0.61/1.07 % --res_time_limit 1000.
% 0.61/1.07 % --res_out_proof true
% 0.61/1.07 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_107e63.s
% 0.61/1.07 % --modulo true
% 0.61/1.07
% 0.61/1.07 % ------ Combination Options
% 0.61/1.07
% 0.61/1.07 % --comb_res_mult 1000
% 0.61/1.07 % --comb_inst_mult 300
% 0.61/1.07 % ------
% 0.61/1.07
% 0.61/1.07 % ------ Parsing...% successful
% 0.61/1.07
% 0.61/1.07 % ------ 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.07
% 0.61/1.07 % ------ Proving...
% 0.61/1.07 % ------ Problem Properties
% 0.61/1.07
% 0.61/1.07 %
% 0.61/1.07 % EPR false
% 0.61/1.07 % Horn true
% 0.61/1.07 % Has equality true
% 0.61/1.07
% 0.61/1.07 % % ------ Input Options Time Limit: Unbounded
% 0.61/1.07
% 0.61/1.07
% 0.61/1.07 Compiling...
% 0.61/1.07 Loading plugin: done.
% 0.61/1.07 Compiling...
% 0.61/1.07 Loading plugin: done.
% 0.61/1.07 % % ------ Current options:
% 0.61/1.07
% 0.61/1.07 % ------ Input Options
% 0.61/1.07
% 0.61/1.07 % --out_options all
% 0.61/1.07 % --tptp_safe_out true
% 0.61/1.07 % --problem_path ""
% 0.61/1.07 % --include_path ""
% 0.61/1.07 % --clausifier .//eprover
% 0.61/1.07 % --clausifier_options --tstp-format
% 0.61/1.07 % --stdin false
% 0.61/1.07 % --dbg_backtrace false
% 0.61/1.07 % --dbg_dump_prop_clauses false
% 0.61/1.07 % --dbg_dump_prop_clauses_file -
% 0.61/1.07 % --dbg_out_stat false
% 0.61/1.07
% 0.61/1.07 % ------ General Options
% 0.61/1.07
% 0.61/1.07 % --fof false
% 0.61/1.07 % --time_out_real 150.
% 0.61/1.07 % --time_out_prep_mult 0.2
% 0.61/1.07 % --time_out_virtual -1.
% 0.61/1.07 % --schedule none
% 0.61/1.07 % --ground_splitting input
% 0.61/1.07 % --splitting_nvd 16
% 0.61/1.07 % --non_eq_to_eq false
% 0.61/1.07 % --prep_gs_sim true
% 0.61/1.07 % --prep_unflatten false
% 0.61/1.07 % --prep_res_sim true
% 0.61/1.07 % --prep_upred true
% 0.61/1.07 % --res_sim_input true
% 0.61/1.07 % --clause_weak_htbl true
% 0.61/1.07 % --gc_record_bc_elim false
% 0.61/1.07 % --symbol_type_check false
% 0.61/1.07 % --clausify_out false
% 0.61/1.07 % --large_theory_mode false
% 0.61/1.07 % --prep_sem_filter none
% 0.61/1.07 % --prep_sem_filter_out false
% 0.61/1.07 % --preprocessed_out false
% 0.61/1.07 % --sub_typing false
% 0.61/1.07 % --brand_transform false
% 0.61/1.07 % --pure_diseq_elim true
% 0.61/1.07 % --min_unsat_core false
% 0.61/1.07 % --pred_elim true
% 0.61/1.07 % --add_important_lit false
% 0.61/1.07 % --soft_assumptions false
% 0.61/1.07 % --reset_solvers false
% 0.61/1.07 % --bc_imp_inh []
% 0.61/1.07 % --conj_cone_tolerance 1.5
% 0.61/1.07 % --prolific_symb_bound 500
% 0.61/1.07 % --lt_threshold 2000
% 0.61/1.07
% 0.61/1.07 % ------ SAT Options
% 0.61/1.07
% 0.61/1.07 % --sat_mode false
% 0.61/1.07 % --sat_fm_restart_options ""
% 0.61/1.07 % --sat_gr_def false
% 0.61/1.07 % --sat_epr_types true
% 0.61/1.07 % --sat_non_cyclic_types false
% 0.61/1.07 % --sat_finite_models false
% 0.61/1.07 % --sat_fm_lemmas false
% 0.61/1.07 % --sat_fm_prep false
% 0.61/1.07 % --sat_fm_uc_incr true
% 0.61/1.07 % --sat_out_model small
% 0.61/1.07 % --sat_out_clauses false
% 0.61/1.07
% 0.61/1.07 % ------ QBF Options
% 0.61/1.07
% 0.61/1.07 % --qbf_mode false
% 0.61/1.07 % --qbf_elim_univ true
% 0.61/1.07 % --qbf_sk_in true
% 0.61/1.07 % --qbf_pred_elim true
% 0.61/1.07 % --qbf_split 32
% 0.61/1.07
% 0.61/1.07 % ------ BMC1 Options
% 0.61/1.07
% 0.61/1.07 % --bmc1_incremental false
% 0.61/1.07 % --bmc1_axioms reachable_all
% 0.61/1.07 % --bmc1_min_bound 0
% 0.61/1.07 % --bmc1_max_bound -1
% 0.61/1.07 % --bmc1_max_bound_default -1
% 0.61/1.07 % --bmc1_symbol_reachability true
% 0.61/1.07 % --bmc1_property_lemmas false
% 0.61/1.07 % --bmc1_k_induction false
% 0.61/1.07 % --bmc1_non_equiv_states false
% 0.61/1.07 % --bmc1_deadlock false
% 0.61/1.07 % --bmc1_ucm false
% 0.61/1.07 % --bmc1_add_unsat_core none
% 0.61/1.07 % --bmc1_unsat_core_children false
% 0.61/1.07 % --bmc1_unsat_core_extrapolate_axioms false
% 0.61/1.07 % --bmc1_out_stat full
% 0.61/1.07 % --bmc1_ground_init false
% 0.61/1.07 % --bmc1_pre_inst_next_state false
% 0.61/1.07 % --bmc1_pre_inst_state false
% 0.61/1.07 % --bmc1_pre_inst_reach_state false
% 0.61/1.07 % --bmc1_out_unsat_core false
% 0.61/1.07 % --bmc1_aig_witness_out false
% 0.61/1.07 % --bmc1_verbose false
% 0.61/1.07 % --bmc1_dump_clauses_tptp false
% 0.61/1.07 % --bmc1_dump_unsat_core_tptp false
% 0.61/1.07 % --bmc1_dump_file -
% 0.61/1.07 % --bmc1_ucm_expand_uc_limit 128
% 0.61/1.07 % --bmc1_ucm_n_expand_iterations 6
% 0.61/1.07 % --bmc1_ucm_extend_mode 1
% 0.61/1.07 % --bmc1_ucm_init_mode 2
% 0.61/1.07 % --bmc1_ucm_cone_mode none
% 0.61/1.07 % --bmc1_ucm_reduced_relation_type 0
% 0.61/1.07 % --bmc1_ucm_relax_model 4
% 0.61/1.07 % --bmc1_ucm_full_tr_after_sat true
% 0.61/1.07 % --bmc1_ucm_expand_neg_assumptions false
% 0.61/1.07 % --bmc1_ucm_layered_model none
% 0.61/1.07 % --bmc1_ucm_max_lemma_size 10
% 0.61/1.07
% 0.61/1.07 % ------ AIG Options
% 0.61/1.07
% 0.61/1.07 % --aig_mode false
% 0.61/1.07
% 0.61/1.07 % ------ Instantiation Options
% 0.61/1.07
% 0.61/1.07 % --instantiation_flag true
% 0.61/1.07 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.61/1.07 % --inst_solver_per_active 750
% 0.61/1.07 % --inst_solver_calls_frac 0.5
% 0.61/1.07 % --inst_passive_queue_type priority_queues
% 0.61/1.07 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.61/1.07 % --inst_passive_queues_freq [25;2]
% 0.61/1.07 % --inst_dismatching true
% 22.24/22.48 % --inst_eager_unprocessed_to_passive true
% 22.24/22.48 % --inst_prop_sim_given true
% 22.24/22.48 % --inst_prop_sim_new false
% 22.24/22.48 % --inst_orphan_elimination true
% 22.24/22.48 % --inst_learning_loop_flag true
% 22.24/22.48 % --inst_learning_start 3000
% 22.24/22.48 % --inst_learning_factor 2
% 22.24/22.48 % --inst_start_prop_sim_after_learn 3
% 22.24/22.48 % --inst_sel_renew solver
% 22.24/22.48 % --inst_lit_activity_flag true
% 22.24/22.48 % --inst_out_proof true
% 22.24/22.48
% 22.24/22.48 % ------ Resolution Options
% 22.24/22.48
% 22.24/22.48 % --resolution_flag true
% 22.24/22.48 % --res_lit_sel kbo_max
% 22.24/22.48 % --res_to_prop_solver none
% 22.24/22.48 % --res_prop_simpl_new false
% 22.24/22.48 % --res_prop_simpl_given false
% 22.24/22.48 % --res_passive_queue_type priority_queues
% 22.24/22.48 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 22.24/22.48 % --res_passive_queues_freq [15;5]
% 22.24/22.48 % --res_forward_subs full
% 22.24/22.48 % --res_backward_subs full
% 22.24/22.48 % --res_forward_subs_resolution true
% 22.24/22.48 % --res_backward_subs_resolution true
% 22.24/22.48 % --res_orphan_elimination false
% 22.24/22.48 % --res_time_limit 1000.
% 22.24/22.48 % --res_out_proof true
% 22.24/22.48 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_107e63.s
% 22.24/22.48 % --modulo true
% 22.24/22.48
% 22.24/22.48 % ------ Combination Options
% 22.24/22.48
% 22.24/22.48 % --comb_res_mult 1000
% 22.24/22.48 % --comb_inst_mult 300
% 22.24/22.48 % ------
% 22.24/22.48
% 22.24/22.48
% 22.24/22.48
% 22.24/22.48 % ------ Proving...
% 22.24/22.48 % warning: shown sat in sat incomplete mode
% 22.24/22.48 %
% 22.24/22.48
% 22.24/22.48
% 22.24/22.48 ------ Building Model...Done
% 22.24/22.48
% 22.24/22.48 %------ The model is defined over ground terms (initial term algebra).
% 22.24/22.48 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 22.24/22.48 %------ where \phi is a formula over the term algebra.
% 22.24/22.48 %------ If we have equality in the problem then it is also defined as a predicate above,
% 22.24/22.48 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 22.24/22.48 %------ See help for --sat_out_model for different model outputs.
% 22.24/22.48 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 22.24/22.48 %------ where the first argument stands for the sort ($i in the unsorted case)
% 22.24/22.48
% 22.24/22.48
% 22.24/22.48
% 22.24/22.48
% 22.24/22.48 %------ Negative definition of equality_sorted
% 22.24/22.48 fof(lit_def,axiom,
% 22.24/22.48 (! [X0,X0,X1] :
% 22.24/22.48 ( ~(equality_sorted(X0,X0,X1)) <=>
% 22.24/22.48 $false
% 22.24/22.48 )
% 22.24/22.48 )
% 22.24/22.48 ).
% 22.24/22.48
% 22.24/22.48 %------ Negative definition of circuit
% 22.24/22.48 fof(lit_def,axiom,
% 22.24/22.48 (! [X0,X1,X2] :
% 22.24/22.48 ( ~(circuit(X0,X1,X2)) <=>
% 22.24/22.48 (
% 22.24/22.48 (
% 22.24/22.48 ( X0=top(connect(table(n0,n1,n0,n1),nil)) & X1=nil & X2=bottom(connect(table(n0,n0,n1,n1),nil)) )
% 22.24/22.48 )
% 22.24/22.48
% 22.24/22.48 )
% 22.24/22.48 )
% 22.24/22.48 )
% 22.24/22.48 ).
% 22.24/22.48
% 22.24/22.48
% 22.24/22.48
% 22.24/22.48 % ------ Statistics
% 22.24/22.48
% 22.24/22.48 % ------ General
% 22.24/22.48
% 22.24/22.48 % num_of_input_clauses: 53
% 22.24/22.48 % num_of_input_neg_conjectures: 1
% 22.24/22.48 % num_of_splits: 0
% 22.24/22.48 % num_of_split_atoms: 0
% 22.24/22.48 % num_of_sem_filtered_clauses: 0
% 22.24/22.48 % num_of_subtypes: 0
% 22.24/22.48 % monotx_restored_types: 0
% 22.24/22.48 % sat_num_of_epr_types: 0
% 22.24/22.48 % sat_num_of_non_cyclic_types: 0
% 22.24/22.48 % sat_guarded_non_collapsed_types: 0
% 22.24/22.48 % is_epr: 0
% 22.24/22.48 % is_horn: 1
% 22.24/22.48 % has_eq: 1
% 22.24/22.48 % num_pure_diseq_elim: 0
% 22.24/22.48 % simp_replaced_by: 0
% 22.24/22.48 % res_preprocessed: 3
% 22.24/22.48 % prep_upred: 0
% 22.24/22.48 % prep_unflattend: 0
% 22.24/22.48 % pred_elim_cands: 0
% 22.24/22.48 % pred_elim: 0
% 22.24/22.48 % pred_elim_cl: 0
% 22.24/22.48 % pred_elim_cycles: 0
% 22.24/22.48 % forced_gc_time: 0
% 22.24/22.48 % gc_basic_clause_elim: 0
% 22.24/22.48 % parsing_time: 0.003
% 22.24/22.48 % sem_filter_time: 0.
% 22.24/22.48 % pred_elim_time: 0.
% 22.24/22.48 % out_proof_time: 0.
% 22.24/22.48 % monotx_time: 0.
% 22.24/22.48 % subtype_inf_time: 0.
% 22.24/22.48 % unif_index_cands_time: 0.103
% 22.24/22.48 % unif_index_add_time: 0.109
% 22.24/22.48 % total_time: 21.703
% 22.24/22.48 % num_of_symbols: 37
% 22.24/22.48 % num_of_terms: 378006
% 22.24/22.48
% 22.24/22.48 % ------ Propositional Solver
% 22.24/22.48
% 22.24/22.48 % prop_solver_calls: 20
% 22.24/22.48 % prop_fast_solver_calls: 5
% 22.24/22.48 % prop_num_of_clauses: 8715
% 22.24/22.48 % prop_preprocess_simplified: 12080
% 22.24/22.48 % prop_fo_subsumed: 0
% 22.24/22.48 % prop_solver_time: 0.002
% 22.24/22.48 % prop_fast_solver_time: 0.
% 22.24/22.48 % prop_unsat_core_time: 0.
% 22.24/22.48
% 22.24/22.48 % ------ QBF
% 22.24/22.48
% 22.24/22.48 % qbf_q_res: 0
% 22.24/22.48 % qbf_num_tautologies: 0
% 22.24/22.48 % qbf_prep_cycles: 0
% 22.24/22.48
% 22.24/22.48 % ------ BMC1
% 22.24/22.48
% 22.24/22.48 % bmc1_current_bound: -1
% 22.24/22.48 % bmc1_last_solved_bound: -1
% 22.24/22.48 % bmc1_unsat_core_size: -1
% 22.24/22.48 % bmc1_unsat_core_parents_size: -1
% 22.24/22.48 % bmc1_merge_next_fun: 0
% 22.24/22.48 % bmc1_unsat_core_clauses_time: 0.
% 22.24/22.48
% 22.24/22.48 % ------ Instantiation
% 22.24/22.48
% 22.24/22.48 % inst_num_of_clauses: 53
% 22.24/22.48 % inst_num_in_passive: 0
% 22.24/22.48 % inst_num_in_active: 53
% 22.24/22.48 % inst_num_in_unprocessed: 0
% 22.24/22.48 % inst_num_of_loops: 55
% 22.24/22.48 % inst_num_of_learning_restarts: 1
% 22.24/22.48 % inst_num_moves_active_passive: 0
% 22.24/22.48 % inst_lit_activity: 4
% 22.24/22.48 % inst_lit_activity_moves: 0
% 22.24/22.48 % inst_num_tautologies: 0
% 22.24/22.48 % inst_num_prop_implied: 0
% 22.24/22.48 % inst_num_existing_simplified: 0
% 22.24/22.48 % inst_num_eq_res_simplified: 0
% 22.24/22.48 % inst_num_child_elim: 0
% 22.24/22.48 % inst_num_of_dismatching_blockings: 0
% 22.24/22.48 % inst_num_of_non_proper_insts: 0
% 22.24/22.48 % inst_num_of_duplicates: 0
% 22.24/22.48 % inst_inst_num_from_inst_to_res: 0
% 22.24/22.48 % inst_dismatching_checking_time: 0.109
% 22.24/22.48
% 22.24/22.48 % ------ Resolution
% 22.24/22.48
% 22.24/22.48 % res_num_of_clauses: 64469
% 22.24/22.48 % res_num_in_passive: 53546
% 22.24/22.48 % res_num_in_active: 10888
% 22.24/22.48 % res_num_of_loops: 11000
% 22.24/22.48 % res_forward_subset_subsumed: 8085
% 22.24/22.48 % res_backward_subset_subsumed: 0
% 22.24/22.48 % res_forward_subsumed: 128
% 22.24/22.48 % res_backward_subsumed: 0
% 22.24/22.48 % res_forward_subsumption_resolution: 0
% 22.24/22.48 % res_backward_subsumption_resolution: 0
% 22.24/22.48 % res_clause_to_clause_subsumption: 12054
% 22.24/22.48 % res_orphan_elimination: 0
% 22.24/22.48 % res_tautology_del: 0
% 22.24/22.48 % res_num_eq_res_simplified: 0
% 22.24/22.48 % res_num_sel_changes: 0
% 22.24/22.48 % res_moves_from_active_to_pass: 0
% 22.24/22.48
% 22.24/22.48 % Status Unknown
% 22.24/22.48 % Last status :
% 22.24/22.48 % SZS status Unknown
%------------------------------------------------------------------------------