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