%------------------------------------------------------------------------------ % File : iProverMo---2.5-0.1 % Problem : NLP166-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : iprover_modulo %s %d % Computer : n011.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:41:18 EDT 2022 % Result : Unknown 249.32s 249.56s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.11 % Problem : NLP166-1 : TPTP v8.1.0. Released v2.4.0. % 0.04/0.12 % Command : iprover_modulo %s %d % 0.12/0.33 % Computer : n011.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Fri Jul 1 02:34:03 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % Running in mono-core mode % 0.19/0.40 % Orienting using strategy Equiv(ClausalAll) % 0.19/0.40 % Orientation found % 0.19/0.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_200c34.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_4e4336.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_51e52e | grep -v "SZS" % 0.19/0.42 % 0.19/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 0.19/0.42 % 0.19/0.42 % % 0.19/0.42 % ------ iProver source info % 0.19/0.42 % 0.19/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 0.19/0.42 % git: non_committed_changes: true % 0.19/0.42 % git: last_make_outside_of_git: true % 0.19/0.42 % 0.19/0.42 % % 0.19/0.42 % ------ Input Options % 0.19/0.42 % 0.19/0.42 % --out_options all % 0.19/0.42 % --tptp_safe_out true % 0.19/0.42 % --problem_path "" % 0.19/0.42 % --include_path "" % 0.19/0.42 % --clausifier .//eprover % 0.19/0.42 % --clausifier_options --tstp-format % 0.19/0.42 % --stdin false % 0.19/0.42 % --dbg_backtrace false % 0.19/0.42 % --dbg_dump_prop_clauses false % 0.19/0.42 % --dbg_dump_prop_clauses_file - % 0.19/0.42 % --dbg_out_stat false % 0.19/0.42 % 0.19/0.42 % ------ General Options % 0.19/0.42 % 0.19/0.42 % --fof false % 0.19/0.42 % --time_out_real 150. % 0.19/0.42 % --time_out_prep_mult 0.2 % 0.19/0.42 % --time_out_virtual -1. % 0.19/0.42 % --schedule none % 0.19/0.42 % --ground_splitting input % 0.19/0.42 % --splitting_nvd 16 % 0.19/0.42 % --non_eq_to_eq false % 0.19/0.42 % --prep_gs_sim true % 0.19/0.42 % --prep_unflatten false % 0.19/0.42 % --prep_res_sim true % 0.19/0.42 % --prep_upred true % 0.19/0.42 % --res_sim_input true % 0.19/0.42 % --clause_weak_htbl true % 0.19/0.42 % --gc_record_bc_elim false % 0.19/0.42 % --symbol_type_check false % 0.19/0.42 % --clausify_out false % 0.19/0.42 % --large_theory_mode false % 0.19/0.42 % --prep_sem_filter none % 0.19/0.42 % --prep_sem_filter_out false % 0.19/0.42 % --preprocessed_out false % 0.19/0.42 % --sub_typing false % 0.19/0.42 % --brand_transform false % 0.19/0.42 % --pure_diseq_elim true % 0.19/0.42 % --min_unsat_core false % 0.19/0.42 % --pred_elim true % 0.19/0.42 % --add_important_lit false % 0.19/0.42 % --soft_assumptions false % 0.19/0.42 % --reset_solvers false % 0.19/0.42 % --bc_imp_inh [] % 0.19/0.42 % --conj_cone_tolerance 1.5 % 0.19/0.42 % --prolific_symb_bound 500 % 0.19/0.42 % --lt_threshold 2000 % 0.19/0.42 % 0.19/0.42 % ------ SAT Options % 0.19/0.42 % 0.19/0.42 % --sat_mode false % 0.19/0.42 % --sat_fm_restart_options "" % 0.19/0.42 % --sat_gr_def false % 0.19/0.42 % --sat_epr_types true % 0.19/0.42 % --sat_non_cyclic_types false % 0.19/0.42 % --sat_finite_models false % 0.19/0.42 % --sat_fm_lemmas false % 0.19/0.42 % --sat_fm_prep false % 0.19/0.42 % --sat_fm_uc_incr true % 0.19/0.42 % --sat_out_model small % 0.19/0.42 % --sat_out_clauses false % 0.19/0.42 % 0.19/0.42 % ------ QBF Options % 0.19/0.42 % 0.19/0.42 % --qbf_mode false % 0.19/0.42 % --qbf_elim_univ true % 0.19/0.42 % --qbf_sk_in true % 0.19/0.42 % --qbf_pred_elim true % 0.19/0.42 % --qbf_split 32 % 0.19/0.42 % 0.19/0.42 % ------ BMC1 Options % 0.19/0.42 % 0.19/0.42 % --bmc1_incremental false % 0.19/0.42 % --bmc1_axioms reachable_all % 0.19/0.42 % --bmc1_min_bound 0 % 0.19/0.42 % --bmc1_max_bound -1 % 0.19/0.42 % --bmc1_max_bound_default -1 % 0.19/0.42 % --bmc1_symbol_reachability true % 0.19/0.42 % --bmc1_property_lemmas false % 0.19/0.42 % --bmc1_k_induction false % 0.19/0.42 % --bmc1_non_equiv_states false % 0.19/0.42 % --bmc1_deadlock false % 0.19/0.42 % --bmc1_ucm false % 0.19/0.42 % --bmc1_add_unsat_core none % 0.19/0.42 % --bmc1_unsat_core_children false % 0.19/0.42 % --bmc1_unsat_core_extrapolate_axioms false % 0.19/0.42 % --bmc1_out_stat full % 0.19/0.42 % --bmc1_ground_init false % 0.19/0.42 % --bmc1_pre_inst_next_state false % 0.19/0.42 % --bmc1_pre_inst_state false % 0.19/0.42 % --bmc1_pre_inst_reach_state false % 0.19/0.42 % --bmc1_out_unsat_core false % 0.19/0.42 % --bmc1_aig_witness_out false % 0.19/0.42 % --bmc1_verbose false % 0.19/0.42 % --bmc1_dump_clauses_tptp false % 0.19/0.44 % --bmc1_dump_unsat_core_tptp false % 0.19/0.44 % --bmc1_dump_file - % 0.19/0.44 % --bmc1_ucm_expand_uc_limit 128 % 0.19/0.44 % --bmc1_ucm_n_expand_iterations 6 % 0.19/0.44 % --bmc1_ucm_extend_mode 1 % 0.19/0.44 % --bmc1_ucm_init_mode 2 % 0.19/0.44 % --bmc1_ucm_cone_mode none % 0.19/0.44 % --bmc1_ucm_reduced_relation_type 0 % 0.19/0.44 % --bmc1_ucm_relax_model 4 % 0.19/0.44 % --bmc1_ucm_full_tr_after_sat true % 0.19/0.44 % --bmc1_ucm_expand_neg_assumptions false % 0.19/0.44 % --bmc1_ucm_layered_model none % 0.19/0.44 % --bmc1_ucm_max_lemma_size 10 % 0.19/0.44 % 0.19/0.44 % ------ AIG Options % 0.19/0.44 % 0.19/0.44 % --aig_mode false % 0.19/0.44 % 0.19/0.44 % ------ Instantiation Options % 0.19/0.44 % 0.19/0.44 % --instantiation_flag true % 0.19/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.19/0.44 % --inst_solver_per_active 750 % 0.19/0.44 % --inst_solver_calls_frac 0.5 % 0.19/0.44 % --inst_passive_queue_type priority_queues % 0.19/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.19/0.44 % --inst_passive_queues_freq [25;2] % 0.19/0.44 % --inst_dismatching true % 0.19/0.44 % --inst_eager_unprocessed_to_passive true % 0.19/0.44 % --inst_prop_sim_given true % 0.19/0.44 % --inst_prop_sim_new false % 0.19/0.44 % --inst_orphan_elimination true % 0.19/0.44 % --inst_learning_loop_flag true % 0.19/0.44 % --inst_learning_start 3000 % 0.19/0.44 % --inst_learning_factor 2 % 0.19/0.44 % --inst_start_prop_sim_after_learn 3 % 0.19/0.44 % --inst_sel_renew solver % 0.19/0.44 % --inst_lit_activity_flag true % 0.19/0.44 % --inst_out_proof true % 0.19/0.44 % 0.19/0.44 % ------ Resolution Options % 0.19/0.44 % 0.19/0.44 % --resolution_flag true % 0.19/0.44 % --res_lit_sel kbo_max % 0.19/0.44 % --res_to_prop_solver none % 0.19/0.44 % --res_prop_simpl_new false % 0.19/0.44 % --res_prop_simpl_given false % 0.19/0.44 % --res_passive_queue_type priority_queues % 0.19/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 0.19/0.44 % --res_passive_queues_freq [15;5] % 0.19/0.44 % --res_forward_subs full % 0.19/0.44 % --res_backward_subs full % 0.19/0.44 % --res_forward_subs_resolution true % 0.19/0.44 % --res_backward_subs_resolution true % 0.19/0.44 % --res_orphan_elimination false % 0.19/0.44 % --res_time_limit 1000. % 0.19/0.44 % --res_out_proof true % 0.19/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_200c34.s % 0.19/0.44 % --modulo true % 0.19/0.44 % 0.19/0.44 % ------ Combination Options % 0.19/0.44 % 0.19/0.44 % --comb_res_mult 1000 % 0.19/0.44 % --comb_inst_mult 300 % 0.19/0.44 % ------ % 0.19/0.44 % 0.19/0.44 % ------ Parsing...% successful % 0.19/0.44 % 0.19/0.44 % ------ 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.19/0.44 % 0.19/0.44 % ------ Proving... % 0.19/0.44 % ------ Problem Properties % 0.19/0.44 % 0.19/0.44 % % 0.19/0.44 % EPR false % 0.19/0.44 % Horn false % 0.19/0.44 % Has equality false % 0.19/0.44 % 0.19/0.44 % % ------ Input Options Time Limit: Unbounded % 0.19/0.44 % 0.19/0.44 % 0.19/0.44 % % ------ Current options: % 0.19/0.44 % 0.19/0.44 % ------ Input Options % 0.19/0.44 % 0.19/0.44 % --out_options all % 0.19/0.44 % --tptp_safe_out true % 0.19/0.44 % --problem_path "" % 0.19/0.44 % --include_path "" % 0.19/0.44 % --clausifier .//eprover % 0.19/0.44 % --clausifier_options --tstp-format % 0.19/0.44 % --stdin false % 0.19/0.44 % --dbg_backtrace false % 0.19/0.44 % --dbg_dump_prop_clauses false % 0.19/0.44 % --dbg_dump_prop_clauses_file - % 0.19/0.44 % --dbg_out_stat false % 0.19/0.44 % 0.19/0.44 % ------ General Options % 0.19/0.44 % 0.19/0.44 % --fof false % 0.19/0.44 % --time_out_real 150. % 0.19/0.44 % --time_out_prep_mult 0.2 % 0.19/0.44 % --time_out_virtual -1. % 0.19/0.44 % --schedule none % 0.19/0.44 % --ground_splitting input % 0.19/0.44 % --splitting_nvd 16 % 0.19/0.44 % --non_eq_to_eq false % 0.19/0.44 % --prep_gs_sim true % 0.19/0.44 % --prep_unflatten false % 0.19/0.45 % --prep_res_sim true % 0.19/0.45 % --prep_upred true % 0.19/0.45 % --res_sim_input true % 0.19/0.45 % --clause_weak_htbl true % 0.19/0.45 % --gc_record_bc_elim false % 0.19/0.45 % --symbol_type_check false % 0.19/0.45 % --clausify_out false % 0.19/0.45 % --large_theory_mode false % 0.19/0.45 % --prep_sem_filter none % 0.19/0.45 % --prep_sem_filter_out false % 0.19/0.45 % --preprocessed_out false % 0.19/0.45 % --sub_typing false % 0.19/0.45 % --brand_transform false % 0.19/0.45 % --pure_diseq_elim true % 0.19/0.45 % --min_unsat_core false % 0.19/0.45 % --pred_elim true % 0.19/0.45 % --add_important_lit false % 0.19/0.45 % --soft_assumptions false % 0.19/0.45 % --reset_solvers false % 0.19/0.45 % --bc_imp_inh [] % 0.19/0.45 % --conj_cone_tolerance 1.5 % 0.19/0.45 % --prolific_symb_bound 500 % 0.19/0.45 % --lt_threshold 2000 % 0.19/0.45 % 0.19/0.45 % ------ SAT Options % 0.19/0.45 % 0.19/0.45 % --sat_mode false % 0.19/0.45 % --sat_fm_restart_options "" % 0.19/0.45 % --sat_gr_def false % 0.19/0.45 % --sat_epr_types true % 0.19/0.45 % --sat_non_cyclic_types false % 0.19/0.45 % --sat_finite_models false % 0.19/0.45 % --sat_fm_lemmas false % 0.19/0.45 % --sat_fm_prep false % 0.19/0.45 % --sat_fm_uc_incr true % 0.19/0.45 % --sat_out_model small % 0.19/0.45 % --sat_out_clauses false % 0.19/0.45 % 0.19/0.45 % ------ QBF Options % 0.19/0.45 % 0.19/0.45 % --qbf_mode false % 0.19/0.45 % --qbf_elim_univ true % 0.19/0.45 % --qbf_sk_in true % 0.19/0.45 % --qbf_pred_elim true % 0.19/0.45 % --qbf_split 32 % 0.19/0.45 % 0.19/0.45 % ------ BMC1 Options % 0.19/0.45 % 0.19/0.45 % --bmc1_incremental false % 0.19/0.45 % --bmc1_axioms reachable_all % 0.19/0.45 % --bmc1_min_bound 0 % 0.19/0.45 % --bmc1_max_bound -1 % 0.19/0.45 % --bmc1_max_bound_default -1 % 0.19/0.45 % --bmc1_symbol_reachability true % 0.19/0.45 % --bmc1_property_lemmas false % 0.19/0.45 % --bmc1_k_induction false % 0.19/0.45 % --bmc1_non_equiv_states false % 0.19/0.45 % --bmc1_deadlock false % 0.19/0.45 % --bmc1_ucm false % 0.19/0.45 % --bmc1_add_unsat_core none % 0.19/0.45 % --bmc1_unsat_core_children false % 0.19/0.45 % --bmc1_unsat_core_extrapolate_axioms false % 0.19/0.45 % --bmc1_out_stat full % 0.19/0.45 % --bmc1_ground_init false % 0.19/0.45 % --bmc1_pre_inst_next_state false % 0.19/0.45 % --bmc1_pre_inst_state false % 0.19/0.45 % --bmc1_pre_inst_reach_state false % 0.19/0.45 % --bmc1_out_unsat_core false % 0.19/0.45 % --bmc1_aig_witness_out false % 0.19/0.45 % --bmc1_verbose false % 0.19/0.45 % --bmc1_dump_clauses_tptp false % 0.19/0.45 % --bmc1_dump_unsat_core_tptp false % 0.19/0.45 % --bmc1_dump_file - % 0.19/0.45 % --bmc1_ucm_expand_uc_limit 128 % 0.19/0.45 % --bmc1_ucm_n_expand_iterations 6 % 0.19/0.45 % --bmc1_ucm_extend_mode 1 % 0.19/0.45 % --bmc1_ucm_init_mode 2 % 0.19/0.45 % --bmc1_ucm_cone_mode none % 0.19/0.45 % --bmc1_ucm_reduced_relation_type 0 % 0.19/0.45 % --bmc1_ucm_relax_model 4 % 0.19/0.45 % --bmc1_ucm_full_tr_after_sat true % 0.19/0.45 % --bmc1_ucm_expand_neg_assumptions false % 0.19/0.45 % --bmc1_ucm_layered_model none % 0.19/0.45 % --bmc1_ucm_max_lemma_size 10 % 0.19/0.45 % 0.19/0.45 % ------ AIG Options % 0.19/0.45 % 0.19/0.45 % --aig_mode false % 0.19/0.45 % 0.19/0.45 % ------ Instantiation Options % 0.19/0.45 % 0.19/0.45 % --instantiation_flag true % 0.19/0.45 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.19/0.45 % --inst_solver_per_active 750 % 0.19/0.45 % --inst_solver_calls_frac 0.5 % 0.19/0.45 % --inst_passive_queue_type priority_queues % 0.19/0.45 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.19/0.45 % --inst_passive_queues_freq [25;2] % 0.19/0.45 % --inst_dismatching true % 0.19/0.45 % --inst_eager_unprocessed_to_passive true % 0.19/0.45 % --inst_prop_sim_given true % 125.74/125.95 % --inst_prop_sim_new false % 125.74/125.95 % --inst_orphan_elimination true % 125.74/125.95 % --inst_learning_loop_flag true % 125.74/125.95 % --inst_learning_start 3000 % 125.74/125.95 % --inst_learning_factor 2 % 125.74/125.95 % --inst_start_prop_sim_after_learn 3 % 125.74/125.95 % --inst_sel_renew solver % 125.74/125.95 % --inst_lit_activity_flag true % 125.74/125.95 % --inst_out_proof true % 125.74/125.95 % 125.74/125.95 % ------ Resolution Options % 125.74/125.95 % 125.74/125.95 % --resolution_flag true % 125.74/125.95 % --res_lit_sel kbo_max % 125.74/125.95 % --res_to_prop_solver none % 125.74/125.95 % --res_prop_simpl_new false % 125.74/125.95 % --res_prop_simpl_given false % 125.74/125.95 % --res_passive_queue_type priority_queues % 125.74/125.95 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 125.74/125.95 % --res_passive_queues_freq [15;5] % 125.74/125.95 % --res_forward_subs full % 125.74/125.95 % --res_backward_subs full % 125.74/125.95 % --res_forward_subs_resolution true % 125.74/125.95 % --res_backward_subs_resolution true % 125.74/125.95 % --res_orphan_elimination false % 125.74/125.95 % --res_time_limit 1000. % 125.74/125.95 % --res_out_proof true % 125.74/125.95 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_200c34.s % 125.74/125.95 % --modulo true % 125.74/125.95 % 125.74/125.95 % ------ Combination Options % 125.74/125.95 % 125.74/125.95 % --comb_res_mult 1000 % 125.74/125.95 % --comb_inst_mult 300 % 125.74/125.95 % ------ % 125.74/125.95 % 125.74/125.95 % 125.74/125.95 % 125.74/125.95 % ------ Proving... % 125.74/125.95 % warning: shown sat in sat incomplete mode % 125.74/125.95 % % 125.74/125.95 % 125.74/125.95 % 125.74/125.95 ------ Building Model...Done % 125.74/125.95 % 125.74/125.95 %------ The model is defined over ground terms (initial term algebra). % 125.74/125.95 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 125.74/125.95 %------ where \phi is a formula over the term algebra. % 125.74/125.95 %------ If we have equality in the problem then it is also defined as a predicate above, % 125.74/125.95 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 125.74/125.95 %------ See help for --sat_out_model for different model outputs. % 125.74/125.95 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 125.74/125.95 %------ where the first argument stands for the sort ($i in the unsorted case) % 125.74/125.95 % 125.74/125.95 % 125.74/125.95 % 125.74/125.95 % 125.74/125.95 %------ Positive definition of ssSkC0 % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 ( ssSkC0 <=> % 125.74/125.95 $true % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of actual_world % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0] : % 125.74/125.95 ( ~(actual_world(X0)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Positive definition of group % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( group(X0,X1) <=> % 125.74/125.95 ( % 125.74/125.95 ( % 125.74/125.95 ( X0=skc17 & X1=skc18 ) % 125.74/125.95 ) % 125.74/125.95 % 125.74/125.95 | % 125.74/125.95 ( % 125.74/125.95 ( X0=skc17 & X1=skc19 ) % 125.74/125.95 ) % 125.74/125.95 % 125.74/125.95 | % 125.74/125.95 ( % 125.74/125.95 ( X0=skc17 & X1=skc20 ) % 125.74/125.95 ) % 125.74/125.95 % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Positive definition of ssSkP2 % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1,X2] : % 125.74/125.95 ( ssSkP2(X0,X1,X2) <=> % 125.74/125.95 $true % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of down % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1,X2] : % 125.74/125.95 ( ~(down(X0,X1,X2)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Positive definition of lonely % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( lonely(X0,X1) <=> % 125.74/125.95 ( % 125.74/125.95 ( % 125.74/125.95 ( X0=skc17 & X1=skc22 ) % 125.74/125.95 ) % 125.74/125.95 % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of street % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( ~(street(X0,X1)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Positive definition of event % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( event(X0,X1) <=> % 125.74/125.95 ( % 125.74/125.95 ( % 125.74/125.95 ( X0=skc17 & X1=skc21 ) % 125.74/125.95 ) % 125.74/125.95 % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of present % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( ~(present(X0,X1)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of barrel % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( ~(barrel(X0,X1)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Positive definition of placename % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( placename(X0,X1) <=> % 125.74/125.95 ( % 125.74/125.95 ( % 125.74/125.95 ( X0=skc17 & X1=skc23 ) % 125.74/125.95 ) % 125.74/125.95 % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of hollywood_placename % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( ~(hollywood_placename(X0,X1)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of of % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1,X2] : % 125.74/125.95 ( ~(of(X0,X1,X2)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Positive definition of frontseat % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( frontseat(X0,X1) <=> % 125.74/125.95 ( % 125.74/125.95 ( % 125.74/125.95 ( X0=skc17 & X1=skc24 ) % 125.74/125.95 ) % 125.74/125.95 % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of city % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( ~(city(X0,X1)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Positive definition of chevy % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( chevy(X0,X1) <=> % 125.74/125.95 ( % 125.74/125.95 ( % 125.74/125.95 ( X0=skc17 & X1=skc25 ) % 125.74/125.95 ) % 125.74/125.95 % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of white % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( ~(white(X0,X1)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of dirty % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( ~(dirty(X0,X1)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of old % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( ~(old(X0,X1)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of agent % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1,X2] : % 125.74/125.95 ( ~(agent(X0,X1,X2)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Negative definition of in % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1,X2] : % 125.74/125.95 ( ~(in(X0,X1,X2)) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Positive definition of ssSkP1 % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1,X2] : % 125.74/125.95 ( ssSkP1(X0,X1,X2) <=> % 125.74/125.95 $true % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Positive definition of ssSkP0 % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( ssSkP0(X0,X1) <=> % 125.74/125.95 $true % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Positive definition of two % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1] : % 125.74/125.95 ( two(X0,X1) <=> % 125.74/125.95 ( % 125.74/125.95 ( % 125.74/125.95 ( X0=skc17 & X1=skc20 ) % 125.74/125.95 ) % 125.74/125.95 % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 %------ Positive definition of member % 125.74/125.95 fof(lit_def,axiom, % 125.74/125.95 (! [X0,X1,X2] : % 125.74/125.95 ( member(X0,X1,X2) <=> % 125.74/125.95 $false % 125.74/125.95 ) % 125.74/125.95 ) % 125.74/125.95 ). % 125.74/125.95 % 125.74/125.95 % 125.74/125.95 % 125.74/125.95 % ------ Statistics % 125.74/125.95 % 125.74/125.95 % ------ General % 125.74/125.95 % 125.74/125.95 % num_of_input_clauses: 78 % 125.74/125.95 % num_of_input_neg_conjectures: 78 % 125.74/125.95 % num_of_splits: 0 % 125.74/125.95 % num_of_split_atoms: 0 % 125.74/125.95 % num_of_sem_filtered_clauses: 0 % 125.74/125.95 % num_of_subtypes: 0 % 125.74/125.95 % monotx_restored_types: 0 % 125.74/125.95 % sat_num_of_epr_types: 0 % 125.74/125.95 % sat_num_of_non_cyclic_types: 0 % 125.74/125.95 % sat_guarded_non_collapsed_types: 0 % 125.74/125.95 % is_epr: 0 % 125.74/125.95 % is_horn: 0 % 125.74/125.95 % has_eq: 0 % 125.74/125.95 % num_pure_diseq_elim: 0 % 125.74/125.95 % simp_replaced_by: 56 % 125.74/125.95 % res_preprocessed: 156 % 125.74/125.95 % prep_upred: 0 % 125.74/125.95 % prep_unflattend: 0 % 125.74/125.95 % pred_elim_cands: 0 % 125.74/125.95 % pred_elim: 0 % 125.74/125.95 % pred_elim_cl: 0 % 125.74/125.95 % pred_elim_cycles: 0 % 125.74/125.95 % forced_gc_time: 0 % 125.74/125.95 % gc_basic_clause_elim: 0 % 125.74/125.95 % parsing_time: 0.004 % 125.74/125.95 % sem_filter_time: 0. % 125.74/125.95 % pred_elim_time: 0.001 % 125.74/125.95 % out_proof_time: 0. % 125.74/125.95 % monotx_time: 0. % 125.74/125.95 % subtype_inf_time: 0. % 125.74/125.95 % unif_index_cands_time: 0.051 % 125.74/125.95 % unif_index_add_time: 0.033 % 125.74/125.95 % total_time: 125.546 % 125.74/125.95 % num_of_symbols: 86 % 125.74/125.95 % num_of_terms: 35080 % 125.74/125.95 % 125.74/125.95 % ------ Propositional Solver % 125.74/125.95 % 125.74/125.95 % prop_solver_calls: 27 % 125.74/125.95 % prop_fast_solver_calls: 867 % 125.74/125.96 % prop_num_of_clauses: 3960 % 125.74/125.96 % prop_preprocess_simplified: 5610 % 125.74/125.96 % prop_fo_subsumed: 0 % 125.74/125.96 % prop_solver_time: 0.001 % 125.74/125.96 % prop_fast_solver_time: 0.001 % 125.74/125.96 % prop_unsat_core_time: 0. % 125.74/125.96 % 125.74/125.96 % ------ QBF % 125.74/125.96 % 125.74/125.96 % qbf_q_res: 0 % 125.74/125.96 % qbf_num_tautologies: 0 % 125.74/125.96 % qbf_prep_cycles: 0 % 125.74/125.96 % 125.74/125.96 % ------ BMC1 % 125.74/125.96 % 125.74/125.96 % bmc1_current_bound: -1 % 125.74/125.96 % bmc1_last_solved_bound: -1 % 125.74/125.96 % bmc1_unsat_core_size: -1 % 125.74/125.96 % bmc1_unsat_core_parents_size: -1 % 125.74/125.96 % bmc1_merge_next_fun: 0 % 125.74/125.96 % bmc1_unsat_core_clauses_time: 0. % 125.74/125.96 % 125.74/125.96 % ------ Instantiation % 125.74/125.96 % 125.74/125.96 % inst_num_of_clauses: 180 % 125.74/125.96 % inst_num_in_passive: 0 % 125.74/125.96 % inst_num_in_active: 180 % 125.74/125.96 % inst_num_in_unprocessed: 0 % 125.74/125.96 % inst_num_of_loops: 189 % 125.74/125.96 % inst_num_of_learning_restarts: 1 % 125.74/125.96 % inst_num_moves_active_passive: 0 % 125.74/125.96 % inst_lit_activity: 29 % 125.74/125.96 % inst_lit_activity_moves: 0 % 125.74/125.96 % inst_num_tautologies: 0 % 125.74/125.96 % inst_num_prop_implied: 0 % 125.74/125.96 % inst_num_existing_simplified: 0 % 125.74/125.96 % inst_num_eq_res_simplified: 0 % 125.74/125.96 % inst_num_child_elim: 0 % 125.74/125.96 % inst_num_of_dismatching_blockings: 0 % 125.74/125.96 % inst_num_of_non_proper_insts: 102 % 125.74/125.96 % inst_num_of_duplicates: 0 % 125.74/125.96 % inst_inst_num_from_inst_to_res: 0 % 125.74/125.96 % inst_dismatching_checking_time: 0.003 % 125.74/125.96 % 125.74/125.96 % ------ Resolution % 125.74/125.96 % 125.74/125.96 % res_num_of_clauses: 607011 % 125.74/125.96 % res_num_in_passive: 660617 % 125.74/125.96 % res_num_in_active: 6250 % 125.74/125.96 % res_num_of_loops: 11000 % 125.74/125.96 % res_forward_subset_subsumed: 919425 % 125.74/125.96 % res_backward_subset_subsumed: 65609 % 125.74/125.96 % res_forward_subsumed: 3243 % 125.74/125.96 % res_backward_subsumed: 245 % 125.74/125.96 % res_forward_subsumption_resolution: 3013 % 125.74/125.96 % res_backward_subsumption_resolution: 361 % 125.74/125.96 % res_clause_to_clause_subsumption: 62545 % 125.74/125.96 % res_orphan_elimination: 0 % 125.74/125.96 % res_tautology_del: 56777 % 125.74/125.96 % res_num_eq_res_simplified: 0 % 125.74/125.96 % res_num_sel_changes: 0 % 125.74/125.96 % res_moves_from_active_to_pass: 0 % 125.74/125.96 % 125.74/125.96 % Status Unknown % 125.80/126.01 % Orienting using strategy ClausalAll % 125.80/126.01 % Orientation found % 125.80/126.01 % 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_200c34.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_4e4336.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_63263b | grep -v "SZS" % 125.80/126.03 % 125.80/126.03 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 125.80/126.03 % 125.80/126.03 % % 125.80/126.03 % ------ iProver source info % 125.80/126.03 % 125.80/126.03 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 125.80/126.03 % git: non_committed_changes: true % 125.80/126.03 % git: last_make_outside_of_git: true % 125.80/126.03 % 125.80/126.03 % % 125.80/126.03 % ------ Input Options % 125.80/126.03 % 125.80/126.03 % --out_options all % 125.80/126.03 % --tptp_safe_out true % 125.80/126.03 % --problem_path "" % 125.80/126.03 % --include_path "" % 125.80/126.03 % --clausifier .//eprover % 125.80/126.03 % --clausifier_options --tstp-format % 125.80/126.03 % --stdin false % 125.80/126.03 % --dbg_backtrace false % 125.80/126.03 % --dbg_dump_prop_clauses false % 125.80/126.03 % --dbg_dump_prop_clauses_file - % 125.80/126.03 % --dbg_out_stat false % 125.80/126.03 % 125.80/126.03 % ------ General Options % 125.80/126.03 % 125.80/126.03 % --fof false % 125.80/126.03 % --time_out_real 150. % 125.80/126.03 % --time_out_prep_mult 0.2 % 125.80/126.03 % --time_out_virtual -1. % 125.80/126.03 % --schedule none % 125.80/126.03 % --ground_splitting input % 125.80/126.03 % --splitting_nvd 16 % 125.80/126.03 % --non_eq_to_eq false % 125.80/126.03 % --prep_gs_sim true % 125.80/126.03 % --prep_unflatten false % 125.80/126.03 % --prep_res_sim true % 125.80/126.03 % --prep_upred true % 125.80/126.03 % --res_sim_input true % 125.80/126.03 % --clause_weak_htbl true % 125.80/126.03 % --gc_record_bc_elim false % 125.80/126.03 % --symbol_type_check false % 125.80/126.03 % --clausify_out false % 125.80/126.03 % --large_theory_mode false % 125.80/126.03 % --prep_sem_filter none % 125.80/126.03 % --prep_sem_filter_out false % 125.80/126.03 % --preprocessed_out false % 125.80/126.03 % --sub_typing false % 125.80/126.03 % --brand_transform false % 125.80/126.03 % --pure_diseq_elim true % 125.80/126.03 % --min_unsat_core false % 125.80/126.03 % --pred_elim true % 125.80/126.03 % --add_important_lit false % 125.80/126.03 % --soft_assumptions false % 125.80/126.03 % --reset_solvers false % 125.80/126.03 % --bc_imp_inh [] % 125.80/126.03 % --conj_cone_tolerance 1.5 % 125.80/126.03 % --prolific_symb_bound 500 % 125.80/126.03 % --lt_threshold 2000 % 125.80/126.03 % 125.80/126.03 % ------ SAT Options % 125.80/126.03 % 125.80/126.03 % --sat_mode false % 125.80/126.03 % --sat_fm_restart_options "" % 125.80/126.03 % --sat_gr_def false % 125.80/126.03 % --sat_epr_types true % 125.80/126.03 % --sat_non_cyclic_types false % 125.80/126.03 % --sat_finite_models false % 125.80/126.03 % --sat_fm_lemmas false % 125.80/126.03 % --sat_fm_prep false % 125.80/126.03 % --sat_fm_uc_incr true % 125.80/126.03 % --sat_out_model small % 125.80/126.03 % --sat_out_clauses false % 125.80/126.03 % 125.80/126.03 % ------ QBF Options % 125.80/126.03 % 125.80/126.03 % --qbf_mode false % 125.80/126.03 % --qbf_elim_univ true % 125.80/126.03 % --qbf_sk_in true % 125.80/126.03 % --qbf_pred_elim true % 125.80/126.03 % --qbf_split 32 % 125.80/126.03 % 125.80/126.03 % ------ BMC1 Options % 125.80/126.03 % 125.80/126.03 % --bmc1_incremental false % 125.80/126.03 % --bmc1_axioms reachable_all % 125.80/126.03 % --bmc1_min_bound 0 % 125.80/126.03 % --bmc1_max_bound -1 % 125.80/126.03 % --bmc1_max_bound_default -1 % 125.80/126.03 % --bmc1_symbol_reachability true % 125.80/126.03 % --bmc1_property_lemmas false % 125.80/126.03 % --bmc1_k_induction false % 125.80/126.03 % --bmc1_non_equiv_states false % 125.80/126.03 % --bmc1_deadlock false % 125.80/126.03 % --bmc1_ucm false % 125.80/126.03 % --bmc1_add_unsat_core none % 125.80/126.03 % --bmc1_unsat_core_children false % 125.80/126.03 % --bmc1_unsat_core_extrapolate_axioms false % 125.80/126.03 % --bmc1_out_stat full % 125.80/126.03 % --bmc1_ground_init false % 125.80/126.03 % --bmc1_pre_inst_next_state false % 125.80/126.03 % --bmc1_pre_inst_state false % 125.80/126.03 % --bmc1_pre_inst_reach_state false % 125.80/126.03 % --bmc1_out_unsat_core false % 125.80/126.03 % --bmc1_aig_witness_out false % 125.80/126.03 % --bmc1_verbose false % 125.80/126.03 % --bmc1_dump_clauses_tptp false % 125.80/126.05 % --bmc1_dump_unsat_core_tptp false % 125.80/126.05 % --bmc1_dump_file - % 125.80/126.05 % --bmc1_ucm_expand_uc_limit 128 % 125.80/126.05 % --bmc1_ucm_n_expand_iterations 6 % 125.80/126.05 % --bmc1_ucm_extend_mode 1 % 125.80/126.05 % --bmc1_ucm_init_mode 2 % 125.80/126.05 % --bmc1_ucm_cone_mode none % 125.80/126.05 % --bmc1_ucm_reduced_relation_type 0 % 125.80/126.05 % --bmc1_ucm_relax_model 4 % 125.80/126.05 % --bmc1_ucm_full_tr_after_sat true % 125.80/126.05 % --bmc1_ucm_expand_neg_assumptions false % 125.80/126.05 % --bmc1_ucm_layered_model none % 125.80/126.05 % --bmc1_ucm_max_lemma_size 10 % 125.80/126.05 % 125.80/126.05 % ------ AIG Options % 125.80/126.05 % 125.80/126.05 % --aig_mode false % 125.80/126.05 % 125.80/126.05 % ------ Instantiation Options % 125.80/126.05 % 125.80/126.05 % --instantiation_flag true % 125.80/126.05 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 125.80/126.05 % --inst_solver_per_active 750 % 125.80/126.05 % --inst_solver_calls_frac 0.5 % 125.80/126.05 % --inst_passive_queue_type priority_queues % 125.80/126.05 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 125.80/126.05 % --inst_passive_queues_freq [25;2] % 125.80/126.05 % --inst_dismatching true % 125.80/126.05 % --inst_eager_unprocessed_to_passive true % 125.80/126.05 % --inst_prop_sim_given true % 125.80/126.05 % --inst_prop_sim_new false % 125.80/126.05 % --inst_orphan_elimination true % 125.80/126.05 % --inst_learning_loop_flag true % 125.80/126.05 % --inst_learning_start 3000 % 125.80/126.05 % --inst_learning_factor 2 % 125.80/126.05 % --inst_start_prop_sim_after_learn 3 % 125.80/126.05 % --inst_sel_renew solver % 125.80/126.05 % --inst_lit_activity_flag true % 125.80/126.05 % --inst_out_proof true % 125.80/126.05 % 125.80/126.05 % ------ Resolution Options % 125.80/126.05 % 125.80/126.05 % --resolution_flag true % 125.80/126.05 % --res_lit_sel kbo_max % 125.80/126.05 % --res_to_prop_solver none % 125.80/126.05 % --res_prop_simpl_new false % 125.80/126.05 % --res_prop_simpl_given false % 125.80/126.05 % --res_passive_queue_type priority_queues % 125.80/126.05 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 125.80/126.05 % --res_passive_queues_freq [15;5] % 125.80/126.05 % --res_forward_subs full % 125.80/126.05 % --res_backward_subs full % 125.80/126.05 % --res_forward_subs_resolution true % 125.80/126.05 % --res_backward_subs_resolution true % 125.80/126.05 % --res_orphan_elimination false % 125.80/126.05 % --res_time_limit 1000. % 125.80/126.05 % --res_out_proof true % 125.80/126.05 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_200c34.s % 125.80/126.05 % --modulo true % 125.80/126.05 % 125.80/126.05 % ------ Combination Options % 125.80/126.05 % 125.80/126.05 % --comb_res_mult 1000 % 125.80/126.05 % --comb_inst_mult 300 % 125.80/126.05 % ------ % 125.80/126.05 % 125.80/126.05 % ------ Parsing...% successful % 125.80/126.05 % 125.80/126.05 % ------ 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 % % 125.80/126.05 % 125.80/126.05 % ------ Proving... % 125.80/126.05 % ------ Problem Properties % 125.80/126.05 % 125.80/126.05 % % 125.80/126.05 % EPR false % 125.80/126.05 % Horn false % 125.80/126.05 % Has equality false % 125.80/126.05 % 125.80/126.05 % % ------ Input Options Time Limit: Unbounded % 125.80/126.05 % 125.80/126.05 % 125.80/126.05 % % ------ Current options: % 125.80/126.05 % 125.80/126.05 % ------ Input Options % 125.80/126.05 % 125.80/126.05 % --out_options all % 125.80/126.05 % --tptp_safe_out true % 125.80/126.05 % --problem_path "" % 125.80/126.05 % --include_path "" % 125.80/126.05 % --clausifier .//eprover % 125.80/126.05 % --clausifier_options --tstp-format % 125.80/126.05 % --stdin false % 125.80/126.05 % --dbg_backtrace false % 125.80/126.05 % --dbg_dump_prop_clauses false % 125.80/126.05 % --dbg_dump_prop_clauses_file - % 125.80/126.05 % --dbg_out_stat false % 125.80/126.05 % 125.80/126.05 % ------ General Options % 125.80/126.05 % 125.80/126.05 % --fof false % 125.80/126.05 % --time_out_real 150. % 125.80/126.05 % --time_out_prep_mult 0.2 % 125.80/126.05 % --time_out_virtual -1. % 125.80/126.05 % --schedule none % 125.80/126.05 % --ground_splitting input % 125.80/126.05 % --splitting_nvd 16 % 125.80/126.05 % --non_eq_to_eq false % 125.80/126.05 % --prep_gs_sim true % 125.80/126.05 % --prep_unflatten false % 125.80/126.05 % --prep_res_sim true % 125.80/126.05 % --prep_upred true % 125.80/126.05 % --res_sim_input true % 125.80/126.05 % --clause_weak_htbl true % 125.80/126.05 % --gc_record_bc_elim false % 125.80/126.05 % --symbol_type_check false % 125.80/126.05 % --clausify_out false % 125.80/126.05 % --large_theory_mode false % 125.80/126.05 % --prep_sem_filter none % 125.80/126.05 % --prep_sem_filter_out false % 125.80/126.05 % --preprocessed_out false % 125.80/126.05 % --sub_typing false % 125.80/126.05 % --brand_transform false % 125.80/126.05 % --pure_diseq_elim true % 125.80/126.05 % --min_unsat_core false % 125.80/126.05 % --pred_elim true % 125.80/126.05 % --add_important_lit false % 125.80/126.05 % --soft_assumptions false % 125.80/126.05 % --reset_solvers false % 125.80/126.05 % --bc_imp_inh [] % 125.80/126.05 % --conj_cone_tolerance 1.5 % 125.80/126.05 % --prolific_symb_bound 500 % 125.80/126.05 % --lt_threshold 2000 % 125.80/126.05 % 125.80/126.05 % ------ SAT Options % 125.80/126.05 % 125.80/126.05 % --sat_mode false % 125.80/126.05 % --sat_fm_restart_options "" % 125.80/126.05 % --sat_gr_def false % 125.80/126.05 % --sat_epr_types true % 125.80/126.05 % --sat_non_cyclic_types false % 125.80/126.05 % --sat_finite_models false % 125.80/126.05 % --sat_fm_lemmas false % 125.80/126.05 % --sat_fm_prep false % 125.80/126.05 % --sat_fm_uc_incr true % 125.80/126.05 % --sat_out_model small % 125.80/126.05 % --sat_out_clauses false % 125.80/126.05 % 125.80/126.05 % ------ QBF Options % 125.80/126.05 % 125.80/126.05 % --qbf_mode false % 125.80/126.05 % --qbf_elim_univ true % 125.80/126.05 % --qbf_sk_in true % 125.80/126.05 % --qbf_pred_elim true % 125.80/126.05 % --qbf_split 32 % 125.80/126.05 % 125.80/126.05 % ------ BMC1 Options % 125.80/126.05 % 125.80/126.05 % --bmc1_incremental false % 125.80/126.05 % --bmc1_axioms reachable_all % 125.80/126.05 % --bmc1_min_bound 0 % 125.80/126.05 % --bmc1_max_bound -1 % 125.80/126.05 % --bmc1_max_bound_default -1 % 125.80/126.05 % --bmc1_symbol_reachability true % 125.80/126.05 % --bmc1_property_lemmas false % 125.80/126.05 % --bmc1_k_induction false % 125.80/126.05 % --bmc1_non_equiv_states false % 125.80/126.05 % --bmc1_deadlock false % 125.80/126.05 % --bmc1_ucm false % 125.80/126.05 % --bmc1_add_unsat_core none % 125.80/126.05 % --bmc1_unsat_core_children false % 125.80/126.05 % --bmc1_unsat_core_extrapolate_axioms false % 125.80/126.05 % --bmc1_out_stat full % 125.80/126.05 % --bmc1_ground_init false % 125.80/126.05 % --bmc1_pre_inst_next_state false % 125.80/126.05 % --bmc1_pre_inst_state false % 125.80/126.05 % --bmc1_pre_inst_reach_state false % 125.80/126.05 % --bmc1_out_unsat_core false % 125.80/126.05 % --bmc1_aig_witness_out false % 125.80/126.05 % --bmc1_verbose false % 125.80/126.05 % --bmc1_dump_clauses_tptp false % 125.80/126.05 % --bmc1_dump_unsat_core_tptp false % 125.80/126.05 % --bmc1_dump_file - % 125.80/126.05 % --bmc1_ucm_expand_uc_limit 128 % 125.80/126.05 % --bmc1_ucm_n_expand_iterations 6 % 125.80/126.05 % --bmc1_ucm_extend_mode 1 % 125.80/126.05 % --bmc1_ucm_init_mode 2 % 125.80/126.05 % --bmc1_ucm_cone_mode none % 125.80/126.05 % --bmc1_ucm_reduced_relation_type 0 % 125.80/126.05 % --bmc1_ucm_relax_model 4 % 125.80/126.05 % --bmc1_ucm_full_tr_after_sat true % 125.80/126.05 % --bmc1_ucm_expand_neg_assumptions false % 125.80/126.05 % --bmc1_ucm_layered_model none % 125.80/126.05 % --bmc1_ucm_max_lemma_size 10 % 125.80/126.05 % 125.80/126.05 % ------ AIG Options % 125.80/126.05 % 125.80/126.05 % --aig_mode false % 125.80/126.05 % 125.80/126.05 % ------ Instantiation Options % 125.80/126.05 % 125.80/126.05 % --instantiation_flag true % 125.80/126.05 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 125.80/126.05 % --inst_solver_per_active 750 % 125.80/126.05 % --inst_solver_calls_frac 0.5 % 125.80/126.05 % --inst_passive_queue_type priority_queues % 125.80/126.05 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 125.80/126.05 % --inst_passive_queues_freq [25;2] % 125.80/126.05 % --inst_dismatching true % 125.80/126.05 % --inst_eager_unprocessed_to_passive true % 125.80/126.05 % --inst_prop_sim_given true % 249.32/249.55 % --inst_prop_sim_new false % 249.32/249.55 % --inst_orphan_elimination true % 249.32/249.55 % --inst_learning_loop_flag true % 249.32/249.55 % --inst_learning_start 3000 % 249.32/249.55 % --inst_learning_factor 2 % 249.32/249.55 % --inst_start_prop_sim_after_learn 3 % 249.32/249.55 % --inst_sel_renew solver % 249.32/249.55 % --inst_lit_activity_flag true % 249.32/249.55 % --inst_out_proof true % 249.32/249.55 % 249.32/249.55 % ------ Resolution Options % 249.32/249.55 % 249.32/249.55 % --resolution_flag true % 249.32/249.55 % --res_lit_sel kbo_max % 249.32/249.55 % --res_to_prop_solver none % 249.32/249.55 % --res_prop_simpl_new false % 249.32/249.55 % --res_prop_simpl_given false % 249.32/249.55 % --res_passive_queue_type priority_queues % 249.32/249.55 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 249.32/249.55 % --res_passive_queues_freq [15;5] % 249.32/249.55 % --res_forward_subs full % 249.32/249.55 % --res_backward_subs full % 249.32/249.55 % --res_forward_subs_resolution true % 249.32/249.55 % --res_backward_subs_resolution true % 249.32/249.55 % --res_orphan_elimination false % 249.32/249.55 % --res_time_limit 1000. % 249.32/249.55 % --res_out_proof true % 249.32/249.55 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_200c34.s % 249.32/249.55 % --modulo true % 249.32/249.55 % 249.32/249.55 % ------ Combination Options % 249.32/249.55 % 249.32/249.55 % --comb_res_mult 1000 % 249.32/249.55 % --comb_inst_mult 300 % 249.32/249.55 % ------ % 249.32/249.55 % 249.32/249.55 % 249.32/249.55 % 249.32/249.55 % ------ Proving... % 249.32/249.55 % warning: shown sat in sat incomplete mode % 249.32/249.55 % % 249.32/249.55 % 249.32/249.55 % 249.32/249.55 ------ Building Model...Done % 249.32/249.55 % 249.32/249.55 %------ The model is defined over ground terms (initial term algebra). % 249.32/249.55 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 249.32/249.55 %------ where \phi is a formula over the term algebra. % 249.32/249.55 %------ If we have equality in the problem then it is also defined as a predicate above, % 249.32/249.55 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 249.32/249.55 %------ See help for --sat_out_model for different model outputs. % 249.32/249.55 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 249.32/249.55 %------ where the first argument stands for the sort ($i in the unsorted case) % 249.32/249.55 % 249.32/249.55 % 249.32/249.55 % 249.32/249.55 % 249.32/249.55 %------ Positive definition of ssSkC0 % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 ( ssSkC0 <=> % 249.32/249.55 $true % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of actual_world % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0] : % 249.32/249.55 ( ~(actual_world(X0)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Positive definition of group % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( group(X0,X1) <=> % 249.32/249.55 ( % 249.32/249.55 ( % 249.32/249.55 ( X0=skc17 & X1=skc18 ) % 249.32/249.55 ) % 249.32/249.55 % 249.32/249.55 | % 249.32/249.55 ( % 249.32/249.55 ( X0=skc17 & X1=skc19 ) % 249.32/249.55 ) % 249.32/249.55 % 249.32/249.55 | % 249.32/249.55 ( % 249.32/249.55 ( X0=skc17 & X1=skc20 ) % 249.32/249.55 ) % 249.32/249.55 % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Positive definition of ssSkP2 % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1,X2] : % 249.32/249.55 ( ssSkP2(X0,X1,X2) <=> % 249.32/249.55 $true % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of down % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1,X2] : % 249.32/249.55 ( ~(down(X0,X1,X2)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Positive definition of lonely % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( lonely(X0,X1) <=> % 249.32/249.55 ( % 249.32/249.55 ( % 249.32/249.55 ( X0=skc17 & X1=skc22 ) % 249.32/249.55 ) % 249.32/249.55 % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of street % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( ~(street(X0,X1)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Positive definition of event % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( event(X0,X1) <=> % 249.32/249.55 ( % 249.32/249.55 ( % 249.32/249.55 ( X0=skc17 & X1=skc21 ) % 249.32/249.55 ) % 249.32/249.55 % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of present % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( ~(present(X0,X1)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of barrel % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( ~(barrel(X0,X1)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Positive definition of placename % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( placename(X0,X1) <=> % 249.32/249.55 ( % 249.32/249.55 ( % 249.32/249.55 ( X0=skc17 & X1=skc23 ) % 249.32/249.55 ) % 249.32/249.55 % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of hollywood_placename % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( ~(hollywood_placename(X0,X1)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of of % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1,X2] : % 249.32/249.55 ( ~(of(X0,X1,X2)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Positive definition of frontseat % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( frontseat(X0,X1) <=> % 249.32/249.55 ( % 249.32/249.55 ( % 249.32/249.55 ( X0=skc17 & X1=skc24 ) % 249.32/249.55 ) % 249.32/249.55 % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of city % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( ~(city(X0,X1)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Positive definition of chevy % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( chevy(X0,X1) <=> % 249.32/249.55 ( % 249.32/249.55 ( % 249.32/249.55 ( X0=skc17 & X1=skc25 ) % 249.32/249.55 ) % 249.32/249.55 % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of white % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( ~(white(X0,X1)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of dirty % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( ~(dirty(X0,X1)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of old % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( ~(old(X0,X1)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of agent % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1,X2] : % 249.32/249.55 ( ~(agent(X0,X1,X2)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Negative definition of in % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1,X2] : % 249.32/249.55 ( ~(in(X0,X1,X2)) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Positive definition of ssSkP1 % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1,X2] : % 249.32/249.55 ( ssSkP1(X0,X1,X2) <=> % 249.32/249.55 $true % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Positive definition of ssSkP0 % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( ssSkP0(X0,X1) <=> % 249.32/249.55 $true % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Positive definition of two % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1] : % 249.32/249.55 ( two(X0,X1) <=> % 249.32/249.55 ( % 249.32/249.55 ( % 249.32/249.55 ( X0=skc17 & X1=skc20 ) % 249.32/249.55 ) % 249.32/249.55 % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 %------ Positive definition of member % 249.32/249.55 fof(lit_def,axiom, % 249.32/249.55 (! [X0,X1,X2] : % 249.32/249.55 ( member(X0,X1,X2) <=> % 249.32/249.55 $false % 249.32/249.55 ) % 249.32/249.55 ) % 249.32/249.55 ). % 249.32/249.55 % 249.32/249.55 % 249.32/249.55 % 249.32/249.55 % ------ Statistics % 249.32/249.55 % 249.32/249.55 % ------ General % 249.32/249.55 % 249.32/249.55 % num_of_input_clauses: 78 % 249.32/249.55 % num_of_input_neg_conjectures: 78 % 249.32/249.55 % num_of_splits: 0 % 249.32/249.55 % num_of_split_atoms: 0 % 249.32/249.55 % num_of_sem_filtered_clauses: 0 % 249.32/249.55 % num_of_subtypes: 0 % 249.32/249.55 % monotx_restored_types: 0 % 249.32/249.55 % sat_num_of_epr_types: 0 % 249.32/249.55 % sat_num_of_non_cyclic_types: 0 % 249.32/249.55 % sat_guarded_non_collapsed_types: 0 % 249.32/249.55 % is_epr: 0 % 249.32/249.55 % is_horn: 0 % 249.32/249.55 % has_eq: 0 % 249.32/249.55 % num_pure_diseq_elim: 0 % 249.32/249.55 % simp_replaced_by: 56 % 249.32/249.55 % res_preprocessed: 156 % 249.32/249.55 % prep_upred: 0 % 249.32/249.55 % prep_unflattend: 0 % 249.32/249.55 % pred_elim_cands: 0 % 249.32/249.55 % pred_elim: 0 % 249.32/249.55 % pred_elim_cl: 0 % 249.32/249.55 % pred_elim_cycles: 0 % 249.32/249.55 % forced_gc_time: 0 % 249.32/249.55 % gc_basic_clause_elim: 0 % 249.32/249.55 % parsing_time: 0.003 % 249.32/249.55 % sem_filter_time: 0. % 249.32/249.55 % pred_elim_time: 0.001 % 249.32/249.55 % out_proof_time: 0. % 249.32/249.55 % monotx_time: 0. % 249.32/249.55 % subtype_inf_time: 0. % 249.32/249.55 % unif_index_cands_time: 0.049 % 249.32/249.55 % unif_index_add_time: 0.032 % 249.32/249.55 % total_time: 123.534 % 249.32/249.55 % num_of_symbols: 86 % 249.32/249.55 % num_of_terms: 35080 % 249.32/249.55 % 249.32/249.55 % ------ Propositional Solver % 249.32/249.55 % 249.32/249.55 % prop_solver_calls: 27 % 249.32/249.55 % prop_fast_solver_calls: 867 % 249.32/249.56 % prop_num_of_clauses: 3960 % 249.32/249.56 % prop_preprocess_simplified: 5610 % 249.32/249.56 % prop_fo_subsumed: 0 % 249.32/249.56 % prop_solver_time: 0.001 % 249.32/249.56 % prop_fast_solver_time: 0.001 % 249.32/249.56 % prop_unsat_core_time: 0. % 249.32/249.56 % 249.32/249.56 % ------ QBF % 249.32/249.56 % 249.32/249.56 % qbf_q_res: 0 % 249.32/249.56 % qbf_num_tautologies: 0 % 249.32/249.56 % qbf_prep_cycles: 0 % 249.32/249.56 % 249.32/249.56 % ------ BMC1 % 249.32/249.56 % 249.32/249.56 % bmc1_current_bound: -1 % 249.32/249.56 % bmc1_last_solved_bound: -1 % 249.32/249.56 % bmc1_unsat_core_size: -1 % 249.32/249.56 % bmc1_unsat_core_parents_size: -1 % 249.32/249.56 % bmc1_merge_next_fun: 0 % 249.32/249.56 % bmc1_unsat_core_clauses_time: 0. % 249.32/249.56 % 249.32/249.56 % ------ Instantiation % 249.32/249.56 % 249.32/249.56 % inst_num_of_clauses: 180 % 249.32/249.56 % inst_num_in_passive: 0 % 249.32/249.56 % inst_num_in_active: 180 % 249.32/249.56 % inst_num_in_unprocessed: 0 % 249.32/249.56 % inst_num_of_loops: 189 % 249.32/249.56 % inst_num_of_learning_restarts: 1 % 249.32/249.56 % inst_num_moves_active_passive: 0 % 249.32/249.56 % inst_lit_activity: 29 % 249.32/249.56 % inst_lit_activity_moves: 0 % 249.32/249.56 % inst_num_tautologies: 0 % 249.32/249.56 % inst_num_prop_implied: 0 % 249.32/249.56 % inst_num_existing_simplified: 0 % 249.32/249.56 % inst_num_eq_res_simplified: 0 % 249.32/249.56 % inst_num_child_elim: 0 % 249.32/249.56 % inst_num_of_dismatching_blockings: 0 % 249.32/249.56 % inst_num_of_non_proper_insts: 102 % 249.32/249.56 % inst_num_of_duplicates: 0 % 249.32/249.56 % inst_inst_num_from_inst_to_res: 0 % 249.32/249.56 % inst_dismatching_checking_time: 0.002 % 249.32/249.56 % 249.32/249.56 % ------ Resolution % 249.32/249.56 % 249.32/249.56 % res_num_of_clauses: 607011 % 249.32/249.56 % res_num_in_passive: 660617 % 249.32/249.56 % res_num_in_active: 6250 % 249.32/249.56 % res_num_of_loops: 11000 % 249.32/249.56 % res_forward_subset_subsumed: 919425 % 249.32/249.56 % res_backward_subset_subsumed: 65609 % 249.32/249.56 % res_forward_subsumed: 3243 % 249.32/249.56 % res_backward_subsumed: 245 % 249.32/249.56 % res_forward_subsumption_resolution: 3013 % 249.32/249.56 % res_backward_subsumption_resolution: 361 % 249.32/249.56 % res_clause_to_clause_subsumption: 62545 % 249.32/249.56 % res_orphan_elimination: 0 % 249.32/249.56 % res_tautology_del: 56777 % 249.32/249.56 % res_num_eq_res_simplified: 0 % 249.32/249.56 % res_num_sel_changes: 0 % 249.32/249.56 % res_moves_from_active_to_pass: 0 % 249.32/249.56 % 249.32/249.56 % Status Unknown % 249.32/249.56 % Last status : % 249.32/249.56 % SZS status Unknown %------------------------------------------------------------------------------