Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922434
details
property
value
status
paused
benchmark
4943.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/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(1(0(2(1(x1))))) -> 2(2(0(0(0(4(0(1(2(1(x1)))))))))) 0(3(5(5(2(0(x1)))))) -> 2(2(0(1(2(0(0(2(3(4(x1)))))))))) 0(5(1(0(x1)))) -> 0(5(2(2(4(3(0(2(2(2(x1)))))))))) 0(5(4(5(3(0(5(x1))))))) -> 0(4(2(4(4(4(3(0(0(5(x1)))))))))) 1(0(0(3(5(4(x1)))))) -> 1(0(3(3(4(1(3(3(4(4(x1)))))))))) 1(0(1(0(x1)))) -> 1(0(3(2(0(4(4(2(4(2(x1)))))))))) 1(0(3(1(x1)))) -> 1(2(3(3(2(4(4(3(0(1(x1)))))))))) 1(0(5(0(1(x1))))) -> 5(0(2(2(3(4(0(2(0(1(x1)))))))))) 1(0(5(5(3(2(5(x1))))))) -> 3(5(5(3(3(0(2(0(4(5(x1)))))))))) 1(1(0(x1))) -> 4(0(1(1(4(0(0(3(3(4(x1)))))))))) 1(5(3(0(3(1(x1)))))) -> 1(2(2(1(3(0(4(4(3(1(x1)))))))))) 1(5(4(1(2(5(x1)))))) -> 1(4(4(0(2(4(2(0(3(5(x1)))))))))) 2(1(0(5(x1)))) -> 2(3(4(4(2(0(2(3(0(5(x1)))))))))) 3(0(4(5(1(0(x1)))))) -> 4(1(4(2(3(4(4(2(4(0(x1)))))))))) 3(0(5(3(2(5(x1)))))) -> 4(3(1(1(3(3(2(0(0(5(x1)))))))))) 3(0(5(3(4(1(x1)))))) -> 4(2(4(3(0(3(1(1(4(1(x1)))))))))) 3(0(5(3(5(3(0(x1))))))) -> 1(1(2(4(1(2(0(1(4(0(x1)))))))))) 3(1(0(1(5(5(1(x1))))))) -> 2(4(1(1(3(3(3(3(1(1(x1)))))))))) 3(1(0(5(2(x1))))) -> 2(1(4(0(2(5(5(2(2(3(x1)))))))))) 3(2(5(3(0(1(0(x1))))))) -> 2(4(1(2(3(4(3(1(1(2(x1)))))))))) 3(3(5(3(4(5(3(x1))))))) -> 0(2(2(4(2(2(1(1(1(2(x1)))))))))) 3(4(2(5(0(2(1(x1))))))) -> 3(0(4(3(2(4(4(0(0(1(x1)))))))))) 3(4(3(2(1(4(4(x1))))))) -> 3(4(3(4(3(0(3(3(0(2(x1)))))))))) 3(5(2(3(5(3(4(x1))))))) -> 3(5(1(0(3(0(0(2(4(2(x1)))))))))) 4(1(2(1(1(0(x1)))))) -> 4(5(3(3(0(1(1(4(0(2(x1)))))))))) 4(4(4(5(0(5(x1)))))) -> 3(4(3(3(2(4(2(4(1(4(x1)))))))))) 4(4(5(3(0(x1))))) -> 4(3(1(1(3(2(0(3(3(0(x1)))))))))) 4(4(5(3(2(1(0(x1))))))) -> 4(0(5(4(1(2(2(2(3(0(x1)))))))))) 4(5(1(0(0(5(1(x1))))))) -> 5(5(2(2(2(5(5(5(1(4(x1)))))))))) 4(5(1(3(1(2(3(x1))))))) -> 5(4(1(1(1(2(3(4(0(2(x1)))))))))) 5(1(4(5(2(5(3(x1))))))) -> 5(5(1(4(2(3(0(0(3(4(x1)))))))))) 5(1(5(4(2(5(1(x1))))))) -> 5(5(2(3(0(3(4(2(1(0(x1)))))))))) 5(2(0(4(5(1(x1)))))) -> 5(2(2(2(3(1(0(4(0(3(x1)))))))))) 5(4(5(0(5(2(3(x1))))))) -> 5(1(1(4(2(3(0(1(3(0(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) -> 31 0_1(2) -> 1 0_1(4) -> 3 0_1(5) -> 4 0_1(6) -> 5 0_1(8) -> 7 0_1(10) -> 53 0_1(13) -> 12 0_1(14) -> 13 0_1(15) -> 215 0_1(16) -> 67 0_1(17) -> 1 0_1(17) -> 31 0_1(17) -> 32 0_1(17) -> 103 0_1(17) -> 194 0_1(23) -> 22 0_1(25) -> 178 0_1(30) -> 227 0_1(32) -> 31 0_1(33) -> 32 0_1(34) -> 31 0_1(35) -> 34 0_1(43) -> 42 0_1(45) -> 182 0_1(53) -> 31 0_1(55) -> 54 0_1(60) -> 59 0_1(61) -> 31 0_1(66) -> 65 0_1(68) -> 67 0_1(70) -> 69 0_1(74) -> 73 0_1(75) -> 74 0_1(88) -> 87 0_1(90) -> 96 0_1(93) -> 92 0_1(97) -> 96 0_1(98) -> 31 0_1(102) -> 101 0_1(103) -> 227 0_1(128) -> 127 0_1(137) -> 136 0_1(145) -> 144 0_1(168) -> 61 0_1(176) -> 175
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144