0.12/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.34 % Computer : n010.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 180 0.13/0.34 % DateTime : Thu Aug 29 13:38:36 EDT 2019 0.13/0.35 % CPUTime : 0.43/1.04 ============================== Prover9 =============================== 0.43/1.04 Prover9 (32) version 2009-11A, November 2009. 0.43/1.04 Process 9303 was started by sandbox on n010.cluster.edu, 0.43/1.04 Thu Aug 29 13:38:37 2019 0.43/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_8934_n010.cluster.edu". 0.43/1.04 ============================== end of head =========================== 0.43/1.04 0.43/1.04 ============================== INPUT ================================= 0.43/1.04 0.43/1.04 % Reading from file /tmp/Prover9_8934_n010.cluster.edu 0.43/1.04 0.43/1.04 set(prolog_style_variables). 0.43/1.04 set(auto2). 0.43/1.04 % set(auto2) -> set(auto). 0.43/1.04 % set(auto) -> set(auto_inference). 0.43/1.04 % set(auto) -> set(auto_setup). 0.43/1.04 % set(auto_setup) -> set(predicate_elim). 0.43/1.04 % set(auto_setup) -> assign(eq_defs, unfold). 0.43/1.04 % set(auto) -> set(auto_limits). 0.43/1.04 % set(auto_limits) -> assign(max_weight, "100.000"). 0.43/1.04 % set(auto_limits) -> assign(sos_limit, 20000). 0.43/1.04 % set(auto) -> set(auto_denials). 0.43/1.04 % set(auto) -> set(auto_process). 0.43/1.04 % set(auto2) -> assign(new_constants, 1). 0.43/1.04 % set(auto2) -> assign(fold_denial_max, 3). 0.43/1.04 % set(auto2) -> assign(max_weight, "200.000"). 0.43/1.04 % set(auto2) -> assign(max_hours, 1). 0.43/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.43/1.04 % set(auto2) -> assign(max_seconds, 0). 0.43/1.04 % set(auto2) -> assign(max_minutes, 5). 0.43/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.43/1.04 % set(auto2) -> set(sort_initial_sos). 0.43/1.04 % set(auto2) -> assign(sos_limit, -1). 0.43/1.04 % set(auto2) -> assign(lrs_ticks, 3000). 0.43/1.04 % set(auto2) -> assign(max_megs, 400). 0.43/1.04 % set(auto2) -> assign(stats, some). 0.43/1.04 % set(auto2) -> clear(echo_input). 0.43/1.04 % set(auto2) -> set(quiet). 0.43/1.04 % set(auto2) -> clear(print_initial_clauses). 0.43/1.04 % set(auto2) -> clear(print_given). 0.43/1.04 assign(lrs_ticks,-1). 0.43/1.04 assign(sos_limit,10000). 0.43/1.04 assign(order,kbo). 0.43/1.04 set(lex_order_vars). 0.43/1.04 clear(print_given). 0.43/1.04 0.43/1.04 % formulas(sos). % not echoed (55 formulas) 0.43/1.04 0.43/1.04 ============================== end of input ========================== 0.43/1.04 0.43/1.04 % From the command line: assign(max_seconds, 180). 0.43/1.04 0.43/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.43/1.04 0.43/1.04 % Formulas that are not ordinary clauses: 0.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 14 (all X waterLevel(X) != spilling) # label(spilling_not_waterLevel) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 18 (all X filling != waterLevel(X)) # label(filling_not_waterLevel) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 19 (all X all Y (Y = X <-> waterLevel(X) = waterLevel(Y))) # label(distinct_waterLevels) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 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.43/1.04 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.43/1.04 22 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 23 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 24 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 25 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 26 (all X (less_or_equal(X,n3) <-> less(X,n4))) # label(less4) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 27 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 28 (all X all Y plus(Y,X) = plus(X,Y)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 29 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 30 (all X all Y (Y = X | less(X,Y) <-> less_or_equal(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 31 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 32 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 33 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 34 (all Height -releasedAt(waterLevel(Height),n0)) # label(not_released_waterLevel_0) # label(hypothesis) # label(non_clause). [assumption]. 0.43/1.04 35 (all X all Y (X != Y & -less(Y,X) <-> less(X,Y))) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 36 --stoppedIn(n0,filling,n3) # label(not_stopped_filling_0_3) # label(negated_conjecture) # label(non_clause). [assumption]. 0.43/1.04 0.43/1.04 ============================== end of process non-clausal formulas === 0.43/1.04 0.43/1.04 ============================== PROCESS INITIAL CLAUSES =============== 0.43/1.04 0.43/1.04 ============================== PREDICATE ELIMINATION ================= 0.43/1.04 37 -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.43/1.04 38 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.43/1.04 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(37,a,38,a)]. 0.43/1.04 39 -releases(A,B,C) | -happens(A,C) | releasedAt(B,plus(C,n1)) # label(happens_releases) # label(axiom). [clausify(3)]. 0.43/1.04 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(39,b,38,a)]. 0.43/1.04 40 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom). [clausify(4)]. 0.43/1.04 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(40,b,38,a)]. 0.43/1.04 41 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.43/1.04 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(41,a,37,a)]. 0.43/1.04 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(41,a,39,b)]. 0.43/1.04 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(41,a,40,b)]. 0.43/1.04 42 -terminates(A,B,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)) # label(happens_terminates_not_holds) # label(axiom). [clausify(6)]. 0.43/1.04 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(42,b,38,a)]. 0.43/1.04 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(42,b,41,a)]. 0.43/1.04 43 -stoppedIn(A,B,C) | happens(f3(A,B,C),f4(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(7)]. 0.43/1.04 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(43,b,37,a)]. 0.43/1.04 Derived: -stoppedIn(A,B,C) | -releases(f3(A,B,C),D,f4(A,B,C)) | releasedAt(D,plus(f4(A,B,C),n1)). [resolve(43,b,39,b)]. 0.43/1.04 Derived: -stoppedIn(A,B,C) | -initiates(f3(A,B,C),D,f4(A,B,C)) | holdsAt(D,plus(f4(A,B,C),n1)). [resolve(43,b,40,b)]. 0.43/1.04 Derived: -stoppedIn(A,B,C) | -terminates(f3(A,B,C),D,f4(A,B,C)) | -holdsAt(D,plus(f4(A,B,C),n1)). [resolve(43,b,42,b)]. 0.43/1.04 44 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.43/1.04 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(44,e,38,a)]. 0.43/1.04 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(44,e,41,a)]. 0.43/1.04 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(44,e,43,b)]. 0.43/1.04 45 -releasedAt(A,B) | happens(f5(A,B),B) | releasedAt(A,plus(B,n1)) # label(keep_released) # label(axiom). [clausify(8)]. 0.43/1.04 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(45,b,37,a)]. 0.43/1.04 Derived: -releasedAt(A,B) | releasedAt(A,plus(B,n1)) | -releases(f5(A,B),C,B) | releasedAt(C,plus(B,n1)). [resolve(45,b,39,b)]. 0.43/1.04 Derived: -releasedAt(A,B) | releasedAt(A,plus(B,n1)) | -initiates(f5(A,B),C,B) | holdsAt(C,plus(B,n1)). [resolve(45,b,40,b)]. 0.43/1.04 Derived: -releasedAt(A,B) | releasedAt(A,plus(B,n1)) | -terminates(f5(A,B),C,B) | -holdsAt(C,plus(B,n1)). [resolve(45,b,42,b)]. 0.43/1.04 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(45,b,44,e)]. 0.43/1.04 46 releasedAt(A,B) | happens(f6(A,B),B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom). [clausify(9)]. 0.43/1.04 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(46,b,37,a)]. 0.43/1.04 Derived: releasedAt(A,B) | -releasedAt(A,plus(B,n1)) | -releases(f6(A,B),C,B) | releasedAt(C,plus(B,n1)). [resolve(46,b,39,b)]. 0.43/1.04 Derived: releasedAt(A,B) | -releasedAt(A,plus(B,n1)) | -initiates(f6(A,B),C,B) | holdsAt(C,plus(B,n1)). [resolve(46,b,40,b)]. 0.43/1.04 Derived: releasedAt(A,B) | -releasedAt(A,plus(B,n1)) | -terminates(f6(A,B),C,B) | -holdsAt(C,plus(B,n1)). [resolve(46,b,42,b)]. 0.43/1.04 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(46,b,44,e)]. 0.43/1.04 47 -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.43/1.04 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(47,e,38,a)]. 0.43/1.04 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(47,e,41,a)]. 0.43/1.04 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(47,e,43,b)]. 0.43/1.04 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(47,e,45,b)]. 0.43/1.04 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(47,e,46,b)]. 0.43/1.04 48 -happens(A,B) | -initiates(A,C,B) | -releasedAt(C,plus(B,n1)) # label(happens_not_released) # label(axiom). [clausify(11)]. 0.43/1.04 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(48,a,38,a)]. 0.43/1.04 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(48,a,41,a)]. 0.43/1.04 Derived: -initiates(f3(A,B,C),D,f4(A,B,C)) | -releasedAt(D,plus(f4(A,B,C),n1)) | -stoppedIn(A,B,C). [resolve(48,a,43,b)]. 0.43/1.04 Derived: -initiates(f5(A,B),C,B) | -releasedAt(C,plus(B,n1)) | -releasedAt(A,B) | releasedAt(A,plus(B,n1)). [resolve(48,a,45,b)]. 0.43/1.04 Derived: -initiates(f6(A,B),C,B) | -releasedAt(C,plus(B,n1)) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)). [resolve(48,a,46,b)]. 0.43/1.04 49 -happens(A,B) | -terminates(A,C,B) | -releasedAt(C,plus(B,n1)) # label(happens_not_released) # label(axiom). [clausify(11)]. 0.43/1.04 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(49,a,38,a)]. 0.43/1.04 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(49,a,41,a)]. 0.43/1.04 Derived: -terminates(f3(A,B,C),D,f4(A,B,C)) | -releasedAt(D,plus(f4(A,B,C),n1)) | -stoppedIn(A,B,C). [resolve(49,a,43,b)]. 0.43/1.04 Derived: -terminates(f5(A,B),C,B) | -releasedAt(C,plus(B,n1)) | -releasedAt(A,B) | releasedAt(A,plus(B,n1)). [resolve(49,a,45,b)]. 0.43/1.04 Derived: -terminates(f6(A,B),C,B) | -releasedAt(C,plus(B,n1)) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)). [resolve(49,a,46,b)]. 0.43/1.04 50 -startedIn(A,B,C) | happens(f7(A,C,B),f8(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(12)]. 0.43/1.04 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(50,b,37,a)]. 0.43/1.04 Derived: -startedIn(A,B,C) | -releases(f7(A,C,B),D,f8(A,C,B)) | releasedAt(D,plus(f8(A,C,B),n1)). [resolve(50,b,39,b)]. 0.43/1.04 Derived: -startedIn(A,B,C) | -initiates(f7(A,C,B),D,f8(A,C,B)) | holdsAt(D,plus(f8(A,C,B),n1)). [resolve(50,b,40,b)]. 0.43/1.04 Derived: -startedIn(A,B,C) | -terminates(f7(A,C,B),D,f8(A,C,B)) | -holdsAt(D,plus(f8(A,C,B),n1)). [resolve(50,b,42,b)]. 0.43/1.04 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(50,b,44,e)]. 0.43/1.04 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(50,b,47,e)]. 0.43/1.04 Derived: -startedIn(A,B,C) | -initiates(f7(A,C,B),D,f8(A,C,B)) | -releasedAt(D,plus(f8(A,C,B),n1)). [resolve(50,b,48,a)]. 0.43/1.04 Derived: -startedIn(A,B,C) | -terminates(f7(A,C,B),D,f8(A,C,B)) | -releasedAt(D,plus(f8(A,C,B),n1)). [resolve(50,b,49,a)]. 0.43/1.04 51 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.43/1.04 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(51,b,38,a)]. 0.43/1.04 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(51,b,41,a)]. 0.43/1.04 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(51,b,43,b)]. 0.43/1.04 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(51,b,45,b)]. 0.43/1.04 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(51,b,46,b)]. 0.43/1.04 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(51,b,50,b)]. 0.43/1.04 52 n0 != A | tapOn != B | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 0.43/1.04 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(52,c,37,a)]. 0.43/1.04 Derived: n0 != A | tapOn != B | -releases(B,C,A) | releasedAt(C,plus(A,n1)). [resolve(52,c,39,b)]. 0.43/1.04 Derived: n0 != A | tapOn != B | -initiates(B,C,A) | holdsAt(C,plus(A,n1)). [resolve(52,c,40,b)]. 0.43/1.04 Derived: n0 != A | tapOn != B | -terminates(B,C,A) | -holdsAt(C,plus(A,n1)). [resolve(52,c,42,b)]. 0.43/1.04 Derived: n0 != A | tapOn != B | stoppedIn(C,D,E) | -less(C,A) | -less(A,E) | -terminates(B,D,A). [resolve(52,c,44,e)]. 0.43/1.04 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(52,c,47,e)]. 0.43/1.04 Derived: n0 != A | tapOn != B | -initiates(B,C,A) | -releasedAt(C,plus(A,n1)). [resolve(52,c,48,a)]. 0.43/1.04 Derived: n0 != A | tapOn != B | -terminates(B,C,A) | -releasedAt(C,plus(A,n1)). [resolve(52,c,49,a)]. 0.43/1.05 Derived: n0 != A | tapOn != B | startedIn(C,D,E) | -initiates(B,D,A) | -less(A,E) | -less(C,A). [resolve(52,c,51,b)]. 0.43/1.05 53 -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 0.43/1.05 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(53,d,37,a)]. 0.43/1.05 Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | -releases(B,C,A) | releasedAt(C,plus(A,n1)). [resolve(53,d,39,b)]. 0.43/1.05 Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | -initiates(B,C,A) | holdsAt(C,plus(A,n1)). [resolve(53,d,40,b)]. 0.43/1.05 Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | -terminates(B,C,A) | -holdsAt(C,plus(A,n1)). [resolve(53,d,42,b)]. 0.43/1.05 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(53,d,44,e)]. 0.43/1.05 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(53,d,47,e)]. 0.43/1.05 Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | -initiates(B,C,A) | -releasedAt(C,plus(A,n1)). [resolve(53,d,48,a)]. 0.43/1.05 Derived: -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | -terminates(B,C,A) | -releasedAt(C,plus(A,n1)). [resolve(53,d,49,a)]. 0.43/1.05 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(53,d,51,b)]. 0.43/1.05 54 n0 = A | holdsAt(waterLevel(n3),A) | -happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 0.43/1.05 Derived: n0 = A | holdsAt(waterLevel(n3),A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,A) | holdsAt(B,plus(A,n1)). [resolve(54,c,38,a)]. 0.43/1.05 Derived: n0 = A | holdsAt(waterLevel(n3),A) | releasedAt(B,plus(A,n1)) | holdsAt(B,A) | -holdsAt(B,plus(A,n1)). [resolve(54,c,41,a)]. 0.43/1.05 Derived: n0 = f4(A,B,C) | holdsAt(waterLevel(n3),f4(A,B,C)) | -stoppedIn(A,B,C). [resolve(54,c,43,b)]. 0.43/1.05 Derived: n0 = A | holdsAt(waterLevel(n3),A) | -releasedAt(B,A) | releasedAt(B,plus(A,n1)). [resolve(54,c,45,b)]. 0.43/1.05 Derived: n0 = A | holdsAt(waterLevel(n3),A) | releasedAt(B,A) | -releasedAt(B,plus(A,n1)). [resolve(54,c,46,b)]. 0.43/1.05 Derived: n0 = f8(A,B,C) | holdsAt(waterLevel(n3),f8(A,B,C)) | -startedIn(A,C,B). [resolve(54,c,50,b)]. 0.43/1.05 55 n0 = A | overflow = B | -happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 0.43/1.05 Derived: n0 = A | overflow = f1(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,A) | holdsAt(B,plus(A,n1)). [resolve(55,c,38,a)]. 0.43/1.05 Derived: n0 = A | overflow = f2(B,A) | releasedAt(B,plus(A,n1)) | holdsAt(B,A) | -holdsAt(B,plus(A,n1)). [resolve(55,c,41,a)]. 0.43/1.05 Derived: n0 = f4(A,B,C) | overflow = f3(A,B,C) | -stoppedIn(A,B,C). [resolve(55,c,43,b)]. 0.43/1.05 Derived: n0 = A | overflow = f5(B,A) | -releasedAt(B,A) | releasedAt(B,plus(A,n1)). [resolve(55,c,45,b)]. 0.43/1.05 Derived: n0 = A | overflow = f6(B,A) | releasedAt(B,A) | -releasedAt(B,plus(A,n1)). [resolve(55,c,46,b)]. 0.43/1.05 Derived: n0 = f8(A,B,C) | overflow = f7(A,B,C) | -startedIn(A,C,B). [resolve(55,c,50,b)]. 0.43/1.05 56 n0 = A | holdsAt(filling,A) | -happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 0.43/1.05 Derived: n0 = A | holdsAt(filling,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,A) | holdsAt(B,plus(A,n1)). [resolve(56,c,38,a)]. 0.43/1.05 Derived: n0 = A | holdsAt(filling,A) | releasedAt(B,plus(A,n1)) | holdsAt(B,A) | -holdsAt(B,plus(A,n1)). [resolve(56,c,41,a)]. 0.43/1.05 Derived: n0 = f4(A,B,C) | holdsAt(filling,f4(A,B,C)) | -stoppedIn(A,B,C). [resolve(56,c,43,b)]. 0.43/1.05 Derived: n0 = A | holdsAt(filling,A) | -releasedAt(B,A) | releasedAt(B,plus(A,n1)). [resolve(56,c,45,b)]. 0.43/1.05 Derived: n0 = A | holdsAt(filling,A) | releasedAt(B,A) | -releasedAt(B,plus(A,n1)). [resolve(56,c,46,b)]. 0.43/1.05 Derived: n0 = f8(A,B,C) | holdsAt(filling,f8(A,B,C)) | -startedIn(A,C,B). [resolve(56,c,50,b)]. 166.09/166.36 57 tapOn = A | holdsAt(waterLevel(n3),B) | -happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(17)]. 166.09/166.36 Derived: tapOn = f1(A,B) | holdsAt(waterLevel(n3),B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)). [resolve(57,c,38,a)]. 166.09/166.36 Derived: tapOn = f2(A,B) | holdsAt(waterLevel(n3),B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)). [resolve(57,c,41,a)]. 166.09/166.36 Derived: tapOn = f3(A,B,C) | holdsAt(waterLevel(n3),f4(A,B,C)) | -stoppedIn(A,B,C). [resolve(57,c,43,b)]. 166.09/166.36 Derived: tapOn = f5(A,B) | holdsAt(waterLevel(n3),B) | -releasedAt(A,B) | releasedAt(A,plus(B,n1)). [resolve(57,c,45,b)]. 166.09/166.36 Derived: tapOn = f6(A,B) | holdsAt(waterLevel(n3),B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)). [resolve(57,c,46,b)]. 166.09/166.36 Derived: tapOn = f7(A,B,C) | holdsAt(waterLevel(n3),f8(A,B,C)) | -startedIn(A,C,B). [resolve(57,c,50,b)]. 166.09/166.36 58 tapOn = A | overflow = A | -happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(17)]. 166.09/166.36 Derived: tapOn = f1(A,B) | overflow = f1(A,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)). [resolve(58,c,38,a)]. 166.09/166.36 Derived: tapOn = f2(A,B) | overflow = f2(A,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)). [resolve(58,c,41,a)]. 166.09/166.36 Derived: tapOn = f3(A,B,C) | overflow = f3(A,B,C) | -stoppedIn(A,B,C). [resolve(58,c,43,b)]. 166.09/166.36 Derived: tapOn = f5(A,B) | overflow = f5(A,B) | -releasedAt(A,B) | releasedAt(A,plus(B,n1)). [resolve(58,c,45,b)]. 166.09/166.36 Derived: tapOn = f6(A,B) | overflow = f6(A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)). [resolve(58,c,46,b)]. 166.09/166.36 Derived: tapOn = f7(A,B,C) | overflow = f7(A,B,C) | -startedIn(A,C,B). [resolve(58,c,50,b)]. 166.09/166.36 59 tapOn = A | holdsAt(filling,B) | -happens(A,B) # label(happens_all_defn) # label(axiom). [clausify(17)]. 166.09/166.36 Derived: tapOn = f1(A,B) | holdsAt(filling,B) | releasedAt(A,plus(B,n1)) | -holdsAt(A,B) | holdsAt(A,plus(B,n1)). [resolve(59,c,38,a)]. 166.09/166.36 Derived: tapOn = f2(A,B) | holdsAt(filling,B) | releasedAt(A,plus(B,n1)) | holdsAt(A,B) | -holdsAt(A,plus(B,n1)). [resolve(59,c,41,a)]. 166.09/166.36 Derived: tapOn = f3(A,B,C) | holdsAt(filling,f4(A,B,C)) | -stoppedIn(A,B,C). [resolve(59,c,43,b)]. 166.09/166.36 Derived: tapOn = f5(A,B) | holdsAt(filling,B) | -releasedAt(A,B) | releasedAt(A,plus(B,n1)). [resolve(59,c,45,b)]. 166.09/166.36 Derived: tapOn = f6(A,B) | holdsAt(filling,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)). [resolve(59,c,46,b)]. 166.09/166.36 Derived: tapOn = f7(A,B,C) | holdsAt(filling,f8(A,B,C)) | -startedIn(A,C,B). [resolve(59,c,50,b)]. 166.09/166.36 166.09/166.36 ============================== end predicate elimination ============= 166.09/166.36 166.09/166.36 Auto_denials: (non-Horn, no changes). 166.09/166.36 166.09/166.36 Term ordering decisions: 166.09/166.36 166.09/166.36 % Assigning unary symbol waterLevel kb_weight 0 and highest precedence (40). 166.09/166.36 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. 166.09/166.36 166.09/166.36 ============================== end of process initial clauses ======== 166.09/166.36 166.09/166.36 ============================== CLAUSES FOR SEARCH ==================== 166.09/166.36 166.09/166.36 ============================== end of clauses for search ============= 166.09/166.36 166.09/166.36 ============================== SEARCH ================================ 166.09/166.36 166.09/166.36 % Starting search at 0.03 seconds. 166.09/166.36 166.09/166.36 Low Water (keep): wt=20.000, iters=3616 166.09/166.36 166.09/166.36 Low Water (keep): wt=17.000, iters=3476 166.09/166.36 166.09/166.36 Low Water (displace): id=7240, wt=60.000 166.09/166.36 166.09/166.36 Low Water (displace): id=7238, wt=52.000 166.09/166.36 166.09/166.36 Low Water (displace): id=8429, wt=41.000 166.09/166.36 166.09/166.36 Low Water (displace): id=7236, wt=36.000 166.09/166.36 166.09/166.36 Low Water (displace): id=8426, wt=35.000 166.09/166.36 166.09/166.36 Low Water (displace): id=8454, wt=34.000 166.09/166.36 166.09/166.36 Low Water (displace): id=7385, wt=33.000 166.09/166.36 166.09/166.36 Low Water (displace): id=21574, wt=16.000 166.09/166.36 166.09/166.36 Low Water (displace): id=21810, wt=15.000 166.09/166.36 166.09/166.36 ============================== PROOF ================================= 166.09/166.36 % SZS status Theorem 166.09/166.36 % SZS output start Refutation 166.09/166.36 166.09/166.36 % Proof 1 at 163.28 (+ 2.07) seconds. 166.09/166.36 % Length of proof is 237. 166.09/166.36 % Level of proof is 26. 166.09/166.36 % Maximum clause weight is 29.000. 166.09/166.36 % Given clauses 34401. 166.09/166.36 166.09/166.36 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]. 166.09/166.36 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]. 166.09/166.36 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]. 166.09/166.36 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]. 166.09/166.36 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]. 166.09/166.36 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]. 166.09/166.36 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]. 166.09/166.36 14 (all X waterLevel(X) != spilling) # label(spilling_not_waterLevel) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 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]. 166.09/166.36 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]. 166.09/166.36 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]. 166.09/166.36 19 (all X all Y (Y = X <-> waterLevel(X) = waterLevel(Y))) # label(distinct_waterLevels) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 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]. 166.09/166.36 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]. 166.09/166.36 22 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 23 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 24 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 25 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 26 (all X (less_or_equal(X,n3) <-> less(X,n4))) # label(less4) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 27 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 28 (all X all Y plus(Y,X) = plus(X,Y)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 29 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 30 (all X all Y (Y = X | less(X,Y) <-> less_or_equal(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 31 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 32 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 33 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 35 (all X all Y (X != Y & -less(Y,X) <-> less(X,Y))) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 166.09/166.36 36 --stoppedIn(n0,filling,n3) # label(not_stopped_filling_0_3) # label(negated_conjecture) # label(non_clause). [assumption]. 166.09/166.36 38 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)]. 166.09/166.36 40 -initiates(A,B,C) | -happens(A,C) | holdsAt(B,plus(C,n1)) # label(happens_holds) # label(axiom). [clausify(4)]. 166.09/166.36 42 -terminates(A,B,C) | -happens(A,C) | -holdsAt(B,plus(C,n1)) # label(happens_terminates_not_holds) # label(axiom). [clausify(6)]. 166.09/166.36 43 -stoppedIn(A,B,C) | happens(f3(A,B,C),f4(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(7)]. 166.09/166.36 44 stoppedIn(A,B,C) | -less(A,D) | -less(D,C) | -terminates(E,B,D) | -happens(E,D) # label(stoppedin_defn) # label(axiom). [clausify(7)]. 166.09/166.36 47 -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)]. 166.09/166.36 49 -happens(A,B) | -terminates(A,C,B) | -releasedAt(C,plus(B,n1)) # label(happens_not_released) # label(axiom). [clausify(11)]. 166.09/166.36 52 n0 != A | tapOn != B | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 166.09/166.36 53 -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 166.09/166.36 54 n0 = A | holdsAt(waterLevel(n3),A) | -happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 166.09/166.36 55 n0 = A | overflow = B | -happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 166.09/166.36 56 n0 = A | holdsAt(filling,A) | -happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 166.09/166.36 62 -stoppedIn(A,B,C) | less(A,f4(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(7)]. 166.09/166.36 63 -stoppedIn(A,B,C) | less(f4(A,B,C),C) # label(stoppedin_defn) # label(axiom). [clausify(7)]. 166.09/166.36 64 -stoppedIn(A,B,C) | terminates(f3(A,B,C),B,f4(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(7)]. 166.09/166.36 75 terminates(A,B,C) | filling != B | overflow != A # label(terminates_all_defn) # label(axiom). [clausify(13)]. 166.09/166.36 77 waterLevel(A) != spilling # label(spilling_not_waterLevel) # label(axiom). [clausify(14)]. 166.09/166.36 92 -initiates(A,B,C) | tapOn = A | spilling = B | tapOff = A | waterLevel(f10(A,B,C)) = B # label(initiates_all_defn) # label(axiom). [clausify(15)]. 166.09/166.36 96 initiates(A,B,C) | filling != B | tapOn != A # label(initiates_all_defn) # label(axiom). [clausify(15)]. 166.09/166.36 99 initiates(A,B,C) | waterLevel(D) != B | overflow != A | -holdsAt(waterLevel(D),C) # label(initiates_all_defn) # label(axiom). [clausify(15)]. 166.09/166.36 100 tapOn != A | waterLevel(B) != C | releases(A,C,D) # label(releases_all_defn) # label(axiom). [clausify(16)]. 166.09/166.36 102 waterLevel(f11(A,B,C)) = B | -releases(A,B,C) # label(releases_all_defn) # label(axiom). [clausify(16)]. 166.09/166.36 103 tapOn != overflow # label(overflow_not_tapOn) # label(axiom). [assumption]. 166.09/166.36 104 overflow != tapOn. [copy(103),flip(a)]. 166.09/166.36 105 tapOff != overflow # label(tapOff_not_overflow) # label(axiom). [assumption]. 166.09/166.36 107 A != B | waterLevel(A) = waterLevel(B) # label(distinct_waterLevels) # label(axiom). [clausify(19)]. 166.09/166.36 108 A = B | waterLevel(A) != waterLevel(B) # label(distinct_waterLevels) # label(axiom). [clausify(19)]. 166.09/166.36 109 -holdsAt(waterLevel(A),B) | -holdsAt(waterLevel(C),B) | C = A # label(same_waterLevel) # label(axiom). [clausify(20)]. 166.09/166.36 110 -holdsAt(waterLevel(A),B) | plus(A,C) != D | trajectory(filling,B,waterLevel(D),C) # label(change_of_waterLevel) # label(axiom). [clausify(21)]. 166.09/166.36 111 holdsAt(waterLevel(n0),n0) # label(waterLevel_0) # label(hypothesis). [assumption]. 166.09/166.36 114 -less(A,n3) | less_or_equal(A,n2) # label(less3) # label(axiom). [clausify(22)]. 166.09/166.36 115 less(A,n3) | -less_or_equal(A,n2) # label(less3) # label(axiom). [clausify(22)]. 166.09/166.36 117 less(A,n8) | -less_or_equal(A,n7) # label(less8) # label(axiom). [clausify(23)]. 166.09/166.36 118 plus(n0,n1) = n1 # label(plus0_1) # label(axiom). [assumption]. 166.09/166.36 124 less(A,n6) | -less_or_equal(A,n5) # label(less6) # label(axiom). [clausify(24)]. 166.09/166.36 128 less(A,n9) | -less_or_equal(A,n8) # label(less9) # label(axiom). [clausify(25)]. 166.09/166.36 130 plus(n1,n1) = n2 # label(plus1_1) # label(axiom). [assumption]. 166.09/166.36 131 n0 = plus(n0,n0) # label(plus0_0) # label(axiom). [assumption]. 166.09/166.36 132 plus(n0,n0) = n0. [copy(131),flip(a)]. 166.09/166.36 133 -less_or_equal(A,n3) | less(A,n4) # label(less4) # label(axiom). [clausify(26)]. 166.09/166.36 136 n2 = plus(n0,n2) # label(plus0_2) # label(axiom). [assumption]. 166.09/166.36 137 plus(n0,n2) = n2. [copy(136),flip(a)]. 166.09/166.36 139 less(A,n7) | -less_or_equal(A,n6) # label(less7) # label(axiom). [clausify(27)]. 166.09/166.36 141 plus(A,B) = plus(B,A) # label(symmetry_of_plus) # label(axiom). [clausify(28)]. 166.09/166.36 144 less(A,n5) | -less_or_equal(A,n4) # label(less5) # label(axiom). [clausify(29)]. 166.09/166.36 145 A != B | less_or_equal(B,A) # label(less_or_equal) # label(axiom). [clausify(30)]. 166.09/166.36 146 -less(A,B) | less_or_equal(A,B) # label(less_or_equal) # label(axiom). [clausify(30)]. 166.09/166.36 147 A = B | less(B,A) | -less_or_equal(B,A) # label(less_or_equal) # label(axiom). [clausify(30)]. 166.09/166.36 148 -less(A,n0) # label(less0) # label(axiom). [clausify(31)]. 166.09/166.36 149 -less_or_equal(A,n0) | less(A,n1) # label(less1) # label(axiom). [clausify(32)]. 166.09/166.36 150 less_or_equal(A,n0) | -less(A,n1) # label(less1) # label(axiom). [clausify(32)]. 166.09/166.36 152 -less(A,n2) | less_or_equal(A,n1) # label(less2) # label(axiom). [clausify(33)]. 166.09/166.36 153 less(A,n2) | -less_or_equal(A,n1) # label(less2) # label(axiom). [clausify(33)]. 166.09/166.36 155 A = B | less(A,B) | less(B,A) # label(less_property) # label(axiom). [clausify(35)]. 166.09/166.36 156 A != B | -less(B,A) # label(less_property) # label(axiom). [clausify(35)]. 166.09/166.36 157 -less(A,B) | -less(B,A) # label(less_property) # label(axiom). [clausify(35)]. 166.09/166.36 158 stoppedIn(n0,filling,n3) # label(not_stopped_filling_0_3) # label(negated_conjecture). [clausify(36)]. 166.09/166.36 173 -stoppedIn(A,B,C) | -terminates(f3(A,B,C),D,f4(A,B,C)) | -holdsAt(D,plus(f4(A,B,C),n1)). [resolve(43,b,42,b)]. 166.09/166.36 174 -stoppedIn(A,B,C) | -terminates(f3(A,B,C),D,f4(A,B,C)) | -holdsAt(D,plus(n1,f4(A,B,C))). [copy(173),rewrite([141(7)])]. 166.09/166.36 206 -terminates(f3(A,B,C),D,f4(A,B,C)) | -releasedAt(D,plus(f4(A,B,C),n1)) | -stoppedIn(A,B,C). [resolve(49,a,43,b)]. 166.09/166.36 207 -terminates(f3(A,B,C),D,f4(A,B,C)) | -releasedAt(D,plus(n1,f4(A,B,C))) | -stoppedIn(A,B,C). [copy(206),rewrite([141(6)])]. 166.09/166.36 233 n0 != A | tapOn != B | -initiates(B,C,A) | holdsAt(C,plus(A,n1)). [resolve(52,c,40,b)]. 166.09/166.36 236 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(52,c,47,e)]. 166.09/166.36 244 -holdsAt(waterLevel(n3),A) | overflow != B | -holdsAt(filling,A) | stoppedIn(C,D,E) | -less(C,A) | -less(A,E) | -terminates(B,D,A). [resolve(53,d,44,e)]. 166.09/166.37 251 n0 = f4(A,B,C) | holdsAt(waterLevel(n3),f4(A,B,C)) | -stoppedIn(A,B,C). [resolve(54,c,43,b)]. 166.09/166.37 252 f4(A,B,C) = n0 | holdsAt(waterLevel(n3),f4(A,B,C)) | -stoppedIn(A,B,C). [copy(251),flip(a)]. 166.09/166.37 257 n0 = A | overflow = f1(B,A) | releasedAt(B,plus(A,n1)) | -holdsAt(B,A) | holdsAt(B,plus(A,n1)). [resolve(55,c,38,a)]. 166.09/166.37 258 n0 = A | f1(B,A) = overflow | releasedAt(B,plus(A,n1)) | -holdsAt(B,A) | holdsAt(B,plus(A,n1)). [copy(257),flip(b)]. 166.09/166.37 261 n0 = f4(A,B,C) | overflow = f3(A,B,C) | -stoppedIn(A,B,C). [resolve(55,c,43,b)]. 166.09/166.37 262 f4(A,B,C) = n0 | f3(A,B,C) = overflow | -stoppedIn(A,B,C). [copy(261),flip(a),flip(b)]. 166.09/166.37 271 n0 = f4(A,B,C) | holdsAt(filling,f4(A,B,C)) | -stoppedIn(A,B,C). [resolve(56,c,43,b)]. 166.09/166.37 272 f4(A,B,C) = n0 | holdsAt(filling,f4(A,B,C)) | -stoppedIn(A,B,C). [copy(271),flip(a)]. 166.09/166.37 314 plus(n1,n0) = n1. [back_rewrite(118),rewrite([141(3)])]. 166.09/166.37 331 terminates(A,filling,B) | overflow != A. [xx_res(75,b)]. 166.09/166.37 333 initiates(A,filling,B) | tapOn != A. [xx_res(96,b)]. 166.09/166.37 337 waterLevel(A) != B | releases(tapOn,B,C). [xx_res(100,a)]. 166.09/166.37 339 plus(A,n0) != B | trajectory(filling,n0,waterLevel(B),A). [resolve(111,a,110,a),rewrite([141(2)])]. 166.09/166.37 352 less_or_equal(A,A). [xx_res(145,a)]. 166.09/166.37 353 n2 = A | less(n2,A) | less_or_equal(A,n1). [resolve(155,b,152,a),flip(a)]. 166.09/166.37 354 n1 = A | less(n1,A) | less_or_equal(A,n0). [resolve(155,b,150,b),flip(a)]. 166.09/166.37 356 A = B | less(B,A) | less_or_equal(A,B). [resolve(155,b,146,a)]. 166.09/166.37 363 n3 = A | less(n3,A) | less_or_equal(A,n2). [resolve(155,b,114,a),flip(a)]. 166.09/166.37 367 less(f4(n0,filling,n3),n3). [resolve(158,a,63,a)]. 166.09/166.37 368 less(n0,f4(n0,filling,n3)). [resolve(158,a,62,a)]. 166.09/166.37 374 f4(n0,filling,n3) = n0 | holdsAt(waterLevel(n3),f4(n0,filling,n3)). [resolve(252,c,158,a)]. 166.09/166.37 377 f4(n0,filling,n3) = n0 | f3(n0,filling,n3) = overflow. [resolve(262,c,158,a)]. 166.09/166.37 381 f4(n0,filling,n3) = n0 | holdsAt(filling,f4(n0,filling,n3)). [resolve(272,c,158,a)]. 166.09/166.37 398 less(n1,n2). [resolve(352,a,153,b)]. 166.09/166.37 399 less(n0,n1). [resolve(352,a,149,a)]. 166.09/166.37 411 less_or_equal(n1,n2). [resolve(398,a,146,a)]. 166.09/166.37 413 less_or_equal(n0,n1). [resolve(399,a,146,a)]. 166.09/166.37 437 terminates(overflow,filling,A). [xx_res(331,b)]. 166.09/166.37 444 less(n1,n3). [resolve(411,a,115,b)]. 166.09/166.37 445 less(n0,n2). [resolve(413,a,153,b)]. 166.09/166.37 449 initiates(tapOn,filling,A). [xx_res(333,b)]. 166.09/166.37 454 n3 != n1. [resolve(444,a,156,b)]. 166.09/166.37 456 n2 != n0. [resolve(445,a,156,b)]. 166.09/166.37 457 less_or_equal(n0,n2). [resolve(445,a,146,a)]. 166.09/166.37 478 less(n0,n3). [resolve(457,a,115,b)]. 166.09/166.37 482 releases(tapOn,waterLevel(A),B). [xx_res(337,a)]. 166.09/166.37 488 n3 != n0. [resolve(478,a,156,b)]. 166.09/166.37 499 trajectory(filling,n0,waterLevel(n1),n1). [resolve(339,a,314,a)]. 166.09/166.37 500 trajectory(filling,n0,waterLevel(plus(A,n0)),A). [resolve(339,a,141,a),rewrite([141(4)])]. 166.09/166.37 560 n2 = A | less(n2,A) | n1 = A | less(A,n1). [resolve(353,c,147,c)]. 166.09/166.37 566 n1 = A | less(n1,A) | n0 = A. [resolve(354,c,147,c),unit_del(d,148)]. 166.09/166.37 587 n3 = A | less(n3,A) | less(A,n4). [resolve(356,c,133,a),flip(a)]. 166.09/166.37 611 -holdsAt(waterLevel(n3),A) | -holdsAt(filling,A) | stoppedIn(B,filling,C) | -less(B,A) | -less(A,C). [resolve(437,a,244,g),xx(b)]. 166.09/166.37 615 n0 != A | holdsAt(filling,plus(A,n1)). [resolve(449,a,233,c),xx(b)]. 166.09/166.37 620 waterLevel(f11(tapOn,waterLevel(A),B)) = waterLevel(A). [resolve(482,a,102,b)]. 166.09/166.37 624 -less(n3,f4(n0,filling,n3)). [resolve(367,a,157,b)]. 166.09/166.37 625 f4(n0,filling,n3) != n3. [resolve(367,a,156,b),flip(a)]. 166.09/166.37 627 less_or_equal(f4(n0,filling,n3),n2). [resolve(367,a,114,a)]. 166.09/166.37 628 f4(n0,filling,n3) != n0. [resolve(368,a,156,b)]. 166.09/166.37 630 holdsAt(filling,f4(n0,filling,n3)). [back_unit_del(381),unit_del(a,628)]. 166.09/166.37 631 f3(n0,filling,n3) = overflow. [back_unit_del(377),unit_del(a,628)]. 166.09/166.37 632 holdsAt(waterLevel(n3),f4(n0,filling,n3)). [back_unit_del(374),unit_del(a,628)]. 166.09/166.37 636 tapOn != A | stoppedIn(n0,filling,n1) | -initiates(A,filling,n0) | holdsAt(waterLevel(n1),n1). [resolve(499,a,236,d),rewrite([141(13),314(13),141(20),314(20)]),xx(a),unit_del(b,399)]. 166.09/166.37 644 f4(n0,filling,n3) = n2 | less(f4(n0,filling,n3),n2). [resolve(627,a,147,c),flip(a)]. 166.09/166.37 649 f1(filling,f4(n0,filling,n3)) = overflow | releasedAt(filling,plus(n1,f4(n0,filling,n3))) | holdsAt(filling,plus(n1,f4(n0,filling,n3))). [resolve(630,a,258,d),rewrite([141(21),141(29)]),flip(a),unit_del(a,628)]. 166.09/166.37 652 -terminates(overflow,A,f4(n0,filling,n3)) | -holdsAt(A,plus(n1,f4(n0,filling,n3))). [para(631(a,1),174(b,1)),unit_del(a,158)]. 166.09/166.37 654 -terminates(overflow,A,f4(n0,filling,n3)) | -releasedAt(A,plus(n1,f4(n0,filling,n3))). [para(631(a,1),207(a,1)),unit_del(c,158)]. 166.09/166.37 659 n3 = A | less(n3,A) | n2 = A | less(A,n2). [resolve(363,c,147,c)]. 166.09/166.37 660 -holdsAt(filling,plus(n1,f4(n0,filling,n3))). [resolve(652,a,437,a)]. 166.09/166.37 662 f1(filling,f4(n0,filling,n3)) = overflow | releasedAt(filling,plus(n1,f4(n0,filling,n3))). [back_unit_del(649),unit_del(c,660)]. 166.09/166.37 685 -holdsAt(waterLevel(A),f4(n0,filling,n3)) | n3 = A. [resolve(632,a,109,b)]. 166.09/166.37 689 tapOn != A | -less(n0,B) | stoppedIn(n0,filling,plus(B,n0)) | -initiates(A,filling,n0) | holdsAt(waterLevel(plus(B,n0)),plus(B,n0)). [resolve(500,a,236,d),rewrite([141(11),141(20)]),xx(a)]. 166.09/166.37 694 -releasedAt(filling,plus(n1,f4(n0,filling,n3))). [resolve(654,a,437,a)]. 166.09/166.37 695 f1(filling,f4(n0,filling,n3)) = overflow. [back_unit_del(662),unit_del(b,694)]. 166.09/166.37 714 holdsAt(filling,n1). [resolve(615,a,132,a(flip)),rewrite([132(4),141(4),314(4)])]. 166.09/166.37 725 n1 = A | n0 = A | -less(A,n1). [resolve(566,b,157,b)]. 166.09/166.37 746 n3 = A | less(n3,A) | less_or_equal(A,n4). [resolve(587,c,146,a)]. 166.09/166.37 780 f11(tapOn,waterLevel(A),B) = A. [resolve(620,a,108,b)]. 166.09/166.37 788 n1 = A | n0 = A | n2 = A | less(n2,A). [resolve(725,c,560,d),merge(e)]. 166.09/166.37 883 stoppedIn(n0,filling,A) | -less(f4(n0,filling,n3),A). [resolve(611,d,368,a),unit_del(a,632),unit_del(b,630)]. 166.09/166.37 989 n3 = A | less(n3,A) | less(A,n5). [resolve(746,c,144,b)]. 166.09/166.37 1163 stoppedIn(n0,filling,n1) | holdsAt(waterLevel(n1),n1). [resolve(636,c,449,a),xx(a)]. 166.09/166.37 1173 holdsAt(waterLevel(n1),n1) | terminates(f3(n0,filling,n1),filling,f4(n0,filling,n1)). [resolve(1163,a,64,a)]. 166.09/166.37 1174 holdsAt(waterLevel(n1),n1) | less(f4(n0,filling,n1),n1). [resolve(1163,a,63,a)]. 166.09/166.37 1175 holdsAt(waterLevel(n1),n1) | less(n0,f4(n0,filling,n1)). [resolve(1163,a,62,a)]. 166.09/166.37 1257 n3 = A | less(n3,A) | less_or_equal(A,n5). [resolve(989,c,146,a)]. 166.09/166.37 1295 f4(n0,filling,n3) = n2 | -less(n2,f4(n0,filling,n3)). [resolve(644,b,157,b)]. 166.09/166.37 1353 n3 = A | less(n3,A) | less(A,n6). [resolve(1257,c,124,b)]. 166.09/166.37 1439 n3 = A | less(n3,A) | less_or_equal(A,n6). [resolve(1353,c,146,a)]. 166.09/166.37 1472 -less(n0,A) | stoppedIn(n0,filling,plus(A,n0)) | holdsAt(waterLevel(plus(A,n0)),plus(A,n0)). [resolve(689,d,449,a),xx(a)]. 166.09/166.37 1518 n3 = A | less(n3,A) | less(A,n7). [resolve(1439,c,139,b)]. 166.09/166.37 1598 n3 = A | less(n3,A) | less_or_equal(A,n7). [resolve(1518,c,146,a)]. 166.09/166.37 1646 n3 = A | less(n3,A) | less(A,n8). [resolve(1598,c,117,b)]. 166.09/166.37 1707 n3 = A | less(n3,A) | less_or_equal(A,n8). [resolve(1646,c,146,a)]. 166.09/166.37 1729 n3 = A | less(n3,A) | less(A,n9). [resolve(1707,c,128,b)]. 166.09/166.37 1851 stoppedIn(n0,filling,n9). [resolve(883,b,1729,c),flip(b),unit_del(b,625),unit_del(c,624)]. 166.09/166.37 1864 stoppedIn(n0,filling,n2) | f4(n0,filling,n3) = n2. [resolve(883,b,659,d),flip(b),flip(d),unit_del(b,625),unit_del(c,624)]. 166.09/166.37 1874 f4(n0,filling,n9) = n0 | holdsAt(waterLevel(n3),f4(n0,filling,n9)). [resolve(1851,a,252,c)]. 166.09/166.37 1880 less(n0,f4(n0,filling,n9)). [resolve(1851,a,62,a)]. 166.09/166.37 1971 f4(n0,filling,n9) != n0. [resolve(1880,a,156,b)]. 166.09/166.37 1973 holdsAt(waterLevel(n3),f4(n0,filling,n9)). [back_unit_del(1874),unit_del(a,1971)]. 166.09/166.37 2604 initiates(A,B,f4(n0,filling,n9)) | waterLevel(n3) != B | overflow != A. [resolve(1973,a,99,d)]. 166.09/166.37 4004 holdsAt(waterLevel(n1),n1) | less_or_equal(f4(n0,filling,n1),n0). [resolve(1174,b,150,b)]. 166.09/166.37 4009 holdsAt(waterLevel(n1),n1) | f4(n0,filling,n1) != n0. [resolve(1175,b,156,b)]. 166.09/166.37 4023 f4(n0,filling,n3) = n2 | f4(n0,filling,n2) = n0 | f3(n0,filling,n2) = overflow. [resolve(1864,a,262,c)]. 166.09/166.37 4030 f4(n0,filling,n3) = n2 | less(n0,f4(n0,filling,n2)). [resolve(1864,a,62,a)]. 166.09/166.37 6375 holdsAt(waterLevel(n1),n1) | f4(n0,filling,n1) = n0. [resolve(4004,b,147,c),flip(b),unit_del(c,148)]. 166.09/166.37 6992 f4(n0,filling,n1) = n0 | -holdsAt(waterLevel(A),n1) | n1 = A. [resolve(6375,a,109,b)]. 166.09/166.37 7677 f4(n0,filling,n3) = n2 | f4(n0,filling,n3) = n1. [resolve(1295,b,788,d),flip(b),flip(c),flip(d),merge(d),unit_del(c,628)]. 166.09/166.37 8198 f4(n0,filling,n3) = n2 | f4(n0,filling,n2) != n0. [resolve(4030,b,156,b)]. 166.09/166.37 11292 f4(n0,filling,n3) = n1 | waterLevel(f4(n0,filling,n3)) = waterLevel(n2). [resolve(7677,a,107,a)]. 166.09/166.37 11299 f4(n0,filling,n3) = n1 | holdsAt(filling,n2). [para(7677(a,1),630(a,2))]. 166.09/166.37 11303 f4(n0,filling,n3) = n1 | f1(filling,n2) = overflow. [para(7677(a,1),695(a,1,2))]. 166.09/166.37 11308 f4(n0,filling,n3) = n1 | -holdsAt(waterLevel(A),n2) | n3 = A. [para(7677(a,1),685(a,2))]. 166.09/166.37 11365 f1(filling,n2) = overflow | -holdsAt(waterLevel(A),n1) | n3 = A. [para(11303(a,1),685(a,2))]. 166.09/166.37 11842 holdsAt(waterLevel(n1),n1) | -stoppedIn(n0,filling,n1) | -holdsAt(filling,plus(n1,f4(n0,filling,n1))). [resolve(1173,b,174,b)]. 166.09/166.37 12154 stoppedIn(n0,filling,n2) | holdsAt(waterLevel(n2),n2). [resolve(1472,a,659,d),rewrite([141(5),137(5),141(7),137(7),141(9),137(9)]),unit_del(c,488),unit_del(d,148),unit_del(e,456)]. 166.09/166.37 12160 holdsAt(waterLevel(n2),n2) | f4(n0,filling,n2) = n0 | f3(n0,filling,n2) = overflow. [resolve(12154,a,262,c)]. 166.09/166.37 12163 holdsAt(waterLevel(n2),n2) | less(f4(n0,filling,n2),n2). [resolve(12154,a,63,a)]. 166.09/166.37 12164 holdsAt(waterLevel(n2),n2) | less(n0,f4(n0,filling,n2)). [resolve(12154,a,62,a)]. 166.09/166.37 12191 holdsAt(waterLevel(n2),n2) | less_or_equal(f4(n0,filling,n2),n1). [resolve(12163,b,152,a)]. 166.09/166.37 12194 holdsAt(waterLevel(n2),n2) | f4(n0,filling,n2) != n0. [resolve(12164,b,156,b)]. 166.09/166.37 12199 holdsAt(waterLevel(n2),n2) | f4(n0,filling,n2) = n1 | less(f4(n0,filling,n2),n1). [resolve(12191,b,147,c),flip(b)]. 166.09/166.37 12313 f1(filling,n2) = overflow | f4(n0,filling,n1) = n0. [resolve(11365,b,6375,a),unit_del(b,454)]. 166.09/166.37 12315 f1(filling,n2) = overflow | holdsAt(waterLevel(n1),n1). [resolve(12313,b,4009,b)]. 166.09/166.37 12322 f1(filling,n2) = overflow. [resolve(12315,b,11365,b),merge(b),unit_del(b,454)]. 166.09/166.37 14695 initiates(A,waterLevel(n3),f4(n0,filling,n9)) | overflow != A. [resolve(2604,b,780,a(flip)),rewrite([780(5)])]. 166.09/166.37 14697 initiates(overflow,waterLevel(n3),f4(n0,filling,n9)). [resolve(14695,b,12322,a(flip)),rewrite([12322(3)])]. 166.09/166.37 14702 waterLevel(f10(overflow,waterLevel(n3),f4(n0,filling,n9))) = waterLevel(n3). [resolve(14697,a,92,a),flip(a),flip(b),unit_del(a,104),unit_del(b,77),unit_del(c,105)]. 166.09/166.37 14707 f10(overflow,waterLevel(n3),f4(n0,filling,n9)) = n3. [resolve(14702,a,108,b)]. 166.09/166.37 14708 f4(n0,filling,n1) = n0 | -holdsAt(waterLevel(n3),n1). [para(14702(a,1),6992(b,1)),rewrite([14707(19)]),flip(c),unit_del(c,454)]. 166.09/166.37 15209 f4(n0,filling,n3) = n1 | -holdsAt(waterLevel(n2),n2). [para(11292(b,1),11308(b,1)),flip(d),merge(b),unit_del(c,625)]. 166.09/166.37 20762 f4(n0,filling,n3) = n2 | f3(n0,filling,n2) = overflow. [resolve(4023,b,8198,b),merge(c)]. 166.09/166.37 20765 f3(n0,filling,n2) = overflow | waterLevel(f4(n0,filling,n3)) = waterLevel(n2). [resolve(20762,a,107,a)]. 166.09/166.37 20779 f3(n0,filling,n2) = overflow | -holdsAt(waterLevel(A),n2) | n3 = A. [para(20762(a,1),685(a,2))]. 166.09/166.37 21407 f3(n0,filling,n2) = overflow | -holdsAt(waterLevel(n2),n2). [para(20765(b,1),20779(b,1)),flip(d),merge(b),unit_del(c,625)]. 166.09/166.37 25876 holdsAt(waterLevel(n1),n1) | -holdsAt(filling,plus(n1,f4(n0,filling,n1))). [resolve(11842,b,1163,a),merge(c)]. 166.09/166.37 25917 f4(n0,filling,n2) = n0 | f3(n0,filling,n2) = overflow. [resolve(12160,a,21407,b),merge(c)]. 166.09/166.37 25918 f3(n0,filling,n2) = overflow | holdsAt(waterLevel(n2),n2). [resolve(25917,a,12194,b)]. 166.09/166.37 25927 f3(n0,filling,n2) = overflow. [resolve(25918,b,21407,b),merge(b)]. 166.09/166.37 25940 -stoppedIn(n0,filling,n2) | -terminates(overflow,A,f4(n0,filling,n2)) | -holdsAt(A,plus(n1,f4(n0,filling,n2))). [para(25927(a,1),174(b,1))]. 166.09/166.37 25942 -stoppedIn(n0,filling,n2) | -holdsAt(filling,plus(n1,f4(n0,filling,n2))). [resolve(25940,b,437,a)]. 166.09/166.37 25951 -holdsAt(filling,plus(n1,f4(n0,filling,n2))) | holdsAt(waterLevel(n2),n2). [resolve(25942,a,12154,a)]. 166.09/166.37 26000 holdsAt(waterLevel(n2),n2) | f4(n0,filling,n2) = n1 | f4(n0,filling,n2) = n0. [resolve(12199,c,725,c),flip(c),flip(d),merge(c)]. 166.09/166.37 29819 f4(n0,filling,n2) = n1 | f4(n0,filling,n2) = n0 | f4(n0,filling,n3) = n1. [resolve(26000,a,15209,b)]. 166.09/166.37 45347 f4(n0,filling,n2) = n1 | f4(n0,filling,n3) = n1 | holdsAt(waterLevel(n2),n2). [resolve(29819,b,12194,b)]. 166.09/166.37 45364 f4(n0,filling,n2) = n1 | f4(n0,filling,n3) = n1. [resolve(45347,c,15209,b),merge(c)]. 166.09/166.37 45370 f4(n0,filling,n3) = n1 | -holdsAt(filling,n2) | holdsAt(waterLevel(n2),n2). [para(45364(a,1),25951(a,2,2)),rewrite([130(10)])]. 166.09/166.37 45493 f4(n0,filling,n3) = n1 | holdsAt(waterLevel(n2),n2). [resolve(45370,b,11299,b),merge(c)]. 166.09/166.37 45503 f4(n0,filling,n3) = n1. [resolve(45493,b,15209,b),merge(b)]. 166.09/166.37 46531 -holdsAt(waterLevel(A),n1) | n3 = A. [back_rewrite(685),rewrite([45503(5)])]. 166.09/166.37 46542 holdsAt(waterLevel(n3),n1). [back_rewrite(632),rewrite([45503(6)])]. 166.09/166.37 46782 f4(n0,filling,n1) = n0. [back_unit_del(14708),unit_del(b,46542)]. 166.09/166.37 47066 holdsAt(waterLevel(n1),n1). [back_rewrite(25876),rewrite([46782(10),314(8)]),unit_del(b,714)]. 166.09/166.37 47480 $F. [resolve(46531,a,47066,a),unit_del(a,454)]. 166.09/166.37 166.09/166.37 % SZS output end Refutation 166.09/166.37 ============================== end of proof ========================== 166.09/166.37 166.09/166.37 ============================== STATISTICS ============================ 166.09/166.37 166.09/166.37 Given=34401. Generated=3659390. Kept=47367. proofs=1. 166.09/166.37 Usable=13992. Sos=4153. Demods=144. Limbo=0, Disabled=29445. Hints=0. 166.09/166.37 Megabytes=41.72. 166.09/166.37 User_CPU=163.28, System_CPU=2.07, Wall_clock=165. 166.09/166.37 166.09/166.37 ============================== end of statistics ===================== 166.09/166.37 166.09/166.37 ============================== end of search ========================= 166.09/166.37 166.09/166.37 THEOREM PROVED 166.09/166.37 % SZS status Theorem 166.09/166.37 166.09/166.37 Exiting with 1 proof. 166.09/166.37 166.09/166.37 Process 9303 exit (max_proofs) Thu Aug 29 13:41:22 2019 166.09/166.37 Prover9 interrupted 166.09/166.37 EOF