Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, B

Percentage Accurate: 90.2% → 96.8%

Time: 10.4s

Alternatives: 9

Speedup: 0.9×

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

Specification

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (- (* x x) (* (* y 4.0) (- (* z z) t))))

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * x) - ((y * 4.0d0) * ((z * z) - t))
end function

Java

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

Python

def code(x, y, z, t):
	return (x * x) - ((y * 4.0) * ((z * z) - t))

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(x * x), $MachinePrecision] - N[(N[(y * 4.0), $MachinePrecision] * N[(N[(z * z), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 90.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (- (* x x) (* (* y 4.0) (- (* z z) t))))

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * x) - ((y * 4.0d0) * ((z * z) - t))
end function

Java

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

Python

def code(x, y, z, t):
	return (x * x) - ((y * 4.0) * ((z * z) - t))

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(x * x), $MachinePrecision] - N[(N[(y * 4.0), $MachinePrecision] * N[(N[(z * z), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 96.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (* y 4.0) 5e-52)
   (fma (* (* y -4.0) z) z (fma -4.0 (- (* y t)) (* x x)))
   (fma x x (* y (* -4.0 (fma z z (- t)))))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y * 4.0) <= 5e-52) {
		tmp = fma(((y * -4.0) * z), z, fma(-4.0, -(y * t), (x * x)));
	} else {
		tmp = fma(x, x, (y * (-4.0 * fma(z, z, -t))));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(y * 4.0) <= 5e-52)
		tmp = fma(Float64(Float64(y * -4.0) * z), z, fma(-4.0, Float64(-Float64(y * t)), Float64(x * x)));
	else
		tmp = fma(x, x, Float64(y * Float64(-4.0 * fma(z, z, Float64(-t)))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(y * 4.0), $MachinePrecision], 5e-52], N[(N[(N[(y * -4.0), $MachinePrecision] * z), $MachinePrecision] * z + N[(-4.0 * (-N[(y * t), $MachinePrecision]) + N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * x + N[(y * N[(-4.0 * N[(z * z + (-t)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y #s(literal 4 binary64)) < 5e-52

   1. Initial program 89.1%

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x \cdot x + \left(\mathsf{neg}\left(\left(y \cdot 4\right) \cdot \left(z \cdot z - t\right)\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\left(y \cdot 4\right) \cdot \left(z \cdot z - t\right)\right)\right) + x \cdot x} \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y \cdot 4\right)\right) \cdot \left(z \cdot z - t\right)} + x \cdot x \]

      4. sub-neg N/A

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

      5. distribute-lft-in N/A

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

      6. associate-+l+ N/A

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

      7. associate-*r* N/A

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

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

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

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

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

      10. distribute-rgt-neg-in N/A

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

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

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

      12. metadata-eval N/A

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

      13. *-commutative N/A

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

      14. distribute-lft-neg-in N/A

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

      15. associate-*l* N/A

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

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

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

   4. Applied egg-rr 97.7%

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

   if 5e-52 < (*.f64 y #s(literal 4 binary64))

   1. Initial program 92.5%

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x \cdot x + \left(\mathsf{neg}\left(\left(y \cdot 4\right) \cdot \left(z \cdot z - t\right)\right)\right)} \]

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

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

      3. associate-*l* N/A

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

      4. distribute-rgt-neg-in N/A

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

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

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

      6. *-commutative N/A

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

      7. distribute-rgt-neg-in N/A

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

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

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

      9. sub-neg N/A

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

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

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

      11. neg-lowering-neg.f64 N/A

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

      12. metadata-eval 97.5

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

   4. Applied egg-rr 97.5%

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

4. Final simplification 97.6%

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

Alternative 2: 89.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \cdot z \leq 5 \cdot 10^{+86}:\\ \;\;\;\;\mathsf{fma}\left(y, 4 \cdot t, x \cdot x\right)\\ \mathbf{elif}\;z \cdot z \leq 2 \cdot 10^{+287}:\\ \;\;\;\;\mathsf{fma}\left(y, -4 \cdot \left(z \cdot z\right), x \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \left(z \cdot \left(y \cdot z\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (* z z) 5e+86)
   (fma y (* 4.0 t) (* x x))
   (if (<= (* z z) 2e+287)
     (fma y (* -4.0 (* z z)) (* x x))
     (* -4.0 (* z (* y z))))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z * z) <= 5e+86) {
		tmp = fma(y, (4.0 * t), (x * x));
	} else if ((z * z) <= 2e+287) {
		tmp = fma(y, (-4.0 * (z * z)), (x * x));
	} else {
		tmp = -4.0 * (z * (y * z));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(z * z) <= 5e+86)
		tmp = fma(y, Float64(4.0 * t), Float64(x * x));
	elseif (Float64(z * z) <= 2e+287)
		tmp = fma(y, Float64(-4.0 * Float64(z * z)), Float64(x * x));
	else
		tmp = Float64(-4.0 * Float64(z * Float64(y * z)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(z * z), $MachinePrecision], 5e+86], N[(y * N[(4.0 * t), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(z * z), $MachinePrecision], 2e+287], N[(y * N[(-4.0 * N[(z * z), $MachinePrecision]), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(z * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 z z) < 4.9999999999999998e86

   1. Initial program 97.9%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{{x}^{2} + \left(\mathsf{neg}\left(-4\right)\right) \cdot \left(t \cdot y\right)} \]

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

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

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

      7. *-commutative N/A

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

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

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

      9. unpow2 N/A

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

      10. *-lowering-*.f64 93.5

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

   5. Simplified 93.5%

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

   if 4.9999999999999998e86 < (*.f64 z z) < 2.0000000000000002e287

   1. Initial program 97.3%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. associate-*l* N/A

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

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

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

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

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

      9. unpow2 N/A

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

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

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

      11. unpow2 N/A

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

      12. *-lowering-*.f64 92.4

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

   5. Simplified 92.4%

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

   if 2.0000000000000002e287 < (*.f64 z z)

   1. Initial program 70.4%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

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

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

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

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

      6. unpow2 N/A

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

      7. *-lowering-*.f64 74.6

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

   5. Simplified 74.6%

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

      1. associate-*r* N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*l* N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

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

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

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

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

      10. *-lowering-*.f64 84.9

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

   7. Applied egg-rr 84.9%

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

4. Final simplification 90.9%

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

Alternative 3: 63.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := z \cdot z - t\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{-107}:\\ \;\;\;\;y \cdot \left(4 \cdot t\right)\\ \mathbf{elif}\;t\_1 \leq 10^{+143}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \left(z \cdot \left(y \cdot z\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* z z) t)))
   (if (<= t_1 -2e-107)
     (* y (* 4.0 t))
     (if (<= t_1 1e+143) (* x x) (* -4.0 (* z (* y z)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z * z) - t;
	double tmp;
	if (t_1 <= -2e-107) {
		tmp = y * (4.0 * t);
	} else if (t_1 <= 1e+143) {
		tmp = x * x;
	} else {
		tmp = -4.0 * (z * (y * z));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * z) - t
    if (t_1 <= (-2d-107)) then
        tmp = y * (4.0d0 * t)
    else if (t_1 <= 1d+143) then
        tmp = x * x
    else
        tmp = (-4.0d0) * (z * (y * z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (z * z) - t;
	double tmp;
	if (t_1 <= -2e-107) {
		tmp = y * (4.0 * t);
	} else if (t_1 <= 1e+143) {
		tmp = x * x;
	} else {
		tmp = -4.0 * (z * (y * z));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z * z) - t
	tmp = 0
	if t_1 <= -2e-107:
		tmp = y * (4.0 * t)
	elif t_1 <= 1e+143:
		tmp = x * x
	else:
		tmp = -4.0 * (z * (y * z))
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z * z) - t)
	tmp = 0.0
	if (t_1 <= -2e-107)
		tmp = Float64(y * Float64(4.0 * t));
	elseif (t_1 <= 1e+143)
		tmp = Float64(x * x);
	else
		tmp = Float64(-4.0 * Float64(z * Float64(y * z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z * z) - t;
	tmp = 0.0;
	if (t_1 <= -2e-107)
		tmp = y * (4.0 * t);
	elseif (t_1 <= 1e+143)
		tmp = x * x;
	else
		tmp = -4.0 * (z * (y * z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z * z), $MachinePrecision] - t), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-107], N[(y * N[(4.0 * t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+143], N[(x * x), $MachinePrecision], N[(-4.0 * N[(z * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (*.f64 z z) t) < -2e-107

   1. Initial program 97.9%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

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

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 72.8

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

   5. Simplified 72.8%

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

   if -2e-107 < (-.f64 (*.f64 z z) t) < 1e143

   1. Initial program 99.9%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 60.1

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

   5. Simplified 60.1%

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

   if 1e143 < (-.f64 (*.f64 z z) t)

   1. Initial program 80.4%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

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

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

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

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

      6. unpow2 N/A

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

      7. *-lowering-*.f64 62.6

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

   5. Simplified 62.6%

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

      1. associate-*r* N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*l* N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

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

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

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

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

      10. *-lowering-*.f64 68.5

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

   7. Applied egg-rr 68.5%

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

4. Final simplification 66.5%

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

Alternative 4: 60.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := z \cdot z - t\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{-107}:\\ \;\;\;\;y \cdot \left(4 \cdot t\right)\\ \mathbf{elif}\;t\_1 \leq 10^{+143}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-4 \cdot \left(z \cdot z\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* z z) t)))
   (if (<= t_1 -2e-107)
     (* y (* 4.0 t))
     (if (<= t_1 1e+143) (* x x) (* y (* -4.0 (* z z)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z * z) - t;
	double tmp;
	if (t_1 <= -2e-107) {
		tmp = y * (4.0 * t);
	} else if (t_1 <= 1e+143) {
		tmp = x * x;
	} else {
		tmp = y * (-4.0 * (z * z));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z * z) - t
    if (t_1 <= (-2d-107)) then
        tmp = y * (4.0d0 * t)
    else if (t_1 <= 1d+143) then
        tmp = x * x
    else
        tmp = y * ((-4.0d0) * (z * z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (z * z) - t;
	double tmp;
	if (t_1 <= -2e-107) {
		tmp = y * (4.0 * t);
	} else if (t_1 <= 1e+143) {
		tmp = x * x;
	} else {
		tmp = y * (-4.0 * (z * z));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z * z) - t
	tmp = 0
	if t_1 <= -2e-107:
		tmp = y * (4.0 * t)
	elif t_1 <= 1e+143:
		tmp = x * x
	else:
		tmp = y * (-4.0 * (z * z))
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z * z) - t)
	tmp = 0.0
	if (t_1 <= -2e-107)
		tmp = Float64(y * Float64(4.0 * t));
	elseif (t_1 <= 1e+143)
		tmp = Float64(x * x);
	else
		tmp = Float64(y * Float64(-4.0 * Float64(z * z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z * z) - t;
	tmp = 0.0;
	if (t_1 <= -2e-107)
		tmp = y * (4.0 * t);
	elseif (t_1 <= 1e+143)
		tmp = x * x;
	else
		tmp = y * (-4.0 * (z * z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z * z), $MachinePrecision] - t), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-107], N[(y * N[(4.0 * t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+143], N[(x * x), $MachinePrecision], N[(y * N[(-4.0 * N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (*.f64 z z) t) < -2e-107

   1. Initial program 97.9%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

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

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 72.8

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

   5. Simplified 72.8%

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

   if -2e-107 < (-.f64 (*.f64 z z) t) < 1e143

   1. Initial program 99.9%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 60.1

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

   5. Simplified 60.1%

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

   if 1e143 < (-.f64 (*.f64 z z) t)

   1. Initial program 80.4%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

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

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

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

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

      6. unpow2 N/A

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

      7. *-lowering-*.f64 62.6

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

   5. Simplified 62.6%

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

4. Final simplification 63.6%

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

Alternative 5: 94.3% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z 3.6e+151)
   (fma x x (* y (* -4.0 (fma z z (- t)))))
   (* -4.0 (* z (* y z)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= 3.6e+151) {
		tmp = fma(x, x, (y * (-4.0 * fma(z, z, -t))));
	} else {
		tmp = -4.0 * (z * (y * z));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= 3.6e+151)
		tmp = fma(x, x, Float64(y * Float64(-4.0 * fma(z, z, Float64(-t)))));
	else
		tmp = Float64(-4.0 * Float64(z * Float64(y * z)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, 3.6e+151], N[(x * x + N[(y * N[(-4.0 * N[(z * z + (-t)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(z * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 3.6e151

   1. Initial program 94.3%

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

      1. sub-neg N/A

         \[\leadsto \color{blue}{x \cdot x + \left(\mathsf{neg}\left(\left(y \cdot 4\right) \cdot \left(z \cdot z - t\right)\right)\right)} \]

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

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

      3. associate-*l* N/A

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

      4. distribute-rgt-neg-in N/A

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

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

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

      6. *-commutative N/A

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

      7. distribute-rgt-neg-in N/A

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

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

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

      9. sub-neg N/A

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

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

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

      11. neg-lowering-neg.f64 N/A

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

      12. metadata-eval 95.2

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

   4. Applied egg-rr 95.2%

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

   if 3.6e151 < z

   1. Initial program 61.1%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

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

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

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

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

      6. unpow2 N/A

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

      7. *-lowering-*.f64 67.4

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

   5. Simplified 67.4%

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

      1. associate-*r* N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*l* N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

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

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

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

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

      10. *-lowering-*.f64 90.5

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

   7. Applied egg-rr 90.5%

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

4. Final simplification 94.7%

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

Alternative 6: 85.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (* z z) 1e+155) (fma y (* 4.0 t) (* x x)) (* -4.0 (* z (* y z)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z * z) <= 1e+155) {
		tmp = fma(y, (4.0 * t), (x * x));
	} else {
		tmp = -4.0 * (z * (y * z));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(z * z) <= 1e+155)
		tmp = fma(y, Float64(4.0 * t), Float64(x * x));
	else
		tmp = Float64(-4.0 * Float64(z * Float64(y * z)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(z * z), $MachinePrecision], 1e+155], N[(y * N[(4.0 * t), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(z * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 1.00000000000000001e155

   1. Initial program 98.1%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{{x}^{2} + \left(\mathsf{neg}\left(-4\right)\right) \cdot \left(t \cdot y\right)} \]

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

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

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

      7. *-commutative N/A

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

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

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

      9. unpow2 N/A

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

      10. *-lowering-*.f64 91.0

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

   5. Simplified 91.0%

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

   if 1.00000000000000001e155 < (*.f64 z z)

   1. Initial program 77.5%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

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

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

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

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

      6. unpow2 N/A

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

      7. *-lowering-*.f64 75.8

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

   5. Simplified 75.8%

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

      1. associate-*r* N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*l* N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

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

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

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

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

      10. *-lowering-*.f64 83.2

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

   7. Applied egg-rr 83.2%

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

4. Final simplification 88.0%

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

Alternative 7: 77.3% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z 4.2e+77) (fma x x (* y (* 4.0 t))) (* -4.0 (* z (* y z)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= 4.2e+77) {
		tmp = fma(x, x, (y * (4.0 * t)));
	} else {
		tmp = -4.0 * (z * (y * z));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= 4.2e+77)
		tmp = fma(x, x, Float64(y * Float64(4.0 * t)));
	else
		tmp = Float64(-4.0 * Float64(z * Float64(y * z)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, 4.2e+77], N[(x * x + N[(y * N[(4.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(z * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 4.1999999999999997e77

   1. Initial program 94.5%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. cancel-sign-sub-inv N/A

         \[\leadsto \color{blue}{{x}^{2} + \left(\mathsf{neg}\left(-4\right)\right) \cdot \left(t \cdot y\right)} \]

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

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

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

      7. *-commutative N/A

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

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

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

      9. unpow2 N/A

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

      10. *-lowering-*.f64 77.8

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

   5. Simplified 77.8%

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. metadata-eval N/A

         \[\leadsto \color{blue}{\left(-4 \cdot -1\right)} \cdot \left(y \cdot t\right) + x \cdot x \]

      4. associate-*r* N/A

         \[\leadsto \color{blue}{-4 \cdot \left(-1 \cdot \left(y \cdot t\right)\right)} + x \cdot x \]

      5. neg-mul-1 N/A

         \[\leadsto -4 \cdot \color{blue}{\left(\mathsf{neg}\left(y \cdot t\right)\right)} + x \cdot x \]

      6. distribute-rgt-neg-out N/A

         \[\leadsto -4 \cdot \color{blue}{\left(y \cdot \left(\mathsf{neg}\left(t\right)\right)\right)} + x \cdot x \]

      7. +-commutative N/A

         \[\leadsto \color{blue}{x \cdot x + -4 \cdot \left(y \cdot \left(\mathsf{neg}\left(t\right)\right)\right)} \]

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

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, -4 \cdot \left(y \cdot \left(\mathsf{neg}\left(t\right)\right)\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(x, x, \color{blue}{\left(y \cdot \left(\mathsf{neg}\left(t\right)\right)\right) \cdot -4}\right) \]

      10. distribute-rgt-neg-out N/A

          \[\leadsto \mathsf{fma}\left(x, x, \color{blue}{\left(\mathsf{neg}\left(y \cdot t\right)\right)} \cdot -4\right) \]

      11. distribute-lft-neg-out N/A

          \[\leadsto \mathsf{fma}\left(x, x, \color{blue}{\mathsf{neg}\left(\left(y \cdot t\right) \cdot -4\right)}\right) \]

      12. distribute-rgt-neg-in N/A

          \[\leadsto \mathsf{fma}\left(x, x, \color{blue}{\left(y \cdot t\right) \cdot \left(\mathsf{neg}\left(-4\right)\right)}\right) \]

      13. metadata-eval N/A

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

      14. associate-*r* N/A

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

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

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

      16. *-lowering-*.f64 75.9

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

   7. Applied egg-rr 75.9%

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

   if 4.1999999999999997e77 < z

   1. Initial program 70.7%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

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

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

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

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

      6. unpow2 N/A

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

      7. *-lowering-*.f64 67.1

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

   5. Simplified 67.1%

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

      1. associate-*r* N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*l* N/A

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

      5. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

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

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

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

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

      10. *-lowering-*.f64 83.2

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

   7. Applied egg-rr 83.2%

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

4. Final simplification 77.2%

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

Alternative 8: 59.4% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (* x x) 5e+68) (* y (* 4.0 t)) (* x x)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x * x) <= 5e+68) {
		tmp = y * (4.0 * t);
	} else {
		tmp = x * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x * x) <= 5d+68) then
        tmp = y * (4.0d0 * t)
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x * x) <= 5e+68) {
		tmp = y * (4.0 * t);
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x * x) <= 5e+68:
		tmp = y * (4.0 * t)
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x * x) <= 5e+68)
		tmp = Float64(y * Float64(4.0 * t));
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x * x) <= 5e+68)
		tmp = y * (4.0 * t);
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x * x), $MachinePrecision], 5e+68], N[(y * N[(4.0 * t), $MachinePrecision]), $MachinePrecision], N[(x * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 5.0000000000000004e68

   1. Initial program 94.0%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

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

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 50.3

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

   5. Simplified 50.3%

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

   if 5.0000000000000004e68 < (*.f64 x x)

   1. Initial program 85.5%

      \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 74.3

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

   5. Simplified 74.3%

      \[\leadsto \color{blue}{x \cdot x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 61.1%

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

Alternative 9: 40.8% accurate, 4.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 90.2%

   \[x \cdot x - \left(y \cdot 4\right) \cdot \left(z \cdot z - t\right) \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. unpow2 N/A

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

   2. *-lowering-*.f64 40.7

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

5. Simplified 40.7%

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

Developer Target 1: 90.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (- (* x x) (* 4.0 (* y (- (* z z) t)))))

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * x) - (4.0d0 * (y * ((z * z) - t)))
end function

Java

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

Python

def code(x, y, z, t):
	return (x * x) - (4.0 * (y * ((z * z) - t)))

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(x * x), $MachinePrecision] - N[(4.0 * N[(y * N[(N[(z * z), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024198 
(FPCore (x y z t)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, B"
  :precision binary64

  :alt
  (! :herbie-platform default (- (* x x) (* 4 (* y (- (* z z) t)))))

  (- (* x x) (* (* y 4.0) (- (* z z) t))))