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

Percentage Accurate: 71.4% → 85.0%

Time: 7.6s

Alternatives: 8

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: 71.4% 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.2× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := \left(x \cdot y + x \cdot z\right) + y \cdot z\\ \mathbf{if}\;t\_0 \leq 4 \cdot 10^{-311}:\\ \;\;\;\;\left(\sqrt{\frac{x + y}{z}} \cdot 2\right) \cdot z\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+307}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(y, z + x, z \cdot x\right)}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\sqrt{\frac{y}{z}}, 2, \sqrt{{\left(y \cdot z\right)}^{-1}} \cdot x\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
 (let* ((t_0 (+ (+ (* x y) (* x z)) (* y z))))
   (if (<= t_0 4e-311)
     (* (* (sqrt (/ (+ x y) z)) 2.0) z)
     (if (<= t_0 2e+307)
       (* 2.0 (sqrt (fma y (+ z x) (* z x))))
       (* (fma (sqrt (/ y z)) 2.0 (* (sqrt (pow (* y z) -1.0)) x)) z)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double t_0 = ((x * y) + (x * z)) + (y * z);
	double tmp;
	if (t_0 <= 4e-311) {
		tmp = (sqrt(((x + y) / z)) * 2.0) * z;
	} else if (t_0 <= 2e+307) {
		tmp = 2.0 * sqrt(fma(y, (z + x), (z * x)));
	} else {
		tmp = fma(sqrt((y / z)), 2.0, (sqrt(pow((y * z), -1.0)) * x)) * z;
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	t_0 = Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z))
	tmp = 0.0
	if (t_0 <= 4e-311)
		tmp = Float64(Float64(sqrt(Float64(Float64(x + y) / z)) * 2.0) * z);
	elseif (t_0 <= 2e+307)
		tmp = Float64(2.0 * sqrt(fma(y, Float64(z + x), Float64(z * x))));
	else
		tmp = Float64(fma(sqrt(Float64(y / z)), 2.0, Float64(sqrt((Float64(y * z) ^ -1.0)) * x)) * 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_] := Block[{t$95$0 = N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 4e-311], N[(N[(N[Sqrt[N[(N[(x + y), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[t$95$0, 2e+307], N[(2.0 * N[Sqrt[N[(y * N[(z + x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(y / z), $MachinePrecision]], $MachinePrecision] * 2.0 + N[(N[Sqrt[N[Power[N[(y * z), $MachinePrecision], -1.0], $MachinePrecision]], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 3.99999999999979e-311

   1. Initial program 28.1%

      \[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 0.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 62.9%

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

   if 3.99999999999979e-311 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 1.99999999999999997e307

   1. Initial program 99.8%

      \[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 99.8

          \[\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 99.8

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

   4. Applied rewrites 99.8%

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

   if 1.99999999999999997e307 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z))

   1. Initial program 4.9%

      \[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 32.5%

      \[\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 35.7%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 10.6%

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

4. Final simplification 75.9%

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

Alternative 2: 84.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := \left(x \cdot y + x \cdot z\right) + y \cdot z\\ \mathbf{if}\;t\_0 \leq 4 \cdot 10^{-314} \lor \neg \left(t\_0 \leq 2 \cdot 10^{+307}\right):\\ \;\;\;\;\left(\sqrt{\frac{y}{z}} \cdot 2\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(y, z + x, z \cdot x\right)}\\ \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
 (let* ((t_0 (+ (+ (* x y) (* x z)) (* y z))))
   (if (or (<= t_0 4e-314) (not (<= t_0 2e+307)))
     (* (* (sqrt (/ y z)) 2.0) z)
     (* 2.0 (sqrt (fma y (+ z x) (* z x)))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double t_0 = ((x * y) + (x * z)) + (y * z);
	double tmp;
	if ((t_0 <= 4e-314) || !(t_0 <= 2e+307)) {
		tmp = (sqrt((y / z)) * 2.0) * z;
	} else {
		tmp = 2.0 * sqrt(fma(y, (z + x), (z * x)));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	t_0 = Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z))
	tmp = 0.0
	if ((t_0 <= 4e-314) || !(t_0 <= 2e+307))
		tmp = Float64(Float64(sqrt(Float64(y / z)) * 2.0) * z);
	else
		tmp = Float64(2.0 * sqrt(fma(y, Float64(z + x), Float64(z * x))));
	end
	return tmp
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, 4e-314], N[Not[LessEqual[t$95$0, 2e+307]], $MachinePrecision]], N[(N[(N[Sqrt[N[(y / z), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * N[(z + x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 3.9999999999e-314 or 1.99999999999999997e307 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z))

   1. Initial program 6.6%

      \[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 28.9%

      \[\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 11.3%

      \[\leadsto \left(\sqrt{\frac{y}{z}} \cdot 2\right) \cdot z \]

   if 3.9999999999e-314 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 1.99999999999999997e307

   1. Initial program 99.7%

      \[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 99.7

          \[\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 99.7

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

   4. Applied rewrites 99.7%

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

4. Final simplification 74.5%

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

Alternative 3: 84.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := \left(x \cdot y + x \cdot z\right) + y \cdot z\\ \mathbf{if}\;t\_0 \leq 4 \cdot 10^{-311}:\\ \;\;\;\;\left(\sqrt{\frac{x + y}{z}} \cdot 2\right) \cdot z\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+307}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(y, z + x, z \cdot x\right)}\\ \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
 (let* ((t_0 (+ (+ (* x y) (* x z)) (* y z))))
   (if (<= t_0 4e-311)
     (* (* (sqrt (/ (+ x y) z)) 2.0) z)
     (if (<= t_0 2e+307)
       (* 2.0 (sqrt (fma y (+ z x) (* z x))))
       (* (* (sqrt (/ y z)) 2.0) z)))))

C

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

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	t_0 = Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z))
	tmp = 0.0
	if (t_0 <= 4e-311)
		tmp = Float64(Float64(sqrt(Float64(Float64(x + y) / z)) * 2.0) * z);
	elseif (t_0 <= 2e+307)
		tmp = Float64(2.0 * sqrt(fma(y, Float64(z + x), Float64(z * x))));
	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_] := Block[{t$95$0 = N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 4e-311], N[(N[(N[Sqrt[N[(N[(x + y), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[t$95$0, 2e+307], N[(2.0 * N[Sqrt[N[(y * N[(z + x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(y / z), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision] * z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 3.99999999999979e-311

   1. Initial program 28.1%

      \[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 0.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 62.9%

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

   if 3.99999999999979e-311 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 1.99999999999999997e307

   1. Initial program 99.8%

      \[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 99.8

          \[\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 99.8

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

   4. Applied rewrites 99.8%

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

   if 1.99999999999999997e307 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z))

   1. Initial program 4.9%

      \[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 32.5%

      \[\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 10.4%

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

Alternative 4: 71.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{-305}:\\ \;\;\;\;2 \cdot \sqrt{\left(z + y\right) \cdot x}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{\left(y + x\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 -5e-305) (* 2.0 (sqrt (* (+ z y) x))) (* 2.0 (sqrt (* (+ y x) z)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -5e-305) {
		tmp = 2.0 * sqrt(((z + y) * x));
	} else {
		tmp = 2.0 * sqrt(((y + x) * z));
	}
	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 <= (-5d-305)) then
        tmp = 2.0d0 * sqrt(((z + y) * x))
    else
        tmp = 2.0d0 * sqrt(((y + x) * z))
    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 <= -5e-305) {
		tmp = 2.0 * Math.sqrt(((z + y) * x));
	} else {
		tmp = 2.0 * Math.sqrt(((y + x) * z));
	}
	return tmp;
}

Python

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

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -5e-305)
		tmp = Float64(2.0 * sqrt(Float64(Float64(z + y) * x)));
	else
		tmp = Float64(2.0 * sqrt(Float64(Float64(y + x) * z)));
	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 <= -5e-305)
		tmp = 2.0 * sqrt(((z + y) * x));
	else
		tmp = 2.0 * sqrt(((y + x) * z));
	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, -5e-305], N[(2.0 * N[Sqrt[N[(N[(z + y), $MachinePrecision] * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(N[(y + x), $MachinePrecision] * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -4.99999999999999985e-305

   1. Initial program 70.2%

      \[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 \color{blue}{\sqrt{x \cdot \left(y + z\right)}} \]
   4. Step-by-step derivation

      1. lower-sqrt.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 46.4

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

   5. Applied rewrites 46.4%

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

   if -4.99999999999999985e-305 < y

   1. Initial program 76.3%

      \[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 44.5

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

   5. Applied rewrites 44.5%

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

Alternative 5: 70.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 1.4 \cdot 10^{-298}:\\ \;\;\;\;2 \cdot \sqrt{\left(z + y\right) \cdot x}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{z \cdot y}\\ \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 1.4e-298) (* 2.0 (sqrt (* (+ z y) x))) (* 2.0 (sqrt (* z y)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= 1.4e-298) {
		tmp = 2.0 * sqrt(((z + y) * x));
	} else {
		tmp = 2.0 * sqrt((z * y));
	}
	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 <= 1.4d-298) then
        tmp = 2.0d0 * sqrt(((z + y) * x))
    else
        tmp = 2.0d0 * sqrt((z * y))
    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 <= 1.4e-298) {
		tmp = 2.0 * Math.sqrt(((z + y) * x));
	} else {
		tmp = 2.0 * Math.sqrt((z * y));
	}
	return tmp;
}

Python

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

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= 1.4e-298)
		tmp = Float64(2.0 * sqrt(Float64(Float64(z + y) * x)));
	else
		tmp = Float64(2.0 * sqrt(Float64(z * y)));
	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 <= 1.4e-298)
		tmp = 2.0 * sqrt(((z + y) * x));
	else
		tmp = 2.0 * sqrt((z * y));
	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, 1.4e-298], N[(2.0 * N[Sqrt[N[(N[(z + y), $MachinePrecision] * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.39999999999999996e-298

   1. Initial program 70.6%

      \[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 \color{blue}{\sqrt{x \cdot \left(y + z\right)}} \]
   4. Step-by-step derivation

      1. lower-sqrt.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-+.f64 47.7

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

   5. Applied rewrites 47.7%

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

   if 1.39999999999999996e-298 < y

   1. Initial program 76.1%

      \[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 20.6

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

   5. Applied rewrites 20.6%

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

Alternative 6: 71.4% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 73.2%

   \[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 73.3

       \[\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 73.3

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

4. Applied rewrites 73.3%

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

Alternative 7: 69.3% 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}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot x}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{z \cdot y}\\ \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) (* 2.0 (sqrt (* y x))) (* 2.0 (sqrt (* z y)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -1e-310) {
		tmp = 2.0 * sqrt((y * x));
	} else {
		tmp = 2.0 * sqrt((z * y));
	}
	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 = 2.0d0 * sqrt((y * x))
    else
        tmp = 2.0d0 * sqrt((z * y))
    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 = 2.0 * Math.sqrt((y * x));
	} else {
		tmp = 2.0 * Math.sqrt((z * y));
	}
	return tmp;
}

Python

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

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -1e-310)
		tmp = Float64(2.0 * sqrt(Float64(y * x)));
	else
		tmp = Float64(2.0 * sqrt(Float64(z * y)));
	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 = 2.0 * sqrt((y * x));
	else
		tmp = 2.0 * sqrt((z * y));
	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[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -9.999999999999969e-311

   1. Initial program 69.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 \color{blue}{\sqrt{x \cdot y}} \]
   4. Step-by-step derivation

      1. lower-sqrt.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 24.8

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

   5. Applied rewrites 24.8%

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

   if -9.999999999999969e-311 < y

   1. Initial program 76.7%

      \[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 20.2

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

   5. Applied rewrites 20.2%

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

Alternative 8: 36.4% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

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 = 2.0d0 * sqrt((y * x))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 73.2%

   \[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 \color{blue}{\sqrt{x \cdot y}} \]
4. Step-by-step derivation

   1. lower-sqrt.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 28.1

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

5. Applied rewrites 28.1%

   \[\leadsto 2 \cdot \color{blue}{\sqrt{y \cdot x}} \]
6. Add Preprocessing

Developer Target 1: 83.5% 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 2024322 
(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)))))