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