********************************************************************** This file gives the default software outputs from vcsp.tcl and vcsp_anytime.tcl if you click "GO!" without changing anything: - vcsp benchs/random/15_10_80_80.ds with Partial Forward Checking - vcsp_anytime benchs/random/15_10_80_80.ds with Partial Forward Checking ********************************************************************** <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< solaris/vcsp benchs/random/15_10_80_80.ds 0 "-1" 9 2 penalty 0 "0" "" "0" -1 0 1.0 0.5 0.99 -1 0.01 0.95 -1 10 14 -1 "" 0.0 0 1.0 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< Create solver object... Type ***valued*** Instancy : 0 Vcsp 15_10_80_80.ds with 15 variables, 84 constraints and 6 valuations. Sort variables by max degree... Sort variables in 0 sec. --------------------------------------------------------------------------- new_infinity: 23332 --> Vcsp with 6 valuations. --------------------------------------------------------------------------- Resolve 15_10_80_80.ds with Partial Forward Checking & DOM1DEGREE : date 0 , best = 23332 date 0.1 , best = 8465 date 0.1 , best = 7575 date 0.1 , best = 7566 date 0.1 , best = 7525 date 0.1 , best = 7456 date 0.1 , best = 7454 date 0.1 , best = 7367 date 0.1 , best = 7354 date 0.1 , best = 6587 date 0.1 , best = 5596 date 0.1 , best = 5496 date 0.1 , best = 5487 date 0.1 , best = 5486 date 0.6 , best = 5294 date 0.6 , best = 5196 date 2 , best = 4556 date 2 , best = 4466 date 2 , best = 4465 date 2 , best = 4437 date 2.1 , best = 4357 explored tree: 0% (at 539269ccks/sec, 0:3 elapsed) date 3.6 , best = 3568 date 3.6 , best = 3566 date 3.6 , best = 3486 date 3.6 , best = 3476 date 4.2 , best = 3376 date 5.2 , best = 3196 date 5.2 , best = 3186 explored tree: 0% (at 506608ccks/sec, 0:7 elapsed) date 8.4 , best = 3186 Print solver of classe penalty... Reasonning: 76936 nd, 4174190(<=-1) ccks, 8.4 sec, 496927 ccks/sec. Best valuation : ub= 3186, lb= 3186 One solution : X0 = 3 . X8 = 6 . X14 = 9 . X4 = 7 . X6 = 7 . X9 = 9 . X2 = 4 . X7 = 7 . X12 = 3 . X1 = 4 . X3 = 4 . X11 = 4 . X13 = 5 . X5 = 3 . X10 = 2 . Violated constraints #: 16 of 1, 17 of 10, 10 of 100, 2 of 1000, 0 of 23332. Vcsp: 15_10_80_80.ds Valuations ordered set : 0{165}(0). 1{167}(1). 10{219}(2). 100{271}(3). 1000{323}(4). 23332{377}(5). The End. <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< solaris/vcsp_anytime benchs/random/15_10_80_80.ds 0 -1 0 -1 9 2 1.0 0.5 0.99 0 classic 0 0 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< Create solver object... Type ***valued*** Instancy : 0 Vcsp 15_10_80_80.ds with 15 variables, 84 constraints and 6 valuations. --------------------------------------------------------------------------- new_infinity: 23332 --> Vcsp with 6 valuations. Sort variables by max degree... Sort variables in 0 sec. --> a new best upper bound is found by 1 ! date= 0.1 , ub= 23332 --> a new best lower bound is found by 1 ! date= 0.1 , lb= 0 --------------------------------------------------------------------------- new_infinity: 1 --> Vcsp with 2 valuations. --------------------------------------------------------------------------- Resolve 15_10_80_80.ds__classic with Partial Forward Checking & DOM1DEGREE : date 0 , best = 1 date 0 , best = 1 Print solver of classe penalty... Reasonning: 13 nd, 737(<=-1) ccks, 0 sec, NaN ccks/sec. Best valuation : ub= 1, lb= 1 One solution : X0 = # . X8 = # . X14 = # . X4 = # . X6 = # . X9 = # . X2 = # . X7 = # . X12 = # . X1 = # . X3 = # . X11 = # . X13 = # . X5 = # . X10 = # . Violated constraints #: 0 of 1. Vcsp: 15_10_80_80.ds__classic Valuations ordered set : 0{543}(0). 1{633}(1). --> a new best lower bound is found by 1 ! date= 0.1 , lb= 1 --------------------------------------------------------------------------- --------------------------------------------------------------------------- Informations & solution for 15_10_80_80.ds : Print solver of classe penalty... Reasonning: 13 nd, 737(<=-1) ccks, 0 sec, NaN ccks/sec. Best valuation : ub= 23332, lb= 1 One solution : X0 = # . X8 = # . X14 = # . X4 = # . X6 = # . X9 = # . X2 = # . X7 = # . X12 = # . X1 = # . X3 = # . X11 = # . X13 = # . X5 = # . X10 = # . Violated constraints #: 0 of 1, 0 of 10, 0 of 100, 0 of 1000, 0 of 23332. Vcsp: 15_10_80_80.ds Valuations ordered set : 0{165}(0). 1{167}(1). 10{219}(2). 100{271}(3). 1000{323}(4). 23332{377}(5). --------------------------------------------------------------------------- new_infinity: 1 --> Vcsp with 2 valuations. --------------------------------------------------------------------------- Resolve 15_10_80_80.ds__possibilistic__1000 with Partial Forward Checking & DOM1DEGREE : date 0 , best = 1 date 0 , best = 1 Print solver of classe penalty... Reasonning: 25 nd, 720(<=-1) ccks, 0 sec, NaN ccks/sec. Best valuation : ub= 1, lb= 1 One solution : X0 = # . X8 = # . X14 = # . X4 = # . X6 = # . X9 = # . X2 = # . X7 = # . X12 = # . X1 = # . X3 = # . X11 = # . X13 = # . X5 = # . X10 = # . Violated constraints #: 0 of 1. Vcsp: 15_10_80_80.ds__possibilistic__1000 Valuations ordered set : 0{799}(0). 1{889}(1). --> a new best lower bound is found by 1 ! date= 0.2 , lb= 1000 --------------------------------------------------------------------------- --------------------------------------------------------------------------- Informations & solution for 15_10_80_80.ds : Print solver of classe penalty... Reasonning: 38 nd, 1457(<=-1) ccks, 0 sec, NaN ccks/sec. Best valuation : ub= 23332, lb= 1000 One solution : X0 = # . X8 = # . X14 = # . X4 = # . X6 = # . X9 = # . X2 = # . X7 = # . X12 = # . X1 = # . X3 = # . X11 = # . X13 = # . X5 = # . X10 = # . Violated constraints #: 0 of 1, 0 of 10, 0 of 100, 0 of 1000, 0 of 23332. Vcsp: 15_10_80_80.ds Valuations ordered set : 0{165}(0). 1{167}(1). 10{219}(2). 100{271}(3). 1000{323}(4). 23332{377}(5). --------------------------------------------------------------------------- new_infinity: (23332-1) --> Vcsp with 3 valuations. lexub= (23332-1), lexlb= (1000-1) --------------------------------------------------------------------------- Optimization: Lexico --> FastLexico. Resolve 15_10_80_80.ds__lexicographic__1000 with Partial Forward Checking & DOM1DEGREE : date 0 , best = (23332-1)%22 --> a new best upper bound is found by 1 ! date= 0.2 , ub= 10677 date 0 , best = (1000-9)%9 --> a new best upper bound is found by 1 ! date= 0.2 , ub= 9509 date 0 , best = (1000-8)%8 --> a new best upper bound is found by 1 ! date= 0.2 , ub= 8906 date 0 , best = (1000-7)%7 --> a new best upper bound is found by 1 ! date= 0.3 , ub= 7790 date 0 , best = (1000-6)%6 --> a new best upper bound is found by 1 ! date= 0.3 , ub= 6757 date 0 , best = (1000-5)%5 --> a new best upper bound is found by 1 ! date= 0.3 , ub= 5979 date 0 , best = (1000-4)%4 --> a new best upper bound is found by 1 ! date= 0.3 , ub= 4791 date 0 , best = (1000-3)%3 --> a new best upper bound is found by 1 ! date= 0.3 , ub= 3567 date 0 , best = (1000-2)%2 date 0 , best = (1000-2)%2 Print solver of classe fastlexico... Reasonning: 443 nd, 7773(<=-1) ccks, 0 sec, NaN ccks/sec. Best valuation : ub= (1000-2)%2, lb= (1000-2)%2 One solution : X0 = 0 . X8 = 6 . X14 = 5 . X4 = 6 . X6 = 3 . X9 = 6 . X2 = 5 . X7 = 3 . X12 = 2 . X1 = 3 . X3 = 4 . X11 = 3 . X13 = 0 . X5 = 3 . X10 = 9 . Violated constraints #: 2 of 1000, 0 of 23332. Vcsp: 15_10_80_80.ds__lexicographic__1000 Valuations ordered set : ()%0{1055}(0). (1000-1)%1{1059}(1). (23332-1)%22{1145}(2). --> a new best lower bound is found by 1 ! date= 0.3 , lb= 2000 --------------------------------------------------------------------------- --------------------------------------------------------------------------- Informations & solution for 15_10_80_80.ds : Print solver of classe penalty... Reasonning: 481 nd, 9923(<=-1) ccks, 0 sec, NaN ccks/sec. Best valuation : ub= 3567, lb= 2000 One solution : X0 = 0 . X8 = 6 . X14 = 5 . X4 = 6 . X6 = 3 . X9 = 6 . X2 = 5 . X7 = 3 . X12 = 2 . X1 = 3 . X3 = 4 . X11 = 3 . X13 = 0 . X5 = 3 . X10 = 9 . Violated constraints #: 17 of 1, 15 of 10, 14 of 100, 2 of 1000, 0 of 23332. Vcsp: 15_10_80_80.ds Valuations ordered set : 0{165}(0). 1{167}(1). 10{219}(2). 100{271}(3). 1000{323}(4). 23332{377}(5). --------------------------------------------------------------------------- new_infinity: (1000-3) --> Vcsp with 4 valuations. --> a new best lexub is found ! lexub= (1000-2 100-14), lexlb= (1000-2) --------------------------------------------------------------------------- Optimization: Lexico --> FastLexico. Resolve 15_10_80_80.ds__lexicographic__100 with Partial Forward Checking & DOM1DEGREE : date 0 , best = (1000-2 100-14)%58 --> a new best upper bound is found by 1 ! date= 0.4 , ub= 3498 date 0 , best = (1000-2 100-13)%57 --> a new best upper bound is found by 1 ! date= 0.4 , ub= 3386 date 0 , best = (1000-2 100-12)%56 --> a new best upper bound is found by 1 ! date= 0.4 , ub= 3196 date 0.1 , best = (1000-2 100-10)%54 date 0.2 , best = (1000-2 100-10)%54 Print solver of classe fastlexico... Reasonning: 2402 nd, 83767(<=-1) ccks, 0.2 sec, 418835 ccks/sec. Best valuation : ub= (1000-2 100-10)%54, lb= (1000-2 100-10)%54 One solution : X0 = 3 . X8 = 6 . X14 = 9 . X4 = 4 . X6 = 7 . X9 = 9 . X2 = 4 . X7 = 7 . X12 = 3 . X1 = 4 . X3 = 4 . X11 = 4 . X13 = 5 . X5 = 3 . X10 = 2 . Violated constraints #: 10 of 100, 2 of 1000, 0 of 3000. Vcsp: 15_10_80_80.ds__lexicographic__100 Valuations ordered set : ()%0{1311}(0). (100-1)%1{1314}(1). (1000-1)%22{1315}(2). (1000-3)%66{1401}(3). --> a new best lower bound is found by 1 ! date= 0.6 , lb= 3000 --------------------------------------------------------------------------- --------------------------------------------------------------------------- Informations & solution for 15_10_80_80.ds : Print solver of classe penalty... Reasonning: 2883 nd, 94068(<=-1) ccks, 0.2 sec, 470340 ccks/sec. Best valuation : ub= 3196, lb= 3000 One solution : X0 = 3 . X8 = 6 . X14 = 9 . X4 = 4 . X6 = 7 . X9 = 9 . X2 = 4 . X7 = 7 . X12 = 3 . X1 = 4 . X3 = 4 . X11 = 4 . X13 = 5 . X5 = 3 . X10 = 2 . Violated constraints #: 16 of 1, 18 of 10, 10 of 100, 2 of 1000, 0 of 23332. Vcsp: 15_10_80_80.ds Valuations ordered set : 0{165}(0). 1{167}(1). 10{219}(2). 100{271}(3). 1000{323}(4). 23332{377}(5). --------------------------------------------------------------------------- new_infinity: (1000-2 100-11) --> Vcsp with 5 valuations. --> a new best lexub is found ! lexub= (1000-2 100-10 10-18), lexlb= (1000-2 100-10) --------------------------------------------------------------------------- Optimization: Lexico --> FastLexico. Resolve 15_10_80_80.ds__lexicographic__10 with Partial Forward Checking & DOM1DEGREE : date 0 , best = (1000-2 100-10 10-18)%1206 --> a new best upper bound is found by 1 ! date= 0.9 , ub= 3186 date 0.2 , best = (1000-2 100-10 10-17)%1205 date 0.7 , best = (1000-2 100-10 10-17)%1205 Print solver of classe fastlexico... Reasonning: 7020 nd, 256762(<=-1) ccks, 0.7 sec, 366803 ccks/sec. Best valuation : ub= (1000-2 100-10 10-17)%1205, lb= (1000-2 100-10 10-17)%1205 One solution : X0 = 3 . X8 = 6 . X14 = 9 . X4 = 7 . X6 = 7 . X9 = 9 . X2 = 4 . X7 = 7 . X12 = 3 . X1 = 4 . X3 = 4 . X11 = 4 . X13 = 5 . X5 = 3 . X10 = 2 . Violated constraints #: 17 of 10, 10 of 100, 2 of 1000, 0 of 3100. Vcsp: 15_10_80_80.ds__lexicographic__10 Valuations ordered set : ()%0{1567}(0). (10-1)%1{1569}(1). (100-1)%22{1570}(2). (1000-1)%484{1571}(3). (1000-2 100-11)%1210{1657}(4). --------------------------------------------------------------------------- --------------------------------------------------------------------------- Informations & solution for 15_10_80_80.ds : Print solver of classe penalty... Reasonning: 9903 nd, 351061(<=-1) ccks, 0.9 sec, 390068 ccks/sec. Best valuation : ub= 3186, lb= 3000 One solution : X0 = 3 . X8 = 6 . X14 = 9 . X4 = 7 . X6 = 7 . X9 = 9 . X2 = 4 . X7 = 7 . X12 = 3 . X1 = 4 . X3 = 4 . X11 = 4 . X13 = 5 . X5 = 3 . X10 = 2 . Violated constraints #: 16 of 1, 17 of 10, 10 of 100, 2 of 1000, 0 of 23332. Vcsp: 15_10_80_80.ds Valuations ordered set : 0{165}(0). 1{167}(1). 10{219}(2). 100{271}(3). 1000{323}(4). 23332{377}(5). --------------------------------------------------------------------------- new_infinity: 3170 --> Vcsp with 5 valuations. ub= 3170, lb= 3000 --------------------------------------------------------------------------- Resolve 15_10_80_80.ds__penalty__10 with Partial Forward Checking & DOM1DEGREE : date 0 , best = 3170 date 0.7 , best = 3170 Print solver of classe penalty... Reasonning: 7025 nd, 262630(<=-1) ccks, 0.7 sec, 375186 ccks/sec. Best valuation : ub= 3170, lb= 3170 One solution : X0 = # . X8 = # . X14 = # . X4 = # . X6 = # . X9 = # . X2 = # . X7 = # . X12 = # . X1 = # . X3 = # . X11 = # . X13 = # . X5 = # . X10 = # . Violated constraints #: 0 of 10, 0 of 100, 0 of 1000, 0 of 3170. Vcsp: 15_10_80_80.ds__penalty__10 Valuations ordered set : 0{1823}(0). 10{1825}(1). 100{1826}(2). 1000{1827}(3). 3170{1913}(4). --> a new best lower bound is found by 1 ! date= 2 , lb= 3170 --------------------------------------------------------------------------- --------------------------------------------------------------------------- Informations & solution for 15_10_80_80.ds : Print solver of classe penalty... Reasonning: 16928 nd, 613775(<=-1) ccks, 1.6 sec, 383609 ccks/sec. Best valuation : ub= 3186, lb= 3170 One solution : X0 = 3 . X8 = 6 . X14 = 9 . X4 = 7 . X6 = 7 . X9 = 9 . X2 = 4 . X7 = 7 . X12 = 3 . X1 = 4 . X3 = 4 . X11 = 4 . X13 = 5 . X5 = 3 . X10 = 2 . Violated constraints #: 16 of 1, 17 of 10, 10 of 100, 2 of 1000, 0 of 23332. Vcsp: 15_10_80_80.ds Valuations ordered set : 0{165}(0). 1{167}(1). 10{219}(2). 100{271}(3). 1000{323}(4). 23332{377}(5). --------------------------------------------------------------------------- new_infinity: 3191 --> Vcsp with 6 valuations. --> a new best ub is found ! ub= 3186, lb= 3170 --------------------------------------------------------------------------- Resolve 15_10_80_80.ds__penalty__1 with Partial Forward Checking & DOM1DEGREE : date 0 , best = 3186 explored tree: 0% (at 479392ccks/sec, 0:3 elapsed) date 4.9 , best = 3186 Print solver of classe penalty... Reasonning: 44149 nd, 2350228(<=-1) ccks, 4.9 sec, 479638 ccks/sec. Best valuation : ub= 3186, lb= 3186 One solution : X0 = 3 . X8 = 6 . X14 = 9 . X4 = 7 . X6 = 7 . X9 = 9 . X2 = 4 . X7 = 7 . X12 = 3 . X1 = 4 . X3 = 4 . X11 = 4 . X13 = 5 . X5 = 3 . X10 = 2 . Violated constraints #: 16 of 1, 17 of 10, 10 of 100, 2 of 1000, 0 of 3191. Vcsp: 15_10_80_80.ds__penalty__1 Valuations ordered set : 0{2079}(0). 1{2080}(1). 10{2081}(2). 100{2082}(3). 1000{2083}(4). 3191{2169}(5). --> a new best lower bound is found by 1 ! date= 7 , lb= 3186 The End of Simplifications Scheme --------------------------------------------------------------------------- --------------------------------------------------------------------------- Informations & solution for 15_10_80_80.ds : Print solver of classe penalty... Reasonning: 61077 nd, 2964171(<=-1) ccks, 6.5 sec, 456026 ccks/sec. Best valuation : ub= 3186, lb= 3186 One solution : X0 = 3 . X8 = 6 . X14 = 9 . X4 = 7 . X6 = 7 . X9 = 9 . X2 = 4 . X7 = 7 . X12 = 3 . X1 = 4 . X3 = 4 . X11 = 4 . X13 = 5 . X5 = 3 . X10 = 2 . Violated constraints #: 16 of 1, 17 of 10, 10 of 100, 2 of 1000, 0 of 23332. Vcsp: 15_10_80_80.ds Valuations ordered set : 0{165}(0). 1{167}(1). 10{219}(2). 100{271}(3). 1000{323}(4). 23332{377}(5). The End of Local Search methods --> a new best upper bound is found by 1 ! date= 7 , ub= 3186 --> a new best lower bound is found by 1 ! date= 7 , lb= 3186 --------------------------------------------------------------------------- --------------------------------------------------------------------------- Informations & solution for 15_10_80_80.ds : Print solver of classe penalty... Reasonning: 61077 nd, 2964255(<=-1) ccks, 6.5 sec, 456039 ccks/sec. Best valuation : ub= 3186, lb= 3186 One solution : X0 = 3 . X8 = 6 . X14 = 9 . X4 = 7 . X6 = 7 . X9 = 9 . X2 = 4 . X7 = 7 . X12 = 3 . X1 = 4 . X3 = 4 . X11 = 4 . X13 = 5 . X5 = 3 . X10 = 2 . Violated constraints #: 16 of 1, 17 of 10, 10 of 100, 2 of 1000, 0 of 23332. Vcsp: 15_10_80_80.ds Valuations ordered set : 0{165}(0). 1{167}(1). 10{219}(2). 100{271}(3). 1000{323}(4). 23332{377}(5).