0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.12/0.33	% Computer   : n019.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 180
0.12/0.33	% DateTime   : Thu Aug 29 13:04:52 EDT 2019
0.12/0.33	% CPUTime    : 
0.85/1.10	============================== Prover9 ===============================
0.85/1.10	Prover9 (32) version 2009-11A, November 2009.
0.85/1.10	Process 22483 was started by sandbox2 on n019.cluster.edu,
0.85/1.10	Thu Aug 29 13:04:53 2019
0.85/1.10	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_22330_n019.cluster.edu".
0.85/1.10	============================== end of head ===========================
0.85/1.10	
0.85/1.10	============================== INPUT =================================
0.85/1.10	
0.85/1.10	% Reading from file /tmp/Prover9_22330_n019.cluster.edu
0.85/1.10	
0.85/1.10	set(prolog_style_variables).
0.85/1.10	set(auto2).
0.85/1.10	    % set(auto2) -> set(auto).
0.85/1.10	    % set(auto) -> set(auto_inference).
0.85/1.10	    % set(auto) -> set(auto_setup).
0.85/1.10	    % set(auto_setup) -> set(predicate_elim).
0.85/1.10	    % set(auto_setup) -> assign(eq_defs, unfold).
0.85/1.10	    % set(auto) -> set(auto_limits).
0.85/1.10	    % set(auto_limits) -> assign(max_weight, "100.000").
0.85/1.10	    % set(auto_limits) -> assign(sos_limit, 20000).
0.85/1.10	    % set(auto) -> set(auto_denials).
0.85/1.10	    % set(auto) -> set(auto_process).
0.85/1.10	    % set(auto2) -> assign(new_constants, 1).
0.85/1.10	    % set(auto2) -> assign(fold_denial_max, 3).
0.85/1.10	    % set(auto2) -> assign(max_weight, "200.000").
0.85/1.10	    % set(auto2) -> assign(max_hours, 1).
0.85/1.10	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.85/1.10	    % set(auto2) -> assign(max_seconds, 0).
0.85/1.10	    % set(auto2) -> assign(max_minutes, 5).
0.85/1.10	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.85/1.10	    % set(auto2) -> set(sort_initial_sos).
0.85/1.10	    % set(auto2) -> assign(sos_limit, -1).
0.85/1.10	    % set(auto2) -> assign(lrs_ticks, 3000).
0.85/1.10	    % set(auto2) -> assign(max_megs, 400).
0.85/1.10	    % set(auto2) -> assign(stats, some).
0.85/1.10	    % set(auto2) -> clear(echo_input).
0.85/1.10	    % set(auto2) -> set(quiet).
0.85/1.10	    % set(auto2) -> clear(print_initial_clauses).
0.85/1.10	    % set(auto2) -> clear(print_given).
0.85/1.10	assign(lrs_ticks,-1).
0.85/1.10	assign(sos_limit,10000).
0.85/1.10	assign(order,kbo).
0.85/1.10	set(lex_order_vars).
0.85/1.10	clear(print_given).
0.85/1.10	
0.85/1.10	% formulas(sos).  % not echoed (55 formulas)
0.85/1.10	
0.85/1.10	============================== end of input ==========================
0.85/1.10	
0.85/1.10	% From the command line: assign(max_seconds, 180).
0.85/1.10	
0.85/1.10	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.85/1.10	
0.85/1.10	% Formulas that are not ordinary clauses:
0.85/1.10	1 (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.85/1.10	2 (all Event all Time1 all Fluent1 all Time2 all Fluent2 (happens(Event,Time1) & -startedIn(Time1,Fluent1,plus(Time1,Time2)) & antitrajectory(Fluent1,Time1,Fluent2,Time2) & less(n0,Time2) & terminates(Event,Fluent1,Time1) -> holdsAt(Fluent2,plus(Time1,Time2)))) # label(antitrajectory) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	3 (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.85/1.10	4 (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.85/1.10	5 (all Fluent all Time (-(exists Event (happens(Event,Time) & initiates(Event,Fluent,Time))) & -releasedAt(Fluent,plus(Time,n1)) & -holdsAt(Fluent,Time) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	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.85/1.10	7 (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.85/1.10	8 (all Fluent all Time (releasedAt(Fluent,Time) & -(exists Event (happens(Event,Time) & (terminates(Event,Fluent,Time) | initiates(Event,Fluent,Time)))) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	9 (all Fluent all Time (-releasedAt(Fluent,Time) & -(exists Event (releases(Event,Fluent,Time) & happens(Event,Time))) -> -releasedAt(Fluent,plus(Time,n1)))) # label(keep_not_released) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	10 (all Event all Time all Fluent all Fluent2 all Offset (less(n0,Offset) & trajectory(Fluent,Time,Fluent2,Offset) & -stoppedIn(Time,Fluent,plus(Time,Offset)) & initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	11 (all Event all Time all Fluent (happens(Event,Time) & (initiates(Event,Fluent,Time) | terminates(Event,Fluent,Time)) -> -releasedAt(Fluent,plus(Time,n1)))) # label(happens_not_released) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	12 (all Time1 all Time2 all Fluent (startedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (happens(Event,Time) & initiates(Event,Fluent,Time) & less(Time,Time2) & less(Time1,Time))))) # label(startedin_defn) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	13 (all Event all Fluent all Time (terminates(Event,Fluent,Time) <-> filling = Fluent & Event = tapOff | filling = Fluent & Event = overflow)) # label(terminates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	14 (all X waterLevel(X) != spilling) # label(spilling_not_waterLevel) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	15 (all Event all Fluent all Time (initiates(Event,Fluent,Time) <-> filling = Fluent & Event = tapOn | overflow = Event & spilling = Fluent | (exists Height (holdsAt(waterLevel(Height),Time) & tapOff = Event & waterLevel(Height) = Fluent)) | (exists Height (Fluent = waterLevel(Height) & Event = overflow & holdsAt(waterLevel(Height),Time))))) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	16 (all Event all Fluent all Time ((exists Height (tapOn = Event & waterLevel(Height) = Fluent)) <-> releases(Event,Fluent,Time))) # label(releases_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	17 (all Event all Time (Time = n0 & Event = tapOn | holdsAt(waterLevel(n3),Time) & overflow = Event & holdsAt(filling,Time) <-> happens(Event,Time))) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	18 (all X filling != waterLevel(X)) # label(filling_not_waterLevel) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	19 (all X all Y (Y = X <-> waterLevel(X) = waterLevel(Y))) # label(distinct_waterLevels) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	20 (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.85/1.10	21 (all Height1 all Time all Height2 all Offset (holdsAt(waterLevel(Height1),Time) & Height2 = plus(Height1,Offset) -> trajectory(filling,Time,waterLevel(Height2),Offset))) # label(change_of_waterLevel) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	22 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	23 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	24 (all X all Y (less_or_equal(X,Y) <-> less(X,Y) | Y = X)) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	25 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	26 (all X (less_or_equal(X,n3) <-> less(X,n4))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	27 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	28 (all X (less(X,n1) <-> less_or_equal(X,n0))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	29 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	30 (all X all Y (less(X,Y) <-> X != Y & -less(Y,X))) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.85/1.10	31 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
0.85/1.11	32 (all X (less_or_equal(X,n2) <-> less(X,n3))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
0.85/1.11	33 (all X (less_or_equal(X,n8) <-> less(X,n9))) # label(less9) # label(axiom) # label(non_clause).  [assumption].
0.85/1.11	34 (all Height -releasedAt(waterLevel(Height),n0)) # label(not_released_waterLevel_0) # label(hypothesis) # label(non_clause).  [assumption].
0.85/1.11	35 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
0.85/1.11	
0.85/1.11	============================== end of process non-clausal formulas ===
0.85/1.11	
0.85/1.11	============================== PROCESS INITIAL CLAUSES ===============
0.85/1.11	
0.85/1.11	============================== PREDICATE ELIMINATION =================
0.85/1.11	36 -happens(A,B) | startedIn(B,C,plus(B,D)) | -antitrajectory(C,B,E,D) | -less(n0,D) | -terminates(A,C,B) | holdsAt(E,plus(B,D)) # label(antitrajectory) # label(axiom).  [clausify(2)].
0.85/1.11	37 happens(f1(A,B),B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)) # label(keep_holding) # label(axiom).  [clausify(1)].
0.85/1.11	Derived: startedIn(A,B,plus(A,C)) | -antitrajectory(B,A,D,C) | -less(n0,C) | -terminates(f1(E,A),B,A) | holdsAt(D,plus(A,C)) | releasedAt(E,plus(A,n1)) | -holdsAt(E,A) | holdsAt(E,plus(A,n1)).  [resolve(36,a,37,a)].
0.85/1.11	38 -releases(A,B,C) | -happens(A,C) | releasedAt(B,plus(C,n1)) # label(happens_releases) # label(axiom).  [clausify(3)].
0.85/1.11	Derived: -releases(f1(A,B),C,B) | releasedAt(C,plus(B,n1)) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(38,b,37,a)].
0.85/1.11	39 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom).  [clausify(4)].
0.85/1.11	Derived: -initiates(f1(A,B),C,B) | holdsAt(C,plus(B,n1)) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(39,b,37,a)].
0.85/1.11	40 happens(f2(A,B),B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)) # label(keep_not_holding) # label(axiom).  [clausify(5)].
0.85/1.11	Derived: releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)) | startedIn(B,C,plus(B,D)) | -antitrajectory(C,B,E,D) | -less(n0,D) | -terminates(f2(A,B),C,B) | holdsAt(E,plus(B,D)).  [resolve(40,a,36,a)].
0.85/1.11	Derived: releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)) | -releases(f2(A,B),C,B) | releasedAt(C,plus(B,n1)).  [resolve(40,a,38,b)].
0.85/1.11	Derived: releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)) | -initiates(f2(A,B),C,B) | holdsAt(C,plus(B,n1)).  [resolve(40,a,39,b)].
0.85/1.11	41 -terminates(A,B,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)) # label(happens_terminates_not_holds) # label(axiom).  [clausify(6)].
0.85/1.11	Derived: -terminates(f1(A,B),C,B) | -holdsAt(C,plus(B,n1)) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(41,b,37,a)].
0.85/1.11	Derived: -terminates(f2(A,B),C,B) | -holdsAt(C,plus(B,n1)) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(41,b,40,a)].
0.85/1.11	42 -stoppedIn(A,B,C) | happens(f3(A,B,C),f4(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(7)].
0.85/1.11	Derived: -stoppedIn(A,B,C) | startedIn(f4(A,B,C),D,plus(f4(A,B,C),E)) | -antitrajectory(D,f4(A,B,C),F,E) | -less(n0,E) | -terminates(f3(A,B,C),D,f4(A,B,C)) | holdsAt(F,plus(f4(A,B,C),E)).  [resolve(42,b,36,a)].
0.85/1.11	Derived: -stoppedIn(A,B,C) | -releases(f3(A,B,C),D,f4(A,B,C)) | releasedAt(D,plus(f4(A,B,C),n1)).  [resolve(42,b,38,b)].
0.85/1.11	Derived: -stoppedIn(A,B,C) | -initiates(f3(A,B,C),D,f4(A,B,C)) | holdsAt(D,plus(f4(A,B,C),n1)).  [resolve(42,b,39,b)].
0.85/1.11	Derived: -stoppedIn(A,B,C) | -terminates(f3(A,B,C),D,f4(A,B,C)) | -holdsAt(D,plus(f4(A,B,C),n1)).  [resolve(42,b,41,b)].
0.85/1.11	43 stoppedIn(A,B,C) | -less(A,D) | -less(D,C) | -terminates(E,B,D) | -happens(E,D) # label(stoppedin_defn) # label(axiom).  [clausify(7)].
0.85/1.11	Derived: stoppedIn(A,B,C) | -less(A,D) | -less(D,C) | -terminates(f1(E,D),B,D) | releasedAt(E,plus(D,n1)) | -holdsAt(E,D) | holdsAt(E,plus(D,n1)).  [resolve(43,e,37,a)].
0.85/1.11	Derived: stoppedIn(A,B,C) | -less(A,D) | -less(D,C) | -terminates(f2(E,D),B,D) | releasedAt(E,plus(D,n1)) | holdsAt(E,D) | -holdsAt(E,plus(D,n1)).  [resolve(43,e,40,a)].
0.85/1.11	Derived: stoppedIn(A,B,C) | -less(A,f4(D,E,F)) | -less(f4(D,E,F),C) | -terminates(f3(D,E,F),B,f4(D,E,F)) | -stoppedIn(D,E,F).  [resolve(43,e,42,b)].
0.85/1.11	44 -releasedAt(A,B) | happens(f5(A,B),B) | releasedAt(A,plus(B,n1)) # label(keep_released) # label(axiom).  [clausify(8)].
0.85/1.11	Derived: -releasedAt(A,B) | releasedAt(A,plus(B,n1)) | startedIn(B,C,plus(B,D)) | -antitrajectory(C,B,E,D) | -less(n0,D) | -terminates(f5(A,B),C,B) | holdsAt(E,plus(B,D)).  [resolve(44,b,36,a)].
0.85/1.11	Derived: -releasedAt(A,B) | releasedAt(A,plus(B,n1)) | -releases(f5(A,B),C,B) | releasedAt(C,plus(B,n1)).  [resolve(44,b,38,b)].
0.85/1.11	Derived: -releasedAt(A,B) | releasedAt(A,plus(B,n1)) | -initiates(f5(A,B),C,B) | holdsAt(C,plus(B,n1)).  [resolve(44,b,39,b)].
0.85/1.11	Derived: -releasedAt(A,B) | releasedAt(A,plus(B,n1)) | -terminates(f5(A,B),C,B) | -holdsAt(C,plus(B,n1)).  [resolve(44,b,41,b)].
0.85/1.11	Derived: -releasedAt(A,B) | releasedAt(A,plus(B,n1)) | stoppedIn(C,D,E) | -less(C,B) | -less(B,E) | -terminates(f5(A,B),D,B).  [resolve(44,b,43,e)].
0.85/1.11	45 releasedAt(A,B) | happens(f6(A,B),B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom).  [clausify(9)].
0.85/1.11	Derived: releasedAt(A,B) | -releasedAt(A,plus(B,n1)) | startedIn(B,C,plus(B,D)) | -antitrajectory(C,B,E,D) | -less(n0,D) | -terminates(f6(A,B),C,B) | holdsAt(E,plus(B,D)).  [resolve(45,b,36,a)].
0.85/1.11	Derived: releasedAt(A,B) | -releasedAt(A,plus(B,n1)) | -releases(f6(A,B),C,B) | releasedAt(C,plus(B,n1)).  [resolve(45,b,38,b)].
0.85/1.11	Derived: releasedAt(A,B) | -releasedAt(A,plus(B,n1)) | -initiates(f6(A,B),C,B) | holdsAt(C,plus(B,n1)).  [resolve(45,b,39,b)].
0.85/1.11	Derived: releasedAt(A,B) | -releasedAt(A,plus(B,n1)) | -terminates(f6(A,B),C,B) | -holdsAt(C,plus(B,n1)).  [resolve(45,b,41,b)].
0.85/1.11	Derived: releasedAt(A,B) | -releasedAt(A,plus(B,n1)) | stoppedIn(C,D,E) | -less(C,B) | -less(B,E) | -terminates(f6(A,B),D,B).  [resolve(45,b,43,e)].
0.85/1.11	46 -less(n0,A) | -trajectory(B,C,D,A) | stoppedIn(C,B,plus(C,A)) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) # label(change_holding) # label(axiom).  [clausify(10)].
0.85/1.11	Derived: -less(n0,A) | -trajectory(B,C,D,A) | stoppedIn(C,B,plus(C,A)) | -initiates(f1(E,C),B,C) | holdsAt(D,plus(C,A)) | releasedAt(E,plus(C,n1)) | -holdsAt(E,C) | holdsAt(E,plus(C,n1)).  [resolve(46,e,37,a)].
0.85/1.11	Derived: -less(n0,A) | -trajectory(B,C,D,A) | stoppedIn(C,B,plus(C,A)) | -initiates(f2(E,C),B,C) | holdsAt(D,plus(C,A)) | releasedAt(E,plus(C,n1)) | holdsAt(E,C) | -holdsAt(E,plus(C,n1)).  [resolve(46,e,40,a)].
0.85/1.11	Derived: -less(n0,A) | -trajectory(B,f4(C,D,E),F,A) | stoppedIn(f4(C,D,E),B,plus(f4(C,D,E),A)) | -initiates(f3(C,D,E),B,f4(C,D,E)) | holdsAt(F,plus(f4(C,D,E),A)) | -stoppedIn(C,D,E).  [resolve(46,e,42,b)].
0.85/1.11	Derived: -less(n0,A) | -trajectory(B,C,D,A) | stoppedIn(C,B,plus(C,A)) | -initiates(f5(E,C),B,C) | holdsAt(D,plus(C,A)) | -releasedAt(E,C) | releasedAt(E,plus(C,n1)).  [resolve(46,e,44,b)].
0.85/1.11	Derived: -less(n0,A) | -trajectory(B,C,D,A) | stoppedIn(C,B,plus(C,A)) | -initiates(f6(E,C),B,C) | holdsAt(D,plus(C,A)) | releasedAt(E,C) | -releasedAt(E,plus(C,n1)).  [resolve(46,e,45,b)].
0.85/1.11	47 -happens(A,B) | -initiates(A,C,B) | -releasedAt(C,plus(B,n1)) # label(happens_not_released) # label(axiom).  [clausify(11)].
0.85/1.11	Derived: -initiates(f1(A,B),C,B) | -releasedAt(C,plus(B,n1)) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(47,a,37,a)].
0.85/1.11	Derived: -initiates(f2(A,B),C,B) | -releasedAt(C,plus(B,n1)) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(47,a,40,a)].
0.85/1.11	Derived: -initiates(f3(A,B,C),D,f4(A,B,C)) | -releasedAt(D,plus(f4(A,B,C),n1)) | -stoppedIn(A,B,C).  [resolve(47,a,42,b)].
0.85/1.11	Derived: -initiates(f5(A,B),C,B) | -releasedAt(C,plus(B,n1)) | -releasedAt(A,B) | releasedAt(A,plus(B,n1)).  [resolve(47,a,44,b)].
0.85/1.11	Derived: -initiates(f6(A,B),C,B) | -releasedAt(C,plus(B,n1)) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)).  [resolve(47,a,45,b)].
0.85/1.11	48 -happens(A,B) | -terminates(A,C,B) | -releasedAt(C,plus(B,n1)) # label(happens_not_released) # label(axiom).  [clausify(11)].
0.85/1.11	Derived: -terminates(f1(A,B),C,B) | -releasedAt(C,plus(B,n1)) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(48,a,37,a)].
0.85/1.11	Derived: -terminates(f2(A,B),C,B) | -releasedAt(C,plus(B,n1)) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(48,a,40,a)].
0.85/1.11	Derived: -terminates(f3(A,B,C),D,f4(A,B,C)) | -releasedAt(D,plus(f4(A,B,C),n1)) | -stoppedIn(A,B,C).  [resolve(48,a,42,b)].
0.85/1.11	Derived: -terminates(f5(A,B),C,B) | -releasedAt(C,plus(B,n1)) | -releasedAt(A,B) | releasedAt(A,plus(B,n1)).  [resolve(48,a,44,b)].
0.85/1.11	Derived: -terminates(f6(A,B),C,B) | -releasedAt(C,plus(B,n1)) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)).  [resolve(48,a,45,b)].
0.85/1.11	49 -startedIn(A,B,C) | happens(f7(A,C,B),f8(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(12)].
0.85/1.11	Derived: -startedIn(A,B,C) | startedIn(f8(A,C,B),D,plus(f8(A,C,B),E)) | -antitrajectory(D,f8(A,C,B),F,E) | -less(n0,E) | -terminates(f7(A,C,B),D,f8(A,C,B)) | holdsAt(F,plus(f8(A,C,B),E)).  [resolve(49,b,36,a)].
0.85/1.11	Derived: -startedIn(A,B,C) | -releases(f7(A,C,B),D,f8(A,C,B)) | releasedAt(D,plus(f8(A,C,B),n1)).  [resolve(49,b,38,b)].
0.85/1.11	Derived: -startedIn(A,B,C) | -initiates(f7(A,C,B),D,f8(A,C,B)) | holdsAt(D,plus(f8(A,C,B),n1)).  [resolve(49,b,39,b)].
0.85/1.11	Derived: -startedIn(A,B,C) | -terminates(f7(A,C,B),D,f8(A,C,B)) | -holdsAt(D,plus(f8(A,C,B),n1)).  [resolve(49,b,41,b)].
0.85/1.11	Derived: -startedIn(A,B,C) | stoppedIn(D,E,F) | -less(D,f8(A,C,B)) | -less(f8(A,C,B),F) | -terminates(f7(A,C,B),E,f8(A,C,B)).  [resolve(49,b,43,e)].
0.85/1.11	Derived: -startedIn(A,B,C) | -less(n0,D) | -trajectory(E,f8(A,C,B),F,D) | stoppedIn(f8(A,C,B),E,plus(f8(A,C,B),D)) | -initiates(f7(A,C,B),E,f8(A,C,B)) | holdsAt(F,plus(f8(A,C,B),D)).  [resolve(49,b,46,e)].
0.85/1.11	Derived: -startedIn(A,B,C) | -initiates(f7(A,C,B),D,f8(A,C,B)) | -releasedAt(D,plus(f8(A,C,B),n1)).  [resolve(49,b,47,a)].
0.85/1.11	Derived: -startedIn(A,B,C) | -terminates(f7(A,C,B),D,f8(A,C,B)) | -releasedAt(D,plus(f8(A,C,B),n1)).  [resolve(49,b,48,a)].
0.85/1.11	50 startedIn(A,B,C) | -happens(D,E) | -initiates(D,B,E) | -less(E,C) | -less(A,E) # label(startedin_defn) # label(axiom).  [clausify(12)].
0.85/1.11	Derived: startedIn(A,B,C) | -initiates(f1(D,E),B,E) | -less(E,C) | -less(A,E) | releasedAt(D,plus(E,n1)) | -holdsAt(D,E) | holdsAt(D,plus(E,n1)).  [resolve(50,b,37,a)].
0.85/1.11	Derived: startedIn(A,B,C) | -initiates(f2(D,E),B,E) | -less(E,C) | -less(A,E) | releasedAt(D,plus(E,n1)) | holdsAt(D,E) | -holdsAt(D,plus(E,n1)).  [resolve(50,b,40,a)].
0.85/1.11	Derived: startedIn(A,B,C) | -initiates(f3(D,E,F),B,f4(D,E,F)) | -less(f4(D,E,F),C) | -less(A,f4(D,E,F)) | -stoppedIn(D,E,F).  [resolve(50,b,42,b)].
0.85/1.11	Derived: startedIn(A,B,C) | -initiates(f5(D,E),B,E) | -less(E,C) | -less(A,E) | -releasedAt(D,E) | releasedAt(D,plus(E,n1)).  [resolve(50,b,44,b)].
0.85/1.11	Derived: startedIn(A,B,C) | -initiates(f6(D,E),B,E) | -less(E,C) | -less(A,E) | releasedAt(D,E) | -releasedAt(D,plus(E,n1)).  [resolve(50,b,45,b)].
0.85/1.11	Derived: startedIn(A,B,C) | -initiates(f7(D,E,F),B,f8(D,E,F)) | -less(f8(D,E,F),C) | -less(A,f8(D,E,F)) | -startedIn(D,F,E).  [resolve(50,b,49,b)].
0.85/1.11	51 n0 != A | tapOn != B | happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(17)].
0.85/1.11	Derived: n0 != A | tapOn != B | startedIn(A,C,plus(A,D)) | -antitrajectory(C,A,E,D) | -less(n0,D) | -terminates(B,C,A) | holdsAt(E,plus(A,D)).  [resolve(51,c,36,a)].
0.85/1.11	Derived: n0 != A | tapOn != B | -releases(B,C,A) | releasedAt(C,plus(A,n1)).  [resolve(51,c,38,b)].
0.85/1.11	Derived: n0 != A | tapOn != B | -initiates(B,C,A) | holdsAt(C,plus(A,n1)).  [resolve(51,c,39,b)].
0.85/1.11	Derived: n0 != A | tapOn != B | -terminates(B,C,A) | -holdsAt(C,plus(A,n1)).  [resolve(51,c,41,b)].
0.85/1.11	Derived: n0 != A | tapOn != B | stoppedIn(C,D,E) | -less(C,A) | -less(A,E) | -terminates(B,D,A).  [resolve(51,c,43,e)].
0.85/1.11	Derived: n0 != A | tapOn != B | -less(n0,C) | -trajectory(D,A,E,C) | stoppedIn(A,D,plus(A,C)) | -initiates(B,D,A) | holdsAt(E,plus(A,C)).  [resolve(51,c,46,e)].
0.85/1.11	Derived: n0 != A | tapOn != B | -initiates(B,C,A) | -releasedAt(C,plus(A,n1)).  [resolve(51,c,47,a)].
0.85/1.11	Derived: n0 != A | tapOn != B | -terminates(B,C,A) | -releasedAt(C,plus(A,n1)).  [resolve(51,c,48,a)].
0.85/1.11	Derived: n0 != A | tapOn != B | startedIn(C,D,E) | -initiates(B,D,A) | -less(A,E) | -less(C,A).  [resolve(51,c,50,b)].
0.85/1.11	52 -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(17)].
0.85/1.11	Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | startedIn(A,C,plus(A,D)) | -antitrajectory(C,A,E,D) | -less(n0,D) | -terminates(B,C,A) | holdsAt(E,plus(A,D)).  [resolve(52,d,36,a)].
0.85/1.11	Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | -releases(B,C,A) | releasedAt(C,plus(A,n1)).  [resolve(52,d,38,b)].
0.85/1.11	Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | -initiates(B,C,A) | holdsAt(C,plus(A,n1)).  [resolve(52,d,39,b)].
0.85/1.11	Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | -terminates(B,C,A) | -holdsAt(C,plus(A,n1)).  [resolve(52,d,41,b)].
0.85/1.11	Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | stoppedIn(C,D,E) | -less(C,A) | -less(A,E) | -terminates(B,D,A).  [resolve(52,d,43,e)].
0.85/1.11	Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | -less(n0,C) | -trajectory(D,A,E,C) | stoppedIn(A,D,plus(A,C)) | -initiates(B,D,A) | holdsAt(E,plus(A,C)).  [resolve(52,d,46,e)].
0.85/1.11	Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | -initiates(B,C,A) | -releasedAt(C,plus(A,n1)).  [resolve(52,d,47,a)].
0.85/1.11	Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | -terminates(B,C,A) | -releasedAt(C,plus(A,n1)).  [resolve(52,d,48,a)].
0.85/1.11	Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | startedIn(C,D,E) | -initiates(B,D,A) | -less(A,E) | -less(C,A).  [resolve(52,d,50,b)].
0.85/1.11	53 n0 = A | holdsAt(waterLevel(n3),A) | -happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(17)].
0.85/1.11	Derived: n0 = A | holdsAt(waterLevel(n3),A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,A) | holdsAt(B,plus(A,n1)).  [resolve(53,c,37,a)].
0.85/1.11	Derived: n0 = A | holdsAt(waterLevel(n3),A) | releasedAt(B,plus(A,n1)) | holdsAt(B,A) | -holdsAt(B,plus(A,n1)).  [resolve(53,c,40,a)].
0.85/1.11	Derived: n0 = f4(A,B,C) | holdsAt(waterLevel(n3),f4(A,B,C)) | -stoppedIn(A,B,C).  [resolve(53,c,42,b)].
0.85/1.11	Derived: n0 = A | holdsAt(waterLevel(n3),A) | -releasedAt(B,A) | releasedAt(B,plus(A,n1)).  [resolve(53,c,44,b)].
0.85/1.11	Derived: n0 = A | holdsAt(waterLevel(n3),A) | releasedAt(B,A) | -releasedAt(B,plus(A,n1)).  [resolve(53,c,45,b)].
0.85/1.11	Derived: n0 = f8(A,B,C) | holdsAt(waterLevel(n3),f8(A,B,C)) | -startedIn(A,C,B).  [resolve(53,c,49,b)].
0.85/1.11	54 n0 = A | overflow = B | -happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(17)].
0.85/1.11	Derived: n0 = A | overflow = f1(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,A) | holdsAt(B,plus(A,n1)).  [resolve(54,c,37,a)].
0.85/1.11	Derived: n0 = A | overflow = f2(B,A) | releasedAt(B,plus(A,n1)) | holdsAt(B,A) | -holdsAt(B,plus(A,n1)).  [resolve(54,c,40,a)].
0.85/1.11	Derived: n0 = f4(A,B,C) | overflow = f3(A,B,C) | -stoppedIn(A,B,C).  [resolve(54,c,42,b)].
0.85/1.11	Derived: n0 = A | overflow = f5(B,A) | -releasedAt(B,A) | releasedAt(B,plus(A,n1)).  [resolve(54,c,44,b)].
0.85/1.11	Derived: n0 = A | overflow = f6(B,A) | releasedAt(B,A) | -releasedAt(B,plus(A,n1)).  [resolve(54,c,45,b)].
0.85/1.11	Derived: n0 = f8(A,B,C) | overflow = f7(A,B,C) | -startedIn(A,C,B).  [resolve(54,c,49,b)].
0.85/1.11	55 n0 = A | holdsAt(filling,A) | -happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(17)].
0.85/1.11	Derived: n0 = A | holdsAt(filling,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,A) | holdsAt(B,plus(A,n1)).  [resolve(55,c,37,a)].
0.85/1.11	Derived: n0 = A | holdsAt(filling,A) | releasedAt(B,plus(A,n1)) | holdsAt(B,A) | -holdsAt(B,plus(A,n1)).  [resolve(55,c,40,a)].
0.85/1.11	Derived: n0 = f4(A,B,C) | holdsAt(filling,f4(A,B,C)) | -stoppedIn(A,B,C).  [resolve(55,c,42,b)].
0.85/1.11	Derived: n0 = A | holdsAt(filling,A) | -releasedAt(B,A) | releasedAt(B,plus(A,n1)).  [resolve(55,c,44,b)].
0.85/1.11	Derived: n0 = A | holdsAt(filling,A) | releasedAt(B,A) | -releasedAt(B,plus(A,n1)).  [resolve(55,c,45,b)].
0.85/1.11	Derived: n0 = f8(A,B,C) | holdsAt(filling,f8(A,B,C)) | -startedIn(A,C,B).  [resolve(55,c,49,b)].
0.85/1.11	56 tapOn = A | holdsAt(waterLevel(n3),B) | -happens(A,B) # label(happens_all_defn) # label(axiom).  [clausify(17)].
3.14/3.43	Derived: tapOn = f1(A,B) | holdsAt(waterLevel(n3),B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(56,c,37,a)].
3.14/3.43	Derived: tapOn = f2(A,B) | holdsAt(waterLevel(n3),B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(56,c,40,a)].
3.14/3.43	Derived: tapOn = f3(A,B,C) | holdsAt(waterLevel(n3),f4(A,B,C)) | -stoppedIn(A,B,C).  [resolve(56,c,42,b)].
3.14/3.43	Derived: tapOn = f5(A,B) | holdsAt(waterLevel(n3),B) | -releasedAt(A,B) | releasedAt(A,plus(B,n1)).  [resolve(56,c,44,b)].
3.14/3.43	Derived: tapOn = f6(A,B) | holdsAt(waterLevel(n3),B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)).  [resolve(56,c,45,b)].
3.14/3.43	Derived: tapOn = f7(A,B,C) | holdsAt(waterLevel(n3),f8(A,B,C)) | -startedIn(A,C,B).  [resolve(56,c,49,b)].
3.14/3.43	57 tapOn = A | overflow = A | -happens(A,B) # label(happens_all_defn) # label(axiom).  [clausify(17)].
3.14/3.43	Derived: tapOn = f1(A,B) | overflow = f1(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(57,c,37,a)].
3.14/3.43	Derived: tapOn = f2(A,B) | overflow = f2(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(57,c,40,a)].
3.14/3.43	Derived: tapOn = f3(A,B,C) | overflow = f3(A,B,C) | -stoppedIn(A,B,C).  [resolve(57,c,42,b)].
3.14/3.43	Derived: tapOn = f5(A,B) | overflow = f5(A,B) | -releasedAt(A,B) | releasedAt(A,plus(B,n1)).  [resolve(57,c,44,b)].
3.14/3.43	Derived: tapOn = f6(A,B) | overflow = f6(A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)).  [resolve(57,c,45,b)].
3.14/3.43	Derived: tapOn = f7(A,B,C) | overflow = f7(A,B,C) | -startedIn(A,C,B).  [resolve(57,c,49,b)].
3.14/3.43	58 tapOn = A | holdsAt(filling,B) | -happens(A,B) # label(happens_all_defn) # label(axiom).  [clausify(17)].
3.14/3.43	Derived: tapOn = f1(A,B) | holdsAt(filling,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)).  [resolve(58,c,37,a)].
3.14/3.43	Derived: tapOn = f2(A,B) | holdsAt(filling,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)).  [resolve(58,c,40,a)].
3.14/3.43	Derived: tapOn = f3(A,B,C) | holdsAt(filling,f4(A,B,C)) | -stoppedIn(A,B,C).  [resolve(58,c,42,b)].
3.14/3.43	Derived: tapOn = f5(A,B) | holdsAt(filling,B) | -releasedAt(A,B) | releasedAt(A,plus(B,n1)).  [resolve(58,c,44,b)].
3.14/3.43	Derived: tapOn = f6(A,B) | holdsAt(filling,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)).  [resolve(58,c,45,b)].
3.14/3.43	Derived: tapOn = f7(A,B,C) | holdsAt(filling,f8(A,B,C)) | -startedIn(A,C,B).  [resolve(58,c,49,b)].
3.14/3.43	
3.14/3.43	============================== end predicate elimination =============
3.14/3.43	
3.14/3.43	Auto_denials:  (non-Horn, no changes).
3.14/3.43	
3.14/3.43	Term ordering decisions:
3.14/3.43	
3.14/3.43	% Assigning unary symbol waterLevel kb_weight 0 and highest precedence (40).
3.14/3.43	Function symbol KB weights:  n1=1. n0=1. tapOn=1. filling=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. f1=1. f2=1. f5=1. f6=1. f3=1. f4=1. f7=1. f8=1. f9=1. f10=1. f11=1. waterLevel=0.
3.14/3.43	
3.14/3.43	============================== end of process initial clauses ========
3.14/3.43	
3.14/3.43	============================== CLAUSES FOR SEARCH ====================
3.14/3.43	
3.14/3.43	============================== end of clauses for search =============
3.14/3.43	
3.14/3.43	============================== SEARCH ================================
3.14/3.43	
3.14/3.43	% Starting search at 0.05 seconds.
3.14/3.43	
3.14/3.43	Low Water (keep): wt=41.000, iters=3342
3.14/3.43	
3.14/3.43	Low Water (keep): wt=37.000, iters=3488
3.14/3.43	
3.14/3.43	Low Water (keep): wt=35.000, iters=3350
3.14/3.43	
3.14/3.43	Low Water (keep): wt=34.000, iters=3333
3.14/3.43	
3.14/3.43	Low Water (keep): wt=29.000, iters=5655
3.14/3.43	
3.14/3.43	Low Water (keep): wt=28.000, iters=5115
3.14/3.43	
3.14/3.43	Low Water (keep): wt=23.000, iters=3796
3.14/3.43	
3.14/3.43	Low Water (keep): wt=22.000, iters=3345
3.14/3.43	
3.14/3.43	============================== PROOF =================================
3.14/3.43	% SZS status Theorem
3.14/3.43	% SZS output start Refutation
3.14/3.43	
3.14/3.43	% Proof 1 at 2.29 (+ 0.06) seconds.
3.14/3.43	% Length of proof is 103.
3.14/3.43	% Level of proof is 19.
3.14/3.43	% Maximum clause weight is 29.000.
3.14/3.43	% Given clauses 2452.
3.14/3.43	
3.14/3.43	7 (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].
3.14/3.43	10 (all Event all Time all Fluent all Fluent2 all Offset (less(n0,Offset) & trajectory(Fluent,Time,Fluent2,Offset) & -stoppedIn(Time,Fluent,plus(Time,Offset)) & initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause).  [assumption].
3.14/3.43	15 (all Event all Fluent all Time (initiates(Event,Fluent,Time) <-> filling = Fluent & Event = tapOn | overflow = Event & spilling = Fluent | (exists Height (holdsAt(waterLevel(Height),Time) & tapOff = Event & waterLevel(Height) = Fluent)) | (exists Height (Fluent = waterLevel(Height) & Event = overflow & holdsAt(waterLevel(Height),Time))))) # label(initiates_all_defn) # label(axiom) # label(non_clause).  [assumption].
3.14/3.43	17 (all Event all Time (Time = n0 & Event = tapOn | holdsAt(waterLevel(n3),Time) & overflow = Event & holdsAt(filling,Time) <-> happens(Event,Time))) # label(happens_all_defn) # label(axiom) # label(non_clause).  [assumption].
3.14/3.43	20 (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].
3.14/3.43	21 (all Height1 all Time all Height2 all Offset (holdsAt(waterLevel(Height1),Time) & Height2 = plus(Height1,Offset) -> trajectory(filling,Time,waterLevel(Height2),Offset))) # label(change_of_waterLevel) # label(axiom) # label(non_clause).  [assumption].
3.14/3.43	23 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
3.14/3.43	24 (all X all Y (less_or_equal(X,Y) <-> less(X,Y) | Y = X)) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
3.14/3.43	26 (all X (less_or_equal(X,n3) <-> less(X,n4))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
3.14/3.43	28 (all X (less(X,n1) <-> less_or_equal(X,n0))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
3.14/3.43	30 (all X all Y (less(X,Y) <-> X != Y & -less(Y,X))) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
3.14/3.43	31 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
3.14/3.43	32 (all X (less_or_equal(X,n2) <-> less(X,n3))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
3.14/3.43	35 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
3.14/3.43	42 -stoppedIn(A,B,C) | happens(f3(A,B,C),f4(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(7)].
3.14/3.43	46 -less(n0,A) | -trajectory(B,C,D,A) | stoppedIn(C,B,plus(C,A)) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) # label(change_holding) # label(axiom).  [clausify(10)].
3.14/3.43	51 n0 != A | tapOn != B | happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(17)].
3.14/3.43	53 n0 = A | holdsAt(waterLevel(n3),A) | -happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(17)].
3.14/3.43	61 -stoppedIn(A,B,C) | less(A,f4(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(7)].
3.14/3.43	62 -stoppedIn(A,B,C) | less(f4(A,B,C),C) # label(stoppedin_defn) # label(axiom).  [clausify(7)].
3.14/3.43	95 initiates(A,B,C) | filling != B | tapOn != A # label(initiates_all_defn) # label(axiom).  [clausify(15)].
3.14/3.43	108 -holdsAt(waterLevel(A),B) | -holdsAt(waterLevel(C),B) | C = A # label(same_waterLevel) # label(axiom).  [clausify(20)].
3.14/3.43	109 -holdsAt(waterLevel(A),B) | plus(A,C) != D | trajectory(filling,B,waterLevel(D),C) # label(change_of_waterLevel) # label(axiom).  [clausify(21)].
3.14/3.43	120 -less_or_equal(A,n1) | less(A,n2) # label(less2) # label(axiom).  [clausify(23)].
3.14/3.43	121 less_or_equal(A,n1) | -less(A,n2) # label(less2) # label(axiom).  [clausify(23)].
3.14/3.43	122 -less_or_equal(A,B) | less(A,B) | B = A # label(less_or_equal) # label(axiom).  [clausify(24)].
3.14/3.43	123 less_or_equal(A,B) | -less(A,B) # label(less_or_equal) # label(axiom).  [clausify(24)].
3.14/3.43	124 less_or_equal(A,B) | B != A # label(less_or_equal) # label(axiom).  [clausify(24)].
3.14/3.43	127 -less_or_equal(A,n3) | less(A,n4) # label(less4) # label(axiom).  [clausify(26)].
3.14/3.43	128 less_or_equal(A,n3) | -less(A,n4) # label(less4) # label(axiom).  [clausify(26)].
3.14/3.43	131 holdsAt(waterLevel(n0),n0) # label(waterLevel_0) # label(hypothesis).  [assumption].
3.14/3.43	136 -less(A,n1) | less_or_equal(A,n0) # label(less1) # label(axiom).  [clausify(28)].
3.14/3.43	137 less(A,n1) | -less_or_equal(A,n0) # label(less1) # label(axiom).  [clausify(28)].
3.14/3.43	140 -less(A,B) | B != A # label(less_property) # label(axiom).  [clausify(30)].
3.14/3.43	141 -less(A,B) | -less(B,A) # label(less_property) # label(axiom).  [clausify(30)].
3.14/3.43	142 less(A,B) | B = A | less(B,A) # label(less_property) # label(axiom).  [clausify(30)].
3.14/3.43	143 plus(A,B) = plus(B,A) # label(symmetry_of_plus) # label(axiom).  [clausify(31)].
3.14/3.43	147 -less_or_equal(A,n2) | less(A,n3) # label(less3) # label(axiom).  [clausify(32)].
3.14/3.43	148 less_or_equal(A,n2) | -less(A,n3) # label(less3) # label(axiom).  [clausify(32)].
3.14/3.43	153 -less(A,n0) # label(less0) # label(axiom).  [clausify(35)].
3.14/3.43	154 plus(n0,n2) = n2 # label(plus0_2) # label(axiom).  [assumption].
3.14/3.43	155 n1 = plus(n0,n1) # label(plus0_1) # label(axiom).  [assumption].
3.14/3.43	156 plus(n1,n0) = n1.  [copy(155),rewrite([143(4)]),flip(a)].
3.14/3.43	157 -holdsAt(waterLevel(n2),n2) # label(waterLevel_2) # label(negated_conjecture).  [assumption].
3.14/3.43	235 n0 != A | tapOn != B | -less(n0,C) | -trajectory(D,A,E,C) | stoppedIn(A,D,plus(A,C)) | -initiates(B,D,A) | holdsAt(E,plus(A,C)).  [resolve(51,c,46,e)].
3.14/3.43	250 n0 = f4(A,B,C) | holdsAt(waterLevel(n3),f4(A,B,C)) | -stoppedIn(A,B,C).  [resolve(53,c,42,b)].
3.14/3.43	251 f4(A,B,C) = n0 | holdsAt(waterLevel(n3),f4(A,B,C)) | -stoppedIn(A,B,C).  [copy(250),flip(a)].
3.14/3.43	331 initiates(A,filling,B) | tapOn != A.  [xx_res(95,b)].
3.14/3.43	341 less_or_equal(A,A).  [xx_res(124,b)].
3.14/3.43	342 plus(A,n0) != B | trajectory(filling,n0,waterLevel(B),A).  [resolve(131,a,109,a),rewrite([143(2)])].
3.14/3.43	350 n1 = A | less(n1,A) | less_or_equal(A,n0).  [resolve(142,a,136,a)].
3.14/3.43	352 n4 = A | less(n4,A) | less_or_equal(A,n3).  [resolve(142,a,128,b)].
3.14/3.43	355 n2 = A | less(n2,A) | less_or_equal(A,n1).  [resolve(142,a,121,b)].
3.14/3.43	385 less(n0,n1).  [resolve(341,a,137,b)].
3.14/3.43	389 less(n1,n2).  [resolve(341,a,120,a)].
3.14/3.43	402 n0 != n1.  [resolve(385,a,140,a),flip(a)].
3.14/3.43	403 less_or_equal(n0,n1).  [resolve(385,a,123,b)].
3.14/3.43	424 less_or_equal(n1,n2).  [resolve(389,a,123,b)].
3.14/3.43	430 less(n0,n2).  [resolve(403,a,120,a)].
3.14/3.43	433 initiates(tapOn,filling,A).  [xx_res(331,b)].
3.14/3.43	435 less(n1,n3).  [resolve(424,a,147,a)].
3.14/3.43	443 n2 != n0.  [resolve(430,a,140,a)].
3.14/3.43	444 less_or_equal(n0,n2).  [resolve(430,a,123,b)].
3.14/3.43	456 n3 != n1.  [resolve(435,a,140,a)].
3.14/3.43	462 less(n0,n3).  [resolve(444,a,147,a)].
3.14/3.43	472 n3 != n0.  [resolve(462,a,140,a)].
3.14/3.43	473 less_or_equal(n0,n3).  [resolve(462,a,123,b)].
3.14/3.43	483 trajectory(filling,n0,waterLevel(n1),n1).  [resolve(342,a,156,a)].
3.14/3.43	484 trajectory(filling,n0,waterLevel(plus(A,n0)),A).  [resolve(342,a,143,a),rewrite([143(4)])].
3.14/3.43	495 less(n0,n4).  [resolve(473,a,127,a)].
3.14/3.43	505 n4 != n0.  [resolve(495,a,140,a)].
3.14/3.43	550 n1 = A | less(n1,A) | n0 = A.  [resolve(350,c,122,a),unit_del(c,153)].
3.14/3.43	566 n4 = A | less(n4,A) | less(A,n3) | n3 = A.  [resolve(352,c,122,a)].
3.14/3.43	591 n2 = A | less(n2,A) | less(A,n1) | n1 = A.  [resolve(355,c,122,a)].
3.14/3.43	607 tapOn != A | stoppedIn(n0,filling,n1) | -initiates(A,filling,n0) | holdsAt(waterLevel(n1),n1).  [resolve(483,a,235,d),rewrite([143(13),156(13),143(20),156(20)]),xx(a),unit_del(b,385)].
3.14/3.43	614 tapOn != A | -less(n0,B) | stoppedIn(n0,filling,plus(B,n0)) | -initiates(A,filling,n0) | holdsAt(waterLevel(plus(B,n0)),plus(B,n0)).  [resolve(484,a,235,d),rewrite([143(11),143(20)]),xx(a)].
3.14/3.43	648 n1 = A | n0 = A | -less(A,n1).  [resolve(550,b,141,b)].
3.14/3.43	722 n4 = A | less(n4,A) | n3 = A | less_or_equal(A,n2).  [resolve(566,c,148,b)].
3.14/3.43	732 n2 = A | less(n2,A) | n1 = A | n0 = A.  [resolve(591,c,648,c),merge(d)].
3.14/3.43	1116 stoppedIn(n0,filling,n1) | holdsAt(waterLevel(n1),n1).  [resolve(607,c,433,a),xx(a)].
3.14/3.43	1127 holdsAt(waterLevel(n1),n1) | less(f4(n0,filling,n1),n1).  [resolve(1116,a,62,a)].
3.14/3.43	1128 holdsAt(waterLevel(n1),n1) | less(n0,f4(n0,filling,n1)).  [resolve(1116,a,61,a)].
3.14/3.43	1179 -less(n0,A) | stoppedIn(n0,filling,plus(A,n0)) | holdsAt(waterLevel(plus(A,n0)),plus(A,n0)).  [resolve(614,d,433,a),xx(a)].
3.14/3.43	1501 n4 = A | less(n4,A) | n3 = A | less(A,n2) | n2 = A.  [resolve(722,d,122,a)].
3.14/3.43	1585 n2 = A | n1 = A | n0 = A | -less(A,n2).  [resolve(732,b,141,b)].
3.14/3.43	1961 holdsAt(waterLevel(n1),n1) | less_or_equal(f4(n0,filling,n1),n0).  [resolve(1127,b,136,a)].
3.14/3.43	1966 holdsAt(waterLevel(n1),n1) | f4(n0,filling,n1) != n0.  [resolve(1128,b,140,a)].
3.14/3.43	2011 holdsAt(waterLevel(n1),n1) | f4(n0,filling,n1) = n0.  [resolve(1961,b,122,a),flip(c),unit_del(b,153)].
3.14/3.43	2069 f4(n0,filling,n1) = n0 | -holdsAt(waterLevel(A),n1) | n1 = A.  [resolve(2011,a,108,b)].
3.14/3.43	9761 stoppedIn(n0,filling,n2).  [resolve(1179,a,1501,d),rewrite([143(5),154(5),143(7),154(7),143(9),154(9)]),unit_del(b,157),unit_del(c,505),unit_del(d,153),unit_del(e,472),unit_del(f,443)].
3.14/3.43	9771 f4(n0,filling,n2) = n0 | holdsAt(waterLevel(n3),f4(n0,filling,n2)).  [resolve(9761,a,251,c)].
3.14/3.43	9776 less(f4(n0,filling,n2),n2).  [resolve(9761,a,62,a)].
3.14/3.43	9777 less(n0,f4(n0,filling,n2)).  [resolve(9761,a,61,a)].
3.14/3.43	9780 f4(n0,filling,n2) = n2 | f4(n0,filling,n2) = n1 | f4(n0,filling,n2) = n0.  [resolve(9776,a,1585,d),flip(a),flip(b),flip(c)].
3.14/3.43	9825 f4(n0,filling,n2) != n2.  [resolve(9776,a,140,a),flip(a)].
3.14/3.43	9834 f4(n0,filling,n2) = n1 | f4(n0,filling,n2) = n0.  [back_unit_del(9780),unit_del(a,9825)].
3.14/3.43	9858 f4(n0,filling,n2) != n0.  [resolve(9777,a,140,a)].
3.14/3.43	9860 f4(n0,filling,n2) = n1.  [back_unit_del(9834),unit_del(b,9858)].
3.14/3.43	9861 holdsAt(waterLevel(n3),n1).  [back_unit_del(9771),rewrite([9860(4),9860(9)]),flip(a),unit_del(a,402)].
3.14/3.43	10607 f4(n0,filling,n1) = n0.  [resolve(9861,a,2069,b),flip(b),unit_del(b,456)].
3.14/3.43	10610 -holdsAt(waterLevel(A),n1) | n3 = A.  [resolve(9861,a,108,b)].
3.14/3.43	10618 holdsAt(waterLevel(n1),n1).  [back_rewrite(1966),rewrite([10607(8)]),xx(b)].
3.14/3.43	12798 $F.  [resolve(10610,a,10618,a),unit_del(a,456)].
3.14/3.43	
3.14/3.43	% SZS output end Refutation
3.14/3.43	============================== end of proof ==========================
3.14/3.43	
3.14/3.43	============================== STATISTICS ============================
3.14/3.43	
3.14/3.43	Given=2452. Generated=95732. Kept=12686. proofs=1.
3.14/3.43	Usable=1964. Sos=6218. Demods=34. Limbo=0, Disabled=4727. Hints=0.
3.14/3.43	Megabytes=12.18.
3.14/3.43	User_CPU=2.29, System_CPU=0.06, Wall_clock=3.
3.14/3.43	
3.14/3.43	============================== end of statistics =====================
3.14/3.43	
3.14/3.43	============================== end of search =========================
3.14/3.43	
3.14/3.43	THEOREM PROVED
3.14/3.43	% SZS status Theorem
3.14/3.43	
3.14/3.43	Exiting with 1 proof.
3.14/3.43	
3.14/3.43	Process 22483 exit (max_proofs) Thu Aug 29 13:04:56 2019
3.14/3.44	Prover9 interrupted
3.14/3.44	EOF