Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903701
details
property
value
status
complete
benchmark
Ex5_7_Luc97_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
1.65725588799 seconds
cpu usage
3.837885714
max memory
2.2996992E8
stage attributes
key
value
output-size
8027
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(EXP, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 53 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection (9) DecreasingLoopProof [FINISHED, 0 ms] (10) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: dbl(0) -> 0 dbl(s(X)) -> s(n__s(n__dbl(activate(X)))) dbls(nil) -> nil dbls(cons(X, Y)) -> cons(n__dbl(activate(X)), n__dbls(activate(Y))) sel(0, cons(X, Y)) -> activate(X) sel(s(X), cons(Y, Z)) -> sel(activate(X), activate(Z)) indx(nil, X) -> nil indx(cons(X, Y), Z) -> cons(n__sel(activate(X), activate(Z)), n__indx(activate(Y), activate(Z))) from(X) -> cons(activate(X), n__from(n__s(activate(X)))) dbl1(0) -> 01 dbl1(s(X)) -> s1(s1(dbl1(activate(X)))) sel1(0, cons(X, Y)) -> activate(X) sel1(s(X), cons(Y, Z)) -> sel1(activate(X), activate(Z)) quote(0) -> 01 quote(s(X)) -> s1(quote(activate(X))) quote(dbl(X)) -> dbl1(X) quote(sel(X, Y)) -> sel1(X, Y) s(X) -> n__s(X) dbl(X) -> n__dbl(X) dbls(X) -> n__dbls(X) sel(X1, X2) -> n__sel(X1, X2) indx(X1, X2) -> n__indx(X1, X2) from(X) -> n__from(X) activate(n__s(X)) -> s(X) activate(n__dbl(X)) -> dbl(X) activate(n__dbls(X)) -> dbls(X) activate(n__sel(X1, X2)) -> sel(X1, X2) activate(n__indx(X1, X2)) -> indx(X1, X2) activate(n__from(X)) -> from(X) 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(EXP, INF). The TRS R consists of the following rules: dbl(0) -> 0 dbl(s(X)) -> s(n__s(n__dbl(activate(X)))) dbls(nil) -> nil dbls(cons(X, Y)) -> cons(n__dbl(activate(X)), n__dbls(activate(Y))) sel(0, cons(X, Y)) -> activate(X) sel(s(X), cons(Y, Z)) -> sel(activate(X), activate(Z)) indx(nil, X) -> nil indx(cons(X, Y), Z) -> cons(n__sel(activate(X), activate(Z)), n__indx(activate(Y), activate(Z))) from(X) -> cons(activate(X), n__from(n__s(activate(X)))) dbl1(0) -> 01 dbl1(s(X)) -> s1(s1(dbl1(activate(X)))) sel1(0, cons(X, Y)) -> activate(X) sel1(s(X), cons(Y, Z)) -> sel1(activate(X), activate(Z)) quote(0) -> 01 quote(s(X)) -> s1(quote(activate(X))) quote(dbl(X)) -> dbl1(X) quote(sel(X, Y)) -> sel1(X, Y)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127