0.08/0.10	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.10	% Command  : tptp2X_and_run_prover9 %d %s
0.09/0.30	% Computer : n024.cluster.edu
0.09/0.30	% Model    : x86_64 x86_64
0.09/0.30	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory   : 8042.1875MB
0.09/0.30	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit : 960
0.09/0.30	% WCLimit  : 120
0.09/0.30	% DateTime : Tue Aug  9 04:51:07 EDT 2022
0.09/0.30	% CPUTime  : 
0.66/0.93	============================== Prover9 ===============================
0.66/0.93	Prover9 (32) version 2009-11A, November 2009.
0.66/0.93	Process 20866 was started by sandbox2 on n024.cluster.edu,
0.66/0.93	Tue Aug  9 04:51:08 2022
0.66/0.93	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_20712_n024.cluster.edu".
0.66/0.93	============================== end of head ===========================
0.66/0.93	
0.66/0.93	============================== INPUT =================================
0.66/0.93	
0.66/0.93	% Reading from file /tmp/Prover9_20712_n024.cluster.edu
0.66/0.93	
0.66/0.93	set(prolog_style_variables).
0.66/0.93	set(auto2).
0.66/0.93	    % set(auto2) -> set(auto).
0.66/0.93	    % set(auto) -> set(auto_inference).
0.66/0.93	    % set(auto) -> set(auto_setup).
0.66/0.93	    % set(auto_setup) -> set(predicate_elim).
0.66/0.93	    % set(auto_setup) -> assign(eq_defs, unfold).
0.66/0.93	    % set(auto) -> set(auto_limits).
0.66/0.93	    % set(auto_limits) -> assign(max_weight, "100.000").
0.66/0.93	    % set(auto_limits) -> assign(sos_limit, 20000).
0.66/0.93	    % set(auto) -> set(auto_denials).
0.66/0.93	    % set(auto) -> set(auto_process).
0.66/0.93	    % set(auto2) -> assign(new_constants, 1).
0.66/0.93	    % set(auto2) -> assign(fold_denial_max, 3).
0.66/0.93	    % set(auto2) -> assign(max_weight, "200.000").
0.66/0.93	    % set(auto2) -> assign(max_hours, 1).
0.66/0.93	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.66/0.93	    % set(auto2) -> assign(max_seconds, 0).
0.66/0.93	    % set(auto2) -> assign(max_minutes, 5).
0.66/0.93	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.66/0.93	    % set(auto2) -> set(sort_initial_sos).
0.66/0.93	    % set(auto2) -> assign(sos_limit, -1).
0.66/0.93	    % set(auto2) -> assign(lrs_ticks, 3000).
0.66/0.93	    % set(auto2) -> assign(max_megs, 400).
0.66/0.93	    % set(auto2) -> assign(stats, some).
0.66/0.93	    % set(auto2) -> clear(echo_input).
0.66/0.93	    % set(auto2) -> set(quiet).
0.66/0.93	    % set(auto2) -> clear(print_initial_clauses).
0.66/0.93	    % set(auto2) -> clear(print_given).
0.66/0.93	assign(lrs_ticks,-1).
0.66/0.93	assign(sos_limit,10000).
0.66/0.93	assign(order,kbo).
0.66/0.93	set(lex_order_vars).
0.66/0.93	clear(print_given).
0.66/0.93	
0.66/0.93	% formulas(sos).  % not echoed (55 formulas)
0.66/0.93	
0.66/0.93	============================== end of input ==========================
0.66/0.93	
0.66/0.93	% From the command line: assign(max_seconds, 960).
0.66/0.93	
0.66/0.93	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.66/0.93	
0.66/0.93	% Formulas that are not ordinary clauses:
0.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	14 (all X spilling != waterLevel(X)) # label(spilling_not_waterLevel) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	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.66/0.93	16 (all X filling != waterLevel(X)) # label(filling_not_waterLevel) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	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.66/0.93	21 (all X all Y (waterLevel(Y) = waterLevel(X) <-> Y = X)) # label(distinct_waterLevels) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	22 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	23 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	24 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	25 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	26 (all X (less_or_equal(X,n7) <-> less(X,n8))) # label(less8) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	27 (all X all Y (-less(Y,X) & X != Y <-> less(X,Y))) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	28 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	29 (all Height -releasedAt(waterLevel(Height),n0)) # label(not_released_waterLevel_0) # label(hypothesis) # label(non_clause).  [assumption].
0.66/0.93	30 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	31 (all X all Y (less_or_equal(X,Y) <-> X = Y | less(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	32 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	33 (all X (less_or_equal(X,n8) <-> less(X,n9))) # label(less9) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	34 (all X (less_or_equal(X,n3) <-> less(X,n4))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	35 (all X (less_or_equal(X,n2) <-> less(X,n3))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
0.66/0.93	
0.66/0.93	============================== end of process non-clausal formulas ===
0.66/0.93	
0.66/0.93	============================== PROCESS INITIAL CLAUSES ===============
0.66/0.93	
0.66/0.93	============================== PREDICATE ELIMINATION =================
0.66/0.93	36 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.66/0.93	37 -startedIn(A,B,C) | happens(f1(A,C,B),f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.66/0.93	38 -startedIn(A,B,C) | less(A,f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.66/0.93	39 -startedIn(A,B,C) | initiates(f1(A,C,B),B,f2(A,C,B)) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.66/0.93	40 -startedIn(A,B,C) | less(f2(A,C,B),C) # label(startedin_defn) # label(axiom).  [clausify(1)].
0.66/0.93	Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | happens(f1(C,E,D),f2(C,E,D)).  [resolve(36,a,37,a)].
0.66/0.93	Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | less(C,f2(C,E,D)).  [resolve(36,a,38,a)].
0.66/0.93	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(36,a,39,a)].
0.66/0.93	Derived: -happens(A,B) | -less(C,B) | -initiates(A,D,B) | -less(B,E) | less(f2(C,E,D),E).  [resolve(36,a,40,a)].
0.66/0.93	41 -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.66/0.93	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(41,e,37,a)].
0.66/0.93	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(41,e,38,a)].
0.66/0.93	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(41,e,39,a)].
0.66/0.93	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(41,e,40,a)].
0.66/0.93	42 -happens(A,B) | -releases(A,C,B) | releasedAt(C,plus(B,n1)) # label(happens_releases) # label(axiom).  [clausify(9)].
0.66/0.93	43 releases(f3(A,B),A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom).  [clausify(2)].
0.66/0.93	44 tapOn != A | waterLevel(B) != C | releases(A,C,D) # label(releases_all_defn) # label(axiom).  [clausify(13)].
0.66/0.93	Derived: tapOn != A | waterLevel(B) != C | -happens(A,D) | releasedAt(C,plus(D,n1)).  [resolve(44,c,42,b)].
0.66/0.93	45 tapOn = A | -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(13)].
0.66/0.93	Derived: tapOn = f3(A,B) | releasedAt(A,B) | -releasedAt(A,plus(B,n1)).  [resolve(45,b,43,a)].
0.66/0.93	46 waterLevel(f9(A,B,C)) = B | -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(13)].
0.66/0.93	Derived: waterLevel(f9(f3(A,B),A,B)) = A | releasedAt(A,B) | -releasedAt(A,plus(B,n1)).  [resolve(46,b,43,a)].
0.66/0.93	Derived: waterLevel(f9(A,B,C)) = B | tapOn != A | waterLevel(D) != B.  [resolve(46,b,44,c)].
0.66/0.93	47 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.66/0.93	48 -stoppedIn(A,B,C) | happens(f4(A,B,C),f5(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(3)].
0.66/0.93	49 -stoppedIn(A,B,C) | less(f5(A,B,C),C) # label(stoppedin_defn) # label(axiom).  [clausify(3)].
0.66/0.93	50 -stoppedIn(A,B,C) | terminates(f4(A,B,C),B,f5(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(3)].
0.88/1.18	51 -stoppedIn(A,B,C) | less(A,f5(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(3)].
0.88/1.18	Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | happens(f4(E,D,C),f5(E,D,C)).  [resolve(47,a,48,a)].
0.88/1.18	Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | less(f5(E,D,C),C).  [resolve(47,a,49,a)].
0.88/1.18	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(47,a,50,a)].
0.88/1.18	Derived: -happens(A,B) | -less(B,C) | -terminates(A,D,B) | -less(E,B) | less(E,f5(E,D,C)).  [resolve(47,a,51,a)].
0.88/1.18	52 -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.18	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(52,b,48,a)].
0.88/1.18	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(52,b,49,a)].
0.88/1.18	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(52,b,50,a)].
0.88/1.18	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(52,b,51,a)].
0.88/1.18	53 -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(52,b,48,a)].
0.88/1.18	54 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.18	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(53,b,54,c)].
0.88/1.18	55 -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(52,b,49,a)].
0.88/1.18	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(55,b,54,c)].
0.88/1.18	56 -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(52,b,50,a)].
0.88/1.18	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(56,b,54,c)].
0.88/1.18	57 -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(52,b,51,a)].
0.88/1.18	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(57,b,54,c)].
0.88/1.18	
0.88/1.18	============================== end predicate elimination =============
0.88/1.18	
0.88/1.18	Auto_denials:  (non-Horn, no changes).
0.88/1.18	
0.88/1.18	Term ordering decisions:
0.88/1.18	
0.88/1.18	% Assigning unary symbol waterLevel kb_weight 0 and highest precedence (36).
0.88/1.18	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.18	
0.88/1.18	============================== end of process initial clauses ========
0.88/1.18	
0.88/1.18	============================== CLAUSES FOR SEARCH ====================
0.88/1.18	
0.88/1.18	============================== end of clauses for search =============
0.88/1.18	
0.88/1.18	============================== SEARCH ================================
0.88/1.18	
0.88/1.18	% Starting search at 0.02 seconds.
0.88/1.18	
0.88/1.18	============================== PROOF =================================
0.88/1.18	% SZS status Theorem
0.88/1.18	% SZS output start Refutation
0.88/1.18	
0.88/1.18	% Proof 1 at 0.25 (+ 0.01) seconds.
0.88/1.18	% Length of proof is 129.
0.88/1.18	% Level of proof is 22.
0.88/1.18	% Maximum clause weight is 38.000.
0.88/1.18	% Given clauses 719.
0.88/1.18	
0.88/1.18	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.88/1.18	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.88/1.18	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.88/1.18	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.88/1.18	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.88/1.18	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.88/1.18	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.88/1.18	21 (all X all Y (waterLevel(Y) = waterLevel(X) <-> Y = X)) # label(distinct_waterLevels) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	25 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	27 (all X all Y (-less(Y,X) & X != Y <-> less(X,Y))) # label(less_property) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	28 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	30 (all X (less_or_equal(X,n0) <-> less(X,n1))) # label(less1) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	31 (all X all Y (less_or_equal(X,Y) <-> X = Y | less(X,Y))) # label(less_or_equal) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	32 (all X (less_or_equal(X,n1) <-> less(X,n2))) # label(less2) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	34 (all X (less_or_equal(X,n3) <-> less(X,n4))) # label(less4) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	35 (all X (less_or_equal(X,n2) <-> less(X,n3))) # label(less3) # label(axiom) # label(non_clause).  [assumption].
0.88/1.18	44 tapOn != A | waterLevel(B) != C | releases(A,C,D) # label(releases_all_defn) # label(axiom).  [clausify(13)].
0.88/1.18	46 waterLevel(f9(A,B,C)) = B | -releases(A,B,C) # label(releases_all_defn) # label(axiom).  [clausify(13)].
0.88/1.18	48 -stoppedIn(A,B,C) | happens(f4(A,B,C),f5(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(3)].
0.88/1.18	49 -stoppedIn(A,B,C) | less(f5(A,B,C),C) # label(stoppedin_defn) # label(axiom).  [clausify(3)].
0.88/1.18	51 -stoppedIn(A,B,C) | less(A,f5(A,B,C)) # label(stoppedin_defn) # label(axiom).  [clausify(3)].
0.88/1.18	52 -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.18	53 -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(52,b,48,a)].
0.88/1.18	54 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.18	55 -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(52,b,49,a)].
0.88/1.18	57 -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(52,b,51,a)].
0.88/1.18	70 -holdsAt(waterLevel(A),B) | -holdsAt(waterLevel(C),B) | C = A # label(same_waterLevel) # label(axiom).  [clausify(15)].
0.88/1.18	74 n0 != A | tapOn != B | happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(17)].
0.88/1.18	76 n0 = A | holdsAt(waterLevel(n3),A) | -happens(B,A) # label(happens_all_defn) # label(axiom).  [clausify(17)].
0.88/1.18	88 filling != A | tapOn != B | initiates(B,A,C) # label(initiates_all_defn) # label(axiom).  [clausify(19)].
0.88/1.18	112 waterLevel(A) != waterLevel(B) | A = B # label(distinct_waterLevels) # label(axiom).  [clausify(21)].
0.88/1.18	118 n2 = plus(n0,n2) # label(plus0_2) # label(axiom).  [assumption].
0.88/1.18	119 plus(n0,n2) = n2.  [copy(118),flip(a)].
0.88/1.18	124 plus(A,B) = plus(B,A) # label(symmetry_of_plus) # label(axiom).  [clausify(25)].
0.88/1.18	131 less(A,B) | A = B | less(B,A) # label(less_property) # label(axiom).  [clausify(27)].
0.88/1.18	132 -less(A,B) | -less(B,A) # label(less_property) # label(axiom).  [clausify(27)].
0.88/1.18	133 A != B | -less(B,A) # label(less_property) # label(axiom).  [clausify(27)].
0.88/1.18	139 plus(n0,n1) = n1 # label(plus0_1) # label(axiom).  [assumption].
0.88/1.18	140 plus(n1,n0) = n1.  [copy(139),rewrite([124(3)])].
0.88/1.18	142 -less(A,n0) # label(less0) # label(axiom).  [clausify(28)].
0.88/1.18	144 -less_or_equal(A,n0) | less(A,n1) # label(less1) # label(axiom).  [clausify(30)].
0.88/1.18	145 less_or_equal(A,n0) | -less(A,n1) # label(less1) # label(axiom).  [clausify(30)].
0.88/1.18	146 -less_or_equal(A,B) | B = A | less(A,B) # label(less_or_equal) # label(axiom).  [clausify(31)].
0.88/1.18	147 less_or_equal(A,B) | B != A # label(less_or_equal) # label(axiom).  [clausify(31)].
0.88/1.18	148 less_or_equal(A,B) | -less(A,B) # label(less_or_equal) # label(axiom).  [clausify(31)].
0.88/1.18	153 holdsAt(waterLevel(n0),n0) # label(waterLevel_0) # label(hypothesis).  [assumption].
0.88/1.18	156 -less_or_equal(A,n1) | less(A,n2) # label(less2) # label(axiom).  [clausify(32)].
0.88/1.18	157 less_or_equal(A,n1) | -less(A,n2) # label(less2) # label(axiom).  [clausify(32)].
0.88/1.18	161 -less_or_equal(A,n3) | less(A,n4) # label(less4) # label(axiom).  [clausify(34)].
0.88/1.18	162 less_or_equal(A,n3) | -less(A,n4) # label(less4) # label(axiom).  [clausify(34)].
0.88/1.18	163 -less_or_equal(A,n2) | less(A,n3) # label(less3) # label(axiom).  [clausify(35)].
0.88/1.18	164 less_or_equal(A,n2) | -less(A,n3) # label(less3) # label(axiom).  [clausify(35)].
0.88/1.18	165 -holdsAt(waterLevel(n2),n2) # label(waterLevel_2) # label(negated_conjecture).  [assumption].
0.88/1.18	174 waterLevel(f9(A,B,C)) = B | tapOn != A | waterLevel(D) != B.  [resolve(46,b,44,c)].
0.88/1.18	179 -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(53,b,54,c)].
0.88/1.18	180 -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(179),rewrite([124(7),124(10),124(13),124(16)])].
0.88/1.18	181 -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(55,b,54,c)].
0.88/1.18	182 -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(181),rewrite([124(7),124(10),124(12),124(14)])].
0.88/1.18	185 -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(57,b,54,c)].
0.88/1.18	186 -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(185),rewrite([124(7),124(10),124(13)])].
0.88/1.18	188 tapOn != A | happens(A,n0).  [xx_res(74,a)].
0.88/1.18	194 tapOn != A | initiates(A,filling,B).  [xx_res(88,a)].
0.88/1.18	204 less_or_equal(A,n0) | less(n1,A) | n1 = A.  [resolve(145,b,131,c)].
0.88/1.18	212 less_or_equal(A,A).  [xx_res(147,b)].
0.88/1.18	223 less_or_equal(A,n1) | less(n2,A) | n2 = A.  [resolve(157,b,131,c)].
0.88/1.18	225 less_or_equal(A,n3) | less(n4,A) | n4 = A.  [resolve(162,b,131,c)].
0.88/1.18	226 less_or_equal(A,n2) | less(n3,A) | n3 = A.  [resolve(164,b,131,c)].
0.88/1.18	229 waterLevel(f9(tapOn,A,B)) = A | waterLevel(C) != A.  [xx_res(174,b)].
0.88/1.18	231 happens(tapOn,n0).  [xx_res(188,a)].
0.88/1.18	235 less(n1,n2).  [resolve(212,a,156,a)].
0.88/1.18	236 less(n0,n1).  [resolve(212,a,144,a)].
0.88/1.18	251 less_or_equal(n1,n2).  [resolve(235,a,148,b)].
0.88/1.18	254 less_or_equal(n0,n1).  [resolve(236,a,148,b)].
0.88/1.18	255 n0 != n1.  [resolve(236,a,133,b),flip(a)].
0.88/1.18	271 less(n1,n3).  [resolve(251,a,163,a)].
0.88/1.18	272 less(n0,n2).  [resolve(254,a,156,a)].
0.88/1.18	285 n3 != n1.  [resolve(271,a,133,b)].
0.88/1.18	287 less_or_equal(n0,n2).  [resolve(272,a,148,b)].
0.88/1.18	288 n2 != n0.  [resolve(272,a,133,b)].
0.88/1.18	289 initiates(tapOn,filling,A).  [xx_res(194,a)].
0.88/1.18	305 less(n0,n3).  [resolve(287,a,163,a)].
0.88/1.18	319 less_or_equal(n0,n3).  [resolve(305,a,148,b)].
0.88/1.18	320 n3 != n0.  [resolve(305,a,133,b)].
0.88/1.18	335 less(n0,n4).  [resolve(319,a,161,a)].
0.88/1.18	350 n4 != n0.  [resolve(335,a,133,b)].
0.88/1.18	373 less(n1,A) | n1 = A | n0 = A.  [resolve(204,a,146,a),unit_del(d,142)].
0.88/1.18	443 -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(289,a,186,b)].
0.88/1.18	445 -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(289,a,182,b)].
0.88/1.18	446 -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(289,a,180,b)].
0.88/1.18	471 less(n2,A) | n2 = A | n1 = A | less(A,n1).  [resolve(223,a,146,a)].
0.88/1.18	477 less(n4,A) | n4 = A | n3 = A | less(A,n3).  [resolve(225,a,146,a)].
0.88/1.18	478 less(n3,A) | n3 = A | n2 = A | less(A,n2).  [resolve(226,a,146,a)].
0.88/1.18	480 n1 = A | n0 = A | -less(A,n1).  [resolve(373,a,132,b)].
0.88/1.18	522 waterLevel(f9(tapOn,waterLevel(A),B)) = waterLevel(A).  [xx_res(229,b)].
0.88/1.18	551 f9(tapOn,waterLevel(A),B) = A.  [resolve(522,a,112,a)].
0.88/1.18	599 -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(443,b,231,a)].
0.88/1.18	606 -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(445,b,231,a)].
0.88/1.18	608 -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(446,b,231,a)].
0.88/1.18	676 n2 = A | n1 = A | less(A,n1) | -less(A,n2).  [resolve(471,a,132,b)].
0.88/1.18	677 less(n2,A) | n2 = A | n1 = A | n0 = A.  [resolve(471,d,480,c),merge(d)].
0.88/1.18	725 less(n4,A) | n4 = A | n3 = A | less_or_equal(A,n2).  [resolve(477,d,164,b)].
0.88/1.18	828 -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | less(n0,f5(n0,filling,plus(A,n0))) | plus(A,n0) != B.  [resolve(599,e,153,a)].
0.88/1.18	831 -less(n0,A) | holdsAt(waterLevel(B),plus(A,n0)) | less(f5(n0,filling,plus(A,n0)),plus(A,n0)) | plus(A,n0) != B.  [resolve(606,e,153,a)].
0.88/1.18	837 -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(608,e,153,a)].
0.88/1.18	866 n2 = A | n1 = A | less(A,n1) | less(n3,A) | n3 = A.  [resolve(676,d,478,d),merge(f)].
0.88/1.18	868 n2 = A | n1 = A | n0 = A | -less(A,n2).  [resolve(677,a,132,b)].
0.88/1.18	871 less(n4,A) | n4 = A | n3 = A | n2 = A | less(A,n2).  [resolve(725,d,146,a)].
0.88/1.18	926 holdsAt(waterLevel(A),n2) | less(n0,f5(n0,filling,n2)) | n2 != A.  [resolve(828,a,871,e),rewrite([124(4),119(4),124(9),119(9),124(12),119(12)]),unit_del(d,142),unit_del(e,350),unit_del(f,320),unit_del(g,288)].
0.88/1.18	927 holdsAt(waterLevel(A),n1) | less(n0,f5(n0,filling,n1)) | n1 != A.  [resolve(828,a,866,c),rewrite([140(4),140(9),140(12)]),flip(e),unit_del(d,288),unit_del(e,255),unit_del(f,142),unit_del(g,320)].
0.88/1.18	936 less(n0,f5(n0,filling,n2)).  [resolve(926,c,551,a(flip)),rewrite([551(4)]),unit_del(a,165)].
0.88/1.18	939 f5(n0,filling,n2) != n0.  [resolve(936,a,133,b)].
0.88/1.18	940 holdsAt(waterLevel(n1),n1) | less(n0,f5(n0,filling,n1)).  [resolve(927,c,551,a(flip)),rewrite([551(4)])].
0.88/1.18	954 less(n0,f5(n0,filling,n1)) | -holdsAt(waterLevel(A),n1) | n1 = A.  [resolve(940,a,70,b)].
0.88/1.18	965 holdsAt(waterLevel(A),n2) | less(f5(n0,filling,n2),n2) | n2 != A.  [resolve(831,a,871,e),rewrite([124(4),119(4),124(8),119(8),124(10),119(10),124(12),119(12)]),unit_del(d,142),unit_del(e,350),unit_del(f,320),unit_del(g,288)].
0.88/1.18	966 holdsAt(waterLevel(A),n1) | less(f5(n0,filling,n1),n1) | n1 != A.  [resolve(831,a,866,c),rewrite([140(4),140(8),140(10),140(12)]),flip(e),unit_del(d,288),unit_del(e,255),unit_del(f,142),unit_del(g,320)].
0.88/1.18	975 less(f5(n0,filling,n2),n2).  [resolve(965,c,551,a(flip)),rewrite([551(4)]),unit_del(a,165)].
0.88/1.18	976 f5(n0,filling,n2) = n2 | f5(n0,filling,n2) = n1.  [resolve(975,a,868,d),flip(a),flip(b),flip(c),unit_del(c,939)].
0.88/1.18	986 f5(n0,filling,n2) != n2.  [resolve(975,a,133,b),flip(a)].
0.88/1.18	995 f5(n0,filling,n2) = n1.  [back_unit_del(976),unit_del(a,986)].
0.88/1.18	997 holdsAt(waterLevel(A),n2) | happens(f4(n0,filling,n2),n1) | n2 != A.  [resolve(837,a,871,e),rewrite([124(4),119(4),124(8),119(8),124(12),119(12),995(11),124(12),119(12)]),unit_del(d,142),unit_del(e,350),unit_del(f,320),unit_del(g,288)].
0.88/1.18	1007 holdsAt(waterLevel(n1),n1) | less(f5(n0,filling,n1),n1).  [resolve(966,c,995,a(flip)),rewrite([995(4)])].
0.88/1.18	1020 happens(f4(n0,filling,n2),n1).  [resolve(997,c,551,a(flip)),rewrite([551(4)]),unit_del(a,165)].
0.88/1.18	1025 holdsAt(waterLevel(n3),n1).  [resolve(1020,a,76,c),unit_del(a,255)].
0.88/1.18	1053 less(n0,f5(n0,filling,n1)).  [resolve(1025,a,954,b),flip(b),unit_del(b,285)].
0.88/1.18	1057 -holdsAt(waterLevel(A),n1) | n3 = A.  [resolve(1025,a,70,b)].
0.88/1.18	1068 f5(n0,filling,n1) != n0.  [resolve(1053,a,133,b)].
0.88/1.18	1069 less(f5(n0,filling,n1),n1).  [resolve(1057,a,1007,a),unit_del(a,285)].
0.88/1.18	1078 f5(n0,filling,n1) = n1.  [resolve(1069,a,480,c),flip(a),flip(b),unit_del(b,1068)].
0.88/1.18	1080 $F.  [resolve(1069,a,133,b),rewrite([1078(5)]),xx(a)].
0.88/1.18	
0.88/1.18	% SZS output end Refutation
0.88/1.18	============================== end of proof ==========================
0.88/1.18	
0.88/1.18	============================== STATISTICS ============================
0.88/1.18	
0.88/1.18	Given=719. Generated=9708. Kept=1006. proofs=1.
0.88/1.18	Usable=682. Sos=105. Demods=18. Limbo=10, Disabled=348. Hints=0.
0.88/1.18	Megabytes=1.16.
0.88/1.18	User_CPU=0.25, System_CPU=0.01, Wall_clock=0.
0.88/1.18	
0.88/1.18	============================== end of statistics =====================
0.88/1.18	
0.88/1.18	============================== end of search =========================
0.88/1.18	
0.88/1.18	THEOREM PROVED
0.88/1.18	% SZS status Theorem
0.88/1.18	
0.88/1.18	Exiting with 1 proof.
0.88/1.18	
0.88/1.18	Process 20866 exit (max_proofs) Tue Aug  9 04:51:08 2022
0.88/1.18	Prover9 interrupted
0.88/1.18	EOF