Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922397
details
property
value
status
complete
benchmark
z104.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
50.3825831413 seconds
cpu usage
141.382955756
max memory
7.11479296E8
stage attributes
key
value
output-size
4468
starexec-result
WORST_CASE(?,O(n^1))
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^1)) * Step 1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a(c(c(c(x1)))) -> d(d(x1)) b(d(x1)) -> c(c(x1)) c(x1) -> a(a(a(a(x1)))) c(c(c(a(x1)))) -> d(d(x1)) d(x1) -> b(b(b(b(x1)))) d(b(x1)) -> c(c(x1)) - Signature: {a/1,b/1,c/1,d/1} / {} - Obligation: derivational complexity wrt. signature {a,b,c,d} + 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 + [30] p(b) = [1] x1 + [50] p(c) = [1] x1 + [128] p(d) = [1] x1 + [207] Following rules are strictly oriented: b(d(x1)) = [1] x1 + [257] > [1] x1 + [256] = c(c(x1)) c(x1) = [1] x1 + [128] > [1] x1 + [120] = a(a(a(a(x1)))) d(x1) = [1] x1 + [207] > [1] x1 + [200] = b(b(b(b(x1)))) d(b(x1)) = [1] x1 + [257] > [1] x1 + [256] = c(c(x1)) Following rules are (at-least) weakly oriented: a(c(c(c(x1)))) = [1] x1 + [414] >= [1] x1 + [414] = d(d(x1)) c(c(c(a(x1)))) = [1] x1 + [414] >= [1] x1 + [414] = d(d(x1)) * Step 2: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a(c(c(c(x1)))) -> d(d(x1)) c(c(c(a(x1)))) -> d(d(x1)) - Weak TRS: b(d(x1)) -> c(c(x1)) c(x1) -> a(a(a(a(x1)))) d(x1) -> b(b(b(b(x1)))) d(b(x1)) -> c(c(x1)) - Signature: {a/1,b/1,c/1,d/1} / {} - Obligation: derivational complexity wrt. signature {a,b,c,d} + 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 + [10] p(b) = [1] x1 + [16] p(c) = [1] x1 + [40] p(d) = [1] x1 + [64] Following rules are strictly oriented: a(c(c(c(x1)))) = [1] x1 + [130] > [1] x1 + [128] = d(d(x1)) c(c(c(a(x1)))) = [1] x1 + [130] > [1] x1 + [128] = d(d(x1)) Following rules are (at-least) weakly oriented: b(d(x1)) = [1] x1 + [80] >= [1] x1 + [80]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144