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

analyze0.0ms (0%)

Memory

0.5MiB live, 0.5MiB 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)

sample582.0ms (74%)

Memory

35.9MiB live, 865.7MiB allocated

Samples

388.0ms

8 256×

valid

Precisions

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

ival-mult: 69.0ms (57.6% of total)

ival-add: 42.0ms (35% of total)

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

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

Bogosity

preprocess25.0ms (3.1%)

Memory

1.3MiB live, 39.7MiB allocated

Algorithm

1×	egg-herbie

Rules

76×	`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	12	33
1	51	25
2	133	25
3	340	25
4	444	25
5	452	25
0	4	5
0	6	5
1	13	5
2	20	5
3	24	5
0	24	5

Stop Event

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

Calls

Call 1

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

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

Symmetry

(negabs y)

(negabs x)

(sort x y)

explain44.0ms (5.6%)

Memory

-20.9MiB live, 105.5MiB allocated

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 x (+.f64 y y))`
-	-	`(+.f64 y y)`
-	-	`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

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 (41.1% of total)

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

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

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

eval0.0ms (0%)

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

prune1.0ms (0.1%)

Memory

1.7MiB live, 1.7MiB allocated

Alt Table

Click to see full alt table

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

Compiler

Compiled 7 to 4 computations (42.9% saved)

simplify5.0ms (0.6%)

Memory

8.3MiB live, 8.3MiB 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×	`lower-*.f32`
22×	`lower-*.f64`
10×	`*-commutative`
8×	`count-2`
6×	`associate-r`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	13	10
2	20	10
3	24	10
0	24	10

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize14.0ms (1.8%)

Memory

-14.1MiB live, 24.8MiB allocated

Localize:

Found 2 expressions of interest:

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

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 (64% of total)

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

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

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

series4.0ms (0.5%)

Memory

5.7MiB live, 5.7MiB allocated

Counts

2 → 36

Calls

Call 1

Inputs
#<alt (*.f64 x (+.f64 y y))>
#<alt (+.f64 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))
0.0ms	y	@	inf	(* x (+ y y))
0.0ms	y	@	inf	(+ y y)

rewrite35.0ms (4.5%)

Memory

-2.4MiB live, 37.2MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

56×	`lower-*.f32`
54×	`lower-*.f64`
38×	`lower-/.f64`
38×	`lower-/.f32`
32×	`lower-+.f32`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
0	6	8
1	22	8
0	134	8

Stop Event

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

Counts

2 → 25

Calls

Call 1

Inputs
(*.f64 x (+.f64 y y))
(+.f64 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)

simplify5.0ms (0.6%)

Memory

6.8MiB live, 6.8MiB allocated

Algorithm

1×	egg-herbie

Rules

24×	`lower-*.f64`
24×	`lower-*.f32`
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.7%)

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

prune4.0ms (0.5%)

Memory

7.6MiB live, 7.6MiB 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 x (+.f64 y y))

Compiler

Compiled 14 to 8 computations (42.9% saved)

simplify14.0ms (1.8%)

Memory

-28.8MiB live, 10.5MiB allocated

Algorithm

1×	egg-herbie

Rules

2×	`*-commutative_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	5
1	5	5

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness0.0ms (0%)

Memory

0.6MiB live, 0.6MiB allocated

Stop Event

1×

done

Compiler

Compiled 7 to 4 computations (42.9% saved)

preprocess49.0ms (6.2%)

Memory

25.0MiB live, 63.7MiB allocated

Remove

(sort x y)

(negabs x)

(negabs y)

Compiler

Compiled 112 to 64 computations (42.9% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze0.0ms (0%)

sample582.0ms (74%)

preprocess25.0ms (3.1%)

explain44.0ms (5.6%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify5.0ms (0.6%)

localize14.0ms (1.8%)

series4.0ms (0.5%)

rewrite35.0ms (4.5%)

simplify5.0ms (0.6%)

eval5.0ms (0.7%)

prune4.0ms (0.5%)

simplify14.0ms (1.8%)

soundness0.0ms (0%)

preprocess49.0ms (6.2%)

end0.0ms (0%)

Profiling