0.02/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.11 % Command : python3 prover_driver.py --schedule_mode external --schedule fof_schedule --no_cores 8 --problem_version fof /export/starexec/sandbox/benchmark/theBenchmark.p 120 --prover /export/starexec/sandbox/solver/bin/res/iproveropt_no_z3 0.10/0.31 % Computer : n017.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 960 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Tue Aug 9 03:55:00 EDT 2022 0.16/0.31 % CPUTime : 41.17/8.60 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p 41.17/8.60 41.17/8.60 %---------------- iProver v3.6 (pre CASC-J11 2022) ----------------% 41.17/8.60 41.17/8.60 ------ iProver source info 41.17/8.60 41.17/8.60 git: date: 2022-07-26 19:47:37 +0300 41.17/8.60 git: sha1: 69e283425f6c8ae3fb9e67f2058d741e849b12e1 41.17/8.60 git: non_committed_changes: false 41.17/8.60 git: last_make_outside_of_git: false 41.17/8.60 41.17/8.60 ------ Parsing... 41.17/8.60 ------ Clausification by vclausify_rel & Parsing by iProver... 41.17/8.60 41.17/8.60 ------ Preprocessing... sup_sim: 2 sf_s rm: 14 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e 41.17/8.60 41.17/8.60 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e 41.17/8.60 41.17/8.60 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 41.17/8.60 ------ Proving... 41.17/8.60 ------ Problem Properties 41.17/8.60 41.17/8.60 41.17/8.60 clauses 13 41.17/8.60 conjectures 0 41.17/8.60 EPR 0 41.17/8.60 Horn 13 41.17/8.60 unary 11 41.17/8.60 binary 1 41.17/8.60 lits 16 41.17/8.60 lits eq 6 41.17/8.60 fd_pure 0 41.17/8.60 fd_pseudo 0 41.17/8.60 fd_cond 0 41.17/8.60 fd_pseudo_cond 1 41.17/8.60 AC symbols 0 41.17/8.60 41.17/8.60 ------ Input Options Time Limit: Unbounded 41.17/8.60 41.17/8.60 41.17/8.60 ------ 41.17/8.60 Current options: 41.17/8.60 ------ 41.17/8.60 41.17/8.60 ------ Input Options 41.17/8.60 41.17/8.60 --out_options all 41.17/8.60 --tptp_safe_out true 41.17/8.60 --problem_path "" 41.17/8.60 --include_path "" 41.17/8.60 --clausifier res/vclausify_rel 41.17/8.60 --clausifier_options --mode clausify -t 120.79716062545776 41.17/8.60 --stdin false 41.17/8.60 --suppress_sat_res false 41.17/8.60 --suppress_unsat_res false 41.17/8.60 --stats_out sel 41.17/8.60 --stats_mem false 41.17/8.60 --theory_stats_out false 41.17/8.60 41.17/8.60 ------ General Options 41.17/8.60 41.17/8.60 --fof false 41.17/8.60 --time_out_real 120.8 41.17/8.60 --time_out_virtual -1. 41.17/8.60 --rnd_seed 13 41.17/8.60 --symbol_type_check false 41.17/8.60 --clausify_out false 41.17/8.60 --sig_cnt_out false 41.17/8.60 --trig_cnt_out false 41.17/8.60 --trig_cnt_out_tolerance 1. 41.17/8.60 --trig_cnt_out_sk_spl false 41.17/8.60 --abstr_cl_out false 41.17/8.60 41.17/8.60 ------ Global Options 41.17/8.60 41.17/8.60 --schedule none 41.17/8.60 --add_important_lit false 41.17/8.60 --prop_solver_per_cl 1024 41.17/8.60 --subs_bck_mult 8 41.17/8.60 --min_unsat_core false 41.17/8.60 --soft_assumptions false 41.17/8.60 --soft_lemma_size 3 41.17/8.60 --prop_impl_unit_size 0 41.17/8.60 --prop_impl_unit [] 41.17/8.60 --share_sel_clauses true 41.17/8.60 --reset_solvers false 41.17/8.60 --bc_imp_inh [conj_cone] 41.17/8.60 --conj_cone_tolerance 3. 41.17/8.60 --extra_neg_conj none 41.17/8.60 --large_theory_mode true 41.17/8.60 --prolific_symb_bound 256 41.17/8.60 --lt_threshold 2000 41.17/8.60 --clause_weak_htbl true 41.17/8.60 --gc_record_bc_elim false 41.17/8.60 41.17/8.60 ------ Preprocessing Options 41.17/8.60 41.17/8.60 --preprocessing_flag true 41.17/8.60 --time_out_prep_mult 0.1 41.17/8.60 --splitting_mode input 41.17/8.60 --splitting_grd true 41.17/8.60 --splitting_cvd false 41.17/8.60 --splitting_cvd_svl false 41.17/8.60 --splitting_nvd 32 41.17/8.60 --sub_typing false 41.17/8.60 --prep_gs_sim true 41.17/8.60 --prep_unflatten true 41.17/8.60 --prep_res_sim true 41.17/8.60 --prep_sup_sim_all true 41.17/8.60 --prep_sup_sim_sup false 41.17/8.60 --prep_upred true 41.17/8.60 --prep_well_definedness true 41.17/8.60 --prep_sem_filter exhaustive 41.17/8.60 --prep_sem_filter_out false 41.17/8.60 --pred_elim true 41.17/8.60 --res_sim_input true 41.17/8.60 --eq_ax_congr_red true 41.17/8.60 --pure_diseq_elim true 41.17/8.60 --brand_transform false 41.17/8.60 --non_eq_to_eq false 41.17/8.60 --prep_def_merge true 41.17/8.60 --prep_def_merge_prop_impl false 41.17/8.60 --prep_def_merge_mbd true 41.17/8.60 --prep_def_merge_tr_red false 41.17/8.60 --prep_def_merge_tr_cl false 41.17/8.60 --smt_preprocessing true 41.17/8.60 --smt_ac_axioms fast 41.17/8.60 --preprocessed_out false 41.17/8.60 --preprocessed_stats false 41.17/8.60 41.17/8.60 ------ Abstraction refinement Options 41.17/8.60 41.17/8.60 --abstr_ref [] 41.17/8.60 --abstr_ref_prep false 41.17/8.60 --abstr_ref_until_sat false 41.17/8.60 --abstr_ref_sig_restrict funpre 41.17/8.60 --abstr_ref_af_restrict_to_split_sk false 41.17/8.60 --abstr_ref_under [] 41.17/8.60 41.17/8.60 ------ SAT Options 41.17/8.60 41.17/8.60 --sat_mode false 41.17/8.60 --sat_fm_restart_options "" 41.17/8.60 --sat_gr_def false 41.17/8.60 --sat_epr_types true 41.17/8.60 --sat_non_cyclic_types false 41.17/8.60 --sat_finite_models false 41.17/8.60 --sat_fm_lemmas false 41.17/8.60 --sat_fm_prep false 41.17/8.60 --sat_fm_uc_incr true 41.17/8.60 --sat_out_model small 41.17/8.60 --sat_out_clauses false 41.17/8.60 41.17/8.60 ------ QBF Options 41.17/8.60 41.17/8.60 --qbf_mode false 41.17/8.60 --qbf_elim_univ false 41.17/8.60 --qbf_dom_inst none 41.17/8.60 --qbf_dom_pre_inst false 41.17/8.60 --qbf_sk_in false 41.17/8.60 --qbf_pred_elim true 41.17/8.60 --qbf_split 512 41.17/8.60 41.17/8.60 ------ BMC1 Options 41.17/8.60 41.17/8.60 --bmc1_incremental false 41.17/8.60 --bmc1_axioms reachable_all 41.17/8.60 --bmc1_min_bound 0 41.17/8.60 --bmc1_max_bound -1 41.17/8.60 --bmc1_max_bound_default -1 41.17/8.60 --bmc1_symbol_reachability true 41.17/8.60 --bmc1_property_lemmas false 41.17/8.60 --bmc1_k_induction false 41.17/8.60 --bmc1_non_equiv_states false 41.17/8.60 --bmc1_deadlock false 41.17/8.60 --bmc1_ucm false 41.17/8.60 --bmc1_add_unsat_core none 41.17/8.60 --bmc1_unsat_core_children false 41.17/8.60 --bmc1_unsat_core_extrapolate_axioms false 41.17/8.60 --bmc1_out_stat full 41.17/8.60 --bmc1_ground_init false 41.17/8.60 --bmc1_pre_inst_next_state false 41.17/8.60 --bmc1_pre_inst_state false 41.17/8.60 --bmc1_pre_inst_reach_state false 41.17/8.60 --bmc1_out_unsat_core false 41.17/8.60 --bmc1_aig_witness_out false 41.17/8.60 --bmc1_verbose false 41.17/8.60 --bmc1_dump_clauses_tptp false 41.17/8.60 --bmc1_dump_unsat_core_tptp false 41.17/8.60 --bmc1_dump_file - 41.17/8.60 --bmc1_ucm_expand_uc_limit 128 41.17/8.60 --bmc1_ucm_n_expand_iterations 6 41.17/8.60 --bmc1_ucm_extend_mode 1 41.17/8.60 --bmc1_ucm_init_mode 2 41.17/8.60 --bmc1_ucm_cone_mode none 41.17/8.60 --bmc1_ucm_reduced_relation_type 0 41.17/8.60 --bmc1_ucm_relax_model 4 41.17/8.60 --bmc1_ucm_full_tr_after_sat true 41.17/8.60 --bmc1_ucm_expand_neg_assumptions false 41.17/8.60 --bmc1_ucm_layered_model none 41.17/8.60 --bmc1_ucm_max_lemma_size 10 41.17/8.60 41.17/8.60 ------ AIG Options 41.17/8.60 41.17/8.60 --aig_mode false 41.17/8.60 41.17/8.60 ------ Instantiation Options 41.17/8.60 41.17/8.60 --instantiation_flag true 41.17/8.60 --inst_sos_flag false 41.17/8.60 --inst_sos_phase true 41.17/8.60 --inst_sos_sth_lit_sel [+prop;+non_prol_conj_symb;-eq;+ground;-num_var] 41.17/8.60 --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb] 41.17/8.60 --inst_lit_sel_side num_symb 41.17/8.60 --inst_solver_per_active 1400 41.17/8.60 --inst_solver_calls_frac 1. 41.17/8.60 --inst_passive_queue_type priority_queues 41.17/8.60 --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]] 41.17/8.60 --inst_passive_queues_freq [25;2] 41.17/8.60 --inst_dismatching true 41.17/8.60 --inst_eager_unprocessed_to_passive true 41.17/8.60 --inst_prop_sim_given true 41.17/8.60 --inst_prop_sim_new false 41.17/8.60 --inst_subs_new false 41.17/8.60 --inst_eq_res_simp false 41.17/8.60 --inst_subs_given false 41.17/8.60 --inst_orphan_elimination true 41.17/8.60 --inst_learning_loop_flag true 41.17/8.60 --inst_learning_start 3000 41.17/8.60 --inst_learning_factor 2 41.17/8.60 --inst_start_prop_sim_after_learn 3 41.17/8.60 --inst_sel_renew solver 41.17/8.60 --inst_lit_activity_flag true 41.17/8.60 --inst_restr_to_given false 41.17/8.60 --inst_activity_threshold 500 41.17/8.60 --inst_out_proof true 41.17/8.60 41.17/8.60 ------ Resolution Options 41.17/8.60 41.17/8.60 --resolution_flag true 41.17/8.60 --res_lit_sel adaptive 41.17/8.60 --res_lit_sel_side none 41.17/8.60 --res_ordering kbo 41.17/8.60 --res_to_prop_solver active 41.17/8.60 --res_prop_simpl_new false 41.17/8.60 --res_prop_simpl_given true 41.17/8.60 --res_passive_queue_type priority_queues 41.17/8.60 --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]] 41.17/8.60 --res_passive_queues_freq [15;5] 41.17/8.60 --res_forward_subs full 41.17/8.60 --res_backward_subs full 41.17/8.60 --res_forward_subs_resolution true 41.17/8.60 --res_backward_subs_resolution true 41.17/8.60 --res_orphan_elimination true 41.17/8.60 --res_time_limit 300. 41.17/8.60 --res_out_proof true 41.17/8.60 41.17/8.60 ------ Superposition Options 41.17/8.60 41.17/8.60 --superposition_flag true 41.17/8.60 --sup_passive_queue_type priority_queues 41.17/8.60 --sup_passive_queues [[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]] 41.17/8.60 --sup_passive_queues_freq [8;4;4] 41.17/8.60 --demod_completeness_check fast 41.17/8.60 --demod_use_ground true 41.17/8.60 --sup_to_prop_solver passive 41.17/8.60 --sup_prop_simpl_new true 41.17/8.60 --sup_prop_simpl_given true 41.17/8.60 --sup_fun_splitting false 41.17/8.60 --sup_iter_deepening 2 41.17/8.60 --sup_restarts_mult 2 41.17/8.60 --sup_score sim_d_gen 41.17/8.60 --sup_share_score_frac 0.2 41.17/8.60 --sup_share_max_num_cl 500 41.17/8.60 --sup_ordering kbo 41.17/8.60 --sup_symb_ordering invfreq 41.17/8.60 --sup_term_weight default 41.17/8.60 41.17/8.60 ------ Superposition Simplification Setup 41.17/8.60 41.17/8.60 --sup_indices_passive [LightNormIndex;UnitSubsumptionIndex] 41.17/8.60 --sup_full_triv [PropSubs] 41.17/8.60 --sup_full_fw [FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes] 41.17/8.60 --sup_full_bw [BwDemod;BwUnitSubsAndRes] 41.17/8.60 --sup_immed_triv [] 41.17/8.60 --sup_immed_fw_main [FwUnitSubsAndRes] 41.17/8.60 --sup_immed_fw_immed [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes] 41.17/8.60 --sup_immed_bw_main [BwUnitSubsAndRes] 41.17/8.60 --sup_immed_bw_immed [BwUnitSubsAndRes] 41.17/8.60 --sup_input_triv [Unflattening] 41.17/8.60 --sup_input_fw [ACNormalisation;FwLightNorm;FwDemod;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes] 41.17/8.60 --sup_input_bw [BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes] 41.17/8.60 --sup_full_fixpoint true 41.17/8.60 --sup_main_fixpoint true 41.17/8.60 --sup_immed_fixpoint true 41.17/8.60 --sup_input_fixpoint true 41.17/8.60 --sup_cache_sim none 41.17/8.60 --sup_smt_interval 10000 41.17/8.60 --sup_bw_gjoin_interval 0 41.17/8.60 41.17/8.60 ------ Combination Options 41.17/8.60 41.17/8.60 --comb_mode clause_based 41.17/8.60 --comb_inst_mult 3 41.17/8.60 --comb_res_mult 1 41.17/8.60 --comb_sup_mult 0 41.17/8.60 --comb_sup_deep_mult 2 41.17/8.60 41.17/8.60 ------ Debug Options 41.17/8.60 41.17/8.60 --dbg_backtrace false 41.17/8.60 --dbg_dump_prop_clauses false 41.17/8.60 --dbg_dump_prop_clauses_file - 41.17/8.60 --dbg_out_stat false 41.17/8.60 --dbg_just_parse false 41.17/8.60 41.17/8.60 41.17/8.60 41.17/8.60 41.17/8.60 ------ Proving... 41.17/8.60 41.17/8.60 41.17/8.60 % SZS status Theorem for theBenchmark.p 41.17/8.60 41.17/8.60 % SZS output start CNFRefutation for theBenchmark.p 41.17/8.60 41.17/8.60 fof(f26,axiom,( 41.17/8.60 ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) <=> implies_3), 41.17/8.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_3)). 41.17/8.60 41.17/8.60 fof(f59,plain,( 41.17/8.60 ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) => implies_3), 41.17/8.60 inference(unused_predicate_definition_removal,[],[f26])). 41.17/8.60 41.17/8.60 fof(f75,plain,( 41.17/8.60 implies_3 | ? [X0,X1,X2] : ~is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))), 41.17/8.60 inference(ennf_transformation,[],[f59])). 41.17/8.60 41.17/8.60 fof(f81,plain,( 41.17/8.60 ? [X0,X1,X2] : ~is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) => ~is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2))))), 41.17/8.60 introduced(choice_axiom,[])). 41.17/8.60 41.17/8.60 fof(f82,plain,( 41.17/8.60 implies_3 | ~is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2))))), 41.17/8.60 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f75,f81])). 41.17/8.60 41.17/8.60 fof(f90,plain,( 41.17/8.60 implies_3 | ~is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2))))), 41.17/8.60 inference(cnf_transformation,[],[f82])). 41.17/8.60 41.17/8.60 fof(f42,conjecture,( 41.17/8.60 implies_3), 41.17/8.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_3)). 41.17/8.60 41.17/8.60 fof(f43,negated_conjecture,( 41.17/8.60 ~implies_3), 41.17/8.60 inference(negated_conjecture,[],[f42])). 41.17/8.60 41.17/8.60 fof(f58,plain,( 41.17/8.60 ~implies_3), 41.17/8.60 inference(flattening,[],[f43])). 41.17/8.60 41.17/8.60 fof(f106,plain,( 41.17/8.60 ~implies_3), 41.17/8.60 inference(cnf_transformation,[],[f58])). 41.17/8.60 41.17/8.60 fof(f28,axiom,( 41.17/8.60 op_implies_or => ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)), 41.17/8.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_or)). 41.17/8.60 41.17/8.60 fof(f77,plain,( 41.17/8.60 ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) | ~op_implies_or), 41.17/8.60 inference(ennf_transformation,[],[f28])). 41.17/8.60 41.17/8.60 fof(f92,plain,( 41.17/8.60 ( ! [X0,X1] : (implies(X0,X1) = or(not(X0),X1) | ~op_implies_or) )), 41.17/8.60 inference(cnf_transformation,[],[f77])). 41.17/8.60 41.17/8.60 fof(f34,axiom,( 41.17/8.60 op_implies_or), 41.17/8.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or)). 41.17/8.60 41.17/8.60 fof(f98,plain,( 41.17/8.60 op_implies_or), 41.17/8.60 inference(cnf_transformation,[],[f34])). 41.17/8.60 41.17/8.60 fof(f14,axiom,( 41.17/8.60 ! [X3,X4,X5] : is_a_theorem(implies(implies(X4,X5),implies(or(X3,X4),or(X3,X5)))) <=> r5), 41.17/8.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',r5)). 41.17/8.60 41.17/8.60 fof(f51,plain,( 41.17/8.60 ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) <=> r5), 41.17/8.60 inference(rectify,[],[f14])). 41.17/8.60 41.17/8.60 fof(f65,plain,( 41.17/8.60 r5 => ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))), 41.17/8.60 inference(unused_predicate_definition_removal,[],[f51])). 41.17/8.60 41.17/8.60 fof(f68,plain,( 41.17/8.60 ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) | ~r5), 41.17/8.60 inference(ennf_transformation,[],[f65])). 41.17/8.60 41.17/8.60 fof(f84,plain,( 41.17/8.60 ( ! [X2,X0,X1] : (is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) | ~r5) )), 41.17/8.60 inference(cnf_transformation,[],[f68])). 41.17/8.60 41.17/8.60 fof(f39,axiom,( 41.17/8.60 r5), 41.17/8.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r5)). 41.17/8.60 41.17/8.60 fof(f103,plain,( 41.17/8.60 r5), 41.17/8.60 inference(cnf_transformation,[],[f39])). 41.17/8.60 41.17/8.60 fof(f21,axiom,( 41.17/8.60 r4 <=> ! [X3,X4,X5] : is_a_theorem(implies(or(X3,or(X4,X5)),or(X4,or(X3,X5))))), 41.17/8.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',r4)). 41.17/8.60 41.17/8.60 fof(f56,plain,( 41.17/8.60 r4 <=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))), 41.17/8.60 inference(rectify,[],[f21])). 41.17/8.60 41.17/8.60 fof(f61,plain,( 41.17/8.60 r4 => ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))), 41.17/8.60 inference(unused_predicate_definition_removal,[],[f56])). 41.17/8.60 41.17/8.60 fof(f72,plain,( 41.17/8.60 ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) | ~r4), 41.17/8.60 inference(ennf_transformation,[],[f61])). 41.17/8.60 41.17/8.60 fof(f88,plain,( 41.17/8.60 ( ! [X2,X0,X1] : (is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) | ~r4) )), 41.17/8.60 inference(cnf_transformation,[],[f72])). 41.17/8.60 41.17/8.60 fof(f32,axiom,( 41.17/8.60 r4), 41.17/8.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r4)). 41.17/8.60 41.17/8.60 fof(f96,plain,( 41.17/8.60 r4), 41.17/8.60 inference(cnf_transformation,[],[f32])). 41.17/8.60 41.17/8.60 fof(f24,axiom,( 41.17/8.60 modus_ponens <=> ! [X0,X1] : ((is_a_theorem(implies(X0,X1)) & is_a_theorem(X0)) => is_a_theorem(X1))), 41.17/8.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens)). 41.17/8.60 41.17/8.60 fof(f60,plain,( 41.17/8.60 modus_ponens => ! [X0,X1] : ((is_a_theorem(implies(X0,X1)) & is_a_theorem(X0)) => is_a_theorem(X1))), 41.17/8.60 inference(unused_predicate_definition_removal,[],[f24])). 41.17/8.60 41.17/8.60 fof(f73,plain,( 41.17/8.60 ! [X0,X1] : (is_a_theorem(X1) | (~is_a_theorem(implies(X0,X1)) | ~is_a_theorem(X0))) | ~modus_ponens), 41.17/8.60 inference(ennf_transformation,[],[f60])). 41.17/8.60 41.17/8.60 fof(f74,plain,( 41.17/8.60 ! [X0,X1] : (is_a_theorem(X1) | ~is_a_theorem(implies(X0,X1)) | ~is_a_theorem(X0)) | ~modus_ponens), 41.17/8.60 inference(flattening,[],[f73])). 41.17/8.60 41.17/8.60 fof(f89,plain,( 41.17/8.60 ( ! [X0,X1] : (is_a_theorem(X1) | ~is_a_theorem(implies(X0,X1)) | ~is_a_theorem(X0) | ~modus_ponens) )), 41.17/8.60 inference(cnf_transformation,[],[f74])). 41.17/8.60 41.17/8.60 fof(f35,axiom,( 41.17/8.60 modus_ponens), 41.17/8.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_modus_ponens)). 41.17/8.60 41.17/8.60 fof(f99,plain,( 41.17/8.60 modus_ponens), 41.17/8.60 inference(cnf_transformation,[],[f35])). 41.17/8.60 41.17/8.60 cnf(c_56,plain, 41.17/8.60 ( ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) 41.17/8.60 | implies_3 ), 41.17/8.60 inference(cnf_transformation,[],[f90]) ). 41.17/8.60 41.17/8.60 cnf(c_72,negated_conjecture, 41.17/8.60 ( ~ implies_3 ), 41.17/8.60 inference(cnf_transformation,[],[f106]) ). 41.17/8.60 41.17/8.60 cnf(c_102,plain, 41.17/8.60 ( ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) ), 41.17/8.60 inference(global_propositional_subsumption,[status(thm)],[c_56,c_72]) ). 41.17/8.60 41.17/8.60 cnf(c_58,plain, 41.17/8.60 ( ~ op_implies_or | or(not(X0),X1) = implies(X0,X1) ), 41.17/8.60 inference(cnf_transformation,[],[f92]) ). 41.17/8.60 41.17/8.60 cnf(c_64,plain,( op_implies_or ),inference(cnf_transformation,[],[f98]) ). 41.17/8.60 41.17/8.60 cnf(c_96,plain, 41.17/8.60 ( or(not(X0),X1) = implies(X0,X1) ), 41.17/8.60 inference(global_propositional_subsumption,[status(thm)],[c_58,c_64]) ). 41.17/8.60 41.17/8.60 cnf(c_50,plain, 41.17/8.60 ( ~ r5 41.17/8.60 | is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) ), 41.17/8.60 inference(cnf_transformation,[],[f84]) ). 41.17/8.60 41.17/8.60 cnf(c_69,plain,( r5 ),inference(cnf_transformation,[],[f103]) ). 41.17/8.60 41.17/8.60 cnf(c_118,plain, 41.17/8.60 ( is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) ), 41.17/8.60 inference(global_propositional_subsumption,[status(thm)],[c_50,c_69]) ). 41.17/8.60 41.17/8.60 cnf(c_23611,plain, 41.17/8.60 ( is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),or(not(X2),X1)))) ), 41.17/8.60 inference(superposition,[status(thm)],[c_96,c_118]) ). 41.17/8.60 41.17/8.60 cnf(c_23719,plain, 41.17/8.60 ( is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))) ), 41.17/8.60 inference(demodulation,[status(thm)],[c_23611,c_96]) ). 41.17/8.60 41.17/8.60 cnf(c_54,plain, 41.17/8.60 ( ~ r4 | is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ), 41.17/8.60 inference(cnf_transformation,[],[f88]) ). 41.17/8.60 41.17/8.60 cnf(c_62,plain,( r4 ),inference(cnf_transformation,[],[f96]) ). 41.17/8.60 41.17/8.60 cnf(c_106,plain, 41.17/8.60 ( is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ), 41.17/8.60 inference(global_propositional_subsumption,[status(thm)],[c_54,c_62]) ). 41.17/8.60 41.17/8.60 cnf(c_23595,plain, 41.17/8.60 ( is_a_theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))) ), 41.17/8.60 inference(superposition,[status(thm)],[c_96,c_106]) ). 41.17/8.60 41.17/8.60 cnf(c_23619,plain, 41.17/8.60 ( is_a_theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))) ), 41.17/8.60 inference(demodulation,[status(thm)],[c_23595,c_96]) ). 41.17/8.60 41.17/8.60 cnf(c_23623,plain, 41.17/8.60 ( is_a_theorem(implies(implies(X0,implies(X1,X2)),or(not(X1),implies(X0,X2)))) ), 41.17/8.60 inference(superposition,[status(thm)],[c_96,c_23619]) ). 41.17/8.60 41.17/8.60 cnf(c_23819,plain, 41.17/8.60 ( is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))) ), 41.17/8.60 inference(demodulation,[status(thm)],[c_23623,c_96]) ). 41.17/8.60 41.17/8.60 cnf(c_55,plain, 41.17/8.60 ( ~ is_a_theorem(implies(X0,X1)) 41.17/8.60 | ~ is_a_theorem(X0) 41.17/8.60 | ~ modus_ponens 41.17/8.60 | is_a_theorem(X1) ), 41.17/8.60 inference(cnf_transformation,[],[f89]) ). 41.17/8.60 41.17/8.60 cnf(c_65,plain,( modus_ponens ),inference(cnf_transformation,[],[f99]) ). 41.17/8.60 41.17/8.60 cnf(c_104,plain, 41.17/8.60 ( ~ is_a_theorem(X0) 41.17/8.60 | ~ is_a_theorem(implies(X0,X1)) 41.17/8.60 | is_a_theorem(X1) ), 41.17/8.60 inference(global_propositional_subsumption,[status(thm)],[c_55,c_65]) ). 41.17/8.60 41.17/8.60 cnf(c_105,plain, 41.17/8.60 ( ~ is_a_theorem(implies(X0,X1)) 41.17/8.60 | ~ is_a_theorem(X0) 41.17/8.60 | is_a_theorem(X1) ), 41.17/8.60 inference(renaming,[status(thm)],[c_104]) ). 41.17/8.60 41.17/8.60 cnf(c_23832,plain, 41.17/8.60 ( ~ is_a_theorem(implies(X0,implies(X1,X2))) 41.17/8.60 | is_a_theorem(implies(X1,implies(X0,X2))) ), 41.17/8.60 inference(superposition,[status(thm)],[c_23819,c_105]) ). 41.17/8.60 41.17/8.60 cnf(c_48969,plain, 41.17/8.60 ( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ), 41.17/8.60 inference(superposition,[status(thm)],[c_23719,c_23832]) ). 41.17/8.60 41.17/8.60 cnf(c_49001,plain, 41.17/8.60 ( $false ), 41.17/8.60 inference(backward_subsumption_resolution,[status(thm)],[c_102,c_48969]) ). 41.17/8.60 41.17/8.60 41.17/8.60 % SZS output end CNFRefutation for theBenchmark.p 41.17/8.60 41.17/8.60 ------ Statistics 41.17/8.60 41.17/8.60 ------ Selected 41.17/8.60 41.17/8.60 total_time: 2.678 41.17/8.60 41.17/8.62 EOF