TSTP Solution File: SEU225+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SEU225+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n016.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 10:26:12 EDT 2022
% Result : Unknown 7.43s 7.70s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SEU225+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 04:09:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.20/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.41 % FOF problem with conjecture
% 0.20/0.41 % 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_bb4fb2.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_87f7ea.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_a58d2f | grep -v "SZS"
% 0.20/0.44
% 0.20/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ iProver source info
% 0.20/0.44
% 0.20/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.44 % git: non_committed_changes: true
% 0.20/0.44 % git: last_make_outside_of_git: true
% 0.20/0.44
% 0.20/0.44 %
% 0.20/0.44 % ------ Input Options
% 0.20/0.44
% 0.20/0.44 % --out_options all
% 0.20/0.44 % --tptp_safe_out true
% 0.20/0.44 % --problem_path ""
% 0.20/0.44 % --include_path ""
% 0.20/0.44 % --clausifier .//eprover
% 0.20/0.44 % --clausifier_options --tstp-format
% 0.20/0.44 % --stdin false
% 0.20/0.44 % --dbg_backtrace false
% 0.20/0.44 % --dbg_dump_prop_clauses false
% 0.20/0.44 % --dbg_dump_prop_clauses_file -
% 0.20/0.44 % --dbg_out_stat false
% 0.20/0.44
% 0.20/0.44 % ------ General Options
% 0.20/0.44
% 0.20/0.44 % --fof false
% 0.20/0.44 % --time_out_real 150.
% 0.20/0.44 % --time_out_prep_mult 0.2
% 0.20/0.44 % --time_out_virtual -1.
% 0.20/0.44 % --schedule none
% 0.20/0.44 % --ground_splitting input
% 0.20/0.44 % --splitting_nvd 16
% 0.20/0.44 % --non_eq_to_eq false
% 0.20/0.44 % --prep_gs_sim true
% 0.20/0.44 % --prep_unflatten false
% 0.20/0.44 % --prep_res_sim true
% 0.20/0.44 % --prep_upred true
% 0.20/0.44 % --res_sim_input true
% 0.20/0.44 % --clause_weak_htbl true
% 0.20/0.44 % --gc_record_bc_elim false
% 0.20/0.44 % --symbol_type_check false
% 0.20/0.44 % --clausify_out false
% 0.20/0.44 % --large_theory_mode false
% 0.20/0.44 % --prep_sem_filter none
% 0.20/0.44 % --prep_sem_filter_out false
% 0.20/0.44 % --preprocessed_out false
% 0.20/0.44 % --sub_typing false
% 0.20/0.44 % --brand_transform false
% 0.20/0.44 % --pure_diseq_elim true
% 0.20/0.44 % --min_unsat_core false
% 0.20/0.44 % --pred_elim true
% 0.20/0.44 % --add_important_lit false
% 0.20/0.44 % --soft_assumptions false
% 0.20/0.44 % --reset_solvers false
% 0.20/0.44 % --bc_imp_inh []
% 0.20/0.44 % --conj_cone_tolerance 1.5
% 0.20/0.44 % --prolific_symb_bound 500
% 0.20/0.44 % --lt_threshold 2000
% 0.20/0.44
% 0.20/0.44 % ------ SAT Options
% 0.20/0.44
% 0.20/0.44 % --sat_mode false
% 0.20/0.44 % --sat_fm_restart_options ""
% 0.20/0.44 % --sat_gr_def false
% 0.20/0.44 % --sat_epr_types true
% 0.20/0.44 % --sat_non_cyclic_types false
% 0.20/0.44 % --sat_finite_models false
% 0.20/0.44 % --sat_fm_lemmas false
% 0.20/0.44 % --sat_fm_prep false
% 0.20/0.44 % --sat_fm_uc_incr true
% 0.20/0.44 % --sat_out_model small
% 0.20/0.44 % --sat_out_clauses false
% 0.20/0.44
% 0.20/0.44 % ------ QBF Options
% 0.20/0.44
% 0.20/0.44 % --qbf_mode false
% 0.20/0.44 % --qbf_elim_univ true
% 0.20/0.44 % --qbf_sk_in true
% 0.20/0.44 % --qbf_pred_elim true
% 0.20/0.44 % --qbf_split 32
% 0.20/0.44
% 0.20/0.44 % ------ BMC1 Options
% 0.20/0.44
% 0.20/0.44 % --bmc1_incremental false
% 0.20/0.44 % --bmc1_axioms reachable_all
% 0.20/0.44 % --bmc1_min_bound 0
% 0.20/0.44 % --bmc1_max_bound -1
% 0.20/0.44 % --bmc1_max_bound_default -1
% 0.20/0.44 % --bmc1_symbol_reachability true
% 0.20/0.44 % --bmc1_property_lemmas false
% 0.20/0.44 % --bmc1_k_induction false
% 0.20/0.44 % --bmc1_non_equiv_states false
% 0.20/0.44 % --bmc1_deadlock false
% 0.20/0.44 % --bmc1_ucm false
% 0.20/0.44 % --bmc1_add_unsat_core none
% 0.20/0.44 % --bmc1_unsat_core_children false
% 0.20/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.44 % --bmc1_out_stat full
% 0.20/0.44 % --bmc1_ground_init false
% 0.20/0.44 % --bmc1_pre_inst_next_state false
% 0.20/0.44 % --bmc1_pre_inst_state false
% 0.20/0.44 % --bmc1_pre_inst_reach_state false
% 0.20/0.44 % --bmc1_out_unsat_core false
% 0.20/0.44 % --bmc1_aig_witness_out false
% 0.20/0.44 % --bmc1_verbose false
% 0.20/0.44 % --bmc1_dump_clauses_tptp false
% 0.48/0.68 % --bmc1_dump_unsat_core_tptp false
% 0.48/0.68 % --bmc1_dump_file -
% 0.48/0.68 % --bmc1_ucm_expand_uc_limit 128
% 0.48/0.68 % --bmc1_ucm_n_expand_iterations 6
% 0.48/0.68 % --bmc1_ucm_extend_mode 1
% 0.48/0.68 % --bmc1_ucm_init_mode 2
% 0.48/0.68 % --bmc1_ucm_cone_mode none
% 0.48/0.68 % --bmc1_ucm_reduced_relation_type 0
% 0.48/0.68 % --bmc1_ucm_relax_model 4
% 0.48/0.68 % --bmc1_ucm_full_tr_after_sat true
% 0.48/0.68 % --bmc1_ucm_expand_neg_assumptions false
% 0.48/0.68 % --bmc1_ucm_layered_model none
% 0.48/0.68 % --bmc1_ucm_max_lemma_size 10
% 0.48/0.68
% 0.48/0.68 % ------ AIG Options
% 0.48/0.68
% 0.48/0.68 % --aig_mode false
% 0.48/0.68
% 0.48/0.68 % ------ Instantiation Options
% 0.48/0.68
% 0.48/0.68 % --instantiation_flag true
% 0.48/0.68 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.48/0.68 % --inst_solver_per_active 750
% 0.48/0.68 % --inst_solver_calls_frac 0.5
% 0.48/0.68 % --inst_passive_queue_type priority_queues
% 0.48/0.68 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.48/0.68 % --inst_passive_queues_freq [25;2]
% 0.48/0.68 % --inst_dismatching true
% 0.48/0.68 % --inst_eager_unprocessed_to_passive true
% 0.48/0.68 % --inst_prop_sim_given true
% 0.48/0.68 % --inst_prop_sim_new false
% 0.48/0.68 % --inst_orphan_elimination true
% 0.48/0.68 % --inst_learning_loop_flag true
% 0.48/0.68 % --inst_learning_start 3000
% 0.48/0.68 % --inst_learning_factor 2
% 0.48/0.68 % --inst_start_prop_sim_after_learn 3
% 0.48/0.68 % --inst_sel_renew solver
% 0.48/0.68 % --inst_lit_activity_flag true
% 0.48/0.68 % --inst_out_proof true
% 0.48/0.68
% 0.48/0.68 % ------ Resolution Options
% 0.48/0.68
% 0.48/0.68 % --resolution_flag true
% 0.48/0.68 % --res_lit_sel kbo_max
% 0.48/0.68 % --res_to_prop_solver none
% 0.48/0.68 % --res_prop_simpl_new false
% 0.48/0.68 % --res_prop_simpl_given false
% 0.48/0.68 % --res_passive_queue_type priority_queues
% 0.48/0.68 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.48/0.68 % --res_passive_queues_freq [15;5]
% 0.48/0.68 % --res_forward_subs full
% 0.48/0.68 % --res_backward_subs full
% 0.48/0.68 % --res_forward_subs_resolution true
% 0.48/0.68 % --res_backward_subs_resolution true
% 0.48/0.68 % --res_orphan_elimination false
% 0.48/0.68 % --res_time_limit 1000.
% 0.48/0.68 % --res_out_proof true
% 0.48/0.68 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_bb4fb2.s
% 0.48/0.68 % --modulo true
% 0.48/0.68
% 0.48/0.68 % ------ Combination Options
% 0.48/0.68
% 0.48/0.68 % --comb_res_mult 1000
% 0.48/0.68 % --comb_inst_mult 300
% 0.48/0.68 % ------
% 0.48/0.68
% 0.48/0.68 % ------ Parsing...% successful
% 0.48/0.68
% 0.48/0.68 % ------ 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.48/0.68
% 0.48/0.68 % ------ Proving...
% 0.48/0.68 % ------ Problem Properties
% 0.48/0.68
% 0.48/0.68 %
% 0.48/0.68 % EPR false
% 0.48/0.68 % Horn false
% 0.48/0.68 % Has equality true
% 0.48/0.68
% 0.48/0.68 % % ------ Input Options Time Limit: Unbounded
% 0.48/0.68
% 0.48/0.68
% 0.48/0.68 Compiling...
% 0.48/0.68 Loading plugin: done.
% 0.48/0.68 Compiling...
% 0.48/0.68 Loading plugin: done.
% 0.48/0.68 % % ------ Current options:
% 0.48/0.68
% 0.48/0.68 % ------ Input Options
% 0.48/0.68
% 0.48/0.68 % --out_options all
% 0.48/0.68 % --tptp_safe_out true
% 0.48/0.68 % --problem_path ""
% 0.48/0.68 % --include_path ""
% 0.48/0.68 % --clausifier .//eprover
% 0.48/0.68 % --clausifier_options --tstp-format
% 0.48/0.68 % --stdin false
% 0.48/0.68 % --dbg_backtrace false
% 0.48/0.68 % --dbg_dump_prop_clauses false
% 0.48/0.68 % --dbg_dump_prop_clauses_file -
% 0.48/0.68 % --dbg_out_stat false
% 0.48/0.68
% 0.48/0.68 % ------ General Options
% 0.48/0.68
% 0.48/0.68 % --fof false
% 0.48/0.68 % --time_out_real 150.
% 0.48/0.68 % --time_out_prep_mult 0.2
% 0.48/0.68 % --time_out_virtual -1.
% 0.48/0.68 % --schedule none
% 0.48/0.68 % --ground_splitting input
% 0.48/0.68 % --splitting_nvd 16
% 0.48/0.68 % --non_eq_to_eq false
% 0.48/0.68 % --prep_gs_sim true
% 0.48/0.68 % --prep_unflatten false
% 0.48/0.68 % --prep_res_sim true
% 0.48/0.68 % --prep_upred true
% 0.48/0.68 % --res_sim_input true
% 0.48/0.68 % --clause_weak_htbl true
% 0.48/0.68 % --gc_record_bc_elim false
% 0.48/0.68 % --symbol_type_check false
% 0.48/0.68 % --clausify_out false
% 0.48/0.68 % --large_theory_mode false
% 0.48/0.68 % --prep_sem_filter none
% 0.48/0.68 % --prep_sem_filter_out false
% 0.48/0.68 % --preprocessed_out false
% 0.48/0.68 % --sub_typing false
% 0.48/0.68 % --brand_transform false
% 0.48/0.68 % --pure_diseq_elim true
% 0.48/0.68 % --min_unsat_core false
% 0.48/0.68 % --pred_elim true
% 0.48/0.68 % --add_important_lit false
% 0.48/0.68 % --soft_assumptions false
% 0.48/0.68 % --reset_solvers false
% 0.48/0.68 % --bc_imp_inh []
% 0.48/0.68 % --conj_cone_tolerance 1.5
% 0.48/0.68 % --prolific_symb_bound 500
% 0.48/0.68 % --lt_threshold 2000
% 0.48/0.68
% 0.48/0.68 % ------ SAT Options
% 0.48/0.68
% 0.48/0.68 % --sat_mode false
% 0.48/0.68 % --sat_fm_restart_options ""
% 0.48/0.68 % --sat_gr_def false
% 0.48/0.68 % --sat_epr_types true
% 0.48/0.68 % --sat_non_cyclic_types false
% 0.48/0.68 % --sat_finite_models false
% 0.48/0.68 % --sat_fm_lemmas false
% 0.48/0.68 % --sat_fm_prep false
% 0.48/0.68 % --sat_fm_uc_incr true
% 0.48/0.68 % --sat_out_model small
% 0.48/0.68 % --sat_out_clauses false
% 0.48/0.68
% 0.48/0.68 % ------ QBF Options
% 0.48/0.68
% 0.48/0.68 % --qbf_mode false
% 0.48/0.68 % --qbf_elim_univ true
% 0.48/0.68 % --qbf_sk_in true
% 0.48/0.68 % --qbf_pred_elim true
% 0.48/0.68 % --qbf_split 32
% 0.48/0.68
% 0.48/0.68 % ------ BMC1 Options
% 0.48/0.68
% 0.48/0.68 % --bmc1_incremental false
% 0.48/0.68 % --bmc1_axioms reachable_all
% 0.48/0.68 % --bmc1_min_bound 0
% 0.48/0.68 % --bmc1_max_bound -1
% 0.48/0.68 % --bmc1_max_bound_default -1
% 0.48/0.68 % --bmc1_symbol_reachability true
% 0.48/0.68 % --bmc1_property_lemmas false
% 0.48/0.68 % --bmc1_k_induction false
% 0.48/0.68 % --bmc1_non_equiv_states false
% 0.48/0.68 % --bmc1_deadlock false
% 0.48/0.68 % --bmc1_ucm false
% 0.48/0.68 % --bmc1_add_unsat_core none
% 0.48/0.68 % --bmc1_unsat_core_children false
% 0.48/0.68 % --bmc1_unsat_core_extrapolate_axioms false
% 0.48/0.68 % --bmc1_out_stat full
% 0.48/0.68 % --bmc1_ground_init false
% 0.48/0.68 % --bmc1_pre_inst_next_state false
% 0.48/0.68 % --bmc1_pre_inst_state false
% 0.48/0.68 % --bmc1_pre_inst_reach_state false
% 0.48/0.68 % --bmc1_out_unsat_core false
% 0.48/0.68 % --bmc1_aig_witness_out false
% 0.48/0.68 % --bmc1_verbose false
% 0.48/0.68 % --bmc1_dump_clauses_tptp false
% 0.48/0.68 % --bmc1_dump_unsat_core_tptp false
% 0.48/0.68 % --bmc1_dump_file -
% 0.48/0.68 % --bmc1_ucm_expand_uc_limit 128
% 0.48/0.68 % --bmc1_ucm_n_expand_iterations 6
% 0.48/0.68 % --bmc1_ucm_extend_mode 1
% 0.48/0.68 % --bmc1_ucm_init_mode 2
% 0.48/0.68 % --bmc1_ucm_cone_mode none
% 0.48/0.68 % --bmc1_ucm_reduced_relation_type 0
% 0.48/0.68 % --bmc1_ucm_relax_model 4
% 0.48/0.68 % --bmc1_ucm_full_tr_after_sat true
% 0.48/0.68 % --bmc1_ucm_expand_neg_assumptions false
% 0.48/0.68 % --bmc1_ucm_layered_model none
% 0.48/0.68 % --bmc1_ucm_max_lemma_size 10
% 0.48/0.68
% 0.48/0.68 % ------ AIG Options
% 0.48/0.68
% 0.48/0.68 % --aig_mode false
% 0.48/0.68
% 0.48/0.68 % ------ Instantiation Options
% 0.48/0.68
% 0.48/0.68 % --instantiation_flag true
% 0.48/0.68 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.48/0.68 % --inst_solver_per_active 750
% 0.48/0.68 % --inst_solver_calls_frac 0.5
% 0.48/0.68 % --inst_passive_queue_type priority_queues
% 0.48/0.68 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.48/0.68 % --inst_passive_queues_freq [25;2]
% 0.48/0.68 % --inst_dismatching true
% 3.83/4.07 % --inst_eager_unprocessed_to_passive true
% 3.83/4.07 % --inst_prop_sim_given true
% 3.83/4.07 % --inst_prop_sim_new false
% 3.83/4.07 % --inst_orphan_elimination true
% 3.83/4.07 % --inst_learning_loop_flag true
% 3.83/4.07 % --inst_learning_start 3000
% 3.83/4.07 % --inst_learning_factor 2
% 3.83/4.07 % --inst_start_prop_sim_after_learn 3
% 3.83/4.07 % --inst_sel_renew solver
% 3.83/4.07 % --inst_lit_activity_flag true
% 3.83/4.07 % --inst_out_proof true
% 3.83/4.07
% 3.83/4.07 % ------ Resolution Options
% 3.83/4.07
% 3.83/4.07 % --resolution_flag true
% 3.83/4.07 % --res_lit_sel kbo_max
% 3.83/4.07 % --res_to_prop_solver none
% 3.83/4.07 % --res_prop_simpl_new false
% 3.83/4.07 % --res_prop_simpl_given false
% 3.83/4.07 % --res_passive_queue_type priority_queues
% 3.83/4.07 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.83/4.07 % --res_passive_queues_freq [15;5]
% 3.83/4.07 % --res_forward_subs full
% 3.83/4.07 % --res_backward_subs full
% 3.83/4.07 % --res_forward_subs_resolution true
% 3.83/4.07 % --res_backward_subs_resolution true
% 3.83/4.07 % --res_orphan_elimination false
% 3.83/4.07 % --res_time_limit 1000.
% 3.83/4.07 % --res_out_proof true
% 3.83/4.07 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_bb4fb2.s
% 3.83/4.07 % --modulo true
% 3.83/4.07
% 3.83/4.07 % ------ Combination Options
% 3.83/4.07
% 3.83/4.07 % --comb_res_mult 1000
% 3.83/4.07 % --comb_inst_mult 300
% 3.83/4.07 % ------
% 3.83/4.07
% 3.83/4.07
% 3.83/4.07
% 3.83/4.07 % ------ Proving...
% 3.83/4.07 % warning: shown sat in sat incomplete mode
% 3.83/4.07 %
% 3.83/4.07
% 3.83/4.07
% 3.83/4.07 ------ Building Model...Done
% 3.83/4.07
% 3.83/4.07 %------ The model is defined over ground terms (initial term algebra).
% 3.83/4.07 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.83/4.07 %------ where \phi is a formula over the term algebra.
% 3.83/4.07 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.83/4.07 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.83/4.07 %------ See help for --sat_out_model for different model outputs.
% 3.83/4.07 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.83/4.07 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.83/4.07
% 3.83/4.07
% 3.83/4.07
% 3.83/4.07
% 3.83/4.07 %------ Positive definition of $true
% 3.83/4.07 fof(lit_def,axiom,
% 3.83/4.07 ( $true <=>
% 3.83/4.07 $true
% 3.83/4.07 )
% 3.83/4.07 ).
% 3.83/4.07
% 3.83/4.07 %------ Negative definition of equality_sorted
% 3.83/4.07 fof(lit_def,axiom,
% 3.83/4.07 (! [X0,X0,X1] :
% 3.83/4.07 ( ~(equality_sorted(X0,X0,X1)) <=>
% 3.83/4.07 (
% 3.83/4.07 (
% 3.83/4.07 ( X0=$i & X0=apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0) & X1=empty_set )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=$i & X0=apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0) & X1=apply(sk3_esk3_0,sk3_esk2_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2,X3] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=$i & X0=apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0) & X1=apply(X2,X3) )
% 3.83/4.07 &
% 3.83/4.07 ( X2!=relation_dom_restriction(X2,X3) )
% 3.83/4.07 &
% 3.83/4.07 ( X3!=sk3_esk2_0 )
% 3.83/4.07 &
% 3.83/4.07 ! [X4] : ( X3!=ordered_pair(X3,X4) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2,X3,X4] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=$i & X0=apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0) & X1=apply(relation_dom_restriction(X2,X3),X4) )
% 3.83/4.07 &
% 3.83/4.07 ( X4!=sk3_esk2_0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2,X3,X4] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=$i & X0=apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0) & X1=apply(X2,ordered_pair(X3,X4)) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=$i & X0=apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0) & X1=apply(X2,sk3_esk2_0) )
% 3.83/4.07 &
% 3.83/4.07 ( X2!=relation_dom(X2) )
% 3.83/4.07 &
% 3.83/4.07 ! [X3] : ( X2!=relation_dom_restriction(X2,X3) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2,X3] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=$i & X0=apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0) & X1=apply(relation_dom_restriction(X2,X3),sk3_esk2_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=$i & X0=apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0) & X1=apply(relation_dom(X2),sk3_esk2_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 ).
% 3.83/4.07
% 3.83/4.07 %------ Negative definition of function
% 3.83/4.07 fof(lit_def,axiom,
% 3.83/4.07 (! [X0] :
% 3.83/4.07 ( ~(function(X0)) <=>
% 3.83/4.07 (
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk5_0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 ).
% 3.83/4.07
% 3.83/4.07 %------ Negative definition of relation
% 3.83/4.07 fof(lit_def,axiom,
% 3.83/4.07 (! [X0] :
% 3.83/4.07 ( ~(relation(X0)) <=>
% 3.83/4.07 (
% 3.83/4.07 ? [X1,X2] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=ordered_pair(X1,X2) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk4_0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X1] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=singleton(X1) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk3_esk1_0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=apply(sk3_esk3_0,sk3_esk2_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=relation_dom(sk2_esk5_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X1,X2] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=unordered_pair(X1,X2) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 ).
% 3.83/4.07
% 3.83/4.07 %------ Positive definition of in
% 3.83/4.07 fof(lit_def,axiom,
% 3.83/4.07 (! [X0,X1] :
% 3.83/4.07 ( in(X0,X1) <=>
% 3.83/4.07 (
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk3_esk2_0 & X1=sk3_esk1_0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk10_1(sk2_esk5_0) & X1=sk2_esk5_0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk10_1(sk2_esk4_0) & X1=sk2_esk4_0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk10_1(sk3_esk1_0) & X1=sk3_esk1_0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk10_1(apply(sk3_esk3_0,sk3_esk2_0)) & X1=apply(sk3_esk3_0,sk3_esk2_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk10_1(relation_dom(sk2_esk5_0)) & X1=relation_dom(sk2_esk5_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk10_1(apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0)) & X1=apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk10_1(singleton(X2)) & X1=singleton(X2) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2,X3] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk10_1(ordered_pair(X2,X3)) & X1=ordered_pair(X2,X3) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2,X3] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk10_1(unordered_pair(X2,X3)) & X1=unordered_pair(X2,X3) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 ).
% 3.83/4.07
% 3.83/4.07 %------ Negative definition of relation_empty_yielding
% 3.83/4.07 fof(lit_def,axiom,
% 3.83/4.07 (! [X0] :
% 3.83/4.07 ( ~(relation_empty_yielding(X0)) <=>
% 3.83/4.07 $false
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 ).
% 3.83/4.07
% 3.83/4.07 %------ Negative definition of empty
% 3.83/4.07 fof(lit_def,axiom,
% 3.83/4.07 (! [X0] :
% 3.83/4.07 ( ~(empty(X0)) <=>
% 3.83/4.07 (
% 3.83/4.07 ? [X1,X2] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=ordered_pair(X1,X2) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk5_0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk2_esk4_0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X1] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=singleton(X1) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=sk3_esk1_0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=apply(sk3_esk3_0,sk3_esk2_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X0=relation_dom(sk2_esk5_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X1,X2] :
% 3.83/4.07 (
% 3.83/4.07 ( X0=unordered_pair(X1,X2) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 ).
% 3.83/4.07
% 3.83/4.07 %------ Positive definition of one_to_one
% 3.83/4.07 fof(lit_def,axiom,
% 3.83/4.07 (! [X0] :
% 3.83/4.07 ( one_to_one(X0) <=>
% 3.83/4.07 $true
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 ).
% 3.83/4.07
% 3.83/4.07 %------ Negative definition of element
% 3.83/4.07 fof(lit_def,axiom,
% 3.83/4.07 (! [X0,X1] :
% 3.83/4.07 ( ~(element(X0,X1)) <=>
% 3.83/4.07 (
% 3.83/4.07 ? [X2,X3] :
% 3.83/4.07 (
% 3.83/4.07 ( X1=relation_dom_restriction(X2,X3) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(relation_dom_restriction(X0,X2)) | X2!=X0 | X3!=X2 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X1=sk2_esk5_0 )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(sk2_esk5_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X1=sk2_esk4_0 )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(sk2_esk4_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X1=sk3_esk1_0 )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk3_esk2_0 )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(sk3_esk1_0) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X1=apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0)) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X1=apply(sk3_esk3_0,sk3_esk2_0) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(apply(sk3_esk3_0,sk3_esk2_0)) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X1=relation_dom(sk3_esk3_0) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(relation_dom(sk3_esk3_0)) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2,X3] :
% 3.83/4.07 (
% 3.83/4.07 ( X1=set_intersection2(relation_dom(X2),X3) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(set_intersection2(relation_dom(X0),X2)) | X2!=X0 | X3!=X2 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X1=relation_dom(sk2_esk5_0) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(relation_dom(sk2_esk5_0)) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X1=relation_dom(apply(sk3_esk3_0,sk3_esk2_0)) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(relation_dom(apply(sk3_esk3_0,sk3_esk2_0))) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2,X3] :
% 3.83/4.07 (
% 3.83/4.07 ( X1=ordered_pair(X2,X3) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(ordered_pair(X0,X2)) | X2!=X0 | X3!=X2 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 (
% 3.83/4.07 ( X1=relation_dom(apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0)) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(relation_dom(apply(relation_dom_restriction(sk3_esk3_0,sk3_esk1_0),sk3_esk2_0))) )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2,X3] :
% 3.83/4.07 (
% 3.83/4.07 ( X1=set_intersection2(relation_dom_restriction(X2,X3),relation_dom_restriction(X2,X3)) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(set_intersection2(relation_dom_restriction(X0,X2),relation_dom_restriction(X0,X2))) | X2!=X0 | X3!=X2 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2,X3] :
% 3.83/4.07 (
% 3.83/4.07 ( X1=unordered_pair(X2,X3) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(unordered_pair(X0,X2)) | X2!=X0 | X3!=X2 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2] :
% 3.83/4.07 (
% 3.83/4.07 ( X1=singleton(X2) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(singleton(X0)) | X2!=X0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 |
% 3.83/4.07 ? [X2] :
% 3.83/4.07 (
% 3.83/4.07 ( X1=relation_dom(relation_dom_restriction(X2,sk3_esk1_0)) )
% 3.83/4.07 &
% 3.83/4.07 ( X0!=sk2_esk10_1(relation_dom(relation_dom_restriction(X0,sk3_esk1_0))) | X2!=X0 )
% 3.83/4.07 )
% 3.83/4.07
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 )
% 3.83/4.07 ).
% 3.83/4.07
% 3.83/4.07
% 3.83/4.07
% 3.83/4.07 % ------ Statistics
% 3.83/4.07
% 3.83/4.07 % ------ General
% 3.83/4.07
% 3.83/4.07 % num_of_input_clauses: 143
% 3.83/4.07 % num_of_input_neg_conjectures: 4
% 3.83/4.07 % num_of_splits: 0
% 3.83/4.07 % num_of_split_atoms: 0
% 3.83/4.07 % num_of_sem_filtered_clauses: 0
% 3.83/4.07 % num_of_subtypes: 0
% 3.83/4.07 % monotx_restored_types: 0
% 3.83/4.07 % sat_num_of_epr_types: 0
% 3.83/4.07 % sat_num_of_non_cyclic_types: 0
% 3.83/4.07 % sat_guarded_non_collapsed_types: 0
% 3.83/4.07 % is_epr: 0
% 3.83/4.07 % is_horn: 0
% 3.83/4.07 % has_eq: 1
% 3.83/4.07 % num_pure_diseq_elim: 0
% 3.83/4.07 % simp_replaced_by: 0
% 3.83/4.07 % res_preprocessed: 8
% 3.83/4.07 % prep_upred: 0
% 3.83/4.07 % prep_unflattend: 0
% 3.83/4.07 % pred_elim_cands: 0
% 3.83/4.07 % pred_elim: 0
% 3.83/4.07 % pred_elim_cl: 0
% 3.83/4.07 % pred_elim_cycles: 0
% 3.83/4.07 % forced_gc_time: 0
% 3.83/4.07 % gc_basic_clause_elim: 0
% 3.83/4.07 % parsing_time: 0.006
% 3.83/4.07 % sem_filter_time: 0.
% 3.83/4.07 % pred_elim_time: 0.
% 3.83/4.07 % out_proof_time: 0.
% 3.83/4.07 % monotx_time: 0.
% 3.83/4.07 % subtype_inf_time: 0.
% 3.83/4.07 % unif_index_cands_time: 0.008
% 3.83/4.07 % unif_index_add_time: 0.004
% 3.83/4.07 % total_time: 3.649
% 3.83/4.07 % num_of_symbols: 53
% 3.83/4.07 % num_of_terms: 30977
% 3.83/4.07
% 3.83/4.07 % ------ Propositional Solver
% 3.83/4.07
% 3.83/4.07 % prop_solver_calls: 9
% 3.83/4.07 % prop_fast_solver_calls: 12
% 3.83/4.07 % prop_num_of_clauses: 465
% 3.83/4.07 % prop_preprocess_simplified: 1135
% 3.83/4.07 % prop_fo_subsumed: 0
% 3.83/4.07 % prop_solver_time: 0.
% 3.83/4.07 % prop_fast_solver_time: 0.
% 3.83/4.07 % prop_unsat_core_time: 0.
% 3.83/4.07
% 3.83/4.07 % ------ QBF
% 3.83/4.07
% 3.83/4.07 % qbf_q_res: 0
% 3.83/4.07 % qbf_num_tautologies: 0
% 3.83/4.07 % qbf_prep_cycles: 0
% 3.83/4.07
% 3.83/4.07 % ------ BMC1
% 3.83/4.07
% 3.83/4.07 % bmc1_current_bound: -1
% 3.83/4.07 % bmc1_last_solved_bound: -1
% 3.83/4.07 % bmc1_unsat_core_size: -1
% 3.83/4.07 % bmc1_unsat_core_parents_size: -1
% 3.83/4.07 % bmc1_merge_next_fun: 0
% 3.83/4.07 % bmc1_unsat_core_clauses_time: 0.
% 3.83/4.07
% 3.83/4.07 % ------ Instantiation
% 3.83/4.07
% 3.83/4.07 % inst_num_of_clauses: 374
% 3.83/4.07 % inst_num_in_passive: 0
% 3.83/4.07 % inst_num_in_active: 366
% 3.83/4.07 % inst_num_in_unprocessed: 0
% 3.83/4.07 % inst_num_of_loops: 477
% 3.83/4.07 % inst_num_of_learning_restarts: 0
% 3.83/4.07 % inst_num_moves_active_passive: 95
% 3.83/4.07 % inst_lit_activity: 44
% 3.83/4.07 % inst_lit_activity_moves: 0
% 3.83/4.07 % inst_num_tautologies: 8
% 3.83/4.07 % inst_num_prop_implied: 0
% 3.83/4.07 % inst_num_existing_simplified: 0
% 3.83/4.07 % inst_num_eq_res_simplified: 0
% 3.83/4.07 % inst_num_child_elim: 0
% 3.83/4.07 % inst_num_of_dismatching_blockings: 110
% 3.83/4.07 % inst_num_of_non_proper_insts: 532
% 3.83/4.07 % inst_num_of_duplicates: 320
% 3.83/4.07 % inst_inst_num_from_inst_to_res: 0
% 3.83/4.07 % inst_dismatching_checking_time: 0.
% 3.83/4.07
% 3.83/4.07 % ------ Resolution
% 3.83/4.07
% 3.83/4.07 % res_num_of_clauses: 985
% 3.83/4.07 % res_num_in_passive: 178
% 3.83/4.07 % res_num_in_active: 714
% 3.83/4.07 % res_num_of_loops: 2000
% 3.83/4.07 % res_forward_subset_subsumed: 66
% 3.83/4.07 % res_backward_subset_subsumed: 1
% 3.83/4.07 % res_forward_subsumed: 1349
% 3.83/4.07 % res_backward_subsumed: 0
% 3.83/4.07 % res_forward_subsumption_resolution: 179
% 3.83/4.07 % res_backward_subsumption_resolution: 0
% 3.83/4.07 % res_clause_to_clause_subsumption: 57945
% 3.83/4.07 % res_orphan_elimination: 0
% 3.83/4.07 % res_tautology_del: 1191
% 3.83/4.07 % res_num_eq_res_simplified: 0
% 3.83/4.07 % res_num_sel_changes: 0
% 3.83/4.07 % res_moves_from_active_to_pass: 0
% 3.83/4.07
% 3.83/4.07 % Status Unknown
% 3.90/4.11 % Orienting using strategy ClausalAll
% 3.90/4.11 % FOF problem with conjecture
% 3.90/4.11 % 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_bb4fb2.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_87f7ea.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_f76b57 | grep -v "SZS"
% 3.90/4.13
% 3.90/4.13 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 3.90/4.13
% 3.90/4.13 %
% 3.90/4.13 % ------ iProver source info
% 3.90/4.13
% 3.90/4.13 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 3.90/4.13 % git: non_committed_changes: true
% 3.90/4.13 % git: last_make_outside_of_git: true
% 3.90/4.13
% 3.90/4.13 %
% 3.90/4.13 % ------ Input Options
% 3.90/4.13
% 3.90/4.13 % --out_options all
% 3.90/4.13 % --tptp_safe_out true
% 3.90/4.13 % --problem_path ""
% 3.90/4.13 % --include_path ""
% 3.90/4.13 % --clausifier .//eprover
% 3.90/4.13 % --clausifier_options --tstp-format
% 3.90/4.13 % --stdin false
% 3.90/4.13 % --dbg_backtrace false
% 3.90/4.13 % --dbg_dump_prop_clauses false
% 3.90/4.13 % --dbg_dump_prop_clauses_file -
% 3.90/4.13 % --dbg_out_stat false
% 3.90/4.13
% 3.90/4.13 % ------ General Options
% 3.90/4.13
% 3.90/4.13 % --fof false
% 3.90/4.13 % --time_out_real 150.
% 3.90/4.13 % --time_out_prep_mult 0.2
% 3.90/4.13 % --time_out_virtual -1.
% 3.90/4.13 % --schedule none
% 3.90/4.13 % --ground_splitting input
% 3.90/4.13 % --splitting_nvd 16
% 3.90/4.13 % --non_eq_to_eq false
% 3.90/4.13 % --prep_gs_sim true
% 3.90/4.13 % --prep_unflatten false
% 3.90/4.13 % --prep_res_sim true
% 3.90/4.13 % --prep_upred true
% 3.90/4.13 % --res_sim_input true
% 3.90/4.13 % --clause_weak_htbl true
% 3.90/4.13 % --gc_record_bc_elim false
% 3.90/4.13 % --symbol_type_check false
% 3.90/4.13 % --clausify_out false
% 3.90/4.13 % --large_theory_mode false
% 3.90/4.13 % --prep_sem_filter none
% 3.90/4.13 % --prep_sem_filter_out false
% 3.90/4.13 % --preprocessed_out false
% 3.90/4.13 % --sub_typing false
% 3.90/4.13 % --brand_transform false
% 3.90/4.13 % --pure_diseq_elim true
% 3.90/4.13 % --min_unsat_core false
% 3.90/4.13 % --pred_elim true
% 3.90/4.13 % --add_important_lit false
% 3.90/4.13 % --soft_assumptions false
% 3.90/4.13 % --reset_solvers false
% 3.90/4.13 % --bc_imp_inh []
% 3.90/4.13 % --conj_cone_tolerance 1.5
% 3.90/4.13 % --prolific_symb_bound 500
% 3.90/4.13 % --lt_threshold 2000
% 3.90/4.13
% 3.90/4.13 % ------ SAT Options
% 3.90/4.13
% 3.90/4.13 % --sat_mode false
% 3.90/4.13 % --sat_fm_restart_options ""
% 3.90/4.13 % --sat_gr_def false
% 3.90/4.13 % --sat_epr_types true
% 3.90/4.13 % --sat_non_cyclic_types false
% 3.90/4.13 % --sat_finite_models false
% 3.90/4.13 % --sat_fm_lemmas false
% 3.90/4.13 % --sat_fm_prep false
% 3.90/4.13 % --sat_fm_uc_incr true
% 3.90/4.13 % --sat_out_model small
% 3.90/4.13 % --sat_out_clauses false
% 3.90/4.13
% 3.90/4.13 % ------ QBF Options
% 3.90/4.13
% 3.90/4.13 % --qbf_mode false
% 3.90/4.13 % --qbf_elim_univ true
% 3.90/4.13 % --qbf_sk_in true
% 3.90/4.13 % --qbf_pred_elim true
% 3.90/4.13 % --qbf_split 32
% 3.90/4.13
% 3.90/4.13 % ------ BMC1 Options
% 3.90/4.13
% 3.90/4.13 % --bmc1_incremental false
% 3.90/4.13 % --bmc1_axioms reachable_all
% 3.90/4.13 % --bmc1_min_bound 0
% 3.90/4.13 % --bmc1_max_bound -1
% 3.90/4.13 % --bmc1_max_bound_default -1
% 3.90/4.13 % --bmc1_symbol_reachability true
% 3.90/4.13 % --bmc1_property_lemmas false
% 3.90/4.13 % --bmc1_k_induction false
% 3.90/4.13 % --bmc1_non_equiv_states false
% 3.90/4.13 % --bmc1_deadlock false
% 3.90/4.13 % --bmc1_ucm false
% 3.90/4.13 % --bmc1_add_unsat_core none
% 3.90/4.13 % --bmc1_unsat_core_children false
% 3.90/4.13 % --bmc1_unsat_core_extrapolate_axioms false
% 3.90/4.13 % --bmc1_out_stat full
% 3.90/4.13 % --bmc1_ground_init false
% 3.90/4.13 % --bmc1_pre_inst_next_state false
% 3.90/4.13 % --bmc1_pre_inst_state false
% 3.90/4.13 % --bmc1_pre_inst_reach_state false
% 3.90/4.13 % --bmc1_out_unsat_core false
% 3.90/4.13 % --bmc1_aig_witness_out false
% 3.90/4.13 % --bmc1_verbose false
% 3.90/4.13 % --bmc1_dump_clauses_tptp false
% 3.92/4.36 % --bmc1_dump_unsat_core_tptp false
% 3.92/4.36 % --bmc1_dump_file -
% 3.92/4.36 % --bmc1_ucm_expand_uc_limit 128
% 3.92/4.36 % --bmc1_ucm_n_expand_iterations 6
% 3.92/4.36 % --bmc1_ucm_extend_mode 1
% 3.92/4.36 % --bmc1_ucm_init_mode 2
% 3.92/4.36 % --bmc1_ucm_cone_mode none
% 3.92/4.36 % --bmc1_ucm_reduced_relation_type 0
% 3.92/4.36 % --bmc1_ucm_relax_model 4
% 3.92/4.36 % --bmc1_ucm_full_tr_after_sat true
% 3.92/4.36 % --bmc1_ucm_expand_neg_assumptions false
% 3.92/4.36 % --bmc1_ucm_layered_model none
% 3.92/4.36 % --bmc1_ucm_max_lemma_size 10
% 3.92/4.36
% 3.92/4.36 % ------ AIG Options
% 3.92/4.36
% 3.92/4.36 % --aig_mode false
% 3.92/4.36
% 3.92/4.36 % ------ Instantiation Options
% 3.92/4.36
% 3.92/4.36 % --instantiation_flag true
% 3.92/4.36 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 3.92/4.36 % --inst_solver_per_active 750
% 3.92/4.36 % --inst_solver_calls_frac 0.5
% 3.92/4.36 % --inst_passive_queue_type priority_queues
% 3.92/4.36 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 3.92/4.36 % --inst_passive_queues_freq [25;2]
% 3.92/4.36 % --inst_dismatching true
% 3.92/4.36 % --inst_eager_unprocessed_to_passive true
% 3.92/4.36 % --inst_prop_sim_given true
% 3.92/4.36 % --inst_prop_sim_new false
% 3.92/4.36 % --inst_orphan_elimination true
% 3.92/4.36 % --inst_learning_loop_flag true
% 3.92/4.36 % --inst_learning_start 3000
% 3.92/4.36 % --inst_learning_factor 2
% 3.92/4.36 % --inst_start_prop_sim_after_learn 3
% 3.92/4.36 % --inst_sel_renew solver
% 3.92/4.36 % --inst_lit_activity_flag true
% 3.92/4.36 % --inst_out_proof true
% 3.92/4.36
% 3.92/4.36 % ------ Resolution Options
% 3.92/4.36
% 3.92/4.36 % --resolution_flag true
% 3.92/4.36 % --res_lit_sel kbo_max
% 3.92/4.36 % --res_to_prop_solver none
% 3.92/4.36 % --res_prop_simpl_new false
% 3.92/4.36 % --res_prop_simpl_given false
% 3.92/4.36 % --res_passive_queue_type priority_queues
% 3.92/4.36 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.92/4.36 % --res_passive_queues_freq [15;5]
% 3.92/4.36 % --res_forward_subs full
% 3.92/4.36 % --res_backward_subs full
% 3.92/4.36 % --res_forward_subs_resolution true
% 3.92/4.36 % --res_backward_subs_resolution true
% 3.92/4.36 % --res_orphan_elimination false
% 3.92/4.36 % --res_time_limit 1000.
% 3.92/4.36 % --res_out_proof true
% 3.92/4.36 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_bb4fb2.s
% 3.92/4.36 % --modulo true
% 3.92/4.36
% 3.92/4.36 % ------ Combination Options
% 3.92/4.36
% 3.92/4.36 % --comb_res_mult 1000
% 3.92/4.36 % --comb_inst_mult 300
% 3.92/4.36 % ------
% 3.92/4.36
% 3.92/4.36 % ------ Parsing...% successful
% 3.92/4.36
% 3.92/4.36 % ------ 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 %
% 3.92/4.36
% 3.92/4.36 % ------ Proving...
% 3.92/4.36 % ------ Problem Properties
% 3.92/4.36
% 3.92/4.36 %
% 3.92/4.36 % EPR false
% 3.92/4.36 % Horn false
% 3.92/4.36 % Has equality true
% 3.92/4.36
% 3.92/4.36 % % ------ Input Options Time Limit: Unbounded
% 3.92/4.36
% 3.92/4.36
% 3.92/4.36 Compiling...
% 3.92/4.36 Loading plugin: done.
% 3.92/4.36 Compiling...
% 3.92/4.36 Loading plugin: done.
% 3.92/4.36 % % ------ Current options:
% 3.92/4.36
% 3.92/4.36 % ------ Input Options
% 3.92/4.36
% 3.92/4.36 % --out_options all
% 3.92/4.36 % --tptp_safe_out true
% 3.92/4.36 % --problem_path ""
% 3.92/4.36 % --include_path ""
% 3.92/4.36 % --clausifier .//eprover
% 3.92/4.36 % --clausifier_options --tstp-format
% 3.92/4.36 % --stdin false
% 3.92/4.36 % --dbg_backtrace false
% 3.92/4.36 % --dbg_dump_prop_clauses false
% 3.92/4.36 % --dbg_dump_prop_clauses_file -
% 3.92/4.36 % --dbg_out_stat false
% 3.92/4.36
% 3.92/4.36 % ------ General Options
% 3.92/4.36
% 3.92/4.36 % --fof false
% 3.92/4.36 % --time_out_real 150.
% 3.92/4.36 % --time_out_prep_mult 0.2
% 3.92/4.36 % --time_out_virtual -1.
% 3.92/4.36 % --schedule none
% 3.92/4.36 % --ground_splitting input
% 3.92/4.36 % --splitting_nvd 16
% 3.92/4.36 % --non_eq_to_eq false
% 3.92/4.36 % --prep_gs_sim true
% 3.92/4.36 % --prep_unflatten false
% 3.92/4.36 % --prep_res_sim true
% 3.92/4.36 % --prep_upred true
% 3.92/4.36 % --res_sim_input true
% 3.92/4.36 % --clause_weak_htbl true
% 3.92/4.36 % --gc_record_bc_elim false
% 3.92/4.36 % --symbol_type_check false
% 3.92/4.36 % --clausify_out false
% 3.92/4.36 % --large_theory_mode false
% 3.92/4.36 % --prep_sem_filter none
% 3.92/4.36 % --prep_sem_filter_out false
% 3.92/4.36 % --preprocessed_out false
% 3.92/4.36 % --sub_typing false
% 3.92/4.36 % --brand_transform false
% 3.92/4.36 % --pure_diseq_elim true
% 3.92/4.36 % --min_unsat_core false
% 3.92/4.36 % --pred_elim true
% 3.92/4.36 % --add_important_lit false
% 3.92/4.36 % --soft_assumptions false
% 3.92/4.36 % --reset_solvers false
% 3.92/4.36 % --bc_imp_inh []
% 3.92/4.36 % --conj_cone_tolerance 1.5
% 3.92/4.36 % --prolific_symb_bound 500
% 3.92/4.36 % --lt_threshold 2000
% 3.92/4.36
% 3.92/4.36 % ------ SAT Options
% 3.92/4.36
% 3.92/4.36 % --sat_mode false
% 3.92/4.36 % --sat_fm_restart_options ""
% 3.92/4.36 % --sat_gr_def false
% 3.92/4.36 % --sat_epr_types true
% 3.92/4.36 % --sat_non_cyclic_types false
% 3.92/4.36 % --sat_finite_models false
% 3.92/4.36 % --sat_fm_lemmas false
% 3.92/4.36 % --sat_fm_prep false
% 3.92/4.36 % --sat_fm_uc_incr true
% 3.92/4.36 % --sat_out_model small
% 3.92/4.36 % --sat_out_clauses false
% 3.92/4.36
% 3.92/4.36 % ------ QBF Options
% 3.92/4.36
% 3.92/4.36 % --qbf_mode false
% 3.92/4.36 % --qbf_elim_univ true
% 3.92/4.36 % --qbf_sk_in true
% 3.92/4.36 % --qbf_pred_elim true
% 3.92/4.36 % --qbf_split 32
% 3.92/4.36
% 3.92/4.36 % ------ BMC1 Options
% 3.92/4.36
% 3.92/4.36 % --bmc1_incremental false
% 3.92/4.36 % --bmc1_axioms reachable_all
% 3.92/4.36 % --bmc1_min_bound 0
% 3.92/4.36 % --bmc1_max_bound -1
% 3.92/4.36 % --bmc1_max_bound_default -1
% 3.92/4.36 % --bmc1_symbol_reachability true
% 3.92/4.36 % --bmc1_property_lemmas false
% 3.92/4.36 % --bmc1_k_induction false
% 3.92/4.36 % --bmc1_non_equiv_states false
% 3.92/4.36 % --bmc1_deadlock false
% 3.92/4.36 % --bmc1_ucm false
% 3.92/4.36 % --bmc1_add_unsat_core none
% 3.92/4.36 % --bmc1_unsat_core_children false
% 3.92/4.36 % --bmc1_unsat_core_extrapolate_axioms false
% 3.92/4.36 % --bmc1_out_stat full
% 3.92/4.36 % --bmc1_ground_init false
% 3.92/4.36 % --bmc1_pre_inst_next_state false
% 3.92/4.36 % --bmc1_pre_inst_state false
% 3.92/4.36 % --bmc1_pre_inst_reach_state false
% 3.92/4.36 % --bmc1_out_unsat_core false
% 3.92/4.36 % --bmc1_aig_witness_out false
% 3.92/4.36 % --bmc1_verbose false
% 3.92/4.36 % --bmc1_dump_clauses_tptp false
% 3.92/4.36 % --bmc1_dump_unsat_core_tptp false
% 3.92/4.36 % --bmc1_dump_file -
% 3.92/4.36 % --bmc1_ucm_expand_uc_limit 128
% 3.92/4.36 % --bmc1_ucm_n_expand_iterations 6
% 3.92/4.36 % --bmc1_ucm_extend_mode 1
% 3.92/4.36 % --bmc1_ucm_init_mode 2
% 3.92/4.36 % --bmc1_ucm_cone_mode none
% 3.92/4.36 % --bmc1_ucm_reduced_relation_type 0
% 3.92/4.36 % --bmc1_ucm_relax_model 4
% 3.92/4.36 % --bmc1_ucm_full_tr_after_sat true
% 3.92/4.36 % --bmc1_ucm_expand_neg_assumptions false
% 3.92/4.36 % --bmc1_ucm_layered_model none
% 3.92/4.36 % --bmc1_ucm_max_lemma_size 10
% 3.92/4.36
% 3.92/4.36 % ------ AIG Options
% 3.92/4.36
% 3.92/4.36 % --aig_mode false
% 3.92/4.36
% 3.92/4.36 % ------ Instantiation Options
% 3.92/4.36
% 3.92/4.36 % --instantiation_flag true
% 3.92/4.36 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 3.92/4.36 % --inst_solver_per_active 750
% 3.92/4.36 % --inst_solver_calls_frac 0.5
% 3.92/4.36 % --inst_passive_queue_type priority_queues
% 3.92/4.36 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 3.92/4.36 % --inst_passive_queues_freq [25;2]
% 3.92/4.36 % --inst_dismatching true
% 7.43/7.70 % --inst_eager_unprocessed_to_passive true
% 7.43/7.70 % --inst_prop_sim_given true
% 7.43/7.70 % --inst_prop_sim_new false
% 7.43/7.70 % --inst_orphan_elimination true
% 7.43/7.70 % --inst_learning_loop_flag true
% 7.43/7.70 % --inst_learning_start 3000
% 7.43/7.70 % --inst_learning_factor 2
% 7.43/7.70 % --inst_start_prop_sim_after_learn 3
% 7.43/7.70 % --inst_sel_renew solver
% 7.43/7.70 % --inst_lit_activity_flag true
% 7.43/7.70 % --inst_out_proof true
% 7.43/7.70
% 7.43/7.70 % ------ Resolution Options
% 7.43/7.70
% 7.43/7.70 % --resolution_flag true
% 7.43/7.70 % --res_lit_sel kbo_max
% 7.43/7.70 % --res_to_prop_solver none
% 7.43/7.70 % --res_prop_simpl_new false
% 7.43/7.70 % --res_prop_simpl_given false
% 7.43/7.70 % --res_passive_queue_type priority_queues
% 7.43/7.70 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 7.43/7.70 % --res_passive_queues_freq [15;5]
% 7.43/7.70 % --res_forward_subs full
% 7.43/7.70 % --res_backward_subs full
% 7.43/7.70 % --res_forward_subs_resolution true
% 7.43/7.70 % --res_backward_subs_resolution true
% 7.43/7.70 % --res_orphan_elimination false
% 7.43/7.70 % --res_time_limit 1000.
% 7.43/7.70 % --res_out_proof true
% 7.43/7.70 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_bb4fb2.s
% 7.43/7.70 % --modulo true
% 7.43/7.70
% 7.43/7.70 % ------ Combination Options
% 7.43/7.70
% 7.43/7.70 % --comb_res_mult 1000
% 7.43/7.70 % --comb_inst_mult 300
% 7.43/7.70 % ------
% 7.43/7.70
% 7.43/7.70
% 7.43/7.70
% 7.43/7.70 % ------ Proving...
% 7.43/7.70 % warning: shown sat in sat incomplete mode
% 7.43/7.70 %
% 7.43/7.70
% 7.43/7.70
% 7.43/7.70 ------ Building Model...Done
% 7.43/7.70
% 7.43/7.70 %------ The model is defined over ground terms (initial term algebra).
% 7.43/7.70 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 7.43/7.70 %------ where \phi is a formula over the term algebra.
% 7.43/7.70 %------ If we have equality in the problem then it is also defined as a predicate above,
% 7.43/7.70 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 7.43/7.70 %------ See help for --sat_out_model for different model outputs.
% 7.43/7.70 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 7.43/7.70 %------ where the first argument stands for the sort ($i in the unsorted case)
% 7.43/7.70
% 7.43/7.70
% 7.43/7.70
% 7.43/7.70
% 7.43/7.70 %------ Positive definition of $true
% 7.43/7.70 fof(lit_def,axiom,
% 7.43/7.70 ( $true <=>
% 7.43/7.70 $true
% 7.43/7.70 )
% 7.43/7.70 ).
% 7.43/7.70
% 7.43/7.70 %------ Negative definition of equality_sorted
% 7.43/7.70 fof(lit_def,axiom,
% 7.43/7.70 (! [X0,X0,X1] :
% 7.43/7.70 ( ~(equality_sorted(X0,X0,X1)) <=>
% 7.43/7.70 (
% 7.43/7.70 (
% 7.43/7.70 ( X0=$i & X0=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) & X1=empty_set )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=$i & X0=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) & X1=apply(sk2_esk3_0,sk2_esk2_0) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2,X3] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=$i & X0=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) & X1=apply(X2,X3) )
% 7.43/7.70 &
% 7.43/7.70 ( X2!=relation_dom_restriction(X2,X3) )
% 7.43/7.70 &
% 7.43/7.70 ( X3!=sk2_esk2_0 )
% 7.43/7.70 &
% 7.43/7.70 ! [X4] : ( X3!=ordered_pair(X3,X4) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=$i & X0=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) & X1=apply(relation_dom(X2),sk2_esk2_0) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=$i & X0=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) & X1=apply(X2,sk2_esk2_0) )
% 7.43/7.70 &
% 7.43/7.70 ( X2!=relation_dom(X2) )
% 7.43/7.70 &
% 7.43/7.70 ! [X3] : ( X2!=relation_dom_restriction(X2,X3) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2,X3,X4] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=$i & X0=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) & X1=apply(relation_dom_restriction(X2,X3),X4) )
% 7.43/7.70 &
% 7.43/7.70 ( X4!=sk2_esk2_0 )
% 7.43/7.70 &
% 7.43/7.70 ( X4!=ordered_pair(X4,X5) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2,X3,X4] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=$i & X0=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) & X1=apply(X2,ordered_pair(X3,X4)) )
% 7.43/7.70 &
% 7.43/7.70 ( X2!=relation_dom_restriction(X2,X3) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2,X3] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=$i & X0=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) & X1=apply(relation_dom_restriction(X2,X3),sk2_esk2_0) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2,X3,X4,X5] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=$i & X0=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) & X1=apply(relation_dom_restriction(X2,X3),ordered_pair(X4,X5)) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 ).
% 7.43/7.70
% 7.43/7.70 %------ Negative definition of relation_empty_yielding
% 7.43/7.70 fof(lit_def,axiom,
% 7.43/7.70 (! [X0] :
% 7.43/7.70 ( ~(relation_empty_yielding(X0)) <=>
% 7.43/7.70 $false
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 ).
% 7.43/7.70
% 7.43/7.70 %------ Negative definition of relation
% 7.43/7.70 fof(lit_def,axiom,
% 7.43/7.70 (! [X0] :
% 7.43/7.70 ( ~(relation(X0)) <=>
% 7.43/7.70 (
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk1_esk7_0 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X1,X2] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=ordered_pair(X1,X2) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk2_esk1_0 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=relation_dom(sk1_esk6_0) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X1] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=singleton(X1) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X1,X2] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=unordered_pair(X1,X2) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 ).
% 7.43/7.70
% 7.43/7.70 %------ Negative definition of empty
% 7.43/7.70 fof(lit_def,axiom,
% 7.43/7.70 (! [X0] :
% 7.43/7.70 ( ~(empty(X0)) <=>
% 7.43/7.70 (
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk1_esk6_0 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk1_esk7_0 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X1,X2] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=ordered_pair(X1,X2) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk2_esk1_0 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=relation_dom(sk1_esk6_0) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X1] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=singleton(X1) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X1,X2] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=unordered_pair(X1,X2) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 ).
% 7.43/7.70
% 7.43/7.70 %------ Negative definition of function
% 7.43/7.70 fof(lit_def,axiom,
% 7.43/7.70 (! [X0] :
% 7.43/7.70 ( ~(function(X0)) <=>
% 7.43/7.70 (
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk1_esk6_0 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 ).
% 7.43/7.70
% 7.43/7.70 %------ Positive definition of one_to_one
% 7.43/7.70 fof(lit_def,axiom,
% 7.43/7.70 (! [X0] :
% 7.43/7.70 ( one_to_one(X0) <=>
% 7.43/7.70 $true
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 ).
% 7.43/7.70
% 7.43/7.70 %------ Negative definition of element
% 7.43/7.70 fof(lit_def,axiom,
% 7.43/7.70 (! [X0,X1] :
% 7.43/7.70 ( ~(element(X0,X1)) <=>
% 7.43/7.70 (
% 7.43/7.70 (
% 7.43/7.70 ( X1=sk1_esk6_0 )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(sk1_esk6_0) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X1=sk1_esk7_0 )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(sk1_esk7_0) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2,X3] :
% 7.43/7.70 (
% 7.43/7.70 ( X1=relation_dom_restriction(X2,X3) )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(relation_dom_restriction(X2,X3)) | X2!=X2 | X3!=X3 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X1=sk2_esk1_0 )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk2_esk2_0 )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(sk2_esk1_0) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X1=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0)) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X1=apply(sk2_esk3_0,sk2_esk2_0) )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(apply(sk2_esk3_0,sk2_esk2_0)) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X1=relation_dom(sk2_esk3_0) )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(relation_dom(sk2_esk3_0)) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2,X3] :
% 7.43/7.70 (
% 7.43/7.70 ( X1=set_intersection2(relation_dom(X2),X3) )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(set_intersection2(relation_dom(X2),X3)) | X2!=X2 | X3!=X3 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X1=relation_dom(sk1_esk6_0) )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(relation_dom(sk1_esk6_0)) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2,X3] :
% 7.43/7.70 (
% 7.43/7.70 ( X1=ordered_pair(X2,X3) )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(ordered_pair(X2,X3)) | X2!=X2 | X3!=X3 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X1=relation_dom(apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0)) )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(relation_dom(apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0))) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2,X3] :
% 7.43/7.70 (
% 7.43/7.70 ( X1=unordered_pair(X2,X3) )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(unordered_pair(X2,X3)) | X2!=X2 | X3!=X3 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2] :
% 7.43/7.70 (
% 7.43/7.70 ( X1=singleton(X2) )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(singleton(X2)) | X2!=X2 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2,X3] :
% 7.43/7.70 (
% 7.43/7.70 ( X1=set_intersection2(relation_dom_restriction(X2,X3),relation_dom_restriction(X2,X3)) )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(set_intersection2(relation_dom_restriction(X2,X3),relation_dom_restriction(X2,X3))) | X2!=X2 | X3!=X3 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2] :
% 7.43/7.70 (
% 7.43/7.70 ( X1=relation_dom(relation_dom_restriction(X2,sk2_esk1_0)) )
% 7.43/7.70 &
% 7.43/7.70 ( X0!=sk1_esk1_1(relation_dom(relation_dom_restriction(X2,sk2_esk1_0))) | X2!=X2 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 ).
% 7.43/7.70
% 7.43/7.70 %------ Positive definition of in
% 7.43/7.70 fof(lit_def,axiom,
% 7.43/7.70 (! [X0,X1] :
% 7.43/7.70 ( in(X0,X1) <=>
% 7.43/7.70 (
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk2_esk2_0 & X1=sk2_esk1_0 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk1_esk1_1(sk1_esk6_0) & X1=sk1_esk6_0 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk1_esk1_1(sk1_esk7_0) & X1=sk1_esk7_0 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk1_esk1_1(sk2_esk1_0) & X1=sk2_esk1_0 )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk1_esk1_1(relation_dom(sk1_esk6_0)) & X1=relation_dom(sk1_esk6_0) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk1_esk1_1(apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0)) & X1=apply(relation_dom_restriction(sk2_esk3_0,sk2_esk1_0),sk2_esk2_0) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk1_esk1_1(singleton(X2)) & X1=singleton(X2) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2,X3] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk1_esk1_1(ordered_pair(X2,X3)) & X1=ordered_pair(X2,X3) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 |
% 7.43/7.70 ? [X2,X3] :
% 7.43/7.70 (
% 7.43/7.70 ( X0=sk1_esk1_1(unordered_pair(X2,X3)) & X1=unordered_pair(X2,X3) )
% 7.43/7.70 )
% 7.43/7.70
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 )
% 7.43/7.70 ).
% 7.43/7.70
% 7.43/7.70
% 7.43/7.70
% 7.43/7.70 % ------ Statistics
% 7.43/7.70
% 7.43/7.70 % ------ General
% 7.43/7.70
% 7.43/7.70 % num_of_input_clauses: 157
% 7.43/7.70 % num_of_input_neg_conjectures: 4
% 7.43/7.70 % num_of_splits: 0
% 7.43/7.70 % num_of_split_atoms: 0
% 7.43/7.70 % num_of_sem_filtered_clauses: 0
% 7.43/7.70 % num_of_subtypes: 0
% 7.43/7.70 % monotx_restored_types: 0
% 7.43/7.70 % sat_num_of_epr_types: 0
% 7.43/7.70 % sat_num_of_non_cyclic_types: 0
% 7.43/7.70 % sat_guarded_non_collapsed_types: 0
% 7.43/7.70 % is_epr: 0
% 7.43/7.70 % is_horn: 0
% 7.43/7.70 % has_eq: 1
% 7.43/7.70 % num_pure_diseq_elim: 0
% 7.43/7.70 % simp_replaced_by: 0
% 7.43/7.70 % res_preprocessed: 8
% 7.43/7.70 % prep_upred: 0
% 7.43/7.70 % prep_unflattend: 0
% 7.43/7.70 % pred_elim_cands: 0
% 7.43/7.70 % pred_elim: 0
% 7.43/7.70 % pred_elim_cl: 0
% 7.43/7.70 % pred_elim_cycles: 0
% 7.43/7.70 % forced_gc_time: 0
% 7.43/7.70 % gc_basic_clause_elim: 0
% 7.43/7.70 % parsing_time: 0.007
% 7.43/7.70 % sem_filter_time: 0.
% 7.43/7.70 % pred_elim_time: 0.
% 7.43/7.70 % out_proof_time: 0.
% 7.43/7.70 % monotx_time: 0.
% 7.43/7.70 % subtype_inf_time: 0.
% 7.43/7.70 % unif_index_cands_time: 0.01
% 7.43/7.70 % unif_index_add_time: 0.008
% 7.43/7.70 % total_time: 3.585
% 7.43/7.70 % num_of_symbols: 53
% 7.43/7.70 % num_of_terms: 80978
% 7.43/7.70
% 7.43/7.70 % ------ Propositional Solver
% 7.43/7.70
% 7.43/7.70 % prop_solver_calls: 8
% 7.43/7.70 % prop_fast_solver_calls: 12
% 7.43/7.70 % prop_num_of_clauses: 473
% 7.43/7.70 % prop_preprocess_simplified: 1217
% 7.43/7.70 % prop_fo_subsumed: 0
% 7.43/7.70 % prop_solver_time: 0.
% 7.43/7.70 % prop_fast_solver_time: 0.
% 7.43/7.70 % prop_unsat_core_time: 0.
% 7.43/7.70
% 7.43/7.70 % ------ QBF
% 7.43/7.70
% 7.43/7.70 % qbf_q_res: 0
% 7.43/7.70 % qbf_num_tautologies: 0
% 7.43/7.70 % qbf_prep_cycles: 0
% 7.43/7.70
% 7.43/7.70 % ------ BMC1
% 7.43/7.70
% 7.43/7.70 % bmc1_current_bound: -1
% 7.43/7.70 % bmc1_last_solved_bound: -1
% 7.43/7.70 % bmc1_unsat_core_size: -1
% 7.43/7.70 % bmc1_unsat_core_parents_size: -1
% 7.43/7.70 % bmc1_merge_next_fun: 0
% 7.43/7.70 % bmc1_unsat_core_clauses_time: 0.
% 7.43/7.70
% 7.43/7.70 % ------ Instantiation
% 7.43/7.70
% 7.43/7.70 % inst_num_of_clauses: 384
% 7.43/7.70 % inst_num_in_passive: 0
% 7.43/7.70 % inst_num_in_active: 376
% 7.43/7.70 % inst_num_in_unprocessed: 0
% 7.43/7.70 % inst_num_of_loops: 482
% 7.43/7.70 % inst_num_of_learning_restarts: 0
% 7.43/7.70 % inst_num_moves_active_passive: 89
% 7.43/7.70 % inst_lit_activity: 43
% 7.43/7.70 % inst_lit_activity_moves: 0
% 7.43/7.70 % inst_num_tautologies: 8
% 7.43/7.70 % inst_num_prop_implied: 0
% 7.43/7.70 % inst_num_existing_simplified: 0
% 7.43/7.70 % inst_num_eq_res_simplified: 0
% 7.43/7.70 % inst_num_child_elim: 0
% 7.43/7.70 % inst_num_of_dismatching_blockings: 142
% 7.43/7.70 % inst_num_of_non_proper_insts: 627
% 7.43/7.70 % inst_num_of_duplicates: 424
% 7.43/7.70 % inst_inst_num_from_inst_to_res: 0
% 7.43/7.70 % inst_dismatching_checking_time: 0.
% 7.43/7.70
% 7.43/7.70 % ------ Resolution
% 7.43/7.70
% 7.43/7.70 % res_num_of_clauses: 8844
% 7.43/7.70 % res_num_in_passive: 6764
% 7.43/7.70 % res_num_in_active: 1979
% 7.43/7.70 % res_num_of_loops: 2000
% 7.43/7.70 % res_forward_subset_subsumed: 79
% 7.43/7.70 % res_backward_subset_subsumed: 0
% 7.43/7.70 % res_forward_subsumed: 84
% 7.43/7.70 % res_backward_subsumed: 0
% 7.43/7.70 % res_forward_subsumption_resolution: 254
% 7.43/7.70 % res_backward_subsumption_resolution: 0
% 7.43/7.70 % res_clause_to_clause_subsumption: 34116
% 7.43/7.70 % res_orphan_elimination: 0
% 7.43/7.70 % res_tautology_del: 11644
% 7.43/7.70 % res_num_eq_res_simplified: 0
% 7.43/7.70 % res_num_sel_changes: 0
% 7.43/7.70 % res_moves_from_active_to_pass: 0
% 7.43/7.70
% 7.43/7.70 % Status Unknown
% 7.43/7.70 % Last status :
% 7.43/7.70 % SZS status Unknown
%------------------------------------------------------------------------------