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-2704303-1278551731.opb>
0.00/0.01 c original problem has 2 variables (2 bin, 0 int, 0 impl, 0 cont) and 4 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 2 del vars, 2 del conss, 2 chg bounds, 4 chg sides, 2 chg coeffs, 0 upgd conss, 4 impls, 0 clqs
0.00/0.01 c presolving (2 rounds):
0.00/0.01 c 2 deleted vars, 2 deleted constraints, 2 tightened bounds, 0 added holes, 4 changed sides, 2 changed coefficients
0.00/0.01 c 4 implications, 0 cliques
0.00/0.01 c presolving detected infeasibility
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 1.2.1.3
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1790
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 1620
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 c SCIP Status : problem is solved [infeasible]
0.00/0.01 c Solving Time (sec) : 0.01
0.00/0.01 c Solving Nodes : 0
0.00/0.01 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.00/0.01 c Dual Bound : -1.00000000000000e+20
0.00/0.01 c Gap : infinite
0.00/0.01 s UNSATISFIABLE
0.00/0.01 c SCIP Status : problem is solved [infeasible]
0.00/0.01 c Solving Time : 0.01
0.00/0.01 c Original Problem :
0.00/0.01 c Problem name : HOME/instance-2704303-1278551731.opb
0.00/0.01 c Variables : 2 (2 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.01 c Constraints : 4 initial, 4 maximal
0.00/0.01 c Presolved Problem :
0.00/0.01 c Problem name : t_HOME/instance-2704303-1278551731.opb
0.00/0.01 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.01 c Constraints : 2 initial, 2 maximal
0.00/0.01 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.01 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c linear : 0.00 2 0 0 2 0 2 4 2
0.00/0.01 c root node : - 0 - - 0 - - - -
0.00/0.01 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.01 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c linear : 2 0 0 0 0 0 0 0 0 0
0.00/0.01 c countsols : 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.01 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c linear : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c Propagators : Time Calls Cutoffs DomReds
0.00/0.01 c pseudoobj : 0.00 0 0 0
0.00/0.01 c rootredcost : 0.00 0 0 0
0.00/0.01 c vbounds : 0.00 0 0 0
0.00/0.01 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.01 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.01 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.01 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.01 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.01 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.01 c applied globally : - - - 0 0.0 - - -
0.00/0.01 c applied locally : - - - 0 0.0 - - -
0.00/0.01 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.01 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.01 c redcost : 0.00 0 0 0 0 0
0.00/0.01 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.01 c intobj : 0.00 0 0 0 0 0
0.00/0.01 c cgmip : 0.00 0 0 0 0 0
0.00/0.01 c gomory : 0.00 0 0 0 0 0
0.00/0.01 c strongcg : 0.00 0 0 0 0 0
0.00/0.01 c cmir : 0.00 0 0 0 0 0
0.00/0.01 c flowcover : 0.00 0 0 0 0 0
0.00/0.01 c clique : 0.00 0 0 0 0 0
0.00/0.01 c zerohalf : 0.00 0 0 0 0 0
0.00/0.01 c mcf : 0.00 0 0 0 0 0
0.00/0.01 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.01 c Pricers : Time Calls Vars
0.00/0.01 c problem variables: 0.00 0 0
0.00/0.01 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.01 c pscost : 0.00 0 0 0 0 0 0
0.00/0.01 c inference : 0.00 0 0 0 0 0 0
0.00/0.01 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.01 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.01 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.01 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.01 c random : 0.00 0 0 0 0 0 0
0.00/0.01 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.01 c Primal Heuristics : Time Calls Found
0.00/0.01 c LP solutions : 0.00 - 0
0.00/0.01 c pseudo solutions : 0.00 - 0
0.00/0.01 c trivial : 0.00 1 0
0.00/0.01 c simplerounding : 0.00 0 0
0.00/0.01 c zirounding : 0.00 0 0
0.00/0.01 c rounding : 0.00 0 0
0.00/0.01 c shifting : 0.00 0 0
0.00/0.01 c intshifting : 0.00 0 0
0.00/0.01 c oneopt : 0.00 0 0
0.00/0.01 c twoopt : 0.00 0 0
0.00/0.01 c fixandinfer : 0.00 0 0
0.00/0.01 c feaspump : 0.00 0 0
0.00/0.01 c coefdiving : 0.00 0 0
0.00/0.01 c pscostdiving : 0.00 0 0
0.00/0.01 c fracdiving : 0.00 0 0
0.00/0.01 c veclendiving : 0.00 0 0
0.00/0.02 c intdiving : 0.00 0 0
0.00/0.02 c actconsdiving : 0.00 0 0
0.00/0.02 c objpscostdiving : 0.00 0 0
0.00/0.02 c rootsoldiving : 0.00 0 0
0.00/0.02 c linesearchdiving : 0.00 0 0
0.00/0.02 c guideddiving : 0.00 0 0
0.00/0.02 c octane : 0.00 0 0
0.00/0.02 c rens : 0.00 0 0
0.00/0.02 c rins : 0.00 0 0
0.00/0.02 c localbranching : 0.00 0 0
0.00/0.02 c mutation : 0.00 0 0
0.00/0.02 c crossover : 0.00 0 0
0.00/0.02 c dins : 0.00 0 0
0.00/0.02 c undercover : 0.00 0 0
0.00/0.02 c nlp : 0.00 0 0
0.00/0.02 c trysol : 0.00 0 0
0.00/0.02 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.02 c primal LP : 0.00 0 0 0.00 -
0.00/0.02 c dual LP : 0.00 0 0 0.00 -
0.00/0.02 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.02 c barrier LP : 0.00 0 0 0.00 -
0.00/0.02 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.02 c strong branching : 0.00 0 0 0.00 -
0.00/0.02 c (at root node) : - 0 0 0.00 -
0.00/0.02 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.02 c B&B Tree :
0.00/0.02 c number of runs : 1
0.00/0.02 c nodes : 0
0.00/0.02 c nodes (total) : 0
0.00/0.02 c nodes left : 1
0.00/0.02 c max depth : -1
0.00/0.02 c max depth (total): -1
0.00/0.02 c backtracks : 0 (0.0%)
0.00/0.02 c delayed cutoffs : 0
0.00/0.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.02 c avg switch length: 0.00
0.00/0.02 c switching time : 0.00
0.00/0.02 c Solution :
0.00/0.02 c Solutions found : 0 (0 improvements)
0.00/0.02 c Primal Bound : infeasible
0.00/0.02 c Dual Bound : -
0.00/0.02 c Gap : infinite
0.00/0.02 c Root Dual Bound : -
0.00/0.02 c Root Iterations : 0
0.00/0.02 c Time complete: 0.01.
runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2704303-1278551731/watcher-2704303-1278551731 -o /tmp/evaluation-result-2704303-1278551731/solver-2704303-1278551731 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704303-1278551731.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.00 1.00 0.91 3/106 27971
/proc/meminfo: memFree=1674212/2059040 swapFree=4165016/4192956
[pid=27971] ppid=27969 vsize=7904 CPUtime=0
/proc/27971/stat : 27971 (pbscip.linux.x8) R 27969 27971 26988 0 -1 4202496 1056 0 0 0 0 0 0 0 18 0 1 0 23380231 8093696 967 1992294400 4194304 8395647 140735758834352 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/27971/statm: 1976 975 365 1026 0 946 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.025193
CPU time (s): 0.024995
CPU user time (s): 0.016997
CPU system time (s): 0.007998
CPU usage (%): 99.214
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.016997
system time used= 0.007998
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 2750
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= 1
runsolver used 0.001999 second user time and 0.012998 second system time
The end