Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922807
details
property
value
status
complete
benchmark
z093.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n070.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
30.1833479404 seconds
cpu usage
88.597591978
max memory
1.01793792E9
stage attributes
key
value
output-size
5067
starexec-result
WORST_CASE(?,O(n^2))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^2)) * Step 1: NaturalMI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: a(a(a(a(x1)))) -> b(c(x1)) b(c(x1)) -> c(b(x1)) c(b(x1)) -> a(a(a(x1))) - Signature: {a/1,b/1,c/1} / {} - Obligation: derivational complexity wrt. signature {a,b,c} + 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 + [44] p(b) = [1] x1 + [64] p(c) = [1] x1 + [112] Following rules are strictly oriented: c(b(x1)) = [1] x1 + [176] > [1] x1 + [132] = a(a(a(x1))) Following rules are (at-least) weakly oriented: a(a(a(a(x1)))) = [1] x1 + [176] >= [1] x1 + [176] = b(c(x1)) b(c(x1)) = [1] x1 + [176] >= [1] x1 + [176] = c(b(x1)) * Step 2: NaturalMI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: a(a(a(a(x1)))) -> b(c(x1)) b(c(x1)) -> c(b(x1)) - Weak TRS: c(b(x1)) -> a(a(a(x1))) - Signature: {a/1,b/1,c/1} / {} - Obligation: derivational complexity wrt. signature {a,b,c} + 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 + [19] p(b) = [1] x1 + [34] p(c) = [1] x1 + [33] Following rules are strictly oriented: a(a(a(a(x1)))) = [1] x1 + [76] > [1] x1 + [67] = b(c(x1)) Following rules are (at-least) weakly oriented: b(c(x1)) = [1] x1 + [67] >= [1] x1 + [67] = c(b(x1)) c(b(x1)) = [1] x1 + [67] >= [1] x1 + [57] = a(a(a(x1))) * Step 3: NaturalMI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: b(c(x1)) -> c(b(x1)) - Weak TRS: a(a(a(a(x1)))) -> b(c(x1)) c(b(x1)) -> a(a(a(x1))) - Signature: {a/1,b/1,c/1} / {} - Obligation: derivational complexity wrt. signature {a,b,c} + Applied Processor: NaturalMI {miDimension = 2, miDegree = 2, 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
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144