Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313823
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
n099.star.cs.uiowa.edu
space
Frederiksen_Glenstrup
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
3.26342 seconds
cpu usage
8.03523
user time
7.68074
system time
0.354493
max virtual memory
1.8410936E7
max residence set size
824436.0
stage attributes
key
value
starexec-result
WORST_CASE(NON_POLY, ?)
output
7.41/2.80 WORST_CASE(NON_POLY, ?) 7.41/2.80 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 7.41/2.80 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 7.41/2.80 7.41/2.80 7.41/2.80 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(INF, INF). 7.41/2.80 7.41/2.80 (0) CpxRelTRS 7.41/2.80 (1) STerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 445 ms] 7.41/2.80 (2) CpxRelTRS 7.41/2.80 (3) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 3 ms] 7.41/2.80 (4) TRS for Loop Detection 7.41/2.80 (5) InfiniteLowerBoundProof [FINISHED, 459 ms] 7.41/2.80 (6) BOUNDS(INF, INF) 7.41/2.80 7.41/2.80 7.41/2.80 ---------------------------------------- 7.41/2.80 7.41/2.80 (0) 7.41/2.80 Obligation: 7.41/2.80 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(INF, INF). 7.41/2.80 7.41/2.80 7.41/2.80 The TRS R consists of the following rules: 7.41/2.80 7.41/2.80 head(Cons(x, xs)) -> x 7.41/2.80 factor(Cons(RPar, xs)) -> xs 7.41/2.80 factor(Cons(Div, xs)) -> xs 7.41/2.80 factor(Cons(Mul, xs)) -> xs 7.41/2.80 factor(Cons(Plus, xs)) -> xs 7.41/2.80 factor(Cons(Minus, xs)) -> xs 7.41/2.80 factor(Cons(Val(int), xs)) -> xs 7.41/2.80 factor(Cons(LPar, xs)) -> factor[Ite][True][Let](Cons(LPar, xs), expr(Cons(LPar, xs))) 7.41/2.80 member(x', Cons(x, xs)) -> member[Ite][True][Ite](eqAlph(x, x'), x', Cons(x, xs)) 7.41/2.80 member(x, Nil) -> False 7.41/2.80 atom(Cons(x, xs)) -> xs 7.41/2.80 atom(Nil) -> Nil 7.41/2.80 eqAlph(RPar, RPar) -> True 7.41/2.80 eqAlph(RPar, LPar) -> False 7.41/2.80 eqAlph(RPar, Div) -> False 7.41/2.80 eqAlph(RPar, Mul) -> False 7.41/2.80 eqAlph(RPar, Plus) -> False 7.41/2.80 eqAlph(RPar, Minus) -> False 7.41/2.80 eqAlph(RPar, Val(int2)) -> False 7.41/2.80 eqAlph(LPar, RPar) -> False 7.41/2.80 eqAlph(LPar, LPar) -> True 7.41/2.80 eqAlph(LPar, Div) -> False 7.41/2.80 eqAlph(LPar, Mul) -> False 7.41/2.80 eqAlph(LPar, Plus) -> False 7.41/2.80 eqAlph(LPar, Minus) -> False 7.41/2.80 eqAlph(LPar, Val(int2)) -> False 7.41/2.80 eqAlph(Div, RPar) -> False 7.41/2.80 eqAlph(Div, LPar) -> False 7.41/2.80 eqAlph(Div, Div) -> True 7.41/2.80 eqAlph(Div, Mul) -> False 7.41/2.80 eqAlph(Div, Plus) -> False 7.41/2.80 eqAlph(Div, Minus) -> False 7.41/2.80 eqAlph(Div, Val(int2)) -> False 7.41/2.80 eqAlph(Mul, RPar) -> False 7.41/2.80 eqAlph(Mul, LPar) -> False 7.41/2.80 eqAlph(Mul, Div) -> False 7.41/2.80 eqAlph(Mul, Mul) -> True 7.41/2.80 eqAlph(Mul, Plus) -> False 7.41/2.80 eqAlph(Mul, Minus) -> False 7.41/2.80 eqAlph(Mul, Val(int2)) -> False 7.41/2.80 eqAlph(Plus, RPar) -> False 7.41/2.80 eqAlph(Plus, LPar) -> False 7.41/2.80 eqAlph(Plus, Div) -> False 7.41/2.80 eqAlph(Plus, Mul) -> False 7.41/2.80 eqAlph(Plus, Plus) -> True 7.41/2.80 eqAlph(Plus, Minus) -> False 7.41/2.80 eqAlph(Plus, Val(int2)) -> False 7.41/2.80 eqAlph(Minus, RPar) -> False 7.41/2.80 eqAlph(Minus, LPar) -> False 7.41/2.80 eqAlph(Minus, Div) -> False 7.41/2.80 eqAlph(Minus, Mul) -> False 7.41/2.80 eqAlph(Minus, Plus) -> False 7.41/2.80 eqAlph(Minus, Minus) -> True 7.41/2.80 eqAlph(Minus, Val(int2)) -> False 7.41/2.80 eqAlph(Val(int), RPar) -> False 7.41/2.80 eqAlph(Val(int), LPar) -> False 7.41/2.80 eqAlph(Val(int), Div) -> False 7.41/2.80 eqAlph(Val(int), Mul) -> False 7.41/2.80 eqAlph(Val(int), Plus) -> False 7.41/2.80 eqAlph(Val(int), Minus) -> False 7.41/2.80 eqAlph(Val(int), Val(int2)) -> !EQ(int2, int) 7.41/2.80 notEmpty(Cons(x, xs)) -> True 7.41/2.80 notEmpty(Nil) -> False 7.41/2.80 term(xs) -> term[Let](xs, factor(xs)) 7.41/2.80 parsexp(xs) -> expr(xs) 7.41/2.80 expr(xs) -> expr[Let](xs, term(xs)) 7.41/2.80 7.41/2.80 The (relative) TRS S consists of the following rules: 7.41/2.80 7.41/2.80 and(False, False) -> False 7.41/2.80 and(True, False) -> False 7.41/2.80 and(False, True) -> False 7.41/2.80 and(True, True) -> True 7.41/2.80 !EQ(S(x), S(y)) -> !EQ(x, y) 7.41/2.80 !EQ(0, S(y)) -> 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
