Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5

Percentage Accurate: 70.8% → 85.0%

Time: 10.3s

Alternatives: 11

Speedup: 1.2×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

public static double code(double x, double y, double z) {
	return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}

Python

def code(x, y, z):
	return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 70.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

public static double code(double x, double y, double z) {
	return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}

Python

def code(x, y, z):
	return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 85.0% accurate, 0.7× speedup

Math

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

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y 9.5e-282)
   (* (sqrt (fma z x (* x y))) 2.0)
   (* (/ (* (sqrt (+ x y)) 2.0) (sqrt z)) z)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= 9.5e-282) {
		tmp = sqrt(fma(z, x, (x * y))) * 2.0;
	} else {
		tmp = ((sqrt((x + y)) * 2.0) / sqrt(z)) * z;
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= 9.5e-282)
		tmp = Float64(sqrt(fma(z, x, Float64(x * y))) * 2.0);
	else
		tmp = Float64(Float64(Float64(sqrt(Float64(x + y)) * 2.0) / sqrt(z)) * z);
	end
	return tmp
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, 9.5e-282], N[(N[Sqrt[N[(z * x + N[(x * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision], N[(N[(N[(N[Sqrt[N[(x + y), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision] / N[Sqrt[z], $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 9.49999999999999941e-282

   1. Initial program 70.4%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 47.4

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

   5. Applied rewrites 47.4%

      \[\leadsto 2 \cdot \sqrt{\color{blue}{\left(z + y\right) \cdot x}} \]
   6. Step-by-step derivation

   7. Applied rewrites 47.4%

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

   if 9.49999999999999941e-282 < y

   1. Initial program 71.5%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 34.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sqrt{\frac{\frac{1}{y + x}}{{z}^{3}}}, y \cdot x, \sqrt{\frac{y + x}{z}} \cdot 2\right) \cdot z} \]

   6. Taylor expanded in z around inf

      \[\leadsto \left(2 \cdot \sqrt{\frac{x + y}{z}}\right) \cdot z \]
   7. Step-by-step derivation

   8. Applied rewrites 41.9%

      \[\leadsto \left(\sqrt{\frac{y + x}{z}} \cdot 2\right) \cdot z \]
   9. Step-by-step derivation

   10. Applied rewrites 50.1%

       \[\leadsto \frac{\sqrt{x + y} \cdot 2}{\sqrt{z}} \cdot z \]
3. Recombined 2 regimes into one program.

4. Final simplification 48.6%

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

Alternative 2: 84.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 1300000000:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(x + y, z, x \cdot y\right)} \cdot 2\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{\frac{x + y}{z}} \cdot 2\right) \cdot z\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y 1300000000.0)
   (* (sqrt (fma (+ x y) z (* x y))) 2.0)
   (* (* (sqrt (/ (+ x y) z)) 2.0) z)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= 1300000000.0) {
		tmp = sqrt(fma((x + y), z, (x * y))) * 2.0;
	} else {
		tmp = (sqrt(((x + y) / z)) * 2.0) * z;
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= 1300000000.0)
		tmp = Float64(sqrt(fma(Float64(x + y), z, Float64(x * y))) * 2.0);
	else
		tmp = Float64(Float64(sqrt(Float64(Float64(x + y) / z)) * 2.0) * z);
	end
	return tmp
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, 1300000000.0], N[(N[Sqrt[N[(N[(x + y), $MachinePrecision] * z + N[(x * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(x + y), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.3e9

   1. Initial program 75.4%

      \[2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 75.4

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-+l+ N/A

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

      7. +-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. distribute-rgt-out N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 N/A

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

      13. +-commutative N/A

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

      14. lower-+.f64 75.5

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 75.5

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

   4. Applied rewrites 75.5%

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

   if 1.3e9 < y

   1. Initial program 56.0%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 33.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sqrt{\frac{\frac{1}{y + x}}{{z}^{3}}}, y \cdot x, \sqrt{\frac{y + x}{z}} \cdot 2\right) \cdot z} \]

   6. Taylor expanded in z around inf

      \[\leadsto \left(2 \cdot \sqrt{\frac{x + y}{z}}\right) \cdot z \]
   7. Step-by-step derivation

   8. Applied rewrites 38.7%

      \[\leadsto \left(\sqrt{\frac{y + x}{z}} \cdot 2\right) \cdot z \]
3. Recombined 2 regimes into one program.

4. Final simplification 67.0%

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

Alternative 3: 83.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 1800000000:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(x + y, z, x \cdot y\right)} \cdot 2\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{\frac{y}{z}} \cdot 2\right) \cdot z\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y 1800000000.0)
   (* (sqrt (fma (+ x y) z (* x y))) 2.0)
   (* (* (sqrt (/ y z)) 2.0) z)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= 1800000000.0) {
		tmp = sqrt(fma((x + y), z, (x * y))) * 2.0;
	} else {
		tmp = (sqrt((y / z)) * 2.0) * z;
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= 1800000000.0)
		tmp = Float64(sqrt(fma(Float64(x + y), z, Float64(x * y))) * 2.0);
	else
		tmp = Float64(Float64(sqrt(Float64(y / z)) * 2.0) * z);
	end
	return tmp
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, 1800000000.0], N[(N[Sqrt[N[(N[(x + y), $MachinePrecision] * z + N[(x * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision], N[(N[(N[Sqrt[N[(y / z), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.8e9

   1. Initial program 75.4%

      \[2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 75.4

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-+l+ N/A

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

      7. +-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. distribute-rgt-out N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 N/A

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

      13. +-commutative N/A

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

      14. lower-+.f64 75.5

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 75.5

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

   4. Applied rewrites 75.5%

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

   if 1.8e9 < y

   1. Initial program 56.0%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 33.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sqrt{\frac{\frac{1}{y + x}}{{z}^{3}}}, y \cdot x, \sqrt{\frac{y + x}{z}} \cdot 2\right) \cdot z} \]

   6. Taylor expanded in x around 0

      \[\leadsto \left(2 \cdot \sqrt{\frac{y}{z}}\right) \cdot z \]
   7. Step-by-step derivation

   8. Applied rewrites 36.1%

      \[\leadsto \left(\sqrt{\frac{y}{z}} \cdot 2\right) \cdot z \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.4%

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

Alternative 4: 71.0% accurate, 1.1× speedup

Math

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

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y -2e-293)
   (* (sqrt (fma z x (* x y))) 2.0)
   (* (sqrt (* (+ x y) z)) 2.0)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -2e-293) {
		tmp = sqrt(fma(z, x, (x * y))) * 2.0;
	} else {
		tmp = sqrt(((x + y) * z)) * 2.0;
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -2e-293)
		tmp = Float64(sqrt(fma(z, x, Float64(x * y))) * 2.0);
	else
		tmp = Float64(sqrt(Float64(Float64(x + y) * z)) * 2.0);
	end
	return tmp
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, -2e-293], N[(N[Sqrt[N[(z * x + N[(x * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision], N[(N[Sqrt[N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.0000000000000001e-293

   1. Initial program 71.4%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 46.2

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

   5. Applied rewrites 46.2%

      \[\leadsto 2 \cdot \sqrt{\color{blue}{\left(z + y\right) \cdot x}} \]
   6. Step-by-step derivation

   7. Applied rewrites 46.2%

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

   if -2.0000000000000001e-293 < y

   1. Initial program 70.5%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 51.1

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

   5. Applied rewrites 51.1%

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

4. Final simplification 48.6%

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

Alternative 5: 71.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -2 \cdot 10^{-293}:\\ \;\;\;\;\sqrt{\left(z + y\right) \cdot x} \cdot 2\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\left(x + y\right) \cdot z} \cdot 2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y -2e-293) (* (sqrt (* (+ z y) x)) 2.0) (* (sqrt (* (+ x y) z)) 2.0)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -2e-293) {
		tmp = sqrt(((z + y) * x)) * 2.0;
	} else {
		tmp = sqrt(((x + y) * z)) * 2.0;
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 (y <= (-2d-293)) then
        tmp = sqrt(((z + y) * x)) * 2.0d0
    else
        tmp = sqrt(((x + y) * z)) * 2.0d0
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -2e-293) {
		tmp = Math.sqrt(((z + y) * x)) * 2.0;
	} else {
		tmp = Math.sqrt(((x + y) * z)) * 2.0;
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= -2e-293:
		tmp = math.sqrt(((z + y) * x)) * 2.0
	else:
		tmp = math.sqrt(((x + y) * z)) * 2.0
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -2e-293)
		tmp = Float64(sqrt(Float64(Float64(z + y) * x)) * 2.0);
	else
		tmp = Float64(sqrt(Float64(Float64(x + y) * z)) * 2.0);
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -2e-293)
		tmp = sqrt(((z + y) * x)) * 2.0;
	else
		tmp = sqrt(((x + y) * z)) * 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, -2e-293], N[(N[Sqrt[N[(N[(z + y), $MachinePrecision] * x), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision], N[(N[Sqrt[N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.0000000000000001e-293

   1. Initial program 71.4%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 46.2

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

   5. Applied rewrites 46.2%

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

   if -2.0000000000000001e-293 < y

   1. Initial program 70.5%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 51.1

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

   5. Applied rewrites 51.1%

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

4. Final simplification 48.6%

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

Alternative 6: 69.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -5.1 \cdot 10^{-287}:\\ \;\;\;\;\sqrt{x \cdot y} \cdot 2\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\left(x + y\right) \cdot z} \cdot 2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y -5.1e-287) (* (sqrt (* x y)) 2.0) (* (sqrt (* (+ x y) z)) 2.0)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -5.1e-287) {
		tmp = sqrt((x * y)) * 2.0;
	} else {
		tmp = sqrt(((x + y) * z)) * 2.0;
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 (y <= (-5.1d-287)) then
        tmp = sqrt((x * y)) * 2.0d0
    else
        tmp = sqrt(((x + y) * z)) * 2.0d0
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -5.1e-287) {
		tmp = Math.sqrt((x * y)) * 2.0;
	} else {
		tmp = Math.sqrt(((x + y) * z)) * 2.0;
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= -5.1e-287:
		tmp = math.sqrt((x * y)) * 2.0
	else:
		tmp = math.sqrt(((x + y) * z)) * 2.0
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -5.1e-287)
		tmp = Float64(sqrt(Float64(x * y)) * 2.0);
	else
		tmp = Float64(sqrt(Float64(Float64(x + y) * z)) * 2.0);
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -5.1e-287)
		tmp = sqrt((x * y)) * 2.0;
	else
		tmp = sqrt(((x + y) * z)) * 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, -5.1e-287], N[(N[Sqrt[N[(x * y), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision], N[(N[Sqrt[N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.0999999999999998e-287

   1. Initial program 71.1%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

         \[\leadsto 2 \cdot \sqrt{\color{blue}{y \cdot x}} \]

      2. lower-*.f64 23.3

         \[\leadsto 2 \cdot \sqrt{\color{blue}{y \cdot x}} \]

   5. Applied rewrites 23.3%

      \[\leadsto 2 \cdot \sqrt{\color{blue}{y \cdot x}} \]

   if -5.0999999999999998e-287 < y

   1. Initial program 70.7%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 51.5

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

   5. Applied rewrites 51.5%

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

4. Final simplification 37.4%

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

Alternative 7: 71.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \sqrt{\mathsf{fma}\left(x + y, z, x \cdot y\right)} \cdot 2 \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (* (sqrt (fma (+ x y) z (* x y))) 2.0))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return sqrt(fma((x + y), z, (x * y))) * 2.0;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return Float64(sqrt(fma(Float64(x + y), z, Float64(x * y))) * 2.0)
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(N[Sqrt[N[(N[(x + y), $MachinePrecision] * z + N[(x * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision]

Derivation

1. Initial program 70.9%

   \[2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 70.9

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

   4. lift-+.f64 N/A

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

   5. lift-+.f64 N/A

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

   6. associate-+l+ N/A

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

   7. +-commutative N/A

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

   8. lift-*.f64 N/A

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

   9. lift-*.f64 N/A

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

   10. distribute-rgt-out N/A

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

   11. *-commutative N/A

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

   12. lower-fma.f64 N/A

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

   13. +-commutative N/A

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

   14. lower-+.f64 71.1

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

   15. lift-*.f64 N/A

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

   16. *-commutative N/A

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

   17. lower-*.f64 71.1

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

4. Applied rewrites 71.1%

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

5. Final simplification 71.1%

   \[\leadsto \sqrt{\mathsf{fma}\left(x + y, z, x \cdot y\right)} \cdot 2 \]
6. Add Preprocessing

Alternative 8: 71.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \sqrt{\mathsf{fma}\left(z, y, \left(z + y\right) \cdot x\right)} \cdot 2 \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (* (sqrt (fma z y (* (+ z y) x))) 2.0))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return sqrt(fma(z, y, ((z + y) * x))) * 2.0;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return Float64(sqrt(fma(z, y, Float64(Float64(z + y) * x))) * 2.0)
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(N[Sqrt[N[(z * y + N[(N[(z + y), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision]

Derivation

1. Initial program 70.9%

   \[2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 70.9

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

   4. lift-+.f64 N/A

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

   5. lift-+.f64 N/A

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

   6. associate-+l+ N/A

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

   7. +-commutative N/A

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

   8. lift-*.f64 N/A

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

   9. lift-*.f64 N/A

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

   10. distribute-rgt-out N/A

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

   11. *-commutative N/A

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

   12. lower-fma.f64 N/A

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

   13. +-commutative N/A

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

   14. lower-+.f64 71.1

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

   15. lift-*.f64 N/A

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

   16. *-commutative N/A

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

   17. lower-*.f64 71.1

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

4. Applied rewrites 71.1%

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

   1. lift-fma.f64 N/A

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

   2. *-commutative N/A

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

   3. lift-+.f64 N/A

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

   4. distribute-rgt-in N/A

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

   5. associate-+r+ N/A

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

   6. lift-*.f64 N/A

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

   7. *-commutative N/A

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

   8. +-commutative N/A

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

   9. *-commutative N/A

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

   10. lower-fma.f64 N/A

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

   11. distribute-lft-out N/A

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

   12. +-commutative N/A

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

   13. lift-+.f64 N/A

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

   14. *-commutative N/A

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

   15. lift-*.f64 71.1

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

6. Applied rewrites 71.1%

   \[\leadsto \sqrt{\color{blue}{\mathsf{fma}\left(z, y, \left(z + y\right) \cdot x\right)}} \cdot 2 \]
7. Add Preprocessing

Alternative 9: 70.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \sqrt{\mathsf{fma}\left(y, z + x, z \cdot x\right)} \cdot 2 \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (* (sqrt (fma y (+ z x) (* z x))) 2.0))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return sqrt(fma(y, (z + x), (z * x))) * 2.0;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return Float64(sqrt(fma(y, Float64(z + x), Float64(z * x))) * 2.0)
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(N[Sqrt[N[(y * N[(z + x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision]

Derivation

1. Initial program 70.9%

   \[2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-+.f64 N/A

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

   4. associate-+r+ N/A

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

   5. lift-*.f64 N/A

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

   6. lift-*.f64 N/A

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

   7. *-commutative N/A

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

   8. distribute-lft-out N/A

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

   9. lower-fma.f64 N/A

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

   10. lower-+.f64 71.1

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

   11. lift-*.f64 N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 71.1

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

4. Applied rewrites 71.1%

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

5. Final simplification 71.1%

   \[\leadsto \sqrt{\mathsf{fma}\left(y, z + x, z \cdot x\right)} \cdot 2 \]
6. Add Preprocessing

Alternative 10: 68.8% accurate, 1.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\sqrt{x \cdot y} \cdot 2\\ \mathbf{else}:\\ \;\;\;\;\sqrt{z \cdot y} \cdot 2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y -1e-310) (* (sqrt (* x y)) 2.0) (* (sqrt (* z y)) 2.0)))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -1e-310) {
		tmp = sqrt((x * y)) * 2.0;
	} else {
		tmp = sqrt((z * y)) * 2.0;
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 (y <= (-1d-310)) then
        tmp = sqrt((x * y)) * 2.0d0
    else
        tmp = sqrt((z * y)) * 2.0d0
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -1e-310) {
		tmp = Math.sqrt((x * y)) * 2.0;
	} else {
		tmp = Math.sqrt((z * y)) * 2.0;
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= -1e-310:
		tmp = math.sqrt((x * y)) * 2.0
	else:
		tmp = math.sqrt((z * y)) * 2.0
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -1e-310)
		tmp = Float64(sqrt(Float64(x * y)) * 2.0);
	else
		tmp = Float64(sqrt(Float64(z * y)) * 2.0);
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -1e-310)
		tmp = sqrt((x * y)) * 2.0;
	else
		tmp = sqrt((z * y)) * 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, -1e-310], N[(N[Sqrt[N[(x * y), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision], N[(N[Sqrt[N[(z * y), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -9.999999999999969e-311

   1. Initial program 71.3%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

         \[\leadsto 2 \cdot \sqrt{\color{blue}{y \cdot x}} \]

      2. lower-*.f64 22.7

         \[\leadsto 2 \cdot \sqrt{\color{blue}{y \cdot x}} \]

   5. Applied rewrites 22.7%

      \[\leadsto 2 \cdot \sqrt{\color{blue}{y \cdot x}} \]

   if -9.999999999999969e-311 < y

   1. Initial program 70.5%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 25.3

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

   5. Applied rewrites 25.3%

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

4. Final simplification 24.0%

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

Alternative 11: 35.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \sqrt{x \cdot y} \cdot 2 \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (* (sqrt (* x y)) 2.0))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return sqrt((x * y)) * 2.0;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = sqrt((x * y)) * 2.0d0
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	return Math.sqrt((x * y)) * 2.0;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	return math.sqrt((x * y)) * 2.0

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return Float64(sqrt(Float64(x * y)) * 2.0)
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
	tmp = sqrt((x * y)) * 2.0;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(N[Sqrt[N[(x * y), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision]

Derivation

1. Initial program 70.9%

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

3. Taylor expanded in z around 0

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

   1. *-commutative N/A

      \[\leadsto 2 \cdot \sqrt{\color{blue}{y \cdot x}} \]

   2. lower-*.f64 23.1

      \[\leadsto 2 \cdot \sqrt{\color{blue}{y \cdot x}} \]

5. Applied rewrites 23.1%

   \[\leadsto 2 \cdot \sqrt{\color{blue}{y \cdot x}} \]

6. Final simplification 23.1%

   \[\leadsto \sqrt{x \cdot y} \cdot 2 \]
7. Add Preprocessing

Developer Target 1: 83.0% accurate, 0.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 0.25 \cdot \left(\left({y}^{-0.75} \cdot \left({z}^{-0.75} \cdot x\right)\right) \cdot \left(y + z\right)\right) + {z}^{0.25} \cdot {y}^{0.25}\\ \mathbf{if}\;z < 7.636950090573675 \cdot 10^{+176}:\\ \;\;\;\;2 \cdot \sqrt{\left(x + y\right) \cdot z + x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;\left(t\_0 \cdot t\_0\right) \cdot 2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0
         (+
          (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z)))
          (* (pow z 0.25) (pow y 0.25)))))
   (if (< z 7.636950090573675e+176)
     (* 2.0 (sqrt (+ (* (+ x y) z) (* x y))))
     (* (* t_0 t_0) 2.0))))

C

double code(double x, double y, double z) {
	double t_0 = (0.25 * ((pow(y, -0.75) * (pow(z, -0.75) * x)) * (y + z))) + (pow(z, 0.25) * pow(y, 0.25));
	double tmp;
	if (z < 7.636950090573675e+176) {
		tmp = 2.0 * sqrt((((x + y) * z) + (x * y)));
	} else {
		tmp = (t_0 * t_0) * 2.0;
	}
	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 = (0.25d0 * (((y ** (-0.75d0)) * ((z ** (-0.75d0)) * x)) * (y + z))) + ((z ** 0.25d0) * (y ** 0.25d0))
    if (z < 7.636950090573675d+176) then
        tmp = 2.0d0 * sqrt((((x + y) * z) + (x * y)))
    else
        tmp = (t_0 * t_0) * 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (0.25 * ((Math.pow(y, -0.75) * (Math.pow(z, -0.75) * x)) * (y + z))) + (Math.pow(z, 0.25) * Math.pow(y, 0.25));
	double tmp;
	if (z < 7.636950090573675e+176) {
		tmp = 2.0 * Math.sqrt((((x + y) * z) + (x * y)));
	} else {
		tmp = (t_0 * t_0) * 2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (0.25 * ((math.pow(y, -0.75) * (math.pow(z, -0.75) * x)) * (y + z))) + (math.pow(z, 0.25) * math.pow(y, 0.25))
	tmp = 0
	if z < 7.636950090573675e+176:
		tmp = 2.0 * math.sqrt((((x + y) * z) + (x * y)))
	else:
		tmp = (t_0 * t_0) * 2.0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(0.25 * Float64(Float64((y ^ -0.75) * Float64((z ^ -0.75) * x)) * Float64(y + z))) + Float64((z ^ 0.25) * (y ^ 0.25)))
	tmp = 0.0
	if (z < 7.636950090573675e+176)
		tmp = Float64(2.0 * sqrt(Float64(Float64(Float64(x + y) * z) + Float64(x * y))));
	else
		tmp = Float64(Float64(t_0 * t_0) * 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (0.25 * (((y ^ -0.75) * ((z ^ -0.75) * x)) * (y + z))) + ((z ^ 0.25) * (y ^ 0.25));
	tmp = 0.0;
	if (z < 7.636950090573675e+176)
		tmp = 2.0 * sqrt((((x + y) * z) + (x * y)));
	else
		tmp = (t_0 * t_0) * 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(0.25 * N[(N[(N[Power[y, -0.75], $MachinePrecision] * N[(N[Power[z, -0.75], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] * N[(y + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Power[z, 0.25], $MachinePrecision] * N[Power[y, 0.25], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[z, 7.636950090573675e+176], N[(2.0 * N[Sqrt[N[(N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * t$95$0), $MachinePrecision] * 2.0), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024257 
(FPCore (x y z)
  :name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z 763695009057367500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* 2 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 1/4 (* (* (pow y -3/4) (* (pow z -3/4) x)) (+ y z))) (* (pow z 1/4) (pow y 1/4))) (+ (* 1/4 (* (* (pow y -3/4) (* (pow z -3/4) x)) (+ y z))) (* (pow z 1/4) (pow y 1/4)))) 2)))

  (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))