details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.58601 seconds
cpu usage	3.41114
user time	3.24548
system time	0.165659
max virtual memory	1.827736E7
max residence set size	221200.0

stage attributes

key	value
starexec-result	WORST_CASE(?, O(1))

output

WORST_CASE(?, O(1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, 1). (0) CpxTRS (1) NarrowingOnBasicTermsTerminatesProof [FINISHED, 0 ms] (2) BOUNDS(1, 1) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, 1). The TRS R consists of the following rules: a__g(X) -> a__h(X) a__c -> d a__h(d) -> a__g(c) mark(g(X)) -> a__g(X) mark(h(X)) -> a__h(X) mark(c) -> a__c mark(d) -> d a__g(X) -> g(X) a__h(X) -> h(X) a__c -> c S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) NarrowingOnBasicTermsTerminatesProof (FINISHED) Constant runtime complexity proven by termination of constructor-based narrowing. The maximal most general narrowing sequences give rise to the following rewrite sequences: mark(d) ->^* d mark(c) ->^* c mark(c) ->^* d mark(h(x0)) ->^* h(x0) mark(h(d)) ->^* g(c) mark(h(d)) ->^* h(c) mark(g(x0)) ->^* g(x0) mark(g(x0)) ->^* h(x0) mark(g(d)) ->^* g(c) mark(g(d)) ->^* h(c) a__h(x0) ->^* h(x0) a__h(d) ->^* g(c) a__h(d) ->^* h(c) a__c ->^* c a__c ->^* d a__g(x0) ->^* g(x0) a__g(x0) ->^* h(x0) a__g(d) ->^* g(c) a__g(d) ->^* h(c) ---------------------------------------- (2) BOUNDS(1, 1) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS