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

Percentage Accurate: 98.1% → 98.2%

Time: 7.8s

Alternatives: 11

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    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) / (a - t)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    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) / (a - t)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \frac{y}{\frac{t - a}{t - z}} + x \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.8%

   \[x + y \cdot \frac{z - t}{a - t} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. clear-num N/A

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

   4. un-div-inv N/A

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

   5. lower-/.f64 N/A

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

   6. frac-2neg N/A

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

   7. lower-/.f64 N/A

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

   8. neg-sub0 N/A

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

   9. lift--.f64 N/A

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

   10. sub-neg N/A

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

   11. +-commutative N/A

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

   12. associate--r+ N/A

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

   13. neg-sub0 N/A

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

   14. remove-double-neg N/A

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

   15. lower--.f64 N/A

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

   16. neg-sub0 N/A

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

   17. lift--.f64 N/A

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

   18. sub-neg N/A

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

   19. +-commutative N/A

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

   20. associate--r+ N/A

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

   21. neg-sub0 N/A

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

   22. remove-double-neg N/A

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

   23. lower--.f64 98.0

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

4. Applied rewrites 98.0%

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

5. Final simplification 98.0%

   \[\leadsto \frac{y}{\frac{t - a}{t - z}} + x \]
6. Add Preprocessing

Alternative 2: 89.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := \frac{y}{a - t} \cdot z\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+166}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq -1 \cdot 10^{+76}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-z}{t}, y, x\right)\\ \mathbf{elif}\;t\_1 \leq 0.1:\\ \;\;\;\;\mathsf{fma}\left(\frac{z - t}{a}, y, x\right)\\ \mathbf{elif}\;t\_1 \leq 10^{+90}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t - z}{t}, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (* (/ y (- a t)) z)))
   (if (<= t_1 -5e+166)
     t_2
     (if (<= t_1 -1e+76)
       (fma (/ (- z) t) y x)
       (if (<= t_1 0.1)
         (fma (/ (- z t) a) y x)
         (if (<= t_1 1e+90) (fma (/ (- t z) t) y x) t_2))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (y / (a - t)) * z;
	double tmp;
	if (t_1 <= -5e+166) {
		tmp = t_2;
	} else if (t_1 <= -1e+76) {
		tmp = fma((-z / t), y, x);
	} else if (t_1 <= 0.1) {
		tmp = fma(((z - t) / a), y, x);
	} else if (t_1 <= 1e+90) {
		tmp = fma(((t - z) / t), y, x);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = Float64(Float64(y / Float64(a - t)) * z)
	tmp = 0.0
	if (t_1 <= -5e+166)
		tmp = t_2;
	elseif (t_1 <= -1e+76)
		tmp = fma(Float64(Float64(-z) / t), y, x);
	elseif (t_1 <= 0.1)
		tmp = fma(Float64(Float64(z - t) / a), y, x);
	elseif (t_1 <= 1e+90)
		tmp = fma(Float64(Float64(t - z) / t), y, x);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y / N[(a - t), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+166], t$95$2, If[LessEqual[t$95$1, -1e+76], N[(N[((-z) / t), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[t$95$1, 0.1], N[(N[(N[(z - t), $MachinePrecision] / a), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[t$95$1, 1e+90], N[(N[(N[(t - z), $MachinePrecision] / t), $MachinePrecision] * y + x), $MachinePrecision], t$95$2]]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -5.0000000000000002e166 or 9.99999999999999966e89 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 89.2%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 85.5

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

   5. Applied rewrites 85.5%

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

   if -5.0000000000000002e166 < (/.f64 (-.f64 z t) (-.f64 a t)) < -1e76

   1. Initial program 99.7%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. div-sub N/A

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

      7. sub-neg N/A

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

      8. *-inverses N/A

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. distribute-neg-in N/A

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

      12. metadata-eval N/A

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

      13. mul-1-neg N/A

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

      14. lower-fma.f64 N/A

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

   5. Applied rewrites 88.7%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 88.7%

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

   if -1e76 < (/.f64 (-.f64 z t) (-.f64 a t)) < 0.10000000000000001

   1. Initial program 99.2%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 93.6

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

   5. Applied rewrites 93.6%

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

   if 0.10000000000000001 < (/.f64 (-.f64 z t) (-.f64 a t)) < 9.99999999999999966e89

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. div-sub N/A

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

      7. sub-neg N/A

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

      8. *-inverses N/A

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. distribute-neg-in N/A

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

      12. metadata-eval N/A

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

      13. mul-1-neg N/A

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

      14. lower-fma.f64 N/A

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

   5. Applied rewrites 95.3%

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

Alternative 3: 83.8% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := \frac{y}{a - t} \cdot z\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+166}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq -1 \cdot 10^{+76}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-z}{t}, y, x\right)\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-14}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{a}, y, x\right)\\ \mathbf{elif}\;t\_1 \leq 10^{+90}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (* (/ y (- a t)) z)))
   (if (<= t_1 -5e+166)
     t_2
     (if (<= t_1 -1e+76)
       (fma (/ (- z) t) y x)
       (if (<= t_1 2e-14)
         (fma (/ z a) y x)
         (if (<= t_1 1e+90) (+ y x) t_2))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (y / (a - t)) * z;
	double tmp;
	if (t_1 <= -5e+166) {
		tmp = t_2;
	} else if (t_1 <= -1e+76) {
		tmp = fma((-z / t), y, x);
	} else if (t_1 <= 2e-14) {
		tmp = fma((z / a), y, x);
	} else if (t_1 <= 1e+90) {
		tmp = y + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = Float64(Float64(y / Float64(a - t)) * z)
	tmp = 0.0
	if (t_1 <= -5e+166)
		tmp = t_2;
	elseif (t_1 <= -1e+76)
		tmp = fma(Float64(Float64(-z) / t), y, x);
	elseif (t_1 <= 2e-14)
		tmp = fma(Float64(z / a), y, x);
	elseif (t_1 <= 1e+90)
		tmp = Float64(y + x);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y / N[(a - t), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+166], t$95$2, If[LessEqual[t$95$1, -1e+76], N[(N[((-z) / t), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[t$95$1, 2e-14], N[(N[(z / a), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[t$95$1, 1e+90], N[(y + x), $MachinePrecision], t$95$2]]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -5.0000000000000002e166 or 9.99999999999999966e89 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 89.2%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 85.5

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

   5. Applied rewrites 85.5%

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

   if -5.0000000000000002e166 < (/.f64 (-.f64 z t) (-.f64 a t)) < -1e76

   1. Initial program 99.7%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. div-sub N/A

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

      7. sub-neg N/A

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

      8. *-inverses N/A

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. distribute-neg-in N/A

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

      12. metadata-eval N/A

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

      13. mul-1-neg N/A

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

      14. lower-fma.f64 N/A

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

   5. Applied rewrites 88.7%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 88.7%

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

   if -1e76 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2e-14

   1. Initial program 99.3%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 84.8

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

   5. Applied rewrites 84.8%

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

   if 2e-14 < (/.f64 (-.f64 z t) (-.f64 a t)) < 9.99999999999999966e89

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 92.2

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

   5. Applied rewrites 92.2%

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

Alternative 4: 83.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := \frac{y}{a - t} \cdot z\\ \mathbf{if}\;t\_1 \leq -4 \cdot 10^{+82}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-14}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{a}, y, x\right)\\ \mathbf{elif}\;t\_1 \leq 10^{+90}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (* (/ y (- a t)) z)))
   (if (<= t_1 -4e+82)
     t_2
     (if (<= t_1 2e-14) (fma (/ z a) y x) (if (<= t_1 1e+90) (+ y x) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (y / (a - t)) * z;
	double tmp;
	if (t_1 <= -4e+82) {
		tmp = t_2;
	} else if (t_1 <= 2e-14) {
		tmp = fma((z / a), y, x);
	} else if (t_1 <= 1e+90) {
		tmp = y + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = Float64(Float64(y / Float64(a - t)) * z)
	tmp = 0.0
	if (t_1 <= -4e+82)
		tmp = t_2;
	elseif (t_1 <= 2e-14)
		tmp = fma(Float64(z / a), y, x);
	elseif (t_1 <= 1e+90)
		tmp = Float64(y + x);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -3.9999999999999999e82 or 9.99999999999999966e89 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 92.1%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 80.0

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

   5. Applied rewrites 80.0%

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

   if -3.9999999999999999e82 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2e-14

   1. Initial program 99.3%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 83.9

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

   5. Applied rewrites 83.9%

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

   if 2e-14 < (/.f64 (-.f64 z t) (-.f64 a t)) < 9.99999999999999966e89

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 92.2

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

   5. Applied rewrites 92.2%

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

Alternative 5: 80.6% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (fma z (/ y a) x)))
   (if (<= t_1 2e-14) t_2 (if (<= t_1 1e+90) (+ y x) t_2))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = fma(z, (y / a), x);
	double tmp;
	if (t_1 <= 2e-14) {
		tmp = t_2;
	} else if (t_1 <= 1e+90) {
		tmp = y + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = fma(z, Float64(y / a), x)
	tmp = 0.0
	if (t_1 <= 2e-14)
		tmp = t_2;
	elseif (t_1 <= 1e+90)
		tmp = Float64(y + x);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 2e-14 or 9.99999999999999966e89 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 96.3%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. un-div-inv N/A

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

      5. lower-/.f64 N/A

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

      6. frac-2neg N/A

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

      7. lower-/.f64 N/A

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

      8. neg-sub0 N/A

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

      9. lift--.f64 N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. associate--r+ N/A

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

      13. neg-sub0 N/A

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

      14. remove-double-neg N/A

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

      15. lower--.f64 N/A

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

      16. neg-sub0 N/A

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

      17. lift--.f64 N/A

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

      18. sub-neg N/A

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

      19. +-commutative N/A

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

      20. associate--r+ N/A

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

      21. neg-sub0 N/A

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

      22. remove-double-neg N/A

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

      23. lower--.f64 96.5

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

   4. Applied rewrites 96.5%

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

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 74.3

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

   7. Applied rewrites 74.3%

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

   if 2e-14 < (/.f64 (-.f64 z t) (-.f64 a t)) < 9.99999999999999966e89

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 92.2

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

   5. Applied rewrites 92.2%

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

Alternative 6: 65.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := \frac{y}{a} \cdot z\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+146}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{+90}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (* (/ y a) z)))
   (if (<= t_1 -5e+146) t_2 (if (<= t_1 1e+90) (+ y x) t_2))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (y / a) * z;
	double tmp;
	if (t_1 <= -5e+146) {
		tmp = t_2;
	} else if (t_1 <= 1e+90) {
		tmp = y + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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 = (z - t) / (a - t)
    t_2 = (y / a) * z
    if (t_1 <= (-5d+146)) then
        tmp = t_2
    else if (t_1 <= 1d+90) then
        tmp = y + x
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (y / a) * z;
	double tmp;
	if (t_1 <= -5e+146) {
		tmp = t_2;
	} else if (t_1 <= 1e+90) {
		tmp = y + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (a - t)
	t_2 = (y / a) * z
	tmp = 0
	if t_1 <= -5e+146:
		tmp = t_2
	elif t_1 <= 1e+90:
		tmp = y + x
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = Float64(Float64(y / a) * z)
	tmp = 0.0
	if (t_1 <= -5e+146)
		tmp = t_2;
	elseif (t_1 <= 1e+90)
		tmp = Float64(y + x);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (z - t) / (a - t);
	t_2 = (y / a) * z;
	tmp = 0.0;
	if (t_1 <= -5e+146)
		tmp = t_2;
	elseif (t_1 <= 1e+90)
		tmp = y + x;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -4.9999999999999999e146 or 9.99999999999999966e89 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 90.2%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 85.0

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

   5. Applied rewrites 85.0%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 55.8%

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

   if -4.9999999999999999e146 < (/.f64 (-.f64 z t) (-.f64 a t)) < 9.99999999999999966e89

   1. Initial program 99.6%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 74.0

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

   5. Applied rewrites 74.0%

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

Alternative 7: 65.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := \frac{z}{a} \cdot y\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+146}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{+90}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (* (/ z a) y)))
   (if (<= t_1 -5e+146) t_2 (if (<= t_1 1e+90) (+ y x) t_2))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (z / a) * y;
	double tmp;
	if (t_1 <= -5e+146) {
		tmp = t_2;
	} else if (t_1 <= 1e+90) {
		tmp = y + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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 = (z - t) / (a - t)
    t_2 = (z / a) * y
    if (t_1 <= (-5d+146)) then
        tmp = t_2
    else if (t_1 <= 1d+90) then
        tmp = y + x
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (z / a) * y;
	double tmp;
	if (t_1 <= -5e+146) {
		tmp = t_2;
	} else if (t_1 <= 1e+90) {
		tmp = y + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (a - t)
	t_2 = (z / a) * y
	tmp = 0
	if t_1 <= -5e+146:
		tmp = t_2
	elif t_1 <= 1e+90:
		tmp = y + x
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = Float64(Float64(z / a) * y)
	tmp = 0.0
	if (t_1 <= -5e+146)
		tmp = t_2;
	elseif (t_1 <= 1e+90)
		tmp = Float64(y + x);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (z - t) / (a - t);
	t_2 = (z / a) * y;
	tmp = 0.0;
	if (t_1 <= -5e+146)
		tmp = t_2;
	elseif (t_1 <= 1e+90)
		tmp = y + x;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -4.9999999999999999e146 or 9.99999999999999966e89 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 90.2%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 85.0

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

   5. Applied rewrites 85.0%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 52.0%

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

   10. Applied rewrites 53.6%

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

   if -4.9999999999999999e146 < (/.f64 (-.f64 z t) (-.f64 a t)) < 9.99999999999999966e89

   1. Initial program 99.6%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 74.0

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

   5. Applied rewrites 74.0%

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

4. Final simplification 70.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq -5 \cdot 10^{+146}:\\ \;\;\;\;\frac{z}{a} \cdot y\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 10^{+90}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{a} \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 80.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\frac{t - z}{t}, y, x\right)\\ \mathbf{if}\;t \leq -6 \cdot 10^{+29}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 1650000:\\ \;\;\;\;\mathsf{fma}\left(\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 (/ (- t z) t) y x)))
   (if (<= t -6e+29) t_1 (if (<= t 1650000.0) (fma (/ z a) y x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(((t - z) / t), y, x);
	double tmp;
	if (t <= -6e+29) {
		tmp = t_1;
	} else if (t <= 1650000.0) {
		tmp = fma((z / a), y, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(Float64(t - z) / t), y, x)
	tmp = 0.0
	if (t <= -6e+29)
		tmp = t_1;
	elseif (t <= 1650000.0)
		tmp = fma(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[(N[(t - z), $MachinePrecision] / t), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t, -6e+29], t$95$1, If[LessEqual[t, 1650000.0], N[(N[(z / a), $MachinePrecision] * y + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -5.9999999999999998e29 or 1.65e6 < t

   1. Initial program 99.9%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. div-sub N/A

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

      7. sub-neg N/A

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

      8. *-inverses N/A

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. distribute-neg-in N/A

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

      12. metadata-eval N/A

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

      13. mul-1-neg N/A

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

      14. lower-fma.f64 N/A

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

   5. Applied rewrites 91.9%

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

   if -5.9999999999999998e29 < t < 1.65e6

   1. Initial program 95.8%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 81.5

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

   5. Applied rewrites 81.5%

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

Alternative 9: 76.5% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4.6e30 or 1.59999999999999986e30 < t

   1. Initial program 99.9%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 81.2

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

   5. Applied rewrites 81.2%

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

   if -4.6e30 < t < 1.59999999999999986e30

   1. Initial program 96.0%

      \[x + y \cdot \frac{z - t}{a - t} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 79.8

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

   5. Applied rewrites 79.8%

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

Alternative 10: 98.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.8%

   \[x + y \cdot \frac{z - t}{a - t} \]
2. Add Preprocessing

3. Final simplification 97.8%

   \[\leadsto \frac{z - t}{a - t} \cdot y + x \]
4. Add Preprocessing

Alternative 11: 60.6% accurate, 6.5× 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

real(8) function code(x, y, z, t, a)
    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 97.8%

   \[x + y \cdot \frac{z - t}{a - t} \]
2. Add Preprocessing

3. Taylor expanded in t around inf

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

   1. +-commutative N/A

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

   2. lower-+.f64 62.9

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

5. Applied rewrites 62.9%

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

Developer Target 1: 99.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + y \cdot \frac{z - t}{a - t}\\ \mathbf{if}\;y < -8.508084860551241 \cdot 10^{-17}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y < 2.894426862792089 \cdot 10^{-49}:\\ \;\;\;\;x + \left(y \cdot \left(z - t\right)\right) \cdot \frac{1}{a - t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (* y (/ (- z t) (- a t))))))
   (if (< y -8.508084860551241e-17)
     t_1
     (if (< y 2.894426862792089e-49)
       (+ x (* (* y (- z t)) (/ 1.0 (- a t))))
       t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (y * ((z - t) / (a - t)));
	double tmp;
	if (y < -8.508084860551241e-17) {
		tmp = t_1;
	} else if (y < 2.894426862792089e-49) {
		tmp = x + ((y * (z - t)) * (1.0 / (a - t)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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 * ((z - t) / (a - t)))
    if (y < (-8.508084860551241d-17)) then
        tmp = t_1
    else if (y < 2.894426862792089d-49) then
        tmp = x + ((y * (z - t)) * (1.0d0 / (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 * ((z - t) / (a - t)));
	double tmp;
	if (y < -8.508084860551241e-17) {
		tmp = t_1;
	} else if (y < 2.894426862792089e-49) {
		tmp = x + ((y * (z - t)) * (1.0 / (a - t)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = x + (y * ((z - t) / (a - t)))
	tmp = 0
	if y < -8.508084860551241e-17:
		tmp = t_1
	elif y < 2.894426862792089e-49:
		tmp = x + ((y * (z - t)) * (1.0 / (a - t)))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(x + Float64(y * Float64(Float64(z - t) / Float64(a - t))))
	tmp = 0.0
	if (y < -8.508084860551241e-17)
		tmp = t_1;
	elseif (y < 2.894426862792089e-49)
		tmp = Float64(x + Float64(Float64(y * Float64(z - t)) * Float64(1.0 / 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 * ((z - t) / (a - t)));
	tmp = 0.0;
	if (y < -8.508084860551241e-17)
		tmp = t_1;
	elseif (y < 2.894426862792089e-49)
		tmp = x + ((y * (z - t)) * (1.0 / (a - t)));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(x + N[(y * N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[y, -8.508084860551241e-17], t$95$1, If[Less[y, 2.894426862792089e-49], N[(x + N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Reproduce

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

  :alt
  (! :herbie-platform default (if (< y -8508084860551241/100000000000000000000000000000000) (+ x (* y (/ (- z t) (- a t)))) (if (< y 2894426862792089/10000000000000000000000000000000000000000000000000000000000000000) (+ x (* (* y (- z t)) (/ 1 (- a t)))) (+ x (* y (/ (- z t) (- a t)))))))

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