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

Percentage Accurate: 99.5% → 99.7%

Time: 3.9s

Alternatives: 11

Speedup: 1.9×

• 20.5% 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 \left(\frac{2}{3} - z\right) \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.7% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.5%

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

3. Taylor expanded in z around 0

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

   1. +-commutative N/A

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

   2. associate-*r* N/A

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

   3. distribute-rgt-out N/A

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

   4. lower-fma.f64 N/A

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

   5. lift--.f64 N/A

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

   6. lower-fma.f64 99.8

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

5. Applied rewrites 99.8%

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

Alternative 2: 75.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{2}{3} - z\\ t_1 := \mathsf{fma}\left(-6, z, 4\right) \cdot y\\ \mathbf{if}\;t\_0 \leq -1:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 0.66667:\\ \;\;\;\;\mathsf{fma}\left(-3, x, 4 \cdot y\right)\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+90}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot x\right) \cdot 6\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (/ 2.0 3.0) z)) (t_1 (* (fma -6.0 z 4.0) y)))
   (if (<= t_0 -1.0)
     t_1
     (if (<= t_0 0.66667)
       (fma -3.0 x (* 4.0 y))
       (if (<= t_0 2e+90) t_1 (* (* z x) 6.0))))))

C

double code(double x, double y, double z) {
	double t_0 = (2.0 / 3.0) - z;
	double t_1 = fma(-6.0, z, 4.0) * y;
	double tmp;
	if (t_0 <= -1.0) {
		tmp = t_1;
	} else if (t_0 <= 0.66667) {
		tmp = fma(-3.0, x, (4.0 * y));
	} else if (t_0 <= 2e+90) {
		tmp = t_1;
	} else {
		tmp = (z * x) * 6.0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(2.0 / 3.0) - z)
	t_1 = Float64(fma(-6.0, z, 4.0) * y)
	tmp = 0.0
	if (t_0 <= -1.0)
		tmp = t_1;
	elseif (t_0 <= 0.66667)
		tmp = fma(-3.0, x, Float64(4.0 * y));
	elseif (t_0 <= 2e+90)
		tmp = t_1;
	else
		tmp = Float64(Float64(z * x) * 6.0);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(2.0 / 3.0), $MachinePrecision] - z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-6.0 * z + 4.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$0, -1.0], t$95$1, If[LessEqual[t$95$0, 0.66667], N[(-3.0 * x + N[(4.0 * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+90], t$95$1, N[(N[(z * x), $MachinePrecision] * 6.0), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -1 or 0.666669999999999985 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 1.99999999999999993e90

   1. Initial program 99.7%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-*r* N/A

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

      3. distribute-rgt-out N/A

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

      4. lower-fma.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lower-fma.f64 99.7

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

   5. Applied rewrites 99.7%

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

   6. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lift-fma.f64 65.9

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

   8. Applied rewrites 65.9%

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

   if -1 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 0.666669999999999985

   1. Initial program 99.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lift--.f64 99.0

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

   5. Applied rewrites 99.0%

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

   6. Taylor expanded in x around 0

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

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-3, x, 4 \cdot y\right) \]

      2. lower-*.f64 99.1

         \[\leadsto \mathsf{fma}\left(-3, x, 4 \cdot y\right) \]

   8. Applied rewrites 99.1%

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

   if 1.99999999999999993e90 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z)

   1. Initial program 99.6%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   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 \left(z \cdot \left(y - x\right)\right) \cdot \color{blue}{-6} \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in x 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 64.4

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

   8. Applied rewrites 64.4%

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

Alternative 3: 97.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{2}{3} - z\\ \mathbf{if}\;t\_0 \leq -1 \lor \neg \left(t\_0 \leq 1\right):\\ \;\;\;\;\left(-6 \cdot \left(y - x\right)\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-3, x, 4 \cdot y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (/ 2.0 3.0) z)))
   (if (or (<= t_0 -1.0) (not (<= t_0 1.0)))
     (* (* -6.0 (- y x)) z)
     (fma -3.0 x (* 4.0 y)))))

C

double code(double x, double y, double z) {
	double t_0 = (2.0 / 3.0) - z;
	double tmp;
	if ((t_0 <= -1.0) || !(t_0 <= 1.0)) {
		tmp = (-6.0 * (y - x)) * z;
	} else {
		tmp = fma(-3.0, x, (4.0 * y));
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(2.0 / 3.0) - z)
	tmp = 0.0
	if ((t_0 <= -1.0) || !(t_0 <= 1.0))
		tmp = Float64(Float64(-6.0 * Float64(y - x)) * z);
	else
		tmp = fma(-3.0, x, Float64(4.0 * y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(2.0 / 3.0), $MachinePrecision] - z), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -1.0], N[Not[LessEqual[t$95$0, 1.0]], $MachinePrecision]], N[(N[(-6.0 * N[(y - x), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], N[(-3.0 * x + N[(4.0 * y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < -1 or 1 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z)

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   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 \left(z \cdot \left(y - x\right)\right) \cdot \color{blue}{-6} \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 97.8

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

   5. Applied rewrites 97.8%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lower-*.f64 97.8

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

   7. Applied rewrites 97.8%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* 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 \color{blue}{z} \]

      7. lower-*.f64 N/A

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

      8. lift--.f64 97.7

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

   9. Applied rewrites 97.7%

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

   if -1 < (-.f64 (/.f64 #s(literal 2 binary64) #s(literal 3 binary64)) z) < 1

   1. Initial program 99.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lift--.f64 97.6

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

   5. Applied rewrites 97.6%

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

   6. Taylor expanded in x around 0

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

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-3, x, 4 \cdot y\right) \]

      2. lower-*.f64 97.8

         \[\leadsto \mathsf{fma}\left(-3, x, 4 \cdot y\right) \]

   8. Applied rewrites 97.8%

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

4. Final simplification 97.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{2}{3} - z \leq -1 \lor \neg \left(\frac{2}{3} - z \leq 1\right):\\ \;\;\;\;\left(-6 \cdot \left(y - x\right)\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-3, x, 4 \cdot y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 74.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.25 \cdot 10^{+90}:\\ \;\;\;\;\left(z \cdot x\right) \cdot 6\\ \mathbf{elif}\;z \leq -12 \lor \neg \left(z \leq 0.66\right):\\ \;\;\;\;\left(y \cdot z\right) \cdot -6\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-3, x, 4 \cdot y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -3.25e+90)
   (* (* z x) 6.0)
   (if (or (<= z -12.0) (not (<= z 0.66)))
     (* (* y z) -6.0)
     (fma -3.0 x (* 4.0 y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.25e+90) {
		tmp = (z * x) * 6.0;
	} else if ((z <= -12.0) || !(z <= 0.66)) {
		tmp = (y * z) * -6.0;
	} else {
		tmp = fma(-3.0, x, (4.0 * y));
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -3.25e+90)
		tmp = Float64(Float64(z * x) * 6.0);
	elseif ((z <= -12.0) || !(z <= 0.66))
		tmp = Float64(Float64(y * z) * -6.0);
	else
		tmp = fma(-3.0, x, Float64(4.0 * y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -3.25e+90], N[(N[(z * x), $MachinePrecision] * 6.0), $MachinePrecision], If[Or[LessEqual[z, -12.0], N[Not[LessEqual[z, 0.66]], $MachinePrecision]], N[(N[(y * z), $MachinePrecision] * -6.0), $MachinePrecision], N[(-3.0 * x + N[(4.0 * y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.25e90

   1. Initial program 99.6%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   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 \left(z \cdot \left(y - x\right)\right) \cdot \color{blue}{-6} \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in x 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 64.4

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

   8. Applied rewrites 64.4%

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

   if -3.25e90 < z < -12 or 0.660000000000000031 < z

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   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 \left(z \cdot \left(y - x\right)\right) \cdot \color{blue}{-6} \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 96.6

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

   5. Applied rewrites 96.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 63.4%

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

   if -12 < z < 0.660000000000000031

   1. Initial program 99.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lift--.f64 97.6

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

   5. Applied rewrites 97.6%

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

   6. Taylor expanded in x around 0

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

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-3, x, 4 \cdot y\right) \]

      2. lower-*.f64 97.8

         \[\leadsto \mathsf{fma}\left(-3, x, 4 \cdot y\right) \]

   8. Applied rewrites 97.8%

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

4. Final simplification 82.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.25 \cdot 10^{+90}:\\ \;\;\;\;\left(z \cdot x\right) \cdot 6\\ \mathbf{elif}\;z \leq -12 \lor \neg \left(z \leq 0.66\right):\\ \;\;\;\;\left(y \cdot z\right) \cdot -6\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-3, x, 4 \cdot y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 74.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.25 \cdot 10^{+90}:\\ \;\;\;\;\left(z \cdot x\right) \cdot 6\\ \mathbf{elif}\;z \leq -12 \lor \neg \left(z \leq 0.66\right):\\ \;\;\;\;\left(y \cdot z\right) \cdot -6\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(4, y - x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -3.25e+90)
   (* (* z x) 6.0)
   (if (or (<= z -12.0) (not (<= z 0.66)))
     (* (* y z) -6.0)
     (fma 4.0 (- y x) x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.25e+90) {
		tmp = (z * x) * 6.0;
	} else if ((z <= -12.0) || !(z <= 0.66)) {
		tmp = (y * z) * -6.0;
	} else {
		tmp = fma(4.0, (y - x), x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -3.25e+90)
		tmp = Float64(Float64(z * x) * 6.0);
	elseif ((z <= -12.0) || !(z <= 0.66))
		tmp = Float64(Float64(y * z) * -6.0);
	else
		tmp = fma(4.0, Float64(y - x), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -3.25e+90], N[(N[(z * x), $MachinePrecision] * 6.0), $MachinePrecision], If[Or[LessEqual[z, -12.0], N[Not[LessEqual[z, 0.66]], $MachinePrecision]], N[(N[(y * z), $MachinePrecision] * -6.0), $MachinePrecision], N[(4.0 * N[(y - x), $MachinePrecision] + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.25e90

   1. Initial program 99.6%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   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 \left(z \cdot \left(y - x\right)\right) \cdot \color{blue}{-6} \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in x 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 64.4

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

   8. Applied rewrites 64.4%

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

   if -3.25e90 < z < -12 or 0.660000000000000031 < z

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   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 \left(z \cdot \left(y - x\right)\right) \cdot \color{blue}{-6} \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 96.6

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

   5. Applied rewrites 96.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 63.4%

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

   if -12 < z < 0.660000000000000031

   1. Initial program 99.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lift--.f64 97.6

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

   5. Applied rewrites 97.6%

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

4. Final simplification 82.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.25 \cdot 10^{+90}:\\ \;\;\;\;\left(z \cdot x\right) \cdot 6\\ \mathbf{elif}\;z \leq -12 \lor \neg \left(z \leq 0.66\right):\\ \;\;\;\;\left(y \cdot z\right) \cdot -6\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(4, y - x, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 74.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.25 \cdot 10^{+90}:\\ \;\;\;\;\left(z \cdot x\right) \cdot 6\\ \mathbf{elif}\;z \leq -12 \lor \neg \left(z \leq 0.66\right):\\ \;\;\;\;y \cdot \left(-6 \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(4, y - x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -3.25e+90)
   (* (* z x) 6.0)
   (if (or (<= z -12.0) (not (<= z 0.66)))
     (* y (* -6.0 z))
     (fma 4.0 (- y x) x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.25e+90) {
		tmp = (z * x) * 6.0;
	} else if ((z <= -12.0) || !(z <= 0.66)) {
		tmp = y * (-6.0 * z);
	} else {
		tmp = fma(4.0, (y - x), x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -3.25e+90)
		tmp = Float64(Float64(z * x) * 6.0);
	elseif ((z <= -12.0) || !(z <= 0.66))
		tmp = Float64(y * Float64(-6.0 * z));
	else
		tmp = fma(4.0, Float64(y - x), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -3.25e+90], N[(N[(z * x), $MachinePrecision] * 6.0), $MachinePrecision], If[Or[LessEqual[z, -12.0], N[Not[LessEqual[z, 0.66]], $MachinePrecision]], N[(y * N[(-6.0 * z), $MachinePrecision]), $MachinePrecision], N[(4.0 * N[(y - x), $MachinePrecision] + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.25e90

   1. Initial program 99.6%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   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 \left(z \cdot \left(y - x\right)\right) \cdot \color{blue}{-6} \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in x 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 64.4

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

   8. Applied rewrites 64.4%

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

   if -3.25e90 < z < -12 or 0.660000000000000031 < z

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   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 \left(z \cdot \left(y - x\right)\right) \cdot \color{blue}{-6} \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 96.6

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

   5. Applied rewrites 96.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 63.4%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 63.2

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

   10. Applied rewrites 63.2%

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

   if -12 < z < 0.660000000000000031

   1. Initial program 99.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lift--.f64 97.6

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

   5. Applied rewrites 97.6%

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

4. Final simplification 82.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.25 \cdot 10^{+90}:\\ \;\;\;\;\left(z \cdot x\right) \cdot 6\\ \mathbf{elif}\;z \leq -12 \lor \neg \left(z \leq 0.66\right):\\ \;\;\;\;y \cdot \left(-6 \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(4, y - x, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 97.9% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -0.58)
   (* (* (- y x) z) -6.0)
   (if (<= z 0.52) (fma -3.0 x (* 4.0 y)) (* (* -6.0 (- y x)) z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -0.58) {
		tmp = ((y - x) * z) * -6.0;
	} else if (z <= 0.52) {
		tmp = fma(-3.0, x, (4.0 * y));
	} else {
		tmp = (-6.0 * (y - x)) * z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -0.58)
		tmp = Float64(Float64(Float64(y - x) * z) * -6.0);
	elseif (z <= 0.52)
		tmp = fma(-3.0, x, Float64(4.0 * y));
	else
		tmp = Float64(Float64(-6.0 * Float64(y - x)) * z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -0.58], N[(N[(N[(y - x), $MachinePrecision] * z), $MachinePrecision] * -6.0), $MachinePrecision], If[LessEqual[z, 0.52], N[(-3.0 * x + N[(4.0 * y), $MachinePrecision]), $MachinePrecision], N[(N[(-6.0 * N[(y - x), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -0.57999999999999996

   1. Initial program 99.6%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   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 \left(z \cdot \left(y - x\right)\right) \cdot \color{blue}{-6} \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 97.9

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

   5. Applied rewrites 97.9%

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

   if -0.57999999999999996 < z < 0.52000000000000002

   1. Initial program 99.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lift--.f64 97.6

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

   5. Applied rewrites 97.6%

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

   6. Taylor expanded in x around 0

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

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-3, x, 4 \cdot y\right) \]

      2. lower-*.f64 97.8

         \[\leadsto \mathsf{fma}\left(-3, x, 4 \cdot y\right) \]

   8. Applied rewrites 97.8%

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

   if 0.52000000000000002 < z

   1. Initial program 99.8%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   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 \left(z \cdot \left(y - x\right)\right) \cdot \color{blue}{-6} \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 97.8

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

   5. Applied rewrites 97.8%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lower-*.f64 97.7

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

   7. Applied rewrites 97.7%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* 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 \color{blue}{z} \]

      7. lower-*.f64 N/A

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

      8. lift--.f64 97.8

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

   9. Applied rewrites 97.8%

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

Alternative 8: 74.4% accurate, 1.3× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.5e+26) (not (<= z 0.52)))
   (* (* z x) 6.0)
   (fma 4.0 (- y x) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.5e+26) || !(z <= 0.52)) {
		tmp = (z * x) * 6.0;
	} else {
		tmp = fma(4.0, (y - x), x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.5e+26) || !(z <= 0.52))
		tmp = Float64(Float64(z * x) * 6.0);
	else
		tmp = fma(4.0, Float64(y - x), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1.5e+26], N[Not[LessEqual[z, 0.52]], $MachinePrecision]], N[(N[(z * x), $MachinePrecision] * 6.0), $MachinePrecision], N[(4.0 * N[(y - x), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.49999999999999999e26 or 0.52000000000000002 < z

   1. Initial program 99.7%

      \[x + \left(\left(y - x\right) \cdot 6\right) \cdot \left(\frac{2}{3} - z\right) \]
   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 \left(z \cdot \left(y - x\right)\right) \cdot \color{blue}{-6} \]

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 98.8

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

   5. Applied rewrites 98.8%

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

   6. Taylor expanded in x 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 48.3

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

   8. Applied rewrites 48.3%

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

   if -1.49999999999999999e26 < z < 0.52000000000000002

   1. Initial program 99.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lift--.f64 95.9

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

   5. Applied rewrites 95.9%

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

4. Final simplification 75.1%

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

Alternative 9: 38.4% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.32 \cdot 10^{+50} \lor \neg \left(x \leq 84000\right):\\ \;\;\;\;-3 \cdot x\\ \mathbf{else}:\\ \;\;\;\;4 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.32e+50) (not (<= x 84000.0))) (* -3.0 x) (* 4.0 y)))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.32e+50) || !(x <= 84000.0)) {
		tmp = -3.0 * x;
	} else {
		tmp = 4.0 * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.32e+50) or not (x <= 84000.0):
		tmp = -3.0 * x
	else:
		tmp = 4.0 * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.32e+50) || !(x <= 84000.0))
		tmp = Float64(-3.0 * x);
	else
		tmp = Float64(4.0 * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.32e+50) || ~((x <= 84000.0)))
		tmp = -3.0 * x;
	else
		tmp = 4.0 * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.32e+50], N[Not[LessEqual[x, 84000.0]], $MachinePrecision]], N[(-3.0 * x), $MachinePrecision], N[(4.0 * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.3199999999999999e50 or 84000 < x

   1. Initial program 99.5%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lift--.f64 59.2

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

   5. Applied rewrites 59.2%

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

   6. Taylor expanded in x around inf

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

      1. lower-*.f64 52.0

         \[\leadsto -3 \cdot x \]

   8. Applied rewrites 52.0%

      \[\leadsto -3 \cdot \color{blue}{x} \]

   if -1.3199999999999999e50 < x < 84000

   1. Initial program 99.6%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lift--.f64 52.8

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

   5. Applied rewrites 52.8%

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

   6. Taylor expanded in x around 0

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

      1. lower-*.f64 42.7

         \[\leadsto 4 \cdot y \]

   8. Applied rewrites 42.7%

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

4. Final simplification 46.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.32 \cdot 10^{+50} \lor \neg \left(x \leq 84000\right):\\ \;\;\;\;-3 \cdot x\\ \mathbf{else}:\\ \;\;\;\;4 \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 50.9% accurate, 3.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.5%

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

3. Taylor expanded in z around 0

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

   1. +-commutative N/A

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

   2. lower-fma.f64 N/A

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

   3. lift--.f64 55.4

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

5. Applied rewrites 55.4%

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

Alternative 11: 26.1% accurate, 5.2× speedup

Math

\[\begin{array}{l} \\ -3 \cdot x \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.5%

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

3. Taylor expanded in z around 0

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

   1. +-commutative N/A

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

   2. lower-fma.f64 N/A

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

   3. lift--.f64 55.4

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

5. Applied rewrites 55.4%

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

6. Taylor expanded in x around inf

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

   1. lower-*.f64 29.0

      \[\leadsto -3 \cdot x \]

8. Applied rewrites 29.0%

   \[\leadsto -3 \cdot \color{blue}{x} \]
9. Add Preprocessing

Reproduce

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