Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903029
details
property
value
status
complete
benchmark
otto01.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n078.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
292.911949158 seconds
cpu usage
1005.06321598
max memory
1.5337959424E10
stage attributes
key
value
output-size
48422
starexec-result
WORST_CASE(Omega(n^1), O(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), O(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, n^1). (0) CpxTRS (1) RcToIrcProof [BOTH BOUNDS(ID, ID), 4 ms] (2) CpxTRS (3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxWeightedTrs (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxTypedWeightedTrs (7) CompletionProof [UPPER BOUND(ID), 0 ms] (8) CpxTypedWeightedCompleteTrs (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (10) CpxRNTS (11) CompleteCoflocoProof [FINISHED, 4017 ms] (12) BOUNDS(1, n^1) (13) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxTRS (15) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (16) typed CpxTrs (17) OrderProof [LOWER BOUND(ID), 11 ms] (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 361 ms] (20) BEST (21) proven lower bound (22) LowerBoundPropagationProof [FINISHED, 0 ms] (23) BOUNDS(n^1, INF) (24) typed CpxTrs (25) RewriteLemmaProof [LOWER BOUND(ID), 32 ms] (26) typed CpxTrs (27) RewriteLemmaProof [LOWER BOUND(ID), 66 ms] (28) typed CpxTrs (29) RewriteLemmaProof [LOWER BOUND(ID), 43 ms] (30) typed CpxTrs (31) RewriteLemmaProof [LOWER BOUND(ID), 63 ms] (32) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: min(0, y) -> 0 min(s(x), 0) -> 0 min(s(x), s(y)) -> min(x, y) len(nil) -> 0 len(cons(x, xs)) -> s(len(xs)) sum(x, 0) -> x sum(x, s(y)) -> s(sum(x, y)) le(0, x) -> true le(s(x), 0) -> false le(s(x), s(y)) -> le(x, y) take(0, cons(y, ys)) -> y take(s(x), cons(y, ys)) -> take(x, ys) addList(x, y) -> if(le(0, min(len(x), len(y))), 0, x, y, nil) if(false, c, x, y, z) -> z if(true, c, xs, ys, z) -> if(le(s(c), min(len(xs), len(ys))), s(c), xs, ys, cons(sum(take(c, xs), take(c, ys)), z)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RcToIrcProof (BOTH BOUNDS(ID, ID)) Converted rc-obligation to irc-obligation. The duplicating contexts are: addList([], y) addList(x, []) if(true, [], xs, ys, z) if(true, c, [], ys, z) if(true, c, xs, [], z) The defined contexts are: if([], s(x1), x2, x3, cons(x4, x5)) le(s(x0), []) min([], x1) min(x0, []) if(x0, s(x1), x2, x3, cons([], x5)) sum([], x1) sum(x0, []) if([], 0, x1, x2, nil) le(0, []) le(x0, []) if(x0, s(x1), x2, x3, cons(x4, []))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127