Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902514
details
property
value
status
complete
benchmark
#4.26.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n046.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.88705492 seconds
cpu usage
305.115553561
max memory
5.377224704E9
stage attributes
key
value
output-size
5834
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), 294 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) 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: p(0) -> 0 p(s(x)) -> x le(0, y) -> true le(s(x), 0) -> false le(s(x), s(y)) -> le(x, y) minus(x, y) -> if(le(x, y), x, y) if(true, x, y) -> 0 if(false, x, y) -> s(minus(p(x), y)) 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: p(0') -> 0' p(s(x)) -> x le(0', y) -> true le(s(x), 0') -> false le(s(x), s(y)) -> le(x, y) minus(x, y) -> if(le(x, y), x, y) if(true, x, y) -> 0' if(false, x, y) -> s(minus(p(x), y)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: p(0') -> 0' p(s(x)) -> x le(0', y) -> true le(s(x), 0') -> false le(s(x), s(y)) -> le(x, y) minus(x, y) -> if(le(x, y), x, y) if(true, x, y) -> 0' if(false, x, y) -> s(minus(p(x), y)) Types: p :: 0':s -> 0':s 0' :: 0':s s :: 0':s -> 0':s le :: 0':s -> 0':s -> true:false true :: true:false false :: true:false minus :: 0':s -> 0':s -> 0':s if :: true:false -> 0':s -> 0':s -> 0':s
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127