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_0003.txt.wcnf
Job file: /home/maxsat/benchmarks/wpms_crafted/AUCTIONS/AUC_PATHS/cat_paths_60_70_0003.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_0003.txt.wcnf
c reading problem ... 
c ... done. Wall clock time 0.099s.
c #vars     610
c #constraints  470
c constraints type 
c org.sat4j.minisat.constraints.cnf.OriginalBinaryClause => 470
c OPTIMIZING...
c Got one! Elapsed wall clock time (in seconds):0.115
o 45059
c Got one! Elapsed wall clock time (in seconds):0.926
o 44555
c cleaning 2500 clauses out of 5000 with flag 5000/5000
c cleaning 4250 clauses out of 8500 with flag 11000/11000
c cleaning 5625 clauses out of 11250 with flag 18001/18001
c cleaning 6811 clauses out of 13624 with flag 26000/26000
c cleaning 7907 clauses out of 15813 with flag 35001/35001
c cleaning 8948 clauses out of 17904 with flag 45000/45000
c cleaning 9475 clauses out of 18956 with flag 55000/55000
c cleaning 9736 clauses out of 19478 with flag 65000/65000
c cleaning 9865 clauses out of 19739 with flag 75000/75000
c cleaning 9932 clauses out of 19869 with flag 85001/85001
c cleaning 9961 clauses out of 19931 with flag 95000/95000
c starts		: 79
c conflicts		: 104408
c decisions		: 115487
c propagations		: 753910
c inspects		: 99593955
c learnt literals	: 44
c learnt binary clauses	: 204
c learnt ternary clauses	: 191
c learnt clauses	: 104363
c ignored clauses	: 0
c root simplifications	: 0
c removed literals (reason simplification)	: 796106
c reason swapping (by a shorter reason)	: 0
c Calls to reduceDB	: 11
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)	: 23215.088529638182
c non guided choices	0
c learnt constraints type 
c constraints type 
c org.sat4j.minisat.constraints.cnf.OriginalBinaryClause => 470
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=44555
c Total wall clock time (in seconds): 33.403
34.219u 0.215s 0:34.21 100.6%	0+0k 0+0io 1pf+0w