TSTP Solution File: PHI027+1 by iProver-SAT---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.9
% Problem : PHI027+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:53:44 EDT 2024
% Result : CounterSatisfiable 0.87s 1.18s
% Output : Model 0.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PHI027+1 : TPTP v8.1.2. Released v7.4.0.
% 0.07/0.14 % Command : run_iprover %s %d SAT
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 21:36:49 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.87/1.18 % SZS status Started for theBenchmark.p
% 0.87/1.18 % SZS status CounterSatisfiable for theBenchmark.p
% 0.87/1.18
% 0.87/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.87/1.18
% 0.87/1.18 ------ iProver source info
% 0.87/1.18
% 0.87/1.18 git: date: 2024-05-02 19:28:25 +0000
% 0.87/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.87/1.18 git: non_committed_changes: false
% 0.87/1.18
% 0.87/1.18 ------ Parsing...
% 0.87/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.87/1.18 ------ Proving...
% 0.87/1.18 ------ Problem Properties
% 0.87/1.18
% 0.87/1.18
% 0.87/1.18 clauses 58
% 0.87/1.18 conjectures 7
% 0.87/1.18 EPR 58
% 0.87/1.18 Horn 48
% 0.87/1.18 unary 1
% 0.87/1.18 binary 33
% 0.87/1.18 lits 146
% 0.87/1.18 lits eq 2
% 0.87/1.18 fd_pure 0
% 0.87/1.18 fd_pseudo 0
% 0.87/1.18 fd_cond 0
% 0.87/1.18 fd_pseudo_cond 1
% 0.87/1.18 AC symbols 0
% 0.87/1.18
% 0.87/1.18 ------ Input Options Time Limit: Unbounded
% 0.87/1.18
% 0.87/1.18
% 0.87/1.18 ------ Finite Models:
% 0.87/1.18
% 0.87/1.18 ------ lit_activity_flag true
% 0.87/1.18
% 0.87/1.18 ------
% 0.87/1.18 Current options:
% 0.87/1.18 ------
% 0.87/1.18
% 0.87/1.18 ------ Input Options
% 0.87/1.18
% 0.87/1.18 --out_options all
% 0.87/1.18 --tptp_safe_out true
% 0.87/1.18 --problem_path ""
% 0.87/1.18 --include_path ""
% 0.87/1.18 --clausifier res/vclausify_rel
% 0.87/1.18 --clausifier_options --mode clausify -t 300.00 -updr off
% 0.87/1.18 --stdin false
% 0.87/1.18 --proof_out true
% 0.87/1.18 --proof_dot_file ""
% 0.87/1.18 --proof_reduce_dot []
% 0.87/1.18 --suppress_sat_res false
% 0.87/1.18 --suppress_unsat_res true
% 0.87/1.18 --stats_out none
% 0.87/1.18 --stats_mem false
% 0.87/1.18 --theory_stats_out false
% 0.87/1.18
% 0.87/1.18 ------ General Options
% 0.87/1.18
% 0.87/1.18 --fof false
% 0.87/1.18 --time_out_real 300.
% 0.87/1.18 --time_out_virtual -1.
% 0.87/1.18 --rnd_seed 13
% 0.87/1.18 --symbol_type_check false
% 0.87/1.18 --clausify_out false
% 0.87/1.18 --sig_cnt_out false
% 0.87/1.18 --trig_cnt_out false
% 0.87/1.18 --trig_cnt_out_tolerance 1.
% 0.87/1.18 --trig_cnt_out_sk_spl false
% 0.87/1.18 --abstr_cl_out false
% 0.87/1.18
% 0.87/1.18 ------ Interactive Mode
% 0.87/1.18
% 0.87/1.18 --interactive_mode false
% 0.87/1.18 --external_ip_address ""
% 0.87/1.18 --external_port 0
% 0.87/1.18
% 0.87/1.18 ------ Global Options
% 0.87/1.18
% 0.87/1.18 --schedule none
% 0.87/1.18 --add_important_lit false
% 0.87/1.18 --prop_solver_per_cl 500
% 0.87/1.18 --subs_bck_mult 8
% 0.87/1.18 --min_unsat_core false
% 0.87/1.18 --soft_assumptions false
% 0.87/1.18 --soft_lemma_size 3
% 0.87/1.18 --prop_impl_unit_size 0
% 0.87/1.18 --prop_impl_unit []
% 0.87/1.18 --share_sel_clauses true
% 0.87/1.18 --reset_solvers false
% 0.87/1.18 --bc_imp_inh [conj_cone]
% 0.87/1.18 --conj_cone_tolerance 3.
% 0.87/1.18 --extra_neg_conj all_pos_neg
% 0.87/1.18 --large_theory_mode true
% 0.87/1.18 --prolific_symb_bound 500
% 0.87/1.18 --lt_threshold 2000
% 0.87/1.18 --clause_weak_htbl true
% 0.87/1.18 --gc_record_bc_elim false
% 0.87/1.18
% 0.87/1.18 ------ Preprocessing Options
% 0.87/1.18
% 0.87/1.18 --preprocessing_flag false
% 0.87/1.18 --time_out_prep_mult 0.2
% 0.87/1.18 --splitting_mode input
% 0.87/1.18 --splitting_grd false
% 0.87/1.18 --splitting_cvd true
% 0.87/1.18 --splitting_cvd_svl true
% 0.87/1.18 --splitting_nvd 256
% 0.87/1.18 --sub_typing false
% 0.87/1.18 --prep_eq_flat_conj false
% 0.87/1.18 --prep_eq_flat_all_gr false
% 0.87/1.18 --prep_gs_sim false
% 0.87/1.18 --prep_unflatten true
% 0.87/1.18 --prep_res_sim true
% 0.87/1.18 --prep_sup_sim_all true
% 0.87/1.18 --prep_sup_sim_sup false
% 0.87/1.18 --prep_upred true
% 0.87/1.18 --prep_well_definedness true
% 0.87/1.18 --prep_sem_filter none
% 0.87/1.18 --prep_sem_filter_out false
% 0.87/1.18 --pred_elim true
% 0.87/1.18 --res_sim_input false
% 0.87/1.18 --eq_ax_congr_red true
% 0.87/1.18 --pure_diseq_elim false
% 0.87/1.18 --brand_transform false
% 0.87/1.18 --non_eq_to_eq false
% 0.87/1.18 --prep_def_merge false
% 0.87/1.18 --prep_def_merge_prop_impl false
% 0.87/1.18 --prep_def_merge_mbd true
% 0.87/1.18 --prep_def_merge_tr_red false
% 0.87/1.18 --prep_def_merge_tr_cl false
% 0.87/1.18 --smt_preprocessing false
% 0.87/1.18 --smt_ac_axioms fast
% 0.87/1.18 --preprocessed_out false
% 0.87/1.18 --preprocessed_stats false
% 0.87/1.18
% 0.87/1.18 ------ Abstraction refinement Options
% 0.87/1.18
% 0.87/1.18 --abstr_ref []
% 0.87/1.18 --abstr_ref_prep false
% 0.87/1.18 --abstr_ref_until_sat false
% 0.87/1.18 --abstr_ref_sig_restrict funpre
% 0.87/1.18 --abstr_ref_af_restrict_to_split_sk false
% 0.87/1.18 --abstr_ref_under []
% 0.87/1.18
% 0.87/1.18 ------ SAT Options
% 0.87/1.18
% 0.87/1.18 --sat_mode true
% 0.87/1.18 --sat_fm_restart_options ""
% 0.87/1.18 --sat_gr_def false
% 0.87/1.18 --sat_epr_types false
% 0.87/1.18 --sat_non_cyclic_types true
% 0.87/1.18 --sat_finite_models true
% 0.87/1.18 --sat_fm_lemmas false
% 0.87/1.18 --sat_fm_prep false
% 0.87/1.18 --sat_fm_uc_incr true
% 0.87/1.18 --sat_out_model pos
% 0.87/1.18 --sat_out_clauses false
% 0.87/1.18
% 0.87/1.18 ------ QBF Options
% 0.87/1.18
% 0.87/1.18 --qbf_mode false
% 0.87/1.18 --qbf_elim_univ false
% 0.87/1.18 --qbf_dom_inst none
% 0.87/1.18 --qbf_dom_pre_inst false
% 0.87/1.18 --qbf_sk_in false
% 0.87/1.18 --qbf_pred_elim true
% 0.87/1.18 --qbf_split 512
% 0.87/1.18
% 0.87/1.18 ------ BMC1 Options
% 0.87/1.18
% 0.87/1.18 --bmc1_incremental false
% 0.87/1.18 --bmc1_axioms reachable_all
% 0.87/1.18 --bmc1_min_bound 0
% 0.87/1.18 --bmc1_max_bound -1
% 0.87/1.18 --bmc1_max_bound_default -1
% 0.87/1.18 --bmc1_symbol_reachability false
% 0.87/1.18 --bmc1_property_lemmas false
% 0.87/1.18 --bmc1_k_induction false
% 0.87/1.18 --bmc1_non_equiv_states false
% 0.87/1.18 --bmc1_deadlock false
% 0.87/1.18 --bmc1_ucm false
% 0.87/1.18 --bmc1_add_unsat_core none
% 0.87/1.18 --bmc1_unsat_core_children false
% 0.87/1.18 --bmc1_unsat_core_extrapolate_axioms false
% 0.87/1.18 --bmc1_out_stat full
% 0.87/1.18 --bmc1_ground_init false
% 0.87/1.18 --bmc1_pre_inst_next_state false
% 0.87/1.18 --bmc1_pre_inst_state false
% 0.87/1.18 --bmc1_pre_inst_reach_state false
% 0.87/1.18 --bmc1_out_unsat_core false
% 0.87/1.18 --bmc1_aig_witness_out false
% 0.87/1.18 --bmc1_verbose false
% 0.87/1.18 --bmc1_dump_clauses_tptp false
% 0.87/1.18 --bmc1_dump_unsat_core_tptp false
% 0.87/1.18 --bmc1_dump_file -
% 0.87/1.18 --bmc1_ucm_expand_uc_limit 128
% 0.87/1.18 --bmc1_ucm_n_expand_iterations 6
% 0.87/1.18 --bmc1_ucm_extend_mode 1
% 0.87/1.18 --bmc1_ucm_init_mode 2
% 0.87/1.18 --bmc1_ucm_cone_mode none
% 0.87/1.18 --bmc1_ucm_reduced_relation_type 0
% 0.87/1.18 --bmc1_ucm_relax_model 4
% 0.87/1.18 --bmc1_ucm_full_tr_after_sat true
% 0.87/1.18 --bmc1_ucm_expand_neg_assumptions false
% 0.87/1.18 --bmc1_ucm_layered_model none
% 0.87/1.18 --bmc1_ucm_max_lemma_size 10
% 0.87/1.18
% 0.87/1.18 ------ AIG Options
% 0.87/1.18
% 0.87/1.18 --aig_mode false
% 0.87/1.18
% 0.87/1.18 ------ Instantiation Options
% 0.87/1.18
% 0.87/1.18 --instantiation_flag true
% 0.87/1.18 --inst_sos_flag false
% 0.87/1.18 --inst_sos_phase true
% 0.87/1.18 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb]
% 0.87/1.18 --inst_lit_sel [-sign;+num_symb;+non_prol_conj_symb]
% 0.87/1.18 --inst_lit_sel_side num_lit
% 0.87/1.18 --inst_solver_per_active 1400
% 0.87/1.18 --inst_solver_calls_frac 0.01
% 0.87/1.18 --inst_to_smt_solver true
% 0.87/1.18 --inst_passive_queue_type priority_queues
% 0.87/1.18 --inst_passive_queues [[+conj_dist;+num_lits;-age];[-conj_symb;-min_def_symb;+bc_imp_inh]]
% 0.87/1.18 --inst_passive_queues_freq [512;64]
% 0.87/1.18 --inst_dismatching true
% 0.87/1.18 --inst_eager_unprocessed_to_passive false
% 0.87/1.18 --inst_unprocessed_bound 1000
% 0.87/1.18 --inst_prop_sim_given true
% 0.87/1.18 --inst_prop_sim_new true
% 0.87/1.18 --inst_subs_new false
% 0.87/1.18 --inst_eq_res_simp false
% 0.87/1.18 --inst_subs_given true
% 0.87/1.18 --inst_orphan_elimination false
% 0.87/1.18 --inst_learning_loop_flag true
% 0.87/1.18 --inst_learning_start 5
% 0.87/1.18 --inst_learning_factor 8
% 0.87/1.18 --inst_start_prop_sim_after_learn 0
% 0.87/1.18 --inst_sel_renew solver
% 0.87/1.18 --inst_lit_activity_flag true
% 0.87/1.18 --inst_restr_to_given false
% 0.87/1.18 --inst_activity_threshold 10000
% 0.87/1.18
% 0.87/1.18 ------ Resolution Options
% 0.87/1.18
% 0.87/1.18 --resolution_flag false
% 0.87/1.18 --res_lit_sel neg_max
% 0.87/1.18 --res_lit_sel_side num_lit
% 0.87/1.18 --res_ordering kbo
% 0.87/1.18 --res_to_prop_solver passive
% 0.87/1.18 --res_prop_simpl_new true
% 0.87/1.18 --res_prop_simpl_given true
% 0.87/1.18 --res_to_smt_solver true
% 0.87/1.18 --res_passive_queue_type priority_queues
% 0.87/1.18 --res_passive_queues [[-has_eq;-conj_non_prolific_symb;+ground];[-bc_imp_inh;-conj_symb]]
% 0.87/1.18 --res_passive_queues_freq [1024;32]
% 0.87/1.18 --res_forward_subs subset_subsumption
% 0.87/1.18 --res_backward_subs subset_subsumption
% 0.87/1.18 --res_forward_subs_resolution true
% 0.87/1.18 --res_backward_subs_resolution false
% 0.87/1.18 --res_orphan_elimination false
% 0.87/1.18 --res_time_limit 10.
% 0.87/1.18
% 0.87/1.18 ------ Superposition Options
% 0.87/1.18
% 0.87/1.18 --superposition_flag false
% 0.87/1.18 --sup_passive_queue_type priority_queues
% 0.87/1.18 --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.87/1.18 --sup_passive_queues_freq [8;1;4;4]
% 0.87/1.18 --demod_completeness_check fast
% 0.87/1.18 --demod_use_ground true
% 0.87/1.18 --sup_unprocessed_bound 0
% 0.87/1.18 --sup_to_prop_solver passive
% 0.87/1.18 --sup_prop_simpl_new true
% 0.87/1.18 --sup_prop_simpl_given true
% 0.87/1.18 --sup_fun_splitting false
% 0.87/1.18 --sup_iter_deepening 2
% 0.87/1.18 --sup_restarts_mult 12
% 0.87/1.18 --sup_score sim_d_gen
% 0.87/1.18 --sup_share_score_frac 0.2
% 0.87/1.18 --sup_share_max_num_cl 500
% 0.87/1.18 --sup_ordering kbo
% 0.87/1.18 --sup_symb_ordering invfreq
% 0.87/1.18 --sup_term_weight default
% 0.87/1.18
% 0.87/1.18 ------ Superposition Simplification Setup
% 0.87/1.18
% 0.87/1.18 --sup_indices_passive [LightNormIndex;FwDemodIndex]
% 0.87/1.18 --sup_full_triv [SMTSimplify;PropSubs]
% 0.87/1.18 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 0.87/1.18 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.87/1.18 --sup_immed_triv []
% 0.87/1.18 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes]
% 0.87/1.18 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes]
% 0.87/1.18 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod]
% 0.87/1.18 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.87/1.18 --sup_input_triv [Unflattening;SMTSimplify]
% 0.87/1.18 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability]
% 0.87/1.18 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]
% 0.87/1.18 --sup_full_fixpoint true
% 0.87/1.18 --sup_main_fixpoint true
% 0.87/1.18 --sup_immed_fixpoint false
% 0.87/1.18 --sup_input_fixpoint true
% 0.87/1.18 --sup_cache_sim none
% 0.87/1.18 --sup_smt_interval 500
% 0.87/1.18 --sup_bw_gjoin_interval 0
% 0.87/1.18
% 0.87/1.18 ------ Combination Options
% 0.87/1.18
% 0.87/1.18 --comb_mode clause_based
% 0.87/1.18 --comb_inst_mult 1000
% 0.87/1.18 --comb_res_mult 10
% 0.87/1.18 --comb_sup_mult 8
% 0.87/1.18 --comb_sup_deep_mult 2
% 0.87/1.18
% 0.87/1.18 ------ Debug Options
% 0.87/1.18
% 0.87/1.18 --dbg_backtrace false
% 0.87/1.18 --dbg_dump_prop_clauses false
% 0.87/1.18 --dbg_dump_prop_clauses_file -
% 0.87/1.18 --dbg_out_stat false
% 0.87/1.18 --dbg_just_parse false
% 0.87/1.18
% 0.87/1.18
% 0.87/1.18
% 0.87/1.18
% 0.87/1.18 ------ Proving...
% 0.87/1.18
% 0.87/1.18
% 0.87/1.18 % SZS status CounterSatisfiable for theBenchmark.p
% 0.87/1.18
% 0.87/1.18 ------ Building Model...Done
% 0.87/1.18
% 0.87/1.18 %------ The model is defined over ground terms (initial term algebra).
% 0.87/1.18 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 0.87/1.18 %------ where \phi is a formula over the term algebra.
% 0.87/1.18 %------ If we have equality in the problem then it is also defined as a predicate above,
% 0.87/1.18 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 0.87/1.18 %------ See help for --sat_out_model for different model outputs.
% 0.87/1.18 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 0.87/1.18 %------ where the first argument stands for the sort ($i in the unsorted case)
% 0.87/1.18 % SZS output start Model for theBenchmark.p
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of equality_sorted
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0_12,X0,X1] :
% 0.87/1.18 ( equality_sorted(X0_12,X0,X1) <=>
% 0.87/1.18 (
% 0.87/1.18 (
% 0.87/1.18 ( X0_12=$o & X1_1=X0_1 )
% 0.87/1.18 )
% 0.87/1.18
% 0.87/1.18 |
% 0.87/1.18 (
% 0.87/1.18 ( X0_12=$i )
% 0.87/1.18 )
% 0.87/1.18
% 0.87/1.18 |
% 0.87/1.18 (
% 0.87/1.18 ( X0_12=$i & X1=X0 )
% 0.87/1.18 )
% 0.87/1.18
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of selfCaused
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0] :
% 0.87/1.18 ( selfCaused(X0) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of essenceInvExistence
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0] :
% 0.87/1.18 ( essenceInvExistence(X0) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of finiteAfterItsKind
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0] :
% 0.87/1.18 ( finiteAfterItsKind(X0) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of canBeLimitedBy
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0,X1] :
% 0.87/1.18 ( canBeLimitedBy(X0,X1) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of substance
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0] :
% 0.87/1.18 ( substance(X0) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of inItself
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0] :
% 0.87/1.18 ( inItself(X0) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of attribute
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0] :
% 0.87/1.18 ( attribute(X0) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of intPercAsConstEssSub
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0] :
% 0.87/1.18 ( intPercAsConstEssSub(X0) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of mode
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0] :
% 0.87/1.18 ( mode(X0) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of conceivedThru
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0,X1] :
% 0.87/1.18 ( conceivedThru(X0,X1) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of existsIn
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0,X1] :
% 0.87/1.18 ( existsIn(X0,X1) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of modification
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0,X1] :
% 0.87/1.18 ( modification(X0,X1) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.18
% 0.87/1.18 %------ Positive definition of god
% 0.87/1.18 fof(lit_def,axiom,
% 0.87/1.18 (! [X0] :
% 0.87/1.18 ( god(X0) <=>
% 0.87/1.18 $false
% 0.87/1.18 )
% 0.87/1.18 )
% 0.87/1.18 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of absolutelyInfinite
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( absolutelyInfinite(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of being
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( being(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of constInInfAttributes
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( constInInfAttributes(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of attributeOf
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0,X1] :
% 0.87/1.19 ( attributeOf(X0,X1) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of free
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( free(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of determinedByItselfAlone
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0,X1] :
% 0.87/1.19 ( determinedByItselfAlone(X0,X1) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of existsOnlyByNecessityOfOwnNature
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( existsOnlyByNecessityOfOwnNature(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of actionOf
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0,X1] :
% 0.87/1.19 ( actionOf(X0,X1) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of necessary
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( necessary(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of externalTo
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0,X1] :
% 0.87/1.19 ( externalTo(X0,X1) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of eternity
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( eternity(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of existConcFollowFromDefEternal
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( existConcFollowFromDefEternal(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of exists
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( exists(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of definiteCause
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( definiteCause(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of knowledgeOfEffect
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0,X1] :
% 0.87/1.19 ( knowledgeOfEffect(X0,X1) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of knowledgeOfACause
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( knowledgeOfACause(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of haveNothingInCommon
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0,X1] :
% 0.87/1.19 ( haveNothingInCommon(X0,X1) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of canBeUnderstoodInTermsOf
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0,X1] :
% 0.87/1.19 ( canBeUnderstoodInTermsOf(X0,X1) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of trueIdea
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( trueIdea(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19
% 0.87/1.19 %------ Positive definition of canBeConceivedAsNonExisting
% 0.87/1.19 fof(lit_def,axiom,
% 0.87/1.19 (! [X0] :
% 0.87/1.19 ( canBeConceivedAsNonExisting(X0) <=>
% 0.87/1.19 $false
% 0.87/1.19 )
% 0.87/1.19 )
% 0.87/1.19 ).
% 0.87/1.19 % SZS output end Model for theBenchmark.p
% 0.87/1.19
%------------------------------------------------------------------------------