Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922761
details
property
value
status
complete
benchmark
212693.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n050.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
294.194108009 seconds
cpu usage
662.440130426
max memory
1.0602299392E10
stage attributes
key
value
output-size
158650
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: 0(0(3(2(1(x1))))) -> 0(0(1(3(5(2(x1)))))) 0(1(0(3(2(x1))))) -> 0(1(4(3(2(0(x1)))))) 0(1(0(3(2(x1))))) -> 2(3(1(0(0(5(x1)))))) 0(1(2(x1))) -> 0(0(2(1(x1)))) 0(1(2(x1))) -> 0(0(2(1(4(4(x1)))))) 0(1(2(x1))) -> 0(2(1(3(x1)))) 0(2(0(1(x1)))) -> 5(0(0(2(1(x1))))) 0(3(1(x1))) -> 0(1(3(4(0(x1))))) 0(3(1(x1))) -> 0(1(3(4(4(x1))))) 0(3(1(x1))) -> 1(3(4(4(4(0(x1)))))) 0(3(1(1(x1)))) -> 0(1(4(1(3(4(x1)))))) 0(3(2(x1))) -> 0(0(2(4(3(x1))))) 0(3(2(x1))) -> 0(2(1(3(x1)))) 0(3(2(x1))) -> 0(2(1(3(3(4(x1)))))) 0(3(2(x1))) -> 0(2(1(4(3(x1))))) 0(3(2(x1))) -> 0(2(3(4(x1)))) 0(3(2(x1))) -> 0(2(3(4(5(5(x1)))))) 0(3(2(x1))) -> 0(2(4(3(3(x1))))) 0(3(2(x1))) -> 2(4(4(3(4(0(x1)))))) 0(3(2(1(x1)))) -> 0(0(3(4(2(1(x1)))))) 0(3(2(2(x1)))) -> 1(3(4(0(2(2(x1)))))) 0(3(2(5(1(x1))))) -> 0(2(5(1(3(3(x1)))))) 0(4(1(x1))) -> 0(1(4(4(x1)))) 0(4(1(x1))) -> 0(2(1(4(x1)))) 0(4(1(2(x1)))) -> 1(4(0(2(5(x1))))) 0(4(2(x1))) -> 0(2(1(4(x1)))) 0(4(2(x1))) -> 0(2(3(4(x1)))) 0(4(2(x1))) -> 0(2(4(3(x1)))) 0(4(3(2(x1)))) -> 2(3(4(4(0(0(x1)))))) 0(5(1(1(2(x1))))) -> 0(2(4(1(1(5(x1)))))) 0(5(1(2(2(x1))))) -> 0(2(5(2(1(2(x1)))))) 0(5(3(1(x1)))) -> 0(1(4(3(5(4(x1)))))) 0(5(3(1(x1)))) -> 0(1(5(3(4(0(x1)))))) 0(5(3(2(x1)))) -> 0(2(4(5(3(x1))))) 0(5(3(2(x1)))) -> 0(2(5(3(3(x1))))) 0(5(3(2(1(x1))))) -> 0(1(3(4(2(5(x1)))))) 0(5(5(3(2(x1))))) -> 0(2(5(1(3(5(x1)))))) 2(0(1(x1))) -> 5(0(2(1(x1)))) 2(0(3(1(x1)))) -> 2(0(1(3(5(2(x1)))))) 2(0(3(1(1(x1))))) -> 2(1(0(1(3(4(x1)))))) 2(0(4(1(x1)))) -> 2(0(1(4(5(x1))))) 2(2(0(3(1(x1))))) -> 1(3(0(2(5(2(x1)))))) 2(2(0(5(1(x1))))) -> 2(0(2(1(5(1(x1)))))) 2(3(1(x1))) -> 0(2(1(3(5(x1))))) 2(3(1(x1))) -> 1(3(5(2(x1)))) 2(3(1(x1))) -> 1(4(3(5(2(x1))))) 2(5(3(2(x1)))) -> 2(5(2(3(3(x1))))) 2(5(4(2(x1)))) -> 0(2(5(2(4(x1))))) 2(5(5(4(1(x1))))) -> 5(5(2(1(3(4(x1)))))) - Signature: {0/1,2/1} / {1/1,3/1,4/1,5/1} - Obligation: derivational complexity wrt. signature {0,1,2,3,4,5} + Applied Processor: NaturalMI {miDimension = 2, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind triangular matrix interpretation (containing no more than 1 non-zero interpretation-entries in the diagonal of the component-wise maxima): Following symbols are considered usable: all TcT has computed the following interpretation: p(0) = [1 0] x1 + [0] [0 0] [1] p(1) = [1 1] x1 + [0] [0 0] [1] p(2) = [1 1] x1 + [0] [0 0] [1] p(3) = [1 1] x1 + [0] [0 0] [0] p(4) = [1 1] x1 + [0] [0 0] [0] p(5) = [1 0] x1 + [0] [0 0] [0] Following rules are strictly oriented: 0(0(3(2(1(x1))))) = [1 1] x1 + [2] [0 0] [1] > [1 1] x1 + [0] [0 0] [1] = 0(0(1(3(5(2(x1)))))) 0(3(1(x1))) = [1 1] x1 + [1] [0 0] [1] > [1 1] x1 + [0] [0 0] [1] = 0(1(3(4(4(x1))))) 0(3(1(1(x1)))) = [1 1] x1 + [2] [0 0] [1] > [1 1] x1 + [1]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144