Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429991124
details
property
value
status
complete
benchmark
speedFails4.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n172.star.cs.uiowa.edu
space
WTC
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
3.39832 seconds
cpu usage
6.64326
user time
6.20391
system time
0.43935
max virtual memory
1.8803964E7
max residence set size
218196.0
stage attributes
key
value
starexec-result
MAYBE
output
6.56/3.35 MAYBE 6.56/3.36 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 6.56/3.36 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 6.56/3.36 6.56/3.36 6.56/3.36 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). 6.56/3.36 6.56/3.36 (0) CpxIntTrs 6.56/3.36 (1) Loat Proof [FINISHED, 521 ms] 6.56/3.36 (2) BOUNDS(1, INF) 6.56/3.36 6.56/3.36 6.56/3.36 ---------------------------------------- 6.56/3.36 6.56/3.36 (0) 6.56/3.36 Obligation: 6.56/3.36 Complexity Int TRS consisting of the following rules: 6.56/3.36 evalspeedFails4start(A, B, C, D) -> Com_1(evalspeedFails4entryin(A, B, C, D)) :|: TRUE 6.56/3.36 evalspeedFails4entryin(A, B, C, D) -> Com_1(evalspeedFails4bb6in(1, C, A, B)) :|: A >= 1 6.56/3.36 evalspeedFails4entryin(A, B, C, D) -> Com_1(evalspeedFails4bb6in(-(1), C, A, B)) :|: 0 >= A 6.56/3.36 evalspeedFails4bb6in(A, B, C, D) -> Com_1(evalspeedFails4bb3in(A, B, C, D)) :|: B >= D 6.56/3.36 evalspeedFails4bb6in(A, B, C, D) -> Com_1(evalspeedFails4returnin(A, B, C, D)) :|: D >= B + 1 6.56/3.36 evalspeedFails4bb3in(A, B, C, D) -> Com_1(evalspeedFails4bb4in(A, B, C, D)) :|: C >= 1 6.56/3.36 evalspeedFails4bb3in(A, B, C, D) -> Com_1(evalspeedFails4bb5in(A, B, C, D)) :|: 0 >= C 6.56/3.36 evalspeedFails4bb4in(A, B, C, D) -> Com_1(evalspeedFails4bb6in(A, B, C, D + A)) :|: TRUE 6.56/3.36 evalspeedFails4bb5in(A, B, C, D) -> Com_1(evalspeedFails4bb6in(A, B, C, D - A)) :|: TRUE 6.56/3.36 evalspeedFails4returnin(A, B, C, D) -> Com_1(evalspeedFails4stop(A, B, C, D)) :|: TRUE 6.56/3.36 6.56/3.36 The start-symbols are:[evalspeedFails4start_4] 6.56/3.36 6.56/3.36 6.56/3.36 ---------------------------------------- 6.56/3.36 6.56/3.36 (1) Loat Proof (FINISHED) 6.56/3.36 6.56/3.36 6.56/3.36 ### Pre-processing the ITS problem ### 6.56/3.36 6.56/3.36 6.56/3.36 6.56/3.36 Initial linear ITS problem 6.56/3.36 6.56/3.36 Start location: evalspeedFails4start 6.56/3.36 6.56/3.36 0: evalspeedFails4start -> evalspeedFails4entryin : [], cost: 1 6.56/3.36 6.56/3.36 1: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=1, B'=C, C'=A, D'=B, [ A>=1 ], cost: 1 6.56/3.36 6.56/3.36 2: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=-1, B'=C, C'=A, D'=B, [ 0>=A ], cost: 1 6.56/3.36 6.56/3.36 3: evalspeedFails4bb6in -> evalspeedFails4bb3in : [ B>=D ], cost: 1 6.56/3.36 6.56/3.36 4: evalspeedFails4bb6in -> evalspeedFails4returnin : [ D>=1+B ], cost: 1 6.56/3.36 6.56/3.36 5: evalspeedFails4bb3in -> evalspeedFails4bb4in : [ C>=1 ], cost: 1 6.56/3.36 6.56/3.36 6: evalspeedFails4bb3in -> evalspeedFails4bb5in : [ 0>=C ], cost: 1 6.56/3.36 6.56/3.36 7: evalspeedFails4bb4in -> evalspeedFails4bb6in : D'=D+A, [], cost: 1 6.56/3.36 6.56/3.36 8: evalspeedFails4bb5in -> evalspeedFails4bb6in : D'=D-A, [], cost: 1 6.56/3.36 6.56/3.36 9: evalspeedFails4returnin -> evalspeedFails4stop : [], cost: 1 6.56/3.36 6.56/3.36 6.56/3.36 6.56/3.36 Removed unreachable and leaf rules: 6.56/3.36 6.56/3.36 Start location: evalspeedFails4start 6.56/3.36 6.56/3.36 0: evalspeedFails4start -> evalspeedFails4entryin : [], cost: 1 6.56/3.36 6.56/3.36 1: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=1, B'=C, C'=A, D'=B, [ A>=1 ], cost: 1 6.56/3.36 6.56/3.36 2: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=-1, B'=C, C'=A, D'=B, [ 0>=A ], cost: 1 6.56/3.36 6.56/3.36 3: evalspeedFails4bb6in -> evalspeedFails4bb3in : [ B>=D ], cost: 1 6.56/3.36 6.56/3.36 5: evalspeedFails4bb3in -> evalspeedFails4bb4in : [ C>=1 ], cost: 1 6.56/3.36 6.56/3.36 6: evalspeedFails4bb3in -> evalspeedFails4bb5in : [ 0>=C ], cost: 1 6.56/3.36 6.56/3.36 7: evalspeedFails4bb4in -> evalspeedFails4bb6in : D'=D+A, [], cost: 1 6.56/3.36 6.56/3.36 8: evalspeedFails4bb5in -> evalspeedFails4bb6in : D'=D-A, [], cost: 1 6.56/3.36 6.56/3.36 6.56/3.36 6.56/3.36 ### Simplification by acceleration and chaining ### 6.56/3.36 6.56/3.36 6.56/3.36 6.56/3.36 Eliminated locations (on linear paths): 6.56/3.36 6.56/3.36 Start location: evalspeedFails4start 6.56/3.36 6.56/3.36 0: evalspeedFails4start -> evalspeedFails4entryin : [], cost: 1 6.56/3.36 6.56/3.36 1: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=1, B'=C, C'=A, D'=B, [ A>=1 ], cost: 1 6.56/3.36
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_ITS 2019-03-21 04.46