Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922412
details
property
value
status
paused
benchmark
4979.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
space
ICFP_2010
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
0.0 seconds
cpu usage
0.0
max memory
0.0
stage attributes
unavailable
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(x1)) -> 0(4(4(5(1(1(3(1(2(1(x1)))))))))) 0(0(0(0(5(1(0(x1))))))) -> 3(0(5(0(5(5(0(4(0(2(x1)))))))))) 0(0(1(x1))) -> 0(4(1(3(0(2(1(5(0(1(x1)))))))))) 0(0(5(2(x1)))) -> 2(3(4(3(0(2(3(0(5(3(x1)))))))))) 0(3(3(5(4(x1))))) -> 0(3(3(2(4(3(3(0(3(4(x1)))))))))) 0(3(5(0(0(5(2(x1))))))) -> 2(1(4(4(3(2(5(1(4(3(x1)))))))))) 0(4(5(2(5(5(5(x1))))))) -> 0(4(1(4(0(1(3(2(2(3(x1)))))))))) 1(0(0(0(0(x1))))) -> 1(2(0(1(0(2(3(2(1(0(x1)))))))))) 1(0(1(0(1(x1))))) -> 3(5(5(4(4(1(3(1(3(2(x1)))))))))) 1(0(1(4(3(5(5(x1))))))) -> 3(3(0(3(5(4(3(4(0(1(x1)))))))))) 1(1(0(0(x1)))) -> 1(3(3(3(4(4(3(2(5(0(x1)))))))))) 1(2(0(0(1(3(x1)))))) -> 0(4(2(5(2(2(3(4(4(3(x1)))))))))) 1(5(1(0(0(4(3(x1))))))) -> 4(4(1(1(4(0(4(3(0(3(x1)))))))))) 2(0(0(1(0(0(x1)))))) -> 2(4(4(1(0(5(5(2(1(1(x1)))))))))) 2(0(0(4(5(1(3(x1))))))) -> 1(0(2(1(4(3(0(4(4(2(x1)))))))))) 2(0(5(5(0(1(x1)))))) -> 2(3(1(4(3(1(3(3(5(1(x1)))))))))) 2(4(1(5(1(0(x1)))))) -> 1(0(3(1(4(5(0(5(4(4(x1)))))))))) 2(5(5(4(1(0(x1)))))) -> 2(5(5(1(1(1(4(2(3(0(x1)))))))))) 3(0(0(3(5(x1))))) -> 3(3(3(4(5(2(3(3(2(4(x1)))))))))) 3(0(0(4(0(x1))))) -> 3(3(0(5(5(3(2(2(5(0(x1)))))))))) 3(0(0(5(5(1(3(x1))))))) -> 2(4(5(2(4(4(2(0(0(3(x1)))))))))) 3(5(2(5(5(1(x1)))))) -> 2(1(3(4(5(1(4(0(4(1(x1)))))))))) 4(0(x1)) -> 4(4(2(3(0(2(4(2(3(4(x1)))))))))) 4(0(0(x1))) -> 2(2(2(3(0(0(4(4(2(1(x1)))))))))) 4(0(0(1(x1)))) -> 2(2(2(3(3(0(2(3(5(1(x1)))))))))) 4(0(0(4(0(3(4(x1))))))) -> 3(3(3(3(0(1(5(4(0(4(x1)))))))))) 4(0(3(4(0(x1))))) -> 2(3(0(3(2(3(5(5(4(0(x1)))))))))) 4(1(0(3(4(3(x1)))))) -> 4(1(4(5(4(1(2(0(1(3(x1)))))))))) 4(2(4(0(0(1(5(x1))))))) -> 2(3(4(1(3(0(1(2(3(2(x1)))))))))) 4(3(0(4(0(3(4(x1))))))) -> 4(2(4(2(4(4(0(3(0(4(x1)))))))))) 5(0(0(0(0(0(x1)))))) -> 4(5(3(4(0(4(1(4(0(0(x1)))))))))) 5(0(0(0(3(x1))))) -> 5(1(4(2(3(0(0(2(1(3(x1)))))))))) 5(0(0(4(x1)))) -> 2(5(4(5(2(1(2(3(0(4(x1)))))))))) 5(0(1(5(x1)))) -> 3(5(3(4(4(3(2(2(1(5(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 3. The enriched problem is compatible with follwoing automaton. 0_0(1) -> 1 0_1(1) -> 63 0_1(2) -> 1 0_1(2) -> 10 0_1(2) -> 63 0_1(2) -> 96 0_1(2) -> 228 0_1(2) -> 258 0_1(2) -> 302 0_1(9) -> 264 0_1(10) -> 25 0_1(12) -> 11 0_1(14) -> 13 0_1(17) -> 16 0_1(19) -> 18 0_1(22) -> 21 0_1(30) -> 29 0_1(33) -> 32 0_1(34) -> 96 0_1(41) -> 40 0_1(42) -> 228 0_1(51) -> 50 0_1(55) -> 96 0_1(57) -> 56 0_1(59) -> 58 0_1(63) -> 258 0_1(72) -> 71 0_1(94) -> 93 0_1(96) -> 141 0_1(100) -> 99 0_1(104) -> 55 0_1(109) -> 108 0_1(121) -> 120 0_1(147) -> 146 0_1(150) -> 149 0_1(210) -> 209 0_1(211) -> 210 0_1(223) -> 222 0_1(225) -> 224 0_1(229) -> 27 0_1(241) -> 240 0_1(244) -> 243 0_1(251) -> 250 0_1(255) -> 254 0_1(264) -> 263 0_1(265) -> 264 0_2(157) -> 156
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144