Diagrams.TwoD.Segment:bezierClip from diagrams-lib-1.3.0.3

Percentage Accurate: 98.2% → 100.0%

Time: 6.5s

Alternatives: 7

Speedup: 1.7×

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

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * y) + (z * (1.0d0 - y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * y) + (z * (1.0d0 - y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 95.7%

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

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift--.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. +-commutative N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 N/A

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

   8. lift--.f64 N/A

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

   9. *-commutative N/A

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

   10. lower-*.f64 98.0

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

4. Applied rewrites 98.0%

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

   1. lift--.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. *-commutative N/A

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

   4. lower-fma.f64 N/A

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

   5. +-commutative N/A

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

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

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

   7. mul-1-neg N/A

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

   8. metadata-eval N/A

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

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

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

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

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

   11. metadata-eval N/A

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

   12. metadata-eval N/A

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

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

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

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

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

   15. +-commutative N/A

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

   16. distribute-lft1-in N/A

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

   17. associate-*r* N/A

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

   18. associate-+r+ N/A

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

   19. mul-1-neg N/A

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

   20. *-commutative N/A

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

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

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

6. Applied rewrites 100.0%

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

Alternative 2: 97.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -6e+23) (not (<= y 4.2e-15))) (* (- x z) y) (fma x y z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -6e+23) || !(y <= 4.2e-15)) {
		tmp = (x - z) * y;
	} else {
		tmp = fma(x, y, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -6e+23) || !(y <= 4.2e-15))
		tmp = Float64(Float64(x - z) * y);
	else
		tmp = fma(x, y, z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -6e+23], N[Not[LessEqual[y, 4.2e-15]], $MachinePrecision]], N[(N[(x - z), $MachinePrecision] * y), $MachinePrecision], N[(x * y + z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -6.0000000000000002e23 or 4.19999999999999962e-15 < y

   1. Initial program 92.3%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lift--.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 96.5

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

   4. Applied rewrites 96.5%

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

   5. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. metadata-eval N/A

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

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

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

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

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

      8. metadata-eval N/A

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

      9. metadata-eval N/A

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

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

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

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

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

      12. +-commutative N/A

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

      13. distribute-lft1-in N/A

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

      14. associate-*r* N/A

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

      15. mul-1-neg N/A

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

      16. *-commutative N/A

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

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

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

   7. Applied rewrites 100.0%

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

   if -6.0000000000000002e23 < y < 4.19999999999999962e-15

   1. Initial program 100.0%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lift--.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 100.0

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

   4. Applied rewrites 100.0%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

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

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

      7. mul-1-neg N/A

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

      8. metadata-eval N/A

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

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

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

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

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

      11. metadata-eval N/A

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

      12. metadata-eval N/A

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

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

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

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

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

      15. +-commutative N/A

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

      16. distribute-lft1-in N/A

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

      17. associate-*r* N/A

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

      18. associate-+r+ N/A

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

      19. mul-1-neg N/A

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

      20. *-commutative N/A

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

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

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

   6. Applied rewrites 100.0%

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

   7. Taylor expanded in x around inf

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

   9. Applied rewrites 100.0%

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

4. Final simplification 100.0%

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

Alternative 3: 86.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -8.5e+54) (not (<= z 2.15e+30))) (* (- 1.0 y) z) (fma x y z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -8.5e+54) || !(z <= 2.15e+30)) {
		tmp = (1.0 - y) * z;
	} else {
		tmp = fma(x, y, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -8.5e+54) || !(z <= 2.15e+30))
		tmp = Float64(Float64(1.0 - y) * z);
	else
		tmp = fma(x, y, z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -8.5e+54], N[Not[LessEqual[z, 2.15e+30]], $MachinePrecision]], N[(N[(1.0 - y), $MachinePrecision] * z), $MachinePrecision], N[(x * y + z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -8.4999999999999995e54 or 2.15e30 < z

   1. Initial program 90.6%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 89.9

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

   5. Applied rewrites 89.9%

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

   if -8.4999999999999995e54 < z < 2.15e30

   1. Initial program 99.3%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lift--.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 100.0

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

   4. Applied rewrites 100.0%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

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

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

      7. mul-1-neg N/A

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

      8. metadata-eval N/A

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

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

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

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

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

      11. metadata-eval N/A

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

      12. metadata-eval N/A

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

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

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

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

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

      15. +-commutative N/A

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

      16. distribute-lft1-in N/A

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

      17. associate-*r* N/A

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

      18. associate-+r+ N/A

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

      19. mul-1-neg N/A

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

      20. *-commutative N/A

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

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

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

   6. Applied rewrites 100.0%

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

   7. Taylor expanded in x around inf

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

   9. Applied rewrites 84.9%

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

4. Final simplification 87.0%

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

Alternative 4: 75.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 1.6e+16) (fma x y z) (if (<= y 1.55e+263) (* z (- y)) (* y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 1.6e+16) {
		tmp = fma(x, y, z);
	} else if (y <= 1.55e+263) {
		tmp = z * -y;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 1.6e+16)
		tmp = fma(x, y, z);
	elseif (y <= 1.55e+263)
		tmp = Float64(z * Float64(-y));
	else
		tmp = Float64(y * x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 1.6e+16], N[(x * y + z), $MachinePrecision], If[LessEqual[y, 1.55e+263], N[(z * (-y)), $MachinePrecision], N[(y * x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < 1.6e16

   1. Initial program 96.8%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lift--.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 98.9

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

   4. Applied rewrites 98.9%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

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

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

      7. mul-1-neg N/A

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

      8. metadata-eval N/A

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

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

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

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

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

      11. metadata-eval N/A

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

      12. metadata-eval N/A

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

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

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

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

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

      15. +-commutative N/A

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

      16. distribute-lft1-in N/A

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

      17. associate-*r* N/A

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

      18. associate-+r+ N/A

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

      19. mul-1-neg N/A

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

      20. *-commutative N/A

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

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

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

   6. Applied rewrites 100.0%

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

   7. Taylor expanded in x around inf

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

   9. Applied rewrites 82.3%

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

   if 1.6e16 < y < 1.5500000000000001e263

   1. Initial program 94.9%

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

   3. Taylor expanded in y around -inf

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 64.8%

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

   if 1.5500000000000001e263 < y

   1. Initial program 80.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 80.1

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

   5. Applied rewrites 80.1%

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

4. Final simplification 78.2%

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

Alternative 5: 61.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{-13} \lor \neg \left(y \leq 9.8 \cdot 10^{-20}\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -6e-13) (not (<= y 9.8e-20))) (* y x) z))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -6e-13) || !(y <= 9.8e-20)) {
		tmp = y * x;
	} else {
		tmp = z;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-6d-13)) .or. (.not. (y <= 9.8d-20))) then
        tmp = y * x
    else
        tmp = z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -6e-13) || !(y <= 9.8e-20)) {
		tmp = y * x;
	} else {
		tmp = z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -6e-13) or not (y <= 9.8e-20):
		tmp = y * x
	else:
		tmp = z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -6e-13) || !(y <= 9.8e-20))
		tmp = Float64(y * x);
	else
		tmp = z;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -6e-13) || ~((y <= 9.8e-20)))
		tmp = y * x;
	else
		tmp = z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -6e-13], N[Not[LessEqual[y, 9.8e-20]], $MachinePrecision]], N[(y * x), $MachinePrecision], z]

Derivation

1. Split input into 2 regimes

2. if y < -5.99999999999999968e-13 or 9.8000000000000003e-20 < y

   1. Initial program 92.5%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 52.2

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

   5. Applied rewrites 52.2%

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

   if -5.99999999999999968e-13 < y < 9.8000000000000003e-20

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 68.8%

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

4. Final simplification 59.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{-13} \lor \neg \left(y \leq 9.8 \cdot 10^{-20}\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;z\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 76.1% accurate, 2.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 95.7%

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

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift--.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. +-commutative N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 N/A

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

   8. lift--.f64 N/A

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

   9. *-commutative N/A

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

   10. lower-*.f64 98.0

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

4. Applied rewrites 98.0%

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

   1. lift--.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. *-commutative N/A

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

   4. lower-fma.f64 N/A

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

   5. +-commutative N/A

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

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

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

   7. mul-1-neg N/A

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

   8. metadata-eval N/A

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

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

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

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

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

   11. metadata-eval N/A

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

   12. metadata-eval N/A

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

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

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

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

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

   15. +-commutative N/A

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

   16. distribute-lft1-in N/A

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

   17. associate-*r* N/A

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

   18. associate-+r+ N/A

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

   19. mul-1-neg N/A

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

   20. *-commutative N/A

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

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

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

6. Applied rewrites 100.0%

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

7. Taylor expanded in x around inf

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

9. Applied rewrites 72.6%

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

Alternative 7: 35.5% accurate, 17.0× speedup

Math

\[\begin{array}{l} \\ z \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

function code(x, y, z)
	return z
end

MATLAB

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

Wolfram

code[x_, y_, z_] := z

Derivation

1. Initial program 95.7%

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

3. Taylor expanded in y around 0

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

5. Applied rewrites 30.7%

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

6. Final simplification 30.7%

   \[\leadsto z \]
7. Add Preprocessing

Developer Target 1: 100.0% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = z - ((z - x) * y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2025043 
(FPCore (x y z)
  :name "Diagrams.TwoD.Segment:bezierClip from diagrams-lib-1.3.0.3"
  :precision binary64

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

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