Average Error: 0.0 → 0.0
Time: 594.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r139374 = x;
        double r139375 = r139374 * r139374;
        double r139376 = r139374 + r139375;
        return r139376;
}
↓
double f(double x) {
        double r139377 = x;
        double r139378 = r139377 * r139377;
        double r139379 = r139377 + r139378;
        return r139379;
}

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 2020018 
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))