Average Error: 0 → 0
Time: 574.0ms
Precision: 64
\[\left(\left(\left(x + x\right) + x\right) + x\right) + x\]
↓
\[\left(\left(\left(x + x\right) + x\right) + x\right) + x\]
\left(\left(\left(x + x\right) + x\right) + x\right) + x
↓
\left(\left(\left(x + x\right) + x\right) + x\right) + x
double f(double x) {
        double r107853 = x;
        double r107854 = r107853 + r107853;
        double r107855 = r107854 + r107853;
        double r107856 = r107855 + r107853;
        double r107857 = r107856 + r107853;
        return r107857;
}
↓
double f(double x) {
        double r107858 = x;
        double r107859 = r107858 + r107858;
        double r107860 = r107859 + r107858;
        double r107861 = r107860 + r107858;
        double r107862 = r107861 + r107858;
        return r107862;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0

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

  2. Final simplification0

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

Reproduce

herbie shell --seed 2020100 +o rules:numerics
(FPCore (x)
  :name "Main:i from "
  :precision binary64
  (+ (+ (+ (+ x x) x) x) x))