%------------------------------------------------------------------------------ % File : iProverMo---2.5-0.1 % Problem : NLP162+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : iprover_modulo %s %d % Computer : n027.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:16 EDT 2022 % Result : Unknown 20.82s 20.99s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NLP162+1 : TPTP v8.1.0. Released v2.4.0. % 0.11/0.13 % Command : iprover_modulo %s %d % 0.12/0.33 % Computer : n027.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 : Thu Jun 30 20:14:37 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.33 % Running in mono-core mode % 0.19/0.42 % Orienting using strategy Equiv(ClausalAll) % 0.19/0.42 % FOF problem with conjecture % 0.19/0.42 % 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_c1b360.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_a5b60a.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_9b3671 | grep -v "SZS" % 0.19/0.44 % 0.19/0.44 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 0.19/0.44 % 0.19/0.44 % % 0.19/0.44 % ------ iProver source info % 0.19/0.44 % 0.19/0.44 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 0.19/0.44 % git: non_committed_changes: true % 0.19/0.44 % git: last_make_outside_of_git: true % 0.19/0.44 % 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.44 % --prep_res_sim true % 0.19/0.44 % --prep_upred true % 0.19/0.44 % --res_sim_input true % 0.19/0.44 % --clause_weak_htbl true % 0.19/0.44 % --gc_record_bc_elim false % 0.19/0.44 % --symbol_type_check false % 0.19/0.44 % --clausify_out false % 0.19/0.44 % --large_theory_mode false % 0.19/0.44 % --prep_sem_filter none % 0.19/0.44 % --prep_sem_filter_out false % 0.19/0.44 % --preprocessed_out false % 0.19/0.44 % --sub_typing false % 0.19/0.44 % --brand_transform false % 0.19/0.44 % --pure_diseq_elim true % 0.19/0.44 % --min_unsat_core false % 0.19/0.44 % --pred_elim true % 0.19/0.44 % --add_important_lit false % 0.19/0.44 % --soft_assumptions false % 0.19/0.44 % --reset_solvers false % 0.19/0.44 % --bc_imp_inh [] % 0.19/0.44 % --conj_cone_tolerance 1.5 % 0.19/0.44 % --prolific_symb_bound 500 % 0.19/0.44 % --lt_threshold 2000 % 0.19/0.44 % 0.19/0.44 % ------ SAT Options % 0.19/0.44 % 0.19/0.44 % --sat_mode false % 0.19/0.44 % --sat_fm_restart_options "" % 0.19/0.44 % --sat_gr_def false % 0.19/0.44 % --sat_epr_types true % 0.19/0.44 % --sat_non_cyclic_types false % 0.19/0.44 % --sat_finite_models false % 0.19/0.44 % --sat_fm_lemmas false % 0.19/0.44 % --sat_fm_prep false % 0.19/0.44 % --sat_fm_uc_incr true % 0.19/0.44 % --sat_out_model small % 0.19/0.44 % --sat_out_clauses false % 0.19/0.44 % 0.19/0.44 % ------ QBF Options % 0.19/0.44 % 0.19/0.44 % --qbf_mode false % 0.19/0.44 % --qbf_elim_univ true % 0.19/0.44 % --qbf_sk_in true % 0.19/0.44 % --qbf_pred_elim true % 0.19/0.44 % --qbf_split 32 % 0.19/0.44 % 0.19/0.44 % ------ BMC1 Options % 0.19/0.44 % 0.19/0.44 % --bmc1_incremental false % 0.19/0.44 % --bmc1_axioms reachable_all % 0.19/0.44 % --bmc1_min_bound 0 % 0.19/0.44 % --bmc1_max_bound -1 % 0.19/0.44 % --bmc1_max_bound_default -1 % 0.19/0.44 % --bmc1_symbol_reachability true % 0.19/0.44 % --bmc1_property_lemmas false % 0.19/0.44 % --bmc1_k_induction false % 0.19/0.44 % --bmc1_non_equiv_states false % 0.19/0.44 % --bmc1_deadlock false % 0.19/0.44 % --bmc1_ucm false % 0.19/0.44 % --bmc1_add_unsat_core none % 0.19/0.44 % --bmc1_unsat_core_children false % 0.19/0.44 % --bmc1_unsat_core_extrapolate_axioms false % 0.19/0.44 % --bmc1_out_stat full % 0.19/0.44 % --bmc1_ground_init false % 0.19/0.44 % --bmc1_pre_inst_next_state false % 0.19/0.44 % --bmc1_pre_inst_state false % 0.19/0.44 % --bmc1_pre_inst_reach_state false % 0.19/0.44 % --bmc1_out_unsat_core false % 0.19/0.44 % --bmc1_aig_witness_out false % 0.19/0.44 % --bmc1_verbose false % 0.19/0.44 % --bmc1_dump_clauses_tptp false % 0.56/0.79 % --bmc1_dump_unsat_core_tptp false % 0.56/0.79 % --bmc1_dump_file - % 0.56/0.79 % --bmc1_ucm_expand_uc_limit 128 % 0.56/0.79 % --bmc1_ucm_n_expand_iterations 6 % 0.56/0.79 % --bmc1_ucm_extend_mode 1 % 0.56/0.79 % --bmc1_ucm_init_mode 2 % 0.56/0.79 % --bmc1_ucm_cone_mode none % 0.56/0.79 % --bmc1_ucm_reduced_relation_type 0 % 0.56/0.79 % --bmc1_ucm_relax_model 4 % 0.56/0.79 % --bmc1_ucm_full_tr_after_sat true % 0.56/0.79 % --bmc1_ucm_expand_neg_assumptions false % 0.56/0.79 % --bmc1_ucm_layered_model none % 0.56/0.79 % --bmc1_ucm_max_lemma_size 10 % 0.56/0.79 % 0.56/0.79 % ------ AIG Options % 0.56/0.79 % 0.56/0.79 % --aig_mode false % 0.56/0.79 % 0.56/0.79 % ------ Instantiation Options % 0.56/0.79 % 0.56/0.79 % --instantiation_flag true % 0.56/0.79 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.56/0.79 % --inst_solver_per_active 750 % 0.56/0.79 % --inst_solver_calls_frac 0.5 % 0.56/0.79 % --inst_passive_queue_type priority_queues % 0.56/0.79 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.56/0.79 % --inst_passive_queues_freq [25;2] % 0.56/0.79 % --inst_dismatching true % 0.56/0.79 % --inst_eager_unprocessed_to_passive true % 0.56/0.79 % --inst_prop_sim_given true % 0.56/0.79 % --inst_prop_sim_new false % 0.56/0.79 % --inst_orphan_elimination true % 0.56/0.79 % --inst_learning_loop_flag true % 0.56/0.79 % --inst_learning_start 3000 % 0.56/0.79 % --inst_learning_factor 2 % 0.56/0.79 % --inst_start_prop_sim_after_learn 3 % 0.56/0.79 % --inst_sel_renew solver % 0.56/0.79 % --inst_lit_activity_flag true % 0.56/0.79 % --inst_out_proof true % 0.56/0.79 % 0.56/0.79 % ------ Resolution Options % 0.56/0.79 % 0.56/0.79 % --resolution_flag true % 0.56/0.79 % --res_lit_sel kbo_max % 0.56/0.79 % --res_to_prop_solver none % 0.56/0.79 % --res_prop_simpl_new false % 0.56/0.79 % --res_prop_simpl_given false % 0.56/0.79 % --res_passive_queue_type priority_queues % 0.56/0.79 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 0.56/0.79 % --res_passive_queues_freq [15;5] % 0.56/0.79 % --res_forward_subs full % 0.56/0.79 % --res_backward_subs full % 0.56/0.79 % --res_forward_subs_resolution true % 0.56/0.79 % --res_backward_subs_resolution true % 0.56/0.79 % --res_orphan_elimination false % 0.56/0.79 % --res_time_limit 1000. % 0.56/0.79 % --res_out_proof true % 0.56/0.79 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c1b360.s % 0.56/0.79 % --modulo true % 0.56/0.79 % 0.56/0.79 % ------ Combination Options % 0.56/0.79 % 0.56/0.79 % --comb_res_mult 1000 % 0.56/0.79 % --comb_inst_mult 300 % 0.56/0.79 % ------ % 0.56/0.79 % 0.56/0.79 % ------ Parsing...% successful % 0.56/0.79 % 0.56/0.79 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 54 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e % % 0.56/0.79 % 0.56/0.79 % ------ Proving... % 0.56/0.79 % ------ Problem Properties % 0.56/0.79 % 0.56/0.79 % % 0.56/0.79 % EPR false % 0.56/0.79 % Horn false % 0.56/0.79 % Has equality false % 0.56/0.79 % 0.56/0.79 % % ------ Input Options Time Limit: Unbounded % 0.56/0.79 % 0.56/0.79 % 0.56/0.79 % % ------ Current options: % 0.56/0.79 % 0.56/0.79 % ------ Input Options % 0.56/0.79 % 0.56/0.79 % --out_options all % 0.56/0.79 % --tptp_safe_out true % 0.56/0.79 % --problem_path "" % 0.56/0.79 % --include_path "" % 0.56/0.79 % --clausifier .//eprover % 0.56/0.79 % --clausifier_options --tstp-format % 0.56/0.79 % --stdin false % 0.56/0.79 % --dbg_backtrace false % 0.56/0.79 % --dbg_dump_prop_clauses false % 0.56/0.79 % --dbg_dump_prop_clauses_file - % 0.56/0.79 % --dbg_out_stat false % 0.56/0.79 % 0.56/0.79 % ------ General Options % 0.56/0.79 % 0.56/0.79 % --fof false % 0.56/0.79 % --time_out_real 150. % 0.56/0.79 % --time_out_prep_mult 0.2 % 0.56/0.79 % --time_out_virtual -1. % 0.56/0.79 % --schedule none % 0.56/0.79 % --ground_splitting input % 0.56/0.79 % --splitting_nvd 16 % 0.56/0.79 % --non_eq_to_eq false % 0.56/0.79 % --prep_gs_sim true % 0.56/0.79 % --prep_unflatten false % 0.56/0.79 % --prep_res_sim true % 0.56/0.79 % --prep_upred true % 0.56/0.79 % --res_sim_input true % 0.56/0.79 % --clause_weak_htbl true % 0.56/0.79 % --gc_record_bc_elim false % 0.56/0.79 % --symbol_type_check false % 0.56/0.79 % --clausify_out false % 0.56/0.79 % --large_theory_mode false % 0.56/0.79 % --prep_sem_filter none % 0.56/0.79 % --prep_sem_filter_out false % 0.56/0.79 % --preprocessed_out false % 0.56/0.79 % --sub_typing false % 0.56/0.79 % --brand_transform false % 0.56/0.79 % --pure_diseq_elim true % 0.56/0.79 % --min_unsat_core false % 0.56/0.79 % --pred_elim true % 0.56/0.79 % --add_important_lit false % 0.56/0.79 % --soft_assumptions false % 0.56/0.79 % --reset_solvers false % 0.56/0.79 % --bc_imp_inh [] % 0.56/0.79 % --conj_cone_tolerance 1.5 % 0.56/0.79 % --prolific_symb_bound 500 % 0.56/0.79 % --lt_threshold 2000 % 0.56/0.79 % 0.56/0.79 % ------ SAT Options % 0.56/0.79 % 0.56/0.79 % --sat_mode false % 0.56/0.79 % --sat_fm_restart_options "" % 0.56/0.79 % --sat_gr_def false % 0.56/0.79 % --sat_epr_types true % 0.56/0.79 % --sat_non_cyclic_types false % 0.56/0.79 % --sat_finite_models false % 0.56/0.79 % --sat_fm_lemmas false % 0.56/0.79 % --sat_fm_prep false % 0.56/0.79 % --sat_fm_uc_incr true % 0.56/0.79 % --sat_out_model small % 0.56/0.79 % --sat_out_clauses false % 0.56/0.79 % 0.56/0.79 % ------ QBF Options % 0.56/0.79 % 0.56/0.79 % --qbf_mode false % 0.56/0.79 % --qbf_elim_univ true % 0.56/0.79 % --qbf_sk_in true % 0.56/0.79 % --qbf_pred_elim true % 0.56/0.79 % --qbf_split 32 % 0.56/0.79 % 0.56/0.79 % ------ BMC1 Options % 0.56/0.79 % 0.56/0.79 % --bmc1_incremental false % 0.56/0.79 % --bmc1_axioms reachable_all % 0.56/0.79 % --bmc1_min_bound 0 % 0.56/0.79 % --bmc1_max_bound -1 % 0.56/0.79 % --bmc1_max_bound_default -1 % 0.56/0.79 % --bmc1_symbol_reachability true % 0.56/0.79 % --bmc1_property_lemmas false % 0.56/0.79 % --bmc1_k_induction false % 0.56/0.79 % --bmc1_non_equiv_states false % 0.56/0.79 % --bmc1_deadlock false % 0.56/0.79 % --bmc1_ucm false % 0.56/0.79 % --bmc1_add_unsat_core none % 0.56/0.79 % --bmc1_unsat_core_children false % 0.56/0.79 % --bmc1_unsat_core_extrapolate_axioms false % 0.56/0.79 % --bmc1_out_stat full % 0.56/0.79 % --bmc1_ground_init false % 0.56/0.79 % --bmc1_pre_inst_next_state false % 0.56/0.79 % --bmc1_pre_inst_state false % 0.56/0.79 % --bmc1_pre_inst_reach_state false % 0.56/0.79 % --bmc1_out_unsat_core false % 0.56/0.79 % --bmc1_aig_witness_out false % 0.56/0.79 % --bmc1_verbose false % 0.56/0.79 % --bmc1_dump_clauses_tptp false % 0.56/0.79 % --bmc1_dump_unsat_core_tptp false % 0.56/0.79 % --bmc1_dump_file - % 0.56/0.79 % --bmc1_ucm_expand_uc_limit 128 % 0.56/0.79 % --bmc1_ucm_n_expand_iterations 6 % 0.56/0.79 % --bmc1_ucm_extend_mode 1 % 0.56/0.79 % --bmc1_ucm_init_mode 2 % 0.56/0.79 % --bmc1_ucm_cone_mode none % 0.56/0.79 % --bmc1_ucm_reduced_relation_type 0 % 0.56/0.79 % --bmc1_ucm_relax_model 4 % 0.56/0.79 % --bmc1_ucm_full_tr_after_sat true % 0.56/0.79 % --bmc1_ucm_expand_neg_assumptions false % 0.56/0.79 % --bmc1_ucm_layered_model none % 0.56/0.79 % --bmc1_ucm_max_lemma_size 10 % 0.56/0.79 % 0.56/0.79 % ------ AIG Options % 0.56/0.79 % 0.56/0.79 % --aig_mode false % 0.56/0.79 % 0.56/0.79 % ------ Instantiation Options % 0.56/0.79 % 0.56/0.79 % --instantiation_flag true % 0.56/0.79 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 0.56/0.79 % --inst_solver_per_active 750 % 0.56/0.79 % --inst_solver_calls_frac 0.5 % 0.56/0.79 % --inst_passive_queue_type priority_queues % 0.56/0.79 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 0.56/0.79 % --inst_passive_queues_freq [25;2] % 0.56/0.79 % --inst_dismatching true % 0.56/0.79 % --inst_eager_unprocessed_to_passive true % 10.54/10.75 % --inst_prop_sim_given true % 10.54/10.75 % --inst_prop_sim_new false % 10.54/10.75 % --inst_orphan_elimination true % 10.54/10.75 % --inst_learning_loop_flag true % 10.54/10.75 % --inst_learning_start 3000 % 10.54/10.75 % --inst_learning_factor 2 % 10.54/10.75 % --inst_start_prop_sim_after_learn 3 % 10.54/10.75 % --inst_sel_renew solver % 10.54/10.75 % --inst_lit_activity_flag true % 10.54/10.75 % --inst_out_proof true % 10.54/10.75 % 10.54/10.75 % ------ Resolution Options % 10.54/10.75 % 10.54/10.75 % --resolution_flag true % 10.54/10.75 % --res_lit_sel kbo_max % 10.54/10.75 % --res_to_prop_solver none % 10.54/10.75 % --res_prop_simpl_new false % 10.54/10.75 % --res_prop_simpl_given false % 10.54/10.75 % --res_passive_queue_type priority_queues % 10.54/10.75 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 10.54/10.75 % --res_passive_queues_freq [15;5] % 10.54/10.75 % --res_forward_subs full % 10.54/10.75 % --res_backward_subs full % 10.54/10.75 % --res_forward_subs_resolution true % 10.54/10.75 % --res_backward_subs_resolution true % 10.54/10.75 % --res_orphan_elimination false % 10.54/10.75 % --res_time_limit 1000. % 10.54/10.75 % --res_out_proof true % 10.54/10.75 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c1b360.s % 10.54/10.75 % --modulo true % 10.54/10.75 % 10.54/10.75 % ------ Combination Options % 10.54/10.75 % 10.54/10.75 % --comb_res_mult 1000 % 10.54/10.75 % --comb_inst_mult 300 % 10.54/10.75 % ------ % 10.54/10.75 % 10.54/10.75 % 10.54/10.75 % 10.54/10.75 % ------ Proving... % 10.54/10.75 % warning: shown sat in sat incomplete mode % 10.54/10.75 % % 10.54/10.75 % 10.54/10.75 % 10.54/10.75 ------ Building Model...Done % 10.54/10.75 % 10.54/10.75 %------ The model is defined over ground terms (initial term algebra). % 10.54/10.75 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 10.54/10.75 %------ where \phi is a formula over the term algebra. % 10.54/10.75 %------ If we have equality in the problem then it is also defined as a predicate above, % 10.54/10.75 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 10.54/10.75 %------ See help for --sat_out_model for different model outputs. % 10.54/10.75 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 10.54/10.75 %------ where the first argument stands for the sort ($i in the unsorted case) % 10.54/10.75 % 10.54/10.75 % 10.54/10.75 % 10.54/10.75 % 10.54/10.75 %------ Positive definition of epred2_0 % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 ( epred2_0 <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of actual_world % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0] : % 10.54/10.75 ( actual_world(X0) <=> % 10.54/10.75 ( % 10.54/10.75 ( % 10.54/10.75 ( X0=sk3_esk1_0 ) % 10.54/10.75 ) % 10.54/10.75 % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of group % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( group(X0,X1) <=> % 10.54/10.75 ( % 10.54/10.75 ( % 10.54/10.75 ( X0=sk3_esk1_0 & X1=sk3_esk8_0 ) % 10.54/10.75 ) % 10.54/10.75 % 10.54/10.75 | % 10.54/10.75 ( % 10.54/10.75 ( X0=sk3_esk1_0 & X1=sk3_esk11_0 ) % 10.54/10.75 ) % 10.54/10.75 % 10.54/10.75 | % 10.54/10.75 ( % 10.54/10.75 ( X0=sk3_esk1_0 & X1=sk3_esk2_0 ) % 10.54/10.75 ) % 10.54/10.75 % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of frontseat % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( frontseat(X0,X1) <=> % 10.54/10.75 ( % 10.54/10.75 ( % 10.54/10.75 ( X0=sk3_esk1_0 & X1=sk3_esk6_0 ) % 10.54/10.75 ) % 10.54/10.75 % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of of % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2] : % 10.54/10.75 ( ~(of(X0,X1,X2)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of city % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( ~(city(X0,X1)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of hollywood_placename % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( ~(hollywood_placename(X0,X1)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of placename % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( ~(placename(X0,X1)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of chevy % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( chevy(X0,X1) <=> % 10.54/10.75 ( % 10.54/10.75 ( % 10.54/10.75 ( X0=sk3_esk1_0 & X1=sk3_esk5_0 ) % 10.54/10.75 ) % 10.54/10.75 % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of white % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( ~(white(X0,X1)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of dirty % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( ~(dirty(X0,X1)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of old % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( ~(old(X0,X1)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of street % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( ~(street(X0,X1)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of lonely % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( ~(lonely(X0,X1)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of event % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( event(X0,X1) <=> % 10.54/10.75 ( % 10.54/10.75 ( % 10.54/10.75 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 ) % 10.54/10.75 ) % 10.54/10.75 % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of agent % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2] : % 10.54/10.75 ( ~(agent(X0,X1,X2)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of present % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( present(X0,X1) <=> % 10.54/10.75 ( % 10.54/10.75 ( % 10.54/10.75 ( X0=sk3_esk1_0 & X1=sk3_esk7_0 ) % 10.54/10.75 ) % 10.54/10.75 % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of barrel % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( ~(barrel(X0,X1)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of down % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2] : % 10.54/10.75 ( ~(down(X0,X1,X2)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Negative definition of in % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2] : % 10.54/10.75 ( ~(in(X0,X1,X2)) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of two % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( two(X0,X1) <=> % 10.54/10.75 ( % 10.54/10.75 ( % 10.54/10.75 ( X0=sk3_esk1_0 & X1=sk3_esk8_0 ) % 10.54/10.75 ) % 10.54/10.75 % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of wear % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( wear(X0,X1) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of nonreflexive % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1] : % 10.54/10.75 ( nonreflexive(X0,X1) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of epred1_0 % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 ( epred1_0 <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of member % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2] : % 10.54/10.75 ( member(X0,X1,X2) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP0_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 10.54/10.75 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP3_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP5_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 10.54/10.75 ( sP5_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP6_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 10.54/10.75 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP8_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP8_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP9_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP12_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 10.54/10.75 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP14_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP14_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP15_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP15_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP17_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP17_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP18_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 10.54/10.75 ( sP18_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP21_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP21_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP23_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 10.54/10.75 ( sP23_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 10.54/10.75 $false % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP24_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 10.54/10.75 ( sP24_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP26_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 10.54/10.75 ( sP26_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP28_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP28_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP30_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP32_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 10.54/10.75 ( sP32_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP35_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP35_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP38_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 10.54/10.75 ( sP38_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP41_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP41_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP44_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 10.54/10.75 ( sP44_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP47_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP47_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP50_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 10.54/10.75 ( sP50_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 %------ Positive definition of sP52_iProver_split % 10.54/10.75 fof(lit_def,axiom, % 10.54/10.75 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 10.54/10.75 ( sP52_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 10.54/10.75 $true % 10.54/10.75 ) % 10.54/10.75 ) % 10.54/10.75 ). % 10.54/10.75 % 10.54/10.75 % 10.54/10.75 % 10.54/10.75 % ------ Statistics % 10.54/10.75 % 10.54/10.75 % ------ General % 10.54/10.75 % 10.54/10.75 % num_of_input_clauses: 121 % 10.54/10.75 % num_of_input_neg_conjectures: 1 % 10.54/10.75 % num_of_splits: 54 % 10.54/10.75 % num_of_split_atoms: 54 % 10.54/10.75 % num_of_sem_filtered_clauses: 0 % 10.54/10.75 % num_of_subtypes: 0 % 10.54/10.75 % monotx_restored_types: 0 % 10.54/10.75 % sat_num_of_epr_types: 0 % 10.54/10.75 % sat_num_of_non_cyclic_types: 0 % 10.54/10.75 % sat_guarded_non_collapsed_types: 0 % 10.54/10.75 % is_epr: 0 % 10.54/10.75 % is_horn: 0 % 10.54/10.75 % has_eq: 0 % 10.54/10.75 % num_pure_diseq_elim: 0 % 10.54/10.75 % simp_replaced_by: 0 % 10.54/10.75 % res_preprocessed: 176 % 10.54/10.75 % prep_upred: 0 % 10.54/10.75 % prep_unflattend: 0 % 10.54/10.75 % pred_elim_cands: 85 % 10.54/10.75 % pred_elim: 15 % 10.54/10.75 % pred_elim_cl: 15 % 10.54/10.75 % pred_elim_cycles: 80 % 10.54/10.75 % forced_gc_time: 0 % 10.54/10.75 % gc_basic_clause_elim: 0 % 10.54/10.75 % parsing_time: 0.026 % 10.54/10.75 % sem_filter_time: 0. % 10.54/10.75 % pred_elim_time: 0.238 % 10.54/10.75 % out_proof_time: 0. % 10.54/10.75 % monotx_time: 0. % 10.54/10.75 % subtype_inf_time: 0. % 10.54/10.75 % unif_index_cands_time: 0.007 % 10.54/10.75 % unif_index_add_time: 0.008 % 10.54/10.75 % total_time: 10.323 % 10.54/10.75 % num_of_symbols: 146 % 10.54/10.75 % num_of_terms: 17209 % 10.54/10.75 % 10.54/10.75 % ------ Propositional Solver % 10.54/10.75 % 10.54/10.75 % prop_solver_calls: 7 % 10.54/10.75 % prop_fast_solver_calls: 6904 % 10.54/10.75 % prop_num_of_clauses: 3003 % 10.54/10.75 % prop_preprocess_simplified: 4880 % 10.54/10.75 % prop_fo_subsumed: 112 % 10.54/10.75 % prop_solver_time: 0. % 10.54/10.75 % prop_fast_solver_time: 0.016 % 10.54/10.75 % prop_unsat_core_time: 0. % 10.54/10.75 % 10.54/10.75 % ------ QBF % 10.54/10.75 % 10.54/10.75 % qbf_q_res: 0 % 10.54/10.75 % qbf_num_tautologies: 0 % 10.54/10.75 % qbf_prep_cycles: 0 % 10.54/10.75 % 10.54/10.75 % ------ BMC1 % 10.54/10.75 % 10.54/10.75 % bmc1_current_bound: -1 % 10.54/10.75 % bmc1_last_solved_bound: -1 % 10.54/10.75 % bmc1_unsat_core_size: -1 % 10.54/10.75 % bmc1_unsat_core_parents_size: -1 % 10.54/10.75 % bmc1_merge_next_fun: 0 % 10.54/10.75 % bmc1_unsat_core_clauses_time: 0. % 10.54/10.75 % 10.54/10.75 % ------ Instantiation % 10.54/10.75 % 10.54/10.75 % inst_num_of_clauses: 1284 % 10.54/10.75 % inst_num_in_passive: 0 % 10.54/10.75 % inst_num_in_active: 1284 % 10.54/10.75 % inst_num_in_unprocessed: 0 % 10.54/10.75 % inst_num_of_loops: 1290 % 10.54/10.75 % inst_num_of_learning_restarts: 0 % 10.54/10.75 % inst_num_moves_active_passive: 0 % 10.54/10.75 % inst_lit_activity: 397 % 10.54/10.75 % inst_lit_activity_moves: 0 % 10.54/10.75 % inst_num_tautologies: 0 % 10.54/10.75 % inst_num_prop_implied: 0 % 10.54/10.75 % inst_num_existing_simplified: 0 % 10.54/10.75 % inst_num_eq_res_simplified: 0 % 10.54/10.75 % inst_num_child_elim: 0 % 10.54/10.75 % inst_num_of_dismatching_blockings: 0 % 10.54/10.75 % inst_num_of_non_proper_insts: 1124 % 10.54/10.75 % inst_num_of_duplicates: 0 % 10.54/10.75 % inst_inst_num_from_inst_to_res: 0 % 10.54/10.75 % inst_dismatching_checking_time: 0. % 10.54/10.75 % 10.54/10.75 % ------ Resolution % 10.54/10.75 % 10.54/10.75 % res_num_of_clauses: 17434 % 10.54/10.75 % res_num_in_passive: 13046 % 10.54/10.75 % res_num_in_active: 4396 % 10.54/10.75 % res_num_of_loops: 5000 % 10.54/10.75 % res_forward_subset_subsumed: 3326 % 10.54/10.75 % res_backward_subset_subsumed: 44 % 10.54/10.75 % res_forward_subsumed: 0 % 10.54/10.75 % res_backward_subsumed: 0 % 10.54/10.75 % res_forward_subsumption_resolution: 2734 % 10.54/10.75 % res_backward_subsumption_resolution: 0 % 10.54/10.75 % res_clause_to_clause_subsumption: 11212 % 10.54/10.75 % res_orphan_elimination: 0 % 10.54/10.75 % res_tautology_del: 6179 % 10.54/10.75 % res_num_eq_res_simplified: 0 % 10.54/10.75 % res_num_sel_changes: 0 % 10.54/10.75 % res_moves_from_active_to_pass: 0 % 10.54/10.75 % 10.54/10.75 % Status Unknown % 10.63/10.82 % Orienting using strategy ClausalAll % 10.63/10.82 % FOF problem with conjecture % 10.63/10.82 % 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_c1b360.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_a5b60a.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_7adbbf | grep -v "SZS" % 10.63/10.83 % 10.63/10.83 %---------------- iProver v2.5 (CASC-J8 2016) ----------------% % 10.63/10.83 % 10.63/10.83 % % 10.63/10.83 % ------ iProver source info % 10.63/10.83 % 10.63/10.83 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3 % 10.63/10.83 % git: non_committed_changes: true % 10.63/10.83 % git: last_make_outside_of_git: true % 10.63/10.83 % 10.63/10.83 % % 10.63/10.83 % ------ Input Options % 10.63/10.83 % 10.63/10.83 % --out_options all % 10.63/10.83 % --tptp_safe_out true % 10.63/10.83 % --problem_path "" % 10.63/10.83 % --include_path "" % 10.63/10.83 % --clausifier .//eprover % 10.63/10.83 % --clausifier_options --tstp-format % 10.63/10.83 % --stdin false % 10.63/10.83 % --dbg_backtrace false % 10.63/10.83 % --dbg_dump_prop_clauses false % 10.63/10.83 % --dbg_dump_prop_clauses_file - % 10.63/10.83 % --dbg_out_stat false % 10.63/10.83 % 10.63/10.83 % ------ General Options % 10.63/10.83 % 10.63/10.83 % --fof false % 10.63/10.83 % --time_out_real 150. % 10.63/10.83 % --time_out_prep_mult 0.2 % 10.63/10.83 % --time_out_virtual -1. % 10.63/10.83 % --schedule none % 10.63/10.83 % --ground_splitting input % 10.63/10.83 % --splitting_nvd 16 % 10.63/10.83 % --non_eq_to_eq false % 10.63/10.83 % --prep_gs_sim true % 10.63/10.83 % --prep_unflatten false % 10.63/10.83 % --prep_res_sim true % 10.63/10.83 % --prep_upred true % 10.63/10.83 % --res_sim_input true % 10.63/10.83 % --clause_weak_htbl true % 10.63/10.83 % --gc_record_bc_elim false % 10.63/10.83 % --symbol_type_check false % 10.63/10.83 % --clausify_out false % 10.63/10.83 % --large_theory_mode false % 10.63/10.83 % --prep_sem_filter none % 10.63/10.83 % --prep_sem_filter_out false % 10.63/10.83 % --preprocessed_out false % 10.63/10.83 % --sub_typing false % 10.63/10.83 % --brand_transform false % 10.63/10.83 % --pure_diseq_elim true % 10.63/10.83 % --min_unsat_core false % 10.63/10.83 % --pred_elim true % 10.63/10.83 % --add_important_lit false % 10.63/10.83 % --soft_assumptions false % 10.63/10.83 % --reset_solvers false % 10.63/10.83 % --bc_imp_inh [] % 10.63/10.83 % --conj_cone_tolerance 1.5 % 10.63/10.83 % --prolific_symb_bound 500 % 10.63/10.83 % --lt_threshold 2000 % 10.63/10.83 % 10.63/10.83 % ------ SAT Options % 10.63/10.83 % 10.63/10.83 % --sat_mode false % 10.63/10.83 % --sat_fm_restart_options "" % 10.63/10.83 % --sat_gr_def false % 10.63/10.83 % --sat_epr_types true % 10.63/10.83 % --sat_non_cyclic_types false % 10.63/10.83 % --sat_finite_models false % 10.63/10.83 % --sat_fm_lemmas false % 10.63/10.83 % --sat_fm_prep false % 10.63/10.83 % --sat_fm_uc_incr true % 10.63/10.83 % --sat_out_model small % 10.63/10.83 % --sat_out_clauses false % 10.63/10.83 % 10.63/10.83 % ------ QBF Options % 10.63/10.83 % 10.63/10.83 % --qbf_mode false % 10.63/10.83 % --qbf_elim_univ true % 10.63/10.83 % --qbf_sk_in true % 10.63/10.83 % --qbf_pred_elim true % 10.63/10.83 % --qbf_split 32 % 10.63/10.83 % 10.63/10.83 % ------ BMC1 Options % 10.63/10.83 % 10.63/10.83 % --bmc1_incremental false % 10.63/10.83 % --bmc1_axioms reachable_all % 10.63/10.83 % --bmc1_min_bound 0 % 10.63/10.83 % --bmc1_max_bound -1 % 10.63/10.83 % --bmc1_max_bound_default -1 % 10.63/10.83 % --bmc1_symbol_reachability true % 10.63/10.83 % --bmc1_property_lemmas false % 10.63/10.83 % --bmc1_k_induction false % 10.63/10.83 % --bmc1_non_equiv_states false % 10.63/10.83 % --bmc1_deadlock false % 10.63/10.83 % --bmc1_ucm false % 10.63/10.83 % --bmc1_add_unsat_core none % 10.63/10.83 % --bmc1_unsat_core_children false % 10.63/10.83 % --bmc1_unsat_core_extrapolate_axioms false % 10.63/10.83 % --bmc1_out_stat full % 10.63/10.83 % --bmc1_ground_init false % 10.63/10.83 % --bmc1_pre_inst_next_state false % 10.63/10.83 % --bmc1_pre_inst_state false % 10.63/10.83 % --bmc1_pre_inst_reach_state false % 10.63/10.83 % --bmc1_out_unsat_core false % 10.63/10.83 % --bmc1_aig_witness_out false % 10.63/10.83 % --bmc1_verbose false % 10.63/10.83 % --bmc1_dump_clauses_tptp false % 10.67/11.05 % --bmc1_dump_unsat_core_tptp false % 10.67/11.05 % --bmc1_dump_file - % 10.67/11.05 % --bmc1_ucm_expand_uc_limit 128 % 10.67/11.05 % --bmc1_ucm_n_expand_iterations 6 % 10.67/11.05 % --bmc1_ucm_extend_mode 1 % 10.67/11.05 % --bmc1_ucm_init_mode 2 % 10.67/11.05 % --bmc1_ucm_cone_mode none % 10.67/11.05 % --bmc1_ucm_reduced_relation_type 0 % 10.67/11.05 % --bmc1_ucm_relax_model 4 % 10.67/11.05 % --bmc1_ucm_full_tr_after_sat true % 10.67/11.05 % --bmc1_ucm_expand_neg_assumptions false % 10.67/11.05 % --bmc1_ucm_layered_model none % 10.67/11.05 % --bmc1_ucm_max_lemma_size 10 % 10.67/11.05 % 10.67/11.05 % ------ AIG Options % 10.67/11.05 % 10.67/11.05 % --aig_mode false % 10.67/11.05 % 10.67/11.05 % ------ Instantiation Options % 10.67/11.05 % 10.67/11.05 % --instantiation_flag true % 10.67/11.05 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 10.67/11.05 % --inst_solver_per_active 750 % 10.67/11.05 % --inst_solver_calls_frac 0.5 % 10.67/11.05 % --inst_passive_queue_type priority_queues % 10.67/11.05 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 10.67/11.05 % --inst_passive_queues_freq [25;2] % 10.67/11.05 % --inst_dismatching true % 10.67/11.05 % --inst_eager_unprocessed_to_passive true % 10.67/11.05 % --inst_prop_sim_given true % 10.67/11.05 % --inst_prop_sim_new false % 10.67/11.05 % --inst_orphan_elimination true % 10.67/11.05 % --inst_learning_loop_flag true % 10.67/11.05 % --inst_learning_start 3000 % 10.67/11.05 % --inst_learning_factor 2 % 10.67/11.05 % --inst_start_prop_sim_after_learn 3 % 10.67/11.05 % --inst_sel_renew solver % 10.67/11.05 % --inst_lit_activity_flag true % 10.67/11.05 % --inst_out_proof true % 10.67/11.05 % 10.67/11.05 % ------ Resolution Options % 10.67/11.05 % 10.67/11.05 % --resolution_flag true % 10.67/11.05 % --res_lit_sel kbo_max % 10.67/11.05 % --res_to_prop_solver none % 10.67/11.05 % --res_prop_simpl_new false % 10.67/11.05 % --res_prop_simpl_given false % 10.67/11.05 % --res_passive_queue_type priority_queues % 10.67/11.05 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 10.67/11.05 % --res_passive_queues_freq [15;5] % 10.67/11.05 % --res_forward_subs full % 10.67/11.05 % --res_backward_subs full % 10.67/11.05 % --res_forward_subs_resolution true % 10.67/11.05 % --res_backward_subs_resolution true % 10.67/11.05 % --res_orphan_elimination false % 10.67/11.05 % --res_time_limit 1000. % 10.67/11.05 % --res_out_proof true % 10.67/11.05 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c1b360.s % 10.67/11.05 % --modulo true % 10.67/11.05 % 10.67/11.05 % ------ Combination Options % 10.67/11.05 % 10.67/11.05 % --comb_res_mult 1000 % 10.67/11.05 % --comb_inst_mult 300 % 10.67/11.05 % ------ % 10.67/11.05 % 10.67/11.05 % ------ Parsing...% successful % 10.67/11.05 % 10.67/11.05 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 54 0s snvd_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e snvd_s sp: 0 0s snvd_e % % 10.67/11.05 % 10.67/11.05 % ------ Proving... % 10.67/11.05 % ------ Problem Properties % 10.67/11.05 % 10.67/11.05 % % 10.67/11.05 % EPR false % 10.67/11.05 % Horn false % 10.67/11.05 % Has equality false % 10.67/11.05 % 10.67/11.05 % % ------ Input Options Time Limit: Unbounded % 10.67/11.05 % 10.67/11.05 % 10.67/11.05 % % ------ Current options: % 10.67/11.05 % 10.67/11.05 % ------ Input Options % 10.67/11.05 % 10.67/11.05 % --out_options all % 10.67/11.05 % --tptp_safe_out true % 10.67/11.05 % --problem_path "" % 10.67/11.05 % --include_path "" % 10.67/11.05 % --clausifier .//eprover % 10.67/11.05 % --clausifier_options --tstp-format % 10.67/11.05 % --stdin false % 10.67/11.05 % --dbg_backtrace false % 10.67/11.05 % --dbg_dump_prop_clauses false % 10.67/11.05 % --dbg_dump_prop_clauses_file - % 10.67/11.05 % --dbg_out_stat false % 10.67/11.05 % 10.67/11.05 % ------ General Options % 10.67/11.05 % 10.67/11.05 % --fof false % 10.67/11.05 % --time_out_real 150. % 10.67/11.05 % --time_out_prep_mult 0.2 % 10.67/11.05 % --time_out_virtual -1. % 10.67/11.05 % --schedule none % 10.67/11.05 % --ground_splitting input % 10.67/11.05 % --splitting_nvd 16 % 10.67/11.05 % --non_eq_to_eq false % 10.67/11.05 % --prep_gs_sim true % 10.67/11.05 % --prep_unflatten false % 10.67/11.05 % --prep_res_sim true % 10.67/11.05 % --prep_upred true % 10.67/11.05 % --res_sim_input true % 10.67/11.05 % --clause_weak_htbl true % 10.67/11.05 % --gc_record_bc_elim false % 10.67/11.05 % --symbol_type_check false % 10.67/11.05 % --clausify_out false % 10.67/11.05 % --large_theory_mode false % 10.67/11.05 % --prep_sem_filter none % 10.67/11.05 % --prep_sem_filter_out false % 10.67/11.05 % --preprocessed_out false % 10.67/11.05 % --sub_typing false % 10.67/11.05 % --brand_transform false % 10.67/11.05 % --pure_diseq_elim true % 10.67/11.05 % --min_unsat_core false % 10.67/11.05 % --pred_elim true % 10.67/11.05 % --add_important_lit false % 10.67/11.05 % --soft_assumptions false % 10.67/11.05 % --reset_solvers false % 10.67/11.05 % --bc_imp_inh [] % 10.67/11.05 % --conj_cone_tolerance 1.5 % 10.67/11.05 % --prolific_symb_bound 500 % 10.67/11.05 % --lt_threshold 2000 % 10.67/11.05 % 10.67/11.05 % ------ SAT Options % 10.67/11.05 % 10.67/11.05 % --sat_mode false % 10.67/11.05 % --sat_fm_restart_options "" % 10.67/11.05 % --sat_gr_def false % 10.67/11.05 % --sat_epr_types true % 10.67/11.05 % --sat_non_cyclic_types false % 10.67/11.05 % --sat_finite_models false % 10.67/11.05 % --sat_fm_lemmas false % 10.67/11.05 % --sat_fm_prep false % 10.67/11.05 % --sat_fm_uc_incr true % 10.67/11.05 % --sat_out_model small % 10.67/11.05 % --sat_out_clauses false % 10.67/11.05 % 10.67/11.05 % ------ QBF Options % 10.67/11.05 % 10.67/11.05 % --qbf_mode false % 10.67/11.05 % --qbf_elim_univ true % 10.67/11.05 % --qbf_sk_in true % 10.67/11.05 % --qbf_pred_elim true % 10.67/11.05 % --qbf_split 32 % 10.67/11.05 % 10.67/11.05 % ------ BMC1 Options % 10.67/11.05 % 10.67/11.05 % --bmc1_incremental false % 10.67/11.05 % --bmc1_axioms reachable_all % 10.67/11.05 % --bmc1_min_bound 0 % 10.67/11.05 % --bmc1_max_bound -1 % 10.67/11.05 % --bmc1_max_bound_default -1 % 10.67/11.05 % --bmc1_symbol_reachability true % 10.67/11.05 % --bmc1_property_lemmas false % 10.67/11.05 % --bmc1_k_induction false % 10.67/11.05 % --bmc1_non_equiv_states false % 10.67/11.05 % --bmc1_deadlock false % 10.67/11.05 % --bmc1_ucm false % 10.67/11.05 % --bmc1_add_unsat_core none % 10.67/11.05 % --bmc1_unsat_core_children false % 10.67/11.05 % --bmc1_unsat_core_extrapolate_axioms false % 10.67/11.05 % --bmc1_out_stat full % 10.67/11.05 % --bmc1_ground_init false % 10.67/11.05 % --bmc1_pre_inst_next_state false % 10.67/11.05 % --bmc1_pre_inst_state false % 10.67/11.05 % --bmc1_pre_inst_reach_state false % 10.67/11.05 % --bmc1_out_unsat_core false % 10.67/11.05 % --bmc1_aig_witness_out false % 10.67/11.05 % --bmc1_verbose false % 10.67/11.05 % --bmc1_dump_clauses_tptp false % 10.67/11.05 % --bmc1_dump_unsat_core_tptp false % 10.67/11.05 % --bmc1_dump_file - % 10.67/11.05 % --bmc1_ucm_expand_uc_limit 128 % 10.67/11.05 % --bmc1_ucm_n_expand_iterations 6 % 10.67/11.05 % --bmc1_ucm_extend_mode 1 % 10.67/11.05 % --bmc1_ucm_init_mode 2 % 10.67/11.05 % --bmc1_ucm_cone_mode none % 10.67/11.05 % --bmc1_ucm_reduced_relation_type 0 % 10.67/11.05 % --bmc1_ucm_relax_model 4 % 10.67/11.05 % --bmc1_ucm_full_tr_after_sat true % 10.67/11.05 % --bmc1_ucm_expand_neg_assumptions false % 10.67/11.05 % --bmc1_ucm_layered_model none % 10.67/11.05 % --bmc1_ucm_max_lemma_size 10 % 10.67/11.05 % 10.67/11.05 % ------ AIG Options % 10.67/11.05 % 10.67/11.05 % --aig_mode false % 10.67/11.05 % 10.67/11.05 % ------ Instantiation Options % 10.67/11.05 % 10.67/11.05 % --instantiation_flag true % 10.67/11.05 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 10.67/11.05 % --inst_solver_per_active 750 % 10.67/11.05 % --inst_solver_calls_frac 0.5 % 10.67/11.05 % --inst_passive_queue_type priority_queues % 10.67/11.05 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 10.67/11.05 % --inst_passive_queues_freq [25;2] % 10.67/11.05 % --inst_dismatching true % 10.67/11.05 % --inst_eager_unprocessed_to_passive true % 20.82/20.99 % --inst_prop_sim_given true % 20.82/20.99 % --inst_prop_sim_new false % 20.82/20.99 % --inst_orphan_elimination true % 20.82/20.99 % --inst_learning_loop_flag true % 20.82/20.99 % --inst_learning_start 3000 % 20.82/20.99 % --inst_learning_factor 2 % 20.82/20.99 % --inst_start_prop_sim_after_learn 3 % 20.82/20.99 % --inst_sel_renew solver % 20.82/20.99 % --inst_lit_activity_flag true % 20.82/20.99 % --inst_out_proof true % 20.82/20.99 % 20.82/20.99 % ------ Resolution Options % 20.82/20.99 % 20.82/20.99 % --resolution_flag true % 20.82/20.99 % --res_lit_sel kbo_max % 20.82/20.99 % --res_to_prop_solver none % 20.82/20.99 % --res_prop_simpl_new false % 20.82/20.99 % --res_prop_simpl_given false % 20.82/20.99 % --res_passive_queue_type priority_queues % 20.82/20.99 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 20.82/20.99 % --res_passive_queues_freq [15;5] % 20.82/20.99 % --res_forward_subs full % 20.82/20.99 % --res_backward_subs full % 20.82/20.99 % --res_forward_subs_resolution true % 20.82/20.99 % --res_backward_subs_resolution true % 20.82/20.99 % --res_orphan_elimination false % 20.82/20.99 % --res_time_limit 1000. % 20.82/20.99 % --res_out_proof true % 20.82/20.99 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_c1b360.s % 20.82/20.99 % --modulo true % 20.82/20.99 % 20.82/20.99 % ------ Combination Options % 20.82/20.99 % 20.82/20.99 % --comb_res_mult 1000 % 20.82/20.99 % --comb_inst_mult 300 % 20.82/20.99 % ------ % 20.82/20.99 % 20.82/20.99 % 20.82/20.99 % 20.82/20.99 % ------ Proving... % 20.82/20.99 % warning: shown sat in sat incomplete mode % 20.82/20.99 % % 20.82/20.99 % 20.82/20.99 % 20.82/20.99 ------ Building Model...Done % 20.82/20.99 % 20.82/20.99 %------ The model is defined over ground terms (initial term algebra). % 20.82/20.99 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 20.82/20.99 %------ where \phi is a formula over the term algebra. % 20.82/20.99 %------ If we have equality in the problem then it is also defined as a predicate above, % 20.82/20.99 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 20.82/20.99 %------ See help for --sat_out_model for different model outputs. % 20.82/20.99 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 20.82/20.99 %------ where the first argument stands for the sort ($i in the unsorted case) % 20.82/20.99 % 20.82/20.99 % 20.82/20.99 % 20.82/20.99 % 20.82/20.99 %------ Positive definition of epred2_0 % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 ( epred2_0 <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of actual_world % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0] : % 20.82/20.99 ( actual_world(X0) <=> % 20.82/20.99 ( % 20.82/20.99 ( % 20.82/20.99 ( X0=sk2_esk1_0 ) % 20.82/20.99 ) % 20.82/20.99 % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of group % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( group(X0,X1) <=> % 20.82/20.99 ( % 20.82/20.99 ( % 20.82/20.99 ( X0=sk2_esk1_0 & X1=sk2_esk8_0 ) % 20.82/20.99 ) % 20.82/20.99 % 20.82/20.99 | % 20.82/20.99 ( % 20.82/20.99 ( X0=sk2_esk1_0 & X1=sk2_esk11_0 ) % 20.82/20.99 ) % 20.82/20.99 % 20.82/20.99 | % 20.82/20.99 ( % 20.82/20.99 ( X0=sk2_esk1_0 & X1=sk2_esk2_0 ) % 20.82/20.99 ) % 20.82/20.99 % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of frontseat % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( frontseat(X0,X1) <=> % 20.82/20.99 ( % 20.82/20.99 ( % 20.82/20.99 ( X0=sk2_esk1_0 & X1=sk2_esk6_0 ) % 20.82/20.99 ) % 20.82/20.99 % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of of % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2] : % 20.82/20.99 ( ~(of(X0,X1,X2)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of city % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( ~(city(X0,X1)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of hollywood_placename % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( ~(hollywood_placename(X0,X1)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of placename % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( ~(placename(X0,X1)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of chevy % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( chevy(X0,X1) <=> % 20.82/20.99 ( % 20.82/20.99 ( % 20.82/20.99 ( X0=sk2_esk1_0 & X1=sk2_esk5_0 ) % 20.82/20.99 ) % 20.82/20.99 % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of white % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( ~(white(X0,X1)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of dirty % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( ~(dirty(X0,X1)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of old % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( ~(old(X0,X1)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of street % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( ~(street(X0,X1)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of lonely % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( ~(lonely(X0,X1)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of event % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( event(X0,X1) <=> % 20.82/20.99 ( % 20.82/20.99 ( % 20.82/20.99 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 ) % 20.82/20.99 ) % 20.82/20.99 % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of agent % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2] : % 20.82/20.99 ( ~(agent(X0,X1,X2)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of present % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( present(X0,X1) <=> % 20.82/20.99 ( % 20.82/20.99 ( % 20.82/20.99 ( X0=sk2_esk1_0 & X1=sk2_esk7_0 ) % 20.82/20.99 ) % 20.82/20.99 % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of barrel % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( ~(barrel(X0,X1)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of down % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2] : % 20.82/20.99 ( ~(down(X0,X1,X2)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Negative definition of in % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2] : % 20.82/20.99 ( ~(in(X0,X1,X2)) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of two % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( two(X0,X1) <=> % 20.82/20.99 ( % 20.82/20.99 ( % 20.82/20.99 ( X0=sk2_esk1_0 & X1=sk2_esk8_0 ) % 20.82/20.99 ) % 20.82/20.99 % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of wear % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( wear(X0,X1) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of nonreflexive % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1] : % 20.82/20.99 ( nonreflexive(X0,X1) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of epred1_0 % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 ( epred1_0 <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of member % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2] : % 20.82/20.99 ( member(X0,X1,X2) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP0_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 20.82/20.99 ( sP0_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP3_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP3_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP5_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9] : % 20.82/20.99 ( sP5_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8,X9) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP6_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 20.82/20.99 ( sP6_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP8_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP8_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP9_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP9_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP12_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 20.82/20.99 ( sP12_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP14_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP14_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP15_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP15_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP17_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP17_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP18_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 20.82/20.99 ( sP18_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP21_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP21_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP23_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 20.82/20.99 ( sP23_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 20.82/20.99 $false % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP24_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 20.82/20.99 ( sP24_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP26_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 20.82/20.99 ( sP26_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP28_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP28_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP30_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP30_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP32_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 20.82/20.99 ( sP32_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP35_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP35_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP38_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 20.82/20.99 ( sP38_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP41_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP41_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP44_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 20.82/20.99 ( sP44_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP47_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP47_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP50_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7] : % 20.82/20.99 ( sP50_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 %------ Positive definition of sP52_iProver_split % 20.82/20.99 fof(lit_def,axiom, % 20.82/20.99 (! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : % 20.82/20.99 ( sP52_iProver_split(X0,X1,X2,X3,X4,X5,X6,X7,X8) <=> % 20.82/20.99 $true % 20.82/20.99 ) % 20.82/20.99 ) % 20.82/20.99 ). % 20.82/20.99 % 20.82/20.99 % 20.82/20.99 % 20.82/20.99 % ------ Statistics % 20.82/20.99 % 20.82/20.99 % ------ General % 20.82/20.99 % 20.82/20.99 % num_of_input_clauses: 121 % 20.82/20.99 % num_of_input_neg_conjectures: 1 % 20.82/20.99 % num_of_splits: 54 % 20.82/20.99 % num_of_split_atoms: 54 % 20.82/20.99 % num_of_sem_filtered_clauses: 0 % 20.82/20.99 % num_of_subtypes: 0 % 20.82/20.99 % monotx_restored_types: 0 % 20.82/20.99 % sat_num_of_epr_types: 0 % 20.82/20.99 % sat_num_of_non_cyclic_types: 0 % 20.82/20.99 % sat_guarded_non_collapsed_types: 0 % 20.82/20.99 % is_epr: 0 % 20.82/20.99 % is_horn: 0 % 20.82/20.99 % has_eq: 0 % 20.82/20.99 % num_pure_diseq_elim: 0 % 20.82/20.99 % simp_replaced_by: 0 % 20.82/20.99 % res_preprocessed: 176 % 20.82/20.99 % prep_upred: 0 % 20.82/20.99 % prep_unflattend: 0 % 20.82/20.99 % pred_elim_cands: 85 % 20.82/20.99 % pred_elim: 15 % 20.82/20.99 % pred_elim_cl: 15 % 20.82/20.99 % pred_elim_cycles: 80 % 20.82/20.99 % forced_gc_time: 0 % 20.82/20.99 % gc_basic_clause_elim: 0 % 20.82/20.99 % parsing_time: 0.011 % 20.82/20.99 % sem_filter_time: 0. % 20.82/20.99 % pred_elim_time: 0.168 % 20.82/20.99 % out_proof_time: 0. % 20.82/20.99 % monotx_time: 0. % 20.82/20.99 % subtype_inf_time: 0. % 20.82/20.99 % unif_index_cands_time: 0.007 % 20.82/20.99 % unif_index_add_time: 0.008 % 20.82/20.99 % total_time: 10.163 % 20.82/20.99 % num_of_symbols: 146 % 20.82/20.99 % num_of_terms: 17209 % 20.82/20.99 % 20.82/20.99 % ------ Propositional Solver % 20.82/20.99 % 20.82/20.99 % prop_solver_calls: 7 % 20.82/20.99 % prop_fast_solver_calls: 6904 % 20.82/20.99 % prop_num_of_clauses: 3003 % 20.82/20.99 % prop_preprocess_simplified: 4880 % 20.82/20.99 % prop_fo_subsumed: 112 % 20.82/20.99 % prop_solver_time: 0. % 20.82/20.99 % prop_fast_solver_time: 0.008 % 20.82/20.99 % prop_unsat_core_time: 0. % 20.82/20.99 % 20.82/20.99 % ------ QBF % 20.82/20.99 % 20.82/20.99 % qbf_q_res: 0 % 20.82/20.99 % qbf_num_tautologies: 0 % 20.82/20.99 % qbf_prep_cycles: 0 % 20.82/20.99 % 20.82/20.99 % ------ BMC1 % 20.82/20.99 % 20.82/20.99 % bmc1_current_bound: -1 % 20.82/20.99 % bmc1_last_solved_bound: -1 % 20.82/20.99 % bmc1_unsat_core_size: -1 % 20.82/20.99 % bmc1_unsat_core_parents_size: -1 % 20.82/20.99 % bmc1_merge_next_fun: 0 % 20.82/20.99 % bmc1_unsat_core_clauses_time: 0. % 20.82/20.99 % 20.82/20.99 % ------ Instantiation % 20.82/20.99 % 20.82/20.99 % inst_num_of_clauses: 1284 % 20.82/20.99 % inst_num_in_passive: 0 % 20.82/20.99 % inst_num_in_active: 1284 % 20.82/20.99 % inst_num_in_unprocessed: 0 % 20.82/20.99 % inst_num_of_loops: 1290 % 20.82/20.99 % inst_num_of_learning_restarts: 0 % 20.82/20.99 % inst_num_moves_active_passive: 0 % 20.82/20.99 % inst_lit_activity: 397 % 20.82/20.99 % inst_lit_activity_moves: 0 % 20.82/20.99 % inst_num_tautologies: 0 % 20.82/20.99 % inst_num_prop_implied: 0 % 20.82/20.99 % inst_num_existing_simplified: 0 % 20.82/20.99 % inst_num_eq_res_simplified: 0 % 20.82/20.99 % inst_num_child_elim: 0 % 20.82/20.99 % inst_num_of_dismatching_blockings: 0 % 20.82/20.99 % inst_num_of_non_proper_insts: 1124 % 20.82/20.99 % inst_num_of_duplicates: 0 % 20.82/20.99 % inst_inst_num_from_inst_to_res: 0 % 20.82/20.99 % inst_dismatching_checking_time: 0. % 20.82/20.99 % 20.82/20.99 % ------ Resolution % 20.82/20.99 % 20.82/20.99 % res_num_of_clauses: 17434 % 20.82/20.99 % res_num_in_passive: 13046 % 20.82/20.99 % res_num_in_active: 4396 % 20.82/20.99 % res_num_of_loops: 5000 % 20.82/20.99 % res_forward_subset_subsumed: 3326 % 20.82/20.99 % res_backward_subset_subsumed: 44 % 20.82/20.99 % res_forward_subsumed: 0 % 20.82/20.99 % res_backward_subsumed: 0 % 20.82/20.99 % res_forward_subsumption_resolution: 2734 % 20.82/20.99 % res_backward_subsumption_resolution: 0 % 20.82/20.99 % res_clause_to_clause_subsumption: 11212 % 20.82/20.99 % res_orphan_elimination: 0 % 20.82/20.99 % res_tautology_del: 6179 % 20.82/20.99 % res_num_eq_res_simplified: 0 % 20.82/20.99 % res_num_sel_changes: 0 % 20.82/20.99 % res_moves_from_active_to_pass: 0 % 20.82/20.99 % 20.82/20.99 % Status Unknown % 20.82/20.99 % Last status : % 20.82/20.99 % SZS status Unknown %------------------------------------------------------------------------------