Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905199
details
property
value
status
timeout (wallclock)
benchmark
Ex3_3_25_Bor03_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
301.006508112 seconds
cpu usage
1177.8314952
max memory
1.521242112E10
stage attributes
unavailable
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 (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). (0) CpxTRS (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) SlicingProof [LOWER BOUND(ID), 0 ms] (4) CpxTRS (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (6) typed CpxTrs (7) OrderProof [LOWER BOUND(ID), 0 ms] (8) typed CpxTrs (9) RewriteLemmaProof [LOWER BOUND(ID), 335 ms] (10) BEST (11) proven lower bound (12) LowerBoundPropagationProof [FINISHED, 0 ms] (13) BOUNDS(n^1, INF) (14) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: a__app(nil, YS) -> mark(YS) a__app(cons(X, XS), YS) -> cons(mark(X), app(XS, YS)) a__from(X) -> cons(mark(X), from(s(X))) a__zWadr(nil, YS) -> nil a__zWadr(XS, nil) -> nil a__zWadr(cons(X, XS), cons(Y, YS)) -> cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS)) a__prefix(L) -> cons(nil, zWadr(L, prefix(L))) mark(app(X1, X2)) -> a__app(mark(X1), mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(zWadr(X1, X2)) -> a__zWadr(mark(X1), mark(X2)) mark(prefix(X)) -> a__prefix(mark(X)) mark(nil) -> nil mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(s(X)) -> s(mark(X)) a__app(X1, X2) -> app(X1, X2) a__from(X) -> from(X) a__zWadr(X1, X2) -> zWadr(X1, X2) a__prefix(X) -> prefix(X) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: a__app(nil, YS) -> mark(YS) a__app(cons(X, XS), YS) -> cons(mark(X), app(XS, YS)) a__from(X) -> cons(mark(X), from(s(X))) a__zWadr(nil, YS) -> nil a__zWadr(XS, nil) -> nil a__zWadr(cons(X, XS), cons(Y, YS)) -> cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS)) a__prefix(L) -> cons(nil, zWadr(L, prefix(L))) mark(app(X1, X2)) -> a__app(mark(X1), mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(zWadr(X1, X2)) -> a__zWadr(mark(X1), mark(X2)) mark(prefix(X)) -> a__prefix(mark(X)) mark(nil) -> nil mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(s(X)) -> s(mark(X)) a__app(X1, X2) -> app(X1, X2) a__from(X) -> from(X) a__zWadr(X1, X2) -> zWadr(X1, X2) a__prefix(X) -> prefix(X) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) SlicingProof (LOWER BOUND(ID)) Sliced the following arguments: cons/1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807