Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922341
details
property
value
status
complete
benchmark
17.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
Zantema_06
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
111.670797825 seconds
cpu usage
251.887516828
max memory
9.444671488E9
stage attributes
key
value
output-size
25060
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: WeightGap WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a(a(x1)) -> b(x1) a(a(a(x1))) -> a(b(a(x1))) a(a(a(a(x1)))) -> a(a(b(a(a(x1))))) a(a(a(a(a(x1))))) -> a(a(a(b(a(a(a(x1))))))) a(a(a(b(a(x1))))) -> a(a(b(b(a(a(b(x1))))))) a(a(b(a(x1)))) -> a(b(b(a(b(x1))))) a(a(b(a(a(x1))))) -> a(b(a(b(a(b(a(x1))))))) a(a(b(b(a(x1))))) -> a(b(b(b(a(b(b(x1))))))) a(b(a(x1))) -> b(b(b(x1))) a(b(a(a(x1)))) -> b(a(b(b(a(x1))))) a(b(a(a(a(x1))))) -> b(a(a(b(b(a(a(x1))))))) a(b(a(b(a(x1))))) -> b(a(b(b(b(a(b(x1))))))) a(b(b(a(x1)))) -> b(b(b(b(b(x1))))) a(b(b(a(a(x1))))) -> b(b(a(b(b(b(a(x1))))))) a(b(b(b(a(x1))))) -> b(b(b(b(b(b(b(x1))))))) - Signature: {a/1} / {b/1} - Obligation: derivational complexity wrt. signature {a,b} + Applied Processor: WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = NoUArgs, wgOn = WgOnAny} + Details: The weightgap principle applies using the following nonconstant growth matrix-interpretation: 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 + [2] p(b) = [1] x1 + [2] Following rules are strictly oriented: a(a(x1)) = [1] x1 + [4] > [1] x1 + [2] = b(x1) Following rules are (at-least) weakly oriented: a(a(a(x1))) = [1] x1 + [6] >= [1] x1 + [6] = a(b(a(x1))) a(a(a(a(x1)))) = [1] x1 + [8] >= [1] x1 + [10] = a(a(b(a(a(x1))))) a(a(a(a(a(x1))))) = [1] x1 + [10] >= [1] x1 + [14] = a(a(a(b(a(a(a(x1))))))) a(a(a(b(a(x1))))) = [1] x1 + [10] >= [1] x1 + [14] = a(a(b(b(a(a(b(x1))))))) a(a(b(a(x1)))) = [1] x1 + [8] >= [1] x1 + [10] = a(b(b(a(b(x1))))) a(a(b(a(a(x1))))) = [1] x1 + [10] >= [1] x1 + [14] = a(b(a(b(a(b(a(x1))))))) a(a(b(b(a(x1))))) = [1] x1 + [10] >= [1] x1 + [14] = a(b(b(b(a(b(b(x1))))))) a(b(a(x1))) = [1] x1 + [6] >= [1] x1 + [6] = b(b(b(x1))) a(b(a(a(x1)))) = [1] x1 + [8] >= [1] x1 + [10] = b(a(b(b(a(x1))))) a(b(a(a(a(x1))))) = [1] x1 + [10] >= [1] x1 + [14] = b(a(a(b(b(a(a(x1))))))) a(b(a(b(a(x1))))) = [1] x1 + [10] >= [1] x1 + [14] = b(a(b(b(b(a(b(x1))))))) a(b(b(a(x1)))) = [1] x1 + [8] >= [1] x1 + [10] = b(b(b(b(b(x1))))) a(b(b(a(a(x1))))) = [1] x1 + [10] >= [1] x1 + [14] = b(b(a(b(b(b(a(x1)))))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144