Average Error: 0.0 → 0.0
Time: 911.0ms
Precision: binary64
Cost: 320
\[\left(x + y\right) + z\]
↓
\[\left(x + y\right) + z\]
\left(x + y\right) + z
↓
\left(x + y\right) + z
(FPCore (x y z) :precision binary64 (+ (+ x y) z))
↓
(FPCore (x y z) :precision binary64 (+ (+ x y) z))
double code(double x, double y, double z) {
	return (x + y) + z;
}
↓
double code(double x, double y, double z) {
	return (x + y) + z;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Alternatives

Alternative 1
Error62.1
Cost64
\[-1\]
Alternative 2
Error62.1
Cost64
\[1\]

Error

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) + z\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\left(x + y\right) + z}\]

  3. Final simplification0.0

    \[\leadsto \left(x + y\right) + z\]

Reproduce

herbie shell --seed 2021044 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  :precision binary64
  (+ (+ x y) z))