z3 0.0.20181229 → 0.0.20211213

data/examples/futoshiki

@@ -0,0 +1,128 @@
+#!/usr/bin/env ruby
+
+require "pathname"
+require_relative "../lib/z3"
+
+class Futoshiki
+  # This needs to be very exactly formatted
+  def initialize(path)
+    @data = Pathname(path).readlines.map(&:chomp)
+    @size = (@data.size+1)/2
+    @solver = Z3::Solver.new
+  end
+
+  def cell_value(x, y)
+    v = @data[y*2][x*2]
+    if v == "#"
+      nil
+    elsif v =~ /\d/
+      v.to_i
+    else
+      raise "Bad cell value"
+    end
+  end
+
+  def cmp_right(x, y)
+    v = @data[y*2][x*2 + 1]
+    if v == ">"
+      ">"
+    elsif v == "<"
+      "<"
+    elsif v == " "
+      nil
+    else
+      raise "Bad dot value"
+    end
+  end
+
+  def cmp_bottom(x, y)
+    v = @data[y*2 + 1][x*2]
+    if v == "_"
+      ">"
+    elsif v == "^"
+      "<"
+    elsif v == " " or v == nil
+      false
+    else
+      raise "Bad dot value"
+    end
+  end
+
+  def call
+    @vars = {}
+    @size.times do |y|
+      @size.times do |x|
+        v = Z3.Int("v#{x},#{y}")
+        @vars[[x,y]] = v
+        cv = cell_value(x, y)
+        if cv
+          @solver.assert (v == cv)
+        else
+          @solver.assert (v >= 1) & (v <= @size)
+        end
+      end
+    end
+
+    @size.times do |x|
+      line = @size.times.map{|y| @vars[[x,y]] }
+      @solver.assert Z3.Distinct(*line)
+    end
+
+    @size.times do |y|
+      line = @size.times.map{|x| @vars[[x,y]] }
+      @solver.assert Z3.Distinct(*line)
+    end
+
+    # Compare right
+    (0..@size-1).each do |y|
+      (0..@size-2).each do |x|
+        lv = @vars[[x,y]]
+        rv = @vars[[x+1,y]]
+        cmp = cmp_right(x,y)
+        if cmp == ">"
+          @solver.assert lv > rv
+        elsif cmp == "<"
+          @solver.assert lv < rv
+        end
+      end
+    end
+
+    # Compare bottom
+    (0..@size-2).each do |y|
+      (0..@size-1).each do |x|
+        tv = @vars[[x,y]]
+        bv = @vars[[x,y+1]]
+        cmp = cmp_bottom(x,y)
+        if cmp == ">"
+          @solver.assert tv > bv
+        elsif cmp == "<"
+          @solver.assert tv < bv
+        end
+      end
+    end
+
+    if @solver.satisfiable?
+      @model = @solver.model
+      print_answer!
+    else
+      puts "failed to solve"
+    end
+  end
+
+  private
+
+  def print_answer!
+    output = @data.map(&:dup)
+    @size.times do |y|
+      @size.times do |x|
+        v = @model[@vars[[x,y]]]
+        output[2*y][2*x] = "#{v}"
+      end
+    end
+
+    puts output
+  end
+end
+
+path = ARGV[0] || Pathname(__dir__) + "futoshiki-1.txt"
+Futoshiki.new(path).call

data/examples/futoshiki-1.txt

@@ -0,0 +1,17 @@
+# # # # # # #<# #
+
+1 # # # # 5 #<#<6
+  _
+7<# 2 5>#># #<# #
+^
+# #<#<# # # # # #
+            ^
+# #>#># # # 5 # 3
+^         ^     ^
+# # # # # 3 # # #
+  _   _ ^   _ _
+# # # #># # # # #
+_
+5 # #>3 #># #># #
+              _
+# # #>#># 9 #<2 5

data/examples/kakurasu

@@ -0,0 +1,73 @@
+#!/usr/bin/env ruby
+
+require "pathname"
+require_relative "../lib/z3"
+
+class Kakurasu
+  def initialize(path)
+    data = Pathname(path).readlines.grep(/\S/)
+    raise "Data needs to have two lines (cols, rows)" unless data.size == 2
+    @col_sums = data[0].split.map(&:to_i)
+    @row_sums = data[1].split.map(&:to_i)
+
+    @xsize = @col_sums.size
+    @ysize = @row_sums.size
+    @solver = Z3::Solver.new
+  end
+
+  def call
+    # setup
+    @bvars = {}
+    @cvars = {}
+    @rvars = {}
+    @ysize.times do |y|
+      @ysize.times do |x|
+        b = Z3.Bool("b#{x},#{y}")
+        r = Z3.Int("r#{x},#{y}")
+        c = Z3.Int("c#{x},#{y}")
+        @solver.assert (!b).implies(r == 0)
+        @solver.assert (!b).implies(c == 0)
+        @solver.assert b.implies(r == (x+1))
+        @solver.assert b.implies(c == (y+1))
+        @bvars[[x,y]] = b
+        @cvars[x] ||= []
+        @cvars[x][y] = c
+        @rvars[y] ||= []
+        @rvars[y][x] = r
+      end
+    end
+
+    @xsize.times do |x|
+      @solver.assert Z3.Add(*@rvars[x]) == @row_sums[x]
+    end
+
+    @ysize.times do |y|
+      @solver.assert Z3.Add(*@cvars[y]) == @col_sums[y]
+    end
+
+    if @solver.satisfiable?
+      @model = @solver.model
+      print_board!
+    else
+      puts "failed to solve"
+    end
+  end
+
+  private
+
+  def print_board!
+    @ysize.times do |y|
+      @ysize.times do |x|
+        if @model[@bvars[[x,y]]].to_b
+          print "[X]"
+        else
+          print "[ ]"
+        end
+      end
+      print "\n"
+    end
+  end
+end
+
+path = ARGV[0] || Pathname(__dir__) + "kakurasu-1.txt"
+Kakurasu.new(path).call

data/examples/kakurasu-1.txt

@@ -0,0 +1,2 @@
+ 7 14 35  5 22 22 56 10 37  2 69 21
+10 39 16 58  2 22 37 30 14 32 33 35

data/examples/kakuro

@@ -25,7 +25,7 @@ class Kakuro
     @solver = Z3::Solver.new
   end
 
-  def solve!
+  def call
     @cells = map_coordinates{|x,y| cell_var(x,y) if @data[[x,y]] == nil}.compact
 
     (0...@ysize).each do |y|
@@ -111,4 +111,4 @@ class Kakuro
 end
 
 path = ARGV[0] || Pathname(__dir__) + "kakuro-1.txt"
-Kakuro.new(path).solve!
+Kakuro.new(path).call

data/examples/killer_sudoku

@@ -0,0 +1,88 @@
+#!/usr/bin/env ruby
+
+require "pathname"
+require_relative "../lib/z3"
+
+class KillerSudokuSolver
+  def initialize(path)
+    data = Pathname(path).read
+    knowns, cages, cage_counts = data.split(/\n{2,}/)
+    @knowns = knowns.strip.split("\n").map do |line|
+      line.split.map{|c| c == "." ? nil : c.to_i}
+    end
+    @cages = cages.strip.split("\n").map do |line|
+      line.split
+    end
+    @size = @knowns.size
+    raise "Bad size" unless @knowns.all?{|line| line.size == @size}
+    raise "Bad size" unless @cages.size == @size
+    raise "Bad size" unless @cages.all?{|line| line.size == @size}
+    @cage_counts =  cage_counts.split("\n").to_h(&:split).transform_values(&:to_i)
+    @solver = Z3::Solver.new
+    if @size == 9
+      @boxsize = 3
+    elsif @size == 4
+      @boxsize = 2
+    else
+      raise "Bad size"
+    end
+  end
+
+  def call
+    @cells = (0...@size).map do |j|
+      (0...@size).map do |i|
+        cell_var(@knowns[j][i], i, j)
+      end
+    end
+
+    @cells.each do |row|
+      @solver.assert Z3.Distinct(*row)
+    end
+    @cells.transpose.each do |column|
+      @solver.assert Z3.Distinct(*column)
+    end
+    @cells.each_slice(@boxsize) do |rows|
+      rows.transpose.each_slice(@boxsize) do |square|
+        @solver.assert Z3.Distinct(*square.flatten)
+      end
+    end
+
+    by_cage = {}
+    (0...@size).each do |j|
+      (0...@size).each do |i|
+        c = @cages[j][i]
+        by_cage[c] ||= []
+        by_cage[c] << @cells[j][i]
+      end
+    end
+
+    by_cage.each do |cage_name, cells|
+      @solver.assert Z3.Add(*cells) == @cage_counts.fetch(cage_name)
+      @solver.assert Z3.Distinct(*cells)
+    end
+
+    if @solver.satisfiable?
+      @model = @solver.model
+      print_answer!
+    else
+      puts "failed to solve"
+    end
+  end
+
+  def cell_var(cell, i, j)
+    v = Z3.Int("cell[#{i+1},#{j+1}]")
+    @solver.assert v >= 1
+    @solver.assert v <= @size
+    @solver.assert v == cell if cell != nil
+    v
+  end
+
+  def print_answer!
+    @cells.each do |row|
+      puts row.map{|v| @model[v]}.join(" ")
+    end
+  end
+end
+
+path = ARGV[0] || Pathname(__dir__) + "killer_sudoku-1.txt"
+KillerSudokuSolver.new(path).call

data/examples/killer_sudoku-1.txt

@@ -0,0 +1,17 @@
+. . . .
+. . . .
+. . . .
+. . . .
+
+a b c c
+a b d e
+a d d e
+f f g g
+
+a 9
+b 3
+c 4
+d 7
+e 7
+f 4
+g 6

data/examples/killer_sudoku-2.txt

@@ -0,0 +1,53 @@
+. . . . . . . . .
+. . . . . . . . .
+. . . . . . . . .
+. . . . . . . . .
+. . . . . . . . .
+. . . . . . . . .
+. . . . . . . . .
+. . . . . . . . .
+. . . . . . . . .
+
+a a b c d d d e e
+f g b c v v x y z
+f g g u u w x y z
+f s s t t w A A B
+h h C C C D D A B
+i i G G F E E r q
+j j m G F n o r q
+k m m F F n o p q
+k l l n n n p p p
+
+a 9
+b 8
+c 14
+d 13
+e 15
+f 15
+g 18
+h 8
+i 9
+j 12
+k 10
+l 8
+m 15
+n 26
+o 13
+p 19
+q 12
+r 12
+s 10
+t 10
+u 11
+v 13
+w 11
+x 10
+y 5
+z 7
+A 12
+B 11
+C 13
+D 12
+E 9
+F 17
+G 18

data/examples/kinematics_problems

@@ -31,7 +31,7 @@ class KinematicsProblem01 < KinematicsProblem
   An airplane accelerates down a runway at 3.20 m/s2 for 32.8 s until is finally lifts off the ground.
   Determine the distance traveled before takeoff.
   """
-  def solve!
+  def call
     a = Z3.Real("a")
     t = Z3.Real("t")
     d = Z3.Real("d")
@@ -46,7 +46,7 @@ class KinematicsProblem02 < KinematicsProblem
   """
   A car starts from rest and accelerates uniformly over a time of 5.21 seconds for a distance of 110 m. Determine the acceleration of the car.
   """
-  def solve!
+  def call
     a = Z3.Real("a")
     t = Z3.Real("t")
     d = Z3.Real("d")
@@ -62,7 +62,7 @@ class KinematicsProblem03 < KinematicsProblem
   Upton Chuck is riding the Giant Drop at Great America.
   If Upton free falls for 2.60 seconds, what will be his final velocity and how far will he fall?
   """
-  def solve!
+  def call
     a = Z3.Real("a")
     t = Z3.Real("t")
     v = Z3.Real("v")
@@ -79,7 +79,7 @@ class KinematicsProblem04 < KinematicsProblem
   """
   A race car accelerates uniformly from 18.5 m/s to 46.1 m/s in 2.47 seconds. Determine the acceleration of the car and the distance traveled.
   """
-  def solve!
+  def call
     a = Z3.Real("a")
     t = Z3.Real("t")
     vs= Z3.Real("vs")
@@ -100,7 +100,7 @@ class KinematicsProblem05 < KinematicsProblem
   The acceleration of gravity on the moon is 1.67 m/s2.
   Determine the time for the feather to fall to the surface of the moon.
   """
-  def solve!
+  def call
     a = Z3.Real("a")
     t = Z3.Real("t")
     d = Z3.Real("d")
@@ -118,7 +118,7 @@ class KinematicsProblem06 < KinematicsProblem
   If a rocket-powered sled is accelerated to a speed of 444 m/s in 1.83 seconds,
   then what is the acceleration and what is the distance that the sled travels?
   """
-  def solve!
+  def call
     a = Z3.Real("a")
     t = Z3.Real("t")
     d = Z3.Real("d")
@@ -136,7 +136,7 @@ class KinematicsProblem07 < KinematicsProblem
   A bike accelerates uniformly from rest to a speed of 7.10 m/s over a distance of 35.4 m.
   Determine the acceleration of the bike.
   """
-  def solve!
+  def call
     a = Z3.Real("a")
     t = Z3.Real("t")
     d = Z3.Real("d")
@@ -156,7 +156,7 @@ class KinematicsProblem08 < KinematicsProblem
   The takeoff speed for this plane will be 65 m/s.
   Assuming this minimum acceleration, what is the minimum allowed length for the runway?
   """
-  def solve!
+  def call
     a = Z3.Real("a")
     t = Z3.Real("t")
     d = Z3.Real("d")
@@ -174,7 +174,7 @@ class KinematicsProblem09 < KinematicsProblem
   A car traveling at 22.4 m/s skids to a stop in 2.55 s.
   Determine the skidding distance of the car (assume uniform acceleration).
   """
-  def solve!
+  def call
     t = Z3.Real("t")
     d = Z3.Real("d")
     v = Z3.Real("v")
@@ -190,7 +190,7 @@ class KinematicsProblem10 < KinematicsProblem
   A kangaroo is capable of jumping to a height of 2.62 m.
   Determine the takeoff speed of the kangaroo.
   """
-  def solve!
+  def call
     a = Z3.Real("a")
     t = Z3.Real("t")
     d = Z3.Real("d")
@@ -207,13 +207,13 @@ end
 # This is actually param for Python Z3 printer, can't work until we get that
 # Z3.set_param("rational_to_decimal", true)
 
-KinematicsProblem01.new.solve!
-KinematicsProblem02.new.solve!
-KinematicsProblem03.new.solve!
-KinematicsProblem04.new.solve!
-KinematicsProblem05.new.solve!
-KinematicsProblem06.new.solve!
-KinematicsProblem07.new.solve!
-KinematicsProblem08.new.solve!
-KinematicsProblem09.new.solve!
-KinematicsProblem10.new.solve!
+KinematicsProblem01.new.call
+KinematicsProblem02.new.call
+KinematicsProblem03.new.call
+KinematicsProblem04.new.call
+KinematicsProblem05.new.call
+KinematicsProblem06.new.call
+KinematicsProblem07.new.call
+KinematicsProblem08.new.call
+KinematicsProblem09.new.call
+KinematicsProblem10.new.call

data/examples/knights_puzzle

@@ -39,7 +39,7 @@ class KnightsPuzzle
     puts ""
   end
 
-  def solve!
+  def call
     if @solver.satisfiable?
       @model = @solver.model
       puts "Solved"
@@ -119,4 +119,4 @@ class KnightsPuzzle
   end
 end
 
-KnightsPuzzle.new.solve!
+KnightsPuzzle.new.call

data/examples/kropki

@@ -0,0 +1,100 @@
+#!/usr/bin/env ruby
+
+
+require "pathname"
+require_relative "../lib/z3"
+
+# Based on https://play.google.com/store/apps/details?id=com.alexuvarov.android.kropki.puzzle&hl=en_GB
+#
+# NxN grid
+# Each cell contains numbers 1 to N
+# Each row and each column contains distinct numbers
+# If there's black dot (o) between cells, one is twice the other
+# If there's white dot (*) between cells, one is the other plus one
+# If there's no dot, neither of these is true
+# (for 1/2, dot can be of either color)
+
+class Kropki
+  def initialize(path)
+    @data = Pathname(path).readlines.map(&:chomp)
+    @size = (@data.size - 1) / 2
+    raise unless @data.size == 2 * @size + 1
+    raise unless @data.all?{ |row| row.size == 2 * @size + 1 }
+    @solver = Z3::Solver.new
+  end
+
+  def call
+    # Cells contain numbers 1 - N
+    @size.times do |y|
+      @size.times do |x|
+        @solver.assert cell(x, y) >= 1
+        @solver.assert cell(x, y) <= @size
+      end
+    end
+
+    # Each row and column distinct
+    @size.times do |y|
+      @solver.assert Z3.Distinct(*@size.times.map{ |x| cell(x,y) })
+    end
+    @size.times do |x|
+      @solver.assert Z3.Distinct(*@size.times.map{ |y| cell(x,y) })
+    end
+
+    # Horizontal dots
+    @size.times do |y|
+      (0...@size).each do |x|
+        dot_constraints cell(x, y), cell(x+1, y), @data[2*y+1][2*x+2]
+      end
+    end
+
+    # Vertical dots
+    @size.times do |x|
+      (0...@size).each do |y|
+        dot_constraints cell(x, y), cell(x, y+1), @data[2*y+2][2*x+1]
+      end
+    end
+
+    if @solver.satisfiable?
+      @model = @solver.model
+      print_answer
+    else
+      puts "failed to solve"
+    end
+  end
+
+  private
+
+  def dot_constraints(c1, c2, dot)
+    if dot == "o"
+      @solver.assert Z3.Or(c1 == c2 + 1, c2 == c1 + 1)
+    elsif dot == "*"
+      @solver.assert Z3.Or(c1 == c2 * 2, c2 == c1 * 2)
+    else
+      @solver.assert c1 != c2 + 1
+      @solver.assert c2 != c1 + 1
+      @solver.assert c1 != c2 * 2
+      @solver.assert c2 != c1 * 2
+    end
+  end
+
+  def cell(x, y)
+    Z3.Int("c#{x},#{y}")
+  end
+
+  def print_answer
+    output = @data.map(&:dup)
+    @size.times do |y|
+      @size.times do |x|
+        # This only works for 1-9, could use hex or something for more
+        value = @model[cell(x,y)].to_s
+        output[2*y+1][2*x+1, 1] = value
+      end
+    end
+
+    puts output
+  end
+end
+
+
+path = ARGV[0] || Pathname(__dir__) + "kropki-1.txt"
+Kropki.new(path).call

data/examples/kropki-1.txt

@@ -0,0 +1,13 @@
++-+-+-+-+-+-+
+| | * | * o |
++-+-+-+*+o+*+
+| | o | o * |
++-+-+o+o+-+-+
+| o | | o | |
++*+o+-+-+o+-+
+| * o o | * |
++-+-+-+o+-+-+
+| | | | | * |
++*+-+-+-+o+*+
+| * o | | o |
++-+-+-+-+-+-+

data/examples/letter_connections

@@ -61,7 +61,7 @@ class LetterConnections
     @solver = Z3::Solver.new
   end
 
-  def solve!
+  def call
     @line = map_coordinates{|x,y| line_var(x,y) }
     @dir  = map_coordinates{|x,y| dir_var(x,y) }
 
@@ -187,4 +187,4 @@ class LetterConnections
 end
 
 path = ARGV[0] || Pathname(__dir__) + "letter_connections-1.txt"
-LetterConnections.new(path).solve!
+LetterConnections.new(path).call

data/examples/light_up

@@ -13,7 +13,7 @@ class LightUp
     @solver = Z3::Solver.new
   end
 
-  def solve!
+  def call
     @lamps = map_coordinates{|x,y| int01(x,y)}
 
     # No lamps on walls
@@ -95,4 +95,4 @@ class LightUp
 end
 
 path = ARGV[0] || Pathname(__dir__) + "light_up-1.txt"
-LightUp.new(path).solve!
+LightUp.new(path).call

data/examples/minisudoku

@@ -13,7 +13,7 @@ class MiniSudokuSolver
     @solver = Z3::Solver.new
   end
 
-  def solve!
+  def call
     @cells = (0..5).map do |j|
       (0..5).map do |i|
         cell_var(@data[j][i], i, j)
@@ -58,4 +58,4 @@ class MiniSudokuSolver
 end
 
 path = ARGV[0] || Pathname(__dir__) + "minisudoku-1.txt"
-MiniSudokuSolver.new(path).solve!
+MiniSudokuSolver.new(path).call