Metrics for Numeric.Interval.Internal:scale from intervals-0.7.1, B

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 7 to 7 computations (0% saved)

sample777.0ms (67.3%)

Memory

-138.7MiB live, 733.8MiB allocated

Samples

304.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 145.0ms

ival-mult: 74.0ms (51.1% of total)

ival-div: 58.0ms (40.1% of total)

ival-true: 6.0ms (4.1% of total)

exact: 5.0ms (3.5% of total)

ival-assert: 3.0ms (2.1% of total)

Bogosity

explain93.0ms (8.1%)

Memory

24.5MiB live, 63.4MiB allocated

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`y`
-	-	`#s(literal 2 binary64)`
-	-	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
-	-	`(*.f64 x y)`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

70.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

Click to see histograms. Total time spent on operations: 8.0ms

ival-mult: 4.0ms (50.2% of total)

ival-div: 3.0ms (37.7% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess22.0ms (1.9%)

Memory

-7.6MiB live, 29.2MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	30
1	31	27
2	66	25
3	118	25
4	129	25
0	5	5
0	7	5
1	12	5
2	17	5
3	18	5
0	18	5

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))

Outputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))

Symmetry

(negabs y)

(negabs x)

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.6MiB live, 0.6MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(/.f64 (*.f64 x y) #s(literal 2 binary64))

Compiler

Compiled 5 to 5 computations (0% saved)

simplify3.0ms (0.3%)

Memory

3.7MiB live, 3.7MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 x y)
cost-diff	0	(/.f64 (*.f64 x y) #s(literal 2 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	12	11
2	17	11
3	18	11
0	18	11

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(*.f64 x y)
x
y
#s(literal 2 binary64)

Outputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))
(*.f64 x y)
(*.f64 y x)
x
y
#s(literal 2 binary64)

localize17.0ms (1.5%)

Memory

-10.7MiB live, 25.4MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(*.f64 x y)
accuracy	0.00390625	(/.f64 (*.f64 x y) #s(literal 2 binary64))

Samples

14.0ms

256×

valid

Compiler

Compiled 13 to 7 computations (46.2% saved)

Precisions

Click to see histograms. Total time spent on operations: 5.0ms

ival-mult: 3.0ms (63.9% of total)

ival-div: 2.0ms (42.6% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series4.0ms (0.3%)

Memory

6.1MiB live, 6.1MiB allocated

Counts

2 → 2

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(*.f64 x y)

Outputs
(* 1/2 (* x y))
(* x y)

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	0	((/ (* x y) 2) (* x y))
1.0ms	x	@	0	((/ (* x y) 2) (* x y))
1.0ms	x	@	inf	((/ (* x y) 2) (* x y))
1.0ms	y	@	-inf	((/ (* x y) 2) (* x y))
1.0ms	x	@	-inf	((/ (* x y) 2) (* x y))

simplify3.0ms (0.2%)

Memory

2.5MiB live, 2.5MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
1	9	8
2	16	8
3	18	8
0	18	8

Stop Event

1×	iter limit
1×	saturated

Counts

2 → 2

Calls

Call 1

Inputs
(* 1/2 (* x y))
(* x y)

Outputs
(* 1/2 (* x y))
(.f64 (.f64 y x) #s(literal 1/2 binary64))
(* x y)
(*.f64 y x)

rewrite31.0ms (2.6%)

Memory

-28.8MiB live, 15.2MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	7	8
1	16	8
2	34	8
3	56	8
4	80	8
5	90	8
0	90	8

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

2 → 16

Calls

Call 1

Inputs
(/.f64 (*.f64 x y) #s(literal 2 binary64))
(*.f64 x y)

Outputs
(*.f64 (/.f64 x #s(literal -2 binary64)) (neg.f64 y))
(*.f64 (/.f64 y #s(literal -2 binary64)) (neg.f64 x))
(*.f64 (/.f64 x #s(literal 2 binary64)) y)
(*.f64 (neg.f64 x) (/.f64 y #s(literal -2 binary64)))
(*.f64 (neg.f64 y) (/.f64 x #s(literal -2 binary64)))
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(*.f64 y (/.f64 x #s(literal 2 binary64)))
(*.f64 x (/.f64 y #s(literal 2 binary64)))
(/.f64 (*.f64 (neg.f64 x) y) #s(literal -2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))
(neg.f64 (/.f64 (*.f64 y x) #s(literal -2 binary64)))
(*.f64 (neg.f64 x) (neg.f64 y))
(*.f64 (neg.f64 y) (neg.f64 x))
(*.f64 y x)
(*.f64 x y)
(neg.f64 (*.f64 (neg.f64 x) y))

eval2.0ms (0.1%)

Memory: 3.6MiB live, 3.6MiB allocated
Compiler: Compiled 112 to 40 computations (64.3% saved)

prune1.0ms (0.1%)

Memory

2.2MiB live, 2.2MiB allocated

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	16	2	18
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	17	2	19

Accuracy

100.0%

Counts

19 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 (/.f64 y #s(literal 2 binary64)) x)
▶	100.0%	#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))

Compiler

Compiled 16 to 14 computations (12.5% saved)

simplify4.0ms (0.3%)

Memory

6.1MiB live, 6.1MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 5 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(/.f64 y #s(literal 2 binary64))
cost-diff	0	(*.f64 (/.f64 y #s(literal 2 binary64)) x)
cost-diff	0	(*.f64 y x)
cost-diff	0	(.f64 (.f64 y x) #s(literal 1/2 binary64))
cost-diff	0	#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	33
0	15	33
1	22	33
2	33	33
3	36	33
0	36	33

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
(.f64 (.f64 y x) #s(literal 1/2 binary64))
(*.f64 y x)
y
x
#s(literal 1/2 binary64)
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 y #s(literal 2 binary64))
y
#s(literal 2 binary64)
x

Outputs
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 (.f64 y x) #s(literal 1/2 binary64))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
(*.f64 y x)
y
x
#s(literal 1/2 binary64)
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(*.f64 (/.f64 x #s(literal 2 binary64)) y)
(/.f64 y #s(literal 2 binary64))
y
#s(literal 2 binary64)
x

localize30.0ms (2.6%)

Memory

8.3MiB live, 46.8MiB allocated

Localize:

Found 5 expressions of interest:

New	Metric	Score
accuracy	0.0	(/.f64 y #s(literal 2 binary64))
accuracy	0.0	(*.f64 (/.f64 y #s(literal 2 binary64)) x)
accuracy	0.0	(*.f64 y x)
accuracy	0.0	#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
accuracy	0.00390625	(.f64 (.f64 y x) #s(literal 1/2 binary64))

Samples

24.0ms

256×

valid

Compiler

Compiled 29 to 12 computations (58.6% saved)

Precisions

Click to see histograms. Total time spent on operations: 10.0ms

ival-mult: 6.0ms (60.8% of total)

ival-div: 3.0ms (30.4% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series4.0ms (0.3%)

Memory

11.7MiB live, 11.7MiB allocated

Counts

5 → 3

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
(.f64 (.f64 y x) #s(literal 1/2 binary64))
(*.f64 y x)
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 y #s(literal 2 binary64))

Outputs
(* 1/2 (* x y))
(* x y)
(* 1/2 y)

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	-inf	((/ (* x y) 2) (* (* y x) 1/2) (* y x) (* (/ y 2) x) (/ y 2))
1.0ms	y	@	inf	((/ (* x y) 2) (* (* y x) 1/2) (* y x) (* (/ y 2) x) (/ y 2))
0.0ms	y	@	0	((/ (* x y) 2) (* (* y x) 1/2) (* y x) (* (/ y 2) x) (/ y 2))
0.0ms	x	@	-inf	((/ (* x y) 2) (* (* y x) 1/2) (* y x) (* (/ y 2) x) (/ y 2))
0.0ms	x	@	inf	((/ (* x y) 2) (* (* y x) 1/2) (* y x) (* (/ y 2) x) (/ y 2))

simplify3.0ms (0.3%)

Memory

8.1MiB live, 8.1MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	11
1	11	11
2	16	11
0	16	11

Stop Event

1×	iter limit
1×	saturated

Counts

3 → 3

Calls

Call 1

Inputs
(* 1/2 (* x y))
(* x y)
(* 1/2 y)

Outputs
(* 1/2 (* x y))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
(* x y)
(*.f64 y x)
(* 1/2 y)
(*.f64 #s(literal 1/2 binary64) y)

rewrite12.0ms (1.1%)

Memory

-17.9MiB live, 20.4MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	27
0	15	27
1	29	27
2	55	27
3	81	27
4	118	27
5	153	27
6	162	27
0	162	27

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

5 → 33

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
(.f64 (.f64 y x) #s(literal 1/2 binary64))
(*.f64 y x)
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 y #s(literal 2 binary64))

Outputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 (.f64 #s(literal -1/2 binary64) x) (neg.f64 y))
(.f64 #s(literal -1/2 binary64) (.f64 (neg.f64 x) y))
(.f64 (.f64 #s(literal -1/2 binary64) y) (neg.f64 x))
(.f64 (.f64 #s(literal 1/2 binary64) y) x)
(.f64 (neg.f64 x) (.f64 #s(literal -1/2 binary64) y))
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(.f64 (neg.f64 y) (.f64 #s(literal -1/2 binary64) x))
(.f64 (.f64 (neg.f64 x) y) #s(literal -1/2 binary64))
(.f64 #s(literal 1/2 binary64) (.f64 y x))
(.f64 (.f64 y x) #s(literal 1/2 binary64))
(.f64 y (.f64 #s(literal 1/2 binary64) x))
(.f64 x (.f64 #s(literal 1/2 binary64) y))
(neg.f64 (.f64 #s(literal -1/2 binary64) (.f64 y x)))
(*.f64 (neg.f64 x) (neg.f64 y))
(*.f64 (neg.f64 y) (neg.f64 x))
(*.f64 y x)
(*.f64 x y)
(neg.f64 (*.f64 (neg.f64 x) y))
(*.f64 (/.f64 x #s(literal -2 binary64)) (neg.f64 y))
(*.f64 (/.f64 x #s(literal 2 binary64)) y)
(*.f64 (/.f64 y #s(literal -2 binary64)) (neg.f64 x))
(*.f64 (neg.f64 x) (/.f64 y #s(literal -2 binary64)))
(*.f64 (neg.f64 y) (/.f64 x #s(literal -2 binary64)))
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(*.f64 y (/.f64 x #s(literal 2 binary64)))
(*.f64 x (/.f64 y #s(literal 2 binary64)))
(/.f64 (*.f64 (neg.f64 x) y) #s(literal -2 binary64))
(/.f64 (*.f64 y x) #s(literal 2 binary64))
(neg.f64 (/.f64 (*.f64 y x) #s(literal -2 binary64)))
(/.f64 (neg.f64 y) #s(literal -2 binary64))
(/.f64 y #s(literal 2 binary64))
(neg.f64 (/.f64 y #s(literal -2 binary64)))

eval3.0ms (0.3%)

Memory: 7.0MiB live, 7.0MiB allocated
Compiler: Compiled 324 to 83 computations (74.4% saved)

prune3.0ms (0.2%)

Memory

6.9MiB live, 6.9MiB allocated

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	34	1	35
Fresh	0	0	0
Picked	2	0	2
Done	0	0	0
Total	36	1	37

Accuracy

100.0%

Counts

37 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)

Compiler

Compiled 9 to 8 computations (11.1% saved)

simplify5.0ms (0.4%)

Memory

-31.4MiB live, 6.1MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 #s(literal 1/2 binary64) y)
cost-diff	0	#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
cost-diff	0	(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	22
0	10	22
1	14	22
2	16	22
0	16	22

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

Inputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
#s(literal 1/2 binary64)
y
x

Outputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
(.f64 x #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)))
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
#s(literal 1/2 binary64)
y
x

localize16.0ms (1.4%)

Memory

31.2MiB live, 31.2MiB allocated

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
accuracy	0.0	(*.f64 #s(literal 1/2 binary64) y)
accuracy	0.0	#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))

Samples

12.0ms

256×

valid

Compiler

Compiled 16 to 9 computations (43.8% saved)

Precisions

Click to see histograms. Total time spent on operations: 6.0ms

ival-mult: 4.0ms (66.9% of total)

ival-div: 2.0ms (33.5% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series2.0ms (0.2%)

Memory

6.4MiB live, 6.4MiB allocated

Counts

3 → 2

Calls

Call 1

Inputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)

Outputs
(* 1/2 (* x y))
(* 1/2 y)

Calls

6 calls:

Time	Variable		Point	Expression
0.0ms	y	@	inf	((* (/ y 2) x) (/ y 2) (* 1/2 y))
0.0ms	y	@	-inf	((* (/ y 2) x) (/ y 2) (* 1/2 y))
0.0ms	y	@	0	((* (/ y 2) x) (/ y 2) (* 1/2 y))
0.0ms	x	@	-inf	((* (/ y 2) x) (/ y 2) (* 1/2 y))
0.0ms	x	@	0	((* (/ y 2) x) (/ y 2) (* 1/2 y))

simplify7.0ms (0.6%)

Memory

-37.7MiB live, 5.4MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	8
1	11	8
2	16	8
0	16	8

Stop Event

1×	iter limit
1×	saturated

Counts

2 → 2

Calls

Call 1

Inputs
(* 1/2 (* x y))
(* 1/2 y)

Outputs
(* 1/2 (* x y))
(.f64 (.f64 x y) #s(literal 1/2 binary64))
(* 1/2 y)
(*.f64 #s(literal 1/2 binary64) y)

rewrite8.0ms (0.7%)

Memory

10.5MiB live, 10.5MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	19
0	10	19
1	18	19
2	26	19
3	30	19
4	35	19
5	40	19
6	43	19
0	43	19

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

3 → 8

Calls

Call 1

Inputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)

Outputs
(.f64 x #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)))
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ y 2) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal -1/2 binary64) (neg.f64 y))
(*.f64 (neg.f64 y) #s(literal -1/2 binary64))
(*.f64 #s(literal 1/2 binary64) y)
(*.f64 y #s(literal 1/2 binary64))
(neg.f64 (*.f64 #s(literal -1/2 binary64) y))

eval1.0ms (0.1%)

Memory: 2.4MiB live, 2.4MiB allocated
Compiler: Compiled 86 to 28 computations (67.4% saved)

prune2.0ms (0.1%)

Memory

3.9MiB live, 3.9MiB allocated

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	9	0	9
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	9	1	10

Accuracy

100.0%

Counts

10 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)

Compiler

Compiled 39 to 26 computations (33.3% saved)

regimes7.0ms (0.6%)

Memory

18.0MiB live, 18.0MiB allocated

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
(*.f64 (/.f64 y #s(literal 2 binary64)) x)
(/.f64 (*.f64 x y) #s(literal 2 binary64))

Outputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)

Calls

4 calls:

2.0ms	x
2.0ms	y
2.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))
2.0ms	(*.f64 x y)

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
100.0%	1	`(*.f64 x y)`

Compiler

Compiled 10 to 12 computations (-20% saved)

regimes9.0ms (0.8%)

Memory

-14.0MiB live, 23.0MiB allocated

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))

Outputs
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))

Calls

4 calls:

5.0ms	(*.f64 x y)
1.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))
1.0ms	x
1.0ms	y

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
100.0%	1	`(*.f64 x y)`

Compiler

Compiled 10 to 12 computations (-20% saved)

simplify39.0ms (3.3%)

Memory

-5.8MiB live, 33.0MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	20
1	17	20
2	22	20
3	26	20
4	33	20
5	55	20
6	211	20
7	1883	20
8	3534	20

Stop Event

1×	node limit

Calls

Call 1

Inputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))

Outputs
(.f64 #s(approx (/ y 2) (.f64 #s(literal 1/2 binary64) y)) x)
#s(approx (/ (* x y) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))

soundness13.0ms (1.1%)

Memory

18.9MiB live, 18.9MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
1	9	8
2	16	8
3	18	8
0	18	8
0	5	8
0	7	8
1	16	8
2	34	8
3	56	8
4	80	8
5	90	8
0	90	8
0	6	11
1	11	11
2	16	11
0	16	11

Stop Event

1×	done
1×	iter limit
1×	saturated
1×	iter limit
1×	saturated
1×	iter limit
1×	iter limit
1×	saturated

Compiler

Compiled 40 to 30 computations (25% saved)

preprocess35.0ms (3%)

Memory

5.4MiB live, 43.4MiB allocated

Remove

(sort x y)

(negabs x)

(negabs y)

Compiler

Compiled 104 to 84 computations (19.2% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

Iter	Nodes	Cost
0	5	8
1	9	8
2	16	8
3	18	8
0	18	8
0	5	8
0	7	8
1	16	8
2	34	8
3	56	8
4	80	8
5	90	8
0	90	8
0	6	11
1	11	11
2	16	11
0	16	11

Iter	Nodes	Cost
0	5	8
1	9	8
2	16	8
3	18	8
0	18	8
0	5	8
0	7	8
1	16	8
2	34	8
3	56	8
4	80	8
5	90	8
0	90	8
0	6	11
1	11	11
2	16	11
0	16	11

start0.0ms (0%)

analyze0.0ms (0%)

sample777.0ms (67.3%)

explain93.0ms (8.1%)

preprocess22.0ms (1.9%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify3.0ms (0.3%)

localize17.0ms (1.5%)

series4.0ms (0.3%)

simplify3.0ms (0.2%)

rewrite31.0ms (2.6%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

simplify4.0ms (0.3%)

localize30.0ms (2.6%)

series4.0ms (0.3%)

simplify3.0ms (0.3%)

rewrite12.0ms (1.1%)

eval3.0ms (0.3%)

prune3.0ms (0.2%)

simplify5.0ms (0.4%)

localize16.0ms (1.4%)

series2.0ms (0.2%)

simplify7.0ms (0.6%)

rewrite8.0ms (0.7%)

eval1.0ms (0.1%)

prune2.0ms (0.1%)

regimes7.0ms (0.6%)

regimes9.0ms (0.8%)

simplify39.0ms (3.3%)

soundness13.0ms (1.1%)

preprocess35.0ms (3%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	5	8
1	9	8
2	16	8
3	18	8
0	18	8
0	5	8
0	7	8
1	16	8
2	34	8
3	56	8
4	80	8
5	90	8
0	90	8
0	6	11
1	11	11
2	16	11
0	16	11