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

Percentage Accurate: 100.0% → 99.8%

Time: 7.4s

Alternatives: 9

Speedup: N/A×

• 20.8% 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: 100.0% 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: 99.8% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. +-commutative 99.6%

      \[\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. Add Preprocessing

Alternative 2: 84.1% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -2.9e+157) (not (<= y 1.9e+104)))
   (+ 2.0 (* 4.0 (/ x y)))
   (* 4.0 (/ (- x z) y))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.9e+157) || !(y <= 1.9e+104)) {
		tmp = 2.0 + (4.0 * (x / y));
	} else {
		tmp = 4.0 * ((x - z) / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -2.9e+157) or not (y <= 1.9e+104):
		tmp = 2.0 + (4.0 * (x / y))
	else:
		tmp = 4.0 * ((x - z) / y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -2.9e+157) || !(y <= 1.9e+104))
		tmp = Float64(2.0 + Float64(4.0 * Float64(x / y)));
	else
		tmp = Float64(4.0 * Float64(Float64(x - z) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -2.9e+157) || ~((y <= 1.9e+104)))
		tmp = 2.0 + (4.0 * (x / y));
	else
		tmp = 4.0 * ((x - z) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -2.9e+157], N[Not[LessEqual[y, 1.9e+104]], $MachinePrecision]], N[(2.0 + N[(4.0 * N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(4.0 * N[(N[(x - z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.89999999999999988e157 or 1.89999999999999984e104 < y

   1. Initial program 98.8%

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

      1. +-commutative 98.8%

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

      2. associate-*l/ 99.9%

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

      3. +-commutative 99.9%

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

      4. associate--l+ 99.9%

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

      5. +-commutative 99.9%

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

      6. distribute-lft-in 99.9%

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

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

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

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

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

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

      12. *-rgt-identity 99.9%

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

      13. *-inverses 99.9%

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

      14. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around 0 87.9%

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

   if -2.89999999999999988e157 < y < 1.89999999999999984e104

   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 0 87.0%

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

4. Final simplification 87.3%

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

Alternative 3: 84.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.7 \cdot 10^{+124}:\\ \;\;\;\;4 \cdot \frac{x - z}{y}\\ \mathbf{elif}\;x \leq 3.65 \cdot 10^{-22}:\\ \;\;\;\;2 + \frac{z}{y} \cdot -4\\ \mathbf{else}:\\ \;\;\;\;2 + \frac{4 \cdot x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -2.7e+124)
   (* 4.0 (/ (- x z) y))
   (if (<= x 3.65e-22) (+ 2.0 (* (/ z y) -4.0)) (+ 2.0 (/ (* 4.0 x) y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.7e+124) {
		tmp = 4.0 * ((x - z) / y);
	} else if (x <= 3.65e-22) {
		tmp = 2.0 + ((z / y) * -4.0);
	} else {
		tmp = 2.0 + ((4.0 * x) / 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 <= (-2.7d+124)) then
        tmp = 4.0d0 * ((x - z) / y)
    else if (x <= 3.65d-22) then
        tmp = 2.0d0 + ((z / y) * (-4.0d0))
    else
        tmp = 2.0d0 + ((4.0d0 * x) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.7e+124) {
		tmp = 4.0 * ((x - z) / y);
	} else if (x <= 3.65e-22) {
		tmp = 2.0 + ((z / y) * -4.0);
	} else {
		tmp = 2.0 + ((4.0 * x) / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -2.7e+124:
		tmp = 4.0 * ((x - z) / y)
	elif x <= 3.65e-22:
		tmp = 2.0 + ((z / y) * -4.0)
	else:
		tmp = 2.0 + ((4.0 * x) / y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -2.7e+124)
		tmp = Float64(4.0 * Float64(Float64(x - z) / y));
	elseif (x <= 3.65e-22)
		tmp = Float64(2.0 + Float64(Float64(z / y) * -4.0));
	else
		tmp = Float64(2.0 + Float64(Float64(4.0 * x) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -2.7e+124)
		tmp = 4.0 * ((x - z) / y);
	elseif (x <= 3.65e-22)
		tmp = 2.0 + ((z / y) * -4.0);
	else
		tmp = 2.0 + ((4.0 * x) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -2.7e+124], N[(4.0 * N[(N[(x - z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.65e-22], N[(2.0 + N[(N[(z / y), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision], N[(2.0 + N[(N[(4.0 * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.69999999999999978e124

   1. Initial program 97.1%

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

   3. Taylor expanded in y around 0 91.2%

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

   if -2.69999999999999978e124 < x < 3.65000000000000014e-22

   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. Taylor expanded in x around 0 91.9%

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

      1. *-commutative 91.9%

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

   7. Simplified 91.9%

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

   if 3.65000000000000014e-22 < 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.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. Taylor expanded in x around 0 96.3%

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

   6. Taylor expanded in z around 0 88.1%

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

      1. associate-*r/ 88.1%

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

   8. Simplified 88.1%

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

4. Final simplification 90.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.7 \cdot 10^{+124}:\\ \;\;\;\;4 \cdot \frac{x - z}{y}\\ \mathbf{elif}\;x \leq 3.65 \cdot 10^{-22}:\\ \;\;\;\;2 + \frac{z}{y} \cdot -4\\ \mathbf{else}:\\ \;\;\;\;2 + \frac{4 \cdot x}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 84.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3 \cdot 10^{+136}:\\ \;\;\;\;4 \cdot \frac{x - z}{y}\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-22}:\\ \;\;\;\;2 + \frac{z}{y} \cdot -4\\ \mathbf{else}:\\ \;\;\;\;2 + 4 \cdot \frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -3e+136)
   (* 4.0 (/ (- x z) y))
   (if (<= x 3.8e-22) (+ 2.0 (* (/ z y) -4.0)) (+ 2.0 (* 4.0 (/ x y))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -3e+136) {
		tmp = 4.0 * ((x - z) / y);
	} else if (x <= 3.8e-22) {
		tmp = 2.0 + ((z / y) * -4.0);
	} else {
		tmp = 2.0 + (4.0 * (x / 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 <= (-3d+136)) then
        tmp = 4.0d0 * ((x - z) / y)
    else if (x <= 3.8d-22) then
        tmp = 2.0d0 + ((z / y) * (-4.0d0))
    else
        tmp = 2.0d0 + (4.0d0 * (x / y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -3e+136) {
		tmp = 4.0 * ((x - z) / y);
	} else if (x <= 3.8e-22) {
		tmp = 2.0 + ((z / y) * -4.0);
	} else {
		tmp = 2.0 + (4.0 * (x / y));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -3e+136:
		tmp = 4.0 * ((x - z) / y)
	elif x <= 3.8e-22:
		tmp = 2.0 + ((z / y) * -4.0)
	else:
		tmp = 2.0 + (4.0 * (x / y))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -3e+136)
		tmp = Float64(4.0 * Float64(Float64(x - z) / y));
	elseif (x <= 3.8e-22)
		tmp = Float64(2.0 + Float64(Float64(z / y) * -4.0));
	else
		tmp = Float64(2.0 + Float64(4.0 * Float64(x / y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -3e+136)
		tmp = 4.0 * ((x - z) / y);
	elseif (x <= 3.8e-22)
		tmp = 2.0 + ((z / y) * -4.0);
	else
		tmp = 2.0 + (4.0 * (x / y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -3e+136], N[(4.0 * N[(N[(x - z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.8e-22], N[(2.0 + N[(N[(z / y), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision], N[(2.0 + N[(4.0 * N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.99999999999999979e136

   1. Initial program 97.1%

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

   3. Taylor expanded in y around 0 91.2%

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

   if -2.99999999999999979e136 < x < 3.80000000000000023e-22

   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. Taylor expanded in x around 0 91.9%

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

      1. *-commutative 91.9%

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

   7. Simplified 91.9%

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

   if 3.80000000000000023e-22 < 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.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. Taylor expanded in z around 0 88.1%

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

Alternative 5: 80.7% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.9e+159) 2.0 (if (<= y 4.7e+107) (* 4.0 (/ (- x z) y)) 2.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.9e+159) {
		tmp = 2.0;
	} else if (y <= 4.7e+107) {
		tmp = 4.0 * ((x - z) / 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 (y <= (-1.9d+159)) then
        tmp = 2.0d0
    else if (y <= 4.7d+107) then
        tmp = 4.0d0 * ((x - z) / 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 (y <= -1.9e+159) {
		tmp = 2.0;
	} else if (y <= 4.7e+107) {
		tmp = 4.0 * ((x - z) / y);
	} else {
		tmp = 2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -1.9e+159:
		tmp = 2.0
	elif y <= 4.7e+107:
		tmp = 4.0 * ((x - z) / y)
	else:
		tmp = 2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.9e+159)
		tmp = 2.0;
	elseif (y <= 4.7e+107)
		tmp = Float64(4.0 * Float64(Float64(x - z) / y));
	else
		tmp = 2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -1.9e+159)
		tmp = 2.0;
	elseif (y <= 4.7e+107)
		tmp = 4.0 * ((x - z) / y);
	else
		tmp = 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.9e+159], 2.0, If[LessEqual[y, 4.7e+107], N[(4.0 * N[(N[(x - z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], 2.0]]

Derivation

1. Split input into 2 regimes

2. if y < -1.89999999999999983e159 or 4.7000000000000001e107 < y

   1. Initial program 98.8%

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

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

   if -1.89999999999999983e159 < y < 4.7000000000000001e107

   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 0 87.0%

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

Alternative 6: 52.5% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -4e+69) (not (<= x 2.7e-22))) (* 4.0 (/ x y)) (* (/ z y) -4.0)))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -4e+69) || !(x <= 2.7e-22)) {
		tmp = 4.0 * (x / y);
	} else {
		tmp = (z / y) * -4.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -4e+69) or not (x <= 2.7e-22):
		tmp = 4.0 * (x / y)
	else:
		tmp = (z / y) * -4.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -4e+69) || !(x <= 2.7e-22))
		tmp = Float64(4.0 * Float64(x / y));
	else
		tmp = Float64(Float64(z / y) * -4.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -4e+69) || ~((x <= 2.7e-22)))
		tmp = 4.0 * (x / y);
	else
		tmp = (z / y) * -4.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -4e+69], N[Not[LessEqual[x, 2.7e-22]], $MachinePrecision]], N[(4.0 * N[(x / y), $MachinePrecision]), $MachinePrecision], N[(N[(z / y), $MachinePrecision] * -4.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -4.0000000000000003e69 or 2.7000000000000002e-22 < x

   1. Initial program 99.2%

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

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

   if -4.0000000000000003e69 < x < 2.7000000000000002e-22

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

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

      1. *-commutative 54.0%

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

   5. Simplified 54.0%

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

4. Final simplification 58.7%

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

Alternative 7: 52.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.75 \cdot 10^{+69} \lor \neg \left(x \leq 2.65 \cdot 10^{-23}\right):\\ \;\;\;\;4 \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{-4}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -2.75e+69) (not (<= x 2.65e-23)))
   (* 4.0 (/ x y))
   (* z (/ -4.0 y))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.75e+69) || !(x <= 2.65e-23)) {
		tmp = 4.0 * (x / y);
	} else {
		tmp = z * (-4.0 / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -2.75e+69) or not (x <= 2.65e-23):
		tmp = 4.0 * (x / y)
	else:
		tmp = z * (-4.0 / y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -2.75e+69) || !(x <= 2.65e-23))
		tmp = Float64(4.0 * Float64(x / y));
	else
		tmp = Float64(z * Float64(-4.0 / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -2.75e+69) || ~((x <= 2.65e-23)))
		tmp = 4.0 * (x / y);
	else
		tmp = z * (-4.0 / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -2.75e+69], N[Not[LessEqual[x, 2.65e-23]], $MachinePrecision]], N[(4.0 * N[(x / y), $MachinePrecision]), $MachinePrecision], N[(z * N[(-4.0 / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.75000000000000001e69 or 2.65000000000000021e-23 < x

   1. Initial program 99.2%

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

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

   if -2.75000000000000001e69 < x < 2.65000000000000021e-23

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

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

      1. associate-*r/ 54.0%

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

      2. *-commutative 54.0%

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

      3. associate-/l* 53.8%

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

   5. Simplified 53.8%

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

4. Final simplification 58.6%

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

Alternative 8: 53.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.8 \cdot 10^{+99}:\\ \;\;\;\;2\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-42}:\\ \;\;\;\;4 \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -7.8e+99) 2.0 (if (<= y 8.5e-42) (* 4.0 (/ x y)) 2.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -7.8e+99) {
		tmp = 2.0;
	} else if (y <= 8.5e-42) {
		tmp = 4.0 * (x / 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 (y <= (-7.8d+99)) then
        tmp = 2.0d0
    else if (y <= 8.5d-42) then
        tmp = 4.0d0 * (x / 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 (y <= -7.8e+99) {
		tmp = 2.0;
	} else if (y <= 8.5e-42) {
		tmp = 4.0 * (x / y);
	} else {
		tmp = 2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -7.8e+99:
		tmp = 2.0
	elif y <= 8.5e-42:
		tmp = 4.0 * (x / y)
	else:
		tmp = 2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -7.8e+99)
		tmp = 2.0;
	elseif (y <= 8.5e-42)
		tmp = Float64(4.0 * Float64(x / y));
	else
		tmp = 2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -7.8e+99)
		tmp = 2.0;
	elseif (y <= 8.5e-42)
		tmp = 4.0 * (x / y);
	else
		tmp = 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -7.8e+99], 2.0, If[LessEqual[y, 8.5e-42], N[(4.0 * N[(x / y), $MachinePrecision]), $MachinePrecision], 2.0]]

Derivation

1. Split input into 2 regimes

2. if y < -7.79999999999999989e99 or 8.4999999999999996e-42 < y

   1. Initial program 99.1%

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

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

   if -7.79999999999999989e99 < y < 8.4999999999999996e-42

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

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

Alternative 9: 34.9% 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 99.6%

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

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

Reproduce

herbie shell --seed 2024137 
(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)))