Average Error: 0.0 → 0.0
Time: 914.0ms
Precision: binary64
Cost: 320
\[x \cdot \left(x - 1\right)\]
↓
\[x \cdot \left(x - 1\right)\]
x \cdot \left(x - 1\right)
↓
x \cdot \left(x - 1\right)
(FPCore (x) :precision binary64 (* x (- x 1.0)))
↓
(FPCore (x) :precision binary64 (* x (- x 1.0)))
double code(double x) {
	return x * (x - 1.0);
}
↓
double code(double x) {
	return x * (x - 1.0);
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[x \cdot x - x\]

Alternatives

Alternative 1
Error0.0
Cost320
\[x \cdot x - x\]
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
Error22.0
Cost128
\[-x\]
Alternative 4
Error61.2
Cost64
\[1\]

Error

Derivation

  1. Initial program 0.0

    \[x \cdot \left(x - 1\right)\]

  2. Simplified0.0

    \[\leadsto \color{blue}{x \cdot \left(x - 1\right)}\]

  3. Final simplification0.0

    \[\leadsto x \cdot \left(x - 1\right)\]

Reproduce

herbie shell --seed 2021044 
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"
  :precision binary64

  :herbie-target
  (- (* x x) x)

  (* x (- x 1.0)))