Data.Array.Repa.Algorithms.ColorRamp:rampColorHotToCold from repa-algorithms-3.4.0.1, B

Percentage Accurate: 99.8% → 99.8%

Time: 4.8s

Alternatives: 8

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
2. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto \frac{\left(\left(x - y\right) - 0.5 \cdot z\right) \cdot 4}{z} \]
4. Add Preprocessing

Alternative 2: 67.0% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{-4 \cdot y}{z}\\ t_1 := \frac{\left(\left(x - y\right) - 0.5 \cdot z\right) \cdot 4}{z}\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+18}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq -1:\\ \;\;\;\;-2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+72}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot 4}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (* -4.0 y) z)) (t_1 (/ (* (- (- x y) (* 0.5 z)) 4.0) z)))
   (if (<= t_1 -2e+18)
     t_0
     (if (<= t_1 -1.0) -2.0 (if (<= t_1 5e+72) t_0 (/ (* x 4.0) z))))))

C

double code(double x, double y, double z) {
	double t_0 = (-4.0 * y) / z;
	double t_1 = (((x - y) - (0.5 * z)) * 4.0) / z;
	double tmp;
	if (t_1 <= -2e+18) {
		tmp = t_0;
	} else if (t_1 <= -1.0) {
		tmp = -2.0;
	} else if (t_1 <= 5e+72) {
		tmp = t_0;
	} else {
		tmp = (x * 4.0) / 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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = ((-4.0d0) * y) / z
    t_1 = (((x - y) - (0.5d0 * z)) * 4.0d0) / z
    if (t_1 <= (-2d+18)) then
        tmp = t_0
    else if (t_1 <= (-1.0d0)) then
        tmp = -2.0d0
    else if (t_1 <= 5d+72) then
        tmp = t_0
    else
        tmp = (x * 4.0d0) / z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (-4.0 * y) / z;
	double t_1 = (((x - y) - (0.5 * z)) * 4.0) / z;
	double tmp;
	if (t_1 <= -2e+18) {
		tmp = t_0;
	} else if (t_1 <= -1.0) {
		tmp = -2.0;
	} else if (t_1 <= 5e+72) {
		tmp = t_0;
	} else {
		tmp = (x * 4.0) / z;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (-4.0 * y) / z
	t_1 = (((x - y) - (0.5 * z)) * 4.0) / z
	tmp = 0
	if t_1 <= -2e+18:
		tmp = t_0
	elif t_1 <= -1.0:
		tmp = -2.0
	elif t_1 <= 5e+72:
		tmp = t_0
	else:
		tmp = (x * 4.0) / z
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-4.0 * y) / z)
	t_1 = Float64(Float64(Float64(Float64(x - y) - Float64(0.5 * z)) * 4.0) / z)
	tmp = 0.0
	if (t_1 <= -2e+18)
		tmp = t_0;
	elseif (t_1 <= -1.0)
		tmp = -2.0;
	elseif (t_1 <= 5e+72)
		tmp = t_0;
	else
		tmp = Float64(Float64(x * 4.0) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (-4.0 * y) / z;
	t_1 = (((x - y) - (0.5 * z)) * 4.0) / z;
	tmp = 0.0;
	if (t_1 <= -2e+18)
		tmp = t_0;
	elseif (t_1 <= -1.0)
		tmp = -2.0;
	elseif (t_1 <= 5e+72)
		tmp = t_0;
	else
		tmp = (x * 4.0) / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(-4.0 * y), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x - y), $MachinePrecision] - N[(0.5 * z), $MachinePrecision]), $MachinePrecision] * 4.0), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+18], t$95$0, If[LessEqual[t$95$1, -1.0], -2.0, If[LessEqual[t$95$1, 5e+72], t$95$0, N[(N[(x * 4.0), $MachinePrecision] / z), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z) < -2e18 or -1 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z) < 4.99999999999999992e72

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 65.8

         \[\leadsto \frac{\color{blue}{-4 \cdot y}}{z} \]

   5. Applied rewrites 65.8%

      \[\leadsto \frac{\color{blue}{-4 \cdot y}}{z} \]

   if -2e18 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z) < -1

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 94.9%

      \[\leadsto \color{blue}{-2} \]

   if 4.99999999999999992e72 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z)

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 63.8

         \[\leadsto \frac{\color{blue}{4 \cdot x}}{z} \]

   5. Applied rewrites 63.8%

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

4. Final simplification 75.0%

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

Alternative 3: 98.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{-4 \cdot \left(y - x\right)}{z}\\ t_1 := \frac{\left(\left(x - y\right) - 0.5 \cdot z\right) \cdot 4}{z}\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+18}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 36000000000000:\\ \;\;\;\;\mathsf{fma}\left(\frac{4}{z}, x, -2\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (* -4.0 (- y x)) z)) (t_1 (/ (* (- (- x y) (* 0.5 z)) 4.0) z)))
   (if (<= t_1 -2e+18)
     t_0
     (if (<= t_1 36000000000000.0) (fma (/ 4.0 z) x -2.0) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (-4.0 * (y - x)) / z;
	double t_1 = (((x - y) - (0.5 * z)) * 4.0) / z;
	double tmp;
	if (t_1 <= -2e+18) {
		tmp = t_0;
	} else if (t_1 <= 36000000000000.0) {
		tmp = fma((4.0 / z), x, -2.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-4.0 * Float64(y - x)) / z)
	t_1 = Float64(Float64(Float64(Float64(x - y) - Float64(0.5 * z)) * 4.0) / z)
	tmp = 0.0
	if (t_1 <= -2e+18)
		tmp = t_0;
	elseif (t_1 <= 36000000000000.0)
		tmp = fma(Float64(4.0 / z), x, -2.0);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(-4.0 * N[(y - x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x - y), $MachinePrecision] - N[(0.5 * z), $MachinePrecision]), $MachinePrecision] * 4.0), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+18], t$95$0, If[LessEqual[t$95$1, 36000000000000.0], N[(N[(4.0 / z), $MachinePrecision] * x + -2.0), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z) < -2e18 or 3.6e13 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z)

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. sub-neg N/A

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

      2. distribute-rgt-in N/A

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

      3. metadata-eval N/A

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

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

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

      5. neg-mul-1 N/A

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

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

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

      7. neg-mul-1 N/A

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

      8. distribute-lft-out N/A

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

      9. *-commutative N/A

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

      10. *-commutative N/A

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

      11. metadata-eval N/A

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

      12. associate-*r* N/A

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

      13. mul-1-neg N/A

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

      14. distribute-lft-in N/A

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

      15. sub-neg N/A

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

      16. *-rgt-identity N/A

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

      17. *-inverses N/A

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

      18. associate-/l* N/A

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

      19. associate-*l/ N/A

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

      20. associate-*r/ N/A

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

      21. associate-*l* N/A

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

      22. *-commutative N/A

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

      23. associate-*r* N/A

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

   5. Applied rewrites 99.9%

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

   if -2e18 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z) < 3.6e13

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{4 \cdot \frac{x - \frac{1}{2} \cdot z}{z}} \]
   4. Step-by-step derivation

      1. div-sub N/A

         \[\leadsto 4 \cdot \color{blue}{\left(\frac{x}{z} - \frac{\frac{1}{2} \cdot z}{z}\right)} \]

      2. sub-neg N/A

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

      3. distribute-lft-in N/A

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

      4. *-lft-identity N/A

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

      5. associate-*l/ N/A

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

      6. associate-*l* N/A

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

      7. associate-/l* N/A

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

      8. *-inverses N/A

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

      9. metadata-eval N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. lower-fma.f64 N/A

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

      13. associate-*r/ N/A

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

      14. metadata-eval N/A

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

      15. lower-/.f64 98.3

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

   5. Applied rewrites 98.3%

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

4. Final simplification 99.3%

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

Alternative 4: 67.3% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (* -4.0 y) z)) (t_1 (/ (* (- (- x y) (* 0.5 z)) 4.0) z)))
   (if (<= t_1 -2e+18) t_0 (if (<= t_1 -1.0) -2.0 t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (-4.0 * y) / z;
	double t_1 = (((x - y) - (0.5 * z)) * 4.0) / z;
	double tmp;
	if (t_1 <= -2e+18) {
		tmp = t_0;
	} else if (t_1 <= -1.0) {
		tmp = -2.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = ((-4.0d0) * y) / z
    t_1 = (((x - y) - (0.5d0 * z)) * 4.0d0) / z
    if (t_1 <= (-2d+18)) then
        tmp = t_0
    else if (t_1 <= (-1.0d0)) then
        tmp = -2.0d0
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (-4.0 * y) / z;
	double t_1 = (((x - y) - (0.5 * z)) * 4.0) / z;
	double tmp;
	if (t_1 <= -2e+18) {
		tmp = t_0;
	} else if (t_1 <= -1.0) {
		tmp = -2.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (-4.0 * y) / z
	t_1 = (((x - y) - (0.5 * z)) * 4.0) / z
	tmp = 0
	if t_1 <= -2e+18:
		tmp = t_0
	elif t_1 <= -1.0:
		tmp = -2.0
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-4.0 * y) / z)
	t_1 = Float64(Float64(Float64(Float64(x - y) - Float64(0.5 * z)) * 4.0) / z)
	tmp = 0.0
	if (t_1 <= -2e+18)
		tmp = t_0;
	elseif (t_1 <= -1.0)
		tmp = -2.0;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (-4.0 * y) / z;
	t_1 = (((x - y) - (0.5 * z)) * 4.0) / z;
	tmp = 0.0;
	if (t_1 <= -2e+18)
		tmp = t_0;
	elseif (t_1 <= -1.0)
		tmp = -2.0;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(-4.0 * y), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x - y), $MachinePrecision] - N[(0.5 * z), $MachinePrecision]), $MachinePrecision] * 4.0), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+18], t$95$0, If[LessEqual[t$95$1, -1.0], -2.0, t$95$0]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z) < -2e18 or -1 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z)

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 55.2

         \[\leadsto \frac{\color{blue}{-4 \cdot y}}{z} \]

   5. Applied rewrites 55.2%

      \[\leadsto \frac{\color{blue}{-4 \cdot y}}{z} \]

   if -2e18 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z) < -1

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 94.9%

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

4. Final simplification 68.6%

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

Alternative 5: 86.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\frac{4}{z}, x, -2\right)\\ \mathbf{if}\;x \leq -6.8 \cdot 10^{+45}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 1.95 \cdot 10^{+43}:\\ \;\;\;\;\left(-0.5 - \frac{y}{z}\right) \cdot 4\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma (/ 4.0 z) x -2.0)))
   (if (<= x -6.8e+45) t_0 (if (<= x 1.95e+43) (* (- -0.5 (/ y z)) 4.0) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma((4.0 / z), x, -2.0);
	double tmp;
	if (x <= -6.8e+45) {
		tmp = t_0;
	} else if (x <= 1.95e+43) {
		tmp = (-0.5 - (y / z)) * 4.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = fma(Float64(4.0 / z), x, -2.0)
	tmp = 0.0
	if (x <= -6.8e+45)
		tmp = t_0;
	elseif (x <= 1.95e+43)
		tmp = Float64(Float64(-0.5 - Float64(y / z)) * 4.0);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(4.0 / z), $MachinePrecision] * x + -2.0), $MachinePrecision]}, If[LessEqual[x, -6.8e+45], t$95$0, If[LessEqual[x, 1.95e+43], N[(N[(-0.5 - N[(y / z), $MachinePrecision]), $MachinePrecision] * 4.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -6.8e45 or 1.95e43 < x

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{4 \cdot \frac{x - \frac{1}{2} \cdot z}{z}} \]
   4. Step-by-step derivation

      1. div-sub N/A

         \[\leadsto 4 \cdot \color{blue}{\left(\frac{x}{z} - \frac{\frac{1}{2} \cdot z}{z}\right)} \]

      2. sub-neg N/A

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

      3. distribute-lft-in N/A

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

      4. *-lft-identity N/A

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

      5. associate-*l/ N/A

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

      6. associate-*l* N/A

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

      7. associate-/l* N/A

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

      8. *-inverses N/A

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

      9. metadata-eval N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. lower-fma.f64 N/A

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

      13. associate-*r/ N/A

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

      14. metadata-eval N/A

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

      15. lower-/.f64 88.9

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

   5. Applied rewrites 88.9%

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

   if -6.8e45 < x < 1.95e43

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-4 \cdot \frac{y + \frac{1}{2} \cdot z}{z}} \]

   5. Applied rewrites 92.7%

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

Alternative 6: 86.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\frac{4}{z}, x, -2\right)\\ \mathbf{if}\;x \leq -1.85 \cdot 10^{+43}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 1.95 \cdot 10^{+43}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-4}{z}, y, -2\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma (/ 4.0 z) x -2.0)))
   (if (<= x -1.85e+43) t_0 (if (<= x 1.95e+43) (fma (/ -4.0 z) y -2.0) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma((4.0 / z), x, -2.0);
	double tmp;
	if (x <= -1.85e+43) {
		tmp = t_0;
	} else if (x <= 1.95e+43) {
		tmp = fma((-4.0 / z), y, -2.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = fma(Float64(4.0 / z), x, -2.0)
	tmp = 0.0
	if (x <= -1.85e+43)
		tmp = t_0;
	elseif (x <= 1.95e+43)
		tmp = fma(Float64(-4.0 / z), y, -2.0);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(4.0 / z), $MachinePrecision] * x + -2.0), $MachinePrecision]}, If[LessEqual[x, -1.85e+43], t$95$0, If[LessEqual[x, 1.95e+43], N[(N[(-4.0 / z), $MachinePrecision] * y + -2.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.85e43 or 1.95e43 < x

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{4 \cdot \frac{x - \frac{1}{2} \cdot z}{z}} \]
   4. Step-by-step derivation

      1. div-sub N/A

         \[\leadsto 4 \cdot \color{blue}{\left(\frac{x}{z} - \frac{\frac{1}{2} \cdot z}{z}\right)} \]

      2. sub-neg N/A

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

      3. distribute-lft-in N/A

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

      4. *-lft-identity N/A

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

      5. associate-*l/ N/A

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

      6. associate-*l* N/A

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

      7. associate-/l* N/A

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

      8. *-inverses N/A

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

      9. metadata-eval N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. lower-fma.f64 N/A

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

      13. associate-*r/ N/A

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

      14. metadata-eval N/A

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

      15. lower-/.f64 88.9

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

   5. Applied rewrites 88.9%

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

   if -1.85e43 < x < 1.95e43

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 92.7

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

   5. Applied rewrites 92.7%

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

   6. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-4 \cdot \frac{y + \frac{1}{2} \cdot z}{z}} \]
   7. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. distribute-lft-in N/A

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

      3. associate-*r* N/A

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

      4. metadata-eval N/A

         \[\leadsto \frac{-4 \cdot y + \color{blue}{-2} \cdot z}{z} \]

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

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

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

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

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

      9. distribute-neg-in N/A

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

      10. *-rgt-identity N/A

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

      11. *-inverses N/A

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

      12. associate-/l* N/A

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

      13. associate-*l/ N/A

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

      14. associate-*r/ N/A

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

      15. distribute-rgt-in N/A

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

      16. +-commutative N/A

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

      17. *-commutative N/A

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

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

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

      19. mul-1-neg N/A

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

   8. Applied rewrites 92.5%

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

Alternative 7: 81.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x \cdot 4}{z}\\ \mathbf{if}\;x \leq -6.5 \cdot 10^{+117}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{+119}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-4}{z}, y, -2\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (* x 4.0) z)))
   (if (<= x -6.5e+117) t_0 (if (<= x 2.4e+119) (fma (/ -4.0 z) y -2.0) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (x * 4.0) / z;
	double tmp;
	if (x <= -6.5e+117) {
		tmp = t_0;
	} else if (x <= 2.4e+119) {
		tmp = fma((-4.0 / z), y, -2.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x * 4.0) / z)
	tmp = 0.0
	if (x <= -6.5e+117)
		tmp = t_0;
	elseif (x <= 2.4e+119)
		tmp = fma(Float64(-4.0 / z), y, -2.0);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x * 4.0), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[x, -6.5e+117], t$95$0, If[LessEqual[x, 2.4e+119], N[(N[(-4.0 / z), $MachinePrecision] * y + -2.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -6.5000000000000004e117 or 2.4e119 < x

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 80.7

         \[\leadsto \frac{\color{blue}{4 \cdot x}}{z} \]

   5. Applied rewrites 80.7%

      \[\leadsto \frac{\color{blue}{4 \cdot x}}{z} \]

   if -6.5000000000000004e117 < x < 2.4e119

   1. Initial program 100.0%

      \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 86.8

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

   5. Applied rewrites 86.8%

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

   6. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-4 \cdot \frac{y + \frac{1}{2} \cdot z}{z}} \]
   7. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. distribute-lft-in N/A

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

      3. associate-*r* N/A

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

      4. metadata-eval N/A

         \[\leadsto \frac{-4 \cdot y + \color{blue}{-2} \cdot z}{z} \]

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

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

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

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

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

      9. distribute-neg-in N/A

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

      10. *-rgt-identity N/A

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

      11. *-inverses N/A

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

      12. associate-/l* N/A

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

      13. associate-*l/ N/A

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

      14. associate-*r/ N/A

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

      15. distribute-rgt-in N/A

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

      16. +-commutative N/A

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

      17. *-commutative N/A

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

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

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

      19. mul-1-neg N/A

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

   8. Applied rewrites 86.6%

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

4. Final simplification 84.7%

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

Alternative 8: 34.8% accurate, 28.0× speedup

Math

\[\begin{array}{l} \\ -2 \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 -2.0)

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return -2.0

Julia

function code(x, y, z)
	return -2.0
end

MATLAB

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

Wolfram

code[x_, y_, z_] := -2.0

Derivation

1. Initial program 100.0%

   \[\frac{4 \cdot \left(\left(x - y\right) - z \cdot 0.5\right)}{z} \]
2. Add Preprocessing

3. Taylor expanded in z around inf

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

5. Applied rewrites 33.6%

   \[\leadsto \color{blue}{-2} \]
6. Add Preprocessing

Developer Target 1: 98.0% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (- (* 4.0 (/ x z)) (+ 2.0 (* 4.0 (/ y z)))))

C

double code(double x, double y, double z) {
	return (4.0 * (x / z)) - (2.0 + (4.0 * (y / z)));
}

Fortran

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

Java

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

Python

def code(x, y, z):
	return (4.0 * (x / z)) - (2.0 + (4.0 * (y / z)))

Julia

function code(x, y, z)
	return Float64(Float64(4.0 * Float64(x / z)) - Float64(2.0 + Float64(4.0 * Float64(y / z))))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (4.0 * (x / z)) - (2.0 + (4.0 * (y / z)));
end

Wolfram

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

Reproduce

herbie shell --seed 2024285 
(FPCore (x y z)
  :name "Data.Array.Repa.Algorithms.ColorRamp:rampColorHotToCold from repa-algorithms-3.4.0.1, B"
  :precision binary64

  :alt
  (! :herbie-platform default (- (* 4 (/ x z)) (+ 2 (* 4 (/ y z)))))

  (/ (* 4.0 (- (- x y) (* z 0.5))) z))