0.11/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n018.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 180 0.12/0.33 % DateTime : Thu Aug 29 11:28:21 EDT 2019 0.12/0.33 % CPUTime : 0.43/1.04 ============================== Prover9 =============================== 0.43/1.04 Prover9 (32) version 2009-11A, November 2009. 0.43/1.04 Process 14045 was started by sandbox2 on n018.cluster.edu, 0.43/1.04 Thu Aug 29 11:28:22 2019 0.43/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_13697_n018.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_13697_n018.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 (56 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 all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 23 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 24 (all X (less_or_equal(X,n6) <-> less(X,n7))) # label(less7) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 25 (all Height -releasedAt(waterLevel(Height),n0)) # label(not_released_waterLevel_0) # label(hypothesis) # label(non_clause). [assumption]. 0.43/1.04 26 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 27 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 28 (all X all Y (X = Y | less(X,Y) <-> less_or_equal(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 29 (all X (less_or_equal(X,n5) <-> less(X,n6))) # label(less6) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 30 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 31 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 32 (all X (less(X,n1) <-> less_or_equal(X,n0))) # label(less1) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 33 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 34 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 35 (all X all Y (less(X,Y) <-> -less(Y,X) & X != Y)) # label(less_property) # label(axiom) # label(non_clause). [assumption]. 0.43/1.04 36 --holdsAt(filling,n4) # label(not_filling_4) # 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.05 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.05 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.05 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.05 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.05 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.05 50 -startedIn(A,B,C) | happens(f7(A,C,B),f8(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(12)]. 0.43/1.05 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.05 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.05 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.05 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.05 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.05 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.05 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.05 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.05 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.05 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.05 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.05 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.05 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.05 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.05 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.05 52 n0 != A | tapOn != B | happens(B,A) # label(happens_all_defn) # label(axiom). [clausify(17)]. 0.43/1.05 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.05 Derived: n0 != A | tapOn != B | -releases(B,C,A) | releasedAt(C,plus(A,n1)). [resolve(52,c,39,b)]. 0.43/1.05 Derived: n0 != A | tapOn != B | -initiates(B,C,A) | holdsAt(C,plus(A,n1)). [resolve(52,c,40,b)]. 0.43/1.05 Derived: n0 != A | tapOn != B | -terminates(B,C,A) | -holdsAt(C,plus(A,n1)). [resolve(52,c,42,b)]. 0.43/1.05 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.05 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.05 Derived: n0 != A | tapOn != B | -initiates(B,C,A) | -releasedAt(C,plus(A,n1)). [resolve(52,c,48,a)]. 0.43/1.05 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)]. 0.43/1.05 5Cputime limit exceeded (core dumped) 180.02/180.31 EOF