Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendOutside from plot-0.2.3.4, B

Percentage Accurate: 99.9% → 99.9%

Time: 3.9s

Alternatives: 15

Speedup: 1.1×

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

Specification

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (+ (* x (+ (+ (+ (+ y z) z) y) t)) (* y 5.0)))

C

double code(double x, double y, double z, double t) {
	return (x * ((((y + z) + z) + y) + t)) + (y * 5.0);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

def code(x, y, z, t):
	return (x * ((((y + z) + z) + y) + t)) + (y * 5.0)

Julia

function code(x, y, z, t)
	return Float64(Float64(x * Float64(Float64(Float64(Float64(y + z) + z) + y) + t)) + Float64(y * 5.0))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (x * ((((y + z) + z) + y) + t)) + (y * 5.0);
end

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (+ (* x (+ (+ (+ (+ y z) z) y) t)) (* y 5.0)))

C

double code(double x, double y, double z, double t) {
	return (x * ((((y + z) + z) + y) + t)) + (y * 5.0);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

def code(x, y, z, t):
	return (x * ((((y + z) + z) + y) + t)) + (y * 5.0)

Julia

function code(x, y, z, t)
	return Float64(Float64(x * Float64(Float64(Float64(Float64(y + z) + z) + y) + t)) + Float64(y * 5.0))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = (x * ((((y + z) + z) + y) + t)) + (y * 5.0);
end

Wolfram

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

Alternative 1: 99.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y, 5, \left(\left(\mathsf{fma}\left(2, z, y\right) + y\right) + t\right) \cdot x\right) \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (fma y 5.0 (* (+ (+ (fma 2.0 z y) y) t) x)))

C

double code(double x, double y, double z, double t) {
	return fma(y, 5.0, (((fma(2.0, z, y) + y) + t) * x));
}

Julia

function code(x, y, z, t)
	return fma(y, 5.0, Float64(Float64(Float64(fma(2.0, z, y) + y) + t) * x))
end

Wolfram

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

Derivation

1. Initial program 99.9%

   \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]
2. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-+.f64 N/A

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

   4. lift-+.f64 N/A

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

   5. lift-+.f64 N/A

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

   6. lift-+.f64 N/A

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

   7. lift-*.f64 N/A

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

   8. *-commutative N/A

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

   9. +-commutative N/A

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

   10. *-commutative N/A

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

   11. lower-fma.f64 N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 N/A

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

3. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, 5, \left(\left(\mathsf{fma}\left(2, z, y\right) + y\right) + t\right) \cdot x\right)} \]
4. Add Preprocessing

Alternative 2: 99.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-x\right) \cdot \mathsf{fma}\left(-2, z + y, -t\right)\\ \mathbf{if}\;x \leq -1000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 2.4:\\ \;\;\;\;\mathsf{fma}\left(y, 5, \mathsf{fma}\left(z + z, x, x \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- x) (fma -2.0 (+ z y) (- t)))))
   (if (<= x -1000.0)
     t_1
     (if (<= x 2.4) (fma y 5.0 (fma (+ z z) x (* x t))) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = -x * fma(-2.0, (z + y), -t);
	double tmp;
	if (x <= -1000.0) {
		tmp = t_1;
	} else if (x <= 2.4) {
		tmp = fma(y, 5.0, fma((z + z), x, (x * t)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(-x) * fma(-2.0, Float64(z + y), Float64(-t)))
	tmp = 0.0
	if (x <= -1000.0)
		tmp = t_1;
	elseif (x <= 2.4)
		tmp = fma(y, 5.0, fma(Float64(z + z), x, Float64(x * t)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1e3 or 2.39999999999999991 < x

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

   3. Applied rewrites 99.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-fma.f64 N/A

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

      5. associate-+l+ N/A

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

      6. count-2-rev N/A

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

      7. +-commutative N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. distribute-lft-in N/A

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

      11. *-commutative N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. distribute-lft-out N/A

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

      16. lower-*.f64 N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 N/A

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

      19. *-commutative N/A

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

      20. lower-*.f64 97.9

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

   5. Applied rewrites 97.9%

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

   6. Taylor expanded in x around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

         \[\leadsto \left(-x\right) \cdot \left(-2 \cdot \left(y + z\right) + \left(\mathsf{neg}\left(t\right)\right)\right) \]

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lift-+.f64 N/A

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

      9. lower-neg.f64 72.2

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

   8. Applied rewrites 72.2%

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

   if -1e3 < x < 2.39999999999999991

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

   3. Applied rewrites 99.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-fma.f64 N/A

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

      5. associate-+l+ N/A

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

      6. count-2-rev N/A

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

      7. +-commutative N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. distribute-lft-in N/A

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

      11. *-commutative N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. distribute-lft-out N/A

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

      16. lower-*.f64 N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 N/A

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

      19. *-commutative N/A

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

      20. lower-*.f64 97.9

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

   5. Applied rewrites 97.9%

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

   6. Taylor expanded in y around 0

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

      1. count-2-rev N/A

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

      2. lower-+.f64 83.3

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

   8. Applied rewrites 83.3%

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

Alternative 3: 99.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-x\right) \cdot \mathsf{fma}\left(-2, z + y, -t\right)\\ \mathbf{if}\;x \leq -1000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 2.5:\\ \;\;\;\;\mathsf{fma}\left(y, 5, \mathsf{fma}\left(z, 2, t\right) \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- x) (fma -2.0 (+ z y) (- t)))))
   (if (<= x -1000.0)
     t_1
     (if (<= x 2.5) (fma y 5.0 (* (fma z 2.0 t) x)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = -x * fma(-2.0, (z + y), -t);
	double tmp;
	if (x <= -1000.0) {
		tmp = t_1;
	} else if (x <= 2.5) {
		tmp = fma(y, 5.0, (fma(z, 2.0, t) * x));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(-x) * fma(-2.0, Float64(z + y), Float64(-t)))
	tmp = 0.0
	if (x <= -1000.0)
		tmp = t_1;
	elseif (x <= 2.5)
		tmp = fma(y, 5.0, Float64(fma(z, 2.0, t) * x));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1e3 or 2.5 < x

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

   3. Applied rewrites 99.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-fma.f64 N/A

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

      5. associate-+l+ N/A

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

      6. count-2-rev N/A

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

      7. +-commutative N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. distribute-lft-in N/A

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

      11. *-commutative N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. distribute-lft-out N/A

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

      16. lower-*.f64 N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 N/A

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

      19. *-commutative N/A

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

      20. lower-*.f64 97.9

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

   5. Applied rewrites 97.9%

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

   6. Taylor expanded in x around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

         \[\leadsto \left(-x\right) \cdot \left(-2 \cdot \left(y + z\right) + \left(\mathsf{neg}\left(t\right)\right)\right) \]

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lift-+.f64 N/A

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

      9. lower-neg.f64 72.2

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

   8. Applied rewrites 72.2%

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

   if -1e3 < x < 2.5

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 84.4

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

   6. Applied rewrites 84.4%

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

Alternative 4: 98.2% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (fma (fma 2.0 x 5.0) y (* (fma 2.0 z t) x)))

C

double code(double x, double y, double z, double t) {
	return fma(fma(2.0, x, 5.0), y, (fma(2.0, z, t) * x));
}

Julia

function code(x, y, z, t)
	return fma(fma(2.0, x, 5.0), y, Float64(fma(2.0, z, t) * x))
end

Wolfram

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

Derivation

1. Initial program 99.9%

   \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

2. Taylor expanded in y around 0

   \[\leadsto \color{blue}{x \cdot \left(t + 2 \cdot z\right) + y \cdot \left(5 + 2 \cdot x\right)} \]
3. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. +-commutative N/A

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

   5. lower-fma.f64 N/A

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

   6. *-commutative N/A

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

   7. lower-*.f64 N/A

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

   8. +-commutative N/A

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

   9. lower-fma.f64 98.2

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

4. Applied rewrites 98.2%

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

Alternative 5: 88.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-x\right) \cdot \mathsf{fma}\left(-2, z + y, -t\right)\\ \mathbf{if}\;z \leq -3 \cdot 10^{+99}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 6.6 \cdot 10^{-32}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(2, y, t\right), x, 5 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- x) (fma -2.0 (+ z y) (- t)))))
   (if (<= z -3e+99)
     t_1
     (if (<= z 6.6e-32) (fma (fma 2.0 y t) x (* 5.0 y)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = -x * fma(-2.0, (z + y), -t);
	double tmp;
	if (z <= -3e+99) {
		tmp = t_1;
	} else if (z <= 6.6e-32) {
		tmp = fma(fma(2.0, y, t), x, (5.0 * y));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(-x) * fma(-2.0, Float64(z + y), Float64(-t)))
	tmp = 0.0
	if (z <= -3e+99)
		tmp = t_1;
	elseif (z <= 6.6e-32)
		tmp = fma(fma(2.0, y, t), x, Float64(5.0 * y));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[((-x) * N[(-2.0 * N[(z + y), $MachinePrecision] + (-t)), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3e+99], t$95$1, If[LessEqual[z, 6.6e-32], N[(N[(2.0 * y + t), $MachinePrecision] * x + N[(5.0 * y), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.00000000000000014e99 or 6.60000000000000051e-32 < z

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

   3. Applied rewrites 99.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-fma.f64 N/A

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

      5. associate-+l+ N/A

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

      6. count-2-rev N/A

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

      7. +-commutative N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. distribute-lft-in N/A

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

      11. *-commutative N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. distribute-lft-out N/A

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

      16. lower-*.f64 N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 N/A

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

      19. *-commutative N/A

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

      20. lower-*.f64 97.9

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

   5. Applied rewrites 97.9%

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

   6. Taylor expanded in x around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

         \[\leadsto \left(-x\right) \cdot \left(-2 \cdot \left(y + z\right) + \left(\mathsf{neg}\left(t\right)\right)\right) \]

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lift-+.f64 N/A

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

      9. lower-neg.f64 72.2

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

   8. Applied rewrites 72.2%

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

   if -3.00000000000000014e99 < z < 6.60000000000000051e-32

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto x \cdot \left(t + 2 \cdot y\right) + \color{blue}{5 \cdot y} \]

      2. *-commutative N/A

         \[\leadsto \left(t + 2 \cdot y\right) \cdot x + \color{blue}{5} \cdot y \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t + 2 \cdot y, \color{blue}{x}, 5 \cdot y\right) \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot y + t, x, 5 \cdot y\right) \]

      5. lower-fma.f64 N/A

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

      6. lower-*.f64 74.2

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

   4. Applied rewrites 74.2%

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

Alternative 6: 85.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-x\right) \cdot \mathsf{fma}\left(-2, z + y, -t\right)\\ \mathbf{if}\;x \leq -8.8 \cdot 10^{-5}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 1.35 \cdot 10^{-123}:\\ \;\;\;\;\mathsf{fma}\left(t, x, 5 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- x) (fma -2.0 (+ z y) (- t)))))
   (if (<= x -8.8e-5) t_1 (if (<= x 1.35e-123) (fma t x (* 5.0 y)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = -x * fma(-2.0, (z + y), -t);
	double tmp;
	if (x <= -8.8e-5) {
		tmp = t_1;
	} else if (x <= 1.35e-123) {
		tmp = fma(t, x, (5.0 * y));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(-x) * fma(-2.0, Float64(z + y), Float64(-t)))
	tmp = 0.0
	if (x <= -8.8e-5)
		tmp = t_1;
	elseif (x <= 1.35e-123)
		tmp = fma(t, x, Float64(5.0 * y));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[((-x) * N[(-2.0 * N[(z + y), $MachinePrecision] + (-t)), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.8e-5], t$95$1, If[LessEqual[x, 1.35e-123], N[(t * x + N[(5.0 * y), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -8.7999999999999998e-5 or 1.35e-123 < x

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

   3. Applied rewrites 99.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-fma.f64 N/A

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

      5. associate-+l+ N/A

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

      6. count-2-rev N/A

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

      7. +-commutative N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. distribute-lft-in N/A

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

      11. *-commutative N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. distribute-lft-out N/A

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

      16. lower-*.f64 N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 N/A

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

      19. *-commutative N/A

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

      20. lower-*.f64 97.9

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

   5. Applied rewrites 97.9%

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

   6. Taylor expanded in x around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

         \[\leadsto \left(-x\right) \cdot \left(-2 \cdot \left(y + z\right) + \left(\mathsf{neg}\left(t\right)\right)\right) \]

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lift-+.f64 N/A

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

      9. lower-neg.f64 72.2

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

   8. Applied rewrites 72.2%

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

   if -8.7999999999999998e-5 < x < 1.35e-123

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto x \cdot \left(t + 2 \cdot y\right) + \color{blue}{5 \cdot y} \]

      2. *-commutative N/A

         \[\leadsto \left(t + 2 \cdot y\right) \cdot x + \color{blue}{5} \cdot y \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t + 2 \cdot y, \color{blue}{x}, 5 \cdot y\right) \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot y + t, x, 5 \cdot y\right) \]

      5. lower-fma.f64 N/A

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

      6. lower-*.f64 74.2

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

   4. Applied rewrites 74.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(2, y, t\right), x, 5 \cdot y\right)} \]

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 57.9%

      \[\leadsto \mathsf{fma}\left(t, x, 5 \cdot y\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 77.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(y, 5, \left(y + y\right) \cdot x\right)\\ \mathbf{if}\;y \leq -5 \cdot 10^{-13}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 1.08 \cdot 10^{+98}:\\ \;\;\;\;\mathsf{fma}\left(x + x, z, t \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (fma y 5.0 (* (+ y y) x))))
   (if (<= y -5e-13) t_1 (if (<= y 1.08e+98) (fma (+ x x) z (* t x)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(y, 5.0, ((y + y) * x));
	double tmp;
	if (y <= -5e-13) {
		tmp = t_1;
	} else if (y <= 1.08e+98) {
		tmp = fma((x + x), z, (t * x));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = fma(y, 5.0, Float64(Float64(y + y) * x))
	tmp = 0.0
	if (y <= -5e-13)
		tmp = t_1;
	elseif (y <= 1.08e+98)
		tmp = fma(Float64(x + x), z, Float64(t * x));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(y * 5.0 + N[(N[(y + y), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -5e-13], t$95$1, If[LessEqual[y, 1.08e+98], N[(N[(x + x), $MachinePrecision] * z + N[(t * x), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.9999999999999999e-13 or 1.07999999999999997e98 < y

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in y around inf

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

      1. count-2-rev N/A

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

      2. lower-+.f64 47.6

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

   6. Applied rewrites 47.6%

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

   if -4.9999999999999999e-13 < y < 1.07999999999999997e98

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

   3. Applied rewrites 99.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-fma.f64 N/A

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

      5. associate-+l+ N/A

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

      6. count-2-rev N/A

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

      7. +-commutative N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. distribute-lft-in N/A

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

      11. *-commutative N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. distribute-lft-out N/A

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

      16. lower-*.f64 N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 N/A

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

      19. *-commutative N/A

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

      20. lower-*.f64 97.9

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

   5. Applied rewrites 97.9%

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

   6. Taylor expanded in y around 0

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

      1. associate-*r* N/A

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

      2. lower-fma.f64 N/A

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

      3. count-2-rev N/A

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

      4. lift-+.f64 N/A

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

      5. lift-*.f64 56.1

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

   8. Applied rewrites 56.1%

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

Alternative 8: 77.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(2, x, 5\right) \cdot y\\ \mathbf{if}\;y \leq -5 \cdot 10^{-13}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 1.08 \cdot 10^{+98}:\\ \;\;\;\;\mathsf{fma}\left(x + x, z, t \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (fma 2.0 x 5.0) y)))
   (if (<= y -5e-13) t_1 (if (<= y 1.08e+98) (fma (+ x x) z (* t x)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(2.0, x, 5.0) * y;
	double tmp;
	if (y <= -5e-13) {
		tmp = t_1;
	} else if (y <= 1.08e+98) {
		tmp = fma((x + x), z, (t * x));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(fma(2.0, x, 5.0) * y)
	tmp = 0.0
	if (y <= -5e-13)
		tmp = t_1;
	elseif (y <= 1.08e+98)
		tmp = fma(Float64(x + x), z, Float64(t * x));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(2.0 * x + 5.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -5e-13], t$95$1, If[LessEqual[y, 1.08e+98], N[(N[(x + x), $MachinePrecision] * z + N[(t * x), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.9999999999999999e-13 or 1.07999999999999997e98 < y

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(2 \cdot x + 5\right) \cdot y \]

      4. lower-fma.f64 47.6

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

   4. Applied rewrites 47.6%

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

   if -4.9999999999999999e-13 < y < 1.07999999999999997e98

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

   3. Applied rewrites 99.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-fma.f64 N/A

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

      5. associate-+l+ N/A

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

      6. count-2-rev N/A

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

      7. +-commutative N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. distribute-lft-in N/A

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

      11. *-commutative N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. distribute-lft-out N/A

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

      16. lower-*.f64 N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 N/A

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

      19. *-commutative N/A

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

      20. lower-*.f64 97.9

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

   5. Applied rewrites 97.9%

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

   6. Taylor expanded in y around 0

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

      1. associate-*r* N/A

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

      2. lower-fma.f64 N/A

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

      3. count-2-rev N/A

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

      4. lift-+.f64 N/A

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

      5. lift-*.f64 56.1

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

   8. Applied rewrites 56.1%

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

Alternative 9: 77.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(2, x, 5\right) \cdot y\\ \mathbf{if}\;y \leq -5 \cdot 10^{-13}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 1.08 \cdot 10^{+98}:\\ \;\;\;\;\mathsf{fma}\left(2, z, t\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (fma 2.0 x 5.0) y)))
   (if (<= y -5e-13) t_1 (if (<= y 1.08e+98) (* (fma 2.0 z t) x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(2.0, x, 5.0) * y;
	double tmp;
	if (y <= -5e-13) {
		tmp = t_1;
	} else if (y <= 1.08e+98) {
		tmp = fma(2.0, z, t) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(fma(2.0, x, 5.0) * y)
	tmp = 0.0
	if (y <= -5e-13)
		tmp = t_1;
	elseif (y <= 1.08e+98)
		tmp = Float64(fma(2.0, z, t) * x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(2.0 * x + 5.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -5e-13], t$95$1, If[LessEqual[y, 1.08e+98], N[(N[(2.0 * z + t), $MachinePrecision] * x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.9999999999999999e-13 or 1.07999999999999997e98 < y

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(2 \cdot x + 5\right) \cdot y \]

      4. lower-fma.f64 47.6

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

   4. Applied rewrites 47.6%

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

   if -4.9999999999999999e-13 < y < 1.07999999999999997e98

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(2 \cdot z + t\right) \cdot x \]

      4. lower-fma.f64 57.2

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

   4. Applied rewrites 57.2%

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

Alternative 10: 62.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x + x\right) \cdot z\\ \mathbf{if}\;z \leq -2.7 \cdot 10^{+98}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.25 \cdot 10^{+142}:\\ \;\;\;\;\mathsf{fma}\left(2, x, 5\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ x x) z)))
   (if (<= z -2.7e+98) t_1 (if (<= z 1.25e+142) (* (fma 2.0 x 5.0) y) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x + x) * z;
	double tmp;
	if (z <= -2.7e+98) {
		tmp = t_1;
	} else if (z <= 1.25e+142) {
		tmp = fma(2.0, x, 5.0) * y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x + x) * z)
	tmp = 0.0
	if (z <= -2.7e+98)
		tmp = t_1;
	elseif (z <= 1.25e+142)
		tmp = Float64(fma(2.0, x, 5.0) * y);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x + x), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[z, -2.7e+98], t$95$1, If[LessEqual[z, 1.25e+142], N[(N[(2.0 * x + 5.0), $MachinePrecision] * y), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.7e98 or 1.25e142 < z

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 30.2

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

   4. Applied rewrites 30.2%

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

   if -2.7e98 < z < 1.25e142

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(2 \cdot x + 5\right) \cdot y \]

      4. lower-fma.f64 47.6

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

   4. Applied rewrites 47.6%

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

Alternative 11: 58.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(2, y, t\right) \cdot x\\ \mathbf{if}\;x \leq -4.1 \cdot 10^{-13}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 2.05 \cdot 10^{-98}:\\ \;\;\;\;5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (fma 2.0 y t) x)))
   (if (<= x -4.1e-13) t_1 (if (<= x 2.05e-98) (* 5.0 y) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(2.0, y, t) * x;
	double tmp;
	if (x <= -4.1e-13) {
		tmp = t_1;
	} else if (x <= 2.05e-98) {
		tmp = 5.0 * y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(fma(2.0, y, t) * x)
	tmp = 0.0
	if (x <= -4.1e-13)
		tmp = t_1;
	elseif (x <= 2.05e-98)
		tmp = Float64(5.0 * y);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(2.0 * y + t), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, -4.1e-13], t$95$1, If[LessEqual[x, 2.05e-98], N[(5.0 * y), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -4.1000000000000002e-13 or 2.0499999999999999e-98 < x

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto x \cdot \left(t + 2 \cdot y\right) + \color{blue}{5 \cdot y} \]

      2. *-commutative N/A

         \[\leadsto \left(t + 2 \cdot y\right) \cdot x + \color{blue}{5} \cdot y \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t + 2 \cdot y, \color{blue}{x}, 5 \cdot y\right) \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(2 \cdot y + t, x, 5 \cdot y\right) \]

      5. lower-fma.f64 N/A

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

      6. lower-*.f64 74.2

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

   4. Applied rewrites 74.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(2, y, t\right), x, 5 \cdot y\right)} \]

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \left(t + 2 \cdot y\right) \cdot x \]

      2. lower-*.f64 N/A

         \[\leadsto \left(t + 2 \cdot y\right) \cdot x \]

      3. +-commutative N/A

         \[\leadsto \left(2 \cdot y + t\right) \cdot x \]

      4. lift-fma.f64 47.0

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

   7. Applied rewrites 47.0%

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

   if -4.1000000000000002e-13 < x < 2.0499999999999999e-98

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 29.3

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

   4. Applied rewrites 29.3%

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

Alternative 12: 46.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x + x\right) \cdot y\\ \mathbf{if}\;x \leq -2.8 \cdot 10^{+248}:\\ \;\;\;\;t \cdot x\\ \mathbf{elif}\;x \leq -5.5 \cdot 10^{+43}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq -4.1 \cdot 10^{-13}:\\ \;\;\;\;t \cdot x\\ \mathbf{elif}\;x \leq 7.2 \cdot 10^{-80}:\\ \;\;\;\;5 \cdot y\\ \mathbf{elif}\;x \leq 1.12 \cdot 10^{+42}:\\ \;\;\;\;t \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ x x) y)))
   (if (<= x -2.8e+248)
     (* t x)
     (if (<= x -5.5e+43)
       t_1
       (if (<= x -4.1e-13)
         (* t x)
         (if (<= x 7.2e-80) (* 5.0 y) (if (<= x 1.12e+42) (* t x) t_1)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x + x) * y;
	double tmp;
	if (x <= -2.8e+248) {
		tmp = t * x;
	} else if (x <= -5.5e+43) {
		tmp = t_1;
	} else if (x <= -4.1e-13) {
		tmp = t * x;
	} else if (x <= 7.2e-80) {
		tmp = 5.0 * y;
	} else if (x <= 1.12e+42) {
		tmp = t * 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x + x) * y
    if (x <= (-2.8d+248)) then
        tmp = t * x
    else if (x <= (-5.5d+43)) then
        tmp = t_1
    else if (x <= (-4.1d-13)) then
        tmp = t * x
    else if (x <= 7.2d-80) then
        tmp = 5.0d0 * y
    else if (x <= 1.12d+42) then
        tmp = t * x
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x + x) * y;
	double tmp;
	if (x <= -2.8e+248) {
		tmp = t * x;
	} else if (x <= -5.5e+43) {
		tmp = t_1;
	} else if (x <= -4.1e-13) {
		tmp = t * x;
	} else if (x <= 7.2e-80) {
		tmp = 5.0 * y;
	} else if (x <= 1.12e+42) {
		tmp = t * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x + x) * y
	tmp = 0
	if x <= -2.8e+248:
		tmp = t * x
	elif x <= -5.5e+43:
		tmp = t_1
	elif x <= -4.1e-13:
		tmp = t * x
	elif x <= 7.2e-80:
		tmp = 5.0 * y
	elif x <= 1.12e+42:
		tmp = t * x
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x + x) * y)
	tmp = 0.0
	if (x <= -2.8e+248)
		tmp = Float64(t * x);
	elseif (x <= -5.5e+43)
		tmp = t_1;
	elseif (x <= -4.1e-13)
		tmp = Float64(t * x);
	elseif (x <= 7.2e-80)
		tmp = Float64(5.0 * y);
	elseif (x <= 1.12e+42)
		tmp = Float64(t * x);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x + x) * y;
	tmp = 0.0;
	if (x <= -2.8e+248)
		tmp = t * x;
	elseif (x <= -5.5e+43)
		tmp = t_1;
	elseif (x <= -4.1e-13)
		tmp = t * x;
	elseif (x <= 7.2e-80)
		tmp = 5.0 * y;
	elseif (x <= 1.12e+42)
		tmp = t * x;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x + x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[x, -2.8e+248], N[(t * x), $MachinePrecision], If[LessEqual[x, -5.5e+43], t$95$1, If[LessEqual[x, -4.1e-13], N[(t * x), $MachinePrecision], If[LessEqual[x, 7.2e-80], N[(5.0 * y), $MachinePrecision], If[LessEqual[x, 1.12e+42], N[(t * x), $MachinePrecision], t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.8000000000000002e248 or -5.49999999999999989e43 < x < -4.1000000000000002e-13 or 7.2e-80 < x < 1.12e42

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in t around inf

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

      1. lower-*.f64 31.0

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

   4. Applied rewrites 31.0%

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

   if -2.8000000000000002e248 < x < -5.49999999999999989e43 or 1.12e42 < x

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(2 \cdot x + 5\right) \cdot y \]

      4. lower-fma.f64 47.6

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

   4. Applied rewrites 47.6%

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

   5. Taylor expanded in x around inf

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

      1. count-2-rev N/A

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

      2. lower-+.f64 20.6

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

   7. Applied rewrites 20.6%

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

   if -4.1000000000000002e-13 < x < 7.2e-80

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 29.3

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

   4. Applied rewrites 29.3%

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

Alternative 13: 45.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x + x\right) \cdot z\\ \mathbf{if}\;z \leq -1.9 \cdot 10^{+96}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq -1.02 \cdot 10^{+49}:\\ \;\;\;\;5 \cdot y\\ \mathbf{elif}\;z \leq 4.2 \cdot 10^{-197}:\\ \;\;\;\;t \cdot x\\ \mathbf{elif}\;z \leq 2.2 \cdot 10^{-28}:\\ \;\;\;\;5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ x x) z)))
   (if (<= z -1.9e+96)
     t_1
     (if (<= z -1.02e+49)
       (* 5.0 y)
       (if (<= z 4.2e-197) (* t x) (if (<= z 2.2e-28) (* 5.0 y) t_1))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x + x) * z;
	double tmp;
	if (z <= -1.9e+96) {
		tmp = t_1;
	} else if (z <= -1.02e+49) {
		tmp = 5.0 * y;
	} else if (z <= 4.2e-197) {
		tmp = t * x;
	} else if (z <= 2.2e-28) {
		tmp = 5.0 * y;
	} 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x + x) * z
    if (z <= (-1.9d+96)) then
        tmp = t_1
    else if (z <= (-1.02d+49)) then
        tmp = 5.0d0 * y
    else if (z <= 4.2d-197) then
        tmp = t * x
    else if (z <= 2.2d-28) then
        tmp = 5.0d0 * y
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x + x) * z;
	double tmp;
	if (z <= -1.9e+96) {
		tmp = t_1;
	} else if (z <= -1.02e+49) {
		tmp = 5.0 * y;
	} else if (z <= 4.2e-197) {
		tmp = t * x;
	} else if (z <= 2.2e-28) {
		tmp = 5.0 * y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x + x) * z
	tmp = 0
	if z <= -1.9e+96:
		tmp = t_1
	elif z <= -1.02e+49:
		tmp = 5.0 * y
	elif z <= 4.2e-197:
		tmp = t * x
	elif z <= 2.2e-28:
		tmp = 5.0 * y
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x + x) * z)
	tmp = 0.0
	if (z <= -1.9e+96)
		tmp = t_1;
	elseif (z <= -1.02e+49)
		tmp = Float64(5.0 * y);
	elseif (z <= 4.2e-197)
		tmp = Float64(t * x);
	elseif (z <= 2.2e-28)
		tmp = Float64(5.0 * y);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x + x) * z;
	tmp = 0.0;
	if (z <= -1.9e+96)
		tmp = t_1;
	elseif (z <= -1.02e+49)
		tmp = 5.0 * y;
	elseif (z <= 4.2e-197)
		tmp = t * x;
	elseif (z <= 2.2e-28)
		tmp = 5.0 * y;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x + x), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[z, -1.9e+96], t$95$1, If[LessEqual[z, -1.02e+49], N[(5.0 * y), $MachinePrecision], If[LessEqual[z, 4.2e-197], N[(t * x), $MachinePrecision], If[LessEqual[z, 2.2e-28], N[(5.0 * y), $MachinePrecision], t$95$1]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.9000000000000001e96 or 2.19999999999999996e-28 < z

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 30.2

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

   4. Applied rewrites 30.2%

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

   if -1.9000000000000001e96 < z < -1.02e49 or 4.2e-197 < z < 2.19999999999999996e-28

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 29.3

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

   4. Applied rewrites 29.3%

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

   if -1.02e49 < z < 4.2e-197

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in t around inf

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

      1. lower-*.f64 31.0

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

   4. Applied rewrites 31.0%

      \[\leadsto \color{blue}{t \cdot x} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 14: 44.5% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -270000000:\\ \;\;\;\;t \cdot x\\ \mathbf{elif}\;t \leq 2.4 \cdot 10^{-8}:\\ \;\;\;\;5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;t \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -270000000.0) (* t x) (if (<= t 2.4e-8) (* 5.0 y) (* t x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -270000000.0) {
		tmp = t * x;
	} else if (t <= 2.4e-8) {
		tmp = 5.0 * y;
	} else {
		tmp = t * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-270000000.0d0)) then
        tmp = t * x
    else if (t <= 2.4d-8) then
        tmp = 5.0d0 * y
    else
        tmp = t * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -270000000.0) {
		tmp = t * x;
	} else if (t <= 2.4e-8) {
		tmp = 5.0 * y;
	} else {
		tmp = t * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -270000000.0:
		tmp = t * x
	elif t <= 2.4e-8:
		tmp = 5.0 * y
	else:
		tmp = t * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -270000000.0)
		tmp = Float64(t * x);
	elseif (t <= 2.4e-8)
		tmp = Float64(5.0 * y);
	else
		tmp = Float64(t * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t <= -270000000.0)
		tmp = t * x;
	elseif (t <= 2.4e-8)
		tmp = 5.0 * y;
	else
		tmp = t * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[t, -270000000.0], N[(t * x), $MachinePrecision], If[LessEqual[t, 2.4e-8], N[(5.0 * y), $MachinePrecision], N[(t * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if t < -2.7e8 or 2.39999999999999998e-8 < t

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in t around inf

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

      1. lower-*.f64 31.0

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

   4. Applied rewrites 31.0%

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

   if -2.7e8 < t < 2.39999999999999998e-8

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 29.3

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

   4. Applied rewrites 29.3%

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

Alternative 15: 29.3% accurate, 5.2× speedup

Math

\[\begin{array}{l} \\ 5 \cdot y \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (* 5.0 y))

C

double code(double x, double y, double z, double t) {
	return 5.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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = 5.0d0 * y
end function

Java

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

Python

def code(x, y, z, t):
	return 5.0 * y

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(5.0 * y), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

2. Taylor expanded in x around 0

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

   1. lower-*.f64 29.3

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

4. Applied rewrites 29.3%

   \[\leadsto \color{blue}{5 \cdot y} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025139 
(FPCore (x y z t)
  :name "Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendOutside from plot-0.2.3.4, B"
  :precision binary64
  (+ (* x (+ (+ (+ (+ y z) z) y) t)) (* y 5.0)))