TSTP Solution File: NLP065+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP065+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n009.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:39:15 EDT 2022
% Result : Unknown 3.20s 3.45s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NLP065+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 30 20:00:22 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.19/0.46 % Orienting using strategy Equiv(ClausalAll)
% 0.19/0.46 % FOF problem with conjecture
% 0.19/0.46 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_43dd01.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_6f2519.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_c273b3 | grep -v "SZS"
% 0.19/0.48
% 0.19/0.48 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.19/0.48
% 0.19/0.48 %
% 0.19/0.48 % ------ iProver source info
% 0.19/0.48
% 0.19/0.48 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.19/0.48 % git: non_committed_changes: true
% 0.19/0.48 % git: last_make_outside_of_git: true
% 0.19/0.48
% 0.19/0.48 %
% 0.19/0.48 % ------ Input Options
% 0.19/0.48
% 0.19/0.48 % --out_options all
% 0.19/0.48 % --tptp_safe_out true
% 0.19/0.48 % --problem_path ""
% 0.19/0.48 % --include_path ""
% 0.19/0.48 % --clausifier .//eprover
% 0.19/0.48 % --clausifier_options --tstp-format
% 0.19/0.48 % --stdin false
% 0.19/0.48 % --dbg_backtrace false
% 0.19/0.48 % --dbg_dump_prop_clauses false
% 0.19/0.48 % --dbg_dump_prop_clauses_file -
% 0.19/0.48 % --dbg_out_stat false
% 0.19/0.48
% 0.19/0.48 % ------ General Options
% 0.19/0.48
% 0.19/0.48 % --fof false
% 0.19/0.48 % --time_out_real 150.
% 0.19/0.48 % --time_out_prep_mult 0.2
% 0.19/0.48 % --time_out_virtual -1.
% 0.19/0.48 % --schedule none
% 0.19/0.48 % --ground_splitting input
% 0.19/0.48 % --splitting_nvd 16
% 0.19/0.48 % --non_eq_to_eq false
% 0.19/0.48 % --prep_gs_sim true
% 0.19/0.48 % --prep_unflatten false
% 0.19/0.48 % --prep_res_sim true
% 0.19/0.48 % --prep_upred true
% 0.19/0.48 % --res_sim_input true
% 0.19/0.48 % --clause_weak_htbl true
% 0.19/0.48 % --gc_record_bc_elim false
% 0.19/0.48 % --symbol_type_check false
% 0.19/0.48 % --clausify_out false
% 0.19/0.48 % --large_theory_mode false
% 0.19/0.48 % --prep_sem_filter none
% 0.19/0.48 % --prep_sem_filter_out false
% 0.19/0.48 % --preprocessed_out false
% 0.19/0.48 % --sub_typing false
% 0.19/0.48 % --brand_transform false
% 0.19/0.48 % --pure_diseq_elim true
% 0.19/0.48 % --min_unsat_core false
% 0.19/0.48 % --pred_elim true
% 0.19/0.48 % --add_important_lit false
% 0.19/0.48 % --soft_assumptions false
% 0.19/0.48 % --reset_solvers false
% 0.19/0.48 % --bc_imp_inh []
% 0.19/0.48 % --conj_cone_tolerance 1.5
% 0.19/0.48 % --prolific_symb_bound 500
% 0.19/0.48 % --lt_threshold 2000
% 0.19/0.48
% 0.19/0.48 % ------ SAT Options
% 0.19/0.48
% 0.19/0.48 % --sat_mode false
% 0.19/0.48 % --sat_fm_restart_options ""
% 0.19/0.48 % --sat_gr_def false
% 0.19/0.48 % --sat_epr_types true
% 0.19/0.48 % --sat_non_cyclic_types false
% 0.19/0.48 % --sat_finite_models false
% 0.19/0.48 % --sat_fm_lemmas false
% 0.19/0.48 % --sat_fm_prep false
% 0.19/0.48 % --sat_fm_uc_incr true
% 0.19/0.48 % --sat_out_model small
% 0.19/0.48 % --sat_out_clauses false
% 0.19/0.48
% 0.19/0.48 % ------ QBF Options
% 0.19/0.48
% 0.19/0.48 % --qbf_mode false
% 0.19/0.48 % --qbf_elim_univ true
% 0.19/0.48 % --qbf_sk_in true
% 0.19/0.48 % --qbf_pred_elim true
% 0.19/0.48 % --qbf_split 32
% 0.19/0.48
% 0.19/0.48 % ------ BMC1 Options
% 0.19/0.48
% 0.19/0.48 % --bmc1_incremental false
% 0.19/0.48 % --bmc1_axioms reachable_all
% 0.19/0.48 % --bmc1_min_bound 0
% 0.19/0.48 % --bmc1_max_bound -1
% 0.19/0.48 % --bmc1_max_bound_default -1
% 0.19/0.48 % --bmc1_symbol_reachability true
% 0.19/0.48 % --bmc1_property_lemmas false
% 0.19/0.48 % --bmc1_k_induction false
% 0.19/0.48 % --bmc1_non_equiv_states false
% 0.19/0.48 % --bmc1_deadlock false
% 0.19/0.48 % --bmc1_ucm false
% 0.19/0.48 % --bmc1_add_unsat_core none
% 0.19/0.48 % --bmc1_unsat_core_children false
% 0.19/0.48 % --bmc1_unsat_core_extrapolate_axioms false
% 0.19/0.48 % --bmc1_out_stat full
% 0.19/0.48 % --bmc1_ground_init false
% 0.19/0.48 % --bmc1_pre_inst_next_state false
% 0.19/0.48 % --bmc1_pre_inst_state false
% 0.19/0.48 % --bmc1_pre_inst_reach_state false
% 0.19/0.48 % --bmc1_out_unsat_core false
% 0.19/0.48 % --bmc1_aig_witness_out false
% 0.19/0.48 % --bmc1_verbose false
% 0.19/0.48 % --bmc1_dump_clauses_tptp false
% 0.74/0.95 % --bmc1_dump_unsat_core_tptp false
% 0.74/0.95 % --bmc1_dump_file -
% 0.74/0.95 % --bmc1_ucm_expand_uc_limit 128
% 0.74/0.95 % --bmc1_ucm_n_expand_iterations 6
% 0.74/0.95 % --bmc1_ucm_extend_mode 1
% 0.74/0.95 % --bmc1_ucm_init_mode 2
% 0.74/0.95 % --bmc1_ucm_cone_mode none
% 0.74/0.95 % --bmc1_ucm_reduced_relation_type 0
% 0.74/0.95 % --bmc1_ucm_relax_model 4
% 0.74/0.95 % --bmc1_ucm_full_tr_after_sat true
% 0.74/0.95 % --bmc1_ucm_expand_neg_assumptions false
% 0.74/0.95 % --bmc1_ucm_layered_model none
% 0.74/0.95 % --bmc1_ucm_max_lemma_size 10
% 0.74/0.95
% 0.74/0.95 % ------ AIG Options
% 0.74/0.95
% 0.74/0.95 % --aig_mode false
% 0.74/0.95
% 0.74/0.95 % ------ Instantiation Options
% 0.74/0.95
% 0.74/0.95 % --instantiation_flag true
% 0.74/0.95 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.74/0.95 % --inst_solver_per_active 750
% 0.74/0.95 % --inst_solver_calls_frac 0.5
% 0.74/0.95 % --inst_passive_queue_type priority_queues
% 0.74/0.95 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.74/0.95 % --inst_passive_queues_freq [25;2]
% 0.74/0.95 % --inst_dismatching true
% 0.74/0.95 % --inst_eager_unprocessed_to_passive true
% 0.74/0.95 % --inst_prop_sim_given true
% 0.74/0.95 % --inst_prop_sim_new false
% 0.74/0.95 % --inst_orphan_elimination true
% 0.74/0.95 % --inst_learning_loop_flag true
% 0.74/0.95 % --inst_learning_start 3000
% 0.74/0.95 % --inst_learning_factor 2
% 0.74/0.95 % --inst_start_prop_sim_after_learn 3
% 0.74/0.95 % --inst_sel_renew solver
% 0.74/0.95 % --inst_lit_activity_flag true
% 0.74/0.95 % --inst_out_proof true
% 0.74/0.95
% 0.74/0.95 % ------ Resolution Options
% 0.74/0.95
% 0.74/0.95 % --resolution_flag true
% 0.74/0.95 % --res_lit_sel kbo_max
% 0.74/0.95 % --res_to_prop_solver none
% 0.74/0.95 % --res_prop_simpl_new false
% 0.74/0.95 % --res_prop_simpl_given false
% 0.74/0.95 % --res_passive_queue_type priority_queues
% 0.74/0.95 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.74/0.95 % --res_passive_queues_freq [15;5]
% 0.74/0.95 % --res_forward_subs full
% 0.74/0.95 % --res_backward_subs full
% 0.74/0.95 % --res_forward_subs_resolution true
% 0.74/0.95 % --res_backward_subs_resolution true
% 0.74/0.95 % --res_orphan_elimination false
% 0.74/0.95 % --res_time_limit 1000.
% 0.74/0.95 % --res_out_proof true
% 0.74/0.95 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_43dd01.s
% 0.74/0.95 % --modulo true
% 0.74/0.95
% 0.74/0.95 % ------ Combination Options
% 0.74/0.95
% 0.74/0.95 % --comb_res_mult 1000
% 0.74/0.95 % --comb_inst_mult 300
% 0.74/0.95 % ------
% 0.74/0.95
% 0.74/0.95 % ------ Parsing...% successful
% 0.74/0.95
% 0.74/0.95 % ------ Preprocessing... gs_s sp: 988 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.74/0.95
% 0.74/0.95 % ------ Proving...
% 0.74/0.95 % ------ Problem Properties
% 0.74/0.95
% 0.74/0.95 %
% 0.74/0.95 % EPR false
% 0.74/0.95 % Horn false
% 0.74/0.95 % Has equality false
% 0.74/0.95
% 0.74/0.95 % % ------ Input Options Time Limit: Unbounded
% 0.74/0.95
% 0.74/0.95
% 0.74/0.95 % % ------ Current options:
% 0.74/0.95
% 0.74/0.95 % ------ Input Options
% 0.74/0.95
% 0.74/0.95 % --out_options all
% 0.74/0.95 % --tptp_safe_out true
% 0.74/0.95 % --problem_path ""
% 0.74/0.95 % --include_path ""
% 0.74/0.95 % --clausifier .//eprover
% 0.74/0.95 % --clausifier_options --tstp-format
% 0.74/0.95 % --stdin false
% 0.74/0.95 % --dbg_backtrace false
% 0.74/0.95 % --dbg_dump_prop_clauses false
% 0.74/0.95 % --dbg_dump_prop_clauses_file -
% 0.74/0.95 % --dbg_out_stat false
% 0.74/0.95
% 0.74/0.95 % ------ General Options
% 0.74/0.95
% 0.74/0.95 % --fof false
% 0.74/0.95 % --time_out_real 150.
% 0.74/0.95 % --time_out_prep_mult 0.2
% 0.74/0.95 % --time_out_virtual -1.
% 0.74/0.95 % --schedule none
% 0.74/0.95 % --ground_splitting input
% 0.74/0.95 % --splitting_nvd 16
% 0.74/0.95 % --non_eq_to_eq false
% 0.74/0.95 % --prep_gs_sim true
% 0.74/0.95 % --prep_unflatten false
% 0.74/0.95 % --prep_res_sim true
% 0.74/0.95 % --prep_upred true
% 0.74/0.95 % --res_sim_input true
% 0.74/0.95 % --clause_weak_htbl true
% 0.74/0.95 % --gc_record_bc_elim false
% 0.74/0.95 % --symbol_type_check false
% 0.74/0.95 % --clausify_out false
% 0.74/0.95 % --large_theory_mode false
% 0.74/0.95 % --prep_sem_filter none
% 0.74/0.95 % --prep_sem_filter_out false
% 0.74/0.95 % --preprocessed_out false
% 0.74/0.95 % --sub_typing false
% 0.74/0.95 % --brand_transform false
% 0.74/0.95 % --pure_diseq_elim true
% 0.74/0.95 % --min_unsat_core false
% 0.74/0.95 % --pred_elim true
% 0.74/0.95 % --add_important_lit false
% 0.74/0.95 % --soft_assumptions false
% 0.74/0.95 % --reset_solvers false
% 0.74/0.95 % --bc_imp_inh []
% 0.74/0.95 % --conj_cone_tolerance 1.5
% 0.74/0.95 % --prolific_symb_bound 500
% 0.74/0.95 % --lt_threshold 2000
% 0.74/0.95
% 0.74/0.95 % ------ SAT Options
% 0.74/0.95
% 0.74/0.95 % --sat_mode false
% 0.74/0.95 % --sat_fm_restart_options ""
% 0.74/0.95 % --sat_gr_def false
% 0.74/0.95 % --sat_epr_types true
% 0.74/0.95 % --sat_non_cyclic_types false
% 0.74/0.95 % --sat_finite_models false
% 0.74/0.95 % --sat_fm_lemmas false
% 0.74/0.95 % --sat_fm_prep false
% 0.74/0.95 % --sat_fm_uc_incr true
% 0.74/0.95 % --sat_out_model small
% 0.74/0.95 % --sat_out_clauses false
% 0.74/0.95
% 0.74/0.95 % ------ QBF Options
% 0.74/0.95
% 0.74/0.95 % --qbf_mode false
% 0.74/0.95 % --qbf_elim_univ true
% 0.74/0.95 % --qbf_sk_in true
% 0.74/0.95 % --qbf_pred_elim true
% 0.74/0.95 % --qbf_split 32
% 0.74/0.95
% 0.74/0.95 % ------ BMC1 Options
% 0.74/0.95
% 0.74/0.95 % --bmc1_incremental false
% 0.74/0.95 % --bmc1_axioms reachable_all
% 0.74/0.95 % --bmc1_min_bound 0
% 0.74/0.95 % --bmc1_max_bound -1
% 0.74/0.95 % --bmc1_max_bound_default -1
% 0.74/0.95 % --bmc1_symbol_reachability true
% 0.74/0.95 % --bmc1_property_lemmas false
% 0.74/0.95 % --bmc1_k_induction false
% 0.74/0.95 % --bmc1_non_equiv_states false
% 0.74/0.95 % --bmc1_deadlock false
% 0.74/0.95 % --bmc1_ucm false
% 0.74/0.95 % --bmc1_add_unsat_core none
% 0.74/0.95 % --bmc1_unsat_core_children false
% 0.74/0.95 % --bmc1_unsat_core_extrapolate_axioms false
% 0.74/0.95 % --bmc1_out_stat full
% 0.74/0.95 % --bmc1_ground_init false
% 0.74/0.95 % --bmc1_pre_inst_next_state false
% 0.74/0.95 % --bmc1_pre_inst_state false
% 0.74/0.95 % --bmc1_pre_inst_reach_state false
% 0.74/0.95 % --bmc1_out_unsat_core false
% 0.74/0.95 % --bmc1_aig_witness_out false
% 0.74/0.95 % --bmc1_verbose false
% 0.74/0.95 % --bmc1_dump_clauses_tptp false
% 0.74/0.95 % --bmc1_dump_unsat_core_tptp false
% 0.74/0.95 % --bmc1_dump_file -
% 0.74/0.95 % --bmc1_ucm_expand_uc_limit 128
% 0.74/0.95 % --bmc1_ucm_n_expand_iterations 6
% 0.74/0.95 % --bmc1_ucm_extend_mode 1
% 0.74/0.95 % --bmc1_ucm_init_mode 2
% 0.74/0.95 % --bmc1_ucm_cone_mode none
% 0.74/0.95 % --bmc1_ucm_reduced_relation_type 0
% 0.74/0.95 % --bmc1_ucm_relax_model 4
% 0.74/0.95 % --bmc1_ucm_full_tr_after_sat true
% 0.74/0.95 % --bmc1_ucm_expand_neg_assumptions false
% 0.74/0.95 % --bmc1_ucm_layered_model none
% 0.74/0.95 % --bmc1_ucm_max_lemma_size 10
% 0.74/0.95
% 0.74/0.95 % ------ AIG Options
% 0.74/0.95
% 0.74/0.95 % --aig_mode false
% 0.74/0.95
% 0.74/0.95 % ------ Instantiation Options
% 0.74/0.95
% 0.74/0.95 % --instantiation_flag true
% 0.74/0.95 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.74/0.95 % --inst_solver_per_active 750
% 0.74/0.95 % --inst_solver_calls_frac 0.5
% 0.74/0.95 % --inst_passive_queue_type priority_queues
% 0.74/0.95 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.74/0.95 % --inst_passive_queues_freq [25;2]
% 0.74/0.95 % --inst_dismatching true
% 0.74/0.95 % --inst_eager_unprocessed_to_passive true
% 0.74/0.95 % --inst_prop_sim_given true
% 1.71/1.97 % --inst_prop_sim_new false
% 1.71/1.97 % --inst_orphan_elimination true
% 1.71/1.97 % --inst_learning_loop_flag true
% 1.71/1.97 % --inst_learning_start 3000
% 1.71/1.97 % --inst_learning_factor 2
% 1.71/1.97 % --inst_start_prop_sim_after_learn 3
% 1.71/1.97 % --inst_sel_renew solver
% 1.71/1.97 % --inst_lit_activity_flag true
% 1.71/1.97 % --inst_out_proof true
% 1.71/1.97
% 1.71/1.97 % ------ Resolution Options
% 1.71/1.97
% 1.71/1.97 % --resolution_flag true
% 1.71/1.97 % --res_lit_sel kbo_max
% 1.71/1.97 % --res_to_prop_solver none
% 1.71/1.97 % --res_prop_simpl_new false
% 1.71/1.97 % --res_prop_simpl_given false
% 1.71/1.97 % --res_passive_queue_type priority_queues
% 1.71/1.97 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 1.71/1.97 % --res_passive_queues_freq [15;5]
% 1.71/1.97 % --res_forward_subs full
% 1.71/1.97 % --res_backward_subs full
% 1.71/1.97 % --res_forward_subs_resolution true
% 1.71/1.97 % --res_backward_subs_resolution true
% 1.71/1.97 % --res_orphan_elimination false
% 1.71/1.97 % --res_time_limit 1000.
% 1.71/1.97 % --res_out_proof true
% 1.71/1.97 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_43dd01.s
% 1.71/1.97 % --modulo true
% 1.71/1.97
% 1.71/1.97 % ------ Combination Options
% 1.71/1.97
% 1.71/1.97 % --comb_res_mult 1000
% 1.71/1.97 % --comb_inst_mult 300
% 1.71/1.97 % ------
% 1.71/1.97
% 1.71/1.97
% 1.71/1.97
% 1.71/1.97 % ------ Proving...
% 1.71/1.97 % warning: shown sat in sat incomplete mode
% 1.71/1.97 %
% 1.71/1.97
% 1.71/1.97
% 1.71/1.97 ------ Building Model...Done
% 1.71/1.97
% 1.71/1.97 %------ The model is defined over ground terms (initial term algebra).
% 1.71/1.97 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.71/1.97 %------ where \phi is a formula over the term algebra.
% 1.71/1.97 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.71/1.97 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.71/1.97 %------ See help for --sat_out_model for different model outputs.
% 1.71/1.97 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.71/1.97 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.71/1.97
% 1.71/1.97
% 1.71/1.97
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of actual_world
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0] :
% 1.71/1.97 ( actual_world(X0) <=>
% 1.71/1.97 (
% 1.71/1.97 (
% 1.71/1.97 ( X0=sk3_esk1_0 )
% 1.71/1.97 )
% 1.71/1.97
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of male
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1] :
% 1.71/1.97 ( male(X0,X1) <=>
% 1.71/1.97 (
% 1.71/1.97 (
% 1.71/1.97 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 1.71/1.97 )
% 1.71/1.97
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of from_loc
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1,X2] :
% 1.71/1.97 ( from_loc(X0,X1,X2) <=>
% 1.71/1.97 (
% 1.71/1.97 (
% 1.71/1.97 ( X0=sk3_esk1_0 & X1=sk3_esk6_1(sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) & X2=sk3_esk5_1(sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) )
% 1.71/1.97 )
% 1.71/1.97
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of fire
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1] :
% 1.71/1.97 ( fire(X0,X1) <=>
% 1.71/1.97 (
% 1.71/1.97 (
% 1.71/1.97 ( X0=sk3_esk1_0 & X1=sk3_esk6_1(sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) )
% 1.71/1.97 )
% 1.71/1.97
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Negative definition of nonreflexive
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1] :
% 1.71/1.97 ( ~(nonreflexive(X0,X1)) <=>
% 1.71/1.97 $false
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Negative definition of present
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1] :
% 1.71/1.97 ( ~(present(X0,X1)) <=>
% 1.71/1.97 $false
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of patient
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1,X2] :
% 1.71/1.97 ( patient(X0,X1,X2) <=>
% 1.71/1.97 (
% 1.71/1.97 (
% 1.71/1.97 ( X0=sk3_esk1_0 & X1=sk3_esk6_1(sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) & X2=sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) )
% 1.71/1.97 )
% 1.71/1.97
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Negative definition of agent
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1,X2] :
% 1.71/1.97 ( ~(agent(X0,X1,X2)) <=>
% 1.71/1.97 $false
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Negative definition of event
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1] :
% 1.71/1.97 ( ~(event(X0,X1)) <=>
% 1.71/1.97 $false
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of man
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1] :
% 1.71/1.97 ( man(X0,X1) <=>
% 1.71/1.97 (
% 1.71/1.97 (
% 1.71/1.97 ( X0=sk3_esk1_0 & X1=sk3_esk4_1(sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) )
% 1.71/1.97 )
% 1.71/1.97
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of six
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1] :
% 1.71/1.97 ( six(X0,X1) <=>
% 1.71/1.97 (
% 1.71/1.97 (
% 1.71/1.97 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 1.71/1.97 )
% 1.71/1.97
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Negative definition of group
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1] :
% 1.71/1.97 ( ~(group(X0,X1)) <=>
% 1.71/1.97 $false
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of shot
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1] :
% 1.71/1.97 ( shot(X0,X1) <=>
% 1.71/1.97 (
% 1.71/1.97 (
% 1.71/1.97 ( X0=sk3_esk1_0 & X1=sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) )
% 1.71/1.97 )
% 1.71/1.97
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Negative definition of cannon
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1] :
% 1.71/1.97 ( ~(cannon(X0,X1)) <=>
% 1.71/1.97 (
% 1.71/1.97 (
% 1.71/1.97 ( X0=sk3_esk10_0 )
% 1.71/1.97 )
% 1.71/1.97
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Negative definition of of
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1,X2] :
% 1.71/1.97 ( ~(of(X0,X1,X2)) <=>
% 1.71/1.97 $false
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of member
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 (! [X0,X1,X2] :
% 1.71/1.97 ( member(X0,X1,X2) <=>
% 1.71/1.97 (
% 1.71/1.97 (
% 1.71/1.97 ( X0=sk3_esk1_0 & X1=sk3_esk8_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) & X2=sk3_esk3_0 )
% 1.71/1.97 )
% 1.71/1.97
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of sP0_iProver_split
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 ( sP0_iProver_split <=>
% 1.71/1.97 $true
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of sP1_iProver_split
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 ( sP1_iProver_split <=>
% 1.71/1.97 $true
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of sP2_iProver_split
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 ( sP2_iProver_split <=>
% 1.71/1.97 $true
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of sP3_iProver_split
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 ( sP3_iProver_split <=>
% 1.71/1.97 $true
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of sP4_iProver_split
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 ( sP4_iProver_split <=>
% 1.71/1.97 $true
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of sP5_iProver_split
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 ( sP5_iProver_split <=>
% 1.71/1.97 $true
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of sP6_iProver_split
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 ( sP6_iProver_split <=>
% 1.71/1.97 $true
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of sP7_iProver_split
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 ( sP7_iProver_split <=>
% 1.71/1.97 $true
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of sP8_iProver_split
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 ( sP8_iProver_split <=>
% 1.71/1.97 $true
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of sP9_iProver_split
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 ( sP9_iProver_split <=>
% 1.71/1.97 $true
% 1.71/1.97 )
% 1.71/1.97 ).
% 1.71/1.97
% 1.71/1.97 %------ Positive definition of sP10_iProver_split
% 1.71/1.97 fof(lit_def,axiom,
% 1.71/1.97 ( sP10_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP11_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP11_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP12_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP12_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP13_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP13_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP14_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP14_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP15_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP15_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP16_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP16_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP17_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP17_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP18_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP18_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP19_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP19_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP20_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP20_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP21_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP21_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP22_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP22_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP23_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP23_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP24_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP24_iProver_split <=>
% 1.71/1.98 $false
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP25_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP25_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP26_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP26_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP27_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP27_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP28_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP28_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP29_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP29_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP30_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP30_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98 %------ Positive definition of sP31_iProver_split
% 1.71/1.98 fof(lit_def,axiom,
% 1.71/1.98 ( sP31_iProver_split <=>
% 1.71/1.98 $true
% 1.71/1.98 )
% 1.71/1.98 ).
% 1.71/1.98
% 1.71/1.98
% 1.71/1.98
% 1.71/1.98 % ------ Statistics
% 1.71/1.98
% 1.71/1.98 % ------ General
% 1.71/1.98
% 1.71/1.98 % num_of_input_clauses: 391
% 1.71/1.98 % num_of_input_neg_conjectures: 391
% 1.71/1.98 % num_of_splits: 988
% 1.71/1.98 % num_of_split_atoms: 32
% 1.71/1.98 % num_of_sem_filtered_clauses: 0
% 1.71/1.98 % num_of_subtypes: 0
% 1.71/1.98 % monotx_restored_types: 0
% 1.71/1.98 % sat_num_of_epr_types: 0
% 1.71/1.98 % sat_num_of_non_cyclic_types: 0
% 1.71/1.98 % sat_guarded_non_collapsed_types: 0
% 1.71/1.98 % is_epr: 0
% 1.71/1.98 % is_horn: 0
% 1.71/1.98 % has_eq: 0
% 1.71/1.98 % num_pure_diseq_elim: 0
% 1.71/1.98 % simp_replaced_by: 0
% 1.71/1.98 % res_preprocessed: 1770
% 1.71/1.98 % prep_upred: 0
% 1.71/1.98 % prep_unflattend: 0
% 1.71/1.98 % pred_elim_cands: 32
% 1.71/1.98 % pred_elim: 0
% 1.71/1.98 % pred_elim_cl: 0
% 1.71/1.98 % pred_elim_cycles: 32
% 1.71/1.98 % forced_gc_time: 0
% 1.71/1.98 % gc_basic_clause_elim: 0
% 1.71/1.98 % parsing_time: 0.042
% 1.71/1.98 % sem_filter_time: 0.
% 1.71/1.98 % pred_elim_time: 0.326
% 1.71/1.98 % out_proof_time: 0.
% 1.71/1.98 % monotx_time: 0.
% 1.71/1.98 % subtype_inf_time: 0.
% 1.71/1.98 % unif_index_cands_time: 0.
% 1.71/1.98 % unif_index_add_time: 0.001
% 1.71/1.98 % total_time: 1.51
% 1.71/1.98 % num_of_symbols: 89
% 1.71/1.98 % num_of_terms: 1451
% 1.71/1.98
% 1.71/1.98 % ------ Propositional Solver
% 1.71/1.98
% 1.71/1.98 % prop_solver_calls: 5
% 1.71/1.98 % prop_fast_solver_calls: 13164
% 1.71/1.98 % prop_num_of_clauses: 2437
% 1.71/1.98 % prop_preprocess_simplified: 11762
% 1.71/1.98 % prop_fo_subsumed: 0
% 1.71/1.98 % prop_solver_time: 0.
% 1.71/1.98 % prop_fast_solver_time: 0.01
% 1.71/1.98 % prop_unsat_core_time: 0.
% 1.71/1.98
% 1.71/1.98 % ------ QBF
% 1.71/1.98
% 1.71/1.98 % qbf_q_res: 0
% 1.71/1.98 % qbf_num_tautologies: 0
% 1.71/1.98 % qbf_prep_cycles: 0
% 1.71/1.98
% 1.71/1.98 % ------ BMC1
% 1.71/1.98
% 1.71/1.98 % bmc1_current_bound: -1
% 1.71/1.98 % bmc1_last_solved_bound: -1
% 1.71/1.98 % bmc1_unsat_core_size: -1
% 1.71/1.98 % bmc1_unsat_core_parents_size: -1
% 1.71/1.98 % bmc1_merge_next_fun: 0
% 1.71/1.98 % bmc1_unsat_core_clauses_time: 0.
% 1.71/1.98
% 1.71/1.98 % ------ Instantiation
% 1.71/1.98
% 1.71/1.98 % inst_num_of_clauses: 689
% 1.71/1.98 % inst_num_in_passive: 0
% 1.71/1.98 % inst_num_in_active: 689
% 1.71/1.98 % inst_num_in_unprocessed: 0
% 1.71/1.98 % inst_num_of_loops: 743
% 1.71/1.98 % inst_num_of_learning_restarts: 0
% 1.71/1.98 % inst_num_moves_active_passive: 44
% 1.71/1.98 % inst_lit_activity: 154
% 1.71/1.98 % inst_lit_activity_moves: 0
% 1.71/1.98 % inst_num_tautologies: 0
% 1.71/1.98 % inst_num_prop_implied: 0
% 1.71/1.98 % inst_num_existing_simplified: 0
% 1.71/1.98 % inst_num_eq_res_simplified: 0
% 1.71/1.98 % inst_num_child_elim: 0
% 1.71/1.98 % inst_num_of_dismatching_blockings: 0
% 1.71/1.98 % inst_num_of_non_proper_insts: 193
% 1.71/1.98 % inst_num_of_duplicates: 55
% 1.71/1.98 % inst_inst_num_from_inst_to_res: 0
% 1.71/1.98 % inst_dismatching_checking_time: 0.
% 1.71/1.98
% 1.71/1.98 % ------ Resolution
% 1.71/1.98
% 1.71/1.98 % res_num_of_clauses: 1790
% 1.71/1.98 % res_num_in_passive: 684
% 1.71/1.98 % res_num_in_active: 1126
% 1.71/1.98 % res_num_of_loops: 3000
% 1.71/1.98 % res_forward_subset_subsumed: 1198
% 1.71/1.98 % res_backward_subset_subsumed: 430
% 1.71/1.98 % res_forward_subsumed: 1830
% 1.71/1.98 % res_backward_subsumed: 6
% 1.71/1.98 % res_forward_subsumption_resolution: 815
% 1.71/1.98 % res_backward_subsumption_resolution: 0
% 1.71/1.98 % res_clause_to_clause_subsumption: 4265
% 1.71/1.98 % res_orphan_elimination: 0
% 1.71/1.98 % res_tautology_del: 459
% 1.71/1.98 % res_num_eq_res_simplified: 0
% 1.71/1.98 % res_num_sel_changes: 0
% 1.71/1.98 % res_moves_from_active_to_pass: 0
% 1.71/1.98
% 1.71/1.98 % Status Unknown
% 1.81/2.06 % Orienting using strategy ClausalAll
% 1.81/2.06 % FOF problem with conjecture
% 1.81/2.06 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_43dd01.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_6f2519.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_168726 | grep -v "SZS"
% 1.81/2.08
% 1.81/2.08 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 1.81/2.08
% 1.81/2.08 %
% 1.81/2.08 % ------ iProver source info
% 1.81/2.08
% 1.81/2.08 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 1.81/2.08 % git: non_committed_changes: true
% 1.81/2.08 % git: last_make_outside_of_git: true
% 1.81/2.08
% 1.81/2.08 %
% 1.81/2.08 % ------ Input Options
% 1.81/2.08
% 1.81/2.08 % --out_options all
% 1.81/2.08 % --tptp_safe_out true
% 1.81/2.08 % --problem_path ""
% 1.81/2.08 % --include_path ""
% 1.81/2.08 % --clausifier .//eprover
% 1.81/2.08 % --clausifier_options --tstp-format
% 1.81/2.08 % --stdin false
% 1.81/2.08 % --dbg_backtrace false
% 1.81/2.08 % --dbg_dump_prop_clauses false
% 1.81/2.08 % --dbg_dump_prop_clauses_file -
% 1.81/2.08 % --dbg_out_stat false
% 1.81/2.08
% 1.81/2.08 % ------ General Options
% 1.81/2.08
% 1.81/2.08 % --fof false
% 1.81/2.08 % --time_out_real 150.
% 1.81/2.08 % --time_out_prep_mult 0.2
% 1.81/2.08 % --time_out_virtual -1.
% 1.81/2.08 % --schedule none
% 1.81/2.08 % --ground_splitting input
% 1.81/2.08 % --splitting_nvd 16
% 1.81/2.08 % --non_eq_to_eq false
% 1.81/2.08 % --prep_gs_sim true
% 1.81/2.08 % --prep_unflatten false
% 1.81/2.08 % --prep_res_sim true
% 1.81/2.08 % --prep_upred true
% 1.81/2.08 % --res_sim_input true
% 1.81/2.08 % --clause_weak_htbl true
% 1.81/2.08 % --gc_record_bc_elim false
% 1.81/2.08 % --symbol_type_check false
% 1.81/2.08 % --clausify_out false
% 1.81/2.08 % --large_theory_mode false
% 1.81/2.08 % --prep_sem_filter none
% 1.81/2.08 % --prep_sem_filter_out false
% 1.81/2.08 % --preprocessed_out false
% 1.81/2.08 % --sub_typing false
% 1.81/2.08 % --brand_transform false
% 1.81/2.08 % --pure_diseq_elim true
% 1.81/2.08 % --min_unsat_core false
% 1.81/2.08 % --pred_elim true
% 1.81/2.08 % --add_important_lit false
% 1.81/2.08 % --soft_assumptions false
% 1.81/2.08 % --reset_solvers false
% 1.81/2.08 % --bc_imp_inh []
% 1.81/2.08 % --conj_cone_tolerance 1.5
% 1.81/2.08 % --prolific_symb_bound 500
% 1.81/2.08 % --lt_threshold 2000
% 1.81/2.08
% 1.81/2.08 % ------ SAT Options
% 1.81/2.08
% 1.81/2.08 % --sat_mode false
% 1.81/2.08 % --sat_fm_restart_options ""
% 1.81/2.08 % --sat_gr_def false
% 1.81/2.08 % --sat_epr_types true
% 1.81/2.08 % --sat_non_cyclic_types false
% 1.81/2.08 % --sat_finite_models false
% 1.81/2.08 % --sat_fm_lemmas false
% 1.81/2.08 % --sat_fm_prep false
% 1.81/2.08 % --sat_fm_uc_incr true
% 1.81/2.08 % --sat_out_model small
% 1.81/2.08 % --sat_out_clauses false
% 1.81/2.08
% 1.81/2.08 % ------ QBF Options
% 1.81/2.08
% 1.81/2.08 % --qbf_mode false
% 1.81/2.08 % --qbf_elim_univ true
% 1.81/2.08 % --qbf_sk_in true
% 1.81/2.08 % --qbf_pred_elim true
% 1.81/2.08 % --qbf_split 32
% 1.81/2.08
% 1.81/2.08 % ------ BMC1 Options
% 1.81/2.08
% 1.81/2.08 % --bmc1_incremental false
% 1.81/2.08 % --bmc1_axioms reachable_all
% 1.81/2.08 % --bmc1_min_bound 0
% 1.81/2.08 % --bmc1_max_bound -1
% 1.81/2.08 % --bmc1_max_bound_default -1
% 1.81/2.08 % --bmc1_symbol_reachability true
% 1.81/2.08 % --bmc1_property_lemmas false
% 1.81/2.08 % --bmc1_k_induction false
% 1.81/2.08 % --bmc1_non_equiv_states false
% 1.81/2.08 % --bmc1_deadlock false
% 1.81/2.08 % --bmc1_ucm false
% 1.81/2.08 % --bmc1_add_unsat_core none
% 1.81/2.08 % --bmc1_unsat_core_children false
% 1.81/2.08 % --bmc1_unsat_core_extrapolate_axioms false
% 1.81/2.08 % --bmc1_out_stat full
% 1.81/2.08 % --bmc1_ground_init false
% 1.81/2.08 % --bmc1_pre_inst_next_state false
% 1.81/2.08 % --bmc1_pre_inst_state false
% 1.81/2.08 % --bmc1_pre_inst_reach_state false
% 1.81/2.08 % --bmc1_out_unsat_core false
% 1.81/2.08 % --bmc1_aig_witness_out false
% 1.81/2.08 % --bmc1_verbose false
% 1.81/2.08 % --bmc1_dump_clauses_tptp false
% 2.22/2.40 % --bmc1_dump_unsat_core_tptp false
% 2.22/2.40 % --bmc1_dump_file -
% 2.22/2.40 % --bmc1_ucm_expand_uc_limit 128
% 2.22/2.40 % --bmc1_ucm_n_expand_iterations 6
% 2.22/2.40 % --bmc1_ucm_extend_mode 1
% 2.22/2.40 % --bmc1_ucm_init_mode 2
% 2.22/2.40 % --bmc1_ucm_cone_mode none
% 2.22/2.40 % --bmc1_ucm_reduced_relation_type 0
% 2.22/2.40 % --bmc1_ucm_relax_model 4
% 2.22/2.40 % --bmc1_ucm_full_tr_after_sat true
% 2.22/2.40 % --bmc1_ucm_expand_neg_assumptions false
% 2.22/2.40 % --bmc1_ucm_layered_model none
% 2.22/2.40 % --bmc1_ucm_max_lemma_size 10
% 2.22/2.40
% 2.22/2.40 % ------ AIG Options
% 2.22/2.40
% 2.22/2.40 % --aig_mode false
% 2.22/2.40
% 2.22/2.40 % ------ Instantiation Options
% 2.22/2.40
% 2.22/2.40 % --instantiation_flag true
% 2.22/2.40 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.22/2.40 % --inst_solver_per_active 750
% 2.22/2.40 % --inst_solver_calls_frac 0.5
% 2.22/2.40 % --inst_passive_queue_type priority_queues
% 2.22/2.40 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.22/2.40 % --inst_passive_queues_freq [25;2]
% 2.22/2.40 % --inst_dismatching true
% 2.22/2.40 % --inst_eager_unprocessed_to_passive true
% 2.22/2.40 % --inst_prop_sim_given true
% 2.22/2.40 % --inst_prop_sim_new false
% 2.22/2.40 % --inst_orphan_elimination true
% 2.22/2.40 % --inst_learning_loop_flag true
% 2.22/2.40 % --inst_learning_start 3000
% 2.22/2.40 % --inst_learning_factor 2
% 2.22/2.40 % --inst_start_prop_sim_after_learn 3
% 2.22/2.40 % --inst_sel_renew solver
% 2.22/2.40 % --inst_lit_activity_flag true
% 2.22/2.40 % --inst_out_proof true
% 2.22/2.40
% 2.22/2.40 % ------ Resolution Options
% 2.22/2.40
% 2.22/2.40 % --resolution_flag true
% 2.22/2.40 % --res_lit_sel kbo_max
% 2.22/2.40 % --res_to_prop_solver none
% 2.22/2.40 % --res_prop_simpl_new false
% 2.22/2.40 % --res_prop_simpl_given false
% 2.22/2.40 % --res_passive_queue_type priority_queues
% 2.22/2.40 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.22/2.40 % --res_passive_queues_freq [15;5]
% 2.22/2.40 % --res_forward_subs full
% 2.22/2.40 % --res_backward_subs full
% 2.22/2.40 % --res_forward_subs_resolution true
% 2.22/2.40 % --res_backward_subs_resolution true
% 2.22/2.40 % --res_orphan_elimination false
% 2.22/2.40 % --res_time_limit 1000.
% 2.22/2.40 % --res_out_proof true
% 2.22/2.40 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_43dd01.s
% 2.22/2.40 % --modulo true
% 2.22/2.40
% 2.22/2.40 % ------ Combination Options
% 2.22/2.40
% 2.22/2.40 % --comb_res_mult 1000
% 2.22/2.40 % --comb_inst_mult 300
% 2.22/2.40 % ------
% 2.22/2.40
% 2.22/2.40 % ------ Parsing...% successful
% 2.22/2.40
% 2.22/2.40 % ------ Preprocessing... gs_s sp: 988 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 2.22/2.40
% 2.22/2.40 % ------ Proving...
% 2.22/2.40 % ------ Problem Properties
% 2.22/2.40
% 2.22/2.40 %
% 2.22/2.40 % EPR false
% 2.22/2.40 % Horn false
% 2.22/2.40 % Has equality false
% 2.22/2.40
% 2.22/2.40 % % ------ Input Options Time Limit: Unbounded
% 2.22/2.40
% 2.22/2.40
% 2.22/2.40 % % ------ Current options:
% 2.22/2.40
% 2.22/2.40 % ------ Input Options
% 2.22/2.40
% 2.22/2.40 % --out_options all
% 2.22/2.40 % --tptp_safe_out true
% 2.22/2.40 % --problem_path ""
% 2.22/2.40 % --include_path ""
% 2.22/2.40 % --clausifier .//eprover
% 2.22/2.40 % --clausifier_options --tstp-format
% 2.22/2.40 % --stdin false
% 2.22/2.40 % --dbg_backtrace false
% 2.22/2.40 % --dbg_dump_prop_clauses false
% 2.22/2.40 % --dbg_dump_prop_clauses_file -
% 2.22/2.40 % --dbg_out_stat false
% 2.22/2.40
% 2.22/2.40 % ------ General Options
% 2.22/2.40
% 2.22/2.40 % --fof false
% 2.22/2.40 % --time_out_real 150.
% 2.22/2.40 % --time_out_prep_mult 0.2
% 2.22/2.40 % --time_out_virtual -1.
% 2.22/2.40 % --schedule none
% 2.22/2.40 % --ground_splitting input
% 2.22/2.40 % --splitting_nvd 16
% 2.22/2.40 % --non_eq_to_eq false
% 2.22/2.40 % --prep_gs_sim true
% 2.22/2.40 % --prep_unflatten false
% 2.22/2.40 % --prep_res_sim true
% 2.22/2.40 % --prep_upred true
% 2.22/2.40 % --res_sim_input true
% 2.22/2.40 % --clause_weak_htbl true
% 2.22/2.40 % --gc_record_bc_elim false
% 2.22/2.40 % --symbol_type_check false
% 2.22/2.40 % --clausify_out false
% 2.22/2.40 % --large_theory_mode false
% 2.22/2.40 % --prep_sem_filter none
% 2.22/2.40 % --prep_sem_filter_out false
% 2.22/2.40 % --preprocessed_out false
% 2.22/2.40 % --sub_typing false
% 2.22/2.40 % --brand_transform false
% 2.22/2.40 % --pure_diseq_elim true
% 2.22/2.40 % --min_unsat_core false
% 2.22/2.40 % --pred_elim true
% 2.22/2.40 % --add_important_lit false
% 2.22/2.40 % --soft_assumptions false
% 2.22/2.40 % --reset_solvers false
% 2.22/2.40 % --bc_imp_inh []
% 2.22/2.40 % --conj_cone_tolerance 1.5
% 2.22/2.40 % --prolific_symb_bound 500
% 2.22/2.40 % --lt_threshold 2000
% 2.22/2.40
% 2.22/2.40 % ------ SAT Options
% 2.22/2.40
% 2.22/2.40 % --sat_mode false
% 2.22/2.40 % --sat_fm_restart_options ""
% 2.22/2.40 % --sat_gr_def false
% 2.22/2.40 % --sat_epr_types true
% 2.22/2.40 % --sat_non_cyclic_types false
% 2.22/2.40 % --sat_finite_models false
% 2.22/2.40 % --sat_fm_lemmas false
% 2.22/2.40 % --sat_fm_prep false
% 2.22/2.40 % --sat_fm_uc_incr true
% 2.22/2.40 % --sat_out_model small
% 2.22/2.40 % --sat_out_clauses false
% 2.22/2.40
% 2.22/2.40 % ------ QBF Options
% 2.22/2.40
% 2.22/2.40 % --qbf_mode false
% 2.22/2.40 % --qbf_elim_univ true
% 2.22/2.40 % --qbf_sk_in true
% 2.22/2.40 % --qbf_pred_elim true
% 2.22/2.40 % --qbf_split 32
% 2.22/2.40
% 2.22/2.40 % ------ BMC1 Options
% 2.22/2.40
% 2.22/2.40 % --bmc1_incremental false
% 2.22/2.40 % --bmc1_axioms reachable_all
% 2.22/2.40 % --bmc1_min_bound 0
% 2.22/2.40 % --bmc1_max_bound -1
% 2.22/2.40 % --bmc1_max_bound_default -1
% 2.22/2.40 % --bmc1_symbol_reachability true
% 2.22/2.40 % --bmc1_property_lemmas false
% 2.22/2.40 % --bmc1_k_induction false
% 2.22/2.40 % --bmc1_non_equiv_states false
% 2.22/2.40 % --bmc1_deadlock false
% 2.22/2.40 % --bmc1_ucm false
% 2.22/2.40 % --bmc1_add_unsat_core none
% 2.22/2.40 % --bmc1_unsat_core_children false
% 2.22/2.40 % --bmc1_unsat_core_extrapolate_axioms false
% 2.22/2.40 % --bmc1_out_stat full
% 2.22/2.40 % --bmc1_ground_init false
% 2.22/2.40 % --bmc1_pre_inst_next_state false
% 2.22/2.40 % --bmc1_pre_inst_state false
% 2.22/2.40 % --bmc1_pre_inst_reach_state false
% 2.22/2.40 % --bmc1_out_unsat_core false
% 2.22/2.40 % --bmc1_aig_witness_out false
% 2.22/2.40 % --bmc1_verbose false
% 2.22/2.40 % --bmc1_dump_clauses_tptp false
% 2.22/2.40 % --bmc1_dump_unsat_core_tptp false
% 2.22/2.40 % --bmc1_dump_file -
% 2.22/2.40 % --bmc1_ucm_expand_uc_limit 128
% 2.22/2.40 % --bmc1_ucm_n_expand_iterations 6
% 2.22/2.40 % --bmc1_ucm_extend_mode 1
% 2.22/2.40 % --bmc1_ucm_init_mode 2
% 2.22/2.40 % --bmc1_ucm_cone_mode none
% 2.22/2.40 % --bmc1_ucm_reduced_relation_type 0
% 2.22/2.40 % --bmc1_ucm_relax_model 4
% 2.22/2.40 % --bmc1_ucm_full_tr_after_sat true
% 2.22/2.40 % --bmc1_ucm_expand_neg_assumptions false
% 2.22/2.40 % --bmc1_ucm_layered_model none
% 2.22/2.40 % --bmc1_ucm_max_lemma_size 10
% 2.22/2.40
% 2.22/2.40 % ------ AIG Options
% 2.22/2.40
% 2.22/2.40 % --aig_mode false
% 2.22/2.40
% 2.22/2.40 % ------ Instantiation Options
% 2.22/2.40
% 2.22/2.40 % --instantiation_flag true
% 2.22/2.40 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 2.22/2.40 % --inst_solver_per_active 750
% 2.22/2.40 % --inst_solver_calls_frac 0.5
% 2.22/2.40 % --inst_passive_queue_type priority_queues
% 2.22/2.40 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 2.22/2.40 % --inst_passive_queues_freq [25;2]
% 2.22/2.40 % --inst_dismatching true
% 2.22/2.40 % --inst_eager_unprocessed_to_passive true
% 2.22/2.40 % --inst_prop_sim_given true
% 3.20/3.45 % --inst_prop_sim_new false
% 3.20/3.45 % --inst_orphan_elimination true
% 3.20/3.45 % --inst_learning_loop_flag true
% 3.20/3.45 % --inst_learning_start 3000
% 3.20/3.45 % --inst_learning_factor 2
% 3.20/3.45 % --inst_start_prop_sim_after_learn 3
% 3.20/3.45 % --inst_sel_renew solver
% 3.20/3.45 % --inst_lit_activity_flag true
% 3.20/3.45 % --inst_out_proof true
% 3.20/3.45
% 3.20/3.45 % ------ Resolution Options
% 3.20/3.45
% 3.20/3.45 % --resolution_flag true
% 3.20/3.45 % --res_lit_sel kbo_max
% 3.20/3.45 % --res_to_prop_solver none
% 3.20/3.45 % --res_prop_simpl_new false
% 3.20/3.45 % --res_prop_simpl_given false
% 3.20/3.45 % --res_passive_queue_type priority_queues
% 3.20/3.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.20/3.45 % --res_passive_queues_freq [15;5]
% 3.20/3.45 % --res_forward_subs full
% 3.20/3.45 % --res_backward_subs full
% 3.20/3.45 % --res_forward_subs_resolution true
% 3.20/3.45 % --res_backward_subs_resolution true
% 3.20/3.45 % --res_orphan_elimination false
% 3.20/3.45 % --res_time_limit 1000.
% 3.20/3.45 % --res_out_proof true
% 3.20/3.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_43dd01.s
% 3.20/3.45 % --modulo true
% 3.20/3.45
% 3.20/3.45 % ------ Combination Options
% 3.20/3.45
% 3.20/3.45 % --comb_res_mult 1000
% 3.20/3.45 % --comb_inst_mult 300
% 3.20/3.45 % ------
% 3.20/3.45
% 3.20/3.45
% 3.20/3.45
% 3.20/3.45 % ------ Proving...
% 3.20/3.45 % warning: shown sat in sat incomplete mode
% 3.20/3.45 %
% 3.20/3.45
% 3.20/3.45
% 3.20/3.45 ------ Building Model...Done
% 3.20/3.45
% 3.20/3.45 %------ The model is defined over ground terms (initial term algebra).
% 3.20/3.45 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.20/3.45 %------ where \phi is a formula over the term algebra.
% 3.20/3.45 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.20/3.45 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.20/3.45 %------ See help for --sat_out_model for different model outputs.
% 3.20/3.45 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.20/3.45 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.20/3.45
% 3.20/3.45
% 3.20/3.45
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of actual_world
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0] :
% 3.20/3.45 ( actual_world(X0) <=>
% 3.20/3.45 (
% 3.20/3.45 (
% 3.20/3.45 ( X0=sk2_esk1_0 )
% 3.20/3.45 )
% 3.20/3.45
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of male
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1] :
% 3.20/3.45 ( male(X0,X1) <=>
% 3.20/3.45 (
% 3.20/3.45 (
% 3.20/3.45 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 3.20/3.45 )
% 3.20/3.45
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of from_loc
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1,X2] :
% 3.20/3.45 ( from_loc(X0,X1,X2) <=>
% 3.20/3.45 (
% 3.20/3.45 (
% 3.20/3.45 ( X0=sk2_esk1_0 & X1=sk2_esk6_1(sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) & X2=sk2_esk5_1(sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) )
% 3.20/3.45 )
% 3.20/3.45
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of fire
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1] :
% 3.20/3.45 ( fire(X0,X1) <=>
% 3.20/3.45 (
% 3.20/3.45 (
% 3.20/3.45 ( X0=sk2_esk1_0 & X1=sk2_esk6_1(sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) )
% 3.20/3.45 )
% 3.20/3.45
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Negative definition of nonreflexive
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1] :
% 3.20/3.45 ( ~(nonreflexive(X0,X1)) <=>
% 3.20/3.45 $false
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Negative definition of present
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1] :
% 3.20/3.45 ( ~(present(X0,X1)) <=>
% 3.20/3.45 $false
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of patient
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1,X2] :
% 3.20/3.45 ( patient(X0,X1,X2) <=>
% 3.20/3.45 (
% 3.20/3.45 (
% 3.20/3.45 ( X0=sk2_esk1_0 & X1=sk2_esk6_1(sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) & X2=sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0) )
% 3.20/3.45 )
% 3.20/3.45
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Negative definition of agent
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1,X2] :
% 3.20/3.45 ( ~(agent(X0,X1,X2)) <=>
% 3.20/3.45 $false
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Negative definition of event
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1] :
% 3.20/3.45 ( ~(event(X0,X1)) <=>
% 3.20/3.45 $false
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of man
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1] :
% 3.20/3.45 ( man(X0,X1) <=>
% 3.20/3.45 (
% 3.20/3.45 (
% 3.20/3.45 ( X0=sk2_esk1_0 & X1=sk2_esk4_1(sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) )
% 3.20/3.45 )
% 3.20/3.45
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of six
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1] :
% 3.20/3.45 ( six(X0,X1) <=>
% 3.20/3.45 (
% 3.20/3.45 (
% 3.20/3.45 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 3.20/3.45 )
% 3.20/3.45
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Negative definition of group
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1] :
% 3.20/3.45 ( ~(group(X0,X1)) <=>
% 3.20/3.45 $false
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of shot
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1] :
% 3.20/3.45 ( shot(X0,X1) <=>
% 3.20/3.45 (
% 3.20/3.45 (
% 3.20/3.45 ( X0=sk2_esk1_0 & X1=sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0) )
% 3.20/3.45 )
% 3.20/3.45
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Negative definition of cannon
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1] :
% 3.20/3.45 ( ~(cannon(X0,X1)) <=>
% 3.20/3.45 (
% 3.20/3.45 (
% 3.20/3.45 ( X0=sk2_esk10_0 )
% 3.20/3.45 )
% 3.20/3.45
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Negative definition of of
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1,X2] :
% 3.20/3.45 ( ~(of(X0,X1,X2)) <=>
% 3.20/3.45 $false
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of member
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 (! [X0,X1,X2] :
% 3.20/3.45 ( member(X0,X1,X2) <=>
% 3.20/3.45 (
% 3.20/3.45 (
% 3.20/3.45 ( X0=sk2_esk1_0 & X1=sk2_esk8_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0) & X2=sk2_esk3_0 )
% 3.20/3.45 )
% 3.20/3.45
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP0_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP0_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP1_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP1_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP2_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP2_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP3_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP3_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP4_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP4_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP5_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP5_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP6_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP6_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP7_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP7_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP8_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP8_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP9_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP9_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP10_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP10_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP11_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP11_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP12_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP12_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP13_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP13_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP14_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP14_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP15_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP15_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP16_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP16_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP17_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP17_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP18_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP18_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP19_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP19_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP20_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP20_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP21_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP21_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP22_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP22_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP23_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP23_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP24_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP24_iProver_split <=>
% 3.20/3.45 $false
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP25_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP25_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP26_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP26_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP27_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP27_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP28_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP28_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP29_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP29_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP30_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP30_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45 %------ Positive definition of sP31_iProver_split
% 3.20/3.45 fof(lit_def,axiom,
% 3.20/3.45 ( sP31_iProver_split <=>
% 3.20/3.45 $true
% 3.20/3.45 )
% 3.20/3.45 ).
% 3.20/3.45
% 3.20/3.45
% 3.20/3.45
% 3.20/3.45 % ------ Statistics
% 3.20/3.45
% 3.20/3.45 % ------ General
% 3.20/3.45
% 3.20/3.45 % num_of_input_clauses: 391
% 3.20/3.45 % num_of_input_neg_conjectures: 391
% 3.20/3.45 % num_of_splits: 988
% 3.20/3.45 % num_of_split_atoms: 32
% 3.20/3.45 % num_of_sem_filtered_clauses: 0
% 3.20/3.45 % num_of_subtypes: 0
% 3.20/3.45 % monotx_restored_types: 0
% 3.20/3.45 % sat_num_of_epr_types: 0
% 3.20/3.45 % sat_num_of_non_cyclic_types: 0
% 3.20/3.45 % sat_guarded_non_collapsed_types: 0
% 3.20/3.45 % is_epr: 0
% 3.20/3.45 % is_horn: 0
% 3.20/3.45 % has_eq: 0
% 3.20/3.45 % num_pure_diseq_elim: 0
% 3.20/3.45 % simp_replaced_by: 0
% 3.20/3.45 % res_preprocessed: 1770
% 3.20/3.45 % prep_upred: 0
% 3.20/3.45 % prep_unflattend: 0
% 3.20/3.45 % pred_elim_cands: 32
% 3.20/3.45 % pred_elim: 0
% 3.20/3.45 % pred_elim_cl: 0
% 3.20/3.45 % pred_elim_cycles: 32
% 3.20/3.45 % forced_gc_time: 0
% 3.20/3.45 % gc_basic_clause_elim: 0
% 3.20/3.45 % parsing_time: 0.019
% 3.20/3.45 % sem_filter_time: 0.
% 3.20/3.45 % pred_elim_time: 0.244
% 3.20/3.45 % out_proof_time: 0.
% 3.20/3.45 % monotx_time: 0.
% 3.20/3.45 % subtype_inf_time: 0.
% 3.20/3.45 % unif_index_cands_time: 0.
% 3.20/3.45 % unif_index_add_time: 0.001
% 3.20/3.45 % total_time: 1.378
% 3.20/3.45 % num_of_symbols: 89
% 3.20/3.45 % num_of_terms: 1451
% 3.20/3.45
% 3.20/3.45 % ------ Propositional Solver
% 3.20/3.45
% 3.20/3.45 % prop_solver_calls: 5
% 3.20/3.45 % prop_fast_solver_calls: 13164
% 3.20/3.45 % prop_num_of_clauses: 2437
% 3.20/3.45 % prop_preprocess_simplified: 11762
% 3.20/3.45 % prop_fo_subsumed: 0
% 3.20/3.45 % prop_solver_time: 0.
% 3.20/3.45 % prop_fast_solver_time: 0.007
% 3.20/3.45 % prop_unsat_core_time: 0.
% 3.20/3.45
% 3.20/3.45 % ------ QBF
% 3.20/3.45
% 3.20/3.45 % qbf_q_res: 0
% 3.20/3.45 % qbf_num_tautologies: 0
% 3.20/3.45 % qbf_prep_cycles: 0
% 3.20/3.45
% 3.20/3.45 % ------ BMC1
% 3.20/3.45
% 3.20/3.45 % bmc1_current_bound: -1
% 3.20/3.45 % bmc1_last_solved_bound: -1
% 3.20/3.45 % bmc1_unsat_core_size: -1
% 3.20/3.45 % bmc1_unsat_core_parents_size: -1
% 3.20/3.45 % bmc1_merge_next_fun: 0
% 3.20/3.45 % bmc1_unsat_core_clauses_time: 0.
% 3.20/3.45
% 3.20/3.45 % ------ Instantiation
% 3.20/3.45
% 3.20/3.45 % inst_num_of_clauses: 689
% 3.20/3.45 % inst_num_in_passive: 0
% 3.20/3.45 % inst_num_in_active: 689
% 3.20/3.45 % inst_num_in_unprocessed: 0
% 3.20/3.45 % inst_num_of_loops: 743
% 3.20/3.45 % inst_num_of_learning_restarts: 0
% 3.20/3.45 % inst_num_moves_active_passive: 44
% 3.20/3.45 % inst_lit_activity: 154
% 3.20/3.45 % inst_lit_activity_moves: 0
% 3.20/3.45 % inst_num_tautologies: 0
% 3.20/3.45 % inst_num_prop_implied: 0
% 3.20/3.45 % inst_num_existing_simplified: 0
% 3.20/3.45 % inst_num_eq_res_simplified: 0
% 3.20/3.45 % inst_num_child_elim: 0
% 3.20/3.45 % inst_num_of_dismatching_blockings: 0
% 3.20/3.45 % inst_num_of_non_proper_insts: 193
% 3.20/3.45 % inst_num_of_duplicates: 55
% 3.20/3.45 % inst_inst_num_from_inst_to_res: 0
% 3.20/3.45 % inst_dismatching_checking_time: 0.
% 3.20/3.45
% 3.20/3.45 % ------ Resolution
% 3.20/3.45
% 3.20/3.45 % res_num_of_clauses: 1790
% 3.20/3.45 % res_num_in_passive: 684
% 3.20/3.45 % res_num_in_active: 1126
% 3.20/3.45 % res_num_of_loops: 3000
% 3.20/3.45 % res_forward_subset_subsumed: 1198
% 3.20/3.45 % res_backward_subset_subsumed: 430
% 3.20/3.45 % res_forward_subsumed: 1830
% 3.20/3.45 % res_backward_subsumed: 6
% 3.20/3.45 % res_forward_subsumption_resolution: 815
% 3.20/3.45 % res_backward_subsumption_resolution: 0
% 3.20/3.45 % res_clause_to_clause_subsumption: 4265
% 3.20/3.45 % res_orphan_elimination: 0
% 3.20/3.45 % res_tautology_del: 459
% 3.20/3.45 % res_num_eq_res_simplified: 0
% 3.20/3.45 % res_num_sel_changes: 0
% 3.20/3.45 % res_moves_from_active_to_pass: 0
% 3.20/3.45
% 3.20/3.45 % Status Unknown
% 3.20/3.45 % Last status :
% 3.20/3.45 % SZS status Unknown
%------------------------------------------------------------------------------