Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisTicks from plot-0.2.3.4, A

Percentage Accurate: 85.2% → 98.1%

Time: 6.6s

Alternatives: 13

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (x y z t a) :precision binary64 (+ x (/ (* y (- z t)) (- z a))))

C

double code(double x, double y, double z, double t, double a) {
	return x + ((y * (z - t)) / (z - a));
}

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, a)
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), intent (in) :: a
    code = x + ((y * (z - t)) / (z - a))
end function

Java

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

Python

def code(x, y, z, t, a):
	return x + ((y * (z - t)) / (z - a))

Julia

function code(x, y, z, t, a)
	return Float64(x + Float64(Float64(y * Float64(z - t)) / Float64(z - a)))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = x + ((y * (z - t)) / (z - a));
end

Wolfram

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

Initial Program: 85.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a) :precision binary64 (+ x (/ (* y (- z t)) (- z a))))

C

double code(double x, double y, double z, double t, double a) {
	return x + ((y * (z - t)) / (z - a));
}

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, a)
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), intent (in) :: a
    code = x + ((y * (z - t)) / (z - a))
end function

Java

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

Python

def code(x, y, z, t, a):
	return x + ((y * (z - t)) / (z - a))

Julia

function code(x, y, z, t, a)
	return Float64(x + Float64(Float64(y * Float64(z - t)) / Float64(z - a)))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = x + ((y * (z - t)) / (z - a));
end

Wolfram

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

Alternative 1: 98.1% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a) :precision binary64 (fma (/ (- t z) (- a z)) y x))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 85.2%

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

   1. lift-+.f64 N/A

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

   2. lift--.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. lift--.f64 N/A

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

   6. +-commutative N/A

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

   7. associate-/l* N/A

      \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a}} + x \]

   8. sub-div N/A

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

   9. *-commutative N/A

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

   10. lower-fma.f64 N/A

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

   11. sub-div N/A

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

   12. sub-negate-rev N/A

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

   13. sub-negate-rev N/A

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

   14. frac-2neg-rev N/A

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

   15. lower-/.f64 N/A

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

   16. lower--.f64 N/A

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

   17. lower--.f64 98.1

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

3. Applied rewrites 98.1%

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

Alternative 2: 86.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(y, \frac{z}{z - a}, x\right)\\ \mathbf{if}\;z \leq -2.1 \cdot 10^{+73}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.05 \cdot 10^{+95}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{a - z}, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (/ z (- z a)) x)))
   (if (<= z -2.1e+73) t_1 (if (<= z 1.05e+95) (fma (/ t (- a z)) y x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, (z / (z - a)), x);
	double tmp;
	if (z <= -2.1e+73) {
		tmp = t_1;
	} else if (z <= 1.05e+95) {
		tmp = fma((t / (a - z)), y, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(z / Float64(z - a)), x)
	tmp = 0.0
	if (z <= -2.1e+73)
		tmp = t_1;
	elseif (z <= 1.05e+95)
		tmp = fma(Float64(t / Float64(a - z)), y, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(y * N[(z / N[(z - a), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[z, -2.1e+73], t$95$1, If[LessEqual[z, 1.05e+95], N[(N[(t / N[(a - z), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.1000000000000001e73 or 1.05e95 < z

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in t around 0

      \[\leadsto \color{blue}{x + \frac{y \cdot z}{z - a}} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{y \cdot z}{z - a} + \color{blue}{x} \]

      2. associate-/l* N/A

         \[\leadsto y \cdot \frac{z}{z - a} + x \]

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 71.6

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

   4. Applied rewrites 71.6%

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

   if -2.1000000000000001e73 < z < 1.05e95

   1. Initial program 85.2%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a}} + x \]

      8. sub-div N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. sub-div N/A

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

      12. sub-negate-rev N/A

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

      13. sub-negate-rev N/A

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

      14. frac-2neg-rev N/A

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

      15. lower-/.f64 N/A

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

      16. lower--.f64 N/A

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

      17. lower--.f64 98.1

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

   3. Applied rewrites 98.1%

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

   4. Taylor expanded in z around 0

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

   6. Applied rewrites 76.1%

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

Alternative 3: 81.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(y, \frac{z}{z - a}, x\right)\\ \mathbf{if}\;z \leq -3.3 \cdot 10^{+71}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq -1.45 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{-z}, y, x\right)\\ \mathbf{elif}\;z \leq 4.2 \cdot 10^{+30}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (/ z (- z a)) x)))
   (if (<= z -3.3e+71)
     t_1
     (if (<= z -1.45e-9)
       (fma (/ t (- z)) y x)
       (if (<= z 4.2e+30) (fma t (/ y a) x) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, (z / (z - a)), x);
	double tmp;
	if (z <= -3.3e+71) {
		tmp = t_1;
	} else if (z <= -1.45e-9) {
		tmp = fma((t / -z), y, x);
	} else if (z <= 4.2e+30) {
		tmp = fma(t, (y / a), x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(z / Float64(z - a)), x)
	tmp = 0.0
	if (z <= -3.3e+71)
		tmp = t_1;
	elseif (z <= -1.45e-9)
		tmp = fma(Float64(t / Float64(-z)), y, x);
	elseif (z <= 4.2e+30)
		tmp = fma(t, Float64(y / a), x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(y * N[(z / N[(z - a), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[z, -3.3e+71], t$95$1, If[LessEqual[z, -1.45e-9], N[(N[(t / (-z)), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[z, 4.2e+30], N[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.2999999999999998e71 or 4.2e30 < z

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in t around 0

      \[\leadsto \color{blue}{x + \frac{y \cdot z}{z - a}} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{y \cdot z}{z - a} + \color{blue}{x} \]

      2. associate-/l* N/A

         \[\leadsto y \cdot \frac{z}{z - a} + x \]

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 71.6

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

   4. Applied rewrites 71.6%

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

   if -3.2999999999999998e71 < z < -1.44999999999999996e-9

   1. Initial program 85.2%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a}} + x \]

      8. sub-div N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. sub-div N/A

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

      12. sub-negate-rev N/A

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

      13. sub-negate-rev N/A

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

      14. frac-2neg-rev N/A

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

      15. lower-/.f64 N/A

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

      16. lower--.f64 N/A

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

      17. lower--.f64 98.1

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

   3. Applied rewrites 98.1%

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

   4. Taylor expanded in z around 0

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

   6. Applied rewrites 76.1%

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

   7. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 51.5

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

   9. Applied rewrites 51.5%

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

   if -1.44999999999999996e-9 < z < 4.2e30

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{t \cdot y}{a} + \color{blue}{x} \]

      2. associate-/l* N/A

         \[\leadsto t \cdot \frac{y}{a} + x \]

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 61.7

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

   4. Applied rewrites 61.7%

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

Alternative 4: 80.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.45 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z - t}{z}, x\right)\\ \mathbf{elif}\;z \leq 4.2 \cdot 10^{+30}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z}{z - a}, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -1.45e-9)
   (fma y (/ (- z t) z) x)
   (if (<= z 4.2e+30) (fma t (/ y a) x) (fma y (/ z (- z a)) x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.45e-9) {
		tmp = fma(y, ((z - t) / z), x);
	} else if (z <= 4.2e+30) {
		tmp = fma(t, (y / a), x);
	} else {
		tmp = fma(y, (z / (z - a)), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -1.45e-9)
		tmp = fma(y, Float64(Float64(z - t) / z), x);
	elseif (z <= 4.2e+30)
		tmp = fma(t, Float64(y / a), x);
	else
		tmp = fma(y, Float64(z / Float64(z - a)), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.45e-9], N[(y * N[(N[(z - t), $MachinePrecision] / z), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[z, 4.2e+30], N[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision], N[(y * N[(z / N[(z - a), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.44999999999999996e-9

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

         \[\leadsto y \cdot \frac{z - t}{z} + x \]

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 66.4

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

   4. Applied rewrites 66.4%

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

   if -1.44999999999999996e-9 < z < 4.2e30

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{t \cdot y}{a} + \color{blue}{x} \]

      2. associate-/l* N/A

         \[\leadsto t \cdot \frac{y}{a} + x \]

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 61.7

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

   4. Applied rewrites 61.7%

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

   if 4.2e30 < z

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in t around 0

      \[\leadsto \color{blue}{x + \frac{y \cdot z}{z - a}} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{y \cdot z}{z - a} + \color{blue}{x} \]

      2. associate-/l* N/A

         \[\leadsto y \cdot \frac{z}{z - a} + x \]

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 71.6

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

   4. Applied rewrites 71.6%

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

Alternative 5: 76.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.3 \cdot 10^{+73}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq -1.45 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{-z}, y, x\right)\\ \mathbf{elif}\;z \leq 5.8 \cdot 10^{+103}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -2.3e+73)
   (+ y x)
   (if (<= z -1.45e-9)
     (fma (/ t (- z)) y x)
     (if (<= z 5.8e+103) (fma t (/ y a) x) (+ y x)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -2.3e+73) {
		tmp = y + x;
	} else if (z <= -1.45e-9) {
		tmp = fma((t / -z), y, x);
	} else if (z <= 5.8e+103) {
		tmp = fma(t, (y / a), x);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -2.3e+73)
		tmp = Float64(y + x);
	elseif (z <= -1.45e-9)
		tmp = fma(Float64(t / Float64(-z)), y, x);
	elseif (z <= 5.8e+103)
		tmp = fma(t, Float64(y / a), x);
	else
		tmp = Float64(y + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -2.3e+73], N[(y + x), $MachinePrecision], If[LessEqual[z, -1.45e-9], N[(N[(t / (-z)), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[z, 5.8e+103], N[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision], N[(y + x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if z < -2.3e73 or 5.7999999999999997e103 < z

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.4

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

   4. Applied rewrites 60.4%

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

   if -2.3e73 < z < -1.44999999999999996e-9

   1. Initial program 85.2%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a}} + x \]

      8. sub-div N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. sub-div N/A

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

      12. sub-negate-rev N/A

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

      13. sub-negate-rev N/A

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

      14. frac-2neg-rev N/A

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

      15. lower-/.f64 N/A

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

      16. lower--.f64 N/A

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

      17. lower--.f64 98.1

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

   3. Applied rewrites 98.1%

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

   4. Taylor expanded in z around 0

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

   6. Applied rewrites 76.1%

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

   7. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 51.5

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

   9. Applied rewrites 51.5%

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

   if -1.44999999999999996e-9 < z < 5.7999999999999997e103

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{t \cdot y}{a} + \color{blue}{x} \]

      2. associate-/l* N/A

         \[\leadsto t \cdot \frac{y}{a} + x \]

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 61.7

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

   4. Applied rewrites 61.7%

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

Alternative 6: 76.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3 \cdot 10^{+72}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq -1 \cdot 10^{-10}:\\ \;\;\;\;t \cdot \frac{y}{a - z}\\ \mathbf{elif}\;z \leq 5.8 \cdot 10^{+103}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -3e+72)
   (+ y x)
   (if (<= z -1e-10)
     (* t (/ y (- a z)))
     (if (<= z 5.8e+103) (fma t (/ y a) x) (+ y x)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -3e+72) {
		tmp = y + x;
	} else if (z <= -1e-10) {
		tmp = t * (y / (a - z));
	} else if (z <= 5.8e+103) {
		tmp = fma(t, (y / a), x);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -3e+72)
		tmp = Float64(y + x);
	elseif (z <= -1e-10)
		tmp = Float64(t * Float64(y / Float64(a - z)));
	elseif (z <= 5.8e+103)
		tmp = fma(t, Float64(y / a), x);
	else
		tmp = Float64(y + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -3e+72], N[(y + x), $MachinePrecision], If[LessEqual[z, -1e-10], N[(t * N[(y / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5.8e+103], N[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision], N[(y + x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.00000000000000003e72 or 5.7999999999999997e103 < z

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.4

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

   4. Applied rewrites 60.4%

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

   if -3.00000000000000003e72 < z < -1.00000000000000004e-10

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in t around inf

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot y}{z - a}} \]
   3. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. sub-negate-rev N/A

         \[\leadsto \frac{\mathsf{neg}\left(t \cdot y\right)}{\mathsf{neg}\left(\left(a - z\right)\right)} \]

      4. frac-2neg-rev N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      5. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a} - z} \]

      7. lower--.f64 26.3

         \[\leadsto \frac{t \cdot y}{a - \color{blue}{z}} \]

   4. Applied rewrites 26.3%

      \[\leadsto \color{blue}{\frac{t \cdot y}{a - z}} \]
   5. Step-by-step derivation

      1. associate-/l* 26.3

         \[\leadsto \frac{t \cdot \color{blue}{y}}{a - z} \]

      2. sub-div 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      3. fp-cancel-sign-sub-inv 26.3

         \[\leadsto \frac{\color{blue}{t \cdot y}}{a - z} \]

      4. sub-div 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      5. sub-negate-rev 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      6. sub-negate-rev 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      7. frac-2neg 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      8. fp-cancel-sign-sub-inv 26.3

         \[\leadsto \frac{\color{blue}{t \cdot y}}{a - z} \]

      9. associate-/l* 26.3

         \[\leadsto \frac{t \cdot \color{blue}{y}}{a - z} \]

      10. +-commutative 26.3

          \[\leadsto \frac{\color{blue}{t \cdot y}}{a - z} \]

      11. associate-/l* 26.3

          \[\leadsto \frac{\color{blue}{t} \cdot y}{a - z} \]

      12. *-commutative 26.3

          \[\leadsto \frac{\color{blue}{t} \cdot y}{a - z} \]

      13. lift-*.f64 N/A

          \[\leadsto \frac{t \cdot y}{\color{blue}{a} - z} \]

      14. lift--.f64 N/A

          \[\leadsto \frac{t \cdot y}{a - \color{blue}{z}} \]

      15. lift-/.f64 N/A

          \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      16. associate-/l* N/A

          \[\leadsto t \cdot \color{blue}{\frac{y}{a - z}} \]

      17. frac-2neg N/A

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

      18. mul-1-neg N/A

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

   6. Applied rewrites 28.5%

      \[\leadsto \color{blue}{t \cdot \frac{y}{a - z}} \]

   if -1.00000000000000004e-10 < z < 5.7999999999999997e103

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{t \cdot y}{a} + \color{blue}{x} \]

      2. associate-/l* N/A

         \[\leadsto t \cdot \frac{y}{a} + x \]

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 61.7

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

   4. Applied rewrites 61.7%

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

Alternative 7: 75.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9.5 \cdot 10^{+30}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq -1 \cdot 10^{-10}:\\ \;\;\;\;\frac{t \cdot y}{a - z}\\ \mathbf{elif}\;z \leq 5.8 \cdot 10^{+103}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -9.5e+30)
   (+ y x)
   (if (<= z -1e-10)
     (/ (* t y) (- a z))
     (if (<= z 5.8e+103) (fma t (/ y a) x) (+ y x)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -9.5e+30) {
		tmp = y + x;
	} else if (z <= -1e-10) {
		tmp = (t * y) / (a - z);
	} else if (z <= 5.8e+103) {
		tmp = fma(t, (y / a), x);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -9.5e+30)
		tmp = Float64(y + x);
	elseif (z <= -1e-10)
		tmp = Float64(Float64(t * y) / Float64(a - z));
	elseif (z <= 5.8e+103)
		tmp = fma(t, Float64(y / a), x);
	else
		tmp = Float64(y + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -9.5e+30], N[(y + x), $MachinePrecision], If[LessEqual[z, -1e-10], N[(N[(t * y), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5.8e+103], N[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision], N[(y + x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if z < -9.5000000000000003e30 or 5.7999999999999997e103 < z

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.4

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

   4. Applied rewrites 60.4%

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

   if -9.5000000000000003e30 < z < -1.00000000000000004e-10

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in t around inf

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot y}{z - a}} \]
   3. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. sub-negate-rev N/A

         \[\leadsto \frac{\mathsf{neg}\left(t \cdot y\right)}{\mathsf{neg}\left(\left(a - z\right)\right)} \]

      4. frac-2neg-rev N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      5. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a} - z} \]

      7. lower--.f64 26.3

         \[\leadsto \frac{t \cdot y}{a - \color{blue}{z}} \]

   4. Applied rewrites 26.3%

      \[\leadsto \color{blue}{\frac{t \cdot y}{a - z}} \]

   if -1.00000000000000004e-10 < z < 5.7999999999999997e103

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{t \cdot y}{a} + \color{blue}{x} \]

      2. associate-/l* N/A

         \[\leadsto t \cdot \frac{y}{a} + x \]

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 61.7

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

   4. Applied rewrites 61.7%

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

Alternative 8: 73.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -6.3 \cdot 10^{-9}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq 5.8 \cdot 10^{+103}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -6.3e-9) (+ y x) (if (<= z 5.8e+103) (fma t (/ y a) x) (+ y x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -6.3e-9) {
		tmp = y + x;
	} else if (z <= 5.8e+103) {
		tmp = fma(t, (y / a), x);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -6.3e-9)
		tmp = Float64(y + x);
	elseif (z <= 5.8e+103)
		tmp = fma(t, Float64(y / a), x);
	else
		tmp = Float64(y + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -6.3e-9], N[(y + x), $MachinePrecision], If[LessEqual[z, 5.8e+103], N[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision], N[(y + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -6.3000000000000002e-9 or 5.7999999999999997e103 < z

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.4

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

   4. Applied rewrites 60.4%

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

   if -6.3000000000000002e-9 < z < 5.7999999999999997e103

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

         \[\leadsto \frac{t \cdot y}{a} + \color{blue}{x} \]

      2. associate-/l* N/A

         \[\leadsto t \cdot \frac{y}{a} + x \]

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 61.7

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

   4. Applied rewrites 61.7%

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

Alternative 9: 60.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.45 \cdot 10^{-135}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq 1.55 \cdot 10^{-140}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -1.45e-135) (+ y x) (if (<= z 1.55e-140) (* t (/ y a)) (+ y x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.45e-135) {
		tmp = y + x;
	} else if (z <= 1.55e-140) {
		tmp = t * (y / a);
	} else {
		tmp = y + 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, a)
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), intent (in) :: a
    real(8) :: tmp
    if (z <= (-1.45d-135)) then
        tmp = y + x
    else if (z <= 1.55d-140) then
        tmp = t * (y / a)
    else
        tmp = y + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.45e-135) {
		tmp = y + x;
	} else if (z <= 1.55e-140) {
		tmp = t * (y / a);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -1.45e-135:
		tmp = y + x
	elif z <= 1.55e-140:
		tmp = t * (y / a)
	else:
		tmp = y + x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -1.45e-135)
		tmp = Float64(y + x);
	elseif (z <= 1.55e-140)
		tmp = Float64(t * Float64(y / a));
	else
		tmp = Float64(y + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -1.45e-135)
		tmp = y + x;
	elseif (z <= 1.55e-140)
		tmp = t * (y / a);
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.45e-135], N[(y + x), $MachinePrecision], If[LessEqual[z, 1.55e-140], N[(t * N[(y / a), $MachinePrecision]), $MachinePrecision], N[(y + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.4500000000000001e-135 or 1.55e-140 < z

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.4

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

   4. Applied rewrites 60.4%

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

   if -1.4500000000000001e-135 < z < 1.55e-140

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in t around inf

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot y}{z - a}} \]
   3. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. sub-negate-rev N/A

         \[\leadsto \frac{\mathsf{neg}\left(t \cdot y\right)}{\mathsf{neg}\left(\left(a - z\right)\right)} \]

      4. frac-2neg-rev N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      5. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a} - z} \]

      7. lower--.f64 26.3

         \[\leadsto \frac{t \cdot y}{a - \color{blue}{z}} \]

   4. Applied rewrites 26.3%

      \[\leadsto \color{blue}{\frac{t \cdot y}{a - z}} \]
   5. Step-by-step derivation

      1. associate-/l* 26.3

         \[\leadsto \frac{t \cdot \color{blue}{y}}{a - z} \]

      2. sub-div 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      3. fp-cancel-sign-sub-inv 26.3

         \[\leadsto \frac{\color{blue}{t \cdot y}}{a - z} \]

      4. sub-div 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      5. sub-negate-rev 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      6. sub-negate-rev 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      7. frac-2neg 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      8. fp-cancel-sign-sub-inv 26.3

         \[\leadsto \frac{\color{blue}{t \cdot y}}{a - z} \]

      9. associate-/l* 26.3

         \[\leadsto \frac{t \cdot \color{blue}{y}}{a - z} \]

      10. +-commutative 26.3

          \[\leadsto \frac{\color{blue}{t \cdot y}}{a - z} \]

      11. associate-/l* 26.3

          \[\leadsto \frac{\color{blue}{t} \cdot y}{a - z} \]

      12. *-commutative 26.3

          \[\leadsto \frac{\color{blue}{t} \cdot y}{a - z} \]

      13. lift-*.f64 N/A

          \[\leadsto \frac{t \cdot y}{\color{blue}{a} - z} \]

      14. lift--.f64 N/A

          \[\leadsto \frac{t \cdot y}{a - \color{blue}{z}} \]

      15. lift-/.f64 N/A

          \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      16. associate-/l* N/A

          \[\leadsto t \cdot \color{blue}{\frac{y}{a - z}} \]

      17. frac-2neg N/A

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

      18. mul-1-neg N/A

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

   6. Applied rewrites 28.5%

      \[\leadsto \color{blue}{t \cdot \frac{y}{a - z}} \]

   7. Taylor expanded in z around 0

      \[\leadsto t \cdot \frac{y}{a} \]
   8. Step-by-step derivation

   9. Applied rewrites 20.4%

      \[\leadsto t \cdot \frac{y}{a} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 60.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.45 \cdot 10^{-135}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq 1.5 \cdot 10^{-140}:\\ \;\;\;\;y \cdot \frac{t}{a}\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -1.45e-135) (+ y x) (if (<= z 1.5e-140) (* y (/ t a)) (+ y x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.45e-135) {
		tmp = y + x;
	} else if (z <= 1.5e-140) {
		tmp = y * (t / a);
	} else {
		tmp = y + 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, a)
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), intent (in) :: a
    real(8) :: tmp
    if (z <= (-1.45d-135)) then
        tmp = y + x
    else if (z <= 1.5d-140) then
        tmp = y * (t / a)
    else
        tmp = y + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.45e-135) {
		tmp = y + x;
	} else if (z <= 1.5e-140) {
		tmp = y * (t / a);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -1.45e-135:
		tmp = y + x
	elif z <= 1.5e-140:
		tmp = y * (t / a)
	else:
		tmp = y + x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -1.45e-135)
		tmp = Float64(y + x);
	elseif (z <= 1.5e-140)
		tmp = Float64(y * Float64(t / a));
	else
		tmp = Float64(y + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -1.45e-135)
		tmp = y + x;
	elseif (z <= 1.5e-140)
		tmp = y * (t / a);
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.45e-135], N[(y + x), $MachinePrecision], If[LessEqual[z, 1.5e-140], N[(y * N[(t / a), $MachinePrecision]), $MachinePrecision], N[(y + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.4500000000000001e-135 or 1.50000000000000009e-140 < z

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.4

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

   4. Applied rewrites 60.4%

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

   if -1.4500000000000001e-135 < z < 1.50000000000000009e-140

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in t around inf

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot y}{z - a}} \]
   3. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. sub-negate-rev N/A

         \[\leadsto \frac{\mathsf{neg}\left(t \cdot y\right)}{\mathsf{neg}\left(\left(a - z\right)\right)} \]

      4. frac-2neg-rev N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      5. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a} - z} \]

      7. lower--.f64 26.3

         \[\leadsto \frac{t \cdot y}{a - \color{blue}{z}} \]

   4. Applied rewrites 26.3%

      \[\leadsto \color{blue}{\frac{t \cdot y}{a - z}} \]
   5. Step-by-step derivation

      1. associate-/l* 26.3

         \[\leadsto \frac{t \cdot \color{blue}{y}}{a - z} \]

      2. sub-div 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      3. fp-cancel-sign-sub-inv 26.3

         \[\leadsto \frac{\color{blue}{t \cdot y}}{a - z} \]

      4. sub-div 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      5. sub-negate-rev 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      6. sub-negate-rev 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      7. frac-2neg 26.3

         \[\leadsto \frac{t \cdot y}{a - z} \]

      8. fp-cancel-sign-sub-inv 26.3

         \[\leadsto \frac{\color{blue}{t \cdot y}}{a - z} \]

      9. associate-/l* 26.3

         \[\leadsto \frac{t \cdot \color{blue}{y}}{a - z} \]

      10. +-commutative 26.3

          \[\leadsto \frac{\color{blue}{t \cdot y}}{a - z} \]

      11. associate-/l* 26.3

          \[\leadsto \frac{\color{blue}{t} \cdot y}{a - z} \]

      12. *-commutative 26.3

          \[\leadsto \frac{\color{blue}{t} \cdot y}{a - z} \]

      13. lift-*.f64 N/A

          \[\leadsto \frac{t \cdot y}{\color{blue}{a} - z} \]

      14. lift--.f64 N/A

          \[\leadsto \frac{t \cdot y}{a - \color{blue}{z}} \]

      15. lift-/.f64 N/A

          \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      16. associate-/l* N/A

          \[\leadsto t \cdot \color{blue}{\frac{y}{a - z}} \]

      17. frac-2neg N/A

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

      18. mul-1-neg N/A

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

   6. Applied rewrites 28.5%

      \[\leadsto \color{blue}{t \cdot \frac{y}{a - z}} \]

   7. Taylor expanded in z around 0

      \[\leadsto \frac{t \cdot y}{\color{blue}{a}} \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot y}{a} \]

      2. *-commutative N/A

         \[\leadsto \frac{y \cdot t}{a} \]

      3. lower-*.f64 18.7

         \[\leadsto \frac{y \cdot t}{a} \]

   9. Applied rewrites 18.7%

      \[\leadsto \frac{y \cdot t}{\color{blue}{a}} \]
   10. Step-by-step derivation

       1. lift-*.f64 N/A

          \[\leadsto \frac{y \cdot t}{a} \]

       2. lift-/.f64 N/A

          \[\leadsto \frac{y \cdot t}{a} \]

       3. associate-/l* N/A

          \[\leadsto y \cdot \frac{t}{\color{blue}{a}} \]

       4. lower-*.f64 N/A

          \[\leadsto y \cdot \frac{t}{\color{blue}{a}} \]

       5. lift-/.f64 20.7

          \[\leadsto y \cdot \frac{t}{a} \]

   11. Applied rewrites 20.7%

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

Alternative 11: 60.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.32 \cdot 10^{-135}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq 1.5 \cdot 10^{-140}:\\ \;\;\;\;\frac{t \cdot y}{a}\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -1.32e-135) (+ y x) (if (<= z 1.5e-140) (/ (* t y) a) (+ y x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.32e-135) {
		tmp = y + x;
	} else if (z <= 1.5e-140) {
		tmp = (t * y) / a;
	} else {
		tmp = y + 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, a)
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), intent (in) :: a
    real(8) :: tmp
    if (z <= (-1.32d-135)) then
        tmp = y + x
    else if (z <= 1.5d-140) then
        tmp = (t * y) / a
    else
        tmp = y + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.32e-135) {
		tmp = y + x;
	} else if (z <= 1.5e-140) {
		tmp = (t * y) / a;
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -1.32e-135:
		tmp = y + x
	elif z <= 1.5e-140:
		tmp = (t * y) / a
	else:
		tmp = y + x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -1.32e-135)
		tmp = Float64(y + x);
	elseif (z <= 1.5e-140)
		tmp = Float64(Float64(t * y) / a);
	else
		tmp = Float64(y + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -1.32e-135)
		tmp = y + x;
	elseif (z <= 1.5e-140)
		tmp = (t * y) / a;
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.32e-135], N[(y + x), $MachinePrecision], If[LessEqual[z, 1.5e-140], N[(N[(t * y), $MachinePrecision] / a), $MachinePrecision], N[(y + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.32000000000000007e-135 or 1.50000000000000009e-140 < z

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.4

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

   4. Applied rewrites 60.4%

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

   if -1.32000000000000007e-135 < z < 1.50000000000000009e-140

   1. Initial program 85.2%

      \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

   2. Taylor expanded in t around inf

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot y}{z - a}} \]
   3. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. sub-negate-rev N/A

         \[\leadsto \frac{\mathsf{neg}\left(t \cdot y\right)}{\mathsf{neg}\left(\left(a - z\right)\right)} \]

      4. frac-2neg-rev N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      5. lower-/.f64 N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{t \cdot y}{\color{blue}{a} - z} \]

      7. lower--.f64 26.3

         \[\leadsto \frac{t \cdot y}{a - \color{blue}{z}} \]

   4. Applied rewrites 26.3%

      \[\leadsto \color{blue}{\frac{t \cdot y}{a - z}} \]

   5. Taylor expanded in z around 0

      \[\leadsto \frac{t \cdot y}{a} \]
   6. Step-by-step derivation

   7. Applied rewrites 18.7%

      \[\leadsto \frac{t \cdot y}{a} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 59.7% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ y + x \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (+ y x))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
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), intent (in) :: a
    code = y + x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 85.2%

   \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

2. Taylor expanded in z around inf

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

   1. +-commutative N/A

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

   2. lower-+.f64 60.4

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

4. Applied rewrites 60.4%

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

Alternative 13: 19.2% accurate, 15.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := y

Derivation

1. Initial program 85.2%

   \[x + \frac{y \cdot \left(z - t\right)}{z - a} \]

2. Taylor expanded in z around inf

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

   1. +-commutative N/A

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

   2. lower-+.f64 60.4

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

4. Applied rewrites 60.4%

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

5. Taylor expanded in x around 0

   \[\leadsto y \]
6. Step-by-step derivation

7. Applied rewrites 19.2%

   \[\leadsto y \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2025134 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisTicks from plot-0.2.3.4, A"
  :precision binary64
  (+ x (/ (* y (- z t)) (- z a))))