Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307840
details
property
value
status
complete
benchmark
wst99.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n090.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.563 seconds
cpu usage
318.912
user time
316.236
system time
2.67559
max virtual memory
1.8282028E7
max residence set size
5999696.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
318.81/291.51 WORST_CASE(Omega(n^1), ?) 318.81/291.52 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 318.81/291.52 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 318.81/291.52 318.81/291.52 318.81/291.52 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 318.81/291.52 318.81/291.52 (0) CpxTRS 318.81/291.52 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 318.81/291.52 (2) CpxTRS 318.81/291.52 (3) SlicingProof [LOWER BOUND(ID), 0 ms] 318.81/291.52 (4) CpxTRS 318.81/291.52 (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 318.81/291.52 (6) typed CpxTrs 318.81/291.52 (7) OrderProof [LOWER BOUND(ID), 0 ms] 318.81/291.52 (8) typed CpxTrs 318.81/291.52 (9) RewriteLemmaProof [LOWER BOUND(ID), 477 ms] 318.81/291.52 (10) BEST 318.81/291.52 (11) proven lower bound 318.81/291.52 (12) LowerBoundPropagationProof [FINISHED, 0 ms] 318.81/291.52 (13) BOUNDS(n^1, INF) 318.81/291.52 (14) typed CpxTrs 318.81/291.52 318.81/291.52 318.81/291.52 ---------------------------------------- 318.81/291.52 318.81/291.52 (0) 318.81/291.52 Obligation: 318.81/291.52 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 318.81/291.52 318.81/291.52 318.81/291.52 The TRS R consists of the following rules: 318.81/291.52 318.81/291.52 din(der(plus(X, Y))) -> u21(din(der(X)), X, Y) 318.81/291.52 u21(dout(DX), X, Y) -> u22(din(der(Y)), X, Y, DX) 318.81/291.52 u22(dout(DY), X, Y, DX) -> dout(plus(DX, DY)) 318.81/291.52 din(der(times(X, Y))) -> u31(din(der(X)), X, Y) 318.81/291.52 u31(dout(DX), X, Y) -> u32(din(der(Y)), X, Y, DX) 318.81/291.52 u32(dout(DY), X, Y, DX) -> dout(plus(times(X, DY), times(Y, DX))) 318.81/291.52 din(der(der(X))) -> u41(din(der(X)), X) 318.81/291.52 u41(dout(DX), X) -> u42(din(der(DX)), X, DX) 318.81/291.52 u42(dout(DDX), X, DX) -> dout(DDX) 318.81/291.52 318.81/291.52 S is empty. 318.81/291.52 Rewrite Strategy: FULL 318.81/291.52 ---------------------------------------- 318.81/291.52 318.81/291.52 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 318.81/291.52 Renamed function symbols to avoid clashes with predefined symbol. 318.81/291.52 ---------------------------------------- 318.81/291.52 318.81/291.52 (2) 318.81/291.52 Obligation: 318.81/291.52 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 318.81/291.52 318.81/291.52 318.81/291.52 The TRS R consists of the following rules: 318.81/291.52 318.81/291.52 din(der(plus(X, Y))) -> u21(din(der(X)), X, Y) 318.81/291.52 u21(dout(DX), X, Y) -> u22(din(der(Y)), X, Y, DX) 318.81/291.52 u22(dout(DY), X, Y, DX) -> dout(plus(DX, DY)) 318.81/291.52 din(der(times(X, Y))) -> u31(din(der(X)), X, Y) 318.81/291.52 u31(dout(DX), X, Y) -> u32(din(der(Y)), X, Y, DX) 318.81/291.52 u32(dout(DY), X, Y, DX) -> dout(plus(times(X, DY), times(Y, DX))) 318.81/291.52 din(der(der(X))) -> u41(din(der(X)), X) 318.81/291.52 u41(dout(DX), X) -> u42(din(der(DX)), X, DX) 318.81/291.52 u42(dout(DDX), X, DX) -> dout(DDX) 318.81/291.52 318.81/291.52 S is empty. 318.81/291.52 Rewrite Strategy: FULL 318.81/291.52 ---------------------------------------- 318.81/291.52 318.81/291.52 (3) SlicingProof (LOWER BOUND(ID)) 318.81/291.52 Sliced the following arguments: 318.81/291.52 u21/1 318.81/291.52 u22/1 318.81/291.52 u22/2 318.81/291.52 u41/1 318.81/291.52 u42/1 318.81/291.52 u42/2 318.81/291.52 318.81/291.52 ---------------------------------------- 318.81/291.52 318.81/291.52 (4) 318.81/291.52 Obligation: 318.81/291.52 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 318.81/291.52 318.81/291.52 318.81/291.52 The TRS R consists of the following rules: 318.81/291.52 318.81/291.52 din(der(plus(X, Y))) -> u21(din(der(X)), Y) 318.81/291.52 u21(dout(DX), Y) -> u22(din(der(Y)), DX) 318.81/291.52 u22(dout(DY), DX) -> dout(plus(DX, DY)) 318.81/291.52 din(der(times(X, Y))) -> u31(din(der(X)), X, Y) 318.81/291.52 u31(dout(DX), X, Y) -> u32(din(der(Y)), X, Y, DX) 318.81/291.52 u32(dout(DY), X, Y, DX) -> dout(plus(times(X, DY), times(Y, DX))) 318.81/291.52 din(der(der(X))) -> u41(din(der(X))) 318.81/291.52 u41(dout(DX)) -> u42(din(der(DX))) 318.81/291.52 u42(dout(DDX)) -> dout(DDX) 318.81/291.52
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
