TSTP Solution File: SYN536+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN536+1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 07:29:40 EDT 2022
% Result : Unknown 3.41s 3.61s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SYN536+1 : TPTP v8.1.0. Released v2.1.0.
% 0.06/0.15 % Command : iprover_modulo %s %d
% 0.15/0.39 % Computer : n003.cluster.edu
% 0.15/0.39 % Model : x86_64 x86_64
% 0.15/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39 % Memory : 8042.1875MB
% 0.15/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39 % CPULimit : 300
% 0.15/0.39 % WCLimit : 600
% 0.15/0.39 % DateTime : Tue Jul 12 08:54:01 EDT 2022
% 0.15/0.39 % CPUTime :
% 0.15/0.40 % Running in mono-core mode
% 0.25/0.47 % Orienting using strategy Equiv(ClausalAll)
% 0.25/0.47 % FOF problem with conjecture
% 0.25/0.47 % 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_2a6693.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_d4b59e.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_c955ab | grep -v "SZS"
% 0.25/0.50
% 0.25/0.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.25/0.50
% 0.25/0.50 %
% 0.25/0.50 % ------ iProver source info
% 0.25/0.50
% 0.25/0.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.25/0.50 % git: non_committed_changes: true
% 0.25/0.50 % git: last_make_outside_of_git: true
% 0.25/0.50
% 0.25/0.50 %
% 0.25/0.50 % ------ Input Options
% 0.25/0.50
% 0.25/0.50 % --out_options all
% 0.25/0.50 % --tptp_safe_out true
% 0.25/0.50 % --problem_path ""
% 0.25/0.50 % --include_path ""
% 0.25/0.50 % --clausifier .//eprover
% 0.25/0.50 % --clausifier_options --tstp-format
% 0.25/0.50 % --stdin false
% 0.25/0.50 % --dbg_backtrace false
% 0.25/0.50 % --dbg_dump_prop_clauses false
% 0.25/0.50 % --dbg_dump_prop_clauses_file -
% 0.25/0.50 % --dbg_out_stat false
% 0.25/0.50
% 0.25/0.50 % ------ General Options
% 0.25/0.50
% 0.25/0.50 % --fof false
% 0.25/0.50 % --time_out_real 150.
% 0.25/0.50 % --time_out_prep_mult 0.2
% 0.25/0.50 % --time_out_virtual -1.
% 0.25/0.50 % --schedule none
% 0.25/0.50 % --ground_splitting input
% 0.25/0.50 % --splitting_nvd 16
% 0.25/0.50 % --non_eq_to_eq false
% 0.25/0.50 % --prep_gs_sim true
% 0.25/0.50 % --prep_unflatten false
% 0.25/0.50 % --prep_res_sim true
% 0.25/0.50 % --prep_upred true
% 0.25/0.50 % --res_sim_input true
% 0.25/0.50 % --clause_weak_htbl true
% 0.25/0.50 % --gc_record_bc_elim false
% 0.25/0.50 % --symbol_type_check false
% 0.25/0.50 % --clausify_out false
% 0.25/0.50 % --large_theory_mode false
% 0.25/0.50 % --prep_sem_filter none
% 0.25/0.50 % --prep_sem_filter_out false
% 0.25/0.50 % --preprocessed_out false
% 0.25/0.50 % --sub_typing false
% 0.25/0.50 % --brand_transform false
% 0.25/0.50 % --pure_diseq_elim true
% 0.25/0.50 % --min_unsat_core false
% 0.25/0.50 % --pred_elim true
% 0.25/0.50 % --add_important_lit false
% 0.25/0.50 % --soft_assumptions false
% 0.25/0.50 % --reset_solvers false
% 0.25/0.50 % --bc_imp_inh []
% 0.25/0.50 % --conj_cone_tolerance 1.5
% 0.25/0.50 % --prolific_symb_bound 500
% 0.25/0.50 % --lt_threshold 2000
% 0.25/0.50
% 0.25/0.50 % ------ SAT Options
% 0.25/0.50
% 0.25/0.50 % --sat_mode false
% 0.25/0.50 % --sat_fm_restart_options ""
% 0.25/0.50 % --sat_gr_def false
% 0.25/0.50 % --sat_epr_types true
% 0.25/0.50 % --sat_non_cyclic_types false
% 0.25/0.50 % --sat_finite_models false
% 0.25/0.50 % --sat_fm_lemmas false
% 0.25/0.50 % --sat_fm_prep false
% 0.25/0.50 % --sat_fm_uc_incr true
% 0.25/0.50 % --sat_out_model small
% 0.25/0.50 % --sat_out_clauses false
% 0.25/0.50
% 0.25/0.50 % ------ QBF Options
% 0.25/0.50
% 0.25/0.50 % --qbf_mode false
% 0.25/0.50 % --qbf_elim_univ true
% 0.25/0.50 % --qbf_sk_in true
% 0.25/0.50 % --qbf_pred_elim true
% 0.25/0.50 % --qbf_split 32
% 0.25/0.50
% 0.25/0.50 % ------ BMC1 Options
% 0.25/0.50
% 0.25/0.50 % --bmc1_incremental false
% 0.25/0.50 % --bmc1_axioms reachable_all
% 0.25/0.50 % --bmc1_min_bound 0
% 0.25/0.50 % --bmc1_max_bound -1
% 0.25/0.50 % --bmc1_max_bound_default -1
% 0.25/0.50 % --bmc1_symbol_reachability true
% 0.25/0.50 % --bmc1_property_lemmas false
% 0.25/0.50 % --bmc1_k_induction false
% 0.25/0.50 % --bmc1_non_equiv_states false
% 0.25/0.50 % --bmc1_deadlock false
% 0.25/0.50 % --bmc1_ucm false
% 0.25/0.50 % --bmc1_add_unsat_core none
% 0.25/0.50 % --bmc1_unsat_core_children false
% 0.25/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.25/0.50 % --bmc1_out_stat full
% 0.25/0.50 % --bmc1_ground_init false
% 0.25/0.50 % --bmc1_pre_inst_next_state false
% 0.25/0.50 % --bmc1_pre_inst_state false
% 0.25/0.50 % --bmc1_pre_inst_reach_state false
% 0.25/0.50 % --bmc1_out_unsat_core false
% 0.25/0.50 % --bmc1_aig_witness_out false
% 0.25/0.50 % --bmc1_verbose false
% 0.25/0.50 % --bmc1_dump_clauses_tptp false
% 0.25/0.59 % --bmc1_dump_unsat_core_tptp false
% 0.25/0.59 % --bmc1_dump_file -
% 0.25/0.59 % --bmc1_ucm_expand_uc_limit 128
% 0.25/0.59 % --bmc1_ucm_n_expand_iterations 6
% 0.25/0.59 % --bmc1_ucm_extend_mode 1
% 0.25/0.59 % --bmc1_ucm_init_mode 2
% 0.25/0.59 % --bmc1_ucm_cone_mode none
% 0.25/0.59 % --bmc1_ucm_reduced_relation_type 0
% 0.25/0.59 % --bmc1_ucm_relax_model 4
% 0.25/0.59 % --bmc1_ucm_full_tr_after_sat true
% 0.25/0.59 % --bmc1_ucm_expand_neg_assumptions false
% 0.25/0.59 % --bmc1_ucm_layered_model none
% 0.25/0.59 % --bmc1_ucm_max_lemma_size 10
% 0.25/0.59
% 0.25/0.59 % ------ AIG Options
% 0.25/0.59
% 0.25/0.59 % --aig_mode false
% 0.25/0.59
% 0.25/0.59 % ------ Instantiation Options
% 0.25/0.59
% 0.25/0.59 % --instantiation_flag true
% 0.25/0.59 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.25/0.59 % --inst_solver_per_active 750
% 0.25/0.59 % --inst_solver_calls_frac 0.5
% 0.25/0.59 % --inst_passive_queue_type priority_queues
% 0.25/0.59 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.25/0.59 % --inst_passive_queues_freq [25;2]
% 0.25/0.59 % --inst_dismatching true
% 0.25/0.59 % --inst_eager_unprocessed_to_passive true
% 0.25/0.59 % --inst_prop_sim_given true
% 0.25/0.59 % --inst_prop_sim_new false
% 0.25/0.59 % --inst_orphan_elimination true
% 0.25/0.59 % --inst_learning_loop_flag true
% 0.25/0.59 % --inst_learning_start 3000
% 0.25/0.59 % --inst_learning_factor 2
% 0.25/0.59 % --inst_start_prop_sim_after_learn 3
% 0.25/0.59 % --inst_sel_renew solver
% 0.25/0.59 % --inst_lit_activity_flag true
% 0.25/0.59 % --inst_out_proof true
% 0.25/0.59
% 0.25/0.59 % ------ Resolution Options
% 0.25/0.59
% 0.25/0.59 % --resolution_flag true
% 0.25/0.59 % --res_lit_sel kbo_max
% 0.25/0.59 % --res_to_prop_solver none
% 0.25/0.59 % --res_prop_simpl_new false
% 0.25/0.59 % --res_prop_simpl_given false
% 0.25/0.59 % --res_passive_queue_type priority_queues
% 0.25/0.59 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.25/0.59 % --res_passive_queues_freq [15;5]
% 0.25/0.59 % --res_forward_subs full
% 0.25/0.59 % --res_backward_subs full
% 0.25/0.59 % --res_forward_subs_resolution true
% 0.25/0.59 % --res_backward_subs_resolution true
% 0.25/0.59 % --res_orphan_elimination false
% 0.25/0.59 % --res_time_limit 1000.
% 0.25/0.59 % --res_out_proof true
% 0.25/0.59 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2a6693.s
% 0.25/0.59 % --modulo true
% 0.25/0.59
% 0.25/0.59 % ------ Combination Options
% 0.25/0.59
% 0.25/0.59 % --comb_res_mult 1000
% 0.25/0.59 % --comb_inst_mult 300
% 0.25/0.59 % ------
% 0.25/0.59
% 0.25/0.59 % ------ Parsing...% successful
% 0.25/0.59
% 0.25/0.59 % ------ Preprocessing... gs_s sp: 244 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e snvd_s sp: 0 0s snvd_e %
% 0.25/0.59
% 0.25/0.59 % ------ Proving...
% 0.25/0.59 % ------ Problem Properties
% 0.25/0.59
% 0.25/0.59 %
% 0.25/0.59 % EPR true
% 0.25/0.59 % Horn false
% 0.25/0.59 % Has equality false
% 0.25/0.59
% 0.25/0.59 % % ------ Input Options Time Limit: Unbounded
% 0.25/0.59
% 0.25/0.59
% 0.25/0.59 % % ------ Current options:
% 0.25/0.59
% 0.25/0.59 % ------ Input Options
% 0.25/0.59
% 0.25/0.59 % --out_options all
% 0.25/0.59 % --tptp_safe_out true
% 0.25/0.59 % --problem_path ""
% 0.25/0.59 % --include_path ""
% 0.25/0.59 % --clausifier .//eprover
% 0.25/0.59 % --clausifier_options --tstp-format
% 0.25/0.59 % --stdin false
% 0.25/0.59 % --dbg_backtrace false
% 0.25/0.59 % --dbg_dump_prop_clauses false
% 0.25/0.59 % --dbg_dump_prop_clauses_file -
% 0.25/0.59 % --dbg_out_stat false
% 0.25/0.59
% 0.25/0.59 % ------ General Options
% 0.25/0.59
% 0.25/0.59 % --fof false
% 0.25/0.59 % --time_out_real 150.
% 0.25/0.59 % --time_out_prep_mult 0.2
% 0.25/0.59 % --time_out_virtual -1.
% 0.25/0.59 % --schedule none
% 0.25/0.59 % --ground_splitting input
% 0.25/0.59 % --splitting_nvd 16
% 0.25/0.59 % --non_eq_to_eq false
% 0.25/0.59 % --prep_gs_sim true
% 0.25/0.59 % --prep_unflatten false
% 0.25/0.59 % --prep_res_sim true
% 0.25/0.59 % --prep_upred true
% 0.25/0.59 % --res_sim_input true
% 0.25/0.59 % --clause_weak_htbl true
% 0.25/0.59 % --gc_record_bc_elim false
% 0.25/0.59 % --symbol_type_check false
% 0.25/0.59 % --clausify_out false
% 0.25/0.59 % --large_theory_mode false
% 0.25/0.59 % --prep_sem_filter none
% 0.25/0.59 % --prep_sem_filter_out false
% 0.25/0.59 % --preprocessed_out false
% 0.25/0.59 % --sub_typing false
% 0.25/0.59 % --brand_transform false
% 0.25/0.59 % --pure_diseq_elim true
% 0.25/0.59 % --min_unsat_core false
% 0.25/0.59 % --pred_elim true
% 0.25/0.59 % --add_important_lit false
% 0.25/0.59 % --soft_assumptions false
% 0.25/0.59 % --reset_solvers false
% 0.25/0.59 % --bc_imp_inh []
% 0.25/0.59 % --conj_cone_tolerance 1.5
% 0.25/0.59 % --prolific_symb_bound 500
% 0.25/0.60 % --lt_threshold 2000
% 0.25/0.60
% 0.25/0.60 % ------ SAT Options
% 0.25/0.60
% 0.25/0.60 % --sat_mode false
% 0.25/0.60 % --sat_fm_restart_options ""
% 0.25/0.60 % --sat_gr_def false
% 0.25/0.60 % --sat_epr_types true
% 0.25/0.60 % --sat_non_cyclic_types false
% 0.25/0.60 % --sat_finite_models false
% 0.25/0.60 % --sat_fm_lemmas false
% 0.25/0.60 % --sat_fm_prep false
% 0.25/0.60 % --sat_fm_uc_incr true
% 0.25/0.60 % --sat_out_model small
% 0.25/0.60 % --sat_out_clauses false
% 0.25/0.60
% 0.25/0.60 % ------ QBF Options
% 0.25/0.60
% 0.25/0.60 % --qbf_mode false
% 0.25/0.60 % --qbf_elim_univ true
% 0.25/0.60 % --qbf_sk_in true
% 0.25/0.60 % --qbf_pred_elim true
% 0.25/0.60 % --qbf_split 32
% 0.25/0.60
% 0.25/0.60 % ------ BMC1 Options
% 0.25/0.60
% 0.25/0.60 % --bmc1_incremental false
% 0.25/0.60 % --bmc1_axioms reachable_all
% 0.25/0.60 % --bmc1_min_bound 0
% 0.25/0.60 % --bmc1_max_bound -1
% 0.25/0.60 % --bmc1_max_bound_default -1
% 0.25/0.60 % --bmc1_symbol_reachability true
% 0.25/0.60 % --bmc1_property_lemmas false
% 0.25/0.60 % --bmc1_k_induction false
% 0.25/0.60 % --bmc1_non_equiv_states false
% 0.25/0.60 % --bmc1_deadlock false
% 0.25/0.60 % --bmc1_ucm false
% 0.25/0.60 % --bmc1_add_unsat_core none
% 0.25/0.60 % --bmc1_unsat_core_children false
% 0.25/0.60 % --bmc1_unsat_core_extrapolate_axioms false
% 0.25/0.60 % --bmc1_out_stat full
% 0.25/0.60 % --bmc1_ground_init false
% 0.25/0.60 % --bmc1_pre_inst_next_state false
% 0.25/0.60 % --bmc1_pre_inst_state false
% 0.25/0.60 % --bmc1_pre_inst_reach_state false
% 0.25/0.60 % --bmc1_out_unsat_core false
% 0.25/0.60 % --bmc1_aig_witness_out false
% 0.25/0.60 % --bmc1_verbose false
% 0.25/0.60 % --bmc1_dump_clauses_tptp false
% 0.25/0.60 % --bmc1_dump_unsat_core_tptp false
% 0.25/0.60 % --bmc1_dump_file -
% 0.25/0.60 % --bmc1_ucm_expand_uc_limit 128
% 0.25/0.60 % --bmc1_ucm_n_expand_iterations 6
% 0.25/0.60 % --bmc1_ucm_extend_mode 1
% 0.25/0.60 % --bmc1_ucm_init_mode 2
% 0.25/0.60 % --bmc1_ucm_cone_mode none
% 0.25/0.60 % --bmc1_ucm_reduced_relation_type 0
% 0.25/0.60 % --bmc1_ucm_relax_model 4
% 0.25/0.60 % --bmc1_ucm_full_tr_after_sat true
% 0.25/0.60 % --bmc1_ucm_expand_neg_assumptions false
% 0.25/0.60 % --bmc1_ucm_layered_model none
% 0.25/0.60 % --bmc1_ucm_max_lemma_size 10
% 0.25/0.60
% 0.25/0.60 % ------ AIG Options
% 0.25/0.60
% 0.25/0.60 % --aig_mode false
% 0.25/0.60
% 0.25/0.60 % ------ Instantiation Options
% 0.25/0.60
% 0.25/0.60 % --instantiation_flag true
% 0.25/0.60 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.25/0.60 % --inst_solver_per_active 750
% 0.25/0.60 % --inst_solver_calls_frac 0.5
% 0.25/0.60 % --inst_passive_queue_type priority_queues
% 0.25/0.60 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.25/0.60 % --inst_passive_queues_freq [25;2]
% 0.25/0.60 % --inst_dismatching true
% 0.25/0.60 % --inst_eager_unprocessed_to_passive true
% 1.79/1.99 % --inst_prop_sim_given true
% 1.79/1.99 % --inst_prop_sim_new false
% 1.79/1.99 % --inst_orphan_elimination true
% 1.79/1.99 % --inst_learning_loop_flag true
% 1.79/1.99 % --inst_learning_start 3000
% 1.79/1.99 % --inst_learning_factor 2
% 1.79/1.99 % --inst_start_prop_sim_after_learn 3
% 1.79/1.99 % --inst_sel_renew solver
% 1.79/1.99 % --inst_lit_activity_flag true
% 1.79/1.99 % --inst_out_proof true
% 1.79/1.99
% 1.79/1.99 % ------ Resolution Options
% 1.79/1.99
% 1.79/1.99 % --resolution_flag true
% 1.79/1.99 % --res_lit_sel kbo_max
% 1.79/1.99 % --res_to_prop_solver none
% 1.79/1.99 % --res_prop_simpl_new false
% 1.79/1.99 % --res_prop_simpl_given false
% 1.79/1.99 % --res_passive_queue_type priority_queues
% 1.79/1.99 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.79/1.99 % --res_passive_queues_freq [15;5]
% 1.79/1.99 % --res_forward_subs full
% 1.79/1.99 % --res_backward_subs full
% 1.79/1.99 % --res_forward_subs_resolution true
% 1.79/1.99 % --res_backward_subs_resolution true
% 1.79/1.99 % --res_orphan_elimination false
% 1.79/1.99 % --res_time_limit 1000.
% 1.79/1.99 % --res_out_proof true
% 1.79/1.99 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2a6693.s
% 1.79/1.99 % --modulo true
% 1.79/1.99
% 1.79/1.99 % ------ Combination Options
% 1.79/1.99
% 1.79/1.99 % --comb_res_mult 1000
% 1.79/1.99 % --comb_inst_mult 300
% 1.79/1.99 % ------
% 1.79/1.99
% 1.79/1.99
% 1.79/1.99
% 1.79/1.99 % ------ Proving...
% 1.79/1.99 % warning: shown sat in sat incomplete mode
% 1.79/1.99 %
% 1.79/1.99
% 1.79/1.99
% 1.79/1.99 ------ Building Model...Done
% 1.79/1.99
% 1.79/1.99 %------ The model is defined over ground terms (initial term algebra).
% 1.79/1.99 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.79/1.99 %------ where \phi is a formula over the term algebra.
% 1.79/1.99 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.79/1.99 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.79/1.99 %------ See help for --sat_out_model for different model outputs.
% 1.79/1.99 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.79/1.99 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.79/1.99
% 1.79/1.99
% 1.79/1.99
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of c1_0
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( c1_0 <=>
% 1.79/1.99 $true
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of c2_1
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 (! [X0] :
% 1.79/1.99 ( c2_1(X0) <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Negative definition of c4_2
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 (! [X0,X1] :
% 1.79/1.99 ( ~(c4_2(X0,X1)) <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Negative definition of c2_2
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 (! [X0,X1] :
% 1.79/1.99 ( ~(c2_2(X0,X1)) <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of c5_1
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 (! [X0] :
% 1.79/1.99 ( c5_1(X0) <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of ndr1_0
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( ndr1_0 <=>
% 1.79/1.99 $true
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Negative definition of c3_2
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 (! [X0,X1] :
% 1.79/1.99 ( ~(c3_2(X0,X1)) <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of ndr1_1
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 (! [X0] :
% 1.79/1.99 ( ndr1_1(X0) <=>
% 1.79/1.99 (
% 1.79/1.99 (
% 1.79/1.99 ( X0=a537 )
% 1.79/1.99 )
% 1.79/1.99
% 1.79/1.99 |
% 1.79/1.99 (
% 1.79/1.99 ( X0=a525 )
% 1.79/1.99 )
% 1.79/1.99
% 1.79/1.99 )
% 1.79/1.99 )
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of c1_2
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 (! [X0,X1] :
% 1.79/1.99 ( c1_2(X0,X1) <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of c3_0
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( c3_0 <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of c5_0
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( c5_0 <=>
% 1.79/1.99 $true
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of c2_0
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( c2_0 <=>
% 1.79/1.99 $true
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of c1_1
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 (! [X0] :
% 1.79/1.99 ( c1_1(X0) <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of c4_0
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( c4_0 <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of c3_1
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 (! [X0] :
% 1.79/1.99 ( c3_1(X0) <=>
% 1.79/1.99 (
% 1.79/1.99 (
% 1.79/1.99 ( X0=a525 )
% 1.79/1.99 )
% 1.79/1.99
% 1.79/1.99 )
% 1.79/1.99 )
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of epred1_0
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( epred1_0 <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP0_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP0_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP1_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP1_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP2_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP2_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP3_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP3_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP4_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP4_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP5_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP5_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP6_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP6_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP10_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP10_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP11_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP11_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP13_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP13_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP14_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP14_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP19_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP19_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP20_iProver_split
% 1.79/1.99 fof(lit_def,axiom,
% 1.79/1.99 ( sP20_iProver_split <=>
% 1.79/1.99 $false
% 1.79/1.99 )
% 1.79/1.99 ).
% 1.79/1.99
% 1.79/1.99 %------ Positive definition of sP24_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP24_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00 %------ Positive definition of sP26_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP26_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00 %------ Positive definition of sP27_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP27_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00 %------ Positive definition of sP28_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP28_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00 %------ Positive definition of sP34_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP34_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00 %------ Positive definition of sP35_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP35_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00 %------ Positive definition of sP36_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP36_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00 %------ Positive definition of sP37_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP37_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00 %------ Positive definition of sP38_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP38_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00 %------ Positive definition of sP39_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP39_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00 %------ Positive definition of sP41_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP41_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00 %------ Positive definition of sP42_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP42_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00 %------ Positive definition of sP43_iProver_split
% 1.79/2.00 fof(lit_def,axiom,
% 1.79/2.00 ( sP43_iProver_split <=>
% 1.79/2.00 $false
% 1.79/2.00 )
% 1.79/2.00 ).
% 1.79/2.00
% 1.79/2.00
% 1.79/2.00
% 1.79/2.00 % ------ Statistics
% 1.79/2.00
% 1.79/2.00 % ------ General
% 1.79/2.00
% 1.79/2.00 % num_of_input_clauses: 182
% 1.79/2.00 % num_of_input_neg_conjectures: 154
% 1.79/2.00 % num_of_splits: 244
% 1.79/2.00 % num_of_split_atoms: 44
% 1.79/2.00 % num_of_sem_filtered_clauses: 0
% 1.79/2.00 % num_of_subtypes: 0
% 1.79/2.00 % monotx_restored_types: 0
% 1.79/2.00 % sat_num_of_epr_types: 0
% 1.79/2.00 % sat_num_of_non_cyclic_types: 0
% 1.79/2.00 % sat_guarded_non_collapsed_types: 0
% 1.79/2.00 % is_epr: 1
% 1.79/2.00 % is_horn: 0
% 1.79/2.00 % has_eq: 0
% 1.79/2.00 % num_pure_diseq_elim: 0
% 1.79/2.00 % simp_replaced_by: 0
% 1.79/2.00 % res_preprocessed: 526
% 1.79/2.00 % prep_upred: 0
% 1.79/2.00 % prep_unflattend: 0
% 1.79/2.00 % pred_elim_cands: 44
% 1.79/2.00 % pred_elim: 18
% 1.79/2.00 % pred_elim_cl: 25
% 1.79/2.00 % pred_elim_cycles: 44
% 1.79/2.00 % forced_gc_time: 0
% 1.79/2.00 % gc_basic_clause_elim: 0
% 1.79/2.00 % parsing_time: 0.007
% 1.79/2.00 % sem_filter_time: 0.
% 1.79/2.00 % pred_elim_time: 0.052
% 1.79/2.00 % out_proof_time: 0.
% 1.79/2.00 % monotx_time: 0.
% 1.79/2.00 % subtype_inf_time: 0.
% 1.79/2.00 % unif_index_cands_time: 0.002
% 1.79/2.00 % unif_index_add_time: 0.001
% 1.79/2.00 % total_time: 1.514
% 1.79/2.00 % num_of_symbols: 113
% 1.79/2.00 % num_of_terms: 1109
% 1.79/2.00
% 1.79/2.00 % ------ Propositional Solver
% 1.79/2.00
% 1.79/2.00 % prop_solver_calls: 2
% 1.79/2.00 % prop_fast_solver_calls: 3795
% 1.79/2.00 % prop_num_of_clauses: 650
% 1.79/2.00 % prop_preprocess_simplified: 3397
% 1.79/2.00 % prop_fo_subsumed: 244
% 1.79/2.00 % prop_solver_time: 0.
% 1.79/2.00 % prop_fast_solver_time: 0.003
% 1.79/2.00 % prop_unsat_core_time: 0.
% 1.79/2.00
% 1.79/2.00 % ------ QBF
% 1.79/2.00
% 1.79/2.00 % qbf_q_res: 0
% 1.79/2.00 % qbf_num_tautologies: 0
% 1.79/2.00 % qbf_prep_cycles: 0
% 1.79/2.00
% 1.79/2.00 % ------ BMC1
% 1.79/2.00
% 1.79/2.00 % bmc1_current_bound: -1
% 1.79/2.00 % bmc1_last_solved_bound: -1
% 1.79/2.00 % bmc1_unsat_core_size: -1
% 1.79/2.00 % bmc1_unsat_core_parents_size: -1
% 1.79/2.00 % bmc1_merge_next_fun: 0
% 1.79/2.00 % bmc1_unsat_core_clauses_time: 0.
% 1.79/2.00
% 1.79/2.00 % ------ Instantiation
% 1.79/2.00
% 1.79/2.00 % inst_num_of_clauses: 153
% 1.79/2.00 % inst_num_in_passive: 0
% 1.79/2.00 % inst_num_in_active: 153
% 1.79/2.00 % inst_num_in_unprocessed: 0
% 1.79/2.00 % inst_num_of_loops: 155
% 1.79/2.00 % inst_num_of_learning_restarts: 0
% 1.79/2.00 % inst_num_moves_active_passive: 0
% 1.79/2.00 % inst_lit_activity: 38
% 1.79/2.00 % inst_lit_activity_moves: 0
% 1.79/2.00 % inst_num_tautologies: 0
% 1.79/2.00 % inst_num_prop_implied: 0
% 1.79/2.00 % inst_num_existing_simplified: 0
% 1.79/2.00 % inst_num_eq_res_simplified: 0
% 1.79/2.00 % inst_num_child_elim: 0
% 1.79/2.00 % inst_num_of_dismatching_blockings: 0
% 1.79/2.00 % inst_num_of_non_proper_insts: 0
% 1.79/2.00 % inst_num_of_duplicates: 0
% 1.79/2.00 % inst_inst_num_from_inst_to_res: 0
% 1.79/2.00 % inst_dismatching_checking_time: 0.
% 1.79/2.00
% 1.79/2.00 % ------ Resolution
% 1.79/2.00
% 1.79/2.00 % res_num_of_clauses: 4320
% 1.79/2.00 % res_num_in_passive: 3748
% 1.79/2.00 % res_num_in_active: 585
% 1.79/2.00 % res_num_of_loops: 1000
% 1.79/2.00 % res_forward_subset_subsumed: 476
% 1.79/2.00 % res_backward_subset_subsumed: 14
% 1.79/2.00 % res_forward_subsumed: 413
% 1.79/2.00 % res_backward_subsumed: 2
% 1.79/2.00 % res_forward_subsumption_resolution: 246
% 1.79/2.00 % res_backward_subsumption_resolution: 0
% 1.79/2.00 % res_clause_to_clause_subsumption: 3312
% 1.79/2.00 % res_orphan_elimination: 0
% 1.79/2.00 % res_tautology_del: 3018
% 1.79/2.00 % res_num_eq_res_simplified: 0
% 1.79/2.00 % res_num_sel_changes: 0
% 1.79/2.00 % res_moves_from_active_to_pass: 0
% 1.79/2.00
% 1.79/2.00 % Status Unknown
% 1.79/2.04 % Orienting using strategy ClausalAll
% 1.79/2.04 % FOF problem with conjecture
% 1.79/2.04 % 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_2a6693.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_d4b59e.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_d4eec1 | grep -v "SZS"
% 1.89/2.06
% 1.89/2.06 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.89/2.06
% 1.89/2.06 %
% 1.89/2.06 % ------ iProver source info
% 1.89/2.06
% 1.89/2.06 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.89/2.06 % git: non_committed_changes: true
% 1.89/2.06 % git: last_make_outside_of_git: true
% 1.89/2.06
% 1.89/2.06 %
% 1.89/2.06 % ------ Input Options
% 1.89/2.06
% 1.89/2.06 % --out_options all
% 1.89/2.06 % --tptp_safe_out true
% 1.89/2.06 % --problem_path ""
% 1.89/2.06 % --include_path ""
% 1.89/2.06 % --clausifier .//eprover
% 1.89/2.06 % --clausifier_options --tstp-format
% 1.89/2.06 % --stdin false
% 1.89/2.06 % --dbg_backtrace false
% 1.89/2.06 % --dbg_dump_prop_clauses false
% 1.89/2.06 % --dbg_dump_prop_clauses_file -
% 1.89/2.06 % --dbg_out_stat false
% 1.89/2.06
% 1.89/2.06 % ------ General Options
% 1.89/2.06
% 1.89/2.06 % --fof false
% 1.89/2.06 % --time_out_real 150.
% 1.89/2.06 % --time_out_prep_mult 0.2
% 1.89/2.06 % --time_out_virtual -1.
% 1.89/2.06 % --schedule none
% 1.89/2.06 % --ground_splitting input
% 1.89/2.06 % --splitting_nvd 16
% 1.89/2.06 % --non_eq_to_eq false
% 1.89/2.06 % --prep_gs_sim true
% 1.89/2.06 % --prep_unflatten false
% 1.89/2.06 % --prep_res_sim true
% 1.89/2.06 % --prep_upred true
% 1.89/2.06 % --res_sim_input true
% 1.89/2.06 % --clause_weak_htbl true
% 1.89/2.06 % --gc_record_bc_elim false
% 1.89/2.06 % --symbol_type_check false
% 1.89/2.06 % --clausify_out false
% 1.89/2.06 % --large_theory_mode false
% 1.89/2.06 % --prep_sem_filter none
% 1.89/2.06 % --prep_sem_filter_out false
% 1.89/2.06 % --preprocessed_out false
% 1.89/2.06 % --sub_typing false
% 1.89/2.06 % --brand_transform false
% 1.89/2.06 % --pure_diseq_elim true
% 1.89/2.06 % --min_unsat_core false
% 1.89/2.06 % --pred_elim true
% 1.89/2.06 % --add_important_lit false
% 1.89/2.06 % --soft_assumptions false
% 1.89/2.06 % --reset_solvers false
% 1.89/2.06 % --bc_imp_inh []
% 1.89/2.06 % --conj_cone_tolerance 1.5
% 1.89/2.06 % --prolific_symb_bound 500
% 1.89/2.06 % --lt_threshold 2000
% 1.89/2.06
% 1.89/2.06 % ------ SAT Options
% 1.89/2.06
% 1.89/2.06 % --sat_mode false
% 1.89/2.06 % --sat_fm_restart_options ""
% 1.89/2.06 % --sat_gr_def false
% 1.89/2.06 % --sat_epr_types true
% 1.89/2.06 % --sat_non_cyclic_types false
% 1.89/2.06 % --sat_finite_models false
% 1.89/2.06 % --sat_fm_lemmas false
% 1.89/2.06 % --sat_fm_prep false
% 1.89/2.06 % --sat_fm_uc_incr true
% 1.89/2.06 % --sat_out_model small
% 1.89/2.06 % --sat_out_clauses false
% 1.89/2.06
% 1.89/2.06 % ------ QBF Options
% 1.89/2.06
% 1.89/2.06 % --qbf_mode false
% 1.89/2.06 % --qbf_elim_univ true
% 1.89/2.06 % --qbf_sk_in true
% 1.89/2.06 % --qbf_pred_elim true
% 1.89/2.06 % --qbf_split 32
% 1.89/2.06
% 1.89/2.06 % ------ BMC1 Options
% 1.89/2.06
% 1.89/2.06 % --bmc1_incremental false
% 1.89/2.06 % --bmc1_axioms reachable_all
% 1.89/2.06 % --bmc1_min_bound 0
% 1.89/2.06 % --bmc1_max_bound -1
% 1.89/2.06 % --bmc1_max_bound_default -1
% 1.89/2.06 % --bmc1_symbol_reachability true
% 1.89/2.06 % --bmc1_property_lemmas false
% 1.89/2.06 % --bmc1_k_induction false
% 1.89/2.06 % --bmc1_non_equiv_states false
% 1.89/2.06 % --bmc1_deadlock false
% 1.89/2.06 % --bmc1_ucm false
% 1.89/2.06 % --bmc1_add_unsat_core none
% 1.89/2.06 % --bmc1_unsat_core_children false
% 1.89/2.06 % --bmc1_unsat_core_extrapolate_axioms false
% 1.89/2.06 % --bmc1_out_stat full
% 1.89/2.06 % --bmc1_ground_init false
% 1.89/2.06 % --bmc1_pre_inst_next_state false
% 1.89/2.06 % --bmc1_pre_inst_state false
% 1.89/2.06 % --bmc1_pre_inst_reach_state false
% 1.89/2.06 % --bmc1_out_unsat_core false
% 1.89/2.06 % --bmc1_aig_witness_out false
% 1.89/2.06 % --bmc1_verbose false
% 1.89/2.06 % --bmc1_dump_clauses_tptp false
% 1.89/2.16 % --bmc1_dump_unsat_core_tptp false
% 1.89/2.16 % --bmc1_dump_file -
% 1.89/2.16 % --bmc1_ucm_expand_uc_limit 128
% 1.89/2.16 % --bmc1_ucm_n_expand_iterations 6
% 1.89/2.16 % --bmc1_ucm_extend_mode 1
% 1.89/2.16 % --bmc1_ucm_init_mode 2
% 1.89/2.16 % --bmc1_ucm_cone_mode none
% 1.89/2.16 % --bmc1_ucm_reduced_relation_type 0
% 1.89/2.16 % --bmc1_ucm_relax_model 4
% 1.89/2.16 % --bmc1_ucm_full_tr_after_sat true
% 1.89/2.16 % --bmc1_ucm_expand_neg_assumptions false
% 1.89/2.16 % --bmc1_ucm_layered_model none
% 1.89/2.16 % --bmc1_ucm_max_lemma_size 10
% 1.89/2.16
% 1.89/2.16 % ------ AIG Options
% 1.89/2.16
% 1.89/2.16 % --aig_mode false
% 1.89/2.16
% 1.89/2.16 % ------ Instantiation Options
% 1.89/2.16
% 1.89/2.16 % --instantiation_flag true
% 1.89/2.16 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.89/2.16 % --inst_solver_per_active 750
% 1.89/2.16 % --inst_solver_calls_frac 0.5
% 1.89/2.16 % --inst_passive_queue_type priority_queues
% 1.89/2.16 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.89/2.16 % --inst_passive_queues_freq [25;2]
% 1.89/2.16 % --inst_dismatching true
% 1.89/2.16 % --inst_eager_unprocessed_to_passive true
% 1.89/2.16 % --inst_prop_sim_given true
% 1.89/2.16 % --inst_prop_sim_new false
% 1.89/2.16 % --inst_orphan_elimination true
% 1.89/2.16 % --inst_learning_loop_flag true
% 1.89/2.16 % --inst_learning_start 3000
% 1.89/2.16 % --inst_learning_factor 2
% 1.89/2.16 % --inst_start_prop_sim_after_learn 3
% 1.89/2.16 % --inst_sel_renew solver
% 1.89/2.16 % --inst_lit_activity_flag true
% 1.89/2.16 % --inst_out_proof true
% 1.89/2.16
% 1.89/2.16 % ------ Resolution Options
% 1.89/2.16
% 1.89/2.16 % --resolution_flag true
% 1.89/2.16 % --res_lit_sel kbo_max
% 1.89/2.16 % --res_to_prop_solver none
% 1.89/2.16 % --res_prop_simpl_new false
% 1.89/2.16 % --res_prop_simpl_given false
% 1.89/2.16 % --res_passive_queue_type priority_queues
% 1.89/2.16 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.89/2.16 % --res_passive_queues_freq [15;5]
% 1.89/2.16 % --res_forward_subs full
% 1.89/2.16 % --res_backward_subs full
% 1.89/2.16 % --res_forward_subs_resolution true
% 1.89/2.16 % --res_backward_subs_resolution true
% 1.89/2.16 % --res_orphan_elimination false
% 1.89/2.16 % --res_time_limit 1000.
% 1.89/2.16 % --res_out_proof true
% 1.89/2.16 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2a6693.s
% 1.89/2.16 % --modulo true
% 1.89/2.16
% 1.89/2.16 % ------ Combination Options
% 1.89/2.16
% 1.89/2.16 % --comb_res_mult 1000
% 1.89/2.16 % --comb_inst_mult 300
% 1.89/2.16 % ------
% 1.89/2.16
% 1.89/2.16 % ------ Parsing...% successful
% 1.89/2.16
% 1.89/2.16 % ------ Preprocessing... gs_s sp: 244 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e snvd_s sp: 0 0s snvd_e %
% 1.89/2.16
% 1.89/2.16 % ------ Proving...
% 1.89/2.16 % ------ Problem Properties
% 1.89/2.16
% 1.89/2.16 %
% 1.89/2.16 % EPR true
% 1.89/2.16 % Horn false
% 1.89/2.16 % Has equality false
% 1.89/2.16
% 1.89/2.16 % % ------ Input Options Time Limit: Unbounded
% 1.89/2.16
% 1.89/2.16
% 1.89/2.16 % % ------ Current options:
% 1.89/2.16
% 1.89/2.16 % ------ Input Options
% 1.89/2.16
% 1.89/2.16 % --out_options all
% 1.89/2.16 % --tptp_safe_out true
% 1.89/2.16 % --problem_path ""
% 1.89/2.16 % --include_path ""
% 1.89/2.16 % --clausifier .//eprover
% 1.89/2.16 % --clausifier_options --tstp-format
% 1.89/2.16 % --stdin false
% 1.89/2.16 % --dbg_backtrace false
% 1.89/2.16 % --dbg_dump_prop_clauses false
% 1.89/2.16 % --dbg_dump_prop_clauses_file -
% 1.89/2.16 % --dbg_out_stat false
% 1.89/2.16
% 1.89/2.16 % ------ General Options
% 1.89/2.16
% 1.89/2.16 % --fof false
% 1.89/2.16 % --time_out_real 150.
% 1.89/2.16 % --time_out_prep_mult 0.2
% 1.89/2.16 % --time_out_virtual -1.
% 1.89/2.16 % --schedule none
% 1.89/2.16 % --ground_splitting input
% 1.89/2.16 % --splitting_nvd 16
% 1.89/2.16 % --non_eq_to_eq false
% 1.89/2.16 % --prep_gs_sim true
% 1.89/2.16 % --prep_unflatten false
% 1.89/2.16 % --prep_res_sim true
% 1.89/2.16 % --prep_upred true
% 1.89/2.16 % --res_sim_input true
% 1.89/2.16 % --clause_weak_htbl true
% 1.89/2.16 % --gc_record_bc_elim false
% 1.89/2.16 % --symbol_type_check false
% 1.89/2.16 % --clausify_out false
% 1.89/2.16 % --large_theory_mode false
% 1.89/2.16 % --prep_sem_filter none
% 1.89/2.16 % --prep_sem_filter_out false
% 1.89/2.16 % --preprocessed_out false
% 1.89/2.16 % --sub_typing false
% 1.89/2.16 % --brand_transform false
% 1.89/2.16 % --pure_diseq_elim true
% 1.89/2.16 % --min_unsat_core false
% 1.89/2.16 % --pred_elim true
% 1.89/2.16 % --add_important_lit false
% 1.89/2.16 % --soft_assumptions false
% 1.89/2.16 % --reset_solvers false
% 1.89/2.16 % --bc_imp_inh []
% 1.89/2.16 % --conj_cone_tolerance 1.5
% 1.89/2.16 % --prolific_symb_bound 500
% 1.89/2.16 % --lt_threshold 2000
% 1.89/2.16
% 1.89/2.16 % ------ SAT Options
% 1.89/2.16
% 1.89/2.16 % --sat_mode false
% 1.89/2.16 % --sat_fm_restart_options ""
% 1.89/2.16 % --sat_gr_def false
% 1.89/2.16 % --sat_epr_types true
% 1.89/2.16 % --sat_non_cyclic_types false
% 1.89/2.16 % --sat_finite_models false
% 1.89/2.16 % --sat_fm_lemmas false
% 1.89/2.16 % --sat_fm_prep false
% 1.89/2.16 % --sat_fm_uc_incr true
% 1.89/2.16 % --sat_out_model small
% 1.89/2.16 % --sat_out_clauses false
% 1.89/2.16
% 1.89/2.16 % ------ QBF Options
% 1.89/2.16
% 1.89/2.16 % --qbf_mode false
% 1.89/2.16 % --qbf_elim_univ true
% 1.89/2.16 % --qbf_sk_in true
% 1.89/2.16 % --qbf_pred_elim true
% 1.89/2.16 % --qbf_split 32
% 1.89/2.16
% 1.89/2.16 % ------ BMC1 Options
% 1.89/2.16
% 1.89/2.16 % --bmc1_incremental false
% 1.89/2.16 % --bmc1_axioms reachable_all
% 1.89/2.16 % --bmc1_min_bound 0
% 1.89/2.16 % --bmc1_max_bound -1
% 1.89/2.16 % --bmc1_max_bound_default -1
% 1.89/2.16 % --bmc1_symbol_reachability true
% 1.89/2.16 % --bmc1_property_lemmas false
% 1.89/2.16 % --bmc1_k_induction false
% 1.89/2.16 % --bmc1_non_equiv_states false
% 1.89/2.16 % --bmc1_deadlock false
% 1.89/2.16 % --bmc1_ucm false
% 1.89/2.16 % --bmc1_add_unsat_core none
% 1.89/2.16 % --bmc1_unsat_core_children false
% 1.89/2.16 % --bmc1_unsat_core_extrapolate_axioms false
% 1.89/2.16 % --bmc1_out_stat full
% 1.89/2.16 % --bmc1_ground_init false
% 1.89/2.16 % --bmc1_pre_inst_next_state false
% 1.89/2.16 % --bmc1_pre_inst_state false
% 1.89/2.16 % --bmc1_pre_inst_reach_state false
% 1.89/2.16 % --bmc1_out_unsat_core false
% 1.89/2.16 % --bmc1_aig_witness_out false
% 1.89/2.16 % --bmc1_verbose false
% 1.89/2.16 % --bmc1_dump_clauses_tptp false
% 1.89/2.16 % --bmc1_dump_unsat_core_tptp false
% 1.89/2.16 % --bmc1_dump_file -
% 1.89/2.16 % --bmc1_ucm_expand_uc_limit 128
% 1.89/2.16 % --bmc1_ucm_n_expand_iterations 6
% 1.89/2.16 % --bmc1_ucm_extend_mode 1
% 1.89/2.16 % --bmc1_ucm_init_mode 2
% 1.89/2.16 % --bmc1_ucm_cone_mode none
% 1.89/2.16 % --bmc1_ucm_reduced_relation_type 0
% 1.89/2.16 % --bmc1_ucm_relax_model 4
% 1.89/2.16 % --bmc1_ucm_full_tr_after_sat true
% 1.89/2.16 % --bmc1_ucm_expand_neg_assumptions false
% 1.89/2.16 % --bmc1_ucm_layered_model none
% 1.89/2.16 % --bmc1_ucm_max_lemma_size 10
% 1.89/2.16
% 1.89/2.16 % ------ AIG Options
% 1.89/2.16
% 1.89/2.16 % --aig_mode false
% 1.89/2.16
% 1.89/2.16 % ------ Instantiation Options
% 1.89/2.16
% 1.89/2.16 % --instantiation_flag true
% 1.89/2.16 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.89/2.16 % --inst_solver_per_active 750
% 1.89/2.16 % --inst_solver_calls_frac 0.5
% 1.89/2.16 % --inst_passive_queue_type priority_queues
% 1.89/2.16 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.89/2.16 % --inst_passive_queues_freq [25;2]
% 1.89/2.16 % --inst_dismatching true
% 1.89/2.16 % --inst_eager_unprocessed_to_passive true
% 3.41/3.61 % --inst_prop_sim_given true
% 3.41/3.61 % --inst_prop_sim_new false
% 3.41/3.61 % --inst_orphan_elimination true
% 3.41/3.61 % --inst_learning_loop_flag true
% 3.41/3.61 % --inst_learning_start 3000
% 3.41/3.61 % --inst_learning_factor 2
% 3.41/3.61 % --inst_start_prop_sim_after_learn 3
% 3.41/3.61 % --inst_sel_renew solver
% 3.41/3.61 % --inst_lit_activity_flag true
% 3.41/3.61 % --inst_out_proof true
% 3.41/3.61
% 3.41/3.61 % ------ Resolution Options
% 3.41/3.61
% 3.41/3.61 % --resolution_flag true
% 3.41/3.61 % --res_lit_sel kbo_max
% 3.41/3.61 % --res_to_prop_solver none
% 3.41/3.61 % --res_prop_simpl_new false
% 3.41/3.61 % --res_prop_simpl_given false
% 3.41/3.61 % --res_passive_queue_type priority_queues
% 3.41/3.61 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.41/3.61 % --res_passive_queues_freq [15;5]
% 3.41/3.61 % --res_forward_subs full
% 3.41/3.61 % --res_backward_subs full
% 3.41/3.61 % --res_forward_subs_resolution true
% 3.41/3.61 % --res_backward_subs_resolution true
% 3.41/3.61 % --res_orphan_elimination false
% 3.41/3.61 % --res_time_limit 1000.
% 3.41/3.61 % --res_out_proof true
% 3.41/3.61 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_2a6693.s
% 3.41/3.61 % --modulo true
% 3.41/3.61
% 3.41/3.61 % ------ Combination Options
% 3.41/3.61
% 3.41/3.61 % --comb_res_mult 1000
% 3.41/3.61 % --comb_inst_mult 300
% 3.41/3.61 % ------
% 3.41/3.61
% 3.41/3.61
% 3.41/3.61
% 3.41/3.61 % ------ Proving...
% 3.41/3.61 % warning: shown sat in sat incomplete mode
% 3.41/3.61 %
% 3.41/3.61
% 3.41/3.61
% 3.41/3.61 ------ Building Model...Done
% 3.41/3.61
% 3.41/3.61 %------ The model is defined over ground terms (initial term algebra).
% 3.41/3.61 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.41/3.61 %------ where \phi is a formula over the term algebra.
% 3.41/3.61 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.41/3.61 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.41/3.61 %------ See help for --sat_out_model for different model outputs.
% 3.41/3.61 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.41/3.61 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.41/3.61
% 3.41/3.61
% 3.41/3.61
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of c1_0
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( c1_0 <=>
% 3.41/3.61 $true
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of c2_1
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 (! [X0] :
% 3.41/3.61 ( c2_1(X0) <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Negative definition of c4_2
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 (! [X0,X1] :
% 3.41/3.61 ( ~(c4_2(X0,X1)) <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Negative definition of c2_2
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 (! [X0,X1] :
% 3.41/3.61 ( ~(c2_2(X0,X1)) <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of c5_1
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 (! [X0] :
% 3.41/3.61 ( c5_1(X0) <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of ndr1_0
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( ndr1_0 <=>
% 3.41/3.61 $true
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Negative definition of c3_2
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 (! [X0,X1] :
% 3.41/3.61 ( ~(c3_2(X0,X1)) <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of ndr1_1
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 (! [X0] :
% 3.41/3.61 ( ndr1_1(X0) <=>
% 3.41/3.61 (
% 3.41/3.61 (
% 3.41/3.61 ( X0=a537 )
% 3.41/3.61 )
% 3.41/3.61
% 3.41/3.61 |
% 3.41/3.61 (
% 3.41/3.61 ( X0=a525 )
% 3.41/3.61 )
% 3.41/3.61
% 3.41/3.61 )
% 3.41/3.61 )
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of c1_2
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 (! [X0,X1] :
% 3.41/3.61 ( c1_2(X0,X1) <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of c3_0
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( c3_0 <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of c5_0
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( c5_0 <=>
% 3.41/3.61 $true
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of c2_0
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( c2_0 <=>
% 3.41/3.61 $true
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of c1_1
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 (! [X0] :
% 3.41/3.61 ( c1_1(X0) <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of c4_0
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( c4_0 <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of c3_1
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 (! [X0] :
% 3.41/3.61 ( c3_1(X0) <=>
% 3.41/3.61 (
% 3.41/3.61 (
% 3.41/3.61 ( X0=a525 )
% 3.41/3.61 )
% 3.41/3.61
% 3.41/3.61 )
% 3.41/3.61 )
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of epred1_0
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( epred1_0 <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP0_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP0_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP1_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP1_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP2_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP2_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP3_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP3_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP4_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP4_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP5_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP5_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP6_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP6_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP10_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP10_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP11_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP11_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP13_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP13_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP14_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP14_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP19_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP19_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP20_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP20_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP24_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP24_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP26_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP26_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP27_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP27_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP28_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP28_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP34_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP34_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP35_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP35_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP36_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP36_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP37_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP37_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP38_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP38_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP39_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP39_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP41_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP41_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP42_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP42_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61 %------ Positive definition of sP43_iProver_split
% 3.41/3.61 fof(lit_def,axiom,
% 3.41/3.61 ( sP43_iProver_split <=>
% 3.41/3.61 $false
% 3.41/3.61 )
% 3.41/3.61 ).
% 3.41/3.61
% 3.41/3.61
% 3.41/3.61
% 3.41/3.61 % ------ Statistics
% 3.41/3.61
% 3.41/3.61 % ------ General
% 3.41/3.61
% 3.41/3.61 % num_of_input_clauses: 182
% 3.41/3.61 % num_of_input_neg_conjectures: 154
% 3.41/3.61 % num_of_splits: 244
% 3.41/3.61 % num_of_split_atoms: 44
% 3.41/3.61 % num_of_sem_filtered_clauses: 0
% 3.41/3.61 % num_of_subtypes: 0
% 3.41/3.61 % monotx_restored_types: 0
% 3.41/3.61 % sat_num_of_epr_types: 0
% 3.41/3.61 % sat_num_of_non_cyclic_types: 0
% 3.41/3.61 % sat_guarded_non_collapsed_types: 0
% 3.41/3.61 % is_epr: 1
% 3.41/3.61 % is_horn: 0
% 3.41/3.61 % has_eq: 0
% 3.41/3.61 % num_pure_diseq_elim: 0
% 3.41/3.61 % simp_replaced_by: 0
% 3.41/3.61 % res_preprocessed: 526
% 3.41/3.61 % prep_upred: 0
% 3.41/3.61 % prep_unflattend: 0
% 3.41/3.61 % pred_elim_cands: 44
% 3.41/3.61 % pred_elim: 18
% 3.41/3.61 % pred_elim_cl: 25
% 3.41/3.61 % pred_elim_cycles: 44
% 3.41/3.61 % forced_gc_time: 0
% 3.41/3.61 % gc_basic_clause_elim: 0
% 3.41/3.61 % parsing_time: 0.007
% 3.41/3.61 % sem_filter_time: 0.
% 3.41/3.61 % pred_elim_time: 0.051
% 3.41/3.61 % out_proof_time: 0.
% 3.41/3.61 % monotx_time: 0.
% 3.41/3.61 % subtype_inf_time: 0.
% 3.41/3.61 % unif_index_cands_time: 0.002
% 3.41/3.61 % unif_index_add_time: 0.001
% 3.41/3.61 % total_time: 1.562
% 3.41/3.61 % num_of_symbols: 113
% 3.41/3.61 % num_of_terms: 1109
% 3.41/3.61
% 3.41/3.61 % ------ Propositional Solver
% 3.41/3.61
% 3.41/3.61 % prop_solver_calls: 2
% 3.41/3.61 % prop_fast_solver_calls: 3795
% 3.41/3.61 % prop_num_of_clauses: 650
% 3.41/3.61 % prop_preprocess_simplified: 3397
% 3.41/3.61 % prop_fo_subsumed: 244
% 3.41/3.61 % prop_solver_time: 0.
% 3.41/3.61 % prop_fast_solver_time: 0.003
% 3.41/3.61 % prop_unsat_core_time: 0.
% 3.41/3.61
% 3.41/3.61 % ------ QBF
% 3.41/3.61
% 3.41/3.61 % qbf_q_res: 0
% 3.41/3.61 % qbf_num_tautologies: 0
% 3.41/3.61 % qbf_prep_cycles: 0
% 3.41/3.61
% 3.41/3.61 % ------ BMC1
% 3.41/3.61
% 3.41/3.61 % bmc1_current_bound: -1
% 3.41/3.61 % bmc1_last_solved_bound: -1
% 3.41/3.61 % bmc1_unsat_core_size: -1
% 3.41/3.61 % bmc1_unsat_core_parents_size: -1
% 3.41/3.61 % bmc1_merge_next_fun: 0
% 3.41/3.61 % bmc1_unsat_core_clauses_time: 0.
% 3.41/3.61
% 3.41/3.61 % ------ Instantiation
% 3.41/3.61
% 3.41/3.61 % inst_num_of_clauses: 153
% 3.41/3.61 % inst_num_in_passive: 0
% 3.41/3.61 % inst_num_in_active: 153
% 3.41/3.61 % inst_num_in_unprocessed: 0
% 3.41/3.61 % inst_num_of_loops: 155
% 3.41/3.61 % inst_num_of_learning_restarts: 0
% 3.41/3.61 % inst_num_moves_active_passive: 0
% 3.41/3.61 % inst_lit_activity: 38
% 3.41/3.61 % inst_lit_activity_moves: 0
% 3.41/3.61 % inst_num_tautologies: 0
% 3.41/3.61 % inst_num_prop_implied: 0
% 3.41/3.61 % inst_num_existing_simplified: 0
% 3.41/3.61 % inst_num_eq_res_simplified: 0
% 3.41/3.61 % inst_num_child_elim: 0
% 3.41/3.61 % inst_num_of_dismatching_blockings: 0
% 3.41/3.61 % inst_num_of_non_proper_insts: 0
% 3.41/3.61 % inst_num_of_duplicates: 0
% 3.41/3.61 % inst_inst_num_from_inst_to_res: 0
% 3.41/3.61 % inst_dismatching_checking_time: 0.
% 3.41/3.61
% 3.41/3.61 % ------ Resolution
% 3.41/3.61
% 3.41/3.61 % res_num_of_clauses: 4320
% 3.41/3.61 % res_num_in_passive: 3748
% 3.41/3.61 % res_num_in_active: 585
% 3.41/3.61 % res_num_of_loops: 1000
% 3.41/3.61 % res_forward_subset_subsumed: 476
% 3.41/3.61 % res_backward_subset_subsumed: 14
% 3.41/3.61 % res_forward_subsumed: 413
% 3.41/3.61 % res_backward_subsumed: 2
% 3.41/3.61 % res_forward_subsumption_resolution: 246
% 3.41/3.61 % res_backward_subsumption_resolution: 0
% 3.41/3.61 % res_clause_to_clause_subsumption: 3312
% 3.41/3.61 % res_orphan_elimination: 0
% 3.41/3.61 % res_tautology_del: 3018
% 3.41/3.61 % res_num_eq_res_simplified: 0
% 3.41/3.61 % res_num_sel_changes: 0
% 3.41/3.61 % res_moves_from_active_to_pass: 0
% 3.41/3.61
% 3.41/3.61 % Status Unknown
% 3.41/3.61 % Last status :
% 3.41/3.61 % SZS status Unknown
%------------------------------------------------------------------------------