| Alternative 1 | |
|---|---|
| Error | 1.8 |
| Cost | 456 |
\[\begin{array}{l}
\mathbf{if}\;x \leq -6.624102134832562:\\
\;\;\;\;x \cdot x\\
\mathbf{elif}\;x \leq 0.39211478482209317:\\
\;\;\;\;x \cdot 2\\
\mathbf{else}:\\
\;\;\;\;x \cdot x\\
\end{array}
\]
(FPCore (x) :precision binary64 (- (* (+ x 1.0) (+ x 1.0)) 1.0))
(FPCore (x) :precision binary64 (* x (+ x 2.0)))
double code(double x) {
return ((x + 1.0) * (x + 1.0)) - 1.0;
}
double code(double x) {
return x * (x + 2.0);
}
real(8) function code(x)
real(8), intent (in) :: x
code = ((x + 1.0d0) * (x + 1.0d0)) - 1.0d0
end function
real(8) function code(x)
real(8), intent (in) :: x
code = x * (x + 2.0d0)
end function
public static double code(double x) {
return ((x + 1.0) * (x + 1.0)) - 1.0;
}
public static double code(double x) {
return x * (x + 2.0);
}
def code(x): return ((x + 1.0) * (x + 1.0)) - 1.0
def code(x): return x * (x + 2.0)
function code(x) return Float64(Float64(Float64(x + 1.0) * Float64(x + 1.0)) - 1.0) end
function code(x) return Float64(x * Float64(x + 2.0)) end
function tmp = code(x) tmp = ((x + 1.0) * (x + 1.0)) - 1.0; end
function tmp = code(x) tmp = x * (x + 2.0); end
code[x_] := N[(N[(N[(x + 1.0), $MachinePrecision] * N[(x + 1.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]
code[x_] := N[(x * N[(x + 2.0), $MachinePrecision]), $MachinePrecision]
\left(x + 1\right) \cdot \left(x + 1\right) - 1
x \cdot \left(x + 2\right)
Results
Initial program 38.9
Simplified0.0
Final simplification0.0
| Alternative 1 | |
|---|---|
| Error | 1.8 |
| Cost | 456 |
| Alternative 2 | |
|---|---|
| Error | 21.5 |
| Cost | 192 |

herbie shell --seed 2022228
(FPCore (x)
:name "Expanding a square"
:precision binary64
(- (* (+ x 1.0) (+ x 1.0)) 1.0))