Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, E

Percentage Accurate: 99.6% → 99.8%

Time: 2.7s

Alternatives: 11

Speedup: 1.1×

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

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return x + (((y - x) * 6.0) * z);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (((y - x) * 6.0d0) * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return x + (((y - x) * 6.0) * z);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (((y - x) * 6.0d0) * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y - x, z \cdot 6, x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma (- y x) (* z 6.0) x))

C

double code(double x, double y, double z) {
	return fma((y - x), (z * 6.0), x);
}

Julia

function code(x, y, z)
	return fma(Float64(y - x), Float64(z * 6.0), x)
end

Wolfram

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

Derivation

1. Initial program 99.6%

   \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
2. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift--.f64 N/A

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

   4. lower-+.f64 N/A

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

   5. +-commutative N/A

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

   6. associate-*l* N/A

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

   7. lower-fma.f64 N/A

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

   8. lift--.f64 N/A

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

   9. *-commutative N/A

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

   10. lower-*.f64 99.8

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

3. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y - x, z \cdot 6, x\right)} \]
4. Add Preprocessing

Alternative 2: 99.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\left(y - x\right) \cdot z, 6, x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma (* (- y x) z) 6.0 x))

C

double code(double x, double y, double z) {
	return fma(((y - x) * z), 6.0, x);
}

Julia

function code(x, y, z)
	return fma(Float64(Float64(y - x) * z), 6.0, x)
end

Wolfram

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

Derivation

1. Initial program 99.6%

   \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
2. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift--.f64 N/A

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

   5. *-commutative N/A

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

   6. associate-*r* N/A

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

   7. *-commutative N/A

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

   8. +-commutative N/A

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

   9. *-commutative N/A

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

   10. lower-fma.f64 N/A

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

   11. *-commutative N/A

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

   12. lower-*.f64 N/A

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

   13. lift--.f64 99.8

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

3. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\left(y - x\right) \cdot z, 6, x\right)} \]
4. Add Preprocessing

Alternative 3: 98.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\left(y - x\right) \cdot 6\right) \cdot z\\ \mathbf{if}\;z \leq -90:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 0.0055:\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot 6, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* (- y x) 6.0) z)))
   (if (<= z -90.0) t_0 (if (<= z 0.0055) (fma y (* z 6.0) x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = ((y - x) * 6.0) * z;
	double tmp;
	if (z <= -90.0) {
		tmp = t_0;
	} else if (z <= 0.0055) {
		tmp = fma(y, (z * 6.0), x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(y - x) * 6.0) * z)
	tmp = 0.0
	if (z <= -90.0)
		tmp = t_0;
	elseif (z <= 0.0055)
		tmp = fma(y, Float64(z * 6.0), x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(y - x), $MachinePrecision] * 6.0), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[z, -90.0], t$95$0, If[LessEqual[z, 0.0055], N[(y * N[(z * 6.0), $MachinePrecision] + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -90 or 0.0054999999999999997 < z

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. *-commutative N/A

         \[\leadsto \left(\left(y - x\right) \cdot 6\right) \cdot z \]

      4. lift--.f64 N/A

         \[\leadsto \left(\left(y - x\right) \cdot 6\right) \cdot z \]

      5. lift-*.f64 N/A

         \[\leadsto \left(\left(y - x\right) \cdot 6\right) \cdot z \]

      6. lift-*.f64 98.7

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

   4. Applied rewrites 98.7%

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

   if -90 < z < 0.0054999999999999997

   1. Initial program 99.5%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-*l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lift--.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 99.9

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(\color{blue}{y}, z \cdot 6, x\right) \]
   5. Step-by-step derivation

   6. Applied rewrites 98.5%

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

Alternative 4: 85.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.6 \cdot 10^{-56}:\\ \;\;\;\;\mathsf{fma}\left(-6 \cdot x, z, x\right)\\ \mathbf{elif}\;x \leq 2.2 \cdot 10^{+76}:\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot 6, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot x, -6, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -3.6e-56)
   (fma (* -6.0 x) z x)
   (if (<= x 2.2e+76) (fma y (* z 6.0) x) (fma (* z x) -6.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -3.6e-56) {
		tmp = fma((-6.0 * x), z, x);
	} else if (x <= 2.2e+76) {
		tmp = fma(y, (z * 6.0), x);
	} else {
		tmp = fma((z * x), -6.0, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -3.6e-56)
		tmp = fma(Float64(-6.0 * x), z, x);
	elseif (x <= 2.2e+76)
		tmp = fma(y, Float64(z * 6.0), x);
	else
		tmp = fma(Float64(z * x), -6.0, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -3.6e-56], N[(N[(-6.0 * x), $MachinePrecision] * z + x), $MachinePrecision], If[LessEqual[x, 2.2e+76], N[(y * N[(z * 6.0), $MachinePrecision] + x), $MachinePrecision], N[(N[(z * x), $MachinePrecision] * -6.0 + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.59999999999999978e-56

   1. Initial program 99.6%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -6 \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      4. lower-fma.f64 81.0

         \[\leadsto \mathsf{fma}\left(-6, z, 1\right) \cdot x \]

   4. Applied rewrites 81.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, z, 1\right) \cdot x} \]
   5. Step-by-step derivation

      1. lift-fma.f64 N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. distribute-rgt-in N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. *-commutative N/A

         \[\leadsto \left(-6 \cdot x\right) \cdot z + 1 \cdot x \]

      8. *-lft-identity N/A

         \[\leadsto \left(-6 \cdot x\right) \cdot z + x \]

      9. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6 \cdot x, \color{blue}{z}, x\right) \]

      10. lower-*.f64 80.9

          \[\leadsto \mathsf{fma}\left(-6 \cdot x, z, x\right) \]

   6. Applied rewrites 80.9%

      \[\leadsto \mathsf{fma}\left(-6 \cdot x, \color{blue}{z}, x\right) \]

   if -3.59999999999999978e-56 < x < 2.2e76

   1. Initial program 99.6%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-*l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lift--.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 99.7

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

   3. Applied rewrites 99.7%

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

   4. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(\color{blue}{y}, z \cdot 6, x\right) \]
   5. Step-by-step derivation

   6. Applied rewrites 85.4%

      \[\leadsto \mathsf{fma}\left(\color{blue}{y}, z \cdot 6, x\right) \]

   if 2.2e76 < x

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -6 \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      4. lower-fma.f64 90.5

         \[\leadsto \mathsf{fma}\left(-6, z, 1\right) \cdot x \]

   4. Applied rewrites 90.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, z, 1\right) \cdot x} \]
   5. Step-by-step derivation

      1. lift-fma.f64 N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. distribute-rgt-in N/A

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

      5. *-commutative N/A

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

      6. *-commutative N/A

         \[\leadsto x \cdot \left(z \cdot -6\right) + 1 \cdot x \]

      7. associate-*r* N/A

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

      8. *-lft-identity N/A

         \[\leadsto \left(x \cdot z\right) \cdot -6 + x \]

      9. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x \cdot z, \color{blue}{-6}, x\right) \]

      10. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(z \cdot x, -6, x\right) \]

      11. lift-*.f64 90.5

          \[\leadsto \mathsf{fma}\left(z \cdot x, -6, x\right) \]

   6. Applied rewrites 90.5%

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

Alternative 5: 74.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.6 \cdot 10^{-63}:\\ \;\;\;\;\mathsf{fma}\left(-6 \cdot x, z, x\right)\\ \mathbf{elif}\;x \leq 1.3 \cdot 10^{+28}:\\ \;\;\;\;\left(z \cdot 6\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot x, -6, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -9.6e-63)
   (fma (* -6.0 x) z x)
   (if (<= x 1.3e+28) (* (* z 6.0) y) (fma (* z x) -6.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -9.6e-63) {
		tmp = fma((-6.0 * x), z, x);
	} else if (x <= 1.3e+28) {
		tmp = (z * 6.0) * y;
	} else {
		tmp = fma((z * x), -6.0, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -9.6e-63)
		tmp = fma(Float64(-6.0 * x), z, x);
	elseif (x <= 1.3e+28)
		tmp = Float64(Float64(z * 6.0) * y);
	else
		tmp = fma(Float64(z * x), -6.0, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -9.6e-63], N[(N[(-6.0 * x), $MachinePrecision] * z + x), $MachinePrecision], If[LessEqual[x, 1.3e+28], N[(N[(z * 6.0), $MachinePrecision] * y), $MachinePrecision], N[(N[(z * x), $MachinePrecision] * -6.0 + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -9.6000000000000002e-63

   1. Initial program 99.5%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -6 \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      4. lower-fma.f64 80.5

         \[\leadsto \mathsf{fma}\left(-6, z, 1\right) \cdot x \]

   4. Applied rewrites 80.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, z, 1\right) \cdot x} \]
   5. Step-by-step derivation

      1. lift-fma.f64 N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. distribute-rgt-in N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. *-commutative N/A

         \[\leadsto \left(-6 \cdot x\right) \cdot z + 1 \cdot x \]

      8. *-lft-identity N/A

         \[\leadsto \left(-6 \cdot x\right) \cdot z + x \]

      9. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6 \cdot x, \color{blue}{z}, x\right) \]

      10. lower-*.f64 80.3

          \[\leadsto \mathsf{fma}\left(-6 \cdot x, z, x\right) \]

   6. Applied rewrites 80.3%

      \[\leadsto \mathsf{fma}\left(-6 \cdot x, \color{blue}{z}, x\right) \]

   if -9.6000000000000002e-63 < x < 1.3000000000000001e28

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{6 \cdot \left(y \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{6} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{6} \]

      3. *-commutative N/A

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

      4. lower-*.f64 63.6

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

   4. Applied rewrites 63.6%

      \[\leadsto \color{blue}{\left(z \cdot y\right) \cdot 6} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(z \cdot y\right) \cdot \color{blue}{6} \]

      3. *-commutative N/A

         \[\leadsto 6 \cdot \color{blue}{\left(z \cdot y\right)} \]

      4. associate-*r* N/A

         \[\leadsto \left(6 \cdot z\right) \cdot \color{blue}{y} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(6 \cdot z\right) \cdot \color{blue}{y} \]

      6. *-commutative N/A

         \[\leadsto \left(z \cdot 6\right) \cdot y \]

      7. lower-*.f64 63.6

         \[\leadsto \left(z \cdot 6\right) \cdot y \]

   6. Applied rewrites 63.6%

      \[\leadsto \left(z \cdot 6\right) \cdot \color{blue}{y} \]

   if 1.3000000000000001e28 < x

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -6 \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      4. lower-fma.f64 86.9

         \[\leadsto \mathsf{fma}\left(-6, z, 1\right) \cdot x \]

   4. Applied rewrites 86.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, z, 1\right) \cdot x} \]
   5. Step-by-step derivation

      1. lift-fma.f64 N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. distribute-rgt-in N/A

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

      5. *-commutative N/A

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

      6. *-commutative N/A

         \[\leadsto x \cdot \left(z \cdot -6\right) + 1 \cdot x \]

      7. associate-*r* N/A

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

      8. *-lft-identity N/A

         \[\leadsto \left(x \cdot z\right) \cdot -6 + x \]

      9. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(x \cdot z, \color{blue}{-6}, x\right) \]

      10. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(z \cdot x, -6, x\right) \]

      11. lift-*.f64 86.9

          \[\leadsto \mathsf{fma}\left(z \cdot x, -6, x\right) \]

   6. Applied rewrites 86.9%

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

Alternative 6: 74.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.6 \cdot 10^{-63}:\\ \;\;\;\;\mathsf{fma}\left(-6 \cdot x, z, x\right)\\ \mathbf{elif}\;x \leq 1.3 \cdot 10^{+28}:\\ \;\;\;\;\left(z \cdot 6\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-6, z, 1\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -9.6e-63)
   (fma (* -6.0 x) z x)
   (if (<= x 1.3e+28) (* (* z 6.0) y) (* (fma -6.0 z 1.0) x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -9.6e-63) {
		tmp = fma((-6.0 * x), z, x);
	} else if (x <= 1.3e+28) {
		tmp = (z * 6.0) * y;
	} else {
		tmp = fma(-6.0, z, 1.0) * x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -9.6e-63)
		tmp = fma(Float64(-6.0 * x), z, x);
	elseif (x <= 1.3e+28)
		tmp = Float64(Float64(z * 6.0) * y);
	else
		tmp = Float64(fma(-6.0, z, 1.0) * x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -9.6e-63], N[(N[(-6.0 * x), $MachinePrecision] * z + x), $MachinePrecision], If[LessEqual[x, 1.3e+28], N[(N[(z * 6.0), $MachinePrecision] * y), $MachinePrecision], N[(N[(-6.0 * z + 1.0), $MachinePrecision] * x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -9.6000000000000002e-63

   1. Initial program 99.5%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -6 \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      4. lower-fma.f64 80.5

         \[\leadsto \mathsf{fma}\left(-6, z, 1\right) \cdot x \]

   4. Applied rewrites 80.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, z, 1\right) \cdot x} \]
   5. Step-by-step derivation

      1. lift-fma.f64 N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. distribute-rgt-in N/A

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

      5. *-commutative N/A

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

      6. associate-*r* N/A

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

      7. *-commutative N/A

         \[\leadsto \left(-6 \cdot x\right) \cdot z + 1 \cdot x \]

      8. *-lft-identity N/A

         \[\leadsto \left(-6 \cdot x\right) \cdot z + x \]

      9. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6 \cdot x, \color{blue}{z}, x\right) \]

      10. lower-*.f64 80.3

          \[\leadsto \mathsf{fma}\left(-6 \cdot x, z, x\right) \]

   6. Applied rewrites 80.3%

      \[\leadsto \mathsf{fma}\left(-6 \cdot x, \color{blue}{z}, x\right) \]

   if -9.6000000000000002e-63 < x < 1.3000000000000001e28

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{6 \cdot \left(y \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{6} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{6} \]

      3. *-commutative N/A

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

      4. lower-*.f64 63.6

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

   4. Applied rewrites 63.6%

      \[\leadsto \color{blue}{\left(z \cdot y\right) \cdot 6} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(z \cdot y\right) \cdot \color{blue}{6} \]

      3. *-commutative N/A

         \[\leadsto 6 \cdot \color{blue}{\left(z \cdot y\right)} \]

      4. associate-*r* N/A

         \[\leadsto \left(6 \cdot z\right) \cdot \color{blue}{y} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(6 \cdot z\right) \cdot \color{blue}{y} \]

      6. *-commutative N/A

         \[\leadsto \left(z \cdot 6\right) \cdot y \]

      7. lower-*.f64 63.6

         \[\leadsto \left(z \cdot 6\right) \cdot y \]

   6. Applied rewrites 63.6%

      \[\leadsto \left(z \cdot 6\right) \cdot \color{blue}{y} \]

   if 1.3000000000000001e28 < x

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -6 \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      4. lower-fma.f64 86.9

         \[\leadsto \mathsf{fma}\left(-6, z, 1\right) \cdot x \]

   4. Applied rewrites 86.9%

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

Alternative 7: 74.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(-6, z, 1\right) \cdot x\\ \mathbf{if}\;x \leq -9.6 \cdot 10^{-63}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 1.3 \cdot 10^{+28}:\\ \;\;\;\;\left(z \cdot 6\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (fma -6.0 z 1.0) x)))
   (if (<= x -9.6e-63) t_0 (if (<= x 1.3e+28) (* (* z 6.0) y) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma(-6.0, z, 1.0) * x;
	double tmp;
	if (x <= -9.6e-63) {
		tmp = t_0;
	} else if (x <= 1.3e+28) {
		tmp = (z * 6.0) * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(fma(-6.0, z, 1.0) * x)
	tmp = 0.0
	if (x <= -9.6e-63)
		tmp = t_0;
	elseif (x <= 1.3e+28)
		tmp = Float64(Float64(z * 6.0) * y);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(-6.0 * z + 1.0), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, -9.6e-63], t$95$0, If[LessEqual[x, 1.3e+28], N[(N[(z * 6.0), $MachinePrecision] * y), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -9.6000000000000002e-63 or 1.3000000000000001e28 < x

   1. Initial program 99.6%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -6 \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      4. lower-fma.f64 83.3

         \[\leadsto \mathsf{fma}\left(-6, z, 1\right) \cdot x \]

   4. Applied rewrites 83.3%

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

   if -9.6000000000000002e-63 < x < 1.3000000000000001e28

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{6 \cdot \left(y \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{6} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{6} \]

      3. *-commutative N/A

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

      4. lower-*.f64 63.6

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

   4. Applied rewrites 63.6%

      \[\leadsto \color{blue}{\left(z \cdot y\right) \cdot 6} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(z \cdot y\right) \cdot \color{blue}{6} \]

      3. *-commutative N/A

         \[\leadsto 6 \cdot \color{blue}{\left(z \cdot y\right)} \]

      4. associate-*r* N/A

         \[\leadsto \left(6 \cdot z\right) \cdot \color{blue}{y} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(6 \cdot z\right) \cdot \color{blue}{y} \]

      6. *-commutative N/A

         \[\leadsto \left(z \cdot 6\right) \cdot y \]

      7. lower-*.f64 63.6

         \[\leadsto \left(z \cdot 6\right) \cdot y \]

   6. Applied rewrites 63.6%

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

Alternative 8: 60.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-6 \cdot x\right) \cdot z\\ t_1 := \left(z \cdot 6\right) \cdot y\\ \mathbf{if}\;z \leq -8.4 \cdot 10^{+26}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq -7.5 \cdot 10^{-126}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.06 \cdot 10^{-45}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 8.2 \cdot 10^{+30}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.05 \cdot 10^{+237}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\left(6 \cdot y\right) \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* -6.0 x) z)) (t_1 (* (* z 6.0) y)))
   (if (<= z -8.4e+26)
     t_0
     (if (<= z -7.5e-126)
       t_1
       (if (<= z 1.06e-45)
         x
         (if (<= z 8.2e+30) t_1 (if (<= z 1.05e+237) t_0 (* (* 6.0 y) z))))))))

C

double code(double x, double y, double z) {
	double t_0 = (-6.0 * x) * z;
	double t_1 = (z * 6.0) * y;
	double tmp;
	if (z <= -8.4e+26) {
		tmp = t_0;
	} else if (z <= -7.5e-126) {
		tmp = t_1;
	} else if (z <= 1.06e-45) {
		tmp = x;
	} else if (z <= 8.2e+30) {
		tmp = t_1;
	} else if (z <= 1.05e+237) {
		tmp = t_0;
	} else {
		tmp = (6.0 * y) * z;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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 = ((-6.0d0) * x) * z
    t_1 = (z * 6.0d0) * y
    if (z <= (-8.4d+26)) then
        tmp = t_0
    else if (z <= (-7.5d-126)) then
        tmp = t_1
    else if (z <= 1.06d-45) then
        tmp = x
    else if (z <= 8.2d+30) then
        tmp = t_1
    else if (z <= 1.05d+237) then
        tmp = t_0
    else
        tmp = (6.0d0 * y) * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (-6.0 * x) * z;
	double t_1 = (z * 6.0) * y;
	double tmp;
	if (z <= -8.4e+26) {
		tmp = t_0;
	} else if (z <= -7.5e-126) {
		tmp = t_1;
	} else if (z <= 1.06e-45) {
		tmp = x;
	} else if (z <= 8.2e+30) {
		tmp = t_1;
	} else if (z <= 1.05e+237) {
		tmp = t_0;
	} else {
		tmp = (6.0 * y) * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (-6.0 * x) * z
	t_1 = (z * 6.0) * y
	tmp = 0
	if z <= -8.4e+26:
		tmp = t_0
	elif z <= -7.5e-126:
		tmp = t_1
	elif z <= 1.06e-45:
		tmp = x
	elif z <= 8.2e+30:
		tmp = t_1
	elif z <= 1.05e+237:
		tmp = t_0
	else:
		tmp = (6.0 * y) * z
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-6.0 * x) * z)
	t_1 = Float64(Float64(z * 6.0) * y)
	tmp = 0.0
	if (z <= -8.4e+26)
		tmp = t_0;
	elseif (z <= -7.5e-126)
		tmp = t_1;
	elseif (z <= 1.06e-45)
		tmp = x;
	elseif (z <= 8.2e+30)
		tmp = t_1;
	elseif (z <= 1.05e+237)
		tmp = t_0;
	else
		tmp = Float64(Float64(6.0 * y) * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (-6.0 * x) * z;
	t_1 = (z * 6.0) * y;
	tmp = 0.0;
	if (z <= -8.4e+26)
		tmp = t_0;
	elseif (z <= -7.5e-126)
		tmp = t_1;
	elseif (z <= 1.06e-45)
		tmp = x;
	elseif (z <= 8.2e+30)
		tmp = t_1;
	elseif (z <= 1.05e+237)
		tmp = t_0;
	else
		tmp = (6.0 * y) * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(-6.0 * x), $MachinePrecision] * z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(z * 6.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[z, -8.4e+26], t$95$0, If[LessEqual[z, -7.5e-126], t$95$1, If[LessEqual[z, 1.06e-45], x, If[LessEqual[z, 8.2e+30], t$95$1, If[LessEqual[z, 1.05e+237], t$95$0, N[(N[(6.0 * y), $MachinePrecision] * z), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if z < -8.4000000000000003e26 or 8.20000000000000011e30 < z < 1.05000000000000007e237

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -6 \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      4. lower-fma.f64 52.7

         \[\leadsto \mathsf{fma}\left(-6, z, 1\right) \cdot x \]

   4. Applied rewrites 52.7%

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

   5. Taylor expanded in z around inf

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

      1. *-commutative N/A

         \[\leadsto \left(x \cdot z\right) \cdot -6 \]

      2. *-commutative N/A

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

      3. lift-*.f64 N/A

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

      4. lift-*.f64 52.6

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

   7. Applied rewrites 52.6%

      \[\leadsto \left(z \cdot x\right) \cdot \color{blue}{-6} \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

      3. *-commutative N/A

         \[\leadsto \left(x \cdot z\right) \cdot -6 \]

      4. *-commutative N/A

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

      5. associate-*r* N/A

         \[\leadsto \left(-6 \cdot x\right) \cdot z \]

      6. lower-*.f64 N/A

         \[\leadsto \left(-6 \cdot x\right) \cdot z \]

      7. lower-*.f64 52.6

         \[\leadsto \left(-6 \cdot x\right) \cdot z \]

   9. Applied rewrites 52.6%

      \[\leadsto \left(-6 \cdot x\right) \cdot z \]

   if -8.4000000000000003e26 < z < -7.49999999999999976e-126 or 1.06000000000000004e-45 < z < 8.20000000000000011e30

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{6 \cdot \left(y \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{6} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{6} \]

      3. *-commutative N/A

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

      4. lower-*.f64 43.1

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

   4. Applied rewrites 43.1%

      \[\leadsto \color{blue}{\left(z \cdot y\right) \cdot 6} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(z \cdot y\right) \cdot \color{blue}{6} \]

      3. *-commutative N/A

         \[\leadsto 6 \cdot \color{blue}{\left(z \cdot y\right)} \]

      4. associate-*r* N/A

         \[\leadsto \left(6 \cdot z\right) \cdot \color{blue}{y} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(6 \cdot z\right) \cdot \color{blue}{y} \]

      6. *-commutative N/A

         \[\leadsto \left(z \cdot 6\right) \cdot y \]

      7. lower-*.f64 43.2

         \[\leadsto \left(z \cdot 6\right) \cdot y \]

   6. Applied rewrites 43.2%

      \[\leadsto \left(z \cdot 6\right) \cdot \color{blue}{y} \]

   if -7.49999999999999976e-126 < z < 1.06000000000000004e-45

   1. Initial program 99.4%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x} \]
   3. Step-by-step derivation

   4. Applied rewrites 76.1%

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

   if 1.05000000000000007e237 < z

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{6 \cdot \left(y \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{6} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{6} \]

      3. *-commutative N/A

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

      4. lower-*.f64 43.1

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

   4. Applied rewrites 43.1%

      \[\leadsto \color{blue}{\left(z \cdot y\right) \cdot 6} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(z \cdot y\right) \cdot \color{blue}{6} \]

      3. *-commutative N/A

         \[\leadsto 6 \cdot \color{blue}{\left(z \cdot y\right)} \]

      4. *-commutative N/A

         \[\leadsto 6 \cdot \left(y \cdot \color{blue}{z}\right) \]

      5. associate-*r* N/A

         \[\leadsto \left(6 \cdot y\right) \cdot \color{blue}{z} \]

      6. lower-*.f64 N/A

         \[\leadsto \left(6 \cdot y\right) \cdot \color{blue}{z} \]

      7. lift-*.f64 43.1

         \[\leadsto \left(6 \cdot y\right) \cdot z \]

   6. Applied rewrites 43.1%

      \[\leadsto \left(6 \cdot y\right) \cdot \color{blue}{z} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 9: 59.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-6 \cdot x\right) \cdot z\\ t_1 := \left(6 \cdot y\right) \cdot z\\ \mathbf{if}\;z \leq -8.4 \cdot 10^{+26}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq -7.5 \cdot 10^{-126}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.06 \cdot 10^{-45}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 8.2 \cdot 10^{+30}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.05 \cdot 10^{+237}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* -6.0 x) z)) (t_1 (* (* 6.0 y) z)))
   (if (<= z -8.4e+26)
     t_0
     (if (<= z -7.5e-126)
       t_1
       (if (<= z 1.06e-45)
         x
         (if (<= z 8.2e+30) t_1 (if (<= z 1.05e+237) t_0 t_1)))))))

C

double code(double x, double y, double z) {
	double t_0 = (-6.0 * x) * z;
	double t_1 = (6.0 * y) * z;
	double tmp;
	if (z <= -8.4e+26) {
		tmp = t_0;
	} else if (z <= -7.5e-126) {
		tmp = t_1;
	} else if (z <= 1.06e-45) {
		tmp = x;
	} else if (z <= 8.2e+30) {
		tmp = t_1;
	} else if (z <= 1.05e+237) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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 = ((-6.0d0) * x) * z
    t_1 = (6.0d0 * y) * z
    if (z <= (-8.4d+26)) then
        tmp = t_0
    else if (z <= (-7.5d-126)) then
        tmp = t_1
    else if (z <= 1.06d-45) then
        tmp = x
    else if (z <= 8.2d+30) then
        tmp = t_1
    else if (z <= 1.05d+237) then
        tmp = t_0
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (-6.0 * x) * z;
	double t_1 = (6.0 * y) * z;
	double tmp;
	if (z <= -8.4e+26) {
		tmp = t_0;
	} else if (z <= -7.5e-126) {
		tmp = t_1;
	} else if (z <= 1.06e-45) {
		tmp = x;
	} else if (z <= 8.2e+30) {
		tmp = t_1;
	} else if (z <= 1.05e+237) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (-6.0 * x) * z
	t_1 = (6.0 * y) * z
	tmp = 0
	if z <= -8.4e+26:
		tmp = t_0
	elif z <= -7.5e-126:
		tmp = t_1
	elif z <= 1.06e-45:
		tmp = x
	elif z <= 8.2e+30:
		tmp = t_1
	elif z <= 1.05e+237:
		tmp = t_0
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-6.0 * x) * z)
	t_1 = Float64(Float64(6.0 * y) * z)
	tmp = 0.0
	if (z <= -8.4e+26)
		tmp = t_0;
	elseif (z <= -7.5e-126)
		tmp = t_1;
	elseif (z <= 1.06e-45)
		tmp = x;
	elseif (z <= 8.2e+30)
		tmp = t_1;
	elseif (z <= 1.05e+237)
		tmp = t_0;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (-6.0 * x) * z;
	t_1 = (6.0 * y) * z;
	tmp = 0.0;
	if (z <= -8.4e+26)
		tmp = t_0;
	elseif (z <= -7.5e-126)
		tmp = t_1;
	elseif (z <= 1.06e-45)
		tmp = x;
	elseif (z <= 8.2e+30)
		tmp = t_1;
	elseif (z <= 1.05e+237)
		tmp = t_0;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(-6.0 * x), $MachinePrecision] * z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(6.0 * y), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[z, -8.4e+26], t$95$0, If[LessEqual[z, -7.5e-126], t$95$1, If[LessEqual[z, 1.06e-45], x, If[LessEqual[z, 8.2e+30], t$95$1, If[LessEqual[z, 1.05e+237], t$95$0, t$95$1]]]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -8.4000000000000003e26 or 8.20000000000000011e30 < z < 1.05000000000000007e237

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -6 \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      4. lower-fma.f64 52.7

         \[\leadsto \mathsf{fma}\left(-6, z, 1\right) \cdot x \]

   4. Applied rewrites 52.7%

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

   5. Taylor expanded in z around inf

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

      1. *-commutative N/A

         \[\leadsto \left(x \cdot z\right) \cdot -6 \]

      2. *-commutative N/A

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

      3. lift-*.f64 N/A

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

      4. lift-*.f64 52.6

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

   7. Applied rewrites 52.6%

      \[\leadsto \left(z \cdot x\right) \cdot \color{blue}{-6} \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

      3. *-commutative N/A

         \[\leadsto \left(x \cdot z\right) \cdot -6 \]

      4. *-commutative N/A

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

      5. associate-*r* N/A

         \[\leadsto \left(-6 \cdot x\right) \cdot z \]

      6. lower-*.f64 N/A

         \[\leadsto \left(-6 \cdot x\right) \cdot z \]

      7. lower-*.f64 52.6

         \[\leadsto \left(-6 \cdot x\right) \cdot z \]

   9. Applied rewrites 52.6%

      \[\leadsto \left(-6 \cdot x\right) \cdot z \]

   if -8.4000000000000003e26 < z < -7.49999999999999976e-126 or 1.06000000000000004e-45 < z < 8.20000000000000011e30 or 1.05000000000000007e237 < z

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{6 \cdot \left(y \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{6} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{6} \]

      3. *-commutative N/A

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

      4. lower-*.f64 46.3

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

   4. Applied rewrites 46.3%

      \[\leadsto \color{blue}{\left(z \cdot y\right) \cdot 6} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(z \cdot y\right) \cdot 6 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(z \cdot y\right) \cdot \color{blue}{6} \]

      3. *-commutative N/A

         \[\leadsto 6 \cdot \color{blue}{\left(z \cdot y\right)} \]

      4. *-commutative N/A

         \[\leadsto 6 \cdot \left(y \cdot \color{blue}{z}\right) \]

      5. associate-*r* N/A

         \[\leadsto \left(6 \cdot y\right) \cdot \color{blue}{z} \]

      6. lower-*.f64 N/A

         \[\leadsto \left(6 \cdot y\right) \cdot \color{blue}{z} \]

      7. lift-*.f64 46.2

         \[\leadsto \left(6 \cdot y\right) \cdot z \]

   6. Applied rewrites 46.2%

      \[\leadsto \left(6 \cdot y\right) \cdot \color{blue}{z} \]

   if -7.49999999999999976e-126 < z < 1.06000000000000004e-45

   1. Initial program 99.4%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x} \]
   3. Step-by-step derivation

   4. Applied rewrites 76.1%

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

Alternative 10: 59.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-6 \cdot x\right) \cdot z\\ \mathbf{if}\;z \leq -0.168:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 70000000000000:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* -6.0 x) z)))
   (if (<= z -0.168) t_0 (if (<= z 70000000000000.0) x t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (-6.0 * x) * z;
	double tmp;
	if (z <= -0.168) {
		tmp = t_0;
	} else if (z <= 70000000000000.0) {
		tmp = x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((-6.0d0) * x) * z
    if (z <= (-0.168d0)) then
        tmp = t_0
    else if (z <= 70000000000000.0d0) then
        tmp = x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (-6.0 * x) * z;
	double tmp;
	if (z <= -0.168) {
		tmp = t_0;
	} else if (z <= 70000000000000.0) {
		tmp = x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (-6.0 * x) * z
	tmp = 0
	if z <= -0.168:
		tmp = t_0
	elif z <= 70000000000000.0:
		tmp = x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-6.0 * x) * z)
	tmp = 0.0
	if (z <= -0.168)
		tmp = t_0;
	elseif (z <= 70000000000000.0)
		tmp = x;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (-6.0 * x) * z;
	tmp = 0.0;
	if (z <= -0.168)
		tmp = t_0;
	elseif (z <= 70000000000000.0)
		tmp = x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(-6.0 * x), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[z, -0.168], t$95$0, If[LessEqual[z, 70000000000000.0], x, t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -0.16800000000000001 or 7e13 < z

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -6 \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(-6 \cdot z + 1\right) \cdot x \]

      4. lower-fma.f64 52.9

         \[\leadsto \mathsf{fma}\left(-6, z, 1\right) \cdot x \]

   4. Applied rewrites 52.9%

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

   5. Taylor expanded in z around inf

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

      1. *-commutative N/A

         \[\leadsto \left(x \cdot z\right) \cdot -6 \]

      2. *-commutative N/A

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

      3. lift-*.f64 N/A

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

      4. lift-*.f64 52.4

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

   7. Applied rewrites 52.4%

      \[\leadsto \left(z \cdot x\right) \cdot \color{blue}{-6} \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

      2. lift-*.f64 N/A

         \[\leadsto \left(z \cdot x\right) \cdot -6 \]

      3. *-commutative N/A

         \[\leadsto \left(x \cdot z\right) \cdot -6 \]

      4. *-commutative N/A

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

      5. associate-*r* N/A

         \[\leadsto \left(-6 \cdot x\right) \cdot z \]

      6. lower-*.f64 N/A

         \[\leadsto \left(-6 \cdot x\right) \cdot z \]

      7. lower-*.f64 52.4

         \[\leadsto \left(-6 \cdot x\right) \cdot z \]

   9. Applied rewrites 52.4%

      \[\leadsto \left(-6 \cdot x\right) \cdot z \]

   if -0.16800000000000001 < z < 7e13

   1. Initial program 99.5%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x} \]
   3. Step-by-step derivation

   4. Applied rewrites 68.8%

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

Alternative 11: 35.9% accurate, 12.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 99.6%

   \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]

2. Taylor expanded in z around 0

   \[\leadsto \color{blue}{x} \]
3. Step-by-step derivation

4. Applied rewrites 35.9%

   \[\leadsto \color{blue}{x} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025120 
(FPCore (x y z)
  :name "Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, E"
  :precision binary64
  (+ x (* (* (- y x) 6.0) z)))