| Solver Name | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|
| SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver | OPT | 2 | 0.552915 | 0.553098 |
| Name | normalized-PB06/OPT-SMALLINT/submitted-PB06/manquiho/ logic_synthesis/normalized-m100_50_40_40.r.opb |
| MD5SUM | e50e14c7bfcc297dc066e5f2818ead9c |
| Bench Category | OPT-SMALLINT (optimisation, small integers) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 0.050992 |
| Has Objective Function | YES |
| Satisfiable | YES |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | 2 |
| Optimality of the best value was proved | YES |
| Number of variables | 50 |
| Total number of constraints | 100 |
| Number of constraints which are clauses | 100 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 40 |
| Maximum length of a constraint | 40 |
| Number of terms in the objective function | 50 |
| Biggest coefficient in the objective function | 1 |
| Number of bits for the biggest coefficient in the objective function | 1 |
| Sum of the numbers in the objective function | 50 |
| Number of bits of the sum of numbers in the objective function | 6 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 50 |
| Number of bits of the biggest sum of numbers | 6 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |
0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2667637-1276593223.opb>
0.00/0.01 c original problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 50
0.00/0.02 c feasible solution found by trivial heuristic, objective value 5.000000e+01
0.00/0.02 c presolving:
0.00/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 100 upgd conss, 0 impls, 0 clqs
0.00/0.03 c presolving (2 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 0 implications, 0 cliques
0.00/0.03 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.00/0.03 c 100 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c conflict/interconss = 0
0.00/0.03 c
0.00/0.03 c # should binary conflicts be preferred?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c conflict/preferbinary = TRUE
0.00/0.03 c
0.00/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c constraints/agelimit = 1
0.00/0.03 c
0.00/0.03 c # should enforcement of pseudo solution be disabled?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/disableenfops = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = 0
0.00/0.03 c
0.00/0.03 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.00/0.03 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.03 c lp/pricing = a
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # priority of node selection rule <dfs> in standard mode
0.00/0.03 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.03 c nodeselection/dfs/stdpriority = 1000000
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.07 c t 0.1s| 1 | 0 | 400 | - | 690k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 5.000000e+01 |3900.00%
0.00/0.07 o 49
0.00/0.07 c R 0.1s| 1 | 0 | 400 | - | 692k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 4.900000e+01 |3820.00%
0.00/0.07 o 48
0.00/0.07 c s 0.1s| 1 | 0 | 400 | - | 694k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 4.800000e+01 |3740.00%
0.00/0.08 o 4
0.00/0.08 c z 0.1s| 1 | 0 | 400 | - | 695k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 4.000000e+00 | 220.00%
0.00/0.09 c 0.1s| 1 | 0 | 400 | - | 695k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 4.000000e+00 | 220.00%
0.49/0.53 c 0.5s| 1 | 2 | 400 | - | 696k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 18 | 1.250000e+00 | 4.000000e+00 | 220.00%
0.49/0.53 o 3
0.49/0.53 c * 0.5s| 49 | 1 | 400 | 0.0 | 704k| 48 | - | 50 | 100 | 0 | 0 | 0 | 0 | 18 | 1.256345e+00 | 3.000000e+00 | 138.79%
0.49/0.54 o 2
0.49/0.54 c * 0.5s| 132 | 0 | 400 | 0.0 | 709k| 48 | - | 50 | 100 | 0 | 0 | 0 | 29 | 18 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.49/0.54 c
0.49/0.54 c SCIP Status : problem is solved [optimal solution found]
0.49/0.54 c Solving Time (sec) : 0.51
0.49/0.54 c Solving Nodes : 132
0.49/0.54 c Primal Bound : +2.00000000000000e+00 (8 solutions)
0.49/0.54 c Dual Bound : +2.00000000000000e+00
0.49/0.54 c Gap : 0.00 %
0.49/0.54 s OPTIMUM FOUND
0.49/0.54 v -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 x27 -x26 -x25
0.49/0.54 v -x24 x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.49/0.54 c SCIP Status : problem is solved [optimal solution found]
0.49/0.54 c Solving Time : 0.51
0.49/0.54 c Original Problem :
0.49/0.54 c Problem name : HOME/instance-2667637-1276593223.opb
0.49/0.54 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.54 c Constraints : 100 initial, 100 maximal
0.49/0.54 c Presolved Problem :
0.49/0.54 c Problem name : t_HOME/instance-2667637-1276593223.opb
0.49/0.54 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.54 c Constraints : 100 initial, 100 maximal
0.49/0.54 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.54 c trivial : 0.00 0 0 0 0 0 0 0 0
0.49/0.54 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.49/0.54 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.54 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.54 c implics : 0.00 0 0 0 0 0 0 0 0
0.49/0.54 c probing : 0.01 0 0 0 0 0 0 0 0
0.49/0.54 c logicor : 0.00 0 0 0 0 0 0 0 0
0.49/0.54 c root node : - 1 - - 1 - - - -
0.49/0.54 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.54 c integral : 0 0 0 1 0 0 0 0 0 2
0.49/0.54 c logicor : 100+ 1 117 0 1 23 46 0 0 0
0.49/0.54 c countsols : 0 0 0 0 2 0 0 0 0 0
0.49/0.54 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.54 c integral : 0.42 0.00 0.00 0.42 0.00
0.49/0.54 c logicor : 0.01 0.00 0.01 0.00 0.00
0.49/0.54 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.54 c Propagators : Time Calls Cutoffs DomReds
0.49/0.54 c vbounds : 0.00 2 0 0
0.49/0.54 c rootredcost : 0.00 1 0 0
0.49/0.54 c pseudoobj : 0.01 199 6 103
0.49/0.54 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.54 c propagation : 0.01 29 29 29 43.2 0 0.0 -
0.49/0.54 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.54 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.54 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.54 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.54 c applied globally : - - - 0 0.0 - - -
0.49/0.54 c applied locally : - - - 29 43.2 - - -
0.49/0.54 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.54 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.49/0.54 c redcost : 0.00 2 0 0 0 0
0.49/0.54 c impliedbounds : 0.00 2 0 0 0 0
0.49/0.54 c intobj : 0.00 0 0 0 0 0
0.49/0.54 c cgmip : 0.00 0 0 0 0 0
0.49/0.54 c gomory : 0.00 2 0 0 0 0
0.49/0.54 c strongcg : 0.00 2 0 0 0 0
0.49/0.54 c cmir : 0.00 2 0 0 0 0
0.49/0.54 c flowcover : 0.02 2 0 0 0 0
0.49/0.54 c clique : 0.00 1 0 0 0 0
0.49/0.54 c zerohalf : 0.00 0 0 0 0 0
0.49/0.54 c mcf : 0.00 1 0 0 0 0
0.49/0.54 c rapidlearning : 0.00 0 0 0 0 0
0.49/0.54 c Pricers : Time Calls Vars
0.49/0.54 c problem variables: 0.00 0 0
0.49/0.54 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.54 c relpscost : 0.42 1 0 0 0 0 2
0.49/0.54 c pscost : 0.00 0 0 0 0 0 0
0.49/0.54 c inference : 0.00 119 0 0 0 0 238
0.49/0.54 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.54 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.54 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.54 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.54 c random : 0.00 0 0 0 0 0 0
0.49/0.54 c Primal Heuristics : Time Calls Found
0.49/0.54 c LP solutions : 0.00 - 0
0.49/0.54 c pseudo solutions : 0.00 - 2
0.49/0.54 c crossover : 0.00 0 0
0.49/0.54 c oneopt : 0.00 1 0
0.49/0.54 c trivial : 0.00 2 3
0.49/0.54 c simplerounding : 0.00 1 0
0.49/0.54 c zirounding : 0.00 1 1
0.49/0.54 c rounding : 0.00 1 1
0.49/0.54 c shifting : 0.01 1 1
0.49/0.54 c intshifting : 0.00 0 0
0.49/0.54 c twoopt : 0.00 0 0
0.49/0.54 c fixandinfer : 0.00 0 0
0.49/0.54 c feaspump : 0.00 0 0
0.49/0.54 c coefdiving : 0.00 0 0
0.49/0.54 c pscostdiving : 0.00 0 0
0.49/0.54 c fracdiving : 0.00 0 0
0.49/0.54 c veclendiving : 0.00 0 0
0.49/0.54 c intdiving : 0.00 0 0
0.49/0.54 c actconsdiving : 0.00 0 0
0.49/0.54 c objpscostdiving : 0.00 0 0
0.49/0.54 c rootsoldiving : 0.00 0 0
0.49/0.54 c linesearchdiving : 0.00 0 0
0.49/0.54 c guideddiving : 0.00 0 0
0.49/0.54 c octane : 0.00 0 0
0.49/0.54 c rens : 0.00 0 0
0.49/0.54 c rins : 0.00 0 0
0.49/0.54 c localbranching : 0.00 0 0
0.49/0.54 c mutation : 0.00 0 0
0.49/0.54 c dins : 0.00 0 0
0.49/0.54 c undercover : 0.00 0 0
0.49/0.54 c nlp : 0.00 0 0
0.49/0.54 c trysol : 0.00 0 0
0.49/0.54 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.54 c primal LP : 0.00 0 0 0.00 -
0.49/0.54 c dual LP : 0.03 1 400 400.00 13333.33
0.49/0.54 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.54 c barrier LP : 0.00 0 0 0.00 -
0.49/0.54 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.54 c strong branching : 0.42 18 2625 145.83 6250.00
0.49/0.54 c (at root node) : - 18 2625 145.83 -
0.49/0.54 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.54 c B&B Tree :
0.49/0.54 c number of runs : 1
0.49/0.54 c nodes : 132
0.49/0.54 c nodes (total) : 132
0.49/0.54 c nodes left : 0
0.49/0.54 c max depth : 48
0.49/0.54 c max depth (total): 48
0.49/0.54 c backtracks : 22 (16.7%)
0.49/0.54 c delayed cutoffs : 19
0.49/0.54 c repropagations : 27 (112 domain reductions, 19 cutoffs)
0.49/0.54 c avg switch length: 2.00
0.49/0.54 c switching time : 0.00
0.49/0.54 c Solution :
0.49/0.54 c Solutions found : 8 (6 improvements)
0.49/0.54 c First Solution : +5.00000000000000e+01 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.49/0.54 c Primal Bound : +2.00000000000000e+00 (in run 1, after 132 nodes, 0.51 seconds, depth 46, found by <relaxation>)
0.49/0.54 c Dual Bound : +2.00000000000000e+00
0.49/0.54 c Gap : 0.00 %
0.49/0.54 c Root Dual Bound : +1.25000000000000e+00
0.49/0.54 c Root Iterations : 400
0.49/0.55 c Time complete: 0.54.
OK 2
runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2667637-1276593223/watcher-2667637-1276593223 -o /tmp/evaluation-result-2667637-1276593223/solver-2667637-1276593223 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2667637-1276593223.opb -t 1800 -m 1800 Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 2000 seconds Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB Current StackSize limit: 10240 KiB [startup+0 s] /proc/loadavg: 0.98 1.01 1.00 3/106 3751 /proc/meminfo: memFree=1816696/2059040 swapFree=4140224/4192956 [pid=3751] ppid=3749 vsize=6696 CPUtime=0 /proc/3751/stat : 3751 (pbscip.linux.x8) R 3749 3751 2533 0 -1 4202496 984 0 0 0 0 0 0 0 18 0 1 0 32978675 6856704 903 1992294400 4194304 8223781 140735221866432 18446744073709551615 7253477 0 0 4096 0 0 0 0 17 1 0 0 0 /proc/3751/statm: 1674 911 343 984 0 687 0 [startup+0.095763 s] /proc/loadavg: 0.98 1.01 1.00 3/106 3751 /proc/meminfo: memFree=1816696/2059040 swapFree=4140224/4192956 [pid=3751] ppid=3749 vsize=14564 CPUtime=0.08 /proc/3751/stat : 3751 (pbscip.linux.x8) R 3749 3751 2533 0 -1 4202496 4264 0 0 0 7 1 0 0 21 0 1 0 32978675 14913536 2732 1992294400 4194304 8223781 140735221866432 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0 /proc/3751/statm: 3641 2732 558 984 0 2654 0 Current children cumulated CPU time (s) 0.08 Current children cumulated vsize (KiB) 14564 [startup+0.101764 s] /proc/loadavg: 0.98 1.01 1.00 3/106 3751 /proc/meminfo: memFree=1816696/2059040 swapFree=4140224/4192956 [pid=3751] ppid=3749 vsize=14564 CPUtime=0.09 /proc/3751/stat : 3751 (pbscip.linux.x8) R 3749 3751 2533 0 -1 4202496 4264 0 0 0 8 1 0 0 21 0 1 0 32978675 14913536 2732 1992294400 4194304 8223781 140735221866432 18446744073709551615 5744186 0 0 4096 16384 0 0 0 17 1 0 0 0 /proc/3751/statm: 3641 2732 558 984 0 2654 0 Current children cumulated CPU time (s) 0.09 Current children cumulated vsize (KiB) 14564 [startup+0.300783 s] /proc/loadavg: 0.98 1.01 1.00 3/106 3751 /proc/meminfo: memFree=1816696/2059040 swapFree=4140224/4192956 [pid=3751] ppid=3749 vsize=14332 CPUtime=0.29 /proc/3751/stat : 3751 (pbscip.linux.x8) R 3749 3751 2533 0 -1 4202496 5093 0 0 0 27 2 0 0 21 0 1 0 32978675 14675968 2633 1992294400 4194304 8223781 140735221866432 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0 /proc/3751/statm: 3583 2633 560 984 0 2596 0 Current children cumulated CPU time (s) 0.29 Current children cumulated vsize (KiB) 14332 Solver just ended. Dumping a history of the last processes samples [startup+0.500802 s] /proc/loadavg: 0.98 1.01 1.00 3/106 3751 /proc/meminfo: memFree=1816696/2059040 swapFree=4140224/4192956 [pid=3751] ppid=3749 vsize=14332 CPUtime=0.49 /proc/3751/stat : 3751 (pbscip.linux.x8) R 3749 3751 2533 0 -1 4202496 5957 0 0 0 46 3 0 0 21 0 1 0 32978675 14675968 2634 1992294400 4194304 8223781 140735221866432 18446744073709551615 7294506 0 0 4096 16384 0 0 0 17 1 0 0 0 /proc/3751/statm: 3583 2634 560 984 0 2596 0 Current children cumulated CPU time (s) 0.49 Current children cumulated vsize (KiB) 14332 Child status: 0 Real time (s): 0.553098 CPU time (s): 0.552915 CPU user time (s): 0.517921 CPU system time (s): 0.034994 CPU usage (%): 99.9669 Max. virtual memory (cumulated for all children) (KiB): 14564 getrusage(RUSAGE_CHILDREN,...) data: user time used= 0.517921 system time used= 0.034994 maximum resident set size= 0 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 6107 page faults= 0 swaps= 0 block input operations= 0 block output operations= 0 messages sent= 0 messages received= 0 signals received= 0 voluntary context switches= 2 involuntary context switches= 2 runsolver used 0.001999 second user time and 0.012998 second system time The end
Begin job on node018 at 2010-06-15 11:13:43 IDJOB=2667637 IDBENCH=2865 IDSOLVER=1169 FILE ID=node018/2667637-1276593223 PBS_JOBID= 11173541 Free space on /tmp= 62488 MiB SOLVER NAME= SCIPspx SCIP 1.2.1.2 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver BENCH NAME= PB06/final/normalized-PB06/OPT-SMALLINT/submitted-PB06/manquiho/logic_synthesis/normalized-m100_50_40_40.r.opb COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2667637-1276593223/watcher-2667637-1276593223 -o /tmp/evaluation-result-2667637-1276593223/solver-2667637-1276593223 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2667637-1276593223.opb -t 1800 -m 1800 TIME LIMIT= 1800 seconds MEMORY LIMIT= 1800 MiB MAX NB THREAD= 0 MD5SUM BENCH= e50e14c7bfcc297dc066e5f2818ead9c RANDOM SEED=428633904 node018.alineos.net Linux 2.6.18-164.el5 #1 SMP Thu Sep 3 03:28:30 EDT 2009 /proc/cpuinfo: processor : 0 vendor_id : GenuineIntel cpu family : 15 model : 4 model name : Intel(R) Xeon(TM) CPU 3.00GHz stepping : 3 cpu MHz : 3000.248 cache size : 2048 KB physical id : 0 siblings : 1 core id : 0 cpu cores : 1 apicid : 0 fpu : yes fpu_exception : yes cpuid level : 5 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr bogomips : 6000.49 clflush size : 64 cache_alignment : 128 address sizes : 36 bits physical, 48 bits virtual power management: processor : 1 vendor_id : GenuineIntel cpu family : 15 model : 4 model name : Intel(R) Xeon(TM) CPU 3.00GHz stepping : 3 cpu MHz : 3000.248 cache size : 2048 KB physical id : 3 siblings : 1 core id : 0 cpu cores : 1 apicid : 6 fpu : yes fpu_exception : yes cpuid level : 5 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr bogomips : 5599.47 clflush size : 64 cache_alignment : 128 address sizes : 36 bits physical, 48 bits virtual power management: /proc/meminfo: MemTotal: 2059040 kB MemFree: 1817100 kB Buffers: 43688 kB Cached: 109464 kB SwapCached: 6136 kB Active: 97332 kB Inactive: 69196 kB HighTotal: 0 kB HighFree: 0 kB LowTotal: 2059040 kB LowFree: 1817100 kB SwapTotal: 4192956 kB SwapFree: 4140224 kB Dirty: 4760 kB Writeback: 8 kB AnonPages: 11504 kB Mapped: 13064 kB Slab: 53468 kB PageTables: 3988 kB NFS_Unstable: 0 kB Bounce: 0 kB CommitLimit: 5222476 kB Committed_AS: 180656 kB VmallocTotal: 34359738367 kB VmallocUsed: 264948 kB VmallocChunk: 34359471699 kB HugePages_Total: 0 HugePages_Free: 0 HugePages_Rsvd: 0 Hugepagesize: 2048 kB Free space on /tmp at the end= 62480 MiB End job on node018 at 2010-06-15 11:13:44