details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.58098196983 seconds
cpu usage	3.258136677
max memory	1.81469184E8

stage attributes

key	value
output-size	3011
starexec-result	WORST_CASE(NON_POLY, ?)

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) InfiniteLowerBoundProof [FINISHED, 0 ms] (4) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: app(nil, YS) -> YS app(cons(X, XS), YS) -> cons(X, n__app(activate(XS), YS)) from(X) -> cons(X, n__from(s(X))) zWadr(nil, YS) -> nil zWadr(XS, nil) -> nil zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, n__nil)), n__zWadr(activate(XS), activate(YS))) prefix(L) -> cons(nil, n__zWadr(L, prefix(L))) app(X1, X2) -> n__app(X1, X2) from(X) -> n__from(X) nil -> n__nil zWadr(X1, X2) -> n__zWadr(X1, X2) activate(n__app(X1, X2)) -> app(X1, X2) activate(n__from(X)) -> from(X) activate(n__nil) -> nil activate(n__zWadr(X1, X2)) -> zWadr(X1, X2) activate(X) -> X S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (2) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: app(nil, YS) -> YS app(cons(X, XS), YS) -> cons(X, n__app(activate(XS), YS)) from(X) -> cons(X, n__from(s(X))) zWadr(nil, YS) -> nil zWadr(XS, nil) -> nil zWadr(cons(X, XS), cons(Y, YS)) -> cons(app(Y, cons(X, n__nil)), n__zWadr(activate(XS), activate(YS))) prefix(L) -> cons(nil, n__zWadr(L, prefix(L))) app(X1, X2) -> n__app(X1, X2) from(X) -> n__from(X) nil -> n__nil zWadr(X1, X2) -> n__zWadr(X1, X2) activate(n__app(X1, X2)) -> app(X1, X2) activate(n__from(X)) -> from(X) activate(n__nil) -> nil activate(n__zWadr(X1, X2)) -> zWadr(X1, X2) activate(X) -> X S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) InfiniteLowerBoundProof (FINISHED) The following loop proves infinite runtime complexity: The rewrite sequence prefix(L) ->^+ cons(nil, n__zWadr(L, prefix(L))) gives rise to a decreasing loop by considering the right hand sides subterm at position [1,1]. The pumping substitution is [ ]. The result substitution is [ ]. popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127