Kahan p13 Example 3

Percentage Accurate: 100.0% → 100.0%

Time: 14.4s

Alternatives: 15

Speedup: 1.8×

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ 1 - \frac{1}{2 + t\_1 \cdot t\_1} \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))))))
   (- 1.0 (/ 1.0 (+ 2.0 (* t_1 t_1))))))

C

double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    t_1 = 2.0d0 - ((2.0d0 / t) / (1.0d0 + (1.0d0 / t)))
    code = 1.0d0 - (1.0d0 / (2.0d0 + (t_1 * t_1)))
end function

Java

public static double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
}

Python

def code(t):
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)))
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)))

Julia

function code(t)
	t_1 = Float64(2.0 - Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))))
	return Float64(1.0 - Float64(1.0 / Float64(2.0 + Float64(t_1 * t_1))))
end

MATLAB

function tmp = code(t)
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	tmp = 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
end

Wolfram

code[t_] := Block[{t$95$1 = N[(2.0 - N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(1.0 - N[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ 1 - \frac{1}{2 + t\_1 \cdot t\_1} \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))))))
   (- 1.0 (/ 1.0 (+ 2.0 (* t_1 t_1))))))

C

double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    t_1 = 2.0d0 - ((2.0d0 / t) / (1.0d0 + (1.0d0 / t)))
    code = 1.0d0 - (1.0d0 / (2.0d0 + (t_1 * t_1)))
end function

Java

public static double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
}

Python

def code(t):
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)))
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)))

Julia

function code(t)
	t_1 = Float64(2.0 - Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))))
	return Float64(1.0 - Float64(1.0 / Float64(2.0 + Float64(t_1 * t_1))))
end

MATLAB

function tmp = code(t)
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	tmp = 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
end

Wolfram

code[t_] := Block[{t$95$1 = N[(2.0 - N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(1.0 - N[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Alternative 1: 100.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ 1 + \frac{-1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\mathsf{fma}\left(t, t + 2, 1\right)}}{2 + \frac{-2}{-1 - t}}, 2 + \frac{2}{-1 - t}, 2\right)} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (+
  1.0
  (/
   -1.0
   (fma
    (/ (- 4.0 (/ 4.0 (fma t (+ t 2.0) 1.0))) (+ 2.0 (/ -2.0 (- -1.0 t))))
    (+ 2.0 (/ 2.0 (- -1.0 t)))
    2.0))))

C

double code(double t) {
	return 1.0 + (-1.0 / fma(((4.0 - (4.0 / fma(t, (t + 2.0), 1.0))) / (2.0 + (-2.0 / (-1.0 - t)))), (2.0 + (2.0 / (-1.0 - t))), 2.0));
}

Julia

function code(t)
	return Float64(1.0 + Float64(-1.0 / fma(Float64(Float64(4.0 - Float64(4.0 / fma(t, Float64(t + 2.0), 1.0))) / Float64(2.0 + Float64(-2.0 / Float64(-1.0 - t)))), Float64(2.0 + Float64(2.0 / Float64(-1.0 - t))), 2.0)))
end

Wolfram

code[t_] := N[(1.0 + N[(-1.0 / N[(N[(N[(4.0 - N[(4.0 / N[(t * N[(t + 2.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(-2.0 / N[(-1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 + N[(2.0 / N[(-1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

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

   1. lift-/.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift-/.f64 N/A

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

   5. lift--.f64 N/A

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

   6. lift-/.f64 N/A

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

   7. lift-+.f64 N/A

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

   8. lift-/.f64 N/A

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

   9. lift-/.f64 N/A

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

   10. lift--.f64 N/A

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

   11. lift-*.f64 N/A

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

   12. +-commutative N/A

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

4. Applied egg-rr 100.0%

   \[\leadsto 1 - \frac{1}{\color{blue}{\mathsf{fma}\left(2 - \frac{2}{\mathsf{fma}\left(t, \frac{1}{t}, t\right)}, 2 - \frac{2}{\mathsf{fma}\left(t, \frac{1}{t}, t\right)}, 2\right)}} \]
5. Step-by-step derivation

   1. lift-/.f64 N/A

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

   2. lift-fma.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. sub-neg N/A

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

   5. flip-+ N/A

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

   6. sqr-neg N/A

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

   7. lower-/.f64 N/A

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

6. Applied egg-rr 100.0%

   \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\color{blue}{\frac{4 - \frac{4}{\left(t + 1\right) \cdot \left(t + 1\right)}}{2 - \frac{-2}{t + 1}}}, 2 - \frac{2}{\mathsf{fma}\left(t, \frac{1}{t}, t\right)}, 2\right)} \]
7. Step-by-step derivation

   1. rgt-mult-inverse N/A

      \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\left(t + 1\right) \cdot \left(t + 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{\color{blue}{1} + t}, 2\right)} \]

   2. +-commutative N/A

      \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\left(t + 1\right) \cdot \left(t + 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{\color{blue}{t + 1}}, 2\right)} \]

   3. lift-+.f64 100.0

      \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\left(t + 1\right) \cdot \left(t + 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{\color{blue}{t + 1}}, 2\right)} \]

8. Applied egg-rr 100.0%

   \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\left(t + 1\right) \cdot \left(t + 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{\color{blue}{t + 1}}, 2\right)} \]

9. Taylor expanded in t around 0

   \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\color{blue}{1 + t \cdot \left(2 + t\right)}}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]
10. Step-by-step derivation

    1. +-commutative N/A

       \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\color{blue}{t \cdot \left(2 + t\right) + 1}}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    2. metadata-eval N/A

       \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{t \cdot \left(\color{blue}{2 \cdot 1} + t\right) + 1}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    3. lft-mult-inverse N/A

       \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{t \cdot \left(2 \cdot \color{blue}{\left(\frac{1}{t} \cdot t\right)} + t\right) + 1}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    4. associate-*l* N/A

       \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{t \cdot \left(\color{blue}{\left(2 \cdot \frac{1}{t}\right) \cdot t} + t\right) + 1}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    5. *-commutative N/A

       \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{t \cdot \left(\color{blue}{t \cdot \left(2 \cdot \frac{1}{t}\right)} + t\right) + 1}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    6. *-rgt-identity N/A

       \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{t \cdot \left(t \cdot \left(2 \cdot \frac{1}{t}\right) + \color{blue}{t \cdot 1}\right) + 1}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    7. distribute-lft-in N/A

       \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{t \cdot \color{blue}{\left(t \cdot \left(2 \cdot \frac{1}{t} + 1\right)\right)} + 1}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    8. +-commutative N/A

       \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{t \cdot \left(t \cdot \color{blue}{\left(1 + 2 \cdot \frac{1}{t}\right)}\right) + 1}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    9. *-commutative N/A

       \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{t \cdot \color{blue}{\left(\left(1 + 2 \cdot \frac{1}{t}\right) \cdot t\right)} + 1}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    10. lower-fma.f64 N/A

        \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\color{blue}{\mathsf{fma}\left(t, \left(1 + 2 \cdot \frac{1}{t}\right) \cdot t, 1\right)}}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    11. *-commutative N/A

        \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\mathsf{fma}\left(t, \color{blue}{t \cdot \left(1 + 2 \cdot \frac{1}{t}\right)}, 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    12. distribute-lft-in N/A

        \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\mathsf{fma}\left(t, \color{blue}{t \cdot 1 + t \cdot \left(2 \cdot \frac{1}{t}\right)}, 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    13. *-rgt-identity N/A

        \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\mathsf{fma}\left(t, \color{blue}{t} + t \cdot \left(2 \cdot \frac{1}{t}\right), 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    14. *-commutative N/A

        \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\mathsf{fma}\left(t, t + t \cdot \color{blue}{\left(\frac{1}{t} \cdot 2\right)}, 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    15. associate-*r* N/A

        \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\mathsf{fma}\left(t, t + \color{blue}{\left(t \cdot \frac{1}{t}\right) \cdot 2}, 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    16. rgt-mult-inverse N/A

        \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\mathsf{fma}\left(t, t + \color{blue}{1} \cdot 2, 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    17. metadata-eval N/A

        \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\mathsf{fma}\left(t, t + \color{blue}{2}, 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    18. +-commutative N/A

        \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\mathsf{fma}\left(t, \color{blue}{2 + t}, 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

    19. lower-+.f64 100.0

        \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\mathsf{fma}\left(t, \color{blue}{2 + t}, 1\right)}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

11. Simplified 100.0%

    \[\leadsto 1 - \frac{1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\color{blue}{\mathsf{fma}\left(t, 2 + t, 1\right)}}}{2 - \frac{-2}{t + 1}}, 2 - \frac{2}{t + 1}, 2\right)} \]

12. Final simplification 100.0%

    \[\leadsto 1 + \frac{-1}{\mathsf{fma}\left(\frac{4 - \frac{4}{\mathsf{fma}\left(t, t + 2, 1\right)}}{2 + \frac{-2}{-1 - t}}, 2 + \frac{2}{-1 - t}, 2\right)} \]
13. Add Preprocessing

Alternative 2: 98.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 + \frac{\frac{2}{t}}{-1 + \frac{-1}{t}}\\ \mathbf{if}\;\frac{1}{2 + t\_1 \cdot t\_1} \leq 0.4:\\ \;\;\;\;0.8333333333333334\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.5 - t \cdot t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (+ 2.0 (/ (/ 2.0 t) (+ -1.0 (/ -1.0 t))))))
   (if (<= (/ 1.0 (+ 2.0 (* t_1 t_1))) 0.4)
     0.8333333333333334
     (- 1.0 (- 0.5 (* t t))))))

C

double code(double t) {
	double t_1 = 2.0 + ((2.0 / t) / (-1.0 + (-1.0 / t)));
	double tmp;
	if ((1.0 / (2.0 + (t_1 * t_1))) <= 0.4) {
		tmp = 0.8333333333333334;
	} else {
		tmp = 1.0 - (0.5 - (t * t));
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 2.0d0 + ((2.0d0 / t) / ((-1.0d0) + ((-1.0d0) / t)))
    if ((1.0d0 / (2.0d0 + (t_1 * t_1))) <= 0.4d0) then
        tmp = 0.8333333333333334d0
    else
        tmp = 1.0d0 - (0.5d0 - (t * t))
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double t_1 = 2.0 + ((2.0 / t) / (-1.0 + (-1.0 / t)));
	double tmp;
	if ((1.0 / (2.0 + (t_1 * t_1))) <= 0.4) {
		tmp = 0.8333333333333334;
	} else {
		tmp = 1.0 - (0.5 - (t * t));
	}
	return tmp;
}

Python

def code(t):
	t_1 = 2.0 + ((2.0 / t) / (-1.0 + (-1.0 / t)))
	tmp = 0
	if (1.0 / (2.0 + (t_1 * t_1))) <= 0.4:
		tmp = 0.8333333333333334
	else:
		tmp = 1.0 - (0.5 - (t * t))
	return tmp

Julia

function code(t)
	t_1 = Float64(2.0 + Float64(Float64(2.0 / t) / Float64(-1.0 + Float64(-1.0 / t))))
	tmp = 0.0
	if (Float64(1.0 / Float64(2.0 + Float64(t_1 * t_1))) <= 0.4)
		tmp = 0.8333333333333334;
	else
		tmp = Float64(1.0 - Float64(0.5 - Float64(t * t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	t_1 = 2.0 + ((2.0 / t) / (-1.0 + (-1.0 / t)));
	tmp = 0.0;
	if ((1.0 / (2.0 + (t_1 * t_1))) <= 0.4)
		tmp = 0.8333333333333334;
	else
		tmp = 1.0 - (0.5 - (t * t));
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := Block[{t$95$1 = N[(2.0 + N[(N[(2.0 / t), $MachinePrecision] / N[(-1.0 + N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.4], 0.8333333333333334, N[(1.0 - N[(0.5 - N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))) < 0.40000000000000002

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Simplified 97.3%

      \[\leadsto \color{blue}{0.8333333333333334} \]

   if 0.40000000000000002 < (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))))))

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. mul-1-neg N/A

         \[\leadsto 1 - \left(\frac{1}{2} + \color{blue}{\left(\mathsf{neg}\left({t}^{2}\right)\right)}\right) \]

      2. unsub-neg N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{1}{2} - {t}^{2}\right)} \]

      3. lower--.f64 N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{1}{2} - {t}^{2}\right)} \]

      4. unpow2 N/A

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

      5. lower-*.f64 98.1

         \[\leadsto 1 - \left(0.5 - \color{blue}{t \cdot t}\right) \]

   5. Simplified 98.1%

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

4. Final simplification 97.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{1}{2 + \left(2 + \frac{\frac{2}{t}}{-1 + \frac{-1}{t}}\right) \cdot \left(2 + \frac{\frac{2}{t}}{-1 + \frac{-1}{t}}\right)} \leq 0.4:\\ \;\;\;\;0.8333333333333334\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.5 - t \cdot t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 + \frac{\frac{2}{t}}{-1 + \frac{-1}{t}}\\ \mathbf{if}\;\frac{1}{2 + t\_1 \cdot t\_1} \leq 0.4:\\ \;\;\;\;0.8333333333333334\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t, t, 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (+ 2.0 (/ (/ 2.0 t) (+ -1.0 (/ -1.0 t))))))
   (if (<= (/ 1.0 (+ 2.0 (* t_1 t_1))) 0.4) 0.8333333333333334 (fma t t 0.5))))

C

double code(double t) {
	double t_1 = 2.0 + ((2.0 / t) / (-1.0 + (-1.0 / t)));
	double tmp;
	if ((1.0 / (2.0 + (t_1 * t_1))) <= 0.4) {
		tmp = 0.8333333333333334;
	} else {
		tmp = fma(t, t, 0.5);
	}
	return tmp;
}

Julia

function code(t)
	t_1 = Float64(2.0 + Float64(Float64(2.0 / t) / Float64(-1.0 + Float64(-1.0 / t))))
	tmp = 0.0
	if (Float64(1.0 / Float64(2.0 + Float64(t_1 * t_1))) <= 0.4)
		tmp = 0.8333333333333334;
	else
		tmp = fma(t, t, 0.5);
	end
	return tmp
end

Wolfram

code[t_] := Block[{t$95$1 = N[(2.0 + N[(N[(2.0 / t), $MachinePrecision] / N[(-1.0 + N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.4], 0.8333333333333334, N[(t * t + 0.5), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))))) < 0.40000000000000002

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Simplified 97.3%

      \[\leadsto \color{blue}{0.8333333333333334} \]

   if 0.40000000000000002 < (/.f64 #s(literal 1 binary64) (+.f64 #s(literal 2 binary64) (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))))))

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\frac{1}{2} + {t}^{2}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{{t}^{2} + \frac{1}{2}} \]

      2. unpow2 N/A

         \[\leadsto \color{blue}{t \cdot t} + \frac{1}{2} \]

      3. lower-fma.f64 98.1

         \[\leadsto \color{blue}{\mathsf{fma}\left(t, t, 0.5\right)} \]

   5. Simplified 98.1%

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

4. Final simplification 97.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{1}{2 + \left(2 + \frac{\frac{2}{t}}{-1 + \frac{-1}{t}}\right) \cdot \left(2 + \frac{\frac{2}{t}}{-1 + \frac{-1}{t}}\right)} \leq 0.4:\\ \;\;\;\;0.8333333333333334\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t, t, 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.5% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;0.8333333333333334 + \frac{\frac{0.037037037037037035 + \frac{0.04938271604938271}{t}}{t} + -0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{2 + \left(t \cdot t\right) \cdot \mathsf{fma}\left(t, \mathsf{fma}\left(t, \mathsf{fma}\left(t, -16, 12\right), -8\right), 4\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= (/ (/ 2.0 t) (- 1.0 (/ -1.0 t))) 1.0)
   (+
    0.8333333333333334
    (/
     (+
      (/ (+ 0.037037037037037035 (/ 0.04938271604938271 t)) t)
      -0.2222222222222222)
     t))
   (+
    1.0
    (/ -1.0 (+ 2.0 (* (* t t) (fma t (fma t (fma t -16.0 12.0) -8.0) 4.0)))))))

C

double code(double t) {
	double tmp;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0) {
		tmp = 0.8333333333333334 + ((((0.037037037037037035 + (0.04938271604938271 / t)) / t) + -0.2222222222222222) / t);
	} else {
		tmp = 1.0 + (-1.0 / (2.0 + ((t * t) * fma(t, fma(t, fma(t, -16.0, 12.0), -8.0), 4.0))));
	}
	return tmp;
}

Julia

function code(t)
	tmp = 0.0
	if (Float64(Float64(2.0 / t) / Float64(1.0 - Float64(-1.0 / t))) <= 1.0)
		tmp = Float64(0.8333333333333334 + Float64(Float64(Float64(Float64(0.037037037037037035 + Float64(0.04938271604938271 / t)) / t) + -0.2222222222222222) / t));
	else
		tmp = Float64(1.0 + Float64(-1.0 / Float64(2.0 + Float64(Float64(t * t) * fma(t, fma(t, fma(t, -16.0, 12.0), -8.0), 4.0)))));
	end
	return tmp
end

Wolfram

code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 - N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0], N[(0.8333333333333334 + N[(N[(N[(N[(0.037037037037037035 + N[(0.04938271604938271 / t), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] + -0.2222222222222222), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-1.0 / N[(2.0 + N[(N[(t * t), $MachinePrecision] * N[(t * N[(t * N[(t * -16.0 + 12.0), $MachinePrecision] + -8.0), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\left(\frac{5}{6} + \left(\frac{\frac{1}{27}}{{t}^{2}} + \frac{4}{81} \cdot \frac{1}{{t}^{3}}\right)\right) - \frac{2}{9} \cdot \frac{1}{t}} \]

   5. Simplified 99.0%

      \[\leadsto \color{blue}{0.8333333333333334 + \frac{\frac{0.037037037037037035 + \frac{0.04938271604938271}{t}}{t} + -0.2222222222222222}{t}} \]

   if 1 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{{t}^{2} \cdot \left(4 + t \cdot \left(t \cdot \left(12 + -16 \cdot t\right) - 8\right)\right)}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 1 - \frac{1}{2 + \color{blue}{{t}^{2} \cdot \left(4 + t \cdot \left(t \cdot \left(12 + -16 \cdot t\right) - 8\right)\right)}} \]

      2. unpow2 N/A

         \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(t \cdot t\right)} \cdot \left(4 + t \cdot \left(t \cdot \left(12 + -16 \cdot t\right) - 8\right)\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(t \cdot t\right)} \cdot \left(4 + t \cdot \left(t \cdot \left(12 + -16 \cdot t\right) - 8\right)\right)} \]

      4. +-commutative N/A

         \[\leadsto 1 - \frac{1}{2 + \left(t \cdot t\right) \cdot \color{blue}{\left(t \cdot \left(t \cdot \left(12 + -16 \cdot t\right) - 8\right) + 4\right)}} \]

      5. lower-fma.f64 N/A

         \[\leadsto 1 - \frac{1}{2 + \left(t \cdot t\right) \cdot \color{blue}{\mathsf{fma}\left(t, t \cdot \left(12 + -16 \cdot t\right) - 8, 4\right)}} \]

      6. sub-neg N/A

         \[\leadsto 1 - \frac{1}{2 + \left(t \cdot t\right) \cdot \mathsf{fma}\left(t, \color{blue}{t \cdot \left(12 + -16 \cdot t\right) + \left(\mathsf{neg}\left(8\right)\right)}, 4\right)} \]

      7. metadata-eval N/A

         \[\leadsto 1 - \frac{1}{2 + \left(t \cdot t\right) \cdot \mathsf{fma}\left(t, t \cdot \left(12 + -16 \cdot t\right) + \color{blue}{-8}, 4\right)} \]

      8. lower-fma.f64 N/A

         \[\leadsto 1 - \frac{1}{2 + \left(t \cdot t\right) \cdot \mathsf{fma}\left(t, \color{blue}{\mathsf{fma}\left(t, 12 + -16 \cdot t, -8\right)}, 4\right)} \]

      9. +-commutative N/A

         \[\leadsto 1 - \frac{1}{2 + \left(t \cdot t\right) \cdot \mathsf{fma}\left(t, \mathsf{fma}\left(t, \color{blue}{-16 \cdot t + 12}, -8\right), 4\right)} \]

      10. *-commutative N/A

          \[\leadsto 1 - \frac{1}{2 + \left(t \cdot t\right) \cdot \mathsf{fma}\left(t, \mathsf{fma}\left(t, \color{blue}{t \cdot -16} + 12, -8\right), 4\right)} \]

      11. lower-fma.f64 99.0

          \[\leadsto 1 - \frac{1}{2 + \left(t \cdot t\right) \cdot \mathsf{fma}\left(t, \mathsf{fma}\left(t, \color{blue}{\mathsf{fma}\left(t, -16, 12\right)}, -8\right), 4\right)} \]

   5. Simplified 99.0%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(t \cdot t\right) \cdot \mathsf{fma}\left(t, \mathsf{fma}\left(t, \mathsf{fma}\left(t, -16, 12\right), -8\right), 4\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;0.8333333333333334 + \frac{\frac{0.037037037037037035 + \frac{0.04938271604938271}{t}}{t} + -0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{2 + \left(t \cdot t\right) \cdot \mathsf{fma}\left(t, \mathsf{fma}\left(t, \mathsf{fma}\left(t, -16, 12\right), -8\right), 4\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 99.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;0.8333333333333334 + \frac{\frac{0.037037037037037035 + \frac{0.04938271604938271}{t}}{t} + -0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t + -2, t \cdot \left(t \cdot t\right), \mathsf{fma}\left(t, t, 0.5\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= (/ (/ 2.0 t) (- 1.0 (/ -1.0 t))) 1.0)
   (+
    0.8333333333333334
    (/
     (+
      (/ (+ 0.037037037037037035 (/ 0.04938271604938271 t)) t)
      -0.2222222222222222)
     t))
   (fma (+ t -2.0) (* t (* t t)) (fma t t 0.5))))

C

double code(double t) {
	double tmp;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0) {
		tmp = 0.8333333333333334 + ((((0.037037037037037035 + (0.04938271604938271 / t)) / t) + -0.2222222222222222) / t);
	} else {
		tmp = fma((t + -2.0), (t * (t * t)), fma(t, t, 0.5));
	}
	return tmp;
}

Julia

function code(t)
	tmp = 0.0
	if (Float64(Float64(2.0 / t) / Float64(1.0 - Float64(-1.0 / t))) <= 1.0)
		tmp = Float64(0.8333333333333334 + Float64(Float64(Float64(Float64(0.037037037037037035 + Float64(0.04938271604938271 / t)) / t) + -0.2222222222222222) / t));
	else
		tmp = fma(Float64(t + -2.0), Float64(t * Float64(t * t)), fma(t, t, 0.5));
	end
	return tmp
end

Wolfram

code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 - N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0], N[(0.8333333333333334 + N[(N[(N[(N[(0.037037037037037035 + N[(0.04938271604938271 / t), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] + -0.2222222222222222), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(N[(t + -2.0), $MachinePrecision] * N[(t * N[(t * t), $MachinePrecision]), $MachinePrecision] + N[(t * t + 0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\left(\frac{5}{6} + \left(\frac{\frac{1}{27}}{{t}^{2}} + \frac{4}{81} \cdot \frac{1}{{t}^{3}}\right)\right) - \frac{2}{9} \cdot \frac{1}{t}} \]

   5. Simplified 99.0%

      \[\leadsto \color{blue}{0.8333333333333334 + \frac{\frac{0.037037037037037035 + \frac{0.04938271604938271}{t}}{t} + -0.2222222222222222}{t}} \]

   if 1 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   4. Applied egg-rr 100.0%

      \[\leadsto 1 - \color{blue}{\frac{2 + \left(2 - \frac{2}{\mathsf{fma}\left(t, \frac{1}{t}, t\right)}\right) \cdot \left(\frac{2}{\mathsf{fma}\left(t, \frac{1}{t}, t\right)} + -2\right)}{4 - {\left(2 - \frac{2}{\mathsf{fma}\left(t, \frac{1}{t}, t\right)}\right)}^{4}}} \]

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + t \cdot \left(t - 2\right)\right) + \frac{1}{2}} \]

      2. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({t}^{2}, 1 + t \cdot \left(t - 2\right), \frac{1}{2}\right)} \]

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. lower-+.f64 98.7

         \[\leadsto \mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t, \color{blue}{t + -2}, 1\right), 0.5\right) \]

   7. Simplified 98.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t, t + -2, 1\right), 0.5\right)} \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. associate-+l+ N/A

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

      6. lift-*.f64 N/A

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

      7. lift-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. associate-*l* N/A

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

      10. lift-*.f64 N/A

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

      11. cube-mult N/A

          \[\leadsto \left(t + -2\right) \cdot \color{blue}{{t}^{3}} + \mathsf{fma}\left(t, t, \frac{1}{2}\right) \]

      12. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(t + -2, {t}^{3}, \mathsf{fma}\left(t, t, \frac{1}{2}\right)\right)} \]

      13. cube-mult N/A

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

      14. lift-*.f64 N/A

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

      15. lower-*.f64 98.7

          \[\leadsto \mathsf{fma}\left(t + -2, \color{blue}{t \cdot \left(t \cdot t\right)}, \mathsf{fma}\left(t, t, 0.5\right)\right) \]

   9. Applied egg-rr 98.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t + -2, t \cdot \left(t \cdot t\right), \mathsf{fma}\left(t, t, 0.5\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;0.8333333333333334 + \frac{\frac{0.037037037037037035 + \frac{0.04938271604938271}{t}}{t} + -0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t + -2, t \cdot \left(t \cdot t\right), \mathsf{fma}\left(t, t, 0.5\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 99.4% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;0.8333333333333334 + \frac{\mathsf{fma}\left(t, -0.2222222222222222, 0.037037037037037035\right)}{t \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t + -2, t \cdot \left(t \cdot t\right), \mathsf{fma}\left(t, t, 0.5\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= (/ (/ 2.0 t) (- 1.0 (/ -1.0 t))) 1.0)
   (+
    0.8333333333333334
    (/ (fma t -0.2222222222222222 0.037037037037037035) (* t t)))
   (fma (+ t -2.0) (* t (* t t)) (fma t t 0.5))))

C

double code(double t) {
	double tmp;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0) {
		tmp = 0.8333333333333334 + (fma(t, -0.2222222222222222, 0.037037037037037035) / (t * t));
	} else {
		tmp = fma((t + -2.0), (t * (t * t)), fma(t, t, 0.5));
	}
	return tmp;
}

Julia

function code(t)
	tmp = 0.0
	if (Float64(Float64(2.0 / t) / Float64(1.0 - Float64(-1.0 / t))) <= 1.0)
		tmp = Float64(0.8333333333333334 + Float64(fma(t, -0.2222222222222222, 0.037037037037037035) / Float64(t * t)));
	else
		tmp = fma(Float64(t + -2.0), Float64(t * Float64(t * t)), fma(t, t, 0.5));
	end
	return tmp
end

Wolfram

code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 - N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0], N[(0.8333333333333334 + N[(N[(t * -0.2222222222222222 + 0.037037037037037035), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t + -2.0), $MachinePrecision] * N[(t * N[(t * t), $MachinePrecision]), $MachinePrecision] + N[(t * t + 0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\left(\frac{5}{6} + \frac{\frac{1}{27}}{{t}^{2}}\right) - \frac{2}{9} \cdot \frac{1}{t}} \]
   4. Step-by-step derivation

      1. associate--l+ N/A

         \[\leadsto \color{blue}{\frac{5}{6} + \left(\frac{\frac{1}{27}}{{t}^{2}} - \frac{2}{9} \cdot \frac{1}{t}\right)} \]

      2. unpow2 N/A

         \[\leadsto \frac{5}{6} + \left(\frac{\frac{1}{27}}{\color{blue}{t \cdot t}} - \frac{2}{9} \cdot \frac{1}{t}\right) \]

      3. associate-/r* N/A

         \[\leadsto \frac{5}{6} + \left(\color{blue}{\frac{\frac{\frac{1}{27}}{t}}{t}} - \frac{2}{9} \cdot \frac{1}{t}\right) \]

      4. metadata-eval N/A

         \[\leadsto \frac{5}{6} + \left(\frac{\frac{\color{blue}{\frac{1}{27} \cdot 1}}{t}}{t} - \frac{2}{9} \cdot \frac{1}{t}\right) \]

      5. associate-*r/ N/A

         \[\leadsto \frac{5}{6} + \left(\frac{\color{blue}{\frac{1}{27} \cdot \frac{1}{t}}}{t} - \frac{2}{9} \cdot \frac{1}{t}\right) \]

      6. associate-*r/ N/A

         \[\leadsto \frac{5}{6} + \left(\frac{\frac{1}{27} \cdot \frac{1}{t}}{t} - \color{blue}{\frac{\frac{2}{9} \cdot 1}{t}}\right) \]

      7. metadata-eval N/A

         \[\leadsto \frac{5}{6} + \left(\frac{\frac{1}{27} \cdot \frac{1}{t}}{t} - \frac{\color{blue}{\frac{2}{9}}}{t}\right) \]

      8. div-sub N/A

         \[\leadsto \frac{5}{6} + \color{blue}{\frac{\frac{1}{27} \cdot \frac{1}{t} - \frac{2}{9}}{t}} \]

      9. lower-+.f64 N/A

         \[\leadsto \color{blue}{\frac{5}{6} + \frac{\frac{1}{27} \cdot \frac{1}{t} - \frac{2}{9}}{t}} \]

      10. lower-/.f64 N/A

          \[\leadsto \frac{5}{6} + \color{blue}{\frac{\frac{1}{27} \cdot \frac{1}{t} - \frac{2}{9}}{t}} \]

      11. sub-neg N/A

          \[\leadsto \frac{5}{6} + \frac{\color{blue}{\frac{1}{27} \cdot \frac{1}{t} + \left(\mathsf{neg}\left(\frac{2}{9}\right)\right)}}{t} \]

      12. lower-+.f64 N/A

          \[\leadsto \frac{5}{6} + \frac{\color{blue}{\frac{1}{27} \cdot \frac{1}{t} + \left(\mathsf{neg}\left(\frac{2}{9}\right)\right)}}{t} \]

      13. associate-*r/ N/A

          \[\leadsto \frac{5}{6} + \frac{\color{blue}{\frac{\frac{1}{27} \cdot 1}{t}} + \left(\mathsf{neg}\left(\frac{2}{9}\right)\right)}{t} \]

      14. metadata-eval N/A

          \[\leadsto \frac{5}{6} + \frac{\frac{\color{blue}{\frac{1}{27}}}{t} + \left(\mathsf{neg}\left(\frac{2}{9}\right)\right)}{t} \]

      15. lower-/.f64 N/A

          \[\leadsto \frac{5}{6} + \frac{\color{blue}{\frac{\frac{1}{27}}{t}} + \left(\mathsf{neg}\left(\frac{2}{9}\right)\right)}{t} \]

      16. metadata-eval 98.9

          \[\leadsto 0.8333333333333334 + \frac{\frac{0.037037037037037035}{t} + \color{blue}{-0.2222222222222222}}{t} \]

   5. Simplified 98.9%

      \[\leadsto \color{blue}{0.8333333333333334 + \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}} \]

   6. Taylor expanded in t around 0

      \[\leadsto \frac{5}{6} + \color{blue}{\frac{\frac{1}{27} + \frac{-2}{9} \cdot t}{{t}^{2}}} \]
   7. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{5}{6} + \color{blue}{\frac{\frac{1}{27} + \frac{-2}{9} \cdot t}{{t}^{2}}} \]

      2. +-commutative N/A

         \[\leadsto \frac{5}{6} + \frac{\color{blue}{\frac{-2}{9} \cdot t + \frac{1}{27}}}{{t}^{2}} \]

      3. *-commutative N/A

         \[\leadsto \frac{5}{6} + \frac{\color{blue}{t \cdot \frac{-2}{9}} + \frac{1}{27}}{{t}^{2}} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{5}{6} + \frac{\color{blue}{\mathsf{fma}\left(t, \frac{-2}{9}, \frac{1}{27}\right)}}{{t}^{2}} \]

      5. unpow2 N/A

         \[\leadsto \frac{5}{6} + \frac{\mathsf{fma}\left(t, \frac{-2}{9}, \frac{1}{27}\right)}{\color{blue}{t \cdot t}} \]

      6. lower-*.f64 98.9

         \[\leadsto 0.8333333333333334 + \frac{\mathsf{fma}\left(t, -0.2222222222222222, 0.037037037037037035\right)}{\color{blue}{t \cdot t}} \]

   8. Simplified 98.9%

      \[\leadsto 0.8333333333333334 + \color{blue}{\frac{\mathsf{fma}\left(t, -0.2222222222222222, 0.037037037037037035\right)}{t \cdot t}} \]

   if 1 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   4. Applied egg-rr 100.0%

      \[\leadsto 1 - \color{blue}{\frac{2 + \left(2 - \frac{2}{\mathsf{fma}\left(t, \frac{1}{t}, t\right)}\right) \cdot \left(\frac{2}{\mathsf{fma}\left(t, \frac{1}{t}, t\right)} + -2\right)}{4 - {\left(2 - \frac{2}{\mathsf{fma}\left(t, \frac{1}{t}, t\right)}\right)}^{4}}} \]

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + t \cdot \left(t - 2\right)\right) + \frac{1}{2}} \]

      2. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({t}^{2}, 1 + t \cdot \left(t - 2\right), \frac{1}{2}\right)} \]

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. lower-+.f64 98.7

         \[\leadsto \mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t, \color{blue}{t + -2}, 1\right), 0.5\right) \]

   7. Simplified 98.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t \cdot t, \mathsf{fma}\left(t, t + -2, 1\right), 0.5\right)} \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. associate-+l+ N/A

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

      6. lift-*.f64 N/A

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

      7. lift-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. associate-*l* N/A

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

      10. lift-*.f64 N/A

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

      11. cube-mult N/A

          \[\leadsto \left(t + -2\right) \cdot \color{blue}{{t}^{3}} + \mathsf{fma}\left(t, t, \frac{1}{2}\right) \]

      12. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(t + -2, {t}^{3}, \mathsf{fma}\left(t, t, \frac{1}{2}\right)\right)} \]

      13. cube-mult N/A

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

      14. lift-*.f64 N/A

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

      15. lower-*.f64 98.7

          \[\leadsto \mathsf{fma}\left(t + -2, \color{blue}{t \cdot \left(t \cdot t\right)}, \mathsf{fma}\left(t, t, 0.5\right)\right) \]

   9. Applied egg-rr 98.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t + -2, t \cdot \left(t \cdot t\right), \mathsf{fma}\left(t, t, 0.5\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;0.8333333333333334 + \frac{\mathsf{fma}\left(t, -0.2222222222222222, 0.037037037037037035\right)}{t \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t + -2, t \cdot \left(t \cdot t\right), \mathsf{fma}\left(t, t, 0.5\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 99.4% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;0.8333333333333334 + \frac{\mathsf{fma}\left(t, -0.2222222222222222, 0.037037037037037035\right)}{t \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t, \mathsf{fma}\left(t \cdot t, t + -2, t\right), 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= (/ (/ 2.0 t) (- 1.0 (/ -1.0 t))) 1.0)
   (+
    0.8333333333333334
    (/ (fma t -0.2222222222222222 0.037037037037037035) (* t t)))
   (fma t (fma (* t t) (+ t -2.0) t) 0.5)))

C

double code(double t) {
	double tmp;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0) {
		tmp = 0.8333333333333334 + (fma(t, -0.2222222222222222, 0.037037037037037035) / (t * t));
	} else {
		tmp = fma(t, fma((t * t), (t + -2.0), t), 0.5);
	}
	return tmp;
}

Julia

function code(t)
	tmp = 0.0
	if (Float64(Float64(2.0 / t) / Float64(1.0 - Float64(-1.0 / t))) <= 1.0)
		tmp = Float64(0.8333333333333334 + Float64(fma(t, -0.2222222222222222, 0.037037037037037035) / Float64(t * t)));
	else
		tmp = fma(t, fma(Float64(t * t), Float64(t + -2.0), t), 0.5);
	end
	return tmp
end

Wolfram

code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 - N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0], N[(0.8333333333333334 + N[(N[(t * -0.2222222222222222 + 0.037037037037037035), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(t * t), $MachinePrecision] * N[(t + -2.0), $MachinePrecision] + t), $MachinePrecision] + 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\left(\frac{5}{6} + \frac{\frac{1}{27}}{{t}^{2}}\right) - \frac{2}{9} \cdot \frac{1}{t}} \]
   4. Step-by-step derivation

      1. associate--l+ N/A

         \[\leadsto \color{blue}{\frac{5}{6} + \left(\frac{\frac{1}{27}}{{t}^{2}} - \frac{2}{9} \cdot \frac{1}{t}\right)} \]

      2. unpow2 N/A

         \[\leadsto \frac{5}{6} + \left(\frac{\frac{1}{27}}{\color{blue}{t \cdot t}} - \frac{2}{9} \cdot \frac{1}{t}\right) \]

      3. associate-/r* N/A

         \[\leadsto \frac{5}{6} + \left(\color{blue}{\frac{\frac{\frac{1}{27}}{t}}{t}} - \frac{2}{9} \cdot \frac{1}{t}\right) \]

      4. metadata-eval N/A

         \[\leadsto \frac{5}{6} + \left(\frac{\frac{\color{blue}{\frac{1}{27} \cdot 1}}{t}}{t} - \frac{2}{9} \cdot \frac{1}{t}\right) \]

      5. associate-*r/ N/A

         \[\leadsto \frac{5}{6} + \left(\frac{\color{blue}{\frac{1}{27} \cdot \frac{1}{t}}}{t} - \frac{2}{9} \cdot \frac{1}{t}\right) \]

      6. associate-*r/ N/A

         \[\leadsto \frac{5}{6} + \left(\frac{\frac{1}{27} \cdot \frac{1}{t}}{t} - \color{blue}{\frac{\frac{2}{9} \cdot 1}{t}}\right) \]

      7. metadata-eval N/A

         \[\leadsto \frac{5}{6} + \left(\frac{\frac{1}{27} \cdot \frac{1}{t}}{t} - \frac{\color{blue}{\frac{2}{9}}}{t}\right) \]

      8. div-sub N/A

         \[\leadsto \frac{5}{6} + \color{blue}{\frac{\frac{1}{27} \cdot \frac{1}{t} - \frac{2}{9}}{t}} \]

      9. lower-+.f64 N/A

         \[\leadsto \color{blue}{\frac{5}{6} + \frac{\frac{1}{27} \cdot \frac{1}{t} - \frac{2}{9}}{t}} \]

      10. lower-/.f64 N/A

          \[\leadsto \frac{5}{6} + \color{blue}{\frac{\frac{1}{27} \cdot \frac{1}{t} - \frac{2}{9}}{t}} \]

      11. sub-neg N/A

          \[\leadsto \frac{5}{6} + \frac{\color{blue}{\frac{1}{27} \cdot \frac{1}{t} + \left(\mathsf{neg}\left(\frac{2}{9}\right)\right)}}{t} \]

      12. lower-+.f64 N/A

          \[\leadsto \frac{5}{6} + \frac{\color{blue}{\frac{1}{27} \cdot \frac{1}{t} + \left(\mathsf{neg}\left(\frac{2}{9}\right)\right)}}{t} \]

      13. associate-*r/ N/A

          \[\leadsto \frac{5}{6} + \frac{\color{blue}{\frac{\frac{1}{27} \cdot 1}{t}} + \left(\mathsf{neg}\left(\frac{2}{9}\right)\right)}{t} \]

      14. metadata-eval N/A

          \[\leadsto \frac{5}{6} + \frac{\frac{\color{blue}{\frac{1}{27}}}{t} + \left(\mathsf{neg}\left(\frac{2}{9}\right)\right)}{t} \]

      15. lower-/.f64 N/A

          \[\leadsto \frac{5}{6} + \frac{\color{blue}{\frac{\frac{1}{27}}{t}} + \left(\mathsf{neg}\left(\frac{2}{9}\right)\right)}{t} \]

      16. metadata-eval 98.9

          \[\leadsto 0.8333333333333334 + \frac{\frac{0.037037037037037035}{t} + \color{blue}{-0.2222222222222222}}{t} \]

   5. Simplified 98.9%

      \[\leadsto \color{blue}{0.8333333333333334 + \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}} \]

   6. Taylor expanded in t around 0

      \[\leadsto \frac{5}{6} + \color{blue}{\frac{\frac{1}{27} + \frac{-2}{9} \cdot t}{{t}^{2}}} \]
   7. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{5}{6} + \color{blue}{\frac{\frac{1}{27} + \frac{-2}{9} \cdot t}{{t}^{2}}} \]

      2. +-commutative N/A

         \[\leadsto \frac{5}{6} + \frac{\color{blue}{\frac{-2}{9} \cdot t + \frac{1}{27}}}{{t}^{2}} \]

      3. *-commutative N/A

         \[\leadsto \frac{5}{6} + \frac{\color{blue}{t \cdot \frac{-2}{9}} + \frac{1}{27}}{{t}^{2}} \]

      4. lower-fma.f64 N/A

         \[\leadsto \frac{5}{6} + \frac{\color{blue}{\mathsf{fma}\left(t, \frac{-2}{9}, \frac{1}{27}\right)}}{{t}^{2}} \]

      5. unpow2 N/A

         \[\leadsto \frac{5}{6} + \frac{\mathsf{fma}\left(t, \frac{-2}{9}, \frac{1}{27}\right)}{\color{blue}{t \cdot t}} \]

      6. lower-*.f64 98.9

         \[\leadsto 0.8333333333333334 + \frac{\mathsf{fma}\left(t, -0.2222222222222222, 0.037037037037037035\right)}{\color{blue}{t \cdot t}} \]

   8. Simplified 98.9%

      \[\leadsto 0.8333333333333334 + \color{blue}{\frac{\mathsf{fma}\left(t, -0.2222222222222222, 0.037037037037037035\right)}{t \cdot t}} \]

   if 1 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + t \cdot \left(t - 2\right)\right) + \frac{1}{2}} \]

      2. unpow2 N/A

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

      3. associate-*l* N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. distribute-lft-in N/A

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

      7. associate-*r* N/A

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

      8. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(t, \color{blue}{{t}^{2}} \cdot \left(t - 2\right) + t \cdot 1, \frac{1}{2}\right) \]

      9. *-rgt-identity N/A

         \[\leadsto \mathsf{fma}\left(t, {t}^{2} \cdot \left(t - 2\right) + \color{blue}{t}, \frac{1}{2}\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(t, \color{blue}{\mathsf{fma}\left({t}^{2}, t - 2, t\right)}, \frac{1}{2}\right) \]

      11. unpow2 N/A

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

      12. lower-*.f64 N/A

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

      13. sub-neg N/A

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

      14. metadata-eval N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 98.7

          \[\leadsto \mathsf{fma}\left(t, \mathsf{fma}\left(t \cdot t, \color{blue}{-2 + t}, t\right), 0.5\right) \]

   5. Simplified 98.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(t \cdot t, -2 + t, t\right), 0.5\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;0.8333333333333334 + \frac{\mathsf{fma}\left(t, -0.2222222222222222, 0.037037037037037035\right)}{t \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t, \mathsf{fma}\left(t \cdot t, t + -2, t\right), 0.5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 99.3% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;2 + \frac{\frac{2}{t}}{-1 + \frac{-1}{t}} \leq 0.4:\\ \;\;\;\;\mathsf{fma}\left(t, \mathsf{fma}\left(t \cdot t, t + -2, t\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 + \frac{-0.2222222222222222}{t}\right) - 0.16666666666666666\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= (+ 2.0 (/ (/ 2.0 t) (+ -1.0 (/ -1.0 t)))) 0.4)
   (fma t (fma (* t t) (+ t -2.0) t) 0.5)
   (- (+ 1.0 (/ -0.2222222222222222 t)) 0.16666666666666666)))

C

double code(double t) {
	double tmp;
	if ((2.0 + ((2.0 / t) / (-1.0 + (-1.0 / t)))) <= 0.4) {
		tmp = fma(t, fma((t * t), (t + -2.0), t), 0.5);
	} else {
		tmp = (1.0 + (-0.2222222222222222 / t)) - 0.16666666666666666;
	}
	return tmp;
}

Julia

function code(t)
	tmp = 0.0
	if (Float64(2.0 + Float64(Float64(2.0 / t) / Float64(-1.0 + Float64(-1.0 / t)))) <= 0.4)
		tmp = fma(t, fma(Float64(t * t), Float64(t + -2.0), t), 0.5);
	else
		tmp = Float64(Float64(1.0 + Float64(-0.2222222222222222 / t)) - 0.16666666666666666);
	end
	return tmp
end

Wolfram

code[t_] := If[LessEqual[N[(2.0 + N[(N[(2.0 / t), $MachinePrecision] / N[(-1.0 + N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.4], N[(t * N[(N[(t * t), $MachinePrecision] * N[(t + -2.0), $MachinePrecision] + t), $MachinePrecision] + 0.5), $MachinePrecision], N[(N[(1.0 + N[(-0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision] - 0.16666666666666666), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) < 0.40000000000000002

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + t \cdot \left(t - 2\right)\right) + \frac{1}{2}} \]

      2. unpow2 N/A

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

      3. associate-*l* N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. distribute-lft-in N/A

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

      7. associate-*r* N/A

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

      8. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(t, \color{blue}{{t}^{2}} \cdot \left(t - 2\right) + t \cdot 1, \frac{1}{2}\right) \]

      9. *-rgt-identity N/A

         \[\leadsto \mathsf{fma}\left(t, {t}^{2} \cdot \left(t - 2\right) + \color{blue}{t}, \frac{1}{2}\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(t, \color{blue}{\mathsf{fma}\left({t}^{2}, t - 2, t\right)}, \frac{1}{2}\right) \]

      11. unpow2 N/A

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

      12. lower-*.f64 N/A

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

      13. sub-neg N/A

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

      14. metadata-eval N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 98.7

          \[\leadsto \mathsf{fma}\left(t, \mathsf{fma}\left(t \cdot t, \color{blue}{-2 + t}, t\right), 0.5\right) \]

   5. Simplified 98.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(t \cdot t, -2 + t, t\right), 0.5\right)} \]

   if 0.40000000000000002 < (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{2}{9} \cdot \frac{1}{t} + \frac{1}{6}\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{2}{9} \cdot \frac{1}{t} + \frac{1}{6}\right)} \]

      3. associate-*r/ N/A

         \[\leadsto 1 - \left(\color{blue}{\frac{\frac{2}{9} \cdot 1}{t}} + \frac{1}{6}\right) \]

      4. metadata-eval N/A

         \[\leadsto 1 - \left(\frac{\color{blue}{\frac{2}{9}}}{t} + \frac{1}{6}\right) \]

      5. lower-/.f64 98.7

         \[\leadsto 1 - \left(\color{blue}{\frac{0.2222222222222222}{t}} + 0.16666666666666666\right) \]

   5. Simplified 98.7%

      \[\leadsto 1 - \color{blue}{\left(\frac{0.2222222222222222}{t} + 0.16666666666666666\right)} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 1 - \left(\color{blue}{\frac{\frac{2}{9}}{t}} + \frac{1}{6}\right) \]

      2. associate--r+ N/A

         \[\leadsto \color{blue}{\left(1 - \frac{\frac{2}{9}}{t}\right) - \frac{1}{6}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(1 - \frac{\frac{2}{9}}{t}\right) - \frac{1}{6}} \]

      4. sub-neg N/A

         \[\leadsto \color{blue}{\left(1 + \left(\mathsf{neg}\left(\frac{\frac{2}{9}}{t}\right)\right)\right)} - \frac{1}{6} \]

      5. lift-/.f64 N/A

         \[\leadsto \left(1 + \left(\mathsf{neg}\left(\color{blue}{\frac{\frac{2}{9}}{t}}\right)\right)\right) - \frac{1}{6} \]

      6. distribute-frac-neg2 N/A

         \[\leadsto \left(1 + \color{blue}{\frac{\frac{2}{9}}{\mathsf{neg}\left(t\right)}}\right) - \frac{1}{6} \]

      7. metadata-eval N/A

         \[\leadsto \left(1 + \frac{\color{blue}{\mathsf{neg}\left(\frac{-2}{9}\right)}}{\mathsf{neg}\left(t\right)}\right) - \frac{1}{6} \]

      8. frac-2neg N/A

         \[\leadsto \left(1 + \color{blue}{\frac{\frac{-2}{9}}{t}}\right) - \frac{1}{6} \]

      9. lift-/.f64 N/A

         \[\leadsto \left(1 + \color{blue}{\frac{\frac{-2}{9}}{t}}\right) - \frac{1}{6} \]

      10. lower-+.f64 98.7

          \[\leadsto \color{blue}{\left(1 + \frac{-0.2222222222222222}{t}\right)} - 0.16666666666666666 \]

   7. Applied egg-rr 98.7%

      \[\leadsto \color{blue}{\left(1 + \frac{-0.2222222222222222}{t}\right) - 0.16666666666666666} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;2 + \frac{\frac{2}{t}}{-1 + \frac{-1}{t}} \leq 0.4:\\ \;\;\;\;\mathsf{fma}\left(t, \mathsf{fma}\left(t \cdot t, t + -2, t\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 + \frac{-0.2222222222222222}{t}\right) - 0.16666666666666666\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 99.3% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;2 + \frac{\frac{2}{t}}{-1 + \frac{-1}{t}} \leq 0.4:\\ \;\;\;\;\mathsf{fma}\left(t, \mathsf{fma}\left(-2, t \cdot t, t\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 + \frac{-0.2222222222222222}{t}\right) - 0.16666666666666666\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= (+ 2.0 (/ (/ 2.0 t) (+ -1.0 (/ -1.0 t)))) 0.4)
   (fma t (fma -2.0 (* t t) t) 0.5)
   (- (+ 1.0 (/ -0.2222222222222222 t)) 0.16666666666666666)))

C

double code(double t) {
	double tmp;
	if ((2.0 + ((2.0 / t) / (-1.0 + (-1.0 / t)))) <= 0.4) {
		tmp = fma(t, fma(-2.0, (t * t), t), 0.5);
	} else {
		tmp = (1.0 + (-0.2222222222222222 / t)) - 0.16666666666666666;
	}
	return tmp;
}

Julia

function code(t)
	tmp = 0.0
	if (Float64(2.0 + Float64(Float64(2.0 / t) / Float64(-1.0 + Float64(-1.0 / t)))) <= 0.4)
		tmp = fma(t, fma(-2.0, Float64(t * t), t), 0.5);
	else
		tmp = Float64(Float64(1.0 + Float64(-0.2222222222222222 / t)) - 0.16666666666666666);
	end
	return tmp
end

Wolfram

code[t_] := If[LessEqual[N[(2.0 + N[(N[(2.0 / t), $MachinePrecision] / N[(-1.0 + N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.4], N[(t * N[(-2.0 * N[(t * t), $MachinePrecision] + t), $MachinePrecision] + 0.5), $MachinePrecision], N[(N[(1.0 + N[(-0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision] - 0.16666666666666666), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))) < 0.40000000000000002

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + -2 \cdot t\right) + \frac{1}{2}} \]

      2. unpow2 N/A

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

      3. associate-*l* N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. distribute-lft1-in N/A

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

      8. associate-*l* N/A

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

      9. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(t, -2 \cdot \color{blue}{{t}^{2}} + t, \frac{1}{2}\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(t, \color{blue}{\mathsf{fma}\left(-2, {t}^{2}, t\right)}, \frac{1}{2}\right) \]

      11. unpow2 N/A

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

      12. lower-*.f64 98.6

          \[\leadsto \mathsf{fma}\left(t, \mathsf{fma}\left(-2, \color{blue}{t \cdot t}, t\right), 0.5\right) \]

   5. Simplified 98.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(-2, t \cdot t, t\right), 0.5\right)} \]

   if 0.40000000000000002 < (-.f64 #s(literal 2 binary64) (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))))

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{2}{9} \cdot \frac{1}{t} + \frac{1}{6}\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{2}{9} \cdot \frac{1}{t} + \frac{1}{6}\right)} \]

      3. associate-*r/ N/A

         \[\leadsto 1 - \left(\color{blue}{\frac{\frac{2}{9} \cdot 1}{t}} + \frac{1}{6}\right) \]

      4. metadata-eval N/A

         \[\leadsto 1 - \left(\frac{\color{blue}{\frac{2}{9}}}{t} + \frac{1}{6}\right) \]

      5. lower-/.f64 98.7

         \[\leadsto 1 - \left(\color{blue}{\frac{0.2222222222222222}{t}} + 0.16666666666666666\right) \]

   5. Simplified 98.7%

      \[\leadsto 1 - \color{blue}{\left(\frac{0.2222222222222222}{t} + 0.16666666666666666\right)} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 1 - \left(\color{blue}{\frac{\frac{2}{9}}{t}} + \frac{1}{6}\right) \]

      2. associate--r+ N/A

         \[\leadsto \color{blue}{\left(1 - \frac{\frac{2}{9}}{t}\right) - \frac{1}{6}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(1 - \frac{\frac{2}{9}}{t}\right) - \frac{1}{6}} \]

      4. sub-neg N/A

         \[\leadsto \color{blue}{\left(1 + \left(\mathsf{neg}\left(\frac{\frac{2}{9}}{t}\right)\right)\right)} - \frac{1}{6} \]

      5. lift-/.f64 N/A

         \[\leadsto \left(1 + \left(\mathsf{neg}\left(\color{blue}{\frac{\frac{2}{9}}{t}}\right)\right)\right) - \frac{1}{6} \]

      6. distribute-frac-neg2 N/A

         \[\leadsto \left(1 + \color{blue}{\frac{\frac{2}{9}}{\mathsf{neg}\left(t\right)}}\right) - \frac{1}{6} \]

      7. metadata-eval N/A

         \[\leadsto \left(1 + \frac{\color{blue}{\mathsf{neg}\left(\frac{-2}{9}\right)}}{\mathsf{neg}\left(t\right)}\right) - \frac{1}{6} \]

      8. frac-2neg N/A

         \[\leadsto \left(1 + \color{blue}{\frac{\frac{-2}{9}}{t}}\right) - \frac{1}{6} \]

      9. lift-/.f64 N/A

         \[\leadsto \left(1 + \color{blue}{\frac{\frac{-2}{9}}{t}}\right) - \frac{1}{6} \]

      10. lower-+.f64 98.7

          \[\leadsto \color{blue}{\left(1 + \frac{-0.2222222222222222}{t}\right)} - 0.16666666666666666 \]

   7. Applied egg-rr 98.7%

      \[\leadsto \color{blue}{\left(1 + \frac{-0.2222222222222222}{t}\right) - 0.16666666666666666} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;2 + \frac{\frac{2}{t}}{-1 + \frac{-1}{t}} \leq 0.4:\\ \;\;\;\;\mathsf{fma}\left(t, \mathsf{fma}\left(-2, t \cdot t, t\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 + \frac{-0.2222222222222222}{t}\right) - 0.16666666666666666\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 99.2% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;\left(1 + \frac{-0.2222222222222222}{t}\right) - 0.16666666666666666\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.5 - t \cdot t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= (/ (/ 2.0 t) (- 1.0 (/ -1.0 t))) 1.0)
   (- (+ 1.0 (/ -0.2222222222222222 t)) 0.16666666666666666)
   (- 1.0 (- 0.5 (* t t)))))

C

double code(double t) {
	double tmp;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0) {
		tmp = (1.0 + (-0.2222222222222222 / t)) - 0.16666666666666666;
	} else {
		tmp = 1.0 - (0.5 - (t * t));
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((2.0d0 / t) / (1.0d0 - ((-1.0d0) / t))) <= 1.0d0) then
        tmp = (1.0d0 + ((-0.2222222222222222d0) / t)) - 0.16666666666666666d0
    else
        tmp = 1.0d0 - (0.5d0 - (t * t))
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0) {
		tmp = (1.0 + (-0.2222222222222222 / t)) - 0.16666666666666666;
	} else {
		tmp = 1.0 - (0.5 - (t * t));
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if ((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0:
		tmp = (1.0 + (-0.2222222222222222 / t)) - 0.16666666666666666
	else:
		tmp = 1.0 - (0.5 - (t * t))
	return tmp

Julia

function code(t)
	tmp = 0.0
	if (Float64(Float64(2.0 / t) / Float64(1.0 - Float64(-1.0 / t))) <= 1.0)
		tmp = Float64(Float64(1.0 + Float64(-0.2222222222222222 / t)) - 0.16666666666666666);
	else
		tmp = Float64(1.0 - Float64(0.5 - Float64(t * t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0)
		tmp = (1.0 + (-0.2222222222222222 / t)) - 0.16666666666666666;
	else
		tmp = 1.0 - (0.5 - (t * t));
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 - N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0], N[(N[(1.0 + N[(-0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision] - 0.16666666666666666), $MachinePrecision], N[(1.0 - N[(0.5 - N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{2}{9} \cdot \frac{1}{t} + \frac{1}{6}\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{2}{9} \cdot \frac{1}{t} + \frac{1}{6}\right)} \]

      3. associate-*r/ N/A

         \[\leadsto 1 - \left(\color{blue}{\frac{\frac{2}{9} \cdot 1}{t}} + \frac{1}{6}\right) \]

      4. metadata-eval N/A

         \[\leadsto 1 - \left(\frac{\color{blue}{\frac{2}{9}}}{t} + \frac{1}{6}\right) \]

      5. lower-/.f64 98.7

         \[\leadsto 1 - \left(\color{blue}{\frac{0.2222222222222222}{t}} + 0.16666666666666666\right) \]

   5. Simplified 98.7%

      \[\leadsto 1 - \color{blue}{\left(\frac{0.2222222222222222}{t} + 0.16666666666666666\right)} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 1 - \left(\color{blue}{\frac{\frac{2}{9}}{t}} + \frac{1}{6}\right) \]

      2. associate--r+ N/A

         \[\leadsto \color{blue}{\left(1 - \frac{\frac{2}{9}}{t}\right) - \frac{1}{6}} \]

      3. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(1 - \frac{\frac{2}{9}}{t}\right) - \frac{1}{6}} \]

      4. sub-neg N/A

         \[\leadsto \color{blue}{\left(1 + \left(\mathsf{neg}\left(\frac{\frac{2}{9}}{t}\right)\right)\right)} - \frac{1}{6} \]

      5. lift-/.f64 N/A

         \[\leadsto \left(1 + \left(\mathsf{neg}\left(\color{blue}{\frac{\frac{2}{9}}{t}}\right)\right)\right) - \frac{1}{6} \]

      6. distribute-frac-neg2 N/A

         \[\leadsto \left(1 + \color{blue}{\frac{\frac{2}{9}}{\mathsf{neg}\left(t\right)}}\right) - \frac{1}{6} \]

      7. metadata-eval N/A

         \[\leadsto \left(1 + \frac{\color{blue}{\mathsf{neg}\left(\frac{-2}{9}\right)}}{\mathsf{neg}\left(t\right)}\right) - \frac{1}{6} \]

      8. frac-2neg N/A

         \[\leadsto \left(1 + \color{blue}{\frac{\frac{-2}{9}}{t}}\right) - \frac{1}{6} \]

      9. lift-/.f64 N/A

         \[\leadsto \left(1 + \color{blue}{\frac{\frac{-2}{9}}{t}}\right) - \frac{1}{6} \]

      10. lower-+.f64 98.7

          \[\leadsto \color{blue}{\left(1 + \frac{-0.2222222222222222}{t}\right)} - 0.16666666666666666 \]

   7. Applied egg-rr 98.7%

      \[\leadsto \color{blue}{\left(1 + \frac{-0.2222222222222222}{t}\right) - 0.16666666666666666} \]

   if 1 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. mul-1-neg N/A

         \[\leadsto 1 - \left(\frac{1}{2} + \color{blue}{\left(\mathsf{neg}\left({t}^{2}\right)\right)}\right) \]

      2. unsub-neg N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{1}{2} - {t}^{2}\right)} \]

      3. lower--.f64 N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{1}{2} - {t}^{2}\right)} \]

      4. unpow2 N/A

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

      5. lower-*.f64 98.1

         \[\leadsto 1 - \left(0.5 - \color{blue}{t \cdot t}\right) \]

   5. Simplified 98.1%

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

4. Final simplification 98.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;\left(1 + \frac{-0.2222222222222222}{t}\right) - 0.16666666666666666\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.5 - t \cdot t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 99.2% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;1 - \left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.5 - t \cdot t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= (/ (/ 2.0 t) (- 1.0 (/ -1.0 t))) 1.0)
   (- 1.0 (+ 0.16666666666666666 (/ 0.2222222222222222 t)))
   (- 1.0 (- 0.5 (* t t)))))

C

double code(double t) {
	double tmp;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0) {
		tmp = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t));
	} else {
		tmp = 1.0 - (0.5 - (t * t));
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((2.0d0 / t) / (1.0d0 - ((-1.0d0) / t))) <= 1.0d0) then
        tmp = 1.0d0 - (0.16666666666666666d0 + (0.2222222222222222d0 / t))
    else
        tmp = 1.0d0 - (0.5d0 - (t * t))
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0) {
		tmp = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t));
	} else {
		tmp = 1.0 - (0.5 - (t * t));
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if ((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0:
		tmp = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t))
	else:
		tmp = 1.0 - (0.5 - (t * t))
	return tmp

Julia

function code(t)
	tmp = 0.0
	if (Float64(Float64(2.0 / t) / Float64(1.0 - Float64(-1.0 / t))) <= 1.0)
		tmp = Float64(1.0 - Float64(0.16666666666666666 + Float64(0.2222222222222222 / t)));
	else
		tmp = Float64(1.0 - Float64(0.5 - Float64(t * t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0)
		tmp = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t));
	else
		tmp = 1.0 - (0.5 - (t * t));
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 - N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0], N[(1.0 - N[(0.16666666666666666 + N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(0.5 - N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{2}{9} \cdot \frac{1}{t} + \frac{1}{6}\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{2}{9} \cdot \frac{1}{t} + \frac{1}{6}\right)} \]

      3. associate-*r/ N/A

         \[\leadsto 1 - \left(\color{blue}{\frac{\frac{2}{9} \cdot 1}{t}} + \frac{1}{6}\right) \]

      4. metadata-eval N/A

         \[\leadsto 1 - \left(\frac{\color{blue}{\frac{2}{9}}}{t} + \frac{1}{6}\right) \]

      5. lower-/.f64 98.7

         \[\leadsto 1 - \left(\color{blue}{\frac{0.2222222222222222}{t}} + 0.16666666666666666\right) \]

   5. Simplified 98.7%

      \[\leadsto 1 - \color{blue}{\left(\frac{0.2222222222222222}{t} + 0.16666666666666666\right)} \]

   if 1 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. mul-1-neg N/A

         \[\leadsto 1 - \left(\frac{1}{2} + \color{blue}{\left(\mathsf{neg}\left({t}^{2}\right)\right)}\right) \]

      2. unsub-neg N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{1}{2} - {t}^{2}\right)} \]

      3. lower--.f64 N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{1}{2} - {t}^{2}\right)} \]

      4. unpow2 N/A

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

      5. lower-*.f64 98.1

         \[\leadsto 1 - \left(0.5 - \color{blue}{t \cdot t}\right) \]

   5. Simplified 98.1%

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

4. Final simplification 98.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;1 - \left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.5 - t \cdot t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 99.2% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;0.8333333333333334 + \frac{-0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.5 - t \cdot t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= (/ (/ 2.0 t) (- 1.0 (/ -1.0 t))) 1.0)
   (+ 0.8333333333333334 (/ -0.2222222222222222 t))
   (- 1.0 (- 0.5 (* t t)))))

C

double code(double t) {
	double tmp;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0) {
		tmp = 0.8333333333333334 + (-0.2222222222222222 / t);
	} else {
		tmp = 1.0 - (0.5 - (t * t));
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((2.0d0 / t) / (1.0d0 - ((-1.0d0) / t))) <= 1.0d0) then
        tmp = 0.8333333333333334d0 + ((-0.2222222222222222d0) / t)
    else
        tmp = 1.0d0 - (0.5d0 - (t * t))
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0) {
		tmp = 0.8333333333333334 + (-0.2222222222222222 / t);
	} else {
		tmp = 1.0 - (0.5 - (t * t));
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if ((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0:
		tmp = 0.8333333333333334 + (-0.2222222222222222 / t)
	else:
		tmp = 1.0 - (0.5 - (t * t))
	return tmp

Julia

function code(t)
	tmp = 0.0
	if (Float64(Float64(2.0 / t) / Float64(1.0 - Float64(-1.0 / t))) <= 1.0)
		tmp = Float64(0.8333333333333334 + Float64(-0.2222222222222222 / t));
	else
		tmp = Float64(1.0 - Float64(0.5 - Float64(t * t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0)
		tmp = 0.8333333333333334 + (-0.2222222222222222 / t);
	else
		tmp = 1.0 - (0.5 - (t * t));
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 - N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0], N[(0.8333333333333334 + N[(-0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(0.5 - N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\frac{5}{6} - \frac{2}{9} \cdot \frac{1}{t}} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\frac{5}{6} + \left(\mathsf{neg}\left(\frac{2}{9} \cdot \frac{1}{t}\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto \color{blue}{\frac{5}{6} + \left(\mathsf{neg}\left(\frac{2}{9} \cdot \frac{1}{t}\right)\right)} \]

      3. associate-*r/ N/A

         \[\leadsto \frac{5}{6} + \left(\mathsf{neg}\left(\color{blue}{\frac{\frac{2}{9} \cdot 1}{t}}\right)\right) \]

      4. metadata-eval N/A

         \[\leadsto \frac{5}{6} + \left(\mathsf{neg}\left(\frac{\color{blue}{\frac{2}{9}}}{t}\right)\right) \]

      5. distribute-neg-frac N/A

         \[\leadsto \frac{5}{6} + \color{blue}{\frac{\mathsf{neg}\left(\frac{2}{9}\right)}{t}} \]

      6. lower-/.f64 N/A

         \[\leadsto \frac{5}{6} + \color{blue}{\frac{\mathsf{neg}\left(\frac{2}{9}\right)}{t}} \]

      7. metadata-eval 98.6

         \[\leadsto 0.8333333333333334 + \frac{\color{blue}{-0.2222222222222222}}{t} \]

   5. Simplified 98.6%

      \[\leadsto \color{blue}{0.8333333333333334 + \frac{-0.2222222222222222}{t}} \]

   if 1 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. mul-1-neg N/A

         \[\leadsto 1 - \left(\frac{1}{2} + \color{blue}{\left(\mathsf{neg}\left({t}^{2}\right)\right)}\right) \]

      2. unsub-neg N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{1}{2} - {t}^{2}\right)} \]

      3. lower--.f64 N/A

         \[\leadsto 1 - \color{blue}{\left(\frac{1}{2} - {t}^{2}\right)} \]

      4. unpow2 N/A

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

      5. lower-*.f64 98.1

         \[\leadsto 1 - \left(0.5 - \color{blue}{t \cdot t}\right) \]

   5. Simplified 98.1%

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

4. Final simplification 98.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;0.8333333333333334 + \frac{-0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.5 - t \cdot t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 100.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 + \frac{-2}{1 + t}\\ 1 + \frac{-1}{\mathsf{fma}\left(t\_1, t\_1, 2\right)} \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (+ 2.0 (/ -2.0 (+ 1.0 t))))) (+ 1.0 (/ -1.0 (fma t_1 t_1 2.0)))))

C

double code(double t) {
	double t_1 = 2.0 + (-2.0 / (1.0 + t));
	return 1.0 + (-1.0 / fma(t_1, t_1, 2.0));
}

Julia

function code(t)
	t_1 = Float64(2.0 + Float64(-2.0 / Float64(1.0 + t)))
	return Float64(1.0 + Float64(-1.0 / fma(t_1, t_1, 2.0)))
end

Wolfram

code[t_] := Block[{t$95$1 = N[(2.0 + N[(-2.0 / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(1.0 + N[(-1.0 / N[(t$95$1 * t$95$1 + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 100.0%

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

   1. lift-/.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift-/.f64 N/A

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

   5. lift--.f64 N/A

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

   6. lift-/.f64 N/A

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

   7. lift-+.f64 N/A

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

   8. lift-/.f64 N/A

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

   9. lift-/.f64 N/A

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

   10. lift--.f64 N/A

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

   11. lift-*.f64 N/A

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

   12. +-commutative N/A

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

4. Applied egg-rr 100.0%

   \[\leadsto 1 - \frac{1}{\color{blue}{\mathsf{fma}\left(2 - \frac{2}{\mathsf{fma}\left(t, \frac{1}{t}, t\right)}, 2 - \frac{2}{\mathsf{fma}\left(t, \frac{1}{t}, t\right)}, 2\right)}} \]
5. Step-by-step derivation

   1. lift-/.f64 N/A

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

   2. lift-fma.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift--.f64 N/A

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

   5. lift-/.f64 N/A

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

   6. lift-fma.f64 N/A

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

   7. lift-/.f64 N/A

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

   8. lift--.f64 N/A

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

   9. lift-fma.f64 100.0

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

6. Applied egg-rr 100.0%

   \[\leadsto 1 - \frac{1}{\color{blue}{\mathsf{fma}\left(2 + \frac{-2}{t + 1}, 2 + \frac{-2}{t + 1}, 2\right)}} \]

7. Final simplification 100.0%

   \[\leadsto 1 + \frac{-1}{\mathsf{fma}\left(2 + \frac{-2}{1 + t}, 2 + \frac{-2}{1 + t}, 2\right)} \]
8. Add Preprocessing

Alternative 14: 98.5% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;0.8333333333333334\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= (/ (/ 2.0 t) (- 1.0 (/ -1.0 t))) 1.0) 0.8333333333333334 0.5))

C

double code(double t) {
	double tmp;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0) {
		tmp = 0.8333333333333334;
	} else {
		tmp = 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((2.0d0 / t) / (1.0d0 - ((-1.0d0) / t))) <= 1.0d0) then
        tmp = 0.8333333333333334d0
    else
        tmp = 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0) {
		tmp = 0.8333333333333334;
	} else {
		tmp = 0.5;
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if ((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0:
		tmp = 0.8333333333333334
	else:
		tmp = 0.5
	return tmp

Julia

function code(t)
	tmp = 0.0
	if (Float64(Float64(2.0 / t) / Float64(1.0 - Float64(-1.0 / t))) <= 1.0)
		tmp = 0.8333333333333334;
	else
		tmp = 0.5;
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if (((2.0 / t) / (1.0 - (-1.0 / t))) <= 1.0)
		tmp = 0.8333333333333334;
	else
		tmp = 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[LessEqual[N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 - N[(-1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0], 0.8333333333333334, 0.5]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t))) < 1

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Simplified 97.3%

      \[\leadsto \color{blue}{0.8333333333333334} \]

   if 1 < (/.f64 (/.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) t)))

   1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

   5. Simplified 97.7%

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

4. Final simplification 97.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\frac{2}{t}}{1 - \frac{-1}{t}} \leq 1:\\ \;\;\;\;0.8333333333333334\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 59.2% accurate, 101.0× speedup

Math

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

FPCore

(FPCore (t) :precision binary64 0.5)

C

double code(double t) {
	return 0.5;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    code = 0.5d0
end function

Java

public static double code(double t) {
	return 0.5;
}

Python

def code(t):
	return 0.5

Julia

function code(t)
	return 0.5
end

MATLAB

function tmp = code(t)
	tmp = 0.5;
end

Wolfram

code[t_] := 0.5

Derivation

1. Initial program 100.0%

   \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
2. Add Preprocessing

3. Taylor expanded in t around 0

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

5. Simplified 59.6%

   \[\leadsto \color{blue}{0.5} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024207 
(FPCore (t)
  :name "Kahan p13 Example 3"
  :precision binary64
  (- 1.0 (/ 1.0 (+ 2.0 (* (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))) (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))))))))