TSTP Solution File: NLP101+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP101+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n004.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:40:09 EDT 2022
% Result : Unknown 8.47s 8.66s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP101+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 1 05:35:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.35 % Running in mono-core mode
% 0.20/0.44 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.44 % FOF problem with conjecture
% 0.20/0.44 % 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_fcdc25.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_00990c.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_f89eeb | grep -v "SZS"
% 0.20/0.47
% 0.20/0.47 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.47
% 0.20/0.47 %
% 0.20/0.47 % ------ iProver source info
% 0.20/0.47
% 0.20/0.47 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.47 % git: non_committed_changes: true
% 0.20/0.47 % git: last_make_outside_of_git: true
% 0.20/0.47
% 0.20/0.47 %
% 0.20/0.47 % ------ Input Options
% 0.20/0.47
% 0.20/0.47 % --out_options all
% 0.20/0.47 % --tptp_safe_out true
% 0.20/0.47 % --problem_path ""
% 0.20/0.47 % --include_path ""
% 0.20/0.47 % --clausifier .//eprover
% 0.20/0.47 % --clausifier_options --tstp-format
% 0.20/0.47 % --stdin false
% 0.20/0.47 % --dbg_backtrace false
% 0.20/0.47 % --dbg_dump_prop_clauses false
% 0.20/0.47 % --dbg_dump_prop_clauses_file -
% 0.20/0.47 % --dbg_out_stat false
% 0.20/0.47
% 0.20/0.47 % ------ General Options
% 0.20/0.47
% 0.20/0.47 % --fof false
% 0.20/0.47 % --time_out_real 150.
% 0.20/0.47 % --time_out_prep_mult 0.2
% 0.20/0.47 % --time_out_virtual -1.
% 0.20/0.47 % --schedule none
% 0.20/0.47 % --ground_splitting input
% 0.20/0.47 % --splitting_nvd 16
% 0.20/0.47 % --non_eq_to_eq false
% 0.20/0.47 % --prep_gs_sim true
% 0.20/0.47 % --prep_unflatten false
% 0.20/0.47 % --prep_res_sim true
% 0.20/0.47 % --prep_upred true
% 0.20/0.47 % --res_sim_input true
% 0.20/0.47 % --clause_weak_htbl true
% 0.20/0.47 % --gc_record_bc_elim false
% 0.20/0.47 % --symbol_type_check false
% 0.20/0.47 % --clausify_out false
% 0.20/0.47 % --large_theory_mode false
% 0.20/0.47 % --prep_sem_filter none
% 0.20/0.47 % --prep_sem_filter_out false
% 0.20/0.47 % --preprocessed_out false
% 0.20/0.47 % --sub_typing false
% 0.20/0.47 % --brand_transform false
% 0.20/0.47 % --pure_diseq_elim true
% 0.20/0.47 % --min_unsat_core false
% 0.20/0.47 % --pred_elim true
% 0.20/0.47 % --add_important_lit false
% 0.20/0.47 % --soft_assumptions false
% 0.20/0.47 % --reset_solvers false
% 0.20/0.47 % --bc_imp_inh []
% 0.20/0.47 % --conj_cone_tolerance 1.5
% 0.20/0.47 % --prolific_symb_bound 500
% 0.20/0.47 % --lt_threshold 2000
% 0.20/0.47
% 0.20/0.47 % ------ SAT Options
% 0.20/0.47
% 0.20/0.47 % --sat_mode false
% 0.20/0.47 % --sat_fm_restart_options ""
% 0.20/0.47 % --sat_gr_def false
% 0.20/0.47 % --sat_epr_types true
% 0.20/0.47 % --sat_non_cyclic_types false
% 0.20/0.47 % --sat_finite_models false
% 0.20/0.47 % --sat_fm_lemmas false
% 0.20/0.47 % --sat_fm_prep false
% 0.20/0.47 % --sat_fm_uc_incr true
% 0.20/0.47 % --sat_out_model small
% 0.20/0.47 % --sat_out_clauses false
% 0.20/0.47
% 0.20/0.47 % ------ QBF Options
% 0.20/0.47
% 0.20/0.47 % --qbf_mode false
% 0.20/0.47 % --qbf_elim_univ true
% 0.20/0.47 % --qbf_sk_in true
% 0.20/0.47 % --qbf_pred_elim true
% 0.20/0.47 % --qbf_split 32
% 0.20/0.47
% 0.20/0.47 % ------ BMC1 Options
% 0.20/0.47
% 0.20/0.47 % --bmc1_incremental false
% 0.20/0.47 % --bmc1_axioms reachable_all
% 0.20/0.47 % --bmc1_min_bound 0
% 0.20/0.47 % --bmc1_max_bound -1
% 0.20/0.47 % --bmc1_max_bound_default -1
% 0.20/0.47 % --bmc1_symbol_reachability true
% 0.20/0.47 % --bmc1_property_lemmas false
% 0.20/0.47 % --bmc1_k_induction false
% 0.20/0.47 % --bmc1_non_equiv_states false
% 0.20/0.47 % --bmc1_deadlock false
% 0.20/0.47 % --bmc1_ucm false
% 0.20/0.47 % --bmc1_add_unsat_core none
% 0.20/0.47 % --bmc1_unsat_core_children false
% 0.20/0.47 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.47 % --bmc1_out_stat full
% 0.20/0.47 % --bmc1_ground_init false
% 0.20/0.47 % --bmc1_pre_inst_next_state false
% 0.20/0.47 % --bmc1_pre_inst_state false
% 0.20/0.47 % --bmc1_pre_inst_reach_state false
% 0.20/0.47 % --bmc1_out_unsat_core false
% 0.20/0.47 % --bmc1_aig_witness_out false
% 0.20/0.47 % --bmc1_verbose false
% 0.20/0.47 % --bmc1_dump_clauses_tptp false
% 0.60/0.80 % --bmc1_dump_unsat_core_tptp false
% 0.60/0.80 % --bmc1_dump_file -
% 0.60/0.80 % --bmc1_ucm_expand_uc_limit 128
% 0.60/0.80 % --bmc1_ucm_n_expand_iterations 6
% 0.60/0.80 % --bmc1_ucm_extend_mode 1
% 0.60/0.80 % --bmc1_ucm_init_mode 2
% 0.60/0.80 % --bmc1_ucm_cone_mode none
% 0.60/0.80 % --bmc1_ucm_reduced_relation_type 0
% 0.60/0.80 % --bmc1_ucm_relax_model 4
% 0.60/0.80 % --bmc1_ucm_full_tr_after_sat true
% 0.60/0.80 % --bmc1_ucm_expand_neg_assumptions false
% 0.60/0.80 % --bmc1_ucm_layered_model none
% 0.60/0.80 % --bmc1_ucm_max_lemma_size 10
% 0.60/0.80
% 0.60/0.80 % ------ AIG Options
% 0.60/0.80
% 0.60/0.80 % --aig_mode false
% 0.60/0.80
% 0.60/0.80 % ------ Instantiation Options
% 0.60/0.80
% 0.60/0.80 % --instantiation_flag true
% 0.60/0.80 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.60/0.80 % --inst_solver_per_active 750
% 0.60/0.80 % --inst_solver_calls_frac 0.5
% 0.60/0.80 % --inst_passive_queue_type priority_queues
% 0.60/0.80 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.60/0.80 % --inst_passive_queues_freq [25;2]
% 0.60/0.80 % --inst_dismatching true
% 0.60/0.80 % --inst_eager_unprocessed_to_passive true
% 0.60/0.80 % --inst_prop_sim_given true
% 0.60/0.80 % --inst_prop_sim_new false
% 0.60/0.80 % --inst_orphan_elimination true
% 0.60/0.80 % --inst_learning_loop_flag true
% 0.60/0.80 % --inst_learning_start 3000
% 0.60/0.80 % --inst_learning_factor 2
% 0.60/0.80 % --inst_start_prop_sim_after_learn 3
% 0.60/0.80 % --inst_sel_renew solver
% 0.60/0.80 % --inst_lit_activity_flag true
% 0.60/0.80 % --inst_out_proof true
% 0.60/0.80
% 0.60/0.80 % ------ Resolution Options
% 0.60/0.80
% 0.60/0.80 % --resolution_flag true
% 0.60/0.80 % --res_lit_sel kbo_max
% 0.60/0.80 % --res_to_prop_solver none
% 0.60/0.80 % --res_prop_simpl_new false
% 0.60/0.80 % --res_prop_simpl_given false
% 0.60/0.80 % --res_passive_queue_type priority_queues
% 0.60/0.80 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.60/0.80 % --res_passive_queues_freq [15;5]
% 0.60/0.80 % --res_forward_subs full
% 0.60/0.80 % --res_backward_subs full
% 0.60/0.80 % --res_forward_subs_resolution true
% 0.60/0.80 % --res_backward_subs_resolution true
% 0.60/0.80 % --res_orphan_elimination false
% 0.60/0.80 % --res_time_limit 1000.
% 0.60/0.80 % --res_out_proof true
% 0.60/0.80 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_fcdc25.s
% 0.60/0.80 % --modulo true
% 0.60/0.80
% 0.60/0.80 % ------ Combination Options
% 0.60/0.80
% 0.60/0.80 % --comb_res_mult 1000
% 0.60/0.80 % --comb_inst_mult 300
% 0.60/0.80 % ------
% 0.60/0.80
% 0.60/0.80 % ------ Parsing...% successful
% 0.60/0.80
% 0.60/0.80 % ------ Preprocessing... gs_s sp: 680 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.60/0.80
% 0.60/0.80 % ------ Proving...
% 0.60/0.80 % ------ Problem Properties
% 0.60/0.80
% 0.60/0.80 %
% 0.60/0.80 % EPR false
% 0.60/0.80 % Horn false
% 0.60/0.80 % Has equality false
% 0.60/0.80
% 0.60/0.80 % % ------ Input Options Time Limit: Unbounded
% 0.60/0.80
% 0.60/0.80
% 0.60/0.80 % % ------ Current options:
% 0.60/0.80
% 0.60/0.80 % ------ Input Options
% 0.60/0.80
% 0.60/0.80 % --out_options all
% 0.60/0.80 % --tptp_safe_out true
% 0.60/0.80 % --problem_path ""
% 0.60/0.80 % --include_path ""
% 0.60/0.80 % --clausifier .//eprover
% 0.60/0.80 % --clausifier_options --tstp-format
% 0.60/0.80 % --stdin false
% 0.60/0.80 % --dbg_backtrace false
% 0.60/0.80 % --dbg_dump_prop_clauses false
% 0.60/0.80 % --dbg_dump_prop_clauses_file -
% 0.60/0.80 % --dbg_out_stat false
% 0.60/0.80
% 0.60/0.80 % ------ General Options
% 0.60/0.80
% 0.60/0.80 % --fof false
% 0.60/0.80 % --time_out_real 150.
% 0.60/0.80 % --time_out_prep_mult 0.2
% 0.60/0.80 % --time_out_virtual -1.
% 0.60/0.80 % --schedule none
% 0.60/0.80 % --ground_splitting input
% 0.60/0.80 % --splitting_nvd 16
% 0.60/0.80 % --non_eq_to_eq false
% 0.60/0.80 % --prep_gs_sim true
% 0.60/0.80 % --prep_unflatten false
% 0.60/0.80 % --prep_res_sim true
% 0.60/0.80 % --prep_upred true
% 0.60/0.80 % --res_sim_input true
% 0.60/0.80 % --clause_weak_htbl true
% 0.60/0.80 % --gc_record_bc_elim false
% 0.60/0.80 % --symbol_type_check false
% 0.60/0.80 % --clausify_out false
% 0.60/0.80 % --large_theory_mode false
% 0.60/0.80 % --prep_sem_filter none
% 0.60/0.80 % --prep_sem_filter_out false
% 0.60/0.80 % --preprocessed_out false
% 0.60/0.80 % --sub_typing false
% 0.60/0.80 % --brand_transform false
% 0.60/0.80 % --pure_diseq_elim true
% 0.60/0.80 % --min_unsat_core false
% 0.60/0.80 % --pred_elim true
% 0.60/0.80 % --add_important_lit false
% 0.60/0.80 % --soft_assumptions false
% 0.60/0.80 % --reset_solvers false
% 0.60/0.80 % --bc_imp_inh []
% 0.60/0.80 % --conj_cone_tolerance 1.5
% 0.60/0.80 % --prolific_symb_bound 500
% 0.60/0.80 % --lt_threshold 2000
% 0.60/0.80
% 0.60/0.80 % ------ SAT Options
% 0.60/0.80
% 0.60/0.80 % --sat_mode false
% 0.60/0.80 % --sat_fm_restart_options ""
% 0.60/0.80 % --sat_gr_def false
% 0.60/0.80 % --sat_epr_types true
% 0.60/0.80 % --sat_non_cyclic_types false
% 0.60/0.80 % --sat_finite_models false
% 0.60/0.80 % --sat_fm_lemmas false
% 0.60/0.80 % --sat_fm_prep false
% 0.60/0.80 % --sat_fm_uc_incr true
% 0.60/0.80 % --sat_out_model small
% 0.60/0.80 % --sat_out_clauses false
% 0.60/0.80
% 0.60/0.80 % ------ QBF Options
% 0.60/0.80
% 0.60/0.80 % --qbf_mode false
% 0.60/0.80 % --qbf_elim_univ true
% 0.60/0.80 % --qbf_sk_in true
% 0.60/0.80 % --qbf_pred_elim true
% 0.60/0.80 % --qbf_split 32
% 0.60/0.80
% 0.60/0.80 % ------ BMC1 Options
% 0.60/0.80
% 0.60/0.80 % --bmc1_incremental false
% 0.60/0.80 % --bmc1_axioms reachable_all
% 0.60/0.80 % --bmc1_min_bound 0
% 0.60/0.80 % --bmc1_max_bound -1
% 0.60/0.80 % --bmc1_max_bound_default -1
% 0.60/0.80 % --bmc1_symbol_reachability true
% 0.60/0.80 % --bmc1_property_lemmas false
% 0.60/0.80 % --bmc1_k_induction false
% 0.60/0.80 % --bmc1_non_equiv_states false
% 0.60/0.80 % --bmc1_deadlock false
% 0.60/0.80 % --bmc1_ucm false
% 0.60/0.80 % --bmc1_add_unsat_core none
% 0.60/0.80 % --bmc1_unsat_core_children false
% 0.60/0.80 % --bmc1_unsat_core_extrapolate_axioms false
% 0.60/0.80 % --bmc1_out_stat full
% 0.60/0.80 % --bmc1_ground_init false
% 0.60/0.80 % --bmc1_pre_inst_next_state false
% 0.60/0.80 % --bmc1_pre_inst_state false
% 0.60/0.80 % --bmc1_pre_inst_reach_state false
% 0.60/0.80 % --bmc1_out_unsat_core false
% 0.60/0.80 % --bmc1_aig_witness_out false
% 0.60/0.80 % --bmc1_verbose false
% 0.60/0.80 % --bmc1_dump_clauses_tptp false
% 0.60/0.80 % --bmc1_dump_unsat_core_tptp false
% 0.60/0.80 % --bmc1_dump_file -
% 0.60/0.80 % --bmc1_ucm_expand_uc_limit 128
% 0.60/0.80 % --bmc1_ucm_n_expand_iterations 6
% 0.60/0.80 % --bmc1_ucm_extend_mode 1
% 0.60/0.80 % --bmc1_ucm_init_mode 2
% 0.60/0.80 % --bmc1_ucm_cone_mode none
% 0.60/0.80 % --bmc1_ucm_reduced_relation_type 0
% 0.60/0.80 % --bmc1_ucm_relax_model 4
% 0.60/0.80 % --bmc1_ucm_full_tr_after_sat true
% 0.60/0.80 % --bmc1_ucm_expand_neg_assumptions false
% 0.60/0.80 % --bmc1_ucm_layered_model none
% 0.60/0.80 % --bmc1_ucm_max_lemma_size 10
% 0.60/0.80
% 0.60/0.80 % ------ AIG Options
% 0.60/0.80
% 0.60/0.80 % --aig_mode false
% 0.60/0.80
% 0.60/0.80 % ------ Instantiation Options
% 0.60/0.80
% 0.60/0.80 % --instantiation_flag true
% 0.60/0.80 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.60/0.80 % --inst_solver_per_active 750
% 0.60/0.80 % --inst_solver_calls_frac 0.5
% 0.60/0.80 % --inst_passive_queue_type priority_queues
% 0.60/0.80 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.60/0.80 % --inst_passive_queues_freq [25;2]
% 0.60/0.80 % --inst_dismatching true
% 0.60/0.80 % --inst_eager_unprocessed_to_passive true
% 0.60/0.80 % --inst_prop_sim_given true
% 4.41/4.58 % --inst_prop_sim_new false
% 4.41/4.58 % --inst_orphan_elimination true
% 4.41/4.58 % --inst_learning_loop_flag true
% 4.41/4.58 % --inst_learning_start 3000
% 4.41/4.58 % --inst_learning_factor 2
% 4.41/4.58 % --inst_start_prop_sim_after_learn 3
% 4.41/4.58 % --inst_sel_renew solver
% 4.41/4.58 % --inst_lit_activity_flag true
% 4.41/4.58 % --inst_out_proof true
% 4.41/4.58
% 4.41/4.58 % ------ Resolution Options
% 4.41/4.58
% 4.41/4.58 % --resolution_flag true
% 4.41/4.58 % --res_lit_sel kbo_max
% 4.41/4.58 % --res_to_prop_solver none
% 4.41/4.58 % --res_prop_simpl_new false
% 4.41/4.58 % --res_prop_simpl_given false
% 4.41/4.58 % --res_passive_queue_type priority_queues
% 4.41/4.58 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 4.41/4.58 % --res_passive_queues_freq [15;5]
% 4.41/4.58 % --res_forward_subs full
% 4.41/4.58 % --res_backward_subs full
% 4.41/4.58 % --res_forward_subs_resolution true
% 4.41/4.58 % --res_backward_subs_resolution true
% 4.41/4.58 % --res_orphan_elimination false
% 4.41/4.58 % --res_time_limit 1000.
% 4.41/4.58 % --res_out_proof true
% 4.41/4.58 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_fcdc25.s
% 4.41/4.58 % --modulo true
% 4.41/4.58
% 4.41/4.58 % ------ Combination Options
% 4.41/4.58
% 4.41/4.58 % --comb_res_mult 1000
% 4.41/4.58 % --comb_inst_mult 300
% 4.41/4.58 % ------
% 4.41/4.58
% 4.41/4.58
% 4.41/4.58
% 4.41/4.58 % ------ Proving...
% 4.41/4.58 % warning: shown sat in sat incomplete mode
% 4.41/4.58 %
% 4.41/4.58
% 4.41/4.58
% 4.41/4.58 ------ Building Model...Done
% 4.41/4.58
% 4.41/4.58 %------ The model is defined over ground terms (initial term algebra).
% 4.41/4.58 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 4.41/4.58 %------ where \phi is a formula over the term algebra.
% 4.41/4.58 %------ If we have equality in the problem then it is also defined as a predicate above,
% 4.41/4.58 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 4.41/4.58 %------ See help for --sat_out_model for different model outputs.
% 4.41/4.58 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 4.41/4.58 %------ where the first argument stands for the sort ($i in the unsorted case)
% 4.41/4.58
% 4.41/4.58
% 4.41/4.58
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of actual_world
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0] :
% 4.41/4.58 ( actual_world(X0) <=>
% 4.41/4.58 (
% 4.41/4.58 (
% 4.41/4.58 ( X0=sk3_esk9_0 )
% 4.41/4.58 )
% 4.41/4.58
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of see
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0,X1] :
% 4.41/4.58 ( see(X0,X1) <=>
% 4.41/4.58 $false
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of nonreflexive
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0,X1] :
% 4.41/4.58 ( nonreflexive(X0,X1) <=>
% 4.41/4.58 (
% 4.41/4.58 (
% 4.41/4.58 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 )
% 4.41/4.58 )
% 4.41/4.58
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Negative definition of past
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0,X1] :
% 4.41/4.58 ( ~(past(X0,X1)) <=>
% 4.41/4.58 $false
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Negative definition of patient
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0,X1,X2] :
% 4.41/4.58 ( ~(patient(X0,X1,X2)) <=>
% 4.41/4.58 $false
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Negative definition of agent
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0,X1,X2] :
% 4.41/4.58 ( ~(agent(X0,X1,X2)) <=>
% 4.41/4.58 $false
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Negative definition of event
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0,X1] :
% 4.41/4.58 ( ~(event(X0,X1)) <=>
% 4.41/4.58 $false
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Negative definition of drink
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0,X1] :
% 4.41/4.58 ( ~(drink(X0,X1)) <=>
% 4.41/4.58 $false
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Negative definition of coffee
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0,X1] :
% 4.41/4.58 ( ~(coffee(X0,X1)) <=>
% 4.41/4.58 $false
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Negative definition of human_person
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0,X1] :
% 4.41/4.58 ( ~(human_person(X0,X1)) <=>
% 4.41/4.58 $false
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Negative definition of restaurant
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0,X1] :
% 4.41/4.58 ( ~(restaurant(X0,X1)) <=>
% 4.41/4.58 (
% 4.41/4.58 (
% 4.41/4.58 ( X0=sk3_esk9_0 )
% 4.41/4.58 &
% 4.41/4.58 ( X1!=sk3_esk8_1(sk3_esk9_0) )
% 4.41/4.58 )
% 4.41/4.58
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of in
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0,X1,X2] :
% 4.41/4.58 ( in(X0,X1,X2) <=>
% 4.41/4.58 $false
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Negative definition of customer
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 (! [X0,X1] :
% 4.41/4.58 ( ~(customer(X0,X1)) <=>
% 4.41/4.58 (
% 4.41/4.58 (
% 4.41/4.58 ( X0=sk3_esk1_0 )
% 4.41/4.58 )
% 4.41/4.58
% 4.41/4.58 |
% 4.41/4.58 (
% 4.41/4.58 ( X0=sk3_esk9_0 )
% 4.41/4.58 &
% 4.41/4.58 ( X1!=sk3_esk7_1(sk3_esk9_0) )
% 4.41/4.58 )
% 4.41/4.58
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP0_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP0_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP1_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP1_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP2_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP2_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP3_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP3_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP4_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP4_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP5_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP5_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP6_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP6_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP7_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP7_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP8_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP8_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP9_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP9_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP10_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP10_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP11_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP11_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP12_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP12_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP13_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP13_iProver_split <=>
% 4.41/4.58 $false
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP14_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP14_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP15_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP15_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP16_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP16_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP17_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP17_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP18_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP18_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP19_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP19_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP20_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP20_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP21_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP21_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP22_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP22_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP23_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP23_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP24_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP24_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP25_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP25_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP26_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP26_iProver_split <=>
% 4.41/4.58 $false
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58 %------ Positive definition of sP27_iProver_split
% 4.41/4.58 fof(lit_def,axiom,
% 4.41/4.58 ( sP27_iProver_split <=>
% 4.41/4.58 $true
% 4.41/4.58 )
% 4.41/4.58 ).
% 4.41/4.58
% 4.41/4.58
% 4.41/4.58
% 4.41/4.58 % ------ Statistics
% 4.41/4.58
% 4.41/4.58 % ------ General
% 4.41/4.58
% 4.41/4.58 % num_of_input_clauses: 360
% 4.41/4.58 % num_of_input_neg_conjectures: 360
% 4.41/4.58 % num_of_splits: 680
% 4.41/4.58 % num_of_split_atoms: 28
% 4.41/4.58 % num_of_sem_filtered_clauses: 0
% 4.41/4.58 % num_of_subtypes: 0
% 4.41/4.58 % monotx_restored_types: 0
% 4.41/4.58 % sat_num_of_epr_types: 0
% 4.41/4.58 % sat_num_of_non_cyclic_types: 0
% 4.41/4.58 % sat_guarded_non_collapsed_types: 0
% 4.41/4.58 % is_epr: 0
% 4.41/4.58 % is_horn: 0
% 4.41/4.58 % has_eq: 0
% 4.41/4.58 % num_pure_diseq_elim: 0
% 4.41/4.58 % simp_replaced_by: 0
% 4.41/4.58 % res_preprocessed: 1400
% 4.41/4.58 % prep_upred: 0
% 4.41/4.58 % prep_unflattend: 0
% 4.41/4.58 % pred_elim_cands: 28
% 4.41/4.58 % pred_elim: 0
% 4.41/4.58 % pred_elim_cl: 0
% 4.41/4.58 % pred_elim_cycles: 28
% 4.41/4.58 % forced_gc_time: 0
% 4.41/4.58 % gc_basic_clause_elim: 0
% 4.41/4.58 % parsing_time: 0.031
% 4.41/4.58 % sem_filter_time: 0.
% 4.41/4.58 % pred_elim_time: 0.188
% 4.41/4.58 % out_proof_time: 0.
% 4.41/4.58 % monotx_time: 0.
% 4.41/4.58 % subtype_inf_time: 0.
% 4.41/4.58 % unif_index_cands_time: 0.001
% 4.41/4.58 % unif_index_add_time: 0.003
% 4.41/4.58 % total_time: 4.134
% 4.41/4.58 % num_of_symbols: 80
% 4.41/4.58 % num_of_terms: 1268
% 4.41/4.58
% 4.41/4.58 % ------ Propositional Solver
% 4.41/4.58
% 4.41/4.58 % prop_solver_calls: 4
% 4.41/4.58 % prop_fast_solver_calls: 10562
% 4.41/4.58 % prop_num_of_clauses: 1710
% 4.41/4.58 % prop_preprocess_simplified: 9818
% 4.41/4.58 % prop_fo_subsumed: 0
% 4.41/4.58 % prop_solver_time: 0.
% 4.41/4.58 % prop_fast_solver_time: 0.013
% 4.41/4.58 % prop_unsat_core_time: 0.
% 4.41/4.59
% 4.41/4.59 % ------ QBF
% 4.41/4.59
% 4.41/4.59 % qbf_q_res: 0
% 4.41/4.59 % qbf_num_tautologies: 0
% 4.41/4.59 % qbf_prep_cycles: 0
% 4.41/4.59
% 4.41/4.59 % ------ BMC1
% 4.41/4.59
% 4.41/4.59 % bmc1_current_bound: -1
% 4.41/4.59 % bmc1_last_solved_bound: -1
% 4.41/4.59 % bmc1_unsat_core_size: -1
% 4.41/4.59 % bmc1_unsat_core_parents_size: -1
% 4.41/4.59 % bmc1_merge_next_fun: 0
% 4.41/4.59 % bmc1_unsat_core_clauses_time: 0.
% 4.41/4.59
% 4.41/4.59 % ------ Instantiation
% 4.41/4.59
% 4.41/4.59 % inst_num_of_clauses: 458
% 4.41/4.59 % inst_num_in_passive: 0
% 4.41/4.59 % inst_num_in_active: 456
% 4.41/4.59 % inst_num_in_unprocessed: 0
% 4.41/4.59 % inst_num_of_loops: 526
% 4.41/4.59 % inst_num_of_learning_restarts: 0
% 4.41/4.59 % inst_num_moves_active_passive: 61
% 4.41/4.59 % inst_lit_activity: 31
% 4.41/4.59 % inst_lit_activity_moves: 0
% 4.41/4.59 % inst_num_tautologies: 2
% 4.41/4.59 % inst_num_prop_implied: 0
% 4.41/4.59 % inst_num_existing_simplified: 0
% 4.41/4.59 % inst_num_eq_res_simplified: 0
% 4.41/4.59 % inst_num_child_elim: 0
% 4.41/4.59 % inst_num_of_dismatching_blockings: 2
% 4.41/4.59 % inst_num_of_non_proper_insts: 102
% 4.41/4.59 % inst_num_of_duplicates: 57
% 4.41/4.59 % inst_inst_num_from_inst_to_res: 0
% 4.41/4.59 % inst_dismatching_checking_time: 0.
% 4.41/4.59
% 4.41/4.59 % ------ Resolution
% 4.41/4.59
% 4.41/4.59 % res_num_of_clauses: 2489
% 4.41/4.59 % res_num_in_passive: 999
% 4.41/4.59 % res_num_in_active: 1539
% 4.41/4.59 % res_num_of_loops: 2000
% 4.41/4.59 % res_forward_subset_subsumed: 4140
% 4.41/4.59 % res_backward_subset_subsumed: 337
% 4.41/4.59 % res_forward_subsumed: 191
% 4.41/4.59 % res_backward_subsumed: 24
% 4.41/4.59 % res_forward_subsumption_resolution: 1562
% 4.41/4.59 % res_backward_subsumption_resolution: 0
% 4.41/4.59 % res_clause_to_clause_subsumption: 4189
% 4.41/4.59 % res_orphan_elimination: 0
% 4.41/4.59 % res_tautology_del: 360
% 4.41/4.59 % res_num_eq_res_simplified: 0
% 4.41/4.59 % res_num_sel_changes: 0
% 4.41/4.59 % res_moves_from_active_to_pass: 0
% 4.41/4.59
% 4.41/4.59 % Status Unknown
% 4.41/4.66 % Orienting using strategy ClausalAll
% 4.41/4.66 % FOF problem with conjecture
% 4.41/4.66 % 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_fcdc25.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_00990c.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_279554 | grep -v "SZS"
% 4.51/4.68
% 4.51/4.68 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 4.51/4.68
% 4.51/4.68 %
% 4.51/4.68 % ------ iProver source info
% 4.51/4.68
% 4.51/4.68 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 4.51/4.68 % git: non_committed_changes: true
% 4.51/4.68 % git: last_make_outside_of_git: true
% 4.51/4.68
% 4.51/4.68 %
% 4.51/4.68 % ------ Input Options
% 4.51/4.68
% 4.51/4.68 % --out_options all
% 4.51/4.68 % --tptp_safe_out true
% 4.51/4.68 % --problem_path ""
% 4.51/4.68 % --include_path ""
% 4.51/4.68 % --clausifier .//eprover
% 4.51/4.68 % --clausifier_options --tstp-format
% 4.51/4.68 % --stdin false
% 4.51/4.68 % --dbg_backtrace false
% 4.51/4.68 % --dbg_dump_prop_clauses false
% 4.51/4.68 % --dbg_dump_prop_clauses_file -
% 4.51/4.68 % --dbg_out_stat false
% 4.51/4.68
% 4.51/4.68 % ------ General Options
% 4.51/4.68
% 4.51/4.68 % --fof false
% 4.51/4.68 % --time_out_real 150.
% 4.51/4.68 % --time_out_prep_mult 0.2
% 4.51/4.68 % --time_out_virtual -1.
% 4.51/4.68 % --schedule none
% 4.51/4.68 % --ground_splitting input
% 4.51/4.68 % --splitting_nvd 16
% 4.51/4.68 % --non_eq_to_eq false
% 4.51/4.68 % --prep_gs_sim true
% 4.51/4.68 % --prep_unflatten false
% 4.51/4.68 % --prep_res_sim true
% 4.51/4.68 % --prep_upred true
% 4.51/4.68 % --res_sim_input true
% 4.51/4.68 % --clause_weak_htbl true
% 4.51/4.68 % --gc_record_bc_elim false
% 4.51/4.68 % --symbol_type_check false
% 4.51/4.68 % --clausify_out false
% 4.51/4.68 % --large_theory_mode false
% 4.51/4.68 % --prep_sem_filter none
% 4.51/4.68 % --prep_sem_filter_out false
% 4.51/4.68 % --preprocessed_out false
% 4.51/4.68 % --sub_typing false
% 4.51/4.68 % --brand_transform false
% 4.51/4.68 % --pure_diseq_elim true
% 4.51/4.68 % --min_unsat_core false
% 4.51/4.68 % --pred_elim true
% 4.51/4.68 % --add_important_lit false
% 4.51/4.68 % --soft_assumptions false
% 4.51/4.68 % --reset_solvers false
% 4.51/4.68 % --bc_imp_inh []
% 4.51/4.68 % --conj_cone_tolerance 1.5
% 4.51/4.68 % --prolific_symb_bound 500
% 4.51/4.68 % --lt_threshold 2000
% 4.51/4.68
% 4.51/4.68 % ------ SAT Options
% 4.51/4.68
% 4.51/4.68 % --sat_mode false
% 4.51/4.68 % --sat_fm_restart_options ""
% 4.51/4.68 % --sat_gr_def false
% 4.51/4.68 % --sat_epr_types true
% 4.51/4.68 % --sat_non_cyclic_types false
% 4.51/4.68 % --sat_finite_models false
% 4.51/4.68 % --sat_fm_lemmas false
% 4.51/4.68 % --sat_fm_prep false
% 4.51/4.68 % --sat_fm_uc_incr true
% 4.51/4.68 % --sat_out_model small
% 4.51/4.68 % --sat_out_clauses false
% 4.51/4.68
% 4.51/4.68 % ------ QBF Options
% 4.51/4.68
% 4.51/4.68 % --qbf_mode false
% 4.51/4.68 % --qbf_elim_univ true
% 4.51/4.68 % --qbf_sk_in true
% 4.51/4.68 % --qbf_pred_elim true
% 4.51/4.68 % --qbf_split 32
% 4.51/4.68
% 4.51/4.68 % ------ BMC1 Options
% 4.51/4.68
% 4.51/4.68 % --bmc1_incremental false
% 4.51/4.68 % --bmc1_axioms reachable_all
% 4.51/4.68 % --bmc1_min_bound 0
% 4.51/4.68 % --bmc1_max_bound -1
% 4.51/4.68 % --bmc1_max_bound_default -1
% 4.51/4.68 % --bmc1_symbol_reachability true
% 4.51/4.68 % --bmc1_property_lemmas false
% 4.51/4.68 % --bmc1_k_induction false
% 4.51/4.68 % --bmc1_non_equiv_states false
% 4.51/4.68 % --bmc1_deadlock false
% 4.51/4.68 % --bmc1_ucm false
% 4.51/4.68 % --bmc1_add_unsat_core none
% 4.51/4.68 % --bmc1_unsat_core_children false
% 4.51/4.68 % --bmc1_unsat_core_extrapolate_axioms false
% 4.51/4.68 % --bmc1_out_stat full
% 4.51/4.68 % --bmc1_ground_init false
% 4.51/4.68 % --bmc1_pre_inst_next_state false
% 4.51/4.68 % --bmc1_pre_inst_state false
% 4.51/4.68 % --bmc1_pre_inst_reach_state false
% 4.51/4.68 % --bmc1_out_unsat_core false
% 4.51/4.68 % --bmc1_aig_witness_out false
% 4.51/4.68 % --bmc1_verbose false
% 4.51/4.68 % --bmc1_dump_clauses_tptp false
% 4.51/4.89 % --bmc1_dump_unsat_core_tptp false
% 4.51/4.89 % --bmc1_dump_file -
% 4.51/4.89 % --bmc1_ucm_expand_uc_limit 128
% 4.51/4.89 % --bmc1_ucm_n_expand_iterations 6
% 4.51/4.89 % --bmc1_ucm_extend_mode 1
% 4.51/4.89 % --bmc1_ucm_init_mode 2
% 4.51/4.89 % --bmc1_ucm_cone_mode none
% 4.51/4.89 % --bmc1_ucm_reduced_relation_type 0
% 4.51/4.89 % --bmc1_ucm_relax_model 4
% 4.51/4.89 % --bmc1_ucm_full_tr_after_sat true
% 4.51/4.89 % --bmc1_ucm_expand_neg_assumptions false
% 4.51/4.89 % --bmc1_ucm_layered_model none
% 4.51/4.89 % --bmc1_ucm_max_lemma_size 10
% 4.51/4.89
% 4.51/4.89 % ------ AIG Options
% 4.51/4.89
% 4.51/4.89 % --aig_mode false
% 4.51/4.89
% 4.51/4.89 % ------ Instantiation Options
% 4.51/4.89
% 4.51/4.89 % --instantiation_flag true
% 4.51/4.89 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 4.51/4.89 % --inst_solver_per_active 750
% 4.51/4.89 % --inst_solver_calls_frac 0.5
% 4.51/4.89 % --inst_passive_queue_type priority_queues
% 4.51/4.89 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 4.51/4.89 % --inst_passive_queues_freq [25;2]
% 4.51/4.89 % --inst_dismatching true
% 4.51/4.89 % --inst_eager_unprocessed_to_passive true
% 4.51/4.89 % --inst_prop_sim_given true
% 4.51/4.89 % --inst_prop_sim_new false
% 4.51/4.89 % --inst_orphan_elimination true
% 4.51/4.89 % --inst_learning_loop_flag true
% 4.51/4.89 % --inst_learning_start 3000
% 4.51/4.89 % --inst_learning_factor 2
% 4.51/4.89 % --inst_start_prop_sim_after_learn 3
% 4.51/4.89 % --inst_sel_renew solver
% 4.51/4.89 % --inst_lit_activity_flag true
% 4.51/4.89 % --inst_out_proof true
% 4.51/4.89
% 4.51/4.89 % ------ Resolution Options
% 4.51/4.89
% 4.51/4.89 % --resolution_flag true
% 4.51/4.89 % --res_lit_sel kbo_max
% 4.51/4.89 % --res_to_prop_solver none
% 4.51/4.89 % --res_prop_simpl_new false
% 4.51/4.89 % --res_prop_simpl_given false
% 4.51/4.89 % --res_passive_queue_type priority_queues
% 4.51/4.89 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 4.51/4.89 % --res_passive_queues_freq [15;5]
% 4.51/4.89 % --res_forward_subs full
% 4.51/4.89 % --res_backward_subs full
% 4.51/4.89 % --res_forward_subs_resolution true
% 4.51/4.89 % --res_backward_subs_resolution true
% 4.51/4.89 % --res_orphan_elimination false
% 4.51/4.89 % --res_time_limit 1000.
% 4.51/4.89 % --res_out_proof true
% 4.51/4.89 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_fcdc25.s
% 4.51/4.89 % --modulo true
% 4.51/4.89
% 4.51/4.89 % ------ Combination Options
% 4.51/4.89
% 4.51/4.89 % --comb_res_mult 1000
% 4.51/4.89 % --comb_inst_mult 300
% 4.51/4.89 % ------
% 4.51/4.89
% 4.51/4.89 % ------ Parsing...% successful
% 4.51/4.89
% 4.51/4.89 % ------ Preprocessing... gs_s sp: 680 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 4.51/4.89
% 4.51/4.89 % ------ Proving...
% 4.51/4.89 % ------ Problem Properties
% 4.51/4.89
% 4.51/4.89 %
% 4.51/4.89 % EPR false
% 4.51/4.89 % Horn false
% 4.51/4.89 % Has equality false
% 4.51/4.89
% 4.51/4.89 % % ------ Input Options Time Limit: Unbounded
% 4.51/4.89
% 4.51/4.89
% 4.51/4.89 % % ------ Current options:
% 4.51/4.89
% 4.51/4.89 % ------ Input Options
% 4.51/4.89
% 4.51/4.89 % --out_options all
% 4.51/4.89 % --tptp_safe_out true
% 4.51/4.89 % --problem_path ""
% 4.51/4.89 % --include_path ""
% 4.51/4.89 % --clausifier .//eprover
% 4.51/4.89 % --clausifier_options --tstp-format
% 4.51/4.89 % --stdin false
% 4.51/4.89 % --dbg_backtrace false
% 4.51/4.89 % --dbg_dump_prop_clauses false
% 4.51/4.89 % --dbg_dump_prop_clauses_file -
% 4.51/4.89 % --dbg_out_stat false
% 4.51/4.89
% 4.51/4.89 % ------ General Options
% 4.51/4.89
% 4.51/4.89 % --fof false
% 4.51/4.89 % --time_out_real 150.
% 4.51/4.89 % --time_out_prep_mult 0.2
% 4.51/4.89 % --time_out_virtual -1.
% 4.51/4.89 % --schedule none
% 4.51/4.89 % --ground_splitting input
% 4.51/4.89 % --splitting_nvd 16
% 4.51/4.89 % --non_eq_to_eq false
% 4.51/4.89 % --prep_gs_sim true
% 4.51/4.89 % --prep_unflatten false
% 4.51/4.89 % --prep_res_sim true
% 4.51/4.89 % --prep_upred true
% 4.51/4.89 % --res_sim_input true
% 4.51/4.89 % --clause_weak_htbl true
% 4.51/4.89 % --gc_record_bc_elim false
% 4.51/4.89 % --symbol_type_check false
% 4.51/4.89 % --clausify_out false
% 4.51/4.89 % --large_theory_mode false
% 4.51/4.89 % --prep_sem_filter none
% 4.51/4.89 % --prep_sem_filter_out false
% 4.51/4.89 % --preprocessed_out false
% 4.51/4.89 % --sub_typing false
% 4.51/4.89 % --brand_transform false
% 4.51/4.89 % --pure_diseq_elim true
% 4.51/4.89 % --min_unsat_core false
% 4.51/4.89 % --pred_elim true
% 4.51/4.89 % --add_important_lit false
% 4.51/4.89 % --soft_assumptions false
% 4.51/4.89 % --reset_solvers false
% 4.51/4.89 % --bc_imp_inh []
% 4.51/4.89 % --conj_cone_tolerance 1.5
% 4.51/4.89 % --prolific_symb_bound 500
% 4.51/4.89 % --lt_threshold 2000
% 4.51/4.90
% 4.51/4.90 % ------ SAT Options
% 4.51/4.90
% 4.51/4.90 % --sat_mode false
% 4.51/4.90 % --sat_fm_restart_options ""
% 4.51/4.90 % --sat_gr_def false
% 4.51/4.90 % --sat_epr_types true
% 4.51/4.90 % --sat_non_cyclic_types false
% 4.51/4.90 % --sat_finite_models false
% 4.51/4.90 % --sat_fm_lemmas false
% 4.51/4.90 % --sat_fm_prep false
% 4.51/4.90 % --sat_fm_uc_incr true
% 4.51/4.90 % --sat_out_model small
% 4.51/4.90 % --sat_out_clauses false
% 4.51/4.90
% 4.51/4.90 % ------ QBF Options
% 4.51/4.90
% 4.51/4.90 % --qbf_mode false
% 4.51/4.90 % --qbf_elim_univ true
% 4.51/4.90 % --qbf_sk_in true
% 4.51/4.90 % --qbf_pred_elim true
% 4.51/4.90 % --qbf_split 32
% 4.51/4.90
% 4.51/4.90 % ------ BMC1 Options
% 4.51/4.90
% 4.51/4.90 % --bmc1_incremental false
% 4.51/4.90 % --bmc1_axioms reachable_all
% 4.51/4.90 % --bmc1_min_bound 0
% 4.51/4.90 % --bmc1_max_bound -1
% 4.51/4.90 % --bmc1_max_bound_default -1
% 4.51/4.90 % --bmc1_symbol_reachability true
% 4.51/4.90 % --bmc1_property_lemmas false
% 4.51/4.90 % --bmc1_k_induction false
% 4.51/4.90 % --bmc1_non_equiv_states false
% 4.51/4.90 % --bmc1_deadlock false
% 4.51/4.90 % --bmc1_ucm false
% 4.51/4.90 % --bmc1_add_unsat_core none
% 4.51/4.90 % --bmc1_unsat_core_children false
% 4.51/4.90 % --bmc1_unsat_core_extrapolate_axioms false
% 4.51/4.90 % --bmc1_out_stat full
% 4.51/4.90 % --bmc1_ground_init false
% 4.51/4.90 % --bmc1_pre_inst_next_state false
% 4.51/4.90 % --bmc1_pre_inst_state false
% 4.51/4.90 % --bmc1_pre_inst_reach_state false
% 4.51/4.90 % --bmc1_out_unsat_core false
% 4.51/4.90 % --bmc1_aig_witness_out false
% 4.51/4.90 % --bmc1_verbose false
% 4.51/4.90 % --bmc1_dump_clauses_tptp false
% 4.51/4.90 % --bmc1_dump_unsat_core_tptp false
% 4.51/4.90 % --bmc1_dump_file -
% 4.51/4.90 % --bmc1_ucm_expand_uc_limit 128
% 4.51/4.90 % --bmc1_ucm_n_expand_iterations 6
% 4.51/4.90 % --bmc1_ucm_extend_mode 1
% 4.51/4.90 % --bmc1_ucm_init_mode 2
% 4.51/4.90 % --bmc1_ucm_cone_mode none
% 4.51/4.90 % --bmc1_ucm_reduced_relation_type 0
% 4.51/4.90 % --bmc1_ucm_relax_model 4
% 4.51/4.90 % --bmc1_ucm_full_tr_after_sat true
% 4.51/4.90 % --bmc1_ucm_expand_neg_assumptions false
% 4.51/4.90 % --bmc1_ucm_layered_model none
% 4.51/4.90 % --bmc1_ucm_max_lemma_size 10
% 4.51/4.90
% 4.51/4.90 % ------ AIG Options
% 4.51/4.90
% 4.51/4.90 % --aig_mode false
% 4.51/4.90
% 4.51/4.90 % ------ Instantiation Options
% 4.51/4.90
% 4.51/4.90 % --instantiation_flag true
% 4.51/4.90 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 4.51/4.90 % --inst_solver_per_active 750
% 4.51/4.90 % --inst_solver_calls_frac 0.5
% 4.51/4.90 % --inst_passive_queue_type priority_queues
% 4.51/4.90 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 4.51/4.90 % --inst_passive_queues_freq [25;2]
% 4.51/4.90 % --inst_dismatching true
% 4.51/4.90 % --inst_eager_unprocessed_to_passive true
% 4.51/4.90 % --inst_prop_sim_given true
% 8.47/8.66 % --inst_prop_sim_new false
% 8.47/8.66 % --inst_orphan_elimination true
% 8.47/8.66 % --inst_learning_loop_flag true
% 8.47/8.66 % --inst_learning_start 3000
% 8.47/8.66 % --inst_learning_factor 2
% 8.47/8.66 % --inst_start_prop_sim_after_learn 3
% 8.47/8.66 % --inst_sel_renew solver
% 8.47/8.66 % --inst_lit_activity_flag true
% 8.47/8.66 % --inst_out_proof true
% 8.47/8.66
% 8.47/8.66 % ------ Resolution Options
% 8.47/8.66
% 8.47/8.66 % --resolution_flag true
% 8.47/8.66 % --res_lit_sel kbo_max
% 8.47/8.66 % --res_to_prop_solver none
% 8.47/8.66 % --res_prop_simpl_new false
% 8.47/8.66 % --res_prop_simpl_given false
% 8.47/8.66 % --res_passive_queue_type priority_queues
% 8.47/8.66 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 8.47/8.66 % --res_passive_queues_freq [15;5]
% 8.47/8.66 % --res_forward_subs full
% 8.47/8.66 % --res_backward_subs full
% 8.47/8.66 % --res_forward_subs_resolution true
% 8.47/8.66 % --res_backward_subs_resolution true
% 8.47/8.66 % --res_orphan_elimination false
% 8.47/8.66 % --res_time_limit 1000.
% 8.47/8.66 % --res_out_proof true
% 8.47/8.66 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_fcdc25.s
% 8.47/8.66 % --modulo true
% 8.47/8.66
% 8.47/8.66 % ------ Combination Options
% 8.47/8.66
% 8.47/8.66 % --comb_res_mult 1000
% 8.47/8.66 % --comb_inst_mult 300
% 8.47/8.66 % ------
% 8.47/8.66
% 8.47/8.66
% 8.47/8.66
% 8.47/8.66 % ------ Proving...
% 8.47/8.66 % warning: shown sat in sat incomplete mode
% 8.47/8.66 %
% 8.47/8.66
% 8.47/8.66
% 8.47/8.66 ------ Building Model...Done
% 8.47/8.66
% 8.47/8.66 %------ The model is defined over ground terms (initial term algebra).
% 8.47/8.66 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 8.47/8.66 %------ where \phi is a formula over the term algebra.
% 8.47/8.66 %------ If we have equality in the problem then it is also defined as a predicate above,
% 8.47/8.66 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 8.47/8.66 %------ See help for --sat_out_model for different model outputs.
% 8.47/8.66 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 8.47/8.66 %------ where the first argument stands for the sort ($i in the unsorted case)
% 8.47/8.66
% 8.47/8.66
% 8.47/8.66
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of actual_world
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0] :
% 8.47/8.66 ( actual_world(X0) <=>
% 8.47/8.66 (
% 8.47/8.66 (
% 8.47/8.66 ( X0=sk2_esk9_0 )
% 8.47/8.66 )
% 8.47/8.66
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of see
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0,X1] :
% 8.47/8.66 ( see(X0,X1) <=>
% 8.47/8.66 $false
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of nonreflexive
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0,X1] :
% 8.47/8.66 ( nonreflexive(X0,X1) <=>
% 8.47/8.66 (
% 8.47/8.66 (
% 8.47/8.66 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 )
% 8.47/8.66 )
% 8.47/8.66
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Negative definition of past
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0,X1] :
% 8.47/8.66 ( ~(past(X0,X1)) <=>
% 8.47/8.66 $false
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Negative definition of patient
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0,X1,X2] :
% 8.47/8.66 ( ~(patient(X0,X1,X2)) <=>
% 8.47/8.66 $false
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Negative definition of agent
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0,X1,X2] :
% 8.47/8.66 ( ~(agent(X0,X1,X2)) <=>
% 8.47/8.66 $false
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Negative definition of event
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0,X1] :
% 8.47/8.66 ( ~(event(X0,X1)) <=>
% 8.47/8.66 $false
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Negative definition of drink
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0,X1] :
% 8.47/8.66 ( ~(drink(X0,X1)) <=>
% 8.47/8.66 $false
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Negative definition of coffee
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0,X1] :
% 8.47/8.66 ( ~(coffee(X0,X1)) <=>
% 8.47/8.66 $false
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Negative definition of human_person
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0,X1] :
% 8.47/8.66 ( ~(human_person(X0,X1)) <=>
% 8.47/8.66 $false
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Negative definition of restaurant
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0,X1] :
% 8.47/8.66 ( ~(restaurant(X0,X1)) <=>
% 8.47/8.66 (
% 8.47/8.66 (
% 8.47/8.66 ( X0=sk2_esk9_0 )
% 8.47/8.66 &
% 8.47/8.66 ( X1!=sk2_esk8_1(sk2_esk9_0) )
% 8.47/8.66 )
% 8.47/8.66
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of in
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0,X1,X2] :
% 8.47/8.66 ( in(X0,X1,X2) <=>
% 8.47/8.66 $false
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Negative definition of customer
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 (! [X0,X1] :
% 8.47/8.66 ( ~(customer(X0,X1)) <=>
% 8.47/8.66 (
% 8.47/8.66 (
% 8.47/8.66 ( X0=sk2_esk1_0 )
% 8.47/8.66 )
% 8.47/8.66
% 8.47/8.66 |
% 8.47/8.66 (
% 8.47/8.66 ( X0=sk2_esk9_0 )
% 8.47/8.66 &
% 8.47/8.66 ( X1!=sk2_esk7_1(sk2_esk9_0) )
% 8.47/8.66 )
% 8.47/8.66
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP0_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP0_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP1_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP1_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP2_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP2_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP3_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP3_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP4_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP4_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP5_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP5_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP6_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP6_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP7_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP7_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP8_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP8_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP9_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP9_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP10_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP10_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP11_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP11_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP12_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP12_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP13_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP13_iProver_split <=>
% 8.47/8.66 $false
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP14_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP14_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP15_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP15_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP16_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP16_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP17_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP17_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP18_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP18_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP19_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP19_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP20_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP20_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP21_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP21_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP22_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP22_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP23_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP23_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP24_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP24_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP25_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP25_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP26_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP26_iProver_split <=>
% 8.47/8.66 $false
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66 %------ Positive definition of sP27_iProver_split
% 8.47/8.66 fof(lit_def,axiom,
% 8.47/8.66 ( sP27_iProver_split <=>
% 8.47/8.66 $true
% 8.47/8.66 )
% 8.47/8.66 ).
% 8.47/8.66
% 8.47/8.66
% 8.47/8.66
% 8.47/8.66 % ------ Statistics
% 8.47/8.66
% 8.47/8.66 % ------ General
% 8.47/8.66
% 8.47/8.66 % num_of_input_clauses: 360
% 8.47/8.66 % num_of_input_neg_conjectures: 360
% 8.47/8.66 % num_of_splits: 680
% 8.47/8.66 % num_of_split_atoms: 28
% 8.47/8.66 % num_of_sem_filtered_clauses: 0
% 8.47/8.66 % num_of_subtypes: 0
% 8.47/8.66 % monotx_restored_types: 0
% 8.47/8.66 % sat_num_of_epr_types: 0
% 8.47/8.66 % sat_num_of_non_cyclic_types: 0
% 8.47/8.66 % sat_guarded_non_collapsed_types: 0
% 8.47/8.66 % is_epr: 0
% 8.47/8.66 % is_horn: 0
% 8.47/8.66 % has_eq: 0
% 8.47/8.66 % num_pure_diseq_elim: 0
% 8.47/8.66 % simp_replaced_by: 0
% 8.47/8.66 % res_preprocessed: 1400
% 8.47/8.66 % prep_upred: 0
% 8.47/8.66 % prep_unflattend: 0
% 8.47/8.66 % pred_elim_cands: 28
% 8.47/8.66 % pred_elim: 0
% 8.47/8.66 % pred_elim_cl: 0
% 8.47/8.66 % pred_elim_cycles: 28
% 8.47/8.66 % forced_gc_time: 0
% 8.47/8.66 % gc_basic_clause_elim: 0
% 8.47/8.66 % parsing_time: 0.015
% 8.47/8.66 % sem_filter_time: 0.
% 8.47/8.66 % pred_elim_time: 0.144
% 8.47/8.66 % out_proof_time: 0.
% 8.47/8.66 % monotx_time: 0.
% 8.47/8.66 % subtype_inf_time: 0.
% 8.47/8.66 % unif_index_cands_time: 0.001
% 8.47/8.66 % unif_index_add_time: 0.002
% 8.47/8.66 % total_time: 3.989
% 8.47/8.66 % num_of_symbols: 80
% 8.47/8.66 % num_of_terms: 1268
% 8.47/8.66
% 8.47/8.66 % ------ Propositional Solver
% 8.47/8.66
% 8.47/8.66 % prop_solver_calls: 4
% 8.47/8.66 % prop_fast_solver_calls: 10562
% 8.47/8.66 % prop_num_of_clauses: 1710
% 8.47/8.66 % prop_preprocess_simplified: 9818
% 8.47/8.66 % prop_fo_subsumed: 0
% 8.47/8.66 % prop_solver_time: 0.
% 8.47/8.66 % prop_fast_solver_time: 0.007
% 8.47/8.66 % prop_unsat_core_time: 0.
% 8.47/8.66
% 8.47/8.66 % ------ QBF
% 8.47/8.66
% 8.47/8.66 % qbf_q_res: 0
% 8.47/8.66 % qbf_num_tautologies: 0
% 8.47/8.66 % qbf_prep_cycles: 0
% 8.47/8.66
% 8.47/8.66 % ------ BMC1
% 8.47/8.66
% 8.47/8.66 % bmc1_current_bound: -1
% 8.47/8.66 % bmc1_last_solved_bound: -1
% 8.47/8.66 % bmc1_unsat_core_size: -1
% 8.47/8.66 % bmc1_unsat_core_parents_size: -1
% 8.47/8.66 % bmc1_merge_next_fun: 0
% 8.47/8.66 % bmc1_unsat_core_clauses_time: 0.
% 8.47/8.66
% 8.47/8.66 % ------ Instantiation
% 8.47/8.66
% 8.47/8.66 % inst_num_of_clauses: 458
% 8.47/8.66 % inst_num_in_passive: 0
% 8.47/8.66 % inst_num_in_active: 456
% 8.47/8.66 % inst_num_in_unprocessed: 0
% 8.47/8.66 % inst_num_of_loops: 526
% 8.47/8.66 % inst_num_of_learning_restarts: 0
% 8.47/8.66 % inst_num_moves_active_passive: 61
% 8.47/8.66 % inst_lit_activity: 31
% 8.47/8.66 % inst_lit_activity_moves: 0
% 8.47/8.66 % inst_num_tautologies: 2
% 8.47/8.66 % inst_num_prop_implied: 0
% 8.47/8.66 % inst_num_existing_simplified: 0
% 8.47/8.66 % inst_num_eq_res_simplified: 0
% 8.47/8.66 % inst_num_child_elim: 0
% 8.47/8.66 % inst_num_of_dismatching_blockings: 2
% 8.47/8.66 % inst_num_of_non_proper_insts: 102
% 8.47/8.66 % inst_num_of_duplicates: 57
% 8.47/8.66 % inst_inst_num_from_inst_to_res: 0
% 8.47/8.66 % inst_dismatching_checking_time: 0.
% 8.47/8.66
% 8.47/8.66 % ------ Resolution
% 8.47/8.66
% 8.47/8.66 % res_num_of_clauses: 2489
% 8.47/8.66 % res_num_in_passive: 999
% 8.47/8.66 % res_num_in_active: 1539
% 8.47/8.66 % res_num_of_loops: 2000
% 8.47/8.66 % res_forward_subset_subsumed: 4140
% 8.47/8.66 % res_backward_subset_subsumed: 337
% 8.47/8.66 % res_forward_subsumed: 191
% 8.47/8.66 % res_backward_subsumed: 24
% 8.47/8.66 % res_forward_subsumption_resolution: 1562
% 8.47/8.66 % res_backward_subsumption_resolution: 0
% 8.47/8.66 % res_clause_to_clause_subsumption: 4189
% 8.47/8.66 % res_orphan_elimination: 0
% 8.47/8.66 % res_tautology_del: 360
% 8.47/8.66 % res_num_eq_res_simplified: 0
% 8.47/8.66 % res_num_sel_changes: 0
% 8.47/8.66 % res_moves_from_active_to_pass: 0
% 8.47/8.66
% 8.47/8.66 % Status Unknown
% 8.47/8.66 % Last status :
% 8.47/8.66 % SZS status Unknown
%------------------------------------------------------------------------------