Graphics.Rendering.Chart.Axis.Types:invLinMap from Chart-1.5.3

Percentage Accurate: 67.6% → 88.3%

Time: 11.5s

Alternatives: 19

Speedup: 0.8×

Specification

Math

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

FPCore

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

C

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

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 - x)) / (a - z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 67.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 - x)) / (a - z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 88.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x - \frac{z - y}{\frac{z - a}{x - t}}\\ t_2 := x - \frac{\left(x - t\right) \cdot \left(z - y\right)}{z - a}\\ \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-255}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_2 \leq 0:\\ \;\;\;\;t - \left(y - a\right) \cdot \frac{t - x}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- x (/ (- z y) (/ (- z a) (- x t)))))
        (t_2 (- x (/ (* (- x t) (- z y)) (- z a)))))
   (if (<= t_2 (- INFINITY))
     t_1
     (if (<= t_2 -1e-255)
       t_2
       (if (<= t_2 0.0) (- t (* (- y a) (/ (- t x) z))) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x - ((z - y) / ((z - a) / (x - t)));
	double t_2 = x - (((x - t) * (z - y)) / (z - a));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_2 <= -1e-255) {
		tmp = t_2;
	} else if (t_2 <= 0.0) {
		tmp = t - ((y - a) * ((t - x) / z));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x - ((z - y) / ((z - a) / (x - t)));
	double t_2 = x - (((x - t) * (z - y)) / (z - a));
	double tmp;
	if (t_2 <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if (t_2 <= -1e-255) {
		tmp = t_2;
	} else if (t_2 <= 0.0) {
		tmp = t - ((y - a) * ((t - x) / z));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = x - ((z - y) / ((z - a) / (x - t)))
	t_2 = x - (((x - t) * (z - y)) / (z - a))
	tmp = 0
	if t_2 <= -math.inf:
		tmp = t_1
	elif t_2 <= -1e-255:
		tmp = t_2
	elif t_2 <= 0.0:
		tmp = t - ((y - a) * ((t - x) / z))
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x (/.f64 (*.f64 (-.f64 y z) (-.f64 t x)) (-.f64 a z))) < -inf.0 or 0.0 < (+.f64 x (/.f64 (*.f64 (-.f64 y z) (-.f64 t x)) (-.f64 a z)))

   1. Initial program 68.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 90.6

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

   4. Applied rewrites 90.6%

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

   if -inf.0 < (+.f64 x (/.f64 (*.f64 (-.f64 y z) (-.f64 t x)) (-.f64 a z))) < -1e-255

   1. Initial program 97.2%

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

   if -1e-255 < (+.f64 x (/.f64 (*.f64 (-.f64 y z) (-.f64 t x)) (-.f64 a z))) < 0.0

   1. Initial program 8.8%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. distribute-lft-out-- N/A

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

      3. div-sub N/A

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

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. lower--.f64 N/A

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

      7. div-sub N/A

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

      8. associate-/l* N/A

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

      9. associate-/l* N/A

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

      10. distribute-rgt-out-- N/A

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

      11. lower-*.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower--.f64 N/A

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

      14. lower--.f64 99.8

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

   5. Applied rewrites 99.8%

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

4. Final simplification 93.0%

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

Alternative 2: 33.0% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* y x) z)) (t_2 (fma x (/ z a) x)))
   (if (<= a -3.3e+28)
     t_2
     (if (<= a -2e-139)
       t_1
       (if (<= a 1.28e-259) (+ (- t x) x) (if (<= a 0.06) t_1 t_2))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * x) / z;
	double t_2 = fma(x, (z / a), x);
	double tmp;
	if (a <= -3.3e+28) {
		tmp = t_2;
	} else if (a <= -2e-139) {
		tmp = t_1;
	} else if (a <= 1.28e-259) {
		tmp = (t - x) + x;
	} else if (a <= 0.06) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y * x) / z)
	t_2 = fma(x, Float64(z / a), x)
	tmp = 0.0
	if (a <= -3.3e+28)
		tmp = t_2;
	elseif (a <= -2e-139)
		tmp = t_1;
	elseif (a <= 1.28e-259)
		tmp = Float64(Float64(t - x) + x);
	elseif (a <= 0.06)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -3.3e28 or 0.059999999999999998 < a

   1. Initial program 70.9%

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

   3. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. mul-1-neg N/A

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

      4. distribute-lft-neg-out N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. associate-/l* N/A

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

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

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

      10. mul-1-neg N/A

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

      11. *-lft-identity N/A

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

      12. lower-fma.f64 N/A

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

      13. mul-1-neg N/A

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

      14. sub-neg N/A

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

      15. +-commutative N/A

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

      16. distribute-neg-in N/A

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

      17. unsub-neg N/A

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

      18. remove-double-neg N/A

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

      19. lower--.f64 N/A

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

      20. lower-/.f64 N/A

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

      21. lower--.f64 56.0

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

   5. Applied rewrites 56.0%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 49.1%

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

   9. Taylor expanded in z around 0

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

   11. Applied rewrites 47.9%

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

   if -3.3e28 < a < -2.00000000000000006e-139 or 1.27999999999999998e-259 < a < 0.059999999999999998

   1. Initial program 71.5%

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

   3. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. mul-1-neg N/A

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

      4. distribute-lft-neg-out N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. associate-/l* N/A

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

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

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

      10. mul-1-neg N/A

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

      11. *-lft-identity N/A

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

      12. lower-fma.f64 N/A

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

      13. mul-1-neg N/A

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

      14. sub-neg N/A

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

      15. +-commutative N/A

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

      16. distribute-neg-in N/A

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

      17. unsub-neg N/A

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

      18. remove-double-neg N/A

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

      19. lower--.f64 N/A

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

      20. lower-/.f64 N/A

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

      21. lower--.f64 46.1

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

   5. Applied rewrites 46.1%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 46.7%

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

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 37.9%

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

   if -2.00000000000000006e-139 < a < 1.27999999999999998e-259

   1. Initial program 75.7%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 48.2

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

   5. Applied rewrites 48.2%

      \[\leadsto x + \color{blue}{\left(t - x\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 44.5%

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

Alternative 3: 64.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- y z) (/ (- t x) a) x)))
   (if (<= a -1.12e-115)
     t_1
     (if (<= a -2.45e-306)
       (* (/ (- z y) z) t)
       (if (<= a 3e-11) (* (/ y (- z a)) (- x t)) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((y - z), ((t - x) / a), x);
	double tmp;
	if (a <= -1.12e-115) {
		tmp = t_1;
	} else if (a <= -2.45e-306) {
		tmp = ((z - y) / z) * t;
	} else if (a <= 3e-11) {
		tmp = (y / (z - a)) * (x - t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(y - z), Float64(Float64(t - x) / a), x)
	tmp = 0.0
	if (a <= -1.12e-115)
		tmp = t_1;
	elseif (a <= -2.45e-306)
		tmp = Float64(Float64(Float64(z - y) / z) * t);
	elseif (a <= 3e-11)
		tmp = Float64(Float64(y / Float64(z - a)) * Float64(x - t));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y - z), $MachinePrecision] * N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[a, -1.12e-115], t$95$1, If[LessEqual[a, -2.45e-306], N[(N[(N[(z - y), $MachinePrecision] / z), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[a, 3e-11], N[(N[(y / N[(z - a), $MachinePrecision]), $MachinePrecision] * N[(x - t), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if a < -1.1199999999999999e-115 or 3e-11 < a

   1. Initial program 71.8%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 77.7

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

   5. Applied rewrites 77.7%

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

   if -1.1199999999999999e-115 < a < -2.45000000000000012e-306

   1. Initial program 71.4%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 71.3

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

   5. Applied rewrites 71.3%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 81.6%

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

   if -2.45000000000000012e-306 < a < 3e-11

   1. Initial program 72.2%

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

   3. Taylor expanded in y around inf

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

      1. div-sub N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 60.2

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

   5. Applied rewrites 60.2%

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

4. Final simplification 73.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1.12 \cdot 10^{-115}:\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t - x}{a}, x\right)\\ \mathbf{elif}\;a \leq -2.45 \cdot 10^{-306}:\\ \;\;\;\;\frac{z - y}{z} \cdot t\\ \mathbf{elif}\;a \leq 3 \cdot 10^{-11}:\\ \;\;\;\;\frac{y}{z - a} \cdot \left(x - t\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t - x}{a}, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 60.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ (- t x) a) y x)))
   (if (<= a -6400000.0)
     t_1
     (if (<= a -2.45e-306)
       (* (/ (- z y) z) t)
       (if (<= a 2.85e-11) (* (/ y (- z a)) (- x t)) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(((t - x) / a), y, x);
	double tmp;
	if (a <= -6400000.0) {
		tmp = t_1;
	} else if (a <= -2.45e-306) {
		tmp = ((z - y) / z) * t;
	} else if (a <= 2.85e-11) {
		tmp = (y / (z - a)) * (x - t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(Float64(t - x) / a), y, x)
	tmp = 0.0
	if (a <= -6400000.0)
		tmp = t_1;
	elseif (a <= -2.45e-306)
		tmp = Float64(Float64(Float64(z - y) / z) * t);
	elseif (a <= 2.85e-11)
		tmp = Float64(Float64(y / Float64(z - a)) * Float64(x - t));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -6.4e6 or 2.8499999999999999e-11 < a

   1. Initial program 71.8%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 75.4

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

   5. Applied rewrites 75.4%

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

   if -6.4e6 < a < -2.45000000000000012e-306

   1. Initial program 71.6%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 60.6

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

   5. Applied rewrites 60.6%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 65.4%

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

   if -2.45000000000000012e-306 < a < 2.8499999999999999e-11

   1. Initial program 72.2%

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

   3. Taylor expanded in y around inf

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

      1. div-sub N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 60.2

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

   5. Applied rewrites 60.2%

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

4. Final simplification 69.2%

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

Alternative 5: 82.6% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- t (* (- y a) (/ (- t x) z)))))
   (if (<= z -2.05e+127)
     t_1
     (if (<= z 3e+86) (- x (/ (* (- x t) (- z y)) (- z a))) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = t - ((y - a) * ((t - x) / z));
	double tmp;
	if (z <= -2.05e+127) {
		tmp = t_1;
	} else if (z <= 3e+86) {
		tmp = x - (((x - t) * (z - y)) / (z - a));
	} 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 = t - ((y - a) * ((t - x) / z))
    if (z <= (-2.05d+127)) then
        tmp = t_1
    else if (z <= 3d+86) then
        tmp = x - (((x - t) * (z - y)) / (z - a))
    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 = t - ((y - a) * ((t - x) / z));
	double tmp;
	if (z <= -2.05e+127) {
		tmp = t_1;
	} else if (z <= 3e+86) {
		tmp = x - (((x - t) * (z - y)) / (z - a));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = t - ((y - a) * ((t - x) / z))
	tmp = 0
	if z <= -2.05e+127:
		tmp = t_1
	elif z <= 3e+86:
		tmp = x - (((x - t) * (z - y)) / (z - a))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(t - Float64(Float64(y - a) * Float64(Float64(t - x) / z)))
	tmp = 0.0
	if (z <= -2.05e+127)
		tmp = t_1;
	elseif (z <= 3e+86)
		tmp = Float64(x - Float64(Float64(Float64(x - t) * Float64(z - y)) / Float64(z - a)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = t - ((y - a) * ((t - x) / z));
	tmp = 0.0;
	if (z <= -2.05e+127)
		tmp = t_1;
	elseif (z <= 3e+86)
		tmp = x - (((x - t) * (z - y)) / (z - a));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.04999999999999991e127 or 2.99999999999999977e86 < z

   1. Initial program 35.8%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. distribute-lft-out-- N/A

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

      3. div-sub N/A

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

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. lower--.f64 N/A

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

      7. div-sub N/A

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

      8. associate-/l* N/A

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

      9. associate-/l* N/A

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

      10. distribute-rgt-out-- N/A

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

      11. lower-*.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower--.f64 N/A

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

      14. lower--.f64 80.1

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

   5. Applied rewrites 80.1%

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

   if -2.04999999999999991e127 < z < 2.99999999999999977e86

   1. Initial program 86.2%

      \[x + \frac{\left(y - z\right) \cdot \left(t - x\right)}{a - z} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 84.5%

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

Alternative 6: 73.6% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -75000000000.0)
   (fma (- y z) (/ (- t x) a) x)
   (if (<= a 5.7e-11)
     (- t (/ (* (- y a) (- t x)) z))
     (+ (* (/ (- z y) a) (- x t)) x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -75000000000.0) {
		tmp = fma((y - z), ((t - x) / a), x);
	} else if (a <= 5.7e-11) {
		tmp = t - (((y - a) * (t - x)) / z);
	} else {
		tmp = (((z - y) / a) * (x - t)) + x;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -75000000000.0)
		tmp = fma(Float64(y - z), Float64(Float64(t - x) / a), x);
	elseif (a <= 5.7e-11)
		tmp = Float64(t - Float64(Float64(Float64(y - a) * Float64(t - x)) / z));
	else
		tmp = Float64(Float64(Float64(Float64(z - y) / a) * Float64(x - t)) + x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -7.5e10

   1. Initial program 77.0%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 85.1

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

   5. Applied rewrites 85.1%

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

   if -7.5e10 < a < 5.6999999999999997e-11

   1. Initial program 71.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 73.2

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

   4. Applied rewrites 73.2%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 32.3

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

   7. Applied rewrites 32.3%

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

   8. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r/ N/A

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

      4. mul-1-neg N/A

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

      5. div-sub N/A

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

      6. mul-1-neg N/A

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

      7. distribute-lft-out-- N/A

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

      8. associate-*r/ N/A

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

      9. mul-1-neg N/A

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

      10. unsub-neg N/A

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

      11. lower--.f64 N/A

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

      12. lower-/.f64 N/A

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

   10. Applied rewrites 79.7%

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

   if 5.6999999999999997e-11 < a

   1. Initial program 66.5%

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

   3. Taylor expanded in a around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower--.f64 83.8

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

   5. Applied rewrites 83.8%

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

4. Final simplification 82.1%

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

Alternative 7: 73.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- y z) (/ (- t x) a) x)))
   (if (<= a -75000000000.0)
     t_1
     (if (<= a 5.7e-11) (- t (/ (* (- y a) (- t x)) z)) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -7.5e10 or 5.6999999999999997e-11 < a

   1. Initial program 71.8%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 83.8

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

   5. Applied rewrites 83.8%

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

   if -7.5e10 < a < 5.6999999999999997e-11

   1. Initial program 71.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 73.2

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

   4. Applied rewrites 73.2%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 32.3

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

   7. Applied rewrites 32.3%

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

   8. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r/ N/A

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

      4. mul-1-neg N/A

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

      5. div-sub N/A

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

      6. mul-1-neg N/A

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

      7. distribute-lft-out-- N/A

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

      8. associate-*r/ N/A

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

      9. mul-1-neg N/A

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

      10. unsub-neg N/A

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

      11. lower--.f64 N/A

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

      12. lower-/.f64 N/A

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

   10. Applied rewrites 79.7%

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

4. Final simplification 81.8%

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

Alternative 8: 75.1% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- y z) (/ (- t x) a) x)))
   (if (<= a -75000000000.0)
     t_1
     (if (<= a 6e-11) (- t (* (- y a) (/ (- t x) z))) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -7.5e10 or 6e-11 < a

   1. Initial program 71.8%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 83.8

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

   5. Applied rewrites 83.8%

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

   if -7.5e10 < a < 6e-11

   1. Initial program 71.9%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. distribute-lft-out-- N/A

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

      3. div-sub N/A

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

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. lower--.f64 N/A

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

      7. div-sub N/A

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

      8. associate-/l* N/A

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

      9. associate-/l* N/A

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

      10. distribute-rgt-out-- N/A

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

      11. lower-*.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower--.f64 N/A

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

      14. lower--.f64 79.6

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

   5. Applied rewrites 79.6%

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

4. Final simplification 81.8%

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

Alternative 9: 65.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- y z) (/ (- t x) a) x)))
   (if (<= a -4.2e-56)
     t_1
     (if (<= a 3.2e-74) (fma (/ (- z y) z) (- t x) x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((y - z), ((t - x) / a), x);
	double tmp;
	if (a <= -4.2e-56) {
		tmp = t_1;
	} else if (a <= 3.2e-74) {
		tmp = fma(((z - y) / z), (t - x), x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(y - z), Float64(Float64(t - x) / a), x)
	tmp = 0.0
	if (a <= -4.2e-56)
		tmp = t_1;
	elseif (a <= 3.2e-74)
		tmp = fma(Float64(Float64(z - y) / z), Float64(t - x), x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -4.20000000000000012e-56 or 3.1999999999999999e-74 < a

   1. Initial program 70.1%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 77.1

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

   5. Applied rewrites 77.1%

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

   if -4.20000000000000012e-56 < a < 3.1999999999999999e-74

   1. Initial program 74.6%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. lower-fma.f64 N/A

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

      7. distribute-neg-frac N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. mul-1-neg N/A

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

      11. sub-neg N/A

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

      12. +-commutative N/A

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

      13. distribute-neg-in N/A

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

      14. unsub-neg N/A

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

      15. remove-double-neg N/A

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

      16. lower--.f64 N/A

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

      17. lower--.f64 69.5

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

   5. Applied rewrites 69.5%

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

Alternative 10: 62.7% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (/ t (- z a)) (- z y))))
   (if (<= t -6.5e-44)
     t_1
     (if (<= t 2.4e+30) (fma (- z y) (/ x (- a z)) x) t_1))))

C

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

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(t / Float64(z - a)) * Float64(z - y))
	tmp = 0.0
	if (t <= -6.5e-44)
		tmp = t_1;
	elseif (t <= 2.4e+30)
		tmp = fma(Float64(z - y), Float64(x / Float64(a - z)), x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -6.5e-44 or 2.3999999999999999e30 < t

   1. Initial program 67.6%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 75.7

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

   5. Applied rewrites 75.7%

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

   if -6.5e-44 < t < 2.3999999999999999e30

   1. Initial program 76.4%

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

   3. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. mul-1-neg N/A

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

      4. distribute-lft-neg-out N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. associate-/l* N/A

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

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

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

      10. mul-1-neg N/A

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

      11. *-lft-identity N/A

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

      12. lower-fma.f64 N/A

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

      13. mul-1-neg N/A

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

      14. sub-neg N/A

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

      15. +-commutative N/A

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

      16. distribute-neg-in N/A

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

      17. unsub-neg N/A

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

      18. remove-double-neg N/A

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

      19. lower--.f64 N/A

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

      20. lower-/.f64 N/A

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

      21. lower--.f64 70.8

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

   5. Applied rewrites 70.8%

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

4. Final simplification 73.3%

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

Alternative 11: 59.4% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -6.80000000000000033e-44 or 3.30000000000000026e30 < t

   1. Initial program 67.6%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 75.7

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

   5. Applied rewrites 75.7%

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

   if -6.80000000000000033e-44 < t < 3.30000000000000026e30

   1. Initial program 76.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 59.2

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

   5. Applied rewrites 59.2%

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

4. Final simplification 67.7%

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

Alternative 12: 59.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ (- t x) a) y x)))
   (if (<= a -6400000.0) t_1 (if (<= a 3.25e-74) (* (/ (- z y) z) t) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(((t - x) / a), y, x);
	double tmp;
	if (a <= -6400000.0) {
		tmp = t_1;
	} else if (a <= 3.25e-74) {
		tmp = ((z - y) / z) * t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(Float64(t - x) / a), y, x)
	tmp = 0.0
	if (a <= -6400000.0)
		tmp = t_1;
	elseif (a <= 3.25e-74)
		tmp = Float64(Float64(Float64(z - y) / z) * t);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -6.4e6 or 3.2500000000000001e-74 < a

   1. Initial program 71.1%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 72.3

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

   5. Applied rewrites 72.3%

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

   if -6.4e6 < a < 3.2500000000000001e-74

   1. Initial program 72.8%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 56.4

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

   5. Applied rewrites 56.4%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 60.4%

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

4. Final simplification 67.3%

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

Alternative 13: 60.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (/ z (- z a)) t)))
   (if (<= z -2.1e+174) t_1 (if (<= z 8.6e+116) (fma (/ (- t x) a) y x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z / (z - a)) * t;
	double tmp;
	if (z <= -2.1e+174) {
		tmp = t_1;
	} else if (z <= 8.6e+116) {
		tmp = fma(((t - x) / a), y, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.10000000000000017e174 or 8.6e116 < z

   1. Initial program 35.3%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 59.6

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

   5. Applied rewrites 59.6%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 63.9%

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

   if -2.10000000000000017e174 < z < 8.6e116

   1. Initial program 82.8%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 67.1

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

   5. Applied rewrites 67.1%

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

4. Final simplification 66.4%

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

Alternative 14: 55.3% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ (- t x) x)))
   (if (<= z -2.2e+174) t_1 (if (<= z 5e+140) (fma (/ (- t x) a) y x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (t - x) + x;
	double tmp;
	if (z <= -2.2e+174) {
		tmp = t_1;
	} else if (z <= 5e+140) {
		tmp = fma(((t - x) / a), y, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(t - x) + x)
	tmp = 0.0
	if (z <= -2.2e+174)
		tmp = t_1;
	elseif (z <= 5e+140)
		tmp = fma(Float64(Float64(t - x) / a), y, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.2000000000000002e174 or 5.00000000000000008e140 < z

   1. Initial program 35.8%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 51.7

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

   5. Applied rewrites 51.7%

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

   if -2.2000000000000002e174 < z < 5.00000000000000008e140

   1. Initial program 81.0%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 65.9

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

   5. Applied rewrites 65.9%

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

4. Final simplification 63.0%

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

Alternative 15: 48.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ (- t x) x)))
   (if (<= z -2.4e+174) t_1 (if (<= z 4.5e+140) (+ (* (/ y a) t) x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (t - x) + x;
	double tmp;
	if (z <= -2.4e+174) {
		tmp = t_1;
	} else if (z <= 4.5e+140) {
		tmp = ((y / a) * t) + x;
	} 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 = (t - x) + x
    if (z <= (-2.4d+174)) then
        tmp = t_1
    else if (z <= 4.5d+140) then
        tmp = ((y / a) * t) + x
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (t - x) + x;
	double tmp;
	if (z <= -2.4e+174) {
		tmp = t_1;
	} else if (z <= 4.5e+140) {
		tmp = ((y / a) * t) + x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (t - x) + x
	tmp = 0
	if z <= -2.4e+174:
		tmp = t_1
	elif z <= 4.5e+140:
		tmp = ((y / a) * t) + x
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(t - x) + x)
	tmp = 0.0
	if (z <= -2.4e+174)
		tmp = t_1;
	elseif (z <= 4.5e+140)
		tmp = Float64(Float64(Float64(y / a) * t) + x);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (t - x) + x;
	tmp = 0.0;
	if (z <= -2.4e+174)
		tmp = t_1;
	elseif (z <= 4.5e+140)
		tmp = ((y / a) * t) + x;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.3999999999999998e174 or 4.5000000000000002e140 < z

   1. Initial program 35.8%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 51.7

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

   5. Applied rewrites 51.7%

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

   if -2.3999999999999998e174 < z < 4.5000000000000002e140

   1. Initial program 81.0%

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

   3. Taylor expanded in a around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower--.f64 70.5

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

   5. Applied rewrites 70.5%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 53.8%

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

   9. Taylor expanded in y around inf

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

   11. Applied rewrites 56.2%

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

4. Final simplification 55.3%

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

Alternative 16: 47.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ (- t x) x)))
   (if (<= z -2.2e+174) t_1 (if (<= z 4.5e+140) (fma (/ t a) y x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (t - x) + x;
	double tmp;
	if (z <= -2.2e+174) {
		tmp = t_1;
	} else if (z <= 4.5e+140) {
		tmp = fma((t / a), y, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(t - x) + x)
	tmp = 0.0
	if (z <= -2.2e+174)
		tmp = t_1;
	elseif (z <= 4.5e+140)
		tmp = fma(Float64(t / a), y, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.2000000000000002e174 or 4.5000000000000002e140 < z

   1. Initial program 35.8%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 51.7

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

   5. Applied rewrites 51.7%

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

   if -2.2000000000000002e174 < z < 4.5000000000000002e140

   1. Initial program 81.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 89.2

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

   4. Applied rewrites 89.2%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 65.9

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

   7. Applied rewrites 65.9%

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

   8. Taylor expanded in t around inf

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

   10. Applied rewrites 55.2%

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

4. Final simplification 54.5%

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

Alternative 17: 28.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ (- t x) x)))
   (if (<= z -1.22e+160) t_1 (if (<= z 4e+55) (* (/ y a) t) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (t - x) + x;
	double tmp;
	if (z <= -1.22e+160) {
		tmp = t_1;
	} else if (z <= 4e+55) {
		tmp = (y / 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 = (t - x) + x
    if (z <= (-1.22d+160)) then
        tmp = t_1
    else if (z <= 4d+55) then
        tmp = (y / a) * t
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (t - x) + x;
	double tmp;
	if (z <= -1.22e+160) {
		tmp = t_1;
	} else if (z <= 4e+55) {
		tmp = (y / a) * t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (t - x) + x
	tmp = 0
	if z <= -1.22e+160:
		tmp = t_1
	elif z <= 4e+55:
		tmp = (y / a) * t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(t - x) + x)
	tmp = 0.0
	if (z <= -1.22e+160)
		tmp = t_1;
	elseif (z <= 4e+55)
		tmp = Float64(Float64(y / a) * t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (t - x) + x;
	tmp = 0.0;
	if (z <= -1.22e+160)
		tmp = t_1;
	elseif (z <= 4e+55)
		tmp = (y / a) * t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.22e160 or 4.00000000000000004e55 < z

   1. Initial program 40.3%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 42.0

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

   5. Applied rewrites 42.0%

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

   if -1.22e160 < z < 4.00000000000000004e55

   1. Initial program 85.2%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 40.3

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

   5. Applied rewrites 40.3%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 31.5%

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

   9. Taylor expanded in z around 0

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

   11. Applied rewrites 28.5%

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

4. Final simplification 32.5%

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

Alternative 18: 18.7% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ \left(t - x\right) + x \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.8%

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

3. Taylor expanded in z around inf

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

   1. lower--.f64 18.6

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

5. Applied rewrites 18.6%

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

6. Final simplification 18.6%

   \[\leadsto \left(t - x\right) + x \]
7. Add Preprocessing

Alternative 19: 2.8% accurate, 29.0× speedup

Math

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

FPCore

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

C

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

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 = 0.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.8%

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

3. Taylor expanded in x around inf

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

   1. +-commutative N/A

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

   2. distribute-rgt-in N/A

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

   3. mul-1-neg N/A

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

   4. distribute-lft-neg-out N/A

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

   5. *-commutative N/A

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

   6. associate-/l* N/A

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

   7. *-commutative N/A

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

   8. associate-/l* N/A

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

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

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

   10. mul-1-neg N/A

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

   11. *-lft-identity N/A

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

   12. lower-fma.f64 N/A

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

   13. mul-1-neg N/A

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

   14. sub-neg N/A

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

   15. +-commutative N/A

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

   16. distribute-neg-in N/A

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

   17. unsub-neg N/A

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

   18. remove-double-neg N/A

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

   19. lower--.f64 N/A

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

   20. lower-/.f64 N/A

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

   21. lower--.f64 47.4

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

5. Applied rewrites 47.4%

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

6. Taylor expanded in z around inf

   \[\leadsto x + \color{blue}{-1 \cdot x} \]
7. Step-by-step derivation

8. Applied rewrites 2.6%

   \[\leadsto 0 \]
9. Add Preprocessing

Developer Target 1: 83.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := t - \frac{y}{z} \cdot \left(t - x\right)\\ \mathbf{if}\;z < -1.2536131056095036 \cdot 10^{+188}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z < 4.446702369113811 \cdot 10^{+64}:\\ \;\;\;\;x + \frac{y - z}{\frac{a - z}{t - x}}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- t (* (/ y z) (- t x)))))
   (if (< z -1.2536131056095036e+188)
     t_1
     (if (< z 4.446702369113811e+64)
       (+ x (/ (- y z) (/ (- a z) (- t x))))
       t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = t - ((y / z) * (t - x));
	double tmp;
	if (z < -1.2536131056095036e+188) {
		tmp = t_1;
	} else if (z < 4.446702369113811e+64) {
		tmp = x + ((y - z) / ((a - z) / (t - x)));
	} 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 = t - ((y / z) * (t - x))
    if (z < (-1.2536131056095036d+188)) then
        tmp = t_1
    else if (z < 4.446702369113811d+64) then
        tmp = x + ((y - z) / ((a - z) / (t - x)))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = t - ((y / z) * (t - x));
	double tmp;
	if (z < -1.2536131056095036e+188) {
		tmp = t_1;
	} else if (z < 4.446702369113811e+64) {
		tmp = x + ((y - z) / ((a - z) / (t - x)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = t - ((y / z) * (t - x))
	tmp = 0
	if z < -1.2536131056095036e+188:
		tmp = t_1
	elif z < 4.446702369113811e+64:
		tmp = x + ((y - z) / ((a - z) / (t - x)))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(t - Float64(Float64(y / z) * Float64(t - x)))
	tmp = 0.0
	if (z < -1.2536131056095036e+188)
		tmp = t_1;
	elseif (z < 4.446702369113811e+64)
		tmp = Float64(x + Float64(Float64(y - z) / Float64(Float64(a - z) / Float64(t - x))));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = t - ((y / z) * (t - x));
	tmp = 0.0;
	if (z < -1.2536131056095036e+188)
		tmp = t_1;
	elseif (z < 4.446702369113811e+64)
		tmp = x + ((y - z) / ((a - z) / (t - x)));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t - N[(N[(y / z), $MachinePrecision] * N[(t - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[z, -1.2536131056095036e+188], t$95$1, If[Less[z, 4.446702369113811e+64], N[(x + N[(N[(y - z), $MachinePrecision] / N[(N[(a - z), $MachinePrecision] / N[(t - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Reproduce

herbie shell --seed 2024235 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Chart.Axis.Types:invLinMap from Chart-1.5.3"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z -125361310560950360000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- t (* (/ y z) (- t x))) (if (< z 44467023691138110000000000000000000000000000000000000000000000000) (+ x (/ (- y z) (/ (- a z) (- t x)))) (- t (* (/ y z) (- t x))))))

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