Average Error: 51.1 → 0.6
Time: 4.8m
Precision: 64
Internal Precision: 1152
\[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c_n}}\]
↓
\[\begin{array}{l} \mathbf{if}\;s \le -8.038839838415106 \cdot 10^{-193}:\\ \;\;\;\;\frac{{\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c_n}}{{\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c_n}} \cdot \frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c_p}}{\left(\log \frac{1}{2} + t \cdot \frac{1}{2}\right) \cdot c_p + 1}\\ \mathbf{if}\;s \le 3.5149560548150004 \cdot 10^{-48}:\\ \;\;\;\;1 + \left(s \cdot \frac{1}{2}\right) \cdot \left(c_p - c_n\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{{\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c_n}}{{\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c_n}} \cdot \frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c_p}}{\left(\log \frac{1}{2} + t \cdot \frac{1}{2}\right) \cdot c_p + 1}\\ \end{array}\]

Error

Bits error versus c_p

Bits error versus c_n

Bits error versus t

Bits error versus s

Target

Original51.1
Target41.8
Herbie0.6
\[{\left(\frac{1 + e^{-t}}{1 + e^{-s}}\right)}^{c_p} \cdot {\left(\frac{1 + e^{t}}{1 + e^{s}}\right)}^{c_n}\]

Derivation

  1. Split input into 2 regimes

  2. if s < -8.038839838415106e-193 or 3.5149560548150004e-48 < s

    1. Initial program 48.3

      \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c_n}}\]

    2. Taylor expanded around 0 1.1

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

    3. Applied simplify1.1

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

    if -8.038839838415106e-193 < s < 3.5149560548150004e-48

    1. Initial program 54.4

      \[\frac{{\left(\frac{1}{1 + e^{-s}}\right)}^{c_p} \cdot {\left(1 - \frac{1}{1 + e^{-s}}\right)}^{c_n}}{{\left(\frac{1}{1 + e^{-t}}\right)}^{c_p} \cdot {\left(1 - \frac{1}{1 + e^{-t}}\right)}^{c_n}}\]

    2. Taylor expanded around 0 0.0

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

    3. Applied simplify0.0

      \[\leadsto \color{blue}{1 + \left(s \cdot \frac{1}{2}\right) \cdot \left(c_p - c_n\right)}\]
  3. Recombined 2 regimes into one program.
  4. Removed slow pow expressions.

Runtime

Time bar (total: 4.8m)Debug log

herbie shell --seed '#(1567391828 2030694642 2833800258 828025724 3004380912 3532991858)' +o setup:early-exit +o reduce:binary-search
(FPCore (c_p c_n t s)
  :name "Harley's example"
  :pre (and (< 0 c_p) (< 0 c_n))

  :herbie-target
  (* (pow (/ (+ 1 (exp (- t))) (+ 1 (exp (- s)))) c_p) (pow (/ (+ 1 (exp t)) (+ 1 (exp s))) c_n))

  (/ (* (pow (/ 1 (+ 1 (exp (- s)))) c_p) (pow (- 1 (/ 1 (+ 1 (exp (- s))))) c_n)) (* (pow (/ 1 (+ 1 (exp (- t)))) c_p) (pow (- 1 (/ 1 (+ 1 (exp (- t))))) c_n))))