Diagrams.TwoD.Apollonian:initialConfig from diagrams-contrib-1.3.0.5, A

Percentage Accurate: 69.2% → 99.9%

Time: 7.1s

Alternatives: 8

Speedup: 1.3×

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

Specification

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0)))

C

double code(double x, double y, double z) {
	return (((x * x) + (y * y)) - (z * z)) / (y * 2.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 * x) + (y * y)) - (z * z)) / (y * 2.0d0)
end function

Java

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

Python

def code(x, y, z):
	return (((x * x) + (y * y)) - (z * z)) / (y * 2.0)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
end

Wolfram

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

Initial Program: 69.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0)))

C

double code(double x, double y, double z) {
	return (((x * x) + (y * y)) - (z * z)) / (y * 2.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 * x) + (y * y)) - (z * z)) / (y * 2.0d0)
end function

Java

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

Python

def code(x, y, z):
	return (((x * x) + (y * y)) - (z * z)) / (y * 2.0)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
end

Wolfram

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

Alternative 1: 99.9% accurate, 1.3× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (* 0.5 (fma (/ (- x z) y) (+ z x) y)))

C

double code(double x, double y, double z) {
	return 0.5 * fma(((x - z) / y), (z + x), y);
}

Julia

function code(x, y, z)
	return Float64(0.5 * fma(Float64(Float64(x - z) / y), Float64(z + x), y))
end

Wolfram

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

Derivation

1. Initial program 71.2%

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

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{y}^{2} - {z}^{2}}{y} + \frac{1}{2} \cdot \frac{{x}^{2}}{y}} \]

5. Applied rewrites 99.9%

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

6. Final simplification 99.9%

   \[\leadsto 0.5 \cdot \mathsf{fma}\left(\frac{x - z}{y}, z + x, y\right) \]
7. Add Preprocessing

Alternative 2: 67.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(y \cdot y + x \cdot x\right) - z \cdot z}{2 \cdot y}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-150}:\\ \;\;\;\;\left(y - \frac{z}{y} \cdot z\right) \cdot 0.5\\ \mathbf{elif}\;t\_0 \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, x, y\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\left(0.5 \cdot \left(z + x\right)\right) \cdot \frac{x - z}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (- (+ (* y y) (* x x)) (* z z)) (* 2.0 y))))
   (if (<= t_0 -2e-150)
     (* (- y (* (/ z y) z)) 0.5)
     (if (<= t_0 INFINITY)
       (* (fma (/ x y) x y) 0.5)
       (* (* 0.5 (+ z x)) (/ (- x z) y))))))

C

double code(double x, double y, double z) {
	double t_0 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y);
	double tmp;
	if (t_0 <= -2e-150) {
		tmp = (y - ((z / y) * z)) * 0.5;
	} else if (t_0 <= ((double) INFINITY)) {
		tmp = fma((x / y), x, y) * 0.5;
	} else {
		tmp = (0.5 * (z + x)) * ((x - z) / y);
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(Float64(y * y) + Float64(x * x)) - Float64(z * z)) / Float64(2.0 * y))
	tmp = 0.0
	if (t_0 <= -2e-150)
		tmp = Float64(Float64(y - Float64(Float64(z / y) * z)) * 0.5);
	elseif (t_0 <= Inf)
		tmp = Float64(fma(Float64(x / y), x, y) * 0.5);
	else
		tmp = Float64(Float64(0.5 * Float64(z + x)) * Float64(Float64(x - z) / y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(N[(y * y), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(2.0 * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-150], N[(N[(y - N[(N[(z / y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$0, Infinity], N[(N[(N[(x / y), $MachinePrecision] * x + y), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(0.5 * N[(z + x), $MachinePrecision]), $MachinePrecision] * N[(N[(x - z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < -2.00000000000000001e-150

   1. Initial program 78.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{y}^{2} - {z}^{2}}{y} + \frac{1}{2} \cdot \frac{{x}^{2}}{y}} \]

   5. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x - z}{y}, z + x, y\right) \cdot 0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.9%

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

   8. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{y}^{2} - {z}^{2}}{y}} \]
   9. Step-by-step derivation

      1. div-sub N/A

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

      2. sub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\frac{{y}^{2}}{y} + \left(\mathsf{neg}\left(\frac{{z}^{2}}{y}\right)\right)\right)} \]

      3. mul-1-neg N/A

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

      4. distribute-rgt-in N/A

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

      5. unpow2 N/A

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

      6. associate-/l* N/A

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

      7. *-inverses N/A

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

      8. *-rgt-identity N/A

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

      9. distribute-rgt-in N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. mul-1-neg N/A

          \[\leadsto \left(y + \color{blue}{\left(\mathsf{neg}\left(\frac{{z}^{2}}{y}\right)\right)}\right) \cdot \frac{1}{2} \]

      13. sub-neg N/A

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

      14. lower--.f64 N/A

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

      15. unpow2 N/A

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

      16. associate-/l* N/A

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

      17. lower-*.f64 N/A

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

      18. lower-/.f64 65.7

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

   10. Applied rewrites 65.7%

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

   if -2.00000000000000001e-150 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0

   1. Initial program 80.7%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{x}^{2} + {y}^{2}}{y} \cdot \frac{1}{2}} \]

      2. *-lft-identity N/A

         \[\leadsto \frac{\color{blue}{1 \cdot {x}^{2}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      3. *-inverses N/A

         \[\leadsto \frac{\color{blue}{\frac{{y}^{2}}{{y}^{2}}} \cdot {x}^{2} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      4. associate-*l/ N/A

         \[\leadsto \frac{\color{blue}{\frac{{y}^{2} \cdot {x}^{2}}{{y}^{2}}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{\color{blue}{{y}^{2} \cdot \frac{{x}^{2}}{{y}^{2}}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      6. *-rgt-identity N/A

         \[\leadsto \frac{{y}^{2} \cdot \frac{{x}^{2}}{{y}^{2}} + \color{blue}{{y}^{2} \cdot 1}}{y} \cdot \frac{1}{2} \]

      7. distribute-lft-in N/A

         \[\leadsto \frac{\color{blue}{{y}^{2} \cdot \left(\frac{{x}^{2}}{{y}^{2}} + 1\right)}}{y} \cdot \frac{1}{2} \]

      8. +-commutative N/A

         \[\leadsto \frac{{y}^{2} \cdot \color{blue}{\left(1 + \frac{{x}^{2}}{{y}^{2}}\right)}}{y} \cdot \frac{1}{2} \]

      9. associate-*l/ N/A

         \[\leadsto \color{blue}{\left(\frac{{y}^{2}}{y} \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right)} \cdot \frac{1}{2} \]

      10. unpow2 N/A

          \[\leadsto \left(\frac{\color{blue}{y \cdot y}}{y} \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right) \cdot \frac{1}{2} \]

      11. associate-/l* N/A

          \[\leadsto \left(\color{blue}{\left(y \cdot \frac{y}{y}\right)} \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right) \cdot \frac{1}{2} \]

      12. *-inverses N/A

          \[\leadsto \left(\left(y \cdot \color{blue}{1}\right) \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right) \cdot \frac{1}{2} \]

      13. *-rgt-identity N/A

          \[\leadsto \left(\color{blue}{y} \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right) \cdot \frac{1}{2} \]

   5. Applied rewrites 68.8%

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

   if +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around 0

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

      1. associate-*r/ N/A

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

      2. unpow2 N/A

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

      3. unpow2 N/A

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

      4. difference-of-squares N/A

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

      5. associate-*r* N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower--.f64 95.7

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

   5. Applied rewrites 95.7%

      \[\leadsto \color{blue}{\left(\left(z + x\right) \cdot 0.5\right) \cdot \frac{x - z}{y}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 70.0%

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

Alternative 3: 36.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(y \cdot y + x \cdot x\right) - z \cdot z}{2 \cdot y}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-150}:\\ \;\;\;\;\left(-0.5 \cdot \frac{z}{y}\right) \cdot z\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+151}:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{x}{y} \cdot x\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (- (+ (* y y) (* x x)) (* z z)) (* 2.0 y))))
   (if (<= t_0 -2e-150)
     (* (* -0.5 (/ z y)) z)
     (if (<= t_0 5e+151) (* 0.5 y) (* (* (/ x y) x) 0.5)))))

C

double code(double x, double y, double z) {
	double t_0 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y);
	double tmp;
	if (t_0 <= -2e-150) {
		tmp = (-0.5 * (z / y)) * z;
	} else if (t_0 <= 5e+151) {
		tmp = 0.5 * y;
	} else {
		tmp = ((x / y) * x) * 0.5;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = (((y * y) + (x * x)) - (z * z)) / (2.0d0 * y)
    if (t_0 <= (-2d-150)) then
        tmp = ((-0.5d0) * (z / y)) * z
    else if (t_0 <= 5d+151) then
        tmp = 0.5d0 * y
    else
        tmp = ((x / y) * x) * 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y);
	double tmp;
	if (t_0 <= -2e-150) {
		tmp = (-0.5 * (z / y)) * z;
	} else if (t_0 <= 5e+151) {
		tmp = 0.5 * y;
	} else {
		tmp = ((x / y) * x) * 0.5;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y)
	tmp = 0
	if t_0 <= -2e-150:
		tmp = (-0.5 * (z / y)) * z
	elif t_0 <= 5e+151:
		tmp = 0.5 * y
	else:
		tmp = ((x / y) * x) * 0.5
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(Float64(y * y) + Float64(x * x)) - Float64(z * z)) / Float64(2.0 * y))
	tmp = 0.0
	if (t_0 <= -2e-150)
		tmp = Float64(Float64(-0.5 * Float64(z / y)) * z);
	elseif (t_0 <= 5e+151)
		tmp = Float64(0.5 * y);
	else
		tmp = Float64(Float64(Float64(x / y) * x) * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y);
	tmp = 0.0;
	if (t_0 <= -2e-150)
		tmp = (-0.5 * (z / y)) * z;
	elseif (t_0 <= 5e+151)
		tmp = 0.5 * y;
	else
		tmp = ((x / y) * x) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(N[(y * y), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(2.0 * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-150], N[(N[(-0.5 * N[(z / y), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[t$95$0, 5e+151], N[(0.5 * y), $MachinePrecision], N[(N[(N[(x / y), $MachinePrecision] * x), $MachinePrecision] * 0.5), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < -2.00000000000000001e-150

   1. Initial program 78.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{y}^{2} - {z}^{2}}{y} + \frac{1}{2} \cdot \frac{{x}^{2}}{y}} \]

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-/l* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 31.1

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

   8. Applied rewrites 31.1%

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

   if -2.00000000000000001e-150 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 5.0000000000000002e151

   1. Initial program 95.8%

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

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 67.7

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

   5. Applied rewrites 67.7%

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

   if 5.0000000000000002e151 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 57.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{y}^{2} - {z}^{2}}{y} + \frac{1}{2} \cdot \frac{{x}^{2}}{y}} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x - z}{y}, z + x, y\right) \cdot 0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.9%

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

   8. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{x}^{2}}{y}} \]
   9. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y} \cdot \frac{1}{2}} \]

      3. *-lft-identity N/A

         \[\leadsto \frac{\color{blue}{1 \cdot {x}^{2}}}{y} \cdot \frac{1}{2} \]

      4. associate-*l/ N/A

         \[\leadsto \color{blue}{\left(\frac{1}{y} \cdot {x}^{2}\right)} \cdot \frac{1}{2} \]

      5. unpow2 N/A

         \[\leadsto \left(\frac{1}{y} \cdot \color{blue}{\left(x \cdot x\right)}\right) \cdot \frac{1}{2} \]

      6. associate-*r* N/A

         \[\leadsto \color{blue}{\left(\left(\frac{1}{y} \cdot x\right) \cdot x\right)} \cdot \frac{1}{2} \]

      7. associate-*l/ N/A

         \[\leadsto \left(\color{blue}{\frac{1 \cdot x}{y}} \cdot x\right) \cdot \frac{1}{2} \]

      8. *-lft-identity N/A

         \[\leadsto \left(\frac{\color{blue}{x}}{y} \cdot x\right) \cdot \frac{1}{2} \]

      9. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{x}{y} \cdot x\right)} \cdot \frac{1}{2} \]

      10. lower-/.f64 45.6

          \[\leadsto \left(\color{blue}{\frac{x}{y}} \cdot x\right) \cdot 0.5 \]

   10. Applied rewrites 45.6%

       \[\leadsto \color{blue}{\left(\frac{x}{y} \cdot x\right) \cdot 0.5} \]
3. Recombined 3 regimes into one program.

4. Final simplification 40.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(y \cdot y + x \cdot x\right) - z \cdot z}{2 \cdot y} \leq -2 \cdot 10^{-150}:\\ \;\;\;\;\left(-0.5 \cdot \frac{z}{y}\right) \cdot z\\ \mathbf{elif}\;\frac{\left(y \cdot y + x \cdot x\right) - z \cdot z}{2 \cdot y} \leq 5 \cdot 10^{+151}:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{x}{y} \cdot x\right) \cdot 0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 35.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-0.5 \cdot \frac{z}{y}\right) \cdot z\\ t_1 := \frac{\left(y \cdot y + x \cdot x\right) - z \cdot z}{2 \cdot y}\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{-150}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* -0.5 (/ z y)) z))
        (t_1 (/ (- (+ (* y y) (* x x)) (* z z)) (* 2.0 y))))
   (if (<= t_1 -2e-150) t_0 (if (<= t_1 INFINITY) (* 0.5 y) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (-0.5 * (z / y)) * z;
	double t_1 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y);
	double tmp;
	if (t_1 <= -2e-150) {
		tmp = t_0;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = 0.5 * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double t_0 = (-0.5 * (z / y)) * z;
	double t_1 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y);
	double tmp;
	if (t_1 <= -2e-150) {
		tmp = t_0;
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = 0.5 * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (-0.5 * (z / y)) * z
	t_1 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y)
	tmp = 0
	if t_1 <= -2e-150:
		tmp = t_0
	elif t_1 <= math.inf:
		tmp = 0.5 * y
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-0.5 * Float64(z / y)) * z)
	t_1 = Float64(Float64(Float64(Float64(y * y) + Float64(x * x)) - Float64(z * z)) / Float64(2.0 * y))
	tmp = 0.0
	if (t_1 <= -2e-150)
		tmp = t_0;
	elseif (t_1 <= Inf)
		tmp = Float64(0.5 * y);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (-0.5 * (z / y)) * z;
	t_1 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y);
	tmp = 0.0;
	if (t_1 <= -2e-150)
		tmp = t_0;
	elseif (t_1 <= Inf)
		tmp = 0.5 * y;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(-0.5 * N[(z / y), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(y * y), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(2.0 * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-150], t$95$0, If[LessEqual[t$95$1, Infinity], N[(0.5 * y), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < -2.00000000000000001e-150 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 64.9%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{y}^{2} - {z}^{2}}{y} + \frac{1}{2} \cdot \frac{{x}^{2}}{y}} \]

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-/l* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 34.9

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

   8. Applied rewrites 34.9%

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

   if -2.00000000000000001e-150 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0

   1. Initial program 80.7%

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

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 31.5

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

   5. Applied rewrites 31.5%

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

4. Final simplification 33.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(y \cdot y + x \cdot x\right) - z \cdot z}{2 \cdot y} \leq -2 \cdot 10^{-150}:\\ \;\;\;\;\left(-0.5 \cdot \frac{z}{y}\right) \cdot z\\ \mathbf{elif}\;\frac{\left(y \cdot y + x \cdot x\right) - z \cdot z}{2 \cdot y} \leq \infty:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;\left(-0.5 \cdot \frac{z}{y}\right) \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 33.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{z \cdot z}{y} \cdot -0.5\\ t_1 := \frac{\left(y \cdot y + x \cdot x\right) - z \cdot z}{2 \cdot y}\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{-150}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (/ (* z z) y) -0.5))
        (t_1 (/ (- (+ (* y y) (* x x)) (* z z)) (* 2.0 y))))
   (if (<= t_1 -2e-150) t_0 (if (<= t_1 INFINITY) (* 0.5 y) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = ((z * z) / y) * -0.5;
	double t_1 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y);
	double tmp;
	if (t_1 <= -2e-150) {
		tmp = t_0;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = 0.5 * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double t_0 = ((z * z) / y) * -0.5;
	double t_1 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y);
	double tmp;
	if (t_1 <= -2e-150) {
		tmp = t_0;
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = 0.5 * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = ((z * z) / y) * -0.5
	t_1 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y)
	tmp = 0
	if t_1 <= -2e-150:
		tmp = t_0
	elif t_1 <= math.inf:
		tmp = 0.5 * y
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(z * z) / y) * -0.5)
	t_1 = Float64(Float64(Float64(Float64(y * y) + Float64(x * x)) - Float64(z * z)) / Float64(2.0 * y))
	tmp = 0.0
	if (t_1 <= -2e-150)
		tmp = t_0;
	elseif (t_1 <= Inf)
		tmp = Float64(0.5 * y);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = ((z * z) / y) * -0.5;
	t_1 = (((y * y) + (x * x)) - (z * z)) / (2.0 * y);
	tmp = 0.0;
	if (t_1 <= -2e-150)
		tmp = t_0;
	elseif (t_1 <= Inf)
		tmp = 0.5 * y;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(z * z), $MachinePrecision] / y), $MachinePrecision] * -0.5), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(y * y), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(2.0 * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-150], t$95$0, If[LessEqual[t$95$1, Infinity], N[(0.5 * y), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < -2.00000000000000001e-150 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 64.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 30.2

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

   5. Applied rewrites 30.2%

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

   if -2.00000000000000001e-150 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0

   1. Initial program 80.7%

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

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 31.5

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

   5. Applied rewrites 31.5%

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

4. Final simplification 30.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(y \cdot y + x \cdot x\right) - z \cdot z}{2 \cdot y} \leq -2 \cdot 10^{-150}:\\ \;\;\;\;\frac{z \cdot z}{y} \cdot -0.5\\ \mathbf{elif}\;\frac{\left(y \cdot y + x \cdot x\right) - z \cdot z}{2 \cdot y} \leq \infty:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{z \cdot z}{y} \cdot -0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 65.6% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (/ (- (+ (* y y) (* x x)) (* z z)) (* 2.0 y)) -2e-150)
   (* (- y (* (/ z y) z)) 0.5)
   (* (fma (/ x y) x y) 0.5)))

C

double code(double x, double y, double z) {
	double tmp;
	if (((((y * y) + (x * x)) - (z * z)) / (2.0 * y)) <= -2e-150) {
		tmp = (y - ((z / y) * z)) * 0.5;
	} else {
		tmp = fma((x / y), x, y) * 0.5;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(y * y) + Float64(x * x)) - Float64(z * z)) / Float64(2.0 * y)) <= -2e-150)
		tmp = Float64(Float64(y - Float64(Float64(z / y) * z)) * 0.5);
	else
		tmp = Float64(fma(Float64(x / y), x, y) * 0.5);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(N[(N[(N[(y * y), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(2.0 * y), $MachinePrecision]), $MachinePrecision], -2e-150], N[(N[(y - N[(N[(z / y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(x / y), $MachinePrecision] * x + y), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < -2.00000000000000001e-150

   1. Initial program 78.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{y}^{2} - {z}^{2}}{y} + \frac{1}{2} \cdot \frac{{x}^{2}}{y}} \]

   5. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x - z}{y}, z + x, y\right) \cdot 0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.9%

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

   8. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{y}^{2} - {z}^{2}}{y}} \]
   9. Step-by-step derivation

      1. div-sub N/A

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

      2. sub-neg N/A

         \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\frac{{y}^{2}}{y} + \left(\mathsf{neg}\left(\frac{{z}^{2}}{y}\right)\right)\right)} \]

      3. mul-1-neg N/A

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

      4. distribute-rgt-in N/A

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

      5. unpow2 N/A

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

      6. associate-/l* N/A

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

      7. *-inverses N/A

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

      8. *-rgt-identity N/A

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

      9. distribute-rgt-in N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. mul-1-neg N/A

          \[\leadsto \left(y + \color{blue}{\left(\mathsf{neg}\left(\frac{{z}^{2}}{y}\right)\right)}\right) \cdot \frac{1}{2} \]

      13. sub-neg N/A

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

      14. lower--.f64 N/A

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

      15. unpow2 N/A

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

      16. associate-/l* N/A

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

      17. lower-*.f64 N/A

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

      18. lower-/.f64 65.7

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

   10. Applied rewrites 65.7%

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

   if -2.00000000000000001e-150 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 64.3%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{x}^{2} + {y}^{2}}{y} \cdot \frac{1}{2}} \]

      2. *-lft-identity N/A

         \[\leadsto \frac{\color{blue}{1 \cdot {x}^{2}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      3. *-inverses N/A

         \[\leadsto \frac{\color{blue}{\frac{{y}^{2}}{{y}^{2}}} \cdot {x}^{2} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      4. associate-*l/ N/A

         \[\leadsto \frac{\color{blue}{\frac{{y}^{2} \cdot {x}^{2}}{{y}^{2}}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{\color{blue}{{y}^{2} \cdot \frac{{x}^{2}}{{y}^{2}}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      6. *-rgt-identity N/A

         \[\leadsto \frac{{y}^{2} \cdot \frac{{x}^{2}}{{y}^{2}} + \color{blue}{{y}^{2} \cdot 1}}{y} \cdot \frac{1}{2} \]

      7. distribute-lft-in N/A

         \[\leadsto \frac{\color{blue}{{y}^{2} \cdot \left(\frac{{x}^{2}}{{y}^{2}} + 1\right)}}{y} \cdot \frac{1}{2} \]

      8. +-commutative N/A

         \[\leadsto \frac{{y}^{2} \cdot \color{blue}{\left(1 + \frac{{x}^{2}}{{y}^{2}}\right)}}{y} \cdot \frac{1}{2} \]

      9. associate-*l/ N/A

         \[\leadsto \color{blue}{\left(\frac{{y}^{2}}{y} \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right)} \cdot \frac{1}{2} \]

      10. unpow2 N/A

          \[\leadsto \left(\frac{\color{blue}{y \cdot y}}{y} \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right) \cdot \frac{1}{2} \]

      11. associate-/l* N/A

          \[\leadsto \left(\color{blue}{\left(y \cdot \frac{y}{y}\right)} \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right) \cdot \frac{1}{2} \]

      12. *-inverses N/A

          \[\leadsto \left(\left(y \cdot \color{blue}{1}\right) \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right) \cdot \frac{1}{2} \]

      13. *-rgt-identity N/A

          \[\leadsto \left(\color{blue}{y} \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right) \cdot \frac{1}{2} \]

   5. Applied rewrites 64.2%

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

4. Final simplification 65.0%

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

Alternative 7: 50.7% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (/ (- (+ (* y y) (* x x)) (* z z)) (* 2.0 y)) -2e-150)
   (* (* -0.5 (/ z y)) z)
   (* (fma (/ x y) x y) 0.5)))

C

double code(double x, double y, double z) {
	double tmp;
	if (((((y * y) + (x * x)) - (z * z)) / (2.0 * y)) <= -2e-150) {
		tmp = (-0.5 * (z / y)) * z;
	} else {
		tmp = fma((x / y), x, y) * 0.5;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(y * y) + Float64(x * x)) - Float64(z * z)) / Float64(2.0 * y)) <= -2e-150)
		tmp = Float64(Float64(-0.5 * Float64(z / y)) * z);
	else
		tmp = Float64(fma(Float64(x / y), x, y) * 0.5);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(N[(N[(N[(y * y), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(2.0 * y), $MachinePrecision]), $MachinePrecision], -2e-150], N[(N[(-0.5 * N[(z / y), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], N[(N[(N[(x / y), $MachinePrecision] * x + y), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < -2.00000000000000001e-150

   1. Initial program 78.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{y}^{2} - {z}^{2}}{y} + \frac{1}{2} \cdot \frac{{x}^{2}}{y}} \]

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-/l* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 31.1

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

   8. Applied rewrites 31.1%

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

   if -2.00000000000000001e-150 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 64.3%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{x}^{2} + {y}^{2}}{y} \cdot \frac{1}{2}} \]

      2. *-lft-identity N/A

         \[\leadsto \frac{\color{blue}{1 \cdot {x}^{2}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      3. *-inverses N/A

         \[\leadsto \frac{\color{blue}{\frac{{y}^{2}}{{y}^{2}}} \cdot {x}^{2} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      4. associate-*l/ N/A

         \[\leadsto \frac{\color{blue}{\frac{{y}^{2} \cdot {x}^{2}}{{y}^{2}}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{\color{blue}{{y}^{2} \cdot \frac{{x}^{2}}{{y}^{2}}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      6. *-rgt-identity N/A

         \[\leadsto \frac{{y}^{2} \cdot \frac{{x}^{2}}{{y}^{2}} + \color{blue}{{y}^{2} \cdot 1}}{y} \cdot \frac{1}{2} \]

      7. distribute-lft-in N/A

         \[\leadsto \frac{\color{blue}{{y}^{2} \cdot \left(\frac{{x}^{2}}{{y}^{2}} + 1\right)}}{y} \cdot \frac{1}{2} \]

      8. +-commutative N/A

         \[\leadsto \frac{{y}^{2} \cdot \color{blue}{\left(1 + \frac{{x}^{2}}{{y}^{2}}\right)}}{y} \cdot \frac{1}{2} \]

      9. associate-*l/ N/A

         \[\leadsto \color{blue}{\left(\frac{{y}^{2}}{y} \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right)} \cdot \frac{1}{2} \]

      10. unpow2 N/A

          \[\leadsto \left(\frac{\color{blue}{y \cdot y}}{y} \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right) \cdot \frac{1}{2} \]

      11. associate-/l* N/A

          \[\leadsto \left(\color{blue}{\left(y \cdot \frac{y}{y}\right)} \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right) \cdot \frac{1}{2} \]

      12. *-inverses N/A

          \[\leadsto \left(\left(y \cdot \color{blue}{1}\right) \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right) \cdot \frac{1}{2} \]

      13. *-rgt-identity N/A

          \[\leadsto \left(\color{blue}{y} \cdot \left(1 + \frac{{x}^{2}}{{y}^{2}}\right)\right) \cdot \frac{1}{2} \]

   5. Applied rewrites 64.2%

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

4. Final simplification 47.7%

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

Alternative 8: 34.4% accurate, 6.3× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* 0.5 y))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return 0.5 * y

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(0.5 * y), $MachinePrecision]

Derivation

1. Initial program 71.2%

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

3. Taylor expanded in y around inf

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

   1. lower-*.f64 31.1

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

5. Applied rewrites 31.1%

   \[\leadsto \color{blue}{0.5 \cdot y} \]
6. Add Preprocessing

Developer Target 1: 99.9% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (- (* y 0.5) (* (* (/ 0.5 y) (+ z x)) (- z x))))

C

double code(double x, double y, double z) {
	return (y * 0.5) - (((0.5 / y) * (z + x)) * (z - 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 * 0.5d0) - (((0.5d0 / y) * (z + x)) * (z - x))
end function

Java

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

Python

def code(x, y, z):
	return (y * 0.5) - (((0.5 / y) * (z + x)) * (z - x))

Julia

function code(x, y, z)
	return Float64(Float64(y * 0.5) - Float64(Float64(Float64(0.5 / y) * Float64(z + x)) * Float64(z - x)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (y * 0.5) - (((0.5 / y) * (z + x)) * (z - x));
end

Wolfram

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

Reproduce

herbie shell --seed 2024296 
(FPCore (x y z)
  :name "Diagrams.TwoD.Apollonian:initialConfig from diagrams-contrib-1.3.0.5, A"
  :precision binary64

  :alt
  (! :herbie-platform default (- (* y 1/2) (* (* (/ 1/2 y) (+ z x)) (- z x))))

  (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0)))