Diagrams.Solve.Tridiagonal:solveCyclicTriDiagonal from diagrams-solve-0.1, B

Percentage Accurate: 74.9% → 85.5%

Time: 12.9s

Alternatives: 16

Speedup: 0.5×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 74.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 85.5% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t)))))
   (if (<= t_1 4e+225)
     t_1
     (if (<= t_1 INFINITY)
       (/ 1.0 (/ (fma y (/ b t) (+ a 1.0)) (fma y (/ z t) x)))
       (/ z b)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t));
	double tmp;
	if (t_1 <= 4e+225) {
		tmp = t_1;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = 1.0 / (fma(y, (b / t), (a + 1.0)) / fma(y, (z / t), x));
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(x + Float64(Float64(y * z) / t)) / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	tmp = 0.0
	if (t_1 <= 4e+225)
		tmp = t_1;
	elseif (t_1 <= Inf)
		tmp = Float64(1.0 / Float64(fma(y, Float64(b / t), Float64(a + 1.0)) / fma(y, Float64(z / t), x)));
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 4e+225], t$95$1, If[LessEqual[t$95$1, Infinity], N[(1.0 / N[(N[(y * N[(b / t), $MachinePrecision] + N[(a + 1.0), $MachinePrecision]), $MachinePrecision] / N[(y * N[(z / t), $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z / b), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 3.99999999999999971e225

   1. Initial program 91.3%

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

   if 3.99999999999999971e225 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 41.8%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 41.9

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

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-/l* N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-/.f64 41.9

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

      12. lift-+.f64 N/A

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

      13. +-commutative N/A

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

      14. lift-/.f64 N/A

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

      15. lift-*.f64 N/A

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

      16. associate-/l* N/A

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

      17. lower-fma.f64 N/A

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

      18. lower-/.f64 84.2

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

   4. Applied rewrites 84.2%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 90.0

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\frac{z}{b}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 87.2% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ x (/ (* y z) t)))
        (t_2 (/ t_1 (+ (+ a 1.0) (/ (* y b) t))))
        (t_3 (/ (fma y (/ z t) x) (fma y (/ b t) (+ a 1.0)))))
   (if (<= t_2 (- INFINITY))
     t_3
     (if (<= t_2 1e+50)
       (/ t_1 (fma b (/ y t) (+ a 1.0)))
       (if (<= t_2 INFINITY) t_3 (/ z b))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x + ((y * z) / t);
	double t_2 = t_1 / ((a + 1.0) + ((y * b) / t));
	double t_3 = fma(y, (z / t), x) / fma(y, (b / t), (a + 1.0));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_3;
	} else if (t_2 <= 1e+50) {
		tmp = t_1 / fma(b, (y / t), (a + 1.0));
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = t_3;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -inf.0 or 1.0000000000000001e50 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 71.0%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 85.6

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 85.5

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

   4. Applied rewrites 85.5%

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

   if -inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 1.0000000000000001e50

   1. Initial program 91.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 91.2

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

   4. Applied rewrites 91.2%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 90.0

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\frac{z}{b}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 70.4% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t))))
        (t_2 (/ (fma z (/ y t) x) (+ a 1.0))))
   (if (<= t_1 -4e-205)
     t_2
     (if (<= t_1 5e-89)
       (/ x (+ a (fma b (/ y t) 1.0)))
       (if (<= t_1 INFINITY) t_2 (/ z b))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t));
	double t_2 = fma(z, (y / t), x) / (a + 1.0);
	double tmp;
	if (t_1 <= -4e-205) {
		tmp = t_2;
	} else if (t_1 <= 5e-89) {
		tmp = x / (a + fma(b, (y / t), 1.0));
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = t_2;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(x + Float64(Float64(y * z) / t)) / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	t_2 = Float64(fma(z, Float64(y / t), x) / Float64(a + 1.0))
	tmp = 0.0
	if (t_1 <= -4e-205)
		tmp = t_2;
	elseif (t_1 <= 5e-89)
		tmp = Float64(x / Float64(a + fma(b, Float64(y / t), 1.0)));
	elseif (t_1 <= Inf)
		tmp = t_2;
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z * N[(y / t), $MachinePrecision] + x), $MachinePrecision] / N[(a + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -4e-205], t$95$2, If[LessEqual[t$95$1, 5e-89], N[(x / N[(a + N[(b * N[(y / t), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(z / b), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -4e-205 or 4.99999999999999967e-89 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 90.8%

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

   3. Taylor expanded in b around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 74.4

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

   5. Applied rewrites 74.4%

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

   if -4e-205 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 4.99999999999999967e-89

   1. Initial program 81.1%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 82.3

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 81.1

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

   4. Applied rewrites 81.1%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. associate-+r+ N/A

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

      3. +-commutative N/A

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

      4. associate-+l+ N/A

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

      5. lower-+.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 75.3

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

   7. Applied rewrites 75.3%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 90.0

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\frac{z}{b}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 76.4%

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

Alternative 4: 68.8% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t))))
        (t_2 (/ (fma z (/ y t) x) (+ a 1.0))))
   (if (<= t_1 -4e-205)
     t_2
     (if (<= t_1 5e-89)
       (/ x (+ a (/ (fma b y t) t)))
       (if (<= t_1 INFINITY) t_2 (/ z b))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t));
	double t_2 = fma(z, (y / t), x) / (a + 1.0);
	double tmp;
	if (t_1 <= -4e-205) {
		tmp = t_2;
	} else if (t_1 <= 5e-89) {
		tmp = x / (a + (fma(b, y, t) / t));
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = t_2;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(x + Float64(Float64(y * z) / t)) / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	t_2 = Float64(fma(z, Float64(y / t), x) / Float64(a + 1.0))
	tmp = 0.0
	if (t_1 <= -4e-205)
		tmp = t_2;
	elseif (t_1 <= 5e-89)
		tmp = Float64(x / Float64(a + Float64(fma(b, y, t) / t)));
	elseif (t_1 <= Inf)
		tmp = t_2;
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z * N[(y / t), $MachinePrecision] + x), $MachinePrecision] / N[(a + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -4e-205], t$95$2, If[LessEqual[t$95$1, 5e-89], N[(x / N[(a + N[(N[(b * y + t), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(z / b), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -4e-205 or 4.99999999999999967e-89 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 90.8%

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

   3. Taylor expanded in b around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 74.4

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

   5. Applied rewrites 74.4%

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

   if -4e-205 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 4.99999999999999967e-89

   1. Initial program 81.1%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 82.3

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 81.1

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

   4. Applied rewrites 81.1%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. associate-+r+ N/A

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

      3. +-commutative N/A

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

      4. associate-+l+ N/A

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

      5. lower-+.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 75.3

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

   7. Applied rewrites 75.3%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 71.7%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 90.0

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\frac{z}{b}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 75.3%

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

Alternative 5: 69.3% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t))))
        (t_2 (/ (fma z (/ y t) x) (+ a 1.0))))
   (if (<= t_1 -5e-281)
     t_2
     (if (<= t_1 1e-124)
       (/ x (+ a (* b (/ y t))))
       (if (<= t_1 INFINITY) t_2 (/ z b))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t));
	double t_2 = fma(z, (y / t), x) / (a + 1.0);
	double tmp;
	if (t_1 <= -5e-281) {
		tmp = t_2;
	} else if (t_1 <= 1e-124) {
		tmp = x / (a + (b * (y / t)));
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = t_2;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(x + Float64(Float64(y * z) / t)) / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t)))
	t_2 = Float64(fma(z, Float64(y / t), x) / Float64(a + 1.0))
	tmp = 0.0
	if (t_1 <= -5e-281)
		tmp = t_2;
	elseif (t_1 <= 1e-124)
		tmp = Float64(x / Float64(a + Float64(b * Float64(y / t))));
	elseif (t_1 <= Inf)
		tmp = t_2;
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -4.9999999999999998e-281 or 9.99999999999999933e-125 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 91.8%

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

   3. Taylor expanded in b around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-+.f64 74.9

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

   5. Applied rewrites 74.9%

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

   if -4.9999999999999998e-281 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 9.99999999999999933e-125

   1. Initial program 75.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 77.1

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 77.1

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

   4. Applied rewrites 77.1%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. associate-+r+ N/A

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

      3. +-commutative N/A

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

      4. associate-+l+ N/A

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

      5. lower-+.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 72.7

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

   7. Applied rewrites 72.7%

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

   8. Taylor expanded in b around inf

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

   10. Applied rewrites 69.5%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 90.0

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\frac{z}{b}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 75.3%

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

Alternative 6: 85.5% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ (+ a 1.0) (/ (* y b) t))) (t_2 (/ (+ x (/ (* y z) t)) t_1)))
   (if (<= t_2 4e+225)
     t_2
     (if (<= t_2 INFINITY) (/ (fma (/ z t) y x) t_1) (/ z b)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (a + 1.0) + ((y * b) / t);
	double t_2 = (x + ((y * z) / t)) / t_1;
	double tmp;
	if (t_2 <= 4e+225) {
		tmp = t_2;
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = fma((z / t), y, x) / t_1;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t))
	t_2 = Float64(Float64(x + Float64(Float64(y * z) / t)) / t_1)
	tmp = 0.0
	if (t_2 <= 4e+225)
		tmp = t_2;
	elseif (t_2 <= Inf)
		tmp = Float64(fma(Float64(z / t), y, x) / t_1);
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[t$95$2, 4e+225], t$95$2, If[LessEqual[t$95$2, Infinity], N[(N[(N[(z / t), $MachinePrecision] * y + x), $MachinePrecision] / t$95$1), $MachinePrecision], N[(z / b), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 3.99999999999999971e225

   1. Initial program 91.3%

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

   if 3.99999999999999971e225 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 41.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 84.2

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

   4. Applied rewrites 84.2%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 90.0

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\frac{z}{b}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 65.4% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t)))))
   (if (<= t_1 (- INFINITY))
     (/ z b)
     (if (<= t_1 2e+296) (/ x (+ 1.0 (fma y (/ b t) a))) (/ z b)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = z / b;
	} else if (t_1 <= 2e+296) {
		tmp = x / (1.0 + fma(y, (b / t), a));
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < -inf.0 or 1.99999999999999996e296 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 20.3%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 76.3

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 76.3%

      \[\leadsto \color{blue}{\frac{z}{b}} \]

   if -inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < 1.99999999999999996e296

   1. Initial program 92.5%

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

   3. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 67.3

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

   5. Applied rewrites 67.3%

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

Alternative 8: 83.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(a + 1\right) + \frac{y \cdot b}{t}\\ \mathbf{if}\;\frac{x + \frac{y \cdot z}{t}}{t\_1} \leq \infty:\\ \;\;\;\;\frac{\mathsf{fma}\left(\frac{z}{t}, y, x\right)}{t\_1}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ (+ a 1.0) (/ (* y b) t))))
   (if (<= (/ (+ x (/ (* y z) t)) t_1) INFINITY)
     (/ (fma (/ z t) y x) t_1)
     (/ z b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (a + 1.0) + ((y * b) / t);
	double tmp;
	if (((x + ((y * z) / t)) / t_1) <= ((double) INFINITY)) {
		tmp = fma((z / t), y, x) / t_1;
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t))
	tmp = 0.0
	if (Float64(Float64(x + Float64(Float64(y * z) / t)) / t_1) <= Inf)
		tmp = Float64(fma(Float64(z / t), y, x) / t_1);
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], Infinity], N[(N[(N[(z / t), $MachinePrecision] * y + x), $MachinePrecision] / t$95$1), $MachinePrecision], N[(z / b), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 87.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 87.0

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

   4. Applied rewrites 87.0%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 90.0

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\frac{z}{b}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 83.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x + \frac{y \cdot z}{t}}{\left(a + 1\right) + \frac{y \cdot b}{t}} \leq \infty:\\ \;\;\;\;\frac{\mathsf{fma}\left(y, \frac{z}{t}, x\right)}{\mathsf{fma}\left(y, \frac{b}{t}, a + 1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t))) INFINITY)
   (/ (fma y (/ z t) x) (fma y (/ b t) (+ a 1.0)))
   (/ z b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (((x + ((y * z) / t)) / ((a + 1.0) + ((y * b) / t))) <= ((double) INFINITY)) {
		tmp = fma(y, (z / t), x) / fma(y, (b / t), (a + 1.0));
	} else {
		tmp = z / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (Float64(Float64(x + Float64(Float64(y * z) / t)) / Float64(Float64(a + 1.0) + Float64(Float64(y * b) / t))) <= Inf)
		tmp = Float64(fma(y, Float64(z / t), x) / fma(y, Float64(b / t), Float64(a + 1.0)));
	else
		tmp = Float64(z / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y * b), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(y * N[(z / t), $MachinePrecision] + x), $MachinePrecision] / N[(y * N[(b / t), $MachinePrecision] + N[(a + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z / b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t))) < +inf.0

   1. Initial program 87.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 87.0

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 86.2

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

   4. Applied rewrites 86.2%

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

   if +inf.0 < (/.f64 (+.f64 x (/.f64 (*.f64 y z) t)) (+.f64 (+.f64 a #s(literal 1 binary64)) (/.f64 (*.f64 y b) t)))

   1. Initial program 0.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 90.0

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\frac{z}{b}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 55.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -10000000000000:\\ \;\;\;\;\frac{\mathsf{fma}\left(z, \frac{y}{t}, x\right)}{a}\\ \mathbf{elif}\;a \leq 1.1 \cdot 10^{-129}:\\ \;\;\;\;\frac{x}{\mathsf{fma}\left(b, \frac{y}{t}, 1\right)}\\ \mathbf{elif}\;a \leq 1.9 \cdot 10^{+36}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(y, \frac{z}{t}, x\right)}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= a -10000000000000.0)
   (/ (fma z (/ y t) x) a)
   (if (<= a 1.1e-129)
     (/ x (fma b (/ y t) 1.0))
     (if (<= a 1.9e+36) (/ z b) (/ (fma y (/ z t) x) a)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -10000000000000.0) {
		tmp = fma(z, (y / t), x) / a;
	} else if (a <= 1.1e-129) {
		tmp = x / fma(b, (y / t), 1.0);
	} else if (a <= 1.9e+36) {
		tmp = z / b;
	} else {
		tmp = fma(y, (z / t), x) / a;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (a <= -10000000000000.0)
		tmp = Float64(fma(z, Float64(y / t), x) / a);
	elseif (a <= 1.1e-129)
		tmp = Float64(x / fma(b, Float64(y / t), 1.0));
	elseif (a <= 1.9e+36)
		tmp = Float64(z / b);
	else
		tmp = Float64(fma(y, Float64(z / t), x) / a);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[a, -10000000000000.0], N[(N[(z * N[(y / t), $MachinePrecision] + x), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[a, 1.1e-129], N[(x / N[(b * N[(y / t), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.9e+36], N[(z / b), $MachinePrecision], N[(N[(y * N[(z / t), $MachinePrecision] + x), $MachinePrecision] / a), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if a < -1e13

   1. Initial program 73.8%

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

   3. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 75.4

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

   5. Applied rewrites 75.4%

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

   if -1e13 < a < 1.10000000000000001e-129

   1. Initial program 81.5%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 81.6

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 80.8

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

   4. Applied rewrites 80.8%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. associate-+r+ N/A

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

      3. +-commutative N/A

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

      4. associate-+l+ N/A

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

      5. lower-+.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 59.7

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

   7. Applied rewrites 59.7%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 57.9%

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

   if 1.10000000000000001e-129 < a < 1.90000000000000012e36

   1. Initial program 74.6%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 64.5

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 64.5%

      \[\leadsto \color{blue}{\frac{z}{b}} \]

   if 1.90000000000000012e36 < a

   1. Initial program 74.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 75.1

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 80.1

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

   4. Applied rewrites 80.1%

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

   5. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 65.5

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

   7. Applied rewrites 65.5%

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

Alternative 11: 56.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\mathsf{fma}\left(z, \frac{y}{t}, x\right)}{a}\\ \mathbf{if}\;a \leq -10000000000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 1.1 \cdot 10^{-129}:\\ \;\;\;\;\frac{x}{\mathsf{fma}\left(b, \frac{y}{t}, 1\right)}\\ \mathbf{elif}\;a \leq 1.4 \cdot 10^{+36}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (fma z (/ y t) x) a)))
   (if (<= a -10000000000000.0)
     t_1
     (if (<= a 1.1e-129)
       (/ x (fma b (/ y t) 1.0))
       (if (<= a 1.4e+36) (/ z b) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma(z, (y / t), x) / a;
	double tmp;
	if (a <= -10000000000000.0) {
		tmp = t_1;
	} else if (a <= 1.1e-129) {
		tmp = x / fma(b, (y / t), 1.0);
	} else if (a <= 1.4e+36) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(fma(z, Float64(y / t), x) / a)
	tmp = 0.0
	if (a <= -10000000000000.0)
		tmp = t_1;
	elseif (a <= 1.1e-129)
		tmp = Float64(x / fma(b, Float64(y / t), 1.0));
	elseif (a <= 1.4e+36)
		tmp = Float64(z / b);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(z * N[(y / t), $MachinePrecision] + x), $MachinePrecision] / a), $MachinePrecision]}, If[LessEqual[a, -10000000000000.0], t$95$1, If[LessEqual[a, 1.1e-129], N[(x / N[(b * N[(y / t), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.4e+36], N[(z / b), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if a < -1e13 or 1.4e36 < a

   1. Initial program 74.3%

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

   3. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 68.9

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

   5. Applied rewrites 68.9%

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

   if -1e13 < a < 1.10000000000000001e-129

   1. Initial program 81.5%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 81.6

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 80.8

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

   4. Applied rewrites 80.8%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. associate-+r+ N/A

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

      3. +-commutative N/A

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

      4. associate-+l+ N/A

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

      5. lower-+.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 59.7

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

   7. Applied rewrites 59.7%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 57.9%

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

   if 1.10000000000000001e-129 < a < 1.4e36

   1. Initial program 74.6%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 64.5

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 64.5%

      \[\leadsto \color{blue}{\frac{z}{b}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 12: 41.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{elif}\;a \leq 1.9 \cdot 10^{-183}:\\ \;\;\;\;x - x \cdot a\\ \mathbf{elif}\;a \leq 1.9 \cdot 10^{+36}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= a -1.0)
   (/ x a)
   (if (<= a 1.9e-183) (- x (* x a)) (if (<= a 1.9e+36) (/ z b) (/ x a)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -1.0) {
		tmp = x / a;
	} else if (a <= 1.9e-183) {
		tmp = x - (x * a);
	} else if (a <= 1.9e+36) {
		tmp = z / b;
	} else {
		tmp = x / a;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: tmp
    if (a <= (-1.0d0)) then
        tmp = x / a
    else if (a <= 1.9d-183) then
        tmp = x - (x * a)
    else if (a <= 1.9d+36) then
        tmp = z / b
    else
        tmp = x / a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -1.0) {
		tmp = x / a;
	} else if (a <= 1.9e-183) {
		tmp = x - (x * a);
	} else if (a <= 1.9e+36) {
		tmp = z / b;
	} else {
		tmp = x / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if a <= -1.0:
		tmp = x / a
	elif a <= 1.9e-183:
		tmp = x - (x * a)
	elif a <= 1.9e+36:
		tmp = z / b
	else:
		tmp = x / a
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (a <= -1.0)
		tmp = Float64(x / a);
	elseif (a <= 1.9e-183)
		tmp = Float64(x - Float64(x * a));
	elseif (a <= 1.9e+36)
		tmp = Float64(z / b);
	else
		tmp = Float64(x / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (a <= -1.0)
		tmp = x / a;
	elseif (a <= 1.9e-183)
		tmp = x - (x * a);
	elseif (a <= 1.9e+36)
		tmp = z / b;
	else
		tmp = x / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[a, -1.0], N[(x / a), $MachinePrecision], If[LessEqual[a, 1.9e-183], N[(x - N[(x * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.9e+36], N[(z / b), $MachinePrecision], N[(x / a), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if a < -1 or 1.90000000000000012e36 < a

   1. Initial program 74.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 74.5

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 79.3

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

   4. Applied rewrites 79.3%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. associate-+r+ N/A

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

      3. +-commutative N/A

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

      4. associate-+l+ N/A

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

      5. lower-+.f64 N/A

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

      6. +-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 60.5

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

   7. Applied rewrites 60.5%

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

   8. Taylor expanded in a around inf

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

   10. Applied rewrites 53.5%

       \[\leadsto \frac{x}{\color{blue}{a}} \]

   if -1 < a < 1.8999999999999998e-183

   1. Initial program 81.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 81.4

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 78.4

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

   4. Applied rewrites 78.4%

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

   5. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 41.9

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

   7. Applied rewrites 41.9%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 41.9%

       \[\leadsto x - \color{blue}{a \cdot x} \]

   if 1.8999999999999998e-183 < a < 1.90000000000000012e36

   1. Initial program 78.0%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 60.3

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 60.3%

      \[\leadsto \color{blue}{\frac{z}{b}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 50.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1:\\ \;\;\;\;\frac{x}{a}\\ \mathbf{elif}\;a \leq 1.9 \cdot 10^{-183}:\\ \;\;\;\;x - x \cdot a\\ \mathbf{elif}\;a \leq 1.9 \cdot 10^{+36}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 55.3% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{a + 1}\\ \mathbf{if}\;t \leq -3.2 \cdot 10^{-109}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 3.8 \cdot 10^{+19}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ x (+ a 1.0))))
   (if (<= t -3.2e-109) t_1 (if (<= t 3.8e+19) (/ z b) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x / (a + 1.0);
	double tmp;
	if (t <= -3.2e-109) {
		tmp = t_1;
	} else if (t <= 3.8e+19) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x / (a + 1.0d0)
    if (t <= (-3.2d-109)) then
        tmp = t_1
    else if (t <= 3.8d+19) then
        tmp = z / b
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x / (a + 1.0);
	double tmp;
	if (t <= -3.2e-109) {
		tmp = t_1;
	} else if (t <= 3.8e+19) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = x / (a + 1.0)
	tmp = 0
	if t <= -3.2e-109:
		tmp = t_1
	elif t <= 3.8e+19:
		tmp = z / b
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x / Float64(a + 1.0))
	tmp = 0.0
	if (t <= -3.2e-109)
		tmp = t_1;
	elseif (t <= 3.8e+19)
		tmp = Float64(z / b);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = x / (a + 1.0);
	tmp = 0.0;
	if (t <= -3.2e-109)
		tmp = t_1;
	elseif (t <= 3.8e+19)
		tmp = z / b;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(x / N[(a + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -3.2e-109], t$95$1, If[LessEqual[t, 3.8e+19], N[(z / b), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -3.2000000000000002e-109 or 3.8e19 < t

   1. Initial program 85.3%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 63.9

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

   5. Applied rewrites 63.9%

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

   if -3.2000000000000002e-109 < t < 3.8e19

   1. Initial program 67.1%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 59.4

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 59.4%

      \[\leadsto \color{blue}{\frac{z}{b}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 61.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -3.2 \cdot 10^{-109}:\\ \;\;\;\;\frac{x}{a + 1}\\ \mathbf{elif}\;t \leq 3.8 \cdot 10^{+19}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{a + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 40.3% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x - x \cdot a\\ \mathbf{if}\;t \leq -2.6 \cdot 10^{+97}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 1.65 \cdot 10^{+33}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (- x (* x a))))
   (if (<= t -2.6e+97) t_1 (if (<= t 1.65e+33) (/ z b) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x - (x * a);
	double tmp;
	if (t <= -2.6e+97) {
		tmp = t_1;
	} else if (t <= 1.65e+33) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x - (x * a)
    if (t <= (-2.6d+97)) then
        tmp = t_1
    else if (t <= 1.65d+33) then
        tmp = z / b
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x - (x * a);
	double tmp;
	if (t <= -2.6e+97) {
		tmp = t_1;
	} else if (t <= 1.65e+33) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = x - (x * a)
	tmp = 0
	if t <= -2.6e+97:
		tmp = t_1
	elif t <= 1.65e+33:
		tmp = z / b
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x - Float64(x * a))
	tmp = 0.0
	if (t <= -2.6e+97)
		tmp = t_1;
	elseif (t <= 1.65e+33)
		tmp = Float64(z / b);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = x - (x * a);
	tmp = 0.0;
	if (t <= -2.6e+97)
		tmp = t_1;
	elseif (t <= 1.65e+33)
		tmp = z / b;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(x - N[(x * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.6e+97], t$95$1, If[LessEqual[t, 1.65e+33], N[(z / b), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -2.6e97 or 1.64999999999999988e33 < t

   1. Initial program 81.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 90.3

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-/.f64 98.8

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

   4. Applied rewrites 98.8%

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

   5. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 69.5

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

   7. Applied rewrites 69.5%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 37.3%

       \[\leadsto x - \color{blue}{a \cdot x} \]

   if -2.6e97 < t < 1.64999999999999988e33

   1. Initial program 74.7%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{z}{b}} \]
   4. Step-by-step derivation

      1. lower-/.f64 50.8

         \[\leadsto \color{blue}{\frac{z}{b}} \]

   5. Applied rewrites 50.8%

      \[\leadsto \color{blue}{\frac{z}{b}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 45.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -2.6 \cdot 10^{+97}:\\ \;\;\;\;x - x \cdot a\\ \mathbf{elif}\;t \leq 1.65 \cdot 10^{+33}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;x - x \cdot a\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 19.2% accurate, 5.9× speedup

Math

\[\begin{array}{l} \\ x - x \cdot a \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    code = x - (x * a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 77.5%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. associate-/l* N/A

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

   6. lower-fma.f64 N/A

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

   7. lower-/.f64 77.2

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

   8. lift-+.f64 N/A

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

   9. +-commutative N/A

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

   10. lift-/.f64 N/A

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

   11. lift-*.f64 N/A

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

   12. associate-/l* N/A

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

   13. lower-fma.f64 N/A

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

   14. lower-/.f64 78.4

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

4. Applied rewrites 78.4%

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

5. Taylor expanded in y around 0

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 45.9

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

7. Applied rewrites 45.9%

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

8. Taylor expanded in a around 0

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

10. Applied rewrites 21.0%

    \[\leadsto x - \color{blue}{a \cdot x} \]

11. Final simplification 21.0%

    \[\leadsto x - x \cdot a \]
12. Add Preprocessing

Alternative 16: 4.1% accurate, 6.6× speedup

Math

\[\begin{array}{l} \\ -x \cdot a \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    code = -(x * a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 77.5%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. associate-/l* N/A

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

   6. lower-fma.f64 N/A

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

   7. lower-/.f64 77.2

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

   8. lift-+.f64 N/A

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

   9. +-commutative N/A

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

   10. lift-/.f64 N/A

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

   11. lift-*.f64 N/A

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

   12. associate-/l* N/A

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

   13. lower-fma.f64 N/A

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

   14. lower-/.f64 78.4

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

4. Applied rewrites 78.4%

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

5. Taylor expanded in y around 0

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 45.9

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

7. Applied rewrites 45.9%

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

8. Taylor expanded in a around 0

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

10. Applied rewrites 21.0%

    \[\leadsto x - \color{blue}{a \cdot x} \]

11. Taylor expanded in a around inf

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

13. Applied rewrites 4.6%

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

14. Final simplification 4.6%

    \[\leadsto -x \cdot a \]
15. Add Preprocessing

Developer Target 1: 79.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 1 \cdot \left(\left(x + \frac{y}{t} \cdot z\right) \cdot \frac{1}{\left(a + 1\right) + \frac{y}{t} \cdot b}\right)\\ \mathbf{if}\;t < -1.3659085366310088 \cdot 10^{-271}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t < 3.036967103737246 \cdot 10^{-130}:\\ \;\;\;\;\frac{z}{b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1
         (* 1.0 (* (+ x (* (/ y t) z)) (/ 1.0 (+ (+ a 1.0) (* (/ y t) b)))))))
   (if (< t -1.3659085366310088e-271)
     t_1
     (if (< t 3.036967103737246e-130) (/ z b) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))));
	double tmp;
	if (t < -1.3659085366310088e-271) {
		tmp = t_1;
	} else if (t < 3.036967103737246e-130) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 1.0d0 * ((x + ((y / t) * z)) * (1.0d0 / ((a + 1.0d0) + ((y / t) * b))))
    if (t < (-1.3659085366310088d-271)) then
        tmp = t_1
    else if (t < 3.036967103737246d-130) then
        tmp = z / b
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))));
	double tmp;
	if (t < -1.3659085366310088e-271) {
		tmp = t_1;
	} else if (t < 3.036967103737246e-130) {
		tmp = z / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))))
	tmp = 0
	if t < -1.3659085366310088e-271:
		tmp = t_1
	elif t < 3.036967103737246e-130:
		tmp = z / b
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(1.0 * Float64(Float64(x + Float64(Float64(y / t) * z)) * Float64(1.0 / Float64(Float64(a + 1.0) + Float64(Float64(y / t) * b)))))
	tmp = 0.0
	if (t < -1.3659085366310088e-271)
		tmp = t_1;
	elseif (t < 3.036967103737246e-130)
		tmp = Float64(z / b);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 1.0 * ((x + ((y / t) * z)) * (1.0 / ((a + 1.0) + ((y / t) * b))));
	tmp = 0.0;
	if (t < -1.3659085366310088e-271)
		tmp = t_1;
	elseif (t < 3.036967103737246e-130)
		tmp = z / b;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(1.0 * N[(N[(x + N[(N[(y / t), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(a + 1.0), $MachinePrecision] + N[(N[(y / t), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t, -1.3659085366310088e-271], t$95$1, If[Less[t, 3.036967103737246e-130], N[(z / b), $MachinePrecision], t$95$1]]]

Reproduce

herbie shell --seed 2024221 
(FPCore (x y z t a b)
  :name "Diagrams.Solve.Tridiagonal:solveCyclicTriDiagonal from diagrams-solve-0.1, B"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< t -1707385670788761/12500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* 1 (* (+ x (* (/ y t) z)) (/ 1 (+ (+ a 1) (* (/ y t) b))))) (if (< t 1518483551868623/5000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ z b) (* 1 (* (+ x (* (/ y t) z)) (/ 1 (+ (+ a 1) (* (/ y t) b))))))))

  (/ (+ x (/ (* y z) t)) (+ (+ a 1.0) (/ (* y b) t))))