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

Percentage Accurate: 70.4% → 96.6%

Time: 10.4s

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

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := 2 \cdot e^{\left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\ \mathbf{if}\;y \leq -7.2 \cdot 10^{+40}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq -4.3 \cdot 10^{-184}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot \left(z + x\right) + z \cdot x}\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-304}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{y + x} \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
 (let* ((t_0 (* 2.0 (exp (* (- (log (- (- y) z)) (log (/ -1.0 x))) 0.5)))))
   (if (<= y -7.2e+40)
     t_0
     (if (<= y -4.3e-184)
       (* 2.0 (sqrt (+ (* y (+ z x)) (* z x))))
       (if (<= y 8.5e-304) t_0 (* 2.0 (* (sqrt (+ y x)) (sqrt z))))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double t_0 = 2.0 * exp(((log((-y - z)) - log((-1.0 / x))) * 0.5));
	double tmp;
	if (y <= -7.2e+40) {
		tmp = t_0;
	} else if (y <= -4.3e-184) {
		tmp = 2.0 * sqrt(((y * (z + x)) + (z * x)));
	} else if (y <= 8.5e-304) {
		tmp = t_0;
	} else {
		tmp = 2.0 * (sqrt((y + x)) * sqrt(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) :: t_0
    real(8) :: tmp
    t_0 = 2.0d0 * exp(((log((-y - z)) - log(((-1.0d0) / x))) * 0.5d0))
    if (y <= (-7.2d+40)) then
        tmp = t_0
    else if (y <= (-4.3d-184)) then
        tmp = 2.0d0 * sqrt(((y * (z + x)) + (z * x)))
    else if (y <= 8.5d-304) then
        tmp = t_0
    else
        tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double t_0 = 2.0 * Math.exp(((Math.log((-y - z)) - Math.log((-1.0 / x))) * 0.5));
	double tmp;
	if (y <= -7.2e+40) {
		tmp = t_0;
	} else if (y <= -4.3e-184) {
		tmp = 2.0 * Math.sqrt(((y * (z + x)) + (z * x)));
	} else if (y <= 8.5e-304) {
		tmp = t_0;
	} else {
		tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	t_0 = 2.0 * math.exp(((math.log((-y - z)) - math.log((-1.0 / x))) * 0.5))
	tmp = 0
	if y <= -7.2e+40:
		tmp = t_0
	elif y <= -4.3e-184:
		tmp = 2.0 * math.sqrt(((y * (z + x)) + (z * x)))
	elif y <= 8.5e-304:
		tmp = t_0
	else:
		tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	t_0 = Float64(2.0 * exp(Float64(Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))) * 0.5)))
	tmp = 0.0
	if (y <= -7.2e+40)
		tmp = t_0;
	elseif (y <= -4.3e-184)
		tmp = Float64(2.0 * sqrt(Float64(Float64(y * Float64(z + x)) + Float64(z * x))));
	elseif (y <= 8.5e-304)
		tmp = t_0;
	else
		tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z)));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	t_0 = 2.0 * exp(((log((-y - z)) - log((-1.0 / x))) * 0.5));
	tmp = 0.0;
	if (y <= -7.2e+40)
		tmp = t_0;
	elseif (y <= -4.3e-184)
		tmp = 2.0 * sqrt(((y * (z + x)) + (z * x)));
	elseif (y <= 8.5e-304)
		tmp = t_0;
	else
		tmp = 2.0 * (sqrt((y + x)) * sqrt(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_] := Block[{t$95$0 = N[(2.0 * N[Exp[N[(N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -7.2e+40], t$95$0, If[LessEqual[y, -4.3e-184], N[(2.0 * N[Sqrt[N[(N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision] + N[(z * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 8.5e-304], t$95$0, N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -7.19999999999999993e40 or -4.30000000000000007e-184 < y < 8.5e-304

   1. Initial program 67.2%

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

      1. +-commutative 67.2%

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

      2. associate-+r+ 67.2%

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

      3. *-commutative 67.2%

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

      4. distribute-lft-in 67.1%

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

      5. fma-undefine 67.2%

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

      6. pow1/2 67.4%

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

      7. pow-to-exp 62.6%

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

      8. fma-undefine 62.5%

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

      9. distribute-lft-in 62.5%

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

      10. *-commutative 62.5%

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

      11. associate-+r+ 62.5%

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

      12. +-commutative 62.5%

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

      13. associate-+l+ 62.5%

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

      14. fma-define 62.5%

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

      15. distribute-rgt-out 62.7%

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

   4. Applied egg-rr 62.7%

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

   5. Taylor expanded in x around -inf 47.7%

      \[\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} \]
   6. Step-by-step derivation

      1. mul-1-neg 47.7%

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

         \[\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. neg-mul-1 47.7%

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

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

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

   7. Simplified 47.7%

      \[\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 -7.19999999999999993e40 < y < -4.30000000000000007e-184

   1. Initial program 91.9%

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

      1. +-commutative 91.9%

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

      2. associate-+r+ 91.9%

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

      3. *-commutative 91.9%

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

      4. distribute-lft-in 91.9%

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

      5. +-commutative 91.9%

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

   4. Applied egg-rr 91.9%

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

   if 8.5e-304 < y

   1. Initial program 75.3%

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

   3. Taylor expanded in z around inf 42.6%

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

      1. +-commutative 42.6%

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

   5. Simplified 42.6%

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

      1. +-commutative 42.6%

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

      2. *-commutative 42.6%

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

      3. sqrt-prod 42.6%

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

      4. +-commutative 42.6%

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

   7. Applied egg-rr 42.6%

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

4. Final simplification 53.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -7.2 \cdot 10^{+40}:\\ \;\;\;\;2 \cdot e^{\left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\ \mathbf{elif}\;y \leq -4.3 \cdot 10^{-184}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot \left(z + x\right) + z \cdot x}\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-304}:\\ \;\;\;\;2 \cdot e^{\left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 84.5% accurate, 0.5× speedup

Math

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if y < 4.29999999999999992e-246

   1. Initial program 76.7%

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

      1. associate-+l+ 76.7%

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

      2. *-commutative 76.7%

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

      3. *-commutative 76.7%

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

      4. *-commutative 76.7%

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

      5. +-commutative 76.7%

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

      6. +-commutative 76.7%

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

      7. +-commutative 76.7%

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

      8. *-commutative 76.7%

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

      9. *-commutative 76.7%

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

      10. associate-+l+ 76.7%

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

      11. +-commutative 76.7%

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

      12. fma-define 76.7%

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

      13. distribute-lft-out 76.8%

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

   3. Simplified 76.8%

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

   if 4.29999999999999992e-246 < y

   1. Initial program 74.3%

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

   3. Taylor expanded in z around inf 38.1%

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

      1. +-commutative 38.1%

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

   5. Simplified 38.1%

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

      1. +-commutative 38.1%

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

      2. *-commutative 38.1%

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

      3. sqrt-prod 41.8%

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

      4. +-commutative 41.8%

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

   7. Applied egg-rr 41.8%

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

4. Final simplification 61.3%

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

Alternative 3: 84.7% accurate, 0.5× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if y < 5.4999999999999995e-284

   1. Initial program 76.6%

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

   3. Taylor expanded in x around inf 54.5%

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

   if 5.4999999999999995e-284 < y

   1. Initial program 74.7%

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

   3. Taylor expanded in z around inf 41.2%

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

      1. +-commutative 41.2%

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

   5. Simplified 41.2%

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

      1. +-commutative 41.2%

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

      2. *-commutative 41.2%

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

      3. sqrt-prod 42.8%

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

      4. +-commutative 42.8%

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

   7. Applied egg-rr 42.8%

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

Alternative 4: 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 0.72:\\ \;\;\;\;2 \cdot \sqrt{y \cdot \left(z + x\right) + z \cdot x}\\ \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 0.72)
   (* 2.0 (sqrt (+ (* y (+ z x)) (* 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 <= 0.72) {
		tmp = 2.0 * sqrt(((y * (z + x)) + (z * x)));
	} 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 <= 0.72d0) then
        tmp = 2.0d0 * sqrt(((y * (z + x)) + (z * x)))
    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 <= 0.72) {
		tmp = 2.0 * Math.sqrt(((y * (z + x)) + (z * x)));
	} 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 <= 0.72:
		tmp = 2.0 * math.sqrt(((y * (z + x)) + (z * x)))
	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 <= 0.72)
		tmp = Float64(2.0 * sqrt(Float64(Float64(y * Float64(z + x)) + Float64(z * x))));
	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 <= 0.72)
		tmp = 2.0 * sqrt(((y * (z + x)) + (z * x)));
	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, 0.72], N[(2.0 * N[Sqrt[N[(N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision] + N[(z * x), $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 < 0.71999999999999997

   1. Initial program 77.8%

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

      1. +-commutative 77.8%

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

      2. associate-+r+ 77.8%

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

      3. *-commutative 77.8%

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

      4. distribute-lft-in 77.8%

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

      5. +-commutative 77.8%

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

   4. Applied egg-rr 77.8%

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

   if 0.71999999999999997 < y

   1. Initial program 69.4%

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

      1. +-commutative 69.4%

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

      2. associate-+r+ 69.4%

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

      3. *-commutative 69.4%

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

      4. distribute-lft-in 69.4%

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

      5. +-commutative 69.4%

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

   4. Applied egg-rr 69.4%

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

   5. Taylor expanded in x around 0 27.1%

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

      1. *-commutative 27.1%

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

   7. Simplified 27.1%

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

      1. sqrt-prod 37.4%

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

   9. Applied egg-rr 37.4%

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

4. Final simplification 67.5%

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

Alternative 5: 70.6% 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^{-305}:\\ \;\;\;\;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-305) (* 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-305) {
		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-305)) 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-305) {
		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-305:
		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-305)
		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-305)
		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-305], 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.99999999999999996e-306

   1. Initial program 76.2%

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

   3. Taylor expanded in x around inf 53.7%

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

   if -9.99999999999999996e-306 < y

   1. Initial program 75.1%

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

   3. Taylor expanded in z around inf 43.2%

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

      1. +-commutative 43.2%

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

   5. Simplified 43.2%

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

Alternative 6: 69.5% accurate, 1.0× speedup

Math

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

   1. Initial program 76.6%

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

   3. Taylor expanded in x around inf 54.5%

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

   if 4.0000000000000001e-282 < y

   1. Initial program 74.7%

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

   3. Taylor expanded in x around 0 24.3%

      \[\leadsto 2 \cdot \color{blue}{\sqrt{y \cdot z}} \]
3. Recombined 2 regimes into one program.
4. 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 \left(z + x\right) + z \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 (+ z x)) (* z x)))))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 75.7%

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

   1. +-commutative 75.7%

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

   2. associate-+r+ 75.7%

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

   3. *-commutative 75.7%

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

   4. distribute-lft-in 75.7%

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

   5. +-commutative 75.7%

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

4. Applied egg-rr 75.7%

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

5. Final simplification 75.7%

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

Alternative 8: 68.3% accurate, 1.0× speedup

Math

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

   1. Initial program 76.4%

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

   3. Taylor expanded in z around 0 27.9%

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

      1. *-commutative 27.9%

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

   5. Simplified 27.9%

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

   if -4.999999999999985e-310 < y

   1. Initial program 74.9%

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

   3. Taylor expanded in x around 0 23.4%

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

Alternative 9: 36.3% 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 75.7%

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

3. Taylor expanded in z around 0 31.2%

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

   1. *-commutative 31.2%

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

5. Simplified 31.2%

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

Developer target: 82.9% 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 2024096 
(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)))))