Average Error: 51.7 → 0.3
Time: 32.7s
Precision: 64
Internal precision: 1152
\[\frac{{\left(\frac1{1 + e^{-s}}\right)}^{c_p} \cdot {\left(1 - \frac1{1 + e^{-s}}\right)}^{c_n}}{{\left(\frac1{1 + e^{-t}}\right)}^{c_p} \cdot {\left(1 - \frac1{1 + e^{-t}}\right)}^{c_n}}\]
⬇
\[\begin{array}{l} \mathbf{if}\;s \le -2.7743962440478614 \cdot 10^{-65}:\\ \;\;\;\;\frac{{\left(1 - \frac1{1 + e^{-s}}\right)}^{c_n}}{{\left(1 - \frac1{1 + e^{-t}}\right)}^{c_n}} \cdot \frac{{\left(\frac1{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 5.274109478826914 \cdot 10^{-10}:\\ \;\;\;\;1 + \left(s \cdot \frac{1}{2}\right) \cdot \left(c_p - c_n\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{{\left(1 - \frac1{1 + e^{-s}}\right)}^{c_n}}{{\left(1 - \frac1{1 + e^{-t}}\right)}^{c_n}} \cdot \frac{{\left(\frac1{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.7
Comparison42.5
Herbie0.3
\[ {\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 < -2.7743962440478614e-65 or 5.274109478826914e-10 < s

    1. Initial program 46.7

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

    2. Applied taylor 0.9

      \[\leadsto \frac{{\left(\frac1{1 + e^{-s}}\right)}^{c_p} \cdot {\left(1 - \frac1{1 + e^{-s}}\right)}^{c_n}}{\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 - \frac1{1 + e^{-t}}\right)}^{c_n}}\]

    3. Taylor expanded around 0 0.9

      \[\leadsto \frac{{\left(\frac1{1 + e^{-s}}\right)}^{c_p} \cdot {\left(1 - \frac1{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 - \frac1{1 + e^{-t}}\right)}^{c_n}}\]

    4. Applied simplify 0.9

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

    if -2.7743962440478614e-65 < s < 5.274109478826914e-10

    1. Initial program 54.8

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

    2. Applied taylor 0.0

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

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

    4. Applied simplify 0.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: 32.7s) Debug logProfile

Please include this information when filing a bug report:

herbie shell --seed '#(1064524629 4159152179 2999149171 575749698 4006532819 692958815)'
(FPCore (c_p c_n t s)
  :name "Harley's example"
  :pre (and (< 0 c_p) (< 0 c_n))

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

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