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.03/0.24 % Computer : n118.star.cs.uiowa.edu 0.03/0.24 % Model : x86_64 x86_64 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.24 % Memory : 32218.625MB 0.03/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.24 % CPULimit : 300 0.03/0.24 % DateTime : Sat Jul 14 04:24:26 CDT 2018 0.03/0.24 % CPUTime : 0.03/0.25 0.03/0.25 %---------------- iProver v2.8 (CASC-J9) ----------------% 0.03/0.25 0.03/0.26 warning: prop_lit_to_fof_flag: true 0.03/0.26 warning: use_rec_defs_flag: true 0.03/0.26 warning: def_merge_tr_red_non_prop_flag: true 0.03/0.26 warning: finite_models commented: preprocess_after_flattening 0.03/0.26 warning: pred_elim_qbf: true 0.03/0.26 warning: dbg_qbf_res_prep_flag: true 0.03/0.26 0.03/0.26 ------ iProver source info 0.03/0.26 0.03/0.26 git: date: 2018-07-06 14:03:16 +0100 0.03/0.26 git: sha1: a23ae0111c2c203083e5922e8bb09a201cc5ec4f 0.03/0.26 git: non_committed_changes: false 0.03/0.26 git: last_make_outside_of_git: false 0.03/0.26 0.03/0.26 0.03/0.26 ------ Parsing... 0.03/0.26 ------ Clausification by vclausify_rel & Parsing by iProver... 0.03/0.26 0.03/0.27 0.03/0.27 0.03/0.27 ------ Preprocessing... sf_s rm: 2 0s sf_e pe_s pe_e sf_s rm: 1 0s sf_e pe_s pe_e 0.06/0.30 0.06/0.30 ------ Preprocessing... scvd_s sp: 18 0s scvd_e snvd_s sp: 0 0s snvd_e 0.06/0.30 0.06/0.30 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e 0.06/0.32 ------ Proving... 0.06/0.32 ------ Problem Properties 0.06/0.32 0.06/0.32 0.06/0.32 clauses 91 0.06/0.32 conjectures 2 0.06/0.32 EPR 46 0.06/0.32 Horn 64 0.06/0.32 unary 9 0.06/0.32 binary 29 0.06/0.32 lits 267 0.06/0.32 lits eq 91 0.06/0.32 0.06/0.32 ------ Schedule dynamic 5 is on 0.06/0.32 0.06/0.32 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10. 0.06/0.32 0.06/0.32 0.06/0.32 ------ Current options: 0.06/0.32 0.06/0.32 0.06/0.32 0.06/0.32 0.06/0.32 0.06/0.32 ------ Proving... 10.11/10.33 Time Out after: 10980 full_loop iterations 10.11/10.33 10.11/10.33 ------ Input Options"--res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 25. 10.11/10.33 10.11/10.33 10.11/10.33 ------ Current options: 10.11/10.33 10.11/10.33 10.11/10.33 10.11/10.33 10.11/10.33 10.11/10.33 ------ Proving... 10.11/10.33 10.11/10.33 10.11/10.33 % SZS status Theorem 10.11/10.33 10.11/10.33 10.11/10.33 % SZS output start CNFRefutation 10.11/10.33 10.11/10.34 fof(f4,axiom,( 10.11/10.34 ! [X0,X1,X5,X6,X2] : ((precedes(X5,X6,X2) & shortest_path(X0,X1,X2)) => (~? [X7] : (tail_of(X5) = tail_of(X7) & head_of(X6) = head_of(X7)) & ~precedes(X6,X5,X2)))), 10.11/10.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 10.11/10.34 10.11/10.34 fof(f23,plain,( 10.11/10.34 ! [X0,X1,X2,X3,X4] : ((precedes(X2,X3,X4) & shortest_path(X0,X1,X4)) => (~? [X5] : (tail_of(X2) = tail_of(X5) & head_of(X3) = head_of(X5)) & ~precedes(X3,X2,X4)))), 10.11/10.34 inference(rectify,[],[f4])). 10.11/10.34 10.11/10.34 fof(f42,plain,( 10.11/10.34 ! [X0,X1,X2,X3,X4] : ((! [X5] : (tail_of(X2) != tail_of(X5) | head_of(X3) != head_of(X5)) & ~precedes(X3,X2,X4)) | (~precedes(X2,X3,X4) | ~shortest_path(X0,X1,X4)))), 10.11/10.34 inference(ennf_transformation,[],[f23])). 10.11/10.34 10.11/10.34 fof(f43,plain,( 10.11/10.34 ! [X0,X1,X2,X3,X4] : ((! [X5] : (tail_of(X2) != tail_of(X5) | head_of(X3) != head_of(X5)) & ~precedes(X3,X2,X4)) | ~precedes(X2,X3,X4) | ~shortest_path(X0,X1,X4))), 10.11/10.34 inference(flattening,[],[f42])). 10.11/10.34 10.11/10.34 fof(f108,plain,( 10.11/10.34 ( ! [X4,X2,X0,X5,X3,X1] : (tail_of(X2) != tail_of(X5) | head_of(X3) != head_of(X5) | ~precedes(X2,X3,X4) | ~shortest_path(X0,X1,X4)) )), 10.11/10.34 inference(cnf_transformation,[],[f43])). 10.11/10.34 10.11/10.34 fof(f13,conjecture,( 10.11/10.34 complete => ! [X2,X0,X1] : (shortest_path(X0,X1,X2) => less_or_equal(minus(length_of(X2),n1),number_of_in(triangles,graph)))), 10.11/10.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 10.11/10.34 10.11/10.34 fof(f14,negated_conjecture,( 10.11/10.34 ~(complete => ! [X2,X0,X1] : (shortest_path(X0,X1,X2) => less_or_equal(minus(length_of(X2),n1),number_of_in(triangles,graph))))), 10.11/10.34 inference(negated_conjecture,[],[f13])). 10.11/10.34 10.11/10.34 fof(f32,plain,( 10.11/10.34 ~(complete => ! [X0,X1,X2] : (shortest_path(X1,X2,X0) => less_or_equal(minus(length_of(X0),n1),number_of_in(triangles,graph))))), 10.11/10.34 inference(rectify,[],[f14])). 10.11/10.34 10.11/10.34 fof(f54,plain,( 10.11/10.34 ? [X0,X1,X2] : (~less_or_equal(minus(length_of(X0),n1),number_of_in(triangles,graph)) & shortest_path(X1,X2,X0)) & complete), 10.11/10.34 inference(ennf_transformation,[],[f32])). 10.11/10.34 10.11/10.34 fof(f85,plain,( 10.11/10.34 ? [X0,X1,X2] : (~less_or_equal(minus(length_of(X0),n1),number_of_in(triangles,graph)) & shortest_path(X1,X2,X0)) => (~less_or_equal(minus(length_of(sK6),n1),number_of_in(triangles,graph)) & shortest_path(sK7,sK8,sK6))), 10.11/10.34 introduced(choice_axiom,[])). 10.11/10.34 10.11/10.34 fof(f86,plain,( 10.11/10.34 (~less_or_equal(minus(length_of(sK6),n1),number_of_in(triangles,graph)) & shortest_path(sK7,sK8,sK6)) & complete), 10.11/10.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f54,f85])). 10.11/10.34 10.11/10.34 fof(f139,plain,( 10.11/10.34 shortest_path(sK7,sK8,sK6)), 10.11/10.34 inference(cnf_transformation,[],[f86])). 10.11/10.34 10.11/10.34 fof(f17,axiom,( 10.11/10.34 ! [X2,X0,X1] : ((path(X0,X1,X2) & ! [X5,X6] : ((on_path(X6,X2) & sequential(X5,X6) & on_path(X5,X2)) => ? [X7] : triangle(X5,X6,X7))) => number_of_in(triangles,X2) = number_of_in(sequential_pairs,X2))), 10.11/10.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 10.11/10.34 10.11/10.34 fof(f34,plain,( 10.11/10.34 ! [X0,X1,X2] : ((path(X1,X2,X0) & ! [X3,X4] : ((on_path(X4,X0) & sequential(X3,X4) & on_path(X3,X0)) => ? [X5] : triangle(X3,X4,X5))) => number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0))), 10.11/10.34 inference(rectify,[],[f17])). 10.11/10.34 10.11/10.34 fof(f56,plain,( 10.11/10.34 ! [X0,X1,X2] : (number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) | (~path(X1,X2,X0) | ? [X3,X4] : (! [X5] : ~triangle(X3,X4,X5) & (on_path(X4,X0) & sequential(X3,X4) & on_path(X3,X0)))))), 10.11/10.34 inference(ennf_transformation,[],[f34])). 10.11/10.34 10.11/10.34 fof(f57,plain,( 10.11/10.34 ! [X0,X1,X2] : (number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) | ~path(X1,X2,X0) | ? [X3,X4] : (! [X5] : ~triangle(X3,X4,X5) & on_path(X4,X0) & sequential(X3,X4) & on_path(X3,X0)))), 10.11/10.34 inference(flattening,[],[f56])). 10.11/10.34 10.11/10.34 fof(f89,plain,( 10.11/10.34 ! [X0] : (? [X3,X4] : (! [X5] : ~triangle(X3,X4,X5) & on_path(X4,X0) & sequential(X3,X4) & on_path(X3,X0)) => (! [X5] : ~triangle(sK9(X0),sK10(X0),X5) & on_path(sK10(X0),X0) & sequential(sK9(X0),sK10(X0)) & on_path(sK9(X0),X0)))), 10.11/10.34 introduced(choice_axiom,[])). 10.11/10.34 10.11/10.34 fof(f90,plain,( 10.11/10.34 ! [X0,X1,X2] : (number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) | ~path(X1,X2,X0) | (! [X5] : ~triangle(sK9(X0),sK10(X0),X5) & on_path(sK10(X0),X0) & sequential(sK9(X0),sK10(X0)) & on_path(sK9(X0),X0)))), 10.11/10.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f57,f89])). 10.11/10.34 10.11/10.34 fof(f152,plain,( 10.11/10.34 ( ! [X2,X0,X5,X1] : (number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) | ~path(X1,X2,X0) | ~triangle(sK9(X0),sK10(X0),X5)) )), 10.11/10.34 inference(cnf_transformation,[],[f90])). 10.11/10.34 10.11/10.34 fof(f20,axiom,( 10.11/10.34 ! [X10,X11] : less_or_equal(number_of_in(X10,X11),number_of_in(X10,graph))), 10.11/10.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 10.11/10.34 10.11/10.34 fof(f36,plain,( 10.11/10.34 ! [X0,X1] : less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph))), 10.11/10.34 inference(rectify,[],[f20])). 10.11/10.34 10.11/10.34 fof(f155,plain,( 10.11/10.34 ( ! [X0,X1] : (less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph))) )), 10.11/10.34 inference(cnf_transformation,[],[f36])). 10.11/10.34 10.11/10.34 fof(f18,axiom,( 10.11/10.34 complete => ! [X0,X1,X5,X6,X2] : ((shortest_path(X0,X1,X2) & precedes(X5,X6,X2) & sequential(X5,X6)) => ? [X7] : triangle(X5,X6,X7))), 10.11/10.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 10.11/10.34 10.11/10.34 fof(f35,plain,( 10.11/10.34 complete => ! [X0,X1,X2,X3,X4] : ((shortest_path(X0,X1,X4) & precedes(X2,X3,X4) & sequential(X2,X3)) => ? [X5] : triangle(X2,X3,X5))), 10.11/10.34 inference(rectify,[],[f18])). 10.11/10.34 10.11/10.34 fof(f58,plain,( 10.11/10.34 ! [X0,X1,X2,X3,X4] : (? [X5] : triangle(X2,X3,X5) | (~shortest_path(X0,X1,X4) | ~precedes(X2,X3,X4) | ~sequential(X2,X3))) | ~complete), 10.11/10.34 inference(ennf_transformation,[],[f35])). 10.11/10.34 10.11/10.34 fof(f59,plain,( 10.11/10.34 ! [X0,X1,X2,X3,X4] : (? [X5] : triangle(X2,X3,X5) | ~shortest_path(X0,X1,X4) | ~precedes(X2,X3,X4) | ~sequential(X2,X3)) | ~complete), 10.11/10.34 inference(flattening,[],[f58])). 10.11/10.34 10.11/10.34 fof(f91,plain,( 10.11/10.34 ! [X3,X2] : (? [X5] : triangle(X2,X3,X5) => triangle(X2,X3,sK11(X2,X3)))), 10.11/10.34 introduced(choice_axiom,[])). 10.11/10.34 10.11/10.34 fof(f92,plain,( 10.11/10.34 ! [X0,X1,X2,X3,X4] : (triangle(X2,X3,sK11(X2,X3)) | ~shortest_path(X0,X1,X4) | ~precedes(X2,X3,X4) | ~sequential(X2,X3)) | ~complete), 10.11/10.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f59,f91])). 10.11/10.34 10.11/10.34 fof(f153,plain,( 10.11/10.34 ( ! [X4,X2,X0,X3,X1] : (triangle(X2,X3,sK11(X2,X3)) | ~shortest_path(X0,X1,X4) | ~precedes(X2,X3,X4) | ~sequential(X2,X3) | ~complete) )), 10.11/10.34 inference(cnf_transformation,[],[f92])). 10.11/10.34 10.11/10.34 fof(f138,plain,( 10.11/10.34 complete), 10.11/10.34 inference(cnf_transformation,[],[f86])). 10.11/10.34 10.11/10.34 fof(f1,axiom,( 10.11/10.34 ! [X0,X1,X2,X3] : ((path(X0,X1,X2) & in_path(X3,X2)) => (vertex(X3) & ? [X4] : ((head_of(X4) = X3 | tail_of(X4) = X3) & on_path(X4,X2))))), 10.11/10.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 10.11/10.34 10.11/10.34 fof(f37,plain,( 10.11/10.34 ! [X0,X1,X2,X3] : ((vertex(X3) & ? [X4] : ((head_of(X4) = X3 | tail_of(X4) = X3) & on_path(X4,X2))) | (~path(X0,X1,X2) | ~in_path(X3,X2)))), 10.11/10.34 inference(ennf_transformation,[],[f1])). 10.11/10.34 10.11/10.34 fof(f38,plain,( 10.11/10.34 ! [X0,X1,X2,X3] : ((vertex(X3) & ? [X4] : ((head_of(X4) = X3 | tail_of(X4) = X3) & on_path(X4,X2))) | ~path(X0,X1,X2) | ~in_path(X3,X2))), 10.11/10.34 inference(flattening,[],[f37])). 10.11/10.34 10.11/10.34 fof(f61,plain,( 10.11/10.34 ! [X3,X2] : (? [X4] : ((head_of(X4) = X3 | tail_of(X4) = X3) & on_path(X4,X2)) => ((head_of(sK0(X2,X3)) = X3 | tail_of(sK0(X2,X3)) = X3) & on_path(sK0(X2,X3),X2)))), 10.11/10.34 introduced(choice_axiom,[])). 10.11/10.34 10.11/10.34 fof(f62,plain,( 10.11/10.34 ! [X0,X1,X2,X3] : ((vertex(X3) & ((head_of(sK0(X2,X3)) = X3 | tail_of(sK0(X2,X3)) = X3) & on_path(sK0(X2,X3),X2))) | ~path(X0,X1,X2) | ~in_path(X3,X2))), 10.11/10.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f38,f61])). 10.11/10.34 10.11/10.34 fof(f95,plain,( 10.11/10.34 ( ! [X2,X0,X3,X1] : (vertex(X3) | ~path(X0,X1,X2) | ~in_path(X3,X2)) )), 10.11/10.34 inference(cnf_transformation,[],[f62])). 10.11/10.34 10.11/10.34 fof(f2,axiom,( 10.11/10.34 ! [X2,X0,X1] : (path(X0,X1,X2) => ! [X5,X6] : ((on_path(X5,X2) & (? [X7] : (precedes(X7,X6,X2) & sequential(X5,X7)) | sequential(X5,X6)) & on_path(X6,X2)) => precedes(X5,X6,X2)))), 10.11/10.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 10.11/10.34 10.11/10.34 fof(f21,plain,( 10.11/10.34 ! [X0,X1,X2] : (path(X1,X2,X0) => ! [X3,X4] : ((on_path(X3,X0) & (? [X5] : (precedes(X5,X4,X0) & sequential(X3,X5)) | sequential(X3,X4)) & on_path(X4,X0)) => precedes(X3,X4,X0)))), 10.11/10.34 inference(rectify,[],[f2])). 10.11/10.34 10.11/10.34 fof(f39,plain,( 10.11/10.34 ! [X0,X1,X2] : (! [X3,X4] : (precedes(X3,X4,X0) | (~on_path(X3,X0) | (! [X5] : (~precedes(X5,X4,X0) | ~sequential(X3,X5)) & ~sequential(X3,X4)) | ~on_path(X4,X0))) | ~path(X1,X2,X0))), 10.11/10.34 inference(ennf_transformation,[],[f21])). 10.11/10.34 10.11/10.34 fof(f40,plain,( 10.11/10.34 ! [X0,X1,X2] : (! [X3,X4] : (precedes(X3,X4,X0) | ~on_path(X3,X0) | (! [X5] : (~precedes(X5,X4,X0) | ~sequential(X3,X5)) & ~sequential(X3,X4)) | ~on_path(X4,X0)) | ~path(X1,X2,X0))), 10.11/10.34 inference(flattening,[],[f39])). 10.11/10.34 10.11/10.34 fof(f96,plain,( 10.11/10.34 ( ! [X4,X2,X0,X3,X1] : (precedes(X3,X4,X0) | ~on_path(X3,X0) | ~sequential(X3,X4) | ~on_path(X4,X0) | ~path(X1,X2,X0)) )), 10.11/10.34 inference(cnf_transformation,[],[f40])). 10.11/10.34 10.11/10.34 fof(f151,plain,( 10.11/10.34 ( ! [X2,X0,X1] : (number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) | ~path(X1,X2,X0) | on_path(sK10(X0),X0)) )), 10.11/10.34 inference(cnf_transformation,[],[f90])). 10.11/10.34 10.11/10.34 fof(f150,plain,( 10.11/10.34 ( ! [X2,X0,X1] : (number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) | ~path(X1,X2,X0) | sequential(sK9(X0),sK10(X0))) )), 10.11/10.34 inference(cnf_transformation,[],[f90])). 10.11/10.34 10.11/10.34 fof(f149,plain,( 10.11/10.34 ( ! [X2,X0,X1] : (number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) | ~path(X1,X2,X0) | on_path(sK9(X0),X0)) )), 10.11/10.34 inference(cnf_transformation,[],[f90])). 10.11/10.34 10.11/10.34 fof(f19,axiom,( 10.11/10.34 ! [X0,X1,X2] : (path(X0,X1,X2) => minus(length_of(X2),n1) = number_of_in(sequential_pairs,X2))), 10.11/10.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 10.11/10.34 10.11/10.34 fof(f60,plain,( 10.11/10.34 ! [X0,X1,X2] : (minus(length_of(X2),n1) = number_of_in(sequential_pairs,X2) | ~path(X0,X1,X2))), 10.11/10.34 inference(ennf_transformation,[],[f19])). 10.11/10.34 10.11/10.34 fof(f154,plain,( 10.11/10.34 ( ! [X2,X0,X1] : (minus(length_of(X2),n1) = number_of_in(sequential_pairs,X2) | ~path(X0,X1,X2)) )), 10.11/10.34 inference(cnf_transformation,[],[f60])). 10.11/10.34 10.11/10.34 fof(f6,axiom,( 10.11/10.34 ! [X0,X1,X9] : ((! [X2] : (path(X0,X1,X2) => less_or_equal(length_of(X9),length_of(X2))) & X0 != X1 & path(X0,X1,X9)) <=> shortest_path(X0,X1,X9))), 10.11/10.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)). 10.11/10.34 10.11/10.34 fof(f25,plain,( 10.11/10.34 ! [X0,X1,X2] : ((! [X3] : (path(X0,X1,X3) => less_or_equal(length_of(X2),length_of(X3))) & X0 != X1 & path(X0,X1,X2)) <=> shortest_path(X0,X1,X2))), 10.11/10.34 inference(rectify,[],[f6])). 10.11/10.34 10.11/10.34 fof(f46,plain,( 10.11/10.34 ! [X0,X1,X2] : ((! [X3] : (less_or_equal(length_of(X2),length_of(X3)) | ~path(X0,X1,X3)) & X0 != X1 & path(X0,X1,X2)) <=> shortest_path(X0,X1,X2))), 10.11/10.34 inference(ennf_transformation,[],[f25])). 10.11/10.34 10.11/10.34 fof(f73,plain,( 10.11/10.34 ! [X0,X1,X2] : (((! [X3] : (less_or_equal(length_of(X2),length_of(X3)) | ~path(X0,X1,X3)) & X0 != X1 & path(X0,X1,X2)) | ~shortest_path(X0,X1,X2)) & (shortest_path(X0,X1,X2) | (? [X3] : (~less_or_equal(length_of(X2),length_of(X3)) & path(X0,X1,X3)) | X0 = X1 | ~path(X0,X1,X2))))), 10.11/10.34 inference(nnf_transformation,[],[f46])). 10.11/10.34 10.11/10.34 fof(f74,plain,( 10.11/10.34 ! [X0,X1,X2] : (((! [X3] : (less_or_equal(length_of(X2),length_of(X3)) | ~path(X0,X1,X3)) & X0 != X1 & path(X0,X1,X2)) | ~shortest_path(X0,X1,X2)) & (shortest_path(X0,X1,X2) | ? [X3] : (~less_or_equal(length_of(X2),length_of(X3)) & path(X0,X1,X3)) | X0 = X1 | ~path(X0,X1,X2)))), 10.11/10.34 inference(flattening,[],[f73])). 10.11/10.34 10.11/10.34 fof(f75,plain,( 10.11/10.34 ! [X0,X1,X2] : (((! [X3] : (less_or_equal(length_of(X2),length_of(X3)) | ~path(X0,X1,X3)) & X0 != X1 & path(X0,X1,X2)) | ~shortest_path(X0,X1,X2)) & (shortest_path(X0,X1,X2) | ? [X4] : (~less_or_equal(length_of(X2),length_of(X4)) & path(X0,X1,X4)) | X0 = X1 | ~path(X0,X1,X2)))), 10.11/10.34 inference(rectify,[],[f74])). 10.11/10.34 10.11/10.34 fof(f76,plain,( 10.11/10.34 ! [X2,X1,X0] : (? [X4] : (~less_or_equal(length_of(X2),length_of(X4)) & path(X0,X1,X4)) => (~less_or_equal(length_of(X2),length_of(sK4(X0,X1,X2))) & path(X0,X1,sK4(X0,X1,X2))))), 10.11/10.34 introduced(choice_axiom,[])). 10.11/10.34 10.11/10.34 fof(f77,plain,( 10.11/10.34 ! [X0,X1,X2] : (((! [X3] : (less_or_equal(length_of(X2),length_of(X3)) | ~path(X0,X1,X3)) & X0 != X1 & path(X0,X1,X2)) | ~shortest_path(X0,X1,X2)) & (shortest_path(X0,X1,X2) | (~less_or_equal(length_of(X2),length_of(sK4(X0,X1,X2))) & path(X0,X1,sK4(X0,X1,X2))) | X0 = X1 | ~path(X0,X1,X2)))), 10.11/10.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f75,f76])). 10.11/10.34 10.11/10.34 fof(f117,plain,( 10.11/10.34 ( ! [X2,X0,X1] : (path(X0,X1,X2) | ~shortest_path(X0,X1,X2)) )), 10.11/10.34 inference(cnf_transformation,[],[f77])). 10.11/10.34 10.11/10.34 fof(f140,plain,( 10.11/10.34 ~less_or_equal(minus(length_of(sK6),n1),number_of_in(triangles,graph))), 10.11/10.34 inference(cnf_transformation,[],[f86])). 10.11/10.34 10.11/10.34 cnf(c_14,plain, 10.11/10.34 ( ~ shortest_path(X0,X1,X2) 10.11/10.34 | ~ precedes(X3,X4,X2) 10.11/10.34 | tail_of(X3) != tail_of(X5) 10.11/10.34 | head_of(X4) != head_of(X5) ), 10.11/10.34 inference(cnf_transformation,[],[f108]) ). 10.11/10.34 10.11/10.34 cnf(c_1347,plain, 10.11/10.34 ( ~ shortest_path(X0,X1,X0) 10.11/10.34 | ~ precedes(X0,X1,X0) 10.11/10.34 | tail_of(X0) != tail_of(X2) 10.11/10.34 | head_of(X1) != head_of(X2) ), 10.11/10.34 inference(subtyping,[status(esa)],[c_14]) ). 10.11/10.34 10.11/10.34 cnf(c_1387,plain, 10.11/10.34 ( ~ shortest_path(X0,X1,X0) | ~ sP1_iProver_split(X0) ), 10.11/10.34 inference(splitting, 10.11/10.34 [splitting(split),new_symbols(definition,[sP1_iProver_split])], 10.11/10.34 [c_1347]) ). 10.11/10.34 10.11/10.34 cnf(c_46,negated_conjecture, 10.11/10.34 ( shortest_path(sK7,sK8,sK6) ), 10.11/10.34 inference(cnf_transformation,[],[f139]) ). 10.11/10.34 10.11/10.34 cnf(c_1323,negated_conjecture, 10.11/10.34 ( shortest_path(sK7,sK8,sK6) ), 10.11/10.34 inference(subtyping,[status(esa)],[c_46]) ). 10.11/10.34 10.11/10.34 cnf(c_151592,plain, 10.11/10.34 ( ~ sP1_iProver_split(sK6) ), 10.11/10.34 inference(resolution,[status(thm)],[c_1387,c_1323]) ). 10.11/10.34 10.11/10.34 cnf(c_56,plain, 10.11/10.34 ( ~ triangle(sK9(X0),sK10(X0),X1) 10.11/10.34 | ~ path(X2,X3,X0) 10.11/10.34 | number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) ), 10.11/10.34 inference(cnf_transformation,[],[f152]) ). 10.11/10.34 10.11/10.34 cnf(c_1315,plain, 10.11/10.34 ( ~ triangle(sK9(X0),sK10(X0),X0) 10.11/10.34 | ~ path(X0,X1,X0) 10.11/10.34 | number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) ), 10.11/10.34 inference(subtyping,[status(esa)],[c_56]) ). 10.11/10.34 10.11/10.34 cnf(c_1443,plain, 10.11/10.34 ( ~ triangle(sK9(X0),sK10(X0),X0) 10.11/10.34 | number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) 10.11/10.34 | ~ sP4_iProver_split(X0) ), 10.11/10.34 inference(splitting, 10.11/10.34 [splitting(split),new_symbols(definition,[sP4_iProver_split])], 10.11/10.34 [c_1315]) ). 10.11/10.34 10.11/10.34 cnf(c_76726,plain, 10.11/10.34 ( ~ triangle(sK9(sK6),sK10(sK6),sK11(sK9(sK6),sK10(sK6))) 10.11/10.34 | ~ sP4_iProver_split(sK6) 10.11/10.34 | number_of_in(triangles,sK6) = number_of_in(sequential_pairs,sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1443]) ). 10.11/10.34 10.11/10.34 cnf(c_1468,plain,( X0 = X0 ),theory(equality) ). 10.11/10.34 10.11/10.34 cnf(c_29030,plain, 10.11/10.34 ( number_of_in(X0,graph) = number_of_in(X0,graph) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1468]) ). 10.11/10.34 10.11/10.34 cnf(c_33287,plain, 10.11/10.34 ( number_of_in(triangles,graph) = number_of_in(triangles,graph) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_29030]) ). 10.11/10.34 10.11/10.34 cnf(c_62,plain, 10.11/10.34 ( less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)) ), 10.11/10.34 inference(cnf_transformation,[],[f155]) ). 10.11/10.34 10.11/10.34 cnf(c_1310,plain, 10.11/10.34 ( less_or_equal(number_of_in(X0,X0),number_of_in(X0,graph)) ), 10.11/10.34 inference(subtyping,[status(esa)],[c_62]) ). 10.11/10.34 10.11/10.34 cnf(c_12941,plain, 10.11/10.34 ( less_or_equal(number_of_in(triangles,sK6),number_of_in(triangles,graph)) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1310]) ). 10.11/10.34 10.11/10.34 cnf(c_60,plain, 10.11/10.34 ( triangle(X0,X1,sK11(X0,X1)) 10.11/10.34 | ~ shortest_path(X2,X3,X4) 10.11/10.34 | ~ precedes(X0,X1,X4) 10.11/10.34 | ~ sequential(X0,X1) 10.11/10.34 | ~ complete ), 10.11/10.34 inference(cnf_transformation,[],[f153]) ). 10.11/10.34 10.11/10.34 cnf(c_47,negated_conjecture, 10.11/10.34 ( complete ), 10.11/10.34 inference(cnf_transformation,[],[f138]) ). 10.11/10.34 10.11/10.34 cnf(c_107,plain, 10.11/10.34 ( ~ sequential(X0,X1) 10.11/10.34 | ~ precedes(X0,X1,X4) 10.11/10.34 | ~ shortest_path(X2,X3,X4) 10.11/10.34 | triangle(X0,X1,sK11(X0,X1)) ), 10.11/10.34 inference(global_propositional_subsumption, 10.11/10.34 [status(thm)], 10.11/10.34 [c_60,c_47]) ). 10.11/10.34 10.11/10.34 cnf(c_108,plain, 10.11/10.34 ( triangle(X0,X1,sK11(X0,X1)) 10.11/10.34 | ~ shortest_path(X2,X3,X4) 10.11/10.34 | ~ precedes(X0,X1,X4) 10.11/10.34 | ~ sequential(X0,X1) ), 10.11/10.34 inference(renaming,[status(thm)],[c_107]) ). 10.11/10.34 10.11/10.34 cnf(c_1309,plain, 10.11/10.34 ( triangle(X0,X1,sK11(X0,X1)) 10.11/10.34 | ~ shortest_path(X0,X1,X0) 10.11/10.34 | ~ precedes(X0,X1,X0) 10.11/10.34 | ~ sequential(X0,X1) ), 10.11/10.34 inference(subtyping,[status(esa)],[c_108]) ). 10.11/10.34 10.11/10.34 cnf(c_1452,plain, 10.11/10.34 ( triangle(X0,X1,sK11(X0,X1)) 10.11/10.34 | ~ precedes(X0,X1,X0) 10.11/10.34 | ~ sequential(X0,X1) 10.11/10.34 | sP1_iProver_split(X0) ), 10.11/10.34 inference(splitting, 10.11/10.34 [splitting(split),new_symbols(definition,[])], 10.11/10.34 [c_1309]) ). 10.11/10.34 10.11/10.34 cnf(c_2165,plain, 10.11/10.34 ( triangle(sK9(sK6),sK10(sK6),sK11(sK9(sK6),sK10(sK6))) 10.11/10.34 | ~ precedes(sK9(sK6),sK10(sK6),X0) 10.11/10.34 | ~ sequential(sK9(sK6),sK10(sK6)) 10.11/10.34 | sP1_iProver_split(X0) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1452]) ). 10.11/10.34 10.11/10.34 cnf(c_11597,plain, 10.11/10.34 ( triangle(sK9(sK6),sK10(sK6),sK11(sK9(sK6),sK10(sK6))) 10.11/10.34 | ~ precedes(sK9(sK6),sK10(sK6),sK6) 10.11/10.34 | ~ sequential(sK9(sK6),sK10(sK6)) 10.11/10.34 | sP1_iProver_split(sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_2165]) ). 10.11/10.34 10.11/10.34 cnf(c_1485,plain, 10.11/10.34 ( ~ less_or_equal(X0,X1) 10.11/10.34 | less_or_equal(X2,X3) 10.11/10.34 | X2 != X0 10.11/10.34 | X3 != X1 ), 10.11/10.34 theory(equality) ). 10.11/10.34 10.11/10.34 cnf(c_1548,plain, 10.11/10.34 ( less_or_equal(X0,X1) 10.11/10.34 | ~ less_or_equal(number_of_in(X0,X0),number_of_in(X0,graph)) 10.11/10.34 | X0 != number_of_in(X0,X0) 10.11/10.34 | X1 != number_of_in(X0,graph) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1485]) ). 10.11/10.34 10.11/10.34 cnf(c_1578,plain, 10.11/10.34 ( less_or_equal(X0,number_of_in(X0,graph)) 10.11/10.34 | ~ less_or_equal(number_of_in(X0,X0),number_of_in(X0,graph)) 10.11/10.34 | X0 != number_of_in(X0,X0) 10.11/10.34 | number_of_in(X0,graph) != number_of_in(X0,graph) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1548]) ). 10.11/10.34 10.11/10.34 cnf(c_5522,plain, 10.11/10.34 ( ~ less_or_equal(number_of_in(triangles,sK6),number_of_in(triangles,graph)) 10.11/10.34 | less_or_equal(minus(length_of(sK6),n1),number_of_in(triangles,graph)) 10.11/10.34 | number_of_in(triangles,graph) != number_of_in(triangles,graph) 10.11/10.34 | minus(length_of(sK6),n1) != number_of_in(triangles,sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1578]) ). 10.11/10.34 10.11/10.34 cnf(c_0,plain, 10.11/10.34 ( ~ path(X0,X1,X2) | ~ in_path(X3,X2) | vertex(X3) ), 10.11/10.34 inference(cnf_transformation,[],[f95]) ). 10.11/10.34 10.11/10.34 cnf(c_1361,plain, 10.11/10.34 ( ~ path(X0,X1,X0) | ~ in_path(X2,X0) | vertex(X2) ), 10.11/10.34 inference(subtyping,[status(esa)],[c_0]) ). 10.11/10.34 10.11/10.34 cnf(c_1362,plain, 10.11/10.34 ( ~ path(X0,X1,X0) | ~ sP0_iProver_split(X0) ), 10.11/10.34 inference(splitting, 10.11/10.34 [splitting(split),new_symbols(definition,[sP0_iProver_split])], 10.11/10.34 [c_1361]) ). 10.11/10.34 10.11/10.34 cnf(c_3011,plain, 10.11/10.34 ( ~ path(X0,X1,sK6) | ~ sP0_iProver_split(sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1362]) ). 10.11/10.34 10.11/10.34 cnf(c_3821,plain, 10.11/10.34 ( ~ path(sK7,sK8,sK6) | ~ sP0_iProver_split(sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_3011]) ). 10.11/10.34 10.11/10.34 cnf(c_4,plain, 10.11/10.34 ( precedes(X0,X1,X2) 10.11/10.34 | ~ path(X3,X4,X2) 10.11/10.34 | ~ sequential(X0,X1) 10.11/10.34 | ~ on_path(X0,X2) 10.11/10.34 | ~ on_path(X1,X2) ), 10.11/10.34 inference(cnf_transformation,[],[f96]) ). 10.11/10.34 10.11/10.34 cnf(c_1357,plain, 10.11/10.34 ( precedes(X0,X1,X0) 10.11/10.34 | ~ path(X0,X1,X0) 10.11/10.34 | ~ sequential(X0,X1) 10.11/10.34 | ~ on_path(X0,X0) 10.11/10.34 | ~ on_path(X1,X0) ), 10.11/10.34 inference(subtyping,[status(esa)],[c_4]) ). 10.11/10.34 10.11/10.34 cnf(c_1375,plain, 10.11/10.34 ( precedes(X0,X1,X0) 10.11/10.34 | ~ sequential(X0,X1) 10.11/10.34 | ~ on_path(X0,X0) 10.11/10.34 | ~ on_path(X1,X0) 10.11/10.34 | sP0_iProver_split(X0) ), 10.11/10.34 inference(splitting, 10.11/10.34 [splitting(split),new_symbols(definition,[])], 10.11/10.34 [c_1357]) ). 10.11/10.34 10.11/10.34 cnf(c_2166,plain, 10.11/10.34 ( precedes(sK9(sK6),sK10(sK6),X0) 10.11/10.34 | ~ sequential(sK9(sK6),sK10(sK6)) 10.11/10.34 | ~ on_path(sK10(sK6),X0) 10.11/10.34 | ~ on_path(sK9(sK6),X0) 10.11/10.34 | sP0_iProver_split(X0) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1375]) ). 10.11/10.34 10.11/10.34 cnf(c_3264,plain, 10.11/10.34 ( precedes(sK9(sK6),sK10(sK6),sK6) 10.11/10.34 | ~ sequential(sK9(sK6),sK10(sK6)) 10.11/10.34 | ~ on_path(sK10(sK6),sK6) 10.11/10.34 | ~ on_path(sK9(sK6),sK6) 10.11/10.34 | sP0_iProver_split(sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_2166]) ). 10.11/10.34 10.11/10.34 cnf(c_1472,plain,( X0 != X1 | X2 != X1 | X2 = X0 ),theory(equality) ). 10.11/10.34 10.11/10.34 cnf(c_1636,plain, 10.11/10.34 ( X0 != X1 | X0 = number_of_in(X0,X0) | number_of_in(X0,X0) != X1 ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1472]) ). 10.11/10.34 10.11/10.34 cnf(c_1949,plain, 10.11/10.34 ( X0 != number_of_in(sequential_pairs,sK6) 10.11/10.34 | X0 = number_of_in(triangles,sK6) 10.11/10.34 | number_of_in(triangles,sK6) != number_of_in(sequential_pairs,sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1636]) ). 10.11/10.34 10.11/10.34 cnf(c_3117,plain, 10.11/10.34 ( number_of_in(triangles,sK6) != number_of_in(sequential_pairs,sK6) 10.11/10.34 | minus(length_of(sK6),n1) != number_of_in(sequential_pairs,sK6) 10.11/10.34 | minus(length_of(sK6),n1) = number_of_in(triangles,sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1949]) ). 10.11/10.34 10.11/10.34 cnf(c_1444,plain, 10.11/10.34 ( ~ path(X0,X1,X0) | sP4_iProver_split(X0) ), 10.11/10.34 inference(splitting, 10.11/10.34 [splitting(split),new_symbols(definition,[])], 10.11/10.34 [c_1315]) ). 10.11/10.34 10.11/10.34 cnf(c_1560,plain, 10.11/10.34 ( ~ path(sK7,sK8,sK6) | sP4_iProver_split(sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1444]) ). 10.11/10.34 10.11/10.34 cnf(c_57,plain, 10.11/10.34 ( ~ path(X0,X1,X2) 10.11/10.34 | on_path(sK10(X2),X2) 10.11/10.34 | number_of_in(triangles,X2) = number_of_in(sequential_pairs,X2) ), 10.11/10.34 inference(cnf_transformation,[],[f151]) ). 10.11/10.34 10.11/10.34 cnf(c_1314,plain, 10.11/10.34 ( ~ path(X0,X1,X0) 10.11/10.34 | on_path(sK10(X0),X0) 10.11/10.34 | number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) ), 10.11/10.34 inference(subtyping,[status(esa)],[c_57]) ). 10.11/10.34 10.11/10.34 cnf(c_1564,plain, 10.11/10.34 ( ~ path(sK7,sK8,sK6) 10.11/10.34 | on_path(sK10(sK6),sK6) 10.11/10.34 | number_of_in(triangles,sK6) = number_of_in(sequential_pairs,sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1314]) ). 10.11/10.34 10.11/10.34 cnf(c_58,plain, 10.11/10.34 ( ~ path(X0,X1,X2) 10.11/10.34 | sequential(sK9(X2),sK10(X2)) 10.11/10.34 | number_of_in(triangles,X2) = number_of_in(sequential_pairs,X2) ), 10.11/10.34 inference(cnf_transformation,[],[f150]) ). 10.11/10.34 10.11/10.34 cnf(c_1313,plain, 10.11/10.34 ( ~ path(X0,X1,X0) 10.11/10.34 | sequential(sK9(X0),sK10(X0)) 10.11/10.34 | number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) ), 10.11/10.34 inference(subtyping,[status(esa)],[c_58]) ). 10.11/10.34 10.11/10.34 cnf(c_1565,plain, 10.11/10.34 ( ~ path(sK7,sK8,sK6) 10.11/10.34 | sequential(sK9(sK6),sK10(sK6)) 10.11/10.34 | number_of_in(triangles,sK6) = number_of_in(sequential_pairs,sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1313]) ). 10.11/10.34 10.11/10.34 cnf(c_59,plain, 10.11/10.34 ( ~ path(X0,X1,X2) 10.11/10.34 | on_path(sK9(X2),X2) 10.11/10.34 | number_of_in(triangles,X2) = number_of_in(sequential_pairs,X2) ), 10.11/10.34 inference(cnf_transformation,[],[f149]) ). 10.11/10.34 10.11/10.34 cnf(c_1312,plain, 10.11/10.34 ( ~ path(X0,X1,X0) 10.11/10.34 | on_path(sK9(X0),X0) 10.11/10.34 | number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) ), 10.11/10.34 inference(subtyping,[status(esa)],[c_59]) ). 10.11/10.34 10.11/10.34 cnf(c_1566,plain, 10.11/10.34 ( ~ path(sK7,sK8,sK6) 10.11/10.34 | on_path(sK9(sK6),sK6) 10.11/10.34 | number_of_in(triangles,sK6) = number_of_in(sequential_pairs,sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1312]) ). 10.11/10.34 10.11/10.34 cnf(c_61,plain, 10.11/10.34 ( ~ path(X0,X1,X2) 10.11/10.34 | minus(length_of(X2),n1) = number_of_in(sequential_pairs,X2) ), 10.11/10.34 inference(cnf_transformation,[],[f154]) ). 10.11/10.34 10.11/10.34 cnf(c_1311,plain, 10.11/10.34 ( ~ path(X0,X1,X0) 10.11/10.34 | minus(length_of(X0),n1) = number_of_in(sequential_pairs,X0) ), 10.11/10.34 inference(subtyping,[status(esa)],[c_61]) ). 10.11/10.34 10.11/10.34 cnf(c_1568,plain, 10.11/10.34 ( ~ path(sK7,sK8,sK6) 10.11/10.34 | minus(length_of(sK6),n1) = number_of_in(sequential_pairs,sK6) ), 10.11/10.34 inference(instantiation,[status(thm)],[c_1311]) ). 10.11/10.34 10.11/10.34 cnf(c_24,plain, 10.11/10.34 ( ~ shortest_path(X0,X1,X2) | path(X0,X1,X2) ), 10.11/10.34 inference(cnf_transformation,[],[f117]) ). 10.11/10.34 10.11/10.34 cnf(c_581,plain, 10.11/10.34 ( path(X0,X1,X2) | X1 != sK8 | X0 != sK7 | X2 != sK6 ), 10.11/10.34 inference(resolution_lifted,[status(thm)],[c_24,c_46]) ). 10.11/10.34 10.11/10.34 cnf(c_582,plain, 10.11/10.34 ( path(sK7,sK8,sK6) ), 10.11/10.34 inference(unflattening,[status(thm)],[c_581]) ). 10.11/10.34 10.11/10.34 cnf(c_45,negated_conjecture, 10.11/10.34 ( ~ less_or_equal(minus(length_of(sK6),n1),number_of_in(triangles,graph)) ), 10.11/10.34 inference(cnf_transformation,[],[f140]) ). 10.11/10.34 10.11/10.34 cnf(contradiction,plain, 10.11/10.34 ( $false ), 10.11/10.34 inference(minisat, 10.11/10.34 [status(thm)], 10.11/10.34 [c_151592,c_76726,c_33287,c_12941,c_11597,c_5522,c_3821, 10.11/10.34 c_3264,c_3117,c_1560,c_1564,c_1565,c_1566,c_1568,c_582, 10.11/10.34 c_45]) ). 10.11/10.34 10.11/10.34 10.11/10.34 % SZS output end CNFRefutation 10.11/10.34 10.11/10.34 ------ Statistics 10.11/10.34 10.11/10.34 ------ General 10.11/10.34 10.11/10.34 abstr_arg_filter_cycles: 0 10.11/10.34 gc_basic_clause_elim: 0 10.11/10.34 forced_gc_time: 0 10.11/10.34 parsing_time: 0.005 10.11/10.34 unif_index_cands_time: 0.217 10.11/10.34 unif_index_add_time: 0.04 10.11/10.34 out_proof_time: 0.014 10.11/10.34 total_time: 10.093 10.11/10.34 num_of_symbols: 74 10.11/10.34 num_of_terms: 119955 10.11/10.34 10.11/10.34 ------ Preprocessing 10.11/10.34 10.11/10.34 num_of_splits: 18 10.11/10.34 num_of_split_atoms: 5 10.11/10.34 num_of_reused_defs: 13 10.11/10.34 num_eq_ax_congr_red: 80 10.11/10.34 num_of_sem_filtered_clauses: 2 10.11/10.34 num_of_subtypes: 6 10.11/10.34 monotx_restored_types: 1 10.11/10.34 sat_num_of_epr_types: 0 10.11/10.34 sat_num_of_non_cyclic_types: 0 10.11/10.34 sat_guarded_non_collapsed_types: 1 10.11/10.34 num_pure_diseq_elim: 0 10.11/10.34 simp_replaced_by: 0 10.11/10.34 res_preprocessed: 308 10.11/10.34 prep_upred: 0 10.11/10.34 prep_unflattend: 130 10.11/10.34 pred_elim_cands: 10 10.11/10.34 pred_elim: 0 10.11/10.34 pred_elim_cl: 0 10.11/10.34 pred_elim_cycles: 8 10.11/10.34 merged_defs: 0 10.11/10.34 merged_defs_ncl: 0 10.11/10.34 prep_cycles: 4 10.11/10.34 pred_elim_time: 0.016 10.11/10.34 splitting_time: 0.002 10.11/10.34 sem_filter_time: 0.008 10.11/10.34 monotx_time: 0. 10.11/10.34 subtype_inf_time: 0.001 10.11/10.34 10.11/10.34 ------ Problem properties 10.11/10.34 10.11/10.34 clauses: 91 10.11/10.34 conjectures: 2 10.11/10.34 epr: 46 10.11/10.34 horn: 64 10.11/10.34 unary: 9 10.11/10.34 binary: 29 10.11/10.34 lits: 267 10.11/10.34 lits_eq: 91 10.11/10.34 10.11/10.34 ------ Propositional Solver 10.11/10.34 10.11/10.34 prop_solver_calls: 64 10.11/10.34 prop_fast_solver_calls: 2225 10.11/10.34 prop_num_of_clauses: 49677 10.11/10.34 prop_preprocess_simplified: 144278 10.11/10.34 prop_fo_subsumed: 28 10.11/10.34 prop_solver_time: 0.072 10.11/10.34 prop_fast_solver_time: 0.002 10.11/10.34 prop_unsat_core_time: 0.004 10.11/10.34 10.11/10.34 ------ QBF 10.11/10.34 10.11/10.34 qbf_q_res: 0 10.11/10.34 qbf_num_tautologies: 0 10.11/10.34 qbf_prep_cycles: 0 10.11/10.34 10.11/10.34 ------ BMC1 10.11/10.34 10.11/10.34 bmc1_current_bound: -1 10.11/10.34 bmc1_last_solved_bound: -1 10.11/10.34 bmc1_unsat_core_size: -1 10.11/10.34 bmc1_unsat_core_parents_size: -1 10.11/10.34 bmc1_merge_next_fun: 0 10.11/10.34 bmc1_unsat_core_clauses_time: 0. 10.11/10.34 10.11/10.34 ------ Instantiation 10.11/10.34 10.11/10.34 inst_num_of_clauses: 91 10.11/10.34 inst_num_in_passive: 0 10.11/10.34 inst_num_in_active: 7681 10.11/10.34 inst_num_in_unprocessed: 1703 10.11/10.34 inst_num_of_loops: 10968 10.11/10.34 inst_num_of_learning_restarts: 2 10.11/10.34 inst_num_moves_active_passive: 3274 10.11/10.34 inst_lit_activity: 0 10.11/10.34 inst_lit_activity_moves: 6 10.11/10.34 inst_num_tautologies: 0 10.11/10.34 inst_num_prop_implied: 0 10.11/10.34 inst_num_existing_simplified: 0 10.11/10.34 inst_num_eq_res_simplified: 0 10.11/10.34 inst_num_child_elim: 0 10.11/10.34 inst_num_of_dismatching_blockings: 31991 10.11/10.34 inst_num_of_non_proper_insts: 31669 10.11/10.34 inst_num_of_duplicates: 54212 10.11/10.34 inst_inst_num_from_inst_to_res: 0 10.11/10.34 inst_dismatching_checking_time: 0.319 10.11/10.34 10.11/10.34 ------ Resolution 10.11/10.34 10.11/10.34 res_num_of_clauses: 91 10.11/10.34 res_num_in_passive: 86 10.11/10.34 res_num_in_active: 4 10.11/10.34 res_num_of_loops: 317 10.11/10.34 res_forward_subset_subsumed: 2564 10.11/10.34 res_backward_subset_subsumed: 4 10.11/10.34 res_forward_subsumed: 8 10.11/10.34 res_backward_subsumed: 0 10.11/10.34 res_forward_subsumption_resolution: 2 10.11/10.34 res_backward_subsumption_resolution: 0 10.11/10.34 res_clause_to_clause_subsumption: 219 10.11/10.34 res_orphan_elimination: 0 10.11/10.34 res_tautology_del: 862 10.11/10.34 res_num_eq_res_simplified: 0 10.11/10.34 res_num_sel_changes: 2 10.11/10.34 res_moves_from_active_to_pass: 0 10.11/10.34 10.11/10.35 USED TIME: 10.08 CPU 10.11 WC 10.11/10.36 EOF