1069.26/291.55	WORST_CASE(Omega(n^2), ?)
1070.03/291.72	proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
1070.03/291.72	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF).
1070.03/291.72	
1070.03/291.72	(0) CpxTRS
1070.03/291.72	(1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
1070.03/291.72	(2) CpxTRS
1070.03/291.72	(3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
1070.03/291.72	(4) typed CpxTrs
1070.03/291.72	(5) OrderProof [LOWER BOUND(ID), 0 ms]
1070.03/291.72	(6) typed CpxTrs
1070.03/291.72	(7) RewriteLemmaProof [LOWER BOUND(ID), 273 ms]
1070.03/291.72	(8) BEST
1070.03/291.72	    (9) proven lower bound
1070.03/291.72	        (10) LowerBoundPropagationProof [FINISHED, 0 ms]
1070.03/291.72	        (11) BOUNDS(n^1, INF)
1070.03/291.72	    (12) typed CpxTrs
1070.03/291.72	        (13) RewriteLemmaProof [LOWER BOUND(ID), 63 ms]
1070.03/291.72	        (14) typed CpxTrs
1070.03/291.72	        (15) RewriteLemmaProof [LOWER BOUND(ID), 62 ms]
1070.03/291.72	        (16) BEST
1070.03/291.72	            (17) proven lower bound
1070.03/291.72	                (18) LowerBoundPropagationProof [FINISHED, 0 ms]
1070.03/291.72	                (19) BOUNDS(n^2, INF)
1070.03/291.72	            (20) typed CpxTrs
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(0)
1070.03/291.72	Obligation:
1070.03/291.72	The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF).
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	The TRS R consists of the following rules:
1070.03/291.72	
1070.03/291.72	   -(x, 0) -> x
1070.03/291.72	   -(s(x), s(y)) -> -(x, y)
1070.03/291.72	   +(0, y) -> y
1070.03/291.72	   +(s(x), y) -> s(+(x, y))
1070.03/291.72	   *(x, 0) -> 0
1070.03/291.72	   *(x, s(y)) -> +(x, *(x, y))
1070.03/291.72	   f(s(x)) -> f(-(+(*(s(x), s(x)), *(s(x), s(s(s(0))))), *(s(s(x)), s(s(x)))))
1070.03/291.72	
1070.03/291.72	S is empty.
1070.03/291.72	Rewrite Strategy: INNERMOST
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(1) RenamingProof (BOTH BOUNDS(ID, ID))
1070.03/291.72	Renamed function symbols to avoid clashes with predefined symbol.
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(2)
1070.03/291.72	Obligation:
1070.03/291.72	The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF).
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	The TRS R consists of the following rules:
1070.03/291.72	
1070.03/291.72	   -(x, 0') -> x
1070.03/291.72	   -(s(x), s(y)) -> -(x, y)
1070.03/291.72	   +'(0', y) -> y
1070.03/291.72	   +'(s(x), y) -> s(+'(x, y))
1070.03/291.72	   *'(x, 0') -> 0'
1070.03/291.72	   *'(x, s(y)) -> +'(x, *'(x, y))
1070.03/291.72	   f(s(x)) -> f(-(+'(*'(s(x), s(x)), *'(s(x), s(s(s(0'))))), *'(s(s(x)), s(s(x)))))
1070.03/291.72	
1070.03/291.72	S is empty.
1070.03/291.72	Rewrite Strategy: INNERMOST
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(3) TypeInferenceProof (BOTH BOUNDS(ID, ID))
1070.03/291.72	Infered types.
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(4)
1070.03/291.72	Obligation:
1070.03/291.72	Innermost TRS:
1070.03/291.72	Rules:
1070.03/291.72	-(x, 0') -> x
1070.03/291.72	-(s(x), s(y)) -> -(x, y)
1070.03/291.72	+'(0', y) -> y
1070.03/291.72	+'(s(x), y) -> s(+'(x, y))
1070.03/291.72	*'(x, 0') -> 0'
1070.03/291.72	*'(x, s(y)) -> +'(x, *'(x, y))
1070.03/291.72	f(s(x)) -> f(-(+'(*'(s(x), s(x)), *'(s(x), s(s(s(0'))))), *'(s(s(x)), s(s(x)))))
1070.03/291.72	
1070.03/291.72	Types:
1070.03/291.72	- :: 0':s -> 0':s -> 0':s
1070.03/291.72	0' :: 0':s
1070.03/291.72	s :: 0':s -> 0':s
1070.03/291.72	+' :: 0':s -> 0':s -> 0':s
1070.03/291.72	*' :: 0':s -> 0':s -> 0':s
1070.03/291.72	f :: 0':s -> f
1070.03/291.72	hole_0':s1_0 :: 0':s
1070.03/291.72	hole_f2_0 :: f
1070.03/291.72	gen_0':s3_0 :: Nat -> 0':s
1070.03/291.72	
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(5) OrderProof (LOWER BOUND(ID))
1070.03/291.72	Heuristically decided to analyse the following defined symbols:
1070.03/291.72	-, +', *', f
1070.03/291.72	
1070.03/291.72	They will be analysed ascendingly in the following order:
1070.03/291.72	- < f
1070.03/291.72	+' < *'
1070.03/291.72	+' < f
1070.03/291.72	*' < f
1070.03/291.72	
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(6)
1070.03/291.72	Obligation:
1070.03/291.72	Innermost TRS:
1070.03/291.72	Rules:
1070.03/291.72	-(x, 0') -> x
1070.03/291.72	-(s(x), s(y)) -> -(x, y)
1070.03/291.72	+'(0', y) -> y
1070.03/291.72	+'(s(x), y) -> s(+'(x, y))
1070.03/291.72	*'(x, 0') -> 0'
1070.03/291.72	*'(x, s(y)) -> +'(x, *'(x, y))
1070.03/291.72	f(s(x)) -> f(-(+'(*'(s(x), s(x)), *'(s(x), s(s(s(0'))))), *'(s(s(x)), s(s(x)))))
1070.03/291.72	
1070.03/291.72	Types:
1070.03/291.72	- :: 0':s -> 0':s -> 0':s
1070.03/291.72	0' :: 0':s
1070.03/291.72	s :: 0':s -> 0':s
1070.03/291.72	+' :: 0':s -> 0':s -> 0':s
1070.03/291.72	*' :: 0':s -> 0':s -> 0':s
1070.03/291.72	f :: 0':s -> f
1070.03/291.72	hole_0':s1_0 :: 0':s
1070.03/291.72	hole_f2_0 :: f
1070.03/291.72	gen_0':s3_0 :: Nat -> 0':s
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	Generator Equations:
1070.03/291.72	gen_0':s3_0(0) <=> 0'
1070.03/291.72	gen_0':s3_0(+(x, 1)) <=> s(gen_0':s3_0(x))
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	The following defined symbols remain to be analysed:
1070.03/291.72	-, +', *', f
1070.03/291.72	
1070.03/291.72	They will be analysed ascendingly in the following order:
1070.03/291.72	- < f
1070.03/291.72	+' < *'
1070.03/291.72	+' < f
1070.03/291.72	*' < f
1070.03/291.72	
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(7) RewriteLemmaProof (LOWER BOUND(ID))
1070.03/291.72	Proved the following rewrite lemma:
1070.03/291.72	-(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) -> gen_0':s3_0(0), rt in Omega(1 + n5_0)
1070.03/291.72	
1070.03/291.72	Induction Base:
1070.03/291.72	-(gen_0':s3_0(0), gen_0':s3_0(0)) ->_R^Omega(1)
1070.03/291.72	gen_0':s3_0(0)
1070.03/291.72	
1070.03/291.72	Induction Step:
1070.03/291.72	-(gen_0':s3_0(+(n5_0, 1)), gen_0':s3_0(+(n5_0, 1))) ->_R^Omega(1)
1070.03/291.72	-(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) ->_IH
1070.03/291.72	gen_0':s3_0(0)
1070.03/291.72	
1070.03/291.72	We have rt in Omega(n^1) and sz in O(n). Thus, we have irc_R in Omega(n).
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(8)
1070.03/291.72	Complex Obligation (BEST)
1070.03/291.72	
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(9)
1070.03/291.72	Obligation:
1070.03/291.72	Proved the lower bound n^1 for the following obligation:
1070.03/291.72	
1070.03/291.72	Innermost TRS:
1070.03/291.72	Rules:
1070.03/291.72	-(x, 0') -> x
1070.03/291.72	-(s(x), s(y)) -> -(x, y)
1070.03/291.72	+'(0', y) -> y
1070.03/291.72	+'(s(x), y) -> s(+'(x, y))
1070.03/291.72	*'(x, 0') -> 0'
1070.03/291.72	*'(x, s(y)) -> +'(x, *'(x, y))
1070.03/291.72	f(s(x)) -> f(-(+'(*'(s(x), s(x)), *'(s(x), s(s(s(0'))))), *'(s(s(x)), s(s(x)))))
1070.03/291.72	
1070.03/291.72	Types:
1070.03/291.72	- :: 0':s -> 0':s -> 0':s
1070.03/291.72	0' :: 0':s
1070.03/291.72	s :: 0':s -> 0':s
1070.03/291.72	+' :: 0':s -> 0':s -> 0':s
1070.03/291.72	*' :: 0':s -> 0':s -> 0':s
1070.03/291.72	f :: 0':s -> f
1070.03/291.72	hole_0':s1_0 :: 0':s
1070.03/291.72	hole_f2_0 :: f
1070.03/291.72	gen_0':s3_0 :: Nat -> 0':s
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	Generator Equations:
1070.03/291.72	gen_0':s3_0(0) <=> 0'
1070.03/291.72	gen_0':s3_0(+(x, 1)) <=> s(gen_0':s3_0(x))
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	The following defined symbols remain to be analysed:
1070.03/291.72	-, +', *', f
1070.03/291.72	
1070.03/291.72	They will be analysed ascendingly in the following order:
1070.03/291.72	- < f
1070.03/291.72	+' < *'
1070.03/291.72	+' < f
1070.03/291.72	*' < f
1070.03/291.72	
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(10) LowerBoundPropagationProof (FINISHED)
1070.03/291.72	Propagated lower bound.
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(11)
1070.03/291.72	BOUNDS(n^1, INF)
1070.03/291.72	
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(12)
1070.03/291.72	Obligation:
1070.03/291.72	Innermost TRS:
1070.03/291.72	Rules:
1070.03/291.72	-(x, 0') -> x
1070.03/291.72	-(s(x), s(y)) -> -(x, y)
1070.03/291.72	+'(0', y) -> y
1070.03/291.72	+'(s(x), y) -> s(+'(x, y))
1070.03/291.72	*'(x, 0') -> 0'
1070.03/291.72	*'(x, s(y)) -> +'(x, *'(x, y))
1070.03/291.72	f(s(x)) -> f(-(+'(*'(s(x), s(x)), *'(s(x), s(s(s(0'))))), *'(s(s(x)), s(s(x)))))
1070.03/291.72	
1070.03/291.72	Types:
1070.03/291.72	- :: 0':s -> 0':s -> 0':s
1070.03/291.72	0' :: 0':s
1070.03/291.72	s :: 0':s -> 0':s
1070.03/291.72	+' :: 0':s -> 0':s -> 0':s
1070.03/291.72	*' :: 0':s -> 0':s -> 0':s
1070.03/291.72	f :: 0':s -> f
1070.03/291.72	hole_0':s1_0 :: 0':s
1070.03/291.72	hole_f2_0 :: f
1070.03/291.72	gen_0':s3_0 :: Nat -> 0':s
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	Lemmas:
1070.03/291.72	-(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) -> gen_0':s3_0(0), rt in Omega(1 + n5_0)
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	Generator Equations:
1070.03/291.72	gen_0':s3_0(0) <=> 0'
1070.03/291.72	gen_0':s3_0(+(x, 1)) <=> s(gen_0':s3_0(x))
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	The following defined symbols remain to be analysed:
1070.03/291.72	+', *', f
1070.03/291.72	
1070.03/291.72	They will be analysed ascendingly in the following order:
1070.03/291.72	+' < *'
1070.03/291.72	+' < f
1070.03/291.72	*' < f
1070.03/291.72	
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(13) RewriteLemmaProof (LOWER BOUND(ID))
1070.03/291.72	Proved the following rewrite lemma:
1070.03/291.72	+'(gen_0':s3_0(n273_0), gen_0':s3_0(b)) -> gen_0':s3_0(+(n273_0, b)), rt in Omega(1 + n273_0)
1070.03/291.72	
1070.03/291.72	Induction Base:
1070.03/291.72	+'(gen_0':s3_0(0), gen_0':s3_0(b)) ->_R^Omega(1)
1070.03/291.72	gen_0':s3_0(b)
1070.03/291.72	
1070.03/291.72	Induction Step:
1070.03/291.72	+'(gen_0':s3_0(+(n273_0, 1)), gen_0':s3_0(b)) ->_R^Omega(1)
1070.03/291.72	s(+'(gen_0':s3_0(n273_0), gen_0':s3_0(b))) ->_IH
1070.03/291.72	s(gen_0':s3_0(+(b, c274_0)))
1070.03/291.72	
1070.03/291.72	We have rt in Omega(n^1) and sz in O(n). Thus, we have irc_R in Omega(n).
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(14)
1070.03/291.72	Obligation:
1070.03/291.72	Innermost TRS:
1070.03/291.72	Rules:
1070.03/291.72	-(x, 0') -> x
1070.03/291.72	-(s(x), s(y)) -> -(x, y)
1070.03/291.72	+'(0', y) -> y
1070.03/291.72	+'(s(x), y) -> s(+'(x, y))
1070.03/291.72	*'(x, 0') -> 0'
1070.03/291.72	*'(x, s(y)) -> +'(x, *'(x, y))
1070.03/291.72	f(s(x)) -> f(-(+'(*'(s(x), s(x)), *'(s(x), s(s(s(0'))))), *'(s(s(x)), s(s(x)))))
1070.03/291.72	
1070.03/291.72	Types:
1070.03/291.72	- :: 0':s -> 0':s -> 0':s
1070.03/291.72	0' :: 0':s
1070.03/291.72	s :: 0':s -> 0':s
1070.03/291.72	+' :: 0':s -> 0':s -> 0':s
1070.03/291.72	*' :: 0':s -> 0':s -> 0':s
1070.03/291.72	f :: 0':s -> f
1070.03/291.72	hole_0':s1_0 :: 0':s
1070.03/291.72	hole_f2_0 :: f
1070.03/291.72	gen_0':s3_0 :: Nat -> 0':s
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	Lemmas:
1070.03/291.72	-(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) -> gen_0':s3_0(0), rt in Omega(1 + n5_0)
1070.03/291.72	+'(gen_0':s3_0(n273_0), gen_0':s3_0(b)) -> gen_0':s3_0(+(n273_0, b)), rt in Omega(1 + n273_0)
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	Generator Equations:
1070.03/291.72	gen_0':s3_0(0) <=> 0'
1070.03/291.72	gen_0':s3_0(+(x, 1)) <=> s(gen_0':s3_0(x))
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	The following defined symbols remain to be analysed:
1070.03/291.72	*', f
1070.03/291.72	
1070.03/291.72	They will be analysed ascendingly in the following order:
1070.03/291.72	*' < f
1070.03/291.72	
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(15) RewriteLemmaProof (LOWER BOUND(ID))
1070.03/291.72	Proved the following rewrite lemma:
1070.03/291.72	*'(gen_0':s3_0(a), gen_0':s3_0(n792_0)) -> gen_0':s3_0(*(n792_0, a)), rt in Omega(1 + a*n792_0 + n792_0)
1070.03/291.72	
1070.03/291.72	Induction Base:
1070.03/291.72	*'(gen_0':s3_0(a), gen_0':s3_0(0)) ->_R^Omega(1)
1070.03/291.72	0'
1070.03/291.72	
1070.03/291.72	Induction Step:
1070.03/291.72	*'(gen_0':s3_0(a), gen_0':s3_0(+(n792_0, 1))) ->_R^Omega(1)
1070.03/291.72	+'(gen_0':s3_0(a), *'(gen_0':s3_0(a), gen_0':s3_0(n792_0))) ->_IH
1070.03/291.72	+'(gen_0':s3_0(a), gen_0':s3_0(*(c793_0, a))) ->_L^Omega(1 + a)
1070.03/291.72	gen_0':s3_0(+(a, *(n792_0, a)))
1070.03/291.72	
1070.03/291.72	We have rt in Omega(n^2) and sz in O(n). Thus, we have irc_R in Omega(n^2).
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(16)
1070.03/291.72	Complex Obligation (BEST)
1070.03/291.72	
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(17)
1070.03/291.72	Obligation:
1070.03/291.72	Proved the lower bound n^2 for the following obligation:
1070.03/291.72	
1070.03/291.72	Innermost TRS:
1070.03/291.72	Rules:
1070.03/291.72	-(x, 0') -> x
1070.03/291.72	-(s(x), s(y)) -> -(x, y)
1070.03/291.72	+'(0', y) -> y
1070.03/291.72	+'(s(x), y) -> s(+'(x, y))
1070.03/291.72	*'(x, 0') -> 0'
1070.03/291.72	*'(x, s(y)) -> +'(x, *'(x, y))
1070.03/291.72	f(s(x)) -> f(-(+'(*'(s(x), s(x)), *'(s(x), s(s(s(0'))))), *'(s(s(x)), s(s(x)))))
1070.03/291.72	
1070.03/291.72	Types:
1070.03/291.72	- :: 0':s -> 0':s -> 0':s
1070.03/291.72	0' :: 0':s
1070.03/291.72	s :: 0':s -> 0':s
1070.03/291.72	+' :: 0':s -> 0':s -> 0':s
1070.03/291.72	*' :: 0':s -> 0':s -> 0':s
1070.03/291.72	f :: 0':s -> f
1070.03/291.72	hole_0':s1_0 :: 0':s
1070.03/291.72	hole_f2_0 :: f
1070.03/291.72	gen_0':s3_0 :: Nat -> 0':s
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	Lemmas:
1070.03/291.72	-(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) -> gen_0':s3_0(0), rt in Omega(1 + n5_0)
1070.03/291.72	+'(gen_0':s3_0(n273_0), gen_0':s3_0(b)) -> gen_0':s3_0(+(n273_0, b)), rt in Omega(1 + n273_0)
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	Generator Equations:
1070.03/291.72	gen_0':s3_0(0) <=> 0'
1070.03/291.72	gen_0':s3_0(+(x, 1)) <=> s(gen_0':s3_0(x))
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	The following defined symbols remain to be analysed:
1070.03/291.72	*', f
1070.03/291.72	
1070.03/291.72	They will be analysed ascendingly in the following order:
1070.03/291.72	*' < f
1070.03/291.72	
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(18) LowerBoundPropagationProof (FINISHED)
1070.03/291.72	Propagated lower bound.
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(19)
1070.03/291.72	BOUNDS(n^2, INF)
1070.03/291.72	
1070.03/291.72	----------------------------------------
1070.03/291.72	
1070.03/291.72	(20)
1070.03/291.72	Obligation:
1070.03/291.72	Innermost TRS:
1070.03/291.72	Rules:
1070.03/291.72	-(x, 0') -> x
1070.03/291.72	-(s(x), s(y)) -> -(x, y)
1070.03/291.72	+'(0', y) -> y
1070.03/291.72	+'(s(x), y) -> s(+'(x, y))
1070.03/291.72	*'(x, 0') -> 0'
1070.03/291.72	*'(x, s(y)) -> +'(x, *'(x, y))
1070.03/291.72	f(s(x)) -> f(-(+'(*'(s(x), s(x)), *'(s(x), s(s(s(0'))))), *'(s(s(x)), s(s(x)))))
1070.03/291.72	
1070.03/291.72	Types:
1070.03/291.72	- :: 0':s -> 0':s -> 0':s
1070.03/291.72	0' :: 0':s
1070.03/291.72	s :: 0':s -> 0':s
1070.03/291.72	+' :: 0':s -> 0':s -> 0':s
1070.03/291.72	*' :: 0':s -> 0':s -> 0':s
1070.03/291.72	f :: 0':s -> f
1070.03/291.72	hole_0':s1_0 :: 0':s
1070.03/291.72	hole_f2_0 :: f
1070.03/291.72	gen_0':s3_0 :: Nat -> 0':s
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	Lemmas:
1070.03/291.72	-(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) -> gen_0':s3_0(0), rt in Omega(1 + n5_0)
1070.03/291.72	+'(gen_0':s3_0(n273_0), gen_0':s3_0(b)) -> gen_0':s3_0(+(n273_0, b)), rt in Omega(1 + n273_0)
1070.03/291.72	*'(gen_0':s3_0(a), gen_0':s3_0(n792_0)) -> gen_0':s3_0(*(n792_0, a)), rt in Omega(1 + a*n792_0 + n792_0)
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	Generator Equations:
1070.03/291.72	gen_0':s3_0(0) <=> 0'
1070.03/291.72	gen_0':s3_0(+(x, 1)) <=> s(gen_0':s3_0(x))
1070.03/291.72	
1070.03/291.72	
1070.03/291.72	The following defined symbols remain to be analysed:
1070.03/291.72	f
1070.20/291.79	EOF