Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307640

details

property	value
status	complete
benchmark	append-wrong.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n033.star.cs.uiowa.edu
space	CiME_04

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.0438 seconds
cpu usage	3.54711
user time	3.38973
system time	0.157385
max virtual memory	1.8277336E7
max residence set size	224832.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

3.49/2.01	WORST_CASE(NON_POLY, ?)
3.49/2.01	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.49/2.01	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.49/2.01	
3.49/2.01	
3.49/2.01	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF).
3.49/2.01	
3.49/2.01	(0) CpxTRS
3.49/2.01	(1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
3.49/2.01	(2) TRS for Loop Detection
3.49/2.01	(3) InfiniteLowerBoundProof [FINISHED, 51 ms]
3.49/2.01	(4) BOUNDS(INF, INF)
3.49/2.01	
3.49/2.01	
3.49/2.01	----------------------------------------
3.49/2.01	
3.49/2.01	(0)
3.49/2.01	Obligation:
3.49/2.01	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF).
3.49/2.01	
3.49/2.01	
3.49/2.01	The TRS R consists of the following rules:
3.49/2.01	
3.49/2.01	   is_empty(nil) -> true
3.49/2.01	   is_empty(cons(x, l)) -> false
3.49/2.01	   hd(cons(x, l)) -> x
3.49/2.01	   tl(cons(x, l)) -> cons(x, l)
3.49/2.01	   append(l1, l2) -> ifappend(l1, l2, is_empty(l1))
3.49/2.01	   ifappend(l1, l2, true) -> l2
3.49/2.01	   ifappend(l1, l2, false) -> cons(hd(l1), append(tl(l1), l2))
3.49/2.01	
3.49/2.01	S is empty.
3.49/2.01	Rewrite Strategy: FULL
3.49/2.01	----------------------------------------
3.49/2.01	
3.49/2.01	(1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID))
3.49/2.01	Transformed a relative TRS into a decreasing-loop problem.
3.49/2.01	----------------------------------------
3.49/2.01	
3.49/2.01	(2)
3.49/2.01	Obligation:
3.49/2.01	Analyzing the following TRS for decreasing loops:
3.49/2.01	
3.49/2.01	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF).
3.49/2.01	
3.49/2.01	
3.49/2.01	The TRS R consists of the following rules:
3.49/2.01	
3.49/2.01	   is_empty(nil) -> true
3.49/2.01	   is_empty(cons(x, l)) -> false
3.49/2.01	   hd(cons(x, l)) -> x
3.49/2.01	   tl(cons(x, l)) -> cons(x, l)
3.49/2.01	   append(l1, l2) -> ifappend(l1, l2, is_empty(l1))
3.49/2.01	   ifappend(l1, l2, true) -> l2
3.49/2.01	   ifappend(l1, l2, false) -> cons(hd(l1), append(tl(l1), l2))
3.49/2.01	
3.49/2.01	S is empty.
3.49/2.01	Rewrite Strategy: FULL
3.49/2.01	----------------------------------------
3.49/2.01	
3.49/2.01	(3) InfiniteLowerBoundProof (FINISHED)
3.49/2.01	The following loop proves infinite runtime complexity:
3.49/2.01	
3.49/2.01	The rewrite sequence
3.49/2.01	
3.49/2.01	ifappend(cons(x1_0, l2_0), l2, false) ->^+ cons(hd(cons(x1_0, l2_0)), ifappend(cons(x1_0, l2_0), l2, false))
3.49/2.01	
3.49/2.01	gives rise to a decreasing loop by considering the right hand sides subterm at position [1].
3.49/2.01	
3.49/2.01	The pumping substitution is [ ].
3.49/2.01	
3.49/2.01	The result substitution is [ ].
3.49/2.01	
3.49/2.01	
3.49/2.01	
3.49/2.01	
3.49/2.01	----------------------------------------
3.49/2.01	
3.49/2.01	(4)
3.49/2.01	BOUNDS(INF, INF)
3.49/2.04	EOF

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Runtime_Complexity_Full_Rewriting 2019-04-01 06.11