0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : /export/starexec/sandbox2/solver/bin/run_iprover 120 /export/starexec/sandbox2/benchmark/theBenchmark.p SAT 0.12/0.34 % Computer : n009.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 960 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Wed Jul 30 05:46:34 EDT 2025 0.12/0.34 % CPUTime : 0.19/0.47 /export/starexec/sandbox2/solver/bin/SPCForProblem: Command not found. 0.19/0.47 Running model finding 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core-casc.sh -l tptp -s fnt_schedule -t 120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.19/0.48 0.19/0.48 % ======== iProver multi-core TPTP/SMT ========= 0.19/0.48 0.19/0.48 % Detected problem language: tptp 0.19/0.49 % Checking... 0.56/1.20 % Proving... 1.27/1.93 % SZS status Started for theBenchmark.p 1.27/1.93 % SZS status Satisfiable for theBenchmark.p 1.27/1.93 1.27/1.93 %---------------- iProver v3.9.3 (pre CASC 2025/SMT-COMP 2025) ----------------% 1.27/1.93 1.27/1.93 ------ iProver source info 1.27/1.93 1.27/1.93 git: date: 2025-07-21 10:15:00 +0000 1.27/1.93 git: sha1: d7ebeb21b290b8724a1e08b4c4a533d26e8c009f 1.27/1.93 git: non_committed_changes: true 1.27/1.93 1.27/1.93 ------ Parsing... 1.27/1.93 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim 1.27/1.93 1.27/1.93 ------ Proving... 1.27/1.93 ------ Problem Properties 1.27/1.93 1.27/1.93 1.27/1.93 clauses 15 1.27/1.93 conjectures 7 1.27/1.93 EPR 10 1.27/1.93 Horn 8 1.27/1.93 unary 1 1.27/1.93 binary 8 1.27/1.93 lits 43 1.27/1.93 lits eq 0 1.27/1.93 fd_pure 0 1.27/1.93 fd_pseudo 0 1.27/1.93 fd_cond 0 1.27/1.93 fd_pseudo_cond 0 1.27/1.93 AC symbols 0 1.27/1.93 1.27/1.93 ------ Schedule dynamic 5 is on 1.27/1.93 1.27/1.93 ------ no equalities: superposition off 1.27/1.93 1.27/1.93 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 1.27/1.93 1.27/1.93 1.27/1.93 ------ 1.27/1.93 Current options: 1.27/1.93 ------ 1.27/1.93 1.27/1.93 ------ Input Options 1.27/1.93 1.27/1.93 --out_options all 1.27/1.93 --tptp_safe_out true 1.27/1.93 --problem_path "" 1.27/1.93 --include_path "" 1.27/1.93 --clausifier res/vclausify_rel 1.27/1.93 --clausifier_options --mode tclausify --show_fool true -t 41.67 -updr off 1.27/1.93 --stdin false 1.27/1.93 --proof_out true 1.27/1.93 --proof_dot_file "" 1.27/1.93 --proof_reduce_dot [] 1.27/1.93 --suppress_sat_res false 1.27/1.93 --suppress_unsat_res true 1.27/1.93 --stats_out none 1.27/1.93 --stats_mem false 1.27/1.93 --theory_stats_out false 1.27/1.93 1.27/1.93 ------ General Options 1.27/1.93 1.27/1.93 --fof false 1.27/1.93 --time_out_real 125. 1.27/1.93 --time_out_virtual -1. 1.27/1.93 --rnd_seed 13 1.27/1.93 --symbol_type_check false 1.27/1.93 --clausify_out false 1.27/1.93 --sig_cnt_out false 1.27/1.93 --trig_cnt_out false 1.27/1.93 --trig_cnt_out_tolerance 1. 1.27/1.93 --trig_cnt_out_sk_spl false 1.27/1.93 --abstr_cl_out false 1.27/1.93 1.27/1.93 ------ Interactive Mode 1.27/1.93 1.27/1.93 --interactive_mode false 1.27/1.93 --external_ip_address "" 1.27/1.93 --external_port 0 1.27/1.93 1.27/1.93 ------ Global Options 1.27/1.93 1.27/1.93 --schedule default 1.27/1.93 --add_important_lit false 1.27/1.93 --prop_solver_per_cl 500 1.27/1.93 --subs_bck_mult 8 1.27/1.93 --min_unsat_core false 1.27/1.93 --soft_assumptions false 1.27/1.93 --soft_lemma_size 3 1.27/1.93 --prop_impl_unit_size 0 1.27/1.93 --prop_impl_unit [] 1.27/1.93 --share_sel_clauses true 1.27/1.93 --reset_solvers false 1.27/1.93 --bc_imp_inh [conj_cone] 1.27/1.93 --conj_cone_tolerance 3. 1.27/1.93 --extra_neg_conj none 1.27/1.93 --large_theory_mode true 1.27/1.93 --prolific_symb_bound 200 1.27/1.93 --lt_threshold 2000 1.27/1.93 --clause_weak_htbl true 1.27/1.93 --gc_record_bc_elim false 1.27/1.93 1.27/1.93 ------ Preprocessing Options 1.27/1.93 1.27/1.93 --preprocessing_flag false 1.27/1.93 --time_out_prep_mult 0.1 1.27/1.93 --splitting_mode input 1.27/1.93 --splitting_grd true 1.27/1.93 --splitting_cvd false 1.27/1.93 --splitting_cvd_svl false 1.27/1.93 --splitting_nvd 32 1.27/1.93 --sub_typing false 1.27/1.93 --prep_eq_flat_conj false 1.27/1.93 --prep_eq_flat_all_gr false 1.27/1.93 --prep_gs_sim true 1.27/1.93 --prep_unflatten true 1.27/1.93 --prep_res_sim true 1.27/1.93 --prep_sup_sim_all true 1.27/1.93 --prep_sup_sim_sup false 1.27/1.93 --prep_upred true 1.27/1.93 --prep_well_definedness true 1.27/1.93 --prep_sem_filter exhaustive 1.27/1.93 --prep_sem_filter_out false 1.27/1.93 --pred_elim true 1.27/1.93 --res_sim_input true 1.27/1.93 --eq_ax_congr_red true 1.27/1.93 --pure_diseq_elim true 1.27/1.93 --brand_transform false 1.27/1.93 --non_eq_to_eq false 1.27/1.93 --prep_def_merge true 1.27/1.93 --prep_def_merge_prop_impl false 1.27/1.93 --prep_def_merge_mbd true 1.27/1.93 --prep_def_merge_tr_red false 1.27/1.93 --prep_def_merge_tr_cl false 1.27/1.93 --smt_preprocessing false 1.27/1.93 --smt_ac_axioms fast 1.27/1.93 --preprocessed_out false 1.27/1.93 --preprocessed_stats false 1.27/1.93 1.27/1.93 ------ Abstraction refinement Options 1.27/1.93 1.27/1.93 --abstr_ref [] 1.27/1.93 --abstr_ref_prep false 1.27/1.93 --abstr_ref_until_sat false 1.27/1.93 --abstr_ref_sig_restrict funpre 1.27/1.93 --abstr_ref_af_restrict_to_split_sk false 1.27/1.93 --abstr_ref_under [] 1.27/1.93 1.27/1.93 ------ SAT Options 1.27/1.93 1.27/1.93 --sat_mode false 1.27/1.93 --sat_fm_restart_options "" 1.27/1.93 --sat_gr_def false 1.27/1.93 --sat_epr_types true 1.27/1.93 --sat_non_cyclic_types false 1.27/1.93 --sat_finite_models false 1.27/1.93 --sat_fm_lemmas false 1.27/1.93 --sat_fm_prep false 1.27/1.93 --sat_fm_uc_incr true 1.27/1.93 --sat_out_model pos 1.27/1.93 --sat_out_clauses false 1.27/1.93 1.27/1.93 ------ QBF Options 1.27/1.93 1.27/1.93 --qbf_mode false 1.27/1.93 --qbf_elim_univ false 1.27/1.93 --qbf_dom_inst none 1.27/1.93 --qbf_dom_pre_inst false 1.27/1.93 --qbf_sk_in false 1.27/1.93 --qbf_pred_elim true 1.27/1.93 --qbf_split 512 1.27/1.93 1.27/1.93 ------ BMC1 Options 1.27/1.93 1.27/1.93 --bmc1_incremental false 1.27/1.93 --bmc1_axioms reachable_all 1.27/1.93 --bmc1_min_bound 0 1.27/1.93 --bmc1_max_bound -1 1.27/1.93 --bmc1_max_bound_default -1 1.27/1.93 --bmc1_symbol_reachability true 1.27/1.93 --bmc1_property_lemmas false 1.27/1.93 --bmc1_k_induction false 1.27/1.93 --bmc1_non_equiv_states false 1.27/1.93 --bmc1_deadlock false 1.27/1.93 --bmc1_ucm false 1.27/1.93 --bmc1_add_unsat_core none 1.27/1.93 --bmc1_unsat_core_children false 1.27/1.93 --bmc1_unsat_core_extrapolate_axioms false 1.27/1.93 --bmc1_out_stat full 1.27/1.93 --bmc1_ground_init false 1.27/1.93 --bmc1_pre_inst_next_state false 1.27/1.93 --bmc1_pre_inst_state false 1.27/1.93 --bmc1_pre_inst_reach_state false 1.27/1.93 --bmc1_out_unsat_core false 1.27/1.93 --bmc1_aig_witness_out false 1.27/1.93 --bmc1_verbose false 1.27/1.93 --bmc1_dump_clauses_tptp false 1.27/1.93 --bmc1_dump_unsat_core_tptp false 1.27/1.93 --bmc1_dump_file - 1.27/1.93 --bmc1_ucm_expand_uc_limit 128 1.27/1.93 --bmc1_ucm_n_expand_iterations 6 1.27/1.93 --bmc1_ucm_extend_mode 1 1.27/1.93 --bmc1_ucm_init_mode 2 1.27/1.93 --bmc1_ucm_cone_mode none 1.27/1.93 --bmc1_ucm_reduced_relation_type 0 1.27/1.93 --bmc1_ucm_relax_model 4 1.27/1.93 --bmc1_ucm_full_tr_after_sat true 1.27/1.93 --bmc1_ucm_expand_neg_assumptions false 1.27/1.93 --bmc1_ucm_layered_model none 1.27/1.93 --bmc1_ucm_max_lemma_size 10 1.27/1.93 1.27/1.93 ------ AIG Options 1.27/1.93 1.27/1.93 --aig_mode false 1.27/1.93 1.27/1.93 ------ Instantiation Options 1.27/1.93 1.27/1.93 --instantiation_flag true 1.27/1.93 --inst_sos_flag false 1.27/1.93 --inst_sos_phase true 1.27/1.93 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var;-num_symb] 1.27/1.93 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 1.27/1.93 --inst_lit_sel_side none 1.27/1.93 --inst_solver_per_active 1400 1.27/1.93 --inst_solver_calls_frac 1. 1.27/1.93 --inst_to_smt_solver true 1.27/1.93 --inst_passive_queue_type priority_queues 1.27/1.93 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 1.27/1.93 --inst_passive_queues_freq [25;2] 1.27/1.93 --inst_dismatching true 1.27/1.93 --inst_eager_unprocessed_to_passive true 1.27/1.93 --inst_unprocessed_bound 1000 1.27/1.93 --inst_prop_sim_given true 1.27/1.93 --inst_prop_sim_new false 1.27/1.93 --inst_subs_new false 1.27/1.93 --inst_eq_res_simp false 1.27/1.93 --inst_subs_given false 1.27/1.93 --inst_orphan_elimination true 1.27/1.93 --inst_learning_loop_flag true 1.27/1.93 --inst_learning_start 3000 1.27/1.93 --inst_learning_factor 2 1.27/1.93 --inst_start_prop_sim_after_learn 3 1.27/1.93 --inst_sel_renew solver 1.27/1.93 --inst_lit_activity_flag true 1.27/1.93 --inst_restr_to_given false 1.27/1.93 --inst_activity_threshold 500 1.27/1.93 1.27/1.93 ------ Resolution Options 1.27/1.93 1.27/1.93 --resolution_flag false 1.27/1.93 --res_lit_sel adaptive 1.27/1.93 --res_lit_sel_side none 1.27/1.93 --res_ordering kbo 1.27/1.93 --res_to_prop_solver active 1.27/1.93 --res_prop_simpl_new false 1.27/1.93 --res_prop_simpl_given true 1.27/1.93 --res_to_smt_solver true 1.27/1.93 --res_passive_queue_type priority_queues 1.27/1.93 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 1.27/1.93 --res_passive_queues_freq [15;5] 1.27/1.93 --res_forward_subs full 1.27/1.93 --res_backward_subs full 1.27/1.93 --res_forward_subs_resolution true 1.27/1.93 --res_backward_subs_resolution true 1.27/1.93 --res_orphan_elimination true 1.27/1.93 --res_time_limit 300. 1.27/1.93 1.27/1.93 ------ Superposition Options 1.27/1.93 1.27/1.93 --superposition_flag true 1.27/1.93 --sup_passive_queue_type priority_queues 1.27/1.93 --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.27/1.93 --sup_passive_queues_freq [8;1;4;4] 1.27/1.93 --demod_completeness_check fast 1.27/1.93 --demod_use_ground true 1.27/1.93 --sup_unprocessed_bound 0 1.27/1.93 --sup_to_prop_solver passive 1.27/1.93 --sup_prop_simpl_new true 1.27/1.93 --sup_prop_simpl_given true 1.27/1.93 --sup_fun_splitting false 1.27/1.93 --sup_iter_deepening 2 1.27/1.93 --sup_restarts_mult 12 1.27/1.93 --sup_score sim_d_gen 1.27/1.93 --sup_share_score_frac 0.2 1.27/1.93 --sup_share_max_num_cl 500 1.27/1.93 --sup_ordering kbo 1.27/1.93 --sup_symb_ordering invfreq 1.27/1.93 --sup_term_weight default 1.27/1.93 1.27/1.93 ------ Superposition Simplification Setup 1.27/1.93 1.27/1.93 --sup_indices_passive [LightNormIndex;FwDemodIndex] 1.27/1.93 --sup_full_triv [SMTSimplify;PropSubs] 1.27/1.93 --sup_full_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability] 1.27/1.93 --sup_full_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 1.27/1.93 --sup_immed_triv [] 1.27/1.93 --sup_immed_fw_main [ACNormalisation;FwLightNorm;FwUnitSubsAndRes] 1.27/1.93 --sup_immed_fw_immed [ACNormalisation;FwUnitSubsAndRes] 1.27/1.93 --sup_immed_bw_main [BwUnitSubsAndRes;BwDemod] 1.27/1.93 --sup_immed_bw_immed [BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 1.27/1.93 --sup_input_triv [Unflattening;SMTSimplify] 1.27/1.93 --sup_input_fw [FwACDemod;ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes;FwGroundJoinability] 1.27/1.93 --sup_input_bw [BwACDemod;BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 1.27/1.93 --sup_full_fixpoint true 1.27/1.93 --sup_main_fixpoint true 1.27/1.93 --sup_immed_fixpoint false 1.27/1.93 --sup_input_fixpoint true 1.27/1.93 --sup_cache_sim none 1.27/1.93 --sup_smt_interval 500 1.27/1.93 --sup_bw_gjoin_interval 0 1.27/1.93 1.27/1.93 ------ Combination Options 1.27/1.93 1.27/1.93 --comb_mode clause_based 1.27/1.93 --comb_inst_mult 5 1.27/1.93 --comb_res_mult 1 1.27/1.93 --comb_sup_mult 1 1.27/1.93 --comb_sup_deep_mult 1 1.27/1.93 1.27/1.93 ------ Debug Options 1.27/1.93 1.27/1.93 --dbg_backtrace false 1.27/1.93 --dbg_dump_prop_clauses false 1.27/1.93 --dbg_dump_prop_clauses_file - 1.27/1.93 --dbg_out_stat false 1.27/1.93 --dbg_just_parse false 1.27/1.93 1.27/1.93 1.27/1.93 1.27/1.93 1.27/1.93 ------ Proving... 1.27/1.93 1.27/1.93 1.27/1.93 % SZS status Satisfiable for theBenchmark.p 1.27/1.93 1.27/1.93 ------ Building Model...Done 1.27/1.93 1.27/1.93 %------ The model is defined over ground terms (initial term algebra). 1.27/1.93 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) 1.27/1.93 %------ where \phi is a formula over the term algebra. 1.27/1.93 %------ If we have equality in the problem then it is also defined as a predicate above, 1.27/1.93 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type 1.27/1.93 %------ See help for --sat_out_model for different model outputs. 1.27/1.93 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "=" 1.27/1.93 %------ where the first argument stands for the sort ($i in the unsorted case) 1.27/1.93 % SZS output start Model for theBenchmark.p 1.27/1.93 1.27/1.93 %------ Positive definition of '$ki_accessible' 1.27/1.93 fof(lit_def,axiom, 1.27/1.93 (! [X0_'ki_world',X1_'ki_world'] : 1.27/1.93 ( '$ki_accessible'(X0_'ki_world',X1_'ki_world') <=> 1.27/1.93 ( 1.27/1.93 ( 1.27/1.93 ( X0_'ki_world'='$ki_local_world' & X1_'ki_world'=sK6 ) 1.27/1.93 ) 1.27/1.93 1.27/1.93 | 1.27/1.93 ( 1.27/1.93 ( X0_'ki_world'=sK7 & X1_'ki_world'=sK8 ) 1.27/1.93 ) 1.27/1.93 1.27/1.93 | 1.27/1.93 ( 1.27/1.93 ( X0_'ki_world'=sK7 & X1_'ki_world'=sK1(sK7) ) 1.27/1.93 ) 1.27/1.93 1.27/1.93 | 1.27/1.93 ( 1.27/1.93 ( X0_'ki_world'=sK6 & X1_'ki_world'=sK7 ) 1.27/1.93 ) 1.27/1.93 1.27/1.93 | 1.27/1.93 ( 1.27/1.93 ( X0_'ki_world'=sK6 & X1_'ki_world'=sK1(sK6) ) 1.27/1.93 ) 1.27/1.93 1.27/1.93 | 1.27/1.93 ( 1.27/1.93 ( X1_'ki_world'=sK1(X0_'ki_world') ) 1.27/1.93 & 1.27/1.93 ( X0_'ki_world'!=sK7 ) 1.27/1.93 & 1.27/1.93 ( X0_'ki_world'!=sK6 ) 1.27/1.93 ) 1.27/1.93 1.27/1.93 ) 1.27/1.93 ) 1.27/1.93 ) 1.27/1.93 ). 1.27/1.93 1.27/1.93 %------ Positive definition of p 1.27/1.93 fof(lit_def,axiom, 1.27/1.93 (! [X0_'ki_world'] : 1.27/1.93 ( p(X0_'ki_world') <=> 1.27/1.93 ( 1.27/1.93 ( 1.27/1.93 ( X0_'ki_world'=sK8 ) 1.27/1.93 ) 1.27/1.93 1.27/1.93 | 1.27/1.93 ( 1.27/1.93 ( X0_'ki_world'=sK1(sK7) ) 1.27/1.93 ) 1.27/1.93 1.27/1.93 ) 1.27/1.93 ) 1.27/1.93 ) 1.27/1.93 ). 1.27/1.93 1.27/1.93 %------ Positive definition of q 1.27/1.93 fof(lit_def,axiom, 1.27/1.93 (! [X0_'ki_world'] : 1.27/1.93 ( q(X0_'ki_world') <=> 1.27/1.93 ( 1.27/1.93 ( 1.27/1.93 ( X0_'ki_world'=sK7 ) 1.27/1.93 ) 1.27/1.93 1.27/1.93 | 1.27/1.93 ( 1.27/1.93 ( X0_'ki_world'=sK1(sK6) ) 1.27/1.93 ) 1.27/1.93 1.27/1.93 ) 1.27/1.93 ) 1.27/1.93 ) 1.27/1.93 ). 1.27/1.93 1.27/1.93 %------ Positive definition of sP0 1.27/1.93 fof(lit_def,axiom, 1.27/1.93 ( sP0 <=> 1.27/1.93 $false 1.27/1.93 ) 1.27/1.93 ). 1.27/1.93 % SZS output end Model for theBenchmark.p 1.27/1.93 1.27/2.03 EOF