Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922677
details
property
value
status
complete
benchmark
96289.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
294.188531876 seconds
cpu usage
1172.93295211
max memory
2.384744448E9
stage attributes
key
value
output-size
13272
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: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: 0(0(5(2(2(0(x1)))))) -> 3(5(0(3(2(x1))))) 0(1(2(2(x1)))) -> 3(3(2(x1))) 0(4(4(2(5(4(5(0(3(5(3(4(3(1(4(1(2(1(0(x1))))))))))))))))))) -> 3(0(4(0(2(0(5(3(2(5(3(4(4(3(4(4(3(4(x1)))))))))))))))))) 0(5(1(5(4(0(4(1(0(x1))))))))) -> 2(4(2(1(1(2(5(5(x1)))))))) 1(1(1(5(1(0(5(3(1(5(4(4(0(0(x1)))))))))))))) -> 5(5(2(4(4(0(4(0(5(0(4(2(4(5(x1)))))))))))))) 1(1(5(4(0(2(0(3(4(0(2(x1))))))))))) -> 1(5(0(4(2(2(0(0(3(0(1(x1))))))))))) 1(4(1(2(3(5(3(0(0(5(3(4(2(2(2(5(2(1(x1)))))))))))))))))) -> 1(5(4(4(3(4(1(0(3(4(5(0(0(5(5(1(2(5(x1)))))))))))))))))) 1(4(3(0(0(5(1(4(3(x1))))))))) -> 5(4(2(5(2(2(4(3(x1)))))))) 2(0(1(2(0(3(x1)))))) -> 2(5(3(2(3(x1))))) 2(1(5(4(3(5(0(1(2(1(4(5(0(1(2(2(3(4(x1)))))))))))))))))) -> 0(0(0(0(4(5(2(0(2(0(1(2(5(1(5(2(1(4(x1)))))))))))))))))) 2(5(2(3(4(0(0(4(4(3(x1)))))))))) -> 3(0(3(5(2(1(2(2(3(x1))))))))) 3(3(1(4(4(2(2(1(1(3(4(x1))))))))))) -> 3(3(3(5(5(5(4(1(2(3(x1)))))))))) 4(0(0(5(2(4(3(4(3(4(4(0(0(3(x1)))))))))))))) -> 3(0(3(4(0(1(2(4(0(5(2(5(3(x1))))))))))))) 4(0(1(5(3(3(4(0(4(4(4(5(4(0(2(x1))))))))))))))) -> 4(4(0(1(5(5(3(1(3(4(1(4(4(4(1(x1))))))))))))))) 4(1(1(0(2(x1))))) -> 0(3(2(0(x1)))) 4(1(5(0(3(4(0(3(2(5(5(0(4(0(0(3(x1)))))))))))))))) -> 2(1(3(3(4(2(1(4(3(0(0(0(1(2(3(x1))))))))))))))) 4(2(1(3(2(4(4(2(4(2(x1)))))))))) -> 3(0(3(3(4(1(3(4(2(2(x1)))))))))) 4(2(4(5(0(4(0(5(3(1(0(5(3(x1))))))))))))) -> 4(0(4(5(5(0(3(0(5(5(5(4(x1)))))))))))) 4(2(5(0(2(3(3(2(1(4(0(2(4(0(2(5(3(4(x1)))))))))))))))))) -> 4(0(2(4(5(2(2(1(0(2(3(0(5(1(4(5(2(4(x1)))))))))))))))))) 4(4(2(0(3(1(2(0(0(0(1(x1))))))))))) -> 4(0(0(3(3(1(1(5(0(1(x1)))))))))) 4(4(4(3(1(1(3(0(3(0(3(x1))))))))))) -> 1(4(3(4(4(3(5(3(0(3(x1)))))))))) 4(5(2(1(1(3(3(5(4(4(4(4(3(3(4(0(2(1(4(2(2(x1))))))))))))))))))))) -> 2(1(4(3(1(3(1(1(1(2(3(4(3(4(4(2(3(0(2(1(x1)))))))))))))))))))) 4(5(3(4(5(x1))))) -> 2(3(1(5(x1)))) 4(5(4(0(3(0(2(1(5(5(4(2(2(x1))))))))))))) -> 2(1(0(0(1(2(0(0(4(0(1(2(3(3(x1)))))))))))))) 5(2(5(0(1(1(3(0(4(4(2(4(3(2(x1)))))))))))))) -> 5(3(2(0(1(2(5(1(2(2(5(1(3(x1))))))))))))) - Signature: {0/1,1/1,2/1,3/1,4/1,5/1} / {} - Obligation: derivational complexity wrt. signature {0,1,2,3,4,5} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. 0_0(1) -> 1 0_1(1) -> 168 0_1(4) -> 3 0_1(6) -> 2 0_1(9) -> 8 0_1(11) -> 10 0_1(38) -> 168 0_1(50) -> 49 0_1(52) -> 51 0_1(54) -> 53 0_1(59) -> 58 0_1(63) -> 62 0_1(64) -> 63 0_1(66) -> 65 0_1(72) -> 71 0_1(76) -> 75 0_1(77) -> 76 0_1(86) -> 229 0_1(89) -> 1 0_1(89) -> 5 0_1(89) -> 29 0_1(89) -> 166 0_1(89) -> 245 0_1(89) -> 266 0_1(90) -> 89 0_1(91) -> 90 0_1(92) -> 91 0_1(96) -> 95 0_1(98) -> 97 0_1(109) -> 178 0_1(123) -> 178 0_1(131) -> 130 0_1(139) -> 138 0_1(156) -> 155 0_1(177) -> 176 0_1(178) -> 177 0_1(196) -> 154 0_1(200) -> 199 0_1(202) -> 201 0_1(211) -> 210 0_1(214) -> 213 0_1(218) -> 196 0_1(245) -> 244 0_1(247) -> 169 0_1(248) -> 247 0_1(251) -> 250 0_1(252) -> 251 0_1(257) -> 256 1_0(1) -> 1 1_1(1) -> 66 1_1(5) -> 109
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144