Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313871
details
property
value
status
complete
benchmark
assrewriteSize.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n164.star.cs.uiowa.edu
space
Frederiksen_Others
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.576 seconds
cpu usage
344.915
user time
342.268
system time
2.64676
max virtual memory
3.6979504E7
max residence set size
5414164.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
344.77/291.52 WORST_CASE(Omega(n^1), ?) 344.77/291.53 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 344.77/291.53 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 344.77/291.53 344.77/291.53 344.77/291.53 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). 344.77/291.53 344.77/291.53 (0) CpxRelTRS 344.77/291.53 (1) STerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 254 ms] 344.77/291.53 (2) CpxRelTRS 344.77/291.53 (3) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 344.77/291.53 (4) CpxRelTRS 344.77/291.53 (5) SlicingProof [LOWER BOUND(ID), 0 ms] 344.77/291.53 (6) CpxRelTRS 344.77/291.53 (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 344.77/291.53 (8) typed CpxTrs 344.77/291.53 (9) OrderProof [LOWER BOUND(ID), 0 ms] 344.77/291.53 (10) typed CpxTrs 344.77/291.53 (11) RewriteLemmaProof [LOWER BOUND(ID), 228 ms] 344.77/291.53 (12) BEST 344.77/291.53 (13) proven lower bound 344.77/291.53 (14) LowerBoundPropagationProof [FINISHED, 0 ms] 344.77/291.53 (15) BOUNDS(n^1, INF) 344.77/291.53 (16) typed CpxTrs 344.77/291.53 344.77/291.53 344.77/291.53 ---------------------------------------- 344.77/291.53 344.77/291.53 (0) 344.77/291.53 Obligation: 344.77/291.53 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). 344.77/291.53 344.77/291.53 344.77/291.53 The TRS R consists of the following rules: 344.77/291.53 344.77/291.53 rw(Val(n), c) -> Op(Val(n), rewrite(c)) 344.77/291.53 rewrite(Op(x, y)) -> rw(x, y) 344.77/291.53 rw(Op(x, y), c) -> rw[Let](Op(x, y), c, rewrite(x)) 344.77/291.53 rewrite(Val(n)) -> Val(n) 344.77/291.53 second(Op(x, y)) -> y 344.77/291.53 isOp(Val(n)) -> False 344.77/291.53 isOp(Op(x, y)) -> True 344.77/291.53 first(Val(n)) -> Val(n) 344.77/291.53 first(Op(x, y)) -> x 344.77/291.53 assrewrite(exp) -> rewrite(exp) 344.77/291.53 344.77/291.53 The (relative) TRS S consists of the following rules: 344.77/291.53 344.77/291.53 rw[Let](Op(x, y), c, a1) -> rw[Let][Let](Op(x, y), c, a1, rewrite(y)) 344.77/291.53 rw[Let][Let](ab, c, a1, b1) -> rw[Let][Let][Let](c, a1, b1, rewrite(c)) 344.77/291.53 rw[Let][Let][Let](c, a1, b1, c1) -> rw(a1, Op(b1, c1)) 344.77/291.53 344.77/291.53 Rewrite Strategy: INNERMOST 344.77/291.53 ---------------------------------------- 344.77/291.53 344.77/291.53 (1) STerminationProof (BOTH CONCRETE BOUNDS(ID, ID)) 344.77/291.53 proved termination of relative rules 344.77/291.53 ---------------------------------------- 344.77/291.53 344.77/291.53 (2) 344.77/291.53 Obligation: 344.77/291.53 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). 344.77/291.53 344.77/291.53 344.77/291.53 The TRS R consists of the following rules: 344.77/291.53 344.77/291.53 rw(Val(n), c) -> Op(Val(n), rewrite(c)) 344.77/291.53 rewrite(Op(x, y)) -> rw(x, y) 344.77/291.53 rw(Op(x, y), c) -> rw[Let](Op(x, y), c, rewrite(x)) 344.77/291.53 rewrite(Val(n)) -> Val(n) 344.77/291.53 second(Op(x, y)) -> y 344.77/291.53 isOp(Val(n)) -> False 344.77/291.53 isOp(Op(x, y)) -> True 344.77/291.53 first(Val(n)) -> Val(n) 344.77/291.53 first(Op(x, y)) -> x 344.77/291.53 assrewrite(exp) -> rewrite(exp) 344.77/291.53 344.77/291.53 The (relative) TRS S consists of the following rules: 344.77/291.53 344.77/291.53 rw[Let](Op(x, y), c, a1) -> rw[Let][Let](Op(x, y), c, a1, rewrite(y)) 344.77/291.53 rw[Let][Let](ab, c, a1, b1) -> rw[Let][Let][Let](c, a1, b1, rewrite(c)) 344.77/291.53 rw[Let][Let][Let](c, a1, b1, c1) -> rw(a1, Op(b1, c1)) 344.77/291.53 344.77/291.53 Rewrite Strategy: INNERMOST 344.77/291.53 ---------------------------------------- 344.77/291.53 344.77/291.53 (3) RenamingProof (BOTH BOUNDS(ID, ID)) 344.77/291.53 Renamed function symbols to avoid clashes with predefined symbol. 344.77/291.53 ---------------------------------------- 344.77/291.53 344.77/291.53 (4) 344.77/291.53 Obligation: 344.77/291.53 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). 344.77/291.53 344.77/291.53 344.77/291.53 The TRS R consists of the following rules: 344.77/291.53 344.77/291.53 rw(Val(n), c) -> Op(Val(n), rewrite(c)) 344.77/291.53 rewrite(Op(x, y)) -> rw(x, y) 344.77/291.53 rw(Op(x, y), c) -> rw[Let](Op(x, y), c, rewrite(x))
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