\[\left(\left(\left(e + d\right) + c\right) + b\right) + a\]
Test:
Expression 1, p15
Bits:
128 bits
Bits error versus a
Bits error versus b
Bits error versus c
Bits error versus d
Bits error versus e
Time: 9.1 s
Input Error: 0.4
Output Error: 0.2
Log: ⚲
Profile: 🕒
\(\left(\left(a + b\right) + e\right) + \left(c + d\right)\)
  1. Started with
    \[\left(\left(\left(e + d\right) + c\right) + b\right) + a\]
    0.4
  2. Using strategy rm
    0.4
  3. Applied add-exp-log to get
    \[\left(\color{red}{\left(\left(e + d\right) + c\right)} + b\right) + a \leadsto \left(\color{blue}{e^{\log \left(\left(e + d\right) + c\right)}} + b\right) + a\]
    0.7
  4. Applied taylor to get
    \[\left(e^{\log \left(\left(e + d\right) + c\right)} + b\right) + a \leadsto \left(e^{\log \left(c + \left(d + e\right)\right)} + b\right) + a\]
    0.7
  5. Taylor expanded around 0 to get
    \[\left(e^{\log \color{red}{\left(c + \left(d + e\right)\right)}} + b\right) + a \leadsto \left(e^{\log \color{blue}{\left(c + \left(d + e\right)\right)}} + b\right) + a\]
    0.7
  6. Applied simplify to get
    \[\left(e^{\log \left(c + \left(d + e\right)\right)} + b\right) + a \leadsto \left(\left(a + b\right) + e\right) + \left(c + d\right)\]
    0.2
  7. Applied final simplification
  8. Removed slow pow expressions

Original test:


(lambda ((a (uniform 1 2)) (b (uniform 2 4)) (c (uniform 4 8)) (d (uniform 8 16)) (e (uniform 16 32)))
  #:name "Expression 1, p15"
  (+ (+ (+ (+ e d) c) b) a)
  #:target
  (+ (+ d (+ c (+ a b))) e))