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

Percentage Accurate: 99.8% → 99.8%

Time: 6.3s

Alternatives: 11

Speedup: 1.0×

• 20.7% 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^{+19}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq -1:\\ \;\;\;\;-2\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+239}:\\ \;\;\;\;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+19)
     t_0
     (if (<= t_1 -1.0) -2.0 (if (<= t_1 4e+239) 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+19) {
		tmp = t_0;
	} else if (t_1 <= -1.0) {
		tmp = -2.0;
	} else if (t_1 <= 4e+239) {
		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+19)) then
        tmp = t_0
    else if (t_1 <= (-1.0d0)) then
        tmp = -2.0d0
    else if (t_1 <= 4d+239) 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+19) {
		tmp = t_0;
	} else if (t_1 <= -1.0) {
		tmp = -2.0;
	} else if (t_1 <= 4e+239) {
		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+19:
		tmp = t_0
	elif t_1 <= -1.0:
		tmp = -2.0
	elif t_1 <= 4e+239:
		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+19)
		tmp = t_0;
	elseif (t_1 <= -1.0)
		tmp = -2.0;
	elseif (t_1 <= 4e+239)
		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+19)
		tmp = t_0;
	elseif (t_1 <= -1.0)
		tmp = -2.0;
	elseif (t_1 <= 4e+239)
		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+19], t$95$0, If[LessEqual[t$95$1, -1.0], -2.0, If[LessEqual[t$95$1, 4e+239], 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) < -2e19 or -1 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z) < 3.99999999999999996e239

   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 58.3

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

   5. Applied rewrites 58.3%

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

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

   1. Initial program 99.9%

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

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

   if 3.99999999999999996e239 < (/.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. *-commutative N/A

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

      2. lower-*.f64 64.5

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

   5. Applied rewrites 64.5%

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

4. Final simplification 71.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(\left(x - y\right) - 0.5 \cdot z\right) \cdot 4}{z} \leq -2 \cdot 10^{+19}:\\ \;\;\;\;\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 4 \cdot 10^{+239}:\\ \;\;\;\;\frac{-4 \cdot y}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot 4}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 67.1% 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^{+19}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq -1:\\ \;\;\;\;-2\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+239}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{4}{z} \cdot x\\ \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+19)
     t_0
     (if (<= t_1 -1.0) -2.0 (if (<= t_1 4e+239) t_0 (* (/ 4.0 z) x))))))

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+19) {
		tmp = t_0;
	} else if (t_1 <= -1.0) {
		tmp = -2.0;
	} else if (t_1 <= 4e+239) {
		tmp = t_0;
	} else {
		tmp = (4.0 / z) * x;
	}
	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+19)) then
        tmp = t_0
    else if (t_1 <= (-1.0d0)) then
        tmp = -2.0d0
    else if (t_1 <= 4d+239) then
        tmp = t_0
    else
        tmp = (4.0d0 / z) * x
    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+19) {
		tmp = t_0;
	} else if (t_1 <= -1.0) {
		tmp = -2.0;
	} else if (t_1 <= 4e+239) {
		tmp = t_0;
	} else {
		tmp = (4.0 / z) * x;
	}
	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+19:
		tmp = t_0
	elif t_1 <= -1.0:
		tmp = -2.0
	elif t_1 <= 4e+239:
		tmp = t_0
	else:
		tmp = (4.0 / z) * x
	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+19)
		tmp = t_0;
	elseif (t_1 <= -1.0)
		tmp = -2.0;
	elseif (t_1 <= 4e+239)
		tmp = t_0;
	else
		tmp = Float64(Float64(4.0 / z) * x);
	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+19)
		tmp = t_0;
	elseif (t_1 <= -1.0)
		tmp = -2.0;
	elseif (t_1 <= 4e+239)
		tmp = t_0;
	else
		tmp = (4.0 / z) * x;
	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+19], t$95$0, If[LessEqual[t$95$1, -1.0], -2.0, If[LessEqual[t$95$1, 4e+239], t$95$0, N[(N[(4.0 / z), $MachinePrecision] * x), $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) < -2e19 or -1 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z) < 3.99999999999999996e239

   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 58.3

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

   5. Applied rewrites 58.3%

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

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

   1. Initial program 99.9%

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

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

   if 3.99999999999999996e239 < (/.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 \color{blue}{4 \cdot \frac{x}{z}} \]
   4. Step-by-step derivation

      1. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 64.4

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

   5. Applied rewrites 64.4%

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

4. Final simplification 71.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(\left(x - y\right) - 0.5 \cdot z\right) \cdot 4}{z} \leq -2 \cdot 10^{+19}:\\ \;\;\;\;\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 4 \cdot 10^{+239}:\\ \;\;\;\;\frac{-4 \cdot y}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{4}{z} \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 67.0% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(-4.0 / z), $MachinePrecision] * y), $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+19], t$95$0, If[LessEqual[t$95$1, -1.0], -2.0, If[LessEqual[t$95$1, 4e+239], t$95$0, N[(N[(4.0 / z), $MachinePrecision] * x), $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) < -2e19 or -1 < (/.f64 (*.f64 #s(literal 4 binary64) (-.f64 (-.f64 x y) (*.f64 z #s(literal 1/2 binary64)))) z) < 3.99999999999999996e239

   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 \color{blue}{-4 \cdot \frac{y}{z}} \]
   4. Step-by-step derivation

      1. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. metadata-eval N/A

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

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

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

      6. lower-*.f64 N/A

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

      7. associate-*r/ N/A

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

      8. metadata-eval N/A

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

      9. distribute-neg-frac N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 58.1

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

   5. Applied rewrites 58.1%

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

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

   1. Initial program 99.9%

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

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

   if 3.99999999999999996e239 < (/.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 \color{blue}{4 \cdot \frac{x}{z}} \]
   4. Step-by-step derivation

      1. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 64.4

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

   5. Applied rewrites 64.4%

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

4. Final simplification 71.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(\left(x - y\right) - 0.5 \cdot z\right) \cdot 4}{z} \leq -2 \cdot 10^{+19}:\\ \;\;\;\;\frac{-4}{z} \cdot y\\ \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 4 \cdot 10^{+239}:\\ \;\;\;\;\frac{-4}{z} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{4}{z} \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 98.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(x - y\right) \cdot 4}{z}\\ t_1 := \frac{\left(\left(x - y\right) - 0.5 \cdot z\right) \cdot 4}{z}\\ \mathbf{if}\;t\_1 \leq -1000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 400000000:\\ \;\;\;\;\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 y) 4.0) z)) (t_1 (/ (* (- (- x y) (* 0.5 z)) 4.0) z)))
   (if (<= t_1 -1000.0)
     t_0
     (if (<= t_1 400000000.0) (fma (/ -4.0 z) y -2.0) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = ((x - y) * 4.0) / z;
	double t_1 = (((x - y) - (0.5 * z)) * 4.0) / z;
	double tmp;
	if (t_1 <= -1000.0) {
		tmp = t_0;
	} else if (t_1 <= 400000000.0) {
		tmp = fma((-4.0 / z), y, -2.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(x - y) * 4.0) / z)
	t_1 = Float64(Float64(Float64(Float64(x - y) - Float64(0.5 * z)) * 4.0) / z)
	tmp = 0.0
	if (t_1 <= -1000.0)
		tmp = t_0;
	elseif (t_1 <= 400000000.0)
		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[(N[(x - y), $MachinePrecision] * 4.0), $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, -1000.0], t$95$0, If[LessEqual[t$95$1, 400000000.0], N[(N[(-4.0 / z), $MachinePrecision] * y + -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) < -1e3 or 4e8 < (/.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{4 \cdot \color{blue}{\left(x - y\right)}}{z} \]
   4. Step-by-step derivation

      1. lower--.f64 99.0

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

   5. Applied rewrites 99.0%

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

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

   1. Initial program 99.9%

      \[\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.4%

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

   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. metadata-eval N/A

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

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

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

      3. div-sub N/A

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

      4. sub-neg N/A

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

      5. associate-/l* N/A

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

      6. *-inverses N/A

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

      7. metadata-eval N/A

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

      8. metadata-eval N/A

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

      9. distribute-lft-in N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

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

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

      13. *-lft-identity N/A

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

      14. associate-*l/ N/A

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

      15. associate-*l* N/A

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

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

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

      17. lower-fma.f64 N/A

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

   8. Applied rewrites 99.2%

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

4. Final simplification 99.0%

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

Alternative 6: 66.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{-4}{z} \cdot y\\ t_1 := \frac{\left(\left(x - y\right) - 0.5 \cdot z\right) \cdot 4}{z}\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+19}:\\ \;\;\;\;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 z) y)) (t_1 (/ (* (- (- x y) (* 0.5 z)) 4.0) z)))
   (if (<= t_1 -2e+19) 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 / z) * y;
	double t_1 = (((x - y) - (0.5 * z)) * 4.0) / z;
	double tmp;
	if (t_1 <= -2e+19) {
		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) / z) * y
    t_1 = (((x - y) - (0.5d0 * z)) * 4.0d0) / z
    if (t_1 <= (-2d+19)) 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 / z) * y;
	double t_1 = (((x - y) - (0.5 * z)) * 4.0) / z;
	double tmp;
	if (t_1 <= -2e+19) {
		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 / z) * y
	t_1 = (((x - y) - (0.5 * z)) * 4.0) / z
	tmp = 0
	if t_1 <= -2e+19:
		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 / z) * y)
	t_1 = Float64(Float64(Float64(Float64(x - y) - Float64(0.5 * z)) * 4.0) / z)
	tmp = 0.0
	if (t_1 <= -2e+19)
		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 / z) * y;
	t_1 = (((x - y) - (0.5 * z)) * 4.0) / z;
	tmp = 0.0;
	if (t_1 <= -2e+19)
		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 / z), $MachinePrecision] * y), $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+19], 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) < -2e19 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 \color{blue}{-4 \cdot \frac{y}{z}} \]
   4. Step-by-step derivation

      1. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. metadata-eval N/A

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

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

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

      6. lower-*.f64 N/A

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

      7. associate-*r/ N/A

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

      8. metadata-eval N/A

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

      9. distribute-neg-frac N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 54.7

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

   5. Applied rewrites 54.7%

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

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

   1. Initial program 99.9%

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

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

4. Final simplification 68.4%

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

Alternative 7: 86.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- -0.5 (/ y z)) 4.0)))
   (if (<= y -2.2e+41)
     t_0
     (if (<= y 225000000.0) (fma (/ x z) 4.0 -2.0) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (-0.5 - (y / z)) * 4.0;
	double tmp;
	if (y <= -2.2e+41) {
		tmp = t_0;
	} else if (y <= 225000000.0) {
		tmp = fma((x / z), 4.0, -2.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.1999999999999999e41 or 2.25e8 < y

   1. Initial program 99.9%

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

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

   if -2.1999999999999999e41 < y < 2.25e8

   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 47.0%

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

   6. Taylor expanded in y around 0

      \[\leadsto \color{blue}{4 \cdot \frac{x - \frac{1}{2} \cdot z}{z}} \]
   7. 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-frac-neg N/A

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

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

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

      5. metadata-eval N/A

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

      6. distribute-lft-in N/A

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

      7. *-commutative N/A

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

      8. associate-/l* N/A

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

      9. *-inverses N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-/.f64 89.3

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

   8. Applied rewrites 89.3%

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

Alternative 8: 86.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma (/ -4.0 z) y -2.0)))
   (if (<= y -2.2e+41)
     t_0
     (if (<= y 225000000.0) (fma (/ x z) 4.0 -2.0) t_0))))

C

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

Julia

function code(x, y, z)
	t_0 = fma(Float64(-4.0 / z), y, -2.0)
	tmp = 0.0
	if (y <= -2.2e+41)
		tmp = t_0;
	elseif (y <= 225000000.0)
		tmp = fma(Float64(x / z), 4.0, -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] * y + -2.0), $MachinePrecision]}, If[LessEqual[y, -2.2e+41], t$95$0, If[LessEqual[y, 225000000.0], N[(N[(x / z), $MachinePrecision] * 4.0 + -2.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -2.1999999999999999e41 or 2.25e8 < y

   1. Initial program 99.9%

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

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

   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. metadata-eval N/A

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

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

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

      3. div-sub N/A

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

      4. sub-neg N/A

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

      5. associate-/l* N/A

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

      6. *-inverses N/A

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

      7. metadata-eval N/A

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

      8. metadata-eval N/A

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

      9. distribute-lft-in N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

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

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

      13. *-lft-identity N/A

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

      14. associate-*l/ N/A

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

      15. associate-*l* N/A

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

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

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

      17. lower-fma.f64 N/A

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

   8. Applied rewrites 88.2%

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

   if -2.1999999999999999e41 < y < 2.25e8

   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 47.0%

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

   6. Taylor expanded in y around 0

      \[\leadsto \color{blue}{4 \cdot \frac{x - \frac{1}{2} \cdot z}{z}} \]
   7. 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-frac-neg N/A

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

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

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

      5. metadata-eval N/A

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

      6. distribute-lft-in N/A

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

      7. *-commutative N/A

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

      8. associate-/l* N/A

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

      9. *-inverses N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-/.f64 89.3

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

   8. Applied rewrites 89.3%

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

Alternative 9: 86.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\frac{-4}{z}, y, -2\right)\\ \mathbf{if}\;y \leq -2.2 \cdot 10^{+41}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 225000000:\\ \;\;\;\;\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 (fma (/ -4.0 z) y -2.0)))
   (if (<= y -2.2e+41)
     t_0
     (if (<= y 225000000.0) (fma (/ 4.0 z) x -2.0) t_0))))

C

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

Julia

function code(x, y, z)
	t_0 = fma(Float64(-4.0 / z), y, -2.0)
	tmp = 0.0
	if (y <= -2.2e+41)
		tmp = t_0;
	elseif (y <= 225000000.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 / z), $MachinePrecision] * y + -2.0), $MachinePrecision]}, If[LessEqual[y, -2.2e+41], t$95$0, If[LessEqual[y, 225000000.0], N[(N[(4.0 / z), $MachinePrecision] * x + -2.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -2.1999999999999999e41 or 2.25e8 < y

   1. Initial program 99.9%

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

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

   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. metadata-eval N/A

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

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

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

      3. div-sub N/A

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

      4. sub-neg N/A

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

      5. associate-/l* N/A

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

      6. *-inverses N/A

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

      7. metadata-eval N/A

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

      8. metadata-eval N/A

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

      9. distribute-lft-in N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

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

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

      13. *-lft-identity N/A

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

      14. associate-*l/ N/A

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

      15. associate-*l* N/A

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

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

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

      17. lower-fma.f64 N/A

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

   8. Applied rewrites 88.2%

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

   if -2.1999999999999999e41 < y < 2.25e8

   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 89.1

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

   5. Applied rewrites 89.1%

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

Alternative 10: 79.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x \cdot 4}{z}\\ \mathbf{if}\;x \leq -5.6 \cdot 10^{+138}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 5.5 \cdot 10^{+221}:\\ \;\;\;\;\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 -5.6e+138) t_0 (if (<= x 5.5e+221) (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 <= -5.6e+138) {
		tmp = t_0;
	} else if (x <= 5.5e+221) {
		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 <= -5.6e+138)
		tmp = t_0;
	elseif (x <= 5.5e+221)
		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, -5.6e+138], t$95$0, If[LessEqual[x, 5.5e+221], N[(N[(-4.0 / z), $MachinePrecision] * y + -2.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -5.6000000000000002e138 or 5.5000000000000003e221 < 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. *-commutative N/A

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

      2. lower-*.f64 87.7

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

   5. Applied rewrites 87.7%

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

   if -5.6000000000000002e138 < x < 5.5000000000000003e221

   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 41.6%

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

   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. metadata-eval N/A

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

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

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

      3. div-sub N/A

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

      4. sub-neg N/A

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

      5. associate-/l* N/A

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

      6. *-inverses N/A

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

      7. metadata-eval N/A

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

      8. metadata-eval N/A

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

      9. distribute-lft-in N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

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

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

      13. *-lft-identity N/A

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

      14. associate-*l/ N/A

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

      15. associate-*l* N/A

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

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

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

      17. lower-fma.f64 N/A

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

   8. Applied rewrites 82.1%

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

Alternative 11: 33.9% 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 34.8%

   \[\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 2024270 
(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))