TSTP Solution File: SWW099+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWW099+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n017.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 : Thu Jul 21 00:27:51 EDT 2022
% Result : Unknown 37.81s 38.08s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWW099+1 : TPTP v8.1.0. Released v5.2.0.
% 0.08/0.15 % Command : iprover_modulo %s %d
% 0.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 5 12:53:15 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.37 % Running in mono-core mode
% 0.22/0.44 % Orienting using strategy Equiv(ClausalAll)
% 0.22/0.44 % FOF problem with conjecture
% 0.22/0.44 % 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_c8f003.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_128162.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_ab8cdb | grep -v "SZS"
% 0.22/0.47
% 0.22/0.47 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.47
% 0.22/0.47 %
% 0.22/0.47 % ------ iProver source info
% 0.22/0.47
% 0.22/0.47 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.47 % git: non_committed_changes: true
% 0.22/0.47 % git: last_make_outside_of_git: true
% 0.22/0.47
% 0.22/0.47 %
% 0.22/0.47 % ------ Input Options
% 0.22/0.47
% 0.22/0.47 % --out_options all
% 0.22/0.47 % --tptp_safe_out true
% 0.22/0.47 % --problem_path ""
% 0.22/0.47 % --include_path ""
% 0.22/0.47 % --clausifier .//eprover
% 0.22/0.47 % --clausifier_options --tstp-format
% 0.22/0.47 % --stdin false
% 0.22/0.47 % --dbg_backtrace false
% 0.22/0.47 % --dbg_dump_prop_clauses false
% 0.22/0.47 % --dbg_dump_prop_clauses_file -
% 0.22/0.47 % --dbg_out_stat false
% 0.22/0.47
% 0.22/0.47 % ------ General Options
% 0.22/0.47
% 0.22/0.47 % --fof false
% 0.22/0.47 % --time_out_real 150.
% 0.22/0.47 % --time_out_prep_mult 0.2
% 0.22/0.47 % --time_out_virtual -1.
% 0.22/0.47 % --schedule none
% 0.22/0.47 % --ground_splitting input
% 0.22/0.47 % --splitting_nvd 16
% 0.22/0.47 % --non_eq_to_eq false
% 0.22/0.47 % --prep_gs_sim true
% 0.22/0.47 % --prep_unflatten false
% 0.22/0.47 % --prep_res_sim true
% 0.22/0.47 % --prep_upred true
% 0.22/0.47 % --res_sim_input true
% 0.22/0.47 % --clause_weak_htbl true
% 0.22/0.47 % --gc_record_bc_elim false
% 0.22/0.47 % --symbol_type_check false
% 0.22/0.47 % --clausify_out false
% 0.22/0.47 % --large_theory_mode false
% 0.22/0.47 % --prep_sem_filter none
% 0.22/0.47 % --prep_sem_filter_out false
% 0.22/0.47 % --preprocessed_out false
% 0.22/0.47 % --sub_typing false
% 0.22/0.47 % --brand_transform false
% 0.22/0.47 % --pure_diseq_elim true
% 0.22/0.47 % --min_unsat_core false
% 0.22/0.47 % --pred_elim true
% 0.22/0.47 % --add_important_lit false
% 0.22/0.47 % --soft_assumptions false
% 0.22/0.47 % --reset_solvers false
% 0.22/0.47 % --bc_imp_inh []
% 0.22/0.47 % --conj_cone_tolerance 1.5
% 0.22/0.47 % --prolific_symb_bound 500
% 0.22/0.47 % --lt_threshold 2000
% 0.22/0.47
% 0.22/0.47 % ------ SAT Options
% 0.22/0.47
% 0.22/0.47 % --sat_mode false
% 0.22/0.47 % --sat_fm_restart_options ""
% 0.22/0.47 % --sat_gr_def false
% 0.22/0.47 % --sat_epr_types true
% 0.22/0.47 % --sat_non_cyclic_types false
% 0.22/0.47 % --sat_finite_models false
% 0.22/0.47 % --sat_fm_lemmas false
% 0.22/0.47 % --sat_fm_prep false
% 0.22/0.47 % --sat_fm_uc_incr true
% 0.22/0.47 % --sat_out_model small
% 0.22/0.47 % --sat_out_clauses false
% 0.22/0.47
% 0.22/0.47 % ------ QBF Options
% 0.22/0.47
% 0.22/0.47 % --qbf_mode false
% 0.22/0.47 % --qbf_elim_univ true
% 0.22/0.47 % --qbf_sk_in true
% 0.22/0.47 % --qbf_pred_elim true
% 0.22/0.47 % --qbf_split 32
% 0.22/0.47
% 0.22/0.47 % ------ BMC1 Options
% 0.22/0.47
% 0.22/0.47 % --bmc1_incremental false
% 0.22/0.47 % --bmc1_axioms reachable_all
% 0.22/0.47 % --bmc1_min_bound 0
% 0.22/0.47 % --bmc1_max_bound -1
% 0.22/0.47 % --bmc1_max_bound_default -1
% 0.22/0.47 % --bmc1_symbol_reachability true
% 0.22/0.47 % --bmc1_property_lemmas false
% 0.22/0.47 % --bmc1_k_induction false
% 0.22/0.47 % --bmc1_non_equiv_states false
% 0.22/0.47 % --bmc1_deadlock false
% 0.22/0.47 % --bmc1_ucm false
% 0.22/0.47 % --bmc1_add_unsat_core none
% 0.22/0.47 % --bmc1_unsat_core_children false
% 0.22/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.47 % --bmc1_out_stat full
% 0.22/0.47 % --bmc1_ground_init false
% 0.22/0.47 % --bmc1_pre_inst_next_state false
% 0.22/0.47 % --bmc1_pre_inst_state false
% 0.22/0.47 % --bmc1_pre_inst_reach_state false
% 0.22/0.47 % --bmc1_out_unsat_core false
% 0.22/0.47 % --bmc1_aig_witness_out false
% 0.22/0.47 % --bmc1_verbose false
% 0.22/0.47 % --bmc1_dump_clauses_tptp false
% 0.42/0.77 % --bmc1_dump_unsat_core_tptp false
% 0.42/0.77 % --bmc1_dump_file -
% 0.42/0.77 % --bmc1_ucm_expand_uc_limit 128
% 0.42/0.77 % --bmc1_ucm_n_expand_iterations 6
% 0.42/0.77 % --bmc1_ucm_extend_mode 1
% 0.42/0.77 % --bmc1_ucm_init_mode 2
% 0.42/0.77 % --bmc1_ucm_cone_mode none
% 0.42/0.77 % --bmc1_ucm_reduced_relation_type 0
% 0.42/0.77 % --bmc1_ucm_relax_model 4
% 0.42/0.77 % --bmc1_ucm_full_tr_after_sat true
% 0.42/0.77 % --bmc1_ucm_expand_neg_assumptions false
% 0.42/0.77 % --bmc1_ucm_layered_model none
% 0.42/0.77 % --bmc1_ucm_max_lemma_size 10
% 0.42/0.77
% 0.42/0.77 % ------ AIG Options
% 0.42/0.77
% 0.42/0.77 % --aig_mode false
% 0.42/0.77
% 0.42/0.77 % ------ Instantiation Options
% 0.42/0.77
% 0.42/0.77 % --instantiation_flag true
% 0.42/0.77 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.42/0.77 % --inst_solver_per_active 750
% 0.42/0.77 % --inst_solver_calls_frac 0.5
% 0.42/0.77 % --inst_passive_queue_type priority_queues
% 0.42/0.77 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.42/0.77 % --inst_passive_queues_freq [25;2]
% 0.42/0.77 % --inst_dismatching true
% 0.42/0.77 % --inst_eager_unprocessed_to_passive true
% 0.42/0.77 % --inst_prop_sim_given true
% 0.42/0.77 % --inst_prop_sim_new false
% 0.42/0.77 % --inst_orphan_elimination true
% 0.42/0.77 % --inst_learning_loop_flag true
% 0.42/0.77 % --inst_learning_start 3000
% 0.42/0.77 % --inst_learning_factor 2
% 0.42/0.77 % --inst_start_prop_sim_after_learn 3
% 0.42/0.77 % --inst_sel_renew solver
% 0.42/0.77 % --inst_lit_activity_flag true
% 0.42/0.77 % --inst_out_proof true
% 0.42/0.77
% 0.42/0.77 % ------ Resolution Options
% 0.42/0.77
% 0.42/0.77 % --resolution_flag true
% 0.42/0.77 % --res_lit_sel kbo_max
% 0.42/0.77 % --res_to_prop_solver none
% 0.42/0.77 % --res_prop_simpl_new false
% 0.42/0.77 % --res_prop_simpl_given false
% 0.42/0.77 % --res_passive_queue_type priority_queues
% 0.42/0.77 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.42/0.77 % --res_passive_queues_freq [15;5]
% 0.42/0.77 % --res_forward_subs full
% 0.42/0.77 % --res_backward_subs full
% 0.42/0.77 % --res_forward_subs_resolution true
% 0.42/0.77 % --res_backward_subs_resolution true
% 0.42/0.77 % --res_orphan_elimination false
% 0.42/0.77 % --res_time_limit 1000.
% 0.42/0.77 % --res_out_proof true
% 0.42/0.77 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_c8f003.s
% 0.42/0.77 % --modulo true
% 0.42/0.77
% 0.42/0.77 % ------ Combination Options
% 0.42/0.77
% 0.42/0.77 % --comb_res_mult 1000
% 0.42/0.77 % --comb_inst_mult 300
% 0.42/0.77 % ------
% 0.42/0.77
% 0.42/0.77 % ------ Parsing...% successful
% 0.42/0.77
% 0.42/0.77 % ------ 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.42/0.77
% 0.42/0.77 % ------ Proving...
% 0.42/0.77 % ------ Problem Properties
% 0.42/0.77
% 0.42/0.77 %
% 0.42/0.77 % EPR false
% 0.42/0.77 % Horn false
% 0.42/0.77 % Has equality true
% 0.42/0.77
% 0.42/0.77 % % ------ Input Options Time Limit: Unbounded
% 0.42/0.77
% 0.42/0.77
% 0.42/0.77 Compiling...
% 0.42/0.77 Loading plugin: done.
% 0.42/0.77 Compiling...
% 0.42/0.77 Loading plugin: done.
% 0.42/0.77 % % ------ Current options:
% 0.42/0.77
% 0.42/0.77 % ------ Input Options
% 0.42/0.77
% 0.42/0.77 % --out_options all
% 0.42/0.77 % --tptp_safe_out true
% 0.42/0.77 % --problem_path ""
% 0.42/0.77 % --include_path ""
% 0.42/0.77 % --clausifier .//eprover
% 0.42/0.77 % --clausifier_options --tstp-format
% 0.42/0.77 % --stdin false
% 0.42/0.77 % --dbg_backtrace false
% 0.42/0.77 % --dbg_dump_prop_clauses false
% 0.42/0.77 % --dbg_dump_prop_clauses_file -
% 0.42/0.77 % --dbg_out_stat false
% 0.42/0.77
% 0.42/0.77 % ------ General Options
% 0.42/0.77
% 0.42/0.77 % --fof false
% 0.42/0.77 % --time_out_real 150.
% 0.42/0.77 % --time_out_prep_mult 0.2
% 0.42/0.77 % --time_out_virtual -1.
% 0.42/0.77 % --schedule none
% 0.42/0.77 % --ground_splitting input
% 0.42/0.77 % --splitting_nvd 16
% 0.42/0.77 % --non_eq_to_eq false
% 0.42/0.77 % --prep_gs_sim true
% 0.42/0.77 % --prep_unflatten false
% 0.42/0.77 % --prep_res_sim true
% 0.42/0.77 % --prep_upred true
% 0.42/0.77 % --res_sim_input true
% 0.42/0.77 % --clause_weak_htbl true
% 0.42/0.77 % --gc_record_bc_elim false
% 0.42/0.77 % --symbol_type_check false
% 0.42/0.77 % --clausify_out false
% 0.42/0.77 % --large_theory_mode false
% 0.42/0.77 % --prep_sem_filter none
% 0.42/0.77 % --prep_sem_filter_out false
% 0.42/0.77 % --preprocessed_out false
% 0.42/0.77 % --sub_typing false
% 0.42/0.77 % --brand_transform false
% 0.42/0.77 % --pure_diseq_elim true
% 0.42/0.77 % --min_unsat_core false
% 0.42/0.77 % --pred_elim true
% 0.42/0.77 % --add_important_lit false
% 0.42/0.77 % --soft_assumptions false
% 0.42/0.77 % --reset_solvers false
% 0.42/0.77 % --bc_imp_inh []
% 0.42/0.77 % --conj_cone_tolerance 1.5
% 0.42/0.77 % --prolific_symb_bound 500
% 0.42/0.77 % --lt_threshold 2000
% 0.42/0.77
% 0.42/0.77 % ------ SAT Options
% 0.42/0.77
% 0.42/0.77 % --sat_mode false
% 0.42/0.77 % --sat_fm_restart_options ""
% 0.42/0.77 % --sat_gr_def false
% 0.42/0.77 % --sat_epr_types true
% 0.42/0.77 % --sat_non_cyclic_types false
% 0.42/0.77 % --sat_finite_models false
% 0.42/0.77 % --sat_fm_lemmas false
% 0.42/0.77 % --sat_fm_prep false
% 0.42/0.77 % --sat_fm_uc_incr true
% 0.42/0.77 % --sat_out_model small
% 0.42/0.77 % --sat_out_clauses false
% 0.42/0.77
% 0.42/0.77 % ------ QBF Options
% 0.42/0.77
% 0.42/0.77 % --qbf_mode false
% 0.42/0.77 % --qbf_elim_univ true
% 0.42/0.77 % --qbf_sk_in true
% 0.42/0.77 % --qbf_pred_elim true
% 0.42/0.77 % --qbf_split 32
% 0.42/0.77
% 0.42/0.77 % ------ BMC1 Options
% 0.42/0.77
% 0.42/0.77 % --bmc1_incremental false
% 0.42/0.77 % --bmc1_axioms reachable_all
% 0.42/0.77 % --bmc1_min_bound 0
% 0.42/0.77 % --bmc1_max_bound -1
% 0.42/0.77 % --bmc1_max_bound_default -1
% 0.42/0.77 % --bmc1_symbol_reachability true
% 0.42/0.77 % --bmc1_property_lemmas false
% 0.42/0.77 % --bmc1_k_induction false
% 0.42/0.77 % --bmc1_non_equiv_states false
% 0.42/0.77 % --bmc1_deadlock false
% 0.42/0.77 % --bmc1_ucm false
% 0.42/0.77 % --bmc1_add_unsat_core none
% 0.42/0.77 % --bmc1_unsat_core_children false
% 0.42/0.77 % --bmc1_unsat_core_extrapolate_axioms false
% 0.42/0.77 % --bmc1_out_stat full
% 0.42/0.77 % --bmc1_ground_init false
% 0.42/0.77 % --bmc1_pre_inst_next_state false
% 0.42/0.77 % --bmc1_pre_inst_state false
% 0.42/0.77 % --bmc1_pre_inst_reach_state false
% 0.42/0.77 % --bmc1_out_unsat_core false
% 0.42/0.77 % --bmc1_aig_witness_out false
% 0.42/0.77 % --bmc1_verbose false
% 0.42/0.77 % --bmc1_dump_clauses_tptp false
% 0.42/0.77 % --bmc1_dump_unsat_core_tptp false
% 0.42/0.77 % --bmc1_dump_file -
% 0.42/0.77 % --bmc1_ucm_expand_uc_limit 128
% 0.42/0.77 % --bmc1_ucm_n_expand_iterations 6
% 0.42/0.77 % --bmc1_ucm_extend_mode 1
% 0.42/0.77 % --bmc1_ucm_init_mode 2
% 0.42/0.77 % --bmc1_ucm_cone_mode none
% 0.42/0.77 % --bmc1_ucm_reduced_relation_type 0
% 0.42/0.77 % --bmc1_ucm_relax_model 4
% 0.42/0.77 % --bmc1_ucm_full_tr_after_sat true
% 0.42/0.77 % --bmc1_ucm_expand_neg_assumptions false
% 0.42/0.77 % --bmc1_ucm_layered_model none
% 0.42/0.77 % --bmc1_ucm_max_lemma_size 10
% 0.42/0.77
% 0.42/0.77 % ------ AIG Options
% 0.42/0.77
% 0.42/0.77 % --aig_mode false
% 0.42/0.77
% 0.42/0.77 % ------ Instantiation Options
% 0.42/0.77
% 0.42/0.77 % --instantiation_flag true
% 0.42/0.77 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.42/0.77 % --inst_solver_per_active 750
% 0.42/0.77 % --inst_solver_calls_frac 0.5
% 0.42/0.77 % --inst_passive_queue_type priority_queues
% 0.42/0.77 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.42/0.77 % --inst_passive_queues_freq [25;2]
% 0.42/0.77 % --inst_dismatching true
% 0.42/0.77 % --inst_eager_unprocessed_to_passive true
% 0.42/0.77 % --inst_prop_sim_given true
% 0.42/0.77 % --inst_prop_sim_new false
% 0.42/0.77 % --inst_orphan_elimination true
% 0.42/0.77 % --inst_learning_loop_flag true
% 0.42/0.77 % --inst_learning_start 3000
% 0.42/0.77 % --inst_learning_factor 2
% 0.42/0.77 % --inst_start_prop_sim_after_learn 3
% 0.42/0.77 % --inst_sel_renew solver
% 0.42/0.77 % --inst_lit_activity_flag true
% 0.42/0.77 % --inst_out_proof true
% 0.42/0.77
% 0.42/0.77 % ------ Resolution Options
% 0.42/0.77
% 0.42/0.77 % --resolution_flag true
% 0.42/0.77 % --res_lit_sel kbo_max
% 0.42/0.77 % --res_to_prop_solver none
% 0.42/0.77 % --res_prop_simpl_new false
% 0.42/0.77 % --res_prop_simpl_given false
% 0.42/0.77 % --res_passive_queue_type priority_queues
% 0.42/0.77 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.42/0.77 % --res_passive_queues_freq [15;5]
% 0.42/0.77 % --res_forward_subs full
% 0.42/0.77 % --res_backward_subs full
% 0.42/0.77 % --res_forward_subs_resolution true
% 0.42/0.77 % --res_backward_subs_resolution true
% 0.42/0.77 % --res_orphan_elimination false
% 0.42/0.77 % --res_time_limit 1000.
% 0.42/0.77 % --res_out_proof true
% 0.42/0.77 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_c8f003.s
% 0.42/0.77 % --modulo true
% 0.42/0.77
% 0.42/0.77 % ------ Combination Options
% 0.42/0.77
% 0.42/0.77 % --comb_res_mult 1000
% 0.42/0.77 % --comb_inst_mult 300
% 0.42/0.77 % ------
% 0.42/0.77
% 0.42/0.77
% 0.42/0.77
% 0.42/0.77 % ------ Proving...
% 0.42/0.77 % warning: shown sat in sat incomplete mode
% 0.42/0.77 %
% 0.42/0.77
% 0.42/0.77
% 0.42/0.77
% 0.42/0.77
% 0.42/0.77 cnf(c_102,negated_conjecture,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0)) | bool(exists2(sk3_esk1_0)) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_5) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_171,negated_conjecture,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0)) | bool(exists2(sk3_esk1_0)) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_102]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_179,negated_conjecture,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0)) | bool(exists2(sk3_esk1_0)) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_171]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_182,negated_conjecture,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0)) | bool(exists2(sk3_esk1_0)) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_179]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_183,negated_conjecture,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0)) | bool(exists2(sk3_esk1_0)) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_182]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_472,negated_conjecture,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0)) | bool(exists2(sk3_esk1_0)) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_183]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_44,plain,
% 0.42/0.77 ( X0 = false | X0 = true | ~ bool(X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_277_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_356,plain,
% 0.42/0.77 ( X0 = false | X0 = true | ~ bool(X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_44]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_357,plain,
% 0.42/0.77 ( ~ bool(X0) | X0 = false | X0 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_356]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_486,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0))
% 0.42/0.77 | exists2(sk3_esk1_0) = false
% 0.42/0.77 | exists2(sk3_esk1_0) = true ),
% 0.42/0.77 inference(resolution,[status(thm)],[c_472,c_357]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_487,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0))
% 0.42/0.77 | exists2(sk3_esk1_0) = false
% 0.42/0.77 | exists2(sk3_esk1_0) = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_486]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_50,plain,
% 0.42/0.77 ( impl(false,X0) = true | ~ bool(X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_270_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_368,plain,
% 0.42/0.77 ( impl(false,X0) = true | ~ bool(X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_50]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_369,plain,
% 0.42/0.77 ( ~ bool(X0) | impl(false,X0) = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_368]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_485,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0)) | impl(false,exists2(sk3_esk1_0)) = true ),
% 0.42/0.77 inference(resolution,[status(thm)],[c_472,c_369]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_488,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0)) | impl(false,exists2(sk3_esk1_0)) = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_485]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_51,plain,
% 0.42/0.77 ( and1(false,X0) = false | ~ bool(X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_269_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_370,plain,
% 0.42/0.77 ( and1(false,X0) = false | ~ bool(X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_51]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_371,plain,
% 0.42/0.77 ( ~ bool(X0) | and1(false,X0) = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_370]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_484,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0)) | and1(false,exists2(sk3_esk1_0)) = false ),
% 0.42/0.77 inference(resolution,[status(thm)],[c_472,c_371]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_489,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0)) | and1(false,exists2(sk3_esk1_0)) = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_484]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_52,plain,
% 0.42/0.77 ( or1(true,X0) = true | ~ bool(X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_268_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_372,plain,
% 0.42/0.77 ( or1(true,X0) = true | ~ bool(X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_52]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_373,plain,
% 0.42/0.77 ( ~ bool(X0) | or1(true,X0) = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_372]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_483,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0)) | or1(true,exists2(sk3_esk1_0)) = true ),
% 0.42/0.77 inference(resolution,[status(thm)],[c_472,c_373]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_490,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0)) | or1(true,exists2(sk3_esk1_0)) = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_483]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_53,plain,
% 0.42/0.77 ( impl(true,X0) = X0 | ~ bool(X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_267_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_374,plain,
% 0.42/0.77 ( impl(true,X0) = X0 | ~ bool(X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_53]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_375,plain,
% 0.42/0.77 ( ~ bool(X0) | impl(true,X0) = X0 ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_374]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_482,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0))
% 0.42/0.77 | impl(true,exists2(sk3_esk1_0)) = exists2(sk3_esk1_0) ),
% 0.42/0.77 inference(resolution,[status(thm)],[c_472,c_375]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_491,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0))
% 0.42/0.77 | impl(true,exists2(sk3_esk1_0)) = exists2(sk3_esk1_0) ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_482]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_54,plain,
% 0.42/0.77 ( and1(true,X0) = X0 | ~ bool(X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_266_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_376,plain,
% 0.42/0.77 ( and1(true,X0) = X0 | ~ bool(X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_54]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_377,plain,
% 0.42/0.77 ( ~ bool(X0) | and1(true,X0) = X0 ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_376]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_481,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0))
% 0.42/0.77 | and1(true,exists2(sk3_esk1_0)) = exists2(sk3_esk1_0) ),
% 0.42/0.77 inference(resolution,[status(thm)],[c_472,c_377]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_492,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0))
% 0.42/0.77 | and1(true,exists2(sk3_esk1_0)) = exists2(sk3_esk1_0) ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_481]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_55,plain,
% 0.42/0.77 ( or1(false,X0) = X0 | ~ bool(X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_265_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_378,plain,
% 0.42/0.77 ( or1(false,X0) = X0 | ~ bool(X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_55]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_379,plain,
% 0.42/0.77 ( ~ bool(X0) | or1(false,X0) = X0 ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_378]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_480,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0))
% 0.42/0.77 | or1(false,exists2(sk3_esk1_0)) = exists2(sk3_esk1_0) ),
% 0.42/0.77 inference(resolution,[status(thm)],[c_472,c_379]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_493,plain,
% 0.42/0.77 ( bool(exists1(sk3_esk1_0))
% 0.42/0.77 | or1(false,exists2(sk3_esk1_0)) = exists2(sk3_esk1_0) ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_480]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_101,plain,
% 0.42/0.77 ( ~ d(X0) | ~ d(X1) | ~ bool(X1) | bool(X0) | existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_219_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_470,plain,
% 0.42/0.77 ( ~ d(X0) | ~ d(X1) | ~ bool(X1) | bool(X0) | existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_101]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_471,plain,
% 0.42/0.77 ( ~ d(X0) | ~ d(X1) | existsprefers(X0,X1) | ~ bool(X1) | bool(X0) ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_470]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_100,plain,
% 0.42/0.77 ( ~ d(X0) | ~ d(X1) | ~ bool(X1) | bool(X0) | forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_220_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_468,plain,
% 0.42/0.77 ( ~ d(X0) | ~ d(X1) | ~ bool(X1) | bool(X0) | forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_100]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_469,plain,
% 0.42/0.77 ( ~ d(X0) | ~ d(X1) | forallprefers(X0,X1) | ~ bool(X1) | bool(X0) ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_468]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_99,plain,
% 0.42/0.77 ( ~ bool(X0) | ~ d(X0) | X0 = true | ~ existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_221_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_466,plain,
% 0.42/0.77 ( ~ bool(X0) | ~ d(X0) | X0 = true | ~ existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_99]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_467,plain,
% 0.42/0.77 ( ~ d(X0) | ~ existsprefers(X0,X1) | ~ bool(X0) | X0 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_466]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_98,plain,
% 0.42/0.77 ( ~ bool(X0) | ~ d(X0) | X1 = false | ~ existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_222_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_464,plain,
% 0.42/0.77 ( ~ bool(X0) | ~ d(X0) | X1 = false | ~ existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_98]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_465,plain,
% 0.42/0.77 ( ~ d(X0) | ~ existsprefers(X0,X1) | ~ bool(X0) | X1 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_464]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_97,plain,
% 0.42/0.77 ( ~ bool(X0) | ~ d(X0) | X0 = false | ~ forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_223_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_462,plain,
% 0.42/0.77 ( ~ bool(X0) | ~ d(X0) | X0 = false | ~ forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_97]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_463,plain,
% 0.42/0.77 ( ~ d(X0) | ~ forallprefers(X0,X1) | ~ bool(X0) | X0 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_462]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_96,plain,
% 0.42/0.77 ( ~ bool(X0) | ~ d(X0) | X1 = true | ~ forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_224_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_460,plain,
% 0.42/0.77 ( ~ bool(X0) | ~ d(X0) | X1 = true | ~ forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_96]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_461,plain,
% 0.42/0.77 ( ~ d(X0) | ~ forallprefers(X0,X1) | ~ bool(X0) | X1 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_460]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_93,plain,
% 0.42/0.77 ( ~ d(X0) | X0 = true | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_227_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_454,plain,
% 0.42/0.77 ( ~ d(X0) | X0 = true | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_93]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_455,plain,
% 0.42/0.77 ( ~ d(X0) | d(X1) | ~ existsprefers(X0,X1) | X0 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_454]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_92,plain,
% 0.42/0.77 ( ~ d(X0) | X1 = false | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_228_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_452,plain,
% 0.42/0.77 ( ~ d(X0) | X1 = false | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_92]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_453,plain,
% 0.42/0.77 ( ~ d(X0) | d(X1) | ~ existsprefers(X0,X1) | X1 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_452]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_91,plain,
% 0.42/0.77 ( ~ d(X0) | X0 = true | bool(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_229_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_450,plain,
% 0.42/0.77 ( ~ d(X0) | X0 = true | bool(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_91]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_451,plain,
% 0.42/0.77 ( ~ d(X0) | ~ existsprefers(X0,X1) | bool(X1) | X0 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_450]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_90,plain,
% 0.42/0.77 ( ~ d(X0) | X1 = false | bool(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_230_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_448,plain,
% 0.42/0.77 ( ~ d(X0) | X1 = false | bool(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_90]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_449,plain,
% 0.42/0.77 ( ~ d(X0) | ~ existsprefers(X0,X1) | bool(X1) | X1 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_448]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_89,plain,
% 0.42/0.77 ( ~ bool(X0) | X0 = true | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_231_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_446,plain,
% 0.42/0.77 ( ~ bool(X0) | X0 = true | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_89]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_447,plain,
% 0.42/0.77 ( d(X0) | ~ existsprefers(X1,X0) | ~ bool(X1) | X1 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_446]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_88,plain,
% 0.42/0.77 ( ~ bool(X0) | X1 = false | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_232_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_444,plain,
% 0.42/0.77 ( ~ bool(X0) | X1 = false | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_88]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_445,plain,
% 0.42/0.77 ( d(X0) | ~ existsprefers(X1,X0) | ~ bool(X1) | X0 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_444]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_85,plain,
% 0.42/0.77 ( ~ d(X0) | X0 = false | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_235_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_438,plain,
% 0.42/0.77 ( ~ d(X0) | X0 = false | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_85]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_439,plain,
% 0.42/0.77 ( ~ d(X0) | d(X1) | ~ forallprefers(X0,X1) | X0 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_438]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_84,plain,
% 0.42/0.77 ( ~ d(X0) | X1 = true | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_236_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_436,plain,
% 0.42/0.77 ( ~ d(X0) | X1 = true | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_84]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_437,plain,
% 0.42/0.77 ( ~ d(X0) | d(X1) | ~ forallprefers(X0,X1) | X1 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_436]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_83,plain,
% 0.42/0.77 ( ~ d(X0) | X0 = false | bool(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_237_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_434,plain,
% 0.42/0.77 ( ~ d(X0) | X0 = false | bool(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_83]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_435,plain,
% 0.42/0.77 ( ~ d(X0) | ~ forallprefers(X0,X1) | bool(X1) | X0 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_434]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_82,plain,
% 0.42/0.77 ( ~ d(X0) | X1 = true | bool(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_238_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_432,plain,
% 0.42/0.77 ( ~ d(X0) | X1 = true | bool(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_82]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_433,plain,
% 0.42/0.77 ( ~ d(X0) | ~ forallprefers(X0,X1) | bool(X1) | X1 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_432]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_81,plain,
% 0.42/0.77 ( ~ bool(X0) | X0 = false | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_239_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_430,plain,
% 0.42/0.77 ( ~ bool(X0) | X0 = false | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_81]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_431,plain,
% 0.42/0.77 ( d(X0) | ~ forallprefers(X1,X0) | ~ bool(X1) | X1 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_430]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_80,plain,
% 0.42/0.77 ( ~ bool(X0) | X1 = true | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_240_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_428,plain,
% 0.42/0.77 ( ~ bool(X0) | X1 = true | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_80]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_429,plain,
% 0.42/0.77 ( d(X0) | ~ forallprefers(X1,X0) | ~ bool(X1) | X0 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_428]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_74,plain,
% 0.42/0.77 ( X0 = true | d(X0) | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_246_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_416,plain,
% 0.42/0.77 ( X0 = true | d(X0) | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_74]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_417,plain,
% 0.42/0.77 ( d(X0) | d(X1) | ~ existsprefers(X0,X1) | X0 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_416]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_73,plain,
% 0.42/0.77 ( X0 = false | d(X1) | d(X0) | ~ existsprefers(X1,X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_247_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_414,plain,
% 0.42/0.77 ( X0 = false | d(X1) | d(X0) | ~ existsprefers(X1,X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_73]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_415,plain,
% 0.42/0.77 ( d(X0) | d(X1) | ~ existsprefers(X0,X1) | X1 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_414]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_72,plain,
% 0.42/0.77 ( X0 = true | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_248_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_412,plain,
% 0.42/0.77 ( X0 = true | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_72]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_413,plain,
% 0.42/0.77 ( d(X0) | ~ existsprefers(X1,X0) | X1 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_412]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_71,plain,
% 0.42/0.77 ( X0 = false | d(X0) | ~ existsprefers(X1,X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_249_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_410,plain,
% 0.42/0.77 ( X0 = false | d(X0) | ~ existsprefers(X1,X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_71]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_411,plain,
% 0.42/0.77 ( d(X0) | ~ existsprefers(X1,X0) | X0 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_410]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_70,plain,
% 0.42/0.77 ( X0 = true | bool(X1) | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_250_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_408,plain,
% 0.42/0.77 ( X0 = true | bool(X1) | d(X1) | ~ existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_70]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_409,plain,
% 0.42/0.77 ( d(X0) | ~ existsprefers(X1,X0) | bool(X0) | X1 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_408]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_69,plain,
% 0.42/0.77 ( X0 = false | bool(X0) | d(X0) | ~ existsprefers(X1,X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_251_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_406,plain,
% 0.42/0.77 ( X0 = false | bool(X0) | d(X0) | ~ existsprefers(X1,X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_69]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_407,plain,
% 0.42/0.77 ( d(X0) | ~ existsprefers(X1,X0) | bool(X0) | X0 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_406]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_68,plain,
% 0.42/0.77 ( X0 = false | d(X0) | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_252_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_404,plain,
% 0.42/0.77 ( X0 = false | d(X0) | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_68]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_405,plain,
% 0.42/0.77 ( d(X0) | d(X1) | ~ forallprefers(X0,X1) | X0 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_404]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_67,plain,
% 0.42/0.77 ( X0 = true | d(X1) | d(X0) | ~ forallprefers(X1,X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_253_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_402,plain,
% 0.42/0.77 ( X0 = true | d(X1) | d(X0) | ~ forallprefers(X1,X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_67]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_403,plain,
% 0.42/0.77 ( d(X0) | d(X1) | ~ forallprefers(X0,X1) | X1 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_402]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_66,plain,
% 0.42/0.77 ( X0 = false | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_254_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_400,plain,
% 0.42/0.77 ( X0 = false | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_66]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_401,plain,
% 0.42/0.77 ( d(X0) | ~ forallprefers(X1,X0) | X1 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_400]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_65,plain,
% 0.42/0.77 ( X0 = true | d(X0) | ~ forallprefers(X1,X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_255_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_398,plain,
% 0.42/0.77 ( X0 = true | d(X0) | ~ forallprefers(X1,X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_65]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_399,plain,
% 0.42/0.77 ( d(X0) | ~ forallprefers(X1,X0) | X0 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_398]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_64,plain,
% 0.42/0.77 ( X0 = false | bool(X1) | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_256_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_396,plain,
% 0.42/0.77 ( X0 = false | bool(X1) | d(X1) | ~ forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_64]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_397,plain,
% 0.42/0.77 ( d(X0) | ~ forallprefers(X1,X0) | bool(X0) | X1 = false ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_396]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_63,plain,
% 0.42/0.77 ( X0 = true | bool(X0) | d(X0) | ~ forallprefers(X1,X0) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_257_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_394,plain,
% 0.42/0.77 ( X0 = true | bool(X0) | d(X0) | ~ forallprefers(X1,X0) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_63]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_395,plain,
% 0.42/0.77 ( d(X0) | ~ forallprefers(X1,X0) | bool(X0) | X0 = true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_394]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_62,plain,
% 0.42/0.77 ( X0 != true | X1 != false | existsprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_258_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_392,plain,
% 0.42/0.77 ( X0 != true | X1 != false | existsprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_62]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_393,plain,
% 0.42/0.77 ( existsprefers(X0,X1) | X1 != false | X0 != true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_392]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_61,plain,
% 0.42/0.77 ( X0 != false | X1 != true | forallprefers(X0,X1) ),
% 0.42/0.77 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_259_0) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_390,plain,
% 0.42/0.77 ( X0 != false | X1 != true | forallprefers(X0,X1) ),
% 0.42/0.77 inference(copy,[status(esa)],[c_61]) ).
% 0.42/0.77
% 0.42/0.77 cnf(c_391,plain,
% 0.42/0.77 ( forallprefers(X0,X1) | X0 != false | X1 != true ),
% 0.42/0.77 inference(rewriting,[status(thm)],[c_390]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_43,plain,
% 0.42/0.78 ( X0 != false | bool(X0) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_278_0) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_354,plain,
% 0.42/0.78 ( X0 != false | bool(X0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_43]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_355,plain,
% 0.42/0.78 ( bool(X0) | X0 != false ),
% 0.42/0.78 inference(rewriting,[status(thm)],[c_354]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_42,plain,
% 0.42/0.78 ( X0 != true | bool(X0) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_279_0) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_352,plain,
% 0.42/0.78 ( X0 != true | bool(X0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_42]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_353,plain,
% 0.42/0.78 ( bool(X0) | X0 != true ),
% 0.42/0.78 inference(rewriting,[status(thm)],[c_352]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_103,negated_conjecture,
% 0.42/0.78 ( exists2(sk3_esk1_0) != exists1(sk3_esk1_0) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_6) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_173,negated_conjecture,
% 0.42/0.78 ( exists2(sk3_esk1_0) != exists1(sk3_esk1_0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_103]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_180,negated_conjecture,
% 0.42/0.78 ( exists2(sk3_esk1_0) != exists1(sk3_esk1_0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_173]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_181,negated_conjecture,
% 0.42/0.78 ( exists2(sk3_esk1_0) != exists1(sk3_esk1_0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_180]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_184,negated_conjecture,
% 0.42/0.78 ( exists2(sk3_esk1_0) != exists1(sk3_esk1_0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_181]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_474,negated_conjecture,
% 0.42/0.78 ( exists2(sk3_esk1_0) != exists1(sk3_esk1_0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_184]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_79,plain,
% 0.42/0.78 ( ~ bool(X0) | bool(X1) | or1(X0,X1) = phi(X1) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_241_0) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_426,plain,
% 0.42/0.78 ( ~ bool(X0) | bool(X1) | or1(X0,X1) = phi(X1) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_79]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_78,plain,
% 0.42/0.78 ( ~ bool(X0) | bool(X1) | and1(X0,X1) = phi(X1) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_242_0) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_424,plain,
% 0.42/0.78 ( ~ bool(X0) | bool(X1) | and1(X0,X1) = phi(X1) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_78]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_77,plain,
% 0.42/0.78 ( ~ bool(X0) | bool(X1) | impl(X0,X1) = phi(X1) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_243_0) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_422,plain,
% 0.42/0.78 ( ~ bool(X0) | bool(X1) | impl(X0,X1) = phi(X1) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_77]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_76,plain,
% 0.42/0.78 ( ~ d(X0) | d(X1) | existsprefers(X1,X0) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_244_0) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_420,plain,
% 0.42/0.78 ( ~ d(X0) | d(X1) | existsprefers(X1,X0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_76]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_75,plain,
% 0.42/0.78 ( ~ d(X0) | d(X1) | forallprefers(X1,X0) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_245_0) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_418,plain,
% 0.42/0.78 ( ~ d(X0) | d(X1) | forallprefers(X1,X0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_75]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_60,plain,
% 0.42/0.78 ( bool(X0) | or1(X0,X1) = phi(X0) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_260_0) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_388,plain,
% 0.42/0.78 ( bool(X0) | or1(X0,X1) = phi(X0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_60]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_59,plain,
% 0.42/0.78 ( bool(X0) | lazy_and1(X0,X1) = phi(X0) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_261_0) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_386,plain,
% 0.42/0.78 ( bool(X0) | lazy_and1(X0,X1) = phi(X0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_59]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_58,plain,
% 0.42/0.78 ( bool(X0) | and1(X0,X1) = phi(X0) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_262_0) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_384,plain,
% 0.42/0.78 ( bool(X0) | and1(X0,X1) = phi(X0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_58]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_57,plain,
% 0.42/0.78 ( bool(X0) | lazy_impl(X0,X1) = phi(X0) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_263_0) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_382,plain,
% 0.42/0.78 ( bool(X0) | lazy_impl(X0,X1) = phi(X0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_57]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_56,plain,
% 0.42/0.78 ( bool(X0) | impl(X0,X1) = phi(X0) ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_264_0) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_380,plain,
% 0.42/0.78 ( bool(X0) | impl(X0,X1) = phi(X0) ),
% 0.42/0.78 inference(copy,[status(esa)],[c_56]) ).
% 0.42/0.78
% 0.42/0.78 cnf(c_49,plain,
% 0.42/0.78 ( ~ bool(X0) | prop(X0) != false ),
% 0.42/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_272_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_366,plain,
% 0.57/0.78 ( ~ bool(X0) | prop(X0) != false ),
% 0.57/0.78 inference(copy,[status(esa)],[c_49]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_48,plain,
% 0.57/0.78 ( ~ bool(X0) | prop(X0) = true ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_273_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_364,plain,
% 0.57/0.78 ( ~ bool(X0) | prop(X0) = true ),
% 0.57/0.78 inference(copy,[status(esa)],[c_48]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_47,plain,
% 0.57/0.78 ( bool(X0) | not1(X0) = phi(X0) ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_274_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_362,plain,
% 0.57/0.78 ( bool(X0) | not1(X0) = phi(X0) ),
% 0.57/0.78 inference(copy,[status(esa)],[c_47]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_46,plain,
% 0.57/0.78 ( bool(X0) | prop(X0) = false ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_275_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_360,plain,
% 0.57/0.78 ( bool(X0) | prop(X0) = false ),
% 0.57/0.78 inference(copy,[status(esa)],[c_46]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_45,plain,
% 0.57/0.78 ( bool(X0) | prop(X0) != true ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_276_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_358,plain,
% 0.57/0.78 ( bool(X0) | prop(X0) != true ),
% 0.57/0.78 inference(copy,[status(esa)],[c_45]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_27,plain,
% 0.57/0.78 ( d(true) ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_289_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_336,plain,( d(true) ),inference(copy,[status(esa)],[c_27]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_26,plain,
% 0.57/0.78 ( d(false) ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_290_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_334,plain,( d(false) ),inference(copy,[status(esa)],[c_26]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_25,plain,
% 0.57/0.78 ( d(err) ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_291_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_332,plain,( d(err) ),inference(copy,[status(esa)],[c_25]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_24,plain,
% 0.57/0.78 ( true != false ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_292_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_330,plain,( true != false ),inference(copy,[status(esa)],[c_24]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_23,plain,
% 0.57/0.78 ( true != err ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_293_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_328,plain,( true != err ),inference(copy,[status(esa)],[c_23]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_22,plain,
% 0.57/0.78 ( false != err ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_294_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_326,plain,( false != err ),inference(copy,[status(esa)],[c_22]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_14,plain,
% 0.57/0.78 ( ~ forallprefers(f7(X0),f7(sk2_esk1_0)) ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_54_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_317,plain,
% 0.57/0.78 ( ~ forallprefers(f7(X0),f7(sk2_esk1_0)) ),
% 0.57/0.78 inference(copy,[status(esa)],[c_14]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_13,plain,
% 0.57/0.78 ( ~ forallprefers(f6(X0,X1),f6(X0,sk2_esk2_1(X0))) ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_51_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_315,plain,
% 0.57/0.78 ( ~ forallprefers(f6(X0,X1),f6(X0,sk2_esk2_1(X0))) ),
% 0.57/0.78 inference(copy,[status(esa)],[c_13]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_12,plain,
% 0.57/0.78 ( ~ existsprefers(apply(X0,X1),apply(X0,sk2_esk4_1(X0))) ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_50_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_313,plain,
% 0.57/0.78 ( ~ existsprefers(apply(X0,X1),apply(X0,sk2_esk4_1(X0))) ),
% 0.57/0.78 inference(copy,[status(esa)],[c_12]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_11,plain,
% 0.57/0.78 ( ~ forallprefers(f4(X0,X1,X2),f4(X0,sk2_esk3_2(X0,X2),X2)) ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_45_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_311,plain,
% 0.57/0.78 ( ~ forallprefers(f4(X0,X1,X2),f4(X0,sk2_esk3_2(X0,X2),X2)) ),
% 0.57/0.78 inference(copy,[status(esa)],[c_11]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_10,plain,
% 0.57/0.78 ( ~ forallprefers(f3(X0,X1,X2),f3(X0,X1,sk2_esk5_2(X0,X1))) ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_44_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_309,plain,
% 0.57/0.78 ( ~ forallprefers(f3(X0,X1,X2),f3(X0,X1,sk2_esk5_2(X0,X1))) ),
% 0.57/0.78 inference(copy,[status(esa)],[c_10]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_9,plain,
% 0.57/0.78 ( ~ forallprefers(f2(X0,X1,X2),f2(X0,X1,sk2_esk6_2(X0,X1))) ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_43_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_307,plain,
% 0.57/0.78 ( ~ forallprefers(f2(X0,X1,X2),f2(X0,X1,sk2_esk6_2(X0,X1))) ),
% 0.57/0.78 inference(copy,[status(esa)],[c_9]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_8,plain,
% 0.57/0.78 ( ~ forallprefers(f1(X0,X1,X2),f1(X0,X1,sk2_esk7_2(X0,X1))) ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_42_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_305,plain,
% 0.57/0.78 ( ~ forallprefers(f1(X0,X1,X2),f1(X0,X1,sk2_esk7_2(X0,X1))) ),
% 0.57/0.78 inference(copy,[status(esa)],[c_8]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_6,plain,
% 0.57/0.78 ( phi(X0) = err | d(X0) ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_58_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_301,plain,
% 0.57/0.78 ( phi(X0) = err | d(X0) ),
% 0.57/0.78 inference(copy,[status(esa)],[c_6]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_302,plain,
% 0.57/0.78 ( d(X0) | phi(X0) = err ),
% 0.57/0.78 inference(rewriting,[status(thm)],[c_301]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_4,plain,
% 0.57/0.78 ( phi(X0) = err | phi(X0) = X0 ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_57_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_297,plain,
% 0.57/0.78 ( phi(X0) = err | phi(X0) = X0 ),
% 0.57/0.78 inference(copy,[status(esa)],[c_4]) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_0,plain,
% 0.57/0.78 ( ~ d(X0) | phi(X0) = X0 ),
% 0.57/0.78 file('/export/starexec/sandbox2/tmp/iprover_modulo_128162.p', c_0_55_0) ).
% 0.57/0.78
% 0.57/0.78 cnf(c_289,plain,
% 0.57/0.78 ( ~ d(X0) | phi(X0) = X0 ),
% 0.57/0.78 inference(copy,[status(esa)],[c_0]) ).
% 0.57/0.78
% 0.57/0.78
% 0.57/0.78
% 0.57/0.78 % ------ Statistics
% 0.57/0.78
% 0.57/0.78 % ------ General
% 0.57/0.78
% 0.57/0.78 % num_of_input_clauses: 104
% 0.57/0.78 % num_of_input_neg_conjectures: 2
% 0.57/0.78 % num_of_splits: 0
% 0.57/0.78 % num_of_split_atoms: 0
% 0.57/0.78 % num_of_sem_filtered_clauses: 0
% 0.57/0.78 % num_of_subtypes: 0
% 0.57/0.78 % monotx_restored_types: 0
% 0.57/0.78 % sat_num_of_epr_types: 0
% 0.57/0.78 % sat_num_of_non_cyclic_types: 0
% 0.57/0.78 % sat_guarded_non_collapsed_types: 0
% 0.57/0.78 % is_epr: 0
% 0.57/0.78 % is_horn: 0
% 0.57/0.78 % has_eq: 1
% 0.57/0.78 % num_pure_diseq_elim: 0
% 0.57/0.78 % simp_replaced_by: 0
% 0.57/0.78 % res_preprocessed: 4
% 0.57/0.78 % prep_upred: 0
% 0.57/0.78 % prep_unflattend: 0
% 0.57/0.78 % pred_elim_cands: 0
% 0.57/0.78 % pred_elim: 0
% 0.57/0.78 % pred_elim_cl: 0
% 0.57/0.78 % pred_elim_cycles: 0
% 0.57/0.78 % forced_gc_time: 0
% 0.57/0.78 % gc_basic_clause_elim: 0
% 0.57/0.78 % parsing_time: 0.003
% 0.57/0.78 % sem_filter_time: 0.
% 0.57/0.78 % pred_elim_time: 0.
% 0.57/0.78 % out_proof_time: 0.
% 0.57/0.78 % monotx_time: 0.
% 0.57/0.78 % subtype_inf_time: 0.
% 0.57/0.78 % unif_index_cands_time: 0.
% 0.57/0.78 % unif_index_add_time: 0.
% 0.57/0.78 % total_time: 0.327
% 0.57/0.78 % num_of_symbols: 64
% 0.57/0.78 % num_of_terms: 361
% 0.57/0.78
% 0.57/0.78 % ------ Propositional Solver
% 0.57/0.78
% 0.57/0.78 % prop_solver_calls: 1
% 0.57/0.78 % prop_fast_solver_calls: 9
% 0.57/0.78 % prop_num_of_clauses: 162
% 0.57/0.78 % prop_preprocess_simplified: 246
% 0.57/0.78 % prop_fo_subsumed: 0
% 0.57/0.78 % prop_solver_time: 0.
% 0.57/0.78 % prop_fast_solver_time: 0.
% 0.57/0.78 % prop_unsat_core_time: 0.
% 0.57/0.78
% 0.57/0.78 % ------ QBF
% 0.57/0.78
% 0.57/0.78 % qbf_q_res: 0
% 0.57/0.78 % qbf_num_tautologies: 0
% 0.57/0.78 % qbf_prep_cycles: 0
% 0.57/0.78
% 0.57/0.78 % ------ BMC1
% 0.57/0.78
% 0.57/0.78 % bmc1_current_bound: -1
% 0.57/0.78 % bmc1_last_solved_bound: -1
% 0.57/0.78 % bmc1_unsat_core_size: -1
% 0.57/0.78 % bmc1_unsat_core_parents_size: -1
% 0.57/0.78 % bmc1_merge_next_fun: 0
% 0.57/0.78 % bmc1_unsat_core_clauses_time: 0.
% 0.57/0.78
% 0.57/0.78 % ------ Instantiation
% 0.57/0.78
% 0.57/0.78 % inst_num_of_clauses: 104
% 0.57/0.78 % inst_num_in_passive: 0
% 0.57/0.78 % inst_num_in_active: 0
% 0.57/0.78 % inst_num_in_unprocessed: 104
% 0.57/0.78 % inst_num_of_loops: 0
% 0.57/0.78 % inst_num_of_learning_restarts: 0
% 0.57/0.78 % inst_num_moves_active_passive: 0
% 0.57/0.78 % inst_lit_activity: 0
% 0.57/0.78 % inst_lit_activity_moves: 0
% 0.57/0.78 % inst_num_tautologies: 0
% 0.57/0.78 % inst_num_prop_implied: 0
% 0.57/0.78 % inst_num_existing_simplified: 0
% 0.57/0.78 % inst_num_eq_res_simplified: 0
% 0.57/0.78 % inst_num_child_elim: 0
% 0.57/0.78 % inst_num_of_dismatching_blockings: 0
% 0.57/0.78 % inst_num_of_non_proper_insts: 0
% 0.57/0.78 % inst_num_of_duplicates: 0
% 0.57/0.78 % inst_inst_num_from_inst_to_res: 0
% 0.57/0.78 % inst_dismatching_checking_time: 0.
% 0.57/0.78
% 0.57/0.78 % ------ Resolution
% 0.57/0.78
% 0.57/0.78 % res_num_of_clauses: 152
% 0.57/0.78 % res_num_in_passive: 0
% 0.57/0.78 % res_num_in_active: 81
% 0.57/0.78 % res_num_of_loops: 10
% 0.57/0.78 % res_forward_subset_subsumed: 3
% 0.57/0.78 % res_backward_subset_subsumed: 0
% 0.57/0.78 % res_forward_subsumed: 0
% 0.57/0.78 % res_backward_subsumed: 0
% 0.57/0.78 % res_forward_subsumption_resolution: 0
% 0.57/0.78 % res_backward_subsumption_resolution: 0
% 0.57/0.78 % res_clause_to_clause_subsumption: 12
% 0.57/0.78 % res_orphan_elimination: 0
% 0.57/0.78 % res_tautology_del: 6
% 0.57/0.78 % res_num_eq_res_simplified: 0
% 0.57/0.78 % res_num_sel_changes: 0
% 0.57/0.78 % res_moves_from_active_to_pass: 0
% 0.57/0.78
% 0.57/0.78 % Status Unknown
% 0.57/0.83 % Orienting using strategy ClausalAll
% 0.57/0.83 % FOF problem with conjecture
% 0.57/0.83 % 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_c8f003.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_128162.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_f85fe7 | grep -v "SZS"
% 0.66/0.86
% 0.66/0.86 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.66/0.86
% 0.66/0.86 %
% 0.66/0.86 % ------ iProver source info
% 0.66/0.86
% 0.66/0.86 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.66/0.86 % git: non_committed_changes: true
% 0.66/0.86 % git: last_make_outside_of_git: true
% 0.66/0.86
% 0.66/0.86 %
% 0.66/0.86 % ------ Input Options
% 0.66/0.86
% 0.66/0.86 % --out_options all
% 0.66/0.86 % --tptp_safe_out true
% 0.66/0.86 % --problem_path ""
% 0.66/0.86 % --include_path ""
% 0.66/0.86 % --clausifier .//eprover
% 0.66/0.86 % --clausifier_options --tstp-format
% 0.66/0.86 % --stdin false
% 0.66/0.86 % --dbg_backtrace false
% 0.66/0.86 % --dbg_dump_prop_clauses false
% 0.66/0.86 % --dbg_dump_prop_clauses_file -
% 0.66/0.86 % --dbg_out_stat false
% 0.66/0.86
% 0.66/0.86 % ------ General Options
% 0.66/0.86
% 0.66/0.86 % --fof false
% 0.66/0.86 % --time_out_real 150.
% 0.66/0.86 % --time_out_prep_mult 0.2
% 0.66/0.86 % --time_out_virtual -1.
% 0.66/0.86 % --schedule none
% 0.66/0.86 % --ground_splitting input
% 0.66/0.86 % --splitting_nvd 16
% 0.66/0.86 % --non_eq_to_eq false
% 0.66/0.86 % --prep_gs_sim true
% 0.66/0.86 % --prep_unflatten false
% 0.66/0.86 % --prep_res_sim true
% 0.66/0.86 % --prep_upred true
% 0.66/0.86 % --res_sim_input true
% 0.66/0.86 % --clause_weak_htbl true
% 0.66/0.86 % --gc_record_bc_elim false
% 0.66/0.86 % --symbol_type_check false
% 0.66/0.86 % --clausify_out false
% 0.66/0.86 % --large_theory_mode false
% 0.66/0.86 % --prep_sem_filter none
% 0.66/0.86 % --prep_sem_filter_out false
% 0.66/0.86 % --preprocessed_out false
% 0.66/0.86 % --sub_typing false
% 0.66/0.86 % --brand_transform false
% 0.66/0.86 % --pure_diseq_elim true
% 0.66/0.86 % --min_unsat_core false
% 0.66/0.86 % --pred_elim true
% 0.66/0.86 % --add_important_lit false
% 0.66/0.86 % --soft_assumptions false
% 0.66/0.86 % --reset_solvers false
% 0.66/0.86 % --bc_imp_inh []
% 0.66/0.86 % --conj_cone_tolerance 1.5
% 0.66/0.86 % --prolific_symb_bound 500
% 0.66/0.86 % --lt_threshold 2000
% 0.66/0.86
% 0.66/0.86 % ------ SAT Options
% 0.66/0.86
% 0.66/0.86 % --sat_mode false
% 0.66/0.86 % --sat_fm_restart_options ""
% 0.66/0.86 % --sat_gr_def false
% 0.66/0.86 % --sat_epr_types true
% 0.66/0.86 % --sat_non_cyclic_types false
% 0.66/0.86 % --sat_finite_models false
% 0.66/0.86 % --sat_fm_lemmas false
% 0.66/0.86 % --sat_fm_prep false
% 0.66/0.86 % --sat_fm_uc_incr true
% 0.66/0.86 % --sat_out_model small
% 0.66/0.86 % --sat_out_clauses false
% 0.66/0.86
% 0.66/0.86 % ------ QBF Options
% 0.66/0.86
% 0.66/0.86 % --qbf_mode false
% 0.66/0.86 % --qbf_elim_univ true
% 0.66/0.86 % --qbf_sk_in true
% 0.66/0.86 % --qbf_pred_elim true
% 0.66/0.86 % --qbf_split 32
% 0.66/0.86
% 0.66/0.86 % ------ BMC1 Options
% 0.66/0.86
% 0.66/0.86 % --bmc1_incremental false
% 0.66/0.86 % --bmc1_axioms reachable_all
% 0.66/0.86 % --bmc1_min_bound 0
% 0.66/0.86 % --bmc1_max_bound -1
% 0.66/0.86 % --bmc1_max_bound_default -1
% 0.66/0.86 % --bmc1_symbol_reachability true
% 0.66/0.86 % --bmc1_property_lemmas false
% 0.66/0.86 % --bmc1_k_induction false
% 0.66/0.86 % --bmc1_non_equiv_states false
% 0.66/0.86 % --bmc1_deadlock false
% 0.66/0.86 % --bmc1_ucm false
% 0.66/0.86 % --bmc1_add_unsat_core none
% 0.66/0.86 % --bmc1_unsat_core_children false
% 0.66/0.86 % --bmc1_unsat_core_extrapolate_axioms false
% 0.66/0.86 % --bmc1_out_stat full
% 0.66/0.86 % --bmc1_ground_init false
% 0.66/0.86 % --bmc1_pre_inst_next_state false
% 0.66/0.86 % --bmc1_pre_inst_state false
% 0.66/0.86 % --bmc1_pre_inst_reach_state false
% 0.66/0.86 % --bmc1_out_unsat_core false
% 0.66/0.86 % --bmc1_aig_witness_out false
% 0.66/0.86 % --bmc1_verbose false
% 0.66/0.86 % --bmc1_dump_clauses_tptp false
% 0.66/1.14 % --bmc1_dump_unsat_core_tptp false
% 0.66/1.14 % --bmc1_dump_file -
% 0.66/1.14 % --bmc1_ucm_expand_uc_limit 128
% 0.66/1.14 % --bmc1_ucm_n_expand_iterations 6
% 0.66/1.14 % --bmc1_ucm_extend_mode 1
% 0.66/1.14 % --bmc1_ucm_init_mode 2
% 0.66/1.14 % --bmc1_ucm_cone_mode none
% 0.66/1.14 % --bmc1_ucm_reduced_relation_type 0
% 0.66/1.14 % --bmc1_ucm_relax_model 4
% 0.66/1.14 % --bmc1_ucm_full_tr_after_sat true
% 0.66/1.14 % --bmc1_ucm_expand_neg_assumptions false
% 0.66/1.14 % --bmc1_ucm_layered_model none
% 0.66/1.14 % --bmc1_ucm_max_lemma_size 10
% 0.66/1.14
% 0.66/1.14 % ------ AIG Options
% 0.66/1.14
% 0.66/1.14 % --aig_mode false
% 0.66/1.14
% 0.66/1.14 % ------ Instantiation Options
% 0.66/1.14
% 0.66/1.14 % --instantiation_flag true
% 0.66/1.14 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.66/1.14 % --inst_solver_per_active 750
% 0.66/1.14 % --inst_solver_calls_frac 0.5
% 0.66/1.14 % --inst_passive_queue_type priority_queues
% 0.66/1.14 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.66/1.14 % --inst_passive_queues_freq [25;2]
% 0.66/1.14 % --inst_dismatching true
% 0.66/1.14 % --inst_eager_unprocessed_to_passive true
% 0.66/1.14 % --inst_prop_sim_given true
% 0.66/1.14 % --inst_prop_sim_new false
% 0.66/1.14 % --inst_orphan_elimination true
% 0.66/1.14 % --inst_learning_loop_flag true
% 0.66/1.14 % --inst_learning_start 3000
% 0.66/1.14 % --inst_learning_factor 2
% 0.66/1.14 % --inst_start_prop_sim_after_learn 3
% 0.66/1.14 % --inst_sel_renew solver
% 0.66/1.14 % --inst_lit_activity_flag true
% 0.66/1.14 % --inst_out_proof true
% 0.66/1.14
% 0.66/1.14 % ------ Resolution Options
% 0.66/1.14
% 0.66/1.14 % --resolution_flag true
% 0.66/1.14 % --res_lit_sel kbo_max
% 0.66/1.14 % --res_to_prop_solver none
% 0.66/1.14 % --res_prop_simpl_new false
% 0.66/1.14 % --res_prop_simpl_given false
% 0.66/1.14 % --res_passive_queue_type priority_queues
% 0.66/1.14 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.66/1.14 % --res_passive_queues_freq [15;5]
% 0.66/1.14 % --res_forward_subs full
% 0.66/1.14 % --res_backward_subs full
% 0.66/1.14 % --res_forward_subs_resolution true
% 0.66/1.14 % --res_backward_subs_resolution true
% 0.66/1.14 % --res_orphan_elimination false
% 0.66/1.14 % --res_time_limit 1000.
% 0.66/1.14 % --res_out_proof true
% 0.66/1.14 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_c8f003.s
% 0.66/1.14 % --modulo true
% 0.66/1.14
% 0.66/1.14 % ------ Combination Options
% 0.66/1.14
% 0.66/1.14 % --comb_res_mult 1000
% 0.66/1.14 % --comb_inst_mult 300
% 0.66/1.14 % ------
% 0.66/1.14
% 0.66/1.14 % ------ Parsing...% successful
% 0.66/1.14
% 0.66/1.14 % ------ 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.66/1.14
% 0.66/1.14 % ------ Proving...
% 0.66/1.14 % ------ Problem Properties
% 0.66/1.14
% 0.66/1.14 %
% 0.66/1.14 % EPR false
% 0.66/1.14 % Horn false
% 0.66/1.14 % Has equality true
% 0.66/1.14
% 0.66/1.14 % % ------ Input Options Time Limit: Unbounded
% 0.66/1.14
% 0.66/1.14
% 0.66/1.14 Compiling...
% 0.66/1.14 Loading plugin: done.
% 0.66/1.14 Compiling...
% 0.66/1.14 Loading plugin: done.
% 0.66/1.14 % % ------ Current options:
% 0.66/1.14
% 0.66/1.14 % ------ Input Options
% 0.66/1.14
% 0.66/1.14 % --out_options all
% 0.66/1.14 % --tptp_safe_out true
% 0.66/1.14 % --problem_path ""
% 0.66/1.14 % --include_path ""
% 0.66/1.14 % --clausifier .//eprover
% 0.66/1.14 % --clausifier_options --tstp-format
% 0.66/1.14 % --stdin false
% 0.66/1.14 % --dbg_backtrace false
% 0.66/1.14 % --dbg_dump_prop_clauses false
% 0.66/1.14 % --dbg_dump_prop_clauses_file -
% 0.66/1.14 % --dbg_out_stat false
% 0.66/1.14
% 0.66/1.14 % ------ General Options
% 0.66/1.14
% 0.66/1.14 % --fof false
% 0.66/1.14 % --time_out_real 150.
% 0.66/1.14 % --time_out_prep_mult 0.2
% 0.66/1.14 % --time_out_virtual -1.
% 0.66/1.14 % --schedule none
% 0.66/1.14 % --ground_splitting input
% 0.66/1.14 % --splitting_nvd 16
% 0.66/1.14 % --non_eq_to_eq false
% 0.66/1.14 % --prep_gs_sim true
% 0.66/1.14 % --prep_unflatten false
% 0.66/1.14 % --prep_res_sim true
% 0.66/1.14 % --prep_upred true
% 0.66/1.14 % --res_sim_input true
% 0.66/1.14 % --clause_weak_htbl true
% 0.66/1.14 % --gc_record_bc_elim false
% 0.66/1.14 % --symbol_type_check false
% 0.66/1.14 % --clausify_out false
% 0.66/1.14 % --large_theory_mode false
% 0.66/1.14 % --prep_sem_filter none
% 0.66/1.14 % --prep_sem_filter_out false
% 0.66/1.14 % --preprocessed_out false
% 0.66/1.14 % --sub_typing false
% 0.66/1.14 % --brand_transform false
% 0.66/1.14 % --pure_diseq_elim true
% 0.66/1.14 % --min_unsat_core false
% 0.66/1.14 % --pred_elim true
% 0.66/1.14 % --add_important_lit false
% 0.66/1.14 % --soft_assumptions false
% 0.66/1.14 % --reset_solvers false
% 0.66/1.14 % --bc_imp_inh []
% 0.66/1.14 % --conj_cone_tolerance 1.5
% 0.66/1.14 % --prolific_symb_bound 500
% 0.66/1.14 % --lt_threshold 2000
% 0.66/1.14
% 0.66/1.14 % ------ SAT Options
% 0.66/1.14
% 0.66/1.14 % --sat_mode false
% 0.66/1.14 % --sat_fm_restart_options ""
% 0.66/1.14 % --sat_gr_def false
% 0.66/1.14 % --sat_epr_types true
% 0.66/1.14 % --sat_non_cyclic_types false
% 0.66/1.14 % --sat_finite_models false
% 0.66/1.14 % --sat_fm_lemmas false
% 0.66/1.14 % --sat_fm_prep false
% 0.66/1.14 % --sat_fm_uc_incr true
% 0.66/1.14 % --sat_out_model small
% 0.66/1.14 % --sat_out_clauses false
% 0.66/1.14
% 0.66/1.14 % ------ QBF Options
% 0.66/1.14
% 0.66/1.14 % --qbf_mode false
% 0.66/1.14 % --qbf_elim_univ true
% 0.66/1.14 % --qbf_sk_in true
% 0.66/1.14 % --qbf_pred_elim true
% 0.66/1.14 % --qbf_split 32
% 0.66/1.14
% 0.66/1.14 % ------ BMC1 Options
% 0.66/1.14
% 0.66/1.14 % --bmc1_incremental false
% 0.66/1.14 % --bmc1_axioms reachable_all
% 0.66/1.14 % --bmc1_min_bound 0
% 0.66/1.14 % --bmc1_max_bound -1
% 0.66/1.14 % --bmc1_max_bound_default -1
% 0.66/1.14 % --bmc1_symbol_reachability true
% 0.66/1.14 % --bmc1_property_lemmas false
% 0.66/1.14 % --bmc1_k_induction false
% 0.66/1.14 % --bmc1_non_equiv_states false
% 0.66/1.14 % --bmc1_deadlock false
% 0.66/1.14 % --bmc1_ucm false
% 0.66/1.14 % --bmc1_add_unsat_core none
% 0.66/1.14 % --bmc1_unsat_core_children false
% 0.66/1.14 % --bmc1_unsat_core_extrapolate_axioms false
% 0.66/1.14 % --bmc1_out_stat full
% 0.66/1.14 % --bmc1_ground_init false
% 0.66/1.14 % --bmc1_pre_inst_next_state false
% 0.66/1.14 % --bmc1_pre_inst_state false
% 0.66/1.14 % --bmc1_pre_inst_reach_state false
% 0.66/1.14 % --bmc1_out_unsat_core false
% 0.66/1.14 % --bmc1_aig_witness_out false
% 0.66/1.14 % --bmc1_verbose false
% 0.66/1.14 % --bmc1_dump_clauses_tptp false
% 0.66/1.14 % --bmc1_dump_unsat_core_tptp false
% 0.66/1.14 % --bmc1_dump_file -
% 0.66/1.14 % --bmc1_ucm_expand_uc_limit 128
% 0.66/1.14 % --bmc1_ucm_n_expand_iterations 6
% 0.66/1.14 % --bmc1_ucm_extend_mode 1
% 0.66/1.14 % --bmc1_ucm_init_mode 2
% 0.66/1.14 % --bmc1_ucm_cone_mode none
% 0.66/1.14 % --bmc1_ucm_reduced_relation_type 0
% 0.66/1.14 % --bmc1_ucm_relax_model 4
% 0.66/1.14 % --bmc1_ucm_full_tr_after_sat true
% 0.66/1.14 % --bmc1_ucm_expand_neg_assumptions false
% 0.66/1.14 % --bmc1_ucm_layered_model none
% 0.66/1.14 % --bmc1_ucm_max_lemma_size 10
% 0.66/1.14
% 0.66/1.14 % ------ AIG Options
% 0.66/1.14
% 0.66/1.14 % --aig_mode false
% 0.66/1.14
% 0.66/1.14 % ------ Instantiation Options
% 0.66/1.14
% 0.66/1.14 % --instantiation_flag true
% 0.66/1.14 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.66/1.14 % --inst_solver_per_active 750
% 0.66/1.14 % --inst_solver_calls_frac 0.5
% 0.66/1.14 % --inst_passive_queue_type priority_queues
% 0.66/1.14 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.66/1.14 % --inst_passive_queues_freq [25;2]
% 0.66/1.14 % --inst_dismatching true
% 37.81/38.08 % --inst_eager_unprocessed_to_passive true
% 37.81/38.08 % --inst_prop_sim_given true
% 37.81/38.08 % --inst_prop_sim_new false
% 37.81/38.08 % --inst_orphan_elimination true
% 37.81/38.08 % --inst_learning_loop_flag true
% 37.81/38.08 % --inst_learning_start 3000
% 37.81/38.08 % --inst_learning_factor 2
% 37.81/38.08 % --inst_start_prop_sim_after_learn 3
% 37.81/38.08 % --inst_sel_renew solver
% 37.81/38.08 % --inst_lit_activity_flag true
% 37.81/38.08 % --inst_out_proof true
% 37.81/38.08
% 37.81/38.08 % ------ Resolution Options
% 37.81/38.08
% 37.81/38.08 % --resolution_flag true
% 37.81/38.08 % --res_lit_sel kbo_max
% 37.81/38.08 % --res_to_prop_solver none
% 37.81/38.08 % --res_prop_simpl_new false
% 37.81/38.08 % --res_prop_simpl_given false
% 37.81/38.08 % --res_passive_queue_type priority_queues
% 37.81/38.08 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 37.81/38.08 % --res_passive_queues_freq [15;5]
% 37.81/38.08 % --res_forward_subs full
% 37.81/38.08 % --res_backward_subs full
% 37.81/38.08 % --res_forward_subs_resolution true
% 37.81/38.08 % --res_backward_subs_resolution true
% 37.81/38.08 % --res_orphan_elimination false
% 37.81/38.08 % --res_time_limit 1000.
% 37.81/38.08 % --res_out_proof true
% 37.81/38.08 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_c8f003.s
% 37.81/38.08 % --modulo true
% 37.81/38.08
% 37.81/38.08 % ------ Combination Options
% 37.81/38.08
% 37.81/38.08 % --comb_res_mult 1000
% 37.81/38.08 % --comb_inst_mult 300
% 37.81/38.08 % ------
% 37.81/38.08
% 37.81/38.08
% 37.81/38.08
% 37.81/38.08 % ------ Proving...
% 37.81/38.08 % warning: shown sat in sat incomplete mode
% 37.81/38.08 %
% 37.81/38.08
% 37.81/38.08
% 37.81/38.08 ------ Building Model...Done
% 37.81/38.08
% 37.81/38.08 %------ The model is defined over ground terms (initial term algebra).
% 37.81/38.08 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 37.81/38.08 %------ where \phi is a formula over the term algebra.
% 37.81/38.08 %------ If we have equality in the problem then it is also defined as a predicate above,
% 37.81/38.08 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 37.81/38.08 %------ See help for --sat_out_model for different model outputs.
% 37.81/38.08 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 37.81/38.08 %------ where the first argument stands for the sort ($i in the unsorted case)
% 37.81/38.08
% 37.81/38.08
% 37.81/38.08
% 37.81/38.08
% 37.81/38.08 %------ Negative definition of equality_sorted
% 37.81/38.08 fof(lit_def,axiom,
% 37.81/38.08 (! [X0,X0,X1] :
% 37.81/38.08 ( ~(equality_sorted(X0,X0,X1)) <=>
% 37.81/38.08 (
% 37.81/38.08 (
% 37.81/38.08 ( X0=$i & X0=false & X1=true )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=$i & X0=err & X1=false )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=$i & X0=err & X1=true )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=$i & X0=not1(false) & X1=false )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=$i & X0=prop(X2) & X1=false )
% 37.81/38.08 &
% 37.81/38.08 ( X2!=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=$i & X0=exists2(sk2_esk1_0) & X1=exists1(sk2_esk1_0) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=$i & X0=phi(true) & X1=false )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=$i & X0=prop(err) & X1=true )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=$i & X0=lazy_impl(false,X2) & X1=false )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=$i & X1=true )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=lazy_impl(false,X0) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=prop(X0) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=impl(false,X0) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=or1(true,X0) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=and1(true,true) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=impl(true,true) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=or1(false,true) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 )
% 37.81/38.08 )
% 37.81/38.08 )
% 37.81/38.08 ).
% 37.81/38.08
% 37.81/38.08 %------ Negative definition of d
% 37.81/38.08 fof(lit_def,axiom,
% 37.81/38.08 (! [X0] :
% 37.81/38.08 ( ~(d(X0)) <=>
% 37.81/38.08 (
% 37.81/38.08 (
% 37.81/38.08 ( X0=not1(false) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=phi(true) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X1] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=lazy_impl(false,X1) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 )
% 37.81/38.08 )
% 37.81/38.08 )
% 37.81/38.08 ).
% 37.81/38.08
% 37.81/38.08 %------ Positive definition of forallprefers
% 37.81/38.08 fof(lit_def,axiom,
% 37.81/38.08 (! [X0,X1] :
% 37.81/38.08 ( forallprefers(X0,X1) <=>
% 37.81/38.08 (
% 37.81/38.08 (
% 37.81/38.08 ( X0=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=not1(false) & X1=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=phi(true) & X1=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) & X1=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) & X1=not1(false) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) & X1=prop(X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X2!=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) & X1=phi(true) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) & X1=and1(true,true) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) & X1=impl(true,true) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) & X1=or1(false,true) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) & X1=lazy_impl(false,X2) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) & X1=impl(false,X2) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) & X1=or1(true,X2) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=lazy_impl(false,X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=lazy_impl(false,X2) & X1=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X1=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=lazy_impl(false,X0) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=prop(X0) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=phi(true) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X1=prop(X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=prop(X0) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=prop(err) | X2!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X2!=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X1=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=lazy_impl(false,X0) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=prop(X0) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=phi(true) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X1=and1(true,true) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=prop(X0) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X1=impl(true,true) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=prop(X0) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X1=or1(false,true) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=prop(X0) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X1=lazy_impl(false,X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=lazy_impl(false,X0) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=prop(X0) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=phi(true) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X1=impl(false,X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=prop(X0) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X1=or1(true,X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X0!=prop(X0) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 )
% 37.81/38.08 )
% 37.81/38.08 )
% 37.81/38.08 ).
% 37.81/38.08
% 37.81/38.08 %------ Positive definition of existsprefers
% 37.81/38.08 fof(lit_def,axiom,
% 37.81/38.08 (! [X0,X1] :
% 37.81/38.08 ( existsprefers(X0,X1) <=>
% 37.81/38.08 (
% 37.81/38.08 (
% 37.81/38.08 ( X0=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=err & X1=prop(X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X2!=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=not1(false) & X1=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=not1(false) & X1=prop(X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X2!=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=not1(false) & X1=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(X2) & X1=prop(err) )
% 37.81/38.08 &
% 37.81/38.08 ( X2!=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=phi(true) & X1=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=phi(true) & X1=prop(X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X2!=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=phi(true) & X1=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=and1(true,true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=and1(true,true) & X1=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=impl(true,true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=impl(true,true) & X1=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=or1(false,true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=or1(false,true) & X1=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) & X1=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=prop(err) & X1=prop(X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X2!=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=lazy_impl(false,X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=lazy_impl(false,X2) & X1=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=lazy_impl(false,X2) & X1=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2,X3] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=lazy_impl(false,X2) & X1=prop(X3) )
% 37.81/38.08 &
% 37.81/38.08 ( X3!=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=impl(false,X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=impl(false,X2) & X1=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=or1(true,X2) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=err )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=not1(false) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=phi(true) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=lazy_impl(false,X1) )
% 37.81/38.08 &
% 37.81/38.08 ( X1!=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 |
% 37.81/38.08 ? [X2] :
% 37.81/38.08 (
% 37.81/38.08 ( X0=or1(true,X2) & X1=prop(err) )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 )
% 37.81/38.08 )
% 37.81/38.08 )
% 37.81/38.08 ).
% 37.81/38.08
% 37.81/38.08 %------ Negative definition of bool
% 37.81/38.08 fof(lit_def,axiom,
% 37.81/38.08 (! [X0] :
% 37.81/38.08 ( ~(bool(X0)) <=>
% 37.81/38.08 (
% 37.81/38.08 (
% 37.81/38.08 ( X0=err )
% 37.81/38.08 )
% 37.81/38.08
% 37.81/38.08 )
% 37.81/38.08 )
% 37.81/38.08 )
% 37.81/38.08 ).
% 37.81/38.08
% 37.81/38.08
% 37.81/38.08
% 37.81/38.08 % ------ Statistics
% 37.81/38.08
% 37.81/38.08 % ------ General
% 37.81/38.08
% 37.81/38.08 % num_of_input_clauses: 242
% 37.81/38.08 % num_of_input_neg_conjectures: 2
% 37.81/38.08 % num_of_splits: 0
% 37.81/38.08 % num_of_split_atoms: 0
% 37.81/38.08 % num_of_sem_filtered_clauses: 0
% 37.81/38.08 % num_of_subtypes: 0
% 37.81/38.08 % monotx_restored_types: 0
% 37.81/38.08 % sat_num_of_epr_types: 0
% 37.81/38.08 % sat_num_of_non_cyclic_types: 0
% 37.81/38.08 % sat_guarded_non_collapsed_types: 0
% 37.81/38.08 % is_epr: 0
% 37.81/38.08 % is_horn: 0
% 37.81/38.08 % has_eq: 1
% 37.81/38.08 % num_pure_diseq_elim: 0
% 37.81/38.08 % simp_replaced_by: 2
% 37.81/38.08 % res_preprocessed: 4
% 37.81/38.08 % prep_upred: 0
% 37.81/38.08 % prep_unflattend: 0
% 37.81/38.08 % pred_elim_cands: 0
% 37.81/38.08 % pred_elim: 0
% 37.81/38.08 % pred_elim_cl: 0
% 37.81/38.08 % pred_elim_cycles: 0
% 37.81/38.08 % forced_gc_time: 0
% 37.81/38.08 % gc_basic_clause_elim: 0
% 37.81/38.08 % parsing_time: 0.008
% 37.81/38.08 % sem_filter_time: 0.
% 37.81/38.08 % pred_elim_time: 0.
% 37.81/38.08 % out_proof_time: 0.
% 37.81/38.08 % monotx_time: 0.
% 37.81/38.08 % subtype_inf_time: 0.
% 37.81/38.08 % unif_index_cands_time: 0.306
% 37.81/38.08 % unif_index_add_time: 0.072
% 37.81/38.08 % total_time: 37.237
% 37.81/38.08 % num_of_symbols: 64
% 37.81/38.08 % num_of_terms: 77426
% 37.81/38.08
% 37.81/38.08 % ------ Propositional Solver
% 37.81/38.08
% 37.81/38.08 % prop_solver_calls: 34
% 37.81/38.08 % prop_fast_solver_calls: 9
% 37.81/38.08 % prop_num_of_clauses: 11275
% 37.81/38.08 % prop_preprocess_simplified: 22441
% 37.81/38.08 % prop_fo_subsumed: 0
% 37.81/38.08 % prop_solver_time: 0.008
% 37.81/38.08 % prop_fast_solver_time: 0.
% 37.81/38.08 % prop_unsat_core_time: 0.
% 37.81/38.08
% 37.81/38.08 % ------ QBF
% 37.81/38.08
% 37.81/38.08 % qbf_q_res: 0
% 37.81/38.08 % qbf_num_tautologies: 0
% 37.81/38.08 % qbf_prep_cycles: 0
% 37.81/38.08
% 37.81/38.08 % ------ BMC1
% 37.81/38.08
% 37.81/38.08 % bmc1_current_bound: -1
% 37.81/38.08 % bmc1_last_solved_bound: -1
% 37.81/38.08 % bmc1_unsat_core_size: -1
% 37.81/38.08 % bmc1_unsat_core_parents_size: -1
% 37.81/38.08 % bmc1_merge_next_fun: 0
% 37.81/38.08 % bmc1_unsat_core_clauses_time: 0.
% 37.81/38.08
% 37.81/38.08 % ------ Instantiation
% 37.81/38.08
% 37.81/38.08 % inst_num_of_clauses: 1196
% 37.81/38.08 % inst_num_in_passive: 0
% 37.81/38.08 % inst_num_in_active: 1161
% 37.81/38.08 % inst_num_in_unprocessed: 0
% 37.81/38.08 % inst_num_of_loops: 1251
% 37.81/38.08 % inst_num_of_learning_restarts: 2
% 37.81/38.08 % inst_num_moves_active_passive: 48
% 37.81/38.08 % inst_lit_activity: 309
% 37.81/38.08 % inst_lit_activity_moves: 0
% 37.81/38.08 % inst_num_tautologies: 35
% 37.81/38.08 % inst_num_prop_implied: 0
% 37.81/38.08 % inst_num_existing_simplified: 0
% 37.81/38.08 % inst_num_eq_res_simplified: 0
% 37.81/38.08 % inst_num_child_elim: 0
% 37.81/38.08 % inst_num_of_dismatching_blockings: 189
% 37.81/38.08 % inst_num_of_non_proper_insts: 2787
% 37.81/38.08 % inst_num_of_duplicates: 1112
% 37.81/38.08 % inst_inst_num_from_inst_to_res: 0
% 37.81/38.08 % inst_dismatching_checking_time: 0.035
% 37.81/38.08
% 37.81/38.08 % ------ Resolution
% 37.81/38.08
% 37.81/38.08 % res_num_of_clauses: 84297
% 37.81/38.08 % res_num_in_passive: 73054
% 37.81/38.08 % res_num_in_active: 11053
% 37.81/38.08 % res_num_of_loops: 35000
% 37.81/38.08 % res_forward_subset_subsumed: 192464
% 37.81/38.08 % res_backward_subset_subsumed: 0
% 37.81/38.08 % res_forward_subsumed: 23503
% 37.81/38.08 % res_backward_subsumed: 0
% 37.81/38.08 % res_forward_subsumption_resolution: 1420
% 37.81/38.08 % res_backward_subsumption_resolution: 532
% 37.81/38.08 % res_clause_to_clause_subsumption: 178337
% 37.81/38.08 % res_orphan_elimination: 0
% 37.81/38.08 % res_tautology_del: 261791
% 37.81/38.08 % res_num_eq_res_simplified: 0
% 37.81/38.08 % res_num_sel_changes: 0
% 37.81/38.08 % res_moves_from_active_to_pass: 0
% 37.81/38.08
% 37.81/38.08 % Status Unknown
% 37.81/38.08 % Last status :
% 37.81/38.08 % SZS status Unknown
%------------------------------------------------------------------------------