Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903127
details
property
value
status
complete
benchmark
thiemann11.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n047.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.910663128 seconds
cpu usage
315.280897958
max memory
5.357264896E9
stage attributes
key
value
output-size
12354
starexec-result
WORST_CASE(Omega(n^1), ?)
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox/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^1, 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), 293 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), 55 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 20 ms] (16) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: le(0, y) -> true le(s(x), 0) -> false le(s(x), s(y)) -> le(x, y) zero(0) -> true zero(s(x)) -> false id(0) -> 0 id(s(x)) -> s(id(x)) minus(x, 0) -> x minus(s(x), s(y)) -> minus(x, y) mod(x, y) -> if_mod(zero(x), zero(y), le(y, x), id(x), id(y)) if_mod(true, b1, b2, x, y) -> 0 if_mod(false, b1, b2, x, y) -> if2(b1, b2, x, y) if2(true, b2, x, y) -> 0 if2(false, b2, x, y) -> if3(b2, x, y) if3(true, x, y) -> mod(minus(x, y), s(y)) if3(false, x, y) -> 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^1, INF). The TRS R consists of the following rules: le(0', y) -> true le(s(x), 0') -> false le(s(x), s(y)) -> le(x, y) zero(0') -> true zero(s(x)) -> false id(0') -> 0' id(s(x)) -> s(id(x)) minus(x, 0') -> x minus(s(x), s(y)) -> minus(x, y) mod(x, y) -> if_mod(zero(x), zero(y), le(y, x), id(x), id(y)) if_mod(true, b1, b2, x, y) -> 0' if_mod(false, b1, b2, x, y) -> if2(b1, b2, x, y) if2(true, b2, x, y) -> 0' if2(false, b2, x, y) -> if3(b2, x, y) if3(true, x, y) -> mod(minus(x, y), s(y)) if3(false, x, y) -> x S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127