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

Percentage Accurate: 96.3% → 99.7%

Time: 7.1s

Alternatives: 10

Speedup: 0.8×

• 20.4% 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.3% 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: 99.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 2 \cdot 10^{-65}:\\ \;\;\;\;\mathsf{fma}\left(\left(y - 1\right) \cdot x\_m, z, x\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(-1 + y\right) \cdot z, x\_m, x\_m\right)\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (<= x_m 2e-65)
    (fma (* (- y 1.0) x_m) z x_m)
    (fma (* (+ -1.0 y) z) x_m x_m))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (x_m <= 2e-65) {
		tmp = fma(((y - 1.0) * x_m), z, x_m);
	} else {
		tmp = fma(((-1.0 + y) * z), x_m, x_m);
	}
	return x_s * tmp;
}

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (x_m <= 2e-65)
		tmp = fma(Float64(Float64(y - 1.0) * x_m), z, x_m);
	else
		tmp = fma(Float64(Float64(-1.0 + y) * z), x_m, x_m);
	end
	return Float64(x_s * tmp)
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[x$95$m, 2e-65], N[(N[(N[(y - 1.0), $MachinePrecision] * x$95$m), $MachinePrecision] * z + x$95$m), $MachinePrecision], N[(N[(N[(-1.0 + y), $MachinePrecision] * z), $MachinePrecision] * x$95$m + x$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.99999999999999985e-65

   1. Initial program 95.2%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 95.2%

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

   6. Taylor expanded in x around 0

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

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

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

      2. distribute-rgt-in N/A

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

      3. *-lft-identity N/A

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

      4. distribute-lft-neg-in N/A

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

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

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

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

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

      9. *-rgt-identity N/A

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

      10. associate-*r* N/A

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

      11. *-commutative N/A

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

      12. associate-+l- N/A

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

      13. *-lft-identity N/A

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

      14. metadata-eval N/A

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

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

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

      16. associate-+r+ N/A

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

      17. +-commutative N/A

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

   8. Applied rewrites 97.3%

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

   if 1.99999999999999985e-65 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 100.0%

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

Alternative 2: 96.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_0 := 1 - \left(1 - y\right) \cdot z\\ t_1 := x\_m \cdot \left(\left(-1 + y\right) \cdot z\right)\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -100000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 2:\\ \;\;\;\;x\_m \cdot \left(1 - z\right)\\ \mathbf{elif}\;t\_0 \leq 4 \cdot 10^{+297}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot x\_m\right) \cdot y\\ \end{array} \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (- 1.0 (* (- 1.0 y) z))) (t_1 (* x_m (* (+ -1.0 y) z))))
   (*
    x_s
    (if (<= t_0 -100000.0)
      t_1
      (if (<= t_0 2.0)
        (* x_m (- 1.0 z))
        (if (<= t_0 4e+297) t_1 (* (* z x_m) y)))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = 1.0 - ((1.0 - y) * z);
	double t_1 = x_m * ((-1.0 + y) * z);
	double tmp;
	if (t_0 <= -100000.0) {
		tmp = t_1;
	} else if (t_0 <= 2.0) {
		tmp = x_m * (1.0 - z);
	} else if (t_0 <= 4e+297) {
		tmp = t_1;
	} else {
		tmp = (z * x_m) * y;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = 1.0d0 - ((1.0d0 - y) * z)
    t_1 = x_m * (((-1.0d0) + y) * z)
    if (t_0 <= (-100000.0d0)) then
        tmp = t_1
    else if (t_0 <= 2.0d0) then
        tmp = x_m * (1.0d0 - z)
    else if (t_0 <= 4d+297) then
        tmp = t_1
    else
        tmp = (z * x_m) * y
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = 1.0 - ((1.0 - y) * z);
	double t_1 = x_m * ((-1.0 + y) * z);
	double tmp;
	if (t_0 <= -100000.0) {
		tmp = t_1;
	} else if (t_0 <= 2.0) {
		tmp = x_m * (1.0 - z);
	} else if (t_0 <= 4e+297) {
		tmp = t_1;
	} else {
		tmp = (z * x_m) * y;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = 1.0 - ((1.0 - y) * z)
	t_1 = x_m * ((-1.0 + y) * z)
	tmp = 0
	if t_0 <= -100000.0:
		tmp = t_1
	elif t_0 <= 2.0:
		tmp = x_m * (1.0 - z)
	elif t_0 <= 4e+297:
		tmp = t_1
	else:
		tmp = (z * x_m) * y
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(1.0 - Float64(Float64(1.0 - y) * z))
	t_1 = Float64(x_m * Float64(Float64(-1.0 + y) * z))
	tmp = 0.0
	if (t_0 <= -100000.0)
		tmp = t_1;
	elseif (t_0 <= 2.0)
		tmp = Float64(x_m * Float64(1.0 - z));
	elseif (t_0 <= 4e+297)
		tmp = t_1;
	else
		tmp = Float64(Float64(z * x_m) * y);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = 1.0 - ((1.0 - y) * z);
	t_1 = x_m * ((-1.0 + y) * z);
	tmp = 0.0;
	if (t_0 <= -100000.0)
		tmp = t_1;
	elseif (t_0 <= 2.0)
		tmp = x_m * (1.0 - z);
	elseif (t_0 <= 4e+297)
		tmp = t_1;
	else
		tmp = (z * x_m) * y;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := Block[{t$95$0 = N[(1.0 - N[(N[(1.0 - y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(x$95$m * N[(N[(-1.0 + y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * If[LessEqual[t$95$0, -100000.0], t$95$1, If[LessEqual[t$95$0, 2.0], N[(x$95$m * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 4e+297], t$95$1, N[(N[(z * x$95$m), $MachinePrecision] * y), $MachinePrecision]]]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 97.9%

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

   3. Taylor expanded in z around inf

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

      1. distribute-rgt-out-- N/A

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

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

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

      3. remove-double-neg N/A

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

      4. mul-1-neg N/A

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

      5. metadata-eval N/A

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

      6. mul-1-neg N/A

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

      7. distribute-neg-in N/A

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

      8. associate-*r* N/A

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

      9. distribute-lft1-in N/A

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

      10. +-commutative N/A

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

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

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

      12. metadata-eval N/A

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

      13. *-lft-identity N/A

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

      14. *-commutative N/A

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

      15. mul-1-neg N/A

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

      16. *-commutative N/A

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

      17. associate-*r* N/A

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

      18. lower-*.f64 N/A

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

   5. Applied rewrites 96.7%

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

   if -1e5 < (-.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. Taylor expanded in y around 0

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

      1. lower--.f64 98.9

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

   5. Applied rewrites 98.9%

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

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

   1. Initial program 73.5%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{x \cdot \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. 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. *-commutative N/A

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

      5. lower-*.f64 99.8

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

   5. Applied rewrites 99.8%

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

Alternative 3: 97.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;1 - \left(1 - y\right) \cdot z \leq 4 \cdot 10^{+297}:\\ \;\;\;\;\mathsf{fma}\left(\left(-1 + y\right) \cdot z, x\_m, x\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot x\_m\right) \cdot y\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (<= (- 1.0 (* (- 1.0 y) z)) 4e+297)
    (fma (* (+ -1.0 y) z) x_m x_m)
    (* (* z x_m) y))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((1.0 - ((1.0 - y) * z)) <= 4e+297) {
		tmp = fma(((-1.0 + y) * z), x_m, x_m);
	} else {
		tmp = (z * x_m) * y;
	}
	return x_s * tmp;
}

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (Float64(1.0 - Float64(Float64(1.0 - y) * z)) <= 4e+297)
		tmp = fma(Float64(Float64(-1.0 + y) * z), x_m, x_m);
	else
		tmp = Float64(Float64(z * x_m) * y);
	end
	return Float64(x_s * tmp)
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[N[(1.0 - N[(N[(1.0 - y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], 4e+297], N[(N[(N[(-1.0 + y), $MachinePrecision] * z), $MachinePrecision] * x$95$m + x$95$m), $MachinePrecision], N[(N[(z * x$95$m), $MachinePrecision] * y), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 98.7%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 98.7%

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

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

   1. Initial program 73.5%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{x \cdot \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. 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. *-commutative N/A

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

      5. lower-*.f64 99.8

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

   5. Applied rewrites 99.8%

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

Alternative 4: 85.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;1 - y \leq -2 \cdot 10^{+41} \lor \neg \left(1 - y \leq 5 \cdot 10^{+58}\right):\\ \;\;\;\;\left(y \cdot x\_m\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot \left(1 - z\right)\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (or (<= (- 1.0 y) -2e+41) (not (<= (- 1.0 y) 5e+58)))
    (* (* y x_m) z)
    (* x_m (- 1.0 z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (((1.0 - y) <= -2e+41) || !((1.0 - y) <= 5e+58)) {
		tmp = (y * x_m) * z;
	} else {
		tmp = x_m * (1.0 - z);
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (((1.0d0 - y) <= (-2d+41)) .or. (.not. ((1.0d0 - y) <= 5d+58))) then
        tmp = (y * x_m) * z
    else
        tmp = x_m * (1.0d0 - z)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (((1.0 - y) <= -2e+41) || !((1.0 - y) <= 5e+58)) {
		tmp = (y * x_m) * z;
	} else {
		tmp = x_m * (1.0 - z);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if ((1.0 - y) <= -2e+41) or not ((1.0 - y) <= 5e+58):
		tmp = (y * x_m) * z
	else:
		tmp = x_m * (1.0 - z)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if ((Float64(1.0 - y) <= -2e+41) || !(Float64(1.0 - y) <= 5e+58))
		tmp = Float64(Float64(y * x_m) * z);
	else
		tmp = Float64(x_m * Float64(1.0 - z));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (((1.0 - y) <= -2e+41) || ~(((1.0 - y) <= 5e+58)))
		tmp = (y * x_m) * z;
	else
		tmp = x_m * (1.0 - z);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[Or[LessEqual[N[(1.0 - y), $MachinePrecision], -2e+41], N[Not[LessEqual[N[(1.0 - y), $MachinePrecision], 5e+58]], $MachinePrecision]], N[(N[(y * x$95$m), $MachinePrecision] * z), $MachinePrecision], N[(x$95$m * N[(1.0 - z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 92.5%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{x \cdot \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. 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. *-commutative N/A

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

      5. lower-*.f64 78.5

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

   5. Applied rewrites 78.5%

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

   7. Applied rewrites 78.6%

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

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

   1. Initial program 100.0%

      \[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(1 - z\right)} \]
   4. Step-by-step derivation

      1. lower--.f64 96.0

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

   5. Applied rewrites 96.0%

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

4. Final simplification 88.2%

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

Alternative 5: 85.4% accurate, 0.6× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (<= (- 1.0 y) -1e+61)
    (* (* z x_m) y)
    (if (<= (- 1.0 y) 5e+58) (* x_m (- 1.0 z)) (* (* y x_m) z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((1.0 - y) <= -1e+61) {
		tmp = (z * x_m) * y;
	} else if ((1.0 - y) <= 5e+58) {
		tmp = x_m * (1.0 - z);
	} else {
		tmp = (y * x_m) * z;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((1.0d0 - y) <= (-1d+61)) then
        tmp = (z * x_m) * y
    else if ((1.0d0 - y) <= 5d+58) then
        tmp = x_m * (1.0d0 - z)
    else
        tmp = (y * x_m) * z
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((1.0 - y) <= -1e+61) {
		tmp = (z * x_m) * y;
	} else if ((1.0 - y) <= 5e+58) {
		tmp = x_m * (1.0 - z);
	} else {
		tmp = (y * x_m) * z;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if (1.0 - y) <= -1e+61:
		tmp = (z * x_m) * y
	elif (1.0 - y) <= 5e+58:
		tmp = x_m * (1.0 - z)
	else:
		tmp = (y * x_m) * z
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (Float64(1.0 - y) <= -1e+61)
		tmp = Float64(Float64(z * x_m) * y);
	elseif (Float64(1.0 - y) <= 5e+58)
		tmp = Float64(x_m * Float64(1.0 - z));
	else
		tmp = Float64(Float64(y * x_m) * z);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if ((1.0 - y) <= -1e+61)
		tmp = (z * x_m) * y;
	elseif ((1.0 - y) <= 5e+58)
		tmp = x_m * (1.0 - z);
	else
		tmp = (y * x_m) * z;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[N[(1.0 - y), $MachinePrecision], -1e+61], N[(N[(z * x$95$m), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[N[(1.0 - y), $MachinePrecision], 5e+58], N[(x$95$m * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], N[(N[(y * x$95$m), $MachinePrecision] * z), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -9.99999999999999949e60

   1. Initial program 94.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{x \cdot \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. 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. *-commutative N/A

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

      5. lower-*.f64 85.2

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

   5. Applied rewrites 85.2%

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

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

   1. Initial program 100.0%

      \[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(1 - z\right)} \]
   4. Step-by-step derivation

      1. lower--.f64 94.1

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

   5. Applied rewrites 94.1%

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

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

   1. Initial program 89.6%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{x \cdot \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. 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. *-commutative N/A

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

      5. lower-*.f64 72.9

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

   5. Applied rewrites 72.9%

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

   7. Applied rewrites 75.2%

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

Alternative 6: 95.5% accurate, 0.7× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (or (<= y -1.0) (not (<= y 1.0)))
    (fma (* z y) x_m x_m)
    (* x_m (- 1.0 z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = fma((z * y), x_m, x_m);
	} else {
		tmp = x_m * (1.0 - z);
	}
	return x_s * tmp;
}

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 1.0))
		tmp = fma(Float64(z * y), x_m, x_m);
	else
		tmp = Float64(x_m * Float64(1.0 - z));
	end
	return Float64(x_s * tmp)
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 1.0]], $MachinePrecision]], N[(N[(z * y), $MachinePrecision] * x$95$m + x$95$m), $MachinePrecision], N[(x$95$m * N[(1.0 - z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 93.4%

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

   4. Applied rewrites 65.1%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. distribute-lft-out N/A

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

      3. associate-+r+ N/A

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

      4. +-commutative N/A

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

      5. distribute-rgt1-in N/A

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

      6. *-commutative N/A

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

      7. distribute-rgt-out N/A

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

      8. metadata-eval N/A

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

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

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

      10. distribute-rgt-in N/A

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

      11. *-lft-identity N/A

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

      12. lower-fma.f64 N/A

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

   7. Applied rewrites 92.2%

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

   8. Taylor expanded in y around inf

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

   10. Applied rewrites 92.3%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[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(1 - z\right)} \]
   4. Step-by-step derivation

      1. lower--.f64 99.8

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

   5. Applied rewrites 99.8%

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

4. Final simplification 96.0%

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

Alternative 7: 65.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq -1 \lor \neg \left(z \leq 1\right):\\ \;\;\;\;x\_m \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot 1\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (or (<= z -1.0) (not (<= z 1.0))) (* x_m (- z)) (* x_m 1.0))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 1.0)) {
		tmp = x_m * -z;
	} else {
		tmp = x_m * 1.0;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    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_m * -z
    else
        tmp = x_m * 1.0d0
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((z <= -1.0) || !(z <= 1.0)) {
		tmp = x_m * -z;
	} else {
		tmp = x_m * 1.0;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if (z <= -1.0) or not (z <= 1.0):
		tmp = x_m * -z
	else:
		tmp = x_m * 1.0
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if ((z <= -1.0) || !(z <= 1.0))
		tmp = Float64(x_m * Float64(-z));
	else
		tmp = Float64(x_m * 1.0);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if ((z <= -1.0) || ~((z <= 1.0)))
		tmp = x_m * -z;
	else
		tmp = x_m * 1.0;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[Or[LessEqual[z, -1.0], N[Not[LessEqual[z, 1.0]], $MachinePrecision]], N[(x$95$m * (-z)), $MachinePrecision], N[(x$95$m * 1.0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1 < z

   1. Initial program 93.2%

      \[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(1 - z\right)} \]
   4. Step-by-step derivation

      1. lower--.f64 54.0

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

   5. Applied rewrites 54.0%

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

   6. Taylor expanded in z around -inf

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

      1. distribute-rgt-out-- N/A

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

      2. *-lft-identity N/A

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

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

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

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

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. +-commutative N/A

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

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

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

      9. metadata-eval N/A

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

      10. distribute-rgt-out-- N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. lower--.f64 91.7

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

   8. Applied rewrites 91.7%

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

   9. Taylor expanded in y around 0

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

   11. Applied rewrites 52.8%

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

   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(1 - z\right)} \]
   4. Step-by-step derivation

      1. lower--.f64 69.0

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

   5. Applied rewrites 69.0%

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

   6. Taylor expanded in z around -inf

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

      1. distribute-rgt-out-- N/A

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

      2. *-lft-identity N/A

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

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

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

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

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. +-commutative N/A

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

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

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

      9. metadata-eval N/A

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

      10. distribute-rgt-out-- N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. lower--.f64 34.4

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

   8. Applied rewrites 34.4%

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

   9. Taylor expanded in z around 0

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

   11. Applied rewrites 67.9%

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

4. Final simplification 60.5%

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

Alternative 8: 70.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;1 - y \leq -1 \cdot 10^{-307}:\\ \;\;\;\;\mathsf{fma}\left(z, x\_m, x\_m\right)\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot \left(1 - z\right)\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= (- 1.0 y) -1e-307) (fma z x_m x_m) (* x_m (- 1.0 z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((1.0 - y) <= -1e-307) {
		tmp = fma(z, x_m, x_m);
	} else {
		tmp = x_m * (1.0 - z);
	}
	return x_s * tmp;
}

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (Float64(1.0 - y) <= -1e-307)
		tmp = fma(z, x_m, x_m);
	else
		tmp = Float64(x_m * Float64(1.0 - z));
	end
	return Float64(x_s * tmp)
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[N[(1.0 - y), $MachinePrecision], -1e-307], N[(z * x$95$m + x$95$m), $MachinePrecision], N[(x$95$m * N[(1.0 - z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -9.99999999999999909e-308

   1. Initial program 94.7%

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

   4. Applied rewrites 71.5%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. distribute-rgt-in N/A

         \[\leadsto \color{blue}{z \cdot x + 1 \cdot x} \]

      3. *-lft-identity N/A

         \[\leadsto z \cdot x + \color{blue}{x} \]

      4. lower-fma.f64 30.4

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

   7. Applied rewrites 30.4%

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

   if -9.99999999999999909e-308 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 97.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(1 - z\right)} \]
   4. Step-by-step derivation

      1. lower--.f64 79.0

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

   5. Applied rewrites 79.0%

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

Alternative 9: 41.6% accurate, 2.4× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \mathsf{fma}\left(z, x\_m, x\_m\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z) :precision binary64 (* x_s (fma z x_m x_m)))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	return x_s * fma(z, x_m, x_m);
}

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	return Float64(x_s * fma(z, x_m, x_m))
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * N[(z * x$95$m + x$95$m), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 96.6%

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

4. Applied rewrites 57.3%

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

5. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. distribute-rgt-in N/A

      \[\leadsto \color{blue}{z \cdot x + 1 \cdot x} \]

   3. *-lft-identity N/A

      \[\leadsto z \cdot x + \color{blue}{x} \]

   4. lower-fma.f64 38.9

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

7. Applied rewrites 38.9%

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

Alternative 10: 39.5% accurate, 2.8× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \left(x\_m \cdot 1\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z) :precision binary64 (* x_s (* x_m 1.0)))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	return x_s * (x_m * 1.0);
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x_s * (x_m * 1.0d0)
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	return x_s * (x_m * 1.0);
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	return x_s * (x_m * 1.0)

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	return Float64(x_s * Float64(x_m * 1.0))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * (x_m * 1.0);
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * N[(x$95$m * 1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 96.6%

   \[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(1 - z\right)} \]
4. Step-by-step derivation

   1. lower--.f64 61.7

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

5. Applied rewrites 61.7%

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

6. Taylor expanded in z around -inf

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

   1. distribute-rgt-out-- N/A

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

   2. *-lft-identity N/A

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

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

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

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

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

   5. metadata-eval N/A

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

   6. *-lft-identity N/A

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

   7. +-commutative N/A

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

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

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

   9. metadata-eval N/A

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

   10. distribute-rgt-out-- N/A

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

   11. *-commutative N/A

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

   12. lower-*.f64 N/A

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

   13. lower--.f64 62.4

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

8. Applied rewrites 62.4%

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

9. Taylor expanded in z around 0

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

11. Applied rewrites 36.2%

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

Developer Target 1: 99.7% 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 2024364 
(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))))