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