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

Percentage Accurate: 99.7% → 99.8%

Time: 4.8s

Alternatives: 13

Speedup: 1.1×

• 21.4% 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.7% 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.8%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. associate-*l* N/A

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

   6. lower-fma.f64 N/A

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

   7. *-commutative N/A

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

   8. lower-*.f64 99.8

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

4. Applied rewrites 99.8%

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

Alternative 2: 60.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(6 \cdot z\right) \cdot y\\ \mathbf{if}\;z \leq -5.6 \cdot 10^{+93}:\\ \;\;\;\;\left(z \cdot x\right) \cdot -6\\ \mathbf{elif}\;z \leq -5.9 \cdot 10^{-74}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1.1 \cdot 10^{-44}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 5.4 \cdot 10^{+145}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\left(-6 \cdot x\right) \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* 6.0 z) y)))
   (if (<= z -5.6e+93)
     (* (* z x) -6.0)
     (if (<= z -5.9e-74)
       t_0
       (if (<= z 1.1e-44) x (if (<= z 5.4e+145) t_0 (* (* -6.0 x) z)))))))

C

double code(double x, double y, double z) {
	double t_0 = (6.0 * z) * y;
	double tmp;
	if (z <= -5.6e+93) {
		tmp = (z * x) * -6.0;
	} else if (z <= -5.9e-74) {
		tmp = t_0;
	} else if (z <= 1.1e-44) {
		tmp = x;
	} else if (z <= 5.4e+145) {
		tmp = t_0;
	} else {
		tmp = (-6.0 * x) * 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) :: tmp
    t_0 = (6.0d0 * z) * y
    if (z <= (-5.6d+93)) then
        tmp = (z * x) * (-6.0d0)
    else if (z <= (-5.9d-74)) then
        tmp = t_0
    else if (z <= 1.1d-44) then
        tmp = x
    else if (z <= 5.4d+145) then
        tmp = t_0
    else
        tmp = ((-6.0d0) * x) * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (6.0 * z) * y;
	double tmp;
	if (z <= -5.6e+93) {
		tmp = (z * x) * -6.0;
	} else if (z <= -5.9e-74) {
		tmp = t_0;
	} else if (z <= 1.1e-44) {
		tmp = x;
	} else if (z <= 5.4e+145) {
		tmp = t_0;
	} else {
		tmp = (-6.0 * x) * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (6.0 * z) * y
	tmp = 0
	if z <= -5.6e+93:
		tmp = (z * x) * -6.0
	elif z <= -5.9e-74:
		tmp = t_0
	elif z <= 1.1e-44:
		tmp = x
	elif z <= 5.4e+145:
		tmp = t_0
	else:
		tmp = (-6.0 * x) * z
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(6.0 * z) * y)
	tmp = 0.0
	if (z <= -5.6e+93)
		tmp = Float64(Float64(z * x) * -6.0);
	elseif (z <= -5.9e-74)
		tmp = t_0;
	elseif (z <= 1.1e-44)
		tmp = x;
	elseif (z <= 5.4e+145)
		tmp = t_0;
	else
		tmp = Float64(Float64(-6.0 * x) * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (6.0 * z) * y;
	tmp = 0.0;
	if (z <= -5.6e+93)
		tmp = (z * x) * -6.0;
	elseif (z <= -5.9e-74)
		tmp = t_0;
	elseif (z <= 1.1e-44)
		tmp = x;
	elseif (z <= 5.4e+145)
		tmp = t_0;
	else
		tmp = (-6.0 * x) * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(6.0 * z), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[z, -5.6e+93], N[(N[(z * x), $MachinePrecision] * -6.0), $MachinePrecision], If[LessEqual[z, -5.9e-74], t$95$0, If[LessEqual[z, 1.1e-44], x, If[LessEqual[z, 5.4e+145], t$95$0, N[(N[(-6.0 * x), $MachinePrecision] * z), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if z < -5.59999999999999978e93

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 61.5%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 61.5%

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

   if -5.59999999999999978e93 < z < -5.89999999999999965e-74 or 1.10000000000000006e-44 < z < 5.40000000000000044e145

   1. Initial program 99.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. flip-+ N/A

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

      4. lower-/.f64 N/A

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

      5. fp-cancel-sub-sign-inv N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r* N/A

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

      11. unpow-prod-down N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-pow.f64 N/A

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

      14. lower-*.f64 N/A

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

      15. metadata-eval N/A

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

      16. lower-*.f64 N/A

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

      17. lower-neg.f64 N/A

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

      18. lower--.f64 43.8

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

   4. Applied rewrites 43.8%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 59.7%

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

   9. Applied rewrites 59.8%

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

   if -5.89999999999999965e-74 < z < 1.10000000000000006e-44

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 76.6%

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

   if 5.40000000000000044e145 < z

   1. Initial program 99.9%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 76.0%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 76.1%

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

   10. Applied rewrites 76.1%

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

Alternative 3: 60.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(z \cdot y\right) \cdot 6\\ \mathbf{if}\;z \leq -5.6 \cdot 10^{+93}:\\ \;\;\;\;\left(z \cdot x\right) \cdot -6\\ \mathbf{elif}\;z \leq -5.9 \cdot 10^{-74}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1.1 \cdot 10^{-44}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 5.4 \cdot 10^{+145}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\left(-6 \cdot x\right) \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* z y) 6.0)))
   (if (<= z -5.6e+93)
     (* (* z x) -6.0)
     (if (<= z -5.9e-74)
       t_0
       (if (<= z 1.1e-44) x (if (<= z 5.4e+145) t_0 (* (* -6.0 x) z)))))))

C

double code(double x, double y, double z) {
	double t_0 = (z * y) * 6.0;
	double tmp;
	if (z <= -5.6e+93) {
		tmp = (z * x) * -6.0;
	} else if (z <= -5.9e-74) {
		tmp = t_0;
	} else if (z <= 1.1e-44) {
		tmp = x;
	} else if (z <= 5.4e+145) {
		tmp = t_0;
	} else {
		tmp = (-6.0 * x) * 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) :: tmp
    t_0 = (z * y) * 6.0d0
    if (z <= (-5.6d+93)) then
        tmp = (z * x) * (-6.0d0)
    else if (z <= (-5.9d-74)) then
        tmp = t_0
    else if (z <= 1.1d-44) then
        tmp = x
    else if (z <= 5.4d+145) then
        tmp = t_0
    else
        tmp = ((-6.0d0) * x) * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (z * y) * 6.0;
	double tmp;
	if (z <= -5.6e+93) {
		tmp = (z * x) * -6.0;
	} else if (z <= -5.9e-74) {
		tmp = t_0;
	} else if (z <= 1.1e-44) {
		tmp = x;
	} else if (z <= 5.4e+145) {
		tmp = t_0;
	} else {
		tmp = (-6.0 * x) * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (z * y) * 6.0
	tmp = 0
	if z <= -5.6e+93:
		tmp = (z * x) * -6.0
	elif z <= -5.9e-74:
		tmp = t_0
	elif z <= 1.1e-44:
		tmp = x
	elif z <= 5.4e+145:
		tmp = t_0
	else:
		tmp = (-6.0 * x) * z
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(z * y) * 6.0)
	tmp = 0.0
	if (z <= -5.6e+93)
		tmp = Float64(Float64(z * x) * -6.0);
	elseif (z <= -5.9e-74)
		tmp = t_0;
	elseif (z <= 1.1e-44)
		tmp = x;
	elseif (z <= 5.4e+145)
		tmp = t_0;
	else
		tmp = Float64(Float64(-6.0 * x) * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (z * y) * 6.0;
	tmp = 0.0;
	if (z <= -5.6e+93)
		tmp = (z * x) * -6.0;
	elseif (z <= -5.9e-74)
		tmp = t_0;
	elseif (z <= 1.1e-44)
		tmp = x;
	elseif (z <= 5.4e+145)
		tmp = t_0;
	else
		tmp = (-6.0 * x) * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(z * y), $MachinePrecision] * 6.0), $MachinePrecision]}, If[LessEqual[z, -5.6e+93], N[(N[(z * x), $MachinePrecision] * -6.0), $MachinePrecision], If[LessEqual[z, -5.9e-74], t$95$0, If[LessEqual[z, 1.1e-44], x, If[LessEqual[z, 5.4e+145], t$95$0, N[(N[(-6.0 * x), $MachinePrecision] * z), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if z < -5.59999999999999978e93

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 61.5%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 61.5%

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

   if -5.59999999999999978e93 < z < -5.89999999999999965e-74 or 1.10000000000000006e-44 < z < 5.40000000000000044e145

   1. Initial program 99.6%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 59.7%

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

   if -5.89999999999999965e-74 < z < 1.10000000000000006e-44

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 76.6%

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

   if 5.40000000000000044e145 < z

   1. Initial program 99.9%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 76.0%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 76.1%

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

   10. Applied rewrites 76.1%

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

Alternative 4: 60.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(z \cdot x\right) \cdot -6\\ t_1 := \left(z \cdot y\right) \cdot 6\\ \mathbf{if}\;z \leq -5.6 \cdot 10^{+93}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq -5.9 \cdot 10^{-74}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.1 \cdot 10^{-44}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 5.4 \cdot 10^{+145}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* z x) -6.0)) (t_1 (* (* z y) 6.0)))
   (if (<= z -5.6e+93)
     t_0
     (if (<= z -5.9e-74)
       t_1
       (if (<= z 1.1e-44) x (if (<= z 5.4e+145) t_1 t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = (z * x) * -6.0;
	double t_1 = (z * y) * 6.0;
	double tmp;
	if (z <= -5.6e+93) {
		tmp = t_0;
	} else if (z <= -5.9e-74) {
		tmp = t_1;
	} else if (z <= 1.1e-44) {
		tmp = x;
	} else if (z <= 5.4e+145) {
		tmp = t_1;
	} 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) :: t_1
    real(8) :: tmp
    t_0 = (z * x) * (-6.0d0)
    t_1 = (z * y) * 6.0d0
    if (z <= (-5.6d+93)) then
        tmp = t_0
    else if (z <= (-5.9d-74)) then
        tmp = t_1
    else if (z <= 1.1d-44) then
        tmp = x
    else if (z <= 5.4d+145) then
        tmp = t_1
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (z * x) * -6.0;
	double t_1 = (z * y) * 6.0;
	double tmp;
	if (z <= -5.6e+93) {
		tmp = t_0;
	} else if (z <= -5.9e-74) {
		tmp = t_1;
	} else if (z <= 1.1e-44) {
		tmp = x;
	} else if (z <= 5.4e+145) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (z * x) * -6.0
	t_1 = (z * y) * 6.0
	tmp = 0
	if z <= -5.6e+93:
		tmp = t_0
	elif z <= -5.9e-74:
		tmp = t_1
	elif z <= 1.1e-44:
		tmp = x
	elif z <= 5.4e+145:
		tmp = t_1
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(z * x) * -6.0)
	t_1 = Float64(Float64(z * y) * 6.0)
	tmp = 0.0
	if (z <= -5.6e+93)
		tmp = t_0;
	elseif (z <= -5.9e-74)
		tmp = t_1;
	elseif (z <= 1.1e-44)
		tmp = x;
	elseif (z <= 5.4e+145)
		tmp = t_1;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (z * x) * -6.0;
	t_1 = (z * y) * 6.0;
	tmp = 0.0;
	if (z <= -5.6e+93)
		tmp = t_0;
	elseif (z <= -5.9e-74)
		tmp = t_1;
	elseif (z <= 1.1e-44)
		tmp = x;
	elseif (z <= 5.4e+145)
		tmp = t_1;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(z * x), $MachinePrecision] * -6.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(z * y), $MachinePrecision] * 6.0), $MachinePrecision]}, If[LessEqual[z, -5.6e+93], t$95$0, If[LessEqual[z, -5.9e-74], t$95$1, If[LessEqual[z, 1.1e-44], x, If[LessEqual[z, 5.4e+145], t$95$1, t$95$0]]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -5.59999999999999978e93 or 5.40000000000000044e145 < z

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 68.4%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 68.4%

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

   if -5.59999999999999978e93 < z < -5.89999999999999965e-74 or 1.10000000000000006e-44 < z < 5.40000000000000044e145

   1. Initial program 99.6%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 59.7%

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

   if -5.89999999999999965e-74 < z < 1.10000000000000006e-44

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 76.6%

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

Alternative 5: 97.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.175 \lor \neg \left(z \leq 1.8 \cdot 10^{-31}\right):\\ \;\;\;\;\left(6 \cdot \left(y - x\right)\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot 6, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -0.175) (not (<= z 1.8e-31)))
   (* (* 6.0 (- y x)) z)
   (fma y (* z 6.0) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -0.175) || !(z <= 1.8e-31)) {
		tmp = (6.0 * (y - x)) * z;
	} else {
		tmp = fma(y, (z * 6.0), x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -0.175) || !(z <= 1.8e-31))
		tmp = Float64(Float64(6.0 * Float64(y - x)) * z);
	else
		tmp = fma(y, Float64(z * 6.0), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -0.175], N[Not[LessEqual[z, 1.8e-31]], $MachinePrecision]], N[(N[(6.0 * N[(y - x), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], N[(y * N[(z * 6.0), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -0.17499999999999999 or 1.80000000000000002e-31 < z

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 98.3%

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

   if -0.17499999999999999 < z < 1.80000000000000002e-31

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*l* N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 99.4%

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

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.175 \lor \neg \left(z \leq 1.8 \cdot 10^{-31}\right):\\ \;\;\;\;\left(6 \cdot \left(y - x\right)\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot 6, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 97.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.175:\\ \;\;\;\;\left(6 \cdot \left(y - x\right)\right) \cdot z\\ \mathbf{elif}\;z \leq 1.8 \cdot 10^{-31}:\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot 6, x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(6 \cdot z\right) \cdot \left(y - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -0.175)
   (* (* 6.0 (- y x)) z)
   (if (<= z 1.8e-31) (fma y (* z 6.0) x) (* (* 6.0 z) (- y x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -0.175) {
		tmp = (6.0 * (y - x)) * z;
	} else if (z <= 1.8e-31) {
		tmp = fma(y, (z * 6.0), x);
	} else {
		tmp = (6.0 * z) * (y - x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -0.175)
		tmp = Float64(Float64(6.0 * Float64(y - x)) * z);
	elseif (z <= 1.8e-31)
		tmp = fma(y, Float64(z * 6.0), x);
	else
		tmp = Float64(Float64(6.0 * z) * Float64(y - x));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -0.175], N[(N[(6.0 * N[(y - x), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[z, 1.8e-31], N[(y * N[(z * 6.0), $MachinePrecision] + x), $MachinePrecision], N[(N[(6.0 * z), $MachinePrecision] * N[(y - x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -0.17499999999999999

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 97.3%

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

   if -0.17499999999999999 < z < 1.80000000000000002e-31

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*l* N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 99.4%

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

   if 1.80000000000000002e-31 < z

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. flip-+ N/A

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

      4. lower-/.f64 N/A

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

      5. fp-cancel-sub-sign-inv N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r* N/A

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

      11. unpow-prod-down N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-pow.f64 N/A

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

      14. lower-*.f64 N/A

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

      15. metadata-eval N/A

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

      16. lower-*.f64 N/A

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

      17. lower-neg.f64 N/A

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

      18. lower--.f64 17.2

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

   4. Applied rewrites 17.2%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 99.1%

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

Alternative 7: 86.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.2 \cdot 10^{+21} \lor \neg \left(y \leq 3.4 \cdot 10^{-35}\right):\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot 6, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-6, z, 1\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -3.2e+21) (not (<= y 3.4e-35)))
   (fma y (* z 6.0) x)
   (* (fma -6.0 z 1.0) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -3.2e+21) || !(y <= 3.4e-35)) {
		tmp = fma(y, (z * 6.0), x);
	} else {
		tmp = fma(-6.0, z, 1.0) * x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -3.2e+21) || !(y <= 3.4e-35))
		tmp = fma(y, Float64(z * 6.0), x);
	else
		tmp = Float64(fma(-6.0, z, 1.0) * x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -3.2e+21], N[Not[LessEqual[y, 3.4e-35]], $MachinePrecision]], N[(y * N[(z * 6.0), $MachinePrecision] + x), $MachinePrecision], N[(N[(-6.0 * z + 1.0), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.2e21 or 3.4000000000000003e-35 < y

   1. Initial program 99.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*l* N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 92.7%

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

   if -3.2e21 < y < 3.4000000000000003e-35

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 85.9%

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

4. Final simplification 89.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.2 \cdot 10^{+21} \lor \neg \left(y \leq 3.4 \cdot 10^{-35}\right):\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot 6, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-6, z, 1\right) \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 86.5% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -3.2e+21)
   (fma y (* z 6.0) x)
   (if (<= y 3.4e-35) (* (fma -6.0 z 1.0) x) (fma (* z y) 6.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -3.2e+21) {
		tmp = fma(y, (z * 6.0), x);
	} else if (y <= 3.4e-35) {
		tmp = fma(-6.0, z, 1.0) * x;
	} else {
		tmp = fma((z * y), 6.0, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -3.2e+21)
		tmp = fma(y, Float64(z * 6.0), x);
	elseif (y <= 3.4e-35)
		tmp = Float64(fma(-6.0, z, 1.0) * x);
	else
		tmp = fma(Float64(z * y), 6.0, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -3.2e+21], N[(y * N[(z * 6.0), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[y, 3.4e-35], N[(N[(-6.0 * z + 1.0), $MachinePrecision] * x), $MachinePrecision], N[(N[(z * y), $MachinePrecision] * 6.0 + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -3.2e21

   1. Initial program 99.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*l* N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 91.9%

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

   if -3.2e21 < y < 3.4000000000000003e-35

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 85.9%

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

   if 3.4000000000000003e-35 < y

   1. Initial program 99.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*r* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-*.f64 99.7

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 93.6%

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

Alternative 9: 75.0% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.55e+22)
   (* (* 6.0 z) y)
   (if (<= y 9.8e+85) (* (fma -6.0 z 1.0) x) (* (* z y) 6.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.55e+22) {
		tmp = (6.0 * z) * y;
	} else if (y <= 9.8e+85) {
		tmp = fma(-6.0, z, 1.0) * x;
	} else {
		tmp = (z * y) * 6.0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.55e+22)
		tmp = Float64(Float64(6.0 * z) * y);
	elseif (y <= 9.8e+85)
		tmp = Float64(fma(-6.0, z, 1.0) * x);
	else
		tmp = Float64(Float64(z * y) * 6.0);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.55e+22], N[(N[(6.0 * z), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[y, 9.8e+85], N[(N[(-6.0 * z + 1.0), $MachinePrecision] * x), $MachinePrecision], N[(N[(z * y), $MachinePrecision] * 6.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.5500000000000001e22

   1. Initial program 99.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. flip-+ N/A

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

      4. lower-/.f64 N/A

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

      5. fp-cancel-sub-sign-inv N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r* N/A

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

      11. unpow-prod-down N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-pow.f64 N/A

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

      14. lower-*.f64 N/A

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

      15. metadata-eval N/A

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

      16. lower-*.f64 N/A

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

      17. lower-neg.f64 N/A

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

      18. lower--.f64 35.2

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

   4. Applied rewrites 35.2%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 68.0%

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

   9. Applied rewrites 68.1%

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

   if -1.5500000000000001e22 < y < 9.7999999999999993e85

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 82.9%

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

   if 9.7999999999999993e85 < y

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 82.1%

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

Alternative 10: 61.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.165 \lor \neg \left(z \leq 55000\right):\\ \;\;\;\;\left(-6 \cdot z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -0.165) (not (<= z 55000.0))) (* (* -6.0 z) x) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -0.165) || !(z <= 55000.0)) {
		tmp = (-6.0 * z) * x;
	} else {
		tmp = x;
	}
	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) :: tmp
    if ((z <= (-0.165d0)) .or. (.not. (z <= 55000.0d0))) then
        tmp = ((-6.0d0) * z) * x
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -0.165) || !(z <= 55000.0)) {
		tmp = (-6.0 * z) * x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -0.165) or not (z <= 55000.0):
		tmp = (-6.0 * z) * x
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -0.165) || !(z <= 55000.0))
		tmp = Float64(Float64(-6.0 * z) * x);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -0.165) || ~((z <= 55000.0)))
		tmp = (-6.0 * z) * x;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -0.165], N[Not[LessEqual[z, 55000.0]], $MachinePrecision]], N[(N[(-6.0 * z), $MachinePrecision] * x), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -0.165000000000000008 or 55000 < z

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 59.3%

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

   6. Taylor expanded in z around inf

      \[\leadsto \left(-6 \cdot z\right) \cdot x \]
   7. Step-by-step derivation

   8. Applied rewrites 58.2%

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

   if -0.165000000000000008 < z < 55000

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 69.3%

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

4. Final simplification 63.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.165 \lor \neg \left(z \leq 55000\right):\\ \;\;\;\;\left(-6 \cdot z\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 61.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.165 \lor \neg \left(z \leq 55000\right):\\ \;\;\;\;\left(z \cdot x\right) \cdot -6\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -0.165) (not (<= z 55000.0))) (* (* z x) -6.0) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -0.165) || !(z <= 55000.0)) {
		tmp = (z * x) * -6.0;
	} else {
		tmp = x;
	}
	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) :: tmp
    if ((z <= (-0.165d0)) .or. (.not. (z <= 55000.0d0))) then
        tmp = (z * x) * (-6.0d0)
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -0.165) || !(z <= 55000.0)) {
		tmp = (z * x) * -6.0;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -0.165) or not (z <= 55000.0):
		tmp = (z * x) * -6.0
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -0.165) || !(z <= 55000.0))
		tmp = Float64(Float64(z * x) * -6.0);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -0.165) || ~((z <= 55000.0)))
		tmp = (z * x) * -6.0;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -0.165], N[Not[LessEqual[z, 55000.0]], $MachinePrecision]], N[(N[(z * x), $MachinePrecision] * -6.0), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -0.165000000000000008 or 55000 < z

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 59.3%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 58.2%

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

   if -0.165000000000000008 < z < 55000

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 69.3%

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

4. Final simplification 63.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.165 \lor \neg \left(z \leq 55000\right):\\ \;\;\;\;\left(z \cdot x\right) \cdot -6\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 99.8% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lift-*.f64 N/A

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

   6. associate-*r* N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-*.f64 99.8

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

4. Applied rewrites 99.8%

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

Alternative 13: 37.3% accurate, 17.0× 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.8%

   \[x + \left(\left(y - x\right) \cdot 6\right) \cdot z \]
2. Add Preprocessing

3. Taylor expanded in z around 0

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

5. Applied rewrites 34.5%

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

Developer Target 1: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 - ((6.0d0 * z) * (x - y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :alt
  (! :herbie-platform default (- x (* (* 6 z) (- x y))))

  (+ x (* (* (- y x) 6.0) z)))