Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905029
details
property
value
status
complete
benchmark
parsexp.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
Frederiksen_Glenstrup
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
3.21079897881 seconds
cpu usage
8.270985538
max memory
7.26458368E8
stage attributes
key
value
output-size
13607
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 (innermost) of the given CpxRelTRS could be proven to be BOUNDS(INF, INF). (0) CpxRelTRS (1) STerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 504 ms] (2) CpxRelTRS (3) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (4) TRS for Loop Detection (5) InfiniteLowerBoundProof [FINISHED, 442 ms] (6) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: head(Cons(x, xs)) -> x factor(Cons(RPar, xs)) -> xs factor(Cons(Div, xs)) -> xs factor(Cons(Mul, xs)) -> xs factor(Cons(Plus, xs)) -> xs factor(Cons(Minus, xs)) -> xs factor(Cons(Val(int), xs)) -> xs factor(Cons(LPar, xs)) -> factor[Ite][True][Let](Cons(LPar, xs), expr(Cons(LPar, xs))) member(x', Cons(x, xs)) -> member[Ite][True][Ite](eqAlph(x, x'), x', Cons(x, xs)) member(x, Nil) -> False atom(Cons(x, xs)) -> xs atom(Nil) -> Nil eqAlph(RPar, RPar) -> True eqAlph(RPar, LPar) -> False eqAlph(RPar, Div) -> False eqAlph(RPar, Mul) -> False eqAlph(RPar, Plus) -> False eqAlph(RPar, Minus) -> False eqAlph(RPar, Val(int2)) -> False eqAlph(LPar, RPar) -> False eqAlph(LPar, LPar) -> True eqAlph(LPar, Div) -> False eqAlph(LPar, Mul) -> False eqAlph(LPar, Plus) -> False eqAlph(LPar, Minus) -> False eqAlph(LPar, Val(int2)) -> False eqAlph(Div, RPar) -> False eqAlph(Div, LPar) -> False eqAlph(Div, Div) -> True eqAlph(Div, Mul) -> False eqAlph(Div, Plus) -> False eqAlph(Div, Minus) -> False eqAlph(Div, Val(int2)) -> False eqAlph(Mul, RPar) -> False eqAlph(Mul, LPar) -> False eqAlph(Mul, Div) -> False eqAlph(Mul, Mul) -> True eqAlph(Mul, Plus) -> False eqAlph(Mul, Minus) -> False eqAlph(Mul, Val(int2)) -> False eqAlph(Plus, RPar) -> False eqAlph(Plus, LPar) -> False eqAlph(Plus, Div) -> False eqAlph(Plus, Mul) -> False eqAlph(Plus, Plus) -> True eqAlph(Plus, Minus) -> False eqAlph(Plus, Val(int2)) -> False eqAlph(Minus, RPar) -> False eqAlph(Minus, LPar) -> False eqAlph(Minus, Div) -> False eqAlph(Minus, Mul) -> False eqAlph(Minus, Plus) -> False eqAlph(Minus, Minus) -> True eqAlph(Minus, Val(int2)) -> False eqAlph(Val(int), RPar) -> False eqAlph(Val(int), LPar) -> False eqAlph(Val(int), Div) -> False eqAlph(Val(int), Mul) -> False eqAlph(Val(int), Plus) -> False eqAlph(Val(int), Minus) -> False eqAlph(Val(int), Val(int2)) -> !EQ(int2, int) notEmpty(Cons(x, xs)) -> True notEmpty(Nil) -> False term(xs) -> term[Let](xs, factor(xs)) parsexp(xs) -> expr(xs) expr(xs) -> expr[Let](xs, term(xs)) The (relative) TRS S consists of the following rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807