TSTP Solution File: TOP001-2 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : TOP001-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 21:26:56 EDT 2022
% Result : Unknown 0.20s 0.50s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : TOP001-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : iprover_modulo %s %d
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun May 29 14:24:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Running in mono-core mode
% 0.12/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.12/0.40 % Orientation found
% 0.12/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_9bd0a3.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_bc877f.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_dba08c | 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/sandbox/tmp/iprover_proof_9bd0a3.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 false
% 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.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/sandbox/tmp/iprover_proof_9bd0a3.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
% 0.20/0.42
% 0.20/0.42 % ------ Proving...
% 0.20/0.42 % warning: shown sat in sat incomplete mode
% 0.20/0.42 %
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 cnf(c_25,negated_conjecture,
% 0.20/0.42 ( ~ subset_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_8) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_34,negated_conjecture,
% 0.20/0.42 ( ~ subset_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_25]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_42,negated_conjecture,
% 0.20/0.42 ( ~ subset_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_34]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_45,negated_conjecture,
% 0.20/0.42 ( ~ subset_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_42]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_46,negated_conjecture,
% 0.20/0.42 ( ~ subset_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_45]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_125,negated_conjecture,
% 0.20/0.42 ( ~ subset_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_46]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_6,plain,
% 0.20/0.42 ( ~ element_of_set(in_1st_set(X0,X1),X1) | subset_sets(X0,X1) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_42_0) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_87,plain,
% 0.20/0.42 ( ~ element_of_set(in_1st_set(X0,X1),X1) | subset_sets(X0,X1) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_134,plain,
% 0.20/0.42 ( ~ element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),cx) ),
% 0.20/0.42 inference(resolution,[status(thm)],[c_125,c_87]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_135,plain,
% 0.20/0.42 ( ~ element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),cx) ),
% 0.20/0.42 inference(rewriting,[status(thm)],[c_134]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_22,plain,
% 0.20/0.42 ( ~ equal_sets(X0,X1) | subset_sets(X0,X1) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_49_0) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_119,plain,
% 0.20/0.42 ( ~ equal_sets(X0,X1) | subset_sets(X0,X1) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_22]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_120,plain,
% 0.20/0.42 ( subset_sets(X0,X1) | ~ equal_sets(X0,X1) ),
% 0.20/0.42 inference(rewriting,[status(thm)],[c_119]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_133,plain,
% 0.20/0.42 ( ~ equal_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.42 inference(resolution,[status(thm)],[c_125,c_120]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_136,plain,
% 0.20/0.42 ( ~ equal_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.42 inference(rewriting,[status(thm)],[c_133]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_15,plain,
% 0.20/0.42 ( ~ subset_sets(X0,X1)
% 0.20/0.42 | ~ element_of_set(X2,X0)
% 0.20/0.42 | element_of_set(X2,X1) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_46_0) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_105,plain,
% 0.20/0.42 ( ~ subset_sets(X0,X1)
% 0.20/0.42 | ~ element_of_set(X2,X0)
% 0.20/0.42 | element_of_set(X2,X1) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_106,plain,
% 0.20/0.42 ( ~ element_of_set(X0,X1)
% 0.20/0.42 | element_of_set(X0,X2)
% 0.20/0.42 | ~ subset_sets(X1,X2) ),
% 0.20/0.42 inference(rewriting,[status(thm)],[c_105]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_12,plain,
% 0.20/0.42 ( ~ element_of_set(X0,X1)
% 0.20/0.42 | ~ element_of_collection(X1,X2)
% 0.20/0.42 | element_of_set(X0,union_of_members(X2)) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_45_0) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_99,plain,
% 0.20/0.42 ( ~ element_of_set(X0,X1)
% 0.20/0.42 | ~ element_of_collection(X1,X2)
% 0.20/0.42 | element_of_set(X0,union_of_members(X2)) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_100,plain,
% 0.20/0.42 ( element_of_set(X0,union_of_members(X1))
% 0.20/0.42 | ~ element_of_set(X0,X2)
% 0.20/0.42 | ~ element_of_collection(X2,X1) ),
% 0.20/0.42 inference(rewriting,[status(thm)],[c_99]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_3,plain,
% 0.20/0.42 ( ~ element_of_collection(X0,top_of_basis(X1))
% 0.20/0.42 | ~ element_of_set(X2,X0)
% 0.20/0.42 | element_of_collection(f10(X1,X0,X2),X1) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_41_0) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_81,plain,
% 0.20/0.42 ( ~ element_of_collection(X0,top_of_basis(X1))
% 0.20/0.42 | ~ element_of_set(X2,X0)
% 0.20/0.42 | element_of_collection(f10(X1,X0,X2),X1) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_82,plain,
% 0.20/0.42 ( ~ element_of_set(X0,X1)
% 0.20/0.42 | element_of_collection(f10(X2,X1,X0),X2)
% 0.20/0.42 | ~ element_of_collection(X1,top_of_basis(X2)) ),
% 0.20/0.42 inference(rewriting,[status(thm)],[c_81]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_26,negated_conjecture,
% 0.20/0.42 ( basis(cx,f) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_9) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_36,negated_conjecture,
% 0.20/0.42 ( basis(cx,f) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_26]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_43,negated_conjecture,
% 0.20/0.42 ( basis(cx,f) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_36]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_44,negated_conjecture,
% 0.20/0.42 ( basis(cx,f) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_43]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_47,negated_conjecture,
% 0.20/0.42 ( basis(cx,f) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_44]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_127,negated_conjecture,
% 0.20/0.42 ( basis(cx,f) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_47]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_24,plain,
% 0.20/0.42 ( subset_sets(X0,X0) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_4_0) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_123,plain,
% 0.20/0.42 ( subset_sets(X0,X0) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_24]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_20,plain,
% 0.20/0.42 ( ~ basis(X0,X1) | equal_sets(union_of_members(X1),X0) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_48_0) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_115,plain,
% 0.20/0.42 ( ~ basis(X0,X1) | equal_sets(union_of_members(X1),X0) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_20]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_116,plain,
% 0.20/0.42 ( equal_sets(union_of_members(X0),X1) | ~ basis(X1,X0) ),
% 0.20/0.42 inference(rewriting,[status(thm)],[c_115]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_18,plain,
% 0.20/0.42 ( subset_sets(X0,X1) | element_of_set(in_1st_set(X0,X1),X0) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_47_0) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_111,plain,
% 0.20/0.42 ( subset_sets(X0,X1) | element_of_set(in_1st_set(X0,X1),X0) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_18]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_112,plain,
% 0.20/0.42 ( element_of_set(in_1st_set(X0,X1),X0) | subset_sets(X0,X1) ),
% 0.20/0.42 inference(rewriting,[status(thm)],[c_111]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_16,plain,
% 0.20/0.42 ( ~ subset_sets(X0,X1)
% 0.20/0.42 | element_of_set(X2,X1)
% 0.20/0.42 | ~ element_of_set(X2,X0) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_46_1) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_107,plain,
% 0.20/0.42 ( ~ subset_sets(X0,X1)
% 0.20/0.42 | element_of_set(X2,X1)
% 0.20/0.42 | ~ element_of_set(X2,X0) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_108,plain,
% 0.20/0.42 ( element_of_set(X0,X1)
% 0.20/0.42 | ~ element_of_set(X0,X2)
% 0.20/0.42 | ~ subset_sets(X2,X1) ),
% 0.20/0.42 inference(rewriting,[status(thm)],[c_107]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_10,plain,
% 0.20/0.42 ( ~ element_of_set(X0,union_of_members(X1))
% 0.20/0.42 | element_of_collection(f1(X1,X0),X1) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_44_0) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_95,plain,
% 0.20/0.42 ( ~ element_of_set(X0,union_of_members(X1))
% 0.20/0.42 | element_of_collection(f1(X1,X0),X1) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_8,plain,
% 0.20/0.42 ( ~ element_of_set(X0,union_of_members(X1))
% 0.20/0.42 | element_of_set(X0,f1(X1,X0)) ),
% 0.20/0.42 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_43_0) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_91,plain,
% 0.20/0.42 ( ~ element_of_set(X0,union_of_members(X1))
% 0.20/0.42 | element_of_set(X0,f1(X1,X0)) ),
% 0.20/0.42 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.42
% 0.20/0.42 cnf(c_92,plain,
% 0.20/0.42 ( element_of_set(X0,f1(X1,X0))
% 0.20/0.42 | ~ element_of_set(X0,union_of_members(X1)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_91]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_0,plain,
% 0.20/0.43 ( ~ element_of_collection(X0,top_of_basis(X1))
% 0.20/0.43 | ~ element_of_set(X2,X0)
% 0.20/0.43 | element_of_set(X2,f10(X1,X0,X2)) ),
% 0.20/0.43 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_40_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_75,plain,
% 0.20/0.43 ( ~ element_of_collection(X0,top_of_basis(X1))
% 0.20/0.43 | ~ element_of_set(X2,X0)
% 0.20/0.43 | element_of_set(X2,f10(X1,X0,X2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_76,plain,
% 0.20/0.43 ( element_of_set(X0,f10(X1,X2,X0))
% 0.20/0.43 | ~ element_of_set(X0,X2)
% 0.20/0.43 | ~ element_of_collection(X2,top_of_basis(X1)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_75]) ).
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 27
% 0.20/0.43 % num_of_input_neg_conjectures: 2
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 0
% 0.20/0.43 % is_horn: 0
% 0.20/0.43 % has_eq: 0
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 4
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 0
% 0.20/0.43 % pred_elim: 0
% 0.20/0.43 % pred_elim_cl: 0
% 0.20/0.43 % pred_elim_cycles: 0
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % unif_index_add_time: 0.
% 0.20/0.43 % total_time: 0.023
% 0.20/0.43 % num_of_symbols: 37
% 0.20/0.43 % num_of_terms: 125
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 1
% 0.20/0.43 % prop_fast_solver_calls: 6
% 0.20/0.43 % prop_num_of_clauses: 26
% 0.20/0.43 % prop_preprocess_simplified: 94
% 0.20/0.43 % prop_fo_subsumed: 0
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: 27
% 0.20/0.43 % inst_num_in_passive: 0
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 27
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: 32
% 0.20/0.43 % res_num_in_passive: 0
% 0.20/0.43 % res_num_in_active: 16
% 0.20/0.43 % res_num_of_loops: 7
% 0.20/0.43 % res_forward_subset_subsumed: 13
% 0.20/0.43 % res_backward_subset_subsumed: 0
% 0.20/0.43 % res_forward_subsumed: 2
% 0.20/0.43 % res_backward_subsumed: 0
% 0.20/0.43 % res_forward_subsumption_resolution: 0
% 0.20/0.43 % res_backward_subsumption_resolution: 0
% 0.20/0.43 % res_clause_to_clause_subsumption: 3
% 0.20/0.43 % res_orphan_elimination: 0
% 0.20/0.43 % res_tautology_del: 0
% 0.20/0.43 % res_num_eq_res_simplified: 0
% 0.20/0.43 % res_num_sel_changes: 0
% 0.20/0.43 % res_moves_from_active_to_pass: 0
% 0.20/0.43
% 0.20/0.43 % Status Unknown
% 0.20/0.46 % Orienting using strategy ClausalAll
% 0.20/0.46 % Orientation found
% 0.20/0.46 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_9bd0a3.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_bc877f.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_4ed5f9 | grep -v "SZS"
% 0.20/0.49
% 0.20/0.49 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.49
% 0.20/0.49 %
% 0.20/0.49 % ------ iProver source info
% 0.20/0.49
% 0.20/0.49 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.49 % git: non_committed_changes: true
% 0.20/0.49 % git: last_make_outside_of_git: true
% 0.20/0.49
% 0.20/0.49 %
% 0.20/0.49 % ------ Input Options
% 0.20/0.49
% 0.20/0.49 % --out_options all
% 0.20/0.49 % --tptp_safe_out true
% 0.20/0.49 % --problem_path ""
% 0.20/0.49 % --include_path ""
% 0.20/0.49 % --clausifier .//eprover
% 0.20/0.49 % --clausifier_options --tstp-format
% 0.20/0.49 % --stdin false
% 0.20/0.49 % --dbg_backtrace false
% 0.20/0.49 % --dbg_dump_prop_clauses false
% 0.20/0.49 % --dbg_dump_prop_clauses_file -
% 0.20/0.49 % --dbg_out_stat false
% 0.20/0.49
% 0.20/0.49 % ------ General Options
% 0.20/0.49
% 0.20/0.49 % --fof false
% 0.20/0.49 % --time_out_real 150.
% 0.20/0.49 % --time_out_prep_mult 0.2
% 0.20/0.49 % --time_out_virtual -1.
% 0.20/0.49 % --schedule none
% 0.20/0.49 % --ground_splitting input
% 0.20/0.49 % --splitting_nvd 16
% 0.20/0.49 % --non_eq_to_eq false
% 0.20/0.49 % --prep_gs_sim true
% 0.20/0.49 % --prep_unflatten false
% 0.20/0.49 % --prep_res_sim true
% 0.20/0.49 % --prep_upred true
% 0.20/0.49 % --res_sim_input true
% 0.20/0.49 % --clause_weak_htbl true
% 0.20/0.49 % --gc_record_bc_elim false
% 0.20/0.49 % --symbol_type_check false
% 0.20/0.49 % --clausify_out false
% 0.20/0.49 % --large_theory_mode false
% 0.20/0.49 % --prep_sem_filter none
% 0.20/0.49 % --prep_sem_filter_out false
% 0.20/0.49 % --preprocessed_out false
% 0.20/0.49 % --sub_typing false
% 0.20/0.49 % --brand_transform false
% 0.20/0.49 % --pure_diseq_elim true
% 0.20/0.49 % --min_unsat_core false
% 0.20/0.49 % --pred_elim true
% 0.20/0.49 % --add_important_lit false
% 0.20/0.49 % --soft_assumptions false
% 0.20/0.49 % --reset_solvers false
% 0.20/0.49 % --bc_imp_inh []
% 0.20/0.49 % --conj_cone_tolerance 1.5
% 0.20/0.49 % --prolific_symb_bound 500
% 0.20/0.49 % --lt_threshold 2000
% 0.20/0.49
% 0.20/0.49 % ------ SAT Options
% 0.20/0.49
% 0.20/0.49 % --sat_mode false
% 0.20/0.49 % --sat_fm_restart_options ""
% 0.20/0.49 % --sat_gr_def false
% 0.20/0.49 % --sat_epr_types true
% 0.20/0.49 % --sat_non_cyclic_types false
% 0.20/0.49 % --sat_finite_models false
% 0.20/0.49 % --sat_fm_lemmas false
% 0.20/0.49 % --sat_fm_prep false
% 0.20/0.49 % --sat_fm_uc_incr true
% 0.20/0.49 % --sat_out_model small
% 0.20/0.49 % --sat_out_clauses false
% 0.20/0.49
% 0.20/0.49 % ------ QBF Options
% 0.20/0.49
% 0.20/0.49 % --qbf_mode false
% 0.20/0.49 % --qbf_elim_univ true
% 0.20/0.49 % --qbf_sk_in true
% 0.20/0.49 % --qbf_pred_elim true
% 0.20/0.49 % --qbf_split 32
% 0.20/0.49
% 0.20/0.49 % ------ BMC1 Options
% 0.20/0.49
% 0.20/0.49 % --bmc1_incremental false
% 0.20/0.49 % --bmc1_axioms reachable_all
% 0.20/0.49 % --bmc1_min_bound 0
% 0.20/0.49 % --bmc1_max_bound -1
% 0.20/0.49 % --bmc1_max_bound_default -1
% 0.20/0.49 % --bmc1_symbol_reachability true
% 0.20/0.49 % --bmc1_property_lemmas false
% 0.20/0.49 % --bmc1_k_induction false
% 0.20/0.49 % --bmc1_non_equiv_states false
% 0.20/0.49 % --bmc1_deadlock false
% 0.20/0.49 % --bmc1_ucm false
% 0.20/0.49 % --bmc1_add_unsat_core none
% 0.20/0.49 % --bmc1_unsat_core_children false
% 0.20/0.49 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.49 % --bmc1_out_stat full
% 0.20/0.49 % --bmc1_ground_init false
% 0.20/0.49 % --bmc1_pre_inst_next_state false
% 0.20/0.49 % --bmc1_pre_inst_state false
% 0.20/0.49 % --bmc1_pre_inst_reach_state false
% 0.20/0.49 % --bmc1_out_unsat_core false
% 0.20/0.49 % --bmc1_aig_witness_out false
% 0.20/0.49 % --bmc1_verbose false
% 0.20/0.49 % --bmc1_dump_clauses_tptp false
% 0.20/0.49 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.49 % --bmc1_dump_file -
% 0.20/0.49 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.49 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.49 % --bmc1_ucm_extend_mode 1
% 0.20/0.49 % --bmc1_ucm_init_mode 2
% 0.20/0.49 % --bmc1_ucm_cone_mode none
% 0.20/0.49 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.49 % --bmc1_ucm_relax_model 4
% 0.20/0.49 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.49 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.49 % --bmc1_ucm_layered_model none
% 0.20/0.49 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.49
% 0.20/0.49 % ------ AIG Options
% 0.20/0.49
% 0.20/0.49 % --aig_mode false
% 0.20/0.49
% 0.20/0.49 % ------ Instantiation Options
% 0.20/0.49
% 0.20/0.49 % --instantiation_flag true
% 0.20/0.49 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.49 % --inst_solver_per_active 750
% 0.20/0.49 % --inst_solver_calls_frac 0.5
% 0.20/0.49 % --inst_passive_queue_type priority_queues
% 0.20/0.49 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.49 % --inst_passive_queues_freq [25;2]
% 0.20/0.49 % --inst_dismatching true
% 0.20/0.49 % --inst_eager_unprocessed_to_passive true
% 0.20/0.49 % --inst_prop_sim_given true
% 0.20/0.49 % --inst_prop_sim_new false
% 0.20/0.49 % --inst_orphan_elimination true
% 0.20/0.49 % --inst_learning_loop_flag true
% 0.20/0.49 % --inst_learning_start 3000
% 0.20/0.49 % --inst_learning_factor 2
% 0.20/0.49 % --inst_start_prop_sim_after_learn 3
% 0.20/0.49 % --inst_sel_renew solver
% 0.20/0.49 % --inst_lit_activity_flag true
% 0.20/0.49 % --inst_out_proof true
% 0.20/0.49
% 0.20/0.49 % ------ Resolution Options
% 0.20/0.49
% 0.20/0.49 % --resolution_flag true
% 0.20/0.49 % --res_lit_sel kbo_max
% 0.20/0.49 % --res_to_prop_solver none
% 0.20/0.49 % --res_prop_simpl_new false
% 0.20/0.49 % --res_prop_simpl_given false
% 0.20/0.49 % --res_passive_queue_type priority_queues
% 0.20/0.49 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.49 % --res_passive_queues_freq [15;5]
% 0.20/0.49 % --res_forward_subs full
% 0.20/0.49 % --res_backward_subs full
% 0.20/0.49 % --res_forward_subs_resolution true
% 0.20/0.49 % --res_backward_subs_resolution true
% 0.20/0.49 % --res_orphan_elimination false
% 0.20/0.49 % --res_time_limit 1000.
% 0.20/0.49 % --res_out_proof true
% 0.20/0.49 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_9bd0a3.s
% 0.20/0.49 % --modulo true
% 0.20/0.49
% 0.20/0.49 % ------ Combination Options
% 0.20/0.49
% 0.20/0.49 % --comb_res_mult 1000
% 0.20/0.49 % --comb_inst_mult 300
% 0.20/0.49 % ------
% 0.20/0.49
% 0.20/0.49 % ------ Parsing...% successful
% 0.20/0.49
% 0.20/0.49 % ------ 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.49
% 0.20/0.49 % ------ Proving...
% 0.20/0.49 % ------ Problem Properties
% 0.20/0.49
% 0.20/0.49 %
% 0.20/0.49 % EPR false
% 0.20/0.49 % Horn false
% 0.20/0.49 % Has equality false
% 0.20/0.49
% 0.20/0.49 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 % % ------ Current options:
% 0.20/0.49
% 0.20/0.49 % ------ Input Options
% 0.20/0.49
% 0.20/0.49 % --out_options all
% 0.20/0.49 % --tptp_safe_out true
% 0.20/0.49 % --problem_path ""
% 0.20/0.49 % --include_path ""
% 0.20/0.49 % --clausifier .//eprover
% 0.20/0.49 % --clausifier_options --tstp-format
% 0.20/0.49 % --stdin false
% 0.20/0.49 % --dbg_backtrace false
% 0.20/0.49 % --dbg_dump_prop_clauses false
% 0.20/0.49 % --dbg_dump_prop_clauses_file -
% 0.20/0.49 % --dbg_out_stat false
% 0.20/0.49
% 0.20/0.49 % ------ General Options
% 0.20/0.49
% 0.20/0.49 % --fof false
% 0.20/0.49 % --time_out_real 150.
% 0.20/0.49 % --time_out_prep_mult 0.2
% 0.20/0.49 % --time_out_virtual -1.
% 0.20/0.49 % --schedule none
% 0.20/0.49 % --ground_splitting input
% 0.20/0.49 % --splitting_nvd 16
% 0.20/0.49 % --non_eq_to_eq false
% 0.20/0.49 % --prep_gs_sim true
% 0.20/0.49 % --prep_unflatten false
% 0.20/0.49 % --prep_res_sim true
% 0.20/0.49 % --prep_upred true
% 0.20/0.49 % --res_sim_input true
% 0.20/0.49 % --clause_weak_htbl true
% 0.20/0.49 % --gc_record_bc_elim false
% 0.20/0.49 % --symbol_type_check false
% 0.20/0.49 % --clausify_out false
% 0.20/0.49 % --large_theory_mode false
% 0.20/0.49 % --prep_sem_filter none
% 0.20/0.49 % --prep_sem_filter_out false
% 0.20/0.49 % --preprocessed_out false
% 0.20/0.49 % --sub_typing false
% 0.20/0.49 % --brand_transform false
% 0.20/0.49 % --pure_diseq_elim true
% 0.20/0.49 % --min_unsat_core false
% 0.20/0.49 % --pred_elim true
% 0.20/0.49 % --add_important_lit false
% 0.20/0.49 % --soft_assumptions false
% 0.20/0.49 % --reset_solvers false
% 0.20/0.49 % --bc_imp_inh []
% 0.20/0.49 % --conj_cone_tolerance 1.5
% 0.20/0.49 % --prolific_symb_bound 500
% 0.20/0.49 % --lt_threshold 2000
% 0.20/0.49
% 0.20/0.49 % ------ SAT Options
% 0.20/0.49
% 0.20/0.49 % --sat_mode false
% 0.20/0.49 % --sat_fm_restart_options ""
% 0.20/0.49 % --sat_gr_def false
% 0.20/0.49 % --sat_epr_types true
% 0.20/0.49 % --sat_non_cyclic_types false
% 0.20/0.49 % --sat_finite_models false
% 0.20/0.49 % --sat_fm_lemmas false
% 0.20/0.49 % --sat_fm_prep false
% 0.20/0.49 % --sat_fm_uc_incr true
% 0.20/0.49 % --sat_out_model small
% 0.20/0.49 % --sat_out_clauses false
% 0.20/0.49
% 0.20/0.49 % ------ QBF Options
% 0.20/0.49
% 0.20/0.49 % --qbf_mode false
% 0.20/0.49 % --qbf_elim_univ true
% 0.20/0.49 % --qbf_sk_in true
% 0.20/0.49 % --qbf_pred_elim true
% 0.20/0.49 % --qbf_split 32
% 0.20/0.49
% 0.20/0.49 % ------ BMC1 Options
% 0.20/0.49
% 0.20/0.49 % --bmc1_incremental false
% 0.20/0.49 % --bmc1_axioms reachable_all
% 0.20/0.49 % --bmc1_min_bound 0
% 0.20/0.49 % --bmc1_max_bound -1
% 0.20/0.49 % --bmc1_max_bound_default -1
% 0.20/0.49 % --bmc1_symbol_reachability true
% 0.20/0.49 % --bmc1_property_lemmas false
% 0.20/0.49 % --bmc1_k_induction false
% 0.20/0.49 % --bmc1_non_equiv_states false
% 0.20/0.49 % --bmc1_deadlock false
% 0.20/0.49 % --bmc1_ucm false
% 0.20/0.49 % --bmc1_add_unsat_core none
% 0.20/0.49 % --bmc1_unsat_core_children false
% 0.20/0.49 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.49 % --bmc1_out_stat full
% 0.20/0.49 % --bmc1_ground_init false
% 0.20/0.49 % --bmc1_pre_inst_next_state false
% 0.20/0.49 % --bmc1_pre_inst_state false
% 0.20/0.49 % --bmc1_pre_inst_reach_state false
% 0.20/0.49 % --bmc1_out_unsat_core false
% 0.20/0.49 % --bmc1_aig_witness_out false
% 0.20/0.49 % --bmc1_verbose false
% 0.20/0.49 % --bmc1_dump_clauses_tptp false
% 0.20/0.49 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.49 % --bmc1_dump_file -
% 0.20/0.49 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.49 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.49 % --bmc1_ucm_extend_mode 1
% 0.20/0.49 % --bmc1_ucm_init_mode 2
% 0.20/0.49 % --bmc1_ucm_cone_mode none
% 0.20/0.49 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.49 % --bmc1_ucm_relax_model 4
% 0.20/0.49 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.49 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.49 % --bmc1_ucm_layered_model none
% 0.20/0.49 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.49
% 0.20/0.49 % ------ AIG Options
% 0.20/0.49
% 0.20/0.49 % --aig_mode false
% 0.20/0.49
% 0.20/0.49 % ------ Instantiation Options
% 0.20/0.49
% 0.20/0.49 % --instantiation_flag true
% 0.20/0.49 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.49 % --inst_solver_per_active 750
% 0.20/0.49 % --inst_solver_calls_frac 0.5
% 0.20/0.49 % --inst_passive_queue_type priority_queues
% 0.20/0.49 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.49 % --inst_passive_queues_freq [25;2]
% 0.20/0.49 % --inst_dismatching true
% 0.20/0.49 % --inst_eager_unprocessed_to_passive true
% 0.20/0.49 % --inst_prop_sim_given true
% 0.20/0.49 % --inst_prop_sim_new false
% 0.20/0.49 % --inst_orphan_elimination true
% 0.20/0.49 % --inst_learning_loop_flag true
% 0.20/0.49 % --inst_learning_start 3000
% 0.20/0.49 % --inst_learning_factor 2
% 0.20/0.49 % --inst_start_prop_sim_after_learn 3
% 0.20/0.49 % --inst_sel_renew solver
% 0.20/0.49 % --inst_lit_activity_flag true
% 0.20/0.49 % --inst_out_proof true
% 0.20/0.49
% 0.20/0.49 % ------ Resolution Options
% 0.20/0.49
% 0.20/0.49 % --resolution_flag true
% 0.20/0.49 % --res_lit_sel kbo_max
% 0.20/0.49 % --res_to_prop_solver none
% 0.20/0.49 % --res_prop_simpl_new false
% 0.20/0.49 % --res_prop_simpl_given false
% 0.20/0.49 % --res_passive_queue_type priority_queues
% 0.20/0.49 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.49 % --res_passive_queues_freq [15;5]
% 0.20/0.49 % --res_forward_subs full
% 0.20/0.49 % --res_backward_subs full
% 0.20/0.49 % --res_forward_subs_resolution true
% 0.20/0.49 % --res_backward_subs_resolution true
% 0.20/0.49 % --res_orphan_elimination false
% 0.20/0.49 % --res_time_limit 1000.
% 0.20/0.49 % --res_out_proof true
% 0.20/0.49 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_9bd0a3.s
% 0.20/0.49 % --modulo true
% 0.20/0.49
% 0.20/0.49 % ------ Combination Options
% 0.20/0.49
% 0.20/0.49 % --comb_res_mult 1000
% 0.20/0.49 % --comb_inst_mult 300
% 0.20/0.49 % ------
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 % ------ Proving...
% 0.20/0.49 % warning: shown sat in sat incomplete mode
% 0.20/0.49 %
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 cnf(c_25,negated_conjecture,
% 0.20/0.49 ( ~ subset_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_8) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_37,negated_conjecture,
% 0.20/0.49 ( ~ subset_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_25]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_45,negated_conjecture,
% 0.20/0.49 ( ~ subset_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_37]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_48,negated_conjecture,
% 0.20/0.49 ( ~ subset_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_45]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_49,negated_conjecture,
% 0.20/0.49 ( ~ subset_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_48]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_128,negated_conjecture,
% 0.20/0.49 ( ~ subset_sets(union_of_members(top_of_basis(f)),cx) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_49]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_5,plain,
% 0.20/0.49 ( element_of_set(in_1st_set(X0,X1),X0) | subset_sets(X0,X1) ),
% 0.20/0.49 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_51_1) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_88,plain,
% 0.20/0.49 ( element_of_set(in_1st_set(X0,X1),X0) | subset_sets(X0,X1) ),
% 0.20/0.49 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_89,plain,
% 0.20/0.49 ( subset_sets(X0,X1) | element_of_set(in_1st_set(X0,X1),X0) ),
% 0.20/0.49 inference(rewriting,[status(thm)],[c_88]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_138,plain,
% 0.20/0.49 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(top_of_basis(f))) ),
% 0.20/0.49 inference(resolution,[status(thm)],[c_128,c_89]) ).
% 0.20/0.49
% 0.20/0.49 cnf(c_139,plain,
% 0.20/0.49 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(top_of_basis(f))) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_138]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_10,plain,
% 0.20/0.50 ( element_of_set(X0,union_of_members(X1))
% 0.20/0.50 | ~ element_of_collection(X2,X1)
% 0.20/0.50 | ~ element_of_set(X0,X2) ),
% 0.20/0.50 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_49_2) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_98,plain,
% 0.20/0.50 ( element_of_set(X0,union_of_members(X1))
% 0.20/0.50 | ~ element_of_collection(X2,X1)
% 0.20/0.50 | ~ element_of_set(X0,X2) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_99,plain,
% 0.20/0.50 ( element_of_set(X0,union_of_members(X1))
% 0.20/0.50 | ~ element_of_set(X0,X2)
% 0.20/0.50 | ~ element_of_collection(X2,X1) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_98]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_146,plain,
% 0.20/0.50 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(X0))
% 0.20/0.50 | ~ element_of_collection(union_of_members(top_of_basis(f)),X0) ),
% 0.20/0.50 inference(resolution,[status(thm)],[c_139,c_99]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_147,plain,
% 0.20/0.50 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(X0))
% 0.20/0.50 | ~ element_of_collection(union_of_members(top_of_basis(f)),X0) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_146]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_13,plain,
% 0.20/0.50 ( element_of_set(X0,f1(X1,X0))
% 0.20/0.50 | ~ element_of_set(X0,union_of_members(X1)) ),
% 0.20/0.50 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_48_1) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_104,plain,
% 0.20/0.50 ( element_of_set(X0,f1(X1,X0))
% 0.20/0.50 | ~ element_of_set(X0,union_of_members(X1)) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_105,plain,
% 0.20/0.50 ( ~ element_of_set(X0,union_of_members(X1))
% 0.20/0.50 | element_of_set(X0,f1(X1,X0)) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_104]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_162,plain,
% 0.20/0.50 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),f1(X0,in_1st_set(union_of_members(top_of_basis(f)),cx)))
% 0.20/0.50 | ~ element_of_collection(union_of_members(top_of_basis(f)),X0) ),
% 0.20/0.50 inference(resolution,[status(thm)],[c_147,c_105]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_163,plain,
% 0.20/0.50 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),f1(X0,in_1st_set(union_of_members(top_of_basis(f)),cx)))
% 0.20/0.50 | ~ element_of_collection(union_of_members(top_of_basis(f)),X0) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_162]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_180,plain,
% 0.20/0.50 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(X0))
% 0.20/0.50 | ~ element_of_collection(union_of_members(top_of_basis(f)),X1)
% 0.20/0.50 | ~ element_of_collection(f1(X1,in_1st_set(union_of_members(top_of_basis(f)),cx)),X0) ),
% 0.20/0.50 inference(resolution,[status(thm)],[c_163,c_99]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_181,plain,
% 0.20/0.50 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(X0))
% 0.20/0.50 | ~ element_of_collection(union_of_members(top_of_basis(f)),X1)
% 0.20/0.50 | ~ element_of_collection(f1(X1,in_1st_set(union_of_members(top_of_basis(f)),cx)),X0) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_180]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_148,plain,
% 0.20/0.50 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),f1(top_of_basis(f),in_1st_set(union_of_members(top_of_basis(f)),cx))) ),
% 0.20/0.50 inference(resolution,[status(thm)],[c_139,c_105]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_149,plain,
% 0.20/0.50 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),f1(top_of_basis(f),in_1st_set(union_of_members(top_of_basis(f)),cx))) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_148]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_168,plain,
% 0.20/0.50 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(X0))
% 0.20/0.50 | ~ element_of_collection(f1(top_of_basis(f),in_1st_set(union_of_members(top_of_basis(f)),cx)),X0) ),
% 0.20/0.50 inference(resolution,[status(thm)],[c_149,c_99]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_169,plain,
% 0.20/0.50 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(X0))
% 0.20/0.50 | ~ element_of_collection(f1(top_of_basis(f),in_1st_set(union_of_members(top_of_basis(f)),cx)),X0) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_168]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_160,plain,
% 0.20/0.50 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(X0))
% 0.20/0.50 | ~ element_of_collection(union_of_members(top_of_basis(f)),X1)
% 0.20/0.50 | ~ element_of_collection(union_of_members(X1),X0) ),
% 0.20/0.50 inference(resolution,[status(thm)],[c_147,c_99]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_161,plain,
% 0.20/0.50 ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),cx),union_of_members(X0))
% 0.20/0.50 | ~ element_of_collection(union_of_members(top_of_basis(f)),X1)
% 0.20/0.50 | ~ element_of_collection(union_of_members(X1),X0) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_160]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_26,negated_conjecture,
% 0.20/0.50 ( basis(cx,f) ),
% 0.20/0.50 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_9) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_39,negated_conjecture,
% 0.20/0.50 ( basis(cx,f) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_26]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_46,negated_conjecture,
% 0.20/0.50 ( basis(cx,f) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_39]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_47,negated_conjecture,
% 0.20/0.50 ( basis(cx,f) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_46]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_50,negated_conjecture,
% 0.20/0.50 ( basis(cx,f) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_47]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_130,negated_conjecture,
% 0.20/0.50 ( basis(cx,f) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_50]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_3,plain,
% 0.20/0.50 ( equal_sets(union_of_members(X0),X1) | ~ basis(X1,X0) ),
% 0.20/0.50 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_52_1) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_84,plain,
% 0.20/0.50 ( equal_sets(union_of_members(X0),X1) | ~ basis(X1,X0) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_134,plain,
% 0.20/0.50 ( equal_sets(union_of_members(f),cx) ),
% 0.20/0.50 inference(resolution,[status(thm)],[c_130,c_84]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_135,plain,
% 0.20/0.50 ( equal_sets(union_of_members(f),cx) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_134]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_1,plain,
% 0.20/0.50 ( subset_sets(X0,X1) | ~ equal_sets(X0,X1) ),
% 0.20/0.50 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_53_1) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_80,plain,
% 0.20/0.50 ( subset_sets(X0,X1) | ~ equal_sets(X0,X1) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_1]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_142,plain,
% 0.20/0.50 ( subset_sets(union_of_members(f),cx) ),
% 0.20/0.50 inference(resolution,[status(thm)],[c_135,c_80]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_143,plain,
% 0.20/0.50 ( subset_sets(union_of_members(f),cx) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_142]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_22,plain,
% 0.20/0.50 ( element_of_collection(f10(X0,X1,X2),X0)
% 0.20/0.50 | ~ element_of_set(X2,X1)
% 0.20/0.50 | ~ element_of_collection(X1,top_of_basis(X0)) ),
% 0.20/0.50 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_44_2) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_122,plain,
% 0.20/0.50 ( element_of_collection(f10(X0,X1,X2),X0)
% 0.20/0.50 | ~ element_of_set(X2,X1)
% 0.20/0.50 | ~ element_of_collection(X1,top_of_basis(X0)) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_22]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_123,plain,
% 0.20/0.50 ( ~ element_of_set(X0,X1)
% 0.20/0.50 | element_of_collection(f10(X2,X1,X0),X2)
% 0.20/0.50 | ~ element_of_collection(X1,top_of_basis(X2)) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_122]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_19,plain,
% 0.20/0.50 ( element_of_set(X0,f10(X1,X2,X0))
% 0.20/0.50 | ~ element_of_set(X0,X2)
% 0.20/0.50 | ~ element_of_collection(X2,top_of_basis(X1)) ),
% 0.20/0.50 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_45_2) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_116,plain,
% 0.20/0.50 ( element_of_set(X0,f10(X1,X2,X0))
% 0.20/0.50 | ~ element_of_set(X0,X2)
% 0.20/0.50 | ~ element_of_collection(X2,top_of_basis(X1)) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_19]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_17,plain,
% 0.20/0.50 ( subset_sets(X0,X1) | ~ element_of_set(in_1st_set(X0,X1),X1) ),
% 0.20/0.50 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_46_1) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_112,plain,
% 0.20/0.50 ( subset_sets(X0,X1) | ~ element_of_set(in_1st_set(X0,X1),X1) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_17]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_15,plain,
% 0.20/0.50 ( element_of_collection(f1(X0,X1),X0)
% 0.20/0.50 | ~ element_of_set(X1,union_of_members(X0)) ),
% 0.20/0.50 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_47_1) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_108,plain,
% 0.20/0.50 ( element_of_collection(f1(X0,X1),X0)
% 0.20/0.50 | ~ element_of_set(X1,union_of_members(X0)) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_109,plain,
% 0.20/0.50 ( ~ element_of_set(X0,union_of_members(X1))
% 0.20/0.50 | element_of_collection(f1(X1,X0),X1) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_108]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_9,plain,
% 0.20/0.50 ( ~ subset_sets(X0,X1)
% 0.20/0.50 | ~ element_of_set(X2,X0)
% 0.20/0.50 | element_of_set(X2,X1) ),
% 0.20/0.50 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_50_0) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_96,plain,
% 0.20/0.50 ( ~ subset_sets(X0,X1)
% 0.20/0.50 | ~ element_of_set(X2,X0)
% 0.20/0.50 | element_of_set(X2,X1) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_7,plain,
% 0.20/0.50 ( element_of_set(X0,X1)
% 0.20/0.50 | ~ element_of_set(X0,X2)
% 0.20/0.50 | ~ subset_sets(X2,X1) ),
% 0.20/0.50 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_50_2) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_92,plain,
% 0.20/0.50 ( element_of_set(X0,X1)
% 0.20/0.50 | ~ element_of_set(X0,X2)
% 0.20/0.50 | ~ subset_sets(X2,X1) ),
% 0.20/0.50 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_93,plain,
% 0.20/0.50 ( ~ subset_sets(X0,X1)
% 0.20/0.50 | element_of_set(X2,X1)
% 0.20/0.50 | ~ element_of_set(X2,X0) ),
% 0.20/0.50 inference(rewriting,[status(thm)],[c_92]) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_0,plain,
% 0.20/0.50 ( subset_sets(X0,X0) ),
% 0.20/0.50 file('/export/starexec/sandbox/tmp/iprover_modulo_bc877f.p', c_0_54_0) ).
% 0.20/0.50
% 0.20/0.50 cnf(c_78,plain,( subset_sets(X0,X0) ),inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 % ------ Statistics
% 0.20/0.50
% 0.20/0.50 % ------ General
% 0.20/0.50
% 0.20/0.50 % num_of_input_clauses: 27
% 0.20/0.50 % num_of_input_neg_conjectures: 2
% 0.20/0.50 % num_of_splits: 0
% 0.20/0.50 % num_of_split_atoms: 0
% 0.20/0.50 % num_of_sem_filtered_clauses: 0
% 0.20/0.50 % num_of_subtypes: 0
% 0.20/0.50 % monotx_restored_types: 0
% 0.20/0.50 % sat_num_of_epr_types: 0
% 0.20/0.50 % sat_num_of_non_cyclic_types: 0
% 0.20/0.50 % sat_guarded_non_collapsed_types: 0
% 0.20/0.50 % is_epr: 0
% 0.20/0.50 % is_horn: 0
% 0.20/0.50 % has_eq: 0
% 0.20/0.50 % num_pure_diseq_elim: 0
% 0.20/0.50 % simp_replaced_by: 0
% 0.20/0.50 % res_preprocessed: 4
% 0.20/0.50 % prep_upred: 0
% 0.20/0.50 % prep_unflattend: 0
% 0.20/0.50 % pred_elim_cands: 0
% 0.20/0.50 % pred_elim: 0
% 0.20/0.50 % pred_elim_cl: 0
% 0.20/0.50 % pred_elim_cycles: 0
% 0.20/0.50 % forced_gc_time: 0
% 0.20/0.50 % gc_basic_clause_elim: 0
% 0.20/0.50 % parsing_time: 0.001
% 0.20/0.50 % sem_filter_time: 0.
% 0.20/0.50 % pred_elim_time: 0.
% 0.20/0.50 % out_proof_time: 0.
% 0.20/0.50 % monotx_time: 0.
% 0.20/0.50 % subtype_inf_time: 0.
% 0.20/0.50 % unif_index_cands_time: 0.
% 0.20/0.50 % unif_index_add_time: 0.
% 0.20/0.50 % total_time: 0.025
% 0.20/0.50 % num_of_symbols: 37
% 0.20/0.50 % num_of_terms: 151
% 0.20/0.50
% 0.20/0.50 % ------ Propositional Solver
% 0.20/0.50
% 0.20/0.50 % prop_solver_calls: 1
% 0.20/0.50 % prop_fast_solver_calls: 6
% 0.20/0.50 % prop_num_of_clauses: 29
% 0.20/0.50 % prop_preprocess_simplified: 91
% 0.20/0.50 % prop_fo_subsumed: 0
% 0.20/0.50 % prop_solver_time: 0.
% 0.20/0.50 % prop_fast_solver_time: 0.
% 0.20/0.50 % prop_unsat_core_time: 0.
% 0.20/0.50
% 0.20/0.50 % ------ QBF
% 0.20/0.50
% 0.20/0.50 % qbf_q_res: 0
% 0.20/0.50 % qbf_num_tautologies: 0
% 0.20/0.50 % qbf_prep_cycles: 0
% 0.20/0.50
% 0.20/0.50 % ------ BMC1
% 0.20/0.50
% 0.20/0.50 % bmc1_current_bound: -1
% 0.20/0.50 % bmc1_last_solved_bound: -1
% 0.20/0.50 % bmc1_unsat_core_size: -1
% 0.20/0.50 % bmc1_unsat_core_parents_size: -1
% 0.20/0.50 % bmc1_merge_next_fun: 0
% 0.20/0.50 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation
% 0.20/0.50
% 0.20/0.50 % inst_num_of_clauses: 27
% 0.20/0.50 % inst_num_in_passive: 0
% 0.20/0.50 % inst_num_in_active: 0
% 0.20/0.50 % inst_num_in_unprocessed: 27
% 0.20/0.50 % inst_num_of_loops: 0
% 0.20/0.50 % inst_num_of_learning_restarts: 0
% 0.20/0.50 % inst_num_moves_active_passive: 0
% 0.20/0.50 % inst_lit_activity: 0
% 0.20/0.50 % inst_lit_activity_moves: 0
% 0.20/0.50 % inst_num_tautologies: 0
% 0.20/0.50 % inst_num_prop_implied: 0
% 0.20/0.50 % inst_num_existing_simplified: 0
% 0.20/0.50 % inst_num_eq_res_simplified: 0
% 0.20/0.50 % inst_num_child_elim: 0
% 0.20/0.50 % inst_num_of_dismatching_blockings: 0
% 0.20/0.50 % inst_num_of_non_proper_insts: 0
% 0.20/0.50 % inst_num_of_duplicates: 0
% 0.20/0.50 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.50 % inst_dismatching_checking_time: 0.
% 0.20/0.50
% 0.20/0.50 % ------ Resolution
% 0.20/0.50
% 0.20/0.50 % res_num_of_clauses: 38
% 0.20/0.50 % res_num_in_passive: 0
% 0.20/0.50 % res_num_in_active: 23
% 0.20/0.50 % res_num_of_loops: 15
% 0.20/0.50 % res_forward_subset_subsumed: 13
% 0.20/0.50 % res_backward_subset_subsumed: 0
% 0.20/0.50 % res_forward_subsumed: 3
% 0.20/0.50 % res_backward_subsumed: 0
% 0.20/0.50 % res_forward_subsumption_resolution: 0
% 0.20/0.50 % res_backward_subsumption_resolution: 0
% 0.20/0.50 % res_clause_to_clause_subsumption: 18
% 0.20/0.50 % res_orphan_elimination: 0
% 0.20/0.50 % res_tautology_del: 0
% 0.20/0.50 % res_num_eq_res_simplified: 0
% 0.20/0.50 % res_num_sel_changes: 0
% 0.20/0.50 % res_moves_from_active_to_pass: 0
% 0.20/0.50
% 0.20/0.50 % Status Unknown
% 0.20/0.50 % Last status :
% 0.20/0.50 % SZS status Unknown
%------------------------------------------------------------------------------