Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922363
details
property
value
status
complete
benchmark
96334.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n071.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
294.30190897 seconds
cpu usage
1173.95229683
max memory
2.321760256E9
stage attributes
key
value
output-size
13300
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(0(5(0(4(x1)))))) -> 0(1(5(5(1(x1))))) 0(1(1(2(3(x1))))) -> 0(1(3(3(4(x1))))) 0(4(0(0(3(1(4(1(2(x1))))))))) -> 2(5(3(2(2(1(2(2(x1)))))))) 1(0(5(5(1(2(4(x1))))))) -> 2(5(4(5(1(1(4(x1))))))) 1(1(1(3(3(0(0(1(2(2(5(1(4(4(4(5(4(3(4(1(x1)))))))))))))))))))) -> 3(4(0(2(1(0(4(1(0(3(1(4(0(3(4(2(0(5(x1)))))))))))))))))) 1(2(3(2(1(4(5(2(5(4(5(x1))))))))))) -> 2(1(2(4(2(2(3(0(2(1(x1)))))))))) 1(4(2(1(4(x1))))) -> 1(1(1(0(x1)))) 1(4(5(1(4(x1))))) -> 5(5(5(2(x1)))) 1(5(4(3(4(4(3(3(4(5(4(1(5(5(0(1(4(0(2(x1))))))))))))))))))) -> 0(4(3(3(2(2(0(5(1(0(4(4(3(2(3(5(4(2(x1)))))))))))))))))) 1(5(5(5(3(2(0(1(3(4(0(2(5(0(0(3(4(3(x1)))))))))))))))))) -> 5(4(3(1(4(2(4(5(4(5(0(3(1(0(2(2(1(3(x1)))))))))))))))))) 2(0(5(2(5(x1))))) -> 2(2(3(2(1(x1))))) 2(4(0(0(0(3(3(3(3(0(0(4(x1)))))))))))) -> 2(0(0(2(0(4(4(3(1(0(2(x1))))))))))) 3(0(3(1(2(0(1(2(2(4(0(4(x1)))))))))))) -> 0(4(1(4(3(2(0(2(5(4(3(3(x1)))))))))))) 3(0(3(4(3(3(5(1(0(4(5(0(0(0(2(2(1(4(x1)))))))))))))))))) -> 0(1(5(5(0(1(5(0(5(0(0(4(0(4(3(4(x1)))))))))))))))) 3(2(0(3(1(4(3(1(0(5(5(1(3(4(2(1(5(4(3(x1))))))))))))))))))) -> 3(0(3(1(1(3(0(4(1(1(2(1(5(2(0(0(4(2(3(x1))))))))))))))))))) 4(0(2(5(2(1(1(2(0(1(2(1(x1)))))))))))) -> 0(2(0(0(0(1(0(1(5(2(1(x1))))))))))) 4(0(2(5(4(3(5(x1))))))) -> 1(1(3(5(1(5(x1)))))) 4(1(1(5(1(4(3(3(0(3(0(5(4(1(0(4(2(1(4(1(x1)))))))))))))))))))) -> 4(3(4(5(3(1(1(4(1(3(0(2(0(2(5(1(1(3(1(x1))))))))))))))))))) 4(2(0(4(2(2(5(0(5(3(5(x1))))))))))) -> 4(5(2(5(1(2(4(5(4(3(3(5(x1)))))))))))) 4(2(5(1(1(3(1(3(2(5(5(4(3(5(5(4(x1)))))))))))))))) -> 4(2(2(5(1(0(2(5(1(0(3(0(3(5(3(x1))))))))))))))) 4(3(4(5(2(4(4(5(4(3(4(3(x1)))))))))))) -> 2(5(3(0(2(5(2(4(4(1(3(x1))))))))))) 5(4(2(4(0(4(1(4(4(2(0(1(3(4(1(3(5(4(4(4(x1)))))))))))))))))))) -> 5(4(4(2(2(1(4(4(5(1(4(5(4(5(2(2(0(3(x1)))))))))))))))))) 5(4(4(5(3(5(2(2(3(4(0(2(0(3(2(5(4(3(x1)))))))))))))))))) -> 5(4(0(5(1(1(1(1(3(2(0(0(3(5(0(1(3(x1))))))))))))))))) 5(4(5(4(2(5(0(1(5(4(x1)))))))))) -> 0(0(1(2(1(2(3(2(2(x1))))))))) 5(5(4(1(1(1(3(2(2(5(1(2(3(5(4(x1))))))))))))))) -> 5(5(0(3(1(2(0(2(0(2(0(4(1(2(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) -> 44 0_1(2) -> 1 0_1(2) -> 5 0_1(2) -> 7 0_1(2) -> 34 0_1(2) -> 44 0_1(2) -> 60 0_1(2) -> 77 0_1(2) -> 129 0_1(14) -> 90 0_1(20) -> 19 0_1(23) -> 22 0_1(26) -> 25 0_1(30) -> 29 0_1(34) -> 33 0_1(41) -> 40 0_1(52) -> 51 0_1(55) -> 54 0_1(61) -> 118 0_1(71) -> 70 0_1(74) -> 73 0_1(76) -> 198 0_1(77) -> 186 0_1(83) -> 8 0_1(84) -> 83 0_1(86) -> 85 0_1(95) -> 94 0_1(99) -> 4 0_1(101) -> 100 0_1(102) -> 101 0_1(104) -> 103 0_1(105) -> 18 0_1(110) -> 109 0_1(118) -> 117 0_1(119) -> 118 0_1(122) -> 121 0_1(123) -> 122 0_1(124) -> 123 0_1(126) -> 125 0_1(130) -> 44 0_1(140) -> 139 0_1(142) -> 141 0_1(160) -> 159 0_1(164) -> 163 0_1(166) -> 165 0_1(168) -> 10 0_1(187) -> 62
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144