Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990054
details
property
value
status
complete
benchmark
afagx1.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n175.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.07908 seconds
cpu usage
4.22725
user time
3.95897
system time
0.268275
max virtual memory
1.8689884E7
max residence set size
214756.0
stage attributes
key
value
starexec-result
WORST_CASE(NON_POLY, ?)
output
4.08/2.05 WORST_CASE(NON_POLY, ?) 4.08/2.06 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 4.08/2.06 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.08/2.06 4.08/2.06 4.08/2.06 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 4.08/2.06 4.08/2.06 (0) CpxIntTrs 4.08/2.06 (1) Loat Proof [FINISHED, 417 ms] 4.08/2.06 (2) BOUNDS(INF, INF) 4.08/2.06 4.08/2.06 4.08/2.06 ---------------------------------------- 4.08/2.06 4.08/2.06 (0) 4.08/2.06 Obligation: 4.08/2.06 Complexity Int TRS consisting of the following rules: 4.08/2.06 f7(A, B) -> Com_1(f7(C, B)) :|: 0 >= A + 1 4.08/2.06 f7(A, B) -> Com_1(f7(C, B)) :|: A >= 1 4.08/2.06 f13(A, B) -> Com_1(f13(A, B)) :|: TRUE 4.08/2.06 f15(A, B) -> Com_1(f17(A, B)) :|: TRUE 4.08/2.06 f7(A, B) -> Com_1(f13(0, 1)) :|: A >= 0 && A <= 0 4.08/2.06 f0(A, B) -> Com_1(f7(C, 1)) :|: TRUE 4.08/2.06 4.08/2.06 The start-symbols are:[f0_2] 4.08/2.06 4.08/2.06 4.08/2.06 ---------------------------------------- 4.08/2.06 4.08/2.06 (1) Loat Proof (FINISHED) 4.08/2.06 4.08/2.06 4.08/2.06 ### Pre-processing the ITS problem ### 4.08/2.06 4.08/2.06 4.08/2.06 4.08/2.06 Initial linear ITS problem 4.08/2.06 4.08/2.06 Start location: f0 4.08/2.06 4.08/2.06 0: f7 -> f7 : A'=free, [ 0>=1+A ], cost: 1 4.08/2.06 4.08/2.06 1: f7 -> f7 : A'=free_1, [ A>=1 ], cost: 1 4.08/2.06 4.08/2.06 4: f7 -> f13 : A'=0, B'=1, [ A==0 ], cost: 1 4.08/2.06 4.08/2.06 2: f13 -> f13 : [], cost: 1 4.08/2.06 4.08/2.06 3: f15 -> f17 : [], cost: 1 4.08/2.06 4.08/2.06 5: f0 -> f7 : A'=free_2, B'=1, [], cost: 1 4.08/2.06 4.08/2.06 4.08/2.06 4.08/2.06 Removed unreachable and leaf rules: 4.08/2.06 4.08/2.06 Start location: f0 4.08/2.06 4.08/2.06 0: f7 -> f7 : A'=free, [ 0>=1+A ], cost: 1 4.08/2.06 4.08/2.06 1: f7 -> f7 : A'=free_1, [ A>=1 ], cost: 1 4.08/2.06 4.08/2.06 4: f7 -> f13 : A'=0, B'=1, [ A==0 ], cost: 1 4.08/2.06 4.08/2.06 2: f13 -> f13 : [], cost: 1 4.08/2.06 4.08/2.06 5: f0 -> f7 : A'=free_2, B'=1, [], cost: 1 4.08/2.06 4.08/2.06 4.08/2.06 4.08/2.06 ### Simplification by acceleration and chaining ### 4.08/2.06 4.08/2.06 4.08/2.06 4.08/2.06 Accelerating simple loops of location 0. 4.08/2.06 4.08/2.06 Accelerating the following rules: 4.08/2.06 4.08/2.06 0: f7 -> f7 : A'=free, [ 0>=1+A ], cost: 1 4.08/2.06 4.08/2.06 1: f7 -> f7 : A'=free_1, [ A>=1 ], cost: 1 4.08/2.06 4.08/2.06 4.08/2.06 4.08/2.06 Accelerated rule 0 with NONTERM (after strengthening guard), yielding the new rule 6. 4.08/2.06 4.08/2.06 Accelerated rule 1 with NONTERM (after strengthening guard), yielding the new rule 7. 4.08/2.06 4.08/2.06 Removing the simple loops:. 4.08/2.06 4.08/2.06 4.08/2.06 4.08/2.06 Accelerating simple loops of location 1. 4.08/2.06 4.08/2.06 Accelerating the following rules: 4.08/2.06 4.08/2.06 2: f13 -> f13 : [], cost: 1 4.08/2.06 4.08/2.06 4.08/2.06
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