Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313831
details
property
value
status
complete
benchmark
int.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n172.star.cs.uiowa.edu
space
Frederiksen_Glenstrup
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
292.917 seconds
cpu usage
896.272
user time
888.945
system time
7.32638
max virtual memory
3.7723928E7
max residence set size
1.474642E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
891.35/291.62 WORST_CASE(Omega(n^1), ?) 896.04/292.83 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 896.04/292.83 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 896.04/292.83 896.04/292.83 896.04/292.83 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). 896.04/292.83 896.04/292.83 (0) CpxRelTRS 896.04/292.83 (1) STerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 1008 ms] 896.04/292.83 (2) CpxRelTRS 896.04/292.83 (3) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 896.04/292.83 (4) TRS for Loop Detection 896.04/292.83 (5) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 896.04/292.83 (6) BEST 896.04/292.83 (7) proven lower bound 896.04/292.83 (8) LowerBoundPropagationProof [FINISHED, 0 ms] 896.04/292.83 (9) BOUNDS(n^1, INF) 896.04/292.83 (10) TRS for Loop Detection 896.04/292.83 896.04/292.83 896.04/292.83 ---------------------------------------- 896.04/292.83 896.04/292.83 (0) 896.04/292.83 Obligation: 896.04/292.83 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). 896.04/292.83 896.04/292.83 896.04/292.83 The TRS R consists of the following rules: 896.04/292.83 896.04/292.83 eeval(Fun(n, e), ns, vs, p) -> eeval[False][Let](Fun(n, e), ns, vs, p, lookbody(n, p)) 896.04/292.83 eeval(Eq(f, s), ns, vs, p) -> eeval[True][Ite](eqExp(eeval(f, ns, vs, p), eeval(s, ns, vs, p)), Eq(f, s), ns, vs, p) 896.04/292.83 eeval(Error(e11, e12), ns, vs, p) -> eeval[False][Ite](False, Error(e11, e12), ns, vs, p) 896.04/292.83 eeval(F, ns, vs, p) -> F 896.04/292.83 eeval(T, ns, vs, p) -> T 896.04/292.83 eeval(ITE(i, t, e), ns, vs, p) -> eeval[Ite](checkConstrExp(eeval(i, ns, vs, p), T), ITE(i, t, e), ns, vs, p) 896.04/292.83 eeval(Bsf(op, t1, t2), ns, vs, p) -> eeval[Let](Bsf(op, t1, t2), ns, vs, p, eeval(t1, ns, vs, p)) 896.04/292.83 eeval(Var(int), ns, vs, p) -> lookvar(int, ns, vs) 896.04/292.83 run(Cons(Fun(f0, e), xs), input) -> run[Let][Let](Cons(Fun(f0, e), xs), input, f0, lookbody(f0, Cons(Fun(f0, e), xs))) 896.04/292.83 eqExp(Error(e11, e12), Error(e21, e22)) -> and(eqExp(e11, e21), eqExp(e12, e22)) 896.04/292.83 eqExp(Error(e11, e12), F) -> False 896.04/292.83 eqExp(Error(e11, e12), T) -> False 896.04/292.83 eqExp(Error(e11, e12), Fun(fn2, fe2)) -> False 896.04/292.83 eqExp(Error(e11, e12), Eq(eq21, eq22)) -> False 896.04/292.83 eqExp(Error(e11, e12), ITE(i2, t2, e2)) -> False 896.04/292.83 eqExp(Error(e11, e12), Bsf(op2, b21, b22)) -> False 896.04/292.83 eqExp(Error(e11, e12), Var(v2)) -> False 896.04/292.83 eqExp(F, Error(e21, e22)) -> False 896.04/292.83 eqExp(F, F) -> True 896.04/292.83 eqExp(F, T) -> False 896.04/292.83 eqExp(F, Fun(fn2, fe2)) -> False 896.04/292.83 eqExp(F, Eq(eq21, eq22)) -> False 896.04/292.83 eqExp(F, ITE(i2, t2, e2)) -> False 896.04/292.83 eqExp(F, Bsf(op2, b21, b22)) -> False 896.04/292.83 eqExp(F, Var(v2)) -> False 896.04/292.83 eqExp(T, Error(e21, e22)) -> False 896.04/292.83 eqExp(T, F) -> False 896.04/292.83 eqExp(T, T) -> True 896.04/292.83 eqExp(T, Fun(fn2, fe2)) -> False 896.04/292.83 eqExp(T, Eq(eq21, eq22)) -> False 896.04/292.83 eqExp(T, ITE(i2, t2, e2)) -> False 896.04/292.83 eqExp(T, Bsf(op2, b21, b22)) -> False 896.04/292.83 eqExp(T, Var(v2)) -> False 896.04/292.83 eqExp(Fun(fn1, fe1), Error(e21, e22)) -> False 896.04/292.83 eqExp(Fun(fn1, fe1), F) -> False 896.04/292.83 eqExp(Fun(fn1, fe1), T) -> False 896.04/292.83 eqExp(Fun(fn1, fe1), Fun(fn2, fe2)) -> and(!EQ(fn1, fn2), eqExp(fe1, fe2)) 896.04/292.83 eqExp(Fun(fn1, fe1), Eq(eq21, eq22)) -> False 896.04/292.83 eqExp(Fun(fn1, fe1), ITE(i2, t2, e2)) -> False 896.04/292.83 eqExp(Fun(fn1, fe1), Bsf(op2, b21, b22)) -> False 896.04/292.83 eqExp(Fun(fn1, fe1), Var(v2)) -> False 896.04/292.83 eqExp(Eq(eq11, eq12), Error(e21, e22)) -> False 896.04/292.83 eqExp(Eq(eq11, eq12), F) -> False 896.04/292.83 eqExp(Eq(eq11, eq12), T) -> False 896.04/292.83 eqExp(Eq(eq11, eq12), Fun(fn2, fe2)) -> False 896.04/292.83 eqExp(Eq(eq11, eq12), Eq(eq21, eq22)) -> and(eqExp(eq11, eq21), eqExp(eq12, eq22)) 896.04/292.83 eqExp(Eq(eq11, eq12), ITE(i2, t2, e2)) -> False 896.04/292.83 eqExp(Eq(eq11, eq12), Bsf(op2, b21, b22)) -> False 896.04/292.83 eqExp(Eq(eq11, eq12), Var(v2)) -> False 896.04/292.83 eqExp(ITE(i1, t1, e1), Error(e21, e22)) -> False 896.04/292.83 eqExp(ITE(i1, t1, e1), F) -> False 896.04/292.83 eqExp(ITE(i1, t1, e1), T) -> False 896.04/292.83 eqExp(ITE(i1, t1, e1), Fun(fn2, fe2)) -> False 896.04/292.83 eqExp(ITE(i1, t1, e1), Eq(eq21, eq22)) -> False 896.04/292.83 eqExp(ITE(i1, t1, e1), ITE(i2, t2, e2)) -> and(eqExp(i1, i2), and(eqExp(t1, t2), eqExp(e1, e2))) 896.04/292.83 eqExp(ITE(i1, t1, e1), Bsf(op2, b21, b22)) -> False 896.04/292.83 eqExp(ITE(i1, t1, e1), Var(v2)) -> False 896.04/292.83 eqExp(Bsf(op1, b11, b12), Error(e21, e22)) -> False 896.04/292.83 eqExp(Bsf(op1, b11, b12), F) -> False 896.04/292.83 eqExp(Bsf(op1, b11, b12), T) -> False 896.04/292.83 eqExp(Bsf(op1, b11, b12), Fun(fn2, fe2)) -> False 896.04/292.83 eqExp(Bsf(op1, b11, b12), Eq(eq21, eq22)) -> False 896.04/292.83 eqExp(Bsf(op1, b11, b12), ITE(i2, t2, e2)) -> False 896.04/292.83 eqExp(Bsf(o1, b11, b12), Bsf(o2, b21, b22)) -> and(True, and(eqExp(b11, b21), eqExp(b12, b22))) 896.04/292.83 eqExp(Bsf(op1, b11, b12), Var(v2)) -> False 896.04/292.83 eqExp(Var(v1), Error(e21, e22)) -> False 896.04/292.83 eqExp(Var(v1), F) -> False 896.04/292.83 eqExp(Var(v1), T) -> False 896.04/292.83 eqExp(Var(v1), Fun(fn2, fe2)) -> False 896.04/292.83 eqExp(Var(v1), Eq(eq21, eq22)) -> False 896.04/292.83 eqExp(Var(v1), ITE(i2, t2, e2)) -> False
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40