Average Error: 0 → 0
Time: 613.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 r103922 = x;
        double r103923 = r103922 + r103922;
        double r103924 = r103923 + r103922;
        double r103925 = r103924 + r103922;
        double r103926 = r103925 + r103922;
        return r103926;
}
↓
double f(double x) {
        double r103927 = x;
        double r103928 = r103927 + r103927;
        double r103929 = r103928 + r103927;
        double r103930 = r103929 + r103927;
        double r103931 = r103930 + r103927;
        return r103931;
}

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