| Solver Name | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|
| SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver | OPT | 6 | 0.05999 | 0.060741 |
| Name | normalized-PB06/OPT-SMALLINT/submitted-PB06/ manquiho/logic_synthesis/normalized-dk512x.r.opb |
| MD5SUM | 581a8e804be9894a02ef91830c95d4b0 |
| Bench Category | OPT-SMALLINT (optimisation, small integers) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 6 |
| Best CPU time to get the best result obtained on this benchmark | 0.047992 |
| Has Objective Function | YES |
| Satisfiable | YES |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | 6 |
| Optimality of the best value was proved | YES |
| Number of variables | 59 |
| Total number of constraints | 91 |
| Number of constraints which are clauses | 91 |
| 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 | 1 |
| Maximum length of a constraint | 53 |
| Number of terms in the objective function | 59 |
| 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 | 59 |
| 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 | 59 |
| 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.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704533-1278561438.opb>
0.00/0.01 c original problem has 59 variables (59 bin, 0 int, 0 impl, 0 cont) and 91 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 59
0.00/0.02 c feasible solution found by trivial heuristic, objective value 5.900000e+01
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 1 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 0 clqs
0.00/0.02 c (round 2) 1 del vars, 24 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 0 clqs
0.00/0.02 c (round 3) 1 del vars, 51 del conss, 1 chg bounds, 27 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 0 clqs
0.00/0.02 c (round 4) 2 del vars, 51 del conss, 1 chg bounds, 27 chg sides, 0 chg coeffs, 40 upgd conss, 2 impls, 0 clqs
0.00/0.03 c presolving (5 rounds):
0.00/0.03 c 2 deleted vars, 51 deleted constraints, 1 tightened bounds, 0 added holes, 27 changed sides, 0 changed coefficients
0.00/0.03 c 2 implications, 0 cliques
0.00/0.03 c presolved problem has 57 variables (57 bin, 0 int, 0 impl, 0 cont) and 40 constraints
0.00/0.03 c 40 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.3
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 = 1789.99
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = 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.03 o 58
0.00/0.03 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.03 c t 0.0s| 1 | 0 | 0 | - | 365k| 0 | - | 57 | 40 | 0 | 0 | 0 | 0 | 0 | -- | 5.800000e+01 | Inf
0.00/0.03 o 10
0.00/0.03 c b 0.0s| 1 | 0 | 0 | - | 431k| 0 | - | 57 | 40 | 57 | 40 | 0 | 0 | 0 | -- | 1.000000e+01 | Inf
0.00/0.03 c 0.0s| 1 | 0 | 20 | - | 431k| 0 | 9 | 57 | 40 | 57 | 40 | 0 | 0 | 0 | 4.500000e+00 | 1.000000e+01 | 122.22%
0.00/0.03 o 9
0.00/0.03 c R 0.0s| 1 | 0 | 20 | - | 433k| 0 | 9 | 57 | 40 | 57 | 40 | 0 | 0 | 0 | 4.500000e+00 | 9.000000e+00 | 100.00%
0.00/0.03 o 8
0.00/0.03 c s 0.0s| 1 | 0 | 20 | - | 434k| 0 | 9 | 57 | 40 | 57 | 40 | 0 | 0 | 0 | 4.500000e+00 | 8.000000e+00 | 77.78%
0.00/0.03 o 6
0.00/0.03 c b 0.0s| 1 | 0 | 20 | - | 436k| 0 | 9 | 57 | 40 | 57 | 40 | 0 | 0 | 0 | 4.500000e+00 | 6.000000e+00 | 33.33%
0.00/0.03 c 0.0s| 1 | 0 | 25 | - | 449k| 0 | 13 | 57 | 40 | 57 | 42 | 2 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.00/0.04 c 0.0s| 1 | 0 | 29 | - | 472k| 0 | 11 | 57 | 40 | 57 | 43 | 3 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.00/0.04 c 0.0s| 1 | 0 | 37 | - | 486k| 0 | 10 | 57 | 40 | 57 | 44 | 4 | 0 | 0 | 5.000000e+00 | 6.000000e+00 | 20.00%
0.00/0.05 c 0.0s| 1 | 0 | 49 | - | 502k| 0 | - | 57 | 40 | 57 | 46 | 6 | 0 | 0 | 6.000000e+00 | 6.000000e+00 | 0.00%
0.00/0.05 c 0.0s| 1 | 0 | 49 | - | 502k| 0 | - | 57 | 40 | 57 | 46 | 6 | 0 | 0 | 6.000000e+00 | 6.000000e+00 | 0.00%
0.00/0.05 c
0.00/0.05 c SCIP Status : problem is solved [optimal solution found]
0.00/0.05 c Solving Time (sec) : 0.03
0.00/0.05 c Solving Nodes : 1
0.00/0.05 c Primal Bound : +6.00000000000000e+00 (11 solutions)
0.00/0.05 c Dual Bound : +6.00000000000000e+00
0.00/0.05 c Gap : 0.00 %
0.00/0.05 s OPTIMUM FOUND
0.00/0.05 v -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 x46 -x45 -x44 -x43 -x42 x41 -x40 x39 -x38 -x37 -x36 -x35 -x34
0.00/0.05 v -x33 -x32 -x31 -x30 -x29 -x28 -x27 x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 x8
0.00/0.05 v -x7 -x6 -x5 x4 -x3 -x2 -x1
0.00/0.05 c SCIP Status : problem is solved [optimal solution found]
0.00/0.05 c Solving Time : 0.03
0.00/0.05 c Original Problem :
0.00/0.05 c Problem name : HOME/instance-2704533-1278561438.opb
0.00/0.05 c Variables : 59 (59 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.05 c Constraints : 91 initial, 91 maximal
0.00/0.05 c Presolved Problem :
0.00/0.05 c Problem name : t_HOME/instance-2704533-1278561438.opb
0.00/0.05 c Variables : 57 (57 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.05 c Constraints : 40 initial, 40 maximal
0.00/0.05 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.05 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c dualfix : 0.00 1 0 0 0 0 0 0 0
0.00/0.05 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c linear : 0.00 1 0 0 1 0 51 27 0
0.00/0.05 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c root node : - 5 - - 5 - - - -
0.00/0.05 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.05 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c logicor : 40 4 46 0 0 0 0 0 0 0
0.00/0.05 c countsols : 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.05 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c Propagators : Time Calls Cutoffs DomReds
0.00/0.05 c vbounds : 0.00 2 0 0
0.00/0.05 c rootredcost : 0.00 0 0 0
0.00/0.05 c pseudoobj : 0.00 5 1 0
0.00/0.05 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.05 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.05 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.05 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.05 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.05 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.05 c applied globally : - - - 0 0.0 - - -
0.00/0.05 c applied locally : - - - 0 0.0 - - -
0.00/0.05 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.05 c cut pool : 0.00 3 - - 21 - (maximal pool size: 38)
0.00/0.05 c redcost : 0.00 4 0 5 0 0
0.00/0.05 c impliedbounds : 0.00 4 0 0 0 0
0.00/0.05 c intobj : 0.00 0 0 0 0 0
0.00/0.05 c cgmip : 0.00 0 0 0 0 0
0.00/0.05 c gomory : 0.01 4 0 0 105 0
0.00/0.05 c strongcg : 0.01 4 0 0 105 0
0.00/0.05 c cmir : 0.00 4 0 0 0 0
0.00/0.05 c flowcover : 0.00 4 0 0 0 0
0.00/0.05 c clique : 0.00 1 0 0 0 0
0.00/0.05 c zerohalf : 0.00 0 0 0 0 0
0.00/0.05 c mcf : 0.00 1 0 0 0 0
0.00/0.05 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.05 c Pricers : Time Calls Vars
0.00/0.05 c problem variables: 0.00 0 0
0.00/0.05 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.05 c pscost : 0.00 0 0 0 0 0 0
0.00/0.05 c inference : 0.00 0 0 0 0 0 0
0.00/0.05 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.05 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.05 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.05 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.05 c random : 0.00 0 0 0 0 0 0
0.00/0.05 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.05 c Primal Heuristics : Time Calls Found
0.00/0.05 c LP solutions : 0.00 - 0
0.00/0.05 c pseudo solutions : 0.00 - 0
0.00/0.05 c oneopt : 0.00 3 2
0.00/0.05 c trivial : 0.00 2 3
0.00/0.05 c simplerounding : 0.00 4 4
0.00/0.05 c zirounding : 0.00 0 0
0.00/0.05 c rounding : 0.00 4 1
0.00/0.05 c shifting : 0.00 4 1
0.00/0.05 c intshifting : 0.00 0 0
0.00/0.05 c twoopt : 0.00 0 0
0.00/0.05 c fixandinfer : 0.00 0 0
0.00/0.05 c feaspump : 0.00 0 0
0.00/0.05 c coefdiving : 0.00 0 0
0.00/0.05 c pscostdiving : 0.00 0 0
0.00/0.05 c fracdiving : 0.00 0 0
0.00/0.05 c veclendiving : 0.00 0 0
0.00/0.05 c intdiving : 0.00 0 0
0.00/0.05 c actconsdiving : 0.00 0 0
0.00/0.05 c objpscostdiving : 0.00 0 0
0.00/0.05 c rootsoldiving : 0.00 0 0
0.00/0.05 c linesearchdiving : 0.00 0 0
0.00/0.05 c guideddiving : 0.00 0 0
0.00/0.05 c octane : 0.00 0 0
0.00/0.05 c rens : 0.00 0 0
0.00/0.05 c rins : 0.00 0 0
0.00/0.05 c localbranching : 0.00 0 0
0.00/0.05 c mutation : 0.00 0 0
0.00/0.05 c crossover : 0.00 0 0
0.00/0.05 c dins : 0.00 0 0
0.00/0.05 c undercover : 0.00 0 0
0.00/0.05 c nlp : 0.00 0 0
0.00/0.05 c trysol : 0.00 0 0
0.00/0.05 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.05 c primal LP : 0.00 0 0 0.00 -
0.00/0.05 c dual LP : 0.00 5 49 9.80 -
0.00/0.05 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.05 c barrier LP : 0.00 0 0 0.00 -
0.00/0.05 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.05 c strong branching : 0.00 0 0 0.00 -
0.00/0.05 c (at root node) : - 0 0 0.00 -
0.00/0.05 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.05 c B&B Tree :
0.00/0.05 c number of runs : 1
0.00/0.05 c nodes : 1
0.00/0.05 c nodes (total) : 1
0.00/0.05 c nodes left : 0
0.00/0.05 c max depth : 0
0.00/0.05 c max depth (total): 0
0.00/0.05 c backtracks : 0 (0.0%)
0.00/0.05 c delayed cutoffs : 0
0.00/0.05 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.05 c avg switch length: 2.00
0.00/0.05 c switching time : 0.00
0.00/0.05 c Solution :
0.00/0.05 c Solutions found : 11 (6 improvements)
0.00/0.05 c First Solution : +5.90000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.05 c Primal Bound : +6.00000000000000e+00 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <oneopt>)
0.00/0.05 c Dual Bound : +6.00000000000000e+00
0.00/0.05 c Gap : 0.00 %
0.00/0.05 c Root Dual Bound : +6.00000000000000e+00
0.00/0.05 c Root Iterations : 49
0.05/0.06 c Time complete: 0.05.
OK 6
runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2704533-1278561438/watcher-2704533-1278561438 -o /tmp/evaluation-result-2704533-1278561438/solver-2704533-1278561438 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704533-1278561438.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: 1.01 1.00 1.00 3/106 27510 /proc/meminfo: memFree=1702920/2059040 swapFree=4139720/4192956 [pid=27510] ppid=27508 vsize=7904 CPUtime=0 /proc/27510/stat : 27510 (pbscip.linux.x8) R 27508 27510 27376 0 -1 4202496 1040 0 0 0 0 0 0 0 18 0 1 0 24350844 8093696 951 1992294400 4194304 8395647 140736259143888 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 1 0 0 0 /proc/27510/statm: 1976 960 365 1026 0 946 0 [startup+0.0577871 s] /proc/loadavg: 1.01 1.00 1.00 3/106 27510 /proc/meminfo: memFree=1702920/2059040 swapFree=4139720/4192956 [pid=27510] ppid=27508 vsize=12992 CPUtime=0.05 /proc/27510/stat : 27510 (pbscip.linux.x8) R 27508 27510 27376 0 -1 4202496 3125 0 0 0 4 1 0 0 20 0 1 0 24350844 13303808 2168 1992294400 4194304 8395647 140736259143888 18446744073709551615 7435351 0 0 4096 0 0 0 0 17 1 0 0 0 /proc/27510/statm: 3248 2168 600 1026 0 2218 0 Current children cumulated CPU time (s) 0.05 Current children cumulated vsize (KiB) 12992 Solver just ended. Dumping a history of the last processes samples [startup+0.0577871 s] /proc/loadavg: 1.01 1.00 1.00 3/106 27510 /proc/meminfo: memFree=1702920/2059040 swapFree=4139720/4192956 [pid=27510] ppid=27508 vsize=12992 CPUtime=0.05 /proc/27510/stat : 27510 (pbscip.linux.x8) R 27508 27510 27376 0 -1 4202496 3125 0 0 0 4 1 0 0 20 0 1 0 24350844 13303808 2168 1992294400 4194304 8395647 140736259143888 18446744073709551615 7435351 0 0 4096 0 0 0 0 17 1 0 0 0 /proc/27510/statm: 3248 2168 600 1026 0 2218 0 Current children cumulated CPU time (s) 0.05 Current children cumulated vsize (KiB) 12992 Child status: 0 Real time (s): 0.060741 CPU time (s): 0.05999 CPU user time (s): 0.047992 CPU system time (s): 0.011998 CPU usage (%): 98.7635 Max. virtual memory (cumulated for all children) (KiB): 12992 getrusage(RUSAGE_CHILDREN,...) data: user time used= 0.047992 system time used= 0.011998 maximum resident set size= 0 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 3132 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= 4 involuntary context switches= 1 runsolver used 0.002999 second user time and 0.012998 second system time The end
Begin job on node048 at 2010-07-08 05:57:18 IDJOB=2704533 IDBENCH=2856 IDSOLVER=1213 FILE ID=node048/2704533-1278561438 PBS_JOBID= 11239564 Free space on /tmp= 62572 MiB SOLVER NAME= SCIPspx SCIP 1.2.1.3 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-dk512x.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-2704533-1278561438/watcher-2704533-1278561438 -o /tmp/evaluation-result-2704533-1278561438/solver-2704533-1278561438 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704533-1278561438.opb -t 1800 -m 1800 TIME LIMIT= 1800 seconds MEMORY LIMIT= 1800 MiB MAX NB THREAD= 0 MD5SUM BENCH= 581a8e804be9894a02ef91830c95d4b0 RANDOM SEED=1723164692 node048.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.262 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.52 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.262 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.53 clflush size : 64 cache_alignment : 128 address sizes : 36 bits physical, 48 bits virtual power management: /proc/meminfo: MemTotal: 2059040 kB MemFree: 1703448 kB Buffers: 68848 kB Cached: 198812 kB SwapCached: 7124 kB Active: 128824 kB Inactive: 152688 kB HighTotal: 0 kB HighFree: 0 kB LowTotal: 2059040 kB LowFree: 1703448 kB SwapTotal: 4192956 kB SwapFree: 4139720 kB Dirty: 10804 kB Writeback: 32 kB AnonPages: 11376 kB Mapped: 11952 kB Slab: 52068 kB PageTables: 4100 kB NFS_Unstable: 0 kB Bounce: 0 kB CommitLimit: 5222476 kB Committed_AS: 180152 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= 62564 MiB End job on node048 at 2010-07-08 05:57:18