Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307687

details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	7.66862 seconds
cpu usage	22.258
user time	20.5095
system time	1.74843
max virtual memory	1.9181492E7
max residence set size	3752096.0

stage attributes

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

output

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

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