Average Error: 0 → 0

Time: 886.0ms

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 r101373 = x;
        double r101374 = r101373 + r101373;
        double r101375 = r101374 + r101373;
        double r101376 = r101375 + r101373;
        double r101377 = r101376 + r101373;
        return r101377;
}

↓

double f(double x) {
        double r101378 = x;
        double r101379 = 5.0;
        double r101380 = r101378 * r101379;
        return r101380;
}

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 2019304 
(FPCore (x)
  :name "Main:i from "
  :precision binary64
  (+ (+ (+ (+ x x) x) x) x))