0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : iproveropt_run.sh %d %s 0.02/0.23 % Computer : n180.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 04:58:57 CDT 2018 0.02/0.23 % CPUTime : 0.02/0.24 0.02/0.24 %---------------- iProver v2.8 (CASC-J9) ----------------% 0.02/0.24 0.06/0.25 warning: prop_lit_to_fof_flag: true 0.06/0.25 warning: use_rec_defs_flag: true 0.06/0.25 warning: def_merge_tr_red_non_prop_flag: true 0.06/0.25 warning: finite_models commented: preprocess_after_flattening 0.06/0.25 warning: pred_elim_qbf: true 0.06/0.25 warning: dbg_qbf_res_prep_flag: true 0.06/0.25 0.06/0.25 ------ iProver source info 0.06/0.25 0.06/0.25 git: date: 2018-07-06 14:03:16 +0100 0.06/0.25 git: sha1: a23ae0111c2c203083e5922e8bb09a201cc5ec4f 0.06/0.25 git: non_committed_changes: false 0.06/0.25 git: last_make_outside_of_git: false 0.06/0.25 0.06/0.25 0.06/0.25 ------ Parsing... 0.06/0.25 ------ Clausification by vclausify_rel & Parsing by iProver... 0.06/0.25 0.06/0.26 0.06/0.26 0.06/0.26 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e 0.06/0.27 0.06/0.27 ------ Preprocessing... scvd_s sp: 38 0s scvd_e snvd_s sp: 0 0s snvd_e 0.06/0.28 ------ Proving... 0.06/0.28 ------ Problem Properties 0.06/0.28 0.06/0.28 0.06/0.28 clauses 130 0.06/0.28 conjectures 0 0.06/0.28 EPR 74 0.06/0.28 Horn 96 0.06/0.28 unary 15 0.06/0.28 binary 79 0.06/0.28 lits 296 0.06/0.28 lits eq 0 0.06/0.28 0.06/0.28 ------ Schedule dynamic 5 is on 0.06/0.28 0.06/0.28 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 0.06/0.28 0.06/0.28 0.06/0.28 ------ Current options: 0.06/0.28 0.06/0.28 0.06/0.28 0.06/0.28 0.06/0.28 0.06/0.28 ------ Proving... 0.06/0.30 0.06/0.30 0.06/0.30 % SZS status Theorem 0.06/0.30 0.06/0.30 0.06/0.30 % SZS output start CNFRefutation 0.06/0.30 0.06/0.31 fof(f19,axiom,( 0.06/0.31 ! [X0,X1] : (status(X0,X1,eqv) <=> (? [X3] : model(X3,X0) & ! [X2] : (model(X2,X0) <=> model(X2,X1))))), 0.06/0.31 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 0.06/0.31 0.06/0.31 fof(f48,plain,( 0.06/0.31 ! [X0,X1] : (status(X0,X1,eqv) <=> (? [X2] : model(X2,X0) & ! [X3] : (model(X3,X0) <=> model(X3,X1))))), 0.06/0.31 inference(rectify,[],[f19])). 0.06/0.31 0.06/0.31 fof(f180,plain,( 0.06/0.31 ! [X0,X1] : ((status(X0,X1,eqv) | (! [X2] : ~model(X2,X0) | ? [X3] : ((~model(X3,X1) | ~model(X3,X0)) & (model(X3,X1) | model(X3,X0))))) & ((? [X2] : model(X2,X0) & ! [X3] : ((model(X3,X0) | ~model(X3,X1)) & (model(X3,X1) | ~model(X3,X0)))) | ~status(X0,X1,eqv)))), 0.06/0.31 inference(nnf_transformation,[],[f48])). 0.06/0.31 0.06/0.31 fof(f181,plain,( 0.06/0.31 ! [X0,X1] : ((status(X0,X1,eqv) | ! [X2] : ~model(X2,X0) | ? [X3] : ((~model(X3,X1) | ~model(X3,X0)) & (model(X3,X1) | model(X3,X0)))) & ((? [X2] : model(X2,X0) & ! [X3] : ((model(X3,X0) | ~model(X3,X1)) & (model(X3,X1) | ~model(X3,X0)))) | ~status(X0,X1,eqv)))), 0.06/0.31 inference(flattening,[],[f180])). 0.06/0.31 0.06/0.31 fof(f182,plain,( 0.06/0.31 ! [X0,X1] : ((status(X0,X1,eqv) | ! [X2] : ~model(X2,X0) | ? [X3] : ((~model(X3,X1) | ~model(X3,X0)) & (model(X3,X1) | model(X3,X0)))) & ((? [X4] : model(X4,X0) & ! [X5] : ((model(X5,X0) | ~model(X5,X1)) & (model(X5,X1) | ~model(X5,X0)))) | ~status(X0,X1,eqv)))), 0.06/0.31 inference(rectify,[],[f181])). 0.06/0.31 0.06/0.31 fof(f184,plain,( 0.06/0.31 ! [X0] : (? [X4] : model(X4,X0) => model(sK40(X0),X0))), 0.06/0.31 introduced(choice_axiom,[])). 0.06/0.31 0.06/0.31 fof(f183,plain,( 0.06/0.31 ! [X1,X0] : (? [X3] : ((~model(X3,X1) | ~model(X3,X0)) & (model(X3,X1) | model(X3,X0))) => ((~model(sK39(X0,X1),X1) | ~model(sK39(X0,X1),X0)) & (model(sK39(X0,X1),X1) | model(sK39(X0,X1),X0))))), 0.06/0.31 introduced(choice_axiom,[])). 0.06/0.31 0.06/0.31 fof(f185,plain,( 0.06/0.31 ! [X0,X1] : ((status(X0,X1,eqv) | ! [X2] : ~model(X2,X0) | ((~model(sK39(X0,X1),X1) | ~model(sK39(X0,X1),X0)) & (model(sK39(X0,X1),X1) | model(sK39(X0,X1),X0)))) & ((model(sK40(X0),X0) & ! [X5] : ((model(X5,X0) | ~model(X5,X1)) & (model(X5,X1) | ~model(X5,X0)))) | ~status(X0,X1,eqv)))), 0.06/0.31 inference(skolemisation,[status(esa),new_symbols(skolem,[sK39,sK40])],[f182,f184,f183])). 0.06/0.31 0.06/0.31 fof(f278,plain,( 0.06/0.31 ( ! [X0,X5,X1] : (model(X5,X1) | ~model(X5,X0) | ~status(X0,X1,eqv)) )), 0.06/0.31 inference(cnf_transformation,[],[f185])). 0.06/0.31 0.06/0.31 fof(f5,axiom,( 0.06/0.31 ! [X0,X1] : (! [X3] : (model(X3,X0) => model(X3,X1)) <=> status(X0,X1,thm))), 0.06/0.31 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 0.06/0.31 0.06/0.31 fof(f38,plain,( 0.06/0.31 ! [X0,X1] : (! [X2] : (model(X2,X0) => model(X2,X1)) <=> status(X0,X1,thm))), 0.06/0.31 inference(rectify,[],[f5])). 0.06/0.31 0.06/0.31 fof(f66,plain,( 0.06/0.31 ! [X0,X1] : (! [X2] : (model(X2,X1) | ~model(X2,X0)) <=> status(X0,X1,thm))), 0.06/0.31 inference(ennf_transformation,[],[f38])). 0.06/0.31 0.06/0.31 fof(f101,plain,( 0.06/0.31 ! [X0,X1] : ((! [X2] : (model(X2,X1) | ~model(X2,X0)) | ~status(X0,X1,thm)) & (status(X0,X1,thm) | ? [X2] : (~model(X2,X1) & model(X2,X0))))), 0.06/0.31 inference(nnf_transformation,[],[f66])). 0.06/0.31 0.06/0.31 fof(f102,plain,( 0.06/0.31 ! [X0,X1] : ((! [X2] : (model(X2,X1) | ~model(X2,X0)) | ~status(X0,X1,thm)) & (status(X0,X1,thm) | ? [X3] : (~model(X3,X1) & model(X3,X0))))), 0.06/0.31 inference(rectify,[],[f101])). 0.06/0.31 0.06/0.31 fof(f103,plain,( 0.06/0.31 ! [X1,X0] : (? [X3] : (~model(X3,X1) & model(X3,X0)) => (~model(sK11(X0,X1),X1) & model(sK11(X0,X1),X0)))), 0.06/0.31 introduced(choice_axiom,[])). 0.06/0.31 0.06/0.31 fof(f104,plain,( 0.06/0.31 ! [X0,X1] : ((! [X2] : (model(X2,X1) | ~model(X2,X0)) | ~status(X0,X1,thm)) & (status(X0,X1,thm) | (~model(sK11(X0,X1),X1) & model(sK11(X0,X1),X0))))), 0.06/0.31 inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f102,f103])). 0.06/0.31 0.06/0.31 fof(f225,plain,( 0.06/0.31 ( ! [X0,X1] : (status(X0,X1,thm) | ~model(sK11(X0,X1),X1)) )), 0.06/0.31 inference(cnf_transformation,[],[f104])). 0.06/0.31 0.06/0.31 fof(f224,plain,( 0.06/0.31 ( ! [X0,X1] : (status(X0,X1,thm) | model(sK11(X0,X1),X0)) )), 0.06/0.31 inference(cnf_transformation,[],[f104])). 0.06/0.31 0.06/0.31 fof(f24,axiom,( 0.06/0.31 ! [X6,X7] : (isa(X6,X7) <=> ! [X0,X1] : (status(X0,X1,X6) => status(X0,X1,X7)))), 0.06/0.31 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 0.06/0.31 0.06/0.31 fof(f53,plain,( 0.06/0.31 ! [X0,X1] : (isa(X0,X1) <=> ! [X2,X3] : (status(X2,X3,X0) => status(X2,X3,X1)))), 0.06/0.31 inference(rectify,[],[f24])). 0.06/0.31 0.06/0.31 fof(f63,plain,( 0.06/0.31 ! [X0,X1] : (! [X2,X3] : (status(X2,X3,X0) => status(X2,X3,X1)) => isa(X0,X1))), 0.06/0.31 inference(unused_predicate_definition_removal,[],[f53])). 0.06/0.31 0.06/0.31 fof(f73,plain,( 0.06/0.31 ! [X0,X1] : (isa(X0,X1) | ? [X2,X3] : (~status(X2,X3,X1) & status(X2,X3,X0)))), 0.06/0.31 inference(ennf_transformation,[],[f63])). 0.06/0.31 0.06/0.31 fof(f193,plain,( 0.06/0.31 ! [X1,X0] : (? [X2,X3] : (~status(X2,X3,X1) & status(X2,X3,X0)) => (~status(sK48(X0,X1),sK49(X0,X1),X1) & status(sK48(X0,X1),sK49(X0,X1),X0)))), 0.06/0.31 introduced(choice_axiom,[])). 0.06/0.31 0.06/0.31 fof(f194,plain,( 0.06/0.31 ! [X0,X1] : (isa(X0,X1) | (~status(sK48(X0,X1),sK49(X0,X1),X1) & status(sK48(X0,X1),sK49(X0,X1),X0)))), 0.06/0.31 inference(skolemisation,[status(esa),new_symbols(skolem,[sK48,sK49])],[f73,f193])). 0.06/0.31 0.06/0.31 fof(f289,plain,( 0.06/0.31 ( ! [X0,X1] : (isa(X0,X1) | ~status(sK48(X0,X1),sK49(X0,X1),X1)) )), 0.06/0.31 inference(cnf_transformation,[],[f194])). 0.06/0.31 0.06/0.31 fof(f33,conjecture,( 0.06/0.31 isa(eqv,thm)), 0.06/0.31 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 0.06/0.31 0.06/0.31 fof(f34,negated_conjecture,( 0.06/0.31 ~isa(eqv,thm)), 0.06/0.31 inference(negated_conjecture,[],[f33])). 0.06/0.31 0.06/0.31 fof(f62,plain,( 0.06/0.31 ~isa(eqv,thm)), 0.06/0.31 inference(flattening,[],[f34])). 0.06/0.31 0.06/0.31 fof(f304,plain,( 0.06/0.31 ~isa(eqv,thm)), 0.06/0.31 inference(cnf_transformation,[],[f62])). 0.06/0.31 0.06/0.31 fof(f288,plain,( 0.06/0.31 ( ! [X0,X1] : (isa(X0,X1) | status(sK48(X0,X1),sK49(X0,X1),X0)) )), 0.06/0.31 inference(cnf_transformation,[],[f194])). 0.06/0.31 0.06/0.31 cnf(c_72,plain, 0.06/0.31 ( ~ status(X0,X1,eqv) | ~ model(X2,X0) | model(X2,X1) ), 0.06/0.31 inference(cnf_transformation,[],[f278]) ). 0.06/0.31 0.06/0.31 cnf(c_184,plain, 0.06/0.31 ( ~ status(X0,X1,eqv) | ~ model(X0,X0) | model(X0,X1) ), 0.06/0.31 inference(subtyping,[status(esa)],[c_72]) ). 0.06/0.31 0.06/0.31 cnf(c_795,plain, 0.06/0.31 ( ~ status(X0,sK49(eqv,thm),eqv) 0.06/0.31 | ~ model(sK11(sK48(eqv,thm),sK49(eqv,thm)),X0) 0.06/0.31 | model(sK11(sK48(eqv,thm),sK49(eqv,thm)),sK49(eqv,thm)) ), 0.06/0.31 inference(instantiation,[status(thm)],[c_184]) ). 0.06/0.31 0.06/0.31 cnf(c_1147,plain, 0.06/0.31 ( ~ status(sK48(eqv,thm),sK49(eqv,thm),eqv) 0.06/0.31 | model(sK11(sK48(eqv,thm),sK49(eqv,thm)),sK49(eqv,thm)) 0.06/0.31 | ~ model(sK11(sK48(eqv,thm),sK49(eqv,thm)),sK48(eqv,thm)) ), 0.06/0.31 inference(instantiation,[status(thm)],[c_795]) ). 0.06/0.31 0.06/0.31 cnf(c_15,plain, 0.06/0.31 ( status(X0,X1,thm) | ~ model(sK11(X0,X1),X1) ), 0.06/0.31 inference(cnf_transformation,[],[f225]) ). 0.06/0.31 0.06/0.31 cnf(c_241,plain, 0.06/0.31 ( status(X0,X1,thm) | ~ model(sK11(X0,X1),X1) ), 0.06/0.31 inference(subtyping,[status(esa)],[c_15]) ). 0.06/0.31 0.06/0.31 cnf(c_505,plain, 0.06/0.31 ( status(sK48(eqv,thm),sK49(eqv,thm),thm) 0.06/0.31 | ~ model(sK11(sK48(eqv,thm),sK49(eqv,thm)),sK49(eqv,thm)) ), 0.06/0.31 inference(instantiation,[status(thm)],[c_241]) ). 0.06/0.31 0.06/0.31 cnf(c_16,plain, 0.06/0.31 ( status(X0,X1,thm) | model(sK11(X0,X1),X0) ), 0.06/0.31 inference(cnf_transformation,[],[f224]) ). 0.06/0.31 0.06/0.31 cnf(c_240,plain, 0.06/0.31 ( status(X0,X1,thm) | model(sK11(X0,X1),X0) ), 0.06/0.31 inference(subtyping,[status(esa)],[c_16]) ). 0.06/0.31 0.06/0.31 cnf(c_504,plain, 0.06/0.31 ( status(sK48(eqv,thm),sK49(eqv,thm),thm) 0.06/0.31 | model(sK11(sK48(eqv,thm),sK49(eqv,thm)),sK48(eqv,thm)) ), 0.06/0.31 inference(instantiation,[status(thm)],[c_240]) ). 0.06/0.31 0.06/0.31 cnf(c_78,plain, 0.06/0.31 ( ~ status(sK48(X0,X1),sK49(X0,X1),X1) | isa(X0,X1) ), 0.06/0.31 inference(cnf_transformation,[],[f289]) ). 0.06/0.31 0.06/0.31 cnf(c_94,negated_conjecture, 0.06/0.31 ( ~ isa(eqv,thm) ), 0.06/0.31 inference(cnf_transformation,[],[f304]) ). 0.06/0.31 0.06/0.31 cnf(c_159,plain, 0.06/0.31 ( ~ status(sK48(eqv,thm),sK49(eqv,thm),thm) ), 0.06/0.31 inference(resolution,[status(thm)],[c_78,c_94]) ). 0.06/0.31 0.06/0.31 cnf(c_79,plain, 0.06/0.31 ( status(sK48(X0,X1),sK49(X0,X1),X0) | isa(X0,X1) ), 0.06/0.31 inference(cnf_transformation,[],[f288]) ). 0.06/0.31 0.06/0.31 cnf(c_155,plain, 0.06/0.31 ( status(sK48(eqv,thm),sK49(eqv,thm),eqv) ), 0.06/0.31 inference(resolution,[status(thm)],[c_79,c_94]) ). 0.06/0.31 0.06/0.31 cnf(contradiction,plain, 0.06/0.31 ( $false ), 0.06/0.31 inference(minisat,[status(thm)],[c_1147,c_505,c_504,c_159,c_155]) ). 0.06/0.31 0.06/0.31 0.06/0.31 % SZS output end CNFRefutation 0.06/0.31 0.06/0.31 ------ Statistics 0.06/0.31 0.06/0.31 ------ General 0.06/0.31 0.06/0.31 abstr_arg_filter_cycles: 0 0.06/0.31 gc_basic_clause_elim: 0 0.06/0.31 forced_gc_time: 0 0.06/0.31 parsing_time: 0.005 0.06/0.31 unif_index_cands_time: 0. 0.06/0.31 unif_index_add_time: 0. 0.06/0.31 out_proof_time: 0.008 0.06/0.31 total_time: 0.072 0.06/0.31 num_of_symbols: 125 0.06/0.31 num_of_terms: 2183 0.06/0.31 0.06/0.31 ------ Preprocessing 0.06/0.31 0.06/0.31 num_of_splits: 38 0.06/0.31 num_of_split_atoms: 10 0.06/0.31 num_of_reused_defs: 28 0.06/0.31 num_eq_ax_congr_red: 0 0.06/0.31 num_of_sem_filtered_clauses: 0 0.06/0.31 num_of_subtypes: 3 0.06/0.31 monotx_restored_types: 0 0.06/0.31 sat_num_of_epr_types: 0 0.06/0.31 sat_num_of_non_cyclic_types: 0 0.06/0.31 sat_guarded_non_collapsed_types: 0 0.06/0.31 num_pure_diseq_elim: 0 0.06/0.31 simp_replaced_by: 0 0.06/0.31 res_preprocessed: 185 0.06/0.31 prep_upred: 0 0.06/0.31 prep_unflattend: 0 0.06/0.31 pred_elim_cands: 2 0.06/0.31 pred_elim: 1 0.06/0.31 pred_elim_cl: 1 0.06/0.31 pred_elim_cycles: 3 0.06/0.31 merged_defs: 0 0.06/0.31 merged_defs_ncl: 0 0.06/0.31 prep_cycles: 2 0.06/0.31 pred_elim_time: 0.002 0.06/0.31 splitting_time: 0.002 0.06/0.31 sem_filter_time: 0.002 0.06/0.31 monotx_time: 0. 0.06/0.31 subtype_inf_time: 0.001 0.06/0.31 0.06/0.31 ------ Problem properties 0.06/0.31 0.06/0.31 clauses: 130 0.06/0.31 conjectures: 0 0.06/0.31 epr: 74 0.06/0.31 horn: 96 0.06/0.31 unary: 15 0.06/0.31 binary: 79 0.06/0.31 lits: 296 0.06/0.31 lits_eq: 0 0.06/0.31 0.06/0.31 ------ Propositional Solver 0.06/0.31 0.06/0.31 prop_solver_calls: 14 0.06/0.31 prop_fast_solver_calls: 892 0.06/0.31 prop_num_of_clauses: 831 0.06/0.31 prop_preprocess_simplified: 4051 0.06/0.31 prop_fo_subsumed: 0 0.06/0.31 prop_solver_time: 0. 0.06/0.31 prop_fast_solver_time: 0. 0.06/0.31 prop_unsat_core_time: 0. 0.06/0.31 0.06/0.31 ------ QBF 0.06/0.31 0.06/0.31 qbf_q_res: 0 0.06/0.31 qbf_num_tautologies: 0 0.06/0.31 qbf_prep_cycles: 0 0.06/0.31 0.06/0.31 ------ BMC1 0.06/0.31 0.06/0.31 bmc1_current_bound: -1 0.06/0.31 bmc1_last_solved_bound: -1 0.06/0.31 bmc1_unsat_core_size: -1 0.06/0.31 bmc1_unsat_core_parents_size: -1 0.06/0.31 bmc1_merge_next_fun: 0 0.06/0.31 bmc1_unsat_core_clauses_time: 0. 0.06/0.31 0.06/0.31 ------ Instantiation 0.06/0.31 0.06/0.31 inst_num_of_clauses: 421 0.06/0.31 inst_num_in_passive: 271 0.06/0.31 inst_num_in_active: 142 0.06/0.31 inst_num_in_unprocessed: 7 0.06/0.31 inst_num_of_loops: 174 0.06/0.31 inst_num_of_learning_restarts: 0 0.06/0.31 inst_num_moves_active_passive: 31 0.06/0.31 inst_lit_activity: 0 0.06/0.31 inst_lit_activity_moves: 0 0.06/0.31 inst_num_tautologies: 0 0.06/0.31 inst_num_prop_implied: 0 0.06/0.31 inst_num_existing_simplified: 0 0.06/0.31 inst_num_eq_res_simplified: 0 0.06/0.31 inst_num_child_elim: 0 0.06/0.31 inst_num_of_dismatching_blockings: 98 0.06/0.31 inst_num_of_non_proper_insts: 260 0.06/0.31 inst_num_of_duplicates: 18 0.06/0.31 inst_inst_num_from_inst_to_res: 0 0.06/0.31 inst_dismatching_checking_time: 0. 0.06/0.31 0.06/0.31 ------ Resolution 0.06/0.31 0.06/0.31 res_num_of_clauses: 0 0.06/0.31 res_num_in_passive: 0 0.06/0.31 res_num_in_active: 0 0.06/0.31 res_num_of_loops: 187 0.06/0.31 res_forward_subset_subsumed: 0 0.06/0.31 res_backward_subset_subsumed: 0 0.06/0.31 res_forward_subsumed: 0 0.06/0.31 res_backward_subsumed: 0 0.06/0.31 res_forward_subsumption_resolution: 0 0.06/0.31 res_backward_subsumption_resolution: 0 0.06/0.31 res_clause_to_clause_subsumption: 0 0.06/0.31 res_orphan_elimination: 0 0.06/0.31 res_tautology_del: 0 0.06/0.31 res_num_eq_res_simplified: 0 0.06/0.31 res_num_sel_changes: 0 0.06/0.31 res_moves_from_active_to_pass: 0 0.06/0.31 0.06/0.32 USED TIME: 0.06 CPU 0.08 WC 0.06/0.33 EOF