Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308173
details
property
value
status
complete
benchmark
PEANO_nokinds_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n148.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.717 seconds
cpu usage
319.576
user time
316.146
system time
3.42964
max virtual memory
1.8279384E7
max residence set size
7000808.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
319.11/291.54 WORST_CASE(Omega(n^1), ?) 319.49/291.67 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 319.49/291.67 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 319.49/291.67 319.49/291.67 319.49/291.67 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 319.49/291.67 319.49/291.67 (0) CpxTRS 319.49/291.67 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 319.49/291.67 (2) CpxTRS 319.49/291.67 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 319.49/291.67 (4) typed CpxTrs 319.49/291.67 (5) OrderProof [LOWER BOUND(ID), 0 ms] 319.49/291.67 (6) typed CpxTrs 319.49/291.67 (7) RewriteLemmaProof [LOWER BOUND(ID), 326 ms] 319.49/291.67 (8) BEST 319.49/291.67 (9) proven lower bound 319.49/291.67 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 319.49/291.67 (11) BOUNDS(n^1, INF) 319.49/291.67 (12) typed CpxTrs 319.49/291.67 319.49/291.67 319.49/291.67 ---------------------------------------- 319.49/291.67 319.49/291.67 (0) 319.49/291.67 Obligation: 319.49/291.67 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 319.49/291.67 319.49/291.67 319.49/291.67 The TRS R consists of the following rules: 319.49/291.67 319.49/291.67 U11(tt, N) -> activate(N) 319.49/291.67 U21(tt, M, N) -> s(plus(activate(N), activate(M))) 319.49/291.67 and(tt, X) -> activate(X) 319.49/291.67 isNat(n__0) -> tt 319.49/291.67 isNat(n__plus(V1, V2)) -> and(isNat(activate(V1)), n__isNat(activate(V2))) 319.49/291.67 isNat(n__s(V1)) -> isNat(activate(V1)) 319.49/291.67 plus(N, 0) -> U11(isNat(N), N) 319.49/291.67 plus(N, s(M)) -> U21(and(isNat(M), n__isNat(N)), M, N) 319.49/291.67 0 -> n__0 319.49/291.67 plus(X1, X2) -> n__plus(X1, X2) 319.49/291.67 isNat(X) -> n__isNat(X) 319.49/291.67 s(X) -> n__s(X) 319.49/291.67 activate(n__0) -> 0 319.49/291.67 activate(n__plus(X1, X2)) -> plus(X1, X2) 319.49/291.67 activate(n__isNat(X)) -> isNat(X) 319.49/291.67 activate(n__s(X)) -> s(X) 319.49/291.67 activate(X) -> X 319.49/291.67 319.49/291.67 S is empty. 319.49/291.67 Rewrite Strategy: FULL 319.49/291.67 ---------------------------------------- 319.49/291.67 319.49/291.67 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 319.49/291.67 Renamed function symbols to avoid clashes with predefined symbol. 319.49/291.67 ---------------------------------------- 319.49/291.67 319.49/291.67 (2) 319.49/291.67 Obligation: 319.49/291.67 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 319.49/291.67 319.49/291.67 319.49/291.67 The TRS R consists of the following rules: 319.49/291.67 319.49/291.67 U11(tt, N) -> activate(N) 319.49/291.67 U21(tt, M, N) -> s(plus(activate(N), activate(M))) 319.49/291.67 and(tt, X) -> activate(X) 319.49/291.67 isNat(n__0) -> tt 319.49/291.67 isNat(n__plus(V1, V2)) -> and(isNat(activate(V1)), n__isNat(activate(V2))) 319.49/291.67 isNat(n__s(V1)) -> isNat(activate(V1)) 319.49/291.67 plus(N, 0') -> U11(isNat(N), N) 319.49/291.67 plus(N, s(M)) -> U21(and(isNat(M), n__isNat(N)), M, N) 319.49/291.67 0' -> n__0 319.49/291.67 plus(X1, X2) -> n__plus(X1, X2) 319.49/291.67 isNat(X) -> n__isNat(X) 319.49/291.67 s(X) -> n__s(X) 319.49/291.67 activate(n__0) -> 0' 319.49/291.67 activate(n__plus(X1, X2)) -> plus(X1, X2) 319.49/291.67 activate(n__isNat(X)) -> isNat(X) 319.49/291.67 activate(n__s(X)) -> s(X) 319.49/291.67 activate(X) -> X 319.49/291.67 319.49/291.67 S is empty. 319.49/291.67 Rewrite Strategy: FULL 319.49/291.67 ---------------------------------------- 319.49/291.67 319.49/291.67 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 319.49/291.67 Infered types. 319.49/291.67 ---------------------------------------- 319.49/291.67 319.49/291.67 (4) 319.49/291.67 Obligation: 319.49/291.67 TRS: 319.49/291.67 Rules: 319.49/291.67 U11(tt, N) -> activate(N) 319.49/291.67 U21(tt, M, N) -> s(plus(activate(N), activate(M))) 319.49/291.67 and(tt, X) -> activate(X) 319.49/291.67 isNat(n__0) -> tt 319.49/291.67 isNat(n__plus(V1, V2)) -> and(isNat(activate(V1)), n__isNat(activate(V2))) 319.49/291.67 isNat(n__s(V1)) -> isNat(activate(V1))
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
