Kahan p13 Example 3

Percentage Accurate: 100.0% → 100.0%

Time: 7.1s

Alternatives: 13

Speedup: N/A×

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(t)
use fmin_fmax_functions
    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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(t)
use fmin_fmax_functions
    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.3× speedup

Math

\[\begin{array}{l} \\ 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{2}{t - -1}\right)} \end{array} \]

FPCore

(FPCore (t)
 :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))))))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[t_] := N[(1.0 - N[(1.0 / N[(2.0 + N[(N[(2.0 - N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 - N[(2.0 / N[(t - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 + \frac{1}{t}}\right) \cdot \left(2 - \color{blue}{\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}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\color{blue}{\frac{2}{t}}}{1 + \frac{1}{t}}\right)} \]

   3. associate-/l/ N/A

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

   4. lower-/.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{2}{t \cdot \left(1 + \frac{1}{t}\right)}}\right)} \]

   5. *-commutative N/A

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

   6. lower-*.f64 100.0

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{2}{\color{blue}{\left(1 + \frac{1}{t}\right) \cdot 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{2}{\color{blue}{\left(1 + \frac{1}{t}\right)} \cdot t}\right)} \]

   8. +-commutative N/A

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

   9. metadata-eval N/A

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

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

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

   11. metadata-eval N/A

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

   12. metadata-eval N/A

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

   13. lower--.f64 100.0

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

   14. lift-/.f64 N/A

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

   15. inv-pow N/A

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

   16. lower-pow.f64 100.0

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

4. Applied rewrites 100.0%

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

5. Taylor expanded in t around 0

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

   1. lft-mult-inverse N/A

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

   2. *-lft-identity N/A

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

   3. distribute-rgt-in N/A

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

   4. +-commutative N/A

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

   5. distribute-rgt-in N/A

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

   6. *-lft-identity N/A

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

   7. lft-mult-inverse N/A

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

   8. metadata-eval N/A

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

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

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

   10. metadata-eval N/A

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

   11. metadata-eval N/A

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

   12. lower--.f64 100.0

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

7. Applied rewrites 100.0%

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

Alternative 2: 99.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ \mathbf{if}\;1 - \frac{1}{2 + t\_1 \cdot t\_1} \leq 0.6:\\ \;\;\;\;1 - \frac{1}{2 + \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-16, t, 12\right), t, -8\right), t, 4\right) \cdot t\right) \cdot t}\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.16666666666666666 - \frac{\frac{\frac{0.04938271604938271}{t} - -0.037037037037037035}{t} - 0.2222222222222222}{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 (/ 1.0 (+ 2.0 (* t_1 t_1)))) 0.6)
     (-
      1.0
      (/ 1.0 (+ 2.0 (* (* (fma (fma (fma -16.0 t 12.0) t -8.0) t 4.0) t) t))))
     (-
      1.0
      (-
       0.16666666666666666
       (/
        (-
         (/ (- (/ 0.04938271604938271 t) -0.037037037037037035) t)
         0.2222222222222222)
        t))))))

C

double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	double tmp;
	if ((1.0 - (1.0 / (2.0 + (t_1 * t_1)))) <= 0.6) {
		tmp = 1.0 - (1.0 / (2.0 + ((fma(fma(fma(-16.0, t, 12.0), t, -8.0), t, 4.0) * t) * t)));
	} else {
		tmp = 1.0 - (0.16666666666666666 - (((((0.04938271604938271 / t) - -0.037037037037037035) / t) - 0.2222222222222222) / 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(1.0 / Float64(2.0 + Float64(t_1 * t_1)))) <= 0.6)
		tmp = Float64(1.0 - Float64(1.0 / Float64(2.0 + Float64(Float64(fma(fma(fma(-16.0, t, 12.0), t, -8.0), t, 4.0) * t) * t))));
	else
		tmp = Float64(1.0 - Float64(0.16666666666666666 - Float64(Float64(Float64(Float64(Float64(0.04938271604938271 / t) - -0.037037037037037035) / t) - 0.2222222222222222) / t)));
	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[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.6], N[(1.0 - N[(1.0 / N[(2.0 + N[(N[(N[(N[(N[(-16.0 * t + 12.0), $MachinePrecision] * t + -8.0), $MachinePrecision] * t + 4.0), $MachinePrecision] * t), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(0.16666666666666666 - N[(N[(N[(N[(N[(0.04938271604938271 / t), $MachinePrecision] - -0.037037037037037035), $MachinePrecision] / t), $MachinePrecision] - 0.2222222222222222), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) (/.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.599999999999999978

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

   5. Applied rewrites 99.4%

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

   if 0.599999999999999978 < (-.f64 #s(literal 1 binary64) (/.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 inf

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

   5. Applied rewrites 98.3%

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

Alternative 3: 99.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ \mathbf{if}\;1 - \frac{1}{2 + t\_1 \cdot t\_1} \leq 0.6:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(t - 2, t, 1\right), t \cdot t, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.16666666666666666 - \frac{\frac{\frac{0.04938271604938271}{t} - -0.037037037037037035}{t} - 0.2222222222222222}{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 (/ 1.0 (+ 2.0 (* t_1 t_1)))) 0.6)
     (fma (fma (- t 2.0) t 1.0) (* t t) 0.5)
     (-
      1.0
      (-
       0.16666666666666666
       (/
        (-
         (/ (- (/ 0.04938271604938271 t) -0.037037037037037035) t)
         0.2222222222222222)
        t))))))

C

double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	double tmp;
	if ((1.0 - (1.0 / (2.0 + (t_1 * t_1)))) <= 0.6) {
		tmp = fma(fma((t - 2.0), t, 1.0), (t * t), 0.5);
	} else {
		tmp = 1.0 - (0.16666666666666666 - (((((0.04938271604938271 / t) - -0.037037037037037035) / t) - 0.2222222222222222) / 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(1.0 / Float64(2.0 + Float64(t_1 * t_1)))) <= 0.6)
		tmp = fma(fma(Float64(t - 2.0), t, 1.0), Float64(t * t), 0.5);
	else
		tmp = Float64(1.0 - Float64(0.16666666666666666 - Float64(Float64(Float64(Float64(Float64(0.04938271604938271 / t) - -0.037037037037037035) / t) - 0.2222222222222222) / t)));
	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[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.6], N[(N[(N[(t - 2.0), $MachinePrecision] * t + 1.0), $MachinePrecision] * N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision], N[(1.0 - N[(0.16666666666666666 - N[(N[(N[(N[(N[(0.04938271604938271 / t), $MachinePrecision] - -0.037037037037037035), $MachinePrecision] / t), $MachinePrecision] - 0.2222222222222222), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) (/.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.599999999999999978

   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. distribute-rgt-in N/A

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

      3. *-lft-identity N/A

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

      4. distribute-rgt1-in N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if 0.599999999999999978 < (-.f64 #s(literal 1 binary64) (/.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 inf

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

   5. Applied rewrites 98.3%

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

Alternative 4: 99.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ \mathbf{if}\;1 - \frac{1}{2 + t\_1 \cdot t\_1} \leq 0.6:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(t - 2, t, 1\right), t \cdot t, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222 - \frac{\frac{0.04938271604938271}{t} - -0.037037037037037035}{t}}{t}\\ \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 (/ 1.0 (+ 2.0 (* t_1 t_1)))) 0.6)
     (fma (fma (- t 2.0) t 1.0) (* t t) 0.5)
     (-
      0.8333333333333334
      (/
       (-
        0.2222222222222222
        (/ (- (/ 0.04938271604938271 t) -0.037037037037037035) 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 - (1.0 / (2.0 + (t_1 * t_1)))) <= 0.6) {
		tmp = fma(fma((t - 2.0), t, 1.0), (t * t), 0.5);
	} else {
		tmp = 0.8333333333333334 - ((0.2222222222222222 - (((0.04938271604938271 / t) - -0.037037037037037035) / 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(1.0 / Float64(2.0 + Float64(t_1 * t_1)))) <= 0.6)
		tmp = fma(fma(Float64(t - 2.0), t, 1.0), Float64(t * t), 0.5);
	else
		tmp = Float64(0.8333333333333334 - Float64(Float64(0.2222222222222222 - Float64(Float64(Float64(0.04938271604938271 / t) - -0.037037037037037035) / t)) / t));
	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[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.6], N[(N[(N[(t - 2.0), $MachinePrecision] * t + 1.0), $MachinePrecision] * N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision], N[(0.8333333333333334 - N[(N[(0.2222222222222222 - N[(N[(N[(0.04938271604938271 / t), $MachinePrecision] - -0.037037037037037035), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) (/.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.599999999999999978

   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. distribute-rgt-in N/A

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

      3. *-lft-identity N/A

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

      4. distribute-rgt1-in N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if 0.599999999999999978 < (-.f64 #s(literal 1 binary64) (/.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 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. Applied rewrites 98.3%

      \[\leadsto \color{blue}{0.8333333333333334 - \frac{0.2222222222222222 - \frac{\frac{0.04938271604938271}{t} - -0.037037037037037035}{t}}{t}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 99.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ \mathbf{if}\;1 - \frac{1}{2 + t\_1 \cdot t\_1} \leq 0.6:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(t - 2, t, 1\right), t \cdot t, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} - 0.2222222222222222}{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 (/ 1.0 (+ 2.0 (* t_1 t_1)))) 0.6)
     (fma (fma (- t 2.0) t 1.0) (* t t) 0.5)
     (-
      1.0
      (-
       0.16666666666666666
       (/ (- (/ 0.037037037037037035 t) 0.2222222222222222) t))))))

C

double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	double tmp;
	if ((1.0 - (1.0 / (2.0 + (t_1 * t_1)))) <= 0.6) {
		tmp = fma(fma((t - 2.0), t, 1.0), (t * t), 0.5);
	} else {
		tmp = 1.0 - (0.16666666666666666 - (((0.037037037037037035 / t) - 0.2222222222222222) / 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(1.0 / Float64(2.0 + Float64(t_1 * t_1)))) <= 0.6)
		tmp = fma(fma(Float64(t - 2.0), t, 1.0), Float64(t * t), 0.5);
	else
		tmp = Float64(1.0 - Float64(0.16666666666666666 - Float64(Float64(Float64(0.037037037037037035 / t) - 0.2222222222222222) / t)));
	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[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.6], N[(N[(N[(t - 2.0), $MachinePrecision] * t + 1.0), $MachinePrecision] * N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision], N[(1.0 - N[(0.16666666666666666 - N[(N[(N[(0.037037037037037035 / t), $MachinePrecision] - 0.2222222222222222), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) (/.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.599999999999999978

   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. distribute-rgt-in N/A

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

      3. *-lft-identity N/A

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

      4. distribute-rgt1-in N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if 0.599999999999999978 < (-.f64 #s(literal 1 binary64) (/.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 inf

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

      1. associate--l+ N/A

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

      2. associate-*r/ N/A

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

      3. metadata-eval N/A

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

      4. unpow2 N/A

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

      5. associate-/r* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. div-sub N/A

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

      9. *-lft-identity N/A

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

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

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

      11. metadata-eval N/A

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

      12. mul-1-neg N/A

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

      13. *-lft-identity N/A

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

      14. associate-*r/ N/A

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

      15. distribute-neg-frac N/A

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

   5. Applied rewrites 97.9%

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

Alternative 6: 99.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ \mathbf{if}\;1 - \frac{1}{2 + t\_1 \cdot t\_1} \leq 0.6:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(t - 2, t, 1\right), t \cdot t, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{0.037037037037037035}{t} - 0.2222222222222222}{t} + 0.8333333333333334\\ \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 (/ 1.0 (+ 2.0 (* t_1 t_1)))) 0.6)
     (fma (fma (- t 2.0) t 1.0) (* t t) 0.5)
     (+
      (/ (- (/ 0.037037037037037035 t) 0.2222222222222222) t)
      0.8333333333333334))))

C

double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	double tmp;
	if ((1.0 - (1.0 / (2.0 + (t_1 * t_1)))) <= 0.6) {
		tmp = fma(fma((t - 2.0), t, 1.0), (t * t), 0.5);
	} else {
		tmp = (((0.037037037037037035 / t) - 0.2222222222222222) / t) + 0.8333333333333334;
	}
	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(1.0 / Float64(2.0 + Float64(t_1 * t_1)))) <= 0.6)
		tmp = fma(fma(Float64(t - 2.0), t, 1.0), Float64(t * t), 0.5);
	else
		tmp = Float64(Float64(Float64(Float64(0.037037037037037035 / t) - 0.2222222222222222) / t) + 0.8333333333333334);
	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[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.6], N[(N[(N[(t - 2.0), $MachinePrecision] * t + 1.0), $MachinePrecision] * N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision], N[(N[(N[(N[(0.037037037037037035 / t), $MachinePrecision] - 0.2222222222222222), $MachinePrecision] / t), $MachinePrecision] + 0.8333333333333334), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) (/.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.599999999999999978

   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. distribute-rgt-in N/A

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

      3. *-lft-identity N/A

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

      4. distribute-rgt1-in N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if 0.599999999999999978 < (-.f64 #s(literal 1 binary64) (/.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 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. +-commutative N/A

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

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

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

      4. unpow2 N/A

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

      5. associate-/r* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

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

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

      9. associate-*r/ N/A

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

      10. metadata-eval N/A

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

      11. div-sub N/A

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

      12. lower-+.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. lower--.f64 N/A

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

      15. associate-*r/ N/A

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

      16. metadata-eval N/A

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

      17. lower-/.f64 97.9

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

   5. Applied rewrites 97.9%

      \[\leadsto \color{blue}{\frac{\frac{0.037037037037037035}{t} - 0.2222222222222222}{t} + 0.8333333333333334} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 99.2% accurate, 0.8× 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:\\ \;\;\;\;1 - \left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(t - 2, t, 1\right), t \cdot 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)
     (- 1.0 (+ 0.16666666666666666 (/ 0.2222222222222222 t)))
     (fma (fma (- t 2.0) t 1.0) (* 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 = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t));
	} else {
		tmp = fma(fma((t - 2.0), t, 1.0), (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 = Float64(1.0 - Float64(0.16666666666666666 + Float64(0.2222222222222222 / t)));
	else
		tmp = fma(fma(Float64(t - 2.0), t, 1.0), Float64(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], N[(1.0 - N[(0.16666666666666666 + N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t - 2.0), $MachinePrecision] * t + 1.0), $MachinePrecision] * N[(t * t), $MachinePrecision] + 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 1 - \color{blue}{\left(\frac{1}{6} + \frac{2}{9} \cdot \frac{1}{t}\right)} \]
   4. Step-by-step derivation

      1. lower-+.f64 N/A

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

      2. associate-*r/ N/A

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

      3. metadata-eval N/A

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

      4. lower-/.f64 97.5

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

   5. Applied rewrites 97.5%

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

   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} \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. distribute-rgt-in N/A

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

      3. *-lft-identity N/A

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

      4. distribute-rgt1-in N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 99.4

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

   5. Applied rewrites 99.4%

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

Alternative 8: 99.2% accurate, 0.8× 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:\\ \;\;\;\;1 - \left(0.16666666666666666 + \frac{0.2222222222222222}{t}\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-2, t, 1\right) \cdot 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)
     (- 1.0 (+ 0.16666666666666666 (/ 0.2222222222222222 t)))
     (fma (* (fma -2.0 t 1.0) 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 = 1.0 - (0.16666666666666666 + (0.2222222222222222 / t));
	} else {
		tmp = fma((fma(-2.0, t, 1.0) * 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 = Float64(1.0 - Float64(0.16666666666666666 + Float64(0.2222222222222222 / t)));
	else
		tmp = fma(Float64(fma(-2.0, t, 1.0) * 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], N[(1.0 - N[(0.16666666666666666 + N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-2.0 * t + 1.0), $MachinePrecision] * t), $MachinePrecision] * 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 1 - \color{blue}{\left(\frac{1}{6} + \frac{2}{9} \cdot \frac{1}{t}\right)} \]
   4. Step-by-step derivation

      1. lower-+.f64 N/A

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

      2. associate-*r/ N/A

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

      3. metadata-eval N/A

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

      4. lower-/.f64 97.5

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

   5. Applied rewrites 97.5%

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

   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} \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 \color{blue}{\left(t \cdot \left(1 + -2 \cdot t\right)\right) \cdot t} + \frac{1}{2} \]

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-fma.f64 99.2

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

   5. Applied rewrites 99.2%

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

Alternative 9: 99.2% accurate, 0.8× 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 - \frac{0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-2, t, 1\right) \cdot 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 (/ 0.2222222222222222 t))
     (fma (* (fma -2.0 t 1.0) 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 - (0.2222222222222222 / t);
	} else {
		tmp = fma((fma(-2.0, t, 1.0) * 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 = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t));
	else
		tmp = fma(Float64(fma(-2.0, t, 1.0) * 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], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-2.0 * t + 1.0), $MachinePrecision] * t), $MachinePrecision] * 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} - \frac{2}{9} \cdot \frac{1}{t}} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. associate-*r/ N/A

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

      3. metadata-eval N/A

         \[\leadsto \frac{5}{6} - \frac{\color{blue}{\frac{2}{9}}}{t} \]

      4. lower-/.f64 97.5

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

   5. Applied rewrites 97.5%

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

   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} \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 \color{blue}{\left(t \cdot \left(1 + -2 \cdot t\right)\right) \cdot t} + \frac{1}{2} \]

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-fma.f64 99.2

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

   5. Applied rewrites 99.2%

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

Alternative 10: 99.0% 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 - \frac{0.2222222222222222}{t}\\ \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 (/ 0.2222222222222222 t))
     (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 - (0.2222222222222222 / t);
	} 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 = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t));
	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], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], 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} - \frac{2}{9} \cdot \frac{1}{t}} \]
   4. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. associate-*r/ N/A

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

      3. metadata-eval N/A

         \[\leadsto \frac{5}{6} - \frac{\color{blue}{\frac{2}{9}}}{t} \]

      4. lower-/.f64 97.5

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

   5. Applied rewrites 97.5%

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

   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.7

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

   5. Applied rewrites 98.7%

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

Alternative 11: 98.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ \mathbf{if}\;1 - \frac{1}{2 + t\_1 \cdot t\_1} \leq 0.6:\\ \;\;\;\;\mathsf{fma}\left(t, t, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;0.8333333333333334\\ \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 (/ 1.0 (+ 2.0 (* t_1 t_1)))) 0.6)
     (fma t t 0.5)
     0.8333333333333334)))

C

double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	double tmp;
	if ((1.0 - (1.0 / (2.0 + (t_1 * t_1)))) <= 0.6) {
		tmp = fma(t, t, 0.5);
	} else {
		tmp = 0.8333333333333334;
	}
	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(1.0 / Float64(2.0 + Float64(t_1 * t_1)))) <= 0.6)
		tmp = fma(t, t, 0.5);
	else
		tmp = 0.8333333333333334;
	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[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.6], N[(t * t + 0.5), $MachinePrecision], 0.8333333333333334]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) (/.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.599999999999999978

   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.7

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

   5. Applied rewrites 98.7%

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

   if 0.599999999999999978 < (-.f64 #s(literal 1 binary64) (/.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 inf

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

   5. Applied rewrites 96.7%

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

Alternative 12: 98.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ \mathbf{if}\;1 - \frac{1}{2 + t\_1 \cdot t\_1} \leq 0.68:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;0.8333333333333334\\ \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 (/ 1.0 (+ 2.0 (* t_1 t_1)))) 0.68) 0.5 0.8333333333333334)))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(t)
use fmin_fmax_functions
    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 - (1.0d0 / (2.0d0 + (t_1 * t_1)))) <= 0.68d0) then
        tmp = 0.5d0
    else
        tmp = 0.8333333333333334d0
    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 - (1.0 / (2.0 + (t_1 * t_1)))) <= 0.68) {
		tmp = 0.5;
	} else {
		tmp = 0.8333333333333334;
	}
	return tmp;
}

Python

def code(t):
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)))
	tmp = 0
	if (1.0 - (1.0 / (2.0 + (t_1 * t_1)))) <= 0.68:
		tmp = 0.5
	else:
		tmp = 0.8333333333333334
	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(1.0 / Float64(2.0 + Float64(t_1 * t_1)))) <= 0.68)
		tmp = 0.5;
	else
		tmp = 0.8333333333333334;
	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 - (1.0 / (2.0 + (t_1 * t_1)))) <= 0.68)
		tmp = 0.5;
	else
		tmp = 0.8333333333333334;
	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[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.68], 0.5, 0.8333333333333334]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) (/.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.680000000000000049

   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. Applied rewrites 98.1%

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

   if 0.680000000000000049 < (-.f64 #s(literal 1 binary64) (/.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 inf

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

   5. Applied rewrites 96.7%

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

Alternative 13: 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(t)
use fmin_fmax_functions
    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. Applied rewrites 59.8%

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

Reproduce

herbie shell --seed 2025007 
(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)))))))))