details

property	value
status	timeout (wallclock)
benchmark	ma96.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	Rubio_04

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	301.006999969 seconds
cpu usage	688.129602379
max memory	1.515808768E10

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) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) typed CpxTrs (5) OrderProof [LOWER BOUND(ID), 0 ms] (6) typed CpxTrs (7) RewriteLemmaProof [LOWER BOUND(ID), 6053 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) 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: and(false, false) -> false and(true, false) -> false and(false, true) -> false and(true, true) -> true eq(nil, nil) -> true eq(cons(T, L), nil) -> false eq(nil, cons(T, L)) -> false eq(cons(T, L), cons(Tp, Lp)) -> and(eq(T, Tp), eq(L, Lp)) eq(var(L), var(Lp)) -> eq(L, Lp) eq(var(L), apply(T, S)) -> false eq(var(L), lambda(X, T)) -> false eq(apply(T, S), var(L)) -> false eq(apply(T, S), apply(Tp, Sp)) -> and(eq(T, Tp), eq(S, Sp)) eq(apply(T, S), lambda(X, Tp)) -> false eq(lambda(X, T), var(L)) -> false eq(lambda(X, T), apply(Tp, Sp)) -> false eq(lambda(X, T), lambda(Xp, Tp)) -> and(eq(T, Tp), eq(X, Xp)) if(true, var(K), var(L)) -> var(K) if(false, var(K), var(L)) -> var(L) ren(var(L), var(K), var(Lp)) -> if(eq(L, Lp), var(K), var(Lp)) ren(X, Y, apply(T, S)) -> apply(ren(X, Y, T), ren(X, Y, S)) ren(X, Y, lambda(Z, T)) -> lambda(var(cons(X, cons(Y, cons(lambda(Z, T), nil)))), ren(X, Y, ren(Z, var(cons(X, cons(Y, cons(lambda(Z, T), nil)))), T))) 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: and(false, false) -> false and(true, false) -> false and(false, true) -> false and(true, true) -> true eq(nil, nil) -> true eq(cons(T, L), nil) -> false eq(nil, cons(T, L)) -> false eq(cons(T, L), cons(Tp, Lp)) -> and(eq(T, Tp), eq(L, Lp)) eq(var(L), var(Lp)) -> eq(L, Lp) eq(var(L), apply(T, S)) -> false eq(var(L), lambda(X, T)) -> false eq(apply(T, S), var(L)) -> false eq(apply(T, S), apply(Tp, Sp)) -> and(eq(T, Tp), eq(S, Sp)) eq(apply(T, S), lambda(X, Tp)) -> false eq(lambda(X, T), var(L)) -> false eq(lambda(X, T), apply(Tp, Sp)) -> false eq(lambda(X, T), lambda(Xp, Tp)) -> and(eq(T, Tp), eq(X, Xp)) if(true, var(K), var(L)) -> var(K) if(false, var(K), var(L)) -> var(L) ren(var(L), var(K), var(Lp)) -> if(eq(L, Lp), var(K), var(Lp)) ren(X, Y, apply(T, S)) -> apply(ren(X, Y, T), ren(X, Y, S)) ren(X, Y, lambda(Z, T)) -> lambda(var(cons(X, cons(Y, cons(lambda(Z, T), nil)))), ren(X, Y, ren(Z, var(cons(X, cons(Y, cons(lambda(Z, T), nil)))), T))) S is empty. Rewrite Strategy: INNERMOST popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807