0.12/0.12 % 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 : n024.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 : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Aug 9 04:57:22 EDT 2022 0.13/0.34 % CPUTime : 0.40/1.04 ============================== Prover9 =============================== 0.40/1.04 Prover9 (32) version 2009-11A, November 2009. 0.40/1.04 Process 4935 was started by sandbox2 on n024.cluster.edu, 0.40/1.04 Tue Aug 9 04:57:23 2022 0.40/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_4782_n024.cluster.edu". 0.40/1.04 ============================== end of head =========================== 0.40/1.04 0.40/1.04 ============================== INPUT ================================= 0.40/1.04 0.40/1.04 % Reading from file /tmp/Prover9_4782_n024.cluster.edu 0.40/1.04 0.40/1.04 set(prolog_style_variables). 0.40/1.04 set(auto2). 0.40/1.04 % set(auto2) -> set(auto). 0.40/1.04 % set(auto) -> set(auto_inference). 0.40/1.04 % set(auto) -> set(auto_setup). 0.40/1.04 % set(auto_setup) -> set(predicate_elim). 0.40/1.04 % set(auto_setup) -> assign(eq_defs, unfold). 0.40/1.04 % set(auto) -> set(auto_limits). 0.40/1.04 % set(auto_limits) -> assign(max_weight, "100.000"). 0.40/1.04 % set(auto_limits) -> assign(sos_limit, 20000). 0.40/1.04 % set(auto) -> set(auto_denials). 0.40/1.04 % set(auto) -> set(auto_process). 0.40/1.04 % set(auto2) -> assign(new_constants, 1). 0.40/1.04 % set(auto2) -> assign(fold_denial_max, 3). 0.40/1.04 % set(auto2) -> assign(max_weight, "200.000"). 0.40/1.04 % set(auto2) -> assign(max_hours, 1). 0.40/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.40/1.04 % set(auto2) -> assign(max_seconds, 0). 0.40/1.04 % set(auto2) -> assign(max_minutes, 5). 0.40/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.40/1.04 % set(auto2) -> set(sort_initial_sos). 0.40/1.04 % set(auto2) -> assign(sos_limit, -1). 0.40/1.04 % set(auto2) -> assign(lrs_ticks, 3000). 0.40/1.04 % set(auto2) -> assign(max_megs, 400). 0.40/1.04 % set(auto2) -> assign(stats, some). 0.40/1.04 % set(auto2) -> clear(echo_input). 0.40/1.04 % set(auto2) -> set(quiet). 0.40/1.04 % set(auto2) -> clear(print_initial_clauses). 0.40/1.04 % set(auto2) -> clear(print_given). 0.40/1.04 assign(lrs_ticks,-1). 0.40/1.04 assign(sos_limit,10000). 0.40/1.04 assign(order,kbo). 0.40/1.04 set(lex_order_vars). 0.40/1.04 clear(print_given). 0.40/1.04 0.40/1.04 % formulas(sos). % not echoed (55 formulas) 0.40/1.04 0.40/1.04 ============================== end of input ========================== 0.40/1.04 0.40/1.04 % From the command line: assign(max_seconds, 960). 0.40/1.04 0.40/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.40/1.04 0.40/1.04 % Formulas that are not ordinary clauses: 0.40/1.04 1 (all Time1 all Time2 all Fluent (startedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (happens(Event,Time) & less(Time1,Time) & initiates(Event,Fluent,Time) & less(Time,Time2))))) # label(startedin_defn) # label(axiom) # label(non_clause). [assumption]. 0.40/1.04 2 (all Fluent all Time (-(exists Event (happens(Event,Time) & releases(Event,Fluent,Time))) & -releasedAt(Fluent,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(keep_not_released) # label(axiom) # label(non_clause). [assumption]. 0.40/1.04 3 (all Time1 all Fluent all Time2 (stoppedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (happens(Event,Time) & less(Time,Time2) & terminates(Event,Fluent,Time) & less(Time1,Time))))) # label(stoppedin_defn) # label(axiom) # label(non_clause). [assumption]. 0.40/1.04 4 (all Event all Time all Fluent all Fluent2 all Offset (less(n0,Offset) & -stoppedIn(Time,Fluent,plus(Time,Offset)) & trajectory(Fluent,Time,Fluent2,Offset) & initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause). [assumption]. 0.40/1.04 5 (all Fluent all Time (-releasedAt(Fluent,plus(Time,n1)) & -(exists Event (happens(Event,Time) & initiates(Event,Fluent,Time))) & -holdsAt(Fluent,Time) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause). [assumption]. 0.40/1.04 6 (all Event all Time all Fluent (initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(happens_holds) # label(axiom) # label(non_clause). [assumption]. 0.40/1.04 7 (all Event all Time all Fluent (terminates(Event,Fluent,Time) & happens(Event,Time) -> -holdsAt(Fluent,plus(Time,n1)))) # label(happens_terminates_not_holds) # label(axiom) # label(non_clause). [assumption]. 0.40/1.04 8 (all Event all Time1 all Fluent1 all Time2 all Fluent2 (happens(Event,Time1) & terminates(Event,Fluent1,Time1) & less(n0,Time2) & antitrajectory(Fluent1,Time1,Fluent2,Time2) & -startedIn(Time1,Fluent1,plus(Time1,Time2)) -> holdsAt(Fluent2,plus(Time1,Time2)))) # label(antitrajectory) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 9 (all Event all Time all Fluent (happens(Event,Time) & releases(Event,Fluent,Time) -> releasedAt(Fluent,plus(Time,n1)))) # label(happens_releases) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 10 (all Event all Time all Fluent ((initiates(Event,Fluent,Time) | terminates(Event,Fluent,Time)) & happens(Event,Time) -> -releasedAt(Fluent,plus(Time,n1)))) # label(happens_not_released) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 11 (all Fluent all Time (holdsAt(Fluent,Time) & -(exists Event (happens(Event,Time) & terminates(Event,Fluent,Time))) & -releasedAt(Fluent,plus(Time,n1)) -> holdsAt(Fluent,plus(Time,n1)))) # label(keep_holding) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 12 (all Fluent all Time (-(exists Event (happens(Event,Time) & (terminates(Event,Fluent,Time) | initiates(Event,Fluent,Time)))) & releasedAt(Fluent,Time) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 13 (all Event all Fluent all Time ((exists Height (Event = tapOn & Fluent = waterLevel(Height))) <-> releases(Event,Fluent,Time))) # label(releases_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 14 (all X spilling != waterLevel(X)) # label(spilling_not_waterLevel) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 15 (all Time all Height1 all Height2 (holdsAt(waterLevel(Height1),Time) & holdsAt(waterLevel(Height2),Time) -> Height1 = Height2)) # label(same_waterLevel) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 16 (all X filling != waterLevel(X)) # label(filling_not_waterLevel) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 17 (all Event all Time (Time = n0 & tapOn = Event | holdsAt(waterLevel(n3),Time) & Event = overflow & holdsAt(filling,Time) <-> happens(Event,Time))) # label(happens_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 18 (all Event all Fluent all Time (Event = overflow & Fluent = filling | filling = Fluent & tapOff = Event <-> terminates(Event,Fluent,Time))) # label(terminates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 19 (all Event all Fluent all Time (filling = Fluent & Event = tapOn | (exists Height (holdsAt(waterLevel(Height),Time) & waterLevel(Height) = Fluent & Event = overflow)) | (exists Height (holdsAt(waterLevel(Height),Time) & waterLevel(Height) = Fluent & tapOff = Event)) | spilling = Fluent & Event = overflow <-> initiates(Event,Fluent,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 20 (all Height1 all Time all Height2 all Offset (Height2 = plus(Height1,Offset) & holdsAt(waterLevel(Height1),Time) -> trajectory(filling,Time,waterLevel(Height2),Offset))) # label(change_of_waterLevel) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 21 (all X all Y (waterLevel(Y) = waterLevel(X) <-> Y = X)) # label(distinct_waterLevels) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 22 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 23 (all X (less(X,n1) <-> less_or_equal(X,n0))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 24 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 25 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 26 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 27 (all X all Y (less(X,Y) <-> -less(Y,X) & Y != X)) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 28 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 29 (all Height -releasedAt(waterLevel(Height),n0)) # label(not_released_waterLevel_0) # label(hypothesis) # label(non_clause). [assumption]. 0.40/1.05 30 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 31 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 32 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 33 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 34 (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.40/1.05 35 (all X (less_or_equal(X,n8) <-> less(X,n9))) # label(less9) # label(axiom) # label(non_clause). [assumption]. 0.40/1.05 36 --holdsAt(waterLevel(n3),n2) # label(waterlevel_not_3) # label(negated_conjecture) # label(non_clause). [assumption]. 0.40/1.05 0.40/1.05 ============================== end of process non-clausal formulas === 0.40/1.05 0.40/1.05 ============================== PROCESS INITIAL CLAUSES =============== 0.40/1.05 0.40/1.05 ============================== PREDICATE ELIMINATION ================= 0.40/1.05 37 startedIn(A,B,C) | -happens(D,E) | -less(A,E) | -initiates(D,B,E) | -less(E,C) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.40/1.05 38 -startedIn(A,B,C) | happens(f1(A,C,B),f2(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.40/1.05 39 -startedIn(A,B,C) | less(A,f2(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.40/1.05 40 -startedIn(A,B,C) | initiates(f1(A,C,B),B,f2(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.40/1.05 41 -startedIn(A,B,C) | less(f2(A,C,B),C) # label(startedin_defn) # label(axiom). [clausify(1)]. 0.40/1.05 Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | happens(f1(C,E,D),f2(C,E,D)). [resolve(37,a,38,a)]. 0.40/1.05 Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | less(C,f2(C,E,D)). [resolve(37,a,39,a)]. 0.40/1.05 Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | initiates(f1(C,E,D),D,f2(C,E,D)). [resolve(37,a,40,a)]. 0.40/1.05 Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | less(f2(C,E,D),E). [resolve(37,a,41,a)]. 0.40/1.05 42 -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | startedIn(B,C,plus(B,D)) | holdsAt(E,plus(B,D)) # label(antitrajectory) # label(axiom). [clausify(8)]. 0.40/1.05 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | happens(f1(B,plus(B,D),C),f2(B,plus(B,D),C)). [resolve(42,e,38,a)]. 0.40/1.05 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(B,f2(B,plus(B,D),C)). [resolve(42,e,39,a)]. 0.40/1.05 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | initiates(f1(B,plus(B,D),C),C,f2(B,plus(B,D),C)). [resolve(42,e,40,a)]. 0.40/1.05 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(f2(B,plus(B,D),C),plus(B,D)). [resolve(42,e,41,a)]. 0.40/1.05 43 -happens(A,B) | -releases(A,C,B) | releasedAt(C,plus(B,n1)) # label(happens_releases) # label(axiom). [clausify(9)]. 0.40/1.05 44 releases(f3(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom). [clausify(2)]. 0.40/1.05 45 tapOn != A | waterLevel(B) != C | releases(A,C,D) # label(releases_all_defn) # label(axiom). [clausify(13)]. 0.40/1.05 Derived: tapOn != A | waterLevel(B) != C | -happens(A,D) | releasedAt(C,plus(D,n1)). [resolve(45,c,43,b)]. 0.40/1.05 46 tapOn = A | -releases(A,B,C) # label(releases_all_defn) # label(axiom). [clausify(13)]. 0.40/1.05 Derived: tapOn = f3(A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)). [resolve(46,b,44,a)]. 0.40/1.05 47 waterLevel(f9(A,B,C)) = B | -releases(A,B,C) # label(releases_all_defn) # label(axiom). [clausify(13)]. 0.40/1.05 Derived: waterLevel(f9(f3(A,B),A,B)) = A | releasedAt(A,B) | -releasedAt(A,plus(B,n1)). [resolve(47,b,44,a)]. 0.40/1.05 Derived: waterLevel(f9(A,B,C)) = B | tapOn != A | waterLevel(D) != B. [resolve(47,b,45,c)]. 0.40/1.05 48 stoppedIn(A,B,C) | -happens(D,E) | -less(E,C) | -terminates(D,B,E) | -less(A,E) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.40/1.05 49 -stoppedIn(A,B,C) | happens(f4(A,B,C),f5(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.40/1.05 50 -stoppedIn(A,B,C) | less(f5(A,B,C),C) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.88/1.17 51 -stoppedIn(A,B,C) | terminates(f4(A,B,C),B,f5(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.88/1.17 52 -stoppedIn(A,B,C) | less(A,f5(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 0.88/1.17 Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | happens(f4(E,D,C),f5(E,D,C)). [resolve(48,a,49,a)]. 0.88/1.17 Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | less(f5(E,D,C),C). [resolve(48,a,50,a)]. 0.88/1.17 Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | terminates(f4(E,D,C),D,f5(E,D,C)). [resolve(48,a,51,a)]. 0.88/1.17 Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | less(E,f5(E,D,C)). [resolve(48,a,52,a)]. 0.88/1.17 53 -less(n0,A) | stoppedIn(B,C,plus(B,A)) | -trajectory(C,B,D,A) | -initiates(E,C,B) | -happens(E,B) | holdsAt(D,plus(B,A)) # label(change_holding) # label(axiom). [clausify(4)]. 0.88/1.17 Derived: -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | happens(f4(C,B,plus(C,A)),f5(C,B,plus(C,A))). [resolve(53,b,49,a)]. 0.88/1.17 Derived: -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | less(f5(C,B,plus(C,A)),plus(C,A)). [resolve(53,b,50,a)]. 0.88/1.17 Derived: -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | terminates(f4(C,B,plus(C,A)),B,f5(C,B,plus(C,A))). [resolve(53,b,51,a)]. 0.88/1.17 Derived: -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | less(C,f5(C,B,plus(C,A))). [resolve(53,b,52,a)]. 0.88/1.17 54 -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | happens(f4(C,B,plus(C,A)),f5(C,B,plus(C,A))). [resolve(53,b,49,a)]. 0.88/1.17 55 plus(A,B) != C | -holdsAt(waterLevel(A),D) | trajectory(filling,D,waterLevel(C),B) # label(change_of_waterLevel) # label(axiom). [clausify(20)]. 0.88/1.17 Derived: -less(n0,A) | -initiates(B,filling,C) | -happens(B,C) | holdsAt(waterLevel(D),plus(C,A)) | happens(f4(C,filling,plus(C,A)),f5(C,filling,plus(C,A))) | plus(E,A) != D | -holdsAt(waterLevel(E),C). [resolve(54,b,55,c)]. 0.88/1.17 56 -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | less(f5(C,B,plus(C,A)),plus(C,A)). [resolve(53,b,50,a)]. 0.88/1.17 Derived: -less(n0,A) | -initiates(B,filling,C) | -happens(B,C) | holdsAt(waterLevel(D),plus(C,A)) | less(f5(C,filling,plus(C,A)),plus(C,A)) | plus(E,A) != D | -holdsAt(waterLevel(E),C). [resolve(56,b,55,c)]. 0.88/1.17 57 -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | terminates(f4(C,B,plus(C,A)),B,f5(C,B,plus(C,A))). [resolve(53,b,51,a)]. 0.88/1.17 Derived: -less(n0,A) | -initiates(B,filling,C) | -happens(B,C) | holdsAt(waterLevel(D),plus(C,A)) | terminates(f4(C,filling,plus(C,A)),filling,f5(C,filling,plus(C,A))) | plus(E,A) != D | -holdsAt(waterLevel(E),C). [resolve(57,b,55,c)]. 0.88/1.17 58 -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | less(C,f5(C,B,plus(C,A))). [resolve(53,b,52,a)]. 0.88/1.17 Derived: -less(n0,A) | -initiates(B,filling,C) | -happens(B,C) | holdsAt(waterLevel(D),plus(C,A)) | less(C,f5(C,filling,plus(C,A))) | plus(E,A) != D | -holdsAt(waterLevel(E),C). [resolve(58,b,55,c)]. 0.88/1.17 0.88/1.17 ============================== end predicate elimination ============= 0.88/1.17 0.88/1.17 Auto_denials: (non-Horn, no changes). 0.88/1.17 0.88/1.17 Term ordering decisions: 0.88/1.17 0.88/1.17 % Assigning unary symbol waterLevel kb_weight 0 and highest precedence (36). 0.88/1.17 Function symbol KB weights: filling=1. n1=1. n0=1. tapOn=1. n3=1. overflow=1. spilling=1. n2=1. tapOff=1. n4=1. n5=1. n6=1. n7=1. n8=1. n9=1. plus=1. f3=1. f6=1. f7=1. f8=1. f1=1. f2=1. f4=1. f5=1. f9=1. f10=1. f11=1. waterLevel=0. 0.88/1.17 0.88/1.17 ============================== end of process initial clauses ======== 0.88/1.17 0.88/1.17 ============================== CLAUSES FOR SEARCH ==================== 0.88/1.17 0.88/1.17 ============================== end of clauses for search ============= 0.88/1.17 0.88/1.17 ============================== SEARCH ================================ 0.88/1.17 0.88/1.17 % Starting search at 0.03 seconds. 0.88/1.17 0.88/1.17 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 21 (0.00 of 0.12 sec). 1.46/1.73 1.46/1.73 ============================== PROOF ================================= 1.46/1.73 % SZS status Theorem 1.46/1.73 % SZS output start Refutation 1.46/1.73 1.46/1.73 % Proof 1 at 0.64 (+ 0.02) seconds. 1.46/1.73 % Length of proof is 163. 1.46/1.73 % Level of proof is 28. 1.46/1.73 % Maximum clause weight is 38.000. 1.46/1.73 % Given clauses 937. 1.46/1.73 1.46/1.73 3 (all Time1 all Fluent all Time2 (stoppedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (happens(Event,Time) & less(Time,Time2) & terminates(Event,Fluent,Time) & less(Time1,Time))))) # label(stoppedin_defn) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 4 (all Event all Time all Fluent all Fluent2 all Offset (less(n0,Offset) & -stoppedIn(Time,Fluent,plus(Time,Offset)) & trajectory(Fluent,Time,Fluent2,Offset) & initiates(Event,Fluent,Time) & happens(Event,Time) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 13 (all Event all Fluent all Time ((exists Height (Event = tapOn & Fluent = waterLevel(Height))) <-> releases(Event,Fluent,Time))) # label(releases_all_defn) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 15 (all Time all Height1 all Height2 (holdsAt(waterLevel(Height1),Time) & holdsAt(waterLevel(Height2),Time) -> Height1 = Height2)) # label(same_waterLevel) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 17 (all Event all Time (Time = n0 & tapOn = Event | holdsAt(waterLevel(n3),Time) & Event = overflow & holdsAt(filling,Time) <-> happens(Event,Time))) # label(happens_all_defn) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 19 (all Event all Fluent all Time (filling = Fluent & Event = tapOn | (exists Height (holdsAt(waterLevel(Height),Time) & waterLevel(Height) = Fluent & Event = overflow)) | (exists Height (holdsAt(waterLevel(Height),Time) & waterLevel(Height) = Fluent & tapOff = Event)) | spilling = Fluent & Event = overflow <-> initiates(Event,Fluent,Time))) # label(initiates_all_defn) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 20 (all Height1 all Time all Height2 all Offset (Height2 = plus(Height1,Offset) & holdsAt(waterLevel(Height1),Time) -> trajectory(filling,Time,waterLevel(Height2),Offset))) # label(change_of_waterLevel) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 21 (all X all Y (waterLevel(Y) = waterLevel(X) <-> Y = X)) # label(distinct_waterLevels) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 23 (all X (less(X,n1) <-> less_or_equal(X,n0))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 24 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 25 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 26 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 27 (all X all Y (less(X,Y) <-> -less(Y,X) & Y != X)) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 28 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 31 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 32 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 33 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 34 (all X all Y (Y = X | less(X,Y) <-> less_or_equal(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause). [assumption]. 1.46/1.73 36 --holdsAt(waterLevel(n3),n2) # label(waterlevel_not_3) # label(negated_conjecture) # label(non_clause). [assumption]. 1.46/1.73 45 tapOn != A | waterLevel(B) != C | releases(A,C,D) # label(releases_all_defn) # label(axiom). [clausify(13)]. 1.46/1.73 47 waterLevel(f9(A,B,C)) = B | -releases(A,B,C) # label(releases_all_defn) # label(axiom). [clausify(13)]. 1.46/1.73 49 -stoppedIn(A,B,C) | happens(f4(A,B,C),f5(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 1.46/1.73 50 -stoppedIn(A,B,C) | less(f5(A,B,C),C) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 1.46/1.73 52 -stoppedIn(A,B,C) | less(A,f5(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(3)]. 1.46/1.73 53 -less(n0,A) | stoppedIn(B,C,plus(B,A)) | -trajectory(C,B,D,A) | -initiates(E,C,B) | -happens(E,B) | holdsAt(D,plus(B,A)) # label(change_holding) # label(axiom). [clausify(4)]. 1.46/1.73 54 -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | happens(f4(C,B,plus(C,A)),f5(C,B,plus(C,A))). [resolve(53,b,49,a)]. 1.46/1.73 55 plus(A,B) != C | -holdsAt(waterLevel(A),D) | trajectory(filling,D,waterLevel(C),B) # label(change_of_waterLevel) # label(axiom). [clausify(20)]. 1.46/1.73 56 -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | less(f5(C,B,plus(C,A)),plus(C,A)). [resolve(53,b,50,a)]. 1.46/1.73 58 -less(n0,A) | -trajectory(B,C,D,A) | -initiates(E,B,C) | -happens(E,C) | holdsAt(D,plus(C,A)) | less(C,f5(C,B,plus(C,A))). [resolve(53,b,52,a)]. 1.46/1.73 71 -holdsAt(waterLevel(A),B) | -holdsAt(waterLevel(C),B) | C = A # label(same_waterLevel) # label(axiom). [clausify(15)]. 1.46/1.73 75 n0 != A | tapOn != B | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 1.46/1.73 77 n0 = A | holdsAt(waterLevel(n3),A) | -happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 1.46/1.73 89 filling != A | tapOn != B | initiates(B,A,C) # label(initiates_all_defn) # label(axiom). [clausify(19)]. 1.46/1.73 113 waterLevel(A) != waterLevel(B) | A = B # label(distinct_waterLevels) # label(axiom). [clausify(21)]. 1.46/1.73 116 plus(n0,n1) = n1 # label(plus0_1) # label(axiom). [assumption]. 1.46/1.73 117 holdsAt(waterLevel(n0),n0) # label(waterLevel_0) # label(hypothesis). [assumption]. 1.46/1.73 121 -less(A,n1) | less_or_equal(A,n0) # label(less1) # label(axiom). [clausify(23)]. 1.46/1.73 122 less(A,n1) | -less_or_equal(A,n0) # label(less1) # label(axiom). [clausify(23)]. 1.46/1.73 123 -less(A,n3) | less_or_equal(A,n2) # label(less3) # label(axiom). [clausify(24)]. 1.46/1.73 124 less(A,n3) | -less_or_equal(A,n2) # label(less3) # label(axiom). [clausify(24)]. 1.46/1.73 127 -less(A,n2) | less_or_equal(A,n1) # label(less2) # label(axiom). [clausify(25)]. 1.46/1.73 128 less(A,n2) | -less_or_equal(A,n1) # label(less2) # label(axiom). [clausify(25)]. 1.46/1.73 129 -less(A,n6) | less_or_equal(A,n5) # label(less6) # label(axiom). [clausify(26)]. 1.46/1.73 130 less(A,n6) | -less_or_equal(A,n5) # label(less6) # label(axiom). [clausify(26)]. 1.46/1.73 133 -less(A,B) | -less(B,A) # label(less_property) # label(axiom). [clausify(27)]. 1.46/1.73 134 -less(A,B) | B != A # label(less_property) # label(axiom). [clausify(27)]. 1.46/1.73 135 less(A,B) | less(B,A) | B = A # label(less_property) # label(axiom). [clausify(27)]. 1.46/1.73 136 -less(A,n5) | less_or_equal(A,n4) # label(less5) # label(axiom). [clausify(28)]. 1.46/1.73 137 less(A,n5) | -less_or_equal(A,n4) # label(less5) # label(axiom). [clausify(28)]. 1.46/1.73 146 plus(A,B) = plus(B,A) # label(symmetry_of_plus) # label(axiom). [clausify(31)]. 1.46/1.73 147 -less(A,n4) | less_or_equal(A,n3) # label(less4) # label(axiom). [clausify(32)]. 1.46/1.73 148 less(A,n4) | -less_or_equal(A,n3) # label(less4) # label(axiom). [clausify(32)]. 1.46/1.73 149 n2 = plus(n0,n2) # label(plus0_2) # label(axiom). [assumption]. 1.46/1.73 150 plus(n0,n2) = n2. [copy(149),flip(a)]. 1.46/1.73 153 -less(A,n0) # label(less0) # label(axiom). [clausify(33)]. 1.46/1.73 154 A != B | less_or_equal(B,A) # label(less_or_equal) # label(axiom). [clausify(34)]. 1.46/1.73 155 -less(A,B) | less_or_equal(A,B) # label(less_or_equal) # label(axiom). [clausify(34)]. 1.46/1.73 156 A = B | less(B,A) | -less_or_equal(B,A) # label(less_or_equal) # label(axiom). [clausify(34)]. 1.46/1.73 163 holdsAt(waterLevel(n3),n2) # label(waterlevel_not_3) # label(negated_conjecture). [clausify(36)]. 1.46/1.73 172 waterLevel(f9(A,B,C)) = B | tapOn != A | waterLevel(D) != B. [resolve(47,b,45,c)]. 1.46/1.73 177 -less(n0,A) | -initiates(B,filling,C) | -happens(B,C) | holdsAt(waterLevel(D),plus(C,A)) | happens(f4(C,filling,plus(C,A)),f5(C,filling,plus(C,A))) | plus(E,A) != D | -holdsAt(waterLevel(E),C). [resolve(54,b,55,c)]. 1.46/1.73 178 -less(n0,A) | -initiates(B,filling,C) | -happens(B,C) | holdsAt(waterLevel(D),plus(A,C)) | happens(f4(C,filling,plus(A,C)),f5(C,filling,plus(A,C))) | plus(A,E) != D | -holdsAt(waterLevel(E),C). [copy(177),rewrite([146(7),146(10),146(13),146(16)])]. 1.46/1.73 179 -less(n0,A) | -initiates(B,filling,C) | -happens(B,C) | holdsAt(waterLevel(D),plus(C,A)) | less(f5(C,filling,plus(C,A)),plus(C,A)) | plus(E,A) != D | -holdsAt(waterLevel(E),C). [resolve(56,b,55,c)]. 1.46/1.73 180 -less(n0,A) | -initiates(B,filling,C) | -happens(B,C) | holdsAt(waterLevel(D),plus(A,C)) | less(f5(C,filling,plus(A,C)),plus(A,C)) | plus(A,E) != D | -holdsAt(waterLevel(E),C). [copy(179),rewrite([146(7),146(10),146(12),146(14)])]. 1.46/1.73 183 -less(n0,A) | -initiates(B,filling,C) | -happens(B,C) | holdsAt(waterLevel(D),plus(C,A)) | less(C,f5(C,filling,plus(C,A))) | plus(E,A) != D | -holdsAt(waterLevel(E),C). [resolve(58,b,55,c)]. 1.46/1.73 184 -less(n0,A) | -initiates(B,filling,C) | -happens(B,C) | holdsAt(waterLevel(D),plus(A,C)) | less(C,f5(C,filling,plus(A,C))) | plus(A,E) != D | -holdsAt(waterLevel(E),C). [copy(183),rewrite([146(7),146(10),146(13)])]. 1.46/1.73 185 -less(A,A). [factor(133,a,b)]. 1.46/1.73 186 plus(n1,n0) = n1. [back_rewrite(116),rewrite([146(3)])]. 1.46/1.73 187 tapOn != A | happens(A,n0). [xx_res(75,a)]. 1.46/1.73 193 tapOn != A | initiates(A,filling,B). [xx_res(89,a)]. 1.46/1.73 202 less(n6,A) | n6 = A | less_or_equal(A,n5). [resolve(135,a,129,a)]. 1.46/1.73 203 less(n2,A) | n2 = A | less_or_equal(A,n1). [resolve(135,a,127,a)]. 1.46/1.73 204 less(n3,A) | n3 = A | less_or_equal(A,n2). [resolve(135,a,123,a)]. 1.46/1.73 205 less(n1,A) | n1 = A | less_or_equal(A,n0). [resolve(135,a,121,a)]. 1.46/1.73 208 less_or_equal(A,n4) | less(n5,A) | n5 = A. [resolve(136,a,135,b),flip(c)]. 1.46/1.73 210 less_or_equal(A,n3) | less(n4,A) | n4 = A. [resolve(147,a,135,b),flip(c)]. 1.46/1.73 220 less_or_equal(A,A). [xx_res(154,a)]. 1.46/1.73 227 -holdsAt(waterLevel(A),n2) | n3 = A. [resolve(163,a,71,b)]. 1.46/1.73 232 waterLevel(f9(tapOn,A,B)) = A | waterLevel(C) != A. [xx_res(172,b)]. 1.46/1.73 234 happens(tapOn,n0). [xx_res(187,a)]. 1.46/1.73 240 less(n1,n2). [resolve(220,a,128,b)]. 1.46/1.73 241 less(n2,n3). [resolve(220,a,124,b)]. 1.46/1.73 242 less(n0,n1). [resolve(220,a,122,b)]. 1.46/1.73 260 less_or_equal(n1,n2). [resolve(240,a,155,a)]. 1.46/1.73 265 n2 != n3. [resolve(241,a,134,a),flip(a)]. 1.46/1.73 267 less_or_equal(n0,n1). [resolve(242,a,155,a)]. 1.46/1.73 268 n0 != n1. [resolve(242,a,134,a),flip(a)]. 1.46/1.73 277 less(n1,n3). [resolve(260,a,124,b)]. 1.46/1.73 279 less(n0,n2). [resolve(267,a,128,b)]. 1.46/1.73 293 initiates(tapOn,filling,A). [xx_res(193,a)]. 1.46/1.73 295 n3 != n1. [resolve(277,a,134,a)]. 1.46/1.73 300 less_or_equal(n0,n2). [resolve(279,a,155,a)]. 1.46/1.73 301 n2 != n0. [resolve(279,a,134,a)]. 1.46/1.73 312 less(n0,n3). [resolve(300,a,124,b)]. 1.46/1.73 333 less_or_equal(n0,n3). [resolve(312,a,155,a)]. 1.46/1.73 334 n3 != n0. [resolve(312,a,134,a)]. 1.46/1.73 342 less(n0,n4). [resolve(333,a,148,b)]. 1.46/1.73 359 less_or_equal(n0,n4). [resolve(342,a,155,a)]. 1.46/1.73 360 n4 != n0. [resolve(342,a,134,a)]. 1.46/1.73 361 less(n6,A) | n6 = A | n5 = A | less(A,n5). [resolve(202,c,156,c)]. 1.46/1.73 365 less(n2,A) | n2 = A | n1 = A | less(A,n1). [resolve(203,c,156,c)]. 1.46/1.73 367 less(n0,n5). [resolve(359,a,137,b)]. 1.46/1.73 374 less(n3,A) | n3 = A | n2 = A | less(A,n2). [resolve(204,c,156,c)]. 1.46/1.73 381 less_or_equal(n0,n5). [resolve(367,a,155,a)]. 1.46/1.73 382 n5 != n0. [resolve(367,a,134,a)]. 1.46/1.73 384 less(n1,A) | n1 = A | n0 = A. [resolve(205,c,156,c),unit_del(d,153)]. 1.46/1.73 387 less(n0,n6). [resolve(381,a,130,b)]. 1.46/1.73 399 n6 != n0. [resolve(387,a,134,a)]. 1.46/1.73 403 less(n5,A) | n5 = A | n4 = A | less(A,n4). [resolve(208,a,156,c)]. 1.46/1.73 420 less(n4,A) | n4 = A | n3 = A | less(A,n3). [resolve(210,a,156,c)]. 1.46/1.73 436 -less(n0,A) | -happens(tapOn,B) | holdsAt(waterLevel(C),plus(A,B)) | less(B,f5(B,filling,plus(A,B))) | plus(A,D) != C | -holdsAt(waterLevel(D),B). [resolve(293,a,184,b)]. 1.46/1.73 438 -less(n0,A) | -happens(tapOn,B) | holdsAt(waterLevel(C),plus(A,B)) | less(f5(B,filling,plus(A,B)),plus(A,B)) | plus(A,D) != C | -holdsAt(waterLevel(D),B). [resolve(293,a,180,b)]. 1.46/1.73 439 -less(n0,A) | -happens(tapOn,B) | holdsAt(waterLevel(C),plus(A,B)) | happens(f4(B,filling,plus(A,B)),f5(B,filling,plus(A,B))) | plus(A,D) != C | -holdsAt(waterLevel(D),B). [resolve(293,a,178,b)]. 1.46/1.73 508 n1 = A | n0 = A | -less(A,n1). [resolve(384,a,133,b)]. 1.46/1.73 551 waterLevel(f9(tapOn,waterLevel(A),B)) = waterLevel(A). [xx_res(232,b)]. 1.46/1.73 558 less(n6,A) | n6 = A | n5 = A | less_or_equal(A,n4). [resolve(361,d,136,a)]. 1.46/1.73 562 n2 = A | n1 = A | less(A,n1) | -less(A,n2). [resolve(365,a,133,b)]. 1.46/1.73 563 less(n2,A) | n2 = A | n1 = A | n0 = A. [resolve(365,d,508,c),merge(d)]. 1.46/1.73 569 n3 = A | n2 = A | less(A,n2) | -less(A,n3). [resolve(374,a,133,b)]. 1.46/1.73 580 less(n5,A) | n5 = A | n4 = A | less_or_equal(A,n3). [resolve(403,d,147,a)]. 1.46/1.73 595 f9(tapOn,waterLevel(A),B) = A. [resolve(551,a,113,a)]. 1.46/1.73 648 -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | less(n0,f5(n0,filling,plus(A,n0))) | plus(A,C) != B | -holdsAt(waterLevel(C),n0). [resolve(436,b,234,a)]. 1.46/1.73 653 -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | less(f5(n0,filling,plus(A,n0)),plus(A,n0)) | plus(A,C) != B | -holdsAt(waterLevel(C),n0). [resolve(438,b,234,a)]. 1.46/1.73 656 -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | happens(f4(n0,filling,plus(A,n0)),f5(n0,filling,plus(A,n0))) | plus(A,C) != B | -holdsAt(waterLevel(C),n0). [resolve(439,b,234,a)]. 1.46/1.73 872 less(n6,A) | n6 = A | n5 = A | n4 = A | less(A,n4). [resolve(558,d,156,c)]. 1.46/1.73 887 n2 = A | n1 = A | less(A,n1) | less(n3,A) | n3 = A. [resolve(562,d,374,d),merge(f)]. 1.46/1.73 890 n2 = A | n1 = A | n0 = A | -less(A,n2). [resolve(563,a,133,b)]. 1.46/1.73 896 n3 = A | n2 = A | less(A,n2) | less(n4,A) | n4 = A. [resolve(569,d,420,d),merge(f)]. 1.46/1.73 900 less(n5,A) | n5 = A | n4 = A | n3 = A | less(A,n3). [resolve(580,d,156,c)]. 1.46/1.73 901 -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | less(n0,f5(n0,filling,plus(A,n0))) | plus(A,n0) != B. [resolve(648,e,117,a)]. 1.46/1.73 903 -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | less(f5(n0,filling,plus(A,n0)),plus(A,n0)) | plus(A,n0) != B. [resolve(653,e,117,a)]. 1.46/1.73 904 -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | happens(f4(n0,filling,plus(A,n0)),f5(n0,filling,plus(A,n0))) | plus(A,n0) != B. [resolve(656,e,117,a)]. 1.46/1.73 959 less(n6,A) | n6 = A | n5 = A | n4 = A | -less(n4,A). [resolve(872,e,133,b)]. 1.46/1.73 964 n2 = A | n1 = A | less(A,n1) | n3 = A | -less(A,n3). [resolve(887,d,133,b)]. 1.46/1.73 995 less(n6,A) | n6 = A | n5 = A | n4 = A | n3 = A | n2 = A | less(A,n2). [resolve(959,e,896,d),merge(h)]. 1.46/1.73 998 n2 = A | n1 = A | less(A,n1) | n3 = A | less(n5,A) | n5 = A | n4 = A. [resolve(964,e,900,e),merge(h)]. 1.46/1.73 1166 holdsAt(waterLevel(A),n1) | less(n0,f5(n0,filling,n1)) | n1 != A. [resolve(901,a,998,c),rewrite([186(4),186(9),186(12)]),flip(e),unit_del(d,301),unit_del(e,268),unit_del(f,334),unit_del(g,153),unit_del(h,382),unit_del(i,360)]. 1.46/1.73 1167 holdsAt(waterLevel(A),n2) | less(n0,f5(n0,filling,n2)) | n2 != A. [resolve(901,a,995,g),rewrite([146(4),150(4),146(9),150(9),146(12),150(12)]),unit_del(d,153),unit_del(e,399),unit_del(f,382),unit_del(g,360),unit_del(h,334),unit_del(i,301)]. 1.46/1.73 1176 holdsAt(waterLevel(n1),n1) | less(n0,f5(n0,filling,n1)). [resolve(1166,c,595,a(flip)),rewrite([595(4)])]. 1.46/1.73 1179 less(n0,f5(n0,filling,n1)) | -holdsAt(waterLevel(A),n1) | n1 = A. [resolve(1176,a,71,b)]. 1.46/1.73 1182 holdsAt(waterLevel(n2),n2) | less(n0,f5(n0,filling,n2)). [resolve(1167,c,595,a(flip)),rewrite([595(4)])]. 1.46/1.73 1183 less(n0,f5(n0,filling,n2)). [resolve(1182,a,227,a),flip(b),unit_del(b,265)]. 1.46/1.73 1197 f5(n0,filling,n2) != n0. [resolve(1183,a,134,a)]. 1.46/1.73 1206 holdsAt(waterLevel(A),n1) | less(f5(n0,filling,n1),n1) | n1 != A. [resolve(903,a,998,c),rewrite([186(4),186(8),186(10),186(12)]),flip(e),unit_del(d,301),unit_del(e,268),unit_del(f,334),unit_del(g,153),unit_del(h,382),unit_del(i,360)]. 1.46/1.73 1207 holdsAt(waterLevel(A),n2) | less(f5(n0,filling,n2),n2) | n2 != A. [resolve(903,a,995,g),rewrite([146(4),150(4),146(8),150(8),146(10),150(10),146(12),150(12)]),unit_del(d,153),unit_del(e,399),unit_del(f,382),unit_del(g,360),unit_del(h,334),unit_del(i,301)]. 1.46/1.73 1216 holdsAt(waterLevel(n1),n1) | less(f5(n0,filling,n1),n1). [resolve(1206,c,595,a(flip)),rewrite([595(4)])]. 1.46/1.73 1219 less(f5(n0,filling,n1),n1) | -holdsAt(waterLevel(A),n1) | n1 = A. [resolve(1216,a,71,b)]. 1.46/1.73 1224 holdsAt(waterLevel(A),n2) | happens(f4(n0,filling,n2),f5(n0,filling,n2)) | n2 != A. [resolve(904,a,995,g),rewrite([146(4),150(4),146(8),150(8),146(12),150(12),146(15),150(15)]),unit_del(d,153),unit_del(e,399),unit_del(f,382),unit_del(g,360),unit_del(h,334),unit_del(i,301)]. 1.46/1.73 1233 holdsAt(waterLevel(n2),n2) | less(f5(n0,filling,n2),n2). [resolve(1207,c,595,a(flip)),rewrite([595(4)])]. 1.46/1.73 1234 less(f5(n0,filling,n2),n2). [resolve(1233,a,227,a),flip(b),unit_del(b,265)]. 1.46/1.73 1235 f5(n0,filling,n2) = n2 | f5(n0,filling,n2) = n1. [resolve(1234,a,890,d),flip(a),flip(b),flip(c),unit_del(c,1197)]. 1.46/1.73 1244 f5(n0,filling,n2) != n2. [resolve(1234,a,134,a),flip(a)]. 1.46/1.73 1254 f5(n0,filling,n2) = n1. [back_unit_del(1235),unit_del(a,1244)]. 1.46/1.73 1255 holdsAt(waterLevel(A),n2) | happens(f4(n0,filling,n2),n1) | n2 != A. [back_rewrite(1224),rewrite([1254(11)])]. 1.46/1.73 1264 holdsAt(waterLevel(n2),n2) | happens(f4(n0,filling,n2),n1). [resolve(1255,c,595,a(flip)),rewrite([595(4)])]. 1.46/1.73 1269 holdsAt(waterLevel(n2),n2) | holdsAt(waterLevel(n3),n1). [resolve(1264,b,77,c),unit_del(b,268)]. 1.46/1.73 1270 holdsAt(waterLevel(n3),n1). [resolve(1269,a,227,a),flip(b),unit_del(b,265)]. 1.46/1.73 1271 less(f5(n0,filling,n1),n1). [resolve(1270,a,1219,b),flip(b),unit_del(b,295)]. 1.46/1.73 1272 less(n0,f5(n0,filling,n1)). [resolve(1270,a,1179,b),flip(b),unit_del(b,295)]. 1.46/1.73 1285 f5(n0,filling,n1) = n1 | f5(n0,filling,n1) = n0. [resolve(1271,a,508,c),flip(a),flip(b)]. 1.46/1.73 1287 f5(n0,filling,n1) != n1. [resolve(1271,a,134,a),flip(a)]. 1.46/1.73 1290 f5(n0,filling,n1) = n0. [back_unit_del(1285),unit_del(a,1287)]. 1.46/1.73 1291 $F. [back_rewrite(1272),rewrite([1290(5)]),unit_del(a,185)]. 1.46/1.73 1.46/1.73 % SZS output end Refutation 1.46/1.73 ============================== end of proof ========================== 1.46/1.73 1.46/1.73 ============================== STATISTICS ============================ 1.46/1.73 1.46/1.73 Given=937. Generated=25409. Kept=1219. proofs=1. 1.46/1.73 Usable=922. Sos=214. Demods=18. Limbo=1, Disabled=221. Hints=0. 1.46/1.73 Megabytes=1.76. 1.46/1.73 User_CPU=0.64, System_CPU=0.02, Wall_clock=1. 1.46/1.73 1.46/1.73 ============================== end of statistics ===================== 1.46/1.73 1.46/1.73 ============================== end of search ========================= 1.46/1.73 1.46/1.73 THEOREM PROVED 1.46/1.73 % SZS status Theorem 1.46/1.73 1.46/1.73 Exiting with 1 proof. 1.46/1.73 1.46/1.73 Process 4935 exit (max_proofs) Tue Aug 9 04:57:24 2022 1.46/1.74 Prover9 interrupted 1.46/1.74 EOF