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

Percentage Accurate: 98.3% → 99.4%

Time: 6.3s

Alternatives: 10

Speedup: 1.8×

• 34.5% 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: 99.4% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.4%

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

   1. associate-+l+ N/A

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

   2. +-commutative N/A

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

   3. count-2 N/A

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

   4. associate-*r* N/A

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

   5. count-2 N/A

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

   6. accelerator-lowering-fma.f64 N/A

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

   7. +-lowering-+.f64 N/A

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

   8. accelerator-lowering-fma.f64 N/A

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

   9. *-lowering-*.f64 99.6

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

4. Applied egg-rr 99.6%

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

Alternative 2: 85.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 4 \cdot 10^{+146}:\\ \;\;\;\;\mathsf{fma}\left(z + z, z, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z + z, z, z \cdot z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 4e+146) (fma (+ z z) z (* x y)) (fma (+ z z) z (* z z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 4e+146) {
		tmp = fma((z + z), z, (x * y));
	} else {
		tmp = fma((z + z), z, (z * z));
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 4e+146)
		tmp = fma(Float64(z + z), z, Float64(x * y));
	else
		tmp = fma(Float64(z + z), z, Float64(z * z));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 3.99999999999999973e146

   1. Initial program 99.9%

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

      1. associate-+l+ N/A

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

      2. +-commutative N/A

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

      3. count-2 N/A

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

      4. associate-*r* N/A

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

      5. count-2 N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. +-lowering-+.f64 N/A

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

      8. accelerator-lowering-fma.f64 N/A

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

      9. *-lowering-*.f64 100.0

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

   4. Applied egg-rr 100.0%

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

   5. Taylor expanded in x around inf

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

      1. *-lowering-*.f64 83.9

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

   7. Simplified 83.9%

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

   if 3.99999999999999973e146 < (*.f64 z z)

   1. Initial program 95.5%

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

      1. associate-+l+ N/A

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

      2. +-commutative N/A

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

      3. count-2 N/A

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

      4. associate-*r* N/A

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

      5. count-2 N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. +-lowering-+.f64 N/A

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

      8. accelerator-lowering-fma.f64 N/A

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

      9. *-lowering-*.f64 98.8

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

   4. Applied egg-rr 98.8%

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

   5. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(z + z, z, \color{blue}{{z}^{2}}\right) \]
   6. Step-by-step derivation

      1. unpow2 N/A

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

      2. *-lowering-*.f64 92.7

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

   7. Simplified 92.7%

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

Alternative 3: 85.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 4 \cdot 10^{+146}:\\ \;\;\;\;\mathsf{fma}\left(z + z, z, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot z\right) \cdot 3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 4e+146) (fma (+ z z) z (* x y)) (* (* z z) 3.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 4e+146) {
		tmp = fma((z + z), z, (x * y));
	} else {
		tmp = (z * z) * 3.0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 4e+146)
		tmp = fma(Float64(z + z), z, Float64(x * y));
	else
		tmp = Float64(Float64(z * z) * 3.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 3.99999999999999973e146

   1. Initial program 99.9%

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

      1. associate-+l+ N/A

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

      2. +-commutative N/A

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

      3. count-2 N/A

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

      4. associate-*r* N/A

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

      5. count-2 N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. +-lowering-+.f64 N/A

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

      8. accelerator-lowering-fma.f64 N/A

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

      9. *-lowering-*.f64 100.0

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

   4. Applied egg-rr 100.0%

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

   5. Taylor expanded in x around inf

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

      1. *-lowering-*.f64 83.9

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

   7. Simplified 83.9%

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

   if 3.99999999999999973e146 < (*.f64 z z)

   1. Initial program 95.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 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 N/A

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

      5. unpow2 N/A

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

      6. *-lowering-*.f64 92.7

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

   5. Simplified 92.7%

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

Alternative 4: 84.9% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 4 \cdot 10^{+146}:\\ \;\;\;\;\mathsf{fma}\left(z, z, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot z\right) \cdot 3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 4e+146) (fma z z (* x y)) (* (* z z) 3.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 4e+146) {
		tmp = fma(z, z, (x * y));
	} else {
		tmp = (z * z) * 3.0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 4e+146)
		tmp = fma(z, z, Float64(x * y));
	else
		tmp = Float64(Float64(z * z) * 3.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 3.99999999999999973e146

   1. Initial program 99.9%

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

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

      1. *-lowering-*.f64 83.4

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

   5. Simplified 83.4%

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

      1. +-commutative N/A

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

      2. accelerator-lowering-fma.f64 N/A

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

      3. *-lowering-*.f64 83.4

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

   7. Applied egg-rr 83.4%

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

   if 3.99999999999999973e146 < (*.f64 z z)

   1. Initial program 95.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 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 N/A

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

      5. unpow2 N/A

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

      6. *-lowering-*.f64 92.7

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

   5. Simplified 92.7%

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

Alternative 5: 83.0% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 4e+146) (* x y) (* (* z z) 3.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 4e+146) {
		tmp = x * y;
	} 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 * z) <= 4d+146) then
        tmp = x * y
    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 * z) <= 4e+146) {
		tmp = x * y;
	} else {
		tmp = (z * z) * 3.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z * z) <= 4e+146:
		tmp = x * y
	else:
		tmp = (z * z) * 3.0
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 3.99999999999999973e146

   1. Initial program 99.9%

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

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

      1. *-lowering-*.f64 80.8

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

   5. Simplified 80.8%

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

   if 3.99999999999999973e146 < (*.f64 z z)

   1. Initial program 95.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 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 N/A

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

      5. unpow2 N/A

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

      6. *-lowering-*.f64 92.7

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

   5. Simplified 92.7%

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

Alternative 6: 83.0% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* z z) 4e+146) (* x y) (* z (* z 3.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z * z) <= 4e+146) {
		tmp = x * y;
	} 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 * z) <= 4d+146) then
        tmp = x * y
    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 * z) <= 4e+146) {
		tmp = x * y;
	} else {
		tmp = z * (z * 3.0);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z * z) <= 4e+146:
		tmp = x * y
	else:
		tmp = z * (z * 3.0)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(z * z) <= 4e+146)
		tmp = Float64(x * y);
	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 * z) <= 4e+146)
		tmp = x * y;
	else
		tmp = z * (z * 3.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 3.99999999999999973e146

   1. Initial program 99.9%

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

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

      1. *-lowering-*.f64 80.8

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

   5. Simplified 80.8%

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

   if 3.99999999999999973e146 < (*.f64 z z)

   1. Initial program 95.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 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 N/A

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

      5. unpow2 N/A

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

      6. *-lowering-*.f64 92.7

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

   5. Simplified 92.7%

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

      1. associate-*l* N/A

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

      2. *-commutative N/A

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

      3. *-lowering-*.f64 N/A

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

      4. *-lowering-*.f64 92.6

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

   7. Applied egg-rr 92.6%

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

4. Final simplification 85.0%

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

Alternative 7: 98.8% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.4%

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

   1. associate-+l+ N/A

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

   2. associate-+l+ N/A

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

   3. +-commutative N/A

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

   4. distribute-lft-out N/A

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

   5. distribute-lft-out N/A

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

   6. accelerator-lowering-fma.f64 N/A

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

   7. +-lowering-+.f64 N/A

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

   8. +-lowering-+.f64 N/A

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

   9. *-lowering-*.f64 98.7

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

4. Applied egg-rr 98.7%

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

5. Final simplification 98.7%

   \[\leadsto \mathsf{fma}\left(z, z + \left(z + z\right), x \cdot y\right) \]
6. Add Preprocessing

Alternative 8: 98.3% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.4%

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

   1. associate-+l+ N/A

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

   2. associate-+l+ N/A

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

   3. +-commutative N/A

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

   4. count-2 N/A

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

   5. distribute-lft1-in N/A

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

   6. metadata-eval N/A

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

   7. accelerator-lowering-fma.f64 N/A

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

   8. *-lowering-*.f64 N/A

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

   9. *-lowering-*.f64 98.4

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

4. Applied egg-rr 98.4%

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

Alternative 9: 63.7% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 2.7 \cdot 10^{+155}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;z \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (if (<= z 2.7e+155) (* x y) (* z z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= 2.7e+155) {
		tmp = x * y;
	} else {
		tmp = 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 <= 2.7d+155) then
        tmp = x * y
    else
        tmp = z * z
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	tmp = 0
	if z <= 2.7e+155:
		tmp = x * y
	else:
		tmp = z * z
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 2.69999999999999994e155

   1. Initial program 98.6%

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

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

      1. *-lowering-*.f64 64.3

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

   5. Simplified 64.3%

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

   if 2.69999999999999994e155 < z

   1. Initial program 96.7%

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

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

      1. *-lowering-*.f64 96.7

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

   5. Simplified 96.7%

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

   6. Taylor expanded in x around 0

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

      1. unpow2 N/A

         \[\leadsto \color{blue}{z \cdot z} \]

      2. *-lowering-*.f64 100.0

         \[\leadsto \color{blue}{z \cdot z} \]

   8. Simplified 100.0%

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

Alternative 10: 52.7% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.4%

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

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

   1. *-lowering-*.f64 57.7

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

5. Simplified 57.7%

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

Developer Target 1: 98.3% accurate, 1.6× 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 2024204 
(FPCore (x y z)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, A"
  :precision binary64

  :alt
  (! :herbie-platform default (+ (* (* 3 z) z) (* y x)))

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