0.02/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.10/0.31 % Computer : n024.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 : 1200 0.10/0.31 % DateTime : Tue Jul 13 12:03:33 EDT 2021 0.10/0.31 % CPUTime : 1.26/1.64 ============================== Prover9 =============================== 1.26/1.64 Prover9 (32) version 2009-11A, November 2009. 1.26/1.64 Process 21144 was started by sandbox2 on n024.cluster.edu, 1.26/1.64 Tue Jul 13 12:03:34 2021 1.26/1.64 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_20991_n024.cluster.edu". 1.26/1.64 ============================== end of head =========================== 1.26/1.64 1.26/1.64 ============================== INPUT ================================= 1.26/1.64 1.26/1.64 % Reading from file /tmp/Prover9_20991_n024.cluster.edu 1.26/1.64 1.26/1.64 set(prolog_style_variables). 1.26/1.64 set(auto2). 1.26/1.64 % set(auto2) -> set(auto). 1.26/1.64 % set(auto) -> set(auto_inference). 1.26/1.64 % set(auto) -> set(auto_setup). 1.26/1.64 % set(auto_setup) -> set(predicate_elim). 1.26/1.64 % set(auto_setup) -> assign(eq_defs, unfold). 1.26/1.64 % set(auto) -> set(auto_limits). 1.26/1.64 % set(auto_limits) -> assign(max_weight, "100.000"). 1.26/1.64 % set(auto_limits) -> assign(sos_limit, 20000). 1.26/1.64 % set(auto) -> set(auto_denials). 1.26/1.64 % set(auto) -> set(auto_process). 1.26/1.64 % set(auto2) -> assign(new_constants, 1). 1.26/1.64 % set(auto2) -> assign(fold_denial_max, 3). 1.26/1.64 % set(auto2) -> assign(max_weight, "200.000"). 1.26/1.64 % set(auto2) -> assign(max_hours, 1). 1.26/1.64 % assign(max_hours, 1) -> assign(max_seconds, 3600). 1.26/1.64 % set(auto2) -> assign(max_seconds, 0). 1.26/1.64 % set(auto2) -> assign(max_minutes, 5). 1.26/1.64 % assign(max_minutes, 5) -> assign(max_seconds, 300). 1.26/1.64 % set(auto2) -> set(sort_initial_sos). 1.26/1.64 % set(auto2) -> assign(sos_limit, -1). 1.26/1.64 % set(auto2) -> assign(lrs_ticks, 3000). 1.26/1.64 % set(auto2) -> assign(max_megs, 400). 1.26/1.64 % set(auto2) -> assign(stats, some). 1.26/1.64 % set(auto2) -> clear(echo_input). 1.26/1.64 % set(auto2) -> set(quiet). 1.26/1.64 % set(auto2) -> clear(print_initial_clauses). 1.26/1.64 % set(auto2) -> clear(print_given). 1.26/1.64 assign(lrs_ticks,-1). 1.26/1.64 assign(sos_limit,10000). 1.26/1.64 assign(order,kbo). 1.26/1.64 set(lex_order_vars). 1.26/1.64 clear(print_given). 1.26/1.64 1.26/1.64 % formulas(sos). % not echoed (56 formulas) 1.26/1.64 1.26/1.64 ============================== end of input ========================== 1.26/1.64 1.26/1.64 % From the command line: assign(max_seconds, 1200). 1.26/1.64 1.26/1.64 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 1.26/1.64 1.26/1.64 % Formulas that are not ordinary clauses: 1.26/1.64 1 (all Time1 all Time2 all Fluent (startedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (less(Time1,Time) & initiates(Event,Fluent,Time) & less(Time,Time2) & happens(Event,Time))))) # label(startedin_defn) # label(axiom) # label(non_clause). [assumption]. 1.26/1.64 2 (all Event all Time all Fluent all Fluent2 all Offset (happens(Event,Time) & less(n0,Offset) & -stoppedIn(Time,Fluent,plus(Time,Offset)) & trajectory(Fluent,Time,Fluent2,Offset) & initiates(Event,Fluent,Time) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause). [assumption]. 1.26/1.64 3 (all Event all Time all Fluent (happens(Event,Time) & (terminates(Event,Fluent,Time) | initiates(Event,Fluent,Time)) -> -releasedAt(Fluent,plus(Time,n1)))) # label(happens_not_released) # label(axiom) # label(non_clause). [assumption]. 1.26/1.64 4 (all Fluent all Time (-(exists Event (happens(Event,Time) & releases(Event,Fluent,Time))) & -releasedAt(Fluent,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(keep_not_released) # label(axiom) # label(non_clause). [assumption]. 1.26/1.64 5 (all Fluent all Time (-(exists Event ((initiates(Event,Fluent,Time) | terminates(Event,Fluent,Time)) & happens(Event,Time))) & releasedAt(Fluent,Time) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause). [assumption]. 1.26/1.64 6 (all Event all Time all Fluent (terminates(Event,Fluent,Time) & happens(Event,Time) -> -holdsAt(Fluent,plus(Time,n1)))) # label(happens_terminates_not_holds) # label(axiom) # label(non_clause). [assumption]. 1.26/1.64 7 (all Event all Time all Fluent (initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(happens_holds) # label(axiom) # label(non_clause). [assumption]. 1.26/1.64 8 (all Event all Time1 all Fluent1 all Time2 all Fluent2 (terminates(Event,Fluent1,Time1) & -startedIn(Time1,Fluent1,plus(Time1,Time2)) & antitrajectory(Fluent1,Time1,Fluent2,Time2) & less(n0,Time2) & happens(Event,Time1) -> holdsAt(Fluent2,plus(Time1,Time2)))) # label(antitrajectory) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 9 (all Time1 all Fluent all Time2 (stoppedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (less(Time1,Time) & less(Time,Time2) & terminates(Event,Fluent,Time) & happens(Event,Time))))) # label(stoppedin_defn) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 10 (all Fluent all Time (-holdsAt(Fluent,Time) & -releasedAt(Fluent,plus(Time,n1)) & -(exists Event (happens(Event,Time) & initiates(Event,Fluent,Time))) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 11 (all Fluent all Time (-(exists Event (happens(Event,Time) & terminates(Event,Fluent,Time))) & -releasedAt(Fluent,plus(Time,n1)) & holdsAt(Fluent,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(keep_holding) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 12 (all Event all Time all Fluent (releases(Event,Fluent,Time) & happens(Event,Time) -> releasedAt(Fluent,plus(Time,n1)))) # label(happens_releases) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 13 (all Event all Time (Event = tapOn & Time = n0 | holdsAt(filling,Time) & overflow = Event & holdsAt(waterLevel(n3),Time) <-> happens(Event,Time))) # label(happens_all_defn) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 14 (all Height1 all Time all Height2 all Offset (Height2 = plus(Height1,Offset) & holdsAt(waterLevel(Height1),Time) -> trajectory(filling,Time,waterLevel(Height2),Offset))) # label(change_of_waterLevel) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 15 (all Time all Height1 all Height2 (holdsAt(waterLevel(Height2),Time) & holdsAt(waterLevel(Height1),Time) -> Height1 = Height2)) # label(same_waterLevel) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 16 (all X all Y (waterLevel(Y) = waterLevel(X) <-> X = Y)) # label(distinct_waterLevels) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 17 (all X spilling != waterLevel(X)) # label(spilling_not_waterLevel) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 18 (all Event all Fluent all Time (terminates(Event,Fluent,Time) <-> filling = Fluent & Event = tapOff | filling = Fluent & overflow = Event)) # label(terminates_all_defn) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 19 (all Event all Fluent all Time (initiates(Event,Fluent,Time) <-> (exists Height (tapOff = Event & waterLevel(Height) = Fluent & holdsAt(waterLevel(Height),Time))) | (exists Height (holdsAt(waterLevel(Height),Time) & waterLevel(Height) = Fluent & Event = overflow)) | Fluent = spilling & Event = overflow | Fluent = filling & tapOn = Event)) # label(initiates_all_defn) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 20 (all Event all Fluent all Time ((exists Height (Fluent = waterLevel(Height) & Event = tapOn)) <-> releases(Event,Fluent,Time))) # label(releases_all_defn) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 21 (all X waterLevel(X) != filling) # label(filling_not_waterLevel) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 22 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 23 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 24 (all X (less_or_equal(X,n2) <-> less(X,n3))) # label(less3) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 25 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 26 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 27 (all Height -releasedAt(waterLevel(Height),n0)) # label(not_released_waterLevel_0) # label(hypothesis) # label(non_clause). [assumption]. 1.26/1.65 28 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 29 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 30 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 31 (all X all Y (X != Y & -less(Y,X) <-> less(X,Y))) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 32 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 33 (all X all Y (less_or_equal(X,Y) <-> less(X,Y) | X = Y)) # label(less_or_equal) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 34 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 35 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause). [assumption]. 1.26/1.65 36 --holdsAt(filling,n4) # label(not_filling_4) # label(negated_conjecture) # label(non_clause). [assumption]. 1.26/1.65 1.26/1.65 ============================== end of process non-clausal formulas === 1.26/1.65 1.26/1.65 ============================== PROCESS INITIAL CLAUSES =============== 1.26/1.65 1.26/1.65 ============================== PREDICATE ELIMINATION ================= 1.26/1.65 37 startedIn(A,B,C) | -less(A,D) | -initiates(E,B,D) | -less(D,C) | -happens(E,D) # label(startedin_defn) # label(axiom). [clausify(1)]. 1.26/1.65 38 -startedIn(A,B,C) | less(A,f2(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(1)]. 1.26/1.65 39 -startedIn(A,B,C) | initiates(f1(A,C,B),B,f2(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(1)]. 1.26/1.65 40 -startedIn(A,B,C) | less(f2(A,C,B),C) # label(startedin_defn) # label(axiom). [clausify(1)]. 1.26/1.65 41 -startedIn(A,B,C) | happens(f1(A,C,B),f2(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(1)]. 1.26/1.65 Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | less(A,f2(A,E,D)). [resolve(37,a,38,a)]. 1.26/1.65 Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | initiates(f1(A,E,D),D,f2(A,E,D)). [resolve(37,a,39,a)]. 1.26/1.65 Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | less(f2(A,E,D),E). [resolve(37,a,40,a)]. 1.26/1.65 Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | happens(f1(A,E,D),f2(A,E,D)). [resolve(37,a,41,a)]. 1.26/1.65 42 -terminates(A,B,C) | startedIn(C,B,plus(C,D)) | -antitrajectory(B,C,E,D) | -less(n0,D) | -happens(A,C) | holdsAt(E,plus(C,D)) # label(antitrajectory) # label(axiom). [clausify(8)]. 1.26/1.65 Derived: -terminates(A,B,C) | -antitrajectory(B,C,D,E) | -less(n0,E) | -happens(A,C) | holdsAt(D,plus(C,E)) | less(C,f2(C,plus(C,E),B)). [resolve(42,b,38,a)]. 1.26/1.65 Derived: -terminates(A,B,C) | -antitrajectory(B,C,D,E) | -less(n0,E) | -happens(A,C) | holdsAt(D,plus(C,E)) | initiates(f1(C,plus(C,E),B),B,f2(C,plus(C,E),B)). [resolve(42,b,39,a)]. 1.26/1.65 Derived: -terminates(A,B,C) | -antitrajectory(B,C,D,E) | -less(n0,E) | -happens(A,C) | holdsAt(D,plus(C,E)) | less(f2(C,plus(C,E),B),plus(C,E)). [resolve(42,b,40,a)]. 1.26/1.65 Derived: -terminates(A,B,C) | -antitrajectory(B,C,D,E) | -less(n0,E) | -happens(A,C) | holdsAt(D,plus(C,E)) | happens(f1(C,plus(C,E),B),f2(C,plus(C,E),B)). [resolve(42,b,41,a)]. 1.26/1.65 43 -stoppedIn(A,B,C) | less(A,f6(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(9)]. 1.26/1.65 44 -happens(A,B) | -less(n0,C) | stoppedIn(B,D,plus(B,C)) | -trajectory(D,B,E,C) | -initiates(A,D,B) | holdsAt(E,plus(B,C)) # label(change_holding) # label(axiom). [clausify(2)]. 1.26/1.65 Derived: less(A,f6(A,B,plus(A,C))) | -happens(D,A) | -less(n0,C) | -trajectory(B,A,E,C) | -initiates(D,B,A) | holdsAt(E,plus(A,C)). [resolve(43,a,44,c)]. 1.26/1.65 45 -stoppedIn(A,B,C) | less(f6(A,B,C),C) # label(stoppedin_defn) # label(axiom). [clausify(9)]. 1.26/1.65 Derived: less(f6(A,B,plus(A,C)),plus(A,C)) | -happens(D,A) | -less(n0,C) | -trajectory(B,A,E,C) | -initiates(D,B,A) | holdsAt(E,plus(A,C)). [resolve(45,a,44,c)]. 1.26/1.65 46 -stoppedIn(A,B,C) | terminates(f5(A,B,C),B,f6(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(9)]. 1.26/1.65 Derived: terminates(f5(A,B,plus(A,C)),B,f6(A,B,plus(A,C))) | -happens(D,A) | -less(n0,C) | -trajectory(B,A,E,C) | -initiates(D,B,A) | holdsAt(E,plus(A,C)). [resolve(46,a,44,c)]. 1.26/1.65 47 -stoppedIn(A,B,C) | happens(f5(A,B,C),f6(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(9)]. 1.26/1.65 Derived: happens(f5(A,B,plus(A,C)),f6(A,B,plus(A,C))) | -happens(D,A) | -less(n0,C) | -trajectory(B,A,E,C) | -initiates(D,B,A) | holdsAt(E,plus(A,C)). [resolve(47,a,44,c)]. 1.26/1.65 48 stoppedIn(A,B,C) | -less(A,D) | -less(D,C) | -terminates(E,B,D) | -happens(E,D) # label(stoppedin_defn) # label(axiom). [clausify(9)]. 7.51/7.94 Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | less(A,f6(A,E,C)). [resolve(48,a,43,a)]. 7.51/7.94 Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | less(f6(A,E,C),C). [resolve(48,a,45,a)]. 7.51/7.94 Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | terminates(f5(A,E,C),E,f6(A,E,C)). [resolve(48,a,46,a)]. 7.51/7.94 Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | happens(f5(A,E,C),f6(A,E,C)). [resolve(48,a,47,a)]. 7.51/7.94 49 -releases(A,B,C) | -happens(A,C) | releasedAt(B,plus(C,n1)) # label(happens_releases) # label(axiom). [clausify(12)]. 7.51/7.94 50 releases(f3(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom). [clausify(4)]. 7.51/7.94 51 waterLevel(A) != B | tapOn != C | releases(C,B,D) # label(releases_all_defn) # label(axiom). [clausify(20)]. 7.51/7.94 Derived: waterLevel(A) != B | tapOn != C | -happens(C,D) | releasedAt(B,plus(D,n1)). [resolve(51,c,49,a)]. 7.51/7.94 52 waterLevel(f11(A,B,C)) = B | -releases(A,B,C) # label(releases_all_defn) # label(axiom). [clausify(20)]. 7.51/7.94 Derived: waterLevel(f11(f3(A,B),A,B)) = A | releasedAt(A,B) | -releasedAt(A,plus(B,n1)). [resolve(52,b,50,a)]. 7.51/7.94 Derived: waterLevel(f11(A,B,C)) = B | waterLevel(D) != B | tapOn != A. [resolve(52,b,51,c)]. 7.51/7.94 53 tapOn = A | -releases(A,B,C) # label(releases_all_defn) # label(axiom). [clausify(20)]. 7.51/7.94 Derived: tapOn = f3(A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)). [resolve(53,b,50,a)]. 7.51/7.94 54 less(A,f6(A,B,plus(A,C))) | -happens(D,A) | -less(n0,C) | -trajectory(B,A,E,C) | -initiates(D,B,A) | holdsAt(E,plus(A,C)). [resolve(43,a,44,c)]. 7.51/7.94 55 plus(A,B) != C | -holdsAt(waterLevel(A),D) | trajectory(filling,D,waterLevel(C),B) # label(change_of_waterLevel) # label(axiom). [clausify(14)]. 7.51/7.94 Derived: less(A,f6(A,filling,plus(A,B))) | -happens(C,A) | -less(n0,B) | -initiates(C,filling,A) | holdsAt(waterLevel(D),plus(A,B)) | plus(E,B) != D | -holdsAt(waterLevel(E),A). [resolve(54,d,55,c)]. 7.51/7.94 56 less(f6(A,B,plus(A,C)),plus(A,C)) | -happens(D,A) | -less(n0,C) | -trajectory(B,A,E,C) | -initiates(D,B,A) | holdsAt(E,plus(A,C)). [resolve(45,a,44,c)]. 7.51/7.94 Derived: less(f6(A,filling,plus(A,B)),plus(A,B)) | -happens(C,A) | -less(n0,B) | -initiates(C,filling,A) | holdsAt(waterLevel(D),plus(A,B)) | plus(E,B) != D | -holdsAt(waterLevel(E),A). [resolve(56,d,55,c)]. 7.51/7.94 57 terminates(f5(A,B,plus(A,C)),B,f6(A,B,plus(A,C))) | -happens(D,A) | -less(n0,C) | -trajectory(B,A,E,C) | -initiates(D,B,A) | holdsAt(E,plus(A,C)). [resolve(46,a,44,c)]. 7.51/7.94 Derived: terminates(f5(A,filling,plus(A,B)),filling,f6(A,filling,plus(A,B))) | -happens(C,A) | -less(n0,B) | -initiates(C,filling,A) | holdsAt(waterLevel(D),plus(A,B)) | plus(E,B) != D | -holdsAt(waterLevel(E),A). [resolve(57,d,55,c)]. 7.51/7.94 58 happens(f5(A,B,plus(A,C)),f6(A,B,plus(A,C))) | -happens(D,A) | -less(n0,C) | -trajectory(B,A,E,C) | -initiates(D,B,A) | holdsAt(E,plus(A,C)). [resolve(47,a,44,c)]. 7.51/7.94 Derived: happens(f5(A,filling,plus(A,B)),f6(A,filling,plus(A,B))) | -happens(C,A) | -less(n0,B) | -initiates(C,filling,A) | holdsAt(waterLevel(D),plus(A,B)) | plus(E,B) != D | -holdsAt(waterLevel(E),A). [resolve(58,d,55,c)]. 7.51/7.94 7.51/7.94 ============================== end predicate elimination ============= 7.51/7.94 7.51/7.94 Auto_denials: (non-Horn, no changes). 7.51/7.94 7.51/7.94 Term ordering decisions: 7.51/7.94 7.51/7.94 % Assigning unary symbol waterLevel kb_weight 0 and highest precedence (36). 7.51/7.94 Function symbol KB weights: filling=1. n1=1. n0=1. tapOn=1. n3=1. overflow=1. spilling=1. n2=1. tapOff=1. n4=1. n5=1. n6=1. n7=1. n8=1. n9=1. plus=1. f3=1. f4=1. f7=1. f8=1. f1=1. f2=1. f5=1. f6=1. f9=1. f10=1. f11=1. waterLevel=0. 7.51/7.94 7.51/7.94 ============================== end of process initial clauses ======== 7.51/7.94 7.51/7.94 ============================== CLAUSES FOR SEARCH ==================== 7.51/7.94 7.51/7.94 ============================== end of clauses for search ============= 7.51/7.94 7.51/7.94 ============================== SEARCH ================================ 7.51/7.94 7.51/7.94 % Starting search at 0.03 seconds. 7.51/7.94 7.51/7.94 Low Water (keep): wt=110.000, iters=3356 7.51/7.94 7.51/7.94 Low Water (keep): wt=106.000, iters=335Alarm clock 119.29/120.07 Prover9 interrupted 119.29/120.08 EOF