Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313818
details
property
value
status
complete
benchmark
subsets.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
Frederiksen_Glenstrup
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.577 seconds
cpu usage
1135.06
user time
1128.25
system time
6.80546
max virtual memory
3.7906172E7
max residence set size
9215296.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
1134.87/291.50 WORST_CASE(Omega(n^1), ?) 1134.87/291.51 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 1134.87/291.51 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1134.87/291.51 1134.87/291.51 1134.87/291.51 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). 1134.87/291.51 1134.87/291.51 (0) CpxRelTRS 1134.87/291.51 (1) STerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 146 ms] 1134.87/291.51 (2) CpxRelTRS 1134.87/291.51 (3) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 1134.87/291.51 (4) CpxRelTRS 1134.87/291.51 (5) SlicingProof [LOWER BOUND(ID), 0 ms] 1134.87/291.51 (6) CpxRelTRS 1134.87/291.51 (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1134.87/291.51 (8) typed CpxTrs 1134.87/291.51 (9) OrderProof [LOWER BOUND(ID), 0 ms] 1134.87/291.51 (10) typed CpxTrs 1134.87/291.51 (11) RewriteLemmaProof [LOWER BOUND(ID), 1411 ms] 1134.87/291.51 (12) BEST 1134.87/291.51 (13) proven lower bound 1134.87/291.51 (14) LowerBoundPropagationProof [FINISHED, 0 ms] 1134.87/291.51 (15) BOUNDS(n^1, INF) 1134.87/291.51 (16) typed CpxTrs 1134.87/291.51 (17) RewriteLemmaProof [LOWER BOUND(ID), 0 ms] 1134.87/291.51 (18) BOUNDS(1, INF) 1134.87/291.51 1134.87/291.51 1134.87/291.51 ---------------------------------------- 1134.87/291.51 1134.87/291.51 (0) 1134.87/291.51 Obligation: 1134.87/291.51 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). 1134.87/291.51 1134.87/291.51 1134.87/291.51 The TRS R consists of the following rules: 1134.87/291.51 1134.87/291.51 subsets(Cons(x, xs)) -> subsets[Ite][True][Let](Cons(x, xs), subsets(xs)) 1134.87/291.51 subsets(Nil) -> Cons(Nil, Nil) 1134.87/291.51 mapconsapp(x', Cons(x, xs), rest) -> Cons(Cons(x', x), mapconsapp(x', xs, rest)) 1134.87/291.51 mapconsapp(x, Nil, rest) -> rest 1134.87/291.51 notEmpty(Cons(x, xs)) -> True 1134.87/291.51 notEmpty(Nil) -> False 1134.87/291.51 goal(xs) -> subsets(xs) 1134.87/291.51 1134.87/291.51 The (relative) TRS S consists of the following rules: 1134.87/291.51 1134.87/291.51 subsets[Ite][True][Let](Cons(x, xs), subs) -> mapconsapp(x, subs, subs) 1134.87/291.51 1134.87/291.51 Rewrite Strategy: INNERMOST 1134.87/291.51 ---------------------------------------- 1134.87/291.51 1134.87/291.51 (1) STerminationProof (BOTH CONCRETE BOUNDS(ID, ID)) 1134.87/291.51 proved termination of relative rules 1134.87/291.51 ---------------------------------------- 1134.87/291.51 1134.87/291.51 (2) 1134.87/291.51 Obligation: 1134.87/291.51 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). 1134.87/291.51 1134.87/291.51 1134.87/291.51 The TRS R consists of the following rules: 1134.87/291.51 1134.87/291.51 subsets(Cons(x, xs)) -> subsets[Ite][True][Let](Cons(x, xs), subsets(xs)) 1134.87/291.51 subsets(Nil) -> Cons(Nil, Nil) 1134.87/291.51 mapconsapp(x', Cons(x, xs), rest) -> Cons(Cons(x', x), mapconsapp(x', xs, rest)) 1134.87/291.51 mapconsapp(x, Nil, rest) -> rest 1134.87/291.51 notEmpty(Cons(x, xs)) -> True 1134.87/291.51 notEmpty(Nil) -> False 1134.87/291.51 goal(xs) -> subsets(xs) 1134.87/291.51 1134.87/291.51 The (relative) TRS S consists of the following rules: 1134.87/291.51 1134.87/291.51 subsets[Ite][True][Let](Cons(x, xs), subs) -> mapconsapp(x, subs, subs) 1134.87/291.51 1134.87/291.51 Rewrite Strategy: INNERMOST 1134.87/291.51 ---------------------------------------- 1134.87/291.51 1134.87/291.51 (3) RenamingProof (BOTH BOUNDS(ID, ID)) 1134.87/291.51 Renamed function symbols to avoid clashes with predefined symbol. 1134.87/291.51 ---------------------------------------- 1134.87/291.51 1134.87/291.51 (4) 1134.87/291.51 Obligation: 1134.87/291.51 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF). 1134.87/291.51 1134.87/291.51 1134.87/291.51 The TRS R consists of the following rules: 1134.87/291.51 1134.87/291.51 subsets(Cons(x, xs)) -> subsets[Ite][True][Let](Cons(x, xs), subsets(xs)) 1134.87/291.51 subsets(Nil) -> Cons(Nil, Nil) 1134.87/291.51 mapconsapp(x', Cons(x, xs), rest) -> Cons(Cons(x', x), mapconsapp(x', xs, rest)) 1134.87/291.51 mapconsapp(x, Nil, rest) -> rest 1134.87/291.51 notEmpty(Cons(x, xs)) -> True 1134.87/291.51 notEmpty(Nil) -> False 1134.87/291.51 goal(xs) -> subsets(xs) 1134.87/291.51 1134.87/291.51 The (relative) TRS S consists of the following rules: 1134.87/291.51 1134.87/291.51 subsets[Ite][True][Let](Cons(x, xs), subs) -> mapconsapp(x, subs, subs)
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
