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

Percentage Accurate: 99.7% → 99.8%

Time: 4.8s

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.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.1%

   \[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.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4.3 \cdot 10^{+194}:\\ \;\;\;\;\left(z \cdot x\right) \cdot -6\\ \mathbf{elif}\;z \leq -0.00052:\\ \;\;\;\;\left(6 \cdot y\right) \cdot z\\ \mathbf{elif}\;z \leq 0.000114:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\left(-6 \cdot z\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -4.3e+194)
   (* (* z x) -6.0)
   (if (<= z -0.00052)
     (* (* 6.0 y) z)
     (if (<= z 0.000114) x (* (* -6.0 z) x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -4.3e+194) {
		tmp = (z * x) * -6.0;
	} else if (z <= -0.00052) {
		tmp = (6.0 * y) * z;
	} else if (z <= 0.000114) {
		tmp = x;
	} else {
		tmp = (-6.0 * z) * 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 <= (-4.3d+194)) then
        tmp = (z * x) * (-6.0d0)
    else if (z <= (-0.00052d0)) then
        tmp = (6.0d0 * y) * z
    else if (z <= 0.000114d0) then
        tmp = x
    else
        tmp = ((-6.0d0) * z) * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -4.3e+194) {
		tmp = (z * x) * -6.0;
	} else if (z <= -0.00052) {
		tmp = (6.0 * y) * z;
	} else if (z <= 0.000114) {
		tmp = x;
	} else {
		tmp = (-6.0 * z) * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -4.3e+194:
		tmp = (z * x) * -6.0
	elif z <= -0.00052:
		tmp = (6.0 * y) * z
	elif z <= 0.000114:
		tmp = x
	else:
		tmp = (-6.0 * z) * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -4.3e+194)
		tmp = Float64(Float64(z * x) * -6.0);
	elseif (z <= -0.00052)
		tmp = Float64(Float64(6.0 * y) * z);
	elseif (z <= 0.000114)
		tmp = x;
	else
		tmp = Float64(Float64(-6.0 * z) * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -4.3e+194)
		tmp = (z * x) * -6.0;
	elseif (z <= -0.00052)
		tmp = (6.0 * y) * z;
	elseif (z <= 0.000114)
		tmp = x;
	else
		tmp = (-6.0 * z) * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -4.3e+194], N[(N[(z * x), $MachinePrecision] * -6.0), $MachinePrecision], If[LessEqual[z, -0.00052], N[(N[(6.0 * y), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[z, 0.000114], x, N[(N[(-6.0 * z), $MachinePrecision] * x), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if z < -4.29999999999999994e194

   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

      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 78.7

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

   5. Applied rewrites 78.7%

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 78.7

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

   8. Applied rewrites 78.7%

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

   if -4.29999999999999994e194 < z < -5.19999999999999954e-4

   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.6

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

   4. Applied rewrites 99.6%

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

   5. Taylor expanded in x around 0

      \[\leadsto \color{blue}{6 \cdot \left(y \cdot z\right)} \]
   6. 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 64.7

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

   7. Applied rewrites 64.7%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 64.7

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

   9. Applied rewrites 64.7%

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

   if -5.19999999999999954e-4 < z < 1.1400000000000001e-4

   1. Initial program 98.5%

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

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

   if 1.1400000000000001e-4 < 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

      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 53.3

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

   5. Applied rewrites 53.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

      1. lower-*.f64 53.1

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

   8. Applied rewrites 53.1%

      \[\leadsto \left(-6 \cdot z\right) \cdot x \]
3. Recombined 4 regimes into one program.

4. Final simplification 67.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4.3 \cdot 10^{+194}:\\ \;\;\;\;\left(z \cdot x\right) \cdot -6\\ \mathbf{elif}\;z \leq -0.00052:\\ \;\;\;\;\left(6 \cdot y\right) \cdot z\\ \mathbf{elif}\;z \leq 0.000114:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\left(-6 \cdot z\right) \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 60.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4.3 \cdot 10^{+194}:\\ \;\;\;\;\left(z \cdot x\right) \cdot -6\\ \mathbf{elif}\;z \leq -0.00052:\\ \;\;\;\;\left(z \cdot y\right) \cdot 6\\ \mathbf{elif}\;z \leq 0.000114:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\left(-6 \cdot z\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -4.3e+194)
   (* (* z x) -6.0)
   (if (<= z -0.00052)
     (* (* z y) 6.0)
     (if (<= z 0.000114) x (* (* -6.0 z) x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -4.3e+194) {
		tmp = (z * x) * -6.0;
	} else if (z <= -0.00052) {
		tmp = (z * y) * 6.0;
	} else if (z <= 0.000114) {
		tmp = x;
	} else {
		tmp = (-6.0 * z) * 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 <= (-4.3d+194)) then
        tmp = (z * x) * (-6.0d0)
    else if (z <= (-0.00052d0)) then
        tmp = (z * y) * 6.0d0
    else if (z <= 0.000114d0) then
        tmp = x
    else
        tmp = ((-6.0d0) * z) * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -4.3e+194) {
		tmp = (z * x) * -6.0;
	} else if (z <= -0.00052) {
		tmp = (z * y) * 6.0;
	} else if (z <= 0.000114) {
		tmp = x;
	} else {
		tmp = (-6.0 * z) * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -4.3e+194:
		tmp = (z * x) * -6.0
	elif z <= -0.00052:
		tmp = (z * y) * 6.0
	elif z <= 0.000114:
		tmp = x
	else:
		tmp = (-6.0 * z) * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -4.3e+194)
		tmp = Float64(Float64(z * x) * -6.0);
	elseif (z <= -0.00052)
		tmp = Float64(Float64(z * y) * 6.0);
	elseif (z <= 0.000114)
		tmp = x;
	else
		tmp = Float64(Float64(-6.0 * z) * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -4.3e+194)
		tmp = (z * x) * -6.0;
	elseif (z <= -0.00052)
		tmp = (z * y) * 6.0;
	elseif (z <= 0.000114)
		tmp = x;
	else
		tmp = (-6.0 * z) * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -4.3e+194], N[(N[(z * x), $MachinePrecision] * -6.0), $MachinePrecision], If[LessEqual[z, -0.00052], N[(N[(z * y), $MachinePrecision] * 6.0), $MachinePrecision], If[LessEqual[z, 0.000114], x, N[(N[(-6.0 * z), $MachinePrecision] * x), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if z < -4.29999999999999994e194

   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

      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 78.7

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

   5. Applied rewrites 78.7%

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 78.7

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

   8. Applied rewrites 78.7%

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

   if -4.29999999999999994e194 < z < -5.19999999999999954e-4

   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

      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 64.7

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

   5. Applied rewrites 64.7%

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

   if -5.19999999999999954e-4 < z < 1.1400000000000001e-4

   1. Initial program 98.5%

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

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

   if 1.1400000000000001e-4 < 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

      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 53.3

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

   5. Applied rewrites 53.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

      1. lower-*.f64 53.1

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

   8. Applied rewrites 53.1%

      \[\leadsto \left(-6 \cdot z\right) \cdot x \]
3. Recombined 4 regimes into one program.

4. Final simplification 67.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4.3 \cdot 10^{+194}:\\ \;\;\;\;\left(z \cdot x\right) \cdot -6\\ \mathbf{elif}\;z \leq -0.00052:\\ \;\;\;\;\left(z \cdot y\right) \cdot 6\\ \mathbf{elif}\;z \leq 0.000114:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\left(-6 \cdot z\right) \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -8000000 \lor \neg \left(z \leq 2300000000\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 -8000000.0) (not (<= z 2300000000.0)))
   (* (* 6.0 (- y x)) z)
   (fma y (* z 6.0) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -8000000.0) || !(z <= 2300000000.0)) {
		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 <= -8000000.0) || !(z <= 2300000000.0))
		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, -8000000.0], N[Not[LessEqual[z, 2300000000.0]], $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 < -8e6 or 2.3e9 < 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

      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. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 99.3

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

   5. Applied rewrites 99.3%

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

   if -8e6 < z < 2.3e9

   1. Initial program 98.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. 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 98.6%

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

4. Final simplification 98.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -8000000 \lor \neg \left(z \leq 2300000000\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 5: 98.5% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -8000000.0)
   (* (* 6.0 (- y x)) z)
   (if (<= z 0.000114) (fma y (* z 6.0) x) (* (- y x) (* 6.0 z)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -8e6

   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 inf

      \[\leadsto \color{blue}{6 \cdot \left(z \cdot \left(y - x\right)\right)} \]
   4. 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. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 99.1

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

   5. Applied rewrites 99.1%

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

   if -8e6 < z < 1.1400000000000001e-4

   1. Initial program 98.5%

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

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

   if 1.1400000000000001e-4 < z

   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 z around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 99.4

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

   7. Applied rewrites 99.4%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 99.4

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 99.4

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

   9. Applied rewrites 99.4%

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

4. Final simplification 98.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -8000000:\\ \;\;\;\;\left(6 \cdot \left(y - x\right)\right) \cdot z\\ \mathbf{elif}\;z \leq 0.000114:\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot 6, x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(y - x\right) \cdot \left(6 \cdot z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 85.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.65 \cdot 10^{+50} \lor \neg \left(y \leq 2.2 \cdot 10^{-51}\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 -1.65e+50) (not (<= y 2.2e-51)))
   (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 <= -1.65e+50) || !(y <= 2.2e-51)) {
		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 <= -1.65e+50) || !(y <= 2.2e-51))
		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, -1.65e+50], N[Not[LessEqual[y, 2.2e-51]], $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 < -1.65e50 or 2.2e-51 < y

   1. Initial program 99.1%

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

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

   if -1.65e50 < y < 2.2e-51

   1. Initial program 99.2%

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

      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 87.4

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

   5. Applied rewrites 87.4%

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

4. Final simplification 89.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.65 \cdot 10^{+50} \lor \neg \left(y \leq 2.2 \cdot 10^{-51}\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 7: 74.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6.7 \cdot 10^{+140} \lor \neg \left(y \leq 5.5 \cdot 10^{+147}\right):\\ \;\;\;\;\left(6 \cdot z\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 (or (<= y -6.7e+140) (not (<= y 5.5e+147)))
   (* (* 6.0 z) y)
   (* (fma -6.0 z 1.0) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -6.7e+140) || !(y <= 5.5e+147)) {
		tmp = (6.0 * z) * y;
	} else {
		tmp = fma(-6.0, z, 1.0) * x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -6.7e+140) || !(y <= 5.5e+147))
		tmp = Float64(Float64(6.0 * z) * y);
	else
		tmp = Float64(fma(-6.0, z, 1.0) * x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -6.7e+140], N[Not[LessEqual[y, 5.5e+147]], $MachinePrecision]], N[(N[(6.0 * z), $MachinePrecision] * y), $MachinePrecision], N[(N[(-6.0 * z + 1.0), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -6.7e140 or 5.4999999999999997e147 < y

   1. Initial program 98.4%

      \[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 \color{blue}{6 \cdot \left(y \cdot z\right)} \]
   6. 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 79.4

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

   7. Applied rewrites 79.4%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. lower-*.f64 79.5

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 79.5

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

   9. Applied rewrites 79.5%

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

   if -6.7e140 < y < 5.4999999999999997e147

   1. Initial program 99.4%

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

      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 77.6

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

   5. Applied rewrites 77.6%

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

4. Final simplification 78.1%

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

Alternative 8: 85.5% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.65e+50)
   (fma y (* z 6.0) x)
   (if (<= y 2.2e-51) (* (fma -6.0 z 1.0) x) (fma (* y 6.0) z x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.65e+50) {
		tmp = fma(y, (z * 6.0), x);
	} else if (y <= 2.2e-51) {
		tmp = fma(-6.0, z, 1.0) * x;
	} else {
		tmp = fma((y * 6.0), z, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.65e+50)
		tmp = fma(y, Float64(z * 6.0), x);
	elseif (y <= 2.2e-51)
		tmp = Float64(fma(-6.0, z, 1.0) * x);
	else
		tmp = fma(Float64(y * 6.0), z, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.65e+50], N[(y * N[(z * 6.0), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[y, 2.2e-51], N[(N[(-6.0 * z + 1.0), $MachinePrecision] * x), $MachinePrecision], N[(N[(y * 6.0), $MachinePrecision] * z + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.65e50

   1. Initial program 98.1%

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

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

   if -1.65e50 < y < 2.2e-51

   1. Initial program 99.2%

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

      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 87.4

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

   5. Applied rewrites 87.4%

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

   if 2.2e-51 < y

   1. Initial program 99.9%

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

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-*.f64 90.1

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

   9. Applied rewrites 90.1%

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

4. Final simplification 89.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.65 \cdot 10^{+50}:\\ \;\;\;\;\mathsf{fma}\left(y, z \cdot 6, x\right)\\ \mathbf{elif}\;y \leq 2.2 \cdot 10^{-51}:\\ \;\;\;\;\mathsf{fma}\left(-6, z, 1\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y \cdot 6, z, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 60.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -8000000 \lor \neg \left(z \leq 0.000114\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 -8000000.0) (not (<= z 0.000114))) (* (* -6.0 z) x) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -8000000.0) || !(z <= 0.000114)) {
		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 <= (-8000000.0d0)) .or. (.not. (z <= 0.000114d0))) 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 <= -8000000.0) || !(z <= 0.000114)) {
		tmp = (-6.0 * z) * x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -8000000.0) || !(z <= 0.000114))
		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 <= -8000000.0) || ~((z <= 0.000114)))
		tmp = (-6.0 * z) * x;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -8e6 or 1.1400000000000001e-4 < 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

      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 54.0

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

   5. Applied rewrites 54.0%

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

      1. lower-*.f64 53.6

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

   8. Applied rewrites 53.6%

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

   if -8e6 < z < 1.1400000000000001e-4

   1. Initial program 98.5%

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

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

4. Final simplification 63.9%

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

Alternative 10: 60.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -8000000 \lor \neg \left(z \leq 0.000114\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 -8000000.0) (not (<= z 0.000114))) (* (* z x) -6.0) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -8000000.0) || !(z <= 0.000114)) {
		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 <= (-8000000.0d0)) .or. (.not. (z <= 0.000114d0))) 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 <= -8000000.0) || !(z <= 0.000114)) {
		tmp = (z * x) * -6.0;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -8000000.0) || !(z <= 0.000114))
		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 <= -8000000.0) || ~((z <= 0.000114)))
		tmp = (z * x) * -6.0;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -8e6 or 1.1400000000000001e-4 < 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

      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 54.0

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

   5. Applied rewrites 54.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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 53.5

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

   8. Applied rewrites 53.5%

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

   if -8e6 < z < 1.1400000000000001e-4

   1. Initial program 98.5%

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

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

4. Final simplification 63.8%

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

Alternative 11: 35.7% 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.1%

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

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

6. Final simplification 38.8%

   \[\leadsto x \]
7. 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 2025026 
(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)))