Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308266

details

property	value
status	complete
benchmark	Ex1_Zan97_C.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n065.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	8.96123 seconds
cpu usage	43.8953
user time	40.7682
system time	3.12713
max virtual memory	1.9208732E7
max residence set size	3985176.0

stage attributes

key	value
starexec-result	WORST_CASE(Omega(n^1), O(n^1))

output

21.52/7.46	WORST_CASE(Omega(n^1), O(n^1))
21.52/7.47	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
21.52/7.47	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
21.52/7.47	
21.52/7.47	
21.52/7.47	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).
21.52/7.47	
21.52/7.47	(0) CpxTRS
21.52/7.47	(1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms]
21.52/7.47	(2) CpxTRS
21.52/7.47	    (3) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
21.52/7.47	    (4) CpxTRS
21.52/7.47	    (5) CpxTrsMatchBoundsProof [FINISHED, 0 ms]
21.52/7.47	    (6) BOUNDS(1, n^1)
21.52/7.47	(7) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
21.52/7.47	(8) TRS for Loop Detection
21.52/7.47	    (9) DecreasingLoopProof [LOWER BOUND(ID), 0 ms]
21.52/7.47	    (10) BEST
21.52/7.47	        (11) proven lower bound
21.52/7.47	            (12) LowerBoundPropagationProof [FINISHED, 0 ms]
21.52/7.47	            (13) BOUNDS(n^1, INF)
21.52/7.47	        (14) TRS for Loop Detection
21.52/7.47	
21.52/7.47	
21.52/7.47	----------------------------------------
21.52/7.47	
21.52/7.47	(0)
21.52/7.47	Obligation:
21.52/7.47	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).
21.52/7.47	
21.52/7.47	
21.52/7.47	The TRS R consists of the following rules:
21.52/7.47	
21.52/7.47	   active(g(X)) -> mark(h(X))
21.52/7.47	   active(c) -> mark(d)
21.52/7.47	   active(h(d)) -> mark(g(c))
21.52/7.47	   proper(g(X)) -> g(proper(X))
21.52/7.47	   proper(h(X)) -> h(proper(X))
21.52/7.47	   proper(c) -> ok(c)
21.52/7.47	   proper(d) -> ok(d)
21.52/7.47	   g(ok(X)) -> ok(g(X))
21.52/7.47	   h(ok(X)) -> ok(h(X))
21.52/7.47	   top(mark(X)) -> top(proper(X))
21.52/7.47	   top(ok(X)) -> top(active(X))
21.52/7.47	
21.52/7.47	S is empty.
21.52/7.47	Rewrite Strategy: FULL
21.52/7.47	----------------------------------------
21.52/7.47	
21.52/7.47	(1) NestedDefinedSymbolProof (UPPER BOUND(ID))
21.52/7.47	The following defined symbols can occur below the 0th argument of top: proper, active
21.52/7.47	The following defined symbols can occur below the 0th argument of proper: proper, active
21.52/7.47	The following defined symbols can occur below the 0th argument of active: proper, active
21.52/7.47	
21.52/7.47	Hence, the left-hand sides of the following rules are not basic-reachable and can be removed:
21.52/7.47	active(g(X)) -> mark(h(X))
21.52/7.47	active(h(d)) -> mark(g(c))
21.52/7.47	proper(g(X)) -> g(proper(X))
21.52/7.47	proper(h(X)) -> h(proper(X))
21.52/7.47	
21.52/7.47	----------------------------------------
21.52/7.47	
21.52/7.47	(2)
21.52/7.47	Obligation:
21.52/7.47	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, n^1).
21.52/7.47	
21.52/7.47	
21.52/7.47	The TRS R consists of the following rules:
21.52/7.47	
21.52/7.47	   active(c) -> mark(d)
21.52/7.47	   proper(c) -> ok(c)
21.52/7.47	   proper(d) -> ok(d)
21.52/7.47	   g(ok(X)) -> ok(g(X))
21.52/7.47	   h(ok(X)) -> ok(h(X))
21.52/7.47	   top(mark(X)) -> top(proper(X))
21.52/7.47	   top(ok(X)) -> top(active(X))
21.52/7.47	
21.52/7.47	S is empty.
21.52/7.47	Rewrite Strategy: FULL
21.52/7.47	----------------------------------------
21.52/7.47	
21.52/7.47	(3) RelTrsToTrsProof (UPPER BOUND(ID))
21.52/7.47	transformed relative TRS to TRS
21.52/7.47	----------------------------------------
21.52/7.47	
21.52/7.47	(4)
21.52/7.47	Obligation:
21.52/7.47	The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, n^1).
21.52/7.47	
21.52/7.47	
21.52/7.47	The TRS R consists of the following rules:
21.52/7.47	
21.52/7.47	   active(c) -> mark(d)
21.52/7.47	   proper(c) -> ok(c)
21.52/7.47	   proper(d) -> ok(d)
21.52/7.47	   g(ok(X)) -> ok(g(X))
21.52/7.47	   h(ok(X)) -> ok(h(X))
21.52/7.47	   top(mark(X)) -> top(proper(X))
21.52/7.47	   top(ok(X)) -> top(active(X))
21.52/7.47

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