%------------------------------------------------------------------------------ % File : iProver-SAT---3.9.4 % Problem : LCL887+1 : TPTP v9.3.1. Released v5.5.0. % Transfm : none % Format : tptp:raw % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT % Computer : n012.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Fri Sep 25 02:10:39 PM UTC 2026 % Result : CounterSatisfiable 1.66s 1.10s % Output : Model 1.66s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.01 % Problem : LCL887+1 : TPTP v9.3.1. Released v5.5.0. % 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT % 0.04/0.30 % Computer : n012.cluster.edu % 0.04/0.30 % Model : x86_64 x86_64 % 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.04/0.30 % Memory : 8046.5625MB % 0.04/0.30 % OS : Linux 6.8.0-71-generic % 0.04/0.30 % CPULimit : 300 % 0.04/0.30 % WCLimit : 300 % 0.04/0.30 % DateTime : Thu Sep 24 00:38:21 UTC 2026 % 0.04/0.31 % CPUTime : % 0.04/0.31 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT % 0.04/0.33 Running model finding % 0.04/0.33 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fnt_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.04/0.34 % 0.04/0.34 % ======== iProver multi-core TPTP/SMT ========= % 0.04/0.34 % 0.04/0.35 % Detected problem language: tptp % 0.08/0.36 % Proving... % 1.66/1.10 % SZS status Started for theBenchmark.p % 1.66/1.10 % SZS status CounterSatisfiable for theBenchmark.p % 1.66/1.10 % 1.66/1.10 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------% % 1.66/1.10 % 1.66/1.10 ------ iProver source info % 1.66/1.10 % 1.66/1.10 git: date: 2026-07-19 20:42:38 +0200 % 1.66/1.10 git: sha1: 804e7d636a263075307957e923b7a22a4035de61 % 1.66/1.10 git: non_committed_changes: false % 1.66/1.10 % 1.66/1.10 ------ Parsing... % 1.66/1.10 ------ Clausification by vclausify_rel & Parsing by iProver... % 1.66/1.10 ------ Proving... % 1.66/1.10 ------ Problem Properties % 1.66/1.10 % 1.66/1.10 % 1.66/1.10 clauses 15 % 1.66/1.10 conjectures 1 % 1.66/1.10 EPR 4 % 1.66/1.10 Horn 15 % 1.66/1.10 unary 8 % 1.66/1.10 binary 5 % 1.66/1.10 lits 24 % 1.66/1.10 lits eq 7 % 1.66/1.10 fd_pure 0 % 1.66/1.10 fd_pseudo 0 % 1.66/1.10 fd_cond 0 % 1.66/1.10 fd_pseudo_cond 1 % 1.66/1.10 AC symbols 1 % 1.66/1.10 % 1.66/1.10 ------ Input Options Time Limit: Unbounded % 1.66/1.10 % 1.66/1.10 % 1.66/1.10 ------ Finite Models: % 1.66/1.10 % 1.66/1.10 ------ lit_activity_flag true % 1.66/1.10 % 1.66/1.10 % 1.66/1.10 ------ Trying domains of size >= : 1 % 1.66/1.10 % 1.66/1.10 ------ Trying domains of size >= : 2 % 1.66/1.10 ------ % 1.66/1.10 Current options: % 1.66/1.10 ------ % 1.66/1.10 % 1.66/1.10 ------ Input Options % 1.66/1.10 % 1.66/1.10 --out_options all % 1.66/1.10 --tptp_safe_out true % 1.66/1.10 --problem_path "" % 1.66/1.10 --include_path "" % 1.66/1.10 --clausifier res/vclausify_rel % 1.66/1.10 --clausifier_options --mode clausify -t 101.66 -updr off % 1.66/1.10 --stdin false % 1.66/1.10 --proof_out true % 1.66/1.10 --proof_dot_file "" % 1.66/1.10 --proof_reduce_dot [] % 1.66/1.10 --suppress_sat_res false % 1.66/1.10 --suppress_unsat_res true % 1.66/1.10 --stats_out none % 1.66/1.10 --stats_mem false % 1.66/1.10 --theory_stats_out false % 1.66/1.10 % 1.66/1.10 ------ General Options % 1.66/1.10 % 1.66/1.10 --fof false % 1.66/1.10 --time_out_real 304.99 % 1.66/1.10 --time_out_virtual -1. % 1.66/1.10 --rnd_seed 13 % 1.66/1.10 --symbol_type_check false % 1.66/1.10 --clausify_out false % 1.66/1.10 --sig_cnt_out false % 1.66/1.10 --trig_cnt_out false % 1.66/1.10 --trig_cnt_out_tolerance 1. % 1.66/1.10 --trig_cnt_out_sk_spl false % 1.66/1.10 --abstr_cl_out false % 1.66/1.10 % 1.66/1.10 ------ Interactive Mode % 1.66/1.10 % 1.66/1.10 --interactive_mode false % 1.66/1.10 --external_ip_address "" % 1.66/1.10 --external_port 0 % 1.66/1.10 % 1.66/1.10 ------ Global Options % 1.66/1.10 % 1.66/1.10 --schedule none % 1.66/1.10 --add_important_lit false % 1.66/1.10 --prop_solver_per_cl 500 % 1.66/1.10 --subs_bck_mult 8 % 1.66/1.10 --min_unsat_core false % 1.66/1.10 --soft_assumptions false % 1.66/1.10 --soft_lemma_size 3 % 1.66/1.10 --prop_impl_unit_size 0 % 1.66/1.10 --prop_impl_unit [] % 1.66/1.10 --share_sel_clauses true % 1.66/1.10 --reset_solvers false % 1.66/1.10 --bc_imp_inh [conj_cone] % 1.66/1.10 --conj_cone_tolerance 3. % 1.66/1.10 --extra_neg_conj none % 1.66/1.10 --large_theory_mode true % 1.66/1.10 --prolific_symb_bound 200 % 1.66/1.10 --lt_threshold 2000 % 1.66/1.10 --clause_weak_htbl true % 1.66/1.10 --gc_record_bc_elim false % 1.66/1.10 % 1.66/1.10 ------ Preprocessing Options % 1.66/1.10 % 1.66/1.10 --preprocessing_flag false % 1.66/1.10 --time_out_prep_mult 0.1 % 1.66/1.10 --splitting_mode input % 1.66/1.10 --splitting_grd true % 1.66/1.10 --splitting_cvd false % 1.66/1.10 --splitting_cvd_svl false % 1.66/1.10 --splitting_nvd 32 % 1.66/1.10 --sub_typing false % 1.66/1.10 --prep_eq_flat_conj false % 1.66/1.10 --prep_ineq_split false % 1.66/1.10 --prep_eq_flat_all_gr false % 1.66/1.10 --prep_gs_sim true % 1.66/1.10 --prep_unflatten true % 1.66/1.10 --prep_res_sim true % 1.66/1.10 --prep_sup_sim_all true % 1.66/1.10 --prep_sup_sim_sup false % 1.66/1.10 --prep_upred true % 1.66/1.10 --prep_well_definedness true % 1.66/1.10 --prep_sem_filter exhaustive % 1.66/1.10 --prep_sem_filter_out false % 1.66/1.10 --pred_elim true % 1.66/1.10 --res_sim_input true % 1.66/1.10 --eq_ax_congr_red true % 1.66/1.10 --pure_diseq_elim true % 1.66/1.10 --brand_transform false % 1.66/1.10 --non_eq_to_eq false % 1.66/1.10 --prep_eq_proxy false % 1.66/1.10 --prep_def_merge true % 1.66/1.10 --prep_def_merge_prop_impl false % 1.66/1.10 --prep_def_merge_mbd true % 1.66/1.10 --prep_def_merge_tr_red false % 1.66/1.10 --prep_def_merge_tr_cl false % 1.66/1.10 --smt_preprocessing false % 1.66/1.10 --smt_ac_axioms fast % 1.66/1.10 --preprocessed_out false % 1.66/1.10 --preprocessed_stats false % 1.66/1.10 % 1.66/1.10 ------ Abstraction refinement Options % 1.66/1.10 % 1.66/1.10 --abstr_ref [] % 1.66/1.10 --abstr_ref_prep false % 1.66/1.10 --abstr_ref_until_sat false % 1.66/1.10 --abstr_ref_sig_restrict funpre % 1.66/1.10 --abstr_ref_af_restrict_to_split_sk false % 1.66/1.10 --abstr_ref_under [] % 1.66/1.10 % 1.66/1.10 ------ SAT Options % 1.66/1.10 % 1.66/1.10 --sat_mode true % 1.66/1.10 --sat_fm_restart_options "" % 1.66/1.10 --sat_gr_def false % 1.66/1.10 --sat_epr_types true % 1.66/1.10 --sat_non_cyclic_types false % 1.66/1.10 --sat_finite_models true % 1.66/1.10 --sat_fm_lemmas false % 1.66/1.10 --sat_fm_prep false % 1.66/1.10 --sat_fm_uc_incr true % 1.66/1.10 --sat_out_model pos % 1.66/1.10 --sat_out_clauses false % 1.66/1.10 % 1.66/1.10 ------ QBF Options % 1.66/1.10 % 1.66/1.10 --qbf_mode false % 1.66/1.10 --qbf_elim_univ false % 1.66/1.10 --qbf_dom_inst none % 1.66/1.10 --qbf_dom_pre_inst false % 1.66/1.10 --qbf_sk_in false % 1.66/1.10 --qbf_pred_elim true % 1.66/1.10 --qbf_split 512 % 1.66/1.10 % 1.66/1.10 ------ BMC1 Options % 1.66/1.10 % 1.66/1.10 --bmc1_incremental false % 1.66/1.10 --bmc1_axioms reachable_all % 1.66/1.10 --bmc1_min_bound 0 % 1.66/1.10 --bmc1_max_bound -1 % 1.66/1.10 --bmc1_max_bound_default -1 % 1.66/1.10 --bmc1_symbol_reachability true % 1.66/1.10 --bmc1_property_lemmas false % 1.66/1.10 --bmc1_k_induction false % 1.66/1.10 --bmc1_non_equiv_states false % 1.66/1.10 --bmc1_deadlock false % 1.66/1.10 --bmc1_ucm false % 1.66/1.10 --bmc1_add_unsat_core none % 1.66/1.10 --bmc1_unsat_core_children false % 1.66/1.10 --bmc1_unsat_core_extrapolate_axioms false % 1.66/1.10 --bmc1_out_stat full % 1.66/1.10 --bmc1_ground_init false % 1.66/1.10 --bmc1_pre_inst_next_state false % 1.66/1.10 --bmc1_pre_inst_state false % 1.66/1.10 --bmc1_pre_inst_reach_state false % 1.66/1.10 --bmc1_out_unsat_core false % 1.66/1.10 --bmc1_aig_witness_out false % 1.66/1.10 --bmc1_verbose false % 1.66/1.10 --bmc1_dump_clauses_tptp false % 1.66/1.10 --bmc1_dump_unsat_core_tptp false % 1.66/1.10 --bmc1_dump_file - % 1.66/1.10 --bmc1_ucm_expand_uc_limit 128 % 1.66/1.10 --bmc1_ucm_n_expand_iterations 6 % 1.66/1.10 --bmc1_ucm_extend_mode 1 % 1.66/1.10 --bmc1_ucm_init_mode 2 % 1.66/1.10 --bmc1_ucm_cone_mode none % 1.66/1.10 --bmc1_ucm_reduced_relation_type 0 % 1.66/1.10 --bmc1_ucm_relax_model 4 % 1.66/1.10 --bmc1_ucm_full_tr_after_sat true % 1.66/1.10 --bmc1_ucm_expand_neg_assumptions false % 1.66/1.10 --bmc1_ucm_layered_model none % 1.66/1.10 --bmc1_ucm_max_lemma_size 10 % 1.66/1.10 % 1.66/1.10 ------ AIG Options % 1.66/1.10 % 1.66/1.10 --aig_mode false % 1.66/1.10 % 1.66/1.10 ------ Instantiation Options % 1.66/1.10 % 1.66/1.10 --instantiation_flag true % 1.66/1.10 --inst_sos_flag false % 1.66/1.10 --inst_sos_phase true % 1.66/1.10 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] % 1.66/1.10 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] % 1.66/1.10 --inst_lit_sel_side num_symb % 1.66/1.10 --inst_solver_per_active 1400 % 1.66/1.10 --inst_solver_calls_frac 1. % 1.66/1.10 --inst_to_smt_solver true % 1.66/1.10 --inst_passive_queue_type priority_queues % 1.66/1.10 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] % 1.66/1.10 --inst_passive_queues_freq [25;2] % 1.66/1.10 --inst_dismatching true % 1.66/1.10 --inst_eager_unprocessed_to_passive true % 1.66/1.10 --inst_unprocessed_bound 1000 % 1.66/1.10 --inst_prop_sim_given true % 1.66/1.10 --inst_prop_sim_new false % 1.66/1.10 --inst_subs_new false % 1.66/1.10 --inst_eq_res_simp false % 1.66/1.10 --inst_subs_given false % 1.66/1.10 --inst_orphan_elimination true % 1.66/1.10 --inst_learning_loop_flag true % 1.66/1.10 --inst_learning_start 3000 % 1.66/1.10 --inst_learning_factor 2 % 1.66/1.10 --inst_start_prop_sim_after_learn 3 % 1.66/1.10 --inst_sel_renew solver % 1.66/1.10 --inst_lit_activity_flag true % 1.66/1.10 --inst_restr_to_given false % 1.66/1.10 --inst_activity_threshold 500 % 1.66/1.10 % 1.66/1.10 ------ Resolution Options % 1.66/1.10 % 1.66/1.10 --resolution_flag false % 1.66/1.10 --res_lit_sel adaptive % 1.66/1.10 --res_lit_sel_side none % 1.66/1.10 --res_ordering kbo % 1.66/1.10 --res_to_prop_solver active % 1.66/1.10 --res_prop_simpl_new false % 1.66/1.10 --res_prop_simpl_given true % 1.66/1.10 --res_to_smt_solver true % 1.66/1.10 --res_passive_queue_type priority_queues % 1.66/1.10 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] % 1.66/1.10 --res_passive_queues_freq [15;5] % 1.66/1.10 --res_forward_subs full % 1.66/1.10 --res_backward_subs full % 1.66/1.10 --res_forward_subs_resolution true % 1.66/1.10 --res_backward_subs_resolution true % 1.66/1.10 --res_orphan_elimination true % 1.66/1.10 --res_time_limit 300. % 1.66/1.10 % 1.66/1.10 ------ Superposition Options % 1.66/1.10 % 1.66/1.10 --superposition_flag false % 1.66/1.10 --sup_passive_queue_type priority_queues % 1.66/1.10 --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]] % 1.66/1.10 --sup_passive_queues_freq [8;1;4;4] % 1.66/1.10 --twee_lhs_weight 4 % 1.66/1.10 --sup_set_join false % 1.66/1.10 --sup_set_join_goals true % 1.66/1.10 --sup_set_join_limit 1000 % 1.66/1.10 --demod_completeness_check fast % 1.66/1.10 --demod_use_ground true % 1.66/1.10 --sup_unprocessed_bound 0 % 1.66/1.10 --sup_to_prop_solver passive % 1.66/1.10 --sup_prop_simpl_new true % 1.66/1.10 --sup_prop_simpl_given true % 1.66/1.10 --sup_fun_splitting false % 1.66/1.10 --sup_iter_deepening 2 % 1.66/1.10 --sup_restarts_mult 12 % 1.66/1.10 --sup_score sim_d_gen % 1.66/1.10 --sup_share_score_frac 0.2 % 1.66/1.10 --sup_share_max_num_cl 500 % 1.66/1.10 --sup_ordering kbo % 1.66/1.10 --sup_symb_ordering invfreq % 1.66/1.10 --sup_term_weight default % 1.66/1.10 % 1.66/1.10 ------ Superposition Simplification Setup % 1.66/1.10 % 1.66/1.10 --sup_indices_passive [LightNormIndex;FwDemodIndex] % 1.66/1.10 --sup_full_triv [SMTSimplify;PropSubs] % 1.66/1.10 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability] % 1.66/1.10 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] % 1.66/1.10 --sup_immed_triv [] % 1.66/1.10 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes] % 1.66/1.10 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes] % 1.66/1.10 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod] % 1.66/1.10 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] % 1.66/1.10 --sup_input_triv [Unflattening;SMTSimplify] % 1.66/1.10 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability] % 1.66/1.10 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] % 1.66/1.10 --sup_full_fixpoint true % 1.66/1.10 --sup_main_fixpoint true % 1.66/1.10 --sup_immed_fixpoint false % 1.66/1.10 --sup_input_fixpoint true % 1.66/1.10 --sup_cache_sim none % 1.66/1.10 --sup_smt_interval 500 % 1.66/1.10 --sup_bw_gjoin_interval 0 % 1.66/1.10 % 1.66/1.10 ------ Combination Options % 1.66/1.10 % 1.66/1.10 --comb_mode clause_based % 1.66/1.10 --comb_inst_mult 5 % 1.66/1.10 --comb_res_mult 1 % 1.66/1.10 --comb_sup_mult 8 % 1.66/1.10 --comb_sup_deep_mult 2 % 1.66/1.10 % 1.66/1.10 ------ Debug Options % 1.66/1.10 % 1.66/1.10 --dbg_backtrace false % 1.66/1.10 --dbg_dump_prop_clauses false % 1.66/1.10 --dbg_dump_prop_clauses_file - % 1.66/1.10 --dbg_out_stat false % 1.66/1.10 --dbg_just_parse false % 1.66/1.10 % 1.66/1.10 % 1.66/1.10 % 1.66/1.10 % 1.66/1.10 ------ Proving... % 1.66/1.10 % 1.66/1.10 ------ Trying domains of size >= : 2 % 1.66/1.10 % 1.66/1.10 % 1.66/1.10 ------ Proving... % 1.66/1.10 % 1.66/1.10 ------ Trying domains of size >= : 2 % 1.66/1.10 % 1.66/1.10 ------ Trying domains of size >= : 2 % 1.66/1.10 % 1.66/1.10 % 1.66/1.10 ------ Proving... % 1.66/1.10 % 1.66/1.10 ------ Trying domains of size >= : 3 % 1.66/1.10 % 1.66/1.10 % 1.66/1.10 ------ Proving... % 1.66/1.10 % 1.66/1.10 ------ Trying domains of size >= : 3 % 1.66/1.10 % 1.66/1.10 % 1.66/1.10 ------ Proving... % 1.66/1.10 % 1.66/1.10 ------ Trying domains of size >= : 3 % 1.66/1.10 % 1.66/1.10 % 1.66/1.10 ------ Proving... % 1.66/1.10 % 1.66/1.10 % 1.66/1.10 % SZS status CounterSatisfiable for theBenchmark.p % 1.66/1.10 % 1.66/1.10 ------ Building Model...Done % 1.66/1.10 % 1.66/1.10 %------ The model is defined over ground terms (initial term algebra). % 1.66/1.10 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) % 1.66/1.10 %------ where \phi is a formula over the term algebra. % 1.66/1.10 %------ If we have equality in the problem then it is also defined as a predicate above, % 1.66/1.10 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type % 1.66/1.10 %------ See help for --sat_out_model for different model outputs. % 1.66/1.10 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" % 1.66/1.10 %------ where the first argument stands for the sort ($i in the unsorted case) % 1.66/1.10 % SZS output start Model for theBenchmark.p % 1.66/1.10 % 1.66/1.10 %------ Positive definition of equality_sorted % 1.66/1.10 fof(lit_def,axiom, % 1.66/1.10 (! [X0_tType,X0,X1] : % 1.66/1.10 ( equality_sorted(X0_tType,X0,X1) <=> % 1.66/1.10 ( % 1.66/1.10 ( % 1.66/1.10 ( X0_tType=$i ) % 1.66/1.10 & % 1.66/1.10 ( X0!=iProver_Domain_i_1 | X1!=iProver_Domain_i_2 ) % 1.66/1.10 & % 1.66/1.10 ( X0!=iProver_Domain_i_1 | X1!=iProver_Domain_i_3 ) % 1.66/1.10 & % 1.66/1.10 ( X0!=iProver_Domain_i_2 | X1!=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X0!=iProver_Domain_i_2 | X1!=iProver_Domain_i_3 ) % 1.66/1.10 & % 1.66/1.10 ( X0!=iProver_Domain_i_3 | X1!=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X0!=iProver_Domain_i_3 | X1!=iProver_Domain_i_2 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0_tType=$i & X0=iProver_Domain_i_1 & X1=iProver_Domain_i_1 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ). % 1.66/1.10 % 1.66/1.10 %------ Positive definition of '>=' % 1.66/1.10 fof(lit_def,axiom, % 1.66/1.10 (! [X0,X1] : % 1.66/1.10 ( '>='(X0,X1) <=> % 1.66/1.10 ( % 1.66/1.10 ( % 1.66/1.10 ( X0!=iProver_Domain_i_2 ) % 1.66/1.10 & % 1.66/1.10 ( X0!=iProver_Domain_i_2 | X1!=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X0!=iProver_Domain_i_2 | X1!=iProver_Domain_i_3 ) % 1.66/1.10 & % 1.66/1.10 ( X0!=iProver_Domain_i_3 | X1!=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X1!=iProver_Domain_i_1 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_1 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_2 & X1=iProver_Domain_i_2 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X1=X0 ) % 1.66/1.10 & % 1.66/1.10 ( X0!=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X0!=iProver_Domain_i_2 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ). % 1.66/1.10 % 1.66/1.10 %------ Positive definition of iProver_Flat_'+' % 1.66/1.10 fof(lit_def,axiom, % 1.66/1.10 (! [X0,X1,X2] : % 1.66/1.10 ( iProver_Flat_'+'(X0,X1,X2) <=> % 1.66/1.10 ( % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X2!=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X2!=iProver_Domain_i_2 ) % 1.66/1.10 & % 1.66/1.10 ( X2!=iProver_Domain_i_3 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_1 & X2=iProver_Domain_i_2 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_1 & X2=iProver_Domain_i_3 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_1 & X2=iProver_Domain_i_1 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_2 & X1=iProver_Domain_i_2 & X2=iProver_Domain_i_2 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_3 ) % 1.66/1.10 & % 1.66/1.10 ( X1!=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X1!=iProver_Domain_i_1 | X2!=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X1!=iProver_Domain_i_1 | X2!=iProver_Domain_i_2 ) % 1.66/1.10 & % 1.66/1.10 ( X1!=iProver_Domain_i_2 | X2!=iProver_Domain_i_2 ) % 1.66/1.10 & % 1.66/1.10 ( X2!=iProver_Domain_i_1 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ). % 1.66/1.10 % 1.66/1.10 %------ Positive definition of iProver_Flat_'0' % 1.66/1.10 fof(lit_def,axiom, % 1.66/1.10 (! [X0] : % 1.66/1.10 ( iProver_Flat_'0'(X0) <=> % 1.66/1.10 ( % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_2 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ). % 1.66/1.10 % 1.66/1.10 %------ Positive definition of iProver_Flat_'==>' % 1.66/1.10 fof(lit_def,axiom, % 1.66/1.10 (! [X0,X1,X2] : % 1.66/1.10 ( iProver_Flat_'==>'(X0,X1,X2) <=> % 1.66/1.10 ( % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_2 & X2=iProver_Domain_i_1 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_1 & X2=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X1!=iProver_Domain_i_1 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_2 ) % 1.66/1.10 & % 1.66/1.10 ( X1!=iProver_Domain_i_1 | X2!=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X1!=iProver_Domain_i_2 ) % 1.66/1.10 & % 1.66/1.10 ( X1!=iProver_Domain_i_2 | X2!=iProver_Domain_i_3 ) % 1.66/1.10 & % 1.66/1.10 ( X2!=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X2!=iProver_Domain_i_3 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_2 & X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_2 & X1=iProver_Domain_i_2 & X2=iProver_Domain_i_2 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_2 & X2=iProver_Domain_i_3 ) % 1.66/1.10 & % 1.66/1.10 ( X1!=iProver_Domain_i_2 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_3 & X1=iProver_Domain_i_2 ) % 1.66/1.10 & % 1.66/1.10 ( X2!=iProver_Domain_i_1 ) % 1.66/1.10 & % 1.66/1.10 ( X2!=iProver_Domain_i_2 ) % 1.66/1.10 & % 1.66/1.10 ( X2!=iProver_Domain_i_3 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 | % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_3 & X1=iProver_Domain_i_2 & X2=iProver_Domain_i_3 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ). % 1.66/1.10 % 1.66/1.10 %------ Positive definition of iProver_Flat_'1' % 1.66/1.10 fof(lit_def,axiom, % 1.66/1.10 (! [X0] : % 1.66/1.10 ( iProver_Flat_'1'(X0) <=> % 1.66/1.10 ( % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_1 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ). % 1.66/1.10 % 1.66/1.10 %------ Positive definition of iProver_Flat_sK0 % 1.66/1.10 fof(lit_def,axiom, % 1.66/1.10 (! [X0] : % 1.66/1.10 ( iProver_Flat_sK0(X0) <=> % 1.66/1.10 ( % 1.66/1.10 ( % 1.66/1.10 ( X0=iProver_Domain_i_3 ) % 1.66/1.10 ) % 1.66/1.10 % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ) % 1.66/1.10 ). % 1.66/1.10 % SZS output end Model for theBenchmark.p % 1.66/1.10 %------------------------------------------------------------------------------