details

property	value
status	complete
benchmark	96256.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n069.star.cs.uiowa.edu
space	ICFP_2010

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	294.182832003 seconds
cpu usage	1172.55322319
max memory	1.50837248E9

stage attributes

key	value
output-size	13743
starexec-result	WORST_CASE(?,O(n^1))

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(2(3(1(x1))))) -> 0(0(1(1(x1)))) 0(2(2(3(3(2(5(0(4(x1))))))))) -> 0(2(2(1(3(4(1(4(x1)))))))) 0(5(1(0(1(1(2(2(1(1(2(2(2(2(x1)))))))))))))) -> 0(3(0(5(3(1(3(0(3(4(2(3(3(1(4(x1))))))))))))))) 0(5(2(1(1(4(2(5(2(0(1(3(3(3(x1)))))))))))))) -> 0(4(0(4(4(4(5(0(2(4(0(3(2(2(x1)))))))))))))) 0(5(2(3(4(0(5(3(2(4(2(2(4(0(3(4(x1)))))))))))))))) -> 0(0(0(5(1(3(2(2(3(0(1(3(2(1(x1)))))))))))))) 1(1(4(0(4(2(1(2(4(5(3(x1))))))))))) -> 1(1(0(1(5(2(2(0(2(4(x1)))))))))) 2(2(0(1(4(3(5(4(2(2(5(1(0(5(0(5(4(5(2(x1))))))))))))))))))) -> 3(3(4(2(0(4(5(2(5(2(0(0(4(4(3(5(1(4(5(2(x1)))))))))))))))))))) 2(2(5(5(2(2(1(x1))))))) -> 3(2(3(3(1(0(x1)))))) 2(3(0(3(2(3(1(1(4(2(5(3(4(2(5(2(5(0(2(3(1(x1))))))))))))))))))))) -> 3(2(4(3(2(1(3(3(1(0(1(1(3(3(0(3(0(5(1(x1))))))))))))))))))) 2(3(0(4(0(0(5(2(4(x1))))))))) -> 3(2(2(2(3(0(4(0(4(x1))))))))) 2(3(5(3(3(4(1(5(1(2(x1)))))))))) -> 2(0(3(5(2(5(1(3(4(2(x1)))))))))) 2(4(3(3(3(5(0(1(3(x1))))))))) -> 0(1(0(0(5(0(5(x1))))))) 2(5(3(4(1(3(2(5(3(1(1(2(2(1(0(2(4(3(3(x1))))))))))))))))))) -> 0(3(5(2(3(1(1(0(3(4(3(4(0(0(5(2(2(3(x1)))))))))))))))))) 3(0(1(2(4(0(0(3(3(4(x1)))))))))) -> 3(1(5(0(4(2(0(2(5(4(x1)))))))))) 3(0(2(3(2(0(3(3(2(1(2(2(0(1(3(x1))))))))))))))) -> 2(1(5(3(2(1(2(2(0(4(0(1(3(1(x1)))))))))))))) 3(1(2(1(3(1(2(2(4(1(1(3(2(4(4(3(2(0(3(4(5(x1))))))))))))))))))))) -> 2(5(5(1(1(2(1(0(1(3(1(0(5(2(4(1(1(5(x1)))))))))))))))))) 3(1(2(4(0(0(3(3(1(4(5(x1))))))))))) -> 2(3(1(1(4(0(4(2(2(2(5(x1))))))))))) 4(3(0(4(1(0(4(1(5(0(3(x1))))))))))) -> 0(4(2(3(0(0(1(5(5(1(x1)))))))))) 4(4(2(5(3(3(1(1(3(1(1(0(5(3(1(4(x1)))))))))))))))) -> 4(2(4(4(4(2(1(5(5(4(3(3(0(5(1(5(4(x1))))))))))))))))) 4(5(2(1(1(3(4(x1))))))) -> 1(1(0(5(0(x1))))) 4(5(2(3(5(x1))))) -> 4(4(0(5(x1)))) 5(3(1(5(0(1(4(4(2(4(3(2(5(0(4(1(0(4(4(x1))))))))))))))))))) -> 5(2(2(4(1(1(5(2(3(4(2(5(2(0(2(0(2(5(4(x1))))))))))))))))))) 5(3(2(4(3(2(x1)))))) -> 5(3(0(5(4(x1))))) 5(3(5(1(1(5(4(2(2(4(1(5(0(5(4(3(x1)))))))))))))))) -> 0(0(4(2(2(1(3(2(1(0(5(1(1(1(x1)))))))))))))) 5(4(3(1(3(4(5(3(0(1(3(4(0(2(2(4(3(3(0(5(3(x1))))))))))))))))))))) -> 5(5(1(1(5(2(4(0(0(1(0(1(2(0(5(1(3(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) -> 73 0_1(2) -> 1 0_1(2) -> 2 0_1(2) -> 10 0_1(2) -> 33 0_1(2) -> 51 0_1(2) -> 73 0_1(2) -> 87 0_1(2) -> 105 0_1(2) -> 106 0_1(2) -> 162 0_1(3) -> 2 0_1(4) -> 2 0_1(10) -> 93 0_1(12) -> 11 0_1(17) -> 16 0_1(23) -> 22 0_1(28) -> 27 0_1(31) -> 30 0_1(34) -> 3 0_1(41) -> 40 0_1(44) -> 73 0_1(46) -> 45 0_1(51) -> 50 0_1(56) -> 55 0_1(62) -> 61 0_1(63) -> 62 0_1(81) -> 80 0_1(86) -> 85 0_1(88) -> 87 0_1(92) -> 91 0_1(95) -> 94 0_1(103) -> 102 0_1(104) -> 103 0_1(106) -> 105 0_1(112) -> 111 0_1(117) -> 116 0_1(118) -> 117 0_1(124) -> 123 0_1(125) -> 194 0_1(127) -> 126 0_1(128) -> 195 0_1(129) -> 73 0_1(136) -> 135 0_1(138) -> 137 0_1(146) -> 145 0_1(150) -> 149 0_1(159) -> 158 0_1(165) -> 164 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Deriv Compl Full Rewri 33144