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

Percentage Accurate: 98.3% → 98.5%

Time: 7.9s

Alternatives: 14

Speedup: 1.1×

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.3% 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.5% 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.2%

   \[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: 97.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := \mathsf{fma}\left(\frac{z}{a - t}, y, x\right)\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+20}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 0.1:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z - t}{a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;\mathsf{fma}\left(1 - \frac{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 (fma (/ z (- a t)) y x)))
   (if (<= t_1 -5e+20)
     t_2
     (if (<= t_1 0.1)
       (fma y (/ (- z t) a) x)
       (if (<= t_1 2.0) (fma (- 1.0 (/ 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 = fma((z / (a - t)), y, x);
	double tmp;
	if (t_1 <= -5e+20) {
		tmp = t_2;
	} else if (t_1 <= 0.1) {
		tmp = fma(y, ((z - t) / a), x);
	} else if (t_1 <= 2.0) {
		tmp = fma((1.0 - (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 = fma(Float64(z / Float64(a - t)), y, x)
	tmp = 0.0
	if (t_1 <= -5e+20)
		tmp = t_2;
	elseif (t_1 <= 0.1)
		tmp = fma(y, Float64(Float64(z - t) / a), x);
	elseif (t_1 <= 2.0)
		tmp = fma(Float64(1.0 - Float64(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[(z / N[(a - t), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+20], t$95$2, If[LessEqual[t$95$1, 0.1], N[(y * N[(N[(z - t), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 2.0], N[(N[(1.0 - N[(z / t), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -5e20 or 2 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 91.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 91.7

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

   5. Applied rewrites 91.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 91.7

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

   7. Applied rewrites 91.7%

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

   if -5e20 < (/.f64 (-.f64 z t) (-.f64 a t)) < 0.10000000000000001

   1. Initial program 99.7%

      \[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 49.4

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

   5. Applied rewrites 49.4%

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

   6. Taylor expanded in a around inf

      \[\leadsto \color{blue}{x + \frac{y \cdot \left(z - t\right)}{a}} \]
   7. 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. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 98.3

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

   8. Applied rewrites 98.3%

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

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

   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)} \]

      15. mul-1-neg N/A

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

      16. unsub-neg N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 99.4

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

   5. Applied rewrites 99.4%

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

Alternative 3: 88.4% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 -5e+20)
     (fma (- t z) (/ y t) x)
     (if (<= t_1 0.1)
       (fma y (/ (- z t) a) x)
       (if (<= t_1 3e+93) (fma (- 1.0 (/ z t)) y x) (* (/ y (- a t)) z))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -5e+20) {
		tmp = fma((t - z), (y / t), x);
	} else if (t_1 <= 0.1) {
		tmp = fma(y, ((z - t) / a), x);
	} else if (t_1 <= 3e+93) {
		tmp = fma((1.0 - (z / t)), y, x);
	} else {
		tmp = (y / (a - t)) * z;
	}
	return tmp;
}

Julia

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -5e20

   1. Initial program 93.0%

      \[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 97.7

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

   4. Applied rewrites 97.7%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 49.8

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

   7. Applied rewrites 49.8%

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

   8. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 81.5

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

   10. Applied rewrites 81.5%

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

   if -5e20 < (/.f64 (-.f64 z t) (-.f64 a t)) < 0.10000000000000001

   1. Initial program 99.7%

      \[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 49.4

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

   5. Applied rewrites 49.4%

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

   6. Taylor expanded in a around inf

      \[\leadsto \color{blue}{x + \frac{y \cdot \left(z - t\right)}{a}} \]
   7. 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. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 98.3

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

   8. Applied rewrites 98.3%

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

   if 0.10000000000000001 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.99999999999999978e93

   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)} \]

      15. mul-1-neg N/A

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

      16. unsub-neg N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 94.6

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

   5. Applied rewrites 94.6%

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

   if 2.99999999999999978e93 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 87.0%

      \[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}{y \cdot \frac{z}{a - t}} \]

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 79.2

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

   5. Applied rewrites 79.2%

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

   7. Applied rewrites 85.5%

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

4. Final simplification 92.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq -5 \cdot 10^{+20}:\\ \;\;\;\;\mathsf{fma}\left(t - z, \frac{y}{t}, x\right)\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 0.1:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z - t}{a}, x\right)\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 3 \cdot 10^{+93}:\\ \;\;\;\;\mathsf{fma}\left(1 - \frac{z}{t}, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a - t} \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 88.0% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 -4e+30)
     (fma (/ (- z) t) y x)
     (if (<= t_1 0.1)
       (fma y (/ (- z t) a) x)
       (if (<= t_1 3e+93) (fma (- 1.0 (/ z t)) y x) (* (/ y (- a t)) z))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -4e+30) {
		tmp = fma((-z / t), y, x);
	} else if (t_1 <= 0.1) {
		tmp = fma(y, ((z - t) / a), x);
	} else if (t_1 <= 3e+93) {
		tmp = fma((1.0 - (z / t)), y, x);
	} else {
		tmp = (y / (a - t)) * z;
	}
	return tmp;
}

Julia

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -4.0000000000000001e30

   1. Initial program 92.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)} \]

      15. mul-1-neg N/A

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

      16. unsub-neg N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 78.1

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

   5. Applied rewrites 78.1%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 78.1%

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

   if -4.0000000000000001e30 < (/.f64 (-.f64 z t) (-.f64 a t)) < 0.10000000000000001

   1. Initial program 99.7%

      \[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 49.5

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

   5. Applied rewrites 49.5%

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

   6. Taylor expanded in a around inf

      \[\leadsto \color{blue}{x + \frac{y \cdot \left(z - t\right)}{a}} \]
   7. 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. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 97.2

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

   8. Applied rewrites 97.2%

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

   if 0.10000000000000001 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.99999999999999978e93

   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)} \]

      15. mul-1-neg N/A

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

      16. unsub-neg N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 94.6

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

   5. Applied rewrites 94.6%

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

   if 2.99999999999999978e93 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 87.0%

      \[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}{y \cdot \frac{z}{a - t}} \]

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 79.2

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

   5. Applied rewrites 79.2%

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

   7. Applied rewrites 85.5%

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

4. Final simplification 91.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq -4 \cdot 10^{+30}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-z}{t}, y, x\right)\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 0.1:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z - t}{a}, x\right)\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 3 \cdot 10^{+93}:\\ \;\;\;\;\mathsf{fma}\left(1 - \frac{z}{t}, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a - t} \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 86.7% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 -4e+30)
     (fma (/ (- z) t) y x)
     (if (<= t_1 0.1)
       (fma y (/ (- z t) a) x)
       (if (<= t_1 100000.0) (+ y x) (* (/ y (- a t)) z))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -4e+30) {
		tmp = fma((-z / t), y, x);
	} else if (t_1 <= 0.1) {
		tmp = fma(y, ((z - t) / a), x);
	} else if (t_1 <= 100000.0) {
		tmp = y + x;
	} else {
		tmp = (y / (a - t)) * z;
	}
	return tmp;
}

Julia

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -4.0000000000000001e30

   1. Initial program 92.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)} \]

      15. mul-1-neg N/A

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

      16. unsub-neg N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 78.1

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

   5. Applied rewrites 78.1%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 78.1%

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

   if -4.0000000000000001e30 < (/.f64 (-.f64 z t) (-.f64 a t)) < 0.10000000000000001

   1. Initial program 99.7%

      \[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 49.5

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

   5. Applied rewrites 49.5%

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

   6. Taylor expanded in a around inf

      \[\leadsto \color{blue}{x + \frac{y \cdot \left(z - t\right)}{a}} \]
   7. 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. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 97.2

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

   8. Applied rewrites 97.2%

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

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

   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 98.4

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

   5. Applied rewrites 98.4%

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

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

   1. Initial program 90.5%

      \[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}{y \cdot \frac{z}{a - t}} \]

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 73.3

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

   5. Applied rewrites 73.3%

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

   7. Applied rewrites 77.9%

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

4. Final simplification 91.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq -4 \cdot 10^{+30}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-z}{t}, y, x\right)\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 0.1:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z - t}{a}, x\right)\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 100000:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a - t} \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 82.2% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -4.0000000000000001e30

   1. Initial program 92.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)} \]

      15. mul-1-neg N/A

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

      16. unsub-neg N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 78.1

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

   5. Applied rewrites 78.1%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 78.1%

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

   if -4.0000000000000001e30 < (/.f64 (-.f64 z t) (-.f64 a t)) < 4.00000000000000025e-9

   1. Initial program 99.7%

      \[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.5

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

   5. Applied rewrites 84.5%

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

   if 4.00000000000000025e-9 < (/.f64 (-.f64 z t) (-.f64 a t)) < 1e5

   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 97.5

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

   5. Applied rewrites 97.5%

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

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

   1. Initial program 90.5%

      \[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}{y \cdot \frac{z}{a - t}} \]

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 73.3

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

   5. Applied rewrites 73.3%

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

   7. Applied rewrites 77.9%

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

4. Final simplification 87.0%

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

Alternative 7: 81.6% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 4e-9)
     (fma (/ z a) y x)
     (if (<= t_1 100000.0) (+ y x) (* (/ y (- a t)) z)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= 4e-9) {
		tmp = fma((z / a), y, x);
	} else if (t_1 <= 100000.0) {
		tmp = y + x;
	} else {
		tmp = (y / (a - t)) * z;
	}
	return tmp;
}

Julia

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 4.00000000000000025e-9

   1. Initial program 97.4%

      \[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 75.3

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

   5. Applied rewrites 75.3%

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

   if 4.00000000000000025e-9 < (/.f64 (-.f64 z t) (-.f64 a t)) < 1e5

   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 97.5

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

   5. Applied rewrites 97.5%

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

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

   1. Initial program 90.5%

      \[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}{y \cdot \frac{z}{a - t}} \]

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 73.3

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

   5. Applied rewrites 73.3%

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

   7. Applied rewrites 77.9%

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

4. Final simplification 83.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq 4 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{a}, y, x\right)\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 100000:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a - t} \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 78.7% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 4e-9)
     (fma (/ z a) y x)
     (if (<= t_1 2e+73) (+ y x) (* (/ (- z) t) y)))))

C

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

Julia

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 4.00000000000000025e-9

   1. Initial program 97.4%

      \[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 75.3

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

   5. Applied rewrites 75.3%

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

   if 4.00000000000000025e-9 < (/.f64 (-.f64 z t) (-.f64 a t)) < 1.99999999999999997e73

   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 92.3

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

   5. Applied rewrites 92.3%

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

   if 1.99999999999999997e73 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 87.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)} \]

      15. mul-1-neg N/A

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

      16. unsub-neg N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 61.3

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

   5. Applied rewrites 61.3%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 58.9%

      \[\leadsto \left(-y\right) \cdot \color{blue}{\frac{z}{t}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 79.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq 4 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{a}, y, x\right)\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 2 \cdot 10^{+73}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;\frac{-z}{t} \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 80.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := \mathsf{fma}\left(\frac{z}{a}, y, x\right)\\ \mathbf{if}\;t\_1 \leq 4 \cdot 10^{-9}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 200000000000:\\ \;\;\;\;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 a) y x)))
   (if (<= t_1 4e-9) t_2 (if (<= t_1 200000000000.0) (+ 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 / a), y, x);
	double tmp;
	if (t_1 <= 4e-9) {
		tmp = t_2;
	} else if (t_1 <= 200000000000.0) {
		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(Float64(z / a), y, x)
	tmp = 0.0
	if (t_1 <= 4e-9)
		tmp = t_2;
	elseif (t_1 <= 200000000000.0)
		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[(z / a), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t$95$1, 4e-9], t$95$2, If[LessEqual[t$95$1, 200000000000.0], N[(y + x), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 4.00000000000000025e-9 or 2e11 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 95.7%

      \[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 68.4

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

   5. Applied rewrites 68.4%

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

   if 4.00000000000000025e-9 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2e11

   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 96.6

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

   5. Applied rewrites 96.6%

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

Alternative 10: 69.1% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 1e-71)
     (* -1.0 (- x))
     (if (<= t_1 2e+73) (+ y x) (* (/ z a) y)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= 1e-71) {
		tmp = -1.0 * -x;
	} else if (t_1 <= 2e+73) {
		tmp = y + x;
	} else {
		tmp = (z / a) * y;
	}
	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 = (z - t) / (a - t)
    if (t_1 <= 1d-71) then
        tmp = (-1.0d0) * -x
    else if (t_1 <= 2d+73) then
        tmp = y + x
    else
        tmp = (z / a) * y
    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 tmp;
	if (t_1 <= 1e-71) {
		tmp = -1.0 * -x;
	} else if (t_1 <= 2e+73) {
		tmp = y + x;
	} else {
		tmp = (z / a) * y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (a - t)
	tmp = 0
	if t_1 <= 1e-71:
		tmp = -1.0 * -x
	elif t_1 <= 2e+73:
		tmp = y + x
	else:
		tmp = (z / a) * y
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if (t_1 <= 1e-71)
		tmp = Float64(-1.0 * Float64(-x));
	elseif (t_1 <= 2e+73)
		tmp = Float64(y + x);
	else
		tmp = Float64(Float64(z / a) * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (z - t) / (a - t);
	tmp = 0.0;
	if (t_1 <= 1e-71)
		tmp = -1.0 * -x;
	elseif (t_1 <= 2e+73)
		tmp = y + x;
	else
		tmp = (z / a) * y;
	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]}, If[LessEqual[t$95$1, 1e-71], N[(-1.0 * (-x)), $MachinePrecision], If[LessEqual[t$95$1, 2e+73], N[(y + x), $MachinePrecision], N[(N[(z / a), $MachinePrecision] * y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 9.9999999999999992e-72

   1. Initial program 97.3%

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

   3. Taylor expanded in x around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. sub-neg N/A

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

      6. mul-1-neg N/A

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

      7. *-commutative N/A

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

      8. associate-/l* N/A

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

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

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

      10. mul-1-neg N/A

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

      11. metadata-eval N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 90.6%

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

   6. Taylor expanded in x around inf

      \[\leadsto \left(-x\right) \cdot -1 \]
   7. Step-by-step derivation

   8. Applied rewrites 59.1%

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

   if 9.9999999999999992e-72 < (/.f64 (-.f64 z t) (-.f64 a t)) < 1.99999999999999997e73

   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 89.5

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

   5. Applied rewrites 89.5%

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

   if 1.99999999999999997e73 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 87.7%

      \[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}{y \cdot \frac{z}{a - t}} \]

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 78.1

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

   5. Applied rewrites 78.1%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 36.1%

      \[\leadsto \frac{z}{a} \cdot y \]
3. Recombined 3 regimes into one program.

4. Final simplification 69.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq 10^{-71}:\\ \;\;\;\;-1 \cdot \left(-x\right)\\ \mathbf{elif}\;\frac{z - t}{a - t} \leq 2 \cdot 10^{+73}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{a} \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 67.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq 1.08 \cdot 10^{-69}:\\ \;\;\;\;-1 \cdot \left(-x\right)\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (/ (- z t) (- a t)) 1.08e-69) (* -1.0 (- x)) (+ y x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z - t) / (a - t)) <= 1.08e-69) {
		tmp = -1.0 * -x;
	} else {
		tmp = y + x;
	}
	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) :: tmp
    if (((z - t) / (a - t)) <= 1.08d-69) then
        tmp = (-1.0d0) * -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 (((z - t) / (a - t)) <= 1.08e-69) {
		tmp = -1.0 * -x;
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if ((z - t) / (a - t)) <= 1.08e-69:
		tmp = -1.0 * -x
	else:
		tmp = y + x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(Float64(z - t) / Float64(a - t)) <= 1.08e-69)
		tmp = Float64(-1.0 * Float64(-x));
	else
		tmp = Float64(y + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((z - t) / (a - t)) <= 1.08e-69)
		tmp = -1.0 * -x;
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 1.0800000000000001e-69

   1. Initial program 97.3%

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

   3. Taylor expanded in x around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. sub-neg N/A

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

      6. mul-1-neg N/A

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

      7. *-commutative N/A

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

      8. associate-/l* N/A

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

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

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

      10. mul-1-neg N/A

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

      11. metadata-eval N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 90.6%

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

   6. Taylor expanded in x around inf

      \[\leadsto \left(-x\right) \cdot -1 \]
   7. Step-by-step derivation

   8. Applied rewrites 59.1%

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

   if 1.0800000000000001e-69 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 97.1%

      \[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 72.9

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

   5. Applied rewrites 72.9%

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

4. Final simplification 66.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq 1.08 \cdot 10^{-69}:\\ \;\;\;\;-1 \cdot \left(-x\right)\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 98.3% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.2%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 97.2

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

   6. lift-/.f64 N/A

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

   7. frac-2neg N/A

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

   8. lower-/.f64 N/A

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

   9. neg-sub0 N/A

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

   10. lift--.f64 N/A

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

   11. sub-neg N/A

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

   12. +-commutative N/A

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

   13. associate--r+ N/A

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

   14. neg-sub0 N/A

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

   15. remove-double-neg N/A

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

   16. lower--.f64 N/A

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

   17. neg-sub0 N/A

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

   18. lift--.f64 N/A

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

   19. sub-neg N/A

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

   20. +-commutative N/A

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

   21. associate--r+ N/A

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

   22. neg-sub0 N/A

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

   23. remove-double-neg N/A

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

   24. lower--.f64 97.2

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

4. Applied rewrites 97.2%

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

Alternative 13: 95.9% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.2%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lift-/.f64 N/A

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

   5. clear-num N/A

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

   6. un-div-inv N/A

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

   7. frac-2neg N/A

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

   8. associate-/r/ N/A

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

   9. lower-fma.f64 N/A

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

4. Applied rewrites 94.9%

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

Alternative 14: 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.2%

   \[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.3

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

5. Applied rewrites 62.3%

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

Developer Target 1: 99.3% 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 2024294 
(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)))))