Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, J

Percentage Accurate: 96.0% → 98.1%

Time: 4.9s

Alternatives: 11

Speedup: 1.1×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 96.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.1% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.4%

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

   1. lift-*.f64 N/A

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

   2. lift--.f64 N/A

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

   3. lift-*.f64 N/A

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

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

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

   5. distribute-lft-in N/A

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

   6. lower-fma.f64 N/A

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

   7. lower-*.f64 N/A

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

   8. distribute-lft-neg-out N/A

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

   9. lift-*.f64 N/A

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

   10. lower-neg.f64 98.4

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

   11. lift-*.f64 N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 98.4

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

4. Applied rewrites 98.4%

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

   1. lift-fma.f64 N/A

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

   2. *-rgt-identity N/A

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

   3. +-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. lift-neg.f64 N/A

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

   6. lift-*.f64 N/A

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

   7. distribute-rgt-neg-in N/A

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

   8. associate-*r* N/A

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

   9. lift-*.f64 N/A

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

   10. lower-fma.f64 N/A

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

   11. lift-*.f64 N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 N/A

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

   14. lower-neg.f64 98.5

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

6. Applied rewrites 98.5%

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

7. Taylor expanded in y around 0

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

   1. lower--.f64 98.5

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

9. Applied rewrites 98.5%

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

Alternative 2: 97.0% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- 1.0 (* (- 1.0 y) z))))
   (if (or (<= t_0 -1.0) (not (<= t_0 200000000.0)))
     (* (* (- y 1.0) x) z)
     (fma (- x) z x))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z)) < -1 or 2e8 < (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z))

   1. Initial program 97.3%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 96.9%

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

   7. Applied rewrites 94.4%

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

   if -1 < (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z)) < 2e8

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. distribute-lft-in N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. distribute-lft-neg-out N/A

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

      9. lift-*.f64 N/A

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

      10. lower-neg.f64 100.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 95.4%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 97.8%

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

4. Final simplification 95.8%

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

Alternative 3: 96.8% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- 1.0 (* (- 1.0 y) z))))
   (if (<= t_0 -1.0)
     (* (* (- y 1.0) x) z)
     (if (<= t_0 2.0) (fma (- x) z x) (* (- y 1.0) (* x z))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z)) < -1

   1. Initial program 97.4%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 95.6%

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

   7. Applied rewrites 96.5%

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

   if -1 < (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z)) < 2

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. distribute-lft-in N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. distribute-lft-neg-out N/A

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

      9. lift-*.f64 N/A

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

      10. lower-neg.f64 100.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 96.2%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 99.3%

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

   if 2 < (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z))

   1. Initial program 97.3%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 96.4%

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

4. Final simplification 97.6%

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

Alternative 4: 96.1% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (- 1.0 (* (- 1.0 y) z)) 1e+15)
   (fma (* (- y 1.0) x) z x)
   (* (- y 1.0) (* x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((1.0 - ((1.0 - y) * z)) <= 1e+15) {
		tmp = fma(((y - 1.0) * x), z, x);
	} else {
		tmp = (y - 1.0) * (x * z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(1.0 - Float64(Float64(1.0 - y) * z)) <= 1e+15)
		tmp = fma(Float64(Float64(y - 1.0) * x), z, x);
	else
		tmp = Float64(Float64(y - 1.0) * Float64(x * z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(1.0 - N[(N[(1.0 - y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], 1e+15], N[(N[(N[(y - 1.0), $MachinePrecision] * x), $MachinePrecision] * z + x), $MachinePrecision], N[(N[(y - 1.0), $MachinePrecision] * N[(x * z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z)) < 1e15

   1. Initial program 98.9%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. distribute-lft-in N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. distribute-lft-neg-out N/A

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

      9. lift-*.f64 N/A

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

      10. lower-neg.f64 98.9

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 98.9

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

   4. Applied rewrites 98.9%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 96.8%

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

   if 1e15 < (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z))

   1. Initial program 97.2%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 98.5%

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

4. Final simplification 97.3%

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

Alternative 5: 95.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;1 - y \leq -500000000 \lor \neg \left(1 - y \leq 1.000001\right):\\ \;\;\;\;\mathsf{fma}\left(x \cdot y, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-x, z, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= (- 1.0 y) -500000000.0) (not (<= (- 1.0 y) 1.000001)))
   (fma (* x y) z x)
   (fma (- x) z x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (((1.0 - y) <= -500000000.0) || !((1.0 - y) <= 1.000001)) {
		tmp = fma((x * y), z, x);
	} else {
		tmp = fma(-x, z, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((Float64(1.0 - y) <= -500000000.0) || !(Float64(1.0 - y) <= 1.000001))
		tmp = fma(Float64(x * y), z, x);
	else
		tmp = fma(Float64(-x), z, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[N[(1.0 - y), $MachinePrecision], -500000000.0], N[Not[LessEqual[N[(1.0 - y), $MachinePrecision], 1.000001]], $MachinePrecision]], N[(N[(x * y), $MachinePrecision] * z + x), $MachinePrecision], N[((-x) * z + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -5e8 or 1.00000099999999992 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 97.1%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. distribute-lft-in N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. distribute-lft-neg-out N/A

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

      9. lift-*.f64 N/A

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

      10. lower-neg.f64 97.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 97.0

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

   4. Applied rewrites 97.0%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 91.5%

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

   8. Taylor expanded in y around inf

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

   10. Applied rewrites 91.3%

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

   if -5e8 < (-.f64 #s(literal 1 binary64) y) < 1.00000099999999992

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. distribute-lft-in N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. distribute-lft-neg-out N/A

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

      9. lift-*.f64 N/A

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

      10. lower-neg.f64 100.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 100.0%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 98.3%

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

4. Final simplification 94.6%

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

Alternative 6: 84.0% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (- 1.0 y) -5e+58)
   (* x (* z y))
   (if (<= (- 1.0 y) 1e+25) (fma (- x) z x) (* (* x z) y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((1.0 - y) <= -5e+58) {
		tmp = x * (z * y);
	} else if ((1.0 - y) <= 1e+25) {
		tmp = fma(-x, z, x);
	} else {
		tmp = (x * z) * y;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(1.0 - y) <= -5e+58)
		tmp = Float64(x * Float64(z * y));
	elseif (Float64(1.0 - y) <= 1e+25)
		tmp = fma(Float64(-x), z, x);
	else
		tmp = Float64(Float64(x * z) * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(1.0 - y), $MachinePrecision], -5e+58], N[(x * N[(z * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(1.0 - y), $MachinePrecision], 1e+25], N[((-x) * z + x), $MachinePrecision], N[(N[(x * z), $MachinePrecision] * y), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -4.99999999999999986e58

   1. Initial program 96.2%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 78.0

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

   5. Applied rewrites 78.0%

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

   if -4.99999999999999986e58 < (-.f64 #s(literal 1 binary64) y) < 1.00000000000000009e25

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. distribute-lft-in N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. distribute-lft-neg-out N/A

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

      9. lift-*.f64 N/A

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

      10. lower-neg.f64 100.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 100.0%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 94.9%

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

   if 1.00000000000000009e25 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 96.7%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. distribute-lft-in N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. distribute-lft-neg-out N/A

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

      9. lift-*.f64 N/A

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

      10. lower-neg.f64 96.6

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 96.6

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

   4. Applied rewrites 96.6%

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

      1. lift-fma.f64 N/A

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

      2. *-rgt-identity N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-neg.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. distribute-rgt-neg-in N/A

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

      8. associate-*r* N/A

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

      9. lift-*.f64 N/A

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

      10. lower-fma.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. lower-neg.f64 97.4

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

   6. Applied rewrites 97.4%

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

   7. Taylor expanded in y around 0

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

      1. lower--.f64 97.4

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

   9. Applied rewrites 97.4%

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

   10. Taylor expanded in y around inf

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

       1. *-commutative N/A

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

       2. associate-*r* N/A

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

       3. lower-*.f64 N/A

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

       4. lower-*.f64 77.7

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

   12. Applied rewrites 77.7%

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

4. Final simplification 87.5%

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

Alternative 7: 85.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.2 \cdot 10^{+30} \lor \neg \left(y \leq 1.75 \cdot 10^{+55}\right):\\ \;\;\;\;\left(x \cdot z\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-x, z, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -1.2e+30) (not (<= y 1.75e+55))) (* (* x z) y) (fma (- x) z x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1.2e+30) || !(y <= 1.75e+55)) {
		tmp = (x * z) * y;
	} else {
		tmp = fma(-x, z, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -1.2e+30) || !(y <= 1.75e+55))
		tmp = Float64(Float64(x * z) * y);
	else
		tmp = fma(Float64(-x), z, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -1.2e+30], N[Not[LessEqual[y, 1.75e+55]], $MachinePrecision]], N[(N[(x * z), $MachinePrecision] * y), $MachinePrecision], N[((-x) * z + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.2e30 or 1.75000000000000005e55 < y

   1. Initial program 96.4%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. distribute-lft-in N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. distribute-lft-neg-out N/A

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

      9. lift-*.f64 N/A

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

      10. lower-neg.f64 96.4

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 96.4

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

   4. Applied rewrites 96.4%

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

      1. lift-fma.f64 N/A

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

      2. *-rgt-identity N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-neg.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. distribute-rgt-neg-in N/A

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

      8. associate-*r* N/A

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

      9. lift-*.f64 N/A

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

      10. lower-fma.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. lower-neg.f64 96.6

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

   6. Applied rewrites 96.6%

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

   7. Taylor expanded in y around 0

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

      1. lower--.f64 96.6

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

   9. Applied rewrites 96.6%

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

   10. Taylor expanded in y around inf

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

       1. *-commutative N/A

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

       2. associate-*r* N/A

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

       3. lower-*.f64 N/A

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

       4. lower-*.f64 77.8

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

   12. Applied rewrites 77.8%

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

   if -1.2e30 < y < 1.75000000000000005e55

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. distribute-lft-in N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. distribute-lft-neg-out N/A

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

      9. lift-*.f64 N/A

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

      10. lower-neg.f64 100.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 100.0%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 94.9%

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

4. Final simplification 87.4%

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

Alternative 8: 65.5% accurate, 0.8× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 1.0)) {
		tmp = -x * z;
	} else {
		tmp = x * 1.0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-1.0d0)) .or. (.not. (z <= 1.0d0))) then
        tmp = -x * z
    else
        tmp = x * 1.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1 < z

   1. Initial program 96.6%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 98.7%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 55.7%

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

   if -1 < z < 1

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lft-mult-inverse N/A

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

      3. distribute-rgt-out N/A

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

      4. *-rgt-identity N/A

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

      5. distribute-lft-out-- N/A

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

      6. associate--l+ N/A

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

      7. distribute-rgt-in N/A

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

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

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

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

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

      10. *-commutative N/A

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 71.0%

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

4. Final simplification 64.3%

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

Alternative 9: 96.0% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.4%

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

3. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. lft-mult-inverse N/A

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

   3. distribute-rgt-out N/A

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

   4. *-rgt-identity N/A

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

   5. distribute-lft-out-- N/A

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

   6. associate--l+ N/A

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

   7. distribute-rgt-in N/A

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

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

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

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

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

   10. *-commutative N/A

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

5. Applied rewrites 98.4%

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

Alternative 10: 66.5% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.4%

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

   1. lift-*.f64 N/A

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

   2. lift--.f64 N/A

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

   3. lift-*.f64 N/A

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

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

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

   5. distribute-lft-in N/A

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

   6. lower-fma.f64 N/A

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

   7. lower-*.f64 N/A

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

   8. distribute-lft-neg-out N/A

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

   9. lift-*.f64 N/A

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

   10. lower-neg.f64 98.4

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

   11. lift-*.f64 N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 98.4

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

4. Applied rewrites 98.4%

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

5. Taylor expanded in x around 0

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

7. Applied rewrites 95.5%

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

8. Taylor expanded in y around 0

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

10. Applied rewrites 65.8%

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

11. Final simplification 65.8%

    \[\leadsto \mathsf{fma}\left(-x, z, x\right) \]
12. Add Preprocessing

Alternative 11: 38.5% accurate, 2.8× speedup

Math

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

FPCore

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

C

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

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 * 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.4%

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

3. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. lft-mult-inverse N/A

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

   3. distribute-rgt-out N/A

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

   4. *-rgt-identity N/A

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

   5. distribute-lft-out-- N/A

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

   6. associate--l+ N/A

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

   7. distribute-rgt-in N/A

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

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

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

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

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

   10. *-commutative N/A

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

5. Applied rewrites 98.4%

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

6. Taylor expanded in z around 0

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

8. Applied rewrites 41.1%

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

Developer Target 1: 99.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \left(1 - \left(1 - y\right) \cdot z\right)\\ t_1 := x + \left(1 - y\right) \cdot \left(\left(-z\right) \cdot x\right)\\ \mathbf{if}\;t\_0 < -1.618195973607049 \cdot 10^{+50}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 < 3.892237649663903 \cdot 10^{+134}:\\ \;\;\;\;\left(x \cdot y\right) \cdot z - \left(x \cdot z - x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (- 1.0 (* (- 1.0 y) z))))
        (t_1 (+ x (* (- 1.0 y) (* (- z) x)))))
   (if (< t_0 -1.618195973607049e+50)
     t_1
     (if (< t_0 3.892237649663903e+134) (- (* (* x y) z) (- (* x z) x)) t_1))))

C

double code(double x, double y, double z) {
	double t_0 = x * (1.0 - ((1.0 - y) * z));
	double t_1 = x + ((1.0 - y) * (-z * x));
	double tmp;
	if (t_0 < -1.618195973607049e+50) {
		tmp = t_1;
	} else if (t_0 < 3.892237649663903e+134) {
		tmp = ((x * y) * z) - ((x * z) - x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = x * (1.0d0 - ((1.0d0 - y) * z))
    t_1 = x + ((1.0d0 - y) * (-z * x))
    if (t_0 < (-1.618195973607049d+50)) then
        tmp = t_1
    else if (t_0 < 3.892237649663903d+134) then
        tmp = ((x * y) * z) - ((x * z) - x)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x * (1.0 - ((1.0 - y) * z));
	double t_1 = x + ((1.0 - y) * (-z * x));
	double tmp;
	if (t_0 < -1.618195973607049e+50) {
		tmp = t_1;
	} else if (t_0 < 3.892237649663903e+134) {
		tmp = ((x * y) * z) - ((x * z) - x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * (1.0 - ((1.0 - y) * z))
	t_1 = x + ((1.0 - y) * (-z * x))
	tmp = 0
	if t_0 < -1.618195973607049e+50:
		tmp = t_1
	elif t_0 < 3.892237649663903e+134:
		tmp = ((x * y) * z) - ((x * z) - x)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(1.0 - Float64(Float64(1.0 - y) * z)))
	t_1 = Float64(x + Float64(Float64(1.0 - y) * Float64(Float64(-z) * x)))
	tmp = 0.0
	if (t_0 < -1.618195973607049e+50)
		tmp = t_1;
	elseif (t_0 < 3.892237649663903e+134)
		tmp = Float64(Float64(Float64(x * y) * z) - Float64(Float64(x * z) - x));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * (1.0 - ((1.0 - y) * z));
	t_1 = x + ((1.0 - y) * (-z * x));
	tmp = 0.0;
	if (t_0 < -1.618195973607049e+50)
		tmp = t_1;
	elseif (t_0 < 3.892237649663903e+134)
		tmp = ((x * y) * z) - ((x * z) - x);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * N[(1.0 - N[(N[(1.0 - y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(x + N[(N[(1.0 - y), $MachinePrecision] * N[((-z) * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$0, -1.618195973607049e+50], t$95$1, If[Less[t$95$0, 3.892237649663903e+134], N[(N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision] - N[(N[(x * z), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Reproduce

herbie shell --seed 2025015 
(FPCore (x y z)
  :name "Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, J"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (* x (- 1 (* (- 1 y) z))) -161819597360704900000000000000000000000000000000000) (+ x (* (- 1 y) (* (- z) x))) (if (< (* x (- 1 (* (- 1 y) z))) 389223764966390300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (* (* x y) z) (- (* x z) x)) (+ x (* (- 1 y) (* (- z) x))))))

  (* x (- 1.0 (* (- 1.0 y) z))))