Linear.Quaternion:$c/ from linear-1.19.1.3, A

Percentage Accurate: 98.5% → 99.8%

Time: 8.5s

Alternatives: 8

Speedup: 0.7×

• 35.7% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (((x * y) + (z * z)) + (z * z)) + (z * 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 = (((x * y) + (z * z)) + (z * z)) + (z * z)
end function

Java

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

Python

def code(x, y, z):
	return (((x * y) + (z * z)) + (z * z)) + (z * z)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (((x * y) + (z * z)) + (z * z)) + (z * 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 = (((x * y) + (z * z)) + (z * z)) + (z * z)
end function

Java

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

Python

def code(x, y, z):
	return (((x * y) + (z * z)) + (z * z)) + (z * z)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 0.7× speedup

Math

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

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y 5e-27)
   (+ (* z z) (+ (* z z) (+ (* z z) (* x y))))
   (* y (+ x (* 3.0 (* z (/ z y)))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= 5e-27) {
		tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
	} else {
		tmp = y * (x + (3.0 * (z * (z / y))));
	}
	return tmp;
}

Fortran

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

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (y <= 5e-27) {
		tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
	} else {
		tmp = y * (x + (3.0 * (z * (z / y))));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= 5e-27:
		tmp = (z * z) + ((z * z) + ((z * z) + (x * y)))
	else:
		tmp = y * (x + (3.0 * (z * (z / y))))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= 5e-27)
		tmp = Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(x * y))));
	else
		tmp = Float64(y * Float64(x + Float64(3.0 * Float64(z * Float64(z / y)))));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= 5e-27)
		tmp = (z * z) + ((z * z) + ((z * z) + (x * y)));
	else
		tmp = y * (x + (3.0 * (z * (z / y))));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 5.0000000000000002e-27

   1. Initial program 98.7%

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

   if 5.0000000000000002e-27 < y

   1. Initial program 94.4%

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

   3. Taylor expanded in y around inf 98.5%

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

   5. Simplified 98.5%

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

      1. unpow2 98.5%

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

      2. associate-/l* 100.0%

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

   7. Applied egg-rr 100.0%

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

4. Final simplification 99.1%

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

Alternative 2: 99.5% accurate, 0.1× speedup

Math

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.5%

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

   1. +-commutative 97.5%

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

   2. fma-define 97.6%

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

   3. associate-+l+ 97.6%

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

   4. fma-define 99.5%

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

   5. count-2 99.5%

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

3. Simplified 99.5%

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

Alternative 3: 99.5% accurate, 0.1× speedup

Math

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.5%

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

   1. associate-+l+ 97.5%

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

   2. associate-+l+ 97.5%

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

   3. fma-define 99.5%

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

   4. associate-+r+ 99.5%

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

   5. distribute-lft-out 99.5%

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

   6. distribute-lft-out 99.5%

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

   7. remove-double-neg 99.5%

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

   8. unsub-neg 99.5%

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

   9. count-2 99.5%

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

   10. neg-mul-1 99.5%

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

   11. distribute-rgt-out-- 99.5%

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

   12. metadata-eval 99.5%

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

3. Simplified 99.5%

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

Alternative 4: 97.3% accurate, 0.9× speedup

Math

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

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y 8e-168)
   (* x (+ y (* 3.0 (/ (* z z) x))))
   (* y (+ x (* 3.0 (* z (/ z y)))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= 8e-168) {
		tmp = x * (y + (3.0 * ((z * z) / x)));
	} else {
		tmp = y * (x + (3.0 * (z * (z / y))));
	}
	return tmp;
}

Fortran

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

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (y <= 8e-168) {
		tmp = x * (y + (3.0 * ((z * z) / x)));
	} else {
		tmp = y * (x + (3.0 * (z * (z / y))));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= 8e-168:
		tmp = x * (y + (3.0 * ((z * z) / x)))
	else:
		tmp = y * (x + (3.0 * (z * (z / y))))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= 8e-168)
		tmp = Float64(x * Float64(y + Float64(3.0 * Float64(Float64(z * z) / x))));
	else
		tmp = Float64(y * Float64(x + Float64(3.0 * Float64(z * Float64(z / y)))));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= 8e-168)
		tmp = x * (y + (3.0 * ((z * z) / x)));
	else
		tmp = y * (x + (3.0 * (z * (z / y))));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 8.0000000000000004e-168

   1. Initial program 98.5%

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

   3. Taylor expanded in x around inf 94.3%

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

   5. Simplified 94.3%

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

      1. unpow2 94.3%

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

      2. associate-/l* 94.3%

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

   7. Applied egg-rr 94.3%

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

      1. *-commutative 94.3%

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

      2. frac-2neg 94.3%

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

      3. associate-*l/ 94.3%

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

   9. Applied egg-rr 94.3%

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

   if 8.0000000000000004e-168 < y

   1. Initial program 96.1%

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

   3. Taylor expanded in y around inf 96.3%

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

   5. Simplified 96.3%

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

      1. unpow2 96.3%

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

      2. associate-/l* 97.3%

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

   7. Applied egg-rr 97.3%

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

4. Final simplification 95.5%

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

Alternative 5: 97.3% accurate, 0.9× speedup

Math

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

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y 8.5e-168)
   (* x (+ y (* 3.0 (* z (/ z x)))))
   (* y (+ x (* 3.0 (* z (/ z y)))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= 8.5e-168) {
		tmp = x * (y + (3.0 * (z * (z / x))));
	} else {
		tmp = y * (x + (3.0 * (z * (z / y))));
	}
	return tmp;
}

Fortran

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

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (y <= 8.5e-168) {
		tmp = x * (y + (3.0 * (z * (z / x))));
	} else {
		tmp = y * (x + (3.0 * (z * (z / y))));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= 8.5e-168:
		tmp = x * (y + (3.0 * (z * (z / x))))
	else:
		tmp = y * (x + (3.0 * (z * (z / y))))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= 8.5e-168)
		tmp = Float64(x * Float64(y + Float64(3.0 * Float64(z * Float64(z / x)))));
	else
		tmp = Float64(y * Float64(x + Float64(3.0 * Float64(z * Float64(z / y)))));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= 8.5e-168)
		tmp = x * (y + (3.0 * (z * (z / x))));
	else
		tmp = y * (x + (3.0 * (z * (z / y))));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 8.4999999999999994e-168

   1. Initial program 98.5%

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

   3. Taylor expanded in x around inf 94.3%

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

   5. Simplified 94.3%

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

      1. unpow2 94.3%

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

      2. associate-/l* 94.3%

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

   7. Applied egg-rr 94.3%

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

   if 8.4999999999999994e-168 < y

   1. Initial program 96.1%

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

   3. Taylor expanded in y around inf 96.3%

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

   5. Simplified 96.3%

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

      1. unpow2 96.3%

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

      2. associate-/l* 97.3%

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

   7. Applied egg-rr 97.3%

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

4. Final simplification 95.5%

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

Alternative 6: 93.9% accurate, 1.4× speedup

Math

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

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return x * (y + (3.0 * (z * (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 = x * (y + (3.0d0 * (z * (z / x))))
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	return x * (y + (3.0 * (z * (z / x))));
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	return x * (y + (3.0 * (z * (z / x))))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.5%

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

3. Taylor expanded in x around inf 92.9%

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

5. Simplified 92.9%

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

   1. unpow2 92.9%

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

   2. associate-/l* 93.4%

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

7. Applied egg-rr 93.4%

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

8. Final simplification 93.4%

   \[\leadsto x \cdot \left(y + 3 \cdot \left(z \cdot \frac{z}{x}\right)\right) \]
9. Add Preprocessing

Alternative 7: 77.7% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

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 = (z * z) + (x * y)
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	return (z * z) + (x * y);
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.5%

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

3. Taylor expanded in x around inf 77.0%

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

4. Taylor expanded in x around inf 76.4%

   \[\leadsto \color{blue}{x \cdot y} + z \cdot z \]

5. Final simplification 76.4%

   \[\leadsto z \cdot z + x \cdot y \]
6. Add Preprocessing

Alternative 8: 52.8% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

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 = x * y
end function

Java

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

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	return x * y

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.5%

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

3. Taylor expanded in y around inf 93.3%

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

5. Simplified 93.3%

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

6. Taylor expanded in x around inf 48.4%

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

7. Final simplification 48.4%

   \[\leadsto x \cdot y \]
8. Add Preprocessing

Developer target: 98.5% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (+ (* (* 3.0 z) z) (* y x)))

C

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

Fortran

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

Java

public static double code(double x, double y, double z) {
	return ((3.0 * z) * z) + (y * x);
}

Python

def code(x, y, z):
	return ((3.0 * z) * z) + (y * x)

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024087 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, A"
  :precision binary64

  :alt
  (+ (* (* 3.0 z) z) (* y x))

  (+ (+ (+ (* x y) (* z z)) (* z z)) (* z z)))