Average Error: 0 → 0

Time: 8.0s

Precision: 64

\[\left(\left(\left(x + x\right) + x\right) + x\right) + x\]

↓

\[x \cdot 5\]

\left(\left(\left(x + x\right) + x\right) + x\right) + x

↓

x \cdot 5

double f(double x) {
        double r80191 = x;
        double r80192 = r80191 + r80191;
        double r80193 = r80192 + r80191;
        double r80194 = r80193 + r80191;
        double r80195 = r80194 + r80191;
        return r80195;
}

↓

double f(double x) {
        double r80196 = x;
        double r80197 = 5.0;
        double r80198 = r80196 * r80197;
        return r80198;
}

Error

The X axis uses an exponential scale — Bits error versus `x`

Try it out

In
Out

Enter valid numbers for all inputs

Derivation

Initial program 0
\[\left(\left(\left(x + x\right) + x\right) + x\right) + x\]
Final simplification0
\[\leadsto x \cdot 5\]

Reproduce

herbie shell --seed 2019294 
(FPCore (x)
  :name "Main:i from "
  :precision binary64
  (+ (+ (+ (+ x x) x) x) x))