Warning: no access to tty (Bad file descriptor).
Thus no job control in this shell.
Job name: run-job-SAT4J-MAXSAT-2.2.0-wpms_crafted-_home_maxsat_benchmarks_wpms_crafted_AUCTIONS_AUC_PATHS_cat_paths_60_70_0002.txt.wcnf
Job file: /home/maxsat/benchmarks/wpms_crafted/AUCTIONS/AUC_PATHS/cat_paths_60_70_0002.txt.wcnf
Job solver: /home/maxsat/solvers/SAT4J-MAXSAT-2.2.0/SAT4J-MAXSAT-2.2.0
c SAT4J: a SATisfiability library for Java (c) 2004-2010 Daniel Le Berre
c This is free software under the dual EPL/GNU LGPL licenses.
c See www.sat4j.org for details.
c This software uses some libraries from the Jakarta Commons project. See jakarta.apache.org for details.
c version 2.2.0.v20100416
c java.runtime.name	Java(TM) SE Runtime Environment
c java.vm.name		Java HotSpot(TM) 64-Bit Server VM
c java.vm.version	11.3-b02
c java.vm.vendor	Sun Microsystems Inc.
c sun.arch.data.model	64
c java.version		1.6.0_13
c os.name		Linux
c os.version		2.6.18-128.1.14.el5
c os.arch		amd64
c Free memory 		403233816
c Max memory 		405471232
c Total memory 		405471232
c Number of processors 	2
c --- Begin Solver configuration ---
c Stops conflict analysis at the first Unique Implication Point
c org.sat4j.pb.constraints.CompetResolutionPBMixedWLClauseCardConstrDataStructure@446b7920
c Learn all clauses as in MiniSAT
c claDecay=0.999 varDecay=0.95 conflictBoundIncFactor=1.5 initConflictBound=100 
c VSIDS like heuristics from MiniSAT using a heap lightweight component caching from RSAT taking into account the objective function
c Expensive reason simplification
c Armin Biere (Picosat) restarts strategy
c Glucose learned constraints deletion strategy
c timeout=2147483s
c DB Simplification allowed=false
c --- End Solver configuration ---
c solving /home/maxsat/benchmarks/wpms_crafted/AUCTIONS/AUC_PATHS/cat_paths_60_70_0002.txt.wcnf
c reading problem ... 
c ... done. Wall clock time 0.113s.
c #vars     680
c #constraints  540
c constraints type 
c org.sat4j.minisat.constraints.cnf.OriginalBinaryClause => 540
c OPTIMIZING...
c Got one! Elapsed wall clock time (in seconds):0.133
o 39628
c Got one! Elapsed wall clock time (in seconds):0.162
o 39121
c Got one! Elapsed wall clock time (in seconds):0.816
o 38856
c Got one! Elapsed wall clock time (in seconds):0.927
o 38693
c Got one! Elapsed wall clock time (in seconds):0.968
o 38670
c cleaning 2498 clauses out of 5000 with flag 5000/5000
c cleaning 4236 clauses out of 8499 with flag 11000/11000
c Got one! Elapsed wall clock time (in seconds):3.691
o 38591
c Got one! Elapsed wall clock time (in seconds):3.745
o 38568
c Got one! Elapsed wall clock time (in seconds):3.813
o 38495
c cleaning 5630 clauses out of 11262 with flag 18000/18000
c cleaning 6816 clauses out of 13631 with flag 26000/26000
c cleaning 7907 clauses out of 15813 with flag 35000/35000
c cleaning 8938 clauses out of 17896 with flag 45000/45000
c starts		: 63
c conflicts		: 47990
c decisions		: 53491
c propagations		: 334188
c inspects		: 32290255
c learnt literals	: 29
c learnt binary clauses	: 71
c learnt ternary clauses	: 21
c learnt clauses	: 47960
c ignored clauses	: 0
c root simplifications	: 0
c removed literals (reason simplification)	: 534018
c reason swapping (by a shorter reason)	: 0
c Calls to reduceDB	: 6
c number of reductions to clauses (during analyze)	: 0
c number of learned constraints concerned by reduction	: 0
c number of learning phase by resolution	: 0
c number of learning phase by cutting planes	: 0
c speed (assignments/second)	: 40249.06660243285
c non guided choices	0
c learnt constraints type 
c constraints type 
c org.sat4j.minisat.constraints.cnf.OriginalBinaryClause => 540
c org.sat4j.pb.constraints.pb.MaxWatchPb => 0
s OPTIMUM FOUND
v -1 2 -3 -4 -5 -6 -7 8 -9 -10 -11 -12 -13 -14 15 -16 17 -18 19 -20 -21 22 -23 24 25 -26 -27 -28 29 -30 31 -32 -33 -34 -35 -36 -37 -38 -39 -40 -41 42 -43 -44 -45 -46 -47 -48 -49 -50 -51 -52 53 -54 -55 56 -57 -58 59 60 -61 -62 -63 -64 -65 -66 -67 -68 -69 -70 0
c objective function=38495
c Total wall clock time (in seconds): 12.119
12.597u 0.197s 0:12.92 98.9%	0+0k 0+0io 1pf+0w