details

property	value
status	complete
benchmark	PALINDROME_nosorts_noand_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)	7.272824049 seconds
cpu usage	21.388051183
max memory	4.05823488E9

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/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(n^1, n^1). (0) CpxTRS (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (4) CpxTRS (5) CpxTrsMatchBoundsTAProof [FINISHED, 53 ms] (6) BOUNDS(1, n^1) (7) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (8) TRS for Loop Detection (9) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (10) BEST (11) proven lower bound (12) LowerBoundPropagationProof [FINISHED, 0 ms] (13) BOUNDS(n^1, INF) (14) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(U11(tt)) -> mark(U12(tt)) active(U12(tt)) -> mark(tt) active(isNePal(__(I, __(P, I)))) -> mark(U11(tt)) active(__(X1, X2)) -> __(active(X1), X2) active(__(X1, X2)) -> __(X1, active(X2)) active(U11(X)) -> U11(active(X)) active(U12(X)) -> U12(active(X)) active(isNePal(X)) -> isNePal(active(X)) __(mark(X1), X2) -> mark(__(X1, X2)) __(X1, mark(X2)) -> mark(__(X1, X2)) U11(mark(X)) -> mark(U11(X)) U12(mark(X)) -> mark(U12(X)) isNePal(mark(X)) -> mark(isNePal(X)) proper(__(X1, X2)) -> __(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(U11(X)) -> U11(proper(X)) proper(tt) -> ok(tt) proper(U12(X)) -> U12(proper(X)) proper(isNePal(X)) -> isNePal(proper(X)) __(ok(X1), ok(X2)) -> ok(__(X1, X2)) U11(ok(X)) -> ok(U11(X)) U12(ok(X)) -> ok(U12(X)) isNePal(ok(X)) -> ok(isNePal(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) NestedDefinedSymbolProof (UPPER BOUND(ID)) The following defined symbols can occur below the 0th argument of top: proper, active The following defined symbols can occur below the 0th argument of proper: proper, active The following defined symbols can occur below the 0th argument of active: proper, active Hence, the left-hand sides of the following rules are not basic-reachable and can be removed: active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z))) active(__(X, nil)) -> mark(X) active(__(nil, X)) -> mark(X) active(U11(tt)) -> mark(U12(tt)) active(U12(tt)) -> mark(tt) active(isNePal(__(I, __(P, I)))) -> mark(U11(tt)) active(__(X1, X2)) -> __(active(X1), X2) active(__(X1, X2)) -> __(X1, active(X2)) active(U11(X)) -> U11(active(X)) active(U12(X)) -> U12(active(X)) active(isNePal(X)) -> isNePal(active(X)) proper(__(X1, X2)) -> __(proper(X1), proper(X2)) proper(U11(X)) -> U11(proper(X)) proper(U12(X)) -> U12(proper(X)) proper(isNePal(X)) -> isNePal(proper(X)) ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, n^1). popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127