details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	295.128129959 seconds
cpu usage	1175.32124671
max memory	1.619324928E9

stage attributes

key	value
output-size	17211
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(1(1(x1))) -> 2(1(1(x1))) 0(2(3(0(2(0(3(5(2(4(x1)))))))))) -> 2(0(4(5(4(4(5(4(0(x1))))))))) 0(5(0(3(3(3(2(3(1(1(1(2(5(1(2(5(x1)))))))))))))))) -> 0(5(1(4(3(3(4(4(1(1(4(1(0(1(4(x1))))))))))))))) 1(3(0(5(3(1(1(1(0(3(3(0(1(3(3(4(3(5(3(0(5(x1))))))))))))))))))))) -> 1(5(3(3(1(3(3(4(0(5(5(0(3(2(4(1(2(3(3(4(5(x1))))))))))))))))))))) 1(3(3(2(1(4(4(0(x1)))))))) -> 1(1(3(0(4(4(0(2(x1)))))))) 2(2(1(4(0(x1))))) -> 2(2(1(3(5(x1))))) 2(2(1(5(0(2(2(2(4(x1))))))))) -> 2(0(0(4(5(5(0(x1))))))) 2(4(0(5(0(0(4(4(2(2(3(5(3(4(5(0(x1)))))))))))))))) -> 2(3(1(3(0(1(1(1(0(5(5(0(2(3(4(0(x1)))))))))))))))) 2(5(0(5(2(1(3(1(4(5(5(0(0(2(3(0(3(2(4(3(x1)))))))))))))))))))) -> 0(2(0(0(3(1(4(2(5(2(0(5(4(4(1(1(0(4(3(x1))))))))))))))))))) 2(5(2(1(1(0(4(3(3(0(4(5(4(3(0(4(1(0(4(0(x1)))))))))))))))))))) -> 5(1(1(0(1(3(5(5(0(5(3(4(5(1(0(0(2(3(2(0(x1)))))))))))))))))))) 3(0(2(0(2(1(2(5(4(3(5(4(x1)))))))))))) -> 3(2(2(0(3(0(5(4(5(1(5(4(x1)))))))))))) 3(0(5(4(5(3(0(0(0(5(1(1(x1)))))))))))) -> 3(2(4(1(4(0(3(0(2(1(1(3(x1)))))))))))) 3(1(3(5(4(1(0(4(1(2(4(2(3(3(1(3(1(3(x1)))))))))))))))))) -> 0(3(3(0(0(3(3(4(4(1(4(1(5(2(2(4(3(x1))))))))))))))))) 3(2(0(2(1(1(4(1(3(1(4(5(2(4(x1)))))))))))))) -> 0(2(2(4(4(5(4(1(0(0(5(0(0(x1))))))))))))) 3(2(3(1(3(5(5(2(2(0(x1)))))))))) -> 4(0(0(0(0(2(2(2(0(x1))))))))) 3(3(0(2(0(1(4(5(5(5(0(x1))))))))))) -> 1(2(3(5(4(4(0(2(3(5(5(x1))))))))))) 3(3(0(4(4(1(1(1(3(1(2(1(x1)))))))))))) -> 3(3(5(3(0(1(4(4(0(0(1(x1))))))))))) 3(3(0(5(3(5(1(2(5(1(2(1(2(1(4(0(1(2(3(1(5(x1))))))))))))))))))))) -> 0(2(0(5(5(4(5(2(5(0(0(4(2(0(5(5(5(3(1(5(x1)))))))))))))))))))) 3(4(0(x1))) -> 4(5(5(x1))) 3(4(0(2(1(1(0(4(1(1(0(2(3(5(3(x1))))))))))))))) -> 2(4(5(0(0(3(0(3(0(4(4(1(1(3(x1)))))))))))))) 3(4(1(1(0(0(5(0(5(0(x1)))))))))) -> 3(0(1(0(1(1(3(0(4(5(x1)))))))))) 4(1(3(0(0(5(1(5(0(1(x1)))))))))) -> 4(0(4(2(2(3(0(3(0(1(x1)))))))))) 4(1(3(3(0(5(2(3(3(3(0(5(4(3(x1)))))))))))))) -> 4(4(2(2(0(3(1(1(5(1(3(0(5(3(x1)))))))))))))) 4(5(3(1(0(0(4(x1))))))) -> 4(5(0(1(4(5(4(x1))))))) 5(5(1(4(1(3(4(2(3(4(3(1(2(0(5(x1))))))))))))))) -> 1(3(5(1(1(2(1(2(0(3(0(1(1(2(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 = perSymbol, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. 0_0(1) -> 1 0_0(2) -> 1 0_0(3) -> 1 0_0(4) -> 1 0_0(5) -> 1 0_0(6) -> 1 0_1(1) -> 15 0_1(2) -> 15 0_1(3) -> 15 0_1(4) -> 15 0_1(5) -> 15 0_1(6) -> 15 0_1(7) -> 175 0_1(8) -> 175 0_1(9) -> 7 0_1(15) -> 152 0_1(16) -> 1 0_1(16) -> 15 0_1(17) -> 15 0_1(28) -> 27 0_1(38) -> 37 0_1(41) -> 40 0_1(48) -> 214 0_1(52) -> 51 0_1(55) -> 54 0_1(59) -> 56 0_1(60) -> 59 0_1(66) -> 65 0_1(70) -> 69 0_1(73) -> 72 0_1(75) -> 3 0_1(75) -> 55 0_1(77) -> 76 0_1(78) -> 77 0_1(85) -> 84 0_1(91) -> 90 0_1(93) -> 15 0_1(96) -> 95 0_1(101) -> 100 0_1(107) -> 106 0_1(108) -> 107 0_1(114) -> 113 0_1(116) -> 115 0_1(124) -> 123 0_1(126) -> 125 0_1(129) -> 4 0_1(129) -> 92 0_1(129) -> 109 0_1(132) -> 131 0_1(133) -> 132 0_1(150) -> 149 popout

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

job log

popout

actions

all output return to Deriv Compl Full Rewri 33144