%------------------------------------------------------------------------------ % File : iProverMo---2.5-0.1 % Problem : NLP063-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : iprover_modulo %s %d % Computer : n007.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:13 EDT 2022 % Result : Unknown 40.01s 40.20s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NLP063-1 : TPTP v8.1.0. Released v2.4.0. % 0.07/0.13 % Command : iprover_modulo %s %d % 0.13/0.34 % Computer : n007.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.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jun 30 18:12:23 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.35 % Running in mono-core mode % 0.21/0.41 % Orienting using strategy Equiv(ClausalAll) % 0.21/0.41 % Orientation found % 0.21/0.41 % 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_de0fbf.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_616d88.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_816383 | grep -v "SZS" % 0.21/0.44 % 0.21/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 0.21/0.44 % 0.21/0.44 % % 0.21/0.44 % ------ iProver source info % 0.21/0.44 % 0.21/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 0.21/0.44 % git: non_committed_changes: true % 0.21/0.44 % git: last_make_outside_of_git: true % 0.21/0.44 % 0.21/0.44 % % 0.21/0.44 % ------ Input Options % 0.21/0.44 % 0.21/0.44 % --out_options all % 0.21/0.44 % --tptp_safe_out true % 0.21/0.44 % --problem_path "" % 0.21/0.44 % --include_path "" % 0.21/0.44 % --clausifier .//eprover % 0.21/0.44 % --clausifier_options --tstp-format % 0.21/0.44 % --stdin false % 0.21/0.44 % --dbg_backtrace false % 0.21/0.44 % --dbg_dump_prop_clauses false % 0.21/0.44 % --dbg_dump_prop_clauses_file - % 0.21/0.44 % --dbg_out_stat false % 0.21/0.44 % 0.21/0.44 % ------ General Options % 0.21/0.44 % 0.21/0.44 % --fof false % 0.21/0.44 % --time_out_real 150. % 0.21/0.44 % --time_out_prep_mult 0.2 % 0.21/0.44 % --time_out_virtual -1. % 0.21/0.44 % --schedule none % 0.21/0.44 % --ground_splitting input % 0.21/0.44 % --splitting_nvd 16 % 0.21/0.44 % --non_eq_to_eq false % 0.21/0.44 % --prep_gs_sim true % 0.21/0.44 % --prep_unflatten false % 0.21/0.44 % --prep_res_sim true % 0.21/0.44 % --prep_upred true % 0.21/0.44 % --res_sim_input true % 0.21/0.44 % --clause_weak_htbl true % 0.21/0.44 % --gc_record_bc_elim false % 0.21/0.44 % --symbol_type_check false % 0.21/0.44 % --clausify_out false % 0.21/0.44 % --large_theory_mode false % 0.21/0.44 % --prep_sem_filter none % 0.21/0.44 % --prep_sem_filter_out false % 0.21/0.44 % --preprocessed_out false % 0.21/0.44 % --sub_typing false % 0.21/0.44 % --brand_transform false % 0.21/0.44 % --pure_diseq_elim true % 0.21/0.44 % --min_unsat_core false % 0.21/0.44 % --pred_elim true % 0.21/0.44 % --add_important_lit false % 0.21/0.44 % --soft_assumptions false % 0.21/0.44 % --reset_solvers false % 0.21/0.44 % --bc_imp_inh [] % 0.21/0.44 % --conj_cone_tolerance 1.5 % 0.21/0.44 % --prolific_symb_bound 500 % 0.21/0.44 % --lt_threshold 2000 % 0.21/0.44 % 0.21/0.44 % ------ SAT Options % 0.21/0.44 % 0.21/0.44 % --sat_mode false % 0.21/0.44 % --sat_fm_restart_options "" % 0.21/0.44 % --sat_gr_def false % 0.21/0.44 % --sat_epr_types true % 0.21/0.44 % --sat_non_cyclic_types false % 0.21/0.44 % --sat_finite_models false % 0.21/0.44 % --sat_fm_lemmas false % 0.21/0.44 % --sat_fm_prep false % 0.21/0.44 % --sat_fm_uc_incr true % 0.21/0.44 % --sat_out_model small % 0.21/0.44 % --sat_out_clauses false % 0.21/0.44 % 0.21/0.44 % ------ QBF Options % 0.21/0.44 % 0.21/0.44 % --qbf_mode false % 0.21/0.44 % --qbf_elim_univ true % 0.21/0.44 % --qbf_sk_in true % 0.21/0.44 % --qbf_pred_elim true % 0.21/0.44 % --qbf_split 32 % 0.21/0.44 % 0.21/0.44 % ------ BMC1 Options % 0.21/0.44 % 0.21/0.44 % --bmc1_incremental false % 0.21/0.44 % --bmc1_axioms reachable_all % 0.21/0.44 % --bmc1_min_bound 0 % 0.21/0.44 % --bmc1_max_bound -1 % 0.21/0.44 % --bmc1_max_bound_default -1 % 0.21/0.44 % --bmc1_symbol_reachability true % 0.21/0.44 % --bmc1_property_lemmas false % 0.21/0.44 % --bmc1_k_induction false % 0.21/0.44 % --bmc1_non_equiv_states false % 0.21/0.44 % --bmc1_deadlock false % 0.21/0.44 % --bmc1_ucm false % 0.21/0.44 % --bmc1_add_unsat_core none % 0.21/0.44 % --bmc1_unsat_core_children false % 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false % 0.21/0.44 % --bmc1_out_stat full % 0.21/0.44 % --bmc1_ground_init false % 0.21/0.44 % --bmc1_pre_inst_next_state false % 0.21/0.44 % --bmc1_pre_inst_state false % 0.21/0.44 % --bmc1_pre_inst_reach_state false % 0.21/0.44 % --bmc1_out_unsat_core false % 0.21/0.44 % --bmc1_aig_witness_out false % 0.21/0.44 % --bmc1_verbose false % 0.21/0.44 % --bmc1_dump_clauses_tptp false % 0.21/0.45 % --bmc1_dump_unsat_core_tptp false % 0.21/0.45 % --bmc1_dump_file - % 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128 % 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6 % 0.21/0.45 % --bmc1_ucm_extend_mode 1 % 0.21/0.45 % --bmc1_ucm_init_mode 2 % 0.21/0.45 % --bmc1_ucm_cone_mode none % 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0 % 0.21/0.45 % --bmc1_ucm_relax_model 4 % 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true % 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false % 0.21/0.45 % --bmc1_ucm_layered_model none % 0.21/0.45 % --bmc1_ucm_max_lemma_size 10 % 0.21/0.45 % 0.21/0.45 % ------ AIG Options % 0.21/0.45 % 0.21/0.45 % --aig_mode false % 0.21/0.45 % 0.21/0.45 % ------ Instantiation Options % 0.21/0.45 % 0.21/0.45 % --instantiation_flag true % 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.21/0.45 % --inst_solver_per_active 750 % 0.21/0.45 % --inst_solver_calls_frac 0.5 % 0.21/0.45 % --inst_passive_queue_type priority_queues % 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.21/0.45 % --inst_passive_queues_freq [25;2] % 0.21/0.45 % --inst_dismatching true % 0.21/0.45 % --inst_eager_unprocessed_to_passive true % 0.21/0.45 % --inst_prop_sim_given true % 0.21/0.45 % --inst_prop_sim_new false % 0.21/0.45 % --inst_orphan_elimination true % 0.21/0.45 % --inst_learning_loop_flag true % 0.21/0.45 % --inst_learning_start 3000 % 0.21/0.45 % --inst_learning_factor 2 % 0.21/0.45 % --inst_start_prop_sim_after_learn 3 % 0.21/0.45 % --inst_sel_renew solver % 0.21/0.45 % --inst_lit_activity_flag true % 0.21/0.45 % --inst_out_proof true % 0.21/0.45 % 0.21/0.45 % ------ Resolution Options % 0.21/0.45 % 0.21/0.45 % --resolution_flag true % 0.21/0.45 % --res_lit_sel kbo_max % 0.21/0.45 % --res_to_prop_solver none % 0.21/0.45 % --res_prop_simpl_new false % 0.21/0.45 % --res_prop_simpl_given false % 0.21/0.45 % --res_passive_queue_type priority_queues % 0.21/0.45 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 0.21/0.45 % --res_passive_queues_freq [15;5] % 0.21/0.45 % --res_forward_subs full % 0.21/0.45 % --res_backward_subs full % 0.21/0.45 % --res_forward_subs_resolution true % 0.21/0.45 % --res_backward_subs_resolution true % 0.21/0.45 % --res_orphan_elimination false % 0.21/0.45 % --res_time_limit 1000. % 0.21/0.45 % --res_out_proof true % 0.21/0.45 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_de0fbf.s % 0.21/0.45 % --modulo true % 0.21/0.45 % 0.21/0.45 % ------ Combination Options % 0.21/0.45 % 0.21/0.45 % --comb_res_mult 1000 % 0.21/0.45 % --comb_inst_mult 300 % 0.21/0.45 % ------ % 0.21/0.45 % 0.21/0.45 % ------ Parsing...% successful % 0.21/0.45 % 0.21/0.45 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e % % 0.21/0.45 % 0.21/0.45 % ------ Proving... % 0.21/0.45 % ------ Problem Properties % 0.21/0.45 % 0.21/0.45 % % 0.21/0.45 % EPR false % 0.21/0.45 % Horn false % 0.21/0.45 % Has equality false % 0.21/0.45 % 0.21/0.45 % % ------ Input Options Time Limit: Unbounded % 0.21/0.45 % 0.21/0.45 % 0.21/0.45 % % ------ Current options: % 0.21/0.45 % 0.21/0.45 % ------ Input Options % 0.21/0.45 % 0.21/0.45 % --out_options all % 0.21/0.45 % --tptp_safe_out true % 0.21/0.45 % --problem_path "" % 0.21/0.45 % --include_path "" % 0.21/0.45 % --clausifier .//eprover % 0.21/0.45 % --clausifier_options --tstp-format % 0.21/0.45 % --stdin false % 0.21/0.45 % --dbg_backtrace false % 0.21/0.45 % --dbg_dump_prop_clauses false % 0.21/0.45 % --dbg_dump_prop_clauses_file - % 0.21/0.45 % --dbg_out_stat false % 0.21/0.45 % 0.21/0.45 % ------ General Options % 0.21/0.45 % 0.21/0.45 % --fof false % 0.21/0.45 % --time_out_real 150. % 0.21/0.45 % --time_out_prep_mult 0.2 % 0.21/0.45 % --time_out_virtual -1. % 0.21/0.45 % --schedule none % 0.21/0.45 % --ground_splitting input % 0.21/0.45 % --splitting_nvd 16 % 0.21/0.45 % --non_eq_to_eq false % 0.21/0.45 % --prep_gs_sim true % 0.21/0.45 % --prep_unflatten false % 0.21/0.45 % --prep_res_sim true % 0.21/0.45 % --prep_upred true % 0.21/0.45 % --res_sim_input true % 0.21/0.45 % --clause_weak_htbl true % 0.21/0.45 % --gc_record_bc_elim false % 0.21/0.45 % --symbol_type_check false % 0.21/0.45 % --clausify_out false % 0.21/0.45 % --large_theory_mode false % 0.21/0.45 % --prep_sem_filter none % 0.21/0.45 % --prep_sem_filter_out false % 0.21/0.45 % --preprocessed_out false % 0.21/0.45 % --sub_typing false % 0.21/0.45 % --brand_transform false % 0.21/0.45 % --pure_diseq_elim true % 0.21/0.45 % --min_unsat_core false % 0.21/0.45 % --pred_elim true % 0.21/0.45 % --add_important_lit false % 0.21/0.45 % --soft_assumptions false % 0.21/0.45 % --reset_solvers false % 0.21/0.45 % --bc_imp_inh [] % 0.21/0.45 % --conj_cone_tolerance 1.5 % 0.21/0.45 % --prolific_symb_bound 500 % 0.21/0.45 % --lt_threshold 2000 % 0.21/0.45 % 0.21/0.45 % ------ SAT Options % 0.21/0.45 % 0.21/0.45 % --sat_mode false % 0.21/0.45 % --sat_fm_restart_options "" % 0.21/0.45 % --sat_gr_def false % 0.21/0.45 % --sat_epr_types true % 0.21/0.45 % --sat_non_cyclic_types false % 0.21/0.45 % --sat_finite_models false % 0.21/0.45 % --sat_fm_lemmas false % 0.21/0.45 % --sat_fm_prep false % 0.21/0.45 % --sat_fm_uc_incr true % 0.21/0.45 % --sat_out_model small % 0.21/0.45 % --sat_out_clauses false % 0.21/0.45 % 0.21/0.45 % ------ QBF Options % 0.21/0.45 % 0.21/0.45 % --qbf_mode false % 0.21/0.45 % --qbf_elim_univ true % 0.21/0.45 % --qbf_sk_in true % 0.21/0.45 % --qbf_pred_elim true % 0.21/0.45 % --qbf_split 32 % 0.21/0.45 % 0.21/0.45 % ------ BMC1 Options % 0.21/0.45 % 0.21/0.45 % --bmc1_incremental false % 0.21/0.45 % --bmc1_axioms reachable_all % 0.21/0.45 % --bmc1_min_bound 0 % 0.21/0.45 % --bmc1_max_bound -1 % 0.21/0.45 % --bmc1_max_bound_default -1 % 0.21/0.45 % --bmc1_symbol_reachability true % 0.21/0.45 % --bmc1_property_lemmas false % 0.21/0.45 % --bmc1_k_induction false % 0.21/0.45 % --bmc1_non_equiv_states false % 0.21/0.45 % --bmc1_deadlock false % 0.21/0.45 % --bmc1_ucm false % 0.21/0.45 % --bmc1_add_unsat_core none % 0.21/0.45 % --bmc1_unsat_core_children false % 0.21/0.45 % --bmc1_unsat_core_extrapolate_axioms false % 0.21/0.45 % --bmc1_out_stat full % 0.21/0.45 % --bmc1_ground_init false % 0.21/0.45 % --bmc1_pre_inst_next_state false % 0.21/0.45 % --bmc1_pre_inst_state false % 0.21/0.45 % --bmc1_pre_inst_reach_state false % 0.21/0.45 % --bmc1_out_unsat_core false % 0.21/0.45 % --bmc1_aig_witness_out false % 0.21/0.45 % --bmc1_verbose false % 0.21/0.45 % --bmc1_dump_clauses_tptp false % 0.21/0.45 % --bmc1_dump_unsat_core_tptp false % 0.21/0.45 % --bmc1_dump_file - % 0.21/0.45 % --bmc1_ucm_expand_uc_limit 128 % 0.21/0.45 % --bmc1_ucm_n_expand_iterations 6 % 0.21/0.45 % --bmc1_ucm_extend_mode 1 % 0.21/0.45 % --bmc1_ucm_init_mode 2 % 0.21/0.45 % --bmc1_ucm_cone_mode none % 0.21/0.45 % --bmc1_ucm_reduced_relation_type 0 % 0.21/0.45 % --bmc1_ucm_relax_model 4 % 0.21/0.45 % --bmc1_ucm_full_tr_after_sat true % 0.21/0.45 % --bmc1_ucm_expand_neg_assumptions false % 0.21/0.45 % --bmc1_ucm_layered_model none % 0.21/0.45 % --bmc1_ucm_max_lemma_size 10 % 0.21/0.45 % 0.21/0.45 % ------ AIG Options % 0.21/0.45 % 0.21/0.45 % --aig_mode false % 0.21/0.45 % 0.21/0.45 % ------ Instantiation Options % 0.21/0.45 % 0.21/0.45 % --instantiation_flag true % 0.21/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.21/0.45 % --inst_solver_per_active 750 % 0.21/0.45 % --inst_solver_calls_frac 0.5 % 0.21/0.45 % --inst_passive_queue_type priority_queues % 0.21/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.21/0.45 % --inst_passive_queues_freq [25;2] % 0.21/0.45 % --inst_dismatching true % 0.21/0.45 % --inst_eager_unprocessed_to_passive true % 0.21/0.45 % --inst_prop_sim_given true % 20.16/20.36 % --inst_prop_sim_new false % 20.16/20.36 % --inst_orphan_elimination true % 20.16/20.36 % --inst_learning_loop_flag true % 20.16/20.36 % --inst_learning_start 3000 % 20.16/20.36 % --inst_learning_factor 2 % 20.16/20.36 % --inst_start_prop_sim_after_learn 3 % 20.16/20.36 % --inst_sel_renew solver % 20.16/20.36 % --inst_lit_activity_flag true % 20.16/20.36 % --inst_out_proof true % 20.16/20.36 % 20.16/20.36 % ------ Resolution Options % 20.16/20.36 % 20.16/20.36 % --resolution_flag true % 20.16/20.36 % --res_lit_sel kbo_max % 20.16/20.36 % --res_to_prop_solver none % 20.16/20.36 % --res_prop_simpl_new false % 20.16/20.36 % --res_prop_simpl_given false % 20.16/20.36 % --res_passive_queue_type priority_queues % 20.16/20.36 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 20.16/20.36 % --res_passive_queues_freq [15;5] % 20.16/20.36 % --res_forward_subs full % 20.16/20.36 % --res_backward_subs full % 20.16/20.36 % --res_forward_subs_resolution true % 20.16/20.36 % --res_backward_subs_resolution true % 20.16/20.36 % --res_orphan_elimination false % 20.16/20.36 % --res_time_limit 1000. % 20.16/20.36 % --res_out_proof true % 20.16/20.36 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_de0fbf.s % 20.16/20.36 % --modulo true % 20.16/20.36 % 20.16/20.36 % ------ Combination Options % 20.16/20.36 % 20.16/20.36 % --comb_res_mult 1000 % 20.16/20.36 % --comb_inst_mult 300 % 20.16/20.36 % ------ % 20.16/20.36 % 20.16/20.36 % 20.16/20.36 % 20.16/20.36 % ------ Proving... % 20.16/20.36 % warning: shown sat in sat incomplete mode % 20.16/20.36 % % 20.16/20.36 % 20.16/20.36 % 20.16/20.36 ------ Building Model...Done % 20.16/20.36 % 20.16/20.36 %------ The model is defined over ground terms (initial term algebra). % 20.16/20.36 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 20.16/20.36 %------ where \phi is a formula over the term algebra. % 20.16/20.36 %------ If we have equality in the problem then it is also defined as a predicate above, % 20.16/20.36 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 20.16/20.36 %------ See help for --sat_out_model for different model outputs. % 20.16/20.36 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 20.16/20.36 %------ where the first argument stands for the sort ($i in the unsorted case) % 20.16/20.36 % 20.16/20.36 % 20.16/20.36 % 20.16/20.36 % 20.16/20.36 %------ Negative definition of ssSkP0 % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1,X2] : % 20.16/20.36 ( ~(ssSkP0(X0,X1,X2)) <=> % 20.16/20.36 $false % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Positive definition of event % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1] : % 20.16/20.36 ( event(X0,X1) <=> % 20.16/20.36 ( % 20.16/20.36 ? [X2,X3] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf19(skc59,X2,X3) ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Positive definition of agent % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1,X2] : % 20.16/20.36 ( agent(X0,X1,X2) <=> % 20.16/20.36 ( % 20.16/20.36 ? [X3,X4] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf19(skc59,X3,X4) & X2=skf20(skc59,X4,X3) ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Negative definition of patient % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1,X2] : % 20.16/20.36 ( ~(patient(X0,X1,X2)) <=> % 20.16/20.36 $false % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Negative definition of present % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1] : % 20.16/20.36 ( ~(present(X0,X1)) <=> % 20.16/20.36 $false % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Negative definition of nonreflexive % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1] : % 20.16/20.36 ( ~(nonreflexive(X0,X1)) <=> % 20.16/20.36 $false % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Negative definition of fire % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1] : % 20.16/20.36 ( ~(fire(X0,X1)) <=> % 20.16/20.36 $false % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Negative definition of from_loc % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1,X2] : % 20.16/20.36 ( ~(from_loc(X0,X1,X2)) <=> % 20.16/20.36 $false % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Positive definition of man % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1] : % 20.16/20.36 ( man(X0,X1) <=> % 20.16/20.36 ( % 20.16/20.36 ? [X2,X3] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf20(skc59,X2,X3) ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 | % 20.16/20.36 ? [X2,X3] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf18(skc59,X2,X3) ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Positive definition of cannon % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1] : % 20.16/20.36 ( cannon(X0,X1) <=> % 20.16/20.36 ( % 20.16/20.36 ? [X2,X3] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf21(skc59,X2,X3) ) % 20.16/20.36 & % 20.16/20.36 ( X2!=skc61 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 | % 20.16/20.36 ? [X2,X3] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf16(skc59,X2,X3) ) % 20.16/20.36 & % 20.16/20.36 ( X2!=skc61 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Positive definition of of % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1,X2] : % 20.16/20.36 ( of(X0,X1,X2) <=> % 20.16/20.36 ( % 20.16/20.36 ? [X3] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf21(skc59,skc61,X3) & X2=skc61 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 | % 20.16/20.36 ? [X3] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf16(skc59,skc61,X3) & X2=skc61 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Positive definition of member % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1,X2] : % 20.16/20.36 ( member(X0,X1,X2) <=> % 20.16/20.36 ( % 20.16/20.36 ? [X3] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc6 & X1=skf25(X3,skc6,skc7) & X2=skc7 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 | % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf27(skc59,skc60) & X2=skc60 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 | % 20.16/20.36 ? [X3] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf14(X2,skc59,X3) ) % 20.16/20.36 & % 20.16/20.36 ( X2!=skc60 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 | % 20.16/20.36 ? [X3] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf25(X3,skc59,skc60) & X2=skc60 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 | % 20.16/20.36 ? [X3] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf25(X3,skc59,X2) ) % 20.16/20.36 & % 20.16/20.36 ( X2!=skc60 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 | % 20.16/20.36 ? [X3] : % 20.16/20.36 ( % 20.16/20.36 ( X1=skf25(X3,X0,X2) ) % 20.16/20.36 & % 20.16/20.36 ( X0!=skc6 | X2!=skc7 ) % 20.16/20.36 & % 20.16/20.36 ( X0!=skc59 ) % 20.16/20.36 & % 20.16/20.36 ( X0!=skc59 | X2!=skc60 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Positive definition of ssSkP1 % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1,X2] : % 20.16/20.36 ( ssSkP1(X0,X1,X2) <=> % 20.16/20.36 $false % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Positive definition of ssSkC0 % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 ( ssSkC0 <=> % 20.16/20.36 $true % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Negative definition of actual_world % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0] : % 20.16/20.36 ( ~(actual_world(X0)) <=> % 20.16/20.36 $false % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Positive definition of male % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1] : % 20.16/20.36 ( male(X0,X1) <=> % 20.16/20.36 ( % 20.16/20.36 ( % 20.16/20.36 ( X0=skc6 & X1=skc8 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 | % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skc61 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Positive definition of group % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1] : % 20.16/20.36 ( group(X0,X1) <=> % 20.16/20.36 ( % 20.16/20.36 ( % 20.16/20.36 ( X0=skc6 & X1=skc7 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 | % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skc60 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Negative definition of six % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1] : % 20.16/20.36 ( ~(six(X0,X1)) <=> % 20.16/20.36 $false % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 %------ Negative definition of shot % 20.16/20.36 fof(lit_def,axiom, % 20.16/20.36 (! [X0,X1] : % 20.16/20.36 ( ~(shot(X0,X1)) <=> % 20.16/20.36 ( % 20.16/20.36 ? [X2] : % 20.16/20.36 ( % 20.16/20.36 ( X0=skc59 & X1=skf27(skc59,X2) ) % 20.16/20.36 & % 20.16/20.36 ( X2!=skc60 ) % 20.16/20.36 ) % 20.16/20.36 % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ) % 20.16/20.36 ). % 20.16/20.36 % 20.16/20.36 % 20.16/20.36 % 20.16/20.36 % ------ Statistics % 20.16/20.36 % 20.16/20.36 % ------ General % 20.16/20.36 % 20.16/20.36 % num_of_input_clauses: 40 % 20.16/20.36 % num_of_input_neg_conjectures: 40 % 20.16/20.36 % num_of_splits: 0 % 20.16/20.36 % num_of_split_atoms: 0 % 20.16/20.36 % num_of_sem_filtered_clauses: 0 % 20.16/20.36 % num_of_subtypes: 0 % 20.16/20.36 % monotx_restored_types: 0 % 20.16/20.36 % sat_num_of_epr_types: 0 % 20.16/20.36 % sat_num_of_non_cyclic_types: 0 % 20.16/20.36 % sat_guarded_non_collapsed_types: 0 % 20.16/20.36 % is_epr: 0 % 20.16/20.36 % is_horn: 0 % 20.16/20.36 % has_eq: 0 % 20.16/20.36 % num_pure_diseq_elim: 0 % 20.16/20.36 % simp_replaced_by: 0 % 20.16/20.36 % res_preprocessed: 80 % 20.16/20.36 % prep_upred: 0 % 20.16/20.36 % prep_unflattend: 0 % 20.16/20.36 % pred_elim_cands: 0 % 20.16/20.36 % pred_elim: 0 % 20.16/20.36 % pred_elim_cl: 0 % 20.16/20.36 % pred_elim_cycles: 0 % 20.16/20.36 % forced_gc_time: 0 % 20.16/20.36 % gc_basic_clause_elim: 0 % 20.16/20.36 % parsing_time: 0.002 % 20.16/20.36 % sem_filter_time: 0. % 20.16/20.36 % pred_elim_time: 0. % 20.16/20.36 % out_proof_time: 0. % 20.16/20.36 % monotx_time: 0. % 20.16/20.36 % subtype_inf_time: 0. % 20.16/20.36 % unif_index_cands_time: 0.013 % 20.16/20.36 % unif_index_add_time: 0.01 % 20.16/20.36 % total_time: 19.934 % 20.16/20.36 % num_of_symbols: 60 % 20.16/20.36 % num_of_terms: 13220 % 20.16/20.36 % 20.16/20.36 % ------ Propositional Solver % 20.16/20.36 % 20.16/20.36 % prop_solver_calls: 14 % 20.16/20.36 % prop_fast_solver_calls: 459 % 20.16/20.36 % prop_num_of_clauses: 779 % 20.16/20.36 % prop_preprocess_simplified: 1411 % 20.16/20.36 % prop_fo_subsumed: 0 % 20.16/20.36 % prop_solver_time: 0. % 20.16/20.36 % prop_fast_solver_time: 0. % 20.16/20.36 % prop_unsat_core_time: 0. % 20.16/20.36 % 20.16/20.36 % ------ QBF % 20.16/20.36 % 20.16/20.36 % qbf_q_res: 0 % 20.16/20.36 % qbf_num_tautologies: 0 % 20.16/20.36 % qbf_prep_cycles: 0 % 20.16/20.36 % 20.16/20.36 % ------ BMC1 % 20.16/20.36 % 20.16/20.36 % bmc1_current_bound: -1 % 20.16/20.36 % bmc1_last_solved_bound: -1 % 20.16/20.36 % bmc1_unsat_core_size: -1 % 20.16/20.36 % bmc1_unsat_core_parents_size: -1 % 20.16/20.36 % bmc1_merge_next_fun: 0 % 20.16/20.36 % bmc1_unsat_core_clauses_time: 0. % 20.16/20.36 % 20.16/20.36 % ------ Instantiation % 20.16/20.36 % 20.16/20.36 % inst_num_of_clauses: 398 % 20.16/20.36 % inst_num_in_passive: 0 % 20.16/20.36 % inst_num_in_active: 398 % 20.16/20.36 % inst_num_in_unprocessed: 0 % 20.16/20.36 % inst_num_of_loops: 477 % 20.16/20.36 % inst_num_of_learning_restarts: 0 % 20.16/20.36 % inst_num_moves_active_passive: 66 % 20.16/20.36 % inst_lit_activity: 78 % 20.16/20.36 % inst_lit_activity_moves: 0 % 20.16/20.36 % inst_num_tautologies: 0 % 20.16/20.36 % inst_num_prop_implied: 0 % 20.16/20.36 % inst_num_existing_simplified: 0 % 20.16/20.36 % inst_num_eq_res_simplified: 0 % 20.16/20.36 % inst_num_child_elim: 0 % 20.16/20.36 % inst_num_of_dismatching_blockings: 45 % 20.16/20.36 % inst_num_of_non_proper_insts: 619 % 20.16/20.36 % inst_num_of_duplicates: 120 % 20.16/20.36 % inst_inst_num_from_inst_to_res: 0 % 20.16/20.36 % inst_dismatching_checking_time: 0. % 20.16/20.36 % 20.16/20.36 % ------ Resolution % 20.16/20.36 % 20.16/20.36 % res_num_of_clauses: 90974 % 20.16/20.36 % res_num_in_passive: 89715 % 20.16/20.36 % res_num_in_active: 1263 % 20.16/20.36 % res_num_of_loops: 2000 % 20.16/20.36 % res_forward_subset_subsumed: 104159 % 20.16/20.36 % res_backward_subset_subsumed: 65 % 20.16/20.36 % res_forward_subsumed: 631 % 20.16/20.36 % res_backward_subsumed: 41 % 20.16/20.36 % res_forward_subsumption_resolution: 256 % 20.16/20.36 % res_backward_subsumption_resolution: 0 % 20.16/20.36 % res_clause_to_clause_subsumption: 10988 % 20.16/20.36 % res_orphan_elimination: 0 % 20.16/20.36 % res_tautology_del: 5226 % 20.16/20.36 % res_num_eq_res_simplified: 0 % 20.16/20.36 % res_num_sel_changes: 0 % 20.16/20.36 % res_moves_from_active_to_pass: 0 % 20.16/20.36 % 20.16/20.36 % Status Unknown % 20.21/20.40 % Orienting using strategy ClausalAll % 20.21/20.40 % Orientation found % 20.21/20.40 % 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_de0fbf.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_616d88.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_9ce46d | grep -v "SZS" % 20.21/20.42 % 20.21/20.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 20.21/20.42 % 20.21/20.42 % % 20.21/20.42 % ------ iProver source info % 20.21/20.42 % 20.21/20.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 20.21/20.42 % git: non_committed_changes: true % 20.21/20.42 % git: last_make_outside_of_git: true % 20.21/20.42 % 20.21/20.42 % % 20.21/20.42 % ------ Input Options % 20.21/20.42 % 20.21/20.42 % --out_options all % 20.21/20.42 % --tptp_safe_out true % 20.21/20.42 % --problem_path "" % 20.21/20.42 % --include_path "" % 20.21/20.42 % --clausifier .//eprover % 20.21/20.42 % --clausifier_options --tstp-format % 20.21/20.42 % --stdin false % 20.21/20.42 % --dbg_backtrace false % 20.21/20.42 % --dbg_dump_prop_clauses false % 20.21/20.42 % --dbg_dump_prop_clauses_file - % 20.21/20.42 % --dbg_out_stat false % 20.21/20.42 % 20.21/20.42 % ------ General Options % 20.21/20.42 % 20.21/20.42 % --fof false % 20.21/20.42 % --time_out_real 150. % 20.21/20.42 % --time_out_prep_mult 0.2 % 20.21/20.42 % --time_out_virtual -1. % 20.21/20.42 % --schedule none % 20.21/20.42 % --ground_splitting input % 20.21/20.42 % --splitting_nvd 16 % 20.21/20.42 % --non_eq_to_eq false % 20.21/20.42 % --prep_gs_sim true % 20.21/20.42 % --prep_unflatten false % 20.21/20.42 % --prep_res_sim true % 20.21/20.42 % --prep_upred true % 20.21/20.42 % --res_sim_input true % 20.21/20.42 % --clause_weak_htbl true % 20.21/20.42 % --gc_record_bc_elim false % 20.21/20.42 % --symbol_type_check false % 20.21/20.42 % --clausify_out false % 20.21/20.42 % --large_theory_mode false % 20.21/20.42 % --prep_sem_filter none % 20.21/20.42 % --prep_sem_filter_out false % 20.21/20.42 % --preprocessed_out false % 20.21/20.42 % --sub_typing false % 20.21/20.42 % --brand_transform false % 20.21/20.42 % --pure_diseq_elim true % 20.21/20.42 % --min_unsat_core false % 20.21/20.42 % --pred_elim true % 20.21/20.42 % --add_important_lit false % 20.21/20.42 % --soft_assumptions false % 20.21/20.42 % --reset_solvers false % 20.21/20.42 % --bc_imp_inh [] % 20.21/20.42 % --conj_cone_tolerance 1.5 % 20.21/20.42 % --prolific_symb_bound 500 % 20.21/20.42 % --lt_threshold 2000 % 20.21/20.42 % 20.21/20.42 % ------ SAT Options % 20.21/20.42 % 20.21/20.42 % --sat_mode false % 20.21/20.42 % --sat_fm_restart_options "" % 20.21/20.42 % --sat_gr_def false % 20.21/20.42 % --sat_epr_types true % 20.21/20.42 % --sat_non_cyclic_types false % 20.21/20.42 % --sat_finite_models false % 20.21/20.42 % --sat_fm_lemmas false % 20.21/20.42 % --sat_fm_prep false % 20.21/20.42 % --sat_fm_uc_incr true % 20.21/20.42 % --sat_out_model small % 20.21/20.42 % --sat_out_clauses false % 20.21/20.42 % 20.21/20.42 % ------ QBF Options % 20.21/20.42 % 20.21/20.42 % --qbf_mode false % 20.21/20.42 % --qbf_elim_univ true % 20.21/20.42 % --qbf_sk_in true % 20.21/20.42 % --qbf_pred_elim true % 20.21/20.42 % --qbf_split 32 % 20.21/20.42 % 20.21/20.42 % ------ BMC1 Options % 20.21/20.42 % 20.21/20.42 % --bmc1_incremental false % 20.21/20.42 % --bmc1_axioms reachable_all % 20.21/20.42 % --bmc1_min_bound 0 % 20.21/20.42 % --bmc1_max_bound -1 % 20.21/20.42 % --bmc1_max_bound_default -1 % 20.21/20.42 % --bmc1_symbol_reachability true % 20.21/20.42 % --bmc1_property_lemmas false % 20.21/20.42 % --bmc1_k_induction false % 20.21/20.42 % --bmc1_non_equiv_states false % 20.21/20.42 % --bmc1_deadlock false % 20.21/20.42 % --bmc1_ucm false % 20.21/20.42 % --bmc1_add_unsat_core none % 20.21/20.42 % --bmc1_unsat_core_children false % 20.21/20.42 % --bmc1_unsat_core_extrapolate_axioms false % 20.21/20.42 % --bmc1_out_stat full % 20.21/20.42 % --bmc1_ground_init false % 20.21/20.42 % --bmc1_pre_inst_next_state false % 20.21/20.42 % --bmc1_pre_inst_state false % 20.21/20.42 % --bmc1_pre_inst_reach_state false % 20.21/20.42 % --bmc1_out_unsat_core false % 20.21/20.42 % --bmc1_aig_witness_out false % 20.21/20.42 % --bmc1_verbose false % 20.21/20.42 % --bmc1_dump_clauses_tptp false % 20.21/20.43 % --bmc1_dump_unsat_core_tptp false % 20.21/20.43 % --bmc1_dump_file - % 20.21/20.43 % --bmc1_ucm_expand_uc_limit 128 % 20.21/20.43 % --bmc1_ucm_n_expand_iterations 6 % 20.21/20.43 % --bmc1_ucm_extend_mode 1 % 20.21/20.43 % --bmc1_ucm_init_mode 2 % 20.21/20.43 % --bmc1_ucm_cone_mode none % 20.21/20.43 % --bmc1_ucm_reduced_relation_type 0 % 20.21/20.43 % --bmc1_ucm_relax_model 4 % 20.21/20.43 % --bmc1_ucm_full_tr_after_sat true % 20.21/20.43 % --bmc1_ucm_expand_neg_assumptions false % 20.21/20.43 % --bmc1_ucm_layered_model none % 20.21/20.43 % --bmc1_ucm_max_lemma_size 10 % 20.21/20.43 % 20.21/20.43 % ------ AIG Options % 20.21/20.43 % 20.21/20.43 % --aig_mode false % 20.21/20.43 % 20.21/20.43 % ------ Instantiation Options % 20.21/20.43 % 20.21/20.43 % --instantiation_flag true % 20.21/20.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 20.21/20.43 % --inst_solver_per_active 750 % 20.21/20.43 % --inst_solver_calls_frac 0.5 % 20.21/20.43 % --inst_passive_queue_type priority_queues % 20.21/20.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 20.21/20.43 % --inst_passive_queues_freq [25;2] % 20.21/20.43 % --inst_dismatching true % 20.21/20.43 % --inst_eager_unprocessed_to_passive true % 20.21/20.43 % --inst_prop_sim_given true % 20.21/20.43 % --inst_prop_sim_new false % 20.21/20.43 % --inst_orphan_elimination true % 20.21/20.43 % --inst_learning_loop_flag true % 20.21/20.43 % --inst_learning_start 3000 % 20.21/20.43 % --inst_learning_factor 2 % 20.21/20.43 % --inst_start_prop_sim_after_learn 3 % 20.21/20.43 % --inst_sel_renew solver % 20.21/20.43 % --inst_lit_activity_flag true % 20.21/20.43 % --inst_out_proof true % 20.21/20.43 % 20.21/20.43 % ------ Resolution Options % 20.21/20.43 % 20.21/20.43 % --resolution_flag true % 20.21/20.43 % --res_lit_sel kbo_max % 20.21/20.43 % --res_to_prop_solver none % 20.21/20.43 % --res_prop_simpl_new false % 20.21/20.43 % --res_prop_simpl_given false % 20.21/20.43 % --res_passive_queue_type priority_queues % 20.21/20.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 20.21/20.43 % --res_passive_queues_freq [15;5] % 20.21/20.43 % --res_forward_subs full % 20.21/20.43 % --res_backward_subs full % 20.21/20.43 % --res_forward_subs_resolution true % 20.21/20.43 % --res_backward_subs_resolution true % 20.21/20.43 % --res_orphan_elimination false % 20.21/20.43 % --res_time_limit 1000. % 20.21/20.43 % --res_out_proof true % 20.21/20.43 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_de0fbf.s % 20.21/20.43 % --modulo true % 20.21/20.43 % 20.21/20.43 % ------ Combination Options % 20.21/20.43 % 20.21/20.43 % --comb_res_mult 1000 % 20.21/20.43 % --comb_inst_mult 300 % 20.21/20.43 % ------ % 20.21/20.43 % 20.21/20.43 % ------ Parsing...% successful % 20.21/20.43 % 20.21/20.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e % % 20.21/20.43 % 20.21/20.43 % ------ Proving... % 20.21/20.43 % ------ Problem Properties % 20.21/20.43 % 20.21/20.43 % % 20.21/20.43 % EPR false % 20.21/20.43 % Horn false % 20.21/20.43 % Has equality false % 20.21/20.43 % 20.21/20.43 % % ------ Input Options Time Limit: Unbounded % 20.21/20.43 % 20.21/20.43 % 20.21/20.43 % % ------ Current options: % 20.21/20.43 % 20.21/20.43 % ------ Input Options % 20.21/20.43 % 20.21/20.43 % --out_options all % 20.21/20.43 % --tptp_safe_out true % 20.21/20.43 % --problem_path "" % 20.21/20.43 % --include_path "" % 20.21/20.43 % --clausifier .//eprover % 20.21/20.43 % --clausifier_options --tstp-format % 20.21/20.43 % --stdin false % 20.21/20.43 % --dbg_backtrace false % 20.21/20.43 % --dbg_dump_prop_clauses false % 20.21/20.43 % --dbg_dump_prop_clauses_file - % 20.21/20.43 % --dbg_out_stat false % 20.21/20.43 % 20.21/20.43 % ------ General Options % 20.21/20.43 % 20.21/20.43 % --fof false % 20.21/20.43 % --time_out_real 150. % 20.21/20.43 % --time_out_prep_mult 0.2 % 20.21/20.43 % --time_out_virtual -1. % 20.21/20.43 % --schedule none % 20.21/20.43 % --ground_splitting input % 20.21/20.43 % --splitting_nvd 16 % 20.21/20.43 % --non_eq_to_eq false % 20.21/20.43 % --prep_gs_sim true % 20.21/20.43 % --prep_unflatten false % 20.21/20.43 % --prep_res_sim true % 20.21/20.43 % --prep_upred true % 20.21/20.43 % --res_sim_input true % 20.21/20.43 % --clause_weak_htbl true % 20.21/20.43 % --gc_record_bc_elim false % 20.21/20.43 % --symbol_type_check false % 20.21/20.43 % --clausify_out false % 20.21/20.43 % --large_theory_mode false % 20.21/20.43 % --prep_sem_filter none % 20.21/20.43 % --prep_sem_filter_out false % 20.21/20.43 % --preprocessed_out false % 20.21/20.43 % --sub_typing false % 20.21/20.43 % --brand_transform false % 20.21/20.43 % --pure_diseq_elim true % 20.21/20.43 % --min_unsat_core false % 20.21/20.43 % --pred_elim true % 20.21/20.43 % --add_important_lit false % 20.21/20.43 % --soft_assumptions false % 20.21/20.43 % --reset_solvers false % 20.21/20.43 % --bc_imp_inh [] % 20.21/20.43 % --conj_cone_tolerance 1.5 % 20.21/20.43 % --prolific_symb_bound 500 % 20.21/20.43 % --lt_threshold 2000 % 20.21/20.43 % 20.21/20.43 % ------ SAT Options % 20.21/20.43 % 20.21/20.43 % --sat_mode false % 20.21/20.43 % --sat_fm_restart_options "" % 20.21/20.43 % --sat_gr_def false % 20.21/20.43 % --sat_epr_types true % 20.21/20.43 % --sat_non_cyclic_types false % 20.21/20.43 % --sat_finite_models false % 20.21/20.43 % --sat_fm_lemmas false % 20.21/20.43 % --sat_fm_prep false % 20.21/20.43 % --sat_fm_uc_incr true % 20.21/20.43 % --sat_out_model small % 20.21/20.43 % --sat_out_clauses false % 20.21/20.43 % 20.21/20.43 % ------ QBF Options % 20.21/20.43 % 20.21/20.43 % --qbf_mode false % 20.21/20.43 % --qbf_elim_univ true % 20.21/20.43 % --qbf_sk_in true % 20.21/20.43 % --qbf_pred_elim true % 20.21/20.43 % --qbf_split 32 % 20.21/20.43 % 20.21/20.43 % ------ BMC1 Options % 20.21/20.43 % 20.21/20.43 % --bmc1_incremental false % 20.21/20.43 % --bmc1_axioms reachable_all % 20.21/20.43 % --bmc1_min_bound 0 % 20.21/20.43 % --bmc1_max_bound -1 % 20.21/20.43 % --bmc1_max_bound_default -1 % 20.21/20.43 % --bmc1_symbol_reachability true % 20.21/20.43 % --bmc1_property_lemmas false % 20.21/20.43 % --bmc1_k_induction false % 20.21/20.43 % --bmc1_non_equiv_states false % 20.21/20.43 % --bmc1_deadlock false % 20.21/20.43 % --bmc1_ucm false % 20.21/20.43 % --bmc1_add_unsat_core none % 20.21/20.43 % --bmc1_unsat_core_children false % 20.21/20.43 % --bmc1_unsat_core_extrapolate_axioms false % 20.21/20.43 % --bmc1_out_stat full % 20.21/20.43 % --bmc1_ground_init false % 20.21/20.43 % --bmc1_pre_inst_next_state false % 20.21/20.43 % --bmc1_pre_inst_state false % 20.21/20.43 % --bmc1_pre_inst_reach_state false % 20.21/20.43 % --bmc1_out_unsat_core false % 20.21/20.43 % --bmc1_aig_witness_out false % 20.21/20.43 % --bmc1_verbose false % 20.21/20.43 % --bmc1_dump_clauses_tptp false % 20.21/20.43 % --bmc1_dump_unsat_core_tptp false % 20.21/20.43 % --bmc1_dump_file - % 20.21/20.43 % --bmc1_ucm_expand_uc_limit 128 % 20.21/20.43 % --bmc1_ucm_n_expand_iterations 6 % 20.21/20.43 % --bmc1_ucm_extend_mode 1 % 20.21/20.43 % --bmc1_ucm_init_mode 2 % 20.21/20.43 % --bmc1_ucm_cone_mode none % 20.21/20.43 % --bmc1_ucm_reduced_relation_type 0 % 20.21/20.43 % --bmc1_ucm_relax_model 4 % 20.21/20.43 % --bmc1_ucm_full_tr_after_sat true % 20.21/20.43 % --bmc1_ucm_expand_neg_assumptions false % 20.21/20.43 % --bmc1_ucm_layered_model none % 20.21/20.43 % --bmc1_ucm_max_lemma_size 10 % 20.21/20.43 % 20.21/20.43 % ------ AIG Options % 20.21/20.43 % 20.21/20.43 % --aig_mode false % 20.21/20.43 % 20.21/20.43 % ------ Instantiation Options % 20.21/20.43 % 20.21/20.43 % --instantiation_flag true % 20.21/20.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 20.21/20.43 % --inst_solver_per_active 750 % 20.21/20.43 % --inst_solver_calls_frac 0.5 % 20.21/20.43 % --inst_passive_queue_type priority_queues % 20.21/20.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 20.21/20.43 % --inst_passive_queues_freq [25;2] % 20.21/20.43 % --inst_dismatching true % 20.21/20.43 % --inst_eager_unprocessed_to_passive true % 20.21/20.43 % --inst_prop_sim_given true % 40.01/40.20 % --inst_prop_sim_new false % 40.01/40.20 % --inst_orphan_elimination true % 40.01/40.20 % --inst_learning_loop_flag true % 40.01/40.20 % --inst_learning_start 3000 % 40.01/40.20 % --inst_learning_factor 2 % 40.01/40.20 % --inst_start_prop_sim_after_learn 3 % 40.01/40.20 % --inst_sel_renew solver % 40.01/40.20 % --inst_lit_activity_flag true % 40.01/40.20 % --inst_out_proof true % 40.01/40.20 % 40.01/40.20 % ------ Resolution Options % 40.01/40.20 % 40.01/40.20 % --resolution_flag true % 40.01/40.20 % --res_lit_sel kbo_max % 40.01/40.20 % --res_to_prop_solver none % 40.01/40.20 % --res_prop_simpl_new false % 40.01/40.20 % --res_prop_simpl_given false % 40.01/40.20 % --res_passive_queue_type priority_queues % 40.01/40.20 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 40.01/40.20 % --res_passive_queues_freq [15;5] % 40.01/40.20 % --res_forward_subs full % 40.01/40.20 % --res_backward_subs full % 40.01/40.20 % --res_forward_subs_resolution true % 40.01/40.20 % --res_backward_subs_resolution true % 40.01/40.20 % --res_orphan_elimination false % 40.01/40.20 % --res_time_limit 1000. % 40.01/40.20 % --res_out_proof true % 40.01/40.20 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_de0fbf.s % 40.01/40.20 % --modulo true % 40.01/40.20 % 40.01/40.20 % ------ Combination Options % 40.01/40.20 % 40.01/40.20 % --comb_res_mult 1000 % 40.01/40.20 % --comb_inst_mult 300 % 40.01/40.20 % ------ % 40.01/40.20 % 40.01/40.20 % 40.01/40.20 % 40.01/40.20 % ------ Proving... % 40.01/40.20 % warning: shown sat in sat incomplete mode % 40.01/40.20 % % 40.01/40.20 % 40.01/40.20 % 40.01/40.20 ------ Building Model...Done % 40.01/40.20 % 40.01/40.20 %------ The model is defined over ground terms (initial term algebra). % 40.01/40.20 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 40.01/40.20 %------ where \phi is a formula over the term algebra. % 40.01/40.20 %------ If we have equality in the problem then it is also defined as a predicate above, % 40.01/40.20 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 40.01/40.20 %------ See help for --sat_out_model for different model outputs. % 40.01/40.20 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 40.01/40.20 %------ where the first argument stands for the sort ($i in the unsorted case) % 40.01/40.20 % 40.01/40.20 % 40.01/40.20 % 40.01/40.20 % 40.01/40.20 %------ Negative definition of ssSkP0 % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1,X2] : % 40.01/40.20 ( ~(ssSkP0(X0,X1,X2)) <=> % 40.01/40.20 $false % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Positive definition of event % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1] : % 40.01/40.20 ( event(X0,X1) <=> % 40.01/40.20 ( % 40.01/40.20 ? [X2,X3] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf19(skc59,X2,X3) ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Positive definition of agent % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1,X2] : % 40.01/40.20 ( agent(X0,X1,X2) <=> % 40.01/40.20 ( % 40.01/40.20 ? [X3,X4] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf19(skc59,X3,X4) & X2=skf20(skc59,X4,X3) ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Negative definition of patient % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1,X2] : % 40.01/40.20 ( ~(patient(X0,X1,X2)) <=> % 40.01/40.20 $false % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Negative definition of present % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1] : % 40.01/40.20 ( ~(present(X0,X1)) <=> % 40.01/40.20 $false % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Negative definition of nonreflexive % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1] : % 40.01/40.20 ( ~(nonreflexive(X0,X1)) <=> % 40.01/40.20 $false % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Negative definition of fire % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1] : % 40.01/40.20 ( ~(fire(X0,X1)) <=> % 40.01/40.20 $false % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Negative definition of from_loc % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1,X2] : % 40.01/40.20 ( ~(from_loc(X0,X1,X2)) <=> % 40.01/40.20 $false % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Positive definition of man % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1] : % 40.01/40.20 ( man(X0,X1) <=> % 40.01/40.20 ( % 40.01/40.20 ? [X2,X3] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf20(skc59,X2,X3) ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 | % 40.01/40.20 ? [X2,X3] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf18(skc59,X2,X3) ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Positive definition of cannon % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1] : % 40.01/40.20 ( cannon(X0,X1) <=> % 40.01/40.20 ( % 40.01/40.20 ? [X2,X3] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf21(skc59,X2,X3) ) % 40.01/40.20 & % 40.01/40.20 ( X2!=skc61 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 | % 40.01/40.20 ? [X2,X3] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf16(skc59,X2,X3) ) % 40.01/40.20 & % 40.01/40.20 ( X2!=skc61 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Positive definition of of % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1,X2] : % 40.01/40.20 ( of(X0,X1,X2) <=> % 40.01/40.20 ( % 40.01/40.20 ? [X3] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf21(skc59,skc61,X3) & X2=skc61 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 | % 40.01/40.20 ? [X3] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf16(skc59,skc61,X3) & X2=skc61 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Positive definition of member % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1,X2] : % 40.01/40.20 ( member(X0,X1,X2) <=> % 40.01/40.20 ( % 40.01/40.20 ? [X3] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc6 & X1=skf25(X3,skc6,skc7) & X2=skc7 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 | % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf27(skc59,skc60) & X2=skc60 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 | % 40.01/40.20 ? [X3] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf14(X2,skc59,X3) ) % 40.01/40.20 & % 40.01/40.20 ( X2!=skc60 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 | % 40.01/40.20 ? [X3] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf25(X3,skc59,skc60) & X2=skc60 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 | % 40.01/40.20 ? [X3] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf25(X3,skc59,X2) ) % 40.01/40.20 & % 40.01/40.20 ( X2!=skc60 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 | % 40.01/40.20 ? [X3] : % 40.01/40.20 ( % 40.01/40.20 ( X1=skf25(X3,X0,X2) ) % 40.01/40.20 & % 40.01/40.20 ( X0!=skc6 | X2!=skc7 ) % 40.01/40.20 & % 40.01/40.20 ( X0!=skc59 ) % 40.01/40.20 & % 40.01/40.20 ( X0!=skc59 | X2!=skc60 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Positive definition of ssSkP1 % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1,X2] : % 40.01/40.20 ( ssSkP1(X0,X1,X2) <=> % 40.01/40.20 $false % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Positive definition of ssSkC0 % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 ( ssSkC0 <=> % 40.01/40.20 $true % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Negative definition of actual_world % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0] : % 40.01/40.20 ( ~(actual_world(X0)) <=> % 40.01/40.20 $false % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Positive definition of male % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1] : % 40.01/40.20 ( male(X0,X1) <=> % 40.01/40.20 ( % 40.01/40.20 ( % 40.01/40.20 ( X0=skc6 & X1=skc8 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 | % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skc61 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Positive definition of group % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1] : % 40.01/40.20 ( group(X0,X1) <=> % 40.01/40.20 ( % 40.01/40.20 ( % 40.01/40.20 ( X0=skc6 & X1=skc7 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 | % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skc60 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Negative definition of six % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1] : % 40.01/40.20 ( ~(six(X0,X1)) <=> % 40.01/40.20 $false % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 %------ Negative definition of shot % 40.01/40.20 fof(lit_def,axiom, % 40.01/40.20 (! [X0,X1] : % 40.01/40.20 ( ~(shot(X0,X1)) <=> % 40.01/40.20 ( % 40.01/40.20 ? [X2] : % 40.01/40.20 ( % 40.01/40.20 ( X0=skc59 & X1=skf27(skc59,X2) ) % 40.01/40.20 & % 40.01/40.20 ( X2!=skc60 ) % 40.01/40.20 ) % 40.01/40.20 % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ) % 40.01/40.20 ). % 40.01/40.20 % 40.01/40.20 % 40.01/40.20 % 40.01/40.20 % ------ Statistics % 40.01/40.20 % 40.01/40.20 % ------ General % 40.01/40.20 % 40.01/40.20 % num_of_input_clauses: 40 % 40.01/40.20 % num_of_input_neg_conjectures: 40 % 40.01/40.20 % num_of_splits: 0 % 40.01/40.20 % num_of_split_atoms: 0 % 40.01/40.20 % num_of_sem_filtered_clauses: 0 % 40.01/40.20 % num_of_subtypes: 0 % 40.01/40.20 % monotx_restored_types: 0 % 40.01/40.20 % sat_num_of_epr_types: 0 % 40.01/40.20 % sat_num_of_non_cyclic_types: 0 % 40.01/40.20 % sat_guarded_non_collapsed_types: 0 % 40.01/40.20 % is_epr: 0 % 40.01/40.20 % is_horn: 0 % 40.01/40.20 % has_eq: 0 % 40.01/40.20 % num_pure_diseq_elim: 0 % 40.01/40.20 % simp_replaced_by: 0 % 40.01/40.20 % res_preprocessed: 80 % 40.01/40.20 % prep_upred: 0 % 40.01/40.20 % prep_unflattend: 0 % 40.01/40.20 % pred_elim_cands: 0 % 40.01/40.20 % pred_elim: 0 % 40.01/40.20 % pred_elim_cl: 0 % 40.01/40.20 % pred_elim_cycles: 0 % 40.01/40.20 % forced_gc_time: 0 % 40.01/40.20 % gc_basic_clause_elim: 0 % 40.01/40.20 % parsing_time: 0.001 % 40.01/40.20 % sem_filter_time: 0. % 40.01/40.20 % pred_elim_time: 0. % 40.01/40.20 % out_proof_time: 0. % 40.01/40.20 % monotx_time: 0. % 40.01/40.20 % subtype_inf_time: 0. % 40.01/40.20 % unif_index_cands_time: 0.013 % 40.01/40.20 % unif_index_add_time: 0.009 % 40.01/40.20 % total_time: 19.786 % 40.01/40.20 % num_of_symbols: 60 % 40.01/40.20 % num_of_terms: 13220 % 40.01/40.20 % 40.01/40.20 % ------ Propositional Solver % 40.01/40.20 % 40.01/40.20 % prop_solver_calls: 14 % 40.01/40.20 % prop_fast_solver_calls: 459 % 40.01/40.20 % prop_num_of_clauses: 779 % 40.01/40.20 % prop_preprocess_simplified: 1411 % 40.01/40.20 % prop_fo_subsumed: 0 % 40.01/40.20 % prop_solver_time: 0. % 40.01/40.20 % prop_fast_solver_time: 0. % 40.01/40.20 % prop_unsat_core_time: 0. % 40.01/40.20 % 40.01/40.20 % ------ QBF % 40.01/40.20 % 40.01/40.20 % qbf_q_res: 0 % 40.01/40.20 % qbf_num_tautologies: 0 % 40.01/40.20 % qbf_prep_cycles: 0 % 40.01/40.20 % 40.01/40.20 % ------ BMC1 % 40.01/40.20 % 40.01/40.20 % bmc1_current_bound: -1 % 40.01/40.20 % bmc1_last_solved_bound: -1 % 40.01/40.20 % bmc1_unsat_core_size: -1 % 40.01/40.20 % bmc1_unsat_core_parents_size: -1 % 40.01/40.20 % bmc1_merge_next_fun: 0 % 40.01/40.20 % bmc1_unsat_core_clauses_time: 0. % 40.01/40.20 % 40.01/40.20 % ------ Instantiation % 40.01/40.20 % 40.01/40.20 % inst_num_of_clauses: 398 % 40.01/40.20 % inst_num_in_passive: 0 % 40.01/40.20 % inst_num_in_active: 398 % 40.01/40.20 % inst_num_in_unprocessed: 0 % 40.01/40.20 % inst_num_of_loops: 477 % 40.01/40.20 % inst_num_of_learning_restarts: 0 % 40.01/40.20 % inst_num_moves_active_passive: 66 % 40.01/40.20 % inst_lit_activity: 78 % 40.01/40.20 % inst_lit_activity_moves: 0 % 40.01/40.20 % inst_num_tautologies: 0 % 40.01/40.20 % inst_num_prop_implied: 0 % 40.01/40.20 % inst_num_existing_simplified: 0 % 40.01/40.20 % inst_num_eq_res_simplified: 0 % 40.01/40.20 % inst_num_child_elim: 0 % 40.01/40.20 % inst_num_of_dismatching_blockings: 45 % 40.01/40.20 % inst_num_of_non_proper_insts: 619 % 40.01/40.20 % inst_num_of_duplicates: 120 % 40.01/40.20 % inst_inst_num_from_inst_to_res: 0 % 40.01/40.20 % inst_dismatching_checking_time: 0. % 40.01/40.20 % 40.01/40.20 % ------ Resolution % 40.01/40.20 % 40.01/40.20 % res_num_of_clauses: 90974 % 40.01/40.20 % res_num_in_passive: 89715 % 40.01/40.20 % res_num_in_active: 1263 % 40.01/40.20 % res_num_of_loops: 2000 % 40.01/40.20 % res_forward_subset_subsumed: 104159 % 40.01/40.20 % res_backward_subset_subsumed: 65 % 40.01/40.20 % res_forward_subsumed: 631 % 40.01/40.20 % res_backward_subsumed: 41 % 40.01/40.20 % res_forward_subsumption_resolution: 256 % 40.01/40.20 % res_backward_subsumption_resolution: 0 % 40.01/40.20 % res_clause_to_clause_subsumption: 10988 % 40.01/40.20 % res_orphan_elimination: 0 % 40.01/40.20 % res_tautology_del: 5226 % 40.01/40.20 % res_num_eq_res_simplified: 0 % 40.01/40.20 % res_num_sel_changes: 0 % 40.01/40.20 % res_moves_from_active_to_pass: 0 % 40.01/40.20 % 40.01/40.20 % Status Unknown % 40.01/40.20 % Last status : % 40.01/40.20 % SZS status Unknown %------------------------------------------------------------------------------