0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.11/0.32	% Computer   : n029.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   : 1200
0.11/0.32	% DateTime   : Tue Jul 13 12:06:54 EDT 2021
0.11/0.32	% CPUTime    : 
0.38/1.08	============================== Prover9 ===============================
0.38/1.08	Prover9 (32) version 2009-11A, November 2009.
0.38/1.08	Process 27823 was started by sandbox on n029.cluster.edu,
0.38/1.08	Tue Jul 13 12:06:55 2021
0.38/1.08	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_27669_n029.cluster.edu".
0.38/1.08	============================== end of head ===========================
0.38/1.08	
0.38/1.08	============================== INPUT =================================
0.38/1.08	
0.38/1.08	% Reading from file /tmp/Prover9_27669_n029.cluster.edu
0.38/1.08	
0.38/1.08	set(prolog_style_variables).
0.38/1.08	set(auto2).
0.38/1.08	    % set(auto2) -> set(auto).
0.38/1.08	    % set(auto) -> set(auto_inference).
0.38/1.08	    % set(auto) -> set(auto_setup).
0.38/1.08	    % set(auto_setup) -> set(predicate_elim).
0.38/1.08	    % set(auto_setup) -> assign(eq_defs, unfold).
0.38/1.08	    % set(auto) -> set(auto_limits).
0.38/1.08	    % set(auto_limits) -> assign(max_weight, "100.000").
0.38/1.08	    % set(auto_limits) -> assign(sos_limit, 20000).
0.38/1.08	    % set(auto) -> set(auto_denials).
0.38/1.08	    % set(auto) -> set(auto_process).
0.38/1.08	    % set(auto2) -> assign(new_constants, 1).
0.38/1.08	    % set(auto2) -> assign(fold_denial_max, 3).
0.38/1.08	    % set(auto2) -> assign(max_weight, "200.000").
0.38/1.08	    % set(auto2) -> assign(max_hours, 1).
0.38/1.08	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.38/1.08	    % set(auto2) -> assign(max_seconds, 0).
0.38/1.08	    % set(auto2) -> assign(max_minutes, 5).
0.38/1.08	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.38/1.08	    % set(auto2) -> set(sort_initial_sos).
0.38/1.08	    % set(auto2) -> assign(sos_limit, -1).
0.38/1.08	    % set(auto2) -> assign(lrs_ticks, 3000).
0.38/1.08	    % set(auto2) -> assign(max_megs, 400).
0.38/1.08	    % set(auto2) -> assign(stats, some).
0.38/1.08	    % set(auto2) -> clear(echo_input).
0.38/1.08	    % set(auto2) -> set(quiet).
0.38/1.08	    % set(auto2) -> clear(print_initial_clauses).
0.38/1.08	    % set(auto2) -> clear(print_given).
0.38/1.08	assign(lrs_ticks,-1).
0.38/1.08	assign(sos_limit,10000).
0.38/1.08	assign(order,kbo).
0.38/1.08	set(lex_order_vars).
0.38/1.08	clear(print_given).
0.38/1.08	
0.38/1.08	% formulas(sos).  % not echoed (56 formulas)
0.38/1.08	
0.38/1.08	============================== end of input ==========================
0.38/1.08	
0.38/1.08	% From the command line: assign(max_seconds, 1200).
0.38/1.08	
0.38/1.08	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.38/1.08	
0.38/1.08	% Formulas that are not ordinary clauses:
0.38/1.08	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].
0.38/1.08	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].
0.38/1.08	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].
0.38/1.08	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].
0.38/1.08	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].
0.38/1.08	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].
0.38/1.08	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].
0.38/1.08	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].
0.79/1.08	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].
0.79/1.08	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].
0.79/1.08	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].
0.79/1.08	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].
0.79/1.08	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].
0.79/1.08	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].
0.79/1.08	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].
0.79/1.08	16 (all X all Y (waterLevel(Y) = waterLevel(X) <-> X = Y)) # label(distinct_waterLevels) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	17 (all X spilling != waterLevel(X)) # label(spilling_not_waterLevel) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	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].
0.79/1.08	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].
0.79/1.08	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].
0.79/1.08	21 (all X waterLevel(X) != filling) # label(filling_not_waterLevel) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	22 (all Height -releasedAt(waterLevel(Height),n0)) # label(not_released_waterLevel_0) # label(hypothesis) # label(non_clause).  [assumption].
0.79/1.08	23 (all X (less_or_equal(X,n4) <-> less(X,n5))) # label(less5) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	24 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	25 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	26 (all X (less_or_equal(X,n6) <-> less(X,n7))) # label(less7) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	27 (all X all Y (less(X,Y) <-> -less(Y,X) & X != Y)) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	28 (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.79/1.08	29 (all X all Y plus(Y,X) = plus(X,Y)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
0.79/1.08	30 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	31 (all X (less_or_equal(X,n7) <-> less(X,n8))) # label(less8) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	32 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	33 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	34 (all X (less_or_equal(X,n2) <-> less(X,n3))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	35 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.79/1.09	
0.79/1.09	============================== end of process non-clausal formulas ===
0.79/1.09	
0.79/1.09	============================== PROCESS INITIAL CLAUSES ===============
0.79/1.09	
0.79/1.09	============================== PREDICATE ELIMINATION =================
0.79/1.09	36 startedIn(A,B,C) | -less(A,D) | -initiates(E,B,D) | -less(D,C) | -happens(E,D) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.79/1.09	37 -startedIn(A,B,C) | less(A,f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.79/1.09	38 -startedIn(A,B,C) | initiates(f1(A,C,B),B,f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.79/1.09	39 -startedIn(A,B,C) | less(f2(A,C,B),C) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.79/1.09	40 -startedIn(A,B,C) | happens(f1(A,C,B),f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.79/1.09	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | less(A,f2(A,E,D)).  [resolve(36,a,37,a)].
0.79/1.09	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(36,a,38,a)].
0.79/1.09	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | less(f2(A,E,D),E).  [resolve(36,a,39,a)].
0.79/1.09	Derived: -less(A,B) | -initiates(C,D,B) | -less(B,E) | -happens(C,B) | happens(f1(A,E,D),f2(A,E,D)).  [resolve(36,a,40,a)].
0.79/1.09	41 -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)].
0.79/1.09	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(41,b,37,a)].
0.79/1.09	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(41,b,38,a)].
0.79/1.09	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(41,b,39,a)].
0.79/1.09	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(41,b,40,a)].
0.79/1.09	42 -stoppedIn(A,B,C) | less(A,f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.79/1.09	43 -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)].
0.79/1.09	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(42,a,43,c)].
0.79/1.09	44 -stoppedIn(A,B,C) | less(f6(A,B,C),C) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.79/1.09	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(44,a,43,c)].
0.79/1.09	45 -stoppedIn(A,B,C) | terminates(f5(A,B,C),B,f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.79/1.09	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(45,a,43,c)].
0.79/1.09	46 -stoppedIn(A,B,C) | happens(f5(A,B,C),f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
0.79/1.09	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(46,a,43,c)].
0.79/1.09	47 stoppedIn(A,B,C) | -less(A,D) | -less(D,C) | -terminates(E,B,D) | -happens(E,D) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
2.45/2.79	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | less(A,f6(A,E,C)).  [resolve(47,a,42,a)].
2.45/2.79	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | less(f6(A,E,C),C).  [resolve(47,a,44,a)].
2.45/2.79	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(47,a,45,a)].
2.45/2.79	Derived: -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | happens(f5(A,E,C),f6(A,E,C)).  [resolve(47,a,46,a)].
2.45/2.79	48 -releases(A,B,C) | -happens(A,C) | releasedAt(B,plus(C,n1)) # label(happens_releases) # label(axiom).  [clausify(12)].
2.45/2.79	49 releases(f3(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom).  [clausify(4)].
2.45/2.79	50 waterLevel(A) != B | tapOn != C | releases(C,B,D) # label(releases_all_defn) # label(axiom).  [clausify(20)].
2.45/2.79	Derived: waterLevel(A) != B | tapOn != C | -happens(C,D) | releasedAt(B,plus(D,n1)).  [resolve(50,c,48,a)].
2.45/2.79	51 waterLevel(f11(A,B,C)) = B | -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(20)].
2.45/2.79	Derived: waterLevel(f11(f3(A,B),A,B)) = A | releasedAt(A,B) | -releasedAt(A,plus(B,n1)).  [resolve(51,b,49,a)].
2.45/2.79	Derived: waterLevel(f11(A,B,C)) = B | waterLevel(D) != B | tapOn != A.  [resolve(51,b,50,c)].
2.45/2.79	52 tapOn = A | -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(20)].
2.45/2.79	Derived: tapOn = f3(A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)).  [resolve(52,b,49,a)].
2.45/2.79	53 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(42,a,43,c)].
2.45/2.79	54 plus(A,B) != C | -holdsAt(waterLevel(A),D) | trajectory(filling,D,waterLevel(C),B) # label(change_of_waterLevel) # label(axiom).  [clausify(14)].
2.45/2.79	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(53,d,54,c)].
2.45/2.79	55 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(44,a,43,c)].
2.45/2.79	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(55,d,54,c)].
2.45/2.79	56 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(45,a,43,c)].
2.45/2.79	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(56,d,54,c)].
2.45/2.79	57 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(46,a,43,c)].
2.45/2.79	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(57,d,54,c)].
2.45/2.79	
2.45/2.79	============================== end predicate elimination =============
2.45/2.79	
2.45/2.79	Auto_denials:  (non-Horn, no changes).
2.45/2.79	
2.45/2.79	Term ordering decisions:
2.45/2.79	
2.45/2.79	% Assigning unary symbol waterLevel kb_weight 0 and highest precedence (36).
2.45/2.79	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.
2.45/2.79	
2.45/2.79	============================== end of process initial clauses ========
2.45/2.79	
2.45/2.79	============================== CLAUSES FOR SEARCH ====================
2.45/2.79	
2.45/2.79	============================== end of clauses for search =============
2.45/2.79	
2.45/2.79	============================== SEARCH ================================
2.45/2.79	
2.45/2.79	% Starting search at 0.02 seconds.
2.45/2.79	
2.45/2.79	============================== PROOF =================================
2.45/2.79	% SZS status Theorem
2.45/2.79	% SZS output start Refutation
2.45/2.79	
2.45/2.79	% Proof 1 at 1.68 (+ 0.04) seconds.
2.45/2.79	% Length of proof is 206.
2.45/2.79	% Level of proof is 32.
2.45/2.79	% Maximum clause weight is 38.000.
2.45/2.79	% Given clauses 2299.
2.45/2.79	
2.45/2.79	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].
2.45/2.79	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].
2.45/2.79	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].
2.45/2.79	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].
2.45/2.79	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].
2.45/2.79	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].
2.45/2.79	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].
2.45/2.79	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].
2.45/2.79	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].
2.45/2.79	16 (all X all Y (waterLevel(Y) = waterLevel(X) <-> X = Y)) # label(distinct_waterLevels) # label(axiom) # label(non_clause).  [assumption].
2.45/2.79	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].
2.45/2.79	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].
2.45/2.79	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].
2.45/2.79	23 (all X (less_or_equal(X,n4) <-> less(X,n5))) # label(less5) # label(axiom) # label(non_clause).  [assumption].
2.45/2.79	25 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
2.45/2.79	27 (all X all Y (less(X,Y) <-> -less(Y,X) & X != Y)) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
2.45/2.79	28 (all X all Y (less_or_equal(X,Y) <-> Y = X | less(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
2.45/2.79	29 (all X all Y plus(Y,X) = plus(X,Y)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
2.45/2.79	30 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
2.45/2.79	32 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
2.45/2.79	34 (all X (less_or_equal(X,n2) <-> less(X,n3))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
2.45/2.79	35 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
2.45/2.79	42 -stoppedIn(A,B,C) | less(A,f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
2.45/2.79	43 -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)].
2.45/2.79	44 -stoppedIn(A,B,C) | less(f6(A,B,C),C) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
2.45/2.79	46 -stoppedIn(A,B,C) | happens(f5(A,B,C),f6(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
2.45/2.79	47 stoppedIn(A,B,C) | -less(A,D) | -less(D,C) | -terminates(E,B,D) | -happens(E,D) # label(stoppedin_defn) # label(axiom).  [clausify(9)].
2.45/2.79	50 waterLevel(A) != B | tapOn != C | releases(C,B,D) # label(releases_all_defn) # label(axiom).  [clausify(20)].
2.45/2.79	51 waterLevel(f11(A,B,C)) = B | -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(20)].
2.45/2.79	53 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(42,a,43,c)].
2.45/2.79	54 plus(A,B) != C | -holdsAt(waterLevel(A),D) | trajectory(filling,D,waterLevel(C),B) # label(change_of_waterLevel) # label(axiom).  [clausify(14)].
2.45/2.79	55 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(44,a,43,c)].
2.45/2.79	57 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(46,a,43,c)].
2.45/2.79	62 happens(f4(A,B),B) | -releasedAt(A,B) | releasedAt(A,plus(B,n1)) # label(keep_released) # label(axiom).  [clausify(5)].
2.45/2.79	63 -terminates(A,B,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)) # label(happens_terminates_not_holds) # label(axiom).  [clausify(6)].
2.45/2.79	64 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom).  [clausify(7)].
2.45/2.79	67 happens(f8(A,B),B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)) # label(keep_holding) # label(axiom).  [clausify(11)].
2.45/2.79	69 tapOn != A | n0 != B | happens(A,B) # label(happens_all_defn) # label(axiom).  [clausify(13)].
2.45/2.79	70 -holdsAt(filling,A) | overflow != B | -holdsAt(waterLevel(n3),A) | happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(13)].
2.45/2.79	74 n0 = A | holdsAt(filling,A) | -happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(13)].
2.45/2.79	75 n0 = A | overflow = B | -happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(13)].
2.45/2.79	76 n0 = A | holdsAt(waterLevel(n3),A) | -happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(13)].
2.45/2.79	77 -holdsAt(waterLevel(A),B) | -holdsAt(waterLevel(C),B) | A = C # label(same_waterLevel) # label(axiom).  [clausify(15)].
2.45/2.79	81 waterLevel(A) != waterLevel(B) | A = B # label(distinct_waterLevels) # label(axiom).  [clausify(16)].
2.45/2.79	87 terminates(A,B,C) | filling != B | overflow != A # label(terminates_all_defn) # label(axiom).  [clausify(18)].
2.45/2.79	109 initiates(A,B,C) | filling != B | tapOn != A # label(initiates_all_defn) # label(axiom).  [clausify(19)].
2.45/2.79	116 -less_or_equal(A,n4) | less(A,n5) # label(less5) # label(axiom).  [clausify(23)].
2.45/2.79	117 less_or_equal(A,n4) | -less(A,n5) # label(less5) # label(axiom).  [clausify(23)].
2.45/2.79	121 -less_or_equal(A,n0) | less(A,n1) # label(less1) # label(axiom).  [clausify(25)].
2.45/2.79	122 less_or_equal(A,n0) | -less(A,n1) # label(less1) # label(axiom).  [clausify(25)].
2.45/2.79	123 n2 = plus(n0,n2) # label(plus0_2) # label(axiom).  [assumption].
2.45/2.79	124 plus(n0,n2) = n2.  [copy(123),flip(a)].
2.45/2.79	128 plus(n0,n1) = n1 # label(plus0_1) # label(axiom).  [assumption].
2.45/2.79	131 -less(A,B) | -less(B,A) # label(less_property) # label(axiom).  [clausify(27)].
2.45/2.79	132 -less(A,B) | B != A # label(less_property) # label(axiom).  [clausify(27)].
2.45/2.79	133 less(A,B) | less(B,A) | B = A # label(less_property) # label(axiom).  [clausify(27)].
2.45/2.79	134 -less_or_equal(A,B) | B = A | less(A,B) # label(less_or_equal) # label(axiom).  [clausify(28)].
2.45/2.79	135 less_or_equal(A,B) | B != A # label(less_or_equal) # label(axiom).  [clausify(28)].
2.45/2.80	136 less_or_equal(A,B) | -less(A,B) # label(less_or_equal) # label(axiom).  [clausify(28)].
2.45/2.80	137 plus(A,B) = plus(B,A) # label(symmetry_of_plus) # label(axiom).  [clausify(29)].
2.45/2.80	142 n0 = plus(n0,n0) # label(plus0_0) # label(axiom).  [assumption].
2.45/2.80	143 plus(n0,n0) = n0.  [copy(142),flip(a)].
2.45/2.80	144 plus(n1,n2) = n3 # label(plus1_2) # label(axiom).  [assumption].
2.45/2.80	145 -releasedAt(filling,n3) # label(filling_3_l1) # label(lemma).  [assumption].
2.45/2.80	146 n2 = plus(n1,n1) # label(plus1_1) # label(axiom).  [assumption].
2.45/2.80	147 plus(n1,n1) = n2.  [copy(146),flip(a)].
2.45/2.80	149 holdsAt(waterLevel(n0),n0) # label(waterLevel_0) # label(hypothesis).  [assumption].
2.45/2.80	150 -less(A,n0) # label(less0) # label(axiom).  [clausify(30)].
2.45/2.80	153 -less(A,n4) | less_or_equal(A,n3) # label(less4) # label(axiom).  [clausify(32)].
2.45/2.80	154 less(A,n4) | -less_or_equal(A,n3) # label(less4) # label(axiom).  [clausify(32)].
2.45/2.80	158 -less_or_equal(A,n2) | less(A,n3) # label(less3) # label(axiom).  [clausify(34)].
2.45/2.80	159 less_or_equal(A,n2) | -less(A,n3) # label(less3) # label(axiom).  [clausify(34)].
2.45/2.80	160 -less(A,n2) | less_or_equal(A,n1) # label(less2) # label(axiom).  [clausify(35)].
2.45/2.80	161 less(A,n2) | -less_or_equal(A,n1) # label(less2) # label(axiom).  [clausify(35)].
2.45/2.80	162 -holdsAt(filling,n3) # label(filling_3) # label(negated_conjecture).  [assumption].
2.45/2.80	167 -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | less(A,f6(A,E,C)).  [resolve(47,a,42,a)].
2.45/2.80	168 -less(A,B) | -less(B,C) | -terminates(D,E,B) | -happens(D,B) | less(f6(A,E,C),C).  [resolve(47,a,44,a)].
2.45/2.80	173 waterLevel(f11(A,B,C)) = B | waterLevel(D) != B | tapOn != A.  [resolve(51,b,50,c)].
2.45/2.80	176 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(53,d,54,c)].
2.45/2.80	177 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(B,E) != D | -holdsAt(waterLevel(E),A).  [copy(176),rewrite([137(13)])].
2.45/2.80	178 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(55,d,54,c)].
2.45/2.80	179 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(B,E) != D | -holdsAt(waterLevel(E),A).  [copy(178),rewrite([137(14)])].
2.45/2.80	182 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(57,d,54,c)].
2.45/2.80	183 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(B,E) != D | -holdsAt(waterLevel(E),A).  [copy(182),rewrite([137(16)])].
2.45/2.80	184 -less(A,A).  [factor(131,a,b)].
2.45/2.80	185 plus(n1,n0) = n1.  [back_rewrite(128),rewrite([137(3)])].
2.45/2.80	187 n0 != A | happens(tapOn,A).  [xx_res(69,a)].
2.45/2.80	191 terminates(A,filling,B) | overflow != A.  [xx_res(87,b)].
2.45/2.80	195 initiates(A,filling,B) | tapOn != A.  [xx_res(109,b)].
2.45/2.80	198 less(n1,A) | n1 = A | less_or_equal(A,n0).  [resolve(133,a,122,b)].
2.45/2.80	200 less(n5,A) | n5 = A | less_or_equal(A,n4).  [resolve(133,a,117,b)].
2.45/2.80	204 less_or_equal(A,A).  [xx_res(135,b)].
2.45/2.80	219 less_or_equal(A,n2) | less(n3,A) | n3 = A.  [resolve(159,b,133,b),flip(c)].
2.45/2.80	220 less_or_equal(A,n1) | less(n2,A) | n2 = A.  [resolve(160,a,133,b),flip(c)].
2.45/2.80	222 waterLevel(f11(A,waterLevel(B),C)) = waterLevel(B) | tapOn != A.  [xx_res(173,b)].
2.45/2.80	225 happens(tapOn,n0).  [resolve(187,a,143,a(flip)),rewrite([143(4)])].
2.45/2.80	226 less(n1,n2).  [resolve(204,a,161,b)].
2.45/2.80	227 less(n2,n3).  [resolve(204,a,158,a)].
2.45/2.80	232 less(n0,n1).  [resolve(204,a,121,a)].
2.45/2.80	236 less_or_equal(n1,n2).  [resolve(226,a,136,b)].
2.45/2.80	237 n2 != n1.  [resolve(226,a,132,a)].
2.45/2.80	240 n2 != n3.  [resolve(227,a,132,a),flip(a)].
2.45/2.80	255 less_or_equal(n0,n1).  [resolve(232,a,136,b)].
2.45/2.80	256 n0 != n1.  [resolve(232,a,132,a),flip(a)].
2.45/2.80	263 less(n1,n3).  [resolve(236,a,158,a)].
2.45/2.80	267 terminates(overflow,filling,A).  [xx_res(191,b)].
2.45/2.80	269 less(n0,n2).  [resolve(255,a,161,b)].
2.45/2.80	272 less_or_equal(n1,n3).  [resolve(263,a,136,b)].
2.45/2.80	273 n3 != n1.  [resolve(263,a,132,a)].
2.45/2.80	288 less_or_equal(n0,n2).  [resolve(269,a,136,b)].
2.45/2.80	289 n2 != n0.  [resolve(269,a,132,a)].
2.45/2.80	296 less(n1,n4).  [resolve(272,a,154,b)].
2.45/2.80	299 initiates(tapOn,filling,A).  [xx_res(195,b)].
2.45/2.80	301 less(n0,n3).  [resolve(288,a,158,a)].
2.45/2.80	304 less_or_equal(n1,n4).  [resolve(296,a,136,b)].
2.45/2.80	305 n4 != n1.  [resolve(296,a,132,a)].
2.45/2.80	318 n3 != n0.  [resolve(301,a,132,a)].
2.45/2.80	325 less(n1,n5).  [resolve(304,a,116,a)].
2.45/2.80	326 less(n1,A) | n1 = A | n0 = A.  [resolve(198,c,134,a),unit_del(d,150)].
2.45/2.80	334 n5 != n1.  [resolve(325,a,132,a)].
2.45/2.80	335 -less(n5,n1).  [resolve(325,a,131,b)].
2.45/2.80	339 less(n5,A) | n5 = A | n4 = A | less(A,n4).  [resolve(200,c,134,a)].
2.45/2.80	428 -less(A,B) | -less(B,C) | -happens(overflow,B) | less(f6(A,filling,C),C).  [resolve(267,a,168,c)].
2.45/2.80	429 -less(A,B) | -less(B,C) | -happens(overflow,B) | less(A,f6(A,filling,C)).  [resolve(267,a,167,c)].
2.45/2.80	430 -happens(overflow,A) | -holdsAt(filling,plus(A,n1)).  [resolve(267,a,63,a)].
2.45/2.80	438 happens(f5(A,filling,plus(A,B)),f6(A,filling,plus(A,B))) | -happens(tapOn,A) | -less(n0,B) | holdsAt(waterLevel(C),plus(A,B)) | plus(B,D) != C | -holdsAt(waterLevel(D),A).  [resolve(299,a,183,d)].
2.45/2.80	440 less(f6(A,filling,plus(A,B)),plus(A,B)) | -happens(tapOn,A) | -less(n0,B) | holdsAt(waterLevel(C),plus(A,B)) | plus(B,D) != C | -holdsAt(waterLevel(D),A).  [resolve(299,a,179,d)].
2.45/2.80	441 less(A,f6(A,filling,plus(A,B))) | -happens(tapOn,A) | -less(n0,B) | holdsAt(waterLevel(C),plus(A,B)) | plus(B,D) != C | -holdsAt(waterLevel(D),A).  [resolve(299,a,177,d)].
2.45/2.80	446 -happens(tapOn,A) | holdsAt(filling,plus(A,n1)).  [resolve(299,a,64,a)].
2.45/2.80	471 holdsAt(filling,n1).  [resolve(446,a,225,a),rewrite([137(4),185(4)])].
2.45/2.80	473 happens(f8(filling,n1),n1) | releasedAt(filling,n2) | holdsAt(filling,n2).  [resolve(471,a,67,c),rewrite([147(9),147(12)])].
2.45/2.80	475 less(n3,A) | n3 = A | n2 = A | less(A,n2).  [resolve(219,a,134,a)].
2.45/2.80	476 less(n2,A) | n2 = A | n1 = A | less(A,n1).  [resolve(220,a,134,a)].
2.45/2.80	478 n1 = A | n0 = A | -less(A,n1).  [resolve(326,a,131,b)].
2.45/2.80	504 waterLevel(f11(tapOn,waterLevel(A),B)) = waterLevel(A).  [xx_res(222,b)].
2.45/2.80	534 less(n5,A) | n5 = A | n4 = A | less_or_equal(A,n3).  [resolve(339,d,153,a)].
2.45/2.80	540 f11(tapOn,waterLevel(A),B) = A.  [resolve(504,a,81,a)].
2.45/2.80	598 happens(f5(n0,filling,plus(A,n0)),f6(n0,filling,plus(A,n0))) | -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | plus(A,C) != B | -holdsAt(waterLevel(C),n0).  [resolve(438,b,225,a),rewrite([137(4),137(9),137(16)])].
2.45/2.80	603 less(f6(n0,filling,plus(A,n0)),plus(A,n0)) | -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | plus(A,C) != B | -holdsAt(waterLevel(C),n0).  [resolve(440,b,225,a),rewrite([137(4),137(7),137(13)])].
2.45/2.80	605 less(n0,f6(n0,filling,plus(A,n0))) | -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | plus(A,C) != B | -holdsAt(waterLevel(C),n0).  [resolve(441,b,225,a),rewrite([137(5),137(12)])].
2.45/2.80	689 happens(f8(filling,n1),n1) | holdsAt(filling,n2) | happens(f4(filling,n2),n2).  [resolve(473,b,62,b),rewrite([137(17),144(17)]),unit_del(d,145)].
2.45/2.80	723 n3 = A | n2 = A | less(A,n2) | -less(A,n3).  [resolve(475,a,131,b)].
2.45/2.80	745 less(n2,A) | n2 = A | n1 = A | n0 = A.  [resolve(476,d,478,c),merge(d)].
2.45/2.80	791 less(n5,A) | n5 = A | n4 = A | n3 = A | less(A,n3).  [resolve(534,d,134,a)].
2.45/2.80	813 happens(f5(n0,filling,plus(A,n0)),f6(n0,filling,plus(A,n0))) | -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | plus(A,n0) != B.  [resolve(598,e,149,a)].
2.45/2.80	817 less(f6(n0,filling,plus(A,n0)),plus(A,n0)) | -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | plus(A,n0) != B.  [resolve(603,e,149,a)].
2.45/2.80	818 less(n0,f6(n0,filling,plus(A,n0))) | -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | plus(A,n0) != B.  [resolve(605,e,149,a)].
2.45/2.80	873 n2 = A | n1 = A | n0 = A | -less(A,n2).  [resolve(745,a,131,b)].
2.45/2.80	879 holdsAt(filling,n2) | happens(f4(filling,n2),n2) | holdsAt(waterLevel(n3),n1).  [resolve(689,a,76,c),unit_del(c,256)].
2.45/2.80	890 holdsAt(filling,n2) | holdsAt(waterLevel(n3),n1).  [resolve(879,b,74,c),flip(c),merge(d),unit_del(c,289)].
2.45/2.80	893 holdsAt(filling,n2) | -holdsAt(waterLevel(A),n1) | n3 = A.  [resolve(890,b,77,b),flip(c)].
2.45/2.80	894 holdsAt(filling,n2) | overflow != A | happens(A,n1).  [resolve(890,b,70,c),unit_del(b,471)].
2.45/2.80	897 holdsAt(filling,n2) | happens(overflow,n1).  [resolve(894,b,540,a(flip)),rewrite([540(7)])].
2.45/2.80	904 holdsAt(filling,n2) | -less(A,n1) | -less(n1,B) | less(A,f6(A,filling,B)).  [resolve(897,b,429,c)].
2.45/2.80	905 holdsAt(filling,n2) | -less(A,n1) | -less(n1,B) | less(f6(A,filling,B),B).  [resolve(897,b,428,c)].
2.45/2.80	972 less(n5,A) | n5 = A | n4 = A | n3 = A | n2 = A | less(A,n2).  [resolve(791,e,723,d),merge(e)].
2.45/2.80	1020 happens(f5(n0,filling,n2),f6(n0,filling,n2)) | holdsAt(waterLevel(A),n2) | n2 != A.  [resolve(813,b,475,d),rewrite([137(5),124(5),137(9),124(9),137(13),124(13),137(15),124(15)]),unit_del(d,150),unit_del(e,318),unit_del(f,289)].
2.45/2.80	1056 less(f6(n0,filling,n1),n1) | holdsAt(waterLevel(A),n1) | n1 != A.  [resolve(817,b,476,d),rewrite([185(5),185(7),185(10),185(12)]),flip(f),unit_del(d,150),unit_del(e,289),unit_del(f,256)].
2.45/2.80	1057 less(f6(n0,filling,n2),n2) | holdsAt(waterLevel(A),n2) | n2 != A.  [resolve(817,b,475,d),rewrite([137(5),124(5),137(7),124(7),137(10),124(10),137(12),124(12)]),unit_del(d,150),unit_del(e,318),unit_del(f,289)].
2.45/2.80	1072 less(n0,f6(n0,filling,n1)) | holdsAt(waterLevel(A),n1) | n1 != A.  [resolve(818,b,476,d),rewrite([185(6),185(10),185(12)]),flip(f),unit_del(d,150),unit_del(e,289),unit_del(f,256)].
2.45/2.80	1073 less(n0,f6(n0,filling,n2)) | holdsAt(waterLevel(A),n2) | n2 != A.  [resolve(818,b,475,d),rewrite([137(6),124(6),137(10),124(10),137(12),124(12)]),unit_del(d,150),unit_del(e,318),unit_del(f,289)].
2.45/2.80	1252 less(f6(n0,filling,n1),n1) | holdsAt(waterLevel(n1),n1).  [resolve(1056,c,540,a(flip)),rewrite([540(10)])].
2.45/2.80	1253 less(f6(n0,filling,n1),n1) | holdsAt(filling,n2).  [resolve(1252,b,893,b),unit_del(c,273)].
2.45/2.80	1256 less(f6(n0,filling,n1),n1) | -holdsAt(waterLevel(A),n1) | n1 = A.  [resolve(1252,b,77,b),flip(c)].
2.45/2.80	1264 less(f6(n0,filling,n1),n1) | happens(f8(filling,n2),n2).  [resolve(1253,b,67,c),rewrite([137(15),144(15),137(18),144(18)]),unit_del(c,145),unit_del(d,162)].
2.45/2.80	1266 less(f6(n0,filling,n1),n1) | holdsAt(waterLevel(n3),n2).  [resolve(1264,b,76,c),flip(b),unit_del(b,289)].
2.45/2.80	1272 less(f6(n0,filling,n1),n1) | -holdsAt(waterLevel(A),n2) | n3 = A.  [resolve(1266,b,77,b),flip(c)].
2.45/2.80	1546 holdsAt(filling,n2) | -less(n1,A) | less(n0,f6(n0,filling,A)).  [resolve(904,b,232,a)].
2.45/2.80	1578 holdsAt(filling,n2) | -less(n1,A) | less(f6(n0,filling,A),A).  [resolve(905,b,232,a)].
2.45/2.80	2602 holdsAt(filling,n2) | less(n0,f6(n0,filling,n2)).  [resolve(1546,b,972,f),unit_del(c,335),unit_del(d,334),unit_del(e,305),unit_del(f,273),unit_del(g,237)].
2.45/2.80	2622 less(n0,f6(n0,filling,n2)) | happens(f8(filling,n2),n2).  [resolve(2602,a,67,c),rewrite([137(15),144(15),137(18),144(18)]),unit_del(c,145),unit_del(d,162)].
2.45/2.80	2638 less(n0,f6(n0,filling,n2)) | holdsAt(waterLevel(n3),n2).  [resolve(2622,b,76,c),flip(b),unit_del(b,289)].
2.45/2.80	2644 less(n0,f6(n0,filling,n2)) | -holdsAt(waterLevel(A),n2) | n3 = A.  [resolve(2638,b,77,b),flip(c)].
2.45/2.80	2881 holdsAt(filling,n2) | less(f6(n0,filling,n2),n2).  [resolve(1578,b,972,f),unit_del(c,335),unit_del(d,334),unit_del(e,305),unit_del(f,273),unit_del(g,237)].
2.45/2.80	2941 less(f6(n0,filling,n2),n2) | happens(f8(filling,n2),n2).  [resolve(2881,a,67,c),rewrite([137(15),144(15),137(18),144(18)]),unit_del(c,145),unit_del(d,162)].
2.45/2.80	3002 less(f6(n0,filling,n2),n2) | holdsAt(waterLevel(n3),n2).  [resolve(2941,b,76,c),flip(b),unit_del(b,289)].
2.45/2.80	3008 less(f6(n0,filling,n2),n2) | -holdsAt(waterLevel(A),n2) | n3 = A.  [resolve(3002,b,77,b),flip(c)].
2.45/2.80	3185 happens(f5(n0,filling,n2),f6(n0,filling,n2)) | holdsAt(waterLevel(n2),n2).  [resolve(1020,c,540,a(flip)),rewrite([540(13)])].
2.45/2.80	3353 less(f6(n0,filling,n2),n2) | holdsAt(waterLevel(n2),n2).  [resolve(1057,c,540,a(flip)),rewrite([540(10)])].
2.45/2.80	3484 less(n0,f6(n0,filling,n1)) | holdsAt(waterLevel(n1),n1).  [resolve(1072,c,540,a(flip)),rewrite([540(10)])].
2.45/2.80	3486 less(n0,f6(n0,filling,n1)) | holdsAt(filling,n2).  [resolve(3484,b,893,b),unit_del(c,273)].
2.45/2.80	3493 less(n0,f6(n0,filling,n1)) | happens(f8(filling,n2),n2).  [resolve(3486,b,67,c),rewrite([137(15),144(15),137(18),144(18)]),unit_del(c,145),unit_del(d,162)].
2.45/2.80	3498 less(n0,f6(n0,filling,n2)) | holdsAt(waterLevel(n2),n2).  [resolve(1073,c,540,a(flip)),rewrite([540(10)])].
2.45/2.80	3511 less(n0,f6(n0,filling,n1)) | holdsAt(waterLevel(n3),n2).  [resolve(3493,b,76,c),flip(b),unit_del(b,289)].
2.45/2.80	3517 less(n0,f6(n0,filling,n1)) | -holdsAt(waterLevel(A),n2) | n3 = A.  [resolve(3511,b,77,b),flip(c)].
2.45/2.80	5846 less(n0,f6(n0,filling,n2)).  [resolve(2644,b,3498,b),flip(b),merge(c),unit_del(b,240)].
2.45/2.80	5852 f6(n0,filling,n2) != n0.  [resolve(5846,a,132,a)].
2.45/2.80	5870 less(f6(n0,filling,n2),n2).  [resolve(3008,b,3353,b),flip(b),merge(c),unit_del(b,240)].
2.45/2.80	5871 f6(n0,filling,n2) = n2 | f6(n0,filling,n2) = n1.  [resolve(5870,a,873,d),flip(a),flip(b),flip(c),unit_del(c,5852)].
2.45/2.80	5881 f6(n0,filling,n2) != n2.  [resolve(5870,a,132,a),flip(a)].
2.45/2.80	5890 f6(n0,filling,n2) = n1.  [back_unit_del(5871),unit_del(a,5881)].
2.45/2.80	5896 happens(f5(n0,filling,n2),n1) | holdsAt(waterLevel(n2),n2).  [back_rewrite(3185),rewrite([5890(8)])].
2.45/2.80	5912 holdsAt(waterLevel(n2),n2) | holdsAt(waterLevel(n3),n1).  [resolve(5896,a,76,c),unit_del(b,256)].
2.45/2.80	5913 holdsAt(waterLevel(n2),n2) | f5(n0,filling,n2) = overflow.  [resolve(5896,a,75,c),flip(c),unit_del(b,256)].
2.45/2.80	5916 holdsAt(waterLevel(n3),n1) | less(f6(n0,filling,n1),n1).  [resolve(5912,a,1272,b),flip(c),unit_del(c,240)].
2.45/2.80	5982 less(f6(n0,filling,n1),n1).  [resolve(5916,a,1256,b),flip(c),merge(b),unit_del(b,273)].
2.45/2.80	6060 f6(n0,filling,n1) = n1 | f6(n0,filling,n1) = n0.  [resolve(5982,a,478,c),flip(a),flip(b)].
2.45/2.80	6062 f6(n0,filling,n1) != n1.  [resolve(5982,a,132,a),flip(a)].
2.45/2.80	6065 f6(n0,filling,n1) = n0.  [back_unit_del(6060),unit_del(a,6062)].
2.45/2.80	6082 -holdsAt(waterLevel(A),n2) | n3 = A.  [back_rewrite(3517),rewrite([6065(5)]),unit_del(a,184)].
2.45/2.80	6093 holdsAt(filling,n2).  [back_rewrite(3486),rewrite([6065(5)]),unit_del(a,184)].
2.45/2.80	6126 f5(n0,filling,n2) = overflow.  [resolve(6082,a,5913,a),flip(a),unit_del(a,240)].
2.45/2.80	6127 holdsAt(waterLevel(n3),n1).  [resolve(6082,a,5912,a),flip(a),unit_del(a,240)].
2.45/2.80	6135 overflow != A | happens(A,n1).  [resolve(6127,a,70,c),unit_del(a,471)].
2.45/2.80	6136 happens(overflow,n1).  [resolve(6135,a,6126,a(flip)),rewrite([6126(4)])].
2.45/2.80	6144 $F.  [resolve(6136,a,430,a),rewrite([147(4)]),unit_del(a,6093)].
2.45/2.80	
2.45/2.80	% SZS output end Refutation
2.45/2.80	============================== end of proof ==========================
2.45/2.80	
2.45/2.80	============================== STATISTICS ============================
2.45/2.80	
2.45/2.80	Given=2299. Generated=31674. Kept=6074. proofs=1.
2.45/2.80	Usable=1119. Sos=713. Demods=18. Limbo=5, Disabled=4377. Hints=0.
2.45/2.80	Megabytes=6.39.
2.45/2.80	User_CPU=1.69, System_CPU=0.04, Wall_clock=2.
2.45/2.80	
2.45/2.80	============================== end of statistics =====================
2.45/2.80	
2.45/2.80	============================== end of search =========================
2.45/2.80	
2.45/2.80	THEOREM PROVED
2.45/2.80	% SZS status Theorem
2.45/2.80	
2.45/2.80	Exiting with 1 proof.
2.45/2.80	
2.45/2.80	Process 27823 exit (max_proofs) Tue Jul 13 12:06:57 2021
2.45/2.80	Prover9 interrupted
2.45/2.80	EOF