Optimisation.CirclePacking:place from circle-packing-0.1.0.4, F

Percentage Accurate: 92.9% → 97.4%

Time: 6.6s

Alternatives: 10

Speedup: 1.1×

• 25.6% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x - ((y * (z - t)) / a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 92.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x - ((y * (z - t)) / a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.4% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 93.3%

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

3. Taylor expanded in x around 0

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

   1. *-lft-identity N/A

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

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

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

   3. metadata-eval N/A

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

   4. +-commutative N/A

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

   5. mul-1-neg N/A

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

   6. *-commutative N/A

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

   7. associate-/l* N/A

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

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

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

   9. lower-fma.f64 N/A

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

5. Applied rewrites 97.7%

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

Alternative 2: 85.7% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* y (- z t)) a)))
   (if (or (<= t_1 -1e+134) (not (<= t_1 1.9e+72)))
     (* (- t z) (/ y a))
     (fma (- y) (/ z a) x))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -9.99999999999999921e133 or 1.90000000000000003e72 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 87.0%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

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

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

      5. lower-*.f64 N/A

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

      6. *-lft-identity N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. distribute-neg-in N/A

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

      11. mul-1-neg N/A

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

      12. remove-double-neg N/A

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

      13. mul-1-neg N/A

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

      14. *-commutative N/A

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

      15. fp-cancel-sign-sub N/A

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

      16. mul-1-neg N/A

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

      17. *-commutative N/A

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

      18. associate-*l* N/A

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

      19. metadata-eval N/A

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

      20. *-rgt-identity N/A

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

      21. lower--.f64 N/A

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

      22. lower-/.f64 87.8

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

   5. Applied rewrites 87.8%

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

   if -9.99999999999999921e133 < (/.f64 (*.f64 y (-.f64 z t)) a) < 1.90000000000000003e72

   1. Initial program 99.9%

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

   3. Taylor expanded in t around 0

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

      1. *-lft-identity N/A

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

      2. metadata-eval N/A

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

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

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. associate-*r* N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower-/.f64 86.4

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

   5. Applied rewrites 86.4%

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

4. Final simplification 87.1%

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

Alternative 3: 86.2% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -5.00000000000000008e115 or 5e128 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 87.0%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

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

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

      5. lower-*.f64 N/A

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

      6. *-lft-identity N/A

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

      7. metadata-eval N/A

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

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

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

      9. +-commutative N/A

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

      10. distribute-neg-in N/A

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

      11. mul-1-neg N/A

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

      12. remove-double-neg N/A

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

      13. mul-1-neg N/A

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

      14. *-commutative N/A

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

      15. fp-cancel-sign-sub N/A

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

      16. mul-1-neg N/A

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

      17. *-commutative N/A

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

      18. associate-*l* N/A

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

      19. metadata-eval N/A

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

      20. *-rgt-identity N/A

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

      21. lower--.f64 N/A

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

      22. lower-/.f64 88.5

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

   5. Applied rewrites 88.5%

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

   if -5.00000000000000008e115 < (/.f64 (*.f64 y (-.f64 z t)) a) < 5e128

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. *-lft-identity N/A

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

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

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

      3. metadata-eval N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

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

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

      9. lower-fma.f64 N/A

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

   5. Applied rewrites 97.0%

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

   6. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. associate-*l/ N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 82.2

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

   8. Applied rewrites 82.2%

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

4. Final simplification 85.4%

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

Alternative 4: 59.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{y \cdot \left(z - t\right)}{a}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+246} \lor \neg \left(t\_1 \leq 5 \cdot 10^{+128}\right):\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* y (- z t)) a)))
   (if (or (<= t_1 -1e+246) (not (<= t_1 5e+128))) (* t (/ y a)) (* 1.0 x))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / a;
	double tmp;
	if ((t_1 <= -1e+246) || !(t_1 <= 5e+128)) {
		tmp = t * (y / a);
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (y * (z - t)) / a
    if ((t_1 <= (-1d+246)) .or. (.not. (t_1 <= 5d+128))) then
        tmp = t * (y / a)
    else
        tmp = 1.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / a;
	double tmp;
	if ((t_1 <= -1e+246) || !(t_1 <= 5e+128)) {
		tmp = t * (y / a);
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (y * (z - t)) / a
	tmp = 0
	if (t_1 <= -1e+246) or not (t_1 <= 5e+128):
		tmp = t * (y / a)
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y * Float64(z - t)) / a)
	tmp = 0.0
	if ((t_1 <= -1e+246) || !(t_1 <= 5e+128))
		tmp = Float64(t * Float64(y / a));
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (y * (z - t)) / a;
	tmp = 0.0;
	if ((t_1 <= -1e+246) || ~((t_1 <= 5e+128)))
		tmp = t * (y / a);
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -1.00000000000000007e246 or 5e128 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 83.9%

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

   3. Taylor expanded in t around inf

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 51.0

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

   5. Applied rewrites 51.0%

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

   7. Applied rewrites 57.6%

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

   if -1.00000000000000007e246 < (/.f64 (*.f64 y (-.f64 z t)) a) < 5e128

   1. Initial program 99.9%

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

   3. Taylor expanded in t around 0

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

      1. *-lft-identity N/A

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

      2. metadata-eval N/A

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

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

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. associate-*r* N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower-/.f64 80.4

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

   5. Applied rewrites 80.4%

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

   6. Taylor expanded in x around -inf

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

   8. Applied rewrites 78.8%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 79.5%

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

   12. Taylor expanded in x around inf

       \[\leadsto 1 \cdot x \]
   13. Step-by-step derivation

   14. Applied rewrites 63.4%

       \[\leadsto 1 \cdot x \]
3. Recombined 2 regimes into one program.

4. Final simplification 61.0%

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

Alternative 5: 85.9% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -5.2e-49) (not (<= z 1.2e+78)))
   (fma (/ (- y) a) z x)
   (fma (/ y a) t x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -5.2e-49) || !(z <= 1.2e+78)) {
		tmp = fma((-y / a), z, x);
	} else {
		tmp = fma((y / a), t, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -5.2e-49) || !(z <= 1.2e+78))
		tmp = fma(Float64(Float64(-y) / a), z, x);
	else
		tmp = fma(Float64(y / a), t, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -5.2e-49], N[Not[LessEqual[z, 1.2e+78]], $MachinePrecision]], N[(N[((-y) / a), $MachinePrecision] * z + x), $MachinePrecision], N[(N[(y / a), $MachinePrecision] * t + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -5.1999999999999999e-49 or 1.1999999999999999e78 < z

   1. Initial program 92.7%

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

   3. Taylor expanded in x around 0

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

      1. *-lft-identity N/A

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

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

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

      3. metadata-eval N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

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

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

      9. lower-fma.f64 N/A

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

   5. Applied rewrites 98.0%

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

   6. Taylor expanded in t around 0

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

      1. *-lft-identity N/A

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

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

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

      3. metadata-eval N/A

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

      4. +-commutative N/A

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

      5. associate-*l/ N/A

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

      6. associate-*l* N/A

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

      7. lower-fma.f64 N/A

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

      8. associate-*r/ N/A

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

      9. lower-/.f64 N/A

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

      10. mul-1-neg N/A

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

      11. lower-neg.f64 90.9

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

   8. Applied rewrites 90.9%

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

   if -5.1999999999999999e-49 < z < 1.1999999999999999e78

   1. Initial program 94.0%

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

   3. Taylor expanded in x around 0

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

      1. *-lft-identity N/A

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

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

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

      3. metadata-eval N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

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

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

      9. lower-fma.f64 N/A

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

   5. Applied rewrites 97.5%

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

   6. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. associate-*l/ N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 90.4

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

   8. Applied rewrites 90.4%

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

4. Final simplification 90.7%

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

Alternative 6: 76.9% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -4.4e+56) (not (<= z 2.35e+145)))
   (* z (/ (- y) a))
   (fma (/ y a) t x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -4.4e+56) || !(z <= 2.35e+145)) {
		tmp = z * (-y / a);
	} else {
		tmp = fma((y / a), t, x);
	}
	return tmp;
}

Julia

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

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -4.4e+56], N[Not[LessEqual[z, 2.35e+145]], $MachinePrecision]], N[(z * N[((-y) / a), $MachinePrecision]), $MachinePrecision], N[(N[(y / a), $MachinePrecision] * t + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -4.40000000000000032e56 or 2.3500000000000001e145 < z

   1. Initial program 93.6%

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

   3. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

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

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

      5. lower-*.f64 N/A

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

      6. distribute-neg-frac N/A

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

      7. lower-/.f64 N/A

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

      8. lower-neg.f64 57.2

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

   5. Applied rewrites 57.2%

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

   7. Applied rewrites 65.8%

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

   if -4.40000000000000032e56 < z < 2.3500000000000001e145

   1. Initial program 93.2%

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

   3. Taylor expanded in x around 0

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

      1. *-lft-identity N/A

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

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

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

      3. metadata-eval N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

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

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

      9. lower-fma.f64 N/A

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

   5. Applied rewrites 97.6%

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

   6. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. associate-*l/ N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 83.2

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

   8. Applied rewrites 83.2%

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

4. Final simplification 77.2%

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

Alternative 7: 77.3% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -4.1e+194)
   (/ (* (- y) z) a)
   (if (<= z 2.35e+145) (fma (/ y a) t x) (* z (/ (- y) a)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -4.1e+194) {
		tmp = (-y * z) / a;
	} else if (z <= 2.35e+145) {
		tmp = fma((y / a), t, x);
	} else {
		tmp = z * (-y / a);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -4.1e+194)
		tmp = Float64(Float64(Float64(-y) * z) / a);
	elseif (z <= 2.35e+145)
		tmp = fma(Float64(y / a), t, x);
	else
		tmp = Float64(z * Float64(Float64(-y) / a));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -4.1e194

   1. Initial program 95.5%

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

   3. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

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

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

      5. lower-*.f64 N/A

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

      6. distribute-neg-frac N/A

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

      7. lower-/.f64 N/A

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

      8. lower-neg.f64 52.5

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

   5. Applied rewrites 52.5%

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

   7. Applied rewrites 69.6%

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

   if -4.1e194 < z < 2.3500000000000001e145

   1. Initial program 93.0%

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

   3. Taylor expanded in x around 0

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

      1. *-lft-identity N/A

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

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

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

      3. metadata-eval N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

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

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

      9. lower-fma.f64 N/A

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

   5. Applied rewrites 98.0%

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

   6. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. associate-*l/ N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 78.5

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

   8. Applied rewrites 78.5%

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

   if 2.3500000000000001e145 < z

   1. Initial program 93.9%

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

   3. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

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

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

      5. lower-*.f64 N/A

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

      6. distribute-neg-frac N/A

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

      7. lower-/.f64 N/A

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

      8. lower-neg.f64 62.8

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

   5. Applied rewrites 62.8%

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

   7. Applied rewrites 74.9%

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

4. Final simplification 77.3%

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

Alternative 8: 71.9% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 93.3%

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

3. Taylor expanded in x around 0

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

   1. *-lft-identity N/A

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

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

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

   3. metadata-eval N/A

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

   4. +-commutative N/A

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

   5. mul-1-neg N/A

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

   6. *-commutative N/A

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

   7. associate-/l* N/A

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

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

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

   9. lower-fma.f64 N/A

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

5. Applied rewrites 97.7%

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

6. Taylor expanded in z around 0

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

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

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

   2. metadata-eval N/A

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

   3. *-lft-identity N/A

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

   4. +-commutative N/A

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

   5. *-commutative N/A

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

   6. associate-*l/ N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-/.f64 71.0

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

8. Applied rewrites 71.0%

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

Alternative 9: 68.6% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 93.3%

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

3. Taylor expanded in z around 0

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

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

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

   2. metadata-eval N/A

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

   3. *-lft-identity N/A

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

   4. +-commutative N/A

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

   5. associate-*l/ N/A

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

   6. lower-fma.f64 N/A

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

   7. lower-/.f64 67.3

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

5. Applied rewrites 67.3%

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

Alternative 10: 39.3% accurate, 3.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.3%

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

3. Taylor expanded in t around 0

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

   1. *-lft-identity N/A

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

   2. metadata-eval N/A

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

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

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

   4. +-commutative N/A

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

   5. associate-/l* N/A

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

   6. associate-*r* N/A

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

   7. lower-fma.f64 N/A

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

   8. mul-1-neg N/A

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

   9. lower-neg.f64 N/A

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

   10. lower-/.f64 69.9

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

5. Applied rewrites 69.9%

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

6. Taylor expanded in x around -inf

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

8. Applied rewrites 69.6%

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

9. Taylor expanded in x around inf

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

11. Applied rewrites 69.5%

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

12. Taylor expanded in x around inf

    \[\leadsto 1 \cdot x \]
13. Step-by-step derivation

14. Applied rewrites 40.4%

    \[\leadsto 1 \cdot x \]
15. Add Preprocessing

Developer Target 1: 99.1% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

function code(x, y, z, t, a)
	t_1 = Float64(a / Float64(z - t))
	tmp = 0.0
	if (y < -1.0761266216389975e-10)
		tmp = Float64(x - Float64(1.0 / Float64(t_1 / y)));
	elseif (y < 2.894426862792089e-49)
		tmp = Float64(x - Float64(Float64(y * Float64(z - t)) / a));
	else
		tmp = Float64(x - Float64(y / t_1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = a / (z - t);
	tmp = 0.0;
	if (y < -1.0761266216389975e-10)
		tmp = x - (1.0 / (t_1 / y));
	elseif (y < 2.894426862792089e-49)
		tmp = x - ((y * (z - t)) / a);
	else
		tmp = x - (y / t_1);
	end
	tmp_2 = tmp;
end

Wolfram

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

Reproduce

herbie shell --seed 2024329 
(FPCore (x y z t a)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, F"
  :precision binary64

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

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