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

Percentage Accurate: 98.3% → 98.8%

Time: 5.6s

Alternatives: 7

Speedup: 1.1×

• 34.8% 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.3% 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: 98.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot x \leq -\infty:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;z \cdot z + \left(z \cdot z + \left(y \cdot x + z \cdot z\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* y x) (- INFINITY))
   (* y x)
   (+ (* z z) (+ (* z z) (+ (* y x) (* z z))))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y * x) <= -((double) INFINITY)) {
		tmp = y * x;
	} else {
		tmp = (z * z) + ((z * z) + ((y * x) + (z * z)));
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y * x) <= -Double.POSITIVE_INFINITY) {
		tmp = y * x;
	} else {
		tmp = (z * z) + ((z * z) + ((y * x) + (z * z)));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y * x) <= -math.inf:
		tmp = y * x
	else:
		tmp = (z * z) + ((z * z) + ((y * x) + (z * z)))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(y * x) <= Float64(-Inf))
		tmp = Float64(y * x);
	else
		tmp = Float64(Float64(z * z) + Float64(Float64(z * z) + Float64(Float64(y * x) + Float64(z * z))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y * x) <= -Inf)
		tmp = y * x;
	else
		tmp = (z * z) + ((z * z) + ((y * x) + (z * z)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -inf.0

   1. Initial program 62.5%

      \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

   2. Taylor expanded in x around 0 62.5%

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

      1. unpow2 62.5%

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

      2. +-commutative 62.5%

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

      3. *-commutative 62.5%

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

      4. associate-+r+ 62.5%

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

      5. unpow2 62.5%

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

      6. distribute-rgt1-in 62.5%

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

      7. metadata-eval 62.5%

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

      8. *-commutative 62.5%

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

      9. associate-*r* 62.5%

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

      10. fma-def 87.5%

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

      11. *-commutative 87.5%

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

   4. Simplified 87.5%

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

   5. Taylor expanded in z around 0 87.5%

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

   if -inf.0 < (*.f64 x y)

   1. Initial program 99.9%

      \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot x \leq -\infty:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;z \cdot z + \left(z \cdot z + \left(y \cdot x + z \cdot z\right)\right)\\ \end{array} \]

Alternative 2: 98.9% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_] := N[(z * N[(z * 3.0), $MachinePrecision] + N[(y * x), $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. Taylor expanded in x around 0 97.5%

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

   1. unpow2 97.5%

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

   2. +-commutative 97.5%

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

   3. *-commutative 97.5%

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

   4. associate-+r+ 97.5%

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

   5. unpow2 97.5%

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

   6. distribute-rgt1-in 97.5%

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

   7. metadata-eval 97.5%

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

   8. *-commutative 97.5%

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

   9. associate-*r* 97.5%

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

   10. fma-def 99.1%

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

   11. *-commutative 99.1%

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

4. Simplified 99.1%

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

5. Final simplification 99.1%

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

Alternative 3: 99.4% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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-def 98.3%

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

   4. count-2 98.3%

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

   5. distribute-rgt1-in 98.3%

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

   6. *-commutative 98.3%

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

   7. associate-*l* 98.3%

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

   8. metadata-eval 98.3%

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

3. Simplified 98.3%

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

4. Final simplification 98.3%

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

Alternative 4: 98.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot x \leq -\infty:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x + z \cdot \left(z \cdot 3\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* y x) (- INFINITY)) (* y x) (+ (* y x) (* z (* z 3.0)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y * x) <= -((double) INFINITY)) {
		tmp = y * x;
	} else {
		tmp = (y * x) + (z * (z * 3.0));
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y * x) <= -Double.POSITIVE_INFINITY) {
		tmp = y * x;
	} else {
		tmp = (y * x) + (z * (z * 3.0));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y * x) <= -math.inf:
		tmp = y * x
	else:
		tmp = (y * x) + (z * (z * 3.0))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(y * x) <= Float64(-Inf))
		tmp = Float64(y * x);
	else
		tmp = Float64(Float64(y * x) + Float64(z * Float64(z * 3.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y * x) <= -Inf)
		tmp = y * x;
	else
		tmp = (y * x) + (z * (z * 3.0));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -inf.0

   1. Initial program 62.5%

      \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

   2. Taylor expanded in x around 0 62.5%

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

      1. unpow2 62.5%

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

      2. +-commutative 62.5%

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

      3. *-commutative 62.5%

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

      4. associate-+r+ 62.5%

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

      5. unpow2 62.5%

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

      6. distribute-rgt1-in 62.5%

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

      7. metadata-eval 62.5%

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

      8. *-commutative 62.5%

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

      9. associate-*r* 62.5%

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

      10. fma-def 87.5%

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

      11. *-commutative 87.5%

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

   4. Simplified 87.5%

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

   5. Taylor expanded in z around 0 87.5%

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

   if -inf.0 < (*.f64 x y)

   1. Initial program 99.9%

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

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. fma-def 99.9%

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

      4. count-2 99.9%

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

      5. distribute-rgt1-in 99.9%

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

      6. *-commutative 99.9%

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

      7. associate-*l* 99.8%

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

      8. metadata-eval 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, z \cdot \left(z \cdot 3\right)\right)} \]
   4. Step-by-step derivation

      1. fma-udef 99.8%

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

      2. +-commutative 99.8%

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

   5. Applied egg-rr 99.8%

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

4. Final simplification 99.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot x \leq -\infty:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x + z \cdot \left(z \cdot 3\right)\\ \end{array} \]

Alternative 5: 83.8% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 10^{-73}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;3 \cdot \left(z \cdot z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 1e-73) (* y x) (* 3.0 (* z z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 1e-73) {
		tmp = y * x;
	} else {
		tmp = 3.0 * (z * z);
	}
	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) :: tmp
    if ((z * z) <= 1d-73) then
        tmp = y * x
    else
        tmp = 3.0d0 * (z * z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 1e-73) {
		tmp = y * x;
	} else {
		tmp = 3.0 * (z * z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z * z) <= 1e-73:
		tmp = y * x
	else:
		tmp = 3.0 * (z * z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 1e-73)
		tmp = Float64(y * x);
	else
		tmp = Float64(3.0 * Float64(z * z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z * z) <= 1e-73)
		tmp = y * x;
	else
		tmp = 3.0 * (z * z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(z * z), $MachinePrecision], 1e-73], N[(y * x), $MachinePrecision], N[(3.0 * N[(z * z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 9.99999999999999997e-74

   1. Initial program 99.9%

      \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

   2. Taylor expanded in x around 0 100.0%

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

      1. unpow2 100.0%

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

      2. +-commutative 100.0%

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

      3. *-commutative 100.0%

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

      4. associate-+r+ 100.0%

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

      5. unpow2 100.0%

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

      6. distribute-rgt1-in 100.0%

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

      7. metadata-eval 100.0%

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

      8. *-commutative 100.0%

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

      9. associate-*r* 100.0%

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

      10. fma-def 100.0%

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

      11. *-commutative 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in z around 0 93.4%

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

   if 9.99999999999999997e-74 < (*.f64 z z)

   1. Initial program 95.7%

      \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

   2. Taylor expanded in x around 0 84.8%

      \[\leadsto \color{blue}{2 \cdot {z}^{2}} + z \cdot z \]
   3. Step-by-step derivation

      1. unpow2 84.8%

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

      2. *-commutative 84.8%

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

      3. associate-*l* 84.8%

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

      4. *-commutative 84.8%

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

      5. count-2 84.8%

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

   4. Simplified 84.8%

      \[\leadsto \color{blue}{z \cdot \left(z + z\right)} + z \cdot z \]
   5. Step-by-step derivation

      1. distribute-lft-out 84.8%

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

      2. count-2 84.8%

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

      3. *-un-lft-identity 84.8%

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

      4. distribute-rgt-out 84.8%

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

      5. metadata-eval 84.8%

         \[\leadsto z \cdot \left(z \cdot \color{blue}{3}\right) \]

      6. associate-*r* 84.8%

         \[\leadsto \color{blue}{\left(z \cdot z\right) \cdot 3} \]

   6. Applied egg-rr 84.8%

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

4. Final simplification 88.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \cdot z \leq 10^{-73}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;3 \cdot \left(z \cdot z\right)\\ \end{array} \]

Alternative 6: 68.0% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 2.7 \cdot 10^{-36}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(z \cdot 3\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z 2.7e-36) (* y x) (* z (* z 3.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= 2.7e-36) {
		tmp = y * x;
	} else {
		tmp = z * (z * 3.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) :: tmp
    if (z <= 2.7d-36) then
        tmp = y * x
    else
        tmp = z * (z * 3.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= 2.7e-36) {
		tmp = y * x;
	} else {
		tmp = z * (z * 3.0);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= 2.7e-36:
		tmp = y * x
	else:
		tmp = z * (z * 3.0)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= 2.7e-36)
		tmp = Float64(y * x);
	else
		tmp = Float64(z * Float64(z * 3.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= 2.7e-36)
		tmp = y * x;
	else
		tmp = z * (z * 3.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, 2.7e-36], N[(y * x), $MachinePrecision], N[(z * N[(z * 3.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 2.70000000000000007e-36

   1. Initial program 98.3%

      \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

   2. Taylor expanded in x around 0 98.3%

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

      1. unpow2 98.3%

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

      2. +-commutative 98.3%

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

      3. *-commutative 98.3%

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

      4. associate-+r+ 98.3%

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

      5. unpow2 98.3%

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

      6. distribute-rgt1-in 98.3%

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

      7. metadata-eval 98.3%

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

      8. *-commutative 98.3%

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

      9. associate-*r* 98.3%

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

      10. fma-def 99.3%

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

      11. *-commutative 99.3%

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

   4. Simplified 99.3%

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

   5. Taylor expanded in z around 0 61.3%

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

   if 2.70000000000000007e-36 < z

   1. Initial program 95.3%

      \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

   2. Taylor expanded in x around 0 83.5%

      \[\leadsto \color{blue}{{z}^{2} + 2 \cdot {z}^{2}} \]
   3. Step-by-step derivation

      1. unpow2 83.5%

         \[\leadsto \color{blue}{z \cdot z} + 2 \cdot {z}^{2} \]

      2. unpow2 83.5%

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

      3. distribute-rgt1-in 83.5%

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

      4. metadata-eval 83.5%

         \[\leadsto \color{blue}{3} \cdot \left(z \cdot z\right) \]

      5. *-commutative 83.5%

         \[\leadsto \color{blue}{\left(z \cdot z\right) \cdot 3} \]

      6. associate-*r* 83.5%

         \[\leadsto \color{blue}{z \cdot \left(z \cdot 3\right)} \]

   4. Simplified 83.5%

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

4. Final simplification 67.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 2.7 \cdot 10^{-36}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(z \cdot 3\right)\\ \end{array} \]

Alternative 7: 52.0% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ y \cdot x \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.5%

   \[\left(\left(x \cdot y + z \cdot z\right) + z \cdot z\right) + z \cdot z \]

2. Taylor expanded in x around 0 97.5%

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

   1. unpow2 97.5%

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

   2. +-commutative 97.5%

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

   3. *-commutative 97.5%

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

   4. associate-+r+ 97.5%

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

   5. unpow2 97.5%

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

   6. distribute-rgt1-in 97.5%

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

   7. metadata-eval 97.5%

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

   8. *-commutative 97.5%

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

   9. associate-*r* 97.5%

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

   10. fma-def 99.1%

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

   11. *-commutative 99.1%

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

4. Simplified 99.1%

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

5. Taylor expanded in z around 0 50.6%

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

6. Final simplification 50.6%

   \[\leadsto y \cdot x \]

Developer target: 98.4% 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 2023199 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, A"
  :precision binary64

  :herbie-target
  (+ (* (* 3.0 z) z) (* y x))

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