TSTP Solution File: SYN015-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN015-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n008.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 07:22:20 EDT 2022
% Result : Unknown 0.20s 0.56s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN015-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : iprover_modulo %s %d
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 23:55:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % Running in mono-core mode
% 0.13/0.39 % Orienting using strategy Equiv(ClausalAll)
% 0.13/0.39 % Orientation found
% 0.13/0.39 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_f4a2a0.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_85146d.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_728f76 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.42 % --inst_prop_sim_new false
% 0.20/0.42 % --inst_orphan_elimination true
% 0.20/0.42 % --inst_learning_loop_flag true
% 0.20/0.42 % --inst_learning_start 3000
% 0.20/0.42 % --inst_learning_factor 2
% 0.20/0.42 % --inst_start_prop_sim_after_learn 3
% 0.20/0.42 % --inst_sel_renew solver
% 0.20/0.42 % --inst_lit_activity_flag true
% 0.20/0.42 % --inst_out_proof true
% 0.20/0.42
% 0.20/0.42 % ------ Resolution Options
% 0.20/0.42
% 0.20/0.42 % --resolution_flag true
% 0.20/0.42 % --res_lit_sel kbo_max
% 0.20/0.42 % --res_to_prop_solver none
% 0.20/0.42 % --res_prop_simpl_new false
% 0.20/0.42 % --res_prop_simpl_given false
% 0.20/0.42 % --res_passive_queue_type priority_queues
% 0.20/0.42 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.42 % --res_passive_queues_freq [15;5]
% 0.20/0.42 % --res_forward_subs full
% 0.20/0.42 % --res_backward_subs full
% 0.20/0.42 % --res_forward_subs_resolution true
% 0.20/0.42 % --res_backward_subs_resolution true
% 0.20/0.42 % --res_orphan_elimination false
% 0.20/0.42 % --res_time_limit 1000.
% 0.20/0.42 % --res_out_proof true
% 0.20/0.42 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_f4a2a0.s
% 0.20/0.42 % --modulo true
% 0.20/0.42
% 0.20/0.42 % ------ Combination Options
% 0.20/0.42
% 0.20/0.42 % --comb_res_mult 1000
% 0.20/0.42 % --comb_inst_mult 300
% 0.20/0.42 % ------
% 0.20/0.42
% 0.20/0.42 % ------ Parsing...% successful
% 0.20/0.42
% 0.20/0.42 % ------ 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.20/0.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % ------ Problem Properties
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % EPR false
% 0.20/0.42 % Horn false
% 0.20/0.42 % Has equality true
% 0.20/0.42
% 0.20/0.42 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 % % ------ Current options:
% 0.20/0.42
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.42 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.42 % --bmc1_dump_file -
% 0.20/0.42 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.42 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.42 % --bmc1_ucm_extend_mode 1
% 0.20/0.42 % --bmc1_ucm_init_mode 2
% 0.20/0.42 % --bmc1_ucm_cone_mode none
% 0.20/0.42 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.42 % --bmc1_ucm_relax_model 4
% 0.20/0.42 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.42 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.42 % --bmc1_ucm_layered_model none
% 0.20/0.42 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.42
% 0.20/0.42 % ------ AIG Options
% 0.20/0.42
% 0.20/0.42 % --aig_mode false
% 0.20/0.42
% 0.20/0.42 % ------ Instantiation Options
% 0.20/0.42
% 0.20/0.42 % --instantiation_flag true
% 0.20/0.42 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.42 % --inst_solver_per_active 750
% 0.20/0.42 % --inst_solver_calls_frac 0.5
% 0.20/0.42 % --inst_passive_queue_type priority_queues
% 0.20/0.42 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.42 % --inst_passive_queues_freq [25;2]
% 0.20/0.42 % --inst_dismatching true
% 0.20/0.42 % --inst_eager_unprocessed_to_passive true
% 0.20/0.42 % --inst_prop_sim_given true
% 0.20/0.45 % --inst_prop_sim_new false
% 0.20/0.45 % --inst_orphan_elimination true
% 0.20/0.45 % --inst_learning_loop_flag true
% 0.20/0.45 % --inst_learning_start 3000
% 0.20/0.45 % --inst_learning_factor 2
% 0.20/0.45 % --inst_start_prop_sim_after_learn 3
% 0.20/0.45 % --inst_sel_renew solver
% 0.20/0.45 % --inst_lit_activity_flag true
% 0.20/0.45 % --inst_out_proof true
% 0.20/0.45
% 0.20/0.45 % ------ Resolution Options
% 0.20/0.45
% 0.20/0.45 % --resolution_flag true
% 0.20/0.45 % --res_lit_sel kbo_max
% 0.20/0.45 % --res_to_prop_solver none
% 0.20/0.45 % --res_prop_simpl_new false
% 0.20/0.45 % --res_prop_simpl_given false
% 0.20/0.45 % --res_passive_queue_type priority_queues
% 0.20/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.45 % --res_passive_queues_freq [15;5]
% 0.20/0.45 % --res_forward_subs full
% 0.20/0.45 % --res_backward_subs full
% 0.20/0.45 % --res_forward_subs_resolution true
% 0.20/0.45 % --res_backward_subs_resolution true
% 0.20/0.45 % --res_orphan_elimination false
% 0.20/0.45 % --res_time_limit 1000.
% 0.20/0.45 % --res_out_proof true
% 0.20/0.45 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_f4a2a0.s
% 0.20/0.45 % --modulo true
% 0.20/0.45
% 0.20/0.45 % ------ Combination Options
% 0.20/0.45
% 0.20/0.45 % --comb_res_mult 1000
% 0.20/0.45 % --comb_inst_mult 300
% 0.20/0.45 % ------
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % ------ Proving...
% 0.20/0.45 % warning: shown sat in sat incomplete mode
% 0.20/0.45 %
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 cnf(c_0,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,X1)
% 0.20/0.45 | ~ element(X1,X0)
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X1 = n
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_64) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_28,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,X1)
% 0.20/0.45 | ~ element(X1,X0)
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X1 = n
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_92,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,X1)
% 0.20/0.45 | ~ element(X1,X0)
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X1 = n
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_28]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_123,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,X1)
% 0.20/0.45 | ~ element(X1,X0)
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X1 = n
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_92]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_124,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,X1)
% 0.20/0.45 | ~ element(X1,X0)
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X1 = n
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_123]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_156,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,X1)
% 0.20/0.45 | ~ element(X1,X0)
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X1 = n
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_124]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_10,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | g(X0) != X0 | X0 = n ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_74) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_48,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | g(X0) != X0 | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_102,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | g(X0) != X0 | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_48]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_113,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | g(X0) != X0 | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_102]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_134,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | g(X0) != X0 | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_113]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_176,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | g(X0) != X0 | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_134]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_368,plain,
% 0.20/0.45 ( element(n,n)
% 0.20/0.45 | ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),X0)
% 0.20/0.45 | ~ element(X0,g(n))
% 0.20/0.45 | n = n
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X0 = g(n) ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_156,c_176]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_369,plain,
% 0.20/0.45 ( element(n,n)
% 0.20/0.45 | ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),X0)
% 0.20/0.45 | ~ element(X0,g(n))
% 0.20/0.45 | n = n
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X0 = g(n) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_368]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_344,plain,
% 0.20/0.45 ( ~ element(n,n) | n = n ),
% 0.20/0.45 inference(factoring,[status(thm)],[c_156]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_345,plain,
% 0.20/0.45 ( ~ element(n,n) | n = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_344]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_833,plain,
% 0.20/0.45 ( ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),X0)
% 0.20/0.45 | ~ element(X0,g(n))
% 0.20/0.45 | n = n
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X0 = g(n) ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_369,c_345]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_834,plain,
% 0.20/0.45 ( ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),X0)
% 0.20/0.45 | ~ element(X0,g(n))
% 0.20/0.45 | n = n
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X0 = g(n) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_833]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_6,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | f(X0) != X0 | X0 = m ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_70) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_40,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | f(X0) != X0 | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_98,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | f(X0) != X0 | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_40]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_117,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | f(X0) != X0 | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_98]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_130,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | f(X0) != X0 | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_117]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_168,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | f(X0) != X0 | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_130]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_841,plain,
% 0.20/0.45 ( ~ element(f(g(n)),g(n))
% 0.20/0.45 | ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),m)
% 0.20/0.45 | ~ element(g(n),f(g(n)))
% 0.20/0.45 | n = n
% 0.20/0.45 | f(g(n)) = n
% 0.20/0.45 | g(n) = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_834,c_168]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_842,plain,
% 0.20/0.45 ( ~ element(f(g(n)),g(n))
% 0.20/0.45 | ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),m)
% 0.20/0.45 | ~ element(g(n),f(g(n)))
% 0.20/0.45 | n = n
% 0.20/0.45 | f(g(n)) = n
% 0.20/0.45 | g(n) = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_841]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_3,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | element(X0,f(X0)) | X0 = m ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_67) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_34,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | element(X0,f(X0)) | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_95,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | element(X0,f(X0)) | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_34]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_120,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | element(X0,f(X0)) | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_95]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_127,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | element(X0,f(X0)) | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_120]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_162,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | element(X0,f(X0)) | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_127]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_2,negated_conjecture,
% 0.20/0.45 ( element(f(X0),X0) | ~ element(X0,m) | X0 = m ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_66) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_32,negated_conjecture,
% 0.20/0.45 ( element(f(X0),X0) | ~ element(X0,m) | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_2]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_94,negated_conjecture,
% 0.20/0.45 ( element(f(X0),X0) | ~ element(X0,m) | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_32]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_121,negated_conjecture,
% 0.20/0.45 ( element(f(X0),X0) | ~ element(X0,m) | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_94]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_126,negated_conjecture,
% 0.20/0.45 ( element(f(X0),X0) | ~ element(X0,m) | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_121]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_160,plain,
% 0.20/0.45 ( element(f(X0),X0) | ~ element(X0,m) | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_126]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_934,plain,
% 0.20/0.45 ( ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),m)
% 0.20/0.45 | n = n
% 0.20/0.45 | f(g(n)) = n
% 0.20/0.45 | g(n) = m ),
% 0.20/0.45 inference(forward_subsumption_resolution,
% 0.20/0.45 [status(thm)],
% 0.20/0.45 [c_842,c_162,c_160]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_935,plain,
% 0.20/0.45 ( ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),m)
% 0.20/0.45 | n = n
% 0.20/0.45 | f(g(n)) = n
% 0.20/0.45 | g(n) = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_934]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_11,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | g(X0) != n | X0 = n ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_75) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_50,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | g(X0) != n | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_11]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_103,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | g(X0) != n | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_50]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_112,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | g(X0) != n | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_103]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_135,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | g(X0) != n | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_112]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_178,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | g(X0) != n | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_135]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_370,plain,
% 0.20/0.45 ( ~ element(g(X0),n)
% 0.20/0.45 | ~ element(g(X0),X1)
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | ~ element(X1,g(X0))
% 0.20/0.45 | X1 = n
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X1 = g(X0) ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_156,c_178]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_371,plain,
% 0.20/0.45 ( ~ element(g(X0),n)
% 0.20/0.45 | ~ element(g(X0),X1)
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | ~ element(X1,g(X0))
% 0.20/0.45 | X1 = n
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X1 = g(X0) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_370]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_859,plain,
% 0.20/0.45 ( ~ element(f(g(X0)),g(X0))
% 0.20/0.45 | ~ element(g(X0),n)
% 0.20/0.45 | ~ element(g(X0),m)
% 0.20/0.45 | ~ element(g(X0),f(g(X0)))
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | f(g(X0)) = n
% 0.20/0.45 | g(X0) = m
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_371,c_168]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_860,plain,
% 0.20/0.45 ( ~ element(f(g(X0)),g(X0))
% 0.20/0.45 | ~ element(g(X0),n)
% 0.20/0.45 | ~ element(g(X0),m)
% 0.20/0.45 | ~ element(g(X0),f(g(X0)))
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | f(g(X0)) = n
% 0.20/0.45 | g(X0) = m
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_859]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_919,plain,
% 0.20/0.45 ( ~ element(g(X0),n)
% 0.20/0.45 | ~ element(g(X0),m)
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | f(g(X0)) = n
% 0.20/0.45 | g(X0) = m
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(forward_subsumption_resolution,
% 0.20/0.45 [status(thm)],
% 0.20/0.45 [c_860,c_162,c_160]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_920,plain,
% 0.20/0.45 ( ~ element(g(X0),n)
% 0.20/0.45 | ~ element(g(X0),m)
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | f(g(X0)) = n
% 0.20/0.45 | g(X0) = m
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_919]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_1,negated_conjecture,
% 0.20/0.45 ( element(X0,m)
% 0.20/0.45 | ~ element(X0,X1)
% 0.20/0.45 | ~ element(X1,X0)
% 0.20/0.45 | X0 = m
% 0.20/0.45 | X1 = m
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_65) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_30,negated_conjecture,
% 0.20/0.45 ( element(X0,m)
% 0.20/0.45 | ~ element(X0,X1)
% 0.20/0.45 | ~ element(X1,X0)
% 0.20/0.45 | X0 = m
% 0.20/0.45 | X1 = m
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_1]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_93,negated_conjecture,
% 0.20/0.45 ( element(X0,m)
% 0.20/0.45 | ~ element(X0,X1)
% 0.20/0.45 | ~ element(X1,X0)
% 0.20/0.45 | X0 = m
% 0.20/0.45 | X1 = m
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_30]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_122,negated_conjecture,
% 0.20/0.45 ( element(X0,m)
% 0.20/0.45 | ~ element(X0,X1)
% 0.20/0.45 | ~ element(X1,X0)
% 0.20/0.45 | X0 = m
% 0.20/0.45 | X1 = m
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_93]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_125,negated_conjecture,
% 0.20/0.45 ( element(X0,m)
% 0.20/0.45 | ~ element(X0,X1)
% 0.20/0.45 | ~ element(X1,X0)
% 0.20/0.45 | X0 = m
% 0.20/0.45 | X1 = m
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_122]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_158,negated_conjecture,
% 0.20/0.45 ( element(X0,m)
% 0.20/0.45 | ~ element(X0,X1)
% 0.20/0.45 | ~ element(X1,X0)
% 0.20/0.45 | X0 = m
% 0.20/0.45 | X1 = m
% 0.20/0.45 | X1 = X0 ),
% 0.20/0.45 inference(copy,[status(esa)],[c_125]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_7,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | f(X0) != m | X0 = m ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_71) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_42,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | f(X0) != m | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_99,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | f(X0) != m | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_42]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_116,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | f(X0) != m | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_99]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_131,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | f(X0) != m | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_116]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_170,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,m) | f(X0) != m | X0 = m ),
% 0.20/0.45 inference(copy,[status(esa)],[c_131]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_326,plain,
% 0.20/0.45 ( element(f(X0),m)
% 0.20/0.45 | ~ element(f(X0),X1)
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | ~ element(X1,f(X0))
% 0.20/0.45 | X1 = m
% 0.20/0.45 | X0 = m
% 0.20/0.45 | X1 = f(X0) ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_158,c_170]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_327,plain,
% 0.20/0.45 ( element(f(X0),m)
% 0.20/0.45 | ~ element(f(X0),X1)
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | ~ element(X1,f(X0))
% 0.20/0.45 | X1 = m
% 0.20/0.45 | X0 = m
% 0.20/0.45 | X1 = f(X0) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_326]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_790,plain,
% 0.20/0.45 ( element(f(X0),n)
% 0.20/0.45 | element(f(X0),m)
% 0.20/0.45 | ~ element(f(X0),g(f(X0)))
% 0.20/0.45 | ~ element(g(f(X0)),f(X0))
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | f(X0) = n
% 0.20/0.45 | g(f(X0)) = m
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_327,c_176]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_791,plain,
% 0.20/0.45 ( element(f(X0),n)
% 0.20/0.45 | element(f(X0),m)
% 0.20/0.45 | ~ element(f(X0),g(f(X0)))
% 0.20/0.45 | ~ element(g(f(X0)),f(X0))
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | f(X0) = n
% 0.20/0.45 | g(f(X0)) = m
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_790]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_4,negated_conjecture,
% 0.20/0.45 ( element(g(X0),X0) | element(X0,n) | X0 = n ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_68) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_36,negated_conjecture,
% 0.20/0.45 ( element(g(X0),X0) | element(X0,n) | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_96,negated_conjecture,
% 0.20/0.45 ( element(g(X0),X0) | element(X0,n) | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_36]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_119,negated_conjecture,
% 0.20/0.45 ( element(g(X0),X0) | element(X0,n) | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_96]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_128,negated_conjecture,
% 0.20/0.45 ( element(g(X0),X0) | element(X0,n) | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_119]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_164,plain,
% 0.20/0.45 ( element(g(X0),X0) | element(X0,n) | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_128]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_5,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | element(X0,g(X0)) | X0 = n ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_69) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_38,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | element(X0,g(X0)) | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_97,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | element(X0,g(X0)) | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_38]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_118,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | element(X0,g(X0)) | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_97]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_129,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | element(X0,g(X0)) | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_118]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_166,negated_conjecture,
% 0.20/0.45 ( element(X0,n) | element(X0,g(X0)) | X0 = n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_129]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_903,plain,
% 0.20/0.45 ( element(f(X0),n)
% 0.20/0.45 | element(f(X0),m)
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | f(X0) = n
% 0.20/0.45 | g(f(X0)) = m
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(forward_subsumption_resolution,
% 0.20/0.45 [status(thm)],
% 0.20/0.45 [c_791,c_164,c_166]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_904,plain,
% 0.20/0.45 ( element(f(X0),n)
% 0.20/0.45 | element(f(X0),m)
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | f(X0) = n
% 0.20/0.45 | g(f(X0)) = m
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_903]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_366,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(f(n),n)
% 0.20/0.45 | ~ element(f(n),X0)
% 0.20/0.45 | ~ element(X0,f(n))
% 0.20/0.45 | n = m
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X0 = f(n) ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_156,c_168]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_367,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(f(n),n)
% 0.20/0.45 | ~ element(f(n),X0)
% 0.20/0.45 | ~ element(X0,f(n))
% 0.20/0.45 | n = m
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X0 = f(n) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_366]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_870,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(f(n),X0)
% 0.20/0.45 | ~ element(X0,f(n))
% 0.20/0.45 | n = m
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X0 = f(n) ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_367,c_160]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_871,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(f(n),X0)
% 0.20/0.45 | ~ element(X0,f(n))
% 0.20/0.45 | n = m
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X0 = f(n) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_870]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_878,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(f(n),m)
% 0.20/0.45 | ~ element(f(n),f(f(n)))
% 0.20/0.45 | ~ element(f(f(n)),f(n))
% 0.20/0.45 | n = m
% 0.20/0.45 | f(n) = m
% 0.20/0.45 | f(f(n)) = n ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_871,c_168]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_879,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(f(n),m)
% 0.20/0.45 | ~ element(f(n),f(f(n)))
% 0.20/0.45 | ~ element(f(f(n)),f(n))
% 0.20/0.45 | n = m
% 0.20/0.45 | f(n) = m
% 0.20/0.45 | f(f(n)) = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_878]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_889,plain,
% 0.20/0.45 ( ~ element(n,m) | ~ element(f(n),m) | n = m | f(f(n)) = n ),
% 0.20/0.45 inference(forward_subsumption_resolution,
% 0.20/0.45 [status(thm)],
% 0.20/0.45 [c_879,c_170,c_160,c_162]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_890,plain,
% 0.20/0.45 ( ~ element(n,m) | ~ element(f(n),m) | n = m | f(f(n)) = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_889]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_348,plain,
% 0.20/0.45 ( ~ element(f(X0),X0)
% 0.20/0.45 | ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | ~ element(X0,f(X0))
% 0.20/0.45 | f(X0) = n
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_156,c_168]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_349,plain,
% 0.20/0.45 ( ~ element(f(X0),X0)
% 0.20/0.45 | ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | ~ element(X0,f(X0))
% 0.20/0.45 | f(X0) = n
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_348]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_799,plain,
% 0.20/0.45 ( ~ element(X0,n) | ~ element(X0,m) | f(X0) = n | X0 = n | X0 = m ),
% 0.20/0.45 inference(forward_subsumption_resolution,
% 0.20/0.45 [status(thm)],
% 0.20/0.45 [c_349,c_162,c_160]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_800,plain,
% 0.20/0.45 ( ~ element(X0,n) | ~ element(X0,m) | f(X0) = n | X0 = n | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_799]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_15,negated_conjecture,
% 0.20/0.45 ( m != n ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_79) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_58,negated_conjecture,
% 0.20/0.45 ( m != n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_107,negated_conjecture,
% 0.20/0.45 ( m != n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_58]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_108,negated_conjecture,
% 0.20/0.45 ( m != n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_107]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_139,negated_conjecture,
% 0.20/0.45 ( m != n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_108]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_186,negated_conjecture,
% 0.20/0.45 ( m != n ),
% 0.20/0.45 inference(copy,[status(esa)],[c_139]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_364,plain,
% 0.20/0.45 ( ~ element(m,X0) | ~ element(X0,n) | ~ element(X0,m) | m = X0 | X0 = n ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_156,c_186]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_365,plain,
% 0.20/0.45 ( ~ element(m,X0) | ~ element(X0,n) | ~ element(X0,m) | m = X0 | X0 = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_364]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_464,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(m,f(n))
% 0.20/0.45 | ~ element(f(n),n)
% 0.20/0.45 | ~ element(f(n),m)
% 0.20/0.45 | n = m
% 0.20/0.45 | m = f(n) ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_365,c_168]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_465,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(m,f(n))
% 0.20/0.45 | ~ element(f(n),n)
% 0.20/0.45 | ~ element(f(n),m)
% 0.20/0.45 | n = m
% 0.20/0.45 | m = f(n) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_464]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_749,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(m,f(n))
% 0.20/0.45 | ~ element(f(n),m)
% 0.20/0.45 | n = m
% 0.20/0.45 | m = f(n) ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_465,c_160]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_750,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(m,f(n))
% 0.20/0.45 | ~ element(f(n),m)
% 0.20/0.45 | n = m
% 0.20/0.45 | m = f(n) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_749]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_360,plain,
% 0.20/0.45 ( element(n,n)
% 0.20/0.45 | ~ element(g(n),X0)
% 0.20/0.45 | ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,g(n))
% 0.20/0.45 | n = n
% 0.20/0.45 | g(n) = X0
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_156,c_176]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_361,plain,
% 0.20/0.45 ( element(n,n)
% 0.20/0.45 | ~ element(g(n),X0)
% 0.20/0.45 | ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,g(n))
% 0.20/0.45 | n = n
% 0.20/0.45 | g(n) = X0
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_360]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_731,plain,
% 0.20/0.45 ( ~ element(g(n),X0)
% 0.20/0.45 | ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,g(n))
% 0.20/0.45 | n = n
% 0.20/0.45 | g(n) = X0
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_361,c_345]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_732,plain,
% 0.20/0.45 ( ~ element(g(n),X0)
% 0.20/0.45 | ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,g(n))
% 0.20/0.45 | n = n
% 0.20/0.45 | g(n) = X0
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_731]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_372,plain,
% 0.20/0.45 ( ~ element(m,n) | ~ element(m,X0) | ~ element(X0,m) | X0 = n | X0 = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_156,c_186]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_373,plain,
% 0.20/0.45 ( ~ element(m,n) | ~ element(m,X0) | ~ element(X0,m) | X0 = n | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_372]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_486,plain,
% 0.20/0.45 ( ~ element(m,n)
% 0.20/0.45 | ~ element(m,f(X0))
% 0.20/0.45 | ~ element(f(X0),m)
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | f(X0) = n
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_373,c_170]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_487,plain,
% 0.20/0.45 ( ~ element(m,n)
% 0.20/0.45 | ~ element(m,f(X0))
% 0.20/0.45 | ~ element(f(X0),m)
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | f(X0) = n
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_486]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_676,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(m,n)
% 0.20/0.45 | ~ element(m,f(n))
% 0.20/0.45 | ~ element(f(n),m)
% 0.20/0.45 | n = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_487,c_168]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_677,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(m,n)
% 0.20/0.45 | ~ element(m,f(n))
% 0.20/0.45 | ~ element(f(n),m)
% 0.20/0.45 | n = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_676]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_466,plain,
% 0.20/0.45 ( element(n,n)
% 0.20/0.45 | ~ element(m,g(n))
% 0.20/0.45 | ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),m)
% 0.20/0.45 | n = n
% 0.20/0.45 | m = g(n) ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_365,c_176]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_467,plain,
% 0.20/0.45 ( element(n,n)
% 0.20/0.45 | ~ element(m,g(n))
% 0.20/0.45 | ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),m)
% 0.20/0.45 | n = n
% 0.20/0.45 | m = g(n) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_466]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_645,plain,
% 0.20/0.45 ( ~ element(m,g(n))
% 0.20/0.45 | ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),m)
% 0.20/0.45 | n = n
% 0.20/0.45 | m = g(n) ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_467,c_345]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_646,plain,
% 0.20/0.45 ( ~ element(m,g(n))
% 0.20/0.45 | ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),m)
% 0.20/0.45 | n = n
% 0.20/0.45 | m = g(n) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_645]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_346,plain,
% 0.20/0.45 ( ~ element(X0,n) | ~ element(X0,X0) | X0 = n | X0 = X0 ),
% 0.20/0.45 inference(factoring,[status(thm)],[c_156]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_347,plain,
% 0.20/0.45 ( ~ element(X0,n) | ~ element(X0,X0) | X0 = n | X0 = X0 ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_346]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_404,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(f(n),n)
% 0.20/0.45 | ~ element(f(n),f(n))
% 0.20/0.45 | n = m
% 0.20/0.45 | f(n) = f(n) ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_347,c_168]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_405,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(f(n),n)
% 0.20/0.45 | ~ element(f(n),f(n))
% 0.20/0.45 | n = m
% 0.20/0.45 | f(n) = f(n) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_404]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_619,plain,
% 0.20/0.45 ( ~ element(n,m) | ~ element(f(n),f(n)) | n = m | f(n) = f(n) ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_405,c_160]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_620,plain,
% 0.20/0.45 ( ~ element(n,m) | ~ element(f(n),f(n)) | n = m | f(n) = f(n) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_619]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_314,plain,
% 0.20/0.45 ( element(n,m)
% 0.20/0.45 | ~ element(n,g(X0))
% 0.20/0.45 | ~ element(g(X0),n)
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | n = m
% 0.20/0.45 | g(X0) = m
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_158,c_178]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_315,plain,
% 0.20/0.45 ( element(n,m)
% 0.20/0.45 | ~ element(n,g(X0))
% 0.20/0.45 | ~ element(g(X0),n)
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | n = m
% 0.20/0.45 | g(X0) = m
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_314]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_540,plain,
% 0.20/0.45 ( element(n,m)
% 0.20/0.45 | ~ element(n,g(m))
% 0.20/0.45 | element(m,n)
% 0.20/0.45 | ~ element(g(m),n)
% 0.20/0.45 | n = m
% 0.20/0.45 | m = n ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_315,c_176]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_541,plain,
% 0.20/0.45 ( element(n,m)
% 0.20/0.45 | ~ element(n,g(m))
% 0.20/0.45 | element(m,n)
% 0.20/0.45 | ~ element(g(m),n)
% 0.20/0.45 | n = m
% 0.20/0.45 | m = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_540]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_607,plain,
% 0.20/0.45 ( element(n,m)
% 0.20/0.45 | ~ element(n,g(m))
% 0.20/0.45 | element(m,n)
% 0.20/0.45 | ~ element(g(m),n)
% 0.20/0.45 | n = m ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_541,c_186]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_608,plain,
% 0.20/0.45 ( element(n,m)
% 0.20/0.45 | ~ element(n,g(m))
% 0.20/0.45 | element(m,n)
% 0.20/0.45 | ~ element(g(m),n)
% 0.20/0.45 | n = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_607]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_406,plain,
% 0.20/0.45 ( element(n,n)
% 0.20/0.45 | ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),g(n))
% 0.20/0.45 | n = n
% 0.20/0.45 | g(n) = g(n) ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_347,c_176]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_407,plain,
% 0.20/0.45 ( element(n,n)
% 0.20/0.45 | ~ element(g(n),n)
% 0.20/0.45 | ~ element(g(n),g(n))
% 0.20/0.45 | n = n
% 0.20/0.45 | g(n) = g(n) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_406]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_585,plain,
% 0.20/0.45 ( ~ element(g(n),n) | ~ element(g(n),g(n)) | n = n | g(n) = g(n) ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_407,c_345]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_586,plain,
% 0.20/0.45 ( ~ element(g(n),n) | ~ element(g(n),g(n)) | n = n | g(n) = g(n) ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_585]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_312,plain,
% 0.20/0.45 ( ~ element(g(X0),X0)
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | element(X0,m)
% 0.20/0.45 | ~ element(X0,g(X0))
% 0.20/0.45 | g(X0) = m
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_158,c_176]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_313,plain,
% 0.20/0.45 ( ~ element(g(X0),X0)
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | element(X0,m)
% 0.20/0.45 | ~ element(X0,g(X0))
% 0.20/0.45 | g(X0) = m
% 0.20/0.45 | X0 = n
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_312]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_517,plain,
% 0.20/0.45 ( element(X0,n) | element(X0,m) | g(X0) = m | X0 = n | X0 = m ),
% 0.20/0.45 inference(forward_subsumption_resolution,
% 0.20/0.45 [status(thm)],
% 0.20/0.45 [c_313,c_166,c_164]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_518,plain,
% 0.20/0.45 ( element(X0,n) | element(X0,m) | g(X0) = m | X0 = n | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_517]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_524,plain,
% 0.20/0.45 ( element(m,n) | element(m,m) | m = n | m = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_518,c_176]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_525,plain,
% 0.20/0.45 ( element(m,n) | element(m,m) | m = n | m = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_524]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_565,plain,
% 0.20/0.45 ( element(m,n) | element(m,m) | m = m ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_525,c_186]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_566,plain,
% 0.20/0.45 ( element(m,n) | element(m,m) | m = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_565]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_322,plain,
% 0.20/0.45 ( element(m,n)
% 0.20/0.45 | ~ element(g(m),X0)
% 0.20/0.45 | element(X0,m)
% 0.20/0.45 | ~ element(X0,g(m))
% 0.20/0.45 | m = n
% 0.20/0.45 | g(m) = X0
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_158,c_176]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_323,plain,
% 0.20/0.45 ( element(m,n)
% 0.20/0.45 | ~ element(g(m),X0)
% 0.20/0.45 | element(X0,m)
% 0.20/0.45 | ~ element(X0,g(m))
% 0.20/0.45 | m = n
% 0.20/0.45 | g(m) = X0
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_322]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_549,plain,
% 0.20/0.45 ( element(m,n)
% 0.20/0.45 | ~ element(g(m),X0)
% 0.20/0.45 | element(X0,m)
% 0.20/0.45 | ~ element(X0,g(m))
% 0.20/0.45 | g(m) = X0
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_323,c_186]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_550,plain,
% 0.20/0.45 ( element(m,n)
% 0.20/0.45 | ~ element(g(m),X0)
% 0.20/0.45 | element(X0,m)
% 0.20/0.45 | ~ element(X0,g(m))
% 0.20/0.45 | g(m) = X0
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_549]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_8,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,k) | X0 = n | X0 = m | X0 = k ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_72) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_44,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,k) | X0 = n | X0 = m | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_100,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,k) | X0 = n | X0 = m | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_44]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_115,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,k) | X0 = n | X0 = m | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_100]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_132,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,k) | X0 = n | X0 = m | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_115]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_172,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,k) | X0 = n | X0 = m | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_132]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_286,plain,
% 0.20/0.45 ( ~ element(f(k),k) | ~ element(k,m) | f(k) = n | f(k) = m | k = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_172,c_168]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_287,plain,
% 0.20/0.45 ( ~ element(f(k),k) | ~ element(k,m) | f(k) = n | f(k) = m | k = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_286]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_505,plain,
% 0.20/0.45 ( ~ element(k,m) | f(k) = n | k = m ),
% 0.20/0.45 inference(forward_subsumption_resolution,
% 0.20/0.45 [status(thm)],
% 0.20/0.45 [c_287,c_170,c_160]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_506,plain,
% 0.20/0.45 ( ~ element(k,m) | f(k) = n | k = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_505]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_288,plain,
% 0.20/0.45 ( ~ element(g(k),k) | element(k,n) | g(k) = n | g(k) = m | k = n ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_172,c_176]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_289,plain,
% 0.20/0.45 ( ~ element(g(k),k) | element(k,n) | g(k) = n | g(k) = m | k = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_288]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_495,plain,
% 0.20/0.45 ( element(k,n) | g(k) = m | k = n ),
% 0.20/0.45 inference(forward_subsumption_resolution,
% 0.20/0.45 [status(thm)],
% 0.20/0.45 [c_289,c_178,c_164]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_496,plain,
% 0.20/0.45 ( element(k,n) | g(k) = m | k = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_495]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_468,plain,
% 0.20/0.45 ( ~ element(m,g(X0))
% 0.20/0.45 | ~ element(g(X0),n)
% 0.20/0.45 | ~ element(g(X0),m)
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | m = g(X0)
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_365,c_178]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_469,plain,
% 0.20/0.45 ( ~ element(m,g(X0))
% 0.20/0.45 | ~ element(g(X0),n)
% 0.20/0.45 | ~ element(g(X0),m)
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | m = g(X0)
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_468]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_302,plain,
% 0.20/0.45 ( element(m,m) | ~ element(m,X0) | ~ element(X0,m) | m = m | X0 = m ),
% 0.20/0.45 inference(factoring,[status(thm)],[c_158]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_303,plain,
% 0.20/0.45 ( element(m,m) | ~ element(m,X0) | ~ element(X0,m) | m = m | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_302]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_450,plain,
% 0.20/0.45 ( element(m,m)
% 0.20/0.45 | ~ element(m,f(X0))
% 0.20/0.45 | ~ element(f(X0),m)
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | m = m
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_303,c_170]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_451,plain,
% 0.20/0.45 ( element(m,m)
% 0.20/0.45 | ~ element(m,f(X0))
% 0.20/0.45 | ~ element(f(X0),m)
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | m = m
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_450]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_9,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,j) | X0 = k | X0 = j ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_73) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_46,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,j) | X0 = k | X0 = j ),
% 0.20/0.45 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_101,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,j) | X0 = k | X0 = j ),
% 0.20/0.45 inference(copy,[status(esa)],[c_46]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_114,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,j) | X0 = k | X0 = j ),
% 0.20/0.45 inference(copy,[status(esa)],[c_101]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_133,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,j) | X0 = k | X0 = j ),
% 0.20/0.45 inference(copy,[status(esa)],[c_114]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_174,negated_conjecture,
% 0.20/0.45 ( ~ element(X0,j) | X0 = k | X0 = j ),
% 0.20/0.45 inference(copy,[status(esa)],[c_133]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_269,plain,
% 0.20/0.45 ( ~ element(f(j),j) | ~ element(j,m) | f(j) = k | j = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_168,c_174]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_270,plain,
% 0.20/0.45 ( ~ element(f(j),j) | ~ element(j,m) | f(j) = k | j = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_269]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_431,plain,
% 0.20/0.45 ( ~ element(j,m) | f(j) = k | j = m ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_270,c_160]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_432,plain,
% 0.20/0.45 ( ~ element(j,m) | f(j) = k | j = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_431]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_249,plain,
% 0.20/0.45 ( ~ element(g(j),j) | element(j,n) | g(j) = k | j = n ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_176,c_174]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_250,plain,
% 0.20/0.45 ( ~ element(g(j),j) | element(j,n) | g(j) = k | j = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_249]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_422,plain,
% 0.20/0.45 ( element(j,n) | g(j) = k | j = n ),
% 0.20/0.45 inference(forward_subsumption_resolution,[status(thm)],[c_250,c_164]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_423,plain,
% 0.20/0.45 ( element(j,n) | g(j) = k | j = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_422]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_410,plain,
% 0.20/0.45 ( ~ element(m,n) | ~ element(m,m) | m = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_347,c_186]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_411,plain,
% 0.20/0.45 ( ~ element(m,n) | ~ element(m,m) | m = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_410]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_408,plain,
% 0.20/0.45 ( ~ element(g(X0),n)
% 0.20/0.45 | ~ element(g(X0),g(X0))
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | g(X0) = g(X0)
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_347,c_178]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_409,plain,
% 0.20/0.45 ( ~ element(g(X0),n)
% 0.20/0.45 | ~ element(g(X0),g(X0))
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | g(X0) = g(X0)
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_408]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_306,plain,
% 0.20/0.45 ( element(X0,m) | ~ element(X0,X0) | X0 = m | X0 = X0 ),
% 0.20/0.45 inference(factoring,[status(thm)],[c_158]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_307,plain,
% 0.20/0.45 ( element(X0,m) | ~ element(X0,X0) | X0 = m | X0 = X0 ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_306]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_390,plain,
% 0.20/0.45 ( element(f(X0),m)
% 0.20/0.45 | ~ element(f(X0),f(X0))
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | f(X0) = f(X0)
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_307,c_170]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_391,plain,
% 0.20/0.45 ( element(f(X0),m)
% 0.20/0.45 | ~ element(f(X0),f(X0))
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | f(X0) = f(X0)
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_390]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_362,plain,
% 0.20/0.45 ( ~ element(g(X0),X1)
% 0.20/0.45 | ~ element(X1,n)
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | ~ element(X1,g(X0))
% 0.20/0.45 | g(X0) = X1
% 0.20/0.45 | X1 = n
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_156,c_178]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_363,plain,
% 0.20/0.45 ( ~ element(g(X0),X1)
% 0.20/0.45 | ~ element(X1,n)
% 0.20/0.45 | element(X0,n)
% 0.20/0.45 | ~ element(X1,g(X0))
% 0.20/0.45 | g(X0) = X1
% 0.20/0.45 | X1 = n
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_362]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_358,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(f(n),X0)
% 0.20/0.45 | ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,f(n))
% 0.20/0.45 | n = m
% 0.20/0.45 | f(n) = X0
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_156,c_168]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_359,plain,
% 0.20/0.45 ( ~ element(n,m)
% 0.20/0.45 | ~ element(f(n),X0)
% 0.20/0.45 | ~ element(X0,n)
% 0.20/0.45 | ~ element(X0,f(n))
% 0.20/0.45 | n = m
% 0.20/0.45 | f(n) = X0
% 0.20/0.45 | X0 = n ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_358]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_320,plain,
% 0.20/0.45 ( ~ element(f(X0),X1)
% 0.20/0.45 | element(X1,m)
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | ~ element(X1,f(X0))
% 0.20/0.45 | f(X0) = X1
% 0.20/0.45 | X1 = m
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(resolution,[status(thm)],[c_158,c_170]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_321,plain,
% 0.20/0.45 ( ~ element(f(X0),X1)
% 0.20/0.45 | element(X1,m)
% 0.20/0.45 | ~ element(X0,m)
% 0.20/0.45 | ~ element(X1,f(X0))
% 0.20/0.45 | f(X0) = X1
% 0.20/0.45 | X1 = m
% 0.20/0.45 | X0 = m ),
% 0.20/0.45 inference(rewriting,[status(thm)],[c_320]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_14,negated_conjecture,
% 0.20/0.45 ( element(X0,j) | X0 != k | X0 = j ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_78) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_56,negated_conjecture,
% 0.20/0.45 ( element(X0,j) | X0 != k | X0 = j ),
% 0.20/0.45 inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_106,negated_conjecture,
% 0.20/0.45 ( element(X0,j) | X0 != k | X0 = j ),
% 0.20/0.45 inference(copy,[status(esa)],[c_56]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_109,negated_conjecture,
% 0.20/0.45 ( element(X0,j) | X0 != k | X0 = j ),
% 0.20/0.45 inference(copy,[status(esa)],[c_106]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_138,negated_conjecture,
% 0.20/0.45 ( element(X0,j) | X0 != k | X0 = j ),
% 0.20/0.45 inference(copy,[status(esa)],[c_109]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_184,negated_conjecture,
% 0.20/0.45 ( element(X0,j) | X0 != k | X0 = j ),
% 0.20/0.45 inference(copy,[status(esa)],[c_138]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_13,negated_conjecture,
% 0.20/0.45 ( element(X0,k) | X0 != m | X0 = k ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_77) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_54,negated_conjecture,
% 0.20/0.45 ( element(X0,k) | X0 != m | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_105,negated_conjecture,
% 0.20/0.45 ( element(X0,k) | X0 != m | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_54]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_110,negated_conjecture,
% 0.20/0.45 ( element(X0,k) | X0 != m | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_105]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_137,negated_conjecture,
% 0.20/0.45 ( element(X0,k) | X0 != m | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_110]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_182,negated_conjecture,
% 0.20/0.45 ( element(X0,k) | X0 != m | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_137]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_12,negated_conjecture,
% 0.20/0.45 ( element(X0,k) | X0 != n | X0 = k ),
% 0.20/0.45 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_76) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_52,negated_conjecture,
% 0.20/0.45 ( element(X0,k) | X0 != n | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_104,negated_conjecture,
% 0.20/0.45 ( element(X0,k) | X0 != n | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_52]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_111,negated_conjecture,
% 0.20/0.45 ( element(X0,k) | X0 != n | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_104]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_136,negated_conjecture,
% 0.20/0.45 ( element(X0,k) | X0 != n | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_111]) ).
% 0.20/0.45
% 0.20/0.45 cnf(c_180,negated_conjecture,
% 0.20/0.45 ( element(X0,k) | X0 != n | X0 = k ),
% 0.20/0.45 inference(copy,[status(esa)],[c_136]) ).
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 % ------ Statistics
% 0.20/0.45
% 0.20/0.45 % ------ General
% 0.20/0.45
% 0.20/0.45 % num_of_input_clauses: 16
% 0.20/0.45 % num_of_input_neg_conjectures: 16
% 0.20/0.45 % num_of_splits: 0
% 0.20/0.45 % num_of_split_atoms: 0
% 0.20/0.45 % num_of_sem_filtered_clauses: 0
% 0.20/0.45 % num_of_subtypes: 0
% 0.20/0.45 % monotx_restored_types: 0
% 0.20/0.45 % sat_num_of_epr_types: 0
% 0.20/0.45 % sat_num_of_non_cyclic_types: 0
% 0.20/0.45 % sat_guarded_non_collapsed_types: 0
% 0.20/0.45 % is_epr: 0
% 0.20/0.45 % is_horn: 0
% 0.20/0.45 % has_eq: 1
% 0.20/0.45 % num_pure_diseq_elim: 0
% 0.20/0.45 % simp_replaced_by: 0
% 0.20/0.45 % res_preprocessed: 32
% 0.20/0.45 % prep_upred: 0
% 0.20/0.45 % prep_unflattend: 0
% 0.20/0.45 % pred_elim_cands: 0
% 0.20/0.45 % pred_elim: 0
% 0.20/0.45 % pred_elim_cl: 0
% 0.20/0.45 % pred_elim_cycles: 0
% 0.20/0.45 % forced_gc_time: 0
% 0.20/0.45 % gc_basic_clause_elim: 0
% 0.20/0.45 % parsing_time: 0.
% 0.20/0.45 % sem_filter_time: 0.
% 0.20/0.45 % pred_elim_time: 0.
% 0.20/0.45 % out_proof_time: 0.
% 0.20/0.45 % monotx_time: 0.
% 0.20/0.45 % subtype_inf_time: 0.
% 0.20/0.45 % unif_index_cands_time: 0.
% 0.20/0.46 % unif_index_add_time: 0.
% 0.20/0.46 % total_time: 0.053
% 0.20/0.46 % num_of_symbols: 32
% 0.20/0.46 % num_of_terms: 325
% 0.20/0.46
% 0.20/0.46 % ------ Propositional Solver
% 0.20/0.46
% 0.20/0.46 % prop_solver_calls: 1
% 0.20/0.46 % prop_fast_solver_calls: 159
% 0.20/0.46 % prop_num_of_clauses: 28
% 0.20/0.46 % prop_preprocess_simplified: 282
% 0.20/0.46 % prop_fo_subsumed: 0
% 0.20/0.46 % prop_solver_time: 0.
% 0.20/0.46 % prop_fast_solver_time: 0.
% 0.20/0.46 % prop_unsat_core_time: 0.
% 0.20/0.46
% 0.20/0.46 % ------ QBF
% 0.20/0.46
% 0.20/0.46 % qbf_q_res: 0
% 0.20/0.46 % qbf_num_tautologies: 0
% 0.20/0.46 % qbf_prep_cycles: 0
% 0.20/0.46
% 0.20/0.46 % ------ BMC1
% 0.20/0.46
% 0.20/0.46 % bmc1_current_bound: -1
% 0.20/0.46 % bmc1_last_solved_bound: -1
% 0.20/0.46 % bmc1_unsat_core_size: -1
% 0.20/0.46 % bmc1_unsat_core_parents_size: -1
% 0.20/0.46 % bmc1_merge_next_fun: 0
% 0.20/0.46 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.46
% 0.20/0.46 % ------ Instantiation
% 0.20/0.46
% 0.20/0.46 % inst_num_of_clauses: 16
% 0.20/0.46 % inst_num_in_passive: 0
% 0.20/0.46 % inst_num_in_active: 0
% 0.20/0.46 % inst_num_in_unprocessed: 16
% 0.20/0.46 % inst_num_of_loops: 0
% 0.20/0.46 % inst_num_of_learning_restarts: 0
% 0.20/0.46 % inst_num_moves_active_passive: 0
% 0.20/0.46 % inst_lit_activity: 0
% 0.20/0.46 % inst_lit_activity_moves: 0
% 0.20/0.46 % inst_num_tautologies: 0
% 0.20/0.46 % inst_num_prop_implied: 0
% 0.20/0.46 % inst_num_existing_simplified: 0
% 0.20/0.46 % inst_num_eq_res_simplified: 0
% 0.20/0.46 % inst_num_child_elim: 0
% 0.20/0.46 % inst_num_of_dismatching_blockings: 0
% 0.20/0.46 % inst_num_of_non_proper_insts: 0
% 0.20/0.46 % inst_num_of_duplicates: 0
% 0.20/0.46 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.46 % inst_dismatching_checking_time: 0.
% 0.20/0.46
% 0.20/0.46 % ------ Resolution
% 0.20/0.46
% 0.20/0.46 % res_num_of_clauses: 55
% 0.20/0.46 % res_num_in_passive: 0
% 0.20/0.46 % res_num_in_active: 55
% 0.20/0.46 % res_num_of_loops: 79
% 0.20/0.46 % res_forward_subset_subsumed: 6
% 0.20/0.46 % res_backward_subset_subsumed: 0
% 0.20/0.46 % res_forward_subsumed: 22
% 0.20/0.46 % res_backward_subsumed: 1
% 0.20/0.46 % res_forward_subsumption_resolution: 29
% 0.20/0.46 % res_backward_subsumption_resolution: 0
% 0.20/0.46 % res_clause_to_clause_subsumption: 753
% 0.20/0.46 % res_orphan_elimination: 0
% 0.20/0.46 % res_tautology_del: 18
% 0.20/0.46 % res_num_eq_res_simplified: 0
% 0.20/0.46 % res_num_sel_changes: 0
% 0.20/0.46 % res_moves_from_active_to_pass: 0
% 0.20/0.46
% 0.20/0.46 % Status Unknown
% 0.20/0.50 % Orienting using strategy ClausalAll
% 0.20/0.50 % Orientation found
% 0.20/0.50 % 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_f4a2a0.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_85146d.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_abb751 | grep -v "SZS"
% 0.20/0.52
% 0.20/0.52 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.52
% 0.20/0.52 %
% 0.20/0.52 % ------ iProver source info
% 0.20/0.52
% 0.20/0.52 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.52 % git: non_committed_changes: true
% 0.20/0.52 % git: last_make_outside_of_git: true
% 0.20/0.52
% 0.20/0.52 %
% 0.20/0.52 % ------ Input Options
% 0.20/0.52
% 0.20/0.52 % --out_options all
% 0.20/0.52 % --tptp_safe_out true
% 0.20/0.52 % --problem_path ""
% 0.20/0.52 % --include_path ""
% 0.20/0.52 % --clausifier .//eprover
% 0.20/0.52 % --clausifier_options --tstp-format
% 0.20/0.52 % --stdin false
% 0.20/0.52 % --dbg_backtrace false
% 0.20/0.52 % --dbg_dump_prop_clauses false
% 0.20/0.52 % --dbg_dump_prop_clauses_file -
% 0.20/0.52 % --dbg_out_stat false
% 0.20/0.52
% 0.20/0.52 % ------ General Options
% 0.20/0.52
% 0.20/0.52 % --fof false
% 0.20/0.52 % --time_out_real 150.
% 0.20/0.52 % --time_out_prep_mult 0.2
% 0.20/0.52 % --time_out_virtual -1.
% 0.20/0.52 % --schedule none
% 0.20/0.52 % --ground_splitting input
% 0.20/0.52 % --splitting_nvd 16
% 0.20/0.52 % --non_eq_to_eq false
% 0.20/0.52 % --prep_gs_sim true
% 0.20/0.52 % --prep_unflatten false
% 0.20/0.52 % --prep_res_sim true
% 0.20/0.52 % --prep_upred true
% 0.20/0.52 % --res_sim_input true
% 0.20/0.52 % --clause_weak_htbl true
% 0.20/0.52 % --gc_record_bc_elim false
% 0.20/0.52 % --symbol_type_check false
% 0.20/0.52 % --clausify_out false
% 0.20/0.52 % --large_theory_mode false
% 0.20/0.52 % --prep_sem_filter none
% 0.20/0.52 % --prep_sem_filter_out false
% 0.20/0.52 % --preprocessed_out false
% 0.20/0.52 % --sub_typing false
% 0.20/0.52 % --brand_transform false
% 0.20/0.52 % --pure_diseq_elim true
% 0.20/0.52 % --min_unsat_core false
% 0.20/0.52 % --pred_elim true
% 0.20/0.52 % --add_important_lit false
% 0.20/0.52 % --soft_assumptions false
% 0.20/0.52 % --reset_solvers false
% 0.20/0.52 % --bc_imp_inh []
% 0.20/0.52 % --conj_cone_tolerance 1.5
% 0.20/0.52 % --prolific_symb_bound 500
% 0.20/0.52 % --lt_threshold 2000
% 0.20/0.52
% 0.20/0.52 % ------ SAT Options
% 0.20/0.52
% 0.20/0.52 % --sat_mode false
% 0.20/0.52 % --sat_fm_restart_options ""
% 0.20/0.52 % --sat_gr_def false
% 0.20/0.52 % --sat_epr_types true
% 0.20/0.52 % --sat_non_cyclic_types false
% 0.20/0.52 % --sat_finite_models false
% 0.20/0.52 % --sat_fm_lemmas false
% 0.20/0.52 % --sat_fm_prep false
% 0.20/0.52 % --sat_fm_uc_incr true
% 0.20/0.52 % --sat_out_model small
% 0.20/0.52 % --sat_out_clauses false
% 0.20/0.52
% 0.20/0.52 % ------ QBF Options
% 0.20/0.52
% 0.20/0.52 % --qbf_mode false
% 0.20/0.52 % --qbf_elim_univ true
% 0.20/0.52 % --qbf_sk_in true
% 0.20/0.52 % --qbf_pred_elim true
% 0.20/0.52 % --qbf_split 32
% 0.20/0.52
% 0.20/0.52 % ------ BMC1 Options
% 0.20/0.52
% 0.20/0.52 % --bmc1_incremental false
% 0.20/0.52 % --bmc1_axioms reachable_all
% 0.20/0.52 % --bmc1_min_bound 0
% 0.20/0.52 % --bmc1_max_bound -1
% 0.20/0.52 % --bmc1_max_bound_default -1
% 0.20/0.52 % --bmc1_symbol_reachability true
% 0.20/0.52 % --bmc1_property_lemmas false
% 0.20/0.52 % --bmc1_k_induction false
% 0.20/0.52 % --bmc1_non_equiv_states false
% 0.20/0.52 % --bmc1_deadlock false
% 0.20/0.52 % --bmc1_ucm false
% 0.20/0.52 % --bmc1_add_unsat_core none
% 0.20/0.52 % --bmc1_unsat_core_children false
% 0.20/0.52 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.52 % --bmc1_out_stat full
% 0.20/0.52 % --bmc1_ground_init false
% 0.20/0.52 % --bmc1_pre_inst_next_state false
% 0.20/0.52 % --bmc1_pre_inst_state false
% 0.20/0.52 % --bmc1_pre_inst_reach_state false
% 0.20/0.52 % --bmc1_out_unsat_core false
% 0.20/0.52 % --bmc1_aig_witness_out false
% 0.20/0.52 % --bmc1_verbose false
% 0.20/0.52 % --bmc1_dump_clauses_tptp false
% 0.20/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.53 % --bmc1_dump_file -
% 0.20/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.53 % --bmc1_ucm_extend_mode 1
% 0.20/0.53 % --bmc1_ucm_init_mode 2
% 0.20/0.53 % --bmc1_ucm_cone_mode none
% 0.20/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.53 % --bmc1_ucm_relax_model 4
% 0.20/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.53 % --bmc1_ucm_layered_model none
% 0.20/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.53
% 0.20/0.53 % ------ AIG Options
% 0.20/0.53
% 0.20/0.53 % --aig_mode false
% 0.20/0.53
% 0.20/0.53 % ------ Instantiation Options
% 0.20/0.53
% 0.20/0.53 % --instantiation_flag true
% 0.20/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.53 % --inst_solver_per_active 750
% 0.20/0.53 % --inst_solver_calls_frac 0.5
% 0.20/0.53 % --inst_passive_queue_type priority_queues
% 0.20/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.53 % --inst_passive_queues_freq [25;2]
% 0.20/0.53 % --inst_dismatching true
% 0.20/0.53 % --inst_eager_unprocessed_to_passive true
% 0.20/0.53 % --inst_prop_sim_given true
% 0.20/0.53 % --inst_prop_sim_new false
% 0.20/0.53 % --inst_orphan_elimination true
% 0.20/0.53 % --inst_learning_loop_flag true
% 0.20/0.53 % --inst_learning_start 3000
% 0.20/0.53 % --inst_learning_factor 2
% 0.20/0.53 % --inst_start_prop_sim_after_learn 3
% 0.20/0.53 % --inst_sel_renew solver
% 0.20/0.53 % --inst_lit_activity_flag true
% 0.20/0.53 % --inst_out_proof true
% 0.20/0.53
% 0.20/0.53 % ------ Resolution Options
% 0.20/0.53
% 0.20/0.53 % --resolution_flag true
% 0.20/0.53 % --res_lit_sel kbo_max
% 0.20/0.53 % --res_to_prop_solver none
% 0.20/0.53 % --res_prop_simpl_new false
% 0.20/0.53 % --res_prop_simpl_given false
% 0.20/0.53 % --res_passive_queue_type priority_queues
% 0.20/0.53 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.53 % --res_passive_queues_freq [15;5]
% 0.20/0.53 % --res_forward_subs full
% 0.20/0.53 % --res_backward_subs full
% 0.20/0.53 % --res_forward_subs_resolution true
% 0.20/0.53 % --res_backward_subs_resolution true
% 0.20/0.53 % --res_orphan_elimination false
% 0.20/0.53 % --res_time_limit 1000.
% 0.20/0.53 % --res_out_proof true
% 0.20/0.53 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_f4a2a0.s
% 0.20/0.53 % --modulo true
% 0.20/0.53
% 0.20/0.53 % ------ Combination Options
% 0.20/0.53
% 0.20/0.53 % --comb_res_mult 1000
% 0.20/0.53 % --comb_inst_mult 300
% 0.20/0.53 % ------
% 0.20/0.53
% 0.20/0.53 % ------ Parsing...% successful
% 0.20/0.53
% 0.20/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.20/0.53
% 0.20/0.53 % ------ Proving...
% 0.20/0.53 % ------ Problem Properties
% 0.20/0.53
% 0.20/0.53 %
% 0.20/0.53 % EPR false
% 0.20/0.53 % Horn false
% 0.20/0.53 % Has equality true
% 0.20/0.53
% 0.20/0.53 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 % % ------ Current options:
% 0.20/0.53
% 0.20/0.53 % ------ Input Options
% 0.20/0.53
% 0.20/0.53 % --out_options all
% 0.20/0.53 % --tptp_safe_out true
% 0.20/0.53 % --problem_path ""
% 0.20/0.53 % --include_path ""
% 0.20/0.53 % --clausifier .//eprover
% 0.20/0.53 % --clausifier_options --tstp-format
% 0.20/0.53 % --stdin false
% 0.20/0.53 % --dbg_backtrace false
% 0.20/0.53 % --dbg_dump_prop_clauses false
% 0.20/0.53 % --dbg_dump_prop_clauses_file -
% 0.20/0.53 % --dbg_out_stat false
% 0.20/0.53
% 0.20/0.53 % ------ General Options
% 0.20/0.53
% 0.20/0.53 % --fof false
% 0.20/0.53 % --time_out_real 150.
% 0.20/0.53 % --time_out_prep_mult 0.2
% 0.20/0.53 % --time_out_virtual -1.
% 0.20/0.53 % --schedule none
% 0.20/0.53 % --ground_splitting input
% 0.20/0.53 % --splitting_nvd 16
% 0.20/0.53 % --non_eq_to_eq false
% 0.20/0.53 % --prep_gs_sim true
% 0.20/0.53 % --prep_unflatten false
% 0.20/0.53 % --prep_res_sim true
% 0.20/0.53 % --prep_upred true
% 0.20/0.53 % --res_sim_input true
% 0.20/0.53 % --clause_weak_htbl true
% 0.20/0.53 % --gc_record_bc_elim false
% 0.20/0.53 % --symbol_type_check false
% 0.20/0.53 % --clausify_out false
% 0.20/0.53 % --large_theory_mode false
% 0.20/0.53 % --prep_sem_filter none
% 0.20/0.53 % --prep_sem_filter_out false
% 0.20/0.53 % --preprocessed_out false
% 0.20/0.53 % --sub_typing false
% 0.20/0.53 % --brand_transform false
% 0.20/0.53 % --pure_diseq_elim true
% 0.20/0.53 % --min_unsat_core false
% 0.20/0.53 % --pred_elim true
% 0.20/0.53 % --add_important_lit false
% 0.20/0.53 % --soft_assumptions false
% 0.20/0.53 % --reset_solvers false
% 0.20/0.53 % --bc_imp_inh []
% 0.20/0.53 % --conj_cone_tolerance 1.5
% 0.20/0.53 % --prolific_symb_bound 500
% 0.20/0.53 % --lt_threshold 2000
% 0.20/0.53
% 0.20/0.53 % ------ SAT Options
% 0.20/0.53
% 0.20/0.53 % --sat_mode false
% 0.20/0.53 % --sat_fm_restart_options ""
% 0.20/0.53 % --sat_gr_def false
% 0.20/0.53 % --sat_epr_types true
% 0.20/0.53 % --sat_non_cyclic_types false
% 0.20/0.53 % --sat_finite_models false
% 0.20/0.53 % --sat_fm_lemmas false
% 0.20/0.53 % --sat_fm_prep false
% 0.20/0.53 % --sat_fm_uc_incr true
% 0.20/0.53 % --sat_out_model small
% 0.20/0.53 % --sat_out_clauses false
% 0.20/0.53
% 0.20/0.53 % ------ QBF Options
% 0.20/0.53
% 0.20/0.53 % --qbf_mode false
% 0.20/0.53 % --qbf_elim_univ true
% 0.20/0.53 % --qbf_sk_in true
% 0.20/0.53 % --qbf_pred_elim true
% 0.20/0.53 % --qbf_split 32
% 0.20/0.53
% 0.20/0.53 % ------ BMC1 Options
% 0.20/0.53
% 0.20/0.53 % --bmc1_incremental false
% 0.20/0.53 % --bmc1_axioms reachable_all
% 0.20/0.53 % --bmc1_min_bound 0
% 0.20/0.53 % --bmc1_max_bound -1
% 0.20/0.53 % --bmc1_max_bound_default -1
% 0.20/0.53 % --bmc1_symbol_reachability true
% 0.20/0.53 % --bmc1_property_lemmas false
% 0.20/0.53 % --bmc1_k_induction false
% 0.20/0.53 % --bmc1_non_equiv_states false
% 0.20/0.53 % --bmc1_deadlock false
% 0.20/0.53 % --bmc1_ucm false
% 0.20/0.53 % --bmc1_add_unsat_core none
% 0.20/0.53 % --bmc1_unsat_core_children false
% 0.20/0.53 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.53 % --bmc1_out_stat full
% 0.20/0.53 % --bmc1_ground_init false
% 0.20/0.53 % --bmc1_pre_inst_next_state false
% 0.20/0.53 % --bmc1_pre_inst_state false
% 0.20/0.53 % --bmc1_pre_inst_reach_state false
% 0.20/0.53 % --bmc1_out_unsat_core false
% 0.20/0.53 % --bmc1_aig_witness_out false
% 0.20/0.53 % --bmc1_verbose false
% 0.20/0.53 % --bmc1_dump_clauses_tptp false
% 0.20/0.53 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.53 % --bmc1_dump_file -
% 0.20/0.53 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.53 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.53 % --bmc1_ucm_extend_mode 1
% 0.20/0.53 % --bmc1_ucm_init_mode 2
% 0.20/0.53 % --bmc1_ucm_cone_mode none
% 0.20/0.53 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.53 % --bmc1_ucm_relax_model 4
% 0.20/0.53 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.53 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.53 % --bmc1_ucm_layered_model none
% 0.20/0.53 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.53
% 0.20/0.53 % ------ AIG Options
% 0.20/0.53
% 0.20/0.53 % --aig_mode false
% 0.20/0.53
% 0.20/0.53 % ------ Instantiation Options
% 0.20/0.53
% 0.20/0.53 % --instantiation_flag true
% 0.20/0.53 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.53 % --inst_solver_per_active 750
% 0.20/0.53 % --inst_solver_calls_frac 0.5
% 0.20/0.53 % --inst_passive_queue_type priority_queues
% 0.20/0.53 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.53 % --inst_passive_queues_freq [25;2]
% 0.20/0.53 % --inst_dismatching true
% 0.20/0.53 % --inst_eager_unprocessed_to_passive true
% 0.20/0.53 % --inst_prop_sim_given true
% 0.20/0.55 % --inst_prop_sim_new false
% 0.20/0.55 % --inst_orphan_elimination true
% 0.20/0.55 % --inst_learning_loop_flag true
% 0.20/0.55 % --inst_learning_start 3000
% 0.20/0.55 % --inst_learning_factor 2
% 0.20/0.55 % --inst_start_prop_sim_after_learn 3
% 0.20/0.55 % --inst_sel_renew solver
% 0.20/0.55 % --inst_lit_activity_flag true
% 0.20/0.55 % --inst_out_proof true
% 0.20/0.55
% 0.20/0.55 % ------ Resolution Options
% 0.20/0.55
% 0.20/0.55 % --resolution_flag true
% 0.20/0.55 % --res_lit_sel kbo_max
% 0.20/0.55 % --res_to_prop_solver none
% 0.20/0.55 % --res_prop_simpl_new false
% 0.20/0.55 % --res_prop_simpl_given false
% 0.20/0.55 % --res_passive_queue_type priority_queues
% 0.20/0.55 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.55 % --res_passive_queues_freq [15;5]
% 0.20/0.55 % --res_forward_subs full
% 0.20/0.55 % --res_backward_subs full
% 0.20/0.55 % --res_forward_subs_resolution true
% 0.20/0.55 % --res_backward_subs_resolution true
% 0.20/0.55 % --res_orphan_elimination false
% 0.20/0.55 % --res_time_limit 1000.
% 0.20/0.55 % --res_out_proof true
% 0.20/0.55 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_f4a2a0.s
% 0.20/0.55 % --modulo true
% 0.20/0.55
% 0.20/0.55 % ------ Combination Options
% 0.20/0.55
% 0.20/0.55 % --comb_res_mult 1000
% 0.20/0.55 % --comb_inst_mult 300
% 0.20/0.55 % ------
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 % ------ Proving...
% 0.20/0.55 % warning: shown sat in sat incomplete mode
% 0.20/0.55 %
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 cnf(c_0,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,n)
% 0.20/0.55 | ~ element(X0,X1)
% 0.20/0.55 | ~ element(X1,X0)
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X1 = n
% 0.20/0.55 | X1 = X0 ),
% 0.20/0.55 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_64) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_28,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,n)
% 0.20/0.55 | ~ element(X0,X1)
% 0.20/0.55 | ~ element(X1,X0)
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X1 = n
% 0.20/0.55 | X1 = X0 ),
% 0.20/0.55 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_92,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,n)
% 0.20/0.55 | ~ element(X0,X1)
% 0.20/0.55 | ~ element(X1,X0)
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X1 = n
% 0.20/0.55 | X1 = X0 ),
% 0.20/0.55 inference(copy,[status(esa)],[c_28]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_123,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,n)
% 0.20/0.55 | ~ element(X0,X1)
% 0.20/0.55 | ~ element(X1,X0)
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X1 = n
% 0.20/0.55 | X1 = X0 ),
% 0.20/0.55 inference(copy,[status(esa)],[c_92]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_124,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,n)
% 0.20/0.55 | ~ element(X0,X1)
% 0.20/0.55 | ~ element(X1,X0)
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X1 = n
% 0.20/0.55 | X1 = X0 ),
% 0.20/0.55 inference(copy,[status(esa)],[c_123]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_156,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,n)
% 0.20/0.55 | ~ element(X0,X1)
% 0.20/0.55 | ~ element(X1,X0)
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X1 = n
% 0.20/0.55 | X1 = X0 ),
% 0.20/0.55 inference(copy,[status(esa)],[c_124]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_10,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | g(X0) != X0 | X0 = n ),
% 0.20/0.55 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_74) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_48,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | g(X0) != X0 | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_102,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | g(X0) != X0 | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_48]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_113,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | g(X0) != X0 | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_102]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_134,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | g(X0) != X0 | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_113]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_176,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | g(X0) != X0 | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_134]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_368,plain,
% 0.20/0.55 ( element(n,n)
% 0.20/0.55 | ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),X0)
% 0.20/0.55 | ~ element(X0,g(n))
% 0.20/0.55 | n = n
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X0 = g(n) ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_156,c_176]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_369,plain,
% 0.20/0.55 ( element(n,n)
% 0.20/0.55 | ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),X0)
% 0.20/0.55 | ~ element(X0,g(n))
% 0.20/0.55 | n = n
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X0 = g(n) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_368]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_344,plain,
% 0.20/0.55 ( ~ element(n,n) | n = n ),
% 0.20/0.55 inference(factoring,[status(thm)],[c_156]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_345,plain,
% 0.20/0.55 ( ~ element(n,n) | n = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_344]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_833,plain,
% 0.20/0.55 ( ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),X0)
% 0.20/0.55 | ~ element(X0,g(n))
% 0.20/0.55 | n = n
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X0 = g(n) ),
% 0.20/0.55 inference(forward_subsumption_resolution,[status(thm)],[c_369,c_345]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_834,plain,
% 0.20/0.55 ( ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),X0)
% 0.20/0.55 | ~ element(X0,g(n))
% 0.20/0.55 | n = n
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X0 = g(n) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_833]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_6,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | f(X0) != X0 | X0 = m ),
% 0.20/0.55 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_70) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_40,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | f(X0) != X0 | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_98,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | f(X0) != X0 | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_40]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_117,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | f(X0) != X0 | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_98]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_130,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | f(X0) != X0 | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_117]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_168,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | f(X0) != X0 | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_130]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_841,plain,
% 0.20/0.55 ( ~ element(f(g(n)),g(n))
% 0.20/0.55 | ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),m)
% 0.20/0.55 | ~ element(g(n),f(g(n)))
% 0.20/0.55 | n = n
% 0.20/0.55 | f(g(n)) = n
% 0.20/0.55 | g(n) = m ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_834,c_168]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_842,plain,
% 0.20/0.55 ( ~ element(f(g(n)),g(n))
% 0.20/0.55 | ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),m)
% 0.20/0.55 | ~ element(g(n),f(g(n)))
% 0.20/0.55 | n = n
% 0.20/0.55 | f(g(n)) = n
% 0.20/0.55 | g(n) = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_841]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_3,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | element(X0,f(X0)) | X0 = m ),
% 0.20/0.55 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_67) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_34,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | element(X0,f(X0)) | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_95,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | element(X0,f(X0)) | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_34]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_120,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | element(X0,f(X0)) | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_95]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_127,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | element(X0,f(X0)) | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_120]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_162,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | element(X0,f(X0)) | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_127]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_2,negated_conjecture,
% 0.20/0.55 ( element(f(X0),X0) | ~ element(X0,m) | X0 = m ),
% 0.20/0.55 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_66) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_32,negated_conjecture,
% 0.20/0.55 ( element(f(X0),X0) | ~ element(X0,m) | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_2]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_94,negated_conjecture,
% 0.20/0.55 ( element(f(X0),X0) | ~ element(X0,m) | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_32]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_121,negated_conjecture,
% 0.20/0.55 ( element(f(X0),X0) | ~ element(X0,m) | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_94]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_126,negated_conjecture,
% 0.20/0.55 ( element(f(X0),X0) | ~ element(X0,m) | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_121]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_160,plain,
% 0.20/0.55 ( element(f(X0),X0) | ~ element(X0,m) | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_126]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_934,plain,
% 0.20/0.55 ( ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),m)
% 0.20/0.55 | n = n
% 0.20/0.55 | f(g(n)) = n
% 0.20/0.55 | g(n) = m ),
% 0.20/0.55 inference(forward_subsumption_resolution,
% 0.20/0.55 [status(thm)],
% 0.20/0.55 [c_842,c_162,c_160]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_935,plain,
% 0.20/0.55 ( ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),m)
% 0.20/0.55 | n = n
% 0.20/0.55 | f(g(n)) = n
% 0.20/0.55 | g(n) = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_934]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_11,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | g(X0) != n | X0 = n ),
% 0.20/0.55 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_75) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_50,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | g(X0) != n | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_11]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_103,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | g(X0) != n | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_50]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_112,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | g(X0) != n | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_103]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_135,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | g(X0) != n | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_112]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_178,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | g(X0) != n | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_135]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_370,plain,
% 0.20/0.55 ( ~ element(g(X0),n)
% 0.20/0.55 | ~ element(g(X0),X1)
% 0.20/0.55 | element(X0,n)
% 0.20/0.55 | ~ element(X1,g(X0))
% 0.20/0.55 | X1 = n
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X1 = g(X0) ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_156,c_178]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_371,plain,
% 0.20/0.55 ( ~ element(g(X0),n)
% 0.20/0.55 | ~ element(g(X0),X1)
% 0.20/0.55 | element(X0,n)
% 0.20/0.55 | ~ element(X1,g(X0))
% 0.20/0.55 | X1 = n
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X1 = g(X0) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_370]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_859,plain,
% 0.20/0.55 ( ~ element(f(g(X0)),g(X0))
% 0.20/0.55 | ~ element(g(X0),n)
% 0.20/0.55 | ~ element(g(X0),m)
% 0.20/0.55 | ~ element(g(X0),f(g(X0)))
% 0.20/0.55 | element(X0,n)
% 0.20/0.55 | f(g(X0)) = n
% 0.20/0.55 | g(X0) = m
% 0.20/0.55 | X0 = n ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_371,c_168]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_860,plain,
% 0.20/0.55 ( ~ element(f(g(X0)),g(X0))
% 0.20/0.55 | ~ element(g(X0),n)
% 0.20/0.55 | ~ element(g(X0),m)
% 0.20/0.55 | ~ element(g(X0),f(g(X0)))
% 0.20/0.55 | element(X0,n)
% 0.20/0.55 | f(g(X0)) = n
% 0.20/0.55 | g(X0) = m
% 0.20/0.55 | X0 = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_859]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_919,plain,
% 0.20/0.55 ( ~ element(g(X0),n)
% 0.20/0.55 | ~ element(g(X0),m)
% 0.20/0.55 | element(X0,n)
% 0.20/0.55 | f(g(X0)) = n
% 0.20/0.55 | g(X0) = m
% 0.20/0.55 | X0 = n ),
% 0.20/0.55 inference(forward_subsumption_resolution,
% 0.20/0.55 [status(thm)],
% 0.20/0.55 [c_860,c_162,c_160]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_920,plain,
% 0.20/0.55 ( ~ element(g(X0),n)
% 0.20/0.55 | ~ element(g(X0),m)
% 0.20/0.55 | element(X0,n)
% 0.20/0.55 | f(g(X0)) = n
% 0.20/0.55 | g(X0) = m
% 0.20/0.55 | X0 = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_919]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_1,negated_conjecture,
% 0.20/0.55 ( element(X0,m)
% 0.20/0.55 | ~ element(X0,X1)
% 0.20/0.55 | ~ element(X1,X0)
% 0.20/0.55 | X0 = m
% 0.20/0.55 | X1 = m
% 0.20/0.55 | X1 = X0 ),
% 0.20/0.55 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_65) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_30,negated_conjecture,
% 0.20/0.55 ( element(X0,m)
% 0.20/0.55 | ~ element(X0,X1)
% 0.20/0.55 | ~ element(X1,X0)
% 0.20/0.55 | X0 = m
% 0.20/0.55 | X1 = m
% 0.20/0.55 | X1 = X0 ),
% 0.20/0.55 inference(copy,[status(esa)],[c_1]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_93,negated_conjecture,
% 0.20/0.55 ( element(X0,m)
% 0.20/0.55 | ~ element(X0,X1)
% 0.20/0.55 | ~ element(X1,X0)
% 0.20/0.55 | X0 = m
% 0.20/0.55 | X1 = m
% 0.20/0.55 | X1 = X0 ),
% 0.20/0.55 inference(copy,[status(esa)],[c_30]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_122,negated_conjecture,
% 0.20/0.55 ( element(X0,m)
% 0.20/0.55 | ~ element(X0,X1)
% 0.20/0.55 | ~ element(X1,X0)
% 0.20/0.55 | X0 = m
% 0.20/0.55 | X1 = m
% 0.20/0.55 | X1 = X0 ),
% 0.20/0.55 inference(copy,[status(esa)],[c_93]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_125,negated_conjecture,
% 0.20/0.55 ( element(X0,m)
% 0.20/0.55 | ~ element(X0,X1)
% 0.20/0.55 | ~ element(X1,X0)
% 0.20/0.55 | X0 = m
% 0.20/0.55 | X1 = m
% 0.20/0.55 | X1 = X0 ),
% 0.20/0.55 inference(copy,[status(esa)],[c_122]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_158,negated_conjecture,
% 0.20/0.55 ( element(X0,m)
% 0.20/0.55 | ~ element(X0,X1)
% 0.20/0.55 | ~ element(X1,X0)
% 0.20/0.55 | X0 = m
% 0.20/0.55 | X1 = m
% 0.20/0.55 | X1 = X0 ),
% 0.20/0.55 inference(copy,[status(esa)],[c_125]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_7,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | f(X0) != m | X0 = m ),
% 0.20/0.55 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_71) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_42,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | f(X0) != m | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_99,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | f(X0) != m | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_42]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_116,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | f(X0) != m | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_99]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_131,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | f(X0) != m | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_116]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_170,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,m) | f(X0) != m | X0 = m ),
% 0.20/0.55 inference(copy,[status(esa)],[c_131]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_326,plain,
% 0.20/0.55 ( element(f(X0),m)
% 0.20/0.55 | ~ element(f(X0),X1)
% 0.20/0.55 | ~ element(X0,m)
% 0.20/0.55 | ~ element(X1,f(X0))
% 0.20/0.55 | X1 = m
% 0.20/0.55 | X0 = m
% 0.20/0.55 | X1 = f(X0) ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_158,c_170]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_327,plain,
% 0.20/0.55 ( element(f(X0),m)
% 0.20/0.55 | ~ element(f(X0),X1)
% 0.20/0.55 | ~ element(X0,m)
% 0.20/0.55 | ~ element(X1,f(X0))
% 0.20/0.55 | X1 = m
% 0.20/0.55 | X0 = m
% 0.20/0.55 | X1 = f(X0) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_326]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_790,plain,
% 0.20/0.55 ( element(f(X0),n)
% 0.20/0.55 | element(f(X0),m)
% 0.20/0.55 | ~ element(f(X0),g(f(X0)))
% 0.20/0.55 | ~ element(g(f(X0)),f(X0))
% 0.20/0.55 | ~ element(X0,m)
% 0.20/0.55 | f(X0) = n
% 0.20/0.55 | g(f(X0)) = m
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_327,c_176]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_791,plain,
% 0.20/0.55 ( element(f(X0),n)
% 0.20/0.55 | element(f(X0),m)
% 0.20/0.55 | ~ element(f(X0),g(f(X0)))
% 0.20/0.55 | ~ element(g(f(X0)),f(X0))
% 0.20/0.55 | ~ element(X0,m)
% 0.20/0.55 | f(X0) = n
% 0.20/0.55 | g(f(X0)) = m
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_790]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_4,negated_conjecture,
% 0.20/0.55 ( element(g(X0),X0) | element(X0,n) | X0 = n ),
% 0.20/0.55 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_68) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_36,negated_conjecture,
% 0.20/0.55 ( element(g(X0),X0) | element(X0,n) | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_96,negated_conjecture,
% 0.20/0.55 ( element(g(X0),X0) | element(X0,n) | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_36]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_119,negated_conjecture,
% 0.20/0.55 ( element(g(X0),X0) | element(X0,n) | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_96]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_128,negated_conjecture,
% 0.20/0.55 ( element(g(X0),X0) | element(X0,n) | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_119]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_164,plain,
% 0.20/0.55 ( element(g(X0),X0) | element(X0,n) | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_128]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_5,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | element(X0,g(X0)) | X0 = n ),
% 0.20/0.55 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_69) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_38,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | element(X0,g(X0)) | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_97,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | element(X0,g(X0)) | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_38]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_118,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | element(X0,g(X0)) | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_97]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_129,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | element(X0,g(X0)) | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_118]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_166,negated_conjecture,
% 0.20/0.55 ( element(X0,n) | element(X0,g(X0)) | X0 = n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_129]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_903,plain,
% 0.20/0.55 ( element(f(X0),n)
% 0.20/0.55 | element(f(X0),m)
% 0.20/0.55 | ~ element(X0,m)
% 0.20/0.55 | f(X0) = n
% 0.20/0.55 | g(f(X0)) = m
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(forward_subsumption_resolution,
% 0.20/0.55 [status(thm)],
% 0.20/0.55 [c_791,c_164,c_166]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_904,plain,
% 0.20/0.55 ( element(f(X0),n)
% 0.20/0.55 | element(f(X0),m)
% 0.20/0.55 | ~ element(X0,m)
% 0.20/0.55 | f(X0) = n
% 0.20/0.55 | g(f(X0)) = m
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_903]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_366,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(f(n),n)
% 0.20/0.55 | ~ element(f(n),X0)
% 0.20/0.55 | ~ element(X0,f(n))
% 0.20/0.55 | n = m
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X0 = f(n) ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_156,c_168]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_367,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(f(n),n)
% 0.20/0.55 | ~ element(f(n),X0)
% 0.20/0.55 | ~ element(X0,f(n))
% 0.20/0.55 | n = m
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X0 = f(n) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_366]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_870,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(f(n),X0)
% 0.20/0.55 | ~ element(X0,f(n))
% 0.20/0.55 | n = m
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X0 = f(n) ),
% 0.20/0.55 inference(forward_subsumption_resolution,[status(thm)],[c_367,c_160]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_871,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(f(n),X0)
% 0.20/0.55 | ~ element(X0,f(n))
% 0.20/0.55 | n = m
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X0 = f(n) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_870]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_878,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(f(n),m)
% 0.20/0.55 | ~ element(f(n),f(f(n)))
% 0.20/0.55 | ~ element(f(f(n)),f(n))
% 0.20/0.55 | n = m
% 0.20/0.55 | f(n) = m
% 0.20/0.55 | f(f(n)) = n ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_871,c_168]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_879,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(f(n),m)
% 0.20/0.55 | ~ element(f(n),f(f(n)))
% 0.20/0.55 | ~ element(f(f(n)),f(n))
% 0.20/0.55 | n = m
% 0.20/0.55 | f(n) = m
% 0.20/0.55 | f(f(n)) = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_878]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_889,plain,
% 0.20/0.55 ( ~ element(n,m) | ~ element(f(n),m) | n = m | f(f(n)) = n ),
% 0.20/0.55 inference(forward_subsumption_resolution,
% 0.20/0.55 [status(thm)],
% 0.20/0.55 [c_879,c_170,c_160,c_162]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_890,plain,
% 0.20/0.55 ( ~ element(n,m) | ~ element(f(n),m) | n = m | f(f(n)) = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_889]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_348,plain,
% 0.20/0.55 ( ~ element(f(X0),X0)
% 0.20/0.55 | ~ element(X0,n)
% 0.20/0.55 | ~ element(X0,m)
% 0.20/0.55 | ~ element(X0,f(X0))
% 0.20/0.55 | f(X0) = n
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_156,c_168]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_349,plain,
% 0.20/0.55 ( ~ element(f(X0),X0)
% 0.20/0.55 | ~ element(X0,n)
% 0.20/0.55 | ~ element(X0,m)
% 0.20/0.55 | ~ element(X0,f(X0))
% 0.20/0.55 | f(X0) = n
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_348]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_799,plain,
% 0.20/0.55 ( ~ element(X0,n) | ~ element(X0,m) | f(X0) = n | X0 = n | X0 = m ),
% 0.20/0.55 inference(forward_subsumption_resolution,
% 0.20/0.55 [status(thm)],
% 0.20/0.55 [c_349,c_162,c_160]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_800,plain,
% 0.20/0.55 ( ~ element(X0,n) | ~ element(X0,m) | f(X0) = n | X0 = n | X0 = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_799]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_15,negated_conjecture,
% 0.20/0.55 ( m != n ),
% 0.20/0.55 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_79) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_58,negated_conjecture,
% 0.20/0.55 ( m != n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_107,negated_conjecture,
% 0.20/0.55 ( m != n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_58]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_108,negated_conjecture,
% 0.20/0.55 ( m != n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_107]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_139,negated_conjecture,
% 0.20/0.55 ( m != n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_108]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_186,negated_conjecture,
% 0.20/0.55 ( m != n ),
% 0.20/0.55 inference(copy,[status(esa)],[c_139]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_364,plain,
% 0.20/0.55 ( ~ element(m,X0) | ~ element(X0,n) | ~ element(X0,m) | m = X0 | X0 = n ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_156,c_186]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_365,plain,
% 0.20/0.55 ( ~ element(m,X0) | ~ element(X0,n) | ~ element(X0,m) | m = X0 | X0 = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_364]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_464,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(m,f(n))
% 0.20/0.55 | ~ element(f(n),n)
% 0.20/0.55 | ~ element(f(n),m)
% 0.20/0.55 | n = m
% 0.20/0.55 | m = f(n) ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_365,c_168]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_465,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(m,f(n))
% 0.20/0.55 | ~ element(f(n),n)
% 0.20/0.55 | ~ element(f(n),m)
% 0.20/0.55 | n = m
% 0.20/0.55 | m = f(n) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_464]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_749,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(m,f(n))
% 0.20/0.55 | ~ element(f(n),m)
% 0.20/0.55 | n = m
% 0.20/0.55 | m = f(n) ),
% 0.20/0.55 inference(forward_subsumption_resolution,[status(thm)],[c_465,c_160]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_750,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(m,f(n))
% 0.20/0.55 | ~ element(f(n),m)
% 0.20/0.55 | n = m
% 0.20/0.55 | m = f(n) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_749]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_360,plain,
% 0.20/0.55 ( element(n,n)
% 0.20/0.55 | ~ element(g(n),X0)
% 0.20/0.55 | ~ element(X0,n)
% 0.20/0.55 | ~ element(X0,g(n))
% 0.20/0.55 | n = n
% 0.20/0.55 | g(n) = X0
% 0.20/0.55 | X0 = n ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_156,c_176]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_361,plain,
% 0.20/0.55 ( element(n,n)
% 0.20/0.55 | ~ element(g(n),X0)
% 0.20/0.55 | ~ element(X0,n)
% 0.20/0.55 | ~ element(X0,g(n))
% 0.20/0.55 | n = n
% 0.20/0.55 | g(n) = X0
% 0.20/0.55 | X0 = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_360]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_731,plain,
% 0.20/0.55 ( ~ element(g(n),X0)
% 0.20/0.55 | ~ element(X0,n)
% 0.20/0.55 | ~ element(X0,g(n))
% 0.20/0.55 | n = n
% 0.20/0.55 | g(n) = X0
% 0.20/0.55 | X0 = n ),
% 0.20/0.55 inference(forward_subsumption_resolution,[status(thm)],[c_361,c_345]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_732,plain,
% 0.20/0.55 ( ~ element(g(n),X0)
% 0.20/0.55 | ~ element(X0,n)
% 0.20/0.55 | ~ element(X0,g(n))
% 0.20/0.55 | n = n
% 0.20/0.55 | g(n) = X0
% 0.20/0.55 | X0 = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_731]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_372,plain,
% 0.20/0.55 ( ~ element(m,n) | ~ element(m,X0) | ~ element(X0,m) | X0 = n | X0 = m ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_156,c_186]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_373,plain,
% 0.20/0.55 ( ~ element(m,n) | ~ element(m,X0) | ~ element(X0,m) | X0 = n | X0 = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_372]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_486,plain,
% 0.20/0.55 ( ~ element(m,n)
% 0.20/0.55 | ~ element(m,f(X0))
% 0.20/0.55 | ~ element(f(X0),m)
% 0.20/0.55 | ~ element(X0,m)
% 0.20/0.55 | f(X0) = n
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_373,c_170]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_487,plain,
% 0.20/0.55 ( ~ element(m,n)
% 0.20/0.55 | ~ element(m,f(X0))
% 0.20/0.55 | ~ element(f(X0),m)
% 0.20/0.55 | ~ element(X0,m)
% 0.20/0.55 | f(X0) = n
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_486]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_676,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(m,n)
% 0.20/0.55 | ~ element(m,f(n))
% 0.20/0.55 | ~ element(f(n),m)
% 0.20/0.55 | n = m ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_487,c_168]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_677,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(m,n)
% 0.20/0.55 | ~ element(m,f(n))
% 0.20/0.55 | ~ element(f(n),m)
% 0.20/0.55 | n = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_676]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_466,plain,
% 0.20/0.55 ( element(n,n)
% 0.20/0.55 | ~ element(m,g(n))
% 0.20/0.55 | ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),m)
% 0.20/0.55 | n = n
% 0.20/0.55 | m = g(n) ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_365,c_176]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_467,plain,
% 0.20/0.55 ( element(n,n)
% 0.20/0.55 | ~ element(m,g(n))
% 0.20/0.55 | ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),m)
% 0.20/0.55 | n = n
% 0.20/0.55 | m = g(n) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_466]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_645,plain,
% 0.20/0.55 ( ~ element(m,g(n))
% 0.20/0.55 | ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),m)
% 0.20/0.55 | n = n
% 0.20/0.55 | m = g(n) ),
% 0.20/0.55 inference(forward_subsumption_resolution,[status(thm)],[c_467,c_345]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_646,plain,
% 0.20/0.55 ( ~ element(m,g(n))
% 0.20/0.55 | ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),m)
% 0.20/0.55 | n = n
% 0.20/0.55 | m = g(n) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_645]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_346,plain,
% 0.20/0.55 ( ~ element(X0,n) | ~ element(X0,X0) | X0 = n | X0 = X0 ),
% 0.20/0.55 inference(factoring,[status(thm)],[c_156]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_347,plain,
% 0.20/0.55 ( ~ element(X0,n) | ~ element(X0,X0) | X0 = n | X0 = X0 ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_346]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_404,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(f(n),n)
% 0.20/0.55 | ~ element(f(n),f(n))
% 0.20/0.55 | n = m
% 0.20/0.55 | f(n) = f(n) ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_347,c_168]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_405,plain,
% 0.20/0.55 ( ~ element(n,m)
% 0.20/0.55 | ~ element(f(n),n)
% 0.20/0.55 | ~ element(f(n),f(n))
% 0.20/0.55 | n = m
% 0.20/0.55 | f(n) = f(n) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_404]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_619,plain,
% 0.20/0.55 ( ~ element(n,m) | ~ element(f(n),f(n)) | n = m | f(n) = f(n) ),
% 0.20/0.55 inference(forward_subsumption_resolution,[status(thm)],[c_405,c_160]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_620,plain,
% 0.20/0.55 ( ~ element(n,m) | ~ element(f(n),f(n)) | n = m | f(n) = f(n) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_619]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_314,plain,
% 0.20/0.55 ( element(n,m)
% 0.20/0.55 | ~ element(n,g(X0))
% 0.20/0.55 | ~ element(g(X0),n)
% 0.20/0.55 | element(X0,n)
% 0.20/0.55 | n = m
% 0.20/0.55 | g(X0) = m
% 0.20/0.55 | X0 = n ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_158,c_178]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_315,plain,
% 0.20/0.55 ( element(n,m)
% 0.20/0.55 | ~ element(n,g(X0))
% 0.20/0.55 | ~ element(g(X0),n)
% 0.20/0.55 | element(X0,n)
% 0.20/0.55 | n = m
% 0.20/0.55 | g(X0) = m
% 0.20/0.55 | X0 = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_314]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_540,plain,
% 0.20/0.55 ( element(n,m)
% 0.20/0.55 | ~ element(n,g(m))
% 0.20/0.55 | element(m,n)
% 0.20/0.55 | ~ element(g(m),n)
% 0.20/0.55 | n = m
% 0.20/0.55 | m = n ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_315,c_176]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_541,plain,
% 0.20/0.55 ( element(n,m)
% 0.20/0.55 | ~ element(n,g(m))
% 0.20/0.55 | element(m,n)
% 0.20/0.55 | ~ element(g(m),n)
% 0.20/0.55 | n = m
% 0.20/0.55 | m = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_540]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_607,plain,
% 0.20/0.55 ( element(n,m)
% 0.20/0.55 | ~ element(n,g(m))
% 0.20/0.55 | element(m,n)
% 0.20/0.55 | ~ element(g(m),n)
% 0.20/0.55 | n = m ),
% 0.20/0.55 inference(forward_subsumption_resolution,[status(thm)],[c_541,c_186]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_608,plain,
% 0.20/0.55 ( element(n,m)
% 0.20/0.55 | ~ element(n,g(m))
% 0.20/0.55 | element(m,n)
% 0.20/0.55 | ~ element(g(m),n)
% 0.20/0.55 | n = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_607]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_406,plain,
% 0.20/0.55 ( element(n,n)
% 0.20/0.55 | ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),g(n))
% 0.20/0.55 | n = n
% 0.20/0.55 | g(n) = g(n) ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_347,c_176]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_407,plain,
% 0.20/0.55 ( element(n,n)
% 0.20/0.55 | ~ element(g(n),n)
% 0.20/0.55 | ~ element(g(n),g(n))
% 0.20/0.55 | n = n
% 0.20/0.55 | g(n) = g(n) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_406]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_585,plain,
% 0.20/0.55 ( ~ element(g(n),n) | ~ element(g(n),g(n)) | n = n | g(n) = g(n) ),
% 0.20/0.55 inference(forward_subsumption_resolution,[status(thm)],[c_407,c_345]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_586,plain,
% 0.20/0.55 ( ~ element(g(n),n) | ~ element(g(n),g(n)) | n = n | g(n) = g(n) ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_585]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_312,plain,
% 0.20/0.55 ( ~ element(g(X0),X0)
% 0.20/0.55 | element(X0,n)
% 0.20/0.55 | element(X0,m)
% 0.20/0.55 | ~ element(X0,g(X0))
% 0.20/0.55 | g(X0) = m
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_158,c_176]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_313,plain,
% 0.20/0.55 ( ~ element(g(X0),X0)
% 0.20/0.55 | element(X0,n)
% 0.20/0.55 | element(X0,m)
% 0.20/0.55 | ~ element(X0,g(X0))
% 0.20/0.55 | g(X0) = m
% 0.20/0.55 | X0 = n
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_312]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_517,plain,
% 0.20/0.55 ( element(X0,n) | element(X0,m) | g(X0) = m | X0 = n | X0 = m ),
% 0.20/0.55 inference(forward_subsumption_resolution,
% 0.20/0.55 [status(thm)],
% 0.20/0.55 [c_313,c_166,c_164]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_518,plain,
% 0.20/0.55 ( element(X0,n) | element(X0,m) | g(X0) = m | X0 = n | X0 = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_517]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_524,plain,
% 0.20/0.55 ( element(m,n) | element(m,m) | m = n | m = m ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_518,c_176]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_525,plain,
% 0.20/0.55 ( element(m,n) | element(m,m) | m = n | m = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_524]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_565,plain,
% 0.20/0.55 ( element(m,n) | element(m,m) | m = m ),
% 0.20/0.55 inference(forward_subsumption_resolution,[status(thm)],[c_525,c_186]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_566,plain,
% 0.20/0.55 ( element(m,n) | element(m,m) | m = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_565]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_322,plain,
% 0.20/0.55 ( element(m,n)
% 0.20/0.55 | ~ element(g(m),X0)
% 0.20/0.55 | element(X0,m)
% 0.20/0.55 | ~ element(X0,g(m))
% 0.20/0.55 | m = n
% 0.20/0.55 | g(m) = X0
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_158,c_176]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_323,plain,
% 0.20/0.55 ( element(m,n)
% 0.20/0.55 | ~ element(g(m),X0)
% 0.20/0.55 | element(X0,m)
% 0.20/0.55 | ~ element(X0,g(m))
% 0.20/0.55 | m = n
% 0.20/0.55 | g(m) = X0
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_322]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_549,plain,
% 0.20/0.55 ( element(m,n)
% 0.20/0.55 | ~ element(g(m),X0)
% 0.20/0.55 | element(X0,m)
% 0.20/0.55 | ~ element(X0,g(m))
% 0.20/0.55 | g(m) = X0
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(forward_subsumption_resolution,[status(thm)],[c_323,c_186]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_550,plain,
% 0.20/0.55 ( element(m,n)
% 0.20/0.55 | ~ element(g(m),X0)
% 0.20/0.55 | element(X0,m)
% 0.20/0.55 | ~ element(X0,g(m))
% 0.20/0.55 | g(m) = X0
% 0.20/0.55 | X0 = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_549]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_8,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,k) | X0 = n | X0 = m | X0 = k ),
% 0.20/0.55 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_72) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_44,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,k) | X0 = n | X0 = m | X0 = k ),
% 0.20/0.55 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_100,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,k) | X0 = n | X0 = m | X0 = k ),
% 0.20/0.55 inference(copy,[status(esa)],[c_44]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_115,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,k) | X0 = n | X0 = m | X0 = k ),
% 0.20/0.55 inference(copy,[status(esa)],[c_100]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_132,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,k) | X0 = n | X0 = m | X0 = k ),
% 0.20/0.55 inference(copy,[status(esa)],[c_115]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_172,negated_conjecture,
% 0.20/0.55 ( ~ element(X0,k) | X0 = n | X0 = m | X0 = k ),
% 0.20/0.55 inference(copy,[status(esa)],[c_132]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_286,plain,
% 0.20/0.55 ( ~ element(f(k),k) | ~ element(k,m) | f(k) = n | f(k) = m | k = m ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_172,c_168]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_287,plain,
% 0.20/0.55 ( ~ element(f(k),k) | ~ element(k,m) | f(k) = n | f(k) = m | k = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_286]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_505,plain,
% 0.20/0.55 ( ~ element(k,m) | f(k) = n | k = m ),
% 0.20/0.55 inference(forward_subsumption_resolution,
% 0.20/0.55 [status(thm)],
% 0.20/0.55 [c_287,c_170,c_160]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_506,plain,
% 0.20/0.55 ( ~ element(k,m) | f(k) = n | k = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_505]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_288,plain,
% 0.20/0.55 ( ~ element(g(k),k) | element(k,n) | g(k) = n | g(k) = m | k = n ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_172,c_176]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_289,plain,
% 0.20/0.55 ( ~ element(g(k),k) | element(k,n) | g(k) = n | g(k) = m | k = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_288]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_495,plain,
% 0.20/0.55 ( element(k,n) | g(k) = m | k = n ),
% 0.20/0.55 inference(forward_subsumption_resolution,
% 0.20/0.55 [status(thm)],
% 0.20/0.55 [c_289,c_178,c_164]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_496,plain,
% 0.20/0.55 ( element(k,n) | g(k) = m | k = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_495]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_468,plain,
% 0.20/0.55 ( ~ element(m,g(X0))
% 0.20/0.55 | ~ element(g(X0),n)
% 0.20/0.55 | ~ element(g(X0),m)
% 0.20/0.55 | element(X0,n)
% 0.20/0.55 | m = g(X0)
% 0.20/0.55 | X0 = n ),
% 0.20/0.55 inference(resolution,[status(thm)],[c_365,c_178]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_469,plain,
% 0.20/0.55 ( ~ element(m,g(X0))
% 0.20/0.55 | ~ element(g(X0),n)
% 0.20/0.55 | ~ element(g(X0),m)
% 0.20/0.55 | element(X0,n)
% 0.20/0.55 | m = g(X0)
% 0.20/0.55 | X0 = n ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_468]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_302,plain,
% 0.20/0.55 ( element(m,m) | ~ element(m,X0) | ~ element(X0,m) | m = m | X0 = m ),
% 0.20/0.55 inference(factoring,[status(thm)],[c_158]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_303,plain,
% 0.20/0.55 ( element(m,m) | ~ element(m,X0) | ~ element(X0,m) | m = m | X0 = m ),
% 0.20/0.55 inference(rewriting,[status(thm)],[c_302]) ).
% 0.20/0.55
% 0.20/0.55 cnf(c_450,plain,
% 0.20/0.56 ( element(m,m)
% 0.20/0.56 | ~ element(m,f(X0))
% 0.20/0.56 | ~ element(f(X0),m)
% 0.20/0.56 | ~ element(X0,m)
% 0.20/0.56 | m = m
% 0.20/0.56 | X0 = m ),
% 0.20/0.56 inference(resolution,[status(thm)],[c_303,c_170]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_451,plain,
% 0.20/0.56 ( element(m,m)
% 0.20/0.56 | ~ element(m,f(X0))
% 0.20/0.56 | ~ element(f(X0),m)
% 0.20/0.56 | ~ element(X0,m)
% 0.20/0.56 | m = m
% 0.20/0.56 | X0 = m ),
% 0.20/0.56 inference(rewriting,[status(thm)],[c_450]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_9,negated_conjecture,
% 0.20/0.56 ( ~ element(X0,j) | X0 = k | X0 = j ),
% 0.20/0.56 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_73) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_46,negated_conjecture,
% 0.20/0.56 ( ~ element(X0,j) | X0 = k | X0 = j ),
% 0.20/0.56 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_101,negated_conjecture,
% 0.20/0.56 ( ~ element(X0,j) | X0 = k | X0 = j ),
% 0.20/0.56 inference(copy,[status(esa)],[c_46]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_114,negated_conjecture,
% 0.20/0.56 ( ~ element(X0,j) | X0 = k | X0 = j ),
% 0.20/0.56 inference(copy,[status(esa)],[c_101]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_133,negated_conjecture,
% 0.20/0.56 ( ~ element(X0,j) | X0 = k | X0 = j ),
% 0.20/0.56 inference(copy,[status(esa)],[c_114]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_174,negated_conjecture,
% 0.20/0.56 ( ~ element(X0,j) | X0 = k | X0 = j ),
% 0.20/0.56 inference(copy,[status(esa)],[c_133]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_269,plain,
% 0.20/0.56 ( ~ element(f(j),j) | ~ element(j,m) | f(j) = k | j = m ),
% 0.20/0.56 inference(resolution,[status(thm)],[c_168,c_174]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_270,plain,
% 0.20/0.56 ( ~ element(f(j),j) | ~ element(j,m) | f(j) = k | j = m ),
% 0.20/0.56 inference(rewriting,[status(thm)],[c_269]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_431,plain,
% 0.20/0.56 ( ~ element(j,m) | f(j) = k | j = m ),
% 0.20/0.56 inference(forward_subsumption_resolution,[status(thm)],[c_270,c_160]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_432,plain,
% 0.20/0.56 ( ~ element(j,m) | f(j) = k | j = m ),
% 0.20/0.56 inference(rewriting,[status(thm)],[c_431]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_249,plain,
% 0.20/0.56 ( ~ element(g(j),j) | element(j,n) | g(j) = k | j = n ),
% 0.20/0.56 inference(resolution,[status(thm)],[c_176,c_174]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_250,plain,
% 0.20/0.56 ( ~ element(g(j),j) | element(j,n) | g(j) = k | j = n ),
% 0.20/0.56 inference(rewriting,[status(thm)],[c_249]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_422,plain,
% 0.20/0.56 ( element(j,n) | g(j) = k | j = n ),
% 0.20/0.56 inference(forward_subsumption_resolution,[status(thm)],[c_250,c_164]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_423,plain,
% 0.20/0.56 ( element(j,n) | g(j) = k | j = n ),
% 0.20/0.56 inference(rewriting,[status(thm)],[c_422]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_410,plain,
% 0.20/0.56 ( ~ element(m,n) | ~ element(m,m) | m = m ),
% 0.20/0.56 inference(resolution,[status(thm)],[c_347,c_186]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_411,plain,
% 0.20/0.56 ( ~ element(m,n) | ~ element(m,m) | m = m ),
% 0.20/0.56 inference(rewriting,[status(thm)],[c_410]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_408,plain,
% 0.20/0.56 ( ~ element(g(X0),n)
% 0.20/0.56 | ~ element(g(X0),g(X0))
% 0.20/0.56 | element(X0,n)
% 0.20/0.56 | g(X0) = g(X0)
% 0.20/0.56 | X0 = n ),
% 0.20/0.56 inference(resolution,[status(thm)],[c_347,c_178]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_409,plain,
% 0.20/0.56 ( ~ element(g(X0),n)
% 0.20/0.56 | ~ element(g(X0),g(X0))
% 0.20/0.56 | element(X0,n)
% 0.20/0.56 | g(X0) = g(X0)
% 0.20/0.56 | X0 = n ),
% 0.20/0.56 inference(rewriting,[status(thm)],[c_408]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_306,plain,
% 0.20/0.56 ( element(X0,m) | ~ element(X0,X0) | X0 = m | X0 = X0 ),
% 0.20/0.56 inference(factoring,[status(thm)],[c_158]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_307,plain,
% 0.20/0.56 ( element(X0,m) | ~ element(X0,X0) | X0 = m | X0 = X0 ),
% 0.20/0.56 inference(rewriting,[status(thm)],[c_306]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_390,plain,
% 0.20/0.56 ( element(f(X0),m)
% 0.20/0.56 | ~ element(f(X0),f(X0))
% 0.20/0.56 | ~ element(X0,m)
% 0.20/0.56 | f(X0) = f(X0)
% 0.20/0.56 | X0 = m ),
% 0.20/0.56 inference(resolution,[status(thm)],[c_307,c_170]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_391,plain,
% 0.20/0.56 ( element(f(X0),m)
% 0.20/0.56 | ~ element(f(X0),f(X0))
% 0.20/0.56 | ~ element(X0,m)
% 0.20/0.56 | f(X0) = f(X0)
% 0.20/0.56 | X0 = m ),
% 0.20/0.56 inference(rewriting,[status(thm)],[c_390]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_362,plain,
% 0.20/0.56 ( ~ element(g(X0),X1)
% 0.20/0.56 | ~ element(X1,n)
% 0.20/0.56 | element(X0,n)
% 0.20/0.56 | ~ element(X1,g(X0))
% 0.20/0.56 | g(X0) = X1
% 0.20/0.56 | X1 = n
% 0.20/0.56 | X0 = n ),
% 0.20/0.56 inference(resolution,[status(thm)],[c_156,c_178]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_363,plain,
% 0.20/0.56 ( ~ element(g(X0),X1)
% 0.20/0.56 | ~ element(X1,n)
% 0.20/0.56 | element(X0,n)
% 0.20/0.56 | ~ element(X1,g(X0))
% 0.20/0.56 | g(X0) = X1
% 0.20/0.56 | X1 = n
% 0.20/0.56 | X0 = n ),
% 0.20/0.56 inference(rewriting,[status(thm)],[c_362]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_358,plain,
% 0.20/0.56 ( ~ element(n,m)
% 0.20/0.56 | ~ element(f(n),X0)
% 0.20/0.56 | ~ element(X0,n)
% 0.20/0.56 | ~ element(X0,f(n))
% 0.20/0.56 | n = m
% 0.20/0.56 | f(n) = X0
% 0.20/0.56 | X0 = n ),
% 0.20/0.56 inference(resolution,[status(thm)],[c_156,c_168]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_359,plain,
% 0.20/0.56 ( ~ element(n,m)
% 0.20/0.56 | ~ element(f(n),X0)
% 0.20/0.56 | ~ element(X0,n)
% 0.20/0.56 | ~ element(X0,f(n))
% 0.20/0.56 | n = m
% 0.20/0.56 | f(n) = X0
% 0.20/0.56 | X0 = n ),
% 0.20/0.56 inference(rewriting,[status(thm)],[c_358]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_320,plain,
% 0.20/0.56 ( ~ element(f(X0),X1)
% 0.20/0.56 | element(X1,m)
% 0.20/0.56 | ~ element(X0,m)
% 0.20/0.56 | ~ element(X1,f(X0))
% 0.20/0.56 | f(X0) = X1
% 0.20/0.56 | X1 = m
% 0.20/0.56 | X0 = m ),
% 0.20/0.56 inference(resolution,[status(thm)],[c_158,c_170]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_321,plain,
% 0.20/0.56 ( ~ element(f(X0),X1)
% 0.20/0.56 | element(X1,m)
% 0.20/0.56 | ~ element(X0,m)
% 0.20/0.56 | ~ element(X1,f(X0))
% 0.20/0.56 | f(X0) = X1
% 0.20/0.56 | X1 = m
% 0.20/0.56 | X0 = m ),
% 0.20/0.56 inference(rewriting,[status(thm)],[c_320]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_14,negated_conjecture,
% 0.20/0.56 ( element(X0,j) | X0 != k | X0 = j ),
% 0.20/0.56 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_78) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_56,negated_conjecture,
% 0.20/0.56 ( element(X0,j) | X0 != k | X0 = j ),
% 0.20/0.56 inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_106,negated_conjecture,
% 0.20/0.56 ( element(X0,j) | X0 != k | X0 = j ),
% 0.20/0.56 inference(copy,[status(esa)],[c_56]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_109,negated_conjecture,
% 0.20/0.56 ( element(X0,j) | X0 != k | X0 = j ),
% 0.20/0.56 inference(copy,[status(esa)],[c_106]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_138,negated_conjecture,
% 0.20/0.56 ( element(X0,j) | X0 != k | X0 = j ),
% 0.20/0.56 inference(copy,[status(esa)],[c_109]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_184,negated_conjecture,
% 0.20/0.56 ( element(X0,j) | X0 != k | X0 = j ),
% 0.20/0.56 inference(copy,[status(esa)],[c_138]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_13,negated_conjecture,
% 0.20/0.56 ( element(X0,k) | X0 != m | X0 = k ),
% 0.20/0.56 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_77) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_54,negated_conjecture,
% 0.20/0.56 ( element(X0,k) | X0 != m | X0 = k ),
% 0.20/0.56 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_105,negated_conjecture,
% 0.20/0.56 ( element(X0,k) | X0 != m | X0 = k ),
% 0.20/0.56 inference(copy,[status(esa)],[c_54]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_110,negated_conjecture,
% 0.20/0.56 ( element(X0,k) | X0 != m | X0 = k ),
% 0.20/0.56 inference(copy,[status(esa)],[c_105]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_137,negated_conjecture,
% 0.20/0.56 ( element(X0,k) | X0 != m | X0 = k ),
% 0.20/0.56 inference(copy,[status(esa)],[c_110]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_182,negated_conjecture,
% 0.20/0.56 ( element(X0,k) | X0 != m | X0 = k ),
% 0.20/0.56 inference(copy,[status(esa)],[c_137]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_12,negated_conjecture,
% 0.20/0.56 ( element(X0,k) | X0 != n | X0 = k ),
% 0.20/0.56 file('/export/starexec/sandbox2/tmp/iprover_modulo_85146d.p', c_0_76) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_52,negated_conjecture,
% 0.20/0.56 ( element(X0,k) | X0 != n | X0 = k ),
% 0.20/0.56 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_104,negated_conjecture,
% 0.20/0.56 ( element(X0,k) | X0 != n | X0 = k ),
% 0.20/0.56 inference(copy,[status(esa)],[c_52]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_111,negated_conjecture,
% 0.20/0.56 ( element(X0,k) | X0 != n | X0 = k ),
% 0.20/0.56 inference(copy,[status(esa)],[c_104]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_136,negated_conjecture,
% 0.20/0.56 ( element(X0,k) | X0 != n | X0 = k ),
% 0.20/0.56 inference(copy,[status(esa)],[c_111]) ).
% 0.20/0.56
% 0.20/0.56 cnf(c_180,negated_conjecture,
% 0.20/0.56 ( element(X0,k) | X0 != n | X0 = k ),
% 0.20/0.56 inference(copy,[status(esa)],[c_136]) ).
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 % ------ Statistics
% 0.20/0.56
% 0.20/0.56 % ------ General
% 0.20/0.56
% 0.20/0.56 % num_of_input_clauses: 16
% 0.20/0.56 % num_of_input_neg_conjectures: 16
% 0.20/0.56 % num_of_splits: 0
% 0.20/0.56 % num_of_split_atoms: 0
% 0.20/0.56 % num_of_sem_filtered_clauses: 0
% 0.20/0.56 % num_of_subtypes: 0
% 0.20/0.56 % monotx_restored_types: 0
% 0.20/0.56 % sat_num_of_epr_types: 0
% 0.20/0.56 % sat_num_of_non_cyclic_types: 0
% 0.20/0.56 % sat_guarded_non_collapsed_types: 0
% 0.20/0.56 % is_epr: 0
% 0.20/0.56 % is_horn: 0
% 0.20/0.56 % has_eq: 1
% 0.20/0.56 % num_pure_diseq_elim: 0
% 0.20/0.56 % simp_replaced_by: 0
% 0.20/0.56 % res_preprocessed: 32
% 0.20/0.56 % prep_upred: 0
% 0.20/0.56 % prep_unflattend: 0
% 0.20/0.56 % pred_elim_cands: 0
% 0.20/0.56 % pred_elim: 0
% 0.20/0.56 % pred_elim_cl: 0
% 0.20/0.56 % pred_elim_cycles: 0
% 0.20/0.56 % forced_gc_time: 0
% 0.20/0.56 % gc_basic_clause_elim: 0
% 0.20/0.56 % parsing_time: 0.
% 0.20/0.56 % sem_filter_time: 0.
% 0.20/0.56 % pred_elim_time: 0.
% 0.20/0.56 % out_proof_time: 0.
% 0.20/0.56 % monotx_time: 0.
% 0.20/0.56 % subtype_inf_time: 0.
% 0.20/0.56 % unif_index_cands_time: 0.
% 0.20/0.56 % unif_index_add_time: 0.
% 0.20/0.56 % total_time: 0.053
% 0.20/0.56 % num_of_symbols: 32
% 0.20/0.56 % num_of_terms: 325
% 0.20/0.56
% 0.20/0.56 % ------ Propositional Solver
% 0.20/0.56
% 0.20/0.56 % prop_solver_calls: 1
% 0.20/0.56 % prop_fast_solver_calls: 159
% 0.20/0.56 % prop_num_of_clauses: 28
% 0.20/0.56 % prop_preprocess_simplified: 282
% 0.20/0.56 % prop_fo_subsumed: 0
% 0.20/0.56 % prop_solver_time: 0.
% 0.20/0.56 % prop_fast_solver_time: 0.
% 0.20/0.56 % prop_unsat_core_time: 0.
% 0.20/0.56
% 0.20/0.56 % ------ QBF
% 0.20/0.56
% 0.20/0.56 % qbf_q_res: 0
% 0.20/0.56 % qbf_num_tautologies: 0
% 0.20/0.56 % qbf_prep_cycles: 0
% 0.20/0.56
% 0.20/0.56 % ------ BMC1
% 0.20/0.56
% 0.20/0.56 % bmc1_current_bound: -1
% 0.20/0.56 % bmc1_last_solved_bound: -1
% 0.20/0.56 % bmc1_unsat_core_size: -1
% 0.20/0.56 % bmc1_unsat_core_parents_size: -1
% 0.20/0.56 % bmc1_merge_next_fun: 0
% 0.20/0.56 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.56
% 0.20/0.56 % ------ Instantiation
% 0.20/0.56
% 0.20/0.56 % inst_num_of_clauses: 16
% 0.20/0.56 % inst_num_in_passive: 0
% 0.20/0.56 % inst_num_in_active: 0
% 0.20/0.56 % inst_num_in_unprocessed: 16
% 0.20/0.56 % inst_num_of_loops: 0
% 0.20/0.56 % inst_num_of_learning_restarts: 0
% 0.20/0.56 % inst_num_moves_active_passive: 0
% 0.20/0.56 % inst_lit_activity: 0
% 0.20/0.56 % inst_lit_activity_moves: 0
% 0.20/0.56 % inst_num_tautologies: 0
% 0.20/0.56 % inst_num_prop_implied: 0
% 0.20/0.56 % inst_num_existing_simplified: 0
% 0.20/0.56 % inst_num_eq_res_simplified: 0
% 0.20/0.56 % inst_num_child_elim: 0
% 0.20/0.56 % inst_num_of_dismatching_blockings: 0
% 0.20/0.56 % inst_num_of_non_proper_insts: 0
% 0.20/0.56 % inst_num_of_duplicates: 0
% 0.20/0.56 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.56 % inst_dismatching_checking_time: 0.
% 0.20/0.56
% 0.20/0.56 % ------ Resolution
% 0.20/0.56
% 0.20/0.56 % res_num_of_clauses: 55
% 0.20/0.56 % res_num_in_passive: 0
% 0.20/0.56 % res_num_in_active: 55
% 0.20/0.56 % res_num_of_loops: 79
% 0.20/0.56 % res_forward_subset_subsumed: 6
% 0.20/0.56 % res_backward_subset_subsumed: 0
% 0.20/0.56 % res_forward_subsumed: 22
% 0.20/0.56 % res_backward_subsumed: 1
% 0.20/0.56 % res_forward_subsumption_resolution: 29
% 0.20/0.56 % res_backward_subsumption_resolution: 0
% 0.20/0.56 % res_clause_to_clause_subsumption: 753
% 0.20/0.56 % res_orphan_elimination: 0
% 0.20/0.56 % res_tautology_del: 18
% 0.20/0.56 % res_num_eq_res_simplified: 0
% 0.20/0.56 % res_num_sel_changes: 0
% 0.20/0.56 % res_moves_from_active_to_pass: 0
% 0.20/0.56
% 0.20/0.56 % Status Unknown
% 0.20/0.56 % Last status :
% 0.20/0.56 % SZS status Unknown
%------------------------------------------------------------------------------