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

Percentage Accurate: 70.4% → 94.5%

Time: 17.6s

Alternatives: 11

Speedup: 1.0×

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.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: 94.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := 2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ t_1 := z \cdot \left(y + x\right)\\ \mathbf{if}\;y \leq -1.02 \cdot 10^{+79}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq -6.4 \cdot 10^{-193}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, t\_1\right)}\\ \mathbf{elif}\;y \leq 3.3 \cdot 10^{-267}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-255}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \mathbf{elif}\;y \leq 130000000000:\\ \;\;\;\;2 \cdot \sqrt{t\_1}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(z \cdot \mathsf{fma}\left(0.5, y \cdot \left(x \cdot \sqrt{\frac{\frac{1}{{z}^{3}}}{y + x}}\right), \sqrt{\frac{y + x}{z}}\right)\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
         (*
          2.0
          (pow (exp (* 0.25 (- (log (- (- y) z)) (log (/ -1.0 x))))) 2.0)))
        (t_1 (* z (+ y x))))
   (if (<= y -1.02e+79)
     t_0
     (if (<= y -6.4e-193)
       (* 2.0 (sqrt (fma x y t_1)))
       (if (<= y 3.3e-267)
         t_0
         (if (<= y 8.5e-255)
           (* 2.0 (* (sqrt z) (sqrt y)))
           (if (<= y 130000000000.0)
             (* 2.0 (sqrt t_1))
             (*
              2.0
              (*
               z
               (fma
                0.5
                (* y (* x (sqrt (/ (/ 1.0 (pow z 3.0)) (+ y x)))))
                (sqrt (/ (+ y x) z))))))))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double t_0 = 2.0 * pow(exp((0.25 * (log((-y - z)) - log((-1.0 / x))))), 2.0);
	double t_1 = z * (y + x);
	double tmp;
	if (y <= -1.02e+79) {
		tmp = t_0;
	} else if (y <= -6.4e-193) {
		tmp = 2.0 * sqrt(fma(x, y, t_1));
	} else if (y <= 3.3e-267) {
		tmp = t_0;
	} else if (y <= 8.5e-255) {
		tmp = 2.0 * (sqrt(z) * sqrt(y));
	} else if (y <= 130000000000.0) {
		tmp = 2.0 * sqrt(t_1);
	} else {
		tmp = 2.0 * (z * fma(0.5, (y * (x * sqrt(((1.0 / pow(z, 3.0)) / (y + x))))), sqrt(((y + x) / z))));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	t_0 = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))))) ^ 2.0))
	t_1 = Float64(z * Float64(y + x))
	tmp = 0.0
	if (y <= -1.02e+79)
		tmp = t_0;
	elseif (y <= -6.4e-193)
		tmp = Float64(2.0 * sqrt(fma(x, y, t_1)));
	elseif (y <= 3.3e-267)
		tmp = t_0;
	elseif (y <= 8.5e-255)
		tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y)));
	elseif (y <= 130000000000.0)
		tmp = Float64(2.0 * sqrt(t_1));
	else
		tmp = Float64(2.0 * Float64(z * fma(0.5, Float64(y * Float64(x * sqrt(Float64(Float64(1.0 / (z ^ 3.0)) / Float64(y + x))))), sqrt(Float64(Float64(y + 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[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.02e+79], t$95$0, If[LessEqual[y, -6.4e-193], N[(2.0 * N[Sqrt[N[(x * y + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.3e-267], t$95$0, If[LessEqual[y, 8.5e-255], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 130000000000.0], N[(2.0 * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(z * N[(0.5 * N[(y * N[(x * N[Sqrt[N[(N[(1.0 / N[Power[z, 3.0], $MachinePrecision]), $MachinePrecision] / N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[Sqrt[N[(N[(y + x), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 5 regimes

2. if y < -1.02000000000000006e79 or -6.40000000000000011e-193 < y < 3.30000000000000004e-267

   1. Initial program 68.7%

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

      1. +-commutative 68.7%

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

      2. associate-+r+ 68.7%

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

      3. *-commutative 68.7%

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

      4. +-commutative 68.7%

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

      5. associate-+l+ 68.7%

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

      6. *-commutative 68.7%

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

      7. distribute-rgt-in 68.7%

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

   3. Simplified 68.7%

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

      1. +-commutative 68.7%

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

      2. distribute-rgt-in 68.7%

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

      3. associate-+l+ 68.7%

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

      4. +-commutative 68.7%

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

      5. associate-+r+ 68.7%

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

      6. *-commutative 68.7%

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

      7. distribute-lft-in 68.7%

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

      8. fma-undefine 69.1%

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

      9. add-sqr-sqrt 68.6%

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

      10. pow2 68.6%

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

   6. Applied egg-rr 68.6%

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

   7. Taylor expanded in x around -inf 54.2%

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

   if -1.02000000000000006e79 < y < -6.40000000000000011e-193

   1. Initial program 84.2%

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

      1. associate-+l+ 84.2%

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

      2. *-commutative 84.2%

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

      3. *-commutative 84.2%

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

      4. *-commutative 84.2%

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

      5. +-commutative 84.2%

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

      6. +-commutative 84.2%

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

      7. associate-+l+ 84.2%

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

      8. *-commutative 84.2%

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

      9. *-commutative 84.2%

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

      10. +-commutative 84.2%

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

      11. +-commutative 84.2%

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

      12. *-commutative 84.2%

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

      13. *-commutative 84.2%

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

      14. associate-+l+ 84.2%

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

      15. +-commutative 84.2%

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

      16. *-commutative 84.2%

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

      17. fma-define 84.2%

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

   3. Simplified 84.2%

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

   if 3.30000000000000004e-267 < y < 8.49999999999999982e-255

   1. Initial program 100.0%

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

      1. distribute-lft-out 100.0%

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

      2. *-commutative 100.0%

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

   4. Applied egg-rr 100.0%

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

   5. Taylor expanded in x around 0 3.7%

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

      1. *-commutative 3.7%

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

   7. Simplified 3.7%

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

      1. sqrt-prod 3.8%

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

   9. Applied egg-rr 3.8%

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

   if 8.49999999999999982e-255 < y < 1.3e11

   1. Initial program 89.4%

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

      1. +-commutative 89.4%

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

      2. associate-+r+ 89.4%

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

      3. *-commutative 89.4%

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

      4. +-commutative 89.4%

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

      5. associate-+l+ 89.4%

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

      6. *-commutative 89.4%

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

      7. distribute-rgt-in 89.4%

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

   3. Simplified 89.4%

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

   5. Taylor expanded in z around inf 56.6%

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

      1. +-commutative 56.6%

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

   7. Simplified 56.6%

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

   if 1.3e11 < y

   1. Initial program 45.6%

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

      1. +-commutative 45.6%

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

      2. associate-+r+ 45.6%

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

      3. *-commutative 45.6%

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

      4. +-commutative 45.6%

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

      5. associate-+l+ 45.6%

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

      6. *-commutative 45.6%

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

      7. distribute-rgt-in 45.8%

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

   3. Simplified 45.8%

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

   5. Taylor expanded in z around inf 22.3%

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

      1. +-commutative 22.3%

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

      2. fma-define 22.3%

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

      3. *-commutative 22.3%

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

      4. associate-*l* 28.2%

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

      5. associate-/r* 28.2%

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

      6. +-commutative 28.2%

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

      7. +-commutative 28.2%

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

   7. Simplified 28.2%

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

4. Final simplification 55.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.02 \cdot 10^{+79}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq -6.4 \cdot 10^{-193}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\ \mathbf{elif}\;y \leq 3.3 \cdot 10^{-267}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-255}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \mathbf{elif}\;y \leq 130000000000:\\ \;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(z \cdot \mathsf{fma}\left(0.5, y \cdot \left(x \cdot \sqrt{\frac{\frac{1}{{z}^{3}}}{y + x}}\right), \sqrt{\frac{y + x}{z}}\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 94.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := 2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ t_1 := z \cdot \left(y + x\right)\\ \mathbf{if}\;y \leq -1.02 \cdot 10^{+79}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq -6.4 \cdot 10^{-193}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, t\_1\right)}\\ \mathbf{elif}\;y \leq 2.2 \cdot 10^{-267}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-255}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \mathbf{elif}\;y \leq 1.65 \cdot 10^{+45}:\\ \;\;\;\;2 \cdot \sqrt{t\_1}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(z \cdot \left(\sqrt{\frac{y + x}{z}} + 0.5 \cdot \left(y \cdot \sqrt{\frac{x}{{z}^{3}}}\right)\right)\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
         (*
          2.0
          (pow (exp (* 0.25 (- (log (- (- y) z)) (log (/ -1.0 x))))) 2.0)))
        (t_1 (* z (+ y x))))
   (if (<= y -1.02e+79)
     t_0
     (if (<= y -6.4e-193)
       (* 2.0 (sqrt (fma x y t_1)))
       (if (<= y 2.2e-267)
         t_0
         (if (<= y 8.5e-255)
           (* 2.0 (* (sqrt z) (sqrt y)))
           (if (<= y 1.65e+45)
             (* 2.0 (sqrt t_1))
             (*
              2.0
              (*
               z
               (+
                (sqrt (/ (+ y x) z))
                (* 0.5 (* y (sqrt (/ x (pow z 3.0)))))))))))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double t_0 = 2.0 * pow(exp((0.25 * (log((-y - z)) - log((-1.0 / x))))), 2.0);
	double t_1 = z * (y + x);
	double tmp;
	if (y <= -1.02e+79) {
		tmp = t_0;
	} else if (y <= -6.4e-193) {
		tmp = 2.0 * sqrt(fma(x, y, t_1));
	} else if (y <= 2.2e-267) {
		tmp = t_0;
	} else if (y <= 8.5e-255) {
		tmp = 2.0 * (sqrt(z) * sqrt(y));
	} else if (y <= 1.65e+45) {
		tmp = 2.0 * sqrt(t_1);
	} else {
		tmp = 2.0 * (z * (sqrt(((y + x) / z)) + (0.5 * (y * sqrt((x / pow(z, 3.0)))))));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	t_0 = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))))) ^ 2.0))
	t_1 = Float64(z * Float64(y + x))
	tmp = 0.0
	if (y <= -1.02e+79)
		tmp = t_0;
	elseif (y <= -6.4e-193)
		tmp = Float64(2.0 * sqrt(fma(x, y, t_1)));
	elseif (y <= 2.2e-267)
		tmp = t_0;
	elseif (y <= 8.5e-255)
		tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y)));
	elseif (y <= 1.65e+45)
		tmp = Float64(2.0 * sqrt(t_1));
	else
		tmp = Float64(2.0 * Float64(z * Float64(sqrt(Float64(Float64(y + x) / z)) + Float64(0.5 * Float64(y * sqrt(Float64(x / (z ^ 3.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_] := Block[{t$95$0 = N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.02e+79], t$95$0, If[LessEqual[y, -6.4e-193], N[(2.0 * N[Sqrt[N[(x * y + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.2e-267], t$95$0, If[LessEqual[y, 8.5e-255], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.65e+45], N[(2.0 * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(z * N[(N[Sqrt[N[(N[(y + x), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision] + N[(0.5 * N[(y * N[Sqrt[N[(x / N[Power[z, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 5 regimes

2. if y < -1.02000000000000006e79 or -6.40000000000000011e-193 < y < 2.19999999999999988e-267

   1. Initial program 68.7%

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

      1. +-commutative 68.7%

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

      2. associate-+r+ 68.7%

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

      3. *-commutative 68.7%

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

      4. +-commutative 68.7%

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

      5. associate-+l+ 68.7%

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

      6. *-commutative 68.7%

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

      7. distribute-rgt-in 68.7%

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

   3. Simplified 68.7%

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

      1. +-commutative 68.7%

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

      2. distribute-rgt-in 68.7%

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

      3. associate-+l+ 68.7%

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

      4. +-commutative 68.7%

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

      5. associate-+r+ 68.7%

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

      6. *-commutative 68.7%

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

      7. distribute-lft-in 68.7%

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

      8. fma-undefine 69.1%

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

      9. add-sqr-sqrt 68.6%

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

      10. pow2 68.6%

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

   6. Applied egg-rr 68.6%

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

   7. Taylor expanded in x around -inf 54.2%

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

   if -1.02000000000000006e79 < y < -6.40000000000000011e-193

   1. Initial program 84.2%

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

      1. associate-+l+ 84.2%

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

      2. *-commutative 84.2%

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

      3. *-commutative 84.2%

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

      4. *-commutative 84.2%

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

      5. +-commutative 84.2%

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

      6. +-commutative 84.2%

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

      7. associate-+l+ 84.2%

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

      8. *-commutative 84.2%

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

      9. *-commutative 84.2%

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

      10. +-commutative 84.2%

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

      11. +-commutative 84.2%

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

      12. *-commutative 84.2%

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

      13. *-commutative 84.2%

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

      14. associate-+l+ 84.2%

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

      15. +-commutative 84.2%

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

      16. *-commutative 84.2%

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

      17. fma-define 84.2%

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

   3. Simplified 84.2%

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

   if 2.19999999999999988e-267 < y < 8.49999999999999982e-255

   1. Initial program 100.0%

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

      1. distribute-lft-out 100.0%

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

      2. *-commutative 100.0%

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

   4. Applied egg-rr 100.0%

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

   5. Taylor expanded in x around 0 3.7%

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

      1. *-commutative 3.7%

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

   7. Simplified 3.7%

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

      1. sqrt-prod 3.8%

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

   9. Applied egg-rr 3.8%

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

   if 8.49999999999999982e-255 < y < 1.65e45

   1. Initial program 90.6%

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

      1. +-commutative 90.6%

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

      2. associate-+r+ 90.6%

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

      3. *-commutative 90.6%

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

      4. +-commutative 90.6%

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

      5. associate-+l+ 90.6%

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

      6. *-commutative 90.6%

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

      7. distribute-rgt-in 90.6%

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

   3. Simplified 90.6%

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

   5. Taylor expanded in z around inf 52.3%

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

      1. +-commutative 52.3%

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

   7. Simplified 52.3%

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

   if 1.65e45 < y

   1. Initial program 38.8%

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

      1. +-commutative 38.8%

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

      2. associate-+r+ 38.8%

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

      3. *-commutative 38.8%

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

      4. +-commutative 38.8%

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

      5. associate-+l+ 38.8%

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

      6. *-commutative 38.8%

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

      7. distribute-rgt-in 39.0%

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

   3. Simplified 39.0%

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

   5. Taylor expanded in z around inf 24.6%

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

      1. +-commutative 24.6%

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

      2. *-commutative 24.6%

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

      3. associate-/r* 24.6%

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

      4. +-commutative 24.6%

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

   7. Simplified 24.6%

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

   8. Taylor expanded in y around 0 27.7%

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

4. Final simplification 55.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.02 \cdot 10^{+79}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq -6.4 \cdot 10^{-193}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\ \mathbf{elif}\;y \leq 2.2 \cdot 10^{-267}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-255}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \mathbf{elif}\;y \leq 1.65 \cdot 10^{+45}:\\ \;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(z \cdot \left(\sqrt{\frac{y + x}{z}} + 0.5 \cdot \left(y \cdot \sqrt{\frac{x}{{z}^{3}}}\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 93.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -1.02 \cdot 10^{+79}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(-y\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq 5.1 \cdot 10^{+47}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(z \cdot \left(\sqrt{\frac{y + x}{z}} + 0.5 \cdot \left(y \cdot \sqrt{\frac{x}{{z}^{3}}}\right)\right)\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
 (if (<= y -1.02e+79)
   (* 2.0 (pow (exp (* 0.25 (- (log (- y)) (log (/ -1.0 x))))) 2.0))
   (if (<= y 5.1e+47)
     (* 2.0 (sqrt (fma x y (* z (+ y x)))))
     (*
      2.0
      (* z (+ (sqrt (/ (+ y x) z)) (* 0.5 (* y (sqrt (/ x (pow z 3.0)))))))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.02e+79) {
		tmp = 2.0 * pow(exp((0.25 * (log(-y) - log((-1.0 / x))))), 2.0);
	} else if (y <= 5.1e+47) {
		tmp = 2.0 * sqrt(fma(x, y, (z * (y + x))));
	} else {
		tmp = 2.0 * (z * (sqrt(((y + x) / z)) + (0.5 * (y * sqrt((x / pow(z, 3.0)))))));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -1.02e+79)
		tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(-y)) - log(Float64(-1.0 / x))))) ^ 2.0));
	elseif (y <= 5.1e+47)
		tmp = Float64(2.0 * sqrt(fma(x, y, Float64(z * Float64(y + x)))));
	else
		tmp = Float64(2.0 * Float64(z * Float64(sqrt(Float64(Float64(y + x) / z)) + Float64(0.5 * Float64(y * sqrt(Float64(x / (z ^ 3.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, -1.02e+79], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[(-y)], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 5.1e+47], N[(2.0 * N[Sqrt[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(z * N[(N[Sqrt[N[(N[(y + x), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision] + N[(0.5 * N[(y * N[Sqrt[N[(x / N[Power[z, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.02000000000000006e79

   1. Initial program 59.4%

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

      1. +-commutative 59.4%

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

      2. associate-+r+ 59.4%

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

      3. *-commutative 59.4%

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

      4. +-commutative 59.4%

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

      5. associate-+l+ 59.4%

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

      6. *-commutative 59.4%

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

      7. distribute-rgt-in 59.4%

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

   3. Simplified 59.4%

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

   5. Taylor expanded in z around 0 37.9%

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

      1. *-commutative 37.9%

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

   7. Simplified 37.9%

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

      1. add-sqr-sqrt 37.7%

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

      2. pow2 37.7%

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

      3. pow1/2 37.7%

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

      4. sqrt-pow1 37.7%

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

      5. metadata-eval 37.7%

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

   9. Applied egg-rr 37.7%

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

   10. Taylor expanded in x around -inf 58.2%

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

   if -1.02000000000000006e79 < y < 5.1000000000000001e47

   1. Initial program 86.4%

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

      1. associate-+l+ 86.4%

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

      2. *-commutative 86.4%

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

      3. *-commutative 86.4%

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

      4. *-commutative 86.4%

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

      5. +-commutative 86.4%

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

      6. +-commutative 86.4%

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

      7. associate-+l+ 86.4%

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

      8. *-commutative 86.4%

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

      9. *-commutative 86.4%

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

      10. +-commutative 86.4%

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

      11. +-commutative 86.4%

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

      12. *-commutative 86.4%

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

      13. *-commutative 86.4%

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

      14. associate-+l+ 86.4%

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

      15. +-commutative 86.4%

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

      16. *-commutative 86.4%

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

      17. fma-define 86.4%

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

   3. Simplified 86.4%

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

   if 5.1000000000000001e47 < y

   1. Initial program 38.8%

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

      1. +-commutative 38.8%

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

      2. associate-+r+ 38.8%

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

      3. *-commutative 38.8%

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

      4. +-commutative 38.8%

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

      5. associate-+l+ 38.8%

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

      6. *-commutative 38.8%

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

      7. distribute-rgt-in 39.0%

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

   3. Simplified 39.0%

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

   5. Taylor expanded in z around inf 24.6%

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

      1. +-commutative 24.6%

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

      2. *-commutative 24.6%

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

      3. associate-/r* 24.6%

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

      4. +-commutative 24.6%

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

   7. Simplified 24.6%

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

   8. Taylor expanded in y around 0 27.7%

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

4. Final simplification 69.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.02 \cdot 10^{+79}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(-y\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq 5.1 \cdot 10^{+47}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, y, z \cdot \left(y + x\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(z \cdot \left(\sqrt{\frac{y + x}{z}} + 0.5 \cdot \left(y \cdot \sqrt{\frac{x}{{z}^{3}}}\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 83.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 3.7 \cdot 10^{+46}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(z + x\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(z \cdot \left(\sqrt{\frac{y + x}{z}} + 0.5 \cdot \left(y \cdot \sqrt{\frac{x}{{z}^{3}}}\right)\right)\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
 (if (<= y 3.7e+46)
   (* 2.0 (sqrt (fma x z (* y (+ z x)))))
   (*
    2.0
    (* z (+ (sqrt (/ (+ y x) z)) (* 0.5 (* y (sqrt (/ x (pow z 3.0))))))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= 3.7e+46) {
		tmp = 2.0 * sqrt(fma(x, z, (y * (z + x))));
	} else {
		tmp = 2.0 * (z * (sqrt(((y + x) / z)) + (0.5 * (y * sqrt((x / pow(z, 3.0)))))));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= 3.7e+46)
		tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(z + x)))));
	else
		tmp = Float64(2.0 * Float64(z * Float64(sqrt(Float64(Float64(y + x) / z)) + Float64(0.5 * Float64(y * sqrt(Float64(x / (z ^ 3.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, 3.7e+46], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(z * N[(N[Sqrt[N[(N[(y + x), $MachinePrecision] / z), $MachinePrecision]], $MachinePrecision] + N[(0.5 * N[(y * N[Sqrt[N[(x / N[Power[z, 3.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 3.6999999999999999e46

   1. Initial program 81.0%

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

      1. associate-+l+ 81.0%

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

      2. *-commutative 81.0%

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

      3. *-commutative 81.0%

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

      4. *-commutative 81.0%

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

      5. +-commutative 81.0%

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

      6. +-commutative 81.0%

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

      7. +-commutative 81.0%

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

      8. *-commutative 81.0%

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

      9. *-commutative 81.0%

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

      10. associate-+l+ 81.0%

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

      11. +-commutative 81.0%

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

      12. fma-define 81.1%

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

      13. distribute-lft-out 81.2%

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

   3. Simplified 81.2%

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

   if 3.6999999999999999e46 < y

   1. Initial program 38.8%

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

      1. +-commutative 38.8%

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

      2. associate-+r+ 38.8%

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

      3. *-commutative 38.8%

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

      4. +-commutative 38.8%

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

      5. associate-+l+ 38.8%

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

      6. *-commutative 38.8%

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

      7. distribute-rgt-in 39.0%

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

   3. Simplified 39.0%

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

   5. Taylor expanded in z around inf 24.6%

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

      1. +-commutative 24.6%

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

      2. *-commutative 24.6%

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

      3. associate-/r* 24.6%

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

      4. +-commutative 24.6%

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

   7. Simplified 24.6%

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

   8. Taylor expanded in y around 0 27.7%

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

4. Final simplification 69.7%

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

Alternative 5: 83.3% accurate, 0.5× speedup

Math

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if y < 1.75e20

   1. Initial program 80.7%

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

      1. associate-+l+ 80.7%

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

      2. *-commutative 80.7%

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

      3. *-commutative 80.7%

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

      4. *-commutative 80.7%

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

      5. +-commutative 80.7%

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

      6. +-commutative 80.7%

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

      7. +-commutative 80.7%

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

      8. *-commutative 80.7%

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

      9. *-commutative 80.7%

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

      10. associate-+l+ 80.7%

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

      11. +-commutative 80.7%

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

      12. fma-define 80.7%

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

      13. distribute-lft-out 80.8%

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

   3. Simplified 80.8%

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

   if 1.75e20 < y

   1. Initial program 42.9%

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

      1. distribute-lft-out 42.9%

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

      2. *-commutative 42.9%

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

   4. Applied egg-rr 42.9%

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

   5. Taylor expanded in x around 0 11.5%

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

      1. *-commutative 11.5%

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

   7. Simplified 11.5%

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

      1. sqrt-prod 34.4%

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

   9. Applied egg-rr 34.4%

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

4. Final simplification 70.1%

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

Alternative 6: 83.2% accurate, 0.5× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if y < 4.2000000000000003e23

   1. Initial program 80.8%

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

      1. distribute-lft-out 80.8%

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

      2. *-commutative 80.8%

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

   4. Applied egg-rr 80.8%

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

   if 4.2000000000000003e23 < y

   1. Initial program 41.9%

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

      1. distribute-lft-out 41.9%

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

      2. *-commutative 41.9%

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

   4. Applied egg-rr 41.9%

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

   5. Taylor expanded in x around 0 11.7%

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

      1. *-commutative 11.7%

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

   7. Simplified 11.7%

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

      1. sqrt-prod 35.0%

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

   9. Applied egg-rr 35.0%

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

4. Final simplification 70.4%

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

Alternative 7: 69.1% accurate, 1.0× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if y < 3.30000000000000004e-267

   1. Initial program 76.2%

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

      1. +-commutative 76.2%

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

      2. associate-+r+ 76.2%

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

      3. *-commutative 76.2%

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

      4. +-commutative 76.2%

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

      5. associate-+l+ 76.2%

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

      6. *-commutative 76.2%

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

      7. distribute-rgt-in 76.2%

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

   3. Simplified 76.2%

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

   5. Taylor expanded in x around inf 56.8%

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

   if 3.30000000000000004e-267 < y

   1. Initial program 67.1%

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

      1. +-commutative 67.1%

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

      2. associate-+r+ 67.1%

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

      3. *-commutative 67.1%

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

      4. +-commutative 67.1%

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

      5. associate-+l+ 67.1%

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

      6. *-commutative 67.1%

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

      7. distribute-rgt-in 67.2%

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

   3. Simplified 67.2%

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

   5. Taylor expanded in x around 0 15.4%

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

4. Final simplification 37.4%

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

Alternative 8: 70.2% accurate, 1.0× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if y < -1.99999999999999997e-261

   1. Initial program 75.8%

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

      1. +-commutative 75.8%

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

      2. associate-+r+ 75.8%

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

      3. *-commutative 75.8%

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

      4. +-commutative 75.8%

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

      5. associate-+l+ 75.8%

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

      6. *-commutative 75.8%

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

      7. distribute-rgt-in 75.8%

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

   3. Simplified 75.8%

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

   5. Taylor expanded in x around inf 54.2%

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

   if -1.99999999999999997e-261 < y

   1. Initial program 68.5%

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

      1. +-commutative 68.5%

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

      2. associate-+r+ 68.5%

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

      3. *-commutative 68.5%

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

      4. +-commutative 68.5%

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

      5. associate-+l+ 68.5%

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

      6. *-commutative 68.5%

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

      7. distribute-rgt-in 68.6%

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

   3. Simplified 68.6%

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

   5. Taylor expanded in z around inf 39.6%

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

      1. +-commutative 39.6%

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

   7. Simplified 39.6%

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

4. Final simplification 46.6%

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

Alternative 9: 70.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ 2 \cdot \sqrt{z \cdot \left(y + x\right) + 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 (+ (* z (+ y x)) (* y x)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return 2.0 * sqrt(((z * (y + x)) + (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(((z * (y + x)) + (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(((z * (y + x)) + (y * x)));
}

Python

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

Julia

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

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
	tmp = 2.0 * sqrt(((z * (y + x)) + (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[(N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision] + N[(y * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 72.0%

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

   1. +-commutative 72.0%

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

   2. associate-+r+ 72.0%

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

   3. *-commutative 72.0%

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

   4. +-commutative 72.0%

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

   5. associate-+l+ 72.0%

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

   6. *-commutative 72.0%

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

   7. distribute-rgt-in 72.0%

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

3. Simplified 72.0%

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

5. Final simplification 72.0%

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

Alternative 10: 67.8% accurate, 1.0× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if y < 2.4e-262

   1. Initial program 76.2%

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

      1. +-commutative 76.2%

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

      2. associate-+r+ 76.2%

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

      3. *-commutative 76.2%

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

      4. +-commutative 76.2%

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

      5. associate-+l+ 76.2%

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

      6. *-commutative 76.2%

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

      7. distribute-rgt-in 76.2%

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

   3. Simplified 76.2%

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

   5. Taylor expanded in z around 0 32.5%

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

      1. *-commutative 32.5%

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

   7. Simplified 32.5%

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

   if 2.4e-262 < y

   1. Initial program 67.1%

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

      1. +-commutative 67.1%

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

      2. associate-+r+ 67.1%

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

      3. *-commutative 67.1%

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

      4. +-commutative 67.1%

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

      5. associate-+l+ 67.1%

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

      6. *-commutative 67.1%

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

      7. distribute-rgt-in 67.2%

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

   3. Simplified 67.2%

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

   5. Taylor expanded in x around 0 15.4%

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

4. Final simplification 24.5%

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

Alternative 11: 34.8% accurate, 1.1× 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 72.0%

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

   1. +-commutative 72.0%

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

   2. associate-+r+ 72.0%

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

   3. *-commutative 72.0%

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

   4. +-commutative 72.0%

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

   5. associate-+l+ 72.0%

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

   6. *-commutative 72.0%

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

   7. distribute-rgt-in 72.0%

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

3. Simplified 72.0%

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

5. Taylor expanded in z around 0 33.8%

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

   1. *-commutative 33.8%

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

7. Simplified 33.8%

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

8. Final simplification 33.8%

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

Developer target: 82.8% accurate, 0.1× 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 2024060 
(FPCore (x y z)
  :name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
  :precision binary64

  :alt
  (if (< z 7.636950090573675e+176) (* 2.0 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25))) (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25)))) 2.0))

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