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

Percentage Accurate: 70.4% → 95.9%

Time: 14.8s

Alternatives: 9

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: 95.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -1.6 \cdot 10^{+31}:\\ \;\;\;\;2 \cdot e^{\left(\log \left(\left(-z\right) - y\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\ \mathbf{elif}\;y \leq 7.6 \cdot 10^{-303}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{y + \mathsf{fma}\left(x, \frac{y}{z}, x\right)} \cdot \sqrt{z}\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.6e+31)
   (* 2.0 (exp (* (- (log (- (- z) y)) (log (/ -1.0 x))) 0.5)))
   (if (<= y 7.6e-303)
     (* 2.0 (sqrt (* x (+ y z))))
     (* 2.0 (* (sqrt (+ y (fma x (/ y z) x))) (sqrt z))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.6e+31) {
		tmp = 2.0 * exp(((log((-z - y)) - log((-1.0 / x))) * 0.5));
	} else if (y <= 7.6e-303) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else {
		tmp = 2.0 * (sqrt((y + fma(x, (y / z), x))) * sqrt(z));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -1.6e+31)
		tmp = Float64(2.0 * exp(Float64(Float64(log(Float64(Float64(-z) - y)) - log(Float64(-1.0 / x))) * 0.5)));
	elseif (y <= 7.6e-303)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	else
		tmp = Float64(2.0 * Float64(sqrt(Float64(y + fma(x, Float64(y / z), x))) * sqrt(z)));
	end
	return tmp
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, -1.6e+31], N[(2.0 * N[Exp[N[(N[(N[Log[N[((-z) - y), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 7.6e-303], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(y + N[(x * N[(y / z), $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.6e31

   1. Initial program 59.9%

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

      1. +-commutative 59.9%

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

      2. associate-+r+ 59.9%

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

      3. *-commutative 59.9%

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

      4. +-commutative 59.9%

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

      5. associate-+l+ 59.9%

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

      6. *-commutative 59.9%

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

      7. distribute-rgt-in 60.0%

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

   3. Simplified 60.0%

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

      1. add-sqr-sqrt 0.1%

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

      2. pow2 0.1%

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

      3. +-commutative 0.1%

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

   6. Applied egg-rr 0.1%

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

      1. pow1/2 0.1%

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

      2. pow-to-exp 0.1%

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

      3. +-commutative 0.1%

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

      4. unpow2 0.1%

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

      5. add-sqr-sqrt 55.6%

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

      6. fma-define 55.8%

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

   8. Applied egg-rr 55.8%

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

   9. Taylor expanded in x around -inf 56.9%

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

       1. mul-1-neg 56.9%

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

       2. unsub-neg 56.9%

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

       3. mul-1-neg 56.9%

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

       4. unsub-neg 56.9%

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

       5. mul-1-neg 56.9%

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

   11. Simplified 56.9%

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

   if -1.6e31 < y < 7.60000000000000018e-303

   1. Initial program 81.3%

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

      1. +-commutative 81.3%

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

      2. associate-+r+ 81.3%

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

      3. *-commutative 81.3%

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

      4. +-commutative 81.3%

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

      5. associate-+l+ 81.3%

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

      6. *-commutative 81.3%

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

      7. distribute-rgt-in 81.3%

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

   3. Simplified 81.3%

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

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

      1. +-commutative 65.0%

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

   7. Simplified 65.0%

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

   if 7.60000000000000018e-303 < y

   1. Initial program 67.3%

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

      1. associate-+l+ 67.3%

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

      2. *-commutative 67.3%

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

      3. *-commutative 67.3%

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

      4. *-commutative 67.3%

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

      5. +-commutative 67.3%

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

      6. +-commutative 67.3%

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

      7. associate-+l+ 67.3%

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

      8. *-commutative 67.3%

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

      9. *-commutative 67.3%

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

      10. +-commutative 67.3%

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

      11. +-commutative 67.3%

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

      12. *-commutative 67.3%

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

      13. *-commutative 67.3%

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

      14. associate-+l+ 67.3%

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

      15. +-commutative 67.3%

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

      16. *-commutative 67.3%

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

      17. fma-define 67.3%

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

   3. Simplified 67.6%

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

   5. Taylor expanded in z around inf 61.4%

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

      1. associate-+r+ 61.4%

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

      2. +-commutative 61.4%

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

      3. associate-+l+ 61.4%

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

      4. associate-/l* 59.4%

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

   7. Simplified 59.4%

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

      1. *-commutative 59.4%

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

      2. sqrt-prod 54.0%

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

      3. +-commutative 54.0%

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

      4. fma-define 54.0%

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

   9. Applied egg-rr 54.0%

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

4. Final simplification 57.5%

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

Alternative 2: 84.8% accurate, 0.3× speedup

Math

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

C

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

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	t_0 = Float64(Float64(Float64(y * x) + Float64(z * x)) + Float64(y * z))
	tmp = 0.0
	if ((t_0 <= 2e-311) || !(t_0 <= 1e+295))
		tmp = Float64(2.0 * Float64(sqrt(Float64(y + fma(x, Float64(y / z), x))) * sqrt(z)));
	else
		tmp = Float64(2.0 * sqrt(fma(x, y, Float64(z * Float64(y + 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[(y * x), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, 2e-311], N[Not[LessEqual[t$95$0, 1e+295]], $MachinePrecision]], N[(2.0 * N[(N[Sqrt[N[(y + N[(x * N[(y / z), $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(x * y + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 1.9999999999999e-311 or 9.9999999999999998e294 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z))

   1. Initial program 7.7%

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

      1. associate-+l+ 7.7%

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

      2. *-commutative 7.7%

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

      3. *-commutative 7.7%

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

      4. *-commutative 7.7%

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

      5. +-commutative 7.7%

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

      6. +-commutative 7.7%

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

      7. associate-+l+ 7.7%

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

      8. *-commutative 7.7%

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

      9. *-commutative 7.7%

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

      10. +-commutative 7.7%

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

      11. +-commutative 7.7%

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

      12. *-commutative 7.7%

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

      13. *-commutative 7.7%

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

      14. associate-+l+ 7.7%

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

      15. +-commutative 7.7%

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

      16. *-commutative 7.7%

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

      17. fma-define 7.7%

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

   3. Simplified 8.3%

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

   5. Taylor expanded in z around inf 7.9%

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

      1. associate-+r+ 7.9%

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

      2. +-commutative 7.9%

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

      3. associate-+l+ 7.9%

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

      4. associate-/l* 8.5%

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

   7. Simplified 8.5%

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

      1. *-commutative 8.5%

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

      2. sqrt-prod 42.7%

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

      3. +-commutative 42.7%

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

      4. fma-define 42.7%

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

   9. Applied egg-rr 42.7%

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

   if 1.9999999999999e-311 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 9.9999999999999998e294

   1. Initial program 99.8%

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

      1. associate-+l+ 99.8%

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

      2. *-commutative 99.8%

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

      3. *-commutative 99.8%

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

      4. *-commutative 99.8%

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

      5. +-commutative 99.8%

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

      6. +-commutative 99.8%

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

      7. associate-+l+ 99.8%

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

      8. *-commutative 99.8%

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

      9. *-commutative 99.8%

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

      10. +-commutative 99.8%

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

      11. +-commutative 99.8%

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

      12. *-commutative 99.8%

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

      13. *-commutative 99.8%

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

      14. associate-+l+ 99.8%

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

      15. +-commutative 99.8%

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

      16. *-commutative 99.8%

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

      17. fma-define 99.8%

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

   3. Simplified 99.8%

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

4. Final simplification 80.9%

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

Alternative 3: 83.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 9 \cdot 10^{-18}:\\ \;\;\;\;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 9e-18)
   (* 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 <= 9e-18) {
		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 <= 9e-18)
		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, 9e-18], 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 < 8.99999999999999987e-18

   1. Initial program 74.9%

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

      1. associate-+l+ 74.9%

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

      2. *-commutative 74.9%

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

      3. *-commutative 74.9%

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

      4. *-commutative 74.9%

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

      5. +-commutative 74.9%

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

      6. +-commutative 74.9%

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

      7. +-commutative 74.9%

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

      8. *-commutative 74.9%

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

      9. *-commutative 74.9%

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

      10. associate-+l+ 74.9%

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

      11. +-commutative 74.9%

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

      12. fma-define 74.9%

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

      13. distribute-lft-out 75.0%

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

   3. Simplified 75.0%

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

   if 8.99999999999999987e-18 < y

   1. Initial program 52.2%

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

      1. +-commutative 52.2%

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

      2. associate-+r+ 52.2%

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

      3. *-commutative 52.2%

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

      4. +-commutative 52.2%

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

      5. associate-+l+ 52.2%

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

      6. *-commutative 52.2%

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

      7. distribute-rgt-in 52.2%

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

   3. Simplified 52.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 26.4%

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

      1. *-commutative 26.4%

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

   7. Simplified 26.4%

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

      1. sqrt-prod 48.4%

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

   9. Applied egg-rr 48.4%

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

4. Final simplification 68.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 9 \cdot 10^{-18}:\\ \;\;\;\;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 4: 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 7.6 \cdot 10^{-303}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\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 7.6e-303)
   (* 2.0 (sqrt (* x (+ 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 <= 7.6e-303) {
		tmp = 2.0 * sqrt((x * (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 <= 7.6d-303) then
        tmp = 2.0d0 * sqrt((x * (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 <= 7.6e-303) {
		tmp = 2.0 * Math.sqrt((x * (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 <= 7.6e-303:
		tmp = 2.0 * math.sqrt((x * (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 <= 7.6e-303)
		tmp = Float64(2.0 * sqrt(Float64(x * 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 <= 7.6e-303)
		tmp = 2.0 * sqrt((x * (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, 7.6e-303], N[(2.0 * N[Sqrt[N[(x * 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 < 7.60000000000000018e-303

   1. Initial program 71.1%

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

      1. +-commutative 71.1%

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

      2. associate-+r+ 71.1%

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

      3. *-commutative 71.1%

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

      4. +-commutative 71.1%

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

      5. associate-+l+ 71.1%

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

      6. *-commutative 71.1%

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

      7. distribute-rgt-in 71.2%

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

   3. Simplified 71.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 54.3%

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

      1. +-commutative 54.3%

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

   7. Simplified 54.3%

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

   if 7.60000000000000018e-303 < y

   1. Initial program 67.3%

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

      1. +-commutative 67.3%

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

      2. associate-+r+ 67.3%

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

      3. *-commutative 67.3%

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

      4. +-commutative 67.3%

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

      5. associate-+l+ 67.3%

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

      6. *-commutative 67.3%

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

      7. distribute-rgt-in 67.3%

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

   3. Simplified 67.3%

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

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

      1. *-commutative 24.0%

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

   7. Simplified 24.0%

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

      1. sqrt-prod 36.5%

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

   9. Applied egg-rr 36.5%

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

4. Final simplification 45.3%

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

Alternative 5: 70.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 10^{-302}:\\ \;\;\;\;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 1e-302) (* 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 <= 1e-302) {
		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 <= 1d-302) 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 <= 1e-302) {
		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 <= 1e-302:
		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 <= 1e-302)
		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 <= 1e-302)
		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, 1e-302], 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 < 9.9999999999999996e-303

   1. Initial program 71.1%

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

      1. +-commutative 71.1%

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

      2. associate-+r+ 71.1%

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

      3. *-commutative 71.1%

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

      4. +-commutative 71.1%

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

      5. associate-+l+ 71.1%

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

      6. *-commutative 71.1%

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

      7. distribute-rgt-in 71.2%

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

   3. Simplified 71.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 54.3%

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

      1. +-commutative 54.3%

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

   7. Simplified 54.3%

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

   if 9.9999999999999996e-303 < y

   1. Initial program 67.3%

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

      1. +-commutative 67.3%

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

      2. associate-+r+ 67.3%

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

      3. *-commutative 67.3%

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

      4. +-commutative 67.3%

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

      5. associate-+l+ 67.3%

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

      6. *-commutative 67.3%

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

      7. distribute-rgt-in 67.3%

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

   3. Simplified 67.3%

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

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

4. Final simplification 51.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 10^{-302}:\\ \;\;\;\;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 6: 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 1.2 \cdot 10^{-267}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{y \cdot \left(z \cdot 4\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.2e-267) (* 2.0 (sqrt (* x (+ y z)))) (sqrt (* y (* z 4.0)))))

C

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

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= 1.2d-267) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    else
        tmp = sqrt((y * (z * 4.0d0)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.1999999999999999e-267

   1. Initial program 70.3%

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

      1. +-commutative 70.3%

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

      2. associate-+r+ 70.3%

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

      3. *-commutative 70.3%

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

      4. +-commutative 70.3%

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

      5. associate-+l+ 70.3%

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

      6. *-commutative 70.3%

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

      7. distribute-rgt-in 70.4%

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

   3. Simplified 70.4%

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

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

      1. +-commutative 54.3%

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

   7. Simplified 54.3%

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

   if 1.1999999999999999e-267 < y

   1. Initial program 68.0%

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

      1. +-commutative 68.0%

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

      2. associate-+r+ 68.0%

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

      3. *-commutative 68.0%

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

      4. +-commutative 68.0%

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

      5. associate-+l+ 68.0%

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

      6. *-commutative 68.0%

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

      7. distribute-rgt-in 68.0%

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

   3. Simplified 68.0%

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

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

      1. *-commutative 25.0%

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

   7. Simplified 25.0%

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

      1. add-sqr-sqrt 24.9%

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

      2. sqrt-unprod 25.0%

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

      3. *-commutative 25.0%

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

      4. *-commutative 25.0%

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

      5. swap-sqr 25.0%

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

      6. add-sqr-sqrt 25.0%

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

      7. *-commutative 25.0%

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

      8. metadata-eval 25.0%

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

   9. Applied egg-rr 25.0%

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

       1. associate-*l* 25.1%

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

   11. Simplified 25.1%

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

4. Final simplification 40.1%

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

Alternative 7: 70.4% accurate, 1.0× speedup

Math

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

C

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

Python

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

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * 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) + (z * (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[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 69.2%

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

   1. +-commutative 69.2%

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

   2. associate-+r+ 69.2%

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

   3. *-commutative 69.2%

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

   4. +-commutative 69.2%

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

   5. associate-+l+ 69.2%

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

   6. *-commutative 69.2%

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

   7. distribute-rgt-in 69.2%

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

3. Simplified 69.2%

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

5. Final simplification 69.2%

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

Alternative 8: 68.2% accurate, 1.0× 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}:\\ \;\;\;\;\sqrt{y \cdot \left(z \cdot 4\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 -1e-310) (* 2.0 (sqrt (* y x))) (sqrt (* y (* z 4.0)))))

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 = sqrt((y * (z * 4.0)));
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-1d-310)) then
        tmp = 2.0d0 * sqrt((y * x))
    else
        tmp = sqrt((y * (z * 4.0d0)))
    end if
    code = tmp
end function

Java

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -9.999999999999969e-311

   1. Initial program 70.9%

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

      1. +-commutative 70.9%

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

      2. associate-+r+ 70.9%

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

      3. *-commutative 70.9%

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

      4. +-commutative 70.9%

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

      5. associate-+l+ 70.9%

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

      6. *-commutative 70.9%

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

      7. distribute-rgt-in 70.9%

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

   3. Simplified 70.9%

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

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

   if -9.999999999999969e-311 < y

   1. Initial program 67.6%

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

      1. +-commutative 67.6%

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

      2. associate-+r+ 67.6%

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

      3. *-commutative 67.6%

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

      4. +-commutative 67.6%

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

      5. associate-+l+ 67.6%

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

      6. *-commutative 67.6%

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

      7. distribute-rgt-in 67.6%

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

   3. Simplified 67.6%

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

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

      1. *-commutative 23.8%

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

   7. Simplified 23.8%

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

      1. add-sqr-sqrt 23.6%

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

      2. sqrt-unprod 23.8%

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

      3. *-commutative 23.8%

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

      4. *-commutative 23.8%

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

      5. swap-sqr 23.8%

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

      6. add-sqr-sqrt 23.8%

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

      7. *-commutative 23.8%

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

      8. metadata-eval 23.8%

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

   9. Applied egg-rr 23.8%

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

       1. associate-*l* 23.8%

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

   11. Simplified 23.8%

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

4. Final simplification 28.1%

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

Alternative 9: 35.5% accurate, 1.1× speedup

Math

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 69.2%

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

   1. +-commutative 69.2%

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

   2. associate-+r+ 69.2%

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

   3. *-commutative 69.2%

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

   4. +-commutative 69.2%

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

   5. associate-+l+ 69.2%

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

   6. *-commutative 69.2%

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

   7. distribute-rgt-in 69.2%

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

3. Simplified 69.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 21.8%

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

   1. *-commutative 21.8%

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

7. Simplified 21.8%

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

   1. add-sqr-sqrt 21.6%

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

   2. sqrt-unprod 21.8%

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

   3. *-commutative 21.8%

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

   4. *-commutative 21.8%

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

   5. swap-sqr 21.8%

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

   6. add-sqr-sqrt 21.8%

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

   7. *-commutative 21.8%

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

   8. metadata-eval 21.8%

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

9. Applied egg-rr 21.8%

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

    1. associate-*l* 21.8%

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

11. Simplified 21.8%

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

Developer Target 1: 82.7% 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 2024145 
(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)))))