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

Percentage Accurate: 99.9% → 100.0%

Time: 6.7s

Alternatives: 8

Speedup: 1.2×

• 20.5% 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.9% 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: 100.0% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

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) * (((y - x) / z) - (-0.5d0))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. remove-double-neg 100.0%

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

   2. neg-mul-1 100.0%

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

   3. times-frac 100.0%

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

   4. metadata-eval 100.0%

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

   5. div-sub 100.0%

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

   6. distribute-frac-neg2 100.0%

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

   7. distribute-frac-neg 100.0%

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

   8. sub-neg 100.0%

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

   9. +-commutative 100.0%

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

   10. distribute-neg-out 100.0%

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

   11. remove-double-neg 100.0%

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

   12. sub-neg 100.0%

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

   13. *-commutative 100.0%

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

   14. neg-mul-1 100.0%

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

   15. times-frac 100.0%

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

   16. metadata-eval 100.0%

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

   17. *-inverses 100.0%

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

   18. metadata-eval 100.0%

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

3. Simplified 100.0%

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

5. Final simplification 100.0%

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

Alternative 2: 52.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9 \cdot 10^{+159}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq -6.5 \cdot 10^{-71}:\\ \;\;\;\;x \cdot \frac{4}{z}\\ \mathbf{elif}\;z \leq 10^{+88}:\\ \;\;\;\;y \cdot \frac{-4}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -9e+159)
   -2.0
   (if (<= z -6.5e-71)
     (* x (/ 4.0 z))
     (if (<= z 1e+88) (* y (/ -4.0 z)) -2.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -9e+159) {
		tmp = -2.0;
	} else if (z <= -6.5e-71) {
		tmp = x * (4.0 / z);
	} else if (z <= 1e+88) {
		tmp = y * (-4.0 / z);
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-9d+159)) then
        tmp = -2.0d0
    else if (z <= (-6.5d-71)) then
        tmp = x * (4.0d0 / z)
    else if (z <= 1d+88) then
        tmp = y * ((-4.0d0) / z)
    else
        tmp = -2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -9e+159) {
		tmp = -2.0;
	} else if (z <= -6.5e-71) {
		tmp = x * (4.0 / z);
	} else if (z <= 1e+88) {
		tmp = y * (-4.0 / z);
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -9e+159:
		tmp = -2.0
	elif z <= -6.5e-71:
		tmp = x * (4.0 / z)
	elif z <= 1e+88:
		tmp = y * (-4.0 / z)
	else:
		tmp = -2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -9e+159)
		tmp = -2.0;
	elseif (z <= -6.5e-71)
		tmp = Float64(x * Float64(4.0 / z));
	elseif (z <= 1e+88)
		tmp = Float64(y * Float64(-4.0 / z));
	else
		tmp = -2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -9e+159)
		tmp = -2.0;
	elseif (z <= -6.5e-71)
		tmp = x * (4.0 / z);
	elseif (z <= 1e+88)
		tmp = y * (-4.0 / z);
	else
		tmp = -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -9e+159], -2.0, If[LessEqual[z, -6.5e-71], N[(x * N[(4.0 / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1e+88], N[(y * N[(-4.0 / z), $MachinePrecision]), $MachinePrecision], -2.0]]]

Derivation

1. Split input into 3 regimes

2. if z < -9.00000000000000053e159 or 9.99999999999999959e87 < z

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 99.8%

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

      3. associate--l- 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in z around inf 72.9%

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

   if -9.00000000000000053e159 < z < -6.50000000000000005e-71

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 99.6%

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

      3. associate--l- 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around inf 47.8%

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

      1. associate-*r/ 47.8%

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

      2. associate-*l/ 47.6%

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

      3. *-commutative 47.6%

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

   7. Simplified 47.6%

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

   if -6.50000000000000005e-71 < z < 9.99999999999999959e87

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 99.8%

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

      3. associate--l- 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in y around inf 61.4%

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

      1. associate-*r/ 61.4%

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

      2. associate-*l/ 61.4%

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

      3. metadata-eval 61.4%

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

      4. distribute-neg-frac 61.4%

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

      5. distribute-lft-neg-in 61.4%

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

      6. *-commutative 61.4%

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

      7. distribute-rgt-neg-in 61.4%

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

      8. distribute-neg-frac 61.4%

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

      9. metadata-eval 61.4%

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

   7. Simplified 61.4%

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

4. Final simplification 62.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -9 \cdot 10^{+159}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq -6.5 \cdot 10^{-71}:\\ \;\;\;\;x \cdot \frac{4}{z}\\ \mathbf{elif}\;z \leq 10^{+88}:\\ \;\;\;\;y \cdot \frac{-4}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 52.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9 \cdot 10^{+159}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq -8.5 \cdot 10^{-69}:\\ \;\;\;\;x \cdot \frac{4}{z}\\ \mathbf{elif}\;z \leq 8.6 \cdot 10^{+86}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -9e+159)
   -2.0
   (if (<= z -8.5e-69)
     (* x (/ 4.0 z))
     (if (<= z 8.6e+86) (* -4.0 (/ y z)) -2.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -9e+159) {
		tmp = -2.0;
	} else if (z <= -8.5e-69) {
		tmp = x * (4.0 / z);
	} else if (z <= 8.6e+86) {
		tmp = -4.0 * (y / z);
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-9d+159)) then
        tmp = -2.0d0
    else if (z <= (-8.5d-69)) then
        tmp = x * (4.0d0 / z)
    else if (z <= 8.6d+86) then
        tmp = (-4.0d0) * (y / z)
    else
        tmp = -2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -9e+159) {
		tmp = -2.0;
	} else if (z <= -8.5e-69) {
		tmp = x * (4.0 / z);
	} else if (z <= 8.6e+86) {
		tmp = -4.0 * (y / z);
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -9e+159:
		tmp = -2.0
	elif z <= -8.5e-69:
		tmp = x * (4.0 / z)
	elif z <= 8.6e+86:
		tmp = -4.0 * (y / z)
	else:
		tmp = -2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -9e+159)
		tmp = -2.0;
	elseif (z <= -8.5e-69)
		tmp = Float64(x * Float64(4.0 / z));
	elseif (z <= 8.6e+86)
		tmp = Float64(-4.0 * Float64(y / z));
	else
		tmp = -2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -9e+159)
		tmp = -2.0;
	elseif (z <= -8.5e-69)
		tmp = x * (4.0 / z);
	elseif (z <= 8.6e+86)
		tmp = -4.0 * (y / z);
	else
		tmp = -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -9e+159], -2.0, If[LessEqual[z, -8.5e-69], N[(x * N[(4.0 / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 8.6e+86], N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision], -2.0]]]

Derivation

1. Split input into 3 regimes

2. if z < -9.00000000000000053e159 or 8.6000000000000004e86 < z

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 99.8%

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

      3. associate--l- 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in z around inf 72.9%

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

   if -9.00000000000000053e159 < z < -8.50000000000000046e-69

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 99.6%

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

      3. associate--l- 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around inf 47.8%

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

      1. associate-*r/ 47.8%

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

      2. associate-*l/ 47.6%

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

      3. *-commutative 47.6%

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

   7. Simplified 47.6%

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

   if -8.50000000000000046e-69 < z < 8.6000000000000004e86

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 99.8%

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

      3. associate--l- 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in y around inf 61.4%

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

      1. *-commutative 61.4%

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

   7. Simplified 61.4%

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

4. Final simplification 62.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -9 \cdot 10^{+159}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq -8.5 \cdot 10^{-69}:\\ \;\;\;\;x \cdot \frac{4}{z}\\ \mathbf{elif}\;z \leq 8.6 \cdot 10^{+86}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 52.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9 \cdot 10^{+159}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq -8.5 \cdot 10^{-69}:\\ \;\;\;\;\frac{x \cdot 4}{z}\\ \mathbf{elif}\;z \leq 3.9 \cdot 10^{+88}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -9e+159)
   -2.0
   (if (<= z -8.5e-69)
     (/ (* x 4.0) z)
     (if (<= z 3.9e+88) (* -4.0 (/ y z)) -2.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -9e+159) {
		tmp = -2.0;
	} else if (z <= -8.5e-69) {
		tmp = (x * 4.0) / z;
	} else if (z <= 3.9e+88) {
		tmp = -4.0 * (y / z);
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-9d+159)) then
        tmp = -2.0d0
    else if (z <= (-8.5d-69)) then
        tmp = (x * 4.0d0) / z
    else if (z <= 3.9d+88) then
        tmp = (-4.0d0) * (y / z)
    else
        tmp = -2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -9e+159) {
		tmp = -2.0;
	} else if (z <= -8.5e-69) {
		tmp = (x * 4.0) / z;
	} else if (z <= 3.9e+88) {
		tmp = -4.0 * (y / z);
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -9e+159:
		tmp = -2.0
	elif z <= -8.5e-69:
		tmp = (x * 4.0) / z
	elif z <= 3.9e+88:
		tmp = -4.0 * (y / z)
	else:
		tmp = -2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -9e+159)
		tmp = -2.0;
	elseif (z <= -8.5e-69)
		tmp = Float64(Float64(x * 4.0) / z);
	elseif (z <= 3.9e+88)
		tmp = Float64(-4.0 * Float64(y / z));
	else
		tmp = -2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -9e+159)
		tmp = -2.0;
	elseif (z <= -8.5e-69)
		tmp = (x * 4.0) / z;
	elseif (z <= 3.9e+88)
		tmp = -4.0 * (y / z);
	else
		tmp = -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -9e+159], -2.0, If[LessEqual[z, -8.5e-69], N[(N[(x * 4.0), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, 3.9e+88], N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision], -2.0]]]

Derivation

1. Split input into 3 regimes

2. if z < -9.00000000000000053e159 or 3.9000000000000001e88 < z

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 99.8%

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

      3. associate--l- 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in z around inf 72.9%

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

   if -9.00000000000000053e159 < z < -8.50000000000000046e-69

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 99.6%

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

      3. associate--l- 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around inf 47.8%

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

      1. associate-*r/ 47.8%

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

      2. *-commutative 47.8%

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

   7. Simplified 47.8%

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

   if -8.50000000000000046e-69 < z < 3.9000000000000001e88

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 99.8%

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

      3. associate--l- 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in y around inf 61.4%

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

      1. *-commutative 61.4%

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

   7. Simplified 61.4%

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

4. Final simplification 62.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -9 \cdot 10^{+159}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq -8.5 \cdot 10^{-69}:\\ \;\;\;\;\frac{x \cdot 4}{z}\\ \mathbf{elif}\;z \leq 3.9 \cdot 10^{+88}:\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 78.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.2 \cdot 10^{+65} \lor \neg \left(y \leq 1.6 \cdot 10^{+21}\right):\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \left(0.5 - \frac{x}{z}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -2.2e+65) (not (<= y 1.6e+21)))
   (* -4.0 (/ y z))
   (* -4.0 (- 0.5 (/ x z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.2e+65) || !(y <= 1.6e+21)) {
		tmp = -4.0 * (y / z);
	} else {
		tmp = -4.0 * (0.5 - (x / z));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-2.2d+65)) .or. (.not. (y <= 1.6d+21))) then
        tmp = (-4.0d0) * (y / z)
    else
        tmp = (-4.0d0) * (0.5d0 - (x / z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.2e+65) || !(y <= 1.6e+21)) {
		tmp = -4.0 * (y / z);
	} else {
		tmp = -4.0 * (0.5 - (x / z));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -2.2e+65) or not (y <= 1.6e+21):
		tmp = -4.0 * (y / z)
	else:
		tmp = -4.0 * (0.5 - (x / z))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -2.2e+65) || !(y <= 1.6e+21))
		tmp = Float64(-4.0 * Float64(y / z));
	else
		tmp = Float64(-4.0 * Float64(0.5 - Float64(x / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -2.2e+65) || ~((y <= 1.6e+21)))
		tmp = -4.0 * (y / z);
	else
		tmp = -4.0 * (0.5 - (x / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -2.2e+65], N[Not[LessEqual[y, 1.6e+21]], $MachinePrecision]], N[(-4.0 * N[(y / z), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(0.5 - N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.1999999999999998e65 or 1.6e21 < y

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 99.8%

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

      3. associate--l- 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in y around inf 71.9%

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

      1. *-commutative 71.9%

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

   7. Simplified 71.9%

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

   if -2.1999999999999998e65 < y < 1.6e21

   1. Initial program 100.0%

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

      1. remove-double-neg 100.0%

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

      2. neg-mul-1 100.0%

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

      3. times-frac 100.0%

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

      4. metadata-eval 100.0%

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

      5. div-sub 100.0%

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

      6. distribute-frac-neg2 100.0%

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

      7. distribute-frac-neg 100.0%

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

      8. sub-neg 100.0%

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

      9. +-commutative 100.0%

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

      10. distribute-neg-out 100.0%

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

      11. remove-double-neg 100.0%

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

      12. sub-neg 100.0%

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

      13. *-commutative 100.0%

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

      14. neg-mul-1 100.0%

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

      15. times-frac 100.0%

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

      16. metadata-eval 100.0%

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

      17. *-inverses 100.0%

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

      18. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 89.3%

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

4. Final simplification 80.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.2 \cdot 10^{+65} \lor \neg \left(y \leq 1.6 \cdot 10^{+21}\right):\\ \;\;\;\;-4 \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \left(0.5 - \frac{x}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 86.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.3 \cdot 10^{+61} \lor \neg \left(x \leq 4.4 \cdot 10^{+26}\right):\\ \;\;\;\;-4 \cdot \left(0.5 - \frac{x}{z}\right)\\ \mathbf{else}:\\ \;\;\;\;4 \cdot \left(-0.5 - \frac{y}{z}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -3.3e+61) (not (<= x 4.4e+26)))
   (* -4.0 (- 0.5 (/ x z)))
   (* 4.0 (- -0.5 (/ y z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -3.3e+61) || !(x <= 4.4e+26)) {
		tmp = -4.0 * (0.5 - (x / z));
	} else {
		tmp = 4.0 * (-0.5 - (y / z));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-3.3d+61)) .or. (.not. (x <= 4.4d+26))) then
        tmp = (-4.0d0) * (0.5d0 - (x / z))
    else
        tmp = 4.0d0 * ((-0.5d0) - (y / z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -3.3e+61) || !(x <= 4.4e+26)) {
		tmp = -4.0 * (0.5 - (x / z));
	} else {
		tmp = 4.0 * (-0.5 - (y / z));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -3.3e+61) or not (x <= 4.4e+26):
		tmp = -4.0 * (0.5 - (x / z))
	else:
		tmp = 4.0 * (-0.5 - (y / z))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -3.3e+61) || !(x <= 4.4e+26))
		tmp = Float64(-4.0 * Float64(0.5 - Float64(x / z)));
	else
		tmp = Float64(4.0 * Float64(-0.5 - Float64(y / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -3.3e+61) || ~((x <= 4.4e+26)))
		tmp = -4.0 * (0.5 - (x / z));
	else
		tmp = 4.0 * (-0.5 - (y / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -3.3e+61], N[Not[LessEqual[x, 4.4e+26]], $MachinePrecision]], N[(-4.0 * N[(0.5 - N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(4.0 * N[(-0.5 - N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.2999999999999998e61 or 4.40000000000000014e26 < x

   1. Initial program 100.0%

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

      1. remove-double-neg 100.0%

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

      2. neg-mul-1 100.0%

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

      3. times-frac 100.0%

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

      4. metadata-eval 100.0%

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

      5. div-sub 99.9%

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

      6. distribute-frac-neg2 99.9%

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

      7. distribute-frac-neg 99.9%

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

      8. sub-neg 99.9%

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

      9. +-commutative 99.9%

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

      10. distribute-neg-out 99.9%

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

      11. remove-double-neg 99.9%

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

      12. sub-neg 99.9%

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

      13. *-commutative 99.9%

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

      14. neg-mul-1 99.9%

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

      15. times-frac 99.9%

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

      16. metadata-eval 99.9%

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

      17. *-inverses 99.9%

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

      18. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in y around 0 85.7%

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

   if -3.2999999999999998e61 < x < 4.40000000000000014e26

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 99.8%

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

      3. associate--l- 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in x around 0 91.6%

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

      1. associate-*r/ 91.6%

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

      2. metadata-eval 91.6%

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

      3. +-commutative 91.6%

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

      4. *-commutative 91.6%

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

      5. fma-undefine 91.6%

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

      6. associate-*r* 91.6%

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

      7. neg-mul-1 91.6%

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

      8. associate-/l* 91.6%

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

      9. fma-undefine 91.6%

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

      10. *-commutative 91.6%

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

      11. distribute-neg-in 91.6%

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

      12. sub-neg 91.6%

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

      13. div-sub 91.6%

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

      14. distribute-neg-frac 91.6%

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

      15. associate-/l* 91.6%

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

      16. *-inverses 91.6%

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

      17. metadata-eval 91.6%

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

      18. metadata-eval 91.6%

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

   7. Simplified 91.6%

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

4. Final simplification 89.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.3 \cdot 10^{+61} \lor \neg \left(x \leq 4.4 \cdot 10^{+26}\right):\\ \;\;\;\;-4 \cdot \left(0.5 - \frac{x}{z}\right)\\ \mathbf{else}:\\ \;\;\;\;4 \cdot \left(-0.5 - \frac{y}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 51.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.2 \cdot 10^{+162}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq 4.6 \cdot 10^{+39}:\\ \;\;\;\;x \cdot \frac{4}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -2.2e+162) -2.0 (if (<= z 4.6e+39) (* x (/ 4.0 z)) -2.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -2.2e+162) {
		tmp = -2.0;
	} else if (z <= 4.6e+39) {
		tmp = x * (4.0 / z);
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-2.2d+162)) then
        tmp = -2.0d0
    else if (z <= 4.6d+39) then
        tmp = x * (4.0d0 / z)
    else
        tmp = -2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -2.2e+162) {
		tmp = -2.0;
	} else if (z <= 4.6e+39) {
		tmp = x * (4.0 / z);
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -2.2e+162:
		tmp = -2.0
	elif z <= 4.6e+39:
		tmp = x * (4.0 / z)
	else:
		tmp = -2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -2.2e+162)
		tmp = -2.0;
	elseif (z <= 4.6e+39)
		tmp = Float64(x * Float64(4.0 / z));
	else
		tmp = -2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -2.2e+162)
		tmp = -2.0;
	elseif (z <= 4.6e+39)
		tmp = x * (4.0 / z);
	else
		tmp = -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -2.2e+162], -2.0, If[LessEqual[z, 4.6e+39], N[(x * N[(4.0 / z), $MachinePrecision]), $MachinePrecision], -2.0]]

Derivation

1. Split input into 2 regimes

2. if z < -2.2000000000000002e162 or 4.60000000000000024e39 < z

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 99.8%

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

      3. associate--l- 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in z around inf 67.6%

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

   if -2.2000000000000002e162 < z < 4.60000000000000024e39

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 99.8%

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

      3. associate--l- 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in x around inf 41.7%

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

      1. associate-*r/ 41.7%

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

      2. associate-*l/ 41.6%

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

      3. *-commutative 41.6%

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

   7. Simplified 41.6%

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

4. Final simplification 50.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.2 \cdot 10^{+162}:\\ \;\;\;\;-2\\ \mathbf{elif}\;z \leq 4.6 \cdot 10^{+39}:\\ \;\;\;\;x \cdot \frac{4}{z}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 34.8% accurate, 11.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. Step-by-step derivation

   1. *-commutative 100.0%

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

   2. associate-/l* 99.8%

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

   3. associate--l- 99.8%

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

3. Simplified 99.8%

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

5. Taylor expanded in z around inf 30.2%

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

6. Final simplification 30.2%

   \[\leadsto -2 \]
7. Add Preprocessing

Developer target: 97.8% accurate, 0.8× 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 2024096 
(FPCore (x y z)
  :name "Data.Array.Repa.Algorithms.ColorRamp:rampColorHotToCold from repa-algorithms-3.4.0.1, B"
  :precision binary64

  :alt
  (- (* 4.0 (/ x z)) (+ 2.0 (* 4.0 (/ y z))))

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