| 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 | 14 | 0.035994 | 0.0364201 |
| Name | /OPT-SMALLINT-LIN/leberre/opb-paranoid/ misc2010/datasets/caixa/normalized-787.cudf.paranoid.opb |
| MD5SUM | 8c4aee9354f54edaa2e878481d0e2867 |
| Bench Category | OPT-SMALLINT-LIN (optimisation, small integers, linear constraints) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 14 |
| Best CPU time to get the best result obtained on this benchmark | 0.002998 |
| Has Objective Function | YES |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of variables | 33 |
| Total number of constraints | 225 |
| Number of constraints which are clauses | 225 |
| 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 | 3 |
| Number of terms in the objective function | 14 |
| 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 | 14 |
| Number of bits of the sum of numbers in the objective function | 4 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 14 |
| Number of bits of the biggest sum of numbers | 4 |
| 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-2704866-1278579917.opb>
0.00/0.01 c original problem has 33 variables (33 bin, 0 int, 0 impl, 0 cont) and 225 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 o 14
0.00/0.02 c feasible solution found by trivial heuristic, objective value 1.400000e+01
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 13 del vars, 24 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 234 impls, 0 clqs
0.00/0.02 c (round 2) 15 del vars, 26 del conss, 3 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 236 impls, 0 clqs
0.00/0.02 c (round 3) 22 del vars, 63 del conss, 15 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 251 impls, 0 clqs
0.00/0.02 c (round 4) 27 del vars, 207 del conss, 15 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 251 impls, 0 clqs
0.00/0.02 c presolving (5 rounds):
0.00/0.02 c 33 deleted vars, 225 deleted constraints, 15 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
0.00/0.02 c 251 implications, 0 cliques
0.00/0.02 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.3
0.00/0.02 c
0.00/0.02 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c conflict/interconss = 0
0.00/0.02 c
0.00/0.02 c # should binary conflicts be preferred?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c conflict/preferbinary = TRUE
0.00/0.02 c
0.00/0.02 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c constraints/agelimit = 1
0.00/0.02 c
0.00/0.02 c # should enforcement of pseudo solution be disabled?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/disableenfops = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1790
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 1620
0.00/0.02 c
0.00/0.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = 0
0.00/0.02 c
0.00/0.02 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.02 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.02 c lp/pricing = a
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # priority of node selection rule <dfs> in standard mode
0.00/0.02 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.02 c nodeselection/dfs/stdpriority = 1000000
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 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.02 c t 0.0s| 1 | 0 | 0 | - | 238k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1.400000e+01 | 1.400000e+01 | 0.00%
0.00/0.02 c
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Solving Time (sec) : 0.01
0.00/0.02 c Solving Nodes : 1
0.00/0.02 c Primal Bound : +1.40000000000000e+01 (1 solutions)
0.00/0.02 c Dual Bound : +1.40000000000000e+01
0.00/0.02 c Gap : 0.00 %
0.00/0.02 s OPTIMUM FOUND
0.00/0.02 v x19 x18 x17 x16 x15 x14 x13 x12 x11 x10 x9 x8 x6 x7 x5 x4 x3 x2 x1 x33 x32 x31 x30 x29 x28 x27 x26 x25 x24 x23 x22 x21 x20
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Solving Time : 0.01
0.00/0.02 c Original Problem :
0.00/0.02 c Problem name : HOME/instance-2704866-1278579917.opb
0.00/0.02 c Variables : 33 (33 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 225 initial, 225 maximal
0.00/0.02 c Presolved Problem :
0.00/0.02 c Problem name : t_HOME/instance-2704866-1278579917.opb
0.00/0.02 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 0 initial, 0 maximal
0.00/0.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.02 c trivial : 0.00 5 0 0 0 0 0 0 0
0.00/0.02 c dualfix : 0.00 6 0 0 0 0 0 0 0
0.00/0.02 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.02 c linear : 0.00 10 12 0 15 0 225 0 1
0.00/0.02 c root node : - 0 - - 0 - - - -
0.00/0.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.02 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c countsols : 0 0 0 0 0 0 0 0 0 0
0.00/0.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.02 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c Propagators : Time Calls Cutoffs DomReds
0.00/0.02 c pseudoobj : 0.00 0 0 0
0.00/0.02 c rootredcost : 0.00 0 0 0
0.00/0.02 c vbounds : 0.00 0 0 0
0.00/0.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
0.00/0.02 c applied globally : - - - 0 0.0 - - -
0.00/0.02 c applied locally : - - - 0 0.0 - - -
0.00/0.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.02 c redcost : 0.00 0 0 0 0 0
0.00/0.02 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.02 c intobj : 0.00 0 0 0 0 0
0.00/0.02 c cgmip : 0.00 0 0 0 0 0
0.00/0.02 c gomory : 0.00 0 0 0 0 0
0.00/0.02 c strongcg : 0.00 0 0 0 0 0
0.00/0.02 c cmir : 0.00 0 0 0 0 0
0.00/0.02 c flowcover : 0.00 0 0 0 0 0
0.00/0.02 c clique : 0.00 0 0 0 0 0
0.00/0.02 c zerohalf : 0.00 0 0 0 0 0
0.00/0.02 c mcf : 0.00 0 0 0 0 0
0.00/0.02 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.02 c Pricers : Time Calls Vars
0.00/0.02 c problem variables: 0.00 0 0
0.00/0.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.02 c pscost : 0.00 0 0 0 0 0 0
0.00/0.02 c inference : 0.00 0 0 0 0 0 0
0.00/0.02 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.02 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.02 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.02 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.02 c random : 0.00 0 0 0 0 0 0
0.00/0.02 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.03 c Primal Heuristics : Time Calls Found
0.00/0.03 c LP solutions : 0.00 - 0
0.00/0.03 c pseudo solutions : 0.00 - 0
0.00/0.03 c oneopt : 0.00 0 0
0.00/0.03 c trivial : 0.00 1 1
0.00/0.03 c simplerounding : 0.00 0 0
0.00/0.03 c zirounding : 0.00 0 0
0.00/0.03 c rounding : 0.00 0 0
0.00/0.03 c shifting : 0.00 0 0
0.00/0.03 c intshifting : 0.00 0 0
0.00/0.03 c twoopt : 0.00 0 0
0.00/0.03 c fixandinfer : 0.00 0 0
0.00/0.03 c feaspump : 0.00 0 0
0.00/0.03 c coefdiving : 0.00 0 0
0.00/0.03 c pscostdiving : 0.00 0 0
0.00/0.03 c fracdiving : 0.00 0 0
0.00/0.03 c veclendiving : 0.00 0 0
0.00/0.03 c intdiving : 0.00 0 0
0.00/0.03 c actconsdiving : 0.00 0 0
0.00/0.03 c objpscostdiving : 0.00 0 0
0.00/0.03 c rootsoldiving : 0.00 0 0
0.00/0.03 c linesearchdiving : 0.00 0 0
0.00/0.03 c guideddiving : 0.00 0 0
0.00/0.03 c octane : 0.00 0 0
0.00/0.03 c rens : 0.00 0 0
0.00/0.03 c rins : 0.00 0 0
0.00/0.03 c localbranching : 0.00 0 0
0.00/0.03 c mutation : 0.00 0 0
0.00/0.03 c crossover : 0.00 0 0
0.00/0.03 c dins : 0.00 0 0
0.00/0.03 c undercover : 0.00 0 0
0.00/0.03 c nlp : 0.00 0 0
0.00/0.03 c trysol : 0.00 0 0
0.00/0.03 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.03 c primal LP : 0.00 0 0 0.00 -
0.00/0.03 c dual LP : 0.00 0 0 0.00 -
0.00/0.03 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.03 c barrier LP : 0.00 0 0 0.00 -
0.00/0.03 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.03 c strong branching : 0.00 0 0 0.00 -
0.00/0.03 c (at root node) : - 0 0 0.00 -
0.00/0.03 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.03 c B&B Tree :
0.00/0.03 c number of runs : 1
0.00/0.03 c nodes : 1
0.00/0.03 c nodes (total) : 1
0.00/0.03 c nodes left : 0
0.00/0.03 c max depth : 0
0.00/0.03 c max depth (total): 0
0.00/0.03 c backtracks : 0 (0.0%)
0.00/0.03 c delayed cutoffs : 0
0.00/0.03 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.03 c avg switch length: 2.00
0.00/0.03 c switching time : 0.00
0.00/0.03 c Solution :
0.00/0.03 c Solutions found : 1 (1 improvements)
0.00/0.03 c First Solution : +1.40000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.03 c Primal Bound : +1.40000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.03 c Dual Bound : +1.40000000000000e+01
0.00/0.03 c Gap : 0.00 %
0.00/0.03 c Root Dual Bound : +1.40000000000000e+01
0.00/0.03 c Root Iterations : 0
0.00/0.03 c Time complete: 0.03.
OK 14
runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2704866-1278579917/watcher-2704866-1278579917 -o /tmp/evaluation-result-2704866-1278579917/solver-2704866-1278579917 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704866-1278579917.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.89 1.00 1.00 3/106 29867 /proc/meminfo: memFree=1876044/2059040 swapFree=4139292/4192956 [pid=29867] ppid=29865 vsize=7904 CPUtime=0 /proc/29867/stat : 29867 (pbscip.linux.x8) R 29865 29867 29096 0 -1 4202496 1130 0 0 0 0 0 0 0 25 0 1 0 26203207 8093696 1041 1992294400 4194304 8395647 140737399170944 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 1 0 0 0 /proc/29867/statm: 1976 1050 365 1026 0 946 0 Solver just ended. Dumping a history of the last processes samples Child status: 0 Real time (s): 0.0364201 CPU time (s): 0.035994 CPU user time (s): 0.024996 CPU system time (s): 0.010998 CPU usage (%): 98.8301 Max. virtual memory (cumulated for all children) (KiB): 0 getrusage(RUSAGE_CHILDREN,...) data: user time used= 0.024996 system time used= 0.010998 maximum resident set size= 0 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 2855 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= 5 involuntary context switches= 1 runsolver used 0.002999 second user time and 0.011998 second system time The end
Begin job on node027 at 2010-07-08 11:05:17 IDJOB=2704866 IDBENCH=72141 IDSOLVER=1213 FILE ID=node027/2704866-1278579917 PBS_JOBID= 11240095 Free space on /tmp= 62524 MiB SOLVER NAME= SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver BENCH NAME= PB10/normalized-PB10/OPT-SMALLINT-LIN/leberre/opb-paranoid/misc2010/datasets/caixa/normalized-787.cudf.paranoid.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-2704866-1278579917/watcher-2704866-1278579917 -o /tmp/evaluation-result-2704866-1278579917/solver-2704866-1278579917 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704866-1278579917.opb -t 1800 -m 1800 TIME LIMIT= 1800 seconds MEMORY LIMIT= 1800 MiB MAX NB THREAD= 0 MD5SUM BENCH= 8c4aee9354f54edaa2e878481d0e2867 RANDOM SEED=438999810 node027.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 : 2800.222 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 : 5600.44 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 : 2800.222 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.45 clflush size : 64 cache_alignment : 128 address sizes : 36 bits physical, 48 bits virtual power management: /proc/meminfo: MemTotal: 2059040 kB MemFree: 1876572 kB Buffers: 2016 kB Cached: 86028 kB SwapCached: 6620 kB Active: 56372 kB Inactive: 44988 kB HighTotal: 0 kB HighFree: 0 kB LowTotal: 2059040 kB LowFree: 1876572 kB SwapTotal: 4192956 kB SwapFree: 4139292 kB Dirty: 10676 kB Writeback: 0 kB AnonPages: 12000 kB Mapped: 12044 kB Slab: 59172 kB PageTables: 4156 kB NFS_Unstable: 0 kB Bounce: 0 kB CommitLimit: 5222476 kB Committed_AS: 181248 kB VmallocTotal: 34359738367 kB VmallocUsed: 264952 kB VmallocChunk: 34359471699 kB HugePages_Total: 0 HugePages_Free: 0 HugePages_Rsvd: 0 Hugepagesize: 2048 kB Free space on /tmp at the end= 62516 MiB End job on node027 at 2010-07-08 11:05:18