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