TSTP Solution File: SET931+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SET931+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n026.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 : Tue Jul 19 02:18:42 EDT 2022
% Result : Unknown 150.30s 150.51s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET931+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 21:59:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % FOF problem with conjecture
% 0.20/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/sandbox2/tmp/iprover_proof_2e5e9c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_461ba7 | 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.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2e5e9c.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ 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.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn false
% 0.20/0.43 % Has equality true
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2e5e9c.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % warning: shown sat in sat incomplete mode
% 0.20/0.43 %
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 cnf(c_14,negated_conjecture,
% 0.20/0.43 ( set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set
% 0.20/0.43 | singleton(sk3_esk3_0) != sk3_esk1_0 ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_10) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_29,negated_conjecture,
% 0.20/0.43 ( set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set
% 0.20/0.43 | singleton(sk3_esk3_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_14]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_47,negated_conjecture,
% 0.20/0.43 ( set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set
% 0.20/0.43 | singleton(sk3_esk3_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_52,negated_conjecture,
% 0.20/0.43 ( set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set
% 0.20/0.43 | singleton(sk3_esk3_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_47]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_58,negated_conjecture,
% 0.20/0.43 ( set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set
% 0.20/0.43 | singleton(sk3_esk3_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_52]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_107,negated_conjecture,
% 0.20/0.43 ( set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set
% 0.20/0.43 | singleton(sk3_esk3_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_58]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_6,plain,
% 0.20/0.43 ( ~ subset(X0,X1) | set_difference(X0,X1) = empty_set ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_36_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_89,plain,
% 0.20/0.43 ( ~ subset(X0,X1) | set_difference(X0,X1) = empty_set ),
% 0.20/0.43 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_127,plain,
% 0.20/0.43 ( ~ subset(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | singleton(sk3_esk3_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_107,c_89]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_128,plain,
% 0.20/0.43 ( ~ subset(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | singleton(sk3_esk3_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_127]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_7,plain,
% 0.20/0.43 ( X0 != empty_set | subset(X0,unordered_pair(X1,X2)) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_35_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_91,plain,
% 0.20/0.43 ( X0 != empty_set | subset(X0,unordered_pair(X1,X2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_92,plain,
% 0.20/0.43 ( subset(X0,unordered_pair(X1,X2)) | X0 != empty_set ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_91]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_185,plain,
% 0.20/0.43 ( singleton(sk3_esk3_0) != sk3_esk1_0 | sk3_esk1_0 != empty_set ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_128,c_92]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_186,plain,
% 0.20/0.43 ( singleton(sk3_esk3_0) != sk3_esk1_0 | sk3_esk1_0 != empty_set ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_185]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_9,plain,
% 0.20/0.43 ( X0 != singleton(X1) | subset(X0,unordered_pair(X1,X2)) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_33_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_95,plain,
% 0.20/0.43 ( X0 != singleton(X1) | subset(X0,unordered_pair(X1,X2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_96,plain,
% 0.20/0.43 ( subset(X0,unordered_pair(X1,X2)) | X0 != singleton(X1) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_95]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_184,plain,
% 0.20/0.43 ( singleton(sk3_esk3_0) != sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 != singleton(sk3_esk2_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_128,c_96]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_187,plain,
% 0.20/0.43 ( singleton(sk3_esk3_0) != sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 != singleton(sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_184]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_10,plain,
% 0.20/0.43 ( X0 != unordered_pair(X1,X2) | subset(X0,unordered_pair(X1,X2)) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_32_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_97,plain,
% 0.20/0.43 ( X0 != unordered_pair(X1,X2) | subset(X0,unordered_pair(X1,X2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_98,plain,
% 0.20/0.43 ( subset(X0,unordered_pair(X1,X2)) | X0 != unordered_pair(X1,X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_97]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_183,plain,
% 0.20/0.43 ( singleton(sk3_esk3_0) != sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 != unordered_pair(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_128,c_98]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_188,plain,
% 0.20/0.43 ( singleton(sk3_esk3_0) != sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 != unordered_pair(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_183]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_13,negated_conjecture,
% 0.20/0.43 ( set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set
% 0.20/0.43 | singleton(sk3_esk2_0) != sk3_esk1_0 ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_9) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_27,negated_conjecture,
% 0.20/0.43 ( set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set
% 0.20/0.43 | singleton(sk3_esk2_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_13]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_46,negated_conjecture,
% 0.20/0.43 ( set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set
% 0.20/0.43 | singleton(sk3_esk2_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_27]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_53,negated_conjecture,
% 0.20/0.43 ( set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set
% 0.20/0.43 | singleton(sk3_esk2_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_46]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_57,negated_conjecture,
% 0.20/0.43 ( set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set
% 0.20/0.43 | singleton(sk3_esk2_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_53]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_105,negated_conjecture,
% 0.20/0.43 ( set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set
% 0.20/0.43 | singleton(sk3_esk2_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_57]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_121,plain,
% 0.20/0.43 ( ~ subset(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | singleton(sk3_esk2_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_105,c_89]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_122,plain,
% 0.20/0.43 ( ~ subset(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | singleton(sk3_esk2_0) != sk3_esk1_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_121]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_173,plain,
% 0.20/0.43 ( singleton(sk3_esk2_0) != sk3_esk1_0 | sk3_esk1_0 != empty_set ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_122,c_92]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_174,plain,
% 0.20/0.43 ( singleton(sk3_esk2_0) != sk3_esk1_0 | sk3_esk1_0 != empty_set ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_173]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_172,plain,
% 0.20/0.43 ( singleton(sk3_esk2_0) != sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 != singleton(sk3_esk2_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_122,c_96]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_175,plain,
% 0.20/0.43 ( singleton(sk3_esk2_0) != sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 != singleton(sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_172]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_171,plain,
% 0.20/0.43 ( singleton(sk3_esk2_0) != sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 != unordered_pair(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_122,c_98]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_176,plain,
% 0.20/0.43 ( singleton(sk3_esk2_0) != sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 != unordered_pair(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_171]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_15,negated_conjecture,
% 0.20/0.43 ( empty_set != sk3_esk1_0
% 0.20/0.43 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_11) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_31,negated_conjecture,
% 0.20/0.43 ( empty_set != sk3_esk1_0
% 0.20/0.43 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set ),
% 0.20/0.43 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_48,negated_conjecture,
% 0.20/0.43 ( empty_set != sk3_esk1_0
% 0.20/0.43 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set ),
% 0.20/0.43 inference(copy,[status(esa)],[c_31]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_51,negated_conjecture,
% 0.20/0.43 ( empty_set != sk3_esk1_0
% 0.20/0.43 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set ),
% 0.20/0.43 inference(copy,[status(esa)],[c_48]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_59,negated_conjecture,
% 0.20/0.43 ( empty_set != sk3_esk1_0
% 0.20/0.43 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set ),
% 0.20/0.43 inference(copy,[status(esa)],[c_51]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_109,negated_conjecture,
% 0.20/0.43 ( empty_set != sk3_esk1_0
% 0.20/0.43 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set ),
% 0.20/0.43 inference(copy,[status(esa)],[c_59]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_115,plain,
% 0.20/0.43 ( ~ subset(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | empty_set != sk3_esk1_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_109,c_89]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_116,plain,
% 0.20/0.43 ( ~ subset(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | empty_set != sk3_esk1_0 ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_115]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_161,plain,
% 0.20/0.43 ( empty_set != sk3_esk1_0 | sk3_esk1_0 != empty_set ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_116,c_92]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_162,plain,
% 0.20/0.43 ( empty_set != sk3_esk1_0 | sk3_esk1_0 != empty_set ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_161]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_160,plain,
% 0.20/0.43 ( empty_set != sk3_esk1_0 | sk3_esk1_0 != singleton(sk3_esk2_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_116,c_96]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_163,plain,
% 0.20/0.43 ( empty_set != sk3_esk1_0 | sk3_esk1_0 != singleton(sk3_esk2_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_160]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_159,plain,
% 0.20/0.43 ( empty_set != sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 != unordered_pair(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_116,c_98]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_164,plain,
% 0.20/0.43 ( empty_set != sk3_esk1_0
% 0.20/0.43 | sk3_esk1_0 != unordered_pair(sk3_esk2_0,sk3_esk3_0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_159]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_16,negated_conjecture,
% 0.20/0.43 ( empty_set = sk3_esk1_0
% 0.20/0.43 | unordered_pair(sk3_esk2_0,sk3_esk3_0) = sk3_esk1_0
% 0.20/0.43 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) = empty_set
% 0.20/0.43 | singleton(sk3_esk2_0) = sk3_esk1_0
% 0.20/0.43 | singleton(sk3_esk3_0) = sk3_esk1_0 ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_12) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_33,negated_conjecture,
% 0.20/0.43 ( empty_set = sk3_esk1_0
% 0.20/0.43 | unordered_pair(sk3_esk2_0,sk3_esk3_0) = sk3_esk1_0
% 0.20/0.43 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) = empty_set
% 0.20/0.43 | singleton(sk3_esk2_0) = sk3_esk1_0
% 0.20/0.43 | singleton(sk3_esk3_0) = sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_16]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_49,negated_conjecture,
% 0.20/0.43 ( empty_set = sk3_esk1_0
% 0.20/0.43 | unordered_pair(sk3_esk2_0,sk3_esk3_0) = sk3_esk1_0
% 0.20/0.43 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) = empty_set
% 0.20/0.43 | singleton(sk3_esk2_0) = sk3_esk1_0
% 0.20/0.43 | singleton(sk3_esk3_0) = sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_33]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_50,negated_conjecture,
% 0.20/0.43 ( empty_set = sk3_esk1_0
% 0.20/0.43 | unordered_pair(sk3_esk2_0,sk3_esk3_0) = sk3_esk1_0
% 0.20/0.43 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) = empty_set
% 0.20/0.43 | singleton(sk3_esk2_0) = sk3_esk1_0
% 0.20/0.43 | singleton(sk3_esk3_0) = sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_49]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_55,negated_conjecture,
% 0.20/0.43 ( empty_set = sk3_esk1_0
% 0.20/0.43 | unordered_pair(sk3_esk2_0,sk3_esk3_0) = sk3_esk1_0
% 0.20/0.43 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) = empty_set
% 0.20/0.43 | singleton(sk3_esk2_0) = sk3_esk1_0
% 0.20/0.43 | singleton(sk3_esk3_0) = sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_50]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_101,negated_conjecture,
% 0.20/0.43 ( empty_set = sk3_esk1_0
% 0.20/0.43 | unordered_pair(sk3_esk2_0,sk3_esk3_0) = sk3_esk1_0
% 0.20/0.43 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) = empty_set
% 0.20/0.43 | singleton(sk3_esk2_0) = sk3_esk1_0
% 0.20/0.43 | singleton(sk3_esk3_0) = sk3_esk1_0 ),
% 0.20/0.43 inference(copy,[status(esa)],[c_55]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_5,plain,
% 0.20/0.43 ( subset(X0,X1) | set_difference(X0,X1) != empty_set ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_37_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_87,plain,
% 0.20/0.43 ( subset(X0,X1) | set_difference(X0,X1) != empty_set ),
% 0.20/0.43 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_145,plain,
% 0.20/0.43 ( subset(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | empty_set = sk3_esk1_0
% 0.20/0.43 | unordered_pair(sk3_esk2_0,sk3_esk3_0) = sk3_esk1_0
% 0.20/0.43 | singleton(sk3_esk2_0) = sk3_esk1_0
% 0.20/0.43 | singleton(sk3_esk3_0) = sk3_esk1_0 ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_101,c_87]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_146,plain,
% 0.20/0.43 ( subset(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.43 | empty_set = sk3_esk1_0
% 0.20/0.43 | unordered_pair(sk3_esk2_0,sk3_esk3_0) = sk3_esk1_0
% 0.20/0.44 | singleton(sk3_esk2_0) = sk3_esk1_0
% 0.20/0.44 | singleton(sk3_esk3_0) = sk3_esk1_0 ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_145]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_12,negated_conjecture,
% 0.20/0.44 ( unordered_pair(sk3_esk2_0,sk3_esk3_0) != sk3_esk1_0
% 0.20/0.44 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_8) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_25,negated_conjecture,
% 0.20/0.44 ( unordered_pair(sk3_esk2_0,sk3_esk3_0) != sk3_esk1_0
% 0.20/0.44 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set ),
% 0.20/0.44 inference(copy,[status(esa)],[c_12]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_45,negated_conjecture,
% 0.20/0.44 ( unordered_pair(sk3_esk2_0,sk3_esk3_0) != sk3_esk1_0
% 0.20/0.44 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set ),
% 0.20/0.44 inference(copy,[status(esa)],[c_25]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_54,negated_conjecture,
% 0.20/0.44 ( unordered_pair(sk3_esk2_0,sk3_esk3_0) != sk3_esk1_0
% 0.20/0.44 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set ),
% 0.20/0.44 inference(copy,[status(esa)],[c_45]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_56,negated_conjecture,
% 0.20/0.44 ( unordered_pair(sk3_esk2_0,sk3_esk3_0) != sk3_esk1_0
% 0.20/0.44 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set ),
% 0.20/0.44 inference(copy,[status(esa)],[c_54]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_103,negated_conjecture,
% 0.20/0.44 ( unordered_pair(sk3_esk2_0,sk3_esk3_0) != sk3_esk1_0
% 0.20/0.44 | set_difference(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0)) != empty_set ),
% 0.20/0.44 inference(copy,[status(esa)],[c_56]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_133,plain,
% 0.20/0.44 ( ~ subset(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.44 | unordered_pair(sk3_esk2_0,sk3_esk3_0) != sk3_esk1_0 ),
% 0.20/0.44 inference(resolution,[status(thm)],[c_103,c_89]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_134,plain,
% 0.20/0.44 ( ~ subset(sk3_esk1_0,unordered_pair(sk3_esk2_0,sk3_esk3_0))
% 0.20/0.44 | unordered_pair(sk3_esk2_0,sk3_esk3_0) != sk3_esk1_0 ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_133]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_11,plain,
% 0.20/0.44 ( X0 = empty_set
% 0.20/0.44 | X0 = singleton(X1)
% 0.20/0.44 | X0 = singleton(X2)
% 0.20/0.44 | X0 = unordered_pair(X1,X2)
% 0.20/0.44 | ~ subset(X0,unordered_pair(X1,X2)) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_31_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_99,plain,
% 0.20/0.44 ( X0 = empty_set
% 0.20/0.44 | X0 = singleton(X1)
% 0.20/0.44 | X0 = singleton(X2)
% 0.20/0.44 | X0 = unordered_pair(X1,X2)
% 0.20/0.44 | ~ subset(X0,unordered_pair(X1,X2)) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_11]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_100,plain,
% 0.20/0.44 ( ~ subset(X0,unordered_pair(X1,X2))
% 0.20/0.44 | X0 = empty_set
% 0.20/0.44 | X0 = unordered_pair(X1,X2)
% 0.20/0.44 | X0 = singleton(X1)
% 0.20/0.44 | X0 = singleton(X2) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_99]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_8,plain,
% 0.20/0.44 ( X0 != singleton(X1) | subset(X0,unordered_pair(X2,X1)) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_34_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_93,plain,
% 0.20/0.44 ( X0 != singleton(X1) | subset(X0,unordered_pair(X2,X1)) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_94,plain,
% 0.20/0.44 ( subset(X0,unordered_pair(X1,X2)) | X0 != singleton(X2) ),
% 0.20/0.44 inference(rewriting,[status(thm)],[c_93]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_4,plain,
% 0.20/0.44 ( unordered_pair(X0,X1) = unordered_pair(X1,X0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_38_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_85,plain,
% 0.20/0.44 ( unordered_pair(X0,X1) = unordered_pair(X1,X0) ),
% 0.20/0.44 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_3,plain,
% 0.20/0.44 ( subset(X0,X0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_39_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_83,plain,( subset(X0,X0) ),inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_2,plain,
% 0.20/0.44 ( empty(empty_set) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_40_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_81,plain,( empty(empty_set) ),inference(copy,[status(esa)],[c_2]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_1,plain,
% 0.20/0.44 ( empty(sk2_esk2_0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_9_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_79,plain,( empty(sk2_esk2_0) ),inference(copy,[status(esa)],[c_1]) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_0,plain,
% 0.20/0.44 ( ~ empty(sk2_esk1_0) ),
% 0.20/0.44 file('/export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p', c_0_8_0) ).
% 0.20/0.44
% 0.20/0.44 cnf(c_77,plain,( ~ empty(sk2_esk1_0) ),inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 % ------ Statistics
% 0.20/0.44
% 0.20/0.44 % ------ General
% 0.20/0.44
% 0.20/0.44 % num_of_input_clauses: 17
% 0.20/0.44 % num_of_input_neg_conjectures: 5
% 0.20/0.44 % num_of_splits: 0
% 0.20/0.44 % num_of_split_atoms: 0
% 0.20/0.44 % num_of_sem_filtered_clauses: 0
% 0.20/0.44 % num_of_subtypes: 0
% 0.20/0.44 % monotx_restored_types: 0
% 0.20/0.44 % sat_num_of_epr_types: 0
% 0.20/0.44 % sat_num_of_non_cyclic_types: 0
% 0.20/0.44 % sat_guarded_non_collapsed_types: 0
% 0.20/0.44 % is_epr: 0
% 0.20/0.44 % is_horn: 0
% 0.20/0.44 % has_eq: 1
% 0.20/0.44 % num_pure_diseq_elim: 0
% 0.20/0.44 % simp_replaced_by: 0
% 0.20/0.44 % res_preprocessed: 10
% 0.20/0.44 % prep_upred: 0
% 0.20/0.44 % prep_unflattend: 0
% 0.20/0.44 % pred_elim_cands: 0
% 0.20/0.44 % pred_elim: 0
% 0.20/0.44 % pred_elim_cl: 0
% 0.20/0.44 % pred_elim_cycles: 0
% 0.20/0.44 % forced_gc_time: 0
% 0.20/0.44 % gc_basic_clause_elim: 0
% 0.20/0.44 % parsing_time: 0.
% 0.20/0.44 % sem_filter_time: 0.
% 0.20/0.44 % pred_elim_time: 0.
% 0.20/0.44 % out_proof_time: 0.
% 0.20/0.44 % monotx_time: 0.
% 0.20/0.44 % subtype_inf_time: 0.
% 0.20/0.44 % unif_index_cands_time: 0.
% 0.20/0.44 % unif_index_add_time: 0.
% 0.20/0.44 % total_time: 0.03
% 0.20/0.44 % num_of_symbols: 36
% 0.20/0.44 % num_of_terms: 93
% 0.20/0.44
% 0.20/0.44 % ------ Propositional Solver
% 0.20/0.44
% 0.20/0.44 % prop_solver_calls: 1
% 0.20/0.44 % prop_fast_solver_calls: 39
% 0.20/0.44 % prop_num_of_clauses: 25
% 0.20/0.44 % prop_preprocess_simplified: 67
% 0.20/0.44 % prop_fo_subsumed: 0
% 0.20/0.44 % prop_solver_time: 0.
% 0.20/0.44 % prop_fast_solver_time: 0.
% 0.20/0.44 % prop_unsat_core_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ QBF
% 0.20/0.44
% 0.20/0.44 % qbf_q_res: 0
% 0.20/0.44 % qbf_num_tautologies: 0
% 0.20/0.44 % qbf_prep_cycles: 0
% 0.20/0.44
% 0.20/0.44 % ------ BMC1
% 0.20/0.44
% 0.20/0.44 % bmc1_current_bound: -1
% 0.20/0.44 % bmc1_last_solved_bound: -1
% 0.20/0.44 % bmc1_unsat_core_size: -1
% 0.20/0.44 % bmc1_unsat_core_parents_size: -1
% 0.20/0.44 % bmc1_merge_next_fun: 0
% 0.20/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation
% 0.20/0.44
% 0.20/0.44 % inst_num_of_clauses: 17
% 0.20/0.44 % inst_num_in_passive: 0
% 0.20/0.44 % inst_num_in_active: 0
% 0.20/0.44 % inst_num_in_unprocessed: 17
% 0.20/0.44 % inst_num_of_loops: 0
% 0.20/0.44 % inst_num_of_learning_restarts: 0
% 0.20/0.44 % inst_num_moves_active_passive: 0
% 0.20/0.44 % inst_lit_activity: 0
% 0.20/0.44 % inst_lit_activity_moves: 0
% 0.20/0.44 % inst_num_tautologies: 0
% 0.20/0.44 % inst_num_prop_implied: 0
% 0.20/0.44 % inst_num_existing_simplified: 0
% 0.20/0.44 % inst_num_eq_res_simplified: 0
% 0.20/0.44 % inst_num_child_elim: 0
% 0.20/0.44 % inst_num_of_dismatching_blockings: 0
% 0.20/0.44 % inst_num_of_non_proper_insts: 0
% 0.20/0.44 % inst_num_of_duplicates: 0
% 0.20/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.44 % inst_dismatching_checking_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Resolution
% 0.20/0.44
% 0.20/0.44 % res_num_of_clauses: 36
% 0.20/0.44 % res_num_in_passive: 0
% 0.20/0.44 % res_num_in_active: 31
% 0.20/0.44 % res_num_of_loops: 20
% 0.20/0.44 % res_forward_subset_subsumed: 3
% 0.20/0.44 % res_backward_subset_subsumed: 0
% 0.20/0.44 % res_forward_subsumed: 0
% 0.20/0.44 % res_backward_subsumed: 0
% 0.20/0.44 % res_forward_subsumption_resolution: 0
% 0.20/0.44 % res_backward_subsumption_resolution: 0
% 0.20/0.44 % res_clause_to_clause_subsumption: 27
% 0.20/0.44 % res_orphan_elimination: 0
% 0.20/0.44 % res_tautology_del: 5
% 0.20/0.44 % res_num_eq_res_simplified: 0
% 0.20/0.44 % res_num_sel_changes: 0
% 0.20/0.44 % res_moves_from_active_to_pass: 0
% 0.20/0.44
% 0.20/0.44 % Status Unknown
% 0.20/0.48 % Orienting using strategy ClausalAll
% 0.20/0.48 % FOF problem with conjecture
% 0.20/0.48 % 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_2e5e9c.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_cfa6f1.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_df0ae2 | grep -v "SZS"
% 0.20/0.50
% 0.20/0.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ iProver source info
% 0.20/0.50
% 0.20/0.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.50 % git: non_committed_changes: true
% 0.20/0.50 % git: last_make_outside_of_git: true
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.20/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.51 % --bmc1_dump_file -
% 0.20/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.51 % --bmc1_ucm_extend_mode 1
% 0.20/0.51 % --bmc1_ucm_init_mode 2
% 0.20/0.51 % --bmc1_ucm_cone_mode none
% 0.20/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.51 % --bmc1_ucm_relax_model 4
% 0.20/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.51 % --bmc1_ucm_layered_model none
% 0.20/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.51
% 0.20/0.51 % ------ AIG Options
% 0.20/0.51
% 0.20/0.51 % --aig_mode false
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation Options
% 0.20/0.51
% 0.20/0.51 % --instantiation_flag true
% 0.20/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.51 % --inst_solver_per_active 750
% 0.20/0.51 % --inst_solver_calls_frac 0.5
% 0.20/0.51 % --inst_passive_queue_type priority_queues
% 0.20/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.51 % --inst_passive_queues_freq [25;2]
% 0.20/0.51 % --inst_dismatching true
% 0.20/0.51 % --inst_eager_unprocessed_to_passive true
% 0.20/0.51 % --inst_prop_sim_given true
% 0.20/0.51 % --inst_prop_sim_new false
% 0.20/0.51 % --inst_orphan_elimination true
% 0.20/0.51 % --inst_learning_loop_flag true
% 0.20/0.51 % --inst_learning_start 3000
% 0.20/0.51 % --inst_learning_factor 2
% 0.20/0.51 % --inst_start_prop_sim_after_learn 3
% 0.20/0.51 % --inst_sel_renew solver
% 0.20/0.51 % --inst_lit_activity_flag true
% 0.20/0.51 % --inst_out_proof true
% 0.20/0.51
% 0.20/0.51 % ------ Resolution Options
% 0.20/0.51
% 0.20/0.51 % --resolution_flag true
% 0.20/0.51 % --res_lit_sel kbo_max
% 0.20/0.51 % --res_to_prop_solver none
% 0.20/0.51 % --res_prop_simpl_new false
% 0.20/0.51 % --res_prop_simpl_given false
% 0.20/0.51 % --res_passive_queue_type priority_queues
% 0.20/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.51 % --res_passive_queues_freq [15;5]
% 0.20/0.51 % --res_forward_subs full
% 0.20/0.51 % --res_backward_subs full
% 0.20/0.51 % --res_forward_subs_resolution true
% 0.20/0.51 % --res_backward_subs_resolution true
% 0.20/0.51 % --res_orphan_elimination false
% 0.20/0.51 % --res_time_limit 1000.
% 0.20/0.51 % --res_out_proof true
% 0.20/0.51 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2e5e9c.s
% 0.20/0.51 % --modulo true
% 0.20/0.51
% 0.20/0.51 % ------ Combination Options
% 0.20/0.51
% 0.20/0.51 % --comb_res_mult 1000
% 0.20/0.51 % --comb_inst_mult 300
% 0.20/0.51 % ------
% 0.20/0.51
% 0.20/0.51 % ------ Parsing...% successful
% 0.20/0.51
% 0.20/0.51 % ------ 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.51
% 0.20/0.51 % ------ Proving...
% 0.20/0.51 % ------ Problem Properties
% 0.20/0.51
% 0.20/0.51 %
% 0.20/0.51 % EPR false
% 0.20/0.51 % Horn false
% 0.20/0.51 % Has equality true
% 0.20/0.51
% 0.20/0.51 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 % % ------ Current options:
% 0.20/0.51
% 0.20/0.51 % ------ Input Options
% 0.20/0.51
% 0.20/0.51 % --out_options all
% 0.20/0.51 % --tptp_safe_out true
% 0.20/0.51 % --problem_path ""
% 0.20/0.51 % --include_path ""
% 0.20/0.51 % --clausifier .//eprover
% 0.20/0.51 % --clausifier_options --tstp-format
% 0.20/0.51 % --stdin false
% 0.20/0.51 % --dbg_backtrace false
% 0.20/0.51 % --dbg_dump_prop_clauses false
% 0.20/0.51 % --dbg_dump_prop_clauses_file -
% 0.20/0.51 % --dbg_out_stat false
% 0.20/0.51
% 0.20/0.51 % ------ General Options
% 0.20/0.51
% 0.20/0.51 % --fof false
% 0.20/0.51 % --time_out_real 150.
% 0.20/0.51 % --time_out_prep_mult 0.2
% 0.20/0.51 % --time_out_virtual -1.
% 0.20/0.51 % --schedule none
% 0.20/0.51 % --ground_splitting input
% 0.20/0.51 % --splitting_nvd 16
% 0.20/0.51 % --non_eq_to_eq false
% 0.20/0.51 % --prep_gs_sim true
% 0.20/0.51 % --prep_unflatten false
% 0.20/0.51 % --prep_res_sim true
% 0.20/0.51 % --prep_upred true
% 0.20/0.51 % --res_sim_input true
% 0.20/0.51 % --clause_weak_htbl true
% 0.20/0.51 % --gc_record_bc_elim false
% 0.20/0.51 % --symbol_type_check false
% 0.20/0.51 % --clausify_out false
% 0.20/0.51 % --large_theory_mode false
% 0.20/0.51 % --prep_sem_filter none
% 0.20/0.51 % --prep_sem_filter_out false
% 0.20/0.51 % --preprocessed_out false
% 0.20/0.51 % --sub_typing false
% 0.20/0.51 % --brand_transform false
% 0.20/0.51 % --pure_diseq_elim true
% 0.20/0.51 % --min_unsat_core false
% 0.20/0.51 % --pred_elim true
% 0.20/0.51 % --add_important_lit false
% 0.20/0.51 % --soft_assumptions false
% 0.20/0.51 % --reset_solvers false
% 0.20/0.51 % --bc_imp_inh []
% 0.20/0.51 % --conj_cone_tolerance 1.5
% 0.20/0.51 % --prolific_symb_bound 500
% 0.20/0.51 % --lt_threshold 2000
% 0.20/0.51
% 0.20/0.51 % ------ SAT Options
% 0.20/0.51
% 0.20/0.51 % --sat_mode false
% 0.20/0.51 % --sat_fm_restart_options ""
% 0.20/0.51 % --sat_gr_def false
% 0.20/0.51 % --sat_epr_types true
% 0.20/0.51 % --sat_non_cyclic_types false
% 0.20/0.51 % --sat_finite_models false
% 0.20/0.51 % --sat_fm_lemmas false
% 0.20/0.51 % --sat_fm_prep false
% 0.20/0.51 % --sat_fm_uc_incr true
% 0.20/0.51 % --sat_out_model small
% 0.20/0.51 % --sat_out_clauses false
% 0.20/0.51
% 0.20/0.51 % ------ QBF Options
% 0.20/0.51
% 0.20/0.51 % --qbf_mode false
% 0.20/0.51 % --qbf_elim_univ true
% 0.20/0.51 % --qbf_sk_in true
% 0.20/0.51 % --qbf_pred_elim true
% 0.20/0.51 % --qbf_split 32
% 0.20/0.51
% 0.20/0.51 % ------ BMC1 Options
% 0.20/0.51
% 0.20/0.51 % --bmc1_incremental false
% 0.20/0.51 % --bmc1_axioms reachable_all
% 0.20/0.51 % --bmc1_min_bound 0
% 0.20/0.51 % --bmc1_max_bound -1
% 0.20/0.51 % --bmc1_max_bound_default -1
% 0.20/0.51 % --bmc1_symbol_reachability true
% 0.20/0.51 % --bmc1_property_lemmas false
% 0.20/0.51 % --bmc1_k_induction false
% 0.20/0.51 % --bmc1_non_equiv_states false
% 0.20/0.51 % --bmc1_deadlock false
% 0.20/0.51 % --bmc1_ucm false
% 0.20/0.51 % --bmc1_add_unsat_core none
% 0.20/0.51 % --bmc1_unsat_core_children false
% 0.20/0.51 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.51 % --bmc1_out_stat full
% 0.20/0.51 % --bmc1_ground_init false
% 0.20/0.51 % --bmc1_pre_inst_next_state false
% 0.20/0.51 % --bmc1_pre_inst_state false
% 0.20/0.51 % --bmc1_pre_inst_reach_state false
% 0.20/0.51 % --bmc1_out_unsat_core false
% 0.20/0.51 % --bmc1_aig_witness_out false
% 0.20/0.51 % --bmc1_verbose false
% 0.20/0.51 % --bmc1_dump_clauses_tptp false
% 0.20/0.51 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.51 % --bmc1_dump_file -
% 0.20/0.51 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.51 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.51 % --bmc1_ucm_extend_mode 1
% 0.20/0.51 % --bmc1_ucm_init_mode 2
% 0.20/0.51 % --bmc1_ucm_cone_mode none
% 0.20/0.51 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.51 % --bmc1_ucm_relax_model 4
% 0.20/0.51 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.51 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.51 % --bmc1_ucm_layered_model none
% 0.20/0.51 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.51
% 0.20/0.51 % ------ AIG Options
% 0.20/0.51
% 0.20/0.51 % --aig_mode false
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation Options
% 0.20/0.51
% 0.20/0.51 % --instantiation_flag true
% 0.20/0.51 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.51 % --inst_solver_per_active 750
% 0.20/0.51 % --inst_solver_calls_frac 0.5
% 0.20/0.51 % --inst_passive_queue_type priority_queues
% 0.20/0.51 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.51 % --inst_passive_queues_freq [25;2]
% 0.20/0.51 % --inst_dismatching true
% 0.20/0.51 % --inst_eager_unprocessed_to_passive true
% 0.20/0.51 % --inst_prop_sim_given true
% 150.30/150.50 % --inst_prop_sim_new false
% 150.30/150.50 % --inst_orphan_elimination true
% 150.30/150.50 % --inst_learning_loop_flag true
% 150.30/150.50 % --inst_learning_start 3000
% 150.30/150.50 % --inst_learning_factor 2
% 150.30/150.50 % --inst_start_prop_sim_after_learn 3
% 150.30/150.50 % --inst_sel_renew solver
% 150.30/150.50 % --inst_lit_activity_flag true
% 150.30/150.50 % --inst_out_proof true
% 150.30/150.50
% 150.30/150.50 % ------ Resolution Options
% 150.30/150.50
% 150.30/150.50 % --resolution_flag true
% 150.30/150.50 % --res_lit_sel kbo_max
% 150.30/150.50 % --res_to_prop_solver none
% 150.30/150.50 % --res_prop_simpl_new false
% 150.30/150.50 % --res_prop_simpl_given false
% 150.30/150.50 % --res_passive_queue_type priority_queues
% 150.30/150.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 150.30/150.50 % --res_passive_queues_freq [15;5]
% 150.30/150.50 % --res_forward_subs full
% 150.30/150.50 % --res_backward_subs full
% 150.30/150.50 % --res_forward_subs_resolution true
% 150.30/150.50 % --res_backward_subs_resolution true
% 150.30/150.50 % --res_orphan_elimination false
% 150.30/150.50 % --res_time_limit 1000.
% 150.30/150.50 % --res_out_proof true
% 150.30/150.50 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2e5e9c.s
% 150.30/150.50 % --modulo true
% 150.30/150.50
% 150.30/150.50 % ------ Combination Options
% 150.30/150.50
% 150.30/150.50 % --comb_res_mult 1000
% 150.30/150.50 % --comb_inst_mult 300
% 150.30/150.50 % ------
% 150.30/150.50
% 150.30/150.50
% 150.30/150.50
% 150.30/150.50 % ------ Proving...
% 150.30/150.50 %
% 150.30/150.50
% 150.30/150.50
% 150.30/150.50 % Time Out Real
% 150.30/150.50
% 150.30/150.50 % ------ Statistics
% 150.30/150.50
% 150.30/150.50 % ------ General
% 150.30/150.50
% 150.30/150.50 % num_of_input_clauses: 27
% 150.30/150.50 % num_of_input_neg_conjectures: 5
% 150.30/150.50 % num_of_splits: 0
% 150.30/150.50 % num_of_split_atoms: 0
% 150.30/150.50 % num_of_sem_filtered_clauses: 0
% 150.30/150.50 % num_of_subtypes: 0
% 150.30/150.50 % monotx_restored_types: 0
% 150.30/150.50 % sat_num_of_epr_types: 0
% 150.30/150.50 % sat_num_of_non_cyclic_types: 0
% 150.30/150.50 % sat_guarded_non_collapsed_types: 0
% 150.30/150.50 % is_epr: 0
% 150.30/150.50 % is_horn: 0
% 150.30/150.50 % has_eq: 1
% 150.30/150.50 % num_pure_diseq_elim: 0
% 150.30/150.50 % simp_replaced_by: 0
% 150.30/150.50 % res_preprocessed: 10
% 150.30/150.50 % prep_upred: 0
% 150.30/150.50 % prep_unflattend: 0
% 150.30/150.50 % pred_elim_cands: 0
% 150.30/150.50 % pred_elim: 0
% 150.30/150.50 % pred_elim_cl: 0
% 150.30/150.50 % pred_elim_cycles: 0
% 150.30/150.50 % forced_gc_time: 0
% 150.30/150.50 % gc_basic_clause_elim: 0
% 150.30/150.50 % parsing_time: 0.001
% 150.30/150.50 % sem_filter_time: 0.
% 150.30/150.50 % pred_elim_time: 0.
% 150.30/150.50 % out_proof_time: 0.
% 150.30/150.50 % monotx_time: 0.
% 150.30/150.50 % subtype_inf_time: 0.
% 150.30/150.50 % unif_index_cands_time: 0.001
% 150.30/150.50 % unif_index_add_time: 0.03
% 150.30/150.50 % total_time: 150.017
% 150.30/150.50 % num_of_symbols: 36
% 150.30/150.50 % num_of_terms: 3881
% 150.30/150.50
% 150.30/150.50 % ------ Propositional Solver
% 150.30/150.50
% 150.30/150.50 % prop_solver_calls: 1
% 150.30/150.50 % prop_fast_solver_calls: 39
% 150.30/150.50 % prop_num_of_clauses: 26
% 150.30/150.50 % prop_preprocess_simplified: 106
% 150.30/150.50 % prop_fo_subsumed: 0
% 150.30/150.50 % prop_solver_time: 0.
% 150.30/150.50 % prop_fast_solver_time: 0.
% 150.30/150.50 % prop_unsat_core_time: 0.
% 150.30/150.50
% 150.30/150.50 % ------ QBF
% 150.30/150.50
% 150.30/150.50 % qbf_q_res: 0
% 150.30/150.50 % qbf_num_tautologies: 0
% 150.30/150.50 % qbf_prep_cycles: 0
% 150.30/150.50
% 150.30/150.50 % ------ BMC1
% 150.30/150.50
% 150.30/150.50 % bmc1_current_bound: -1
% 150.30/150.50 % bmc1_last_solved_bound: -1
% 150.30/150.50 % bmc1_unsat_core_size: -1
% 150.30/150.50 % bmc1_unsat_core_parents_size: -1
% 150.30/150.50 % bmc1_merge_next_fun: 0
% 150.30/150.50 % bmc1_unsat_core_clauses_time: 0.
% 150.30/150.50
% 150.30/150.50 % ------ Instantiation
% 150.30/150.50
% 150.30/150.50 % inst_num_of_clauses: 27
% 150.30/150.50 % inst_num_in_passive: 0
% 150.30/150.50 % inst_num_in_active: 0
% 150.30/150.50 % inst_num_in_unprocessed: 27
% 150.30/150.50 % inst_num_of_loops: 0
% 150.30/150.50 % inst_num_of_learning_restarts: 0
% 150.30/150.50 % inst_num_moves_active_passive: 0
% 150.30/150.50 % inst_lit_activity: 0
% 150.30/150.50 % inst_lit_activity_moves: 0
% 150.30/150.50 % inst_num_tautologies: 0
% 150.30/150.50 % inst_num_prop_implied: 0
% 150.30/150.50 % inst_num_existing_simplified: 0
% 150.30/150.50 % inst_num_eq_res_simplified: 0
% 150.30/150.50 % inst_num_child_elim: 0
% 150.30/150.50 % inst_num_of_dismatching_blockings: 0
% 150.30/150.50 % inst_num_of_non_proper_insts: 0
% 150.30/150.50 % inst_num_of_duplicates: 0
% 150.30/150.50 % inst_inst_num_from_inst_to_res: 0
% 150.30/150.50 % inst_dismatching_checking_time: 0.
% 150.30/150.50
% 150.30/150.50 % ------ Resolution
% 150.30/150.50
% 150.30/150.50 % res_num_of_clauses: 741
% 150.30/150.50 % res_num_in_passive: 1
% 150.30/150.50 % res_num_in_active: 729
% 150.30/150.50 % res_num_of_loops: 955
% 150.30/150.50 % res_forward_subset_subsumed: 480
% 150.30/150.50 % res_backward_subset_subsumed: 0
% 150.30/150.50 % res_forward_subsumed: 6
% 150.30/150.50 % res_backward_subsumed: 0
% 150.30/150.50 % res_forward_subsumption_resolution: 696
% 150.30/150.50 % res_backward_subsumption_resolution: 0
% 150.30/150.50 % res_clause_to_clause_subsumption: 11507
% 150.30/150.50 % res_orphan_elimination: 0
% 150.30/150.50 % res_tautology_del: 4
% 150.30/150.50 % res_num_eq_res_simplified: 0
% 150.30/150.50 % res_num_sel_changes: 0
% 150.30/150.50 % res_moves_from_active_to_pass: 0
% 150.30/150.50
% 150.30/150.50 % Status Unknown
% 150.30/150.50 % Last status :
% 150.30/150.50 % SZS status Unknown
%------------------------------------------------------------------------------