Metrics for Toniolo and Linder, Equation (3a)

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze204.0ms (7.6%)

Memory

-22.3MiB live, 221.0MiB allocated; 140ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.8%	0.2%	0%	0%	0%	0
0%	0%	99.8%	0.2%	0%	0%	0%	1
0%	0%	99.8%	0.2%	0%	0%	0%	2
50%	49.9%	49.9%	0.2%	0%	0%	0%	3
50%	49.9%	49.9%	0.2%	0%	0%	0%	4
50%	49.9%	49.9%	0.2%	0%	0%	0%	5
50%	49.9%	49.9%	0.2%	0%	0%	0%	6
75%	74.9%	25%	0.2%	0%	0%	0%	7
75%	74.9%	25%	0.2%	0%	0%	0%	8
75%	74.9%	25%	0.2%	0%	0%	0%	9
75%	74.9%	25%	0.2%	0%	0%	0%	10
87.5%	87.3%	12.5%	0.2%	0%	0%	0%	11
87.5%	87.3%	12.5%	0.2%	0%	0%	0%	12

Compiler

Compiled 31 to 24 computations (22.6% saved)

sample2.0s (75.3%)

Memory

46.6MiB live, 2 295.9MiB allocated; 366ms collecting garbage

Samples

1.5s

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 1.2s

ival-sin: 371.0ms (30.4% of total)

ival-pow2: 277.0ms (22.7% of total)

ival-div: 174.0ms (14.3% of total)

ival-mult: 160.0ms (13.1% of total)

ival-add: 122.0ms (10% of total)

ival-sqrt: 100.0ms (8.2% of total)

exact: 10.0ms (0.8% of total)

adjust: 3.0ms (0.2% of total)

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

Bogosity

explain365.0ms (13.6%)

Memory

-17.6MiB live, 498.4MiB allocated; 45ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
33	-	-	`(sqrt.f64 (+.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64))))))`
11	-	-	`(.f64 (pow.f64 (/.f64 (.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64))))`
4	-	-	`(/.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64)))))))`
0	-	-	`(+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64)))`
0	-	-	`Om`
0	-	-	`(sqrt.f64 (.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (*.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64))))))))))`
0	-	-	`#s(literal 1 binary64)`
0	-	-	`(pow.f64 (sin.f64 kx) #s(literal 2 binary64))`
0	-	-	`(*.f64 #s(literal 2 binary64) l)`
0	-	-	`(sin.f64 ky)`
0	-	-	`(/.f64 (*.f64 #s(literal 2 binary64) l) Om)`
0	-	-	`kx`
0	-	-	`ky`
0	-	-	`(pow.f64 (sin.f64 ky) #s(literal 2 binary64))`
0	-	-	`(.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (*.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64)))))))))`
0	-	-	`(/.f64 #s(literal 1 binary64) #s(literal 2 binary64))`
0	-	-	`(pow.f64 (/.f64 (*.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64))`
0	-	-	`(+.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64)))))`
0	-	-	`(sin.f64 kx)`
0	-	-	`#s(literal 2 binary64)`
0	-	-	`(+.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64))))))))`
0	-	-	`l`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`sqrt.f64`	`(sqrt.f64 (+.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64))))))`	oflow-rescue	33	0
↳	`(sqrt.f64 (+.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64))))))`	overflow	22
↳	`(/.f64 (*.f64 #s(literal 2 binary64) l) Om)`	overflow	25
↳	`(.f64 (pow.f64 (/.f64 (.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64))))`	overflow	55
↳	`(+.f64 #s(literal 1 binary64) (.f64 (pow.f64 (/.f64 (.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64)))))`	overflow	55
↳	`(pow.f64 (/.f64 (*.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64))`	overflow	62
`*.f64`	`(.f64 (pow.f64 (/.f64 (.f64 #s(literal 2 binary64) l) Om) #s(literal 2 binary64)) (+.f64 (pow.f64 (sin.f64 kx) #s(literal 2 binary64)) (pow.f64 (sin.f64 ky) #s(literal 2 binary64))))`	*no**	6	0

Confusion

	Predicted +	Predicted -
+	0	2
-	39	215

Precision

0.0

Recall

0.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	2
-	39	0	215

Precision?

0.0

Recall?

0.0

Freqs

test

number	freq
0	217
1	39

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

98.0ms

512×

valid

Compiler

Compiled 441 to 70 computations (84.1% saved)

Precisions

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

ival-sin: 22.0ms (31.7% of total)

ival-pow2: 14.0ms (20.2% of total)

ival-div: 10.0ms (14.4% of total)

ival-mult: 8.0ms (11.5% of total)

ival-add: 7.0ms (10.1% of total)

ival-sqrt: 7.0ms (10.1% of total)

exact: 1.0ms (1.4% of total)

adjust: 0.0ms (0% of total)

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

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

preprocess93.0ms (3.5%)

Memory

10.4MiB live, 103.9MiB allocated; 12ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	134	413
1	386	379
2	1487	379
3	5782	379
0	22	27
0	39	27
1	69	25
2	204	25
3	1124	25
4	6631	25
0	8306	25

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze204.0ms (7.6%)

sample2.0s (75.3%)

explain365.0ms (13.6%)

preprocess93.0ms (3.5%)

end0.0ms (0%)

Profiling