Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922787
details
property
value
status
complete
benchmark
z112.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n042.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
30.066108942 seconds
cpu usage
93.778126279
max memory
3.7193728E8
stage attributes
key
value
output-size
7223
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a(a(x1)) -> b(c(x1)) b(x1) -> a(x1) b(b(x1)) -> c(d(x1)) c(c(x1)) -> d(f(x1)) d(x1) -> b(x1) d(d(x1)) -> f(f(f(x1))) f(f(x1)) -> g(a(x1)) g(g(x1)) -> a(x1) - Signature: {a/1,b/1,c/1,d/1,f/1,g/1} / {} - Obligation: derivational complexity wrt. signature {a,b,c,d,f,g} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind triangular matrix interpretation: Following symbols are considered usable: all TcT has computed the following interpretation: p(a) = [1] x1 + [121] p(b) = [1] x1 + [127] p(c) = [1] x1 + [114] p(d) = [1] x1 + [137] p(f) = [1] x1 + [91] p(g) = [1] x1 + [61] Following rules are strictly oriented: a(a(x1)) = [1] x1 + [242] > [1] x1 + [241] = b(c(x1)) b(x1) = [1] x1 + [127] > [1] x1 + [121] = a(x1) b(b(x1)) = [1] x1 + [254] > [1] x1 + [251] = c(d(x1)) d(x1) = [1] x1 + [137] > [1] x1 + [127] = b(x1) d(d(x1)) = [1] x1 + [274] > [1] x1 + [273] = f(f(f(x1))) g(g(x1)) = [1] x1 + [122] > [1] x1 + [121] = a(x1) Following rules are (at-least) weakly oriented: c(c(x1)) = [1] x1 + [228] >= [1] x1 + [228] = d(f(x1)) f(f(x1)) = [1] x1 + [182] >= [1] x1 + [182] = g(a(x1)) * Step 2: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: c(c(x1)) -> d(f(x1)) f(f(x1)) -> g(a(x1)) - Weak TRS: a(a(x1)) -> b(c(x1)) b(x1) -> a(x1) b(b(x1)) -> c(d(x1)) d(x1) -> b(x1) d(d(x1)) -> f(f(f(x1))) g(g(x1)) -> a(x1) - Signature: {a/1,b/1,c/1,d/1,f/1,g/1} / {} - Obligation: derivational complexity wrt. signature {a,b,c,d,f,g} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind triangular matrix interpretation: Following symbols are considered usable: all TcT has computed the following interpretation: p(a) = [1] x1 + [122] p(b) = [1] x1 + [129] p(c) = [1] x1 + [115] p(d) = [1] x1 + [138]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144