Average Error: 0.0 → 0.0
Time: 854.0ms
Precision: binary64
Cost: 320
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
(FPCore (x) :precision binary64 (+ x (* x x)))
↓
(FPCore (x) :precision binary64 (+ x (* x x)))
double code(double x) {
	return x + (x * x);
}
↓
double code(double x) {
	return x + (x * x);
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Alternatives

Alternative 1
Error0.0
Cost320
\[x \cdot \left(x + 1\right)\]
Alternative 2
Error1.8
Cost520
\[\begin{array}{l} \mathbf{if}\;x \leq -1.0158189080602509 \lor \neg \left(x \leq 0.9869624985097121\right):\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array}\]
Alternative 3
Error21.9
Cost64
\[x\]
Alternative 4
Error61.2
Cost64
\[1\]

Error

Derivation

  1. Initial program 0.0

    \[x + x \cdot x\]

  2. Simplified0.0

    \[\leadsto \color{blue}{x + x \cdot x}\]

  3. Final simplification0.0

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

Reproduce

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