Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime Complexity: TRS pair #487111304
details
property
value
status
complete
benchmark
#3.36.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n139.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.604 seconds
cpu usage
314.022
user time
312.295
system time
1.72661
max virtual memory
1.8282288E7
max residence set size
5110092.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity (full) 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), 273 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 1226 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 2182 ms] (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 2356 ms] (18) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: minus(x, 0) -> x minus(s(x), s(y)) -> minus(x, y) f(0) -> s(0) f(s(x)) -> minus(s(x), g(f(x))) g(0) -> 0 g(s(x)) -> minus(s(x), f(g(x))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: minus(x, 0') -> x minus(s(x), s(y)) -> minus(x, y) f(0') -> s(0') f(s(x)) -> minus(s(x), g(f(x))) g(0') -> 0' g(s(x)) -> minus(s(x), f(g(x))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: minus(x, 0') -> x minus(s(x), s(y)) -> minus(x, y) f(0') -> s(0') f(s(x)) -> minus(s(x), g(f(x))) g(0') -> 0' g(s(x)) -> minus(s(x), f(g(x))) Types: minus :: 0':s -> 0':s -> 0':s 0' :: 0':s s :: 0':s -> 0':s f :: 0':s -> 0':s g :: 0':s -> 0':s hole_0':s1_0 :: 0':s gen_0':s2_0 :: Nat -> 0':s ---------------------------------------- (5) OrderProof (LOWER BOUND(ID)) Heuristically decided to analyse the following defined symbols: minus, f, g
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime Complexity: TRS