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

Percentage Accurate: 93.6% → 97.1%

Time: 7.2s

Alternatives: 6

Speedup: 1.1×

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

Specification

Math

\[\begin{array}{l} \\ x - \frac{y \cdot \left(z - t\right)}{a} \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (- x (/ (* y (- z t)) a)))

C

double code(double x, double y, double z, double t, double a) {
	return x - ((y * (z - t)) / a);
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x - ((y * (z - t)) / a)
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return x - ((y * (z - t)) / a);
}

Python

def code(x, y, z, t, a):
	return x - ((y * (z - t)) / a)

Julia

function code(x, y, z, t, a)
	return Float64(x - Float64(Float64(y * Float64(z - t)) / a))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = x - ((y * (z - t)) / a);
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(x - N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]

Initial Program: 93.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x - \frac{y \cdot \left(z - t\right)}{a} \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (- x (/ (* y (- z t)) a)))

C

double code(double x, double y, double z, double t, double a) {
	return x - ((y * (z - t)) / a);
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x - ((y * (z - t)) / a)
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return x - ((y * (z - t)) / a);
}

Python

def code(x, y, z, t, a):
	return x - ((y * (z - t)) / a)

Julia

function code(x, y, z, t, a)
	return Float64(x - Float64(Float64(y * Float64(z - t)) / a))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = x - ((y * (z - t)) / a);
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(x - N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]

Alternative 1: 97.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(t - z, \frac{y}{a}, x\right) \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (fma (- t z) (/ y a) x))

C

double code(double x, double y, double z, double t, double a) {
	return fma((t - z), (y / a), x);
}

Julia

function code(x, y, z, t, a)
	return fma(Float64(t - z), Float64(y / a), x)
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(t - z), $MachinePrecision] * N[(y / a), $MachinePrecision] + x), $MachinePrecision]

Derivation

1. Initial program 93.2%

   \[x - \frac{y \cdot \left(z - t\right)}{a} \]
2. Add Preprocessing

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{\frac{a \cdot x - y \cdot \left(z - t\right)}{a}} \]
4. Step-by-step derivation

   1. div-sub N/A

      \[\leadsto \color{blue}{\frac{a \cdot x}{a} - \frac{y \cdot \left(z - t\right)}{a}} \]

   2. sub-neg N/A

      \[\leadsto \color{blue}{\frac{a \cdot x}{a} + \left(\mathsf{neg}\left(\frac{y \cdot \left(z - t\right)}{a}\right)\right)} \]

   3. mul-1-neg N/A

      \[\leadsto \frac{a \cdot x}{a} + \color{blue}{-1 \cdot \frac{y \cdot \left(z - t\right)}{a}} \]

   4. +-commutative N/A

      \[\leadsto \color{blue}{-1 \cdot \frac{y \cdot \left(z - t\right)}{a} + \frac{a \cdot x}{a}} \]

   5. *-commutative N/A

      \[\leadsto -1 \cdot \frac{\color{blue}{\left(z - t\right) \cdot y}}{a} + \frac{a \cdot x}{a} \]

   6. associate-/l* N/A

      \[\leadsto -1 \cdot \color{blue}{\left(\left(z - t\right) \cdot \frac{y}{a}\right)} + \frac{a \cdot x}{a} \]

   7. associate-*r* N/A

      \[\leadsto \color{blue}{\left(-1 \cdot \left(z - t\right)\right) \cdot \frac{y}{a}} + \frac{a \cdot x}{a} \]

   8. *-commutative N/A

      \[\leadsto \left(-1 \cdot \left(z - t\right)\right) \cdot \frac{y}{a} + \frac{\color{blue}{x \cdot a}}{a} \]

   9. associate-/l* N/A

      \[\leadsto \left(-1 \cdot \left(z - t\right)\right) \cdot \frac{y}{a} + \color{blue}{x \cdot \frac{a}{a}} \]

   10. *-inverses N/A

       \[\leadsto \left(-1 \cdot \left(z - t\right)\right) \cdot \frac{y}{a} + x \cdot \color{blue}{1} \]

   11. *-rgt-identity N/A

       \[\leadsto \left(-1 \cdot \left(z - t\right)\right) \cdot \frac{y}{a} + \color{blue}{x} \]

   12. lower-fma.f64 N/A

       \[\leadsto \color{blue}{\mathsf{fma}\left(-1 \cdot \left(z - t\right), \frac{y}{a}, x\right)} \]

   13. mul-1-neg N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{neg}\left(\left(z - t\right)\right)}, \frac{y}{a}, x\right) \]

   14. neg-sub0 N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{0 - \left(z - t\right)}, \frac{y}{a}, x\right) \]

   15. associate-+l- N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{\left(0 - z\right) + t}, \frac{y}{a}, x\right) \]

   16. neg-sub0 N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\mathsf{neg}\left(z\right)\right)} + t, \frac{y}{a}, x\right) \]

   17. mul-1-neg N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{-1 \cdot z} + t, \frac{y}{a}, x\right) \]

   18. +-commutative N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{t + -1 \cdot z}, \frac{y}{a}, x\right) \]

   19. mul-1-neg N/A

       \[\leadsto \mathsf{fma}\left(t + \color{blue}{\left(\mathsf{neg}\left(z\right)\right)}, \frac{y}{a}, x\right) \]

   20. sub-neg N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{t - z}, \frac{y}{a}, x\right) \]

   21. lower--.f64 N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{t - z}, \frac{y}{a}, x\right) \]

   22. lower-/.f64 96.9

       \[\leadsto \mathsf{fma}\left(t - z, \color{blue}{\frac{y}{a}}, x\right) \]

5. Applied rewrites 96.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(t - z, \frac{y}{a}, x\right)} \]
6. Add Preprocessing

Alternative 2: 85.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\left(z - t\right) \cdot y}{a}\\ t_2 := \frac{y}{a} \cdot \left(t - z\right)\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+124}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+175}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{a}, t, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* (- z t) y) a)) (t_2 (* (/ y a) (- t z))))
   (if (<= t_1 -5e+124) t_2 (if (<= t_1 5e+175) (fma (/ y a) t x) t_2))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = ((z - t) * y) / a;
	double t_2 = (y / a) * (t - z);
	double tmp;
	if (t_1 <= -5e+124) {
		tmp = t_2;
	} else if (t_1 <= 5e+175) {
		tmp = fma((y / a), t, x);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(Float64(z - t) * y) / a)
	t_2 = Float64(Float64(y / a) * Float64(t - z))
	tmp = 0.0
	if (t_1 <= -5e+124)
		tmp = t_2;
	elseif (t_1 <= 5e+175)
		tmp = fma(Float64(y / a), t, x);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(N[(z - t), $MachinePrecision] * y), $MachinePrecision] / a), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y / a), $MachinePrecision] * N[(t - z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+124], t$95$2, If[LessEqual[t$95$1, 5e+175], N[(N[(y / a), $MachinePrecision] * t + x), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -4.9999999999999996e124 or 5e175 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 86.6%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

         \[\leadsto -1 \cdot \frac{\color{blue}{\left(z - t\right) \cdot y}}{a} \]

      2. associate-/l* N/A

         \[\leadsto -1 \cdot \color{blue}{\left(\left(z - t\right) \cdot \frac{y}{a}\right)} \]

      3. associate-*r* N/A

         \[\leadsto \color{blue}{\left(-1 \cdot \left(z - t\right)\right) \cdot \frac{y}{a}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(-1 \cdot \left(z - t\right)\right) \cdot \frac{y}{a}} \]

      5. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\left(z - t\right)\right)\right)} \cdot \frac{y}{a} \]

      6. neg-sub0 N/A

         \[\leadsto \color{blue}{\left(0 - \left(z - t\right)\right)} \cdot \frac{y}{a} \]

      7. associate-+l- N/A

         \[\leadsto \color{blue}{\left(\left(0 - z\right) + t\right)} \cdot \frac{y}{a} \]

      8. neg-sub0 N/A

         \[\leadsto \left(\color{blue}{\left(\mathsf{neg}\left(z\right)\right)} + t\right) \cdot \frac{y}{a} \]

      9. mul-1-neg N/A

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

      10. +-commutative N/A

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

      11. mul-1-neg N/A

          \[\leadsto \left(t + \color{blue}{\left(\mathsf{neg}\left(z\right)\right)}\right) \cdot \frac{y}{a} \]

      12. sub-neg N/A

          \[\leadsto \color{blue}{\left(t - z\right)} \cdot \frac{y}{a} \]

      13. lower--.f64 N/A

          \[\leadsto \color{blue}{\left(t - z\right)} \cdot \frac{y}{a} \]

      14. lower-/.f64 90.5

          \[\leadsto \left(t - z\right) \cdot \color{blue}{\frac{y}{a}} \]

   5. Applied rewrites 90.5%

      \[\leadsto \color{blue}{\left(t - z\right) \cdot \frac{y}{a}} \]

   if -4.9999999999999996e124 < (/.f64 (*.f64 y (-.f64 z t)) a) < 5e175

   1. Initial program 99.2%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x - -1 \cdot \frac{t \cdot y}{a}} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(-1 \cdot \frac{t \cdot y}{a}\right)\right)} \]

      2. mul-1-neg N/A

         \[\leadsto x + \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\frac{t \cdot y}{a}\right)\right)}\right)\right) \]

      3. remove-double-neg N/A

         \[\leadsto x + \color{blue}{\frac{t \cdot y}{a}} \]

      4. +-commutative N/A

         \[\leadsto \color{blue}{\frac{t \cdot y}{a} + x} \]

      5. *-commutative N/A

         \[\leadsto \frac{\color{blue}{y \cdot t}}{a} + x \]

      6. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{y}{a} \cdot t} + x \]

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{y}{a}, t, x\right)} \]

      8. lower-/.f64 90.0

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{y}{a}}, t, x\right) \]

   5. Applied rewrites 90.0%

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

4. Final simplification 90.2%

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

Alternative 3: 77.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-z\right) \cdot \frac{y}{a}\\ \mathbf{if}\;z \leq -2.35 \cdot 10^{+216}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 10^{+197}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{a}, t, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (- z) (/ y a))))
   (if (<= z -2.35e+216) t_1 (if (<= z 1e+197) (fma (/ y a) t x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = -z * (y / a);
	double tmp;
	if (z <= -2.35e+216) {
		tmp = t_1;
	} else if (z <= 1e+197) {
		tmp = fma((y / a), t, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(-z) * Float64(y / a))
	tmp = 0.0
	if (z <= -2.35e+216)
		tmp = t_1;
	elseif (z <= 1e+197)
		tmp = fma(Float64(y / a), t, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[((-z) * N[(y / a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.35e+216], t$95$1, If[LessEqual[z, 1e+197], N[(N[(y / a), $MachinePrecision] * t + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.3500000000000001e216 or 9.9999999999999995e196 < z

   1. Initial program 91.0%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{-1 \cdot \frac{y \cdot z}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto -1 \cdot \frac{\color{blue}{z \cdot y}}{a} \]

      2. associate-*r/ N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(z\right)\right)} \cdot \frac{y}{a} \]

      6. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-z\right)} \cdot \frac{y}{a} \]

      7. lower-/.f64 74.6

         \[\leadsto \left(-z\right) \cdot \color{blue}{\frac{y}{a}} \]

   5. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\left(-z\right) \cdot \frac{y}{a}} \]

   if -2.3500000000000001e216 < z < 9.9999999999999995e196

   1. Initial program 93.7%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x - -1 \cdot \frac{t \cdot y}{a}} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(-1 \cdot \frac{t \cdot y}{a}\right)\right)} \]

      2. mul-1-neg N/A

         \[\leadsto x + \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\frac{t \cdot y}{a}\right)\right)}\right)\right) \]

      3. remove-double-neg N/A

         \[\leadsto x + \color{blue}{\frac{t \cdot y}{a}} \]

      4. +-commutative N/A

         \[\leadsto \color{blue}{\frac{t \cdot y}{a} + x} \]

      5. *-commutative N/A

         \[\leadsto \frac{\color{blue}{y \cdot t}}{a} + x \]

      6. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{y}{a} \cdot t} + x \]

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{y}{a}, t, x\right)} \]

      8. lower-/.f64 83.7

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{y}{a}}, t, x\right) \]

   5. Applied rewrites 83.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{y}{a}, t, x\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 71.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\frac{y}{a}, t, x\right) \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (fma (/ y a) t x))

C

double code(double x, double y, double z, double t, double a) {
	return fma((y / a), t, x);
}

Julia

function code(x, y, z, t, a)
	return fma(Float64(y / a), t, x)
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(y / a), $MachinePrecision] * t + x), $MachinePrecision]

Derivation

1. Initial program 93.2%

   \[x - \frac{y \cdot \left(z - t\right)}{a} \]
2. Add Preprocessing

3. Taylor expanded in z around 0

   \[\leadsto \color{blue}{x - -1 \cdot \frac{t \cdot y}{a}} \]
4. Step-by-step derivation

   1. sub-neg N/A

      \[\leadsto \color{blue}{x + \left(\mathsf{neg}\left(-1 \cdot \frac{t \cdot y}{a}\right)\right)} \]

   2. mul-1-neg N/A

      \[\leadsto x + \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\frac{t \cdot y}{a}\right)\right)}\right)\right) \]

   3. remove-double-neg N/A

      \[\leadsto x + \color{blue}{\frac{t \cdot y}{a}} \]

   4. +-commutative N/A

      \[\leadsto \color{blue}{\frac{t \cdot y}{a} + x} \]

   5. *-commutative N/A

      \[\leadsto \frac{\color{blue}{y \cdot t}}{a} + x \]

   6. associate-*l/ N/A

      \[\leadsto \color{blue}{\frac{y}{a} \cdot t} + x \]

   7. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{y}{a}, t, x\right)} \]

   8. lower-/.f64 76.4

      \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{y}{a}}, t, x\right) \]

5. Applied rewrites 76.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{y}{a}, t, x\right)} \]
6. Add Preprocessing

Alternative 5: 33.5% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \frac{y}{a} \cdot t \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (* (/ y a) t))

C

double code(double x, double y, double z, double t, double a) {
	return (y / a) * t;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = (y / a) * t
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return (y / a) * t;
}

Python

def code(x, y, z, t, a):
	return (y / a) * t

Julia

function code(x, y, z, t, a)
	return Float64(Float64(y / a) * t)
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = (y / a) * t;
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(y / a), $MachinePrecision] * t), $MachinePrecision]

Derivation

1. Initial program 93.2%

   \[x - \frac{y \cdot \left(z - t\right)}{a} \]
2. Add Preprocessing

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{\frac{a \cdot x - y \cdot \left(z - t\right)}{a}} \]
4. Step-by-step derivation

   1. div-sub N/A

      \[\leadsto \color{blue}{\frac{a \cdot x}{a} - \frac{y \cdot \left(z - t\right)}{a}} \]

   2. sub-neg N/A

      \[\leadsto \color{blue}{\frac{a \cdot x}{a} + \left(\mathsf{neg}\left(\frac{y \cdot \left(z - t\right)}{a}\right)\right)} \]

   3. mul-1-neg N/A

      \[\leadsto \frac{a \cdot x}{a} + \color{blue}{-1 \cdot \frac{y \cdot \left(z - t\right)}{a}} \]

   4. +-commutative N/A

      \[\leadsto \color{blue}{-1 \cdot \frac{y \cdot \left(z - t\right)}{a} + \frac{a \cdot x}{a}} \]

   5. *-commutative N/A

      \[\leadsto -1 \cdot \frac{\color{blue}{\left(z - t\right) \cdot y}}{a} + \frac{a \cdot x}{a} \]

   6. associate-/l* N/A

      \[\leadsto -1 \cdot \color{blue}{\left(\left(z - t\right) \cdot \frac{y}{a}\right)} + \frac{a \cdot x}{a} \]

   7. associate-*r* N/A

      \[\leadsto \color{blue}{\left(-1 \cdot \left(z - t\right)\right) \cdot \frac{y}{a}} + \frac{a \cdot x}{a} \]

   8. *-commutative N/A

      \[\leadsto \left(-1 \cdot \left(z - t\right)\right) \cdot \frac{y}{a} + \frac{\color{blue}{x \cdot a}}{a} \]

   9. associate-/l* N/A

      \[\leadsto \left(-1 \cdot \left(z - t\right)\right) \cdot \frac{y}{a} + \color{blue}{x \cdot \frac{a}{a}} \]

   10. *-inverses N/A

       \[\leadsto \left(-1 \cdot \left(z - t\right)\right) \cdot \frac{y}{a} + x \cdot \color{blue}{1} \]

   11. *-rgt-identity N/A

       \[\leadsto \left(-1 \cdot \left(z - t\right)\right) \cdot \frac{y}{a} + \color{blue}{x} \]

   12. lower-fma.f64 N/A

       \[\leadsto \color{blue}{\mathsf{fma}\left(-1 \cdot \left(z - t\right), \frac{y}{a}, x\right)} \]

   13. mul-1-neg N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{neg}\left(\left(z - t\right)\right)}, \frac{y}{a}, x\right) \]

   14. neg-sub0 N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{0 - \left(z - t\right)}, \frac{y}{a}, x\right) \]

   15. associate-+l- N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{\left(0 - z\right) + t}, \frac{y}{a}, x\right) \]

   16. neg-sub0 N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\mathsf{neg}\left(z\right)\right)} + t, \frac{y}{a}, x\right) \]

   17. mul-1-neg N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{-1 \cdot z} + t, \frac{y}{a}, x\right) \]

   18. +-commutative N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{t + -1 \cdot z}, \frac{y}{a}, x\right) \]

   19. mul-1-neg N/A

       \[\leadsto \mathsf{fma}\left(t + \color{blue}{\left(\mathsf{neg}\left(z\right)\right)}, \frac{y}{a}, x\right) \]

   20. sub-neg N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{t - z}, \frac{y}{a}, x\right) \]

   21. lower--.f64 N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{t - z}, \frac{y}{a}, x\right) \]

   22. lower-/.f64 96.9

       \[\leadsto \mathsf{fma}\left(t - z, \color{blue}{\frac{y}{a}}, x\right) \]

5. Applied rewrites 96.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(t - z, \frac{y}{a}, x\right)} \]

6. Taylor expanded in t around inf

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

   1. *-commutative N/A

      \[\leadsto \frac{\color{blue}{y \cdot t}}{a} \]

   2. associate-*l/ N/A

      \[\leadsto \color{blue}{\frac{y}{a} \cdot t} \]

   3. lower-*.f64 N/A

      \[\leadsto \color{blue}{\frac{y}{a} \cdot t} \]

   4. lower-/.f64 38.1

      \[\leadsto \color{blue}{\frac{y}{a}} \cdot t \]

8. Applied rewrites 38.1%

   \[\leadsto \color{blue}{\frac{y}{a} \cdot t} \]
9. Add Preprocessing

Alternative 6: 31.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \frac{t}{a} \cdot y \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (* (/ t a) y))

C

double code(double x, double y, double z, double t, double a) {
	return (t / a) * y;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = (t / a) * y
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return (t / a) * y;
}

Python

def code(x, y, z, t, a):
	return (t / a) * y

Julia

function code(x, y, z, t, a)
	return Float64(Float64(t / a) * y)
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = (t / a) * y;
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(t / a), $MachinePrecision] * y), $MachinePrecision]

Derivation

1. Initial program 93.2%

   \[x - \frac{y \cdot \left(z - t\right)}{a} \]
2. Add Preprocessing

3. Taylor expanded in t around inf

   \[\leadsto \color{blue}{\frac{t \cdot y}{a}} \]
4. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{t \cdot y}{a}} \]

   2. lower-*.f64 34.6

      \[\leadsto \frac{\color{blue}{t \cdot y}}{a} \]

5. Applied rewrites 34.6%

   \[\leadsto \color{blue}{\frac{t \cdot y}{a}} \]
6. Step-by-step derivation

7. Applied rewrites 32.8%

   \[\leadsto y \cdot \color{blue}{\frac{t}{a}} \]

8. Final simplification 32.8%

   \[\leadsto \frac{t}{a} \cdot y \]
9. Add Preprocessing

Developer Target 1: 99.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a}{z - t}\\ \mathbf{if}\;y < -1.0761266216389975 \cdot 10^{-10}:\\ \;\;\;\;x - \frac{1}{\frac{t\_1}{y}}\\ \mathbf{elif}\;y < 2.894426862792089 \cdot 10^{-49}:\\ \;\;\;\;x - \frac{y \cdot \left(z - t\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{y}{t\_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ a (- z t))))
   (if (< y -1.0761266216389975e-10)
     (- x (/ 1.0 (/ t_1 y)))
     (if (< y 2.894426862792089e-49)
       (- x (/ (* y (- z t)) a))
       (- x (/ y t_1))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = a / (z - t);
	double tmp;
	if (y < -1.0761266216389975e-10) {
		tmp = x - (1.0 / (t_1 / y));
	} else if (y < 2.894426862792089e-49) {
		tmp = x - ((y * (z - t)) / a);
	} else {
		tmp = x - (y / t_1);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = a / (z - t)
    if (y < (-1.0761266216389975d-10)) then
        tmp = x - (1.0d0 / (t_1 / y))
    else if (y < 2.894426862792089d-49) then
        tmp = x - ((y * (z - t)) / a)
    else
        tmp = x - (y / t_1)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = a / (z - t);
	double tmp;
	if (y < -1.0761266216389975e-10) {
		tmp = x - (1.0 / (t_1 / y));
	} else if (y < 2.894426862792089e-49) {
		tmp = x - ((y * (z - t)) / a);
	} else {
		tmp = x - (y / t_1);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = a / (z - t)
	tmp = 0
	if y < -1.0761266216389975e-10:
		tmp = x - (1.0 / (t_1 / y))
	elif y < 2.894426862792089e-49:
		tmp = x - ((y * (z - t)) / a)
	else:
		tmp = x - (y / t_1)
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(a / Float64(z - t))
	tmp = 0.0
	if (y < -1.0761266216389975e-10)
		tmp = Float64(x - Float64(1.0 / Float64(t_1 / y)));
	elseif (y < 2.894426862792089e-49)
		tmp = Float64(x - Float64(Float64(y * Float64(z - t)) / a));
	else
		tmp = Float64(x - Float64(y / t_1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = a / (z - t);
	tmp = 0.0;
	if (y < -1.0761266216389975e-10)
		tmp = x - (1.0 / (t_1 / y));
	elseif (y < 2.894426862792089e-49)
		tmp = x - ((y * (z - t)) / a);
	else
		tmp = x - (y / t_1);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(a / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[Less[y, -1.0761266216389975e-10], N[(x - N[(1.0 / N[(t$95$1 / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[y, 2.894426862792089e-49], N[(x - N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(x - N[(y / t$95$1), $MachinePrecision]), $MachinePrecision]]]]

Reproduce

herbie shell --seed 2024255 
(FPCore (x y z t a)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, F"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< y -430450648655599/4000000000000000000000000) (- x (/ 1 (/ (/ a (- z t)) y))) (if (< y 2894426862792089/10000000000000000000000000000000000000000000000000000000000000000) (- x (/ (* y (- z t)) a)) (- x (/ y (/ a (- z t)))))))

  (- x (/ (* y (- z t)) a)))