0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : run_iprover %s %d SAT 0.13/0.34 % Computer : n005.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1440 0.13/0.34 % WCLimit : 180 0.13/0.34 % DateTime : Mon Jul 3 04:06:00 EDT 2023 0.13/0.34 % CPUTime : 0.20/0.47 Running model finding 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox/benchmark/theBenchmark.p 180 0.43/0.60 WARNING - Could not infer the problem pformat. Setting FOF as default 0.45/1.13 % SZS status Started for theBenchmark.p 0.45/1.13 % SZS status Satisfiable for theBenchmark.p 0.45/1.13 0.45/1.13 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------% 0.45/1.13 0.45/1.13 ------ iProver source info 0.45/1.13 0.45/1.13 git: date: 2023-05-31 18:12:56 +0000 0.45/1.13 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6 0.45/1.13 git: non_committed_changes: false 0.45/1.13 git: last_make_outside_of_git: false 0.45/1.13 0.45/1.13 ------ Parsing... 0.45/1.13 ------ Clausification by vclausify_rel & Parsing by iProver... 0.45/1.13 0.45/1.13 ------ Preprocessing... pe_s pe_e 0.45/1.13 0.45/1.13 ------ Preprocessing... scvd_s sp: 38 0s scvd_e snvd_s sp: 0 0s snvd_e 0.45/1.13 ------ Proving... 0.45/1.13 ------ Problem Properties 0.45/1.13 0.45/1.13 0.45/1.13 clauses 88 0.45/1.13 conjectures 19 0.45/1.13 EPR 36 0.45/1.13 Horn 55 0.45/1.13 unary 0 0.45/1.13 binary 55 0.45/1.13 lits 224 0.45/1.13 lits eq 0 0.45/1.13 fd_pure 0 0.45/1.13 fd_pseudo 0 0.45/1.13 fd_cond 0 0.45/1.13 fd_pseudo_cond 0 0.45/1.13 AC symbols 0 0.45/1.13 0.45/1.13 ------ Input Options Time Limit: Unbounded 0.45/1.13 0.45/1.13 0.45/1.13 ------ Finite Models: 0.45/1.13 0.45/1.13 ------ lit_activity_flag true 0.45/1.13 0.45/1.13 0.45/1.13 ------ Trying domains of size >= : 1 0.45/1.13 0.45/1.13 ------ Trying domains of size >= : 2 0.45/1.13 0.45/1.13 ------ Trying domains of size >= : 2 0.45/1.13 0.45/1.13 ------ Trying domains of size >= : 2 0.45/1.13 0.45/1.13 ------ Trying domains of size >= : 2 0.45/1.13 0.45/1.13 ------ Trying domains of size >= : 2 0.45/1.13 ------ 0.45/1.13 Current options: 0.45/1.13 ------ 0.45/1.13 0.45/1.13 ------ Input Options 0.45/1.13 0.45/1.13 --out_options all 0.45/1.13 --tptp_safe_out true 0.45/1.13 --problem_path "" 0.45/1.13 --include_path "" 0.45/1.13 --clausifier res/vclausify_rel 0.45/1.13 --clausifier_options --mode clausify -t 185.00 0.45/1.13 --stdin false 0.45/1.13 --proof_out true 0.45/1.13 --proof_dot_file "" 0.45/1.13 --proof_reduce_dot [] 0.45/1.13 --suppress_sat_res false 0.45/1.13 --suppress_unsat_res true 0.45/1.13 --stats_out all 0.45/1.13 --stats_mem false 0.45/1.13 --theory_stats_out false 0.45/1.13 0.45/1.13 ------ General Options 0.45/1.13 0.45/1.13 --fof false 0.45/1.13 --time_out_real 185. 0.45/1.13 --time_out_virtual -1. 0.45/1.13 --rnd_seed 13 0.45/1.13 --symbol_type_check false 0.45/1.13 --clausify_out false 0.45/1.13 --sig_cnt_out false 0.45/1.13 --trig_cnt_out false 0.45/1.13 --trig_cnt_out_tolerance 1. 0.45/1.13 --trig_cnt_out_sk_spl false 0.45/1.13 --abstr_cl_out false 0.45/1.13 0.45/1.13 ------ Interactive Mode 0.45/1.13 0.45/1.13 --interactive_mode false 0.45/1.13 --external_ip_address "" 0.45/1.13 --external_port 0 0.45/1.13 0.45/1.13 ------ Global Options 0.45/1.13 0.45/1.13 --schedule none 0.45/1.13 --add_important_lit false 0.45/1.13 --prop_solver_per_cl 500 0.45/1.13 --subs_bck_mult 8 0.45/1.13 --min_unsat_core false 0.45/1.13 --soft_assumptions false 0.45/1.13 --soft_lemma_size 3 0.45/1.13 --prop_impl_unit_size 0 0.45/1.13 --prop_impl_unit [] 0.45/1.13 --share_sel_clauses true 0.45/1.13 --reset_solvers false 0.45/1.13 --bc_imp_inh [conj_cone] 0.45/1.13 --conj_cone_tolerance 3. 0.45/1.13 --extra_neg_conj all_pos_neg 0.45/1.13 --large_theory_mode true 0.45/1.13 --prolific_symb_bound 500 0.45/1.13 --lt_threshold 2000 0.45/1.13 --clause_weak_htbl true 0.45/1.13 --gc_record_bc_elim false 0.45/1.13 0.45/1.13 ------ Preprocessing Options 0.45/1.13 0.45/1.13 --preprocessing_flag true 0.45/1.13 --time_out_prep_mult 0.2 0.45/1.13 --splitting_mode input 0.45/1.13 --splitting_grd false 0.45/1.13 --splitting_cvd true 0.45/1.13 --splitting_cvd_svl true 0.45/1.13 --splitting_nvd 256 0.45/1.13 --sub_typing false 0.45/1.13 --prep_gs_sim false 0.45/1.13 --prep_unflatten true 0.45/1.13 --prep_res_sim true 0.45/1.13 --prep_sup_sim_all true 0.45/1.13 --prep_sup_sim_sup false 0.45/1.13 --prep_upred true 0.45/1.13 --prep_well_definedness true 0.45/1.13 --prep_sem_filter none 0.45/1.13 --prep_sem_filter_out false 0.45/1.13 --pred_elim true 0.45/1.13 --res_sim_input false 0.45/1.13 --eq_ax_congr_red true 0.45/1.13 --pure_diseq_elim false 0.45/1.13 --brand_transform false 0.45/1.13 --non_eq_to_eq false 0.45/1.13 --prep_def_merge false 0.45/1.13 --prep_def_merge_prop_impl false 0.45/1.13 --prep_def_merge_mbd true 0.45/1.13 --prep_def_merge_tr_red false 0.45/1.13 --prep_def_merge_tr_cl false 0.45/1.13 --smt_preprocessing false 0.45/1.13 --smt_ac_axioms fast 0.45/1.13 --preprocessed_out false 0.45/1.13 --preprocessed_stats false 0.45/1.13 0.45/1.13 ------ Abstraction refinement Options 0.45/1.13 0.45/1.13 --abstr_ref [] 0.45/1.13 --abstr_ref_prep false 0.45/1.13 --abstr_ref_until_sat false 0.45/1.13 --abstr_ref_sig_restrict funpre 0.45/1.13 --abstr_ref_af_restrict_to_split_sk false 0.45/1.13 --abstr_ref_under [] 0.45/1.13 0.45/1.13 ------ SAT Options 0.45/1.13 0.45/1.13 --sat_mode true 0.45/1.13 --sat_fm_restart_options "" 0.45/1.13 --sat_gr_def false 0.45/1.13 --sat_epr_types false 0.45/1.13 --sat_non_cyclic_types true 0.45/1.13 --sat_finite_models true 0.45/1.13 --sat_fm_lemmas false 0.45/1.13 --sat_fm_prep false 0.45/1.13 --sat_fm_uc_incr true 0.45/1.13 --sat_out_model small 0.45/1.13 --sat_out_clauses false 0.45/1.13 0.45/1.13 ------ QBF Options 0.45/1.13 0.45/1.13 --qbf_mode false 0.45/1.13 --qbf_elim_univ false 0.45/1.13 --qbf_dom_inst none 0.45/1.13 --qbf_dom_pre_inst false 0.45/1.13 --qbf_sk_in false 0.45/1.13 --qbf_pred_elim true 0.45/1.13 --qbf_split 512 0.45/1.13 0.45/1.13 ------ BMC1 Options 0.45/1.13 0.45/1.13 --bmc1_incremental false 0.45/1.13 --bmc1_axioms reachable_all 0.45/1.13 --bmc1_min_bound 0 0.45/1.13 --bmc1_max_bound -1 0.45/1.13 --bmc1_max_bound_default -1 0.45/1.13 --bmc1_symbol_reachability false 0.45/1.13 --bmc1_property_lemmas false 0.45/1.13 --bmc1_k_induction false 0.45/1.13 --bmc1_non_equiv_states false 0.45/1.13 --bmc1_deadlock false 0.45/1.13 --bmc1_ucm false 0.45/1.13 --bmc1_add_unsat_core none 0.45/1.13 --bmc1_unsat_core_children false 0.45/1.13 --bmc1_unsat_core_extrapolate_axioms false 0.45/1.13 --bmc1_out_stat full 0.45/1.13 --bmc1_ground_init false 0.45/1.13 --bmc1_pre_inst_next_state false 0.45/1.13 --bmc1_pre_inst_state false 0.45/1.13 --bmc1_pre_inst_reach_state false 0.45/1.13 --bmc1_out_unsat_core false 0.45/1.13 --bmc1_aig_witness_out false 0.45/1.13 --bmc1_verbose false 0.45/1.13 --bmc1_dump_clauses_tptp false 0.45/1.13 --bmc1_dump_unsat_core_tptp false 0.45/1.13 --bmc1_dump_file - 0.45/1.13 --bmc1_ucm_expand_uc_limit 128 0.45/1.13 --bmc1_ucm_n_expand_iterations 6 0.45/1.13 --bmc1_ucm_extend_mode 1 0.45/1.13 --bmc1_ucm_init_mode 2 0.45/1.13 --bmc1_ucm_cone_mode none 0.45/1.13 --bmc1_ucm_reduced_relation_type 0 0.45/1.13 --bmc1_ucm_relax_model 4 0.45/1.13 --bmc1_ucm_full_tr_after_sat true 0.45/1.13 --bmc1_ucm_expand_neg_assumptions false 0.45/1.13 --bmc1_ucm_layered_model none 0.45/1.13 --bmc1_ucm_max_lemma_size 10 0.45/1.13 0.45/1.13 ------ AIG Options 0.45/1.13 0.45/1.13 --aig_mode false 0.45/1.13 0.45/1.13 ------ Instantiation Options 0.45/1.13 0.45/1.13 --instantiation_flag true 0.45/1.13 --inst_sos_flag false 0.45/1.13 --inst_sos_phase true 0.45/1.13 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 0.45/1.13 --inst_lit_sel [-sign;+num_symb;+non_prol_conj_symb] 0.45/1.13 --inst_lit_sel_side num_lit 0.45/1.13 --inst_solver_per_active 1400 0.45/1.13 --inst_solver_calls_frac 0.01 0.45/1.13 --inst_to_smt_solver true 0.45/1.13 --inst_passive_queue_type priority_queues 0.45/1.13 --inst_passive_queues [[+conj_dist;+num_lits;-age];[-conj_symb;-min_def_symb;+bc_imp_inh]] 0.45/1.13 --inst_passive_queues_freq [512;64] 0.45/1.13 --inst_dismatching true 0.45/1.13 --inst_eager_unprocessed_to_passive false 0.45/1.13 --inst_unprocessed_bound 1000 0.45/1.13 --inst_prop_sim_given true 0.45/1.13 --inst_prop_sim_new true 0.45/1.13 --inst_subs_new false 0.45/1.13 --inst_eq_res_simp false 0.45/1.13 --inst_subs_given true 0.45/1.13 --inst_orphan_elimination false 0.45/1.13 --inst_learning_loop_flag true 0.45/1.13 --inst_learning_start 5 0.45/1.13 --inst_learning_factor 8 0.45/1.13 --inst_start_prop_sim_after_learn 0 0.45/1.13 --inst_sel_renew solver 0.45/1.13 --inst_lit_activity_flag true 0.45/1.13 --inst_restr_to_given false 0.45/1.13 --inst_activity_threshold 10000 0.45/1.13 0.45/1.13 ------ Resolution Options 0.45/1.13 0.45/1.13 --resolution_flag false 0.45/1.13 --res_lit_sel neg_max 0.45/1.13 --res_lit_sel_side num_lit 0.45/1.13 --res_ordering kbo 0.45/1.13 --res_to_prop_solver passive 0.45/1.13 --res_prop_simpl_new true 0.45/1.13 --res_prop_simpl_given true 0.45/1.13 --res_to_smt_solver true 0.45/1.13 --res_passive_queue_type priority_queues 0.45/1.13 --res_passive_queues [[-has_eq;-conj_non_prolific_symb;+ground];[-bc_imp_inh;-conj_symb]] 0.45/1.13 --res_passive_queues_freq [1024;32] 0.45/1.13 --res_forward_subs subset_subsumption 0.45/1.13 --res_backward_subs subset_subsumption 0.45/1.13 --res_forward_subs_resolution true 0.45/1.13 --res_backward_subs_resolution false 0.45/1.13 --res_orphan_elimination false 0.45/1.13 --res_time_limit 10. 0.45/1.13 0.45/1.13 ------ Superposition Options 0.45/1.13 0.45/1.13 --superposition_flag false 0.45/1.13 --sup_passive_queue_type priority_queues 0.45/1.13 --sup_passive_queues [[-conj_dist;-num_symb];[+score;+min_def_symb;-max_atom_input_occur;+conj_non_prolific_symb];[+age;-num_symb];[+score;-num_symb]] 0.45/1.13 --sup_passive_queues_freq [8;1;4;4] 0.45/1.13 --demod_completeness_check fast 0.45/1.13 --demod_use_ground true 0.45/1.13 --sup_unprocessed_bound 0 0.45/1.13 --sup_to_prop_solver passive 0.45/1.13 --sup_prop_simpl_new true 0.45/1.13 --sup_prop_simpl_given true 0.45/1.13 --sup_fun_splitting false 0.45/1.13 --sup_iter_deepening 2 0.45/1.13 --sup_restarts_mult 12 0.45/1.13 --sup_score sim_d_gen 0.45/1.13 --sup_share_score_frac 0.2 0.45/1.13 --sup_share_max_num_cl 500 0.45/1.13 --sup_ordering kbo 0.45/1.13 --sup_symb_ordering invfreq 0.45/1.13 --sup_term_weight default 0.45/1.13 0.45/1.13 ------ Superposition Simplification Setup 0.45/1.13 0.45/1.13 --sup_indices_passive [LightNormIndex;FwDemodIndex] 0.45/1.13 --sup_full_triv [SMTSimplify;PropSubs] 0.45/1.13 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability] 0.45/1.13 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 0.45/1.13 --sup_immed_triv [] 0.45/1.13 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes] 0.45/1.13 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes] 0.45/1.13 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod] 0.45/1.13 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 0.45/1.13 --sup_input_triv [Unflattening;SMTSimplify] 0.45/1.13 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability] 0.45/1.13 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 0.45/1.13 --sup_full_fixpoint true 0.45/1.13 --sup_main_fixpoint true 0.45/1.13 --sup_immed_fixpoint false 0.45/1.13 --sup_input_fixpoint true 0.45/1.13 --sup_cache_sim none 0.45/1.13 --sup_smt_interval 500 0.45/1.13 --sup_bw_gjoin_interval 0 0.45/1.13 0.45/1.13 ------ Combination Options 0.45/1.13 0.45/1.13 --comb_mode clause_based 0.45/1.13 --comb_inst_mult 1000 0.45/1.13 --comb_res_mult 10 0.45/1.13 --comb_sup_mult 8 0.45/1.13 --comb_sup_deep_mult 2 0.45/1.13 0.45/1.13 ------ Debug Options 0.45/1.13 0.45/1.13 --dbg_backtrace false 0.45/1.13 --dbg_dump_prop_clauses false 0.45/1.13 --dbg_dump_prop_clauses_file - 0.45/1.13 --dbg_out_stat false 0.45/1.13 --dbg_just_parse false 0.45/1.13 0.45/1.13 0.45/1.13 0.45/1.13 0.45/1.13 ------ Proving... 0.45/1.13 0.45/1.13 0.45/1.13 % SZS status Satisfiable for theBenchmark.p 0.45/1.13 0.45/1.13 ------ Building Model...Done 0.45/1.13 0.45/1.13 %------ The model is defined over ground terms (initial term algebra). 0.45/1.13 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) 0.45/1.13 %------ where \phi is a formula over the term algebra. 0.45/1.13 %------ If we have equality in the problem then it is also defined as a predicate above, 0.45/1.13 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type 0.45/1.13 %------ See help for --sat_out_model for different model outputs. 0.45/1.13 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" 0.45/1.13 %------ where the first argument stands for the sort ($i in the unsorted case) 0.45/1.13 % SZS output start Model for theBenchmark.p 0.45/1.13 0.45/1.13 %------ Negative definition of status 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( ~(status(X0,X1,X2)) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X2=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of model 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( model(X0,X1) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP1_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP1_iProver_split(X0) <=> 0.45/1.13 $true 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP2_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP2_iProver_split(X0) <=> 0.45/1.13 $true 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP3_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP3_iProver_split(X0) <=> 0.45/1.13 $true 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP4_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP4_iProver_split(X0) <=> 0.45/1.13 $true 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP5_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP5_iProver_split(X0) <=> 0.45/1.13 $true 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP6_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP6_iProver_split(X0) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP7_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP7_iProver_split(X0) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP8_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP8_iProver_split(X0) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP9_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP9_iProver_split(X0) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP10_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP10_iProver_split(X0) <=> 0.45/1.13 $true 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP11_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP11_iProver_split(X0) <=> 0.45/1.13 $true 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP12_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP12_iProver_split(X0) <=> 0.45/1.13 $true 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP13_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP13_iProver_split(X0) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of sP14_iProver_split 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( sP14_iProver_split(X0) <=> 0.45/1.13 $true 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sap 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_sap(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_2 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK0 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK0(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK1 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK1(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_tac 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_tac(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK2 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK2(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK3 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK3(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK4 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK4(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_esa 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_esa(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_2 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK5 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK5(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK6 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK6(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK7 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK7(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_tca 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_tca(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK8 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK8(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK9 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK9(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_uns 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_uns(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK10 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK10(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_not 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_not(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK11 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK11(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK12 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( iProver_Flat_sK12(X0,X1,X2) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_wth 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_wth(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK13 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK13(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK14 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK14(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK15 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( iProver_Flat_sK15(X0,X1,X2) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sca 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_sca(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK16 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK16(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK17 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK17(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_cax 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_cax(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_2 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK18 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK18(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_eth 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_eth(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK19 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( iProver_Flat_sK19(X0,X1,X2) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK20 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK20(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK21 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK21(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_wca 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_wca(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK22 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK22(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK23 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK23(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK24 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK24(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_tau 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_tau(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK25 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( iProver_Flat_sK25(X0,X1,X2) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK26 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK26(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_wec 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_wec(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK27 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( iProver_Flat_sK27(X0,X1,X2) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK28 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( iProver_Flat_sK28(X0,X1,X2) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_csa 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_csa(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK29 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( iProver_Flat_sK29(X0,X1,X2) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sat 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_sat(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK30 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( iProver_Flat_sK30(X0,X1,X2) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_thm 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_thm(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_2 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK31 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( iProver_Flat_sK31(X0,X1,X2) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_wtc 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_wtc(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK32 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK32(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK33 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK33(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK34 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK34(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK35 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK35(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_eqv 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_eqv(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK36 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( iProver_Flat_sK36(X0,X1,X2) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_unp 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_unp(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_2 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK37 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( iProver_Flat_sK37(X0,X1) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Negative definition of iProver_Flat_sK38 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1] : 0.45/1.13 ( ~(iProver_Flat_sK38(X0,X1)) <=> 0.45/1.13 $false 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_noc 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0] : 0.45/1.13 ( iProver_Flat_noc(X0) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK39 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( iProver_Flat_sK39(X0,X1,X2) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 0.45/1.13 %------ Positive definition of iProver_Flat_sK40 0.45/1.13 fof(lit_def,axiom, 0.45/1.13 (! [X0,X1,X2] : 0.45/1.13 ( iProver_Flat_sK40(X0,X1,X2) <=> 0.45/1.13 ( 0.45/1.13 ( 0.45/1.13 ( X0=iProver_Domain_i_1 ) 0.45/1.13 ) 0.45/1.13 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ) 0.45/1.13 ). 0.45/1.13 % SZS output end Model for theBenchmark.p 0.45/1.13 ------ Statistics 0.45/1.13 0.45/1.13 ------ Problem properties 0.45/1.13 0.45/1.13 clauses: 88 0.45/1.13 conjectures: 19 0.45/1.13 epr: 36 0.45/1.13 horn: 55 0.45/1.13 ground: 0 0.45/1.13 unary: 0 0.45/1.13 binary: 55 0.45/1.13 lits: 224 0.45/1.13 lits_eq: 0 0.45/1.13 fd_pure: 0 0.45/1.13 fd_pseudo: 0 0.45/1.13 fd_cond: 0 0.45/1.13 fd_pseudo_cond: 0 0.45/1.13 ac_symbols: 0 0.45/1.13 0.45/1.13 ------ General 0.45/1.13 0.45/1.13 abstr_ref_over_cycles: 0 0.45/1.13 abstr_ref_under_cycles: 0 0.45/1.13 gc_basic_clause_elim: 0 0.45/1.13 num_of_symbols: 309 0.45/1.13 num_of_terms: 2022 0.45/1.13 0.45/1.13 parsing_time: 0.008 0.45/1.13 unif_index_cands_time: 0. 0.45/1.13 unif_index_add_time: 0. 0.45/1.13 orderings_time: 0. 0.45/1.13 out_proof_time: 0. 0.45/1.13 total_time: 0.102 0.45/1.13 0.45/1.13 ------ Preprocessing 0.45/1.13 0.45/1.13 num_of_splits: 38 0.45/1.13 num_of_split_atoms: 15 0.45/1.13 num_of_reused_defs: 23 0.45/1.13 num_eq_ax_congr_red: 0 0.45/1.13 num_of_sem_filtered_clauses: 0 0.45/1.13 num_of_subtypes: 0 0.45/1.13 monotx_restored_types: 0 0.45/1.13 sat_num_of_epr_types: 0 0.45/1.13 sat_num_of_non_cyclic_types: 0 0.45/1.13 sat_guarded_non_collapsed_types: 0 0.45/1.13 num_pure_diseq_elim: 0 0.45/1.13 simp_replaced_by: 0 0.45/1.13 res_preprocessed: 0 0.45/1.13 sup_preprocessed: 0 0.45/1.13 prep_upred: 0 0.45/1.13 prep_unflattend: 0 0.45/1.13 prep_well_definedness: 0 0.45/1.13 smt_new_axioms: 0 0.45/1.13 pred_elim_cands: 2 0.45/1.13 pred_elim: 0 0.45/1.13 pred_elim_cl: 0 0.45/1.13 pred_elim_cycles: 1 0.45/1.13 merged_defs: 0 0.45/1.13 merged_defs_ncl: 0 0.45/1.13 bin_hyper_res: 0 0.45/1.13 prep_cycles: 1 0.45/1.13 0.45/1.13 splitting_time: 0.002 0.45/1.13 sem_filter_time: 0. 0.45/1.13 monotx_time: 0. 0.45/1.13 subtype_inf_time: 0. 0.45/1.13 res_prep_time: 0.008 0.45/1.13 sup_prep_time: 0. 0.45/1.13 pred_elim_time: 0. 0.45/1.13 bin_hyper_res_time: 0. 0.45/1.13 prep_time_total: 0.011 0.45/1.13 0.45/1.13 ------ Propositional Solver 0.45/1.13 0.45/1.13 prop_solver_calls: 39 0.45/1.13 prop_fast_solver_calls: 394 0.45/1.13 smt_solver_calls: 0 0.45/1.13 smt_fast_solver_calls: 0 0.45/1.13 prop_num_of_clauses: 710 0.45/1.13 prop_preprocess_simplified: 4870 0.45/1.13 prop_fo_subsumed: 0 0.45/1.13 0.45/1.13 prop_solver_time: 0.002 0.45/1.13 prop_fast_solver_time: 0. 0.45/1.13 prop_unsat_core_time: 0. 0.45/1.13 smt_solver_time: 0. 0.45/1.13 smt_fast_solver_time: 0. 0.45/1.13 0.45/1.13 ------ QBF 0.45/1.13 0.45/1.13 qbf_q_res: 0 0.45/1.13 qbf_num_tautologies: 0 0.45/1.13 qbf_prep_cycles: 0 0.45/1.13 0.45/1.13 ------ BMC1 0.45/1.13 0.45/1.13 bmc1_current_bound: -1 0.45/1.13 bmc1_last_solved_bound: -1 0.45/1.13 bmc1_unsat_core_size: -1 0.45/1.13 bmc1_unsat_core_parents_size: -1 0.45/1.13 bmc1_merge_next_fun: 0 0.45/1.13 0.45/1.13 bmc1_unsat_core_clauses_time: 0. 0.45/1.13 0.45/1.13 ------ Instantiation 0.45/1.13 0.45/1.13 inst_num_of_clauses: 250 0.45/1.13 inst_num_in_passive: 0 0.45/1.13 inst_num_in_active: 293 0.45/1.13 inst_num_of_loops: 341 0.45/1.13 inst_num_in_unprocessed: 0 0.45/1.13 inst_num_of_learning_restarts: 2 0.45/1.13 inst_num_moves_active_passive: 40 0.45/1.13 inst_lit_activity: 0 0.45/1.13 inst_lit_activity_moves: 0 0.45/1.13 inst_num_tautologies: 0 0.45/1.13 inst_num_prop_implied: 0 0.45/1.13 inst_num_existing_simplified: 0 0.45/1.13 inst_num_eq_res_simplified: 0 0.45/1.13 inst_num_child_elim: 0 0.45/1.13 inst_num_of_dismatching_blockings: 0 0.45/1.13 inst_num_of_non_proper_insts: 166 0.45/1.13 inst_num_of_duplicates: 0 0.45/1.13 inst_inst_num_from_inst_to_res: 0 0.45/1.13 0.45/1.13 inst_time_sim_new: 0.018 0.45/1.13 inst_time_sim_given: 0.006 0.45/1.13 inst_time_dismatching_checking: 0. 0.45/1.13 inst_time_total: 0.035 0.45/1.13 0.45/1.13 ------ Resolution 0.45/1.13 0.45/1.13 res_num_of_clauses: 73 0.45/1.13 res_num_in_passive: 0 0.45/1.13 res_num_in_active: 0 0.45/1.13 res_num_of_loops: 74 0.45/1.13 res_forward_subset_subsumed: 0 0.45/1.13 res_backward_subset_subsumed: 0 0.45/1.13 res_forward_subsumed: 0 0.45/1.13 res_backward_subsumed: 0 0.45/1.13 res_forward_subsumption_resolution: 0 0.45/1.13 res_backward_subsumption_resolution: 0 0.45/1.13 res_clause_to_clause_subsumption: 128 0.45/1.13 res_subs_bck_cnt: 5 0.45/1.13 res_orphan_elimination: 0 0.45/1.13 res_tautology_del: 0 0.45/1.13 res_num_eq_res_simplified: 0 0.45/1.13 res_num_sel_changes: 0 0.45/1.13 res_moves_from_active_to_pass: 0 0.45/1.13 0.45/1.13 res_time_sim_new: 0.001 0.45/1.13 res_time_sim_fw_given: 0.002 0.45/1.13 res_time_sim_bw_given: 0.002 0.45/1.13 res_time_total: 0.002 0.45/1.13 0.45/1.13 ------ Superposition 0.45/1.13 0.45/1.13 sup_num_of_clauses: undef 0.45/1.13 sup_num_in_active: undef 0.45/1.13 sup_num_in_passive: undef 0.45/1.13 sup_num_of_loops: 0 0.45/1.13 sup_fw_superposition: 0 0.45/1.13 sup_bw_superposition: 0 0.45/1.13 sup_eq_factoring: 0 0.45/1.13 sup_eq_resolution: 0 0.45/1.13 sup_immediate_simplified: 0 0.45/1.13 sup_given_eliminated: 0 0.45/1.13 comparisons_done: 0 0.45/1.13 comparisons_avoided: 0 0.45/1.13 comparisons_inc_criteria: 0 0.45/1.13 sup_deep_cl_discarded: 0 0.45/1.13 sup_num_of_deepenings: 0 0.45/1.13 sup_num_of_restarts: 0 0.45/1.13 0.45/1.13 sup_time_generating: 0. 0.45/1.13 sup_time_sim_fw_full: 0. 0.45/1.13 sup_time_sim_bw_full: 0. 0.45/1.13 sup_time_sim_fw_immed: 0. 0.45/1.13 sup_time_sim_bw_immed: 0. 0.45/1.13 sup_time_prep_sim_fw_input: 0. 0.45/1.13 sup_time_prep_sim_bw_input: 0. 0.45/1.13 sup_time_total: 0. 0.45/1.13 0.45/1.13 ------ Simplifications 0.45/1.13 0.45/1.13 sim_repeated: 0 0.45/1.13 sim_fw_subset_subsumed: 0 0.45/1.13 sim_bw_subset_subsumed: 0 0.45/1.13 sim_fw_subsumed: 0 0.45/1.13 sim_bw_subsumed: 0 0.45/1.13 sim_fw_subsumption_res: 0 0.45/1.13 sim_bw_subsumption_res: 0 0.45/1.13 sim_fw_unit_subs: 0 0.45/1.13 sim_bw_unit_subs: 0 0.45/1.13 sim_tautology_del: 0 0.45/1.13 sim_eq_tautology_del: 0 0.45/1.13 sim_eq_res_simp: 0 0.45/1.13 sim_fw_demodulated: 0 0.45/1.13 sim_bw_demodulated: 0 0.45/1.13 sim_encompassment_demod: 0 0.45/1.13 sim_light_normalised: 0 0.45/1.13 sim_ac_normalised: 0 0.45/1.13 sim_joinable_taut: 0 0.45/1.13 sim_joinable_simp: 0 0.45/1.13 sim_fw_ac_demod: 0 0.45/1.13 sim_bw_ac_demod: 0 0.45/1.13 sim_smt_subsumption: 0 0.45/1.13 sim_smt_simplified: 0 0.45/1.13 sim_ground_joinable: 0 0.45/1.13 sim_bw_ground_joinable: 0 0.45/1.13 sim_connectedness: 0 0.45/1.13 0.45/1.13 sim_time_fw_subset_subs: 0. 0.45/1.13 sim_time_bw_subset_subs: 0. 0.45/1.13 sim_time_fw_subs: 0. 0.45/1.13 sim_time_bw_subs: 0. 0.45/1.13 sim_time_fw_subs_res: 0. 0.45/1.13 sim_time_bw_subs_res: 0. 0.45/1.13 sim_time_fw_unit_subs: 0. 0.45/1.13 sim_time_bw_unit_subs: 0. 0.45/1.13 sim_time_tautology_del: 0. 0.45/1.13 sim_time_eq_tautology_del: 0. 0.45/1.13 sim_time_eq_res_simp: 0. 0.45/1.13 sim_time_fw_demod: 0. 0.45/1.13 sim_time_bw_demod: 0. 0.45/1.13 sim_time_light_norm: 0. 0.45/1.13 sim_time_joinable: 0. 0.45/1.13 sim_time_ac_norm: 0. 0.45/1.13 sim_time_fw_ac_demod: 0. 0.45/1.13 sim_time_bw_ac_demod: 0. 0.45/1.13 sim_time_smt_subs: 0. 0.45/1.13 sim_time_fw_gjoin: 0. 0.45/1.13 sim_time_fw_connected: 0. 0.45/1.13 0.45/1.13 0.45/1.15 EOF