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

Percentage Accurate: 99.8% → 100.0%

Time: 6.7s

Alternatives: 8

Speedup: 1.4×

• 20.6% 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.75\right) - z\right)}{y} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(4, 0.75 + \frac{x - z}{y}, 1\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma 4.0 (+ 0.75 (/ (- x z) y)) 1.0))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. +-commutative 99.9%

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

   2. associate-/l* 99.9%

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

   3. fma-define 99.9%

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

   4. associate--l+ 99.9%

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

   5. +-commutative 99.9%

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

   6. remove-double-neg 99.9%

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

   7. sub-neg 99.9%

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

   8. associate--r+ 99.9%

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

   9. div-sub 99.9%

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

   10. sub-neg 99.9%

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

   11. associate-*l/ 100.0%

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

   12. *-inverses 100.0%

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

   13. metadata-eval 100.0%

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

   14. distribute-frac-neg2 100.0%

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

   15. remove-double-neg 100.0%

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

   16. distribute-neg-out 100.0%

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

   17. +-commutative 100.0%

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

   18. sub-neg 100.0%

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

   19. distribute-frac-neg 100.0%

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

   20. distribute-frac-neg2 100.0%

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

   21. remove-double-neg 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(4, 0.75 + \frac{x - z}{y}, 1\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 53.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{z}{y} \cdot -4\\ t_1 := 4 \cdot \frac{x}{y}\\ \mathbf{if}\;z \leq -6 \cdot 10^{+62}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 3.3 \cdot 10^{-306}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.4 \cdot 10^{-137}:\\ \;\;\;\;4\\ \mathbf{elif}\;z \leq 1.15 \cdot 10^{+21}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (/ z y) -4.0)) (t_1 (* 4.0 (/ x y))))
   (if (<= z -6e+62)
     t_0
     (if (<= z 3.3e-306)
       t_1
       (if (<= z 2.4e-137) 4.0 (if (<= z 1.15e+21) t_1 t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = (z / y) * -4.0;
	double t_1 = 4.0 * (x / y);
	double tmp;
	if (z <= -6e+62) {
		tmp = t_0;
	} else if (z <= 3.3e-306) {
		tmp = t_1;
	} else if (z <= 2.4e-137) {
		tmp = 4.0;
	} else if (z <= 1.15e+21) {
		tmp = t_1;
	} 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 = (z / y) * (-4.0d0)
    t_1 = 4.0d0 * (x / y)
    if (z <= (-6d+62)) then
        tmp = t_0
    else if (z <= 3.3d-306) then
        tmp = t_1
    else if (z <= 2.4d-137) then
        tmp = 4.0d0
    else if (z <= 1.15d+21) then
        tmp = t_1
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (z / y) * -4.0;
	double t_1 = 4.0 * (x / y);
	double tmp;
	if (z <= -6e+62) {
		tmp = t_0;
	} else if (z <= 3.3e-306) {
		tmp = t_1;
	} else if (z <= 2.4e-137) {
		tmp = 4.0;
	} else if (z <= 1.15e+21) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (z / y) * -4.0
	t_1 = 4.0 * (x / y)
	tmp = 0
	if z <= -6e+62:
		tmp = t_0
	elif z <= 3.3e-306:
		tmp = t_1
	elif z <= 2.4e-137:
		tmp = 4.0
	elif z <= 1.15e+21:
		tmp = t_1
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(z / y) * -4.0)
	t_1 = Float64(4.0 * Float64(x / y))
	tmp = 0.0
	if (z <= -6e+62)
		tmp = t_0;
	elseif (z <= 3.3e-306)
		tmp = t_1;
	elseif (z <= 2.4e-137)
		tmp = 4.0;
	elseif (z <= 1.15e+21)
		tmp = t_1;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (z / y) * -4.0;
	t_1 = 4.0 * (x / y);
	tmp = 0.0;
	if (z <= -6e+62)
		tmp = t_0;
	elseif (z <= 3.3e-306)
		tmp = t_1;
	elseif (z <= 2.4e-137)
		tmp = 4.0;
	elseif (z <= 1.15e+21)
		tmp = t_1;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(z / y), $MachinePrecision] * -4.0), $MachinePrecision]}, Block[{t$95$1 = N[(4.0 * N[(x / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -6e+62], t$95$0, If[LessEqual[z, 3.3e-306], t$95$1, If[LessEqual[z, 2.4e-137], 4.0, If[LessEqual[z, 1.15e+21], t$95$1, t$95$0]]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -6e62 or 1.15e21 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf 67.8%

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

      1. *-commutative 67.8%

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

   5. Simplified 67.8%

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

   if -6e62 < z < 3.3000000000000001e-306 or 2.4e-137 < z < 1.15e21

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf 53.8%

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

   if 3.3000000000000001e-306 < z < 2.4e-137

   1. Initial program 99.8%

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

   3. Taylor expanded in y around inf 66.0%

      \[\leadsto \color{blue}{4} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 85.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6.2 \cdot 10^{+45} \lor \neg \left(y \leq 8.6 \cdot 10^{+99}\right):\\ \;\;\;\;4 + x \cdot \frac{4}{y}\\ \mathbf{else}:\\ \;\;\;\;\left(x - z\right) \cdot \frac{4}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -6.2e+45) (not (<= y 8.6e+99)))
   (+ 4.0 (* x (/ 4.0 y)))
   (* (- x z) (/ 4.0 y))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -6.2e+45) || !(y <= 8.6e+99)) {
		tmp = 4.0 + (x * (4.0 / y));
	} else {
		tmp = (x - z) * (4.0 / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -6.2e+45) or not (y <= 8.6e+99):
		tmp = 4.0 + (x * (4.0 / y))
	else:
		tmp = (x - z) * (4.0 / y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -6.2e+45) || !(y <= 8.6e+99))
		tmp = Float64(4.0 + Float64(x * Float64(4.0 / y)));
	else
		tmp = Float64(Float64(x - z) * Float64(4.0 / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -6.2e+45) || ~((y <= 8.6e+99)))
		tmp = 4.0 + (x * (4.0 / y));
	else
		tmp = (x - z) * (4.0 / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -6.2e+45], N[Not[LessEqual[y, 8.6e+99]], $MachinePrecision]], N[(4.0 + N[(x * N[(4.0 / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x - z), $MachinePrecision] * N[(4.0 / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -6.19999999999999975e45 or 8.6000000000000003e99 < y

   1. Initial program 99.8%

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

      1. +-commutative 99.8%

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

      2. associate-/l* 99.8%

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

      3. fma-define 99.8%

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

      4. associate--l+ 99.8%

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

      5. +-commutative 99.8%

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

      6. remove-double-neg 99.8%

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

      7. sub-neg 99.8%

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

      8. associate--r+ 99.8%

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

      9. div-sub 99.8%

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

      10. sub-neg 99.8%

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

      11. associate-*l/ 100.0%

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

      12. *-inverses 100.0%

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

      13. metadata-eval 100.0%

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

      14. distribute-frac-neg2 100.0%

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

      15. remove-double-neg 100.0%

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

      16. distribute-neg-out 100.0%

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

      17. +-commutative 100.0%

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

      18. sub-neg 100.0%

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

      19. distribute-frac-neg 100.0%

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

      20. distribute-frac-neg2 100.0%

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

      21. remove-double-neg 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(4, 0.75 + \frac{x - z}{y}, 1\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 86.7%

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

      1. distribute-lft-in 86.7%

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

      2. metadata-eval 86.7%

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

      3. associate-+r+ 86.7%

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

      4. metadata-eval 86.7%

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

      5. associate-*r/ 86.7%

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

      6. *-commutative 86.7%

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

      7. associate-*r/ 86.6%

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

   7. Simplified 86.6%

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

   if -6.19999999999999975e45 < y < 8.6000000000000003e99

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 91.3%

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

      1. *-lft-identity 91.3%

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

      2. associate-*l/ 91.1%

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

      3. associate-*r* 91.1%

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

      4. associate-*r/ 91.1%

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

      5. metadata-eval 91.1%

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

   5. Simplified 91.1%

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

4. Final simplification 89.3%

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

Alternative 4: 85.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.2 \cdot 10^{+47}:\\ \;\;\;\;4 + x \cdot \frac{4}{y}\\ \mathbf{elif}\;y \leq 4.1 \cdot 10^{+99}:\\ \;\;\;\;\left(x - z\right) \cdot \frac{4}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{4 \cdot \left(x + y\right)}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.2e+47)
   (+ 4.0 (* x (/ 4.0 y)))
   (if (<= y 4.1e+99) (* (- x z) (/ 4.0 y)) (/ (* 4.0 (+ x y)) y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.2e+47) {
		tmp = 4.0 + (x * (4.0 / y));
	} else if (y <= 4.1e+99) {
		tmp = (x - z) * (4.0 / y);
	} else {
		tmp = (4.0 * (x + y)) / 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 (y <= (-1.2d+47)) then
        tmp = 4.0d0 + (x * (4.0d0 / y))
    else if (y <= 4.1d+99) then
        tmp = (x - z) * (4.0d0 / y)
    else
        tmp = (4.0d0 * (x + y)) / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.2e+47) {
		tmp = 4.0 + (x * (4.0 / y));
	} else if (y <= 4.1e+99) {
		tmp = (x - z) * (4.0 / y);
	} else {
		tmp = (4.0 * (x + y)) / y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -1.2e+47:
		tmp = 4.0 + (x * (4.0 / y))
	elif y <= 4.1e+99:
		tmp = (x - z) * (4.0 / y)
	else:
		tmp = (4.0 * (x + y)) / y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.2e+47)
		tmp = Float64(4.0 + Float64(x * Float64(4.0 / y)));
	elseif (y <= 4.1e+99)
		tmp = Float64(Float64(x - z) * Float64(4.0 / y));
	else
		tmp = Float64(Float64(4.0 * Float64(x + y)) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -1.2e+47)
		tmp = 4.0 + (x * (4.0 / y));
	elseif (y <= 4.1e+99)
		tmp = (x - z) * (4.0 / y);
	else
		tmp = (4.0 * (x + y)) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.2e+47], N[(4.0 + N[(x * N[(4.0 / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4.1e+99], N[(N[(x - z), $MachinePrecision] * N[(4.0 / y), $MachinePrecision]), $MachinePrecision], N[(N[(4.0 * N[(x + y), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.20000000000000009e47

   1. Initial program 99.7%

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

      1. +-commutative 99.7%

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

      2. associate-/l* 99.7%

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

      3. fma-define 99.7%

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

      4. associate--l+ 99.7%

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

      5. +-commutative 99.7%

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

      6. remove-double-neg 99.7%

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

      7. sub-neg 99.7%

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

      8. associate--r+ 99.7%

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

      9. div-sub 99.8%

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

      10. sub-neg 99.8%

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

      11. associate-*l/ 100.0%

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

      12. *-inverses 100.0%

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

      13. metadata-eval 100.0%

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

      14. distribute-frac-neg2 100.0%

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

      15. remove-double-neg 100.0%

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

      16. distribute-neg-out 100.0%

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

      17. +-commutative 100.0%

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

      18. sub-neg 100.0%

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

      19. distribute-frac-neg 100.0%

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

      20. distribute-frac-neg2 100.0%

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

      21. remove-double-neg 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(4, 0.75 + \frac{x - z}{y}, 1\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 88.8%

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

      1. distribute-lft-in 88.8%

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

      2. metadata-eval 88.8%

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

      3. associate-+r+ 88.8%

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

      4. metadata-eval 88.8%

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

      5. associate-*r/ 88.8%

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

      6. *-commutative 88.8%

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

      7. associate-*r/ 88.8%

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

   7. Simplified 88.8%

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

   if -1.20000000000000009e47 < y < 4.09999999999999979e99

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 91.3%

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

      1. *-lft-identity 91.3%

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

      2. associate-*l/ 91.1%

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

      3. associate-*r* 91.1%

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

      4. associate-*r/ 91.1%

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

      5. metadata-eval 91.1%

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

   5. Simplified 91.1%

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

   if 4.09999999999999979e99 < y

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 99.9%

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

      1. distribute-lft-out 99.9%

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

   5. Simplified 99.9%

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

   6. Taylor expanded in x around inf 84.7%

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

4. Final simplification 89.3%

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

Alternative 5: 78.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.95 \cdot 10^{+149}:\\ \;\;\;\;4\\ \mathbf{elif}\;y \leq 6.9 \cdot 10^{+215}:\\ \;\;\;\;\left(x - z\right) \cdot \frac{4}{y}\\ \mathbf{else}:\\ \;\;\;\;4\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.95e+149) 4.0 (if (<= y 6.9e+215) (* (- x z) (/ 4.0 y)) 4.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.95e+149) {
		tmp = 4.0;
	} else if (y <= 6.9e+215) {
		tmp = (x - z) * (4.0 / y);
	} else {
		tmp = 4.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 (y <= (-1.95d+149)) then
        tmp = 4.0d0
    else if (y <= 6.9d+215) then
        tmp = (x - z) * (4.0d0 / y)
    else
        tmp = 4.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.95e+149) {
		tmp = 4.0;
	} else if (y <= 6.9e+215) {
		tmp = (x - z) * (4.0 / y);
	} else {
		tmp = 4.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -1.95e+149:
		tmp = 4.0
	elif y <= 6.9e+215:
		tmp = (x - z) * (4.0 / y)
	else:
		tmp = 4.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.95e+149)
		tmp = 4.0;
	elseif (y <= 6.9e+215)
		tmp = Float64(Float64(x - z) * Float64(4.0 / y));
	else
		tmp = 4.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -1.95e+149)
		tmp = 4.0;
	elseif (y <= 6.9e+215)
		tmp = (x - z) * (4.0 / y);
	else
		tmp = 4.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.95e+149], 4.0, If[LessEqual[y, 6.9e+215], N[(N[(x - z), $MachinePrecision] * N[(4.0 / y), $MachinePrecision]), $MachinePrecision], 4.0]]

Derivation

1. Split input into 2 regimes

2. if y < -1.95e149 or 6.8999999999999996e215 < y

   1. Initial program 99.8%

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

   3. Taylor expanded in y around inf 93.6%

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

   if -1.95e149 < y < 6.8999999999999996e215

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 83.3%

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

      1. *-lft-identity 83.3%

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

      2. associate-*l/ 83.1%

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

      3. associate-*r* 83.1%

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

      4. associate-*r/ 83.1%

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

      5. metadata-eval 83.1%

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

   5. Simplified 83.1%

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

4. Final simplification 85.3%

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

Alternative 6: 54.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8.5 \cdot 10^{+29}:\\ \;\;\;\;4\\ \mathbf{elif}\;y \leq 9.8 \cdot 10^{+86}:\\ \;\;\;\;4 \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;4\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -8.5e+29) 4.0 (if (<= y 9.8e+86) (* 4.0 (/ x y)) 4.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -8.5e+29) {
		tmp = 4.0;
	} else if (y <= 9.8e+86) {
		tmp = 4.0 * (x / y);
	} else {
		tmp = 4.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 (y <= (-8.5d+29)) then
        tmp = 4.0d0
    else if (y <= 9.8d+86) then
        tmp = 4.0d0 * (x / y)
    else
        tmp = 4.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -8.5e+29) {
		tmp = 4.0;
	} else if (y <= 9.8e+86) {
		tmp = 4.0 * (x / y);
	} else {
		tmp = 4.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -8.5e+29:
		tmp = 4.0
	elif y <= 9.8e+86:
		tmp = 4.0 * (x / y)
	else:
		tmp = 4.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -8.5e+29)
		tmp = 4.0;
	elseif (y <= 9.8e+86)
		tmp = Float64(4.0 * Float64(x / y));
	else
		tmp = 4.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -8.5e+29)
		tmp = 4.0;
	elseif (y <= 9.8e+86)
		tmp = 4.0 * (x / y);
	else
		tmp = 4.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -8.5e+29], 4.0, If[LessEqual[y, 9.8e+86], N[(4.0 * N[(x / y), $MachinePrecision]), $MachinePrecision], 4.0]]

Derivation

1. Split input into 2 regimes

2. if y < -8.5000000000000006e29 or 9.7999999999999999e86 < y

   1. Initial program 99.8%

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

   3. Taylor expanded in y around inf 68.0%

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

   if -8.5000000000000006e29 < y < 9.7999999999999999e86

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 44.4%

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

Alternative 7: 99.8% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in y around 0 100.0%

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

   1. distribute-lft-out 100.0%

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

5. Simplified 100.0%

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

6. Final simplification 100.0%

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

Alternative 8: 35.5% accurate, 13.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := 4.0

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in y around inf 33.1%

   \[\leadsto \color{blue}{4} \]
4. Add Preprocessing

Reproduce

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