btm2x5-was nun?time mysql_c_program q=2 k=11 n=157 d=70 b=1 t=10000 solver nc=1 groupid=39811 paraa=15000.0 computecode wir rechnen f�r: q=2 k=11 n=157 d=70 b=1 t=10000 gid=39811 numberoforbits=143 maxcols=-1 mit zwanzger solver 157 157 solver -timeout 10000 -a 15000 -b 1 -file /tmp/file1MI4HZ -o /tmp/file1MI4HZ.out 58 30 16 113 2 21 9 111 repetitions = 0 hashKey = 533895944581272740 choice for step 7 = 111; eval = exp(-7.17669); runs = 0 time: 1.03241 s. 58 30 16 113 2 21 9 111 57 142 39 repetitions = 559 hashKey = 9143331809282148742 choice for step 10 = 39; eval = exp(-3.67107); runs = 915 time: 2.03554 s. 58 30 16 113 2 21 9 111 38 48 142 repetitions = 1384 hashKey = 8310112575115230072 choice for step 10 = 142; eval = exp(-6.76212); runs = 2244 time: 3.05978 s. 58 30 16 113 2 21 9 111 140 77 45 142 repetitions = 2198 hashKey = 4023627181719768932 choice for step 11 = 142; eval = exp(-10.3291); runs = 3368 time: 4.05987 s. 58 30 16 113 2 21 9 111 142 99 20 repetitions = 3380 hashKey = 13377490066596013570 choice for step 10 = 20; eval = exp(-6.87271); runs = 4972 time: 5.06178 s. 58 30 16 113 2 21 9 111 85 89 repetitions = 6050 hashKey = 17389968341948063612 choice for step 9 = 89; eval = exp(-6.13192); runs = 7722 time: 6.06221 s. 58 30 16 113 2 21 9 44 94 0 140 77 142 repetitions = 6612 hashKey = 3379092821160011164 choice for step 12 = 142; eval = exp(0); runs = 8436 Search successful! (runs = 8436) time: 6.45626 s. 0 2 9 16 21 30 44 58 77 94 113 140 142 1 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 time: 6.45708 s. Program terminated normally. time: 6.4574 s. real 0m7.175s user 0m6.992s sys 0m0.020s