Numeric.Signal:interpolate from hsignal-0.2.7.1

Percentage Accurate: 79.7% → 94.3%

Time: 8.7s

Alternatives: 14

Speedup: 0.3×

Specification

Math

\[\begin{array}{l} \\ x + \left(y - z\right) \cdot \frac{t - x}{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(y - z) * Float64(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[(y - z), $MachinePrecision] * N[(N[(t - x), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 79.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \left(y - z\right) \cdot \frac{t - x}{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(y - z) * Float64(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[(y - z), $MachinePrecision] * N[(N[(t - x), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 94.3% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (* (- y z) (/ (- t x) (- a z))))))
   (if (or (<= t_1 -2e-243) (not (<= t_1 0.0)))
     (fma (- t x) (/ (- y z) (- a z)) x)
     (- t (* (/ (- t x) z) (- y a))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + ((y - z) * ((t - x) / (a - z)));
	double tmp;
	if ((t_1 <= -2e-243) || !(t_1 <= 0.0)) {
		tmp = fma((t - x), ((y - z) / (a - z)), x);
	} else {
		tmp = t - (((t - x) / z) * (y - a));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(x + Float64(Float64(y - z) * Float64(Float64(t - x) / Float64(a - z))))
	tmp = 0.0
	if ((t_1 <= -2e-243) || !(t_1 <= 0.0))
		tmp = fma(Float64(t - x), Float64(Float64(y - z) / Float64(a - z)), x);
	else
		tmp = Float64(t - Float64(Float64(Float64(t - x) / z) * Float64(y - a)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < -1.99999999999999999e-243 or 0.0 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z))))

   1. Initial program 88.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lift-/.f64 N/A

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

      6. associate-*l/ N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 93.4

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

   4. Applied rewrites 93.4%

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

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

   1. Initial program 3.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lift-/.f64 N/A

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

      6. associate-*l/ N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 6.7

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

   4. Applied rewrites 6.7%

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

   5. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 6.7

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

   7. Applied rewrites 6.7%

      \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{t}{x} - 1\right) \cdot x}, \frac{y - z}{a - z}, 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. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. *-lft-identity N/A

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

      7. associate-+l- N/A

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

      8. div-sub N/A

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

      9. lower--.f64 N/A

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

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

      11. associate-/l* N/A

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

      12. associate-/l* N/A

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

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

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

      14. lower-*.f64 N/A

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

      15. lower-/.f64 N/A

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

      16. lower--.f64 N/A

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

      17. lower--.f64 99.7

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

   10. Applied rewrites 99.7%

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

4. Final simplification 94.4%

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

Alternative 2: 59.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(t - x, \frac{y}{a}, x\right)\\ t_2 := \left(y - z\right) \cdot \frac{t}{a - z}\\ \mathbf{if}\;t \leq -2.7 \cdot 10^{-43}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t \leq -1.18 \cdot 10^{-262}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 8.5 \cdot 10^{-136}:\\ \;\;\;\;\left(t - x\right) \cdot \frac{y}{a - z}\\ \mathbf{elif}\;t \leq 7.5 \cdot 10^{-40}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- t x) (/ y a) x)) (t_2 (* (- y z) (/ t (- a z)))))
   (if (<= t -2.7e-43)
     t_2
     (if (<= t -1.18e-262)
       t_1
       (if (<= t 8.5e-136)
         (* (- t x) (/ y (- a z)))
         (if (<= t 7.5e-40) t_1 t_2))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((t - x), (y / a), x);
	double t_2 = (y - z) * (t / (a - z));
	double tmp;
	if (t <= -2.7e-43) {
		tmp = t_2;
	} else if (t <= -1.18e-262) {
		tmp = t_1;
	} else if (t <= 8.5e-136) {
		tmp = (t - x) * (y / (a - z));
	} else if (t <= 7.5e-40) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(t - x), Float64(y / a), x)
	t_2 = Float64(Float64(y - z) * Float64(t / Float64(a - z)))
	tmp = 0.0
	if (t <= -2.7e-43)
		tmp = t_2;
	elseif (t <= -1.18e-262)
		tmp = t_1;
	elseif (t <= 8.5e-136)
		tmp = Float64(Float64(t - x) * Float64(y / Float64(a - z)));
	elseif (t <= 7.5e-40)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(t - x), $MachinePrecision] * N[(y / a), $MachinePrecision] + x), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y - z), $MachinePrecision] * N[(t / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.7e-43], t$95$2, If[LessEqual[t, -1.18e-262], t$95$1, If[LessEqual[t, 8.5e-136], N[(N[(t - x), $MachinePrecision] * N[(y / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 7.5e-40], t$95$1, t$95$2]]]]]]

Derivation

1. Split input into 3 regimes

2. if t < -2.69999999999999991e-43 or 7.50000000000000069e-40 < t

   1. Initial program 86.4%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 72.9

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

   5. Applied rewrites 72.9%

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

   if -2.69999999999999991e-43 < t < -1.17999999999999994e-262 or 8.49999999999999973e-136 < t < 7.50000000000000069e-40

   1. Initial program 65.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lift-/.f64 N/A

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

      6. associate-*l/ N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 78.2

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

   4. Applied rewrites 78.2%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 56.0

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

   7. Applied rewrites 56.0%

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

   if -1.17999999999999994e-262 < t < 8.49999999999999973e-136

   1. Initial program 59.1%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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.3

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

   5. Applied rewrites 60.3%

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

Alternative 3: 73.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.28 \cdot 10^{+135} \lor \neg \left(a \leq 5.8 \cdot 10^{+102}\right):\\ \;\;\;\;x + \frac{y - z}{a} \cdot \left(t - x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-\left(t - x\right), \frac{y - a}{z}, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -1.28e+135) (not (<= a 5.8e+102)))
   (+ x (* (/ (- y z) a) (- t x)))
   (fma (- (- t x)) (/ (- y a) z) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -1.28e+135) || !(a <= 5.8e+102)) {
		tmp = x + (((y - z) / a) * (t - x));
	} else {
		tmp = fma(-(t - x), ((y - a) / z), t);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -1.28e+135) || !(a <= 5.8e+102))
		tmp = Float64(x + Float64(Float64(Float64(y - z) / a) * Float64(t - x)));
	else
		tmp = fma(Float64(-Float64(t - x)), Float64(Float64(y - a) / z), t);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -1.28e+135], N[Not[LessEqual[a, 5.8e+102]], $MachinePrecision]], N[(x + N[(N[(N[(y - z), $MachinePrecision] / a), $MachinePrecision] * N[(t - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[(t - x), $MachinePrecision]) * N[(N[(y - a), $MachinePrecision] / z), $MachinePrecision] + t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -1.28e135 or 5.8000000000000005e102 < a

   1. Initial program 89.5%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 85.0

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

   5. Applied rewrites 85.0%

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

   if -1.28e135 < a < 5.8000000000000005e102

   1. Initial program 71.7%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

      11. mul-1-neg N/A

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

      12. lower-neg.f64 N/A

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

      13. lower--.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. lower--.f64 79.0

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

   5. Applied rewrites 79.0%

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

4. Final simplification 80.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1.28 \cdot 10^{+135} \lor \neg \left(a \leq 5.8 \cdot 10^{+102}\right):\\ \;\;\;\;x + \frac{y - z}{a} \cdot \left(t - x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-\left(t - x\right), \frac{y - a}{z}, t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 72.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.28 \cdot 10^{+135} \lor \neg \left(a \leq 5.8 \cdot 10^{+102}\right):\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t - x}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-\left(t - x\right), \frac{y - a}{z}, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -1.28e+135) (not (<= a 5.8e+102)))
   (fma (- y z) (/ (- t x) a) x)
   (fma (- (- t x)) (/ (- y a) z) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -1.28e+135) || !(a <= 5.8e+102)) {
		tmp = fma((y - z), ((t - x) / a), x);
	} else {
		tmp = fma(-(t - x), ((y - a) / z), t);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -1.28e+135) || !(a <= 5.8e+102))
		tmp = fma(Float64(y - z), Float64(Float64(t - x) / a), x);
	else
		tmp = fma(Float64(-Float64(t - x)), Float64(Float64(y - a) / z), t);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -1.28e+135], N[Not[LessEqual[a, 5.8e+102]], $MachinePrecision]], N[(N[(y - z), $MachinePrecision] * N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], N[((-N[(t - x), $MachinePrecision]) * N[(N[(y - a), $MachinePrecision] / z), $MachinePrecision] + t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -1.28e135 or 5.8000000000000005e102 < a

   1. Initial program 89.5%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 82.1

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

   5. Applied rewrites 82.1%

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

   if -1.28e135 < a < 5.8000000000000005e102

   1. Initial program 71.7%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

      11. mul-1-neg N/A

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

      12. lower-neg.f64 N/A

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

      13. lower--.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. lower--.f64 79.0

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

   5. Applied rewrites 79.0%

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

4. Final simplification 79.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1.28 \cdot 10^{+135} \lor \neg \left(a \leq 5.8 \cdot 10^{+102}\right):\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t - x}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-\left(t - x\right), \frac{y - a}{z}, t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 71.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.25 \cdot 10^{-17} \lor \neg \left(a \leq 5.8 \cdot 10^{+102}\right):\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t - x}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;t - \frac{\left(y - a\right) \cdot \left(t - x\right)}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -1.25e-17) (not (<= a 5.8e+102)))
   (fma (- y z) (/ (- t x) a) x)
   (- t (/ (* (- y a) (- t x)) z))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -1.25e-17) || !(a <= 5.8e+102)) {
		tmp = fma((y - z), ((t - x) / a), x);
	} else {
		tmp = t - (((y - a) * (t - x)) / z);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -1.25e-17) || !(a <= 5.8e+102))
		tmp = fma(Float64(y - z), Float64(Float64(t - x) / a), x);
	else
		tmp = Float64(t - Float64(Float64(Float64(y - a) * Float64(t - x)) / z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -1.25e-17], N[Not[LessEqual[a, 5.8e+102]], $MachinePrecision]], N[(N[(y - z), $MachinePrecision] * N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], N[(t - N[(N[(N[(y - a), $MachinePrecision] * N[(t - x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -1.25e-17 or 5.8000000000000005e102 < a

   1. Initial program 85.9%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 74.2

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

   5. Applied rewrites 74.2%

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

   if -1.25e-17 < a < 5.8000000000000005e102

   1. Initial program 71.0%

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

   3. Taylor expanded in z around -inf

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

   5. Applied rewrites 65.1%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 78.7%

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

4. Final simplification 77.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1.25 \cdot 10^{-17} \lor \neg \left(a \leq 5.8 \cdot 10^{+102}\right):\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t - x}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;t - \frac{\left(y - a\right) \cdot \left(t - x\right)}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 68.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -9.2 \cdot 10^{-18} \lor \neg \left(a \leq 1.25 \cdot 10^{+102}\right):\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t - x}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;t - \frac{\left(t - x\right) \cdot y}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -9.2e-18) (not (<= a 1.25e+102)))
   (fma (- y z) (/ (- t x) a) x)
   (- t (/ (* (- t x) y) z))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -9.2e-18) || !(a <= 1.25e+102)) {
		tmp = fma((y - z), ((t - x) / a), x);
	} else {
		tmp = t - (((t - x) * y) / z);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -9.2e-18) || !(a <= 1.25e+102))
		tmp = fma(Float64(y - z), Float64(Float64(t - x) / a), x);
	else
		tmp = Float64(t - Float64(Float64(Float64(t - x) * y) / z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -9.2e-18], N[Not[LessEqual[a, 1.25e+102]], $MachinePrecision]], N[(N[(y - z), $MachinePrecision] * N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], N[(t - N[(N[(N[(t - x), $MachinePrecision] * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -9.2000000000000004e-18 or 1.25e102 < a

   1. Initial program 85.9%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 74.2

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

   5. Applied rewrites 74.2%

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

   if -9.2000000000000004e-18 < a < 1.25e102

   1. Initial program 71.0%

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

   3. Taylor expanded in z around -inf

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

   5. Applied rewrites 65.1%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 73.2%

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

4. Final simplification 73.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -9.2 \cdot 10^{-18} \lor \neg \left(a \leq 1.25 \cdot 10^{+102}\right):\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t - x}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;t - \frac{\left(t - x\right) \cdot y}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 63.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -1.28e+135)
   (fma (- y z) (/ t a) x)
   (if (<= a 5.8e+102) (- t (/ (* (- t x) y) z)) (fma (- t x) (/ y a) x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -1.28e+135) {
		tmp = fma((y - z), (t / a), x);
	} else if (a <= 5.8e+102) {
		tmp = t - (((t - x) * y) / z);
	} else {
		tmp = fma((t - x), (y / a), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -1.28e+135)
		tmp = fma(Float64(y - z), Float64(t / a), x);
	elseif (a <= 5.8e+102)
		tmp = Float64(t - Float64(Float64(Float64(t - x) * y) / z));
	else
		tmp = fma(Float64(t - x), Float64(y / a), x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -1.28e135

   1. Initial program 87.8%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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.9

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

   5. Applied rewrites 83.9%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 81.0%

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

   if -1.28e135 < a < 5.8000000000000005e102

   1. Initial program 71.7%

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

   3. Taylor expanded in z around -inf

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

      1. fp-cancel-sign-sub-inv N/A

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

   5. Applied rewrites 60.3%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 69.7%

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

   if 5.8000000000000005e102 < a

   1. Initial program 91.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lift-/.f64 N/A

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

      6. associate-*l/ N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 96.9

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

   4. Applied rewrites 96.9%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 80.1

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

   7. Applied rewrites 80.1%

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

Alternative 8: 59.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -6.2e+48)
   (fma (- y z) (/ t a) x)
   (if (<= a 7.2e-137) (* (- t x) (/ y (- a z))) (fma (- t x) (/ y a) x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -6.2e+48) {
		tmp = fma((y - z), (t / a), x);
	} else if (a <= 7.2e-137) {
		tmp = (t - x) * (y / (a - z));
	} else {
		tmp = fma((t - x), (y / a), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -6.2e+48)
		tmp = fma(Float64(y - z), Float64(t / a), x);
	elseif (a <= 7.2e-137)
		tmp = Float64(Float64(t - x) * Float64(y / Float64(a - z)));
	else
		tmp = fma(Float64(t - x), Float64(y / a), x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -6.20000000000000011e48

   1. Initial program 85.4%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 70.6

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

   5. Applied rewrites 70.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 68.6%

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

   if -6.20000000000000011e48 < a < 7.20000000000000013e-137

   1. Initial program 69.3%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 58.0

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

   5. Applied rewrites 58.0%

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

   if 7.20000000000000013e-137 < a

   1. Initial program 81.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lift-/.f64 N/A

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

      6. associate-*l/ N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 89.0

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

   4. Applied rewrites 89.0%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 56.9

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

   7. Applied rewrites 56.9%

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

Alternative 9: 55.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.9 \cdot 10^{+26} \lor \neg \left(z \leq 1.25 \cdot 10^{+164}\right):\\ \;\;\;\;x + \left(t - x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t - x, \frac{y}{a}, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1.9e+26) (not (<= z 1.25e+164)))
   (+ x (- t x))
   (fma (- t x) (/ y a) x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.9e+26) || !(z <= 1.25e+164)) {
		tmp = x + (t - x);
	} else {
		tmp = fma((t - x), (y / a), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -1.9e+26) || !(z <= 1.25e+164))
		tmp = Float64(x + Float64(t - x));
	else
		tmp = fma(Float64(t - x), Float64(y / a), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -1.9e+26], N[Not[LessEqual[z, 1.25e+164]], $MachinePrecision]], N[(x + N[(t - x), $MachinePrecision]), $MachinePrecision], N[(N[(t - x), $MachinePrecision] * N[(y / a), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.9000000000000001e26 or 1.24999999999999987e164 < z

   1. Initial program 60.8%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 44.8

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

   5. Applied rewrites 44.8%

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

   if -1.9000000000000001e26 < z < 1.24999999999999987e164

   1. Initial program 84.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lift-/.f64 N/A

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

      6. associate-*l/ N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 88.4

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

   4. Applied rewrites 88.4%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 56.9

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

   7. Applied rewrites 56.9%

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

4. Final simplification 52.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.9 \cdot 10^{+26} \lor \neg \left(z \leq 1.25 \cdot 10^{+164}\right):\\ \;\;\;\;x + \left(t - x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t - x, \frac{y}{a}, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 54.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.8 \cdot 10^{+26} \lor \neg \left(z \leq 1.25 \cdot 10^{+164}\right):\\ \;\;\;\;x + \left(t - x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t - x}{a}, y, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1.8e+26) (not (<= z 1.25e+164)))
   (+ x (- t x))
   (fma (/ (- t x) a) y x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.8e+26) || !(z <= 1.25e+164)) {
		tmp = x + (t - x);
	} else {
		tmp = fma(((t - x) / a), y, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -1.8e+26) || !(z <= 1.25e+164))
		tmp = Float64(x + Float64(t - x));
	else
		tmp = fma(Float64(Float64(t - x) / a), y, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -1.8e+26], N[Not[LessEqual[z, 1.25e+164]], $MachinePrecision]], N[(x + N[(t - x), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] * y + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.80000000000000012e26 or 1.24999999999999987e164 < z

   1. Initial program 60.8%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 44.8

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

   5. Applied rewrites 44.8%

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

   if -1.80000000000000012e26 < z < 1.24999999999999987e164

   1. Initial program 84.9%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 55.1

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

   5. Applied rewrites 55.1%

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

4. Final simplification 51.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.8 \cdot 10^{+26} \lor \neg \left(z \leq 1.25 \cdot 10^{+164}\right):\\ \;\;\;\;x + \left(t - x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t - x}{a}, y, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 49.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.8 \cdot 10^{+26} \lor \neg \left(z \leq 3.1 \cdot 10^{+169}\right):\\ \;\;\;\;x + \left(t - x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t}{a}, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1.8e+26) (not (<= z 3.1e+169)))
   (+ x (- t x))
   (fma (- y z) (/ t a) x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.8e+26) || !(z <= 3.1e+169)) {
		tmp = x + (t - x);
	} else {
		tmp = fma((y - z), (t / a), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -1.8e+26) || !(z <= 3.1e+169))
		tmp = Float64(x + Float64(t - x));
	else
		tmp = fma(Float64(y - z), Float64(t / a), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -1.8e+26], N[Not[LessEqual[z, 3.1e+169]], $MachinePrecision]], N[(x + N[(t - x), $MachinePrecision]), $MachinePrecision], N[(N[(y - z), $MachinePrecision] * N[(t / a), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.80000000000000012e26 or 3.1e169 < z

   1. Initial program 59.7%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 44.9

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

   5. Applied rewrites 44.9%

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

   if -1.80000000000000012e26 < z < 3.1e169

   1. Initial program 84.8%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 58.7

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

   5. Applied rewrites 58.7%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 48.9%

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

4. Final simplification 47.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.8 \cdot 10^{+26} \lor \neg \left(z \leq 3.1 \cdot 10^{+169}\right):\\ \;\;\;\;x + \left(t - x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t}{a}, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 37.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.15 \cdot 10^{+24} \lor \neg \left(z \leq 2.75 \cdot 10^{+32}\right):\\ \;\;\;\;x + \left(t - x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(t - x\right) \cdot \frac{y}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1.15e+24) (not (<= z 2.75e+32)))
   (+ x (- t x))
   (* (- t x) (/ y a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.15e+24) || !(z <= 2.75e+32)) {
		tmp = x + (t - x);
	} else {
		tmp = (t - x) * (y / a);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((z <= (-1.15d+24)) .or. (.not. (z <= 2.75d+32))) then
        tmp = x + (t - x)
    else
        tmp = (t - x) * (y / a)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.15e+24) || !(z <= 2.75e+32)) {
		tmp = x + (t - x);
	} else {
		tmp = (t - x) * (y / a);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -1.15e+24) or not (z <= 2.75e+32):
		tmp = x + (t - x)
	else:
		tmp = (t - x) * (y / a)
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -1.15e+24) || !(z <= 2.75e+32))
		tmp = Float64(x + Float64(t - x));
	else
		tmp = Float64(Float64(t - x) * Float64(y / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -1.15e+24) || ~((z <= 2.75e+32)))
		tmp = x + (t - x);
	else
		tmp = (t - x) * (y / a);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -1.15e+24], N[Not[LessEqual[z, 2.75e+32]], $MachinePrecision]], N[(x + N[(t - x), $MachinePrecision]), $MachinePrecision], N[(N[(t - x), $MachinePrecision] * N[(y / a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.15e24 or 2.74999999999999992e32 < z

   1. Initial program 64.1%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 40.4

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

   5. Applied rewrites 40.4%

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

   if -1.15e24 < z < 2.74999999999999992e32

   1. Initial program 87.6%

      \[x + \left(y - z\right) \cdot \frac{t - x}{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 64.0

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

   5. Applied rewrites 64.0%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 42.1%

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

   9. Taylor expanded in y around inf

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

   11. Applied rewrites 36.3%

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

4. Final simplification 38.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.15 \cdot 10^{+24} \lor \neg \left(z \leq 2.75 \cdot 10^{+32}\right):\\ \;\;\;\;x + \left(t - x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(t - x\right) \cdot \frac{y}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 19.3% accurate, 4.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 76.3%

   \[x + \left(y - z\right) \cdot \frac{t - x}{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 23.2

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

5. Applied rewrites 23.2%

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

Alternative 14: 2.8% accurate, 4.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 76.3%

   \[x + \left(y - z\right) \cdot \frac{t - x}{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 23.2

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

5. Applied rewrites 23.2%

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

6. Taylor expanded in x around inf

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

8. Applied rewrites 2.7%

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

Reproduce

herbie shell --seed 2024320 
(FPCore (x y z t a)
  :name "Numeric.Signal:interpolate   from hsignal-0.2.7.1"
  :precision binary64
  (+ x (* (- y z) (/ (- t x) (- a z)))))