Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308257

details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	6.68444 seconds
cpu usage	22.6441
user time	21.3066
system time	1.33754
max virtual memory	1.9409624E7
max residence set size	3669468.0

stage attributes

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

output

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

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