TSTP Solution File: CSR014+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR014+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Fri Jul 15 23:03:35 EDT 2022
% Result : Timeout 300.02s 300.29s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR014+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 10 01:33:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.40/1.01 ============================== Prover9 ===============================
% 0.40/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.40/1.01 Process 10438 was started by sandbox on n020.cluster.edu,
% 0.40/1.01 Fri Jun 10 01:33:21 2022
% 0.40/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10268_n020.cluster.edu".
% 0.40/1.01 ============================== end of head ===========================
% 0.40/1.01
% 0.40/1.01 ============================== INPUT =================================
% 0.40/1.01
% 0.40/1.01 % Reading from file /tmp/Prover9_10268_n020.cluster.edu
% 0.40/1.01
% 0.40/1.01 set(prolog_style_variables).
% 0.40/1.01 set(auto2).
% 0.40/1.01 % set(auto2) -> set(auto).
% 0.40/1.01 % set(auto) -> set(auto_inference).
% 0.40/1.01 % set(auto) -> set(auto_setup).
% 0.40/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.40/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.40/1.01 % set(auto) -> set(auto_limits).
% 0.40/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.40/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.40/1.01 % set(auto) -> set(auto_denials).
% 0.40/1.01 % set(auto) -> set(auto_process).
% 0.40/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.40/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.40/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.40/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.40/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.40/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.40/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.40/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.40/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.40/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.40/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.40/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.40/1.01 % set(auto2) -> assign(stats, some).
% 0.40/1.01 % set(auto2) -> clear(echo_input).
% 0.40/1.01 % set(auto2) -> set(quiet).
% 0.40/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.40/1.01 % set(auto2) -> clear(print_given).
% 0.40/1.01 assign(lrs_ticks,-1).
% 0.40/1.01 assign(sos_limit,10000).
% 0.40/1.01 assign(order,kbo).
% 0.40/1.01 set(lex_order_vars).
% 0.40/1.01 clear(print_given).
% 0.40/1.01
% 0.40/1.01 % formulas(sos). % not echoed (55 formulas)
% 0.40/1.01
% 0.40/1.01 ============================== end of input ==========================
% 0.40/1.01
% 0.40/1.01 % From the command line: assign(max_seconds, 300).
% 0.40/1.01
% 0.40/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.40/1.01
% 0.40/1.01 % Formulas that are not ordinary clauses:
% 0.40/1.01 1 (all Time1 all Fluent all Time2 (stoppedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (happens(Event,Time) & less(Time1,Time) & less(Time,Time2) & terminates(Event,Fluent,Time))))) # label(stoppedin_defn) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 2 (all Time1 all Time2 all Fluent (startedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (happens(Event,Time) & less(Time1,Time) & less(Time,Time2) & initiates(Event,Fluent,Time))))) # label(startedin_defn) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 3 (all Event all Time all Fluent all Fluent2 all Offset (happens(Event,Time) & initiates(Event,Fluent,Time) & less(n0,Offset) & trajectory(Fluent,Time,Fluent2,Offset) & -stoppedIn(Time,Fluent,plus(Time,Offset)) -> holdsAt(Fluent2,plus(Time,Offset)))) # label(change_holding) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 4 (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.01 5 (all Fluent all Time (holdsAt(Fluent,Time) & -releasedAt(Fluent,plus(Time,n1)) & -(exists Event (happens(Event,Time) & terminates(Event,Fluent,Time))) -> holdsAt(Fluent,plus(Time,n1)))) # label(keep_holding) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 6 (all Fluent all Time (-holdsAt(Fluent,Time) & -releasedAt(Fluent,plus(Time,n1)) & -(exists Event (happens(Event,Time) & initiates(Event,Fluent,Time))) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 7 (all Fluent all Time (releasedAt(Fluent,Time) & -(exists Event (happens(Event,Time) & (initiates(Event,Fluent,Time) | terminates(Event,Fluent,Time)))) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 8 (all Fluent all Time (-releasedAt(Fluent,Time) & -(exists Event (happens(Event,Time) & releases(Event,Fluent,Time))) -> -releasedAt(Fluent,plus(Time,n1)))) # label(keep_not_released) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 9 (all Event all Time all Fluent (happens(Event,Time) & initiates(Event,Fluent,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(happens_holds) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 10 (all Event all Time all Fluent (happens(Event,Time) & terminates(Event,Fluent,Time) -> -holdsAt(Fluent,plus(Time,n1)))) # label(happens_terminates_not_holds) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 11 (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.01 12 (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.40/1.01 13 (all Event all Fluent all Time (initiates(Event,Fluent,Time) <-> Event = tapOn & Fluent = filling | Event = overflow & Fluent = spilling | (exists Height (holdsAt(waterLevel(Height),Time) & Event = tapOff & Fluent = waterLevel(Height))) | (exists Height (holdsAt(waterLevel(Height),Time) & Event = overflow & Fluent = waterLevel(Height))))) # label(initiates_all_defn) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 14 (all Event all Fluent all Time (terminates(Event,Fluent,Time) <-> Event = tapOff & Fluent = filling | Event = overflow & Fluent = filling)) # label(terminates_all_defn) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 15 (all Event all Fluent all Time (releases(Event,Fluent,Time) <-> (exists Height (Event = tapOn & Fluent = waterLevel(Height))))) # label(releases_all_defn) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 16 (all Event all Time (happens(Event,Time) <-> Event = tapOn & Time = n0 | holdsAt(waterLevel(n3),Time) & holdsAt(filling,Time) & Event = overflow)) # label(happens_all_defn) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 17 (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.40/1.01 18 (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.01 19 (all X filling != waterLevel(X)) # label(filling_not_waterLevel) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 20 (all X spilling != waterLevel(X)) # label(spilling_not_waterLevel) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 21 (all X all Y (waterLevel(X) = waterLevel(Y) <-> X = Y)) # label(distinct_waterLevels) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 22 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 23 (all X all Y (less_or_equal(X,Y) <-> less(X,Y) | X = Y)) # label(less_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 24 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 25 (all X (less(X,n1) <-> less_or_equal(X,n0))) # label(less1) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 26 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 27 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 28 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 29 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 30 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 31 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 32 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 33 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 34 (all X all Y (less(X,Y) <-> -less(Y,X) & Y != X)) # label(less_property) # label(axiom) # label(non_clause). [assumption].
% 0.40/1.01 35 (all Height -releasedAt(waterLevel(Height),n0)) # label(not_released_waterLevel_0) # label(hypothesis) # label(non_clause). [assumption].
% 0.40/1.01 36 --releasedAt(filling,n3) # label(filling_3_l1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.40/1.01
% 0.40/1.01 ============================== end of process non-clausal formulas ===
% 0.40/1.01
% 0.40/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.40/1.01
% 0.40/1.01 ============================== PREDICATE ELIMINATION =================
% 0.40/1.01 37 stoppedIn(A,B,C) | -happens(D,E) | -less(A,E) | -less(E,C) | -terminates(D,B,E) # label(stoppedin_defn) # label(axiom). [clausify(1)].
% 0.40/1.01 38 -stoppedIn(A,B,C) | happens(f1(A,B,C),f2(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(1)].
% 0.40/1.01 39 -stoppedIn(A,B,C) | less(A,f2(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(1)].
% 0.40/1.01 40 -stoppedIn(A,B,C) | less(f2(A,B,C),C) # label(stoppedin_defn) # label(axiom). [clausify(1)].
% 0.40/1.01 41 -stoppedIn(A,B,C) | terminates(f1(A,B,C),B,f2(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(1)].
% 0.40/1.01 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -terminates(A,E,B) | happens(f1(C,E,D),f2(C,E,D)). [resolve(37,a,38,a)].
% 0.40/1.01 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -terminates(A,E,B) | less(C,f2(C,E,D)). [resolve(37,a,39,a)].
% 0.40/1.01 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -terminates(A,E,B) | less(f2(C,E,D),D). [resolve(37,a,40,a)].
% 0.40/1.01 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -terminates(A,E,B) | terminates(f1(C,E,D),E,f2(C,E,D)). [resolve(37,a,41,a)].
% 0.40/1.01 42 -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | stoppedIn(B,C,plus(B,D)) | holdsAt(E,plus(B,D)) # label(change_holding) # label(axiom). [clausify(3)].
% 0.40/1.01 Derived: -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | happens(f1(B,C,plus(B,D)),f2(B,C,plus(B,D))). [resolve(42,e,38,a)].
% 0.40/1.01 Derived: -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(B,f2(B,C,plus(B,D))). [resolve(42,e,39,a)].
% 0.40/1.01 Derived: -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(f2(B,C,plus(B,D)),plus(B,D)). [resolve(42,e,40,a)].
% 0.40/1.01 Derived: -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | terminates(f1(B,C,plus(B,D)),C,f2(B,C,plus(B,D))). [resolve(42,e,41,a)].
% 0.40/1.01 43 startedIn(A,B,C) | -happens(D,E) | -less(A,E) | -less(E,C) | -initiates(D,B,E) # label(startedin_defn) # label(axiom). [clausify(2)].
% 0.40/1.01 44 -startedIn(A,B,C) | happens(f3(A,C,B),f4(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(2)].
% 0.40/1.01 45 -startedIn(A,B,C) | less(A,f4(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(2)].
% 0.40/1.01 46 -startedIn(A,B,C) | less(f4(A,C,B),C) # label(startedin_defn) # label(axiom). [clausify(2)].
% 0.40/1.01 47 -startedIn(A,B,C) | initiates(f3(A,C,B),B,f4(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(2)].
% 0.40/1.01 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -initiates(A,E,B) | happens(f3(C,D,E),f4(C,D,E)). [resolve(43,a,44,a)].
% 0.40/1.01 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -initiates(A,E,B) | less(C,f4(C,D,E)). [resolve(43,a,45,a)].
% 0.40/1.01 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -initiates(A,E,B) | less(f4(C,D,E),D). [resolve(43,a,46,a)].
% 0.40/1.01 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -initiates(A,E,B) | initiates(f3(C,D,E),E,f4(C,D,E)). [resolve(43,a,47,a)].
% 0.40/1.01 48 -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(4)].
% 0.40/1.01 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | happens(f3(B,plus(B,D),C),f4(B,plus(B,D),C)). [resolve(48,e,44,a)].
% 3.41/3.75 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(B,f4(B,plus(B,D),C)). [resolve(48,e,45,a)].
% 3.41/3.75 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(f4(B,plus(B,D),C),plus(B,D)). [resolve(48,e,46,a)].
% 3.41/3.75 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | initiates(f3(B,plus(B,D),C),C,f4(B,plus(B,D),C)). [resolve(48,e,47,a)].
% 3.41/3.75 49 -happens(A,B) | -releases(A,C,B) | releasedAt(C,plus(B,n1)) # label(happens_releases) # label(axiom). [clausify(11)].
% 3.41/3.75 50 releasedAt(A,B) | releases(f8(A,B),A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom). [clausify(8)].
% 3.41/3.75 51 -releases(A,B,C) | tapOn = A # label(releases_all_defn) # label(axiom). [clausify(15)].
% 3.41/3.75 Derived: tapOn = f8(A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)). [resolve(51,a,50,b)].
% 3.41/3.75 52 -releases(A,B,C) | waterLevel(f11(A,B,C)) = B # label(releases_all_defn) # label(axiom). [clausify(15)].
% 3.41/3.75 Derived: waterLevel(f11(f8(A,B),A,B)) = A | releasedAt(A,B) | -releasedAt(A,plus(B,n1)). [resolve(52,a,50,b)].
% 3.41/3.75 53 releases(A,B,C) | tapOn != A | waterLevel(D) != B # label(releases_all_defn) # label(axiom). [clausify(15)].
% 3.41/3.75 Derived: tapOn != A | waterLevel(B) != C | -happens(A,D) | releasedAt(C,plus(D,n1)). [resolve(53,a,49,b)].
% 3.41/3.75 Derived: tapOn != A | waterLevel(B) != C | waterLevel(f11(A,C,D)) = C. [resolve(53,a,52,a)].
% 3.41/3.75 54 -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | happens(f1(B,C,plus(B,D)),f2(B,C,plus(B,D))). [resolve(42,e,38,a)].
% 3.41/3.75 55 -holdsAt(waterLevel(A),B) | plus(A,C) != D | trajectory(filling,B,waterLevel(D),C) # label(change_of_waterLevel) # label(axiom). [clausify(17)].
% 3.41/3.75 Derived: -happens(A,B) | -initiates(A,filling,B) | -less(n0,C) | holdsAt(waterLevel(D),plus(B,C)) | happens(f1(B,filling,plus(B,C)),f2(B,filling,plus(B,C))) | -holdsAt(waterLevel(E),B) | plus(E,C) != D. [resolve(54,d,55,c)].
% 3.41/3.75 56 -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(B,f2(B,C,plus(B,D))). [resolve(42,e,39,a)].
% 3.41/3.75 Derived: -happens(A,B) | -initiates(A,filling,B) | -less(n0,C) | holdsAt(waterLevel(D),plus(B,C)) | less(B,f2(B,filling,plus(B,C))) | -holdsAt(waterLevel(E),B) | plus(E,C) != D. [resolve(56,d,55,c)].
% 3.41/3.75 57 -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(f2(B,C,plus(B,D)),plus(B,D)). [resolve(42,e,40,a)].
% 3.41/3.75 Derived: -happens(A,B) | -initiates(A,filling,B) | -less(n0,C) | holdsAt(waterLevel(D),plus(B,C)) | less(f2(B,filling,plus(B,C)),plus(B,C)) | -holdsAt(waterLevel(E),B) | plus(E,C) != D. [resolve(57,d,55,c)].
% 3.41/3.75 58 -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | terminates(f1(B,C,plus(B,D)),C,f2(B,C,plus(B,D))). [resolve(42,e,41,a)].
% 3.41/3.75 Derived: -happens(A,B) | -initiates(A,filling,B) | -less(n0,C) | holdsAt(waterLevel(D),plus(B,C)) | terminates(f1(B,filling,plus(B,C)),filling,f2(B,filling,plus(B,C))) | -holdsAt(waterLevel(E),B) | plus(E,C) != D. [resolve(58,d,55,c)].
% 3.41/3.75
% 3.41/3.75 ============================== end predicate elimination =============
% 3.41/3.75
% 3.41/3.75 Auto_denials: (non-Horn, no changes).
% 3.41/3.75
% 3.41/3.75 Term ordering decisions:
% 3.41/3.75
% 3.41/3.75 % Assigning unary symbol waterLevel kb_weight 0 and highest precedence (36).
% 3.41/3.75 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. f5=1. f6=1. f7=1. f8=1. f1=1. f2=1. f3=1. f4=1. f9=1. f10=1. f11=1. waterLevel=0.
% 3.41/3.75
% 3.41/3.75 ============================== end of process initial clauses ========
% 3.41/3.75
% 3.41/3.75 ============================== CLAUSES FOR SEARCH ====================
% 3.41/3.75
% 3.41/3.75 ============================== end of clauses for search =============
% 3.41/3.75
% 3.41/3.75 ============================== SEARCH ================================
% 3.41/3.75
% 3.41/3.75 % Starting search at 0.02 seconds.
% 3.41/3.75
% 3.41/3.75 Low Water (keep): wt=92.000, iters=3350
% 3.41/3.75
% 3.41/3.75 Low Water (keep): wt=89.000, iters=3348
% 3.41/3.75
% 3.41/3.75 LCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------