Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922373
details
property
value
status
complete
benchmark
e.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
Waldmann_06_SRS
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
293.665330887 seconds
cpu usage
479.274661335
max memory
5.91486976E8
stage attributes
key
value
output-size
42560
starexec-result
WORST_CASE(?,O(n^3))
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^3)) * Step 1: WeightGap WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: 0(3(x1)) -> 5(3(x1)) 2(4(x1)) -> 0(7(x1)) 2(7(x1)) -> 1(8(x1)) 2(8(x1)) -> 4(x1) 2(8(x1)) -> 7(x1) 2(8(1(x1))) -> 8(x1) 4(x1) -> 5(2(3(x1))) 4(x1) -> 9(6(6(x1))) 4(7(x1)) -> 1(3(x1)) 5(2(6(x1))) -> 6(2(4(x1))) 5(3(x1)) -> 6(0(x1)) 5(9(x1)) -> 0(x1) 6(2(x1)) -> 7(7(x1)) 6(6(x1)) -> 3(x1) 6(9(x1)) -> 9(x1) 7(0(x1)) -> 9(3(x1)) 7(2(x1)) -> 4(x1) 9(x1) -> 6(7(x1)) 9(5(9(x1))) -> 5(7(x1)) 9(7(x1)) -> 7(5(x1)) - Signature: {0/1,2/1,4/1,5/1,6/1,7/1,9/1} / {1/1,3/1,8/1} - Obligation: derivational complexity wrt. signature {0,1,2,3,4,5,6,7,8,9} + 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(0) = [1] x1 + [0] p(1) = [1] x1 + [0] p(2) = [1] x1 + [3] p(3) = [1] x1 + [0] p(4) = [1] x1 + [0] p(5) = [1] x1 + [0] p(6) = [1] x1 + [0] p(7) = [1] x1 + [4] p(8) = [1] x1 + [3] p(9) = [1] x1 + [1] Following rules are strictly oriented: 2(7(x1)) = [1] x1 + [7] > [1] x1 + [3] = 1(8(x1)) 2(8(x1)) = [1] x1 + [6] > [1] x1 + [0] = 4(x1) 2(8(x1)) = [1] x1 + [6] > [1] x1 + [4] = 7(x1) 2(8(1(x1))) = [1] x1 + [6] > [1] x1 + [3] = 8(x1) 4(7(x1)) = [1] x1 + [4] > [1] x1 + [0] = 1(3(x1)) 5(9(x1)) = [1] x1 + [1] > [1] x1 + [0] = 0(x1) 7(0(x1)) = [1] x1 + [4] > [1] x1 + [1] = 9(3(x1)) 7(2(x1)) = [1] x1 + [7] > [1] x1 + [0] = 4(x1) 9(7(x1)) = [1] x1 + [5] > [1] x1 + [4] = 7(5(x1)) Following rules are (at-least) weakly oriented: 0(3(x1)) = [1] x1 + [0] >= [1] x1 + [0] = 5(3(x1)) 2(4(x1)) = [1] x1 + [3] >= [1] x1 + [4] = 0(7(x1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144