Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903569
details
property
value
status
complete
benchmark
MYNAT_nosorts-noand_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.461643934 seconds
cpu usage
308.128190716
max memory
5.603069952E9
stage attributes
key
value
output-size
9867
starexec-result
WORST_CASE(Omega(n^2), ?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^2), ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). (0) CpxTRS (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) typed CpxTrs (5) OrderProof [LOWER BOUND(ID), 0 ms] (6) typed CpxTrs (7) RewriteLemmaProof [LOWER BOUND(ID), 256 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 56 ms] (14) proven lower bound (15) LowerBoundPropagationProof [FINISHED, 0 ms] (16) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). The TRS R consists of the following rules: U11(tt, M, N) -> U12(tt, activate(M), activate(N)) U12(tt, M, N) -> s(plus(activate(N), activate(M))) U21(tt, M, N) -> U22(tt, activate(M), activate(N)) U22(tt, M, N) -> plus(x(activate(N), activate(M)), activate(N)) plus(N, 0) -> N plus(N, s(M)) -> U11(tt, M, N) x(N, 0) -> 0 x(N, s(M)) -> U21(tt, M, N) activate(X) -> X S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). The TRS R consists of the following rules: U11(tt, M, N) -> U12(tt, activate(M), activate(N)) U12(tt, M, N) -> s(plus(activate(N), activate(M))) U21(tt, M, N) -> U22(tt, activate(M), activate(N)) U22(tt, M, N) -> plus(x(activate(N), activate(M)), activate(N)) plus(N, 0') -> N plus(N, s(M)) -> U11(tt, M, N) x(N, 0') -> 0' x(N, s(M)) -> U21(tt, M, N) activate(X) -> X S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: U11(tt, M, N) -> U12(tt, activate(M), activate(N)) U12(tt, M, N) -> s(plus(activate(N), activate(M))) U21(tt, M, N) -> U22(tt, activate(M), activate(N)) U22(tt, M, N) -> plus(x(activate(N), activate(M)), activate(N)) plus(N, 0') -> N plus(N, s(M)) -> U11(tt, M, N) x(N, 0') -> 0' x(N, s(M)) -> U21(tt, M, N) activate(X) -> X Types: U11 :: tt -> s:0' -> s:0' -> s:0'
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127