Average Error: 0.3 → 0
Time: 695.0ms
Precision: binary64
\[d \cdot 10 + d \cdot 20 \]
↓
\[d \cdot 30 \]
(FPCore (d) :precision binary64 (+ (* d 10.0) (* d 20.0)))
↓
(FPCore (d) :precision binary64 (* d 30.0))
double code(double d) {
	return (d * 10.0) + (d * 20.0);
}
↓
double code(double d) {
	return d * 30.0;
}

real(8) function code(d)
    real(8), intent (in) :: d
    code = (d * 10.0d0) + (d * 20.0d0)
end function
↓
real(8) function code(d)
    real(8), intent (in) :: d
    code = d * 30.0d0
end function

public static double code(double d) {
	return (d * 10.0) + (d * 20.0);
}
↓
public static double code(double d) {
	return d * 30.0;
}

def code(d):
	return (d * 10.0) + (d * 20.0)
↓
def code(d):
	return d * 30.0

function code(d)
	return Float64(Float64(d * 10.0) + Float64(d * 20.0))
end
↓
function code(d)
	return Float64(d * 30.0)
end

function tmp = code(d)
	tmp = (d * 10.0) + (d * 20.0);
end
↓
function tmp = code(d)
	tmp = d * 30.0;
end

code[d_] := N[(N[(d * 10.0), $MachinePrecision] + N[(d * 20.0), $MachinePrecision]), $MachinePrecision]
↓
code[d_] := N[(d * 30.0), $MachinePrecision]

d \cdot 10 + d \cdot 20
↓
d \cdot 30

Error

Bits error versus d

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.3
Target0
Herbie0
\[d \cdot 30 \]

Derivation

  1. Initial program 0.3

    \[d \cdot 10 + d \cdot 20 \]

  2. Simplified0

    \[\leadsto \color{blue}{d \cdot 30} \]

  3. Final simplification0

    \[\leadsto d \cdot 30 \]

Reproduce

herbie shell --seed 2022150 
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30.0)

  (+ (* d 10.0) (* d 20.0)))