0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.33 % Computer : n029.cluster.edu 0.14/0.33 % Model : x86_64 x86_64 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.33 % Memory : 8042.1875MB 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.33 % CPULimit : 960 0.14/0.33 % DateTime : Wed Jul 1 17:28:00 EDT 2020 0.14/0.34 % CPUTime : 0.45/1.07 ============================== Prover9 =============================== 0.45/1.07 Prover9 (32) version 2009-11A, November 2009. 0.45/1.07 Process 936 was started by sandbox on n029.cluster.edu, 0.45/1.07 Wed Jul 1 17:28:01 2020 0.45/1.07 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_687_n029.cluster.edu". 0.45/1.07 ============================== end of head =========================== 0.45/1.07 0.45/1.07 ============================== INPUT ================================= 0.45/1.07 0.45/1.07 % Reading from file /tmp/Prover9_687_n029.cluster.edu 0.45/1.07 0.45/1.07 set(prolog_style_variables). 0.45/1.07 set(auto2). 0.45/1.07 % set(auto2) -> set(auto). 0.45/1.07 % set(auto) -> set(auto_inference). 0.45/1.07 % set(auto) -> set(auto_setup). 0.45/1.07 % set(auto_setup) -> set(predicate_elim). 0.45/1.07 % set(auto_setup) -> assign(eq_defs, unfold). 0.45/1.07 % set(auto) -> set(auto_limits). 0.45/1.07 % set(auto_limits) -> assign(max_weight, "100.000"). 0.45/1.07 % set(auto_limits) -> assign(sos_limit, 20000). 0.45/1.07 % set(auto) -> set(auto_denials). 0.45/1.07 % set(auto) -> set(auto_process). 0.45/1.07 % set(auto2) -> assign(new_constants, 1). 0.45/1.07 % set(auto2) -> assign(fold_denial_max, 3). 0.45/1.07 % set(auto2) -> assign(max_weight, "200.000"). 0.45/1.07 % set(auto2) -> assign(max_hours, 1). 0.45/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.45/1.07 % set(auto2) -> assign(max_seconds, 0). 0.45/1.07 % set(auto2) -> assign(max_minutes, 5). 0.45/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.45/1.07 % set(auto2) -> set(sort_initial_sos). 0.45/1.07 % set(auto2) -> assign(sos_limit, -1). 0.45/1.07 % set(auto2) -> assign(lrs_ticks, 3000). 0.45/1.07 % set(auto2) -> assign(max_megs, 400). 0.45/1.07 % set(auto2) -> assign(stats, some). 0.45/1.07 % set(auto2) -> clear(echo_input). 0.45/1.07 % set(auto2) -> set(quiet). 0.45/1.07 % set(auto2) -> clear(print_initial_clauses). 0.45/1.07 % set(auto2) -> clear(print_given). 0.45/1.07 assign(lrs_ticks,-1). 0.45/1.07 assign(sos_limit,10000). 0.45/1.07 assign(order,kbo). 0.45/1.07 set(lex_order_vars). 0.45/1.07 clear(print_given). 0.45/1.07 0.45/1.07 % formulas(sos). % not echoed (8 formulas) 0.45/1.07 0.45/1.07 ============================== end of input ========================== 0.45/1.07 0.45/1.07 % From the command line: assign(max_seconds, 960). 0.45/1.07 0.45/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.45/1.07 0.45/1.07 % Formulas that are not ordinary clauses: 0.45/1.07 1 (all Z all S1 all C1 all S2 all C2 (iext(uri_rdf_rest,S2,uri_rdf_nil) & iext(uri_rdf_first,S2,C2) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S1,C1) -> (ic(C2) & (all X (icext(C2,X) & icext(C1,X) <-> icext(Z,X))) & ic(C1) & ic(Z) <-> iext(uri_owl_intersectionOf,Z,S1)))) # label(owl_bool_intersectionof_class_002) # label(axiom) # label(non_clause). [assumption]. 0.45/1.07 2 (all Z all S1 all C1 all S2 all C2 all S3 all C3 (iext(uri_rdf_first,S1,C1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_rest,S2,S3) & iext(uri_rdf_rest,S3,uri_rdf_nil) & iext(uri_rdf_first,S3,C3) & iext(uri_rdf_first,S2,C2) -> (iext(uri_owl_unionOf,Z,S1) <-> ic(C3) & (all X (icext(C1,X) | icext(C3,X) | icext(C2,X) <-> icext(Z,X))) & ic(C2) & ic(C1) & ic(Z)))) # label(owl_bool_unionof_class_003) # label(axiom) # label(non_clause). [assumption]. 0.45/1.07 3 (all X all Y (iext(uri_owl_disjointWith,X,Y) -> ic(X) & ic(Y))) # label(owl_prop_disjointwith_ext) # label(axiom) # label(non_clause). [assumption]. 0.45/1.07 4 (all C1 all C2 (iext(uri_rdfs_subClassOf,C1,C2) <-> ic(C2) & (all X (icext(C1,X) -> icext(C2,X))) & ic(C1))) # label(owl_rdfsext_subclassof) # label(axiom) # label(non_clause). [assumption]. 0.45/1.07 5 (all Z all C (iext(uri_owl_complementOf,Z,C) -> ic(C) & (all X (-icext(C,X) <-> icext(Z,X))) & ic(Z))) # label(owl_bool_complementof_class) # label(axiom) # label(non_clause). [assumption]. 0.45/1.07 6 (exists BNODE_xs exists BNODE_xc exists BNODE_lu1 exists BNODE_lu2 exists BNODE_lu3 exists BNODE_li1 exists BNODE_li2 (iext(uri_owl_unionOf,uri_ex_c,BNODE_lu1) & iext(uri_rdf_rest,BNODE_lu1,BNODE_lu2) & iext(uri_rdf_first,BNODE_lu3,uri_ex_c3) & iext(uri_owl_disjointWith,uri_ex_d,uri_ex_c1) & iext(uri_rdfs_subClassOf,uri_ex_d,BNODE_xs) & iext(uri_owl_intersectionOf,BNODE_xs,BNODE_li1) & iext(uri_rdf_first,BNODE_li2,BNODE_xc) & iext(uri_rdf_rest,BNODE_li2,uri_rdf_nil) & iext(uri_owl_complementOf,BNODE_xc,uri_ex_c2) & iext(uri_rdf_rest,BNODE_li1,BNODE_li2) & iext(uri_rdf_first,BNODE_li1,uri_ex_c) & iext(uri_rdf_rest,BNODE_lu3,uri_rdf_nil) & iext(uri_rdf_rest,BNODE_lu2,BNODE_lu3) & iext(uri_rdf_first,BNODE_lu2,uri_ex_c2) & iext(uri_rdf_first,BNODE_lu1,uri_ex_c1))) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom) # label(non_clause). [assumption]. 4.18/4.44 7 (all C1 all C2 ((all X -(icext(C1,X) & icext(C2,X))) & ic(C2) & ic(C1) <-> iext(uri_owl_disjointWith,C1,C2))) # label(owl_eqdis_disjointwith) # label(axiom) # label(non_clause). [assumption]. 4.18/4.44 4.18/4.44 ============================== end of process non-clausal formulas === 4.18/4.44 4.18/4.44 ============================== PROCESS INITIAL CLAUSES =============== 4.18/4.44 4.18/4.44 ============================== PREDICATE ELIMINATION ================= 4.18/4.44 4.18/4.44 ============================== end predicate elimination ============= 4.18/4.44 4.18/4.44 Auto_denials: (non-Horn, no changes). 4.18/4.44 4.18/4.44 Term ordering decisions: 4.18/4.44 Function symbol KB weights: uri_rdf_first=1. uri_rdf_rest=1. uri_rdf_nil=1. uri_owl_unionOf=1. uri_owl_intersectionOf=1. uri_owl_disjointWith=1. uri_rdfs_subClassOf=1. uri_owl_complementOf=1. uri_ex_c=1. uri_ex_c1=1. uri_ex_c2=1. uri_ex_d=1. uri_ex_c3=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. f3=1. f4=1. f1=1. f2=1. 4.18/4.44 4.18/4.44 ============================== end of process initial clauses ======== 4.18/4.44 4.18/4.44 ============================== CLAUSES FOR SEARCH ==================== 4.18/4.44 4.18/4.44 ============================== end of clauses for search ============= 4.18/4.44 4.18/4.44 ============================== SEARCH ================================ 4.18/4.44 4.18/4.44 % Starting search at 0.15 seconds. 4.18/4.44 4.18/4.44 Low Water (keep): wt=48.000, iters=3338 4.18/4.44 4.18/4.44 ============================== PROOF ================================= 4.18/4.44 % SZS status Theorem 4.18/4.44 % SZS output start Refutation 4.18/4.44 4.18/4.44 % Proof 1 at 3.37 (+ 0.02) seconds. 4.18/4.44 % Length of proof is 57. 4.18/4.44 % Level of proof is 11. 4.18/4.44 % Maximum clause weight is 40.000. 4.18/4.44 % Given clauses 1183. 4.18/4.44 4.18/4.44 1 (all Z all S1 all C1 all S2 all C2 (iext(uri_rdf_rest,S2,uri_rdf_nil) & iext(uri_rdf_first,S2,C2) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_first,S1,C1) -> (ic(C2) & (all X (icext(C2,X) & icext(C1,X) <-> icext(Z,X))) & ic(C1) & ic(Z) <-> iext(uri_owl_intersectionOf,Z,S1)))) # label(owl_bool_intersectionof_class_002) # label(axiom) # label(non_clause). [assumption]. 4.18/4.44 2 (all Z all S1 all C1 all S2 all C2 all S3 all C3 (iext(uri_rdf_first,S1,C1) & iext(uri_rdf_rest,S1,S2) & iext(uri_rdf_rest,S2,S3) & iext(uri_rdf_rest,S3,uri_rdf_nil) & iext(uri_rdf_first,S3,C3) & iext(uri_rdf_first,S2,C2) -> (iext(uri_owl_unionOf,Z,S1) <-> ic(C3) & (all X (icext(C1,X) | icext(C3,X) | icext(C2,X) <-> icext(Z,X))) & ic(C2) & ic(C1) & ic(Z)))) # label(owl_bool_unionof_class_003) # label(axiom) # label(non_clause). [assumption]. 4.18/4.44 3 (all X all Y (iext(uri_owl_disjointWith,X,Y) -> ic(X) & ic(Y))) # label(owl_prop_disjointwith_ext) # label(axiom) # label(non_clause). [assumption]. 4.18/4.44 4 (all C1 all C2 (iext(uri_rdfs_subClassOf,C1,C2) <-> ic(C2) & (all X (icext(C1,X) -> icext(C2,X))) & ic(C1))) # label(owl_rdfsext_subclassof) # label(axiom) # label(non_clause). [assumption]. 4.18/4.44 5 (all Z all C (iext(uri_owl_complementOf,Z,C) -> ic(C) & (all X (-icext(C,X) <-> icext(Z,X))) & ic(Z))) # label(owl_bool_complementof_class) # label(axiom) # label(non_clause). [assumption]. 4.18/4.44 6 (exists BNODE_xs exists BNODE_xc exists BNODE_lu1 exists BNODE_lu2 exists BNODE_lu3 exists BNODE_li1 exists BNODE_li2 (iext(uri_owl_unionOf,uri_ex_c,BNODE_lu1) & iext(uri_rdf_rest,BNODE_lu1,BNODE_lu2) & iext(uri_rdf_first,BNODE_lu3,uri_ex_c3) & iext(uri_owl_disjointWith,uri_ex_d,uri_ex_c1) & iext(uri_rdfs_subClassOf,uri_ex_d,BNODE_xs) & iext(uri_owl_intersectionOf,BNODE_xs,BNODE_li1) & iext(uri_rdf_first,BNODE_li2,BNODE_xc) & iext(uri_rdf_rest,BNODE_li2,uri_rdf_nil) & iext(uri_owl_complementOf,BNODE_xc,uri_ex_c2) & iext(uri_rdf_rest,BNODE_li1,BNODE_li2) & iext(uri_rdf_first,BNODE_li1,uri_ex_c) & iext(uri_rdf_rest,BNODE_lu3,uri_rdf_nil) & iext(uri_rdf_rest,BNODE_lu2,BNODE_lu3) & iext(uri_rdf_first,BNODE_lu2,uri_ex_c2) & iext(uri_rdf_first,BNODE_lu1,uri_ex_c1))) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom) # label(non_clause). [assumption]. 4.18/4.44 7 (all C1 all C2 ((all X -(icext(C1,X) & icext(C2,X))) & ic(C2) & ic(C1) <-> iext(uri_owl_disjointWith,C1,C2))) # label(owl_eqdis_disjointwith) # label(axiom) # label(non_clause). [assumption]. 4.18/4.44 8 iext(uri_owl_unionOf,uri_ex_c,c3) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 9 iext(uri_rdf_rest,c3,c4) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 10 iext(uri_rdf_first,c5,uri_ex_c3) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 11 iext(uri_owl_disjointWith,uri_ex_d,uri_ex_c1) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 12 iext(uri_rdfs_subClassOf,uri_ex_d,c1) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 13 iext(uri_owl_intersectionOf,c1,c6) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 14 iext(uri_rdf_first,c7,c2) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 15 iext(uri_rdf_rest,c7,uri_rdf_nil) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 16 iext(uri_owl_complementOf,c2,uri_ex_c2) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 17 iext(uri_rdf_rest,c6,c7) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 18 iext(uri_rdf_first,c6,uri_ex_c) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 19 iext(uri_rdf_rest,c5,uri_rdf_nil) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 20 iext(uri_rdf_rest,c4,c5) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 21 iext(uri_rdf_first,c4,uri_ex_c2) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 22 iext(uri_rdf_first,c3,uri_ex_c1) # label(testcase_premise_fullish_020_Logical_Complications) # label(axiom). [clausify(6)]. 4.18/4.44 23 -iext(uri_rdfs_subClassOf,uri_ex_d,uri_ex_c3) # label(testcase_conclusion_fullish_020_Logical_Complications) # label(negated_conjecture). [assumption]. 4.18/4.44 24 -iext(uri_owl_complementOf,A,B) | -icext(B,C) | -icext(A,C) # label(owl_bool_complementof_class) # label(axiom). [clausify(5)]. 4.18/4.44 25 -icext(A,B) | -icext(C,B) | -iext(uri_owl_disjointWith,A,C) # label(owl_eqdis_disjointwith) # label(axiom). [clausify(7)]. 4.18/4.44 26 -iext(uri_owl_disjointWith,A,B) | ic(A) # label(owl_prop_disjointwith_ext) # label(axiom). [clausify(3)]. 4.18/4.44 32 -iext(uri_rdfs_subClassOf,A,B) | -icext(A,C) | icext(B,C) # label(owl_rdfsext_subclassof) # label(axiom). [clausify(4)]. 4.18/4.44 34 iext(uri_rdfs_subClassOf,A,B) | -ic(B) | icext(A,f3(A,B)) | -ic(A) # label(owl_rdfsext_subclassof) # label(axiom). [clausify(4)]. 4.18/4.44 35 iext(uri_rdfs_subClassOf,A,B) | -ic(B) | -icext(B,f3(A,B)) | -ic(A) # label(owl_rdfsext_subclassof) # label(axiom). [clausify(4)]. 4.18/4.44 41 -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,C,A) | -iext(uri_rdf_first,C,D) | icext(B,E) | -icext(F,E) | -iext(uri_owl_intersectionOf,F,C) # label(owl_bool_intersectionof_class_002) # label(axiom). [clausify(1)]. 4.18/4.44 42 -iext(uri_rdf_rest,A,uri_rdf_nil) | -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,C,A) | -iext(uri_rdf_first,C,D) | icext(D,E) | -icext(F,E) | -iext(uri_owl_intersectionOf,F,C) # label(owl_bool_intersectionof_class_002) # label(axiom). [clausify(1)]. 4.18/4.44 44 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,C) | -iext(uri_rdf_rest,C,D) | -iext(uri_rdf_rest,D,uri_rdf_nil) | -iext(uri_rdf_first,D,E) | -iext(uri_rdf_first,C,F) | -iext(uri_owl_unionOf,V6,A) | ic(E) # label(owl_bool_unionof_class_003) # label(axiom). [clausify(2)]. 4.18/4.44 51 -iext(uri_rdf_first,A,B) | -iext(uri_rdf_rest,A,C) | -iext(uri_rdf_rest,C,D) | -iext(uri_rdf_rest,D,uri_rdf_nil) | -iext(uri_rdf_first,D,E) | -iext(uri_rdf_first,C,F) | -iext(uri_owl_unionOf,V6,A) | icext(B,V7) | icext(E,V7) | icext(F,V7) | -icext(V6,V7) # label(owl_bool_unionof_class_003) # label(axiom). [clausify(2)]. 4.18/4.44 407 -icext(uri_ex_c2,A) | -icext(c2,A). [resolve(24,a,16,a)]. 4.18/4.44 408 -icext(uri_ex_d,A) | -icext(uri_ex_c1,A). [resolve(25,c,11,a)]. 4.18/4.44 409 ic(uri_ex_d). [resolve(26,a,11,a)]. 4.18/4.44 414 -icext(uri_ex_d,A) | icext(c1,A). [resolve(32,a,12,a)]. 4.18/4.44 471 -iext(uri_rdf_rest,A,c7) | -iext(uri_rdf_first,A,B) | icext(c2,C) | -icext(D,C) | -iext(uri_owl_intersectionOf,D,A). [resolve(41,b,14,a),unit_del(a,15)]. 4.18/4.44 492 -iext(uri_rdf_rest,A,c7) | -iext(uri_rdf_first,A,B) | icext(B,C) | -icext(D,C) | -iext(uri_owl_intersectionOf,D,A). [resolve(42,b,14,a),unit_del(a,15)]. 4.18/4.44 544 -iext(uri_rdf_rest,c3,A) | -iext(uri_rdf_rest,A,B) | -iext(uri_rdf_rest,B,uri_rdf_nil) | -iext(uri_rdf_first,B,C) | -iext(uri_rdf_first,A,D) | -iext(uri_owl_unionOf,E,c3) | ic(C). [resolve(44,a,22,a)]. 4.18/4.44 4501 iext(uri_rdfs_subClassOf,uri_ex_d,A) | -ic(A) | icext(uri_ex_d,f3(uri_ex_d,A)). [resolve(409,a,34,d)]. 4.18/4.44 5153 icext(c2,A) | -icext(B,A) | -iext(uri_owl_intersectionOf,B,c6). [resolve(471,b,18,a),unit_del(a,17)]. 4.18/4.44 5156 icext(c2,A) | -icext(c1,A). [resolve(5153,c,13,a)]. 4.18/4.44 5234 icext(uri_ex_c,A) | -icext(B,A) | -iext(uri_owl_intersectionOf,B,c6). [resolve(492,b,18,a),unit_del(a,17)]. 4.18/4.44 5237 icext(uri_ex_c,A) | -icext(c1,A). [resolve(5234,c,13,a)]. 4.18/4.44 6087 -iext(uri_rdf_first,c5,A) | -iext(uri_rdf_first,c4,B) | -iext(uri_owl_unionOf,C,c3) | ic(A). [resolve(544,b,20,a),unit_del(a,9),unit_del(b,19)]. 4.18/4.44 6984 -iext(uri_rdf_first,c4,A) | -iext(uri_owl_unionOf,B,c3) | ic(uri_ex_c3). [resolve(6087,a,10,a)]. 4.18/4.44 6987 -iext(uri_owl_unionOf,A,c3) | ic(uri_ex_c3). [resolve(6984,a,21,a)]. 4.18/4.44 6989 ic(uri_ex_c3). [resolve(6987,a,8,a)]. 4.18/4.44 7382 icext(uri_ex_d,f3(uri_ex_d,uri_ex_c3)). [resolve(6989,a,4501,b),unit_del(a,23)]. 4.18/4.44 7395 -icext(uri_ex_c3,f3(uri_ex_d,uri_ex_c3)). [ur(35,a,23,a,b,6989,a,d,409,a)]. 4.18/4.44 7414 icext(c1,f3(uri_ex_d,uri_ex_c3)). [resolve(7382,a,414,a)]. 4.18/4.44 7415 -icext(uri_ex_c1,f3(uri_ex_d,uri_ex_c3)). [resolve(7382,a,408,a)]. 4.18/4.44 7444 icext(uri_ex_c,f3(uri_ex_d,uri_ex_c3)). [resolve(7414,a,5237,b)]. 4.18/4.44 7445 icext(c2,f3(uri_ex_d,uri_ex_c3)). [resolve(7414,a,5156,b)]. 4.18/4.44 7546 -icext(uri_ex_c2,f3(uri_ex_d,uri_ex_c3)). [resolve(7445,a,407,b)]. 4.18/4.44 7949 $F. [ur(51,b,9,a,c,20,a,d,19,a,e,10,a,f,21,a,g,8,a,h,7415,a,i,7395,a,j,7546,a,k,7444,a),unit_del(a,22)]. 4.18/4.44 4.18/4.44 % SZS output end Refutation 4.18/4.44 ============================== end of proof ========================== 4.18/4.44 4.18/4.44 ============================== STATISTICS ============================ 4.18/4.44 4.18/4.44 Given=1183. Generated=30589. Kept=7941. proofs=1. 4.18/4.44 Usable=913. Sos=4035. Demods=0. Limbo=19, Disabled=3027. Hints=0. 4.18/4.44 Megabytes=9.48. 4.18/4.44 User_CPU=3.37, System_CPU=0.02, Wall_clock=3. 4.18/4.44 4.18/4.44 ============================== end of statistics ===================== 4.18/4.44 4.18/4.44 ============================== end of search ========================= 4.18/4.44 4.18/4.44 THEOREM PROVED 4.18/4.44 % SZS status Theorem 4.18/4.44 4.18/4.44 Exiting with 1 proof. 4.18/4.44 4.18/4.44 Process 936 exit (max_proofs) Wed Jul 1 17:28:04 2020 4.18/4.44 Prover9 interrupted 4.18/4.45 EOF