Average Error: 0.2 → 0.2
Time: 12.5s
Precision: 64
\[0.95492965855137202 \cdot x - 0.129006137732797982 \cdot \left(\left(x \cdot x\right) \cdot x\right)\]
↓
\[0.95492965855137202 \cdot x - 0.129006137732797982 \cdot \left(\left(x \cdot x\right) \cdot x\right)\]
0.95492965855137202 \cdot x - 0.129006137732797982 \cdot \left(\left(x \cdot x\right) \cdot x\right)
↓
0.95492965855137202 \cdot x - 0.129006137732797982 \cdot \left(\left(x \cdot x\right) \cdot x\right)
double f(double x) {
        double r25508 = 0.954929658551372;
        double r25509 = x;
        double r25510 = r25508 * r25509;
        double r25511 = 0.12900613773279798;
        double r25512 = r25509 * r25509;
        double r25513 = r25512 * r25509;
        double r25514 = r25511 * r25513;
        double r25515 = r25510 - r25514;
        return r25515;
}
↓
double f(double x) {
        double r25516 = 0.954929658551372;
        double r25517 = x;
        double r25518 = r25516 * r25517;
        double r25519 = 0.12900613773279798;
        double r25520 = r25517 * r25517;
        double r25521 = r25520 * r25517;
        double r25522 = r25519 * r25521;
        double r25523 = r25518 - r25522;
        return r25523;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.2

    \[0.95492965855137202 \cdot x - 0.129006137732797982 \cdot \left(\left(x \cdot x\right) \cdot x\right)\]

  2. Final simplification0.2

    \[\leadsto 0.95492965855137202 \cdot x - 0.129006137732797982 \cdot \left(\left(x \cdot x\right) \cdot x\right)\]

Reproduce

herbie shell --seed 2020047 +o rules:numerics
(FPCore (x)
  :name "Rosa's Benchmark"
  :precision binary64
  (- (* 0.954929658551372 x) (* 0.12900613773279798 (* (* x x) x))))