2.85/1.47	WORST_CASE(NON_POLY, ?)
2.97/1.47	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
2.97/1.47	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.97/1.47	
2.97/1.47	
2.97/1.47	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.97/1.47	
2.97/1.47	(0) Name of obligation not specified
2.97/1.47	(1) ExtraVarProof [FINISHED, 0 ms]
2.97/1.47	(2) BOUNDS(INF, INF)
2.97/1.47	
2.97/1.47	
2.97/1.47	----------------------------------------
2.97/1.47	
2.97/1.47	(0)
2.97/1.47	Obligation:
2.97/1.47	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.97/1.47	
2.97/1.47	
2.97/1.47	The TRS R consists of the following rules:
2.97/1.47	
2.97/1.47	   and(tt) -> X
2.97/1.47	   __(__(X, Y), Z) -> __(X, __(Y, Z))
2.97/1.47	   __(X, nil) -> X
2.97/1.47	   __(nil, X) -> X
2.97/1.47	   isNePal(__(I, __(P, I))) -> tt
2.97/1.47	
2.97/1.47	
2.97/1.47	----------------------------------------
2.97/1.47	
2.97/1.47	(1) ExtraVarProof (FINISHED)
2.97/1.47	unbounded runtime complexity due to extra variable on rhs
2.97/1.47	----------------------------------------
2.97/1.47	
2.97/1.47	(2)
2.97/1.47	BOUNDS(INF, INF)
2.97/1.50	EOF