4.49/1.76	YES
4.73/1.77	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
4.73/1.77	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
4.73/1.77	
4.73/1.77	
4.73/1.77	Outermost Termination of the given OTRS could be proven:
4.73/1.77	
4.73/1.77	(0) OTRS
4.73/1.77	(1) Raffelsieper-Zantema-Transformation [SOUND, 0 ms]
4.73/1.77	(2) QTRS
4.73/1.77	(3) QTRSRRRProof [EQUIVALENT, 44 ms]
4.73/1.77	(4) QTRS
4.73/1.77	(5) QTRSRRRProof [EQUIVALENT, 14 ms]
4.73/1.77	(6) QTRS
4.73/1.77	(7) AAECC Innermost [EQUIVALENT, 0 ms]
4.73/1.77	(8) QTRS
4.73/1.77	(9) DependencyPairsProof [EQUIVALENT, 0 ms]
4.73/1.77	(10) QDP
4.73/1.77	(11) DependencyGraphProof [EQUIVALENT, 0 ms]
4.73/1.77	(12) AND
4.73/1.77	    (13) QDP
4.73/1.77	        (14) UsableRulesProof [EQUIVALENT, 0 ms]
4.73/1.77	        (15) QDP
4.73/1.77	        (16) QReductionProof [EQUIVALENT, 0 ms]
4.73/1.77	        (17) QDP
4.73/1.77	        (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
4.73/1.77	        (19) YES
4.73/1.77	    (20) QDP
4.73/1.77	        (21) UsableRulesProof [EQUIVALENT, 0 ms]
4.73/1.77	        (22) QDP
4.73/1.77	        (23) QReductionProof [EQUIVALENT, 0 ms]
4.73/1.77	        (24) QDP
4.73/1.77	        (25) RFCMatchBoundsDPProof [EQUIVALENT, 26 ms]
4.73/1.77	        (26) YES
4.73/1.77	
4.73/1.77	
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(0)
4.73/1.77	Obligation:
4.73/1.77	Term rewrite system R:
4.73/1.77	The TRS R consists of the following rules:
4.73/1.77	
4.73/1.77	   f(h(x)) -> f(i(x))
4.73/1.77	   h(x) -> f(h(x))
4.73/1.77	   i(x) -> h(x)
4.73/1.77	   f(i(x)) -> x
4.73/1.77	
4.73/1.77	
4.73/1.77	
4.73/1.77	Outermost Strategy.
4.73/1.77	
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(1) Raffelsieper-Zantema-Transformation (SOUND)
4.73/1.77	We applied the Raffelsieper-Zantema transformation  to transform the outermost TRS to a standard TRS.
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(2)
4.73/1.77	Obligation:
4.73/1.77	Q restricted rewrite system:
4.73/1.77	The TRS R consists of the following rules:
4.73/1.77	
4.73/1.77	   down(f(h(x))) -> up(f(i(x)))
4.73/1.77	   down(h(x)) -> up(f(h(x)))
4.73/1.77	   down(i(x)) -> up(h(x))
4.73/1.77	   down(f(i(x))) -> up(x)
4.73/1.77	   top(up(x)) -> top(down(x))
4.73/1.77	   down(f(f(y4))) -> f_flat(down(f(y4)))
4.73/1.77	   down(f(fresh_constant)) -> f_flat(down(fresh_constant))
4.73/1.77	   f_flat(up(x_1)) -> up(f(x_1))
4.73/1.77	   h_flat(up(x_1)) -> up(h(x_1))
4.73/1.77	   i_flat(up(x_1)) -> up(i(x_1))
4.73/1.77	
4.73/1.77	Q is empty.
4.73/1.77	
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(3) QTRSRRRProof (EQUIVALENT)
4.73/1.77	Used ordering:
4.73/1.77	Polynomial interpretation [POLO]:
4.73/1.77	
4.73/1.77	   POL(down(x_1)) = 2 + 2*x_1
4.73/1.77	   POL(f(x_1)) = x_1
4.73/1.77	   POL(f_flat(x_1)) = x_1
4.73/1.77	   POL(fresh_constant) = 0
4.73/1.77	   POL(h(x_1)) = x_1
4.73/1.77	   POL(h_flat(x_1)) = 1 + 2*x_1
4.73/1.77	   POL(i(x_1)) = x_1
4.73/1.77	   POL(i_flat(x_1)) = 1 + 2*x_1
4.73/1.77	   POL(top(x_1)) = 2*x_1
4.73/1.77	   POL(up(x_1)) = 2 + 2*x_1
4.73/1.77	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
4.73/1.77	
4.73/1.77	   h_flat(up(x_1)) -> up(h(x_1))
4.73/1.77	   i_flat(up(x_1)) -> up(i(x_1))
4.73/1.77	
4.73/1.77	
4.73/1.77	
4.73/1.77	
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(4)
4.73/1.77	Obligation:
4.73/1.77	Q restricted rewrite system:
4.73/1.77	The TRS R consists of the following rules:
4.73/1.77	
4.73/1.77	   down(f(h(x))) -> up(f(i(x)))
4.73/1.77	   down(h(x)) -> up(f(h(x)))
4.73/1.77	   down(i(x)) -> up(h(x))
4.73/1.77	   down(f(i(x))) -> up(x)
4.73/1.77	   top(up(x)) -> top(down(x))
4.73/1.77	   down(f(f(y4))) -> f_flat(down(f(y4)))
4.73/1.77	   down(f(fresh_constant)) -> f_flat(down(fresh_constant))
4.73/1.77	   f_flat(up(x_1)) -> up(f(x_1))
4.73/1.77	
4.73/1.77	Q is empty.
4.73/1.77	
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(5) QTRSRRRProof (EQUIVALENT)
4.73/1.77	Used ordering:
4.73/1.77	Polynomial interpretation [POLO]:
4.73/1.77	
4.73/1.77	   POL(down(x_1)) = 2*x_1
4.73/1.77	   POL(f(x_1)) = x_1
4.73/1.77	   POL(f_flat(x_1)) = x_1
4.73/1.77	   POL(fresh_constant) = 0
4.73/1.77	   POL(h(x_1)) = 1 + 2*x_1
4.73/1.77	   POL(i(x_1)) = 1 + 2*x_1
4.73/1.77	   POL(top(x_1)) = x_1
4.73/1.77	   POL(up(x_1)) = 2*x_1
4.73/1.77	With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
4.73/1.77	
4.73/1.77	   down(f(i(x))) -> up(x)
4.73/1.77	
4.73/1.77	
4.73/1.77	
4.73/1.77	
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(6)
4.73/1.77	Obligation:
4.73/1.77	Q restricted rewrite system:
4.73/1.77	The TRS R consists of the following rules:
4.73/1.77	
4.73/1.77	   down(f(h(x))) -> up(f(i(x)))
4.73/1.77	   down(h(x)) -> up(f(h(x)))
4.73/1.77	   down(i(x)) -> up(h(x))
4.73/1.77	   top(up(x)) -> top(down(x))
4.73/1.77	   down(f(f(y4))) -> f_flat(down(f(y4)))
4.73/1.77	   down(f(fresh_constant)) -> f_flat(down(fresh_constant))
4.73/1.77	   f_flat(up(x_1)) -> up(f(x_1))
4.73/1.77	
4.73/1.77	Q is empty.
4.73/1.77	
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(7) AAECC Innermost (EQUIVALENT)
4.73/1.77	We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is 
4.73/1.77	   down(f(f(y4))) -> f_flat(down(f(y4)))
4.73/1.77	   down(f(fresh_constant)) -> f_flat(down(fresh_constant))
4.73/1.77	   f_flat(up(x_1)) -> up(f(x_1))
4.73/1.77	   down(f(h(x))) -> up(f(i(x)))
4.73/1.77	   down(h(x)) -> up(f(h(x)))
4.73/1.77	   down(i(x)) -> up(h(x))
4.73/1.77	
4.73/1.77	The TRS R 2 is 
4.73/1.77	   top(up(x)) -> top(down(x))
4.73/1.77	
4.73/1.77	The signature Sigma is {top_1}
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(8)
4.73/1.77	Obligation:
4.73/1.77	Q restricted rewrite system:
4.73/1.77	The TRS R consists of the following rules:
4.73/1.77	
4.73/1.77	   down(f(h(x))) -> up(f(i(x)))
4.73/1.77	   down(h(x)) -> up(f(h(x)))
4.73/1.77	   down(i(x)) -> up(h(x))
4.73/1.77	   top(up(x)) -> top(down(x))
4.73/1.77	   down(f(f(y4))) -> f_flat(down(f(y4)))
4.73/1.77	   down(f(fresh_constant)) -> f_flat(down(fresh_constant))
4.73/1.77	   f_flat(up(x_1)) -> up(f(x_1))
4.73/1.77	
4.73/1.77	The set Q consists of the following terms:
4.73/1.77	
4.73/1.77	   down(f(h(x0)))
4.73/1.77	   down(h(x0))
4.73/1.77	   down(i(x0))
4.73/1.77	   top(up(x0))
4.73/1.77	   down(f(f(x0)))
4.73/1.77	   down(f(fresh_constant))
4.73/1.77	   f_flat(up(x0))
4.73/1.77	
4.73/1.77	
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(9) DependencyPairsProof (EQUIVALENT)
4.73/1.77	Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(10)
4.73/1.77	Obligation:
4.73/1.77	Q DP problem:
4.73/1.77	The TRS P consists of the following rules:
4.73/1.77	
4.73/1.77	   TOP(up(x)) -> TOP(down(x))
4.73/1.77	   TOP(up(x)) -> DOWN(x)
4.73/1.77	   DOWN(f(f(y4))) -> F_FLAT(down(f(y4)))
4.73/1.77	   DOWN(f(f(y4))) -> DOWN(f(y4))
4.73/1.77	   DOWN(f(fresh_constant)) -> F_FLAT(down(fresh_constant))
4.73/1.77	   DOWN(f(fresh_constant)) -> DOWN(fresh_constant)
4.73/1.77	
4.73/1.77	The TRS R consists of the following rules:
4.73/1.77	
4.73/1.77	   down(f(h(x))) -> up(f(i(x)))
4.73/1.77	   down(h(x)) -> up(f(h(x)))
4.73/1.77	   down(i(x)) -> up(h(x))
4.73/1.77	   top(up(x)) -> top(down(x))
4.73/1.77	   down(f(f(y4))) -> f_flat(down(f(y4)))
4.73/1.77	   down(f(fresh_constant)) -> f_flat(down(fresh_constant))
4.73/1.77	   f_flat(up(x_1)) -> up(f(x_1))
4.73/1.77	
4.73/1.77	The set Q consists of the following terms:
4.73/1.77	
4.73/1.77	   down(f(h(x0)))
4.73/1.77	   down(h(x0))
4.73/1.77	   down(i(x0))
4.73/1.77	   top(up(x0))
4.73/1.77	   down(f(f(x0)))
4.73/1.77	   down(f(fresh_constant))
4.73/1.77	   f_flat(up(x0))
4.73/1.77	
4.73/1.77	We have to consider all minimal (P,Q,R)-chains.
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(11) DependencyGraphProof (EQUIVALENT)
4.73/1.77	The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 4 less nodes.
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(12)
4.73/1.77	Complex Obligation (AND)
4.73/1.77	
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(13)
4.73/1.77	Obligation:
4.73/1.77	Q DP problem:
4.73/1.77	The TRS P consists of the following rules:
4.73/1.77	
4.73/1.77	   DOWN(f(f(y4))) -> DOWN(f(y4))
4.73/1.77	
4.73/1.77	The TRS R consists of the following rules:
4.73/1.77	
4.73/1.77	   down(f(h(x))) -> up(f(i(x)))
4.73/1.77	   down(h(x)) -> up(f(h(x)))
4.73/1.77	   down(i(x)) -> up(h(x))
4.73/1.77	   top(up(x)) -> top(down(x))
4.73/1.77	   down(f(f(y4))) -> f_flat(down(f(y4)))
4.73/1.77	   down(f(fresh_constant)) -> f_flat(down(fresh_constant))
4.73/1.77	   f_flat(up(x_1)) -> up(f(x_1))
4.73/1.77	
4.73/1.77	The set Q consists of the following terms:
4.73/1.77	
4.73/1.77	   down(f(h(x0)))
4.73/1.77	   down(h(x0))
4.73/1.77	   down(i(x0))
4.73/1.77	   top(up(x0))
4.73/1.77	   down(f(f(x0)))
4.73/1.77	   down(f(fresh_constant))
4.73/1.77	   f_flat(up(x0))
4.73/1.77	
4.73/1.77	We have to consider all minimal (P,Q,R)-chains.
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(14) UsableRulesProof (EQUIVALENT)
4.73/1.77	As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
4.73/1.77	----------------------------------------
4.73/1.77	
4.73/1.77	(15)
4.73/1.77	Obligation:
4.73/1.77	Q DP problem:
4.73/1.77	The TRS P consists of the following rules:
4.73/1.77	
4.73/1.77	   DOWN(f(f(y4))) -> DOWN(f(y4))
4.73/1.77	
4.73/1.77	R is empty.
4.73/1.77	The set Q consists of the following terms:
4.73/1.77	
4.73/1.77	   down(f(h(x0)))
4.73/1.78	   down(h(x0))
4.73/1.78	   down(i(x0))
4.73/1.78	   top(up(x0))
4.73/1.78	   down(f(f(x0)))
4.73/1.78	   down(f(fresh_constant))
4.73/1.78	   f_flat(up(x0))
4.73/1.78	
4.73/1.78	We have to consider all minimal (P,Q,R)-chains.
4.73/1.78	----------------------------------------
4.73/1.78	
4.73/1.78	(16) QReductionProof (EQUIVALENT)
4.73/1.78	We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
4.73/1.78	
4.73/1.78	   down(f(h(x0)))
4.73/1.78	   down(h(x0))
4.73/1.78	   down(i(x0))
4.73/1.78	   top(up(x0))
4.73/1.78	   down(f(f(x0)))
4.73/1.78	   down(f(fresh_constant))
4.73/1.78	   f_flat(up(x0))
4.73/1.78	
4.73/1.78	
4.73/1.78	----------------------------------------
4.73/1.78	
4.73/1.78	(17)
4.73/1.78	Obligation:
4.73/1.78	Q DP problem:
4.73/1.78	The TRS P consists of the following rules:
4.73/1.78	
4.73/1.78	   DOWN(f(f(y4))) -> DOWN(f(y4))
4.73/1.78	
4.73/1.78	R is empty.
4.73/1.78	Q is empty.
4.73/1.78	We have to consider all minimal (P,Q,R)-chains.
4.73/1.78	----------------------------------------
4.73/1.78	
4.73/1.78	(18) QDPSizeChangeProof (EQUIVALENT)
4.73/1.78	By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem. 
4.73/1.78	
4.73/1.78	From the DPs we obtained the following set of size-change graphs:
4.73/1.78	*DOWN(f(f(y4))) -> DOWN(f(y4))
4.73/1.78	The graph contains the following edges 1 > 1
4.73/1.78	
4.73/1.78	
4.73/1.78	----------------------------------------
4.73/1.78	
4.73/1.78	(19)
4.73/1.78	YES
4.73/1.78	
4.73/1.78	----------------------------------------
4.73/1.78	
4.73/1.78	(20)
4.73/1.78	Obligation:
4.73/1.78	Q DP problem:
4.73/1.78	The TRS P consists of the following rules:
4.73/1.78	
4.73/1.78	   TOP(up(x)) -> TOP(down(x))
4.73/1.78	
4.73/1.78	The TRS R consists of the following rules:
4.73/1.78	
4.73/1.78	   down(f(h(x))) -> up(f(i(x)))
4.73/1.78	   down(h(x)) -> up(f(h(x)))
4.73/1.78	   down(i(x)) -> up(h(x))
4.73/1.78	   top(up(x)) -> top(down(x))
4.73/1.78	   down(f(f(y4))) -> f_flat(down(f(y4)))
4.73/1.78	   down(f(fresh_constant)) -> f_flat(down(fresh_constant))
4.73/1.78	   f_flat(up(x_1)) -> up(f(x_1))
4.73/1.78	
4.73/1.78	The set Q consists of the following terms:
4.73/1.78	
4.73/1.78	   down(f(h(x0)))
4.73/1.78	   down(h(x0))
4.73/1.78	   down(i(x0))
4.73/1.78	   top(up(x0))
4.73/1.78	   down(f(f(x0)))
4.73/1.78	   down(f(fresh_constant))
4.73/1.78	   f_flat(up(x0))
4.73/1.78	
4.73/1.78	We have to consider all minimal (P,Q,R)-chains.
4.73/1.78	----------------------------------------
4.73/1.78	
4.73/1.78	(21) UsableRulesProof (EQUIVALENT)
4.73/1.78	As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
4.73/1.78	----------------------------------------
4.73/1.78	
4.73/1.78	(22)
4.73/1.78	Obligation:
4.73/1.78	Q DP problem:
4.73/1.78	The TRS P consists of the following rules:
4.73/1.78	
4.73/1.78	   TOP(up(x)) -> TOP(down(x))
4.73/1.78	
4.73/1.78	The TRS R consists of the following rules:
4.73/1.78	
4.73/1.78	   down(f(h(x))) -> up(f(i(x)))
4.73/1.78	   down(h(x)) -> up(f(h(x)))
4.73/1.78	   down(i(x)) -> up(h(x))
4.73/1.78	   down(f(f(y4))) -> f_flat(down(f(y4)))
4.73/1.78	   down(f(fresh_constant)) -> f_flat(down(fresh_constant))
4.73/1.78	   f_flat(up(x_1)) -> up(f(x_1))
4.73/1.78	
4.73/1.78	The set Q consists of the following terms:
4.73/1.78	
4.73/1.78	   down(f(h(x0)))
4.73/1.78	   down(h(x0))
4.73/1.78	   down(i(x0))
4.73/1.78	   top(up(x0))
4.73/1.78	   down(f(f(x0)))
4.73/1.78	   down(f(fresh_constant))
4.73/1.78	   f_flat(up(x0))
4.73/1.78	
4.73/1.78	We have to consider all minimal (P,Q,R)-chains.
4.73/1.78	----------------------------------------
4.73/1.78	
4.73/1.78	(23) QReductionProof (EQUIVALENT)
4.73/1.78	We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
4.73/1.78	
4.73/1.78	   top(up(x0))
4.73/1.78	
4.73/1.78	
4.73/1.78	----------------------------------------
4.73/1.78	
4.73/1.78	(24)
4.73/1.78	Obligation:
4.73/1.78	Q DP problem:
4.73/1.78	The TRS P consists of the following rules:
4.73/1.78	
4.73/1.78	   TOP(up(x)) -> TOP(down(x))
4.73/1.78	
4.73/1.78	The TRS R consists of the following rules:
4.73/1.78	
4.73/1.78	   down(f(h(x))) -> up(f(i(x)))
4.73/1.78	   down(h(x)) -> up(f(h(x)))
4.73/1.78	   down(i(x)) -> up(h(x))
4.73/1.78	   down(f(f(y4))) -> f_flat(down(f(y4)))
4.73/1.78	   down(f(fresh_constant)) -> f_flat(down(fresh_constant))
4.73/1.78	   f_flat(up(x_1)) -> up(f(x_1))
4.73/1.78	
4.73/1.78	The set Q consists of the following terms:
4.73/1.78	
4.73/1.78	   down(f(h(x0)))
4.73/1.78	   down(h(x0))
4.73/1.78	   down(i(x0))
4.73/1.78	   down(f(f(x0)))
4.73/1.78	   down(f(fresh_constant))
4.73/1.78	   f_flat(up(x0))
4.73/1.78	
4.73/1.78	We have to consider all minimal (P,Q,R)-chains.
4.73/1.78	----------------------------------------
4.73/1.78	
4.73/1.78	(25) RFCMatchBoundsDPProof (EQUIVALENT)
4.73/1.78	Finiteness of the DP problem can be shown by a matchbound of 9. 
4.73/1.78	As the DP problem is minimal we only have to initialize the certificate graph by the rules of P:
4.73/1.78	
4.73/1.78	   TOP(up(x)) -> TOP(down(x))
4.73/1.78	
4.73/1.78	To find matches we regarded all rules of R and P:
4.73/1.78	
4.73/1.78	   down(f(h(x))) -> up(f(i(x)))
4.73/1.78	   down(h(x)) -> up(f(h(x)))
4.73/1.78	   down(i(x)) -> up(h(x))
4.73/1.78	   down(f(f(y4))) -> f_flat(down(f(y4)))
4.73/1.78	   down(f(fresh_constant)) -> f_flat(down(fresh_constant))
4.73/1.78	   f_flat(up(x_1)) -> up(f(x_1))
4.73/1.78	   TOP(up(x)) -> TOP(down(x))
4.73/1.78	
4.73/1.78	The certificate found is represented by the following graph.
4.73/1.78	The certificate consists of the following enumerated nodes:
4.73/1.78	282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 306, 307, 309, 310, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 352, 353, 354, 355
4.73/1.78	
4.73/1.78	Node 282 is start node and node 283 is final node.
4.73/1.78	
4.73/1.78	Those nodes are connected through the following edges:
4.73/1.78	
4.73/1.78	* 282 to 284 labelled TOP_1(0)* 282 to 289 labelled TOP_1(1)* 282 to 294 labelled TOP_1(2)* 282 to 315 labelled TOP_1(3)* 282 to 321 labelled TOP_1(4)* 283 to 283 labelled #_1(0)* 284 to 283 labelled down_1(0)* 284 to 285 labelled up_1(1)* 284 to 286 labelled up_1(1)* 284 to 287 labelled f_flat_1(1)* 284 to 290 labelled up_1(2)* 285 to 286 labelled f_1(1)* 286 to 283 labelled i_1(1), h_1(1)* 287 to 288 labelled down_1(1)* 287 to 285 labelled up_1(1)* 287 to 287 labelled f_flat_1(1)* 287 to 290 labelled up_1(2)* 288 to 283 labelled f_1(1), fresh_constant(1)* 289 to 285 labelled down_1(1)* 289 to 286 labelled down_1(1)* 289 to 291 labelled up_1(2)* 289 to 292 labelled up_1(2)* 289 to 290 labelled down_1(1)* 289 to 309 labelled f_flat_1(2)* 289 to 318 labelled up_1(3)* 290 to 285 labelled f_1(2)* 290 to 290 labelled f_1(2)* 291 to 283 labelled h_1(2)* 292 to 293 labelled f_1(2)* 293 to 283 labelled h_1(2), i_1(2)* 294 to 291 labelled down_1(2)* 294 to 292 labelled down_1(2)* 294 to 306 labelled up_1(3)* 294 to 318 labelled down_1(2)* 294 to 323 labelled f_flat_1(3)* 294 to 327 labelled up_1(4)* 306 to 307 labelled f_1(3)* 307 to 283 labelled h_1(3), i_1(3)* 309 to 310 labelled down_1(2)* 309 to 292 labelled up_1(2)* 309 to 309 labelled f_flat_1(2)* 309 to 316 labelled f_flat_1(3)* 309 to 318 labelled up_1(3)* 309 to 322 labelled up_1(4)* 310 to 286 labelled f_1(2)* 310 to 285 labelled f_1(2)* 310 to 290 labelled f_1(2)* 315 to 306 labelled down_1(3)* 315 to 319 labelled up_1(4)* 315 to 327 labelled down_1(3)* 315 to 331 labelled f_flat_1(4)* 315 to 336 labelled up_1(5)* 316 to 317 labelled down_1(3)* 316 to 309 labelled f_flat_1(2)* 316 to 316 labelled f_flat_1(3)* 316 to 318 labelled up_1(3)* 316 to 322 labelled up_1(4)* 317 to 285 labelled f_1(3)* 317 to 290 labelled f_1(3)* 318 to 292 labelled f_1(3)* 318 to 318 labelled f_1(3)* 318 to 322 labelled f_1(3)* 319 to 320 labelled f_1(4)* 320 to 283 labelled i_1(4)* 321 to 319 labelled down_1(4)* 321 to 336 labelled down_1(4)* 321 to 341 labelled f_flat_1(5)* 322 to 318 labelled f_1(4)* 322 to 322 labelled f_1(4)* 323 to 324 labelled down_1(3)* 323 to 306 labelled up_1(3)* 323 to 323 labelled f_flat_1(3)* 323 to 325 labelled f_flat_1(4)* 323 to 327 labelled up_1(4)* 323 to 330 labelled up_1(5)* 324 to 293 labelled f_1(3)* 324 to 292 labelled f_1(3)* 324 to 318 labelled f_1(3)* 324 to 322 labelled f_1(3)* 325 to 326 labelled down_1(4)* 325 to 323 labelled f_flat_1(3)* 325 to 325 labelled f_flat_1(4)* 325 to 327 labelled up_1(4)* 325 to 328 labelled f_flat_1(5)* 325 to 330 labelled up_1(5)* 325 to 337 labelled up_1(6)* 326 to 292 labelled f_1(4)* 326 to 318 labelled f_1(4)* 326 to 322 labelled f_1(4)* 327 to 306 labelled f_1(4)* 327 to 327 labelled f_1(4)* 327 to 330 labelled f_1(4)* 328 to 329 labelled down_1(5)* 328 to 325 labelled f_flat_1(4)* 328 to 328 labelled f_flat_1(5)* 328 to 330 labelled up_1(5)* 328 to 337 labelled up_1(6)* 329 to 318 labelled f_1(5)* 329 to 322 labelled f_1(5)* 330 to 327 labelled f_1(5)* 330 to 330 labelled f_1(5)* 330 to 337 labelled f_1(5)* 331 to 332 labelled down_1(4)* 331 to 319 labelled up_1(4)* 331 to 331 labelled f_flat_1(4)* 331 to 334 labelled f_flat_1(5)* 331 to 336 labelled up_1(5)* 331 to 340 labelled up_1(6)* 332 to 307 labelled f_1(4)* 332 to 306 labelled f_1(4)* 332 to 327 labelled f_1(4)* 332 to 330 labelled f_1(4)* 332 to 337 labelled f_1(4)* 334 to 335 labelled down_1(5)* 334 to 331 labelled f_flat_1(4)* 334 to 334 labelled f_flat_1(5)* 334 to 336 labelled up_1(5)* 334 to 338 labelled f_flat_1(6)* 334 to 340 labelled up_1(6)* 334 to 347 labelled up_1(7)* 335 to 306 labelled f_1(5)* 335 to 327 labelled f_1(5)* 335 to 330 labelled f_1(5)* 335 to 337 labelled f_1(5)* 336 to 319 labelled f_1(5)* 336 to 336 labelled f_1(5)* 336 to 340 labelled f_1(5)* 337 to 330 labelled f_1(6)* 337 to 337 labelled f_1(6)* 338 to 339 labelled down_1(6)* 338 to 334 labelled f_flat_1(5)* 338 to 338 labelled f_flat_1(6)* 338 to 340 labelled up_1(6)* 338 to 345 labelled f_flat_1(7)* 338 to 347 labelled up_1(7)* 338 to 350 labelled up_1(8)* 339 to 327 labelled f_1(6)* 339 to 330 labelled f_1(6)* 339 to 337 labelled f_1(6)* 340 to 336 labelled f_1(6)* 340 to 340 labelled f_1(6)* 340 to 347 labelled f_1(6)* 341 to 342 labelled down_1(5)* 341 to 341 labelled f_flat_1(5)* 341 to 343 labelled f_flat_1(6)* 342 to 320 labelled f_1(5)* 342 to 319 labelled f_1(5)* 342 to 336 labelled f_1(5)* 342 to 340 labelled f_1(5)* 342 to 347 labelled f_1(5)* 343 to 344 labelled down_1(6)* 343 to 341 labelled f_flat_1(5)* 343 to 343 labelled f_flat_1(6)* 343 to 348 labelled f_flat_1(7)* 344 to 319 labelled f_1(6)* 344 to 336 labelled f_1(6)* 344 to 340 labelled f_1(6)* 344 to 347 labelled f_1(6)* 344 to 350 labelled f_1(6)* 345 to 346 labelled down_1(7)* 345 to 338 labelled f_flat_1(6)* 345 to 345 labelled f_flat_1(7)* 345 to 347 labelled up_1(7)* 345 to 350 labelled up_1(8)* 346 to 330 labelled f_1(7)* 346 to 337 labelled f_1(7)* 347 to 340 labelled f_1(7)* 347 to 347 labelled f_1(7)* 347 to 350 labelled f_1(7)* 348 to 349 labelled down_1(7)* 348 to 343 labelled f_flat_1(6)* 348 to 348 labelled f_flat_1(7)* 348 to 352 labelled f_flat_1(8)* 349 to 336 labelled f_1(7)* 349 to 340 labelled f_1(7)* 349 to 347 labelled f_1(7)* 349 to 350 labelled f_1(7)* 350 to 347 labelled f_1(8)* 350 to 350 labelled f_1(8)* 352 to 353 labelled down_1(8)* 352 to 348 labelled f_flat_1(7)* 352 to 352 labelled f_flat_1(8)* 352 to 354 labelled f_flat_1(9)* 353 to 340 labelled f_1(8)* 353 to 347 labelled f_1(8)* 353 to 350 labelled f_1(8)* 354 to 355 labelled down_1(9)* 354 to 352 labelled f_flat_1(8)* 354 to 354 labelled f_flat_1(9)* 355 to 347 labelled f_1(9)* 355 to 350 labelled f_1(9)
4.73/1.78	
4.73/1.78	
4.73/1.78	----------------------------------------
4.73/1.78	
4.73/1.78	(26)
4.73/1.78	YES
4.73/1.83	EOF