Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308198
details
property
value
status
complete
benchmark
PALINDROME_nokinds_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n143.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.716 seconds
cpu usage
1129.74
user time
1117.2
system time
12.545
max virtual memory
3.7575176E7
max residence set size
1.5137912E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), ?)
output
1129.42/291.57 WORST_CASE(Omega(n^2), ?) 1129.42/291.61 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 1129.42/291.61 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1129.42/291.61 1129.42/291.61 1129.42/291.61 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 1129.42/291.61 1129.42/291.61 (0) CpxTRS 1129.42/291.61 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 1129.42/291.61 (2) CpxTRS 1129.42/291.61 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1129.42/291.61 (4) typed CpxTrs 1129.42/291.61 (5) OrderProof [LOWER BOUND(ID), 0 ms] 1129.42/291.61 (6) typed CpxTrs 1129.42/291.61 (7) RewriteLemmaProof [LOWER BOUND(ID), 1487 ms] 1129.42/291.61 (8) BEST 1129.42/291.61 (9) proven lower bound 1129.42/291.61 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 1129.42/291.61 (11) BOUNDS(n^1, INF) 1129.42/291.61 (12) typed CpxTrs 1129.42/291.61 (13) RewriteLemmaProof [LOWER BOUND(ID), 3503 ms] 1129.42/291.61 (14) BEST 1129.42/291.61 (15) proven lower bound 1129.42/291.61 (16) LowerBoundPropagationProof [FINISHED, 0 ms] 1129.42/291.61 (17) BOUNDS(n^2, INF) 1129.42/291.61 (18) typed CpxTrs 1129.42/291.61 (19) RewriteLemmaProof [LOWER BOUND(ID), 751 ms] 1129.42/291.61 (20) BOUNDS(1, INF) 1129.42/291.61 1129.42/291.61 1129.42/291.61 ---------------------------------------- 1129.42/291.61 1129.42/291.61 (0) 1129.42/291.61 Obligation: 1129.42/291.61 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 1129.42/291.61 1129.42/291.61 1129.42/291.61 The TRS R consists of the following rules: 1129.42/291.61 1129.42/291.61 __(__(X, Y), Z) -> __(X, __(Y, Z)) 1129.42/291.61 __(X, nil) -> X 1129.42/291.61 __(nil, X) -> X 1129.42/291.61 and(tt, X) -> activate(X) 1129.42/291.61 isList(V) -> isNeList(activate(V)) 1129.42/291.61 isList(n__nil) -> tt 1129.42/291.61 isList(n____(V1, V2)) -> and(isList(activate(V1)), n__isList(activate(V2))) 1129.42/291.61 isNeList(V) -> isQid(activate(V)) 1129.42/291.61 isNeList(n____(V1, V2)) -> and(isList(activate(V1)), n__isNeList(activate(V2))) 1129.42/291.61 isNeList(n____(V1, V2)) -> and(isNeList(activate(V1)), n__isList(activate(V2))) 1129.42/291.61 isNePal(V) -> isQid(activate(V)) 1129.42/291.61 isNePal(n____(I, n____(P, I))) -> and(isQid(activate(I)), n__isPal(activate(P))) 1129.42/291.61 isPal(V) -> isNePal(activate(V)) 1129.42/291.61 isPal(n__nil) -> tt 1129.42/291.61 isQid(n__a) -> tt 1129.42/291.61 isQid(n__e) -> tt 1129.42/291.61 isQid(n__i) -> tt 1129.42/291.61 isQid(n__o) -> tt 1129.42/291.61 isQid(n__u) -> tt 1129.42/291.61 nil -> n__nil 1129.42/291.61 __(X1, X2) -> n____(X1, X2) 1129.42/291.61 isList(X) -> n__isList(X) 1129.42/291.61 isNeList(X) -> n__isNeList(X) 1129.42/291.61 isPal(X) -> n__isPal(X) 1129.42/291.61 a -> n__a 1129.42/291.61 e -> n__e 1129.42/291.61 i -> n__i 1129.42/291.61 o -> n__o 1129.42/291.61 u -> n__u 1129.42/291.61 activate(n__nil) -> nil 1129.42/291.61 activate(n____(X1, X2)) -> __(activate(X1), activate(X2)) 1129.42/291.61 activate(n__isList(X)) -> isList(X) 1129.42/291.61 activate(n__isNeList(X)) -> isNeList(X) 1129.42/291.61 activate(n__isPal(X)) -> isPal(X) 1129.42/291.61 activate(n__a) -> a 1129.42/291.61 activate(n__e) -> e 1129.42/291.61 activate(n__i) -> i 1129.42/291.61 activate(n__o) -> o 1129.42/291.61 activate(n__u) -> u 1129.42/291.61 activate(X) -> X 1129.42/291.61 1129.42/291.61 S is empty. 1129.42/291.61 Rewrite Strategy: FULL 1129.42/291.61 ---------------------------------------- 1129.42/291.61 1129.42/291.61 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 1129.42/291.61 Renamed function symbols to avoid clashes with predefined symbol. 1129.42/291.61 ---------------------------------------- 1129.42/291.61 1129.42/291.61 (2) 1129.42/291.61 Obligation: 1129.42/291.61 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 1129.42/291.61 1129.42/291.61 1129.42/291.61 The TRS R consists of the following rules: 1129.42/291.61 1129.42/291.61 __(__(X, Y), Z) -> __(X, __(Y, Z)) 1129.42/291.61 __(X, nil) -> X 1129.42/291.61 __(nil, X) -> X 1129.42/291.61 and(tt, X) -> activate(X) 1129.42/291.61 isList(V) -> isNeList(activate(V))
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