TSTP Solution File: CAT006-3 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : CAT006-3 : TPTP v8.1.0. Released v1.0.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 : Fri Jul 15 00:01:29 EDT 2022
% Result : Unknown 150.33s 150.61s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CAT006-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % 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 May 29 17:23:39 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.37 % Running in mono-core mode
% 0.22/0.42 % Orienting using strategy Equiv(ClausalAll)
% 0.22/0.42 % Orientation found
% 0.22/0.42 % 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_6cddc7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_14371a.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_1fc614 | grep -v "SZS"
% 0.22/0.44
% 0.22/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.44
% 0.22/0.44 %
% 0.22/0.44 % ------ iProver source info
% 0.22/0.44
% 0.22/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.44 % git: non_committed_changes: true
% 0.22/0.44 % git: last_make_outside_of_git: true
% 0.22/0.44
% 0.22/0.44 %
% 0.22/0.44 % ------ Input Options
% 0.22/0.44
% 0.22/0.44 % --out_options all
% 0.22/0.44 % --tptp_safe_out true
% 0.22/0.44 % --problem_path ""
% 0.22/0.44 % --include_path ""
% 0.22/0.44 % --clausifier .//eprover
% 0.22/0.44 % --clausifier_options --tstp-format
% 0.22/0.44 % --stdin false
% 0.22/0.44 % --dbg_backtrace false
% 0.22/0.44 % --dbg_dump_prop_clauses false
% 0.22/0.44 % --dbg_dump_prop_clauses_file -
% 0.22/0.44 % --dbg_out_stat false
% 0.22/0.44
% 0.22/0.44 % ------ General Options
% 0.22/0.44
% 0.22/0.44 % --fof false
% 0.22/0.44 % --time_out_real 150.
% 0.22/0.44 % --time_out_prep_mult 0.2
% 0.22/0.44 % --time_out_virtual -1.
% 0.22/0.44 % --schedule none
% 0.22/0.44 % --ground_splitting input
% 0.22/0.44 % --splitting_nvd 16
% 0.22/0.44 % --non_eq_to_eq false
% 0.22/0.44 % --prep_gs_sim true
% 0.22/0.44 % --prep_unflatten false
% 0.22/0.44 % --prep_res_sim true
% 0.22/0.44 % --prep_upred true
% 0.22/0.44 % --res_sim_input true
% 0.22/0.44 % --clause_weak_htbl true
% 0.22/0.44 % --gc_record_bc_elim false
% 0.22/0.44 % --symbol_type_check false
% 0.22/0.44 % --clausify_out false
% 0.22/0.44 % --large_theory_mode false
% 0.22/0.44 % --prep_sem_filter none
% 0.22/0.44 % --prep_sem_filter_out false
% 0.22/0.44 % --preprocessed_out false
% 0.22/0.44 % --sub_typing false
% 0.22/0.44 % --brand_transform false
% 0.22/0.44 % --pure_diseq_elim true
% 0.22/0.44 % --min_unsat_core false
% 0.22/0.44 % --pred_elim true
% 0.22/0.44 % --add_important_lit false
% 0.22/0.44 % --soft_assumptions false
% 0.22/0.44 % --reset_solvers false
% 0.22/0.44 % --bc_imp_inh []
% 0.22/0.44 % --conj_cone_tolerance 1.5
% 0.22/0.44 % --prolific_symb_bound 500
% 0.22/0.44 % --lt_threshold 2000
% 0.22/0.44
% 0.22/0.44 % ------ SAT Options
% 0.22/0.44
% 0.22/0.44 % --sat_mode false
% 0.22/0.44 % --sat_fm_restart_options ""
% 0.22/0.44 % --sat_gr_def false
% 0.22/0.44 % --sat_epr_types true
% 0.22/0.44 % --sat_non_cyclic_types false
% 0.22/0.44 % --sat_finite_models false
% 0.22/0.44 % --sat_fm_lemmas false
% 0.22/0.44 % --sat_fm_prep false
% 0.22/0.44 % --sat_fm_uc_incr true
% 0.22/0.44 % --sat_out_model small
% 0.22/0.44 % --sat_out_clauses false
% 0.22/0.44
% 0.22/0.44 % ------ QBF Options
% 0.22/0.44
% 0.22/0.44 % --qbf_mode false
% 0.22/0.44 % --qbf_elim_univ true
% 0.22/0.44 % --qbf_sk_in true
% 0.22/0.44 % --qbf_pred_elim true
% 0.22/0.44 % --qbf_split 32
% 0.22/0.44
% 0.22/0.44 % ------ BMC1 Options
% 0.22/0.44
% 0.22/0.44 % --bmc1_incremental false
% 0.22/0.44 % --bmc1_axioms reachable_all
% 0.22/0.44 % --bmc1_min_bound 0
% 0.22/0.44 % --bmc1_max_bound -1
% 0.22/0.44 % --bmc1_max_bound_default -1
% 0.22/0.44 % --bmc1_symbol_reachability true
% 0.22/0.44 % --bmc1_property_lemmas false
% 0.22/0.44 % --bmc1_k_induction false
% 0.22/0.44 % --bmc1_non_equiv_states false
% 0.22/0.44 % --bmc1_deadlock false
% 0.22/0.44 % --bmc1_ucm false
% 0.22/0.44 % --bmc1_add_unsat_core none
% 0.22/0.44 % --bmc1_unsat_core_children false
% 0.22/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.44 % --bmc1_out_stat full
% 0.22/0.44 % --bmc1_ground_init false
% 0.22/0.44 % --bmc1_pre_inst_next_state false
% 0.22/0.44 % --bmc1_pre_inst_state false
% 0.22/0.44 % --bmc1_pre_inst_reach_state false
% 0.22/0.44 % --bmc1_out_unsat_core false
% 0.22/0.44 % --bmc1_aig_witness_out false
% 0.22/0.44 % --bmc1_verbose false
% 0.22/0.44 % --bmc1_dump_clauses_tptp false
% 0.22/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.53 % --bmc1_dump_file -
% 0.22/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.53 % --bmc1_ucm_extend_mode 1
% 0.22/0.53 % --bmc1_ucm_init_mode 2
% 0.22/0.53 % --bmc1_ucm_cone_mode none
% 0.22/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.53 % --bmc1_ucm_relax_model 4
% 0.22/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.53 % --bmc1_ucm_layered_model none
% 0.22/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.53
% 0.22/0.53 % ------ AIG Options
% 0.22/0.53
% 0.22/0.53 % --aig_mode false
% 0.22/0.53
% 0.22/0.53 % ------ Instantiation Options
% 0.22/0.53
% 0.22/0.53 % --instantiation_flag true
% 0.22/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.53 % --inst_solver_per_active 750
% 0.22/0.53 % --inst_solver_calls_frac 0.5
% 0.22/0.53 % --inst_passive_queue_type priority_queues
% 0.22/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.53 % --inst_passive_queues_freq [25;2]
% 0.22/0.53 % --inst_dismatching true
% 0.22/0.53 % --inst_eager_unprocessed_to_passive true
% 0.22/0.53 % --inst_prop_sim_given true
% 0.22/0.53 % --inst_prop_sim_new false
% 0.22/0.53 % --inst_orphan_elimination true
% 0.22/0.53 % --inst_learning_loop_flag true
% 0.22/0.53 % --inst_learning_start 3000
% 0.22/0.53 % --inst_learning_factor 2
% 0.22/0.53 % --inst_start_prop_sim_after_learn 3
% 0.22/0.53 % --inst_sel_renew solver
% 0.22/0.53 % --inst_lit_activity_flag true
% 0.22/0.53 % --inst_out_proof true
% 0.22/0.53
% 0.22/0.53 % ------ Resolution Options
% 0.22/0.53
% 0.22/0.53 % --resolution_flag true
% 0.22/0.53 % --res_lit_sel kbo_max
% 0.22/0.53 % --res_to_prop_solver none
% 0.22/0.53 % --res_prop_simpl_new false
% 0.22/0.53 % --res_prop_simpl_given false
% 0.22/0.53 % --res_passive_queue_type priority_queues
% 0.22/0.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.53 % --res_passive_queues_freq [15;5]
% 0.22/0.53 % --res_forward_subs full
% 0.22/0.53 % --res_backward_subs full
% 0.22/0.53 % --res_forward_subs_resolution true
% 0.22/0.53 % --res_backward_subs_resolution true
% 0.22/0.53 % --res_orphan_elimination false
% 0.22/0.53 % --res_time_limit 1000.
% 0.22/0.53 % --res_out_proof true
% 0.22/0.53 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_6cddc7.s
% 0.22/0.53 % --modulo true
% 0.22/0.53
% 0.22/0.53 % ------ Combination Options
% 0.22/0.53
% 0.22/0.53 % --comb_res_mult 1000
% 0.22/0.53 % --comb_inst_mult 300
% 0.22/0.53 % ------
% 0.22/0.53
% 0.22/0.53 % ------ Parsing...% successful
% 0.22/0.53
% 0.22/0.53 % ------ 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.22/0.53
% 0.22/0.53 % ------ Proving...
% 0.22/0.53 % ------ Problem Properties
% 0.22/0.53
% 0.22/0.53 %
% 0.22/0.53 % EPR false
% 0.22/0.53 % Horn false
% 0.22/0.53 % Has equality true
% 0.22/0.53
% 0.22/0.53 % % ------ Input Options Time Limit: Unbounded
% 0.22/0.53
% 0.22/0.53
% 0.22/0.53 Compiling...
% 0.22/0.53 Loading plugin: done.
% 0.22/0.53 % % ------ Current options:
% 0.22/0.53
% 0.22/0.53 % ------ Input Options
% 0.22/0.53
% 0.22/0.53 % --out_options all
% 0.22/0.53 % --tptp_safe_out true
% 0.22/0.53 % --problem_path ""
% 0.22/0.53 % --include_path ""
% 0.22/0.53 % --clausifier .//eprover
% 0.22/0.53 % --clausifier_options --tstp-format
% 0.22/0.53 % --stdin false
% 0.22/0.53 % --dbg_backtrace false
% 0.22/0.53 % --dbg_dump_prop_clauses false
% 0.22/0.53 % --dbg_dump_prop_clauses_file -
% 0.22/0.53 % --dbg_out_stat false
% 0.22/0.53
% 0.22/0.53 % ------ General Options
% 0.22/0.53
% 0.22/0.53 % --fof false
% 0.22/0.53 % --time_out_real 150.
% 0.22/0.53 % --time_out_prep_mult 0.2
% 0.22/0.53 % --time_out_virtual -1.
% 0.22/0.53 % --schedule none
% 0.22/0.53 % --ground_splitting input
% 0.22/0.53 % --splitting_nvd 16
% 0.22/0.53 % --non_eq_to_eq false
% 0.22/0.53 % --prep_gs_sim true
% 0.22/0.53 % --prep_unflatten false
% 0.22/0.53 % --prep_res_sim true
% 0.22/0.53 % --prep_upred true
% 0.22/0.53 % --res_sim_input true
% 0.22/0.53 % --clause_weak_htbl true
% 0.22/0.53 % --gc_record_bc_elim false
% 0.22/0.53 % --symbol_type_check false
% 0.22/0.53 % --clausify_out false
% 0.22/0.53 % --large_theory_mode false
% 0.22/0.53 % --prep_sem_filter none
% 0.22/0.53 % --prep_sem_filter_out false
% 0.22/0.53 % --preprocessed_out false
% 0.22/0.53 % --sub_typing false
% 0.22/0.53 % --brand_transform false
% 0.22/0.53 % --pure_diseq_elim true
% 0.22/0.53 % --min_unsat_core false
% 0.22/0.53 % --pred_elim true
% 0.22/0.53 % --add_important_lit false
% 0.22/0.53 % --soft_assumptions false
% 0.22/0.53 % --reset_solvers false
% 0.22/0.53 % --bc_imp_inh []
% 0.22/0.53 % --conj_cone_tolerance 1.5
% 0.22/0.53 % --prolific_symb_bound 500
% 0.22/0.53 % --lt_threshold 2000
% 0.22/0.53
% 0.22/0.53 % ------ SAT Options
% 0.22/0.53
% 0.22/0.53 % --sat_mode false
% 0.22/0.53 % --sat_fm_restart_options ""
% 0.22/0.53 % --sat_gr_def false
% 0.22/0.53 % --sat_epr_types true
% 0.22/0.53 % --sat_non_cyclic_types false
% 0.22/0.53 % --sat_finite_models false
% 0.22/0.53 % --sat_fm_lemmas false
% 0.22/0.53 % --sat_fm_prep false
% 0.22/0.53 % --sat_fm_uc_incr true
% 0.22/0.53 % --sat_out_model small
% 0.22/0.53 % --sat_out_clauses false
% 0.22/0.53
% 0.22/0.53 % ------ QBF Options
% 0.22/0.53
% 0.22/0.53 % --qbf_mode false
% 0.22/0.53 % --qbf_elim_univ true
% 0.22/0.53 % --qbf_sk_in true
% 0.22/0.53 % --qbf_pred_elim true
% 0.22/0.53 % --qbf_split 32
% 0.22/0.53
% 0.22/0.53 % ------ BMC1 Options
% 0.22/0.53
% 0.22/0.53 % --bmc1_incremental false
% 0.22/0.53 % --bmc1_axioms reachable_all
% 0.22/0.53 % --bmc1_min_bound 0
% 0.22/0.53 % --bmc1_max_bound -1
% 0.22/0.53 % --bmc1_max_bound_default -1
% 0.22/0.53 % --bmc1_symbol_reachability true
% 0.22/0.53 % --bmc1_property_lemmas false
% 0.22/0.53 % --bmc1_k_induction false
% 0.22/0.53 % --bmc1_non_equiv_states false
% 0.22/0.53 % --bmc1_deadlock false
% 0.22/0.53 % --bmc1_ucm false
% 0.22/0.53 % --bmc1_add_unsat_core none
% 0.22/0.53 % --bmc1_unsat_core_children false
% 0.22/0.53 % --bmc1_unsat_core_extrapolate_axioms false
% 0.22/0.53 % --bmc1_out_stat full
% 0.22/0.53 % --bmc1_ground_init false
% 0.22/0.53 % --bmc1_pre_inst_next_state false
% 0.22/0.53 % --bmc1_pre_inst_state false
% 0.22/0.53 % --bmc1_pre_inst_reach_state false
% 0.22/0.53 % --bmc1_out_unsat_core false
% 0.22/0.53 % --bmc1_aig_witness_out false
% 0.22/0.53 % --bmc1_verbose false
% 0.22/0.53 % --bmc1_dump_clauses_tptp false
% 0.22/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.22/0.53 % --bmc1_dump_file -
% 0.22/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.22/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.22/0.53 % --bmc1_ucm_extend_mode 1
% 0.22/0.53 % --bmc1_ucm_init_mode 2
% 0.22/0.53 % --bmc1_ucm_cone_mode none
% 0.22/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.22/0.53 % --bmc1_ucm_relax_model 4
% 0.22/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.22/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.22/0.53 % --bmc1_ucm_layered_model none
% 0.22/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.22/0.53
% 0.22/0.53 % ------ AIG Options
% 0.22/0.53
% 0.22/0.53 % --aig_mode false
% 0.22/0.53
% 0.22/0.53 % ------ Instantiation Options
% 0.22/0.53
% 0.22/0.53 % --instantiation_flag true
% 0.22/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.53 % --inst_solver_per_active 750
% 0.22/0.53 % --inst_solver_calls_frac 0.5
% 0.22/0.53 % --inst_passive_queue_type priority_queues
% 0.22/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.53 % --inst_passive_queues_freq [25;2]
% 0.22/0.53 % --inst_dismatching true
% 0.22/0.53 % --inst_eager_unprocessed_to_passive true
% 150.24/150.44 % --inst_prop_sim_given true
% 150.24/150.44 % --inst_prop_sim_new false
% 150.24/150.44 % --inst_orphan_elimination true
% 150.24/150.44 % --inst_learning_loop_flag true
% 150.24/150.44 % --inst_learning_start 3000
% 150.24/150.44 % --inst_learning_factor 2
% 150.24/150.44 % --inst_start_prop_sim_after_learn 3
% 150.24/150.44 % --inst_sel_renew solver
% 150.24/150.44 % --inst_lit_activity_flag true
% 150.24/150.44 % --inst_out_proof true
% 150.24/150.44
% 150.24/150.44 % ------ Resolution Options
% 150.24/150.44
% 150.24/150.44 % --resolution_flag true
% 150.24/150.44 % --res_lit_sel kbo_max
% 150.24/150.44 % --res_to_prop_solver none
% 150.24/150.44 % --res_prop_simpl_new false
% 150.24/150.44 % --res_prop_simpl_given false
% 150.24/150.44 % --res_passive_queue_type priority_queues
% 150.24/150.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.24/150.44 % --res_passive_queues_freq [15;5]
% 150.24/150.44 % --res_forward_subs full
% 150.24/150.44 % --res_backward_subs full
% 150.24/150.44 % --res_forward_subs_resolution true
% 150.24/150.44 % --res_backward_subs_resolution true
% 150.24/150.44 % --res_orphan_elimination false
% 150.24/150.44 % --res_time_limit 1000.
% 150.24/150.44 % --res_out_proof true
% 150.24/150.44 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_6cddc7.s
% 150.24/150.44 % --modulo true
% 150.24/150.44
% 150.24/150.44 % ------ Combination Options
% 150.24/150.44
% 150.24/150.44 % --comb_res_mult 1000
% 150.24/150.44 % --comb_inst_mult 300
% 150.24/150.44 % ------
% 150.24/150.44
% 150.24/150.44
% 150.24/150.44
% 150.24/150.44 % ------ Proving...
% 150.24/150.44 %
% 150.24/150.44
% 150.24/150.44
% 150.24/150.44 % Time Out Real
% 150.24/150.44
% 150.24/150.44 % ------ Statistics
% 150.24/150.44
% 150.24/150.44 % ------ General
% 150.24/150.44
% 150.24/150.44 % num_of_input_clauses: 41
% 150.24/150.44 % num_of_input_neg_conjectures: 1
% 150.24/150.44 % num_of_splits: 0
% 150.24/150.44 % num_of_split_atoms: 0
% 150.24/150.44 % num_of_sem_filtered_clauses: 0
% 150.24/150.44 % num_of_subtypes: 0
% 150.24/150.44 % monotx_restored_types: 0
% 150.24/150.44 % sat_num_of_epr_types: 0
% 150.24/150.44 % sat_num_of_non_cyclic_types: 0
% 150.24/150.44 % sat_guarded_non_collapsed_types: 0
% 150.24/150.44 % is_epr: 0
% 150.24/150.44 % is_horn: 0
% 150.24/150.44 % has_eq: 1
% 150.24/150.44 % num_pure_diseq_elim: 0
% 150.24/150.44 % simp_replaced_by: 0
% 150.24/150.44 % res_preprocessed: 5
% 150.24/150.44 % prep_upred: 0
% 150.24/150.44 % prep_unflattend: 0
% 150.24/150.44 % pred_elim_cands: 1
% 150.24/150.44 % pred_elim: 0
% 150.24/150.44 % pred_elim_cl: 0
% 150.24/150.44 % pred_elim_cycles: 1
% 150.24/150.44 % forced_gc_time: 0
% 150.24/150.44 % gc_basic_clause_elim: 0
% 150.24/150.44 % parsing_time: 0.001
% 150.24/150.44 % sem_filter_time: 0.
% 150.24/150.44 % pred_elim_time: 0.
% 150.24/150.44 % out_proof_time: 0.
% 150.24/150.44 % monotx_time: 0.
% 150.24/150.44 % subtype_inf_time: 0.
% 150.24/150.44 % unif_index_cands_time: 0.051
% 150.24/150.44 % unif_index_add_time: 0.298
% 150.24/150.44 % total_time: 150.014
% 150.24/150.44 % num_of_symbols: 33
% 150.24/150.44 % num_of_terms: 396
% 150.24/150.44
% 150.24/150.44 % ------ Propositional Solver
% 150.24/150.44
% 150.24/150.44 % prop_solver_calls: 1
% 150.24/150.44 % prop_fast_solver_calls: 17
% 150.24/150.44 % prop_num_of_clauses: 41
% 150.24/150.44 % prop_preprocess_simplified: 164
% 150.24/150.44 % prop_fo_subsumed: 0
% 150.24/150.44 % prop_solver_time: 0.
% 150.24/150.44 % prop_fast_solver_time: 0.
% 150.24/150.44 % prop_unsat_core_time: 0.
% 150.24/150.44
% 150.24/150.44 % ------ QBF
% 150.24/150.44
% 150.24/150.44 % qbf_q_res: 0
% 150.24/150.44 % qbf_num_tautologies: 0
% 150.24/150.44 % qbf_prep_cycles: 0
% 150.24/150.44
% 150.24/150.44 % ------ BMC1
% 150.24/150.44
% 150.24/150.44 % bmc1_current_bound: -1
% 150.24/150.44 % bmc1_last_solved_bound: -1
% 150.24/150.44 % bmc1_unsat_core_size: -1
% 150.24/150.44 % bmc1_unsat_core_parents_size: -1
% 150.24/150.44 % bmc1_merge_next_fun: 0
% 150.24/150.44 % bmc1_unsat_core_clauses_time: 0.
% 150.24/150.44
% 150.24/150.44 % ------ Instantiation
% 150.24/150.44
% 150.24/150.44 % inst_num_of_clauses: 41
% 150.24/150.44 % inst_num_in_passive: 0
% 150.24/150.44 % inst_num_in_active: 0
% 150.24/150.44 % inst_num_in_unprocessed: 41
% 150.24/150.45 % inst_num_of_loops: 0
% 150.24/150.45 % inst_num_of_learning_restarts: 0
% 150.24/150.45 % inst_num_moves_active_passive: 0
% 150.24/150.45 % inst_lit_activity: 0
% 150.24/150.45 % inst_lit_activity_moves: 0
% 150.24/150.45 % inst_num_tautologies: 0
% 150.24/150.45 % inst_num_prop_implied: 0
% 150.24/150.45 % inst_num_existing_simplified: 0
% 150.24/150.45 % inst_num_eq_res_simplified: 0
% 150.24/150.45 % inst_num_child_elim: 0
% 150.24/150.45 % inst_num_of_dismatching_blockings: 0
% 150.24/150.45 % inst_num_of_non_proper_insts: 0
% 150.24/150.45 % inst_num_of_duplicates: 0
% 150.24/150.45 % inst_inst_num_from_inst_to_res: 0
% 150.24/150.45 % inst_dismatching_checking_time: 0.
% 150.24/150.45
% 150.24/150.45 % ------ Resolution
% 150.24/150.45
% 150.24/150.45 % res_num_of_clauses: 142
% 150.24/150.45 % res_num_in_passive: 5
% 150.24/150.45 % res_num_in_active: 112
% 150.24/150.45 % res_num_of_loops: 119
% 150.24/150.45 % res_forward_subset_subsumed: 63
% 150.24/150.45 % res_backward_subset_subsumed: 0
% 150.24/150.45 % res_forward_subsumed: 23
% 150.24/150.45 % res_backward_subsumed: 0
% 150.24/150.45 % res_forward_subsumption_resolution: 0
% 150.24/150.45 % res_backward_subsumption_resolution: 0
% 150.24/150.45 % res_clause_to_clause_subsumption: 14330
% 150.24/150.45 % res_orphan_elimination: 0
% 150.24/150.45 % res_tautology_del: 68
% 150.24/150.45 % res_num_eq_res_simplified: 0
% 150.24/150.45 % res_num_sel_changes: 0
% 150.24/150.45 % res_moves_from_active_to_pass: 0
% 150.24/150.45
% 150.24/150.45 % Status Unknown
% 150.29/150.49 % Orienting using strategy ClausalAll
% 150.29/150.49 % Orientation found
% 150.29/150.49 % 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_6cddc7.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_14371a.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_97f8ed | grep -v "SZS"
% 150.29/150.51
% 150.29/150.51 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 150.29/150.51
% 150.29/150.51 %
% 150.29/150.51 % ------ iProver source info
% 150.29/150.51
% 150.29/150.51 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 150.29/150.51 % git: non_committed_changes: true
% 150.29/150.51 % git: last_make_outside_of_git: true
% 150.29/150.51
% 150.29/150.51 %
% 150.29/150.51 % ------ Input Options
% 150.29/150.51
% 150.29/150.51 % --out_options all
% 150.29/150.51 % --tptp_safe_out true
% 150.29/150.51 % --problem_path ""
% 150.29/150.51 % --include_path ""
% 150.29/150.51 % --clausifier .//eprover
% 150.29/150.51 % --clausifier_options --tstp-format
% 150.29/150.51 % --stdin false
% 150.29/150.51 % --dbg_backtrace false
% 150.29/150.51 % --dbg_dump_prop_clauses false
% 150.29/150.51 % --dbg_dump_prop_clauses_file -
% 150.29/150.51 % --dbg_out_stat false
% 150.29/150.51
% 150.29/150.51 % ------ General Options
% 150.29/150.51
% 150.29/150.51 % --fof false
% 150.29/150.51 % --time_out_real 150.
% 150.29/150.51 % --time_out_prep_mult 0.2
% 150.29/150.51 % --time_out_virtual -1.
% 150.29/150.51 % --schedule none
% 150.29/150.51 % --ground_splitting input
% 150.29/150.51 % --splitting_nvd 16
% 150.29/150.51 % --non_eq_to_eq false
% 150.29/150.51 % --prep_gs_sim true
% 150.29/150.51 % --prep_unflatten false
% 150.29/150.51 % --prep_res_sim true
% 150.29/150.51 % --prep_upred true
% 150.29/150.51 % --res_sim_input true
% 150.29/150.51 % --clause_weak_htbl true
% 150.29/150.51 % --gc_record_bc_elim false
% 150.29/150.51 % --symbol_type_check false
% 150.29/150.51 % --clausify_out false
% 150.29/150.51 % --large_theory_mode false
% 150.29/150.51 % --prep_sem_filter none
% 150.29/150.51 % --prep_sem_filter_out false
% 150.29/150.51 % --preprocessed_out false
% 150.29/150.51 % --sub_typing false
% 150.29/150.51 % --brand_transform false
% 150.29/150.51 % --pure_diseq_elim true
% 150.29/150.51 % --min_unsat_core false
% 150.29/150.51 % --pred_elim true
% 150.29/150.51 % --add_important_lit false
% 150.29/150.51 % --soft_assumptions false
% 150.29/150.51 % --reset_solvers false
% 150.29/150.51 % --bc_imp_inh []
% 150.29/150.51 % --conj_cone_tolerance 1.5
% 150.29/150.51 % --prolific_symb_bound 500
% 150.29/150.51 % --lt_threshold 2000
% 150.29/150.51
% 150.29/150.51 % ------ SAT Options
% 150.29/150.51
% 150.29/150.51 % --sat_mode false
% 150.29/150.51 % --sat_fm_restart_options ""
% 150.29/150.51 % --sat_gr_def false
% 150.29/150.51 % --sat_epr_types true
% 150.29/150.51 % --sat_non_cyclic_types false
% 150.29/150.51 % --sat_finite_models false
% 150.29/150.51 % --sat_fm_lemmas false
% 150.29/150.51 % --sat_fm_prep false
% 150.29/150.51 % --sat_fm_uc_incr true
% 150.29/150.51 % --sat_out_model small
% 150.29/150.51 % --sat_out_clauses false
% 150.29/150.51
% 150.29/150.51 % ------ QBF Options
% 150.29/150.51
% 150.29/150.51 % --qbf_mode false
% 150.29/150.51 % --qbf_elim_univ true
% 150.29/150.51 % --qbf_sk_in true
% 150.29/150.51 % --qbf_pred_elim true
% 150.29/150.51 % --qbf_split 32
% 150.29/150.51
% 150.29/150.51 % ------ BMC1 Options
% 150.29/150.51
% 150.29/150.51 % --bmc1_incremental false
% 150.29/150.51 % --bmc1_axioms reachable_all
% 150.29/150.51 % --bmc1_min_bound 0
% 150.29/150.51 % --bmc1_max_bound -1
% 150.29/150.51 % --bmc1_max_bound_default -1
% 150.29/150.51 % --bmc1_symbol_reachability true
% 150.29/150.51 % --bmc1_property_lemmas false
% 150.29/150.51 % --bmc1_k_induction false
% 150.29/150.51 % --bmc1_non_equiv_states false
% 150.29/150.51 % --bmc1_deadlock false
% 150.29/150.51 % --bmc1_ucm false
% 150.29/150.51 % --bmc1_add_unsat_core none
% 150.29/150.51 % --bmc1_unsat_core_children false
% 150.29/150.51 % --bmc1_unsat_core_extrapolate_axioms false
% 150.29/150.51 % --bmc1_out_stat full
% 150.29/150.51 % --bmc1_ground_init false
% 150.29/150.51 % --bmc1_pre_inst_next_state false
% 150.29/150.51 % --bmc1_pre_inst_state false
% 150.29/150.51 % --bmc1_pre_inst_reach_state false
% 150.29/150.51 % --bmc1_out_unsat_core false
% 150.29/150.51 % --bmc1_aig_witness_out false
% 150.29/150.51 % --bmc1_verbose false
% 150.29/150.51 % --bmc1_dump_clauses_tptp false
% 150.33/150.60 % --bmc1_dump_unsat_core_tptp false
% 150.33/150.60 % --bmc1_dump_file -
% 150.33/150.60 % --bmc1_ucm_expand_uc_limit 128
% 150.33/150.60 % --bmc1_ucm_n_expand_iterations 6
% 150.33/150.60 % --bmc1_ucm_extend_mode 1
% 150.33/150.60 % --bmc1_ucm_init_mode 2
% 150.33/150.60 % --bmc1_ucm_cone_mode none
% 150.33/150.60 % --bmc1_ucm_reduced_relation_type 0
% 150.33/150.60 % --bmc1_ucm_relax_model 4
% 150.33/150.60 % --bmc1_ucm_full_tr_after_sat true
% 150.33/150.60 % --bmc1_ucm_expand_neg_assumptions false
% 150.33/150.60 % --bmc1_ucm_layered_model none
% 150.33/150.60 % --bmc1_ucm_max_lemma_size 10
% 150.33/150.60
% 150.33/150.60 % ------ AIG Options
% 150.33/150.60
% 150.33/150.60 % --aig_mode false
% 150.33/150.60
% 150.33/150.60 % ------ Instantiation Options
% 150.33/150.60
% 150.33/150.60 % --instantiation_flag true
% 150.33/150.60 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.33/150.60 % --inst_solver_per_active 750
% 150.33/150.60 % --inst_solver_calls_frac 0.5
% 150.33/150.60 % --inst_passive_queue_type priority_queues
% 150.33/150.60 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.33/150.60 % --inst_passive_queues_freq [25;2]
% 150.33/150.60 % --inst_dismatching true
% 150.33/150.60 % --inst_eager_unprocessed_to_passive true
% 150.33/150.60 % --inst_prop_sim_given true
% 150.33/150.60 % --inst_prop_sim_new false
% 150.33/150.60 % --inst_orphan_elimination true
% 150.33/150.60 % --inst_learning_loop_flag true
% 150.33/150.60 % --inst_learning_start 3000
% 150.33/150.60 % --inst_learning_factor 2
% 150.33/150.60 % --inst_start_prop_sim_after_learn 3
% 150.33/150.60 % --inst_sel_renew solver
% 150.33/150.60 % --inst_lit_activity_flag true
% 150.33/150.60 % --inst_out_proof true
% 150.33/150.60
% 150.33/150.60 % ------ Resolution Options
% 150.33/150.60
% 150.33/150.60 % --resolution_flag true
% 150.33/150.60 % --res_lit_sel kbo_max
% 150.33/150.60 % --res_to_prop_solver none
% 150.33/150.60 % --res_prop_simpl_new false
% 150.33/150.60 % --res_prop_simpl_given false
% 150.33/150.60 % --res_passive_queue_type priority_queues
% 150.33/150.60 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.33/150.60 % --res_passive_queues_freq [15;5]
% 150.33/150.60 % --res_forward_subs full
% 150.33/150.60 % --res_backward_subs full
% 150.33/150.60 % --res_forward_subs_resolution true
% 150.33/150.60 % --res_backward_subs_resolution true
% 150.33/150.60 % --res_orphan_elimination false
% 150.33/150.60 % --res_time_limit 1000.
% 150.33/150.60 % --res_out_proof true
% 150.33/150.60 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_6cddc7.s
% 150.33/150.60 % --modulo true
% 150.33/150.60
% 150.33/150.60 % ------ Combination Options
% 150.33/150.60
% 150.33/150.60 % --comb_res_mult 1000
% 150.33/150.60 % --comb_inst_mult 300
% 150.33/150.60 % ------
% 150.33/150.60
% 150.33/150.60 % ------ Parsing...% successful
% 150.33/150.60
% 150.33/150.60 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 150.33/150.60
% 150.33/150.60 % ------ Proving...
% 150.33/150.60 % ------ Problem Properties
% 150.33/150.60
% 150.33/150.60 %
% 150.33/150.60 % EPR false
% 150.33/150.60 % Horn false
% 150.33/150.60 % Has equality true
% 150.33/150.60
% 150.33/150.60 % % ------ Input Options Time Limit: Unbounded
% 150.33/150.60
% 150.33/150.60
% 150.33/150.60 Compiling...
% 150.33/150.60 Loading plugin: done.
% 150.33/150.60 % % ------ Current options:
% 150.33/150.60
% 150.33/150.60 % ------ Input Options
% 150.33/150.60
% 150.33/150.60 % --out_options all
% 150.33/150.60 % --tptp_safe_out true
% 150.33/150.60 % --problem_path ""
% 150.33/150.60 % --include_path ""
% 150.33/150.60 % --clausifier .//eprover
% 150.33/150.60 % --clausifier_options --tstp-format
% 150.33/150.60 % --stdin false
% 150.33/150.60 % --dbg_backtrace false
% 150.33/150.60 % --dbg_dump_prop_clauses false
% 150.33/150.60 % --dbg_dump_prop_clauses_file -
% 150.33/150.60 % --dbg_out_stat false
% 150.33/150.60
% 150.33/150.60 % ------ General Options
% 150.33/150.60
% 150.33/150.60 % --fof false
% 150.33/150.60 % --time_out_real 150.
% 150.33/150.60 % --time_out_prep_mult 0.2
% 150.33/150.60 % --time_out_virtual -1.
% 150.33/150.60 % --schedule none
% 150.33/150.60 % --ground_splitting input
% 150.33/150.60 % --splitting_nvd 16
% 150.33/150.60 % --non_eq_to_eq false
% 150.33/150.60 % --prep_gs_sim true
% 150.33/150.60 % --prep_unflatten false
% 150.33/150.60 % --prep_res_sim true
% 150.33/150.60 % --prep_upred true
% 150.33/150.60 % --res_sim_input true
% 150.33/150.60 % --clause_weak_htbl true
% 150.33/150.60 % --gc_record_bc_elim false
% 150.33/150.60 % --symbol_type_check false
% 150.33/150.60 % --clausify_out false
% 150.33/150.60 % --large_theory_mode false
% 150.33/150.60 % --prep_sem_filter none
% 150.33/150.60 % --prep_sem_filter_out false
% 150.33/150.60 % --preprocessed_out false
% 150.33/150.60 % --sub_typing false
% 150.33/150.60 % --brand_transform false
% 150.33/150.60 % --pure_diseq_elim true
% 150.33/150.60 % --min_unsat_core false
% 150.33/150.60 % --pred_elim true
% 150.33/150.60 % --add_important_lit false
% 150.33/150.60 % --soft_assumptions false
% 150.33/150.60 % --reset_solvers false
% 150.33/150.60 % --bc_imp_inh []
% 150.33/150.60 % --conj_cone_tolerance 1.5
% 150.33/150.60 % --prolific_symb_bound 500
% 150.33/150.60 % --lt_threshold 2000
% 150.33/150.60
% 150.33/150.60 % ------ SAT Options
% 150.33/150.60
% 150.33/150.60 % --sat_mode false
% 150.33/150.60 % --sat_fm_restart_options ""
% 150.33/150.60 % --sat_gr_def false
% 150.33/150.60 % --sat_epr_types true
% 150.33/150.60 % --sat_non_cyclic_types false
% 150.33/150.60 % --sat_finite_models false
% 150.33/150.60 % --sat_fm_lemmas false
% 150.33/150.60 % --sat_fm_prep false
% 150.33/150.60 % --sat_fm_uc_incr true
% 150.33/150.60 % --sat_out_model small
% 150.33/150.60 % --sat_out_clauses false
% 150.33/150.60
% 150.33/150.60 % ------ QBF Options
% 150.33/150.60
% 150.33/150.60 % --qbf_mode false
% 150.33/150.60 % --qbf_elim_univ true
% 150.33/150.60 % --qbf_sk_in true
% 150.33/150.60 % --qbf_pred_elim true
% 150.33/150.60 % --qbf_split 32
% 150.33/150.60
% 150.33/150.60 % ------ BMC1 Options
% 150.33/150.60
% 150.33/150.60 % --bmc1_incremental false
% 150.33/150.60 % --bmc1_axioms reachable_all
% 150.33/150.60 % --bmc1_min_bound 0
% 150.33/150.60 % --bmc1_max_bound -1
% 150.33/150.60 % --bmc1_max_bound_default -1
% 150.33/150.60 % --bmc1_symbol_reachability true
% 150.33/150.60 % --bmc1_property_lemmas false
% 150.33/150.60 % --bmc1_k_induction false
% 150.33/150.60 % --bmc1_non_equiv_states false
% 150.33/150.60 % --bmc1_deadlock false
% 150.33/150.60 % --bmc1_ucm false
% 150.33/150.60 % --bmc1_add_unsat_core none
% 150.33/150.60 % --bmc1_unsat_core_children false
% 150.33/150.60 % --bmc1_unsat_core_extrapolate_axioms false
% 150.33/150.60 % --bmc1_out_stat full
% 150.33/150.60 % --bmc1_ground_init false
% 150.33/150.60 % --bmc1_pre_inst_next_state false
% 150.33/150.60 % --bmc1_pre_inst_state false
% 150.33/150.60 % --bmc1_pre_inst_reach_state false
% 150.33/150.60 % --bmc1_out_unsat_core false
% 150.33/150.60 % --bmc1_aig_witness_out false
% 150.33/150.60 % --bmc1_verbose false
% 150.33/150.60 % --bmc1_dump_clauses_tptp false
% 150.33/150.60 % --bmc1_dump_unsat_core_tptp false
% 150.33/150.60 % --bmc1_dump_file -
% 150.33/150.60 % --bmc1_ucm_expand_uc_limit 128
% 150.33/150.60 % --bmc1_ucm_n_expand_iterations 6
% 150.33/150.60 % --bmc1_ucm_extend_mode 1
% 150.33/150.60 % --bmc1_ucm_init_mode 2
% 150.33/150.60 % --bmc1_ucm_cone_mode none
% 150.33/150.60 % --bmc1_ucm_reduced_relation_type 0
% 150.33/150.60 % --bmc1_ucm_relax_model 4
% 150.33/150.60 % --bmc1_ucm_full_tr_after_sat true
% 150.33/150.60 % --bmc1_ucm_expand_neg_assumptions false
% 150.33/150.60 % --bmc1_ucm_layered_model none
% 150.33/150.60 % --bmc1_ucm_max_lemma_size 10
% 150.33/150.60
% 150.33/150.60 % ------ AIG Options
% 150.33/150.60
% 150.33/150.60 % --aig_mode false
% 150.33/150.60
% 150.33/150.60 % ------ Instantiation Options
% 150.33/150.60
% 150.33/150.60 % --instantiation_flag true
% 150.33/150.60 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 150.33/150.60 % --inst_solver_per_active 750
% 150.33/150.60 % --inst_solver_calls_frac 0.5
% 150.33/150.60 % --inst_passive_queue_type priority_queues
% 150.33/150.60 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 150.33/150.60 % --inst_passive_queues_freq [25;2]
% 150.33/150.60 % --inst_dismatching true
% 150.33/150.60 % --inst_eager_unprocessed_to_passive true
% 150.33/150.60 % --inst_prop_sim_given true
% 150.33/150.60 % --inst_prop_sim_new false
% 150.33/150.60 % --inst_orphan_elimination true
% 150.33/150.60 % --inst_learning_loop_flag true
% 150.33/150.60 % --inst_learning_start 3000
% 150.33/150.60 % --inst_learning_factor 2
% 150.33/150.60 % --inst_start_prop_sim_after_learn 3
% 150.33/150.60 % --inst_sel_renew solver
% 150.33/150.60 % --inst_lit_activity_flag true
% 150.33/150.60 % --inst_out_proof true
% 150.33/150.60
% 150.33/150.60 % ------ Resolution Options
% 150.33/150.60
% 150.33/150.60 % --resolution_flag true
% 150.33/150.60 % --res_lit_sel kbo_max
% 150.33/150.60 % --res_to_prop_solver none
% 150.33/150.60 % --res_prop_simpl_new false
% 150.33/150.60 % --res_prop_simpl_given false
% 150.33/150.60 % --res_passive_queue_type priority_queues
% 150.33/150.60 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.33/150.60 % --res_passive_queues_freq [15;5]
% 150.33/150.60 % --res_forward_subs full
% 150.33/150.60 % --res_backward_subs full
% 150.33/150.60 % --res_forward_subs_resolution true
% 150.33/150.60 % --res_backward_subs_resolution true
% 150.33/150.60 % --res_orphan_elimination false
% 150.33/150.60 % --res_time_limit 1000.
% 150.33/150.60 % --res_out_proof true
% 150.33/150.60 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_6cddc7.s
% 150.33/150.60 % --modulo true
% 150.33/150.60
% 150.33/150.60 % ------ Combination Options
% 150.33/150.60
% 150.33/150.60 % --comb_res_mult 1000
% 150.33/150.60 % --comb_inst_mult 300
% 150.33/150.60 % ------
% 150.33/150.60
% 150.33/150.60
% 150.33/150.60
% 150.33/150.60 % ------ Proving...
% 150.33/150.60 % warning: shown sat in sat incomplete mode
% 150.33/150.60 %
% 150.33/150.60
% 150.33/150.60
% 150.33/150.60
% 150.33/150.60
% 150.33/150.60 cnf(c_40,plain,
% 150.33/150.60 ( there_exists(compose(d,a)) ),
% 150.33/150.60 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_18) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_61,plain,
% 150.33/150.60 ( there_exists(compose(d,a)) ),
% 150.33/150.60 inference(copy,[status(esa)],[c_40]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_70,plain,
% 150.33/150.60 ( there_exists(compose(d,a)) ),
% 150.33/150.60 inference(copy,[status(esa)],[c_61]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_71,plain,
% 150.33/150.60 ( there_exists(compose(d,a)) ),
% 150.33/150.60 inference(copy,[status(esa)],[c_70]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_99,plain,
% 150.33/150.60 ( there_exists(compose(d,a)) ),
% 150.33/150.60 inference(copy,[status(esa)],[c_71]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_218,plain,
% 150.33/150.60 ( there_exists(compose(d,a)) ),
% 150.33/150.60 inference(copy,[status(esa)],[c_99]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_9,plain,
% 150.33/150.60 ( equivalent(X0,X1) | X0 != X1 | ~ there_exists(X0) ),
% 150.33/150.60 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_79_2) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_156,plain,
% 150.33/150.60 ( equivalent(X0,X1) | X0 != X1 | ~ there_exists(X0) ),
% 150.33/150.60 inference(copy,[status(esa)],[c_9]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_157,plain,
% 150.33/150.60 ( ~ there_exists(X0) | equivalent(X0,X1) | X0 != X1 ),
% 150.33/150.60 inference(rewriting,[status(thm)],[c_156]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_225,plain,
% 150.33/150.60 ( equivalent(compose(d,a),X0) | compose(d,a) != X0 ),
% 150.33/150.60 inference(resolution,[status(thm)],[c_218,c_157]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_226,plain,
% 150.33/150.60 ( equivalent(compose(d,a),X0) | compose(d,a) != X0 ),
% 150.33/150.60 inference(rewriting,[status(thm)],[c_225]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_37,plain,
% 150.33/150.60 ( ~ there_exists(compose(d,X0)) | compose(d,X0) = X0 ),
% 150.33/150.60 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_16) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_57,plain,
% 150.33/150.60 ( ~ there_exists(compose(d,X0)) | compose(d,X0) = X0 ),
% 150.33/150.60 inference(copy,[status(esa)],[c_37]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_67,plain,
% 150.33/150.60 ( ~ there_exists(compose(d,X0)) | compose(d,X0) = X0 ),
% 150.33/150.60 inference(copy,[status(esa)],[c_57]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_74,plain,
% 150.33/150.60 ( ~ there_exists(compose(d,X0)) | compose(d,X0) = X0 ),
% 150.33/150.60 inference(copy,[status(esa)],[c_67]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_96,plain,
% 150.33/150.60 ( ~ there_exists(compose(d,X0)) | compose(d,X0) = X0 ),
% 150.33/150.60 inference(copy,[status(esa)],[c_74]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_212,plain,
% 150.33/150.60 ( ~ there_exists(compose(d,X0)) | compose(d,X0) = X0 ),
% 150.33/150.60 inference(copy,[status(esa)],[c_96]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_328,plain,
% 150.33/150.60 ( ~ there_exists(compose(d,a)) | equivalent(compose(d,a),a) ),
% 150.33/150.60 inference(resolution,[status(thm)],[c_226,c_212]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_329,plain,
% 150.33/150.60 ( ~ there_exists(compose(d,a)) | equivalent(compose(d,a),a) ),
% 150.33/150.60 inference(rewriting,[status(thm)],[c_328]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_332,plain,
% 150.33/150.60 ( equivalent(compose(d,a),a) ),
% 150.33/150.60 inference(forward_subsumption_resolution,[status(thm)],[c_329,c_218]) ).
% 150.33/150.60
% 150.33/150.60 cnf(c_333,plain,
% 150.33/150.60 ( equivalent(compose(d,a),a) ),
% 150.33/150.60 inference(rewriting,[status(thm)],[c_332]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_7,plain,
% 150.33/150.61 ( X0 = X1 | ~ equivalent(X0,X1) ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_80_1) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_152,plain,
% 150.33/150.61 ( X0 = X1 | ~ equivalent(X0,X1) ),
% 150.33/150.61 inference(copy,[status(esa)],[c_7]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_153,plain,
% 150.33/150.61 ( ~ equivalent(X0,X1) | X0 = X1 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_152]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_336,plain,
% 150.33/150.61 ( compose(d,a) = a ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_333,c_153]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_337,plain,
% 150.33/150.61 ( compose(d,a) = a ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_336]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_30,plain,
% 150.33/150.61 ( there_exists(domain(X0)) | ~ there_exists(compose(X0,X1)) ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_71_1) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_198,plain,
% 150.33/150.61 ( there_exists(domain(X0)) | ~ there_exists(compose(X0,X1)) ),
% 150.33/150.61 inference(copy,[status(esa)],[c_30]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_231,plain,
% 150.33/150.61 ( there_exists(domain(d)) ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_218,c_198]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_234,plain,
% 150.33/150.61 ( there_exists(domain(d)) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_231]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_243,plain,
% 150.33/150.61 ( equivalent(domain(d),X0) | domain(d) != X0 ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_234,c_157]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_244,plain,
% 150.33/150.61 ( equivalent(domain(d),X0) | domain(d) != X0 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_243]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_28,plain,
% 150.33/150.61 ( domain(X0) = codomain(X1) | ~ there_exists(compose(X0,X1)) ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_72_1) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_194,plain,
% 150.33/150.61 ( domain(X0) = codomain(X1) | ~ there_exists(compose(X0,X1)) ),
% 150.33/150.61 inference(copy,[status(esa)],[c_28]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_195,plain,
% 150.33/150.61 ( ~ there_exists(compose(X0,X1)) | domain(X0) = codomain(X1) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_194]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_232,plain,
% 150.33/150.61 ( domain(d) = codomain(a) ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_218,c_195]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_233,plain,
% 150.33/150.61 ( domain(d) = codomain(a) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_232]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_276,plain,
% 150.33/150.61 ( equivalent(domain(d),codomain(a)) ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_244,c_233]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_277,plain,
% 150.33/150.61 ( equivalent(domain(d),codomain(a)) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_276]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_14,plain,
% 150.33/150.61 ( there_exists(X0) | ~ equivalent(X1,X0) ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_77_1) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_166,plain,
% 150.33/150.61 ( there_exists(X0) | ~ equivalent(X1,X0) ),
% 150.33/150.61 inference(copy,[status(esa)],[c_14]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_284,plain,
% 150.33/150.61 ( there_exists(codomain(a)) ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_277,c_166]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_285,plain,
% 150.33/150.61 ( there_exists(codomain(a)) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_284]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_5,plain,
% 150.33/150.61 ( there_exists(X0) | ~ there_exists(codomain(X0)) ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_83_1) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_148,plain,
% 150.33/150.61 ( there_exists(X0) | ~ there_exists(codomain(X0)) ),
% 150.33/150.61 inference(copy,[status(esa)],[c_5]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_149,plain,
% 150.33/150.61 ( ~ there_exists(codomain(X0)) | there_exists(X0) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_148]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_288,plain,
% 150.33/150.61 ( there_exists(a) ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_285,c_149]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_289,plain,
% 150.33/150.61 ( there_exists(a) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_288]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_299,plain,
% 150.33/150.61 ( equivalent(a,X0) | a != X0 ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_289,c_157]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_300,plain,
% 150.33/150.61 ( equivalent(a,X0) | a != X0 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_299]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_291,plain,
% 150.33/150.61 ( equivalent(codomain(a),X0) | codomain(a) != X0 ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_285,c_157]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_292,plain,
% 150.33/150.61 ( equivalent(codomain(a),X0) | codomain(a) != X0 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_291]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_32,plain,
% 150.33/150.61 ( there_exists(codomain(X0)) | ~ there_exists(compose(X0,X1)) ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_70_1) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_202,plain,
% 150.33/150.61 ( there_exists(codomain(X0)) | ~ there_exists(compose(X0,X1)) ),
% 150.33/150.61 inference(copy,[status(esa)],[c_32]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_203,plain,
% 150.33/150.61 ( ~ there_exists(compose(X0,X1)) | there_exists(codomain(X0)) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_202]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_230,plain,
% 150.33/150.61 ( there_exists(codomain(d)) ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_218,c_203]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_235,plain,
% 150.33/150.61 ( there_exists(codomain(d)) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_230]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_261,plain,
% 150.33/150.61 ( equivalent(codomain(d),X0) | codomain(d) != X0 ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_235,c_157]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_262,plain,
% 150.33/150.61 ( equivalent(codomain(d),X0) | codomain(d) != X0 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_261]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_3,plain,
% 150.33/150.61 ( there_exists(X0) | ~ there_exists(domain(X0)) ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_84_1) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_144,plain,
% 150.33/150.61 ( there_exists(X0) | ~ there_exists(domain(X0)) ),
% 150.33/150.61 inference(copy,[status(esa)],[c_3]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_145,plain,
% 150.33/150.61 ( ~ there_exists(domain(X0)) | there_exists(X0) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_144]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_239,plain,
% 150.33/150.61 ( there_exists(d) ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_234,c_145]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_240,plain,
% 150.33/150.61 ( there_exists(d) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_239]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_251,plain,
% 150.33/150.61 ( equivalent(d,X0) | d != X0 ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_240,c_157]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_252,plain,
% 150.33/150.61 ( equivalent(d,X0) | d != X0 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_251]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_34,plain,
% 150.33/150.61 ( there_exists(compose(X0,X1))
% 150.33/150.61 | domain(X0) != codomain(X1)
% 150.33/150.61 | ~ there_exists(domain(X0)) ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_69_2) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_206,plain,
% 150.33/150.61 ( there_exists(compose(X0,X1))
% 150.33/150.61 | domain(X0) != codomain(X1)
% 150.33/150.61 | ~ there_exists(domain(X0)) ),
% 150.33/150.61 inference(copy,[status(esa)],[c_34]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_207,plain,
% 150.33/150.61 ( ~ there_exists(domain(X0))
% 150.33/150.61 | there_exists(compose(X0,X1))
% 150.33/150.61 | domain(X0) != codomain(X1) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_206]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_238,plain,
% 150.33/150.61 ( there_exists(compose(d,X0)) | domain(d) != codomain(X0) ),
% 150.33/150.61 inference(resolution,[status(thm)],[c_234,c_207]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_241,plain,
% 150.33/150.61 ( there_exists(compose(d,X0)) | domain(d) != codomain(X0) ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_238]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_25,plain,
% 150.33/150.61 ( X0 = X1 | f1(X0,X1) != X1 | f1(X0,X1) != X0 ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_73_2) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_188,plain,
% 150.33/150.61 ( X0 = X1 | f1(X0,X1) != X1 | f1(X0,X1) != X0 ),
% 150.33/150.61 inference(copy,[status(esa)],[c_25]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_189,plain,
% 150.33/150.61 ( f1(X0,X1) != X1 | f1(X0,X1) != X0 | X0 = X1 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_188]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_22,plain,
% 150.33/150.61 ( X0 = X1 | f1(X0,X1) = X1 | f1(X0,X1) = X0 ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_74_2) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_182,plain,
% 150.33/150.61 ( X0 = X1 | f1(X0,X1) = X1 | f1(X0,X1) = X0 ),
% 150.33/150.61 inference(copy,[status(esa)],[c_22]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_183,plain,
% 150.33/150.61 ( f1(X0,X1) = X1 | f1(X0,X1) = X0 | X0 = X1 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_182]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_16,plain,
% 150.33/150.61 ( equivalent(X0,X1)
% 150.33/150.61 | X0 != X1
% 150.33/150.61 | ~ there_exists(X1)
% 150.33/150.61 | ~ there_exists(X0) ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_76_3) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_170,plain,
% 150.33/150.61 ( equivalent(X0,X1)
% 150.33/150.61 | X0 != X1
% 150.33/150.61 | ~ there_exists(X1)
% 150.33/150.61 | ~ there_exists(X0) ),
% 150.33/150.61 inference(copy,[status(esa)],[c_16]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_171,plain,
% 150.33/150.61 ( ~ there_exists(X0)
% 150.33/150.61 | ~ there_exists(X1)
% 150.33/150.61 | equivalent(X1,X0)
% 150.33/150.61 | X1 != X0 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_170]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_39,negated_conjecture,
% 150.33/150.61 ( codomain(a) != d ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_19) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_63,negated_conjecture,
% 150.33/150.61 ( codomain(a) != d ),
% 150.33/150.61 inference(copy,[status(esa)],[c_39]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_69,negated_conjecture,
% 150.33/150.61 ( codomain(a) != d ),
% 150.33/150.61 inference(copy,[status(esa)],[c_63]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_72,negated_conjecture,
% 150.33/150.61 ( codomain(a) != d ),
% 150.33/150.61 inference(copy,[status(esa)],[c_69]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_98,negated_conjecture,
% 150.33/150.61 ( codomain(a) != d ),
% 150.33/150.61 inference(copy,[status(esa)],[c_72]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_216,negated_conjecture,
% 150.33/150.61 ( codomain(a) != d ),
% 150.33/150.61 inference(copy,[status(esa)],[c_98]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_38,plain,
% 150.33/150.61 ( ~ there_exists(compose(X0,d)) | compose(X0,d) = X0 ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_17) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_59,plain,
% 150.33/150.61 ( ~ there_exists(compose(X0,d)) | compose(X0,d) = X0 ),
% 150.33/150.61 inference(copy,[status(esa)],[c_38]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_68,plain,
% 150.33/150.61 ( ~ there_exists(compose(X0,d)) | compose(X0,d) = X0 ),
% 150.33/150.61 inference(copy,[status(esa)],[c_59]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_73,plain,
% 150.33/150.61 ( ~ there_exists(compose(X0,d)) | compose(X0,d) = X0 ),
% 150.33/150.61 inference(copy,[status(esa)],[c_68]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_97,plain,
% 150.33/150.61 ( ~ there_exists(compose(X0,d)) | compose(X0,d) = X0 ),
% 150.33/150.61 inference(copy,[status(esa)],[c_73]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_214,plain,
% 150.33/150.61 ( ~ there_exists(compose(X0,d)) | compose(X0,d) = X0 ),
% 150.33/150.61 inference(copy,[status(esa)],[c_97]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_26,plain,
% 150.33/150.61 ( f1(X0,X1) != X0 | X0 = X1 | f1(X0,X1) != X1 ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_73_1) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_190,plain,
% 150.33/150.61 ( f1(X0,X1) != X0 | X0 = X1 | f1(X0,X1) != X1 ),
% 150.33/150.61 inference(copy,[status(esa)],[c_26]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_191,plain,
% 150.33/150.61 ( f1(X0,X1) != X0 | f1(X0,X1) != X1 | X0 = X1 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_190]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_23,plain,
% 150.33/150.61 ( f1(X0,X1) = X0 | X0 = X1 | f1(X0,X1) = X1 ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_74_1) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_184,plain,
% 150.33/150.61 ( f1(X0,X1) = X0 | X0 = X1 | f1(X0,X1) = X1 ),
% 150.33/150.61 inference(copy,[status(esa)],[c_23]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_185,plain,
% 150.33/150.61 ( f1(X0,X1) = X0 | f1(X0,X1) = X1 | X0 = X1 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_184]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_20,plain,
% 150.33/150.61 ( X0 = X1 | there_exists(f1(X0,X1)) ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_75_1) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_178,plain,
% 150.33/150.61 ( X0 = X1 | there_exists(f1(X0,X1)) ),
% 150.33/150.61 inference(copy,[status(esa)],[c_20]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_179,plain,
% 150.33/150.61 ( there_exists(f1(X0,X1)) | X0 = X1 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_178]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_17,plain,
% 150.33/150.61 ( ~ there_exists(X0)
% 150.33/150.61 | equivalent(X0,X1)
% 150.33/150.61 | X0 != X1
% 150.33/150.61 | ~ there_exists(X1) ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_76_2) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_172,plain,
% 150.33/150.61 ( ~ there_exists(X0)
% 150.33/150.61 | equivalent(X0,X1)
% 150.33/150.61 | X0 != X1
% 150.33/150.61 | ~ there_exists(X1) ),
% 150.33/150.61 inference(copy,[status(esa)],[c_17]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_173,plain,
% 150.33/150.61 ( ~ there_exists(X0)
% 150.33/150.61 | ~ there_exists(X1)
% 150.33/150.61 | equivalent(X0,X1)
% 150.33/150.61 | X0 != X1 ),
% 150.33/150.61 inference(rewriting,[status(thm)],[c_172]) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_12,plain,
% 150.33/150.61 ( there_exists(X0) | ~ equivalent(X0,X1) ),
% 150.33/150.61 file('/export/starexec/sandbox2/tmp/iprover_modulo_14371a.p', c_0_78_1) ).
% 150.33/150.61
% 150.33/150.61 cnf(c_162,plain,
% 150.33/150.61 ( there_exists(X0) | ~ equivalent(X0,X1) ),
% 150.33/150.61 inference(copy,[status(esa)],[c_12]) ).
% 150.33/150.61
% 150.33/150.61
% 150.33/150.61
% 150.33/150.61 % ------ Statistics
% 150.33/150.61
% 150.33/150.61 % ------ General
% 150.33/150.61
% 150.33/150.61 % num_of_input_clauses: 41
% 150.33/150.61 % num_of_input_neg_conjectures: 1
% 150.33/150.61 % num_of_splits: 0
% 150.33/150.61 % num_of_split_atoms: 0
% 150.33/150.61 % num_of_sem_filtered_clauses: 0
% 150.33/150.61 % num_of_subtypes: 0
% 150.33/150.61 % monotx_restored_types: 0
% 150.33/150.61 % sat_num_of_epr_types: 0
% 150.33/150.61 % sat_num_of_non_cyclic_types: 0
% 150.33/150.61 % sat_guarded_non_collapsed_types: 0
% 150.33/150.61 % is_epr: 0
% 150.33/150.61 % is_horn: 0
% 150.33/150.61 % has_eq: 1
% 150.33/150.61 % num_pure_diseq_elim: 0
% 150.33/150.61 % simp_replaced_by: 0
% 150.33/150.61 % res_preprocessed: 5
% 150.33/150.61 % prep_upred: 0
% 150.33/150.61 % prep_unflattend: 0
% 150.33/150.61 % pred_elim_cands: 1
% 150.33/150.61 % pred_elim: 0
% 150.33/150.61 % pred_elim_cl: 0
% 150.33/150.61 % pred_elim_cycles: 1
% 150.33/150.61 % forced_gc_time: 0
% 150.33/150.61 % gc_basic_clause_elim: 0
% 150.33/150.61 % parsing_time: 0.001
% 150.33/150.61 % sem_filter_time: 0.
% 150.33/150.61 % pred_elim_time: 0.
% 150.33/150.61 % out_proof_time: 0.
% 150.33/150.61 % monotx_time: 0.
% 150.33/150.61 % subtype_inf_time: 0.
% 150.33/150.61 % unif_index_cands_time: 0.
% 150.33/150.61 % unif_index_add_time: 0.
% 150.33/150.61 % total_time: 0.115
% 150.33/150.61 % num_of_symbols: 33
% 150.33/150.61 % num_of_terms: 158
% 150.33/150.61
% 150.33/150.61 % ------ Propositional Solver
% 150.33/150.61
% 150.33/150.61 % prop_solver_calls: 1
% 150.33/150.61 % prop_fast_solver_calls: 17
% 150.33/150.61 % prop_num_of_clauses: 41
% 150.33/150.61 % prop_preprocess_simplified: 164
% 150.33/150.61 % prop_fo_subsumed: 0
% 150.33/150.61 % prop_solver_time: 0.
% 150.33/150.61 % prop_fast_solver_time: 0.
% 150.33/150.61 % prop_unsat_core_time: 0.
% 150.33/150.61
% 150.33/150.61 % ------ QBF
% 150.33/150.61
% 150.33/150.61 % qbf_q_res: 0
% 150.33/150.61 % qbf_num_tautologies: 0
% 150.33/150.61 % qbf_prep_cycles: 0
% 150.33/150.61
% 150.33/150.61 % ------ BMC1
% 150.33/150.61
% 150.33/150.61 % bmc1_current_bound: -1
% 150.33/150.61 % bmc1_last_solved_bound: -1
% 150.33/150.61 % bmc1_unsat_core_size: -1
% 150.33/150.61 % bmc1_unsat_core_parents_size: -1
% 150.33/150.61 % bmc1_merge_next_fun: 0
% 150.33/150.61 % bmc1_unsat_core_clauses_time: 0.
% 150.33/150.61
% 150.33/150.61 % ------ Instantiation
% 150.33/150.61
% 150.33/150.61 % inst_num_of_clauses: 41
% 150.33/150.61 % inst_num_in_passive: 0
% 150.33/150.61 % inst_num_in_active: 0
% 150.33/150.61 % inst_num_in_unprocessed: 41
% 150.33/150.61 % inst_num_of_loops: 0
% 150.33/150.61 % inst_num_of_learning_restarts: 0
% 150.33/150.61 % inst_num_moves_active_passive: 0
% 150.33/150.61 % inst_lit_activity: 0
% 150.33/150.61 % inst_lit_activity_moves: 0
% 150.33/150.61 % inst_num_tautologies: 0
% 150.33/150.61 % inst_num_prop_implied: 0
% 150.33/150.61 % inst_num_existing_simplified: 0
% 150.33/150.61 % inst_num_eq_res_simplified: 0
% 150.33/150.61 % inst_num_child_elim: 0
% 150.33/150.61 % inst_num_of_dismatching_blockings: 0
% 150.33/150.61 % inst_num_of_non_proper_insts: 0
% 150.33/150.61 % inst_num_of_duplicates: 0
% 150.33/150.61 % inst_inst_num_from_inst_to_res: 0
% 150.33/150.61 % inst_dismatching_checking_time: 0.
% 150.33/150.61
% 150.33/150.61 % ------ Resolution
% 150.33/150.61
% 150.33/150.61 % res_num_of_clauses: 60
% 150.33/150.61 % res_num_in_passive: 0
% 150.33/150.61 % res_num_in_active: 37
% 150.33/150.61 % res_num_of_loops: 27
% 150.33/150.61 % res_forward_subset_subsumed: 30
% 150.33/150.61 % res_backward_subset_subsumed: 0
% 150.33/150.61 % res_forward_subsumed: 6
% 150.33/150.61 % res_backward_subsumed: 0
% 150.33/150.61 % res_forward_subsumption_resolution: 1
% 150.33/150.61 % res_backward_subsumption_resolution: 0
% 150.33/150.61 % res_clause_to_clause_subsumption: 15
% 150.33/150.61 % res_orphan_elimination: 0
% 150.33/150.61 % res_tautology_del: 0
% 150.33/150.61 % res_num_eq_res_simplified: 0
% 150.33/150.61 % res_num_sel_changes: 0
% 150.33/150.61 % res_moves_from_active_to_pass: 0
% 150.33/150.61
% 150.33/150.61 % Status Unknown
% 150.33/150.61 % Last status :
% 150.33/150.61 % SZS status Unknown
%------------------------------------------------------------------------------