TSTP Solution File: NLP030+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP030+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n020.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 : Mon Jul 18 02:38:46 EDT 2022
% Result : Unknown 5.63s 5.81s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NLP030+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.13 % Command : iprover_modulo %s %d
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 1 01:23:15 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.21/0.51 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.51 % FOF problem with conjecture
% 0.21/0.51 % 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_bef793.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c6ba37.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_18536e | grep -v "SZS"
% 0.21/0.54
% 0.21/0.54 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.54
% 0.21/0.54 %
% 0.21/0.54 % ------ iProver source info
% 0.21/0.54
% 0.21/0.54 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.54 % git: non_committed_changes: true
% 0.21/0.54 % git: last_make_outside_of_git: true
% 0.21/0.54
% 0.21/0.54 %
% 0.21/0.54 % ------ Input Options
% 0.21/0.54
% 0.21/0.54 % --out_options all
% 0.21/0.54 % --tptp_safe_out true
% 0.21/0.54 % --problem_path ""
% 0.21/0.54 % --include_path ""
% 0.21/0.54 % --clausifier .//eprover
% 0.21/0.54 % --clausifier_options --tstp-format
% 0.21/0.54 % --stdin false
% 0.21/0.54 % --dbg_backtrace false
% 0.21/0.54 % --dbg_dump_prop_clauses false
% 0.21/0.54 % --dbg_dump_prop_clauses_file -
% 0.21/0.54 % --dbg_out_stat false
% 0.21/0.54
% 0.21/0.54 % ------ General Options
% 0.21/0.54
% 0.21/0.54 % --fof false
% 0.21/0.54 % --time_out_real 150.
% 0.21/0.54 % --time_out_prep_mult 0.2
% 0.21/0.54 % --time_out_virtual -1.
% 0.21/0.54 % --schedule none
% 0.21/0.54 % --ground_splitting input
% 0.21/0.54 % --splitting_nvd 16
% 0.21/0.54 % --non_eq_to_eq false
% 0.21/0.54 % --prep_gs_sim true
% 0.21/0.54 % --prep_unflatten false
% 0.21/0.54 % --prep_res_sim true
% 0.21/0.54 % --prep_upred true
% 0.21/0.54 % --res_sim_input true
% 0.21/0.54 % --clause_weak_htbl true
% 0.21/0.54 % --gc_record_bc_elim false
% 0.21/0.54 % --symbol_type_check false
% 0.21/0.54 % --clausify_out false
% 0.21/0.54 % --large_theory_mode false
% 0.21/0.54 % --prep_sem_filter none
% 0.21/0.54 % --prep_sem_filter_out false
% 0.21/0.54 % --preprocessed_out false
% 0.21/0.54 % --sub_typing false
% 0.21/0.54 % --brand_transform false
% 0.21/0.54 % --pure_diseq_elim true
% 0.21/0.54 % --min_unsat_core false
% 0.21/0.54 % --pred_elim true
% 0.21/0.54 % --add_important_lit false
% 0.21/0.54 % --soft_assumptions false
% 0.21/0.54 % --reset_solvers false
% 0.21/0.54 % --bc_imp_inh []
% 0.21/0.54 % --conj_cone_tolerance 1.5
% 0.21/0.54 % --prolific_symb_bound 500
% 0.21/0.54 % --lt_threshold 2000
% 0.21/0.54
% 0.21/0.54 % ------ SAT Options
% 0.21/0.54
% 0.21/0.54 % --sat_mode false
% 0.21/0.54 % --sat_fm_restart_options ""
% 0.21/0.54 % --sat_gr_def false
% 0.21/0.54 % --sat_epr_types true
% 0.21/0.54 % --sat_non_cyclic_types false
% 0.21/0.54 % --sat_finite_models false
% 0.21/0.54 % --sat_fm_lemmas false
% 0.21/0.54 % --sat_fm_prep false
% 0.21/0.54 % --sat_fm_uc_incr true
% 0.21/0.54 % --sat_out_model small
% 0.21/0.54 % --sat_out_clauses false
% 0.21/0.54
% 0.21/0.54 % ------ QBF Options
% 0.21/0.54
% 0.21/0.54 % --qbf_mode false
% 0.21/0.54 % --qbf_elim_univ true
% 0.21/0.54 % --qbf_sk_in true
% 0.21/0.54 % --qbf_pred_elim true
% 0.21/0.54 % --qbf_split 32
% 0.21/0.54
% 0.21/0.54 % ------ BMC1 Options
% 0.21/0.54
% 0.21/0.54 % --bmc1_incremental false
% 0.21/0.54 % --bmc1_axioms reachable_all
% 0.21/0.54 % --bmc1_min_bound 0
% 0.21/0.54 % --bmc1_max_bound -1
% 0.21/0.54 % --bmc1_max_bound_default -1
% 0.21/0.54 % --bmc1_symbol_reachability true
% 0.21/0.54 % --bmc1_property_lemmas false
% 0.21/0.54 % --bmc1_k_induction false
% 0.21/0.54 % --bmc1_non_equiv_states false
% 0.21/0.54 % --bmc1_deadlock false
% 0.21/0.54 % --bmc1_ucm false
% 0.21/0.54 % --bmc1_add_unsat_core none
% 0.21/0.54 % --bmc1_unsat_core_children false
% 0.21/0.54 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.54 % --bmc1_out_stat full
% 0.21/0.54 % --bmc1_ground_init false
% 0.21/0.54 % --bmc1_pre_inst_next_state false
% 0.21/0.54 % --bmc1_pre_inst_state false
% 0.21/0.54 % --bmc1_pre_inst_reach_state false
% 0.21/0.54 % --bmc1_out_unsat_core false
% 0.21/0.54 % --bmc1_aig_witness_out false
% 0.21/0.54 % --bmc1_verbose false
% 0.21/0.54 % --bmc1_dump_clauses_tptp false
% 1.36/1.60 % --bmc1_dump_unsat_core_tptp false
% 1.36/1.60 % --bmc1_dump_file -
% 1.36/1.60 % --bmc1_ucm_expand_uc_limit 128
% 1.36/1.60 % --bmc1_ucm_n_expand_iterations 6
% 1.36/1.60 % --bmc1_ucm_extend_mode 1
% 1.36/1.60 % --bmc1_ucm_init_mode 2
% 1.36/1.60 % --bmc1_ucm_cone_mode none
% 1.36/1.60 % --bmc1_ucm_reduced_relation_type 0
% 1.36/1.60 % --bmc1_ucm_relax_model 4
% 1.36/1.60 % --bmc1_ucm_full_tr_after_sat true
% 1.36/1.60 % --bmc1_ucm_expand_neg_assumptions false
% 1.36/1.60 % --bmc1_ucm_layered_model none
% 1.36/1.60 % --bmc1_ucm_max_lemma_size 10
% 1.36/1.60
% 1.36/1.60 % ------ AIG Options
% 1.36/1.60
% 1.36/1.60 % --aig_mode false
% 1.36/1.60
% 1.36/1.60 % ------ Instantiation Options
% 1.36/1.60
% 1.36/1.60 % --instantiation_flag true
% 1.36/1.60 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.36/1.60 % --inst_solver_per_active 750
% 1.36/1.60 % --inst_solver_calls_frac 0.5
% 1.36/1.60 % --inst_passive_queue_type priority_queues
% 1.36/1.60 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.36/1.60 % --inst_passive_queues_freq [25;2]
% 1.36/1.60 % --inst_dismatching true
% 1.36/1.60 % --inst_eager_unprocessed_to_passive true
% 1.36/1.60 % --inst_prop_sim_given true
% 1.36/1.60 % --inst_prop_sim_new false
% 1.36/1.60 % --inst_orphan_elimination true
% 1.36/1.60 % --inst_learning_loop_flag true
% 1.36/1.60 % --inst_learning_start 3000
% 1.36/1.60 % --inst_learning_factor 2
% 1.36/1.60 % --inst_start_prop_sim_after_learn 3
% 1.36/1.60 % --inst_sel_renew solver
% 1.36/1.60 % --inst_lit_activity_flag true
% 1.36/1.60 % --inst_out_proof true
% 1.36/1.60
% 1.36/1.60 % ------ Resolution Options
% 1.36/1.60
% 1.36/1.60 % --resolution_flag true
% 1.36/1.60 % --res_lit_sel kbo_max
% 1.36/1.60 % --res_to_prop_solver none
% 1.36/1.60 % --res_prop_simpl_new false
% 1.36/1.60 % --res_prop_simpl_given false
% 1.36/1.60 % --res_passive_queue_type priority_queues
% 1.36/1.60 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.36/1.60 % --res_passive_queues_freq [15;5]
% 1.36/1.60 % --res_forward_subs full
% 1.36/1.60 % --res_backward_subs full
% 1.36/1.60 % --res_forward_subs_resolution true
% 1.36/1.60 % --res_backward_subs_resolution true
% 1.36/1.60 % --res_orphan_elimination false
% 1.36/1.60 % --res_time_limit 1000.
% 1.36/1.60 % --res_out_proof true
% 1.36/1.60 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_bef793.s
% 1.36/1.60 % --modulo true
% 1.36/1.60
% 1.36/1.60 % ------ Combination Options
% 1.36/1.60
% 1.36/1.60 % --comb_res_mult 1000
% 1.36/1.60 % --comb_inst_mult 300
% 1.36/1.60 % ------
% 1.36/1.60
% 1.36/1.60 % ------ Parsing...% successful
% 1.36/1.60
% 1.36/1.60 % ------ Preprocessing... gs_s sp: 1764 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 1.36/1.60
% 1.36/1.60 % ------ Proving...
% 1.36/1.60 % ------ Problem Properties
% 1.36/1.60
% 1.36/1.60 %
% 1.36/1.60 % EPR false
% 1.36/1.60 % Horn false
% 1.36/1.60 % Has equality false
% 1.36/1.60
% 1.36/1.60 % % ------ Input Options Time Limit: Unbounded
% 1.36/1.60
% 1.36/1.60
% 1.36/1.60 % % ------ Current options:
% 1.36/1.60
% 1.36/1.60 % ------ Input Options
% 1.36/1.60
% 1.36/1.60 % --out_options all
% 1.36/1.60 % --tptp_safe_out true
% 1.36/1.60 % --problem_path ""
% 1.36/1.60 % --include_path ""
% 1.36/1.60 % --clausifier .//eprover
% 1.36/1.60 % --clausifier_options --tstp-format
% 1.36/1.60 % --stdin false
% 1.36/1.60 % --dbg_backtrace false
% 1.36/1.60 % --dbg_dump_prop_clauses false
% 1.36/1.60 % --dbg_dump_prop_clauses_file -
% 1.36/1.60 % --dbg_out_stat false
% 1.36/1.60
% 1.36/1.60 % ------ General Options
% 1.36/1.60
% 1.36/1.60 % --fof false
% 1.36/1.60 % --time_out_real 150.
% 1.36/1.60 % --time_out_prep_mult 0.2
% 1.36/1.60 % --time_out_virtual -1.
% 1.36/1.60 % --schedule none
% 1.36/1.60 % --ground_splitting input
% 1.36/1.60 % --splitting_nvd 16
% 1.36/1.60 % --non_eq_to_eq false
% 1.36/1.60 % --prep_gs_sim true
% 1.36/1.60 % --prep_unflatten false
% 1.36/1.60 % --prep_res_sim true
% 1.36/1.60 % --prep_upred true
% 1.36/1.60 % --res_sim_input true
% 1.36/1.60 % --clause_weak_htbl true
% 1.36/1.60 % --gc_record_bc_elim false
% 1.36/1.60 % --symbol_type_check false
% 1.36/1.60 % --clausify_out false
% 1.36/1.60 % --large_theory_mode false
% 1.36/1.60 % --prep_sem_filter none
% 1.36/1.60 % --prep_sem_filter_out false
% 1.36/1.60 % --preprocessed_out false
% 1.36/1.60 % --sub_typing false
% 1.36/1.60 % --brand_transform false
% 1.36/1.60 % --pure_diseq_elim true
% 1.36/1.60 % --min_unsat_core false
% 1.36/1.60 % --pred_elim true
% 1.36/1.60 % --add_important_lit false
% 1.36/1.60 % --soft_assumptions false
% 1.36/1.60 % --reset_solvers false
% 1.36/1.60 % --bc_imp_inh []
% 1.36/1.60 % --conj_cone_tolerance 1.5
% 1.36/1.60 % --prolific_symb_bound 500
% 1.36/1.60 % --lt_threshold 2000
% 1.36/1.60
% 1.36/1.60 % ------ SAT Options
% 1.36/1.60
% 1.36/1.60 % --sat_mode false
% 1.36/1.60 % --sat_fm_restart_options ""
% 1.36/1.60 % --sat_gr_def false
% 1.36/1.60 % --sat_epr_types true
% 1.36/1.60 % --sat_non_cyclic_types false
% 1.36/1.60 % --sat_finite_models false
% 1.36/1.60 % --sat_fm_lemmas false
% 1.36/1.60 % --sat_fm_prep false
% 1.36/1.60 % --sat_fm_uc_incr true
% 1.36/1.60 % --sat_out_model small
% 1.36/1.60 % --sat_out_clauses false
% 1.36/1.60
% 1.36/1.60 % ------ QBF Options
% 1.36/1.60
% 1.36/1.60 % --qbf_mode false
% 1.36/1.60 % --qbf_elim_univ true
% 1.36/1.60 % --qbf_sk_in true
% 1.36/1.60 % --qbf_pred_elim true
% 1.36/1.60 % --qbf_split 32
% 1.36/1.60
% 1.36/1.60 % ------ BMC1 Options
% 1.36/1.60
% 1.36/1.60 % --bmc1_incremental false
% 1.36/1.60 % --bmc1_axioms reachable_all
% 1.36/1.60 % --bmc1_min_bound 0
% 1.36/1.60 % --bmc1_max_bound -1
% 1.36/1.60 % --bmc1_max_bound_default -1
% 1.36/1.60 % --bmc1_symbol_reachability true
% 1.36/1.60 % --bmc1_property_lemmas false
% 1.36/1.60 % --bmc1_k_induction false
% 1.36/1.60 % --bmc1_non_equiv_states false
% 1.36/1.60 % --bmc1_deadlock false
% 1.36/1.60 % --bmc1_ucm false
% 1.36/1.60 % --bmc1_add_unsat_core none
% 1.36/1.60 % --bmc1_unsat_core_children false
% 1.36/1.60 % --bmc1_unsat_core_extrapolate_axioms false
% 1.36/1.60 % --bmc1_out_stat full
% 1.36/1.60 % --bmc1_ground_init false
% 1.36/1.60 % --bmc1_pre_inst_next_state false
% 1.36/1.60 % --bmc1_pre_inst_state false
% 1.36/1.60 % --bmc1_pre_inst_reach_state false
% 1.36/1.60 % --bmc1_out_unsat_core false
% 1.36/1.60 % --bmc1_aig_witness_out false
% 1.36/1.60 % --bmc1_verbose false
% 1.36/1.60 % --bmc1_dump_clauses_tptp false
% 1.36/1.60 % --bmc1_dump_unsat_core_tptp false
% 1.36/1.60 % --bmc1_dump_file -
% 1.36/1.60 % --bmc1_ucm_expand_uc_limit 128
% 1.36/1.60 % --bmc1_ucm_n_expand_iterations 6
% 1.36/1.60 % --bmc1_ucm_extend_mode 1
% 1.36/1.60 % --bmc1_ucm_init_mode 2
% 1.36/1.60 % --bmc1_ucm_cone_mode none
% 1.36/1.60 % --bmc1_ucm_reduced_relation_type 0
% 1.36/1.60 % --bmc1_ucm_relax_model 4
% 1.36/1.60 % --bmc1_ucm_full_tr_after_sat true
% 1.36/1.60 % --bmc1_ucm_expand_neg_assumptions false
% 1.36/1.60 % --bmc1_ucm_layered_model none
% 1.36/1.60 % --bmc1_ucm_max_lemma_size 10
% 1.36/1.60
% 1.36/1.60 % ------ AIG Options
% 1.36/1.60
% 1.36/1.60 % --aig_mode false
% 1.36/1.60
% 1.36/1.60 % ------ Instantiation Options
% 1.36/1.60
% 1.36/1.60 % --instantiation_flag true
% 1.36/1.60 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 1.36/1.60 % --inst_solver_per_active 750
% 1.36/1.60 % --inst_solver_calls_frac 0.5
% 1.36/1.60 % --inst_passive_queue_type priority_queues
% 1.36/1.60 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 1.36/1.60 % --inst_passive_queues_freq [25;2]
% 1.36/1.60 % --inst_dismatching true
% 1.36/1.60 % --inst_eager_unprocessed_to_passive true
% 1.36/1.60 % --inst_prop_sim_given true
% 3.03/3.22 % --inst_prop_sim_new false
% 3.03/3.22 % --inst_orphan_elimination true
% 3.03/3.22 % --inst_learning_loop_flag true
% 3.03/3.22 % --inst_learning_start 3000
% 3.03/3.22 % --inst_learning_factor 2
% 3.03/3.22 % --inst_start_prop_sim_after_learn 3
% 3.03/3.22 % --inst_sel_renew solver
% 3.03/3.22 % --inst_lit_activity_flag true
% 3.03/3.22 % --inst_out_proof true
% 3.03/3.22
% 3.03/3.22 % ------ Resolution Options
% 3.03/3.22
% 3.03/3.22 % --resolution_flag true
% 3.03/3.22 % --res_lit_sel kbo_max
% 3.03/3.22 % --res_to_prop_solver none
% 3.03/3.22 % --res_prop_simpl_new false
% 3.03/3.22 % --res_prop_simpl_given false
% 3.03/3.22 % --res_passive_queue_type priority_queues
% 3.03/3.22 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.03/3.22 % --res_passive_queues_freq [15;5]
% 3.03/3.22 % --res_forward_subs full
% 3.03/3.22 % --res_backward_subs full
% 3.03/3.22 % --res_forward_subs_resolution true
% 3.03/3.22 % --res_backward_subs_resolution true
% 3.03/3.22 % --res_orphan_elimination false
% 3.03/3.22 % --res_time_limit 1000.
% 3.03/3.22 % --res_out_proof true
% 3.03/3.22 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_bef793.s
% 3.03/3.22 % --modulo true
% 3.03/3.22
% 3.03/3.22 % ------ Combination Options
% 3.03/3.22
% 3.03/3.22 % --comb_res_mult 1000
% 3.03/3.22 % --comb_inst_mult 300
% 3.03/3.22 % ------
% 3.03/3.22
% 3.03/3.22
% 3.03/3.22
% 3.03/3.22 % ------ Proving...
% 3.03/3.22 % warning: shown sat in sat incomplete mode
% 3.03/3.22 %
% 3.03/3.22
% 3.03/3.22
% 3.03/3.22 ------ Building Model...Done
% 3.03/3.22
% 3.03/3.22 %------ The model is defined over ground terms (initial term algebra).
% 3.03/3.22 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.03/3.22 %------ where \phi is a formula over the term algebra.
% 3.03/3.22 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.03/3.22 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.03/3.22 %------ See help for --sat_out_model for different model outputs.
% 3.03/3.22 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.03/3.22 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.03/3.22
% 3.03/3.22
% 3.03/3.22
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of actual_world
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 (! [X0] :
% 3.03/3.22 ( actual_world(X0) <=>
% 3.03/3.22 (
% 3.03/3.22 (
% 3.03/3.22 ( X0=sk3_esk1_0 )
% 3.03/3.22 )
% 3.03/3.22
% 3.03/3.22 )
% 3.03/3.22 )
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of table
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 (! [X0,X1] :
% 3.03/3.22 ( table(X0,X1) <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of three
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 (! [X0,X1] :
% 3.03/3.22 ( three(X0,X1) <=>
% 3.03/3.22 (
% 3.03/3.22 (
% 3.03/3.22 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 3.03/3.22 )
% 3.03/3.22
% 3.03/3.22 )
% 3.03/3.22 )
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Negative definition of group
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 (! [X0,X1] :
% 3.03/3.22 ( ~(group(X0,X1)) <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of young
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 (! [X0,X1] :
% 3.03/3.22 ( young(X0,X1) <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of member
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 (! [X0,X1,X2] :
% 3.03/3.22 ( member(X0,X1,X2) <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP0_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP0_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP1_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP1_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP2_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP2_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP3_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP3_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP4_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP4_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP5_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP5_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP6_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP6_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP7_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP7_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP8_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP8_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP9_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP9_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP10_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP10_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP11_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP11_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP12_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP12_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP13_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP13_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP14_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP14_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP15_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP15_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP16_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP16_iProver_split <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP17_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP17_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP18_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP18_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP19_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP19_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP20_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP20_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP21_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP21_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP22_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP22_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP23_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP23_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP24_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP24_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP25_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP25_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP26_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP26_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP27_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP27_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP28_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP28_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP29_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP29_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP30_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP30_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP31_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP31_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP32_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP32_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP33_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP33_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP34_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP34_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP35_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP35_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP36_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP36_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP37_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP37_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP38_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP38_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP39_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP39_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP40_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP40_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP41_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP41_iProver_split <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP42_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP42_iProver_split <=>
% 3.03/3.22 $true
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP43_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP43_iProver_split <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP44_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP44_iProver_split <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP45_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP45_iProver_split <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP46_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP46_iProver_split <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP47_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP47_iProver_split <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP48_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP48_iProver_split <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22 %------ Positive definition of sP49_iProver_split
% 3.03/3.22 fof(lit_def,axiom,
% 3.03/3.22 ( sP49_iProver_split <=>
% 3.03/3.22 $false
% 3.03/3.22 )
% 3.03/3.22 ).
% 3.03/3.22
% 3.03/3.22
% 3.03/3.22
% 3.03/3.22 % ------ Statistics
% 3.03/3.22
% 3.03/3.22 % ------ General
% 3.03/3.22
% 3.03/3.22 % num_of_input_clauses: 576
% 3.03/3.22 % num_of_input_neg_conjectures: 576
% 3.03/3.22 % num_of_splits: 1764
% 3.03/3.22 % num_of_split_atoms: 50
% 3.03/3.22 % num_of_sem_filtered_clauses: 0
% 3.03/3.22 % num_of_subtypes: 0
% 3.03/3.22 % monotx_restored_types: 0
% 3.03/3.22 % sat_num_of_epr_types: 0
% 3.03/3.22 % sat_num_of_non_cyclic_types: 0
% 3.03/3.23 % sat_guarded_non_collapsed_types: 0
% 3.03/3.23 % is_epr: 0
% 3.03/3.23 % is_horn: 0
% 3.03/3.23 % has_eq: 0
% 3.03/3.23 % num_pure_diseq_elim: 0
% 3.03/3.23 % simp_replaced_by: 0
% 3.03/3.23 % res_preprocessed: 2916
% 3.03/3.23 % prep_upred: 0
% 3.03/3.23 % prep_unflattend: 0
% 3.03/3.23 % pred_elim_cands: 50
% 3.03/3.23 % pred_elim: 0
% 3.03/3.23 % pred_elim_cl: 0
% 3.03/3.23 % pred_elim_cycles: 50
% 3.03/3.23 % forced_gc_time: 0
% 3.03/3.23 % gc_basic_clause_elim: 0
% 3.03/3.23 % parsing_time: 0.086
% 3.03/3.23 % sem_filter_time: 0.
% 3.03/3.23 % pred_elim_time: 0.775
% 3.03/3.23 % out_proof_time: 0.
% 3.03/3.23 % monotx_time: 0.
% 3.03/3.23 % subtype_inf_time: 0.
% 3.03/3.23 % unif_index_cands_time: 0.001
% 3.03/3.23 % unif_index_add_time: 0.002
% 3.03/3.23 % total_time: 2.701
% 3.03/3.23 % num_of_symbols: 107
% 3.03/3.23 % num_of_terms: 2084
% 3.03/3.23
% 3.03/3.23 % ------ Propositional Solver
% 3.03/3.23
% 3.03/3.23 % prop_solver_calls: 3
% 3.03/3.23 % prop_fast_solver_calls: 24550
% 3.03/3.23 % prop_num_of_clauses: 3540
% 3.03/3.23 % prop_preprocess_simplified: 18116
% 3.03/3.23 % prop_fo_subsumed: 0
% 3.03/3.23 % prop_solver_time: 0.
% 3.03/3.23 % prop_fast_solver_time: 0.022
% 3.03/3.23 % prop_unsat_core_time: 0.
% 3.03/3.23
% 3.03/3.23 % ------ QBF
% 3.03/3.23
% 3.03/3.23 % qbf_q_res: 0
% 3.03/3.23 % qbf_num_tautologies: 0
% 3.03/3.23 % qbf_prep_cycles: 0
% 3.03/3.23
% 3.03/3.23 % ------ BMC1
% 3.03/3.23
% 3.03/3.23 % bmc1_current_bound: -1
% 3.03/3.23 % bmc1_last_solved_bound: -1
% 3.03/3.23 % bmc1_unsat_core_size: -1
% 3.03/3.23 % bmc1_unsat_core_parents_size: -1
% 3.03/3.23 % bmc1_merge_next_fun: 0
% 3.03/3.23 % bmc1_unsat_core_clauses_time: 0.
% 3.03/3.23
% 3.03/3.23 % ------ Instantiation
% 3.03/3.23
% 3.03/3.23 % inst_num_of_clauses: 678
% 3.03/3.23 % inst_num_in_passive: 0
% 3.03/3.23 % inst_num_in_active: 678
% 3.03/3.23 % inst_num_in_unprocessed: 0
% 3.03/3.23 % inst_num_of_loops: 725
% 3.03/3.23 % inst_num_of_learning_restarts: 0
% 3.03/3.23 % inst_num_moves_active_passive: 42
% 3.03/3.23 % inst_lit_activity: 74
% 3.03/3.23 % inst_lit_activity_moves: 0
% 3.03/3.23 % inst_num_tautologies: 0
% 3.03/3.23 % inst_num_prop_implied: 0
% 3.03/3.23 % inst_num_existing_simplified: 0
% 3.03/3.23 % inst_num_eq_res_simplified: 0
% 3.03/3.23 % inst_num_child_elim: 0
% 3.03/3.23 % inst_num_of_dismatching_blockings: 0
% 3.03/3.23 % inst_num_of_non_proper_insts: 72
% 3.03/3.23 % inst_num_of_duplicates: 0
% 3.03/3.23 % inst_inst_num_from_inst_to_res: 0
% 3.03/3.23 % inst_dismatching_checking_time: 0.
% 3.03/3.23
% 3.03/3.23 % ------ Resolution
% 3.03/3.23
% 3.03/3.23 % res_num_of_clauses: 5448
% 3.03/3.23 % res_num_in_passive: 5127
% 3.03/3.23 % res_num_in_active: 1504
% 3.03/3.23 % res_num_of_loops: 3000
% 3.03/3.23 % res_forward_subset_subsumed: 1670
% 3.03/3.23 % res_backward_subset_subsumed: 1641
% 3.03/3.23 % res_forward_subsumed: 1398
% 3.03/3.23 % res_backward_subsumed: 94
% 3.03/3.23 % res_forward_subsumption_resolution: 681
% 3.03/3.23 % res_backward_subsumption_resolution: 0
% 3.03/3.23 % res_clause_to_clause_subsumption: 3917
% 3.03/3.23 % res_orphan_elimination: 0
% 3.03/3.23 % res_tautology_del: 832
% 3.03/3.23 % res_num_eq_res_simplified: 0
% 3.03/3.23 % res_num_sel_changes: 0
% 3.03/3.23 % res_moves_from_active_to_pass: 0
% 3.03/3.23
% 3.03/3.23 % Status Unknown
% 3.14/3.37 % Orienting using strategy ClausalAll
% 3.14/3.37 % FOF problem with conjecture
% 3.14/3.37 % 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_bef793.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c6ba37.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_544ac9 | grep -v "SZS"
% 3.14/3.38
% 3.14/3.38 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 3.14/3.38
% 3.14/3.38 %
% 3.14/3.38 % ------ iProver source info
% 3.14/3.38
% 3.14/3.38 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 3.14/3.38 % git: non_committed_changes: true
% 3.14/3.38 % git: last_make_outside_of_git: true
% 3.14/3.38
% 3.14/3.38 %
% 3.14/3.38 % ------ Input Options
% 3.14/3.38
% 3.14/3.38 % --out_options all
% 3.14/3.38 % --tptp_safe_out true
% 3.14/3.38 % --problem_path ""
% 3.14/3.38 % --include_path ""
% 3.14/3.38 % --clausifier .//eprover
% 3.14/3.38 % --clausifier_options --tstp-format
% 3.14/3.38 % --stdin false
% 3.14/3.38 % --dbg_backtrace false
% 3.14/3.38 % --dbg_dump_prop_clauses false
% 3.14/3.38 % --dbg_dump_prop_clauses_file -
% 3.14/3.38 % --dbg_out_stat false
% 3.14/3.38
% 3.14/3.38 % ------ General Options
% 3.14/3.38
% 3.14/3.38 % --fof false
% 3.14/3.38 % --time_out_real 150.
% 3.14/3.38 % --time_out_prep_mult 0.2
% 3.14/3.38 % --time_out_virtual -1.
% 3.14/3.38 % --schedule none
% 3.14/3.38 % --ground_splitting input
% 3.14/3.38 % --splitting_nvd 16
% 3.14/3.38 % --non_eq_to_eq false
% 3.14/3.38 % --prep_gs_sim true
% 3.14/3.38 % --prep_unflatten false
% 3.14/3.38 % --prep_res_sim true
% 3.14/3.38 % --prep_upred true
% 3.14/3.38 % --res_sim_input true
% 3.14/3.38 % --clause_weak_htbl true
% 3.14/3.38 % --gc_record_bc_elim false
% 3.14/3.38 % --symbol_type_check false
% 3.14/3.38 % --clausify_out false
% 3.14/3.38 % --large_theory_mode false
% 3.14/3.38 % --prep_sem_filter none
% 3.14/3.38 % --prep_sem_filter_out false
% 3.14/3.38 % --preprocessed_out false
% 3.14/3.38 % --sub_typing false
% 3.14/3.38 % --brand_transform false
% 3.14/3.38 % --pure_diseq_elim true
% 3.14/3.38 % --min_unsat_core false
% 3.14/3.38 % --pred_elim true
% 3.14/3.38 % --add_important_lit false
% 3.14/3.38 % --soft_assumptions false
% 3.14/3.38 % --reset_solvers false
% 3.14/3.38 % --bc_imp_inh []
% 3.14/3.38 % --conj_cone_tolerance 1.5
% 3.14/3.38 % --prolific_symb_bound 500
% 3.14/3.38 % --lt_threshold 2000
% 3.14/3.38
% 3.14/3.38 % ------ SAT Options
% 3.14/3.38
% 3.14/3.38 % --sat_mode false
% 3.14/3.38 % --sat_fm_restart_options ""
% 3.14/3.38 % --sat_gr_def false
% 3.14/3.38 % --sat_epr_types true
% 3.14/3.38 % --sat_non_cyclic_types false
% 3.14/3.38 % --sat_finite_models false
% 3.14/3.38 % --sat_fm_lemmas false
% 3.14/3.38 % --sat_fm_prep false
% 3.14/3.38 % --sat_fm_uc_incr true
% 3.14/3.38 % --sat_out_model small
% 3.14/3.38 % --sat_out_clauses false
% 3.14/3.38
% 3.14/3.38 % ------ QBF Options
% 3.14/3.38
% 3.14/3.38 % --qbf_mode false
% 3.14/3.38 % --qbf_elim_univ true
% 3.14/3.38 % --qbf_sk_in true
% 3.14/3.38 % --qbf_pred_elim true
% 3.14/3.38 % --qbf_split 32
% 3.14/3.38
% 3.14/3.38 % ------ BMC1 Options
% 3.14/3.38
% 3.14/3.38 % --bmc1_incremental false
% 3.14/3.38 % --bmc1_axioms reachable_all
% 3.14/3.38 % --bmc1_min_bound 0
% 3.14/3.38 % --bmc1_max_bound -1
% 3.14/3.38 % --bmc1_max_bound_default -1
% 3.14/3.38 % --bmc1_symbol_reachability true
% 3.14/3.38 % --bmc1_property_lemmas false
% 3.14/3.38 % --bmc1_k_induction false
% 3.14/3.38 % --bmc1_non_equiv_states false
% 3.14/3.38 % --bmc1_deadlock false
% 3.14/3.38 % --bmc1_ucm false
% 3.14/3.38 % --bmc1_add_unsat_core none
% 3.14/3.38 % --bmc1_unsat_core_children false
% 3.14/3.38 % --bmc1_unsat_core_extrapolate_axioms false
% 3.14/3.38 % --bmc1_out_stat full
% 3.14/3.38 % --bmc1_ground_init false
% 3.14/3.38 % --bmc1_pre_inst_next_state false
% 3.14/3.38 % --bmc1_pre_inst_state false
% 3.14/3.38 % --bmc1_pre_inst_reach_state false
% 3.14/3.38 % --bmc1_out_unsat_core false
% 3.14/3.38 % --bmc1_aig_witness_out false
% 3.14/3.38 % --bmc1_verbose false
% 3.14/3.38 % --bmc1_dump_clauses_tptp false
% 4.10/4.28 % --bmc1_dump_unsat_core_tptp false
% 4.10/4.28 % --bmc1_dump_file -
% 4.10/4.28 % --bmc1_ucm_expand_uc_limit 128
% 4.10/4.28 % --bmc1_ucm_n_expand_iterations 6
% 4.10/4.28 % --bmc1_ucm_extend_mode 1
% 4.10/4.28 % --bmc1_ucm_init_mode 2
% 4.10/4.28 % --bmc1_ucm_cone_mode none
% 4.10/4.28 % --bmc1_ucm_reduced_relation_type 0
% 4.10/4.28 % --bmc1_ucm_relax_model 4
% 4.10/4.28 % --bmc1_ucm_full_tr_after_sat true
% 4.10/4.28 % --bmc1_ucm_expand_neg_assumptions false
% 4.10/4.28 % --bmc1_ucm_layered_model none
% 4.10/4.28 % --bmc1_ucm_max_lemma_size 10
% 4.10/4.28
% 4.10/4.28 % ------ AIG Options
% 4.10/4.28
% 4.10/4.28 % --aig_mode false
% 4.10/4.28
% 4.10/4.28 % ------ Instantiation Options
% 4.10/4.28
% 4.10/4.28 % --instantiation_flag true
% 4.10/4.28 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 4.10/4.28 % --inst_solver_per_active 750
% 4.10/4.28 % --inst_solver_calls_frac 0.5
% 4.10/4.28 % --inst_passive_queue_type priority_queues
% 4.10/4.28 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 4.10/4.28 % --inst_passive_queues_freq [25;2]
% 4.10/4.28 % --inst_dismatching true
% 4.10/4.28 % --inst_eager_unprocessed_to_passive true
% 4.10/4.28 % --inst_prop_sim_given true
% 4.10/4.28 % --inst_prop_sim_new false
% 4.10/4.28 % --inst_orphan_elimination true
% 4.10/4.28 % --inst_learning_loop_flag true
% 4.10/4.28 % --inst_learning_start 3000
% 4.10/4.28 % --inst_learning_factor 2
% 4.10/4.28 % --inst_start_prop_sim_after_learn 3
% 4.10/4.28 % --inst_sel_renew solver
% 4.10/4.28 % --inst_lit_activity_flag true
% 4.10/4.28 % --inst_out_proof true
% 4.10/4.28
% 4.10/4.28 % ------ Resolution Options
% 4.10/4.28
% 4.10/4.28 % --resolution_flag true
% 4.10/4.28 % --res_lit_sel kbo_max
% 4.10/4.28 % --res_to_prop_solver none
% 4.10/4.28 % --res_prop_simpl_new false
% 4.10/4.28 % --res_prop_simpl_given false
% 4.10/4.28 % --res_passive_queue_type priority_queues
% 4.10/4.28 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 4.10/4.28 % --res_passive_queues_freq [15;5]
% 4.10/4.28 % --res_forward_subs full
% 4.10/4.28 % --res_backward_subs full
% 4.10/4.28 % --res_forward_subs_resolution true
% 4.10/4.28 % --res_backward_subs_resolution true
% 4.10/4.28 % --res_orphan_elimination false
% 4.10/4.28 % --res_time_limit 1000.
% 4.10/4.28 % --res_out_proof true
% 4.10/4.28 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_bef793.s
% 4.10/4.28 % --modulo true
% 4.10/4.28
% 4.10/4.28 % ------ Combination Options
% 4.10/4.28
% 4.10/4.28 % --comb_res_mult 1000
% 4.10/4.28 % --comb_inst_mult 300
% 4.10/4.28 % ------
% 4.10/4.28
% 4.10/4.28 % ------ Parsing...% successful
% 4.10/4.28
% 4.10/4.28 % ------ Preprocessing... gs_s sp: 1764 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 4.10/4.28
% 4.10/4.28 % ------ Proving...
% 4.10/4.28 % ------ Problem Properties
% 4.10/4.28
% 4.10/4.28 %
% 4.10/4.28 % EPR false
% 4.10/4.28 % Horn false
% 4.10/4.28 % Has equality false
% 4.10/4.28
% 4.10/4.28 % % ------ Input Options Time Limit: Unbounded
% 4.10/4.28
% 4.10/4.28
% 4.10/4.28 % % ------ Current options:
% 4.10/4.28
% 4.10/4.28 % ------ Input Options
% 4.10/4.28
% 4.10/4.28 % --out_options all
% 4.10/4.28 % --tptp_safe_out true
% 4.10/4.28 % --problem_path ""
% 4.10/4.28 % --include_path ""
% 4.10/4.28 % --clausifier .//eprover
% 4.10/4.28 % --clausifier_options --tstp-format
% 4.10/4.28 % --stdin false
% 4.10/4.28 % --dbg_backtrace false
% 4.10/4.28 % --dbg_dump_prop_clauses false
% 4.10/4.28 % --dbg_dump_prop_clauses_file -
% 4.10/4.28 % --dbg_out_stat false
% 4.10/4.28
% 4.10/4.28 % ------ General Options
% 4.10/4.28
% 4.10/4.28 % --fof false
% 4.10/4.28 % --time_out_real 150.
% 4.10/4.28 % --time_out_prep_mult 0.2
% 4.10/4.28 % --time_out_virtual -1.
% 4.10/4.28 % --schedule none
% 4.10/4.28 % --ground_splitting input
% 4.10/4.28 % --splitting_nvd 16
% 4.10/4.28 % --non_eq_to_eq false
% 4.10/4.28 % --prep_gs_sim true
% 4.10/4.28 % --prep_unflatten false
% 4.10/4.28 % --prep_res_sim true
% 4.10/4.28 % --prep_upred true
% 4.10/4.28 % --res_sim_input true
% 4.10/4.28 % --clause_weak_htbl true
% 4.10/4.28 % --gc_record_bc_elim false
% 4.10/4.28 % --symbol_type_check false
% 4.10/4.28 % --clausify_out false
% 4.10/4.28 % --large_theory_mode false
% 4.10/4.28 % --prep_sem_filter none
% 4.10/4.28 % --prep_sem_filter_out false
% 4.10/4.28 % --preprocessed_out false
% 4.10/4.28 % --sub_typing false
% 4.10/4.28 % --brand_transform false
% 4.10/4.28 % --pure_diseq_elim true
% 4.10/4.28 % --min_unsat_core false
% 4.10/4.28 % --pred_elim true
% 4.10/4.28 % --add_important_lit false
% 4.10/4.28 % --soft_assumptions false
% 4.10/4.28 % --reset_solvers false
% 4.10/4.28 % --bc_imp_inh []
% 4.10/4.28 % --conj_cone_tolerance 1.5
% 4.10/4.28 % --prolific_symb_bound 500
% 4.10/4.28 % --lt_threshold 2000
% 4.10/4.28
% 4.10/4.28 % ------ SAT Options
% 4.10/4.28
% 4.10/4.28 % --sat_mode false
% 4.10/4.28 % --sat_fm_restart_options ""
% 4.10/4.28 % --sat_gr_def false
% 4.10/4.28 % --sat_epr_types true
% 4.10/4.28 % --sat_non_cyclic_types false
% 4.10/4.28 % --sat_finite_models false
% 4.10/4.28 % --sat_fm_lemmas false
% 4.10/4.28 % --sat_fm_prep false
% 4.10/4.28 % --sat_fm_uc_incr true
% 4.10/4.28 % --sat_out_model small
% 4.10/4.28 % --sat_out_clauses false
% 4.10/4.28
% 4.10/4.28 % ------ QBF Options
% 4.10/4.28
% 4.10/4.28 % --qbf_mode false
% 4.10/4.28 % --qbf_elim_univ true
% 4.10/4.28 % --qbf_sk_in true
% 4.10/4.28 % --qbf_pred_elim true
% 4.10/4.28 % --qbf_split 32
% 4.10/4.28
% 4.10/4.28 % ------ BMC1 Options
% 4.10/4.28
% 4.10/4.28 % --bmc1_incremental false
% 4.10/4.28 % --bmc1_axioms reachable_all
% 4.10/4.28 % --bmc1_min_bound 0
% 4.10/4.28 % --bmc1_max_bound -1
% 4.10/4.28 % --bmc1_max_bound_default -1
% 4.10/4.28 % --bmc1_symbol_reachability true
% 4.10/4.28 % --bmc1_property_lemmas false
% 4.10/4.28 % --bmc1_k_induction false
% 4.10/4.28 % --bmc1_non_equiv_states false
% 4.10/4.28 % --bmc1_deadlock false
% 4.10/4.28 % --bmc1_ucm false
% 4.10/4.28 % --bmc1_add_unsat_core none
% 4.10/4.28 % --bmc1_unsat_core_children false
% 4.10/4.28 % --bmc1_unsat_core_extrapolate_axioms false
% 4.10/4.28 % --bmc1_out_stat full
% 4.10/4.28 % --bmc1_ground_init false
% 4.10/4.28 % --bmc1_pre_inst_next_state false
% 4.10/4.28 % --bmc1_pre_inst_state false
% 4.10/4.28 % --bmc1_pre_inst_reach_state false
% 4.10/4.28 % --bmc1_out_unsat_core false
% 4.10/4.28 % --bmc1_aig_witness_out false
% 4.10/4.28 % --bmc1_verbose false
% 4.10/4.28 % --bmc1_dump_clauses_tptp false
% 4.10/4.28 % --bmc1_dump_unsat_core_tptp false
% 4.10/4.28 % --bmc1_dump_file -
% 4.10/4.28 % --bmc1_ucm_expand_uc_limit 128
% 4.10/4.28 % --bmc1_ucm_n_expand_iterations 6
% 4.10/4.28 % --bmc1_ucm_extend_mode 1
% 4.10/4.28 % --bmc1_ucm_init_mode 2
% 4.10/4.28 % --bmc1_ucm_cone_mode none
% 4.10/4.28 % --bmc1_ucm_reduced_relation_type 0
% 4.10/4.28 % --bmc1_ucm_relax_model 4
% 4.10/4.28 % --bmc1_ucm_full_tr_after_sat true
% 4.10/4.28 % --bmc1_ucm_expand_neg_assumptions false
% 4.10/4.28 % --bmc1_ucm_layered_model none
% 4.10/4.28 % --bmc1_ucm_max_lemma_size 10
% 4.10/4.28
% 4.10/4.28 % ------ AIG Options
% 4.10/4.28
% 4.10/4.28 % --aig_mode false
% 4.10/4.28
% 4.10/4.28 % ------ Instantiation Options
% 4.10/4.28
% 4.10/4.28 % --instantiation_flag true
% 4.10/4.28 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 4.10/4.28 % --inst_solver_per_active 750
% 4.10/4.28 % --inst_solver_calls_frac 0.5
% 4.10/4.28 % --inst_passive_queue_type priority_queues
% 4.10/4.28 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 4.10/4.28 % --inst_passive_queues_freq [25;2]
% 4.10/4.28 % --inst_dismatching true
% 4.10/4.28 % --inst_eager_unprocessed_to_passive true
% 4.10/4.28 % --inst_prop_sim_given true
% 5.63/5.81 % --inst_prop_sim_new false
% 5.63/5.81 % --inst_orphan_elimination true
% 5.63/5.81 % --inst_learning_loop_flag true
% 5.63/5.81 % --inst_learning_start 3000
% 5.63/5.81 % --inst_learning_factor 2
% 5.63/5.81 % --inst_start_prop_sim_after_learn 3
% 5.63/5.81 % --inst_sel_renew solver
% 5.63/5.81 % --inst_lit_activity_flag true
% 5.63/5.81 % --inst_out_proof true
% 5.63/5.81
% 5.63/5.81 % ------ Resolution Options
% 5.63/5.81
% 5.63/5.81 % --resolution_flag true
% 5.63/5.81 % --res_lit_sel kbo_max
% 5.63/5.81 % --res_to_prop_solver none
% 5.63/5.81 % --res_prop_simpl_new false
% 5.63/5.81 % --res_prop_simpl_given false
% 5.63/5.81 % --res_passive_queue_type priority_queues
% 5.63/5.81 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 5.63/5.81 % --res_passive_queues_freq [15;5]
% 5.63/5.81 % --res_forward_subs full
% 5.63/5.81 % --res_backward_subs full
% 5.63/5.81 % --res_forward_subs_resolution true
% 5.63/5.81 % --res_backward_subs_resolution true
% 5.63/5.81 % --res_orphan_elimination false
% 5.63/5.81 % --res_time_limit 1000.
% 5.63/5.81 % --res_out_proof true
% 5.63/5.81 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_bef793.s
% 5.63/5.81 % --modulo true
% 5.63/5.81
% 5.63/5.81 % ------ Combination Options
% 5.63/5.81
% 5.63/5.81 % --comb_res_mult 1000
% 5.63/5.81 % --comb_inst_mult 300
% 5.63/5.81 % ------
% 5.63/5.81
% 5.63/5.81
% 5.63/5.81
% 5.63/5.81 % ------ Proving...
% 5.63/5.81 % warning: shown sat in sat incomplete mode
% 5.63/5.81 %
% 5.63/5.81
% 5.63/5.81
% 5.63/5.81 ------ Building Model...Done
% 5.63/5.81
% 5.63/5.81 %------ The model is defined over ground terms (initial term algebra).
% 5.63/5.81 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 5.63/5.81 %------ where \phi is a formula over the term algebra.
% 5.63/5.81 %------ If we have equality in the problem then it is also defined as a predicate above,
% 5.63/5.81 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 5.63/5.81 %------ See help for --sat_out_model for different model outputs.
% 5.63/5.81 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 5.63/5.81 %------ where the first argument stands for the sort ($i in the unsorted case)
% 5.63/5.81
% 5.63/5.81
% 5.63/5.81
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of actual_world
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 (! [X0] :
% 5.63/5.81 ( actual_world(X0) <=>
% 5.63/5.81 (
% 5.63/5.81 (
% 5.63/5.81 ( X0=sk2_esk1_0 )
% 5.63/5.81 )
% 5.63/5.81
% 5.63/5.81 )
% 5.63/5.81 )
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of table
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 (! [X0,X1] :
% 5.63/5.81 ( table(X0,X1) <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of three
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 (! [X0,X1] :
% 5.63/5.81 ( three(X0,X1) <=>
% 5.63/5.81 (
% 5.63/5.81 (
% 5.63/5.81 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 5.63/5.81 )
% 5.63/5.81
% 5.63/5.81 )
% 5.63/5.81 )
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Negative definition of group
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 (! [X0,X1] :
% 5.63/5.81 ( ~(group(X0,X1)) <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of young
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 (! [X0,X1] :
% 5.63/5.81 ( young(X0,X1) <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of member
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 (! [X0,X1,X2] :
% 5.63/5.81 ( member(X0,X1,X2) <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP0_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP0_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP1_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP1_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP2_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP2_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP3_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP3_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP4_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP4_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP5_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP5_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP6_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP6_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP7_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP7_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP8_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP8_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP9_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP9_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP10_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP10_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP11_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP11_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP12_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP12_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP13_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP13_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP14_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP14_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP15_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP15_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP16_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP16_iProver_split <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP17_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP17_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP18_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP18_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP19_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP19_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP20_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP20_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP21_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP21_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP22_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP22_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP23_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP23_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP24_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP24_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP25_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP25_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP26_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP26_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP27_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP27_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP28_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP28_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP29_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP29_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP30_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP30_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP31_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP31_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP32_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP32_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP33_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP33_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP34_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP34_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP35_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP35_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP36_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP36_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP37_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP37_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP38_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP38_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP39_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP39_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP40_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP40_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP41_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP41_iProver_split <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP42_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP42_iProver_split <=>
% 5.63/5.81 $true
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP43_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP43_iProver_split <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP44_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP44_iProver_split <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP45_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP45_iProver_split <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP46_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP46_iProver_split <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP47_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP47_iProver_split <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP48_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP48_iProver_split <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81 %------ Positive definition of sP49_iProver_split
% 5.63/5.81 fof(lit_def,axiom,
% 5.63/5.81 ( sP49_iProver_split <=>
% 5.63/5.81 $false
% 5.63/5.81 )
% 5.63/5.81 ).
% 5.63/5.81
% 5.63/5.81
% 5.63/5.81
% 5.63/5.81 % ------ Statistics
% 5.63/5.81
% 5.63/5.81 % ------ General
% 5.63/5.81
% 5.63/5.81 % num_of_input_clauses: 576
% 5.63/5.81 % num_of_input_neg_conjectures: 576
% 5.63/5.81 % num_of_splits: 1764
% 5.63/5.81 % num_of_split_atoms: 50
% 5.63/5.81 % num_of_sem_filtered_clauses: 0
% 5.63/5.81 % num_of_subtypes: 0
% 5.63/5.81 % monotx_restored_types: 0
% 5.63/5.81 % sat_num_of_epr_types: 0
% 5.63/5.81 % sat_num_of_non_cyclic_types: 0
% 5.63/5.81 % sat_guarded_non_collapsed_types: 0
% 5.63/5.81 % is_epr: 0
% 5.63/5.81 % is_horn: 0
% 5.63/5.81 % has_eq: 0
% 5.63/5.81 % num_pure_diseq_elim: 0
% 5.63/5.81 % simp_replaced_by: 0
% 5.63/5.81 % res_preprocessed: 2916
% 5.63/5.81 % prep_upred: 0
% 5.63/5.81 % prep_unflattend: 0
% 5.63/5.81 % pred_elim_cands: 50
% 5.63/5.81 % pred_elim: 0
% 5.63/5.81 % pred_elim_cl: 0
% 5.63/5.81 % pred_elim_cycles: 50
% 5.63/5.81 % forced_gc_time: 0
% 5.63/5.81 % gc_basic_clause_elim: 0
% 5.63/5.81 % parsing_time: 0.039
% 5.63/5.81 % sem_filter_time: 0.
% 5.63/5.81 % pred_elim_time: 0.71
% 5.63/5.81 % out_proof_time: 0.
% 5.63/5.81 % monotx_time: 0.
% 5.63/5.81 % subtype_inf_time: 0.
% 5.63/5.81 % unif_index_cands_time: 0.001
% 5.63/5.81 % unif_index_add_time: 0.002
% 5.63/5.81 % total_time: 2.437
% 5.63/5.81 % num_of_symbols: 107
% 5.63/5.81 % num_of_terms: 2084
% 5.63/5.81
% 5.63/5.81 % ------ Propositional Solver
% 5.63/5.81
% 5.63/5.81 % prop_solver_calls: 3
% 5.63/5.81 % prop_fast_solver_calls: 24550
% 5.63/5.81 % prop_num_of_clauses: 3540
% 5.63/5.81 % prop_preprocess_simplified: 18116
% 5.63/5.81 % prop_fo_subsumed: 0
% 5.63/5.81 % prop_solver_time: 0.
% 5.63/5.81 % prop_fast_solver_time: 0.018
% 5.63/5.81 % prop_unsat_core_time: 0.
% 5.63/5.81
% 5.63/5.81 % ------ QBF
% 5.63/5.81
% 5.63/5.81 % qbf_q_res: 0
% 5.63/5.81 % qbf_num_tautologies: 0
% 5.63/5.81 % qbf_prep_cycles: 0
% 5.63/5.81
% 5.63/5.81 % ------ BMC1
% 5.63/5.81
% 5.63/5.81 % bmc1_current_bound: -1
% 5.63/5.81 % bmc1_last_solved_bound: -1
% 5.63/5.81 % bmc1_unsat_core_size: -1
% 5.63/5.81 % bmc1_unsat_core_parents_size: -1
% 5.63/5.81 % bmc1_merge_next_fun: 0
% 5.63/5.81 % bmc1_unsat_core_clauses_time: 0.
% 5.63/5.81
% 5.63/5.81 % ------ Instantiation
% 5.63/5.81
% 5.63/5.81 % inst_num_of_clauses: 678
% 5.63/5.81 % inst_num_in_passive: 0
% 5.63/5.81 % inst_num_in_active: 678
% 5.63/5.81 % inst_num_in_unprocessed: 0
% 5.63/5.81 % inst_num_of_loops: 725
% 5.63/5.81 % inst_num_of_learning_restarts: 0
% 5.63/5.81 % inst_num_moves_active_passive: 42
% 5.63/5.81 % inst_lit_activity: 74
% 5.63/5.81 % inst_lit_activity_moves: 0
% 5.63/5.81 % inst_num_tautologies: 0
% 5.63/5.81 % inst_num_prop_implied: 0
% 5.63/5.81 % inst_num_existing_simplified: 0
% 5.63/5.81 % inst_num_eq_res_simplified: 0
% 5.63/5.81 % inst_num_child_elim: 0
% 5.63/5.81 % inst_num_of_dismatching_blockings: 0
% 5.63/5.81 % inst_num_of_non_proper_insts: 72
% 5.63/5.81 % inst_num_of_duplicates: 0
% 5.63/5.81 % inst_inst_num_from_inst_to_res: 0
% 5.63/5.81 % inst_dismatching_checking_time: 0.
% 5.63/5.81
% 5.63/5.81 % ------ Resolution
% 5.63/5.81
% 5.63/5.81 % res_num_of_clauses: 5448
% 5.63/5.81 % res_num_in_passive: 5127
% 5.63/5.81 % res_num_in_active: 1504
% 5.63/5.81 % res_num_of_loops: 3000
% 5.63/5.81 % res_forward_subset_subsumed: 1670
% 5.63/5.81 % res_backward_subset_subsumed: 1641
% 5.63/5.81 % res_forward_subsumed: 1398
% 5.63/5.81 % res_backward_subsumed: 94
% 5.63/5.81 % res_forward_subsumption_resolution: 681
% 5.63/5.81 % res_backward_subsumption_resolution: 0
% 5.63/5.81 % res_clause_to_clause_subsumption: 3917
% 5.63/5.81 % res_orphan_elimination: 0
% 5.63/5.81 % res_tautology_del: 832
% 5.63/5.81 % res_num_eq_res_simplified: 0
% 5.63/5.81 % res_num_sel_changes: 0
% 5.63/5.81 % res_moves_from_active_to_pass: 0
% 5.63/5.81
% 5.63/5.81 % Status Unknown
% 5.63/5.81 % Last status :
% 5.63/5.81 % SZS status Unknown
%------------------------------------------------------------------------------