Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308098
details
property
value
status
complete
benchmark
PALINDROME_nosorts_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n136.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.688 seconds
cpu usage
1107.1
user time
1094.6
system time
12.5089
max virtual memory
3.7304816E7
max residence set size
1.5008088E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
1106.81/291.56 WORST_CASE(Omega(n^1), ?) 1106.81/291.58 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 1106.81/291.58 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 1106.81/291.58 1106.81/291.58 1106.81/291.58 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1106.81/291.58 1106.81/291.58 (0) CpxTRS 1106.81/291.58 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 1106.81/291.58 (2) CpxTRS 1106.81/291.58 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 1106.81/291.58 (4) typed CpxTrs 1106.81/291.58 (5) OrderProof [LOWER BOUND(ID), 0 ms] 1106.81/291.58 (6) typed CpxTrs 1106.81/291.58 (7) RewriteLemmaProof [LOWER BOUND(ID), 230 ms] 1106.81/291.58 (8) BEST 1106.81/291.58 (9) proven lower bound 1106.81/291.58 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 1106.81/291.58 (11) BOUNDS(n^1, INF) 1106.81/291.58 (12) typed CpxTrs 1106.81/291.58 1106.81/291.58 1106.81/291.58 ---------------------------------------- 1106.81/291.58 1106.81/291.58 (0) 1106.81/291.58 Obligation: 1106.81/291.58 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1106.81/291.58 1106.81/291.58 1106.81/291.58 The TRS R consists of the following rules: 1106.81/291.58 1106.81/291.58 a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z))) 1106.81/291.58 a____(X, nil) -> mark(X) 1106.81/291.58 a____(nil, X) -> mark(X) 1106.81/291.58 a__and(tt, X) -> mark(X) 1106.81/291.58 a__isNePal(__(I, __(P, I))) -> tt 1106.81/291.58 mark(__(X1, X2)) -> a____(mark(X1), mark(X2)) 1106.81/291.58 mark(and(X1, X2)) -> a__and(mark(X1), X2) 1106.81/291.58 mark(isNePal(X)) -> a__isNePal(mark(X)) 1106.81/291.58 mark(nil) -> nil 1106.81/291.58 mark(tt) -> tt 1106.81/291.58 a____(X1, X2) -> __(X1, X2) 1106.81/291.58 a__and(X1, X2) -> and(X1, X2) 1106.81/291.58 a__isNePal(X) -> isNePal(X) 1106.81/291.58 1106.81/291.58 S is empty. 1106.81/291.58 Rewrite Strategy: FULL 1106.81/291.58 ---------------------------------------- 1106.81/291.58 1106.81/291.58 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 1106.81/291.58 Renamed function symbols to avoid clashes with predefined symbol. 1106.81/291.58 ---------------------------------------- 1106.81/291.58 1106.81/291.58 (2) 1106.81/291.58 Obligation: 1106.81/291.58 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 1106.81/291.58 1106.81/291.58 1106.81/291.58 The TRS R consists of the following rules: 1106.81/291.58 1106.81/291.58 a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z))) 1106.81/291.58 a____(X, nil) -> mark(X) 1106.81/291.58 a____(nil, X) -> mark(X) 1106.81/291.58 a__and(tt, X) -> mark(X) 1106.81/291.58 a__isNePal(__(I, __(P, I))) -> tt 1106.81/291.58 mark(__(X1, X2)) -> a____(mark(X1), mark(X2)) 1106.81/291.58 mark(and(X1, X2)) -> a__and(mark(X1), X2) 1106.81/291.58 mark(isNePal(X)) -> a__isNePal(mark(X)) 1106.81/291.58 mark(nil) -> nil 1106.81/291.58 mark(tt) -> tt 1106.81/291.58 a____(X1, X2) -> __(X1, X2) 1106.81/291.58 a__and(X1, X2) -> and(X1, X2) 1106.81/291.58 a__isNePal(X) -> isNePal(X) 1106.81/291.58 1106.81/291.58 S is empty. 1106.81/291.58 Rewrite Strategy: FULL 1106.81/291.58 ---------------------------------------- 1106.81/291.58 1106.81/291.58 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 1106.81/291.58 Infered types. 1106.81/291.58 ---------------------------------------- 1106.81/291.58 1106.81/291.58 (4) 1106.81/291.58 Obligation: 1106.81/291.58 TRS: 1106.81/291.58 Rules: 1106.81/291.58 a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z))) 1106.81/291.58 a____(X, nil) -> mark(X) 1106.81/291.58 a____(nil, X) -> mark(X) 1106.81/291.58 a__and(tt, X) -> mark(X) 1106.81/291.58 a__isNePal(__(I, __(P, I))) -> tt 1106.81/291.58 mark(__(X1, X2)) -> a____(mark(X1), mark(X2)) 1106.81/291.58 mark(and(X1, X2)) -> a__and(mark(X1), X2) 1106.81/291.58 mark(isNePal(X)) -> a__isNePal(mark(X)) 1106.81/291.58 mark(nil) -> nil 1106.81/291.58 mark(tt) -> tt 1106.81/291.58 a____(X1, X2) -> __(X1, X2) 1106.81/291.58 a__and(X1, X2) -> and(X1, X2) 1106.81/291.58 a__isNePal(X) -> isNePal(X) 1106.81/291.58
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