Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903419
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nokinds_noand_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n027.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
296.329031944 seconds
cpu usage
1172.10908164
max memory
1.5522729984E10
stage attributes
key
value
output-size
15515
starexec-result
WORST_CASE(Omega(n^1), ?)
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) 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(n^1, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 0 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: active(zeros) -> mark(cons(0, zeros)) active(U11(tt)) -> mark(tt) active(U21(tt)) -> mark(tt) active(U31(tt)) -> mark(tt) active(U41(tt, V2)) -> mark(U42(isNatIList(V2))) active(U42(tt)) -> mark(tt) active(U51(tt, V2)) -> mark(U52(isNatList(V2))) active(U52(tt)) -> mark(tt) active(U61(tt, L, N)) -> mark(U62(isNat(N), L)) active(U62(tt, L)) -> mark(s(length(L))) active(isNat(0)) -> mark(tt) active(isNat(length(V1))) -> mark(U11(isNatList(V1))) active(isNat(s(V1))) -> mark(U21(isNat(V1))) active(isNatIList(V)) -> mark(U31(isNatList(V))) active(isNatIList(zeros)) -> mark(tt) active(isNatIList(cons(V1, V2))) -> mark(U41(isNat(V1), V2)) active(isNatList(nil)) -> mark(tt) active(isNatList(cons(V1, V2))) -> mark(U51(isNat(V1), V2)) active(length(nil)) -> mark(0) active(length(cons(N, L))) -> mark(U61(isNatList(L), L, N)) active(cons(X1, X2)) -> cons(active(X1), X2) active(U11(X)) -> U11(active(X)) active(U21(X)) -> U21(active(X)) active(U31(X)) -> U31(active(X)) active(U41(X1, X2)) -> U41(active(X1), X2) active(U42(X)) -> U42(active(X)) active(U51(X1, X2)) -> U51(active(X1), X2) active(U52(X)) -> U52(active(X)) active(U61(X1, X2, X3)) -> U61(active(X1), X2, X3) active(U62(X1, X2)) -> U62(active(X1), X2) active(s(X)) -> s(active(X)) active(length(X)) -> length(active(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) U11(mark(X)) -> mark(U11(X)) U21(mark(X)) -> mark(U21(X)) U31(mark(X)) -> mark(U31(X)) U41(mark(X1), X2) -> mark(U41(X1, X2)) U42(mark(X)) -> mark(U42(X)) U51(mark(X1), X2) -> mark(U51(X1, X2)) U52(mark(X)) -> mark(U52(X)) U61(mark(X1), X2, X3) -> mark(U61(X1, X2, X3)) U62(mark(X1), X2) -> mark(U62(X1, X2)) s(mark(X)) -> mark(s(X)) length(mark(X)) -> mark(length(X)) proper(zeros) -> ok(zeros) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(0) -> ok(0) proper(U11(X)) -> U11(proper(X)) proper(tt) -> ok(tt) proper(U21(X)) -> U21(proper(X)) proper(U31(X)) -> U31(proper(X)) proper(U41(X1, X2)) -> U41(proper(X1), proper(X2)) proper(U42(X)) -> U42(proper(X)) proper(isNatIList(X)) -> isNatIList(proper(X)) proper(U51(X1, X2)) -> U51(proper(X1), proper(X2)) proper(U52(X)) -> U52(proper(X)) proper(isNatList(X)) -> isNatList(proper(X)) proper(U61(X1, X2, X3)) -> U61(proper(X1), proper(X2), proper(X3)) proper(U62(X1, X2)) -> U62(proper(X1), proper(X2)) proper(isNat(X)) -> isNat(proper(X)) proper(s(X)) -> s(proper(X)) proper(length(X)) -> length(proper(X)) proper(nil) -> ok(nil) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) U11(ok(X)) -> ok(U11(X)) U21(ok(X)) -> ok(U21(X)) U31(ok(X)) -> ok(U31(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127