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