Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G

Percentage Accurate: 100.0% → 100.0%

Time: 4.4s

Alternatives: 5

Speedup: 1.0×

• 20.7% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \left(x + y\right) \cdot \left(z + 1\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* (+ x y) (+ z 1.0)))

C

double code(double x, double y, double z) {
	return (x + y) * (z + 1.0);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + y) * (z + 1.0d0)
end function

Java

public static double code(double x, double y, double z) {
	return (x + y) * (z + 1.0);
}

Python

def code(x, y, z):
	return (x + y) * (z + 1.0)

Julia

function code(x, y, z)
	return Float64(Float64(x + y) * Float64(z + 1.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x + y) * (z + 1.0);
end

Wolfram

code[x_, y_, z_] := N[(N[(x + y), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x + y\right) \cdot \left(z + 1\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* (+ x y) (+ z 1.0)))

C

double code(double x, double y, double z) {
	return (x + y) * (z + 1.0);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + y) * (z + 1.0d0)
end function

Java

public static double code(double x, double y, double z) {
	return (x + y) * (z + 1.0);
}

Python

def code(x, y, z):
	return (x + y) * (z + 1.0)

Julia

function code(x, y, z)
	return Float64(Float64(x + y) * Float64(z + 1.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x + y) * (z + 1.0);
end

Wolfram

code[x_, y_, z_] := N[(N[(x + y), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(1 + z\right) \cdot \left(y + x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* (+ 1.0 z) (+ y x)))

C

double code(double x, double y, double z) {
	return (1.0 + z) * (y + x);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (1.0d0 + z) * (y + x)
end function

Java

public static double code(double x, double y, double z) {
	return (1.0 + z) * (y + x);
}

Python

def code(x, y, z):
	return (1.0 + z) * (y + x)

Julia

function code(x, y, z)
	return Float64(Float64(1.0 + z) * Float64(y + x))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (1.0 + z) * (y + x);
end

Wolfram

code[x_, y_, z_] := N[(N[(1.0 + z), $MachinePrecision] * N[(y + x), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(x + y\right) \cdot \left(z + 1\right) \]
2. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto \left(1 + z\right) \cdot \left(y + x\right) \]
4. Add Preprocessing

Alternative 2: 74.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;1 + z \leq -4 \cdot 10^{+235}:\\ \;\;\;\;z \cdot x\\ \mathbf{elif}\;1 + z \leq -2 \cdot 10^{+15}:\\ \;\;\;\;z \cdot y\\ \mathbf{elif}\;1 + z \leq 2:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;z \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (+ 1.0 z) -4e+235)
   (* z x)
   (if (<= (+ 1.0 z) -2e+15) (* z y) (if (<= (+ 1.0 z) 2.0) (+ y x) (* z y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((1.0 + z) <= -4e+235) {
		tmp = z * x;
	} else if ((1.0 + z) <= -2e+15) {
		tmp = z * y;
	} else if ((1.0 + z) <= 2.0) {
		tmp = y + x;
	} else {
		tmp = z * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((1.0d0 + z) <= (-4d+235)) then
        tmp = z * x
    else if ((1.0d0 + z) <= (-2d+15)) then
        tmp = z * y
    else if ((1.0d0 + z) <= 2.0d0) then
        tmp = y + x
    else
        tmp = z * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((1.0 + z) <= -4e+235) {
		tmp = z * x;
	} else if ((1.0 + z) <= -2e+15) {
		tmp = z * y;
	} else if ((1.0 + z) <= 2.0) {
		tmp = y + x;
	} else {
		tmp = z * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (1.0 + z) <= -4e+235:
		tmp = z * x
	elif (1.0 + z) <= -2e+15:
		tmp = z * y
	elif (1.0 + z) <= 2.0:
		tmp = y + x
	else:
		tmp = z * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(1.0 + z) <= -4e+235)
		tmp = Float64(z * x);
	elseif (Float64(1.0 + z) <= -2e+15)
		tmp = Float64(z * y);
	elseif (Float64(1.0 + z) <= 2.0)
		tmp = Float64(y + x);
	else
		tmp = Float64(z * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((1.0 + z) <= -4e+235)
		tmp = z * x;
	elseif ((1.0 + z) <= -2e+15)
		tmp = z * y;
	elseif ((1.0 + z) <= 2.0)
		tmp = y + x;
	else
		tmp = z * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(1.0 + z), $MachinePrecision], -4e+235], N[(z * x), $MachinePrecision], If[LessEqual[N[(1.0 + z), $MachinePrecision], -2e+15], N[(z * y), $MachinePrecision], If[LessEqual[N[(1.0 + z), $MachinePrecision], 2.0], N[(y + x), $MachinePrecision], N[(z * y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 z #s(literal 1 binary64)) < -4.0000000000000002e235

   1. Initial program 99.9%

      \[\left(x + y\right) \cdot \left(z + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x \cdot \left(1 + z\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto x \cdot \color{blue}{\left(z + 1\right)} \]

      2. distribute-rgt-in N/A

         \[\leadsto \color{blue}{z \cdot x + 1 \cdot x} \]

      3. *-lft-identity N/A

         \[\leadsto z \cdot x + \color{blue}{x} \]

      4. lower-fma.f64 40.4

         \[\leadsto \color{blue}{\mathsf{fma}\left(z, x, x\right)} \]

   5. Applied rewrites 40.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, x, x\right)} \]

   6. Taylor expanded in z around inf

      \[\leadsto x \cdot \color{blue}{z} \]
   7. Step-by-step derivation

   8. Applied rewrites 40.4%

      \[\leadsto z \cdot \color{blue}{x} \]

   if -4.0000000000000002e235 < (+.f64 z #s(literal 1 binary64)) < -2e15 or 2 < (+.f64 z #s(literal 1 binary64))

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(1 + z\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto y \cdot \color{blue}{\left(z + 1\right)} \]

      2. distribute-rgt-in N/A

         \[\leadsto \color{blue}{z \cdot y + 1 \cdot y} \]

      3. *-lft-identity N/A

         \[\leadsto z \cdot y + \color{blue}{y} \]

      4. lower-fma.f64 50.9

         \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, y\right)} \]

   5. Applied rewrites 50.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, y\right)} \]

   6. Taylor expanded in z around inf

      \[\leadsto y \cdot \color{blue}{z} \]
   7. Step-by-step derivation

   8. Applied rewrites 50.9%

      \[\leadsto z \cdot \color{blue}{y} \]

   if -2e15 < (+.f64 z #s(literal 1 binary64)) < 2

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{y + x} \]

      2. lower-+.f64 97.5

         \[\leadsto \color{blue}{y + x} \]

   5. Applied rewrites 97.5%

      \[\leadsto \color{blue}{y + x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 73.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;1 + z \leq -4 \cdot 10^{+235}:\\ \;\;\;\;z \cdot x\\ \mathbf{elif}\;1 + z \leq -2 \cdot 10^{+15}:\\ \;\;\;\;z \cdot y\\ \mathbf{elif}\;1 + z \leq 2:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;z \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 74.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;1 + z \leq -2 \cdot 10^{+15}:\\ \;\;\;\;z \cdot x\\ \mathbf{elif}\;1 + z \leq 10^{+17}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;z \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (+ 1.0 z) -2e+15) (* z x) (if (<= (+ 1.0 z) 1e+17) (+ y x) (* z x))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((1.0 + z) <= -2e+15) {
		tmp = z * x;
	} else if ((1.0 + z) <= 1e+17) {
		tmp = y + x;
	} else {
		tmp = z * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((1.0d0 + z) <= (-2d+15)) then
        tmp = z * x
    else if ((1.0d0 + z) <= 1d+17) then
        tmp = y + x
    else
        tmp = z * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((1.0 + z) <= -2e+15) {
		tmp = z * x;
	} else if ((1.0 + z) <= 1e+17) {
		tmp = y + x;
	} else {
		tmp = z * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (1.0 + z) <= -2e+15:
		tmp = z * x
	elif (1.0 + z) <= 1e+17:
		tmp = y + x
	else:
		tmp = z * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(1.0 + z) <= -2e+15)
		tmp = Float64(z * x);
	elseif (Float64(1.0 + z) <= 1e+17)
		tmp = Float64(y + x);
	else
		tmp = Float64(z * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((1.0 + z) <= -2e+15)
		tmp = z * x;
	elseif ((1.0 + z) <= 1e+17)
		tmp = y + x;
	else
		tmp = z * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(1.0 + z), $MachinePrecision], -2e+15], N[(z * x), $MachinePrecision], If[LessEqual[N[(1.0 + z), $MachinePrecision], 1e+17], N[(y + x), $MachinePrecision], N[(z * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 z #s(literal 1 binary64)) < -2e15 or 1e17 < (+.f64 z #s(literal 1 binary64))

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x \cdot \left(1 + z\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto x \cdot \color{blue}{\left(z + 1\right)} \]

      2. distribute-rgt-in N/A

         \[\leadsto \color{blue}{z \cdot x + 1 \cdot x} \]

      3. *-lft-identity N/A

         \[\leadsto z \cdot x + \color{blue}{x} \]

      4. lower-fma.f64 54.7

         \[\leadsto \color{blue}{\mathsf{fma}\left(z, x, x\right)} \]

   5. Applied rewrites 54.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, x, x\right)} \]

   6. Taylor expanded in z around inf

      \[\leadsto x \cdot \color{blue}{z} \]
   7. Step-by-step derivation

   8. Applied rewrites 54.6%

      \[\leadsto z \cdot \color{blue}{x} \]

   if -2e15 < (+.f64 z #s(literal 1 binary64)) < 1e17

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{y + x} \]

      2. lower-+.f64 95.5

         \[\leadsto \color{blue}{y + x} \]

   5. Applied rewrites 95.5%

      \[\leadsto \color{blue}{y + x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 75.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;1 + z \leq -2 \cdot 10^{+15}:\\ \;\;\;\;z \cdot x\\ \mathbf{elif}\;1 + z \leq 10^{+17}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;z \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 51.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y + x \leq -4 \cdot 10^{-218}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, y, y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (+ y x) -4e-218) (fma z x x) (fma z y y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y + x) <= -4e-218) {
		tmp = fma(z, x, x);
	} else {
		tmp = fma(z, y, y);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(y + x) <= -4e-218)
		tmp = fma(z, x, x);
	else
		tmp = fma(z, y, y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(y + x), $MachinePrecision], -4e-218], N[(z * x + x), $MachinePrecision], N[(z * y + y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -4.0000000000000001e-218

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x \cdot \left(1 + z\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto x \cdot \color{blue}{\left(z + 1\right)} \]

      2. distribute-rgt-in N/A

         \[\leadsto \color{blue}{z \cdot x + 1 \cdot x} \]

      3. *-lft-identity N/A

         \[\leadsto z \cdot x + \color{blue}{x} \]

      4. lower-fma.f64 51.5

         \[\leadsto \color{blue}{\mathsf{fma}\left(z, x, x\right)} \]

   5. Applied rewrites 51.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, x, x\right)} \]

   if -4.0000000000000001e-218 < (+.f64 x y)

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(1 + z\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto y \cdot \color{blue}{\left(z + 1\right)} \]

      2. distribute-rgt-in N/A

         \[\leadsto \color{blue}{z \cdot y + 1 \cdot y} \]

      3. *-lft-identity N/A

         \[\leadsto z \cdot y + \color{blue}{y} \]

      4. lower-fma.f64 52.1

         \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, y\right)} \]

   5. Applied rewrites 52.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, y\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 51.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y + x \leq -4 \cdot 10^{-218}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, y, y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 50.5% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ y + x \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ y x))

C

double code(double x, double y, double z) {
	return y + x;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = y + x
end function

Java

public static double code(double x, double y, double z) {
	return y + x;
}

Python

def code(x, y, z):
	return y + x

Julia

function code(x, y, z)
	return Float64(y + x)
end

MATLAB

function tmp = code(x, y, z)
	tmp = y + x;
end

Wolfram

code[x_, y_, z_] := N[(y + x), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(x + y\right) \cdot \left(z + 1\right) \]
2. Add Preprocessing

3. Taylor expanded in z around 0

   \[\leadsto \color{blue}{x + y} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{y + x} \]

   2. lower-+.f64 50.7

      \[\leadsto \color{blue}{y + x} \]

5. Applied rewrites 50.7%

   \[\leadsto \color{blue}{y + x} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024235 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1.0)))