Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisTick from plot-0.2.3.4, B

Percentage Accurate: 76.7% → 93.3%

Time: 4.0s

Alternatives: 11

Speedup: 0.9×

Specification

Math

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

FPCore

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

C

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

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) * y) / (a - t))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 76.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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) * y) / (a - t))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 93.3% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 76.7%

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

2. Taylor expanded in z around inf

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

   1. associate-/l* N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 N/A

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

   4. lift--.f64 81.1

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

4. Applied rewrites 81.1%

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

5. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. lower--.f64 N/A

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

   5. +-commutative N/A

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

   6. lower-+.f64 N/A

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

   7. lower-/.f64 N/A

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

   8. lift--.f64 N/A

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

   9. lift-/.f64 N/A

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

   10. lift--.f64 93.3

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

7. Applied rewrites 93.3%

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

Alternative 2: 87.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x + y\right) - y \cdot \frac{z}{a - t}\\ \mathbf{if}\;a \leq -3.3 \cdot 10^{-84}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 1.6 \cdot 10^{-91}:\\ \;\;\;\;x - \frac{z \cdot y}{a - t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- (+ x y) (* y (/ z (- a t))))))
   (if (<= a -3.3e-84) t_1 (if (<= a 1.6e-91) (- x (/ (* z y) (- a t))) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (x + y) - (y * (z / (a - t)));
	double tmp;
	if (a <= -3.3e-84) {
		tmp = t_1;
	} else if (a <= 1.6e-91) {
		tmp = x - ((z * y) / (a - t));
	} 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, 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) :: t_1
    real(8) :: tmp
    t_1 = (x + y) - (y * (z / (a - t)))
    if (a <= (-3.3d-84)) then
        tmp = t_1
    else if (a <= 1.6d-91) then
        tmp = x - ((z * y) / (a - t))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (x + y) - (y * (z / (a - t)));
	double tmp;
	if (a <= -3.3e-84) {
		tmp = t_1;
	} else if (a <= 1.6e-91) {
		tmp = x - ((z * y) / (a - t));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (x + y) - (y * (z / (a - t)))
	tmp = 0
	if a <= -3.3e-84:
		tmp = t_1
	elif a <= 1.6e-91:
		tmp = x - ((z * y) / (a - t))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(x + y) - Float64(y * Float64(z / Float64(a - t))))
	tmp = 0.0
	if (a <= -3.3e-84)
		tmp = t_1;
	elseif (a <= 1.6e-91)
		tmp = Float64(x - Float64(Float64(z * y) / Float64(a - t)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (x + y) - (y * (z / (a - t)));
	tmp = 0.0;
	if (a <= -3.3e-84)
		tmp = t_1;
	elseif (a <= 1.6e-91)
		tmp = x - ((z * y) / (a - t));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -3.29999999999999984e-84 or 1.59999999999999998e-91 < a

   1. Initial program 77.6%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 85.8

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

   4. Applied rewrites 85.8%

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

   if -3.29999999999999984e-84 < a < 1.59999999999999998e-91

   1. Initial program 75.2%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 71.1%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 90.5%

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

Alternative 3: 85.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(1 - \frac{z}{a}, y, x\right)\\ \mathbf{if}\;a \leq -3.9 \cdot 10^{-83}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 1.4 \cdot 10^{-11}:\\ \;\;\;\;x - \frac{z \cdot y}{a - t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- 1.0 (/ z a)) y x)))
   (if (<= a -3.9e-83) t_1 (if (<= a 1.4e-11) (- x (/ (* z y) (- a t))) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((1.0 - (z / a)), y, x);
	double tmp;
	if (a <= -3.9e-83) {
		tmp = t_1;
	} else if (a <= 1.4e-11) {
		tmp = x - ((z * y) / (a - t));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(1.0 - Float64(z / a)), y, x)
	tmp = 0.0
	if (a <= -3.9e-83)
		tmp = t_1;
	elseif (a <= 1.4e-11)
		tmp = Float64(x - Float64(Float64(z * y) / Float64(a - t)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -3.9e-83 or 1.4e-11 < a

   1. Initial program 77.5%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 86.7

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

   4. Applied rewrites 86.7%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift--.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. lift--.f64 93.6

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

   7. Applied rewrites 93.6%

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

   8. Taylor expanded in t around 0

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 82.4

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

   10. Applied rewrites 82.4%

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

   if -3.9e-83 < a < 1.4e-11

   1. Initial program 75.7%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 70.9%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 89.2%

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

Alternative 4: 85.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- 1.0 (/ z a)) y x)))
   (if (<= a -3.9e-83)
     t_1
     (if (<= a 3.5e+104) (- x (* z (/ y (- a t)))) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((1.0 - (z / a)), y, x);
	double tmp;
	if (a <= -3.9e-83) {
		tmp = t_1;
	} else if (a <= 3.5e+104) {
		tmp = x - (z * (y / (a - t)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(1.0 - Float64(z / a)), y, x)
	tmp = 0.0
	if (a <= -3.9e-83)
		tmp = t_1;
	elseif (a <= 3.5e+104)
		tmp = Float64(x - Float64(z * Float64(y / Float64(a - t))));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -3.9e-83 or 3.5000000000000002e104 < a

   1. Initial program 77.3%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 87.8

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

   4. Applied rewrites 87.8%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift--.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. lift--.f64 93.9

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

   7. Applied rewrites 93.9%

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

   8. Taylor expanded in t around 0

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 84.0

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

   10. Applied rewrites 84.0%

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

   if -3.9e-83 < a < 3.5000000000000002e104

   1. Initial program 76.2%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 69.0%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lift--.f64 72.6

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

   6. Applied rewrites 72.6%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 87.6%

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

Alternative 5: 80.2% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -6.5e+47)
   (fma (- (/ (- a z) t)) y x)
   (if (<= t 4e-64) (fma (- 1.0 (/ z a)) y x) (- x (* z (/ y (- t)))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -6.5e+47) {
		tmp = fma(-((a - z) / t), y, x);
	} else if (t <= 4e-64) {
		tmp = fma((1.0 - (z / a)), y, x);
	} else {
		tmp = x - (z * (y / -t));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -6.5e+47)
		tmp = fma(Float64(-Float64(Float64(a - z) / t)), y, x);
	elseif (t <= 4e-64)
		tmp = fma(Float64(1.0 - Float64(z / a)), y, x);
	else
		tmp = Float64(x - Float64(z * Float64(y / Float64(-t))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, -6.5e+47], N[((-N[(N[(a - z), $MachinePrecision] / t), $MachinePrecision]) * y + x), $MachinePrecision], If[LessEqual[t, 4e-64], N[(N[(1.0 - N[(z / a), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision], N[(x - N[(z * N[(y / (-t)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < -6.49999999999999988e47

   1. Initial program 56.9%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 65.8

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

   4. Applied rewrites 65.8%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift--.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. lift--.f64 90.2

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

   7. Applied rewrites 90.2%

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

   8. Taylor expanded in t around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 86.8

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

   10. Applied rewrites 86.8%

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

   if -6.49999999999999988e47 < t < 3.99999999999999986e-64

   1. Initial program 91.3%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 91.8

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

   4. Applied rewrites 91.8%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift--.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. lift--.f64 95.0

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

   7. Applied rewrites 95.0%

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

   8. Taylor expanded in t around 0

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 80.8

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

   10. Applied rewrites 80.8%

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

   if 3.99999999999999986e-64 < t

   1. Initial program 66.2%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 55.8%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lift--.f64 63.9

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

   6. Applied rewrites 63.9%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 79.3%

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

   10. Taylor expanded in t around inf

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

       1. mul-1-neg N/A

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

       2. lower-neg.f64 74.7

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

   12. Applied rewrites 74.7%

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

Alternative 6: 78.4% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -1.7e+59)
   (fma (/ z t) y x)
   (if (<= t 4e-64) (fma (- 1.0 (/ z a)) y x) (- x (* z (/ y (- t)))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -1.7e+59) {
		tmp = fma((z / t), y, x);
	} else if (t <= 4e-64) {
		tmp = fma((1.0 - (z / a)), y, x);
	} else {
		tmp = x - (z * (y / -t));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -1.7e+59)
		tmp = fma(Float64(z / t), y, x);
	elseif (t <= 4e-64)
		tmp = fma(Float64(1.0 - Float64(z / a)), y, x);
	else
		tmp = Float64(x - Float64(z * Float64(y / Float64(-t))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.7e+59], N[(N[(z / t), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[t, 4e-64], N[(N[(1.0 - N[(z / a), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision], N[(x - N[(z * N[(y / (-t)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < -1.70000000000000003e59

   1. Initial program 56.3%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 65.5

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

   4. Applied rewrites 65.5%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift--.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. lift--.f64 90.0

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

   7. Applied rewrites 90.0%

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

   8. Taylor expanded in a around 0

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

      1. lower-/.f64 79.3

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

   10. Applied rewrites 79.3%

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

   if -1.70000000000000003e59 < t < 3.99999999999999986e-64

   1. Initial program 90.9%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 91.5

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

   4. Applied rewrites 91.5%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift--.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. lift--.f64 95.0

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

   7. Applied rewrites 95.0%

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

   8. Taylor expanded in t around 0

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 80.4

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

   10. Applied rewrites 80.4%

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

   if 3.99999999999999986e-64 < t

   1. Initial program 66.2%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 55.8%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lift--.f64 63.9

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

   6. Applied rewrites 63.9%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 79.3%

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

   10. Taylor expanded in t around inf

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

       1. mul-1-neg N/A

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

       2. lower-neg.f64 74.7

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

   12. Applied rewrites 74.7%

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

Alternative 7: 78.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ z t) y x)))
   (if (<= t -1.7e+59) t_1 (if (<= t 4e-64) (fma (- 1.0 (/ z a)) y x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((z / t), y, x);
	double tmp;
	if (t <= -1.7e+59) {
		tmp = t_1;
	} else if (t <= 4e-64) {
		tmp = fma((1.0 - (z / a)), y, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(z / t), y, x)
	tmp = 0.0
	if (t <= -1.7e+59)
		tmp = t_1;
	elseif (t <= 4e-64)
		tmp = fma(Float64(1.0 - Float64(z / a)), y, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -1.70000000000000003e59 or 3.99999999999999986e-64 < t

   1. Initial program 62.3%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 70.6

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

   4. Applied rewrites 70.6%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift--.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. lift--.f64 91.7

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

   7. Applied rewrites 91.7%

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

   8. Taylor expanded in a around 0

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

      1. lower-/.f64 77.0

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

   10. Applied rewrites 77.0%

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

   if -1.70000000000000003e59 < t < 3.99999999999999986e-64

   1. Initial program 90.9%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 91.5

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

   4. Applied rewrites 91.5%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift--.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. lift--.f64 95.0

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

   7. Applied rewrites 95.0%

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

   8. Taylor expanded in t around 0

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 80.4

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

   10. Applied rewrites 80.4%

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

Alternative 8: 75.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -2.8e-90) (+ y x) (if (<= a 1.15e+62) (fma (/ z t) y x) (+ y x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -2.8e-90) {
		tmp = y + x;
	} else if (a <= 1.15e+62) {
		tmp = fma((z / t), y, x);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -2.8e-90)
		tmp = Float64(y + x);
	elseif (a <= 1.15e+62)
		tmp = fma(Float64(z / t), y, x);
	else
		tmp = Float64(y + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -2.8e-90], N[(y + x), $MachinePrecision], If[LessEqual[a, 1.15e+62], N[(N[(z / t), $MachinePrecision] * y + x), $MachinePrecision], N[(y + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if a < -2.7999999999999999e-90 or 1.14999999999999992e62 < a

   1. Initial program 77.3%

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

   2. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 73.5

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

   4. Applied rewrites 73.5%

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

   if -2.7999999999999999e-90 < a < 1.14999999999999992e62

   1. Initial program 76.1%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 74.6

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

   4. Applied rewrites 74.6%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift--.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. lift--.f64 93.0

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

   7. Applied rewrites 93.0%

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

   8. Taylor expanded in a around 0

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

      1. lower-/.f64 77.4

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

   10. Applied rewrites 77.4%

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

Alternative 9: 62.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -7.5 \cdot 10^{-85}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;a \leq 9.8 \cdot 10^{-92}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -7.5e-85) (+ y x) (if (<= a 9.8e-92) x (+ y x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -7.5e-85) {
		tmp = y + x;
	} else if (a <= 9.8e-92) {
		tmp = x;
	} 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 (a <= (-7.5d-85)) then
        tmp = y + x
    else if (a <= 9.8d-92) then
        tmp = x
    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 (a <= -7.5e-85) {
		tmp = y + x;
	} else if (a <= 9.8e-92) {
		tmp = x;
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a <= -7.5e-85:
		tmp = y + x
	elif a <= 9.8e-92:
		tmp = x
	else:
		tmp = y + x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -7.5e-85)
		tmp = Float64(y + x);
	elseif (a <= 9.8e-92)
		tmp = x;
	else
		tmp = Float64(y + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= -7.5e-85)
		tmp = y + x;
	elseif (a <= 9.8e-92)
		tmp = x;
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -7.5e-85], N[(y + x), $MachinePrecision], If[LessEqual[a, 9.8e-92], x, N[(y + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if a < -7.5000000000000003e-85 or 9.8e-92 < a

   1. Initial program 77.6%

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

   2. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 69.6

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

   4. Applied rewrites 69.6%

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

   if -7.5000000000000003e-85 < a < 9.8e-92

   1. Initial program 75.2%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 50.2%

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

Alternative 10: 52.6% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.3 \cdot 10^{-176}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 3.1 \cdot 10^{-249}:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= x -1.3e-176) x (if (<= x 3.1e-249) y x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (x <= -1.3e-176) {
		tmp = x;
	} else if (x <= 3.1e-249) {
		tmp = y;
	} else {
		tmp = 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 (x <= (-1.3d-176)) then
        tmp = x
    else if (x <= 3.1d-249) then
        tmp = y
    else
        tmp = 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 (x <= -1.3e-176) {
		tmp = x;
	} else if (x <= 3.1e-249) {
		tmp = y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if x <= -1.3e-176:
		tmp = x
	elif x <= 3.1e-249:
		tmp = y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (x <= -1.3e-176)
		tmp = x;
	elseif (x <= 3.1e-249)
		tmp = y;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (x <= -1.3e-176)
		tmp = x;
	elseif (x <= 3.1e-249)
		tmp = y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[x, -1.3e-176], x, If[LessEqual[x, 3.1e-249], y, x]]

Derivation

1. Split input into 2 regimes

2. if x < -1.29999999999999996e-176 or 3.09999999999999986e-249 < x

   1. Initial program 78.9%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 56.8%

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

   if -1.29999999999999996e-176 < x < 3.09999999999999986e-249

   1. Initial program 65.1%

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

   2. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 35.7

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

   4. Applied rewrites 35.7%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 29.8%

      \[\leadsto y \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 50.5% accurate, 29.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 76.7%

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

2. Taylor expanded in x around inf

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

4. Applied rewrites 50.5%

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

Developer Target 1: 88.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(y + x\right) - \left(\left(z - t\right) \cdot \frac{1}{a - t}\right) \cdot y\\ t_2 := \left(x + y\right) - \frac{\left(z - t\right) \cdot y}{a - t}\\ \mathbf{if}\;t\_2 < -1.3664970889390727 \cdot 10^{-7}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 < 1.4754293444577233 \cdot 10^{-239}:\\ \;\;\;\;\frac{y \cdot \left(a - z\right) - x \cdot t}{a - t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- (+ y x) (* (* (- z t) (/ 1.0 (- a t))) y)))
        (t_2 (- (+ x y) (/ (* (- z t) y) (- a t)))))
   (if (< t_2 -1.3664970889390727e-7)
     t_1
     (if (< t_2 1.4754293444577233e-239)
       (/ (- (* y (- a z)) (* x t)) (- a t))
       t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y + x) - (((z - t) * (1.0 / (a - t))) * y);
	double t_2 = (x + y) - (((z - t) * y) / (a - t));
	double tmp;
	if (t_2 < -1.3664970889390727e-7) {
		tmp = t_1;
	} else if (t_2 < 1.4754293444577233e-239) {
		tmp = ((y * (a - z)) - (x * t)) / (a - t);
	} 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, 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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (y + x) - (((z - t) * (1.0d0 / (a - t))) * y)
    t_2 = (x + y) - (((z - t) * y) / (a - t))
    if (t_2 < (-1.3664970889390727d-7)) then
        tmp = t_1
    else if (t_2 < 1.4754293444577233d-239) then
        tmp = ((y * (a - z)) - (x * t)) / (a - t)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (y + x) - (((z - t) * (1.0 / (a - t))) * y);
	double t_2 = (x + y) - (((z - t) * y) / (a - t));
	double tmp;
	if (t_2 < -1.3664970889390727e-7) {
		tmp = t_1;
	} else if (t_2 < 1.4754293444577233e-239) {
		tmp = ((y * (a - z)) - (x * t)) / (a - t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (y + x) - (((z - t) * (1.0 / (a - t))) * y)
	t_2 = (x + y) - (((z - t) * y) / (a - t))
	tmp = 0
	if t_2 < -1.3664970889390727e-7:
		tmp = t_1
	elif t_2 < 1.4754293444577233e-239:
		tmp = ((y * (a - z)) - (x * t)) / (a - t)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y + x) - Float64(Float64(Float64(z - t) * Float64(1.0 / Float64(a - t))) * y))
	t_2 = Float64(Float64(x + y) - Float64(Float64(Float64(z - t) * y) / Float64(a - t)))
	tmp = 0.0
	if (t_2 < -1.3664970889390727e-7)
		tmp = t_1;
	elseif (t_2 < 1.4754293444577233e-239)
		tmp = Float64(Float64(Float64(y * Float64(a - z)) - Float64(x * t)) / Float64(a - t));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (y + x) - (((z - t) * (1.0 / (a - t))) * y);
	t_2 = (x + y) - (((z - t) * y) / (a - t));
	tmp = 0.0;
	if (t_2 < -1.3664970889390727e-7)
		tmp = t_1;
	elseif (t_2 < 1.4754293444577233e-239)
		tmp = ((y * (a - z)) - (x * t)) / (a - t);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y + x), $MachinePrecision] - N[(N[(N[(z - t), $MachinePrecision] * N[(1.0 / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x + y), $MachinePrecision] - N[(N[(N[(z - t), $MachinePrecision] * y), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$2, -1.3664970889390727e-7], t$95$1, If[Less[t$95$2, 1.4754293444577233e-239], N[(N[(N[(y * N[(a - z), $MachinePrecision]), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Reproduce

herbie shell --seed 2025106 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisTick from plot-0.2.3.4, B"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (- (+ x y) (/ (* (- z t) y) (- a t))) -13664970889390727/100000000000000000000000) (- (+ y x) (* (* (- z t) (/ 1 (- a t))) y)) (if (< (- (+ x y) (/ (* (- z t) y) (- a t))) 14754293444577233/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (- (* y (- a z)) (* x t)) (- a t)) (- (+ y x) (* (* (- z t) (/ 1 (- a t))) y)))))

  (- (+ x y) (/ (* (- z t) y) (- a t))))