Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905093
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
n035.star.cs.uiowa.edu
space
Frederiksen_Glenstrup
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
292.449803114 seconds
cpu usage
889.264321059
max memory
1.517412352E10
stage attributes
key
value
output-size
51339
starexec-result
WORST_CASE(Omega(n^1), ?)
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 CpxRelTRS could be proven to be BOUNDS(n^1, INF). (0) CpxRelTRS (1) STerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 1048 ms] (2) CpxRelTRS (3) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (4) TRS for Loop Detection (5) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (6) BEST (7) proven lower bound (8) LowerBoundPropagationProof [FINISHED, 0 ms] (9) BOUNDS(n^1, INF) (10) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: eeval(Fun(n, e), ns, vs, p) -> eeval[False][Let](Fun(n, e), ns, vs, p, lookbody(n, p)) 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) eeval(Error(e11, e12), ns, vs, p) -> eeval[False][Ite](False, Error(e11, e12), ns, vs, p) eeval(F, ns, vs, p) -> F eeval(T, ns, vs, p) -> T eeval(ITE(i, t, e), ns, vs, p) -> eeval[Ite](checkConstrExp(eeval(i, ns, vs, p), T), ITE(i, t, e), ns, vs, p) eeval(Bsf(op, t1, t2), ns, vs, p) -> eeval[Let](Bsf(op, t1, t2), ns, vs, p, eeval(t1, ns, vs, p)) eeval(Var(int), ns, vs, p) -> lookvar(int, ns, vs) run(Cons(Fun(f0, e), xs), input) -> run[Let][Let](Cons(Fun(f0, e), xs), input, f0, lookbody(f0, Cons(Fun(f0, e), xs))) eqExp(Error(e11, e12), Error(e21, e22)) -> and(eqExp(e11, e21), eqExp(e12, e22)) eqExp(Error(e11, e12), F) -> False eqExp(Error(e11, e12), T) -> False eqExp(Error(e11, e12), Fun(fn2, fe2)) -> False eqExp(Error(e11, e12), Eq(eq21, eq22)) -> False eqExp(Error(e11, e12), ITE(i2, t2, e2)) -> False eqExp(Error(e11, e12), Bsf(op2, b21, b22)) -> False eqExp(Error(e11, e12), Var(v2)) -> False eqExp(F, Error(e21, e22)) -> False eqExp(F, F) -> True eqExp(F, T) -> False eqExp(F, Fun(fn2, fe2)) -> False eqExp(F, Eq(eq21, eq22)) -> False eqExp(F, ITE(i2, t2, e2)) -> False eqExp(F, Bsf(op2, b21, b22)) -> False eqExp(F, Var(v2)) -> False eqExp(T, Error(e21, e22)) -> False eqExp(T, F) -> False eqExp(T, T) -> True eqExp(T, Fun(fn2, fe2)) -> False eqExp(T, Eq(eq21, eq22)) -> False eqExp(T, ITE(i2, t2, e2)) -> False eqExp(T, Bsf(op2, b21, b22)) -> False eqExp(T, Var(v2)) -> False eqExp(Fun(fn1, fe1), Error(e21, e22)) -> False eqExp(Fun(fn1, fe1), F) -> False eqExp(Fun(fn1, fe1), T) -> False eqExp(Fun(fn1, fe1), Fun(fn2, fe2)) -> and(!EQ(fn1, fn2), eqExp(fe1, fe2)) eqExp(Fun(fn1, fe1), Eq(eq21, eq22)) -> False eqExp(Fun(fn1, fe1), ITE(i2, t2, e2)) -> False eqExp(Fun(fn1, fe1), Bsf(op2, b21, b22)) -> False eqExp(Fun(fn1, fe1), Var(v2)) -> False eqExp(Eq(eq11, eq12), Error(e21, e22)) -> False eqExp(Eq(eq11, eq12), F) -> False eqExp(Eq(eq11, eq12), T) -> False eqExp(Eq(eq11, eq12), Fun(fn2, fe2)) -> False eqExp(Eq(eq11, eq12), Eq(eq21, eq22)) -> and(eqExp(eq11, eq21), eqExp(eq12, eq22)) eqExp(Eq(eq11, eq12), ITE(i2, t2, e2)) -> False eqExp(Eq(eq11, eq12), Bsf(op2, b21, b22)) -> False eqExp(Eq(eq11, eq12), Var(v2)) -> False eqExp(ITE(i1, t1, e1), Error(e21, e22)) -> False eqExp(ITE(i1, t1, e1), F) -> False eqExp(ITE(i1, t1, e1), T) -> False eqExp(ITE(i1, t1, e1), Fun(fn2, fe2)) -> False eqExp(ITE(i1, t1, e1), Eq(eq21, eq22)) -> False eqExp(ITE(i1, t1, e1), ITE(i2, t2, e2)) -> and(eqExp(i1, i2), and(eqExp(t1, t2), eqExp(e1, e2))) eqExp(ITE(i1, t1, e1), Bsf(op2, b21, b22)) -> False eqExp(ITE(i1, t1, e1), Var(v2)) -> False eqExp(Bsf(op1, b11, b12), Error(e21, e22)) -> False eqExp(Bsf(op1, b11, b12), F) -> False eqExp(Bsf(op1, b11, b12), T) -> False eqExp(Bsf(op1, b11, b12), Fun(fn2, fe2)) -> False eqExp(Bsf(op1, b11, b12), Eq(eq21, eq22)) -> False eqExp(Bsf(op1, b11, b12), ITE(i2, t2, e2)) -> False eqExp(Bsf(o1, b11, b12), Bsf(o2, b21, b22)) -> and(True, and(eqExp(b11, b21), eqExp(b12, b22))) eqExp(Bsf(op1, b11, b12), Var(v2)) -> False
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807