Average Error: 0.1 → 0.1
Time: 14.2s
Precision: 64
\[1.0 - x \cdot \left(0.253 + x \cdot 0.12\right)\]
↓
\[1.0 - \left(0.253 + 0.12 \cdot x\right) \cdot x\]
1.0 - x \cdot \left(0.253 + x \cdot 0.12\right)
↓
1.0 - \left(0.253 + 0.12 \cdot x\right) \cdot x
double f(double x) {
        double r3618992 = 1.0;
        double r3618993 = x;
        double r3618994 = 0.253;
        double r3618995 = 0.12;
        double r3618996 = r3618993 * r3618995;
        double r3618997 = r3618994 + r3618996;
        double r3618998 = r3618993 * r3618997;
        double r3618999 = r3618992 - r3618998;
        return r3618999;
}
↓
double f(double x) {
        double r3619000 = 1.0;
        double r3619001 = 0.253;
        double r3619002 = 0.12;
        double r3619003 = x;
        double r3619004 = r3619002 * r3619003;
        double r3619005 = r3619001 + r3619004;
        double r3619006 = r3619005 * r3619003;
        double r3619007 = r3619000 - r3619006;
        return r3619007;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[1.0 - x \cdot \left(0.253 + x \cdot 0.12\right)\]

  2. Final simplification0.1

    \[\leadsto 1.0 - \left(0.253 + 0.12 \cdot x\right) \cdot x\]

Reproduce

herbie shell --seed 2019165 
(FPCore (x)
  :name "Numeric.SpecFunctions:invIncompleteGamma from math-functions-0.1.5.2, A"
  (- 1.0 (* x (+ 0.253 (* x 0.12)))))