Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308096
details
property
value
status
complete
benchmark
PALINDROME_complete-noand_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n004.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.769 seconds
cpu usage
318.09
user time
315.98
system time
2.11
max virtual memory
1.8281788E7
max residence set size
5588276.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), ?)
output
317.89/291.65 WORST_CASE(Omega(n^2), ?) 318.09/291.73 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 318.09/291.73 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 318.09/291.73 318.09/291.73 318.09/291.73 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 318.09/291.73 318.09/291.73 (0) CpxTRS 318.09/291.73 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 318.09/291.73 (2) CpxTRS 318.09/291.73 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 318.09/291.73 (4) typed CpxTrs 318.09/291.73 (5) OrderProof [LOWER BOUND(ID), 0 ms] 318.09/291.73 (6) typed CpxTrs 318.09/291.73 (7) RewriteLemmaProof [LOWER BOUND(ID), 661 ms] 318.09/291.73 (8) BEST 318.09/291.73 (9) proven lower bound 318.09/291.73 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 318.09/291.73 (11) BOUNDS(n^1, INF) 318.09/291.73 (12) typed CpxTrs 318.09/291.73 (13) RewriteLemmaProof [LOWER BOUND(ID), 270 ms] 318.09/291.73 (14) BEST 318.09/291.73 (15) proven lower bound 318.09/291.73 (16) LowerBoundPropagationProof [FINISHED, 0 ms] 318.09/291.73 (17) BOUNDS(n^2, INF) 318.09/291.73 (18) typed CpxTrs 318.09/291.73 318.09/291.73 318.09/291.73 ---------------------------------------- 318.09/291.73 318.09/291.73 (0) 318.09/291.73 Obligation: 318.09/291.73 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). 318.09/291.73 318.09/291.73 318.09/291.73 The TRS R consists of the following rules: 318.09/291.73 318.09/291.73 __(__(X, Y), Z) -> __(X, __(Y, Z)) 318.09/291.73 __(X, nil) -> X 318.09/291.73 __(nil, X) -> X 318.09/291.73 U11(tt, V) -> U12(isPalListKind(activate(V)), activate(V)) 318.09/291.73 U12(tt, V) -> U13(isNeList(activate(V))) 318.09/291.73 U13(tt) -> tt 318.09/291.73 U21(tt, V1, V2) -> U22(isPalListKind(activate(V1)), activate(V1), activate(V2)) 318.09/291.73 U22(tt, V1, V2) -> U23(isPalListKind(activate(V2)), activate(V1), activate(V2)) 318.09/291.73 U23(tt, V1, V2) -> U24(isPalListKind(activate(V2)), activate(V1), activate(V2)) 318.09/291.73 U24(tt, V1, V2) -> U25(isList(activate(V1)), activate(V2)) 318.09/291.73 U25(tt, V2) -> U26(isList(activate(V2))) 318.09/291.73 U26(tt) -> tt 318.09/291.73 U31(tt, V) -> U32(isPalListKind(activate(V)), activate(V)) 318.09/291.73 U32(tt, V) -> U33(isQid(activate(V))) 318.09/291.73 U33(tt) -> tt 318.09/291.73 U41(tt, V1, V2) -> U42(isPalListKind(activate(V1)), activate(V1), activate(V2)) 318.09/291.73 U42(tt, V1, V2) -> U43(isPalListKind(activate(V2)), activate(V1), activate(V2)) 318.09/291.73 U43(tt, V1, V2) -> U44(isPalListKind(activate(V2)), activate(V1), activate(V2)) 318.09/291.73 U44(tt, V1, V2) -> U45(isList(activate(V1)), activate(V2)) 318.09/291.73 U45(tt, V2) -> U46(isNeList(activate(V2))) 318.09/291.73 U46(tt) -> tt 318.09/291.73 U51(tt, V1, V2) -> U52(isPalListKind(activate(V1)), activate(V1), activate(V2)) 318.09/291.73 U52(tt, V1, V2) -> U53(isPalListKind(activate(V2)), activate(V1), activate(V2)) 318.09/291.73 U53(tt, V1, V2) -> U54(isPalListKind(activate(V2)), activate(V1), activate(V2)) 318.09/291.73 U54(tt, V1, V2) -> U55(isNeList(activate(V1)), activate(V2)) 318.09/291.73 U55(tt, V2) -> U56(isList(activate(V2))) 318.09/291.73 U56(tt) -> tt 318.09/291.73 U61(tt, V) -> U62(isPalListKind(activate(V)), activate(V)) 318.09/291.73 U62(tt, V) -> U63(isQid(activate(V))) 318.09/291.73 U63(tt) -> tt 318.09/291.73 U71(tt, I, P) -> U72(isPalListKind(activate(I)), activate(P)) 318.09/291.73 U72(tt, P) -> U73(isPal(activate(P)), activate(P)) 318.09/291.73 U73(tt, P) -> U74(isPalListKind(activate(P))) 318.09/291.73 U74(tt) -> tt 318.09/291.73 U81(tt, V) -> U82(isPalListKind(activate(V)), activate(V)) 318.09/291.73 U82(tt, V) -> U83(isNePal(activate(V))) 318.09/291.73 U83(tt) -> tt 318.09/291.73 U91(tt, V2) -> U92(isPalListKind(activate(V2))) 318.09/291.73 U92(tt) -> tt 318.09/291.73 isList(V) -> U11(isPalListKind(activate(V)), activate(V)) 318.09/291.73 isList(n__nil) -> tt 318.09/291.73 isList(n____(V1, V2)) -> U21(isPalListKind(activate(V1)), activate(V1), activate(V2)) 318.09/291.73 isNeList(V) -> U31(isPalListKind(activate(V)), activate(V)) 318.09/291.73 isNeList(n____(V1, V2)) -> U41(isPalListKind(activate(V1)), activate(V1), activate(V2)) 318.09/291.73 isNeList(n____(V1, V2)) -> U51(isPalListKind(activate(V1)), activate(V1), activate(V2)) 318.09/291.73 isNePal(V) -> U61(isPalListKind(activate(V)), activate(V)) 318.09/291.73 isNePal(n____(I, n____(P, I))) -> U71(isQid(activate(I)), activate(I), activate(P)) 318.09/291.73 isPal(V) -> U81(isPalListKind(activate(V)), activate(V)) 318.09/291.73 isPal(n__nil) -> tt 318.09/291.73 isPalListKind(n__a) -> tt 318.09/291.73 isPalListKind(n__e) -> tt 318.09/291.73 isPalListKind(n__i) -> tt 318.09/291.73 isPalListKind(n__nil) -> tt 318.09/291.73 isPalListKind(n__o) -> tt 318.09/291.73 isPalListKind(n__u) -> tt 318.09/291.73 isPalListKind(n____(V1, V2)) -> U91(isPalListKind(activate(V1)), activate(V2)) 318.09/291.73 isQid(n__a) -> tt 318.09/291.73 isQid(n__e) -> tt 318.09/291.73 isQid(n__i) -> tt 318.09/291.73 isQid(n__o) -> tt 318.09/291.73 isQid(n__u) -> tt 318.09/291.73 nil -> n__nil 318.09/291.73 __(X1, X2) -> n____(X1, X2)
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