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

Percentage Accurate: 99.9% → 100.0%

Time: 6.3s

Alternatives: 9

Speedup: 1.4×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \frac{x - z}{y \cdot 0.25} + 2 \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. +-commutative 100.0%

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

   2. associate-*l/ 99.8%

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

   3. +-commutative 99.8%

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

   4. associate--l+ 99.8%

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

   5. +-commutative 99.8%

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

   6. distribute-lft-in 99.8%

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

   7. associate-+l+ 99.8%

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

   8. associate-*l/ 99.8%

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

   9. *-commutative 99.8%

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

   10. associate-*l* 99.8%

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

   11. metadata-eval 99.8%

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

   12. *-rgt-identity 99.8%

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

   13. *-inverses 99.8%

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

   14. metadata-eval 99.8%

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

3. Simplified 99.8%

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

   1. clear-num 99.8%

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

   2. div-inv 99.8%

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

   3. metadata-eval 99.8%

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

   4. associate-*l/ 100.0%

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

   5. *-un-lft-identity 100.0%

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

6. Applied egg-rr 100.0%

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

7. Final simplification 100.0%

   \[\leadsto \frac{x - z}{y \cdot 0.25} + 2 \]
8. Add Preprocessing

Alternative 2: 58.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 + z \cdot \frac{-4}{y}\\ t_1 := 1 + \frac{x \cdot 4}{y}\\ \mathbf{if}\;x \leq -4.7 \cdot 10^{+80}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq -1.55 \cdot 10^{-184}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -4.7 \cdot 10^{-245}:\\ \;\;\;\;2\\ \mathbf{elif}\;x \leq 1.85 \cdot 10^{-29}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 8.8 \cdot 10^{+101}:\\ \;\;\;\;2\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ 1.0 (* z (/ -4.0 y)))) (t_1 (+ 1.0 (/ (* x 4.0) y))))
   (if (<= x -4.7e+80)
     t_1
     (if (<= x -1.55e-184)
       t_0
       (if (<= x -4.7e-245)
         2.0
         (if (<= x 1.85e-29) t_0 (if (<= x 8.8e+101) 2.0 t_1)))))))

C

double code(double x, double y, double z) {
	double t_0 = 1.0 + (z * (-4.0 / y));
	double t_1 = 1.0 + ((x * 4.0) / y);
	double tmp;
	if (x <= -4.7e+80) {
		tmp = t_1;
	} else if (x <= -1.55e-184) {
		tmp = t_0;
	} else if (x <= -4.7e-245) {
		tmp = 2.0;
	} else if (x <= 1.85e-29) {
		tmp = t_0;
	} else if (x <= 8.8e+101) {
		tmp = 2.0;
	} else {
		tmp = t_1;
	}
	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 = 1.0d0 + (z * ((-4.0d0) / y))
    t_1 = 1.0d0 + ((x * 4.0d0) / y)
    if (x <= (-4.7d+80)) then
        tmp = t_1
    else if (x <= (-1.55d-184)) then
        tmp = t_0
    else if (x <= (-4.7d-245)) then
        tmp = 2.0d0
    else if (x <= 1.85d-29) then
        tmp = t_0
    else if (x <= 8.8d+101) then
        tmp = 2.0d0
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = 1.0 + (z * (-4.0 / y));
	double t_1 = 1.0 + ((x * 4.0) / y);
	double tmp;
	if (x <= -4.7e+80) {
		tmp = t_1;
	} else if (x <= -1.55e-184) {
		tmp = t_0;
	} else if (x <= -4.7e-245) {
		tmp = 2.0;
	} else if (x <= 1.85e-29) {
		tmp = t_0;
	} else if (x <= 8.8e+101) {
		tmp = 2.0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = 1.0 + (z * (-4.0 / y))
	t_1 = 1.0 + ((x * 4.0) / y)
	tmp = 0
	if x <= -4.7e+80:
		tmp = t_1
	elif x <= -1.55e-184:
		tmp = t_0
	elif x <= -4.7e-245:
		tmp = 2.0
	elif x <= 1.85e-29:
		tmp = t_0
	elif x <= 8.8e+101:
		tmp = 2.0
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(1.0 + Float64(z * Float64(-4.0 / y)))
	t_1 = Float64(1.0 + Float64(Float64(x * 4.0) / y))
	tmp = 0.0
	if (x <= -4.7e+80)
		tmp = t_1;
	elseif (x <= -1.55e-184)
		tmp = t_0;
	elseif (x <= -4.7e-245)
		tmp = 2.0;
	elseif (x <= 1.85e-29)
		tmp = t_0;
	elseif (x <= 8.8e+101)
		tmp = 2.0;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = 1.0 + (z * (-4.0 / y));
	t_1 = 1.0 + ((x * 4.0) / y);
	tmp = 0.0;
	if (x <= -4.7e+80)
		tmp = t_1;
	elseif (x <= -1.55e-184)
		tmp = t_0;
	elseif (x <= -4.7e-245)
		tmp = 2.0;
	elseif (x <= 1.85e-29)
		tmp = t_0;
	elseif (x <= 8.8e+101)
		tmp = 2.0;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(1.0 + N[(z * N[(-4.0 / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[(N[(x * 4.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -4.7e+80], t$95$1, If[LessEqual[x, -1.55e-184], t$95$0, If[LessEqual[x, -4.7e-245], 2.0, If[LessEqual[x, 1.85e-29], t$95$0, If[LessEqual[x, 8.8e+101], 2.0, t$95$1]]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.70000000000000009e80 or 8.8000000000000003e101 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 77.3%

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

   if -4.70000000000000009e80 < x < -1.5500000000000001e-184 or -4.7000000000000002e-245 < x < 1.8499999999999999e-29

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf 60.9%

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

      1. associate-*r/ 60.9%

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

      2. metadata-eval 60.9%

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

      3. associate-*r* 60.9%

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

      4. neg-mul-1 60.9%

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

      5. associate-*l/ 60.7%

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

      6. *-commutative 60.7%

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

      7. distribute-lft-neg-out 60.7%

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

      8. distribute-rgt-neg-in 60.7%

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

      9. distribute-neg-frac 60.7%

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

      10. metadata-eval 60.7%

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

   5. Simplified 60.7%

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

   if -1.5500000000000001e-184 < x < -4.7000000000000002e-245 or 1.8499999999999999e-29 < x < 8.8000000000000003e101

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 65.6%

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

4. Final simplification 68.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.7 \cdot 10^{+80}:\\ \;\;\;\;1 + \frac{x \cdot 4}{y}\\ \mathbf{elif}\;x \leq -1.55 \cdot 10^{-184}:\\ \;\;\;\;1 + z \cdot \frac{-4}{y}\\ \mathbf{elif}\;x \leq -4.7 \cdot 10^{-245}:\\ \;\;\;\;2\\ \mathbf{elif}\;x \leq 1.85 \cdot 10^{-29}:\\ \;\;\;\;1 + z \cdot \frac{-4}{y}\\ \mathbf{elif}\;x \leq 8.8 \cdot 10^{+101}:\\ \;\;\;\;2\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{x \cdot 4}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 58.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 + \frac{z \cdot -4}{y}\\ t_1 := 1 + \frac{x \cdot 4}{y}\\ \mathbf{if}\;x \leq -1.7 \cdot 10^{+76}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq -6.5 \cdot 10^{-186}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -5.2 \cdot 10^{-240}:\\ \;\;\;\;2\\ \mathbf{elif}\;x \leq 6.8 \cdot 10^{-29}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 6.2 \cdot 10^{+99}:\\ \;\;\;\;2\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ 1.0 (/ (* z -4.0) y))) (t_1 (+ 1.0 (/ (* x 4.0) y))))
   (if (<= x -1.7e+76)
     t_1
     (if (<= x -6.5e-186)
       t_0
       (if (<= x -5.2e-240)
         2.0
         (if (<= x 6.8e-29) t_0 (if (<= x 6.2e+99) 2.0 t_1)))))))

C

double code(double x, double y, double z) {
	double t_0 = 1.0 + ((z * -4.0) / y);
	double t_1 = 1.0 + ((x * 4.0) / y);
	double tmp;
	if (x <= -1.7e+76) {
		tmp = t_1;
	} else if (x <= -6.5e-186) {
		tmp = t_0;
	} else if (x <= -5.2e-240) {
		tmp = 2.0;
	} else if (x <= 6.8e-29) {
		tmp = t_0;
	} else if (x <= 6.2e+99) {
		tmp = 2.0;
	} else {
		tmp = t_1;
	}
	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 = 1.0d0 + ((z * (-4.0d0)) / y)
    t_1 = 1.0d0 + ((x * 4.0d0) / y)
    if (x <= (-1.7d+76)) then
        tmp = t_1
    else if (x <= (-6.5d-186)) then
        tmp = t_0
    else if (x <= (-5.2d-240)) then
        tmp = 2.0d0
    else if (x <= 6.8d-29) then
        tmp = t_0
    else if (x <= 6.2d+99) then
        tmp = 2.0d0
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = 1.0 + ((z * -4.0) / y);
	double t_1 = 1.0 + ((x * 4.0) / y);
	double tmp;
	if (x <= -1.7e+76) {
		tmp = t_1;
	} else if (x <= -6.5e-186) {
		tmp = t_0;
	} else if (x <= -5.2e-240) {
		tmp = 2.0;
	} else if (x <= 6.8e-29) {
		tmp = t_0;
	} else if (x <= 6.2e+99) {
		tmp = 2.0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = 1.0 + ((z * -4.0) / y)
	t_1 = 1.0 + ((x * 4.0) / y)
	tmp = 0
	if x <= -1.7e+76:
		tmp = t_1
	elif x <= -6.5e-186:
		tmp = t_0
	elif x <= -5.2e-240:
		tmp = 2.0
	elif x <= 6.8e-29:
		tmp = t_0
	elif x <= 6.2e+99:
		tmp = 2.0
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(1.0 + Float64(Float64(z * -4.0) / y))
	t_1 = Float64(1.0 + Float64(Float64(x * 4.0) / y))
	tmp = 0.0
	if (x <= -1.7e+76)
		tmp = t_1;
	elseif (x <= -6.5e-186)
		tmp = t_0;
	elseif (x <= -5.2e-240)
		tmp = 2.0;
	elseif (x <= 6.8e-29)
		tmp = t_0;
	elseif (x <= 6.2e+99)
		tmp = 2.0;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = 1.0 + ((z * -4.0) / y);
	t_1 = 1.0 + ((x * 4.0) / y);
	tmp = 0.0;
	if (x <= -1.7e+76)
		tmp = t_1;
	elseif (x <= -6.5e-186)
		tmp = t_0;
	elseif (x <= -5.2e-240)
		tmp = 2.0;
	elseif (x <= 6.8e-29)
		tmp = t_0;
	elseif (x <= 6.2e+99)
		tmp = 2.0;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(1.0 + N[(N[(z * -4.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[(N[(x * 4.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.7e+76], t$95$1, If[LessEqual[x, -6.5e-186], t$95$0, If[LessEqual[x, -5.2e-240], 2.0, If[LessEqual[x, 6.8e-29], t$95$0, If[LessEqual[x, 6.2e+99], 2.0, t$95$1]]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.6999999999999999e76 or 6.2000000000000001e99 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 77.3%

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

   if -1.6999999999999999e76 < x < -6.49999999999999962e-186 or -5.19999999999999984e-240 < x < 6.79999999999999945e-29

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf 60.9%

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

      1. *-commutative 60.9%

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

      2. associate-*l/ 60.9%

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

   5. Simplified 60.9%

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

   if -6.49999999999999962e-186 < x < -5.19999999999999984e-240 or 6.79999999999999945e-29 < x < 6.2000000000000001e99

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 65.6%

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

4. Final simplification 68.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.7 \cdot 10^{+76}:\\ \;\;\;\;1 + \frac{x \cdot 4}{y}\\ \mathbf{elif}\;x \leq -6.5 \cdot 10^{-186}:\\ \;\;\;\;1 + \frac{z \cdot -4}{y}\\ \mathbf{elif}\;x \leq -5.2 \cdot 10^{-240}:\\ \;\;\;\;2\\ \mathbf{elif}\;x \leq 6.8 \cdot 10^{-29}:\\ \;\;\;\;1 + \frac{z \cdot -4}{y}\\ \mathbf{elif}\;x \leq 6.2 \cdot 10^{+99}:\\ \;\;\;\;2\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{x \cdot 4}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 80.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.6 \cdot 10^{+82} \lor \neg \left(x \leq 8 \cdot 10^{+102}\right) \land \left(x \leq 1.95 \cdot 10^{+137} \lor \neg \left(x \leq 3.5 \cdot 10^{+167}\right)\right):\\ \;\;\;\;1 + \frac{x \cdot 4}{y}\\ \mathbf{else}:\\ \;\;\;\;2 + -4 \cdot \frac{z}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -5.6e+82)
         (and (not (<= x 8e+102)) (or (<= x 1.95e+137) (not (<= x 3.5e+167)))))
   (+ 1.0 (/ (* x 4.0) y))
   (+ 2.0 (* -4.0 (/ z y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.6e+82) || (!(x <= 8e+102) && ((x <= 1.95e+137) || !(x <= 3.5e+167)))) {
		tmp = 1.0 + ((x * 4.0) / y);
	} else {
		tmp = 2.0 + (-4.0 * (z / y));
	}
	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 <= (-5.6d+82)) .or. (.not. (x <= 8d+102)) .and. (x <= 1.95d+137) .or. (.not. (x <= 3.5d+167))) then
        tmp = 1.0d0 + ((x * 4.0d0) / y)
    else
        tmp = 2.0d0 + ((-4.0d0) * (z / y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.6e+82) || (!(x <= 8e+102) && ((x <= 1.95e+137) || !(x <= 3.5e+167)))) {
		tmp = 1.0 + ((x * 4.0) / y);
	} else {
		tmp = 2.0 + (-4.0 * (z / y));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -5.6e+82) or (not (x <= 8e+102) and ((x <= 1.95e+137) or not (x <= 3.5e+167))):
		tmp = 1.0 + ((x * 4.0) / y)
	else:
		tmp = 2.0 + (-4.0 * (z / y))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -5.6e+82) || (!(x <= 8e+102) && ((x <= 1.95e+137) || !(x <= 3.5e+167))))
		tmp = Float64(1.0 + Float64(Float64(x * 4.0) / y));
	else
		tmp = Float64(2.0 + Float64(-4.0 * Float64(z / y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -5.6e+82) || (~((x <= 8e+102)) && ((x <= 1.95e+137) || ~((x <= 3.5e+167)))))
		tmp = 1.0 + ((x * 4.0) / y);
	else
		tmp = 2.0 + (-4.0 * (z / y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -5.6e+82], And[N[Not[LessEqual[x, 8e+102]], $MachinePrecision], Or[LessEqual[x, 1.95e+137], N[Not[LessEqual[x, 3.5e+167]], $MachinePrecision]]]], N[(1.0 + N[(N[(x * 4.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(2.0 + N[(-4.0 * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -5.6000000000000001e82 or 7.99999999999999982e102 < x < 1.95000000000000015e137 or 3.49999999999999987e167 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 81.2%

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

   if -5.6000000000000001e82 < x < 7.99999999999999982e102 or 1.95000000000000015e137 < x < 3.49999999999999987e167

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. associate-*l/ 99.8%

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

      3. +-commutative 99.8%

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

      4. associate--l+ 99.8%

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

      5. +-commutative 99.8%

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

      6. distribute-lft-in 99.8%

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

      7. associate-+l+ 99.8%

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

      8. associate-*l/ 99.8%

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

      9. *-commutative 99.8%

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

      10. associate-*l* 99.8%

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

      11. metadata-eval 99.8%

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

      12. *-rgt-identity 99.8%

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

      13. *-inverses 99.8%

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

      14. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

      1. clear-num 99.8%

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

      2. div-inv 99.8%

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

      3. metadata-eval 99.8%

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

      4. associate-*l/ 100.0%

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

      5. *-un-lft-identity 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around 0 87.1%

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

4. Final simplification 84.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5.6 \cdot 10^{+82} \lor \neg \left(x \leq 8 \cdot 10^{+102}\right) \land \left(x \leq 1.95 \cdot 10^{+137} \lor \neg \left(x \leq 3.5 \cdot 10^{+167}\right)\right):\\ \;\;\;\;1 + \frac{x \cdot 4}{y}\\ \mathbf{else}:\\ \;\;\;\;2 + -4 \cdot \frac{z}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 53.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.8 \cdot 10^{+133} \lor \neg \left(z \leq 550\right):\\ \;\;\;\;1 + z \cdot \frac{-4}{y}\\ \mathbf{else}:\\ \;\;\;\;2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -5.8e+133) (not (<= z 550.0))) (+ 1.0 (* z (/ -4.0 y))) 2.0))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -5.8e+133) || !(z <= 550.0)) {
		tmp = 1.0 + (z * (-4.0 / y));
	} 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 <= (-5.8d+133)) .or. (.not. (z <= 550.0d0))) then
        tmp = 1.0d0 + (z * ((-4.0d0) / y))
    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 <= -5.8e+133) || !(z <= 550.0)) {
		tmp = 1.0 + (z * (-4.0 / y));
	} else {
		tmp = 2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -5.8e+133) or not (z <= 550.0):
		tmp = 1.0 + (z * (-4.0 / y))
	else:
		tmp = 2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -5.8e+133) || !(z <= 550.0))
		tmp = Float64(1.0 + Float64(z * Float64(-4.0 / y)));
	else
		tmp = 2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -5.8e+133) || ~((z <= 550.0)))
		tmp = 1.0 + (z * (-4.0 / y));
	else
		tmp = 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -5.8e+133], N[Not[LessEqual[z, 550.0]], $MachinePrecision]], N[(1.0 + N[(z * N[(-4.0 / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0]

Derivation

1. Split input into 2 regimes

2. if z < -5.8000000000000002e133 or 550 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf 70.5%

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

      1. associate-*r/ 70.5%

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

      2. metadata-eval 70.5%

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

      3. associate-*r* 70.5%

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

      4. neg-mul-1 70.5%

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

      5. associate-*l/ 70.3%

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

      6. *-commutative 70.3%

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

      7. distribute-lft-neg-out 70.3%

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

      8. distribute-rgt-neg-in 70.3%

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

      9. distribute-neg-frac 70.3%

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

      10. metadata-eval 70.3%

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

   5. Simplified 70.3%

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

   if -5.8000000000000002e133 < z < 550

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 43.8%

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

4. Final simplification 54.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -5.8 \cdot 10^{+133} \lor \neg \left(z \leq 550\right):\\ \;\;\;\;1 + z \cdot \frac{-4}{y}\\ \mathbf{else}:\\ \;\;\;\;2\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 85.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -8.2 \cdot 10^{+76} \lor \neg \left(x \leq 1.65 \cdot 10^{-82}\right):\\ \;\;\;\;2 + 4 \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;2 + -4 \cdot \frac{z}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -8.2e+76) (not (<= x 1.65e-82)))
   (+ 2.0 (* 4.0 (/ x y)))
   (+ 2.0 (* -4.0 (/ z y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -8.2e+76) || !(x <= 1.65e-82)) {
		tmp = 2.0 + (4.0 * (x / y));
	} else {
		tmp = 2.0 + (-4.0 * (z / y));
	}
	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 <= (-8.2d+76)) .or. (.not. (x <= 1.65d-82))) then
        tmp = 2.0d0 + (4.0d0 * (x / y))
    else
        tmp = 2.0d0 + ((-4.0d0) * (z / y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -8.2e+76) || !(x <= 1.65e-82)) {
		tmp = 2.0 + (4.0 * (x / y));
	} else {
		tmp = 2.0 + (-4.0 * (z / y));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -8.2e+76) or not (x <= 1.65e-82):
		tmp = 2.0 + (4.0 * (x / y))
	else:
		tmp = 2.0 + (-4.0 * (z / y))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -8.2e+76) || !(x <= 1.65e-82))
		tmp = Float64(2.0 + Float64(4.0 * Float64(x / y)));
	else
		tmp = Float64(2.0 + Float64(-4.0 * Float64(z / y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -8.2e+76) || ~((x <= 1.65e-82)))
		tmp = 2.0 + (4.0 * (x / y));
	else
		tmp = 2.0 + (-4.0 * (z / y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -8.2e+76], N[Not[LessEqual[x, 1.65e-82]], $MachinePrecision]], N[(2.0 + N[(4.0 * N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 + N[(-4.0 * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -8.1999999999999997e76 or 1.65000000000000011e-82 < x

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. associate-*l/ 99.7%

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

      3. +-commutative 99.7%

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

      4. associate--l+ 99.7%

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

      5. +-commutative 99.7%

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

      6. distribute-lft-in 99.7%

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

      7. associate-+l+ 99.8%

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

      8. associate-*l/ 99.8%

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

      9. *-commutative 99.8%

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

      10. associate-*l* 99.8%

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

      11. metadata-eval 99.8%

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

      12. *-rgt-identity 99.8%

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

      13. *-inverses 99.8%

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

      14. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

      1. clear-num 99.8%

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

      2. div-inv 99.8%

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

      3. metadata-eval 99.8%

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

      4. associate-*l/ 100.0%

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

      5. *-un-lft-identity 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around inf 87.7%

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

   if -8.1999999999999997e76 < x < 1.65000000000000011e-82

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. associate-*l/ 99.8%

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

      3. +-commutative 99.8%

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

      4. associate--l+ 99.8%

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

      5. +-commutative 99.8%

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

      6. distribute-lft-in 99.8%

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

      7. associate-+l+ 99.8%

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

      8. associate-*l/ 99.8%

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

      9. *-commutative 99.8%

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

      10. associate-*l* 99.8%

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

      11. metadata-eval 99.8%

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

      12. *-rgt-identity 99.8%

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

      13. *-inverses 99.8%

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

      14. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

      1. clear-num 99.8%

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

      2. div-inv 99.8%

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

      3. metadata-eval 99.8%

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

      4. associate-*l/ 100.0%

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

      5. *-un-lft-identity 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around 0 92.1%

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

4. Final simplification 89.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -8.2 \cdot 10^{+76} \lor \neg \left(x \leq 1.65 \cdot 10^{-82}\right):\\ \;\;\;\;2 + 4 \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;2 + -4 \cdot \frac{z}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 99.8% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. +-commutative 100.0%

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

   2. associate-*l/ 99.8%

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

   3. +-commutative 99.8%

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

   4. associate--l+ 99.8%

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

   5. +-commutative 99.8%

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

   6. distribute-lft-in 99.8%

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

   7. associate-+l+ 99.8%

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

   8. associate-*l/ 99.8%

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

   9. *-commutative 99.8%

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

   10. associate-*l* 99.8%

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

   11. metadata-eval 99.8%

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

   12. *-rgt-identity 99.8%

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

   13. *-inverses 99.8%

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

   14. metadata-eval 99.8%

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

3. Simplified 99.8%

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

5. Final simplification 99.8%

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

Alternative 8: 8.1% accurate, 13.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

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

C

double code(double x, double y, double z) {
	return 1.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 = 1.0d0
end function

Java

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

Python

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

Julia

function code(x, y, z)
	return 1.0
end

MATLAB

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

Wolfram

code[x_, y_, z_] := 1.0

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in x around inf 43.1%

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

4. Taylor expanded in x around 0 7.6%

   \[\leadsto \color{blue}{1} \]

5. Final simplification 7.6%

   \[\leadsto 1 \]
6. Add Preprocessing

Alternative 9: 33.8% accurate, 13.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%

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

3. Taylor expanded in y around inf 31.7%

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

4. Final simplification 31.7%

   \[\leadsto 2 \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024055 
(FPCore (x y z)
  :name "Data.Array.Repa.Algorithms.ColorRamp:rampColorHotToCold from repa-algorithms-3.4.0.1, C"
  :precision binary64
  (+ 1.0 (/ (* 4.0 (- (+ x (* y 0.25)) z)) y)))