Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922118
details
property
value
status
complete
benchmark
02.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
Bouchare_06
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
30.1613821983 seconds
cpu usage
80.619419162
max memory
3.3312768E8
stage attributes
key
value
output-size
2356
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(a(x1)) -> b(b(b(x1))) a(b(a(x1))) -> b(a(x1)) b(b(b(x1))) -> b(a(b(x1))) - Signature: {a/1,b/1} / {} - Obligation: derivational complexity wrt. signature {a,b} + 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 TcT has computed the following interpretation: p(a) = [1 41] x1 + [35] [0 0] [5] p(b) = [1 2] x1 + [64] [0 0] [0] Following rules are strictly oriented: a(a(x1)) = [1 41] x1 + [275] [0 0] [5] > [1 2] x1 + [192] [0 0] [0] = b(b(b(x1))) a(b(a(x1))) = [1 41] x1 + [144] [0 0] [5] > [1 41] x1 + [109] [0 0] [0] = b(a(x1)) b(b(b(x1))) = [1 2] x1 + [192] [0 0] [0] > [1 2] x1 + [173] [0 0] [0] = b(a(b(x1))) Following rules are (at-least) weakly oriented: * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: a(a(x1)) -> b(b(b(x1))) a(b(a(x1))) -> b(a(x1)) b(b(b(x1))) -> b(a(b(x1))) - Signature: {a/1,b/1} / {} - Obligation: derivational complexity wrt. signature {a,b} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144