Average Error: 0.0 → 0.0
Time: 745.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r117926 = x;
        double r117927 = r117926 * r117926;
        double r117928 = r117926 + r117927;
        return r117928;
}
↓
double f(double x) {
        double r117929 = x;
        double r117930 = r117929 * r117929;
        double r117931 = r117929 + r117930;
        return r117931;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x + x \cdot x\]

  2. Final simplification0.0

    \[\leadsto x + x \cdot x\]

Reproduce

herbie shell --seed 2020089 
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))