Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307627
details
property
value
status
complete
benchmark
filliatre.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
CiME_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.631 seconds
cpu usage
1130.93
user time
1117.29
system time
13.6404
max virtual memory
5.600626E7
max residence set size
1.4849568E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
1130.37/291.50 WORST_CASE(Omega(n^1), ?) 1130.73/291.54 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 1130.73/291.54 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1130.73/291.54 1130.73/291.54 1130.73/291.54 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1130.73/291.54 1130.73/291.54 (0) CpxTRS 1130.73/291.54 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 1130.73/291.54 (2) CpxTRS 1130.73/291.54 (3) SlicingProof [LOWER BOUND(ID), 0 ms] 1130.73/291.54 (4) CpxTRS 1130.73/291.54 (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1130.73/291.54 (6) typed CpxTrs 1130.73/291.54 (7) OrderProof [LOWER BOUND(ID), 0 ms] 1130.73/291.54 (8) typed CpxTrs 1130.73/291.54 (9) RewriteLemmaProof [LOWER BOUND(ID), 354 ms] 1130.73/291.54 (10) BEST 1130.73/291.54 (11) proven lower bound 1130.73/291.54 (12) LowerBoundPropagationProof [FINISHED, 0 ms] 1130.73/291.54 (13) BOUNDS(n^1, INF) 1130.73/291.54 (14) typed CpxTrs 1130.73/291.54 1130.73/291.54 1130.73/291.54 ---------------------------------------- 1130.73/291.54 1130.73/291.54 (0) 1130.73/291.54 Obligation: 1130.73/291.54 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1130.73/291.54 1130.73/291.54 1130.73/291.54 The TRS R consists of the following rules: 1130.73/291.54 1130.73/291.54 g(A) -> A 1130.73/291.54 g(B) -> A 1130.73/291.54 g(B) -> B 1130.73/291.54 g(C) -> A 1130.73/291.54 g(C) -> B 1130.73/291.54 g(C) -> C 1130.73/291.54 foldf(x, nil) -> x 1130.73/291.54 foldf(x, cons(y, z)) -> f(foldf(x, z), y) 1130.73/291.54 f(t, x) -> f'(t, g(x)) 1130.73/291.54 f'(triple(a, b, c), C) -> triple(a, b, cons(C, c)) 1130.73/291.54 f'(triple(a, b, c), B) -> f(triple(a, b, c), A) 1130.73/291.54 f'(triple(a, b, c), A) -> f''(foldf(triple(cons(A, a), nil, c), b)) 1130.73/291.54 f''(triple(a, b, c)) -> foldf(triple(a, b, nil), c) 1130.73/291.54 1130.73/291.54 S is empty. 1130.73/291.54 Rewrite Strategy: FULL 1130.73/291.54 ---------------------------------------- 1130.73/291.54 1130.73/291.54 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 1130.73/291.54 Renamed function symbols to avoid clashes with predefined symbol. 1130.73/291.54 ---------------------------------------- 1130.73/291.54 1130.73/291.54 (2) 1130.73/291.54 Obligation: 1130.73/291.54 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1130.73/291.54 1130.73/291.54 1130.73/291.54 The TRS R consists of the following rules: 1130.73/291.54 1130.73/291.54 g(A) -> A 1130.73/291.54 g(B) -> A 1130.73/291.54 g(B) -> B 1130.73/291.54 g(C) -> A 1130.73/291.54 g(C) -> B 1130.73/291.54 g(C) -> C 1130.73/291.54 foldf(x, nil) -> x 1130.73/291.54 foldf(x, cons(y, z)) -> f(foldf(x, z), y) 1130.73/291.54 f(t, x) -> f'(t, g(x)) 1130.73/291.54 f'(triple(a, b, c), C) -> triple(a, b, cons(C, c)) 1130.73/291.54 f'(triple(a, b, c), B) -> f(triple(a, b, c), A) 1130.73/291.54 f'(triple(a, b, c), A) -> f''(foldf(triple(cons(A, a), nil, c), b)) 1130.73/291.54 f''(triple(a, b, c)) -> foldf(triple(a, b, nil), c) 1130.73/291.54 1130.73/291.54 S is empty. 1130.73/291.54 Rewrite Strategy: FULL 1130.73/291.54 ---------------------------------------- 1130.73/291.54 1130.73/291.54 (3) SlicingProof (LOWER BOUND(ID)) 1130.73/291.54 Sliced the following arguments: 1130.73/291.54 triple/0 1130.73/291.54 1130.73/291.54 ---------------------------------------- 1130.73/291.54 1130.73/291.54 (4) 1130.73/291.54 Obligation: 1130.73/291.54 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1130.73/291.54 1130.73/291.54 1130.73/291.54 The TRS R consists of the following rules: 1130.73/291.54 1130.73/291.54 g(A) -> A 1130.73/291.54 g(B) -> A 1130.73/291.54 g(B) -> B 1130.73/291.54 g(C) -> A 1130.73/291.54 g(C) -> B 1130.73/291.54 g(C) -> C 1130.73/291.54 foldf(x, nil) -> x
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Full_Rewriting 2019-04-01 06.11
