Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922464
details
property
value
status
timeout (wallclock)
benchmark
4106.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)
294.260823965 seconds
cpu usage
1288.07924994
max memory
1.433042944E10
stage attributes
unavailable
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^1)) * Step 1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: 0(2(5(4(3(2(x1)))))) -> 0(2(1(5(2(0(1(2(1(2(x1)))))))))) 1(0(5(2(3(4(x1)))))) -> 1(0(0(1(3(0(4(1(0(3(x1)))))))))) 1(1(5(0(2(3(x1)))))) -> 0(0(4(5(1(1(1(2(2(3(x1)))))))))) 1(4(0(5(5(0(5(x1))))))) -> 1(4(3(3(0(4(1(5(3(3(x1)))))))))) 1(5(0(x1))) -> 1(4(4(4(4(0(4(0(1(1(x1)))))))))) 2(1(0(0(3(2(x1)))))) -> 2(1(4(3(0(0(3(0(3(2(x1)))))))))) 2(2(3(5(1(2(5(x1))))))) -> 2(2(1(2(4(0(3(3(2(5(x1)))))))))) 2(3(0(4(x1)))) -> 2(0(0(1(1(3(0(2(4(4(x1)))))))))) 2(3(5(x1))) -> 2(4(0(0(1(5(1(2(2(1(x1)))))))))) 2(5(x1)) -> 2(4(0(0(4(1(0(0(1(3(x1)))))))))) 2(5(x1)) -> 2(4(3(0(2(2(2(1(4(3(x1)))))))))) 2(5(0(5(5(5(x1)))))) -> 2(0(1(2(4(0(5(3(5(5(x1)))))))))) 2(5(3(0(2(1(x1)))))) -> 2(1(4(5(2(1(2(5(2(1(x1)))))))))) 2(5(5(x1))) -> 2(0(3(0(4(0(3(3(3(4(x1)))))))))) 3(1(5(2(5(x1))))) -> 3(0(2(4(1(2(0(0(5(2(x1)))))))))) 3(4(2(3(3(5(5(x1))))))) -> 5(3(2(4(0(2(4(4(0(5(x1)))))))))) 3(5(0(4(5(5(x1)))))) -> 3(4(0(3(4(5(2(0(3(3(x1)))))))))) 4(0(2(3(4(2(x1)))))) -> 4(0(0(3(1(4(3(0(2(2(x1)))))))))) 4(2(5(3(4(5(5(x1))))))) -> 5(1(5(2(5(0(4(1(1(0(x1)))))))))) 4(2(5(5(4(2(4(x1))))))) -> 5(5(3(2(0(2(1(0(3(0(x1)))))))))) 4(5(4(x1))) -> 4(1(1(1(2(1(4(5(2(4(x1)))))))))) 4(5(5(4(2(3(2(x1))))))) -> 4(1(1(5(3(5(1(2(4(2(x1)))))))))) 5(2(5(5(1(0(x1)))))) -> 5(5(4(4(0(4(2(0(1(4(x1)))))))))) 5(4(2(3(0(5(x1)))))) -> 5(5(4(5(4(3(4(1(3(1(x1)))))))))) 5(5(1(0(x1)))) -> 3(2(2(0(5(1(3(4(0(4(x1)))))))))) 5(5(1(1(1(5(x1)))))) -> 5(0(1(0(1(1(0(1(4(1(x1)))))))))) 5(5(2(5(5(0(x1)))))) -> 3(4(5(2(5(3(4(4(1(0(x1)))))))))) 5(5(4(5(5(4(x1)))))) -> 2(2(2(5(5(4(3(4(0(4(x1)))))))))) 5(5(5(5(2(5(x1)))))) -> 2(2(3(1(1(4(3(2(4(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 2. The enriched problem is compatible with follwoing automaton. 0_0(1) -> 1 0_1(1) -> 149 0_1(2) -> 1 0_1(2) -> 39 0_1(2) -> 40 0_1(2) -> 149 0_1(7) -> 6 0_1(12) -> 11 0_1(13) -> 12 0_1(16) -> 15 0_1(19) -> 18 0_1(20) -> 2 0_1(30) -> 29 0_1(33) -> 133 0_1(37) -> 36 0_1(39) -> 38 0_1(45) -> 44 0_1(46) -> 45 0_1(48) -> 47 0_1(53) -> 52 0_1(56) -> 127 0_1(57) -> 41 0_1(58) -> 57 0_1(62) -> 61 0_1(64) -> 186 0_1(65) -> 149 0_1(66) -> 65 0_1(67) -> 66 0_1(74) -> 73 0_1(75) -> 74 0_1(86) -> 85 0_1(100) -> 99 0_1(106) -> 119 0_1(108) -> 107 0_1(110) -> 109 0_1(114) -> 113 0_1(119) -> 118 0_1(120) -> 149 0_1(124) -> 123 0_1(129) -> 128 0_1(134) -> 149 0_1(135) -> 134 0_1(136) -> 135 0_1(141) -> 140 0_1(146) -> 145 0_1(150) -> 186 0_1(153) -> 152 0_1(155) -> 44 0_1(156) -> 155 0_1(171) -> 170 0_1(174) -> 173 0_1(182) -> 181
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144