Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903389
details
property
value
status
complete
benchmark
OvConsOS_nokinds_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.48635006 seconds
cpu usage
321.776261373
max memory
6.806679552E9
stage attributes
key
value
output-size
9429
starexec-result
WORST_CASE(Omega(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), ?) 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, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 70 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: zeros -> cons(0, n__zeros) U11(tt, L) -> s(length(activate(L))) U21(tt) -> nil U31(tt, IL, M, N) -> cons(activate(N), n__take(activate(M), activate(IL))) and(tt, X) -> activate(X) isNat(n__0) -> tt isNat(n__length(V1)) -> isNatList(activate(V1)) isNat(n__s(V1)) -> isNat(activate(V1)) isNatIList(V) -> isNatList(activate(V)) isNatIList(n__zeros) -> tt isNatIList(n__cons(V1, V2)) -> and(isNat(activate(V1)), n__isNatIList(activate(V2))) isNatList(n__nil) -> tt isNatList(n__cons(V1, V2)) -> and(isNat(activate(V1)), n__isNatList(activate(V2))) isNatList(n__take(V1, V2)) -> and(isNat(activate(V1)), n__isNatIList(activate(V2))) length(nil) -> 0 length(cons(N, L)) -> U11(and(isNatList(activate(L)), n__isNat(N)), activate(L)) take(0, IL) -> U21(isNatIList(IL)) take(s(M), cons(N, IL)) -> U31(and(isNatIList(activate(IL)), n__and(isNat(M), n__isNat(N))), activate(IL), M, N) zeros -> n__zeros take(X1, X2) -> n__take(X1, X2) 0 -> n__0 length(X) -> n__length(X) s(X) -> n__s(X) cons(X1, X2) -> n__cons(X1, X2) isNatIList(X) -> n__isNatIList(X) nil -> n__nil isNatList(X) -> n__isNatList(X) isNat(X) -> n__isNat(X) and(X1, X2) -> n__and(X1, X2) activate(n__zeros) -> zeros activate(n__take(X1, X2)) -> take(X1, X2) activate(n__0) -> 0 activate(n__length(X)) -> length(X) activate(n__s(X)) -> s(X) activate(n__cons(X1, X2)) -> cons(X1, X2) activate(n__isNatIList(X)) -> isNatIList(X) activate(n__nil) -> nil activate(n__isNatList(X)) -> isNatList(X) activate(n__isNat(X)) -> isNat(X) activate(n__and(X1, X2)) -> and(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(n^1, INF). The TRS R consists of the following rules: zeros -> cons(0, n__zeros) U11(tt, L) -> s(length(activate(L))) U21(tt) -> nil U31(tt, IL, M, N) -> cons(activate(N), n__take(activate(M), activate(IL))) and(tt, X) -> activate(X) isNat(n__0) -> tt isNat(n__length(V1)) -> isNatList(activate(V1)) isNat(n__s(V1)) -> isNat(activate(V1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127