TSTP Solution File: NLP059+1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : NLP059+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n012.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:11 EDT 2022
% Result : Unknown 5.25s 5.43s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP059+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n012.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 07:01:02 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % 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_cf6ca5.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_dea6e4.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_24e77f | 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.89/1.10 % --bmc1_dump_unsat_core_tptp false
% 0.89/1.10 % --bmc1_dump_file -
% 0.89/1.10 % --bmc1_ucm_expand_uc_limit 128
% 0.89/1.10 % --bmc1_ucm_n_expand_iterations 6
% 0.89/1.10 % --bmc1_ucm_extend_mode 1
% 0.89/1.10 % --bmc1_ucm_init_mode 2
% 0.89/1.10 % --bmc1_ucm_cone_mode none
% 0.89/1.10 % --bmc1_ucm_reduced_relation_type 0
% 0.89/1.10 % --bmc1_ucm_relax_model 4
% 0.89/1.10 % --bmc1_ucm_full_tr_after_sat true
% 0.89/1.10 % --bmc1_ucm_expand_neg_assumptions false
% 0.89/1.10 % --bmc1_ucm_layered_model none
% 0.89/1.10 % --bmc1_ucm_max_lemma_size 10
% 0.89/1.10
% 0.89/1.10 % ------ AIG Options
% 0.89/1.10
% 0.89/1.10 % --aig_mode false
% 0.89/1.10
% 0.89/1.10 % ------ Instantiation Options
% 0.89/1.10
% 0.89/1.10 % --instantiation_flag true
% 0.89/1.10 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.89/1.10 % --inst_solver_per_active 750
% 0.89/1.10 % --inst_solver_calls_frac 0.5
% 0.89/1.10 % --inst_passive_queue_type priority_queues
% 0.89/1.10 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.89/1.10 % --inst_passive_queues_freq [25;2]
% 0.89/1.10 % --inst_dismatching true
% 0.89/1.10 % --inst_eager_unprocessed_to_passive true
% 0.89/1.10 % --inst_prop_sim_given true
% 0.89/1.10 % --inst_prop_sim_new false
% 0.89/1.10 % --inst_orphan_elimination true
% 0.89/1.10 % --inst_learning_loop_flag true
% 0.89/1.10 % --inst_learning_start 3000
% 0.89/1.10 % --inst_learning_factor 2
% 0.89/1.10 % --inst_start_prop_sim_after_learn 3
% 0.89/1.10 % --inst_sel_renew solver
% 0.89/1.10 % --inst_lit_activity_flag true
% 0.89/1.10 % --inst_out_proof true
% 0.89/1.10
% 0.89/1.10 % ------ Resolution Options
% 0.89/1.10
% 0.89/1.10 % --resolution_flag true
% 0.89/1.10 % --res_lit_sel kbo_max
% 0.89/1.10 % --res_to_prop_solver none
% 0.89/1.10 % --res_prop_simpl_new false
% 0.89/1.10 % --res_prop_simpl_given false
% 0.89/1.10 % --res_passive_queue_type priority_queues
% 0.89/1.10 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.89/1.10 % --res_passive_queues_freq [15;5]
% 0.89/1.10 % --res_forward_subs full
% 0.89/1.10 % --res_backward_subs full
% 0.89/1.10 % --res_forward_subs_resolution true
% 0.89/1.10 % --res_backward_subs_resolution true
% 0.89/1.10 % --res_orphan_elimination false
% 0.89/1.10 % --res_time_limit 1000.
% 0.89/1.10 % --res_out_proof true
% 0.89/1.10 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_cf6ca5.s
% 0.89/1.10 % --modulo true
% 0.89/1.10
% 0.89/1.10 % ------ Combination Options
% 0.89/1.10
% 0.89/1.10 % --comb_res_mult 1000
% 0.89/1.10 % --comb_inst_mult 300
% 0.89/1.10 % ------
% 0.89/1.10
% 0.89/1.10 % ------ Parsing...% successful
% 0.89/1.10
% 0.89/1.10 % ------ Preprocessing... gs_s sp: 1216 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.89/1.10
% 0.89/1.10 % ------ Proving...
% 0.89/1.10 % ------ Problem Properties
% 0.89/1.10
% 0.89/1.10 %
% 0.89/1.10 % EPR false
% 0.89/1.10 % Horn false
% 0.89/1.10 % Has equality false
% 0.89/1.10
% 0.89/1.10 % % ------ Input Options Time Limit: Unbounded
% 0.89/1.10
% 0.89/1.10
% 0.89/1.10 % % ------ Current options:
% 0.89/1.10
% 0.89/1.10 % ------ Input Options
% 0.89/1.10
% 0.89/1.10 % --out_options all
% 0.89/1.10 % --tptp_safe_out true
% 0.89/1.10 % --problem_path ""
% 0.89/1.10 % --include_path ""
% 0.89/1.10 % --clausifier .//eprover
% 0.89/1.10 % --clausifier_options --tstp-format
% 0.89/1.10 % --stdin false
% 0.89/1.10 % --dbg_backtrace false
% 0.89/1.10 % --dbg_dump_prop_clauses false
% 0.89/1.10 % --dbg_dump_prop_clauses_file -
% 0.89/1.10 % --dbg_out_stat false
% 0.89/1.10
% 0.89/1.10 % ------ General Options
% 0.89/1.10
% 0.89/1.10 % --fof false
% 0.89/1.10 % --time_out_real 150.
% 0.89/1.10 % --time_out_prep_mult 0.2
% 0.89/1.10 % --time_out_virtual -1.
% 0.89/1.10 % --schedule none
% 0.89/1.10 % --ground_splitting input
% 0.89/1.10 % --splitting_nvd 16
% 0.89/1.10 % --non_eq_to_eq false
% 0.89/1.10 % --prep_gs_sim true
% 0.89/1.10 % --prep_unflatten false
% 0.89/1.10 % --prep_res_sim true
% 0.89/1.10 % --prep_upred true
% 0.89/1.10 % --res_sim_input true
% 0.89/1.10 % --clause_weak_htbl true
% 0.89/1.10 % --gc_record_bc_elim false
% 0.89/1.10 % --symbol_type_check false
% 0.89/1.10 % --clausify_out false
% 0.89/1.10 % --large_theory_mode false
% 0.89/1.10 % --prep_sem_filter none
% 0.89/1.10 % --prep_sem_filter_out false
% 0.89/1.10 % --preprocessed_out false
% 0.89/1.10 % --sub_typing false
% 0.89/1.10 % --brand_transform false
% 0.89/1.10 % --pure_diseq_elim true
% 0.89/1.10 % --min_unsat_core false
% 0.89/1.10 % --pred_elim true
% 0.89/1.10 % --add_important_lit false
% 0.89/1.10 % --soft_assumptions false
% 0.89/1.10 % --reset_solvers false
% 0.89/1.10 % --bc_imp_inh []
% 0.89/1.10 % --conj_cone_tolerance 1.5
% 0.89/1.10 % --prolific_symb_bound 500
% 0.89/1.10 % --lt_threshold 2000
% 0.89/1.10
% 0.89/1.10 % ------ SAT Options
% 0.89/1.10
% 0.89/1.10 % --sat_mode false
% 0.89/1.10 % --sat_fm_restart_options ""
% 0.89/1.10 % --sat_gr_def false
% 0.89/1.10 % --sat_epr_types true
% 0.89/1.10 % --sat_non_cyclic_types false
% 0.89/1.10 % --sat_finite_models false
% 0.89/1.10 % --sat_fm_lemmas false
% 0.89/1.10 % --sat_fm_prep false
% 0.89/1.10 % --sat_fm_uc_incr true
% 0.89/1.10 % --sat_out_model small
% 0.89/1.10 % --sat_out_clauses false
% 0.89/1.10
% 0.89/1.10 % ------ QBF Options
% 0.89/1.10
% 0.89/1.10 % --qbf_mode false
% 0.89/1.10 % --qbf_elim_univ true
% 0.89/1.10 % --qbf_sk_in true
% 0.89/1.10 % --qbf_pred_elim true
% 0.89/1.10 % --qbf_split 32
% 0.89/1.10
% 0.89/1.10 % ------ BMC1 Options
% 0.89/1.10
% 0.89/1.10 % --bmc1_incremental false
% 0.89/1.10 % --bmc1_axioms reachable_all
% 0.89/1.10 % --bmc1_min_bound 0
% 0.89/1.10 % --bmc1_max_bound -1
% 0.89/1.10 % --bmc1_max_bound_default -1
% 0.89/1.10 % --bmc1_symbol_reachability true
% 0.89/1.10 % --bmc1_property_lemmas false
% 0.89/1.10 % --bmc1_k_induction false
% 0.89/1.10 % --bmc1_non_equiv_states false
% 0.89/1.10 % --bmc1_deadlock false
% 0.89/1.10 % --bmc1_ucm false
% 0.89/1.10 % --bmc1_add_unsat_core none
% 0.89/1.10 % --bmc1_unsat_core_children false
% 0.89/1.10 % --bmc1_unsat_core_extrapolate_axioms false
% 0.89/1.10 % --bmc1_out_stat full
% 0.89/1.10 % --bmc1_ground_init false
% 0.89/1.10 % --bmc1_pre_inst_next_state false
% 0.89/1.10 % --bmc1_pre_inst_state false
% 0.89/1.10 % --bmc1_pre_inst_reach_state false
% 0.89/1.10 % --bmc1_out_unsat_core false
% 0.89/1.10 % --bmc1_aig_witness_out false
% 0.89/1.10 % --bmc1_verbose false
% 0.89/1.10 % --bmc1_dump_clauses_tptp false
% 0.89/1.10 % --bmc1_dump_unsat_core_tptp false
% 0.89/1.10 % --bmc1_dump_file -
% 0.89/1.10 % --bmc1_ucm_expand_uc_limit 128
% 0.89/1.10 % --bmc1_ucm_n_expand_iterations 6
% 0.89/1.10 % --bmc1_ucm_extend_mode 1
% 0.89/1.10 % --bmc1_ucm_init_mode 2
% 0.89/1.10 % --bmc1_ucm_cone_mode none
% 0.89/1.10 % --bmc1_ucm_reduced_relation_type 0
% 0.89/1.10 % --bmc1_ucm_relax_model 4
% 0.89/1.10 % --bmc1_ucm_full_tr_after_sat true
% 0.89/1.10 % --bmc1_ucm_expand_neg_assumptions false
% 0.89/1.10 % --bmc1_ucm_layered_model none
% 0.89/1.10 % --bmc1_ucm_max_lemma_size 10
% 0.89/1.10
% 0.89/1.10 % ------ AIG Options
% 0.89/1.10
% 0.89/1.10 % --aig_mode false
% 0.89/1.10
% 0.89/1.10 % ------ Instantiation Options
% 0.89/1.10
% 0.89/1.10 % --instantiation_flag true
% 0.89/1.10 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.89/1.10 % --inst_solver_per_active 750
% 0.89/1.10 % --inst_solver_calls_frac 0.5
% 0.89/1.10 % --inst_passive_queue_type priority_queues
% 0.89/1.10 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.89/1.10 % --inst_passive_queues_freq [25;2]
% 0.89/1.10 % --inst_dismatching true
% 0.89/1.10 % --inst_eager_unprocessed_to_passive true
% 0.89/1.10 % --inst_prop_sim_given true
% 2.76/2.98 % --inst_prop_sim_new false
% 2.76/2.98 % --inst_orphan_elimination true
% 2.76/2.98 % --inst_learning_loop_flag true
% 2.76/2.98 % --inst_learning_start 3000
% 2.76/2.98 % --inst_learning_factor 2
% 2.76/2.98 % --inst_start_prop_sim_after_learn 3
% 2.76/2.98 % --inst_sel_renew solver
% 2.76/2.98 % --inst_lit_activity_flag true
% 2.76/2.98 % --inst_out_proof true
% 2.76/2.98
% 2.76/2.98 % ------ Resolution Options
% 2.76/2.98
% 2.76/2.98 % --resolution_flag true
% 2.76/2.98 % --res_lit_sel kbo_max
% 2.76/2.98 % --res_to_prop_solver none
% 2.76/2.98 % --res_prop_simpl_new false
% 2.76/2.98 % --res_prop_simpl_given false
% 2.76/2.98 % --res_passive_queue_type priority_queues
% 2.76/2.98 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 2.76/2.98 % --res_passive_queues_freq [15;5]
% 2.76/2.98 % --res_forward_subs full
% 2.76/2.98 % --res_backward_subs full
% 2.76/2.98 % --res_forward_subs_resolution true
% 2.76/2.98 % --res_backward_subs_resolution true
% 2.76/2.98 % --res_orphan_elimination false
% 2.76/2.98 % --res_time_limit 1000.
% 2.76/2.98 % --res_out_proof true
% 2.76/2.98 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_cf6ca5.s
% 2.76/2.98 % --modulo true
% 2.76/2.98
% 2.76/2.98 % ------ Combination Options
% 2.76/2.98
% 2.76/2.98 % --comb_res_mult 1000
% 2.76/2.98 % --comb_inst_mult 300
% 2.76/2.98 % ------
% 2.76/2.98
% 2.76/2.98
% 2.76/2.98
% 2.76/2.98 % ------ Proving...
% 2.76/2.98 % warning: shown sat in sat incomplete mode
% 2.76/2.98 %
% 2.76/2.98
% 2.76/2.98
% 2.76/2.98 ------ Building Model...Done
% 2.76/2.98
% 2.76/2.98 %------ The model is defined over ground terms (initial term algebra).
% 2.76/2.98 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.76/2.98 %------ where \phi is a formula over the term algebra.
% 2.76/2.98 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.76/2.98 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.76/2.98 %------ See help for --sat_out_model for different model outputs.
% 2.76/2.98 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.76/2.98 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.76/2.98
% 2.76/2.98
% 2.76/2.98
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of actual_world
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0] :
% 2.76/2.98 ( actual_world(X0) <=>
% 2.76/2.98 (
% 2.76/2.98 (
% 2.76/2.98 ( X0=sk3_esk1_0 )
% 2.76/2.98 )
% 2.76/2.98
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of male
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1] :
% 2.76/2.98 ( male(X0,X1) <=>
% 2.76/2.98 (
% 2.76/2.98 (
% 2.76/2.98 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 )
% 2.76/2.98 )
% 2.76/2.98
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of from_loc
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1,X2] :
% 2.76/2.98 ( from_loc(X0,X1,X2) <=>
% 2.76/2.98 (
% 2.76/2.98 (
% 2.76/2.98 ( X0=sk3_esk1_0 & X1=sk3_esk5_1(sk3_esk7_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) & X2=sk3_esk7_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) )
% 2.76/2.98 )
% 2.76/2.98
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of fire
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1] :
% 2.76/2.98 ( fire(X0,X1) <=>
% 2.76/2.98 (
% 2.76/2.98 (
% 2.76/2.98 ( X0=sk3_esk1_0 & X1=sk3_esk5_1(sk3_esk7_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) )
% 2.76/2.98 )
% 2.76/2.98
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Negative definition of nonreflexive
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1] :
% 2.76/2.98 ( ~(nonreflexive(X0,X1)) <=>
% 2.76/2.98 $false
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Negative definition of present
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1] :
% 2.76/2.98 ( ~(present(X0,X1)) <=>
% 2.76/2.98 $false
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Negative definition of patient
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1,X2] :
% 2.76/2.98 ( ~(patient(X0,X1,X2)) <=>
% 2.76/2.98 $false
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of agent
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1,X2] :
% 2.76/2.98 ( agent(X0,X1,X2) <=>
% 2.76/2.98 (
% 2.76/2.98 (
% 2.76/2.98 ( X0=sk3_esk1_0 & X1=sk3_esk5_1(sk3_esk7_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) & X2=sk3_esk4_1(sk3_esk7_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0)) )
% 2.76/2.98 )
% 2.76/2.98
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Negative definition of event
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1] :
% 2.76/2.98 ( ~(event(X0,X1)) <=>
% 2.76/2.98 $false
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of six
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1] :
% 2.76/2.98 ( six(X0,X1) <=>
% 2.76/2.98 (
% 2.76/2.98 (
% 2.76/2.98 ( X0=sk3_esk1_0 & X1=sk3_esk3_0 )
% 2.76/2.98 )
% 2.76/2.98
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Negative definition of group
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1] :
% 2.76/2.98 ( ~(group(X0,X1)) <=>
% 2.76/2.98 $false
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of shot
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1] :
% 2.76/2.98 ( shot(X0,X1) <=>
% 2.76/2.98 (
% 2.76/2.98 (
% 2.76/2.98 ( X0=sk3_esk1_0 & X1=sk3_esk7_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) )
% 2.76/2.98 )
% 2.76/2.98
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Negative definition of man
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1] :
% 2.76/2.98 ( ~(man(X0,X1)) <=>
% 2.76/2.98 (
% 2.76/2.98 (
% 2.76/2.98 ( X0=sk3_esk9_0 )
% 2.76/2.98 )
% 2.76/2.98
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of member
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1,X2] :
% 2.76/2.98 ( member(X0,X1,X2) <=>
% 2.76/2.98 (
% 2.76/2.98 (
% 2.76/2.98 ( X0=sk3_esk1_0 & X1=sk3_esk7_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) & X2=sk3_esk3_0 )
% 2.76/2.98 )
% 2.76/2.98
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Negative definition of of
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1,X2] :
% 2.76/2.98 ( ~(of(X0,X1,X2)) <=>
% 2.76/2.98 $false
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of cannon
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 (! [X0,X1] :
% 2.76/2.98 ( cannon(X0,X1) <=>
% 2.76/2.98 (
% 2.76/2.98 (
% 2.76/2.98 ( X0=sk3_esk1_0 & X1=sk3_esk7_3(sk3_esk1_0,sk3_esk2_0,sk3_esk3_0) )
% 2.76/2.98 )
% 2.76/2.98
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP0_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP0_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP1_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP1_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP2_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP2_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP3_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP3_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP4_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP4_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP5_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP5_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP6_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP6_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP7_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP7_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP8_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP8_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP9_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP9_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP10_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP10_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP11_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP11_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP12_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP12_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP13_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP13_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP14_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP14_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP15_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP15_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP16_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP16_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP17_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP17_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP18_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP18_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP19_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP19_iProver_split <=>
% 2.76/2.98 $false
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP20_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP20_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP21_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP21_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP22_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP22_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP23_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP23_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP24_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP24_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP25_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP25_iProver_split <=>
% 2.76/2.98 $false
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP26_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP26_iProver_split <=>
% 2.76/2.98 $false
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP27_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP27_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP28_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP28_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP29_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP29_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP30_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP30_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP31_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP31_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP32_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP32_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP33_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP33_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98 %------ Positive definition of sP34_iProver_split
% 2.76/2.98 fof(lit_def,axiom,
% 2.76/2.98 ( sP34_iProver_split <=>
% 2.76/2.98 $true
% 2.76/2.98 )
% 2.76/2.98 ).
% 2.76/2.98
% 2.76/2.98
% 2.76/2.98
% 2.76/2.98 % ------ Statistics
% 2.76/2.98
% 2.76/2.98 % ------ General
% 2.76/2.98
% 2.76/2.98 % num_of_input_clauses: 460
% 2.76/2.98 % num_of_input_neg_conjectures: 460
% 2.76/2.98 % num_of_splits: 1216
% 2.76/2.98 % num_of_split_atoms: 35
% 2.76/2.98 % num_of_sem_filtered_clauses: 0
% 2.76/2.98 % num_of_subtypes: 0
% 2.76/2.98 % monotx_restored_types: 0
% 2.76/2.98 % sat_num_of_epr_types: 0
% 2.76/2.98 % sat_num_of_non_cyclic_types: 0
% 2.76/2.98 % sat_guarded_non_collapsed_types: 0
% 2.76/2.98 % is_epr: 0
% 2.76/2.98 % is_horn: 0
% 2.76/2.98 % has_eq: 0
% 2.76/2.98 % num_pure_diseq_elim: 0
% 2.76/2.98 % simp_replaced_by: 0
% 2.76/2.98 % res_preprocessed: 2136
% 2.76/2.98 % prep_upred: 0
% 2.76/2.98 % prep_unflattend: 0
% 2.76/2.98 % pred_elim_cands: 35
% 2.76/2.98 % pred_elim: 0
% 2.76/2.98 % pred_elim_cl: 0
% 2.76/2.98 % pred_elim_cycles: 35
% 2.76/2.98 % forced_gc_time: 0
% 2.76/2.98 % gc_basic_clause_elim: 0
% 2.76/2.98 % parsing_time: 0.059
% 2.76/2.98 % sem_filter_time: 0.
% 2.76/2.98 % pred_elim_time: 0.427
% 2.76/2.98 % out_proof_time: 0.
% 2.76/2.98 % monotx_time: 0.
% 2.76/2.98 % subtype_inf_time: 0.
% 2.76/2.98 % unif_index_cands_time: 0.001
% 2.76/2.98 % unif_index_add_time: 0.001
% 2.76/2.98 % total_time: 2.514
% 2.76/2.98 % num_of_symbols: 90
% 2.76/2.98 % num_of_terms: 1459
% 2.76/2.98
% 2.76/2.98 % ------ Propositional Solver
% 2.76/2.98
% 2.76/2.98 % prop_solver_calls: 5
% 2.76/2.98 % prop_fast_solver_calls: 17595
% 2.76/2.98 % prop_num_of_clauses: 2850
% 2.76/2.98 % prop_preprocess_simplified: 13952
% 2.76/2.98 % prop_fo_subsumed: 0
% 2.76/2.98 % prop_solver_time: 0.
% 2.76/2.98 % prop_fast_solver_time: 0.015
% 2.76/2.98 % prop_unsat_core_time: 0.
% 2.76/2.98
% 2.76/2.98 % ------ QBF
% 2.76/2.98
% 2.76/2.98 % qbf_q_res: 0
% 2.76/2.98 % qbf_num_tautologies: 0
% 2.76/2.98 % qbf_prep_cycles: 0
% 2.76/2.98
% 2.76/2.98 % ------ BMC1
% 2.76/2.98
% 2.76/2.98 % bmc1_current_bound: -1
% 2.76/2.98 % bmc1_last_solved_bound: -1
% 2.76/2.98 % bmc1_unsat_core_size: -1
% 2.76/2.98 % bmc1_unsat_core_parents_size: -1
% 2.76/2.98 % bmc1_merge_next_fun: 0
% 2.76/2.98 % bmc1_unsat_core_clauses_time: 0.
% 2.76/2.98
% 2.76/2.98 % ------ Instantiation
% 2.76/2.98
% 2.76/2.98 % inst_num_of_clauses: 731
% 2.76/2.98 % inst_num_in_passive: 0
% 2.76/2.98 % inst_num_in_active: 731
% 2.76/2.98 % inst_num_in_unprocessed: 0
% 2.76/2.98 % inst_num_of_loops: 864
% 2.76/2.98 % inst_num_of_learning_restarts: 0
% 2.76/2.98 % inst_num_moves_active_passive: 124
% 2.76/2.98 % inst_lit_activity: 78
% 2.76/2.98 % inst_lit_activity_moves: 0
% 2.76/2.98 % inst_num_tautologies: 0
% 2.76/2.98 % inst_num_prop_implied: 0
% 2.76/2.98 % inst_num_existing_simplified: 0
% 2.76/2.98 % inst_num_eq_res_simplified: 0
% 2.76/2.98 % inst_num_child_elim: 0
% 2.76/2.98 % inst_num_of_dismatching_blockings: 0
% 2.76/2.98 % inst_num_of_non_proper_insts: 245
% 2.76/2.98 % inst_num_of_duplicates: 5
% 2.76/2.98 % inst_inst_num_from_inst_to_res: 0
% 2.76/2.98 % inst_dismatching_checking_time: 0.
% 2.76/2.98
% 2.76/2.98 % ------ Resolution
% 2.76/2.98
% 2.76/2.98 % res_num_of_clauses: 1685
% 2.76/2.98 % res_num_in_passive: 485
% 2.76/2.98 % res_num_in_active: 1202
% 2.76/2.98 % res_num_of_loops: 3000
% 2.76/2.98 % res_forward_subset_subsumed: 1177
% 2.76/2.98 % res_backward_subset_subsumed: 303
% 2.76/2.98 % res_forward_subsumed: 1570
% 2.76/2.98 % res_backward_subsumed: 46
% 2.76/2.98 % res_forward_subsumption_resolution: 1888
% 2.76/2.98 % res_backward_subsumption_resolution: 20
% 2.76/2.98 % res_clause_to_clause_subsumption: 5924
% 2.76/2.98 % res_orphan_elimination: 0
% 2.76/2.98 % res_tautology_del: 2746
% 2.76/2.98 % res_num_eq_res_simplified: 0
% 2.76/2.98 % res_num_sel_changes: 0
% 2.76/2.98 % res_moves_from_active_to_pass: 0
% 2.76/2.98
% 2.76/2.98 % Status Unknown
% 2.83/3.08 % Orienting using strategy ClausalAll
% 2.83/3.08 % FOF problem with conjecture
% 2.83/3.08 % 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_cf6ca5.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_dea6e4.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_e52df5 | grep -v "SZS"
% 2.83/3.10
% 2.83/3.10 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 2.83/3.10
% 2.83/3.10 %
% 2.83/3.10 % ------ iProver source info
% 2.83/3.10
% 2.83/3.10 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 2.83/3.10 % git: non_committed_changes: true
% 2.83/3.10 % git: last_make_outside_of_git: true
% 2.83/3.10
% 2.83/3.10 %
% 2.83/3.10 % ------ Input Options
% 2.83/3.10
% 2.83/3.10 % --out_options all
% 2.83/3.10 % --tptp_safe_out true
% 2.83/3.10 % --problem_path ""
% 2.83/3.10 % --include_path ""
% 2.83/3.10 % --clausifier .//eprover
% 2.83/3.10 % --clausifier_options --tstp-format
% 2.83/3.10 % --stdin false
% 2.83/3.10 % --dbg_backtrace false
% 2.83/3.10 % --dbg_dump_prop_clauses false
% 2.83/3.10 % --dbg_dump_prop_clauses_file -
% 2.83/3.10 % --dbg_out_stat false
% 2.83/3.10
% 2.83/3.10 % ------ General Options
% 2.83/3.10
% 2.83/3.10 % --fof false
% 2.83/3.10 % --time_out_real 150.
% 2.83/3.10 % --time_out_prep_mult 0.2
% 2.83/3.10 % --time_out_virtual -1.
% 2.83/3.10 % --schedule none
% 2.83/3.10 % --ground_splitting input
% 2.83/3.10 % --splitting_nvd 16
% 2.83/3.10 % --non_eq_to_eq false
% 2.83/3.10 % --prep_gs_sim true
% 2.83/3.10 % --prep_unflatten false
% 2.83/3.10 % --prep_res_sim true
% 2.83/3.10 % --prep_upred true
% 2.83/3.10 % --res_sim_input true
% 2.83/3.10 % --clause_weak_htbl true
% 2.83/3.10 % --gc_record_bc_elim false
% 2.83/3.10 % --symbol_type_check false
% 2.83/3.10 % --clausify_out false
% 2.83/3.10 % --large_theory_mode false
% 2.83/3.10 % --prep_sem_filter none
% 2.83/3.10 % --prep_sem_filter_out false
% 2.83/3.10 % --preprocessed_out false
% 2.83/3.10 % --sub_typing false
% 2.83/3.10 % --brand_transform false
% 2.83/3.10 % --pure_diseq_elim true
% 2.83/3.10 % --min_unsat_core false
% 2.83/3.10 % --pred_elim true
% 2.83/3.10 % --add_important_lit false
% 2.83/3.10 % --soft_assumptions false
% 2.83/3.10 % --reset_solvers false
% 2.83/3.10 % --bc_imp_inh []
% 2.83/3.10 % --conj_cone_tolerance 1.5
% 2.83/3.10 % --prolific_symb_bound 500
% 2.83/3.10 % --lt_threshold 2000
% 2.83/3.10
% 2.83/3.10 % ------ SAT Options
% 2.83/3.10
% 2.83/3.10 % --sat_mode false
% 2.83/3.10 % --sat_fm_restart_options ""
% 2.83/3.10 % --sat_gr_def false
% 2.83/3.10 % --sat_epr_types true
% 2.83/3.10 % --sat_non_cyclic_types false
% 2.83/3.10 % --sat_finite_models false
% 2.83/3.10 % --sat_fm_lemmas false
% 2.83/3.10 % --sat_fm_prep false
% 2.83/3.10 % --sat_fm_uc_incr true
% 2.83/3.10 % --sat_out_model small
% 2.83/3.10 % --sat_out_clauses false
% 2.83/3.10
% 2.83/3.10 % ------ QBF Options
% 2.83/3.10
% 2.83/3.10 % --qbf_mode false
% 2.83/3.10 % --qbf_elim_univ true
% 2.83/3.10 % --qbf_sk_in true
% 2.83/3.10 % --qbf_pred_elim true
% 2.83/3.10 % --qbf_split 32
% 2.83/3.10
% 2.83/3.10 % ------ BMC1 Options
% 2.83/3.10
% 2.83/3.10 % --bmc1_incremental false
% 2.83/3.10 % --bmc1_axioms reachable_all
% 2.83/3.10 % --bmc1_min_bound 0
% 2.83/3.10 % --bmc1_max_bound -1
% 2.83/3.10 % --bmc1_max_bound_default -1
% 2.83/3.10 % --bmc1_symbol_reachability true
% 2.83/3.10 % --bmc1_property_lemmas false
% 2.83/3.10 % --bmc1_k_induction false
% 2.83/3.10 % --bmc1_non_equiv_states false
% 2.83/3.10 % --bmc1_deadlock false
% 2.83/3.10 % --bmc1_ucm false
% 2.83/3.10 % --bmc1_add_unsat_core none
% 2.83/3.10 % --bmc1_unsat_core_children false
% 2.83/3.10 % --bmc1_unsat_core_extrapolate_axioms false
% 2.83/3.10 % --bmc1_out_stat full
% 2.83/3.10 % --bmc1_ground_init false
% 2.83/3.10 % --bmc1_pre_inst_next_state false
% 2.83/3.10 % --bmc1_pre_inst_state false
% 2.83/3.10 % --bmc1_pre_inst_reach_state false
% 2.83/3.10 % --bmc1_out_unsat_core false
% 2.83/3.10 % --bmc1_aig_witness_out false
% 2.83/3.10 % --bmc1_verbose false
% 2.83/3.10 % --bmc1_dump_clauses_tptp false
% 3.37/3.55 % --bmc1_dump_unsat_core_tptp false
% 3.37/3.55 % --bmc1_dump_file -
% 3.37/3.55 % --bmc1_ucm_expand_uc_limit 128
% 3.37/3.55 % --bmc1_ucm_n_expand_iterations 6
% 3.37/3.55 % --bmc1_ucm_extend_mode 1
% 3.37/3.55 % --bmc1_ucm_init_mode 2
% 3.37/3.55 % --bmc1_ucm_cone_mode none
% 3.37/3.55 % --bmc1_ucm_reduced_relation_type 0
% 3.37/3.55 % --bmc1_ucm_relax_model 4
% 3.37/3.55 % --bmc1_ucm_full_tr_after_sat true
% 3.37/3.55 % --bmc1_ucm_expand_neg_assumptions false
% 3.37/3.55 % --bmc1_ucm_layered_model none
% 3.37/3.55 % --bmc1_ucm_max_lemma_size 10
% 3.37/3.55
% 3.37/3.55 % ------ AIG Options
% 3.37/3.55
% 3.37/3.55 % --aig_mode false
% 3.37/3.55
% 3.37/3.55 % ------ Instantiation Options
% 3.37/3.55
% 3.37/3.55 % --instantiation_flag true
% 3.37/3.55 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 3.37/3.55 % --inst_solver_per_active 750
% 3.37/3.55 % --inst_solver_calls_frac 0.5
% 3.37/3.55 % --inst_passive_queue_type priority_queues
% 3.37/3.55 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 3.37/3.55 % --inst_passive_queues_freq [25;2]
% 3.37/3.55 % --inst_dismatching true
% 3.37/3.55 % --inst_eager_unprocessed_to_passive true
% 3.37/3.55 % --inst_prop_sim_given true
% 3.37/3.55 % --inst_prop_sim_new false
% 3.37/3.55 % --inst_orphan_elimination true
% 3.37/3.55 % --inst_learning_loop_flag true
% 3.37/3.55 % --inst_learning_start 3000
% 3.37/3.55 % --inst_learning_factor 2
% 3.37/3.55 % --inst_start_prop_sim_after_learn 3
% 3.37/3.55 % --inst_sel_renew solver
% 3.37/3.55 % --inst_lit_activity_flag true
% 3.37/3.55 % --inst_out_proof true
% 3.37/3.55
% 3.37/3.55 % ------ Resolution Options
% 3.37/3.55
% 3.37/3.55 % --resolution_flag true
% 3.37/3.55 % --res_lit_sel kbo_max
% 3.37/3.55 % --res_to_prop_solver none
% 3.37/3.55 % --res_prop_simpl_new false
% 3.37/3.55 % --res_prop_simpl_given false
% 3.37/3.55 % --res_passive_queue_type priority_queues
% 3.37/3.55 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 3.37/3.55 % --res_passive_queues_freq [15;5]
% 3.37/3.55 % --res_forward_subs full
% 3.37/3.55 % --res_backward_subs full
% 3.37/3.55 % --res_forward_subs_resolution true
% 3.37/3.55 % --res_backward_subs_resolution true
% 3.37/3.55 % --res_orphan_elimination false
% 3.37/3.55 % --res_time_limit 1000.
% 3.37/3.55 % --res_out_proof true
% 3.37/3.55 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_cf6ca5.s
% 3.37/3.55 % --modulo true
% 3.37/3.55
% 3.37/3.55 % ------ Combination Options
% 3.37/3.55
% 3.37/3.55 % --comb_res_mult 1000
% 3.37/3.55 % --comb_inst_mult 300
% 3.37/3.55 % ------
% 3.37/3.55
% 3.37/3.55 % ------ Parsing...% successful
% 3.37/3.55
% 3.37/3.55 % ------ Preprocessing... gs_s sp: 1216 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 3.37/3.55
% 3.37/3.55 % ------ Proving...
% 3.37/3.55 % ------ Problem Properties
% 3.37/3.55
% 3.37/3.55 %
% 3.37/3.55 % EPR false
% 3.37/3.55 % Horn false
% 3.37/3.55 % Has equality false
% 3.37/3.55
% 3.37/3.55 % % ------ Input Options Time Limit: Unbounded
% 3.37/3.55
% 3.37/3.55
% 3.37/3.55 % % ------ Current options:
% 3.37/3.55
% 3.37/3.55 % ------ Input Options
% 3.37/3.55
% 3.37/3.55 % --out_options all
% 3.37/3.55 % --tptp_safe_out true
% 3.37/3.55 % --problem_path ""
% 3.37/3.55 % --include_path ""
% 3.37/3.55 % --clausifier .//eprover
% 3.37/3.55 % --clausifier_options --tstp-format
% 3.37/3.55 % --stdin false
% 3.37/3.55 % --dbg_backtrace false
% 3.37/3.55 % --dbg_dump_prop_clauses false
% 3.37/3.55 % --dbg_dump_prop_clauses_file -
% 3.37/3.55 % --dbg_out_stat false
% 3.37/3.55
% 3.37/3.55 % ------ General Options
% 3.37/3.55
% 3.37/3.55 % --fof false
% 3.37/3.55 % --time_out_real 150.
% 3.37/3.55 % --time_out_prep_mult 0.2
% 3.37/3.55 % --time_out_virtual -1.
% 3.37/3.55 % --schedule none
% 3.37/3.55 % --ground_splitting input
% 3.37/3.55 % --splitting_nvd 16
% 3.37/3.55 % --non_eq_to_eq false
% 3.37/3.55 % --prep_gs_sim true
% 3.37/3.55 % --prep_unflatten false
% 3.37/3.55 % --prep_res_sim true
% 3.37/3.55 % --prep_upred true
% 3.37/3.55 % --res_sim_input true
% 3.37/3.55 % --clause_weak_htbl true
% 3.37/3.55 % --gc_record_bc_elim false
% 3.37/3.55 % --symbol_type_check false
% 3.37/3.55 % --clausify_out false
% 3.37/3.55 % --large_theory_mode false
% 3.37/3.55 % --prep_sem_filter none
% 3.37/3.55 % --prep_sem_filter_out false
% 3.37/3.55 % --preprocessed_out false
% 3.37/3.55 % --sub_typing false
% 3.37/3.55 % --brand_transform false
% 3.37/3.55 % --pure_diseq_elim true
% 3.37/3.55 % --min_unsat_core false
% 3.37/3.55 % --pred_elim true
% 3.37/3.55 % --add_important_lit false
% 3.37/3.55 % --soft_assumptions false
% 3.37/3.55 % --reset_solvers false
% 3.37/3.55 % --bc_imp_inh []
% 3.37/3.55 % --conj_cone_tolerance 1.5
% 3.37/3.55 % --prolific_symb_bound 500
% 3.37/3.55 % --lt_threshold 2000
% 3.37/3.55
% 3.37/3.55 % ------ SAT Options
% 3.37/3.55
% 3.37/3.55 % --sat_mode false
% 3.37/3.55 % --sat_fm_restart_options ""
% 3.37/3.55 % --sat_gr_def false
% 3.37/3.55 % --sat_epr_types true
% 3.37/3.55 % --sat_non_cyclic_types false
% 3.37/3.55 % --sat_finite_models false
% 3.37/3.55 % --sat_fm_lemmas false
% 3.37/3.55 % --sat_fm_prep false
% 3.37/3.55 % --sat_fm_uc_incr true
% 3.37/3.55 % --sat_out_model small
% 3.37/3.55 % --sat_out_clauses false
% 3.37/3.55
% 3.37/3.55 % ------ QBF Options
% 3.37/3.55
% 3.37/3.55 % --qbf_mode false
% 3.37/3.55 % --qbf_elim_univ true
% 3.37/3.55 % --qbf_sk_in true
% 3.37/3.55 % --qbf_pred_elim true
% 3.37/3.55 % --qbf_split 32
% 3.37/3.55
% 3.37/3.55 % ------ BMC1 Options
% 3.37/3.55
% 3.37/3.55 % --bmc1_incremental false
% 3.37/3.55 % --bmc1_axioms reachable_all
% 3.37/3.55 % --bmc1_min_bound 0
% 3.37/3.55 % --bmc1_max_bound -1
% 3.37/3.55 % --bmc1_max_bound_default -1
% 3.37/3.55 % --bmc1_symbol_reachability true
% 3.37/3.55 % --bmc1_property_lemmas false
% 3.37/3.55 % --bmc1_k_induction false
% 3.37/3.55 % --bmc1_non_equiv_states false
% 3.37/3.55 % --bmc1_deadlock false
% 3.37/3.55 % --bmc1_ucm false
% 3.37/3.55 % --bmc1_add_unsat_core none
% 3.37/3.55 % --bmc1_unsat_core_children false
% 3.37/3.55 % --bmc1_unsat_core_extrapolate_axioms false
% 3.37/3.55 % --bmc1_out_stat full
% 3.37/3.55 % --bmc1_ground_init false
% 3.37/3.55 % --bmc1_pre_inst_next_state false
% 3.37/3.55 % --bmc1_pre_inst_state false
% 3.37/3.55 % --bmc1_pre_inst_reach_state false
% 3.37/3.55 % --bmc1_out_unsat_core false
% 3.37/3.55 % --bmc1_aig_witness_out false
% 3.37/3.55 % --bmc1_verbose false
% 3.37/3.55 % --bmc1_dump_clauses_tptp false
% 3.37/3.55 % --bmc1_dump_unsat_core_tptp false
% 3.37/3.55 % --bmc1_dump_file -
% 3.37/3.55 % --bmc1_ucm_expand_uc_limit 128
% 3.37/3.55 % --bmc1_ucm_n_expand_iterations 6
% 3.37/3.55 % --bmc1_ucm_extend_mode 1
% 3.37/3.55 % --bmc1_ucm_init_mode 2
% 3.37/3.55 % --bmc1_ucm_cone_mode none
% 3.37/3.55 % --bmc1_ucm_reduced_relation_type 0
% 3.37/3.55 % --bmc1_ucm_relax_model 4
% 3.37/3.55 % --bmc1_ucm_full_tr_after_sat true
% 3.37/3.55 % --bmc1_ucm_expand_neg_assumptions false
% 3.37/3.55 % --bmc1_ucm_layered_model none
% 3.37/3.55 % --bmc1_ucm_max_lemma_size 10
% 3.37/3.55
% 3.37/3.55 % ------ AIG Options
% 3.37/3.55
% 3.37/3.55 % --aig_mode false
% 3.37/3.55
% 3.37/3.55 % ------ Instantiation Options
% 3.37/3.55
% 3.37/3.55 % --instantiation_flag true
% 3.37/3.55 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 3.37/3.55 % --inst_solver_per_active 750
% 3.37/3.55 % --inst_solver_calls_frac 0.5
% 3.37/3.55 % --inst_passive_queue_type priority_queues
% 3.37/3.55 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 3.37/3.55 % --inst_passive_queues_freq [25;2]
% 3.37/3.55 % --inst_dismatching true
% 3.37/3.55 % --inst_eager_unprocessed_to_passive true
% 3.37/3.55 % --inst_prop_sim_given true
% 5.25/5.43 % --inst_prop_sim_new false
% 5.25/5.43 % --inst_orphan_elimination true
% 5.25/5.43 % --inst_learning_loop_flag true
% 5.25/5.43 % --inst_learning_start 3000
% 5.25/5.43 % --inst_learning_factor 2
% 5.25/5.43 % --inst_start_prop_sim_after_learn 3
% 5.25/5.43 % --inst_sel_renew solver
% 5.25/5.43 % --inst_lit_activity_flag true
% 5.25/5.43 % --inst_out_proof true
% 5.25/5.43
% 5.25/5.43 % ------ Resolution Options
% 5.25/5.43
% 5.25/5.43 % --resolution_flag true
% 5.25/5.43 % --res_lit_sel kbo_max
% 5.25/5.43 % --res_to_prop_solver none
% 5.25/5.43 % --res_prop_simpl_new false
% 5.25/5.43 % --res_prop_simpl_given false
% 5.25/5.43 % --res_passive_queue_type priority_queues
% 5.25/5.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 5.25/5.43 % --res_passive_queues_freq [15;5]
% 5.25/5.43 % --res_forward_subs full
% 5.25/5.43 % --res_backward_subs full
% 5.25/5.43 % --res_forward_subs_resolution true
% 5.25/5.43 % --res_backward_subs_resolution true
% 5.25/5.43 % --res_orphan_elimination false
% 5.25/5.43 % --res_time_limit 1000.
% 5.25/5.43 % --res_out_proof true
% 5.25/5.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_cf6ca5.s
% 5.25/5.43 % --modulo true
% 5.25/5.43
% 5.25/5.43 % ------ Combination Options
% 5.25/5.43
% 5.25/5.43 % --comb_res_mult 1000
% 5.25/5.43 % --comb_inst_mult 300
% 5.25/5.43 % ------
% 5.25/5.43
% 5.25/5.43
% 5.25/5.43
% 5.25/5.43 % ------ Proving...
% 5.25/5.43 % warning: shown sat in sat incomplete mode
% 5.25/5.43 %
% 5.25/5.43
% 5.25/5.43
% 5.25/5.43 ------ Building Model...Done
% 5.25/5.43
% 5.25/5.43 %------ The model is defined over ground terms (initial term algebra).
% 5.25/5.43 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 5.25/5.43 %------ where \phi is a formula over the term algebra.
% 5.25/5.43 %------ If we have equality in the problem then it is also defined as a predicate above,
% 5.25/5.43 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 5.25/5.43 %------ See help for --sat_out_model for different model outputs.
% 5.25/5.43 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 5.25/5.43 %------ where the first argument stands for the sort ($i in the unsorted case)
% 5.25/5.43
% 5.25/5.43
% 5.25/5.43
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of actual_world
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0] :
% 5.25/5.43 ( actual_world(X0) <=>
% 5.25/5.43 (
% 5.25/5.43 (
% 5.25/5.43 ( X0=sk2_esk1_0 )
% 5.25/5.43 )
% 5.25/5.43
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of male
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1] :
% 5.25/5.43 ( male(X0,X1) <=>
% 5.25/5.43 (
% 5.25/5.43 (
% 5.25/5.43 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 )
% 5.25/5.43 )
% 5.25/5.43
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of from_loc
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1,X2] :
% 5.25/5.43 ( from_loc(X0,X1,X2) <=>
% 5.25/5.43 (
% 5.25/5.43 (
% 5.25/5.43 ( X0=sk2_esk1_0 & X1=sk2_esk5_1(sk2_esk7_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) & X2=sk2_esk7_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0) )
% 5.25/5.43 )
% 5.25/5.43
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of fire
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1] :
% 5.25/5.43 ( fire(X0,X1) <=>
% 5.25/5.43 (
% 5.25/5.43 (
% 5.25/5.43 ( X0=sk2_esk1_0 & X1=sk2_esk5_1(sk2_esk7_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) )
% 5.25/5.43 )
% 5.25/5.43
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Negative definition of nonreflexive
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1] :
% 5.25/5.43 ( ~(nonreflexive(X0,X1)) <=>
% 5.25/5.43 $false
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Negative definition of present
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1] :
% 5.25/5.43 ( ~(present(X0,X1)) <=>
% 5.25/5.43 $false
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Negative definition of patient
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1,X2] :
% 5.25/5.43 ( ~(patient(X0,X1,X2)) <=>
% 5.25/5.43 $false
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of agent
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1,X2] :
% 5.25/5.43 ( agent(X0,X1,X2) <=>
% 5.25/5.43 (
% 5.25/5.43 (
% 5.25/5.43 ( X0=sk2_esk1_0 & X1=sk2_esk5_1(sk2_esk7_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) & X2=sk2_esk4_1(sk2_esk7_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0)) )
% 5.25/5.43 )
% 5.25/5.43
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Negative definition of event
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1] :
% 5.25/5.43 ( ~(event(X0,X1)) <=>
% 5.25/5.43 $false
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of six
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1] :
% 5.25/5.43 ( six(X0,X1) <=>
% 5.25/5.43 (
% 5.25/5.43 (
% 5.25/5.43 ( X0=sk2_esk1_0 & X1=sk2_esk3_0 )
% 5.25/5.43 )
% 5.25/5.43
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Negative definition of group
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1] :
% 5.25/5.43 ( ~(group(X0,X1)) <=>
% 5.25/5.43 $false
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of shot
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1] :
% 5.25/5.43 ( shot(X0,X1) <=>
% 5.25/5.43 (
% 5.25/5.43 (
% 5.25/5.43 ( X0=sk2_esk1_0 & X1=sk2_esk7_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0) )
% 5.25/5.43 )
% 5.25/5.43
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Negative definition of man
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1] :
% 5.25/5.43 ( ~(man(X0,X1)) <=>
% 5.25/5.43 (
% 5.25/5.43 (
% 5.25/5.43 ( X0=sk2_esk9_0 )
% 5.25/5.43 )
% 5.25/5.43
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of member
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1,X2] :
% 5.25/5.43 ( member(X0,X1,X2) <=>
% 5.25/5.43 (
% 5.25/5.43 (
% 5.25/5.43 ( X0=sk2_esk1_0 & X1=sk2_esk7_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0) & X2=sk2_esk3_0 )
% 5.25/5.43 )
% 5.25/5.43
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Negative definition of of
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1,X2] :
% 5.25/5.43 ( ~(of(X0,X1,X2)) <=>
% 5.25/5.43 $false
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of cannon
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 (! [X0,X1] :
% 5.25/5.43 ( cannon(X0,X1) <=>
% 5.25/5.43 (
% 5.25/5.43 (
% 5.25/5.43 ( X0=sk2_esk1_0 & X1=sk2_esk7_3(sk2_esk1_0,sk2_esk2_0,sk2_esk3_0) )
% 5.25/5.43 )
% 5.25/5.43
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP0_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP0_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP1_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP1_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP2_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP2_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP3_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP3_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP4_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP4_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP5_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP5_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP6_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP6_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP7_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP7_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP8_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP8_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP9_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP9_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP10_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP10_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP11_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP11_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP12_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP12_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP13_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP13_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP14_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP14_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP15_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP15_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP16_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP16_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP17_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP17_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP18_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP18_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP19_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP19_iProver_split <=>
% 5.25/5.43 $false
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP20_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP20_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP21_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP21_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP22_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP22_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP23_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP23_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP24_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP24_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP25_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP25_iProver_split <=>
% 5.25/5.43 $false
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP26_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP26_iProver_split <=>
% 5.25/5.43 $false
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP27_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP27_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP28_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP28_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP29_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP29_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP30_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP30_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP31_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP31_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP32_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP32_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP33_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP33_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43 %------ Positive definition of sP34_iProver_split
% 5.25/5.43 fof(lit_def,axiom,
% 5.25/5.43 ( sP34_iProver_split <=>
% 5.25/5.43 $true
% 5.25/5.43 )
% 5.25/5.43 ).
% 5.25/5.43
% 5.25/5.43
% 5.25/5.43
% 5.25/5.43 % ------ Statistics
% 5.25/5.43
% 5.25/5.43 % ------ General
% 5.25/5.43
% 5.25/5.43 % num_of_input_clauses: 460
% 5.25/5.43 % num_of_input_neg_conjectures: 460
% 5.25/5.43 % num_of_splits: 1216
% 5.25/5.43 % num_of_split_atoms: 35
% 5.25/5.43 % num_of_sem_filtered_clauses: 0
% 5.25/5.43 % num_of_subtypes: 0
% 5.25/5.43 % monotx_restored_types: 0
% 5.25/5.43 % sat_num_of_epr_types: 0
% 5.25/5.43 % sat_num_of_non_cyclic_types: 0
% 5.25/5.43 % sat_guarded_non_collapsed_types: 0
% 5.25/5.43 % is_epr: 0
% 5.25/5.43 % is_horn: 0
% 5.25/5.43 % has_eq: 0
% 5.25/5.43 % num_pure_diseq_elim: 0
% 5.25/5.43 % simp_replaced_by: 0
% 5.25/5.43 % res_preprocessed: 2136
% 5.25/5.43 % prep_upred: 0
% 5.25/5.43 % prep_unflattend: 0
% 5.25/5.43 % pred_elim_cands: 35
% 5.25/5.43 % pred_elim: 0
% 5.25/5.43 % pred_elim_cl: 0
% 5.25/5.43 % pred_elim_cycles: 35
% 5.25/5.43 % forced_gc_time: 0
% 5.25/5.43 % gc_basic_clause_elim: 0
% 5.25/5.43 % parsing_time: 0.026
% 5.25/5.43 % sem_filter_time: 0.
% 5.25/5.43 % pred_elim_time: 0.346
% 5.25/5.43 % out_proof_time: 0.
% 5.25/5.43 % monotx_time: 0.
% 5.25/5.43 % subtype_inf_time: 0.
% 5.25/5.43 % unif_index_cands_time: 0.001
% 5.25/5.43 % unif_index_add_time: 0.001
% 5.25/5.43 % total_time: 2.343
% 5.25/5.43 % num_of_symbols: 90
% 5.25/5.43 % num_of_terms: 1459
% 5.25/5.43
% 5.25/5.43 % ------ Propositional Solver
% 5.25/5.43
% 5.25/5.43 % prop_solver_calls: 5
% 5.25/5.43 % prop_fast_solver_calls: 17595
% 5.25/5.43 % prop_num_of_clauses: 2850
% 5.25/5.43 % prop_preprocess_simplified: 13952
% 5.25/5.43 % prop_fo_subsumed: 0
% 5.25/5.43 % prop_solver_time: 0.
% 5.25/5.43 % prop_fast_solver_time: 0.011
% 5.25/5.43 % prop_unsat_core_time: 0.
% 5.25/5.43
% 5.25/5.43 % ------ QBF
% 5.25/5.43
% 5.25/5.43 % qbf_q_res: 0
% 5.25/5.43 % qbf_num_tautologies: 0
% 5.25/5.43 % qbf_prep_cycles: 0
% 5.25/5.43
% 5.25/5.43 % ------ BMC1
% 5.25/5.43
% 5.25/5.43 % bmc1_current_bound: -1
% 5.25/5.43 % bmc1_last_solved_bound: -1
% 5.25/5.43 % bmc1_unsat_core_size: -1
% 5.25/5.43 % bmc1_unsat_core_parents_size: -1
% 5.25/5.43 % bmc1_merge_next_fun: 0
% 5.25/5.43 % bmc1_unsat_core_clauses_time: 0.
% 5.25/5.43
% 5.25/5.43 % ------ Instantiation
% 5.25/5.43
% 5.25/5.43 % inst_num_of_clauses: 731
% 5.25/5.43 % inst_num_in_passive: 0
% 5.25/5.43 % inst_num_in_active: 731
% 5.25/5.43 % inst_num_in_unprocessed: 0
% 5.25/5.43 % inst_num_of_loops: 864
% 5.25/5.43 % inst_num_of_learning_restarts: 0
% 5.25/5.43 % inst_num_moves_active_passive: 124
% 5.25/5.43 % inst_lit_activity: 78
% 5.25/5.43 % inst_lit_activity_moves: 0
% 5.25/5.43 % inst_num_tautologies: 0
% 5.25/5.43 % inst_num_prop_implied: 0
% 5.25/5.43 % inst_num_existing_simplified: 0
% 5.25/5.43 % inst_num_eq_res_simplified: 0
% 5.25/5.43 % inst_num_child_elim: 0
% 5.25/5.43 % inst_num_of_dismatching_blockings: 0
% 5.25/5.43 % inst_num_of_non_proper_insts: 245
% 5.25/5.43 % inst_num_of_duplicates: 5
% 5.25/5.43 % inst_inst_num_from_inst_to_res: 0
% 5.25/5.43 % inst_dismatching_checking_time: 0.
% 5.25/5.43
% 5.25/5.43 % ------ Resolution
% 5.25/5.43
% 5.25/5.43 % res_num_of_clauses: 1685
% 5.25/5.43 % res_num_in_passive: 485
% 5.25/5.43 % res_num_in_active: 1202
% 5.25/5.43 % res_num_of_loops: 3000
% 5.25/5.43 % res_forward_subset_subsumed: 1177
% 5.25/5.43 % res_backward_subset_subsumed: 303
% 5.25/5.43 % res_forward_subsumed: 1570
% 5.25/5.43 % res_backward_subsumed: 46
% 5.25/5.43 % res_forward_subsumption_resolution: 1888
% 5.25/5.43 % res_backward_subsumption_resolution: 20
% 5.25/5.43 % res_clause_to_clause_subsumption: 5924
% 5.25/5.43 % res_orphan_elimination: 0
% 5.25/5.43 % res_tautology_del: 2746
% 5.25/5.43 % res_num_eq_res_simplified: 0
% 5.25/5.43 % res_num_sel_changes: 0
% 5.25/5.43 % res_moves_from_active_to_pass: 0
% 5.25/5.43
% 5.25/5.43 % Status Unknown
% 5.25/5.43 % Last status :
% 5.25/5.43 % SZS status Unknown
%------------------------------------------------------------------------------