Average Error: 0.0 → 0.0
Time: 6.7s
Precision: 64
\[x \cdot \left(x - 1\right)\]
↓
\[x \cdot \left(x - 1\right)\]
x \cdot \left(x - 1\right)
↓
x \cdot \left(x - 1\right)
double f(double x) {
        double r19024466 = x;
        double r19024467 = 1.0;
        double r19024468 = r19024466 - r19024467;
        double r19024469 = r19024466 * r19024468;
        return r19024469;
}
↓
double f(double x) {
        double r19024470 = x;
        double r19024471 = 1.0;
        double r19024472 = r19024470 - r19024471;
        double r19024473 = r19024470 * r19024472;
        return r19024473;
}

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\]

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019170 +o rules:numerics
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"

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

  (* x (- x 1.0)))