Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922617
details
property
value
status
complete
benchmark
88183.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n042.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
294.163496017 seconds
cpu usage
1173.33689288
max memory
4.378103808E9
stage attributes
key
value
output-size
19794
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(0(0(0(1(2(2(1(0(3(2(3(x1))))))))))))) -> 1(1(2(2(3(0(2(2(0(1(2(0(2(2(1(3(2(x1))))))))))))))))) 0(0(2(3(2(1(0(2(1(2(0(3(0(x1))))))))))))) -> 3(2(2(2(2(3(3(3(2(2(3(0(2(2(2(0(0(x1))))))))))))))))) 0(1(0(2(1(0(3(2(0(3(0(2(0(x1))))))))))))) -> 0(3(3(2(2(3(2(2(2(0(1(0(2(0(3(2(0(x1))))))))))))))))) 0(1(2(2(0(2(2(3(0(1(1(1(3(x1))))))))))))) -> 0(2(2(2(1(3(1(2(3(0(2(0(0(2(2(1(1(x1))))))))))))))))) 0(3(0(2(0(0(2(1(2(3(1(3(2(x1))))))))))))) -> 1(0(2(2(1(1(3(0(2(0(0(0(2(2(0(3(2(x1))))))))))))))))) 1(2(2(1(0(0(1(0(3(2(1(2(3(x1))))))))))))) -> 1(2(2(1(3(3(0(2(2(0(2(2(2(0(0(2(1(x1))))))))))))))))) 1(3(0(1(1(1(2(3(1(3(0(2(2(x1))))))))))))) -> 0(2(0(2(2(0(1(1(2(2(2(3(2(0(2(2(1(x1))))))))))))))))) 1(3(3(1(0(1(3(2(2(2(0(0(3(x1))))))))))))) -> 0(2(1(2(2(0(0(0(2(2(2(0(1(2(2(0(1(x1))))))))))))))))) 1(3(3(2(2(0(1(1(1(1(2(0(3(x1))))))))))))) -> 1(2(2(2(3(2(0(2(1(1(2(2(1(3(1(2(1(x1))))))))))))))))) 1(3(3(3(2(2(3(1(2(2(3(3(1(x1))))))))))))) -> 2(1(2(1(2(3(0(2(2(0(0(2(2(2(1(3(1(x1))))))))))))))))) 2(0(0(1(2(0(3(2(3(2(2(3(2(x1))))))))))))) -> 2(0(2(3(0(2(2(1(3(2(2(0(0(0(2(0(2(x1))))))))))))))))) 2(0(0(2(3(2(3(2(1(0(3(2(1(x1))))))))))))) -> 2(0(0(0(0(0(2(2(2(2(1(3(2(2(3(2(1(x1))))))))))))))))) 2(0(1(0(2(2(0(3(0(0(3(3(0(x1))))))))))))) -> 2(0(2(0(2(3(1(1(2(3(1(2(2(2(0(2(0(x1))))))))))))))))) 2(0(1(1(1(3(2(0(0(0(1(0(1(x1))))))))))))) -> 2(1(2(2(2(2(2(0(2(3(2(0(2(1(0(0(0(x1))))))))))))))))) 2(0(3(3(1(0(3(1(2(2(2(2(1(x1))))))))))))) -> 2(2(3(1(0(1(2(2(3(2(2(0(0(1(1(2(2(x1))))))))))))))))) 2(1(0(3(3(0(0(3(1(1(2(3(2(x1))))))))))))) -> 2(1(1(3(1(0(0(2(2(2(1(3(1(1(3(1(2(x1))))))))))))))))) 2(1(1(2(1(1(1(1(1(2(0(3(0(x1))))))))))))) -> 2(1(1(1(0(0(2(0(2(2(0(1(3(2(0(1(0(x1))))))))))))))))) 2(1(1(2(2(3(0(0(3(3(1(3(2(x1))))))))))))) -> 2(1(3(1(0(2(0(3(2(3(2(2(3(2(0(2(2(x1))))))))))))))))) 2(1(1(3(2(3(3(1(0(0(1(2(0(x1))))))))))))) -> 2(3(3(1(2(2(2(1(1(2(2(1(0(3(2(2(3(x1))))))))))))))))) 2(1(1(3(3(0(1(0(0(0(2(1(3(x1))))))))))))) -> 2(0(2(2(1(3(0(2(1(2(3(2(0(0(2(3(0(x1))))))))))))))))) 2(1(2(3(1(2(3(3(2(3(3(1(1(x1))))))))))))) -> 2(2(3(0(0(2(2(1(2(0(1(0(2(0(3(1(2(x1))))))))))))))))) 2(2(0(2(3(2(3(3(1(1(1(3(3(x1))))))))))))) -> 2(2(2(2(2(3(3(3(1(1(3(2(3(2(2(2(2(x1))))))))))))))))) 2(2(1(0(2(3(3(3(0(1(1(1(1(x1))))))))))))) -> 2(0(2(3(1(2(0(2(2(3(2(2(3(2(2(2(2(x1))))))))))))))))) 2(2(1(1(2(0(1(1(0(3(3(0(1(x1))))))))))))) -> 0(2(2(1(0(0(0(1(2(2(0(2(3(1(2(2(0(x1))))))))))))))))) 2(2(1(1(3(1(3(2(0(1(0(0(1(x1))))))))))))) -> 0(0(0(2(2(1(3(0(3(0(0(2(2(3(0(1(1(x1))))))))))))))))) 2(3(0(0(1(2(1(2(3(0(2(1(1(x1))))))))))))) -> 2(2(2(0(1(3(3(0(3(2(0(2(2(0(0(2(2(x1))))))))))))))))) 2(3(2(0(0(0(0(0(3(1(0(2(3(x1))))))))))))) -> 2(3(0(0(2(2(2(1(1(1(3(2(1(3(1(3(2(x1))))))))))))))))) 3(0(1(2(2(3(3(2(2(2(0(1(3(x1))))))))))))) -> 3(1(2(2(0(2(2(0(2(2(1(3(0(0(2(2(1(x1))))))))))))))))) 3(1(2(1(2(3(0(2(1(2(1(2(3(x1))))))))))))) -> 0(0(2(2(2(3(1(0(1(3(2(2(0(1(2(2(2(x1))))))))))))))))) 3(2(0(3(2(0(2(3(1(0(3(2(3(x1))))))))))))) -> 2(1(1(1(3(2(2(0(0(2(3(2(1(2(2(1(3(x1))))))))))))))))) - Signature: {0/1,1/1,2/1,3/1} / {} - Obligation: derivational complexity wrt. signature {0,1,2,3} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 1. The enriched problem is compatible with follwoing automaton. 0_0(1) -> 1 0_1(1) -> 33 0_1(2) -> 33 0_1(7) -> 6 0_1(10) -> 9 0_1(13) -> 12 0_1(16) -> 76 0_1(17) -> 155 0_1(18) -> 155 0_1(29) -> 28 0_1(32) -> 189 0_1(33) -> 32 0_1(34) -> 1 0_1(34) -> 17 0_1(34) -> 33 0_1(34) -> 60 0_1(34) -> 63 0_1(34) -> 102 0_1(34) -> 115 0_1(34) -> 125 0_1(34) -> 141 0_1(34) -> 203 0_1(34) -> 215 0_1(34) -> 227 0_1(34) -> 255 0_1(34) -> 372 0_1(43) -> 42 0_1(45) -> 44 0_1(47) -> 46 0_1(48) -> 178 0_1(57) -> 56 0_1(59) -> 58 0_1(60) -> 59 0_1(62) -> 318 0_1(63) -> 115 0_1(64) -> 2 0_1(70) -> 69 0_1(72) -> 71 0_1(73) -> 72 0_1(74) -> 73 0_1(82) -> 81 0_1(85) -> 84 0_1(89) -> 88 0_1(90) -> 89 0_1(91) -> 49 0_1(94) -> 93 0_1(101) -> 350 0_1(102) -> 101 0_1(106) -> 105 0_1(107) -> 106 0_1(108) -> 107
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144