Metrics for Numeric.Integration.TanhSinh:simpson from integration-0.2.1

analyze0.0ms (0%)

Memory

0.6MiB live, 0.6MiB 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 6 computations (14.3% saved)

sample841.0ms (63.3%)

Memory

4.0MiB live, 680.1MiB allocated

Samples

527.0ms

8 256×

valid

Precisions

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

ival-mult: 117.0ms (68.6% of total)

ival-add: 45.0ms (26.4% of total)

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

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

Bogosity

preprocess21.0ms (1.6%)

Memory

14.5MiB live, 14.5MiB allocated

Algorithm

2×	egg-herbie

Rules

80×	`distribute-lft-neg-in`
70×	`associate-r`
54×	`cancel-sign-sub-inv`
48×	`distribute-lft-in`
44×	`unsub-neg`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	32
1	52	30
2	135	30
3	341	30
4	442	30
5	450	30
0	4	5
1	11	5
2	18	5
3	21	5
0	21	5

Stop Event

1×	iter limit
1×	saturated
1×	saturated

Calls

Call 1

Inputs
(* x (+ y y))

Outputs
(* x (+ y y))
(*.f64 x (+.f64 y y))

Call 2

Inputs
(* x (+ y y))
(* (neg x) (+ y y))
(* x (+ (neg y) (neg y)))
(neg (* (neg x) (+ y y)))
(neg (* x (+ (neg y) (neg y))))
(* y (+ x x))

Outputs
(* x (+ y y))
(* (neg x) (+ y y))
(* x (* y -2))
(* x (+ (neg y) (neg y)))
(* x (* y -2))
(neg (* (neg x) (+ y y)))
(* x (+ y y))
(neg (* x (+ (neg y) (neg y))))
(* x (+ y y))
(* y (+ x x))
(* x (+ y y))

Symmetry

(negabs x)

(negabs y)

(sort x y)

explain65.0ms (4.9%)

Memory

-39.6MiB live, 51.5MiB allocated

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
1	-	-	`(*.f64 x (+.f64 y y))`
0	-	-	`(+.f64 y y)`
0	-	-	`y`
0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`*.f64`	`(*.f64 x (+.f64 y y))`	*no**	1	0

Confusion

	Predicted +	Predicted -
+	1	0
-	0	255

Precision

1.0

Recall

1.0

Confusion?

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

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	255
1	1

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

18.0ms

512×

valid

Compiler

Compiled 38 to 20 computations (47.4% saved)

Precisions

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

ival-add: 3.0ms (45.5% of total)

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

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

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

eval0.0ms (0%)

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

prune1.0ms (0%)

Memory

1.1MiB live, 1.1MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.6%	(*.f64 x (+.f64 y y))

Compiler

Compiled 7 to 4 computations (42.9% saved)

simplify4.0ms (0.3%)

Memory

5.2MiB live, 5.2MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(+.f64 y y)
✓	cost-diff	0	(*.f64 x (+.f64 y y))

Rules

24×	`-lowering-.f32`
24×	`-lowering-.f64`
8×	`*-commutative`
8×	`count-2`
6×	`+-lowering-+.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
1	11	10
2	18	10
3	21	10
0	21	10

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(* x (+ y y))
x
(+ y y)
y

Outputs
(* x (+ y y))
(*.f64 x (+.f64 y y))
x
(+ y y)
(+.f64 y y)
y

localize13.0ms (1%)

Memory

22.2MiB live, 22.2MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(+.f64 y y)
✓	accuracy	99.6%	(*.f64 x (+.f64 y y))

Samples

8.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

ival-mult: 2.0ms (62.1% of total)

ival-add: 1.0ms (31% of total)

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

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

series12.0ms (0.9%)

Memory

-30.6MiB live, 6.5MiB allocated

Counts

2 → 36

Calls

Call 1

Inputs
#<alt (* x (+ y y))>
#<alt (+ y y)>

Outputs
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>
#<alt (* 2 y)>

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	y	@	0	(* x (+ y y))
1.0ms	x	@	0	(* x (+ y y))
1.0ms	x	@	inf	(* x (+ y y))
1.0ms	y	@	inf	(* x (+ y y))
0.0ms	y	@	inf	(+ y y)

rewrite52.0ms (3.9%)

Memory

12.3MiB live, 48.2MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

56×	`-lowering-.f32`
56×	`-lowering-.f64`
38×	`/-lowering-/.f32`
38×	`/-lowering-/.f64`
32×	`+-lowering-+.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
1	20	8
0	132	8

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound

Counts

2 → 25

Calls

Call 1

Inputs
(* x (+ y y))
(+ y y)

Outputs
(+.f64 (.f64 x y) (.f64 x y))
(fma.f64 x y (*.f64 x y))
(fma.f64 y x (*.f64 x y))
(/.f64 (+.f64 (pow.f64 (.f64 x y) #s(literal 3 binary64)) (pow.f64 (.f64 x y) #s(literal 3 binary64))) (fma.f64 (.f64 x y) (.f64 x y) (-.f64 (.f64 (.f64 x y) (.f64 x y)) (.f64 (.f64 x y) (.f64 x y)))))
(/.f64 (-.f64 (.f64 (.f64 x y) (.f64 x y)) (.f64 (.f64 x y) (.f64 x y))) (-.f64 (.f64 x y) (.f64 x y)))
(/.f64 (.f64 x (.f64 (fma.f64 y y #s(literal 0 binary64)) (+.f64 y y))) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 (*.f64 x #s(literal 0 binary64)) #s(literal 0 binary64))
(/.f64 (.f64 (.f64 (fma.f64 y y #s(literal 0 binary64)) (+.f64 y y)) x) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) x) #s(literal 0 binary64))
(*.f64 x (+.f64 y y))
(*.f64 y (+.f64 x x))
(*.f64 (+.f64 y y) x)
(.f64 #s(literal 2 binary64) (.f64 x y))
(.f64 (.f64 x #s(literal 2 binary64)) y)
(+.f64 y y)
(-.f64 (/.f64 (.f64 y y) #s(literal 0 binary64)) (/.f64 (.f64 y y) #s(literal 0 binary64)))
(/.f64 (*.f64 (fma.f64 y y #s(literal 0 binary64)) (+.f64 y y)) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (neg.f64 (*.f64 (fma.f64 y y #s(literal 0 binary64)) (+.f64 y y))) (neg.f64 (fma.f64 y y #s(literal 0 binary64))))
(/.f64 #s(literal 1 binary64) (+.f64 y y))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 y y #s(literal 0 binary64)) (*.f64 (fma.f64 y y #s(literal 0 binary64)) (+.f64 y y))))
(*.f64 y #s(literal 2 binary64))
(.f64 (.f64 (fma.f64 y y #s(literal 0 binary64)) (+.f64 y y)) (/.f64 #s(literal 1 binary64) (fma.f64 y y #s(literal 0 binary64))))
(*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) #s(literal 0 binary64)))
(*.f64 #s(literal 2 binary64) y)

simplify6.0ms (0.4%)

Memory

8.4MiB live, 8.4MiB allocated

Algorithm

1×	egg-herbie

Rules

24×	`-lowering-.f32`
24×	`-lowering-.f64`
10×	`*-commutative`
4×	`associate-r`
4×	`associate-l`

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	iter limit
1×	saturated

Counts

36 → 36

Calls

Call 1

Inputs
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)
(* 2 y)

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

eval5.0ms (0.4%)

Memory: 11.3MiB live, 11.3MiB allocated
Compiler: Compiled 436 to 63 computations (85.6% saved)

prune3.0ms (0.3%)

Memory

6.5MiB live, 6.5MiB allocated

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	60	1	61
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	61	1	62

Accuracy

100.0%

Counts

62 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 y (+.f64 x x))

Compiler

Compiled 7 to 4 computations (42.9% saved)

simplify4.0ms (0.3%)

Memory

4.6MiB live, 4.6MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(+.f64 x x)
✓	cost-diff	0	(*.f64 y (+.f64 x x))

Rules

24×	`-lowering-.f32`
24×	`-lowering-.f64`
8×	`*-commutative`
8×	`count-2`
6×	`+-lowering-+.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
1	11	10
2	18	10
3	21	10
0	21	10

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(* y (+ x x))
y
(+ x x)
x

Outputs
(* y (+ x x))
(*.f64 y (+.f64 x x))
y
(+ x x)
(+.f64 x x)
x

localize31.0ms (2.3%)

Memory

-33.1MiB live, 14.3MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(+.f64 x x)
✓	accuracy	100.0%	(*.f64 y (+.f64 x x))

Samples

10.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

ival-mult: 2.0ms (63.1% of total)

ival-add: 1.0ms (31.5% of total)

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

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

series1.0ms (0.1%)

Memory

1.3MiB live, 1.3MiB allocated

Counts

2 → 36

Calls

Call 1

Inputs
#<alt (* y (+ x x))>
#<alt (+ x x)>

Outputs
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 (* x y))>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>

Calls

9 calls:

Time	Variable		Point	Expression
0.0ms	x	@	inf	(+ x x)
0.0ms	x	@	0	(+ x x)
0.0ms	y	@	0	(* y (+ x x))
0.0ms	x	@	-inf	(+ x x)
0.0ms	x	@	-inf	(* y (+ x x))

rewrite30.0ms (2.3%)

Memory

-3.0MiB live, 36.6MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

56×	`-lowering-.f32`
56×	`-lowering-.f64`
38×	`/-lowering-/.f32`
38×	`/-lowering-/.f64`
32×	`+-lowering-+.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
1	20	8
0	132	8

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound

Counts

2 → 25

Calls

Call 1

Inputs
(* y (+ x x))
(+ x x)

Outputs
(+.f64 (.f64 y x) (.f64 y x))
(fma.f64 y x (*.f64 y x))
(fma.f64 x y (*.f64 y x))
(/.f64 (+.f64 (pow.f64 (.f64 y x) #s(literal 3 binary64)) (pow.f64 (.f64 y x) #s(literal 3 binary64))) (fma.f64 (.f64 y x) (.f64 y x) (-.f64 (.f64 (.f64 y x) (.f64 y x)) (.f64 (.f64 y x) (.f64 y x)))))
(/.f64 (-.f64 (.f64 (.f64 y x) (.f64 y x)) (.f64 (.f64 y x) (.f64 y x))) (-.f64 (.f64 y x) (.f64 y x)))
(/.f64 (.f64 y (.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 y #s(literal 0 binary64)) #s(literal 0 binary64))
(/.f64 (.f64 (.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) y) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) y) #s(literal 0 binary64))
(*.f64 y (+.f64 x x))
(*.f64 x (+.f64 y y))
(*.f64 (+.f64 x x) y)
(.f64 #s(literal 2 binary64) (.f64 y x))
(.f64 (.f64 y #s(literal 2 binary64)) x)
(+.f64 x x)
(-.f64 (/.f64 (.f64 x x) #s(literal 0 binary64)) (/.f64 (.f64 x x) #s(literal 0 binary64)))
(/.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (neg.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 #s(literal 1 binary64) (+.f64 x x))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 x x #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))))
(*.f64 x #s(literal 2 binary64))
(.f64 (.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (/.f64 #s(literal 1 binary64) (fma.f64 x x #s(literal 0 binary64))))
(*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) #s(literal 0 binary64)))
(*.f64 #s(literal 2 binary64) x)

simplify6.0ms (0.4%)

Memory

15.9MiB live, 15.9MiB allocated

Algorithm

1×	egg-herbie

Rules

24×	`-lowering-.f32`
24×	`-lowering-.f64`
8×	`*-commutative`
6×	`associate-r`
6×	`associate-l`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	156
1	10	156
2	16	156
3	17	156
0	17	156

Stop Event

1×	iter limit
1×	saturated

Counts

36 → 36

Calls

Call 1

Inputs
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 (* x y))
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)

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

eval7.0ms (0.5%)

Memory: -20.2MiB live, 18.8MiB allocated
Compiler: Compiled 436 to 65 computations (85.1% saved)

prune4.0ms (0.3%)

Memory

13.1MiB live, 13.1MiB allocated

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	61	0	61
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	61	1	62

Accuracy

100.0%

Counts

62 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 y (+.f64 x x))

Compiler

Compiled 19 to 10 computations (47.4% saved)

regimes6.0ms (0.5%)

Memory

20.6MiB live, 20.6MiB allocated

Counts

2 → 1

Calls

Call 1

Inputs
(*.f64 x (+.f64 y y))
(*.f64 y (+.f64 x x))

Outputs
(*.f64 y (+.f64 x x))

Calls

4 calls:

2.0ms	x
1.0ms	(+.f64 y y)
1.0ms	y
1.0ms	(*.f64 x (+.f64 y y))

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`(*.f64 x (+.f64 y y))`
100.0%	1	`(+.f64 y y)`

Compiler

Compiled 18 to 11 computations (38.9% saved)

regimes6.0ms (0.4%)

Memory

-23.0MiB live, 16.2MiB allocated

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
(*.f64 x (+.f64 y y))

Outputs
(*.f64 x (+.f64 y y))

Calls

4 calls:

2.0ms	(+.f64 y y)
1.0ms	y
1.0ms	x
1.0ms	(*.f64 x (+.f64 y y))

Results

Accuracy	Segments	Branch
99.6%	1	`x`
99.6%	1	`y`
99.6%	1	`(*.f64 x (+.f64 y y))`
99.6%	1	`(+.f64 y y)`

Compiler

Compiled 18 to 11 computations (38.9% saved)

simplify7.0ms (0.5%)

Memory

18.3MiB live, 18.3MiB allocated

Algorithm

1×	egg-herbie

Rules

4×	`*-commutative_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	10
1	8	10

Stop Event

1×

saturated

Calls

Call 1

Inputs
(*.f64 y (+.f64 x x))
(*.f64 x (+.f64 y y))

Outputs
(*.f64 y (+.f64 x x))
(*.f64 x (+.f64 y y))

soundness23.0ms (1.7%)

Memory

-16.8MiB live, 23.8MiB allocated

Rules

56×	`-lowering-.f32`
56×	`-lowering-.f64`
38×	`/-lowering-/.f32`
38×	`/-lowering-/.f64`
32×	`+-lowering-+.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
1	20	8
0	132	8

Stop Event

1×	done
1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound

Compiler

Compiled 19 to 10 computations (47.4% saved)

preprocess182.0ms (13.7%)

Memory: 26.6MiB live, 299.5MiB allocated
Remove: (negabs y)
Compiler: Compiled 178 to 100 computations (43.8% saved)

end0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated

analyze0.0ms (0%)

sample841.0ms (63.3%)

preprocess21.0ms (1.6%)

explain65.0ms (4.9%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify4.0ms (0.3%)

localize13.0ms (1%)

series12.0ms (0.9%)

rewrite52.0ms (3.9%)

simplify6.0ms (0.4%)

eval5.0ms (0.4%)

prune3.0ms (0.3%)

simplify4.0ms (0.3%)

localize31.0ms (2.3%)

series1.0ms (0.1%)

rewrite30.0ms (2.3%)

simplify6.0ms (0.4%)

eval7.0ms (0.5%)

prune4.0ms (0.3%)

regimes6.0ms (0.5%)

regimes6.0ms (0.4%)

simplify7.0ms (0.5%)

soundness23.0ms (1.7%)

preprocess182.0ms (13.7%)

end0.0ms (0%)

Profiling