Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903915
details
property
value
status
complete
benchmark
LISTUTILITIES_nokinds_FR.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)
1.929033041 seconds
cpu usage
4.996830169
max memory
4.52329472E8
stage attributes
key
value
output-size
17434
starexec-result
WORST_CASE(NON_POLY, ?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) 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(EXP, 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 (9) DecreasingLoopProof [FINISHED, 265 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: U101(tt, N, XS) -> fst(splitAt(activate(N), activate(XS))) U11(tt, N, XS) -> snd(splitAt(activate(N), activate(XS))) U21(tt, X) -> activate(X) U31(tt, N) -> activate(N) U41(tt, N) -> cons(activate(N), n__natsFrom(n__s(activate(N)))) U51(tt, N, XS) -> head(afterNth(activate(N), activate(XS))) U61(tt, Y) -> activate(Y) U71(tt, XS) -> pair(nil, activate(XS)) U81(tt, N, X, XS) -> U82(splitAt(activate(N), activate(XS)), activate(X)) U82(pair(YS, ZS), X) -> pair(cons(activate(X), YS), ZS) U91(tt, XS) -> activate(XS) afterNth(N, XS) -> U11(and(isNatural(N), n__isLNat(XS)), N, XS) and(tt, X) -> activate(X) fst(pair(X, Y)) -> U21(and(isLNat(X), n__isLNat(Y)), X) head(cons(N, XS)) -> U31(and(isNatural(N), n__isLNat(activate(XS))), N) isLNat(n__nil) -> tt isLNat(n__afterNth(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) isLNat(n__cons(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) isLNat(n__fst(V1)) -> isPLNat(activate(V1)) isLNat(n__natsFrom(V1)) -> isNatural(activate(V1)) isLNat(n__snd(V1)) -> isPLNat(activate(V1)) isLNat(n__tail(V1)) -> isLNat(activate(V1)) isLNat(n__take(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) isNatural(n__0) -> tt isNatural(n__head(V1)) -> isLNat(activate(V1)) isNatural(n__s(V1)) -> isNatural(activate(V1)) isNatural(n__sel(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) isPLNat(n__pair(V1, V2)) -> and(isLNat(activate(V1)), n__isLNat(activate(V2))) isPLNat(n__splitAt(V1, V2)) -> and(isNatural(activate(V1)), n__isLNat(activate(V2))) natsFrom(N) -> U41(isNatural(N), N) sel(N, XS) -> U51(and(isNatural(N), n__isLNat(XS)), N, XS) snd(pair(X, Y)) -> U61(and(isLNat(X), n__isLNat(Y)), Y) splitAt(0, XS) -> U71(isLNat(XS), XS) splitAt(s(N), cons(X, XS)) -> U81(and(isNatural(N), n__and(n__isNatural(X), n__isLNat(activate(XS)))), N, X, activate(XS)) tail(cons(N, XS)) -> U91(and(isNatural(N), n__isLNat(activate(XS))), activate(XS)) take(N, XS) -> U101(and(isNatural(N), n__isLNat(XS)), N, XS) natsFrom(X) -> n__natsFrom(X) s(X) -> n__s(X) isLNat(X) -> n__isLNat(X) nil -> n__nil afterNth(X1, X2) -> n__afterNth(X1, X2) cons(X1, X2) -> n__cons(X1, X2) fst(X) -> n__fst(X) snd(X) -> n__snd(X) tail(X) -> n__tail(X) take(X1, X2) -> n__take(X1, X2) 0 -> n__0 head(X) -> n__head(X) sel(X1, X2) -> n__sel(X1, X2) pair(X1, X2) -> n__pair(X1, X2) splitAt(X1, X2) -> n__splitAt(X1, X2) and(X1, X2) -> n__and(X1, X2) isNatural(X) -> n__isNatural(X) activate(n__natsFrom(X)) -> natsFrom(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__isLNat(X)) -> isLNat(X) activate(n__nil) -> nil activate(n__afterNth(X1, X2)) -> afterNth(activate(X1), activate(X2)) activate(n__cons(X1, X2)) -> cons(activate(X1), X2) activate(n__fst(X)) -> fst(activate(X)) activate(n__snd(X)) -> snd(activate(X)) activate(n__tail(X)) -> tail(activate(X)) activate(n__take(X1, X2)) -> take(activate(X1), activate(X2)) activate(n__0) -> 0 activate(n__head(X)) -> head(activate(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127