Metrics for 2-ancestry mixing, zero discriminant

analyze11.0ms (1%)

Memory

14.6MiB live, 14.6MiB allocated

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
50%	50%	50%	0.1%	0%	0%	0%	3
50%	50%	50%	0.1%	0%	0%	0%	4
75%	74.9%	25%	0.1%	0%	0%	0%	5
75%	74.9%	25%	0.1%	0%	0%	0%	6
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	7
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	8
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	9
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	10
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	11
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	12

Compiler

Compiled 8 to 8 computations (0% saved)

sample689.0ms (63.2%)

Memory

1.6MiB live, 622.2MiB allocated

Samples

451.0ms

8 256×

valid

Precisions

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

ival-mult: 79.0ms (33.2% of total)

ival-div: 73.0ms (30.6% of total)

ival-cbrt: 73.0ms (30.6% of total)

ival-true: 5.0ms (2.1% of total)

exact: 4.0ms (1.7% of total)

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

Bogosity

preprocess17.0ms (1.5%)

Memory

16.8MiB live, 16.8MiB allocated

Algorithm

1×	egg-herbie

Rules

52×	`sub-neg`
46×	`div-sub`
38×	`associate-/r*`
32×	`+-commutative`
24×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	36
1	38	32
2	78	32
3	116	32
4	133	32
5	156	32
6	197	32
7	227	32
8	232	32
0	6	6
0	9	6
1	12	6
2	14	6
0	14	6

Stop Event

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

Calls

Call 1

Inputs
(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))

Outputs
(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))

explain92.0ms (8.4%)

Memory

-23.9MiB live, 95.3MiB allocated

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
59	-	1	(-3.4128528829949054e-169 9.43001151280937e+145)	`(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))`
0	-	0	-	`(/.f64 g (*.f64 #s(literal 2 binary64) a))`
0	-	0	-	`#s(literal 2 binary64)`
0	-	0	-	`a`
0	-	0	-	`g`
0	-	0	-	`(*.f64 #s(literal 2 binary64) a)`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`cbrt.f64`	`(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))`	uflow-rescue	31	0
↳	`(/.f64 g (*.f64 #s(literal 2 binary64) a))`	underflow	31
`cbrt.f64`	`(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))`	oflow-rescue	27	0
↳	`(/.f64 g (*.f64 #s(literal 2 binary64) a))`	overflow	27

Confusion

	Predicted +	Predicted -
+	58	1
-	0	197

Precision

1.0

Recall

0.9830508474576272

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	58	0	1
-	0	0	197

Precision?

1.0

Recall?

0.9830508474576272

Freqs

test

number	freq
0	198
1	58

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

37.0ms

512×

valid

Compiler

Compiled 54 to 28 computations (48.1% saved)

Precisions

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

ival-div: 4.0ms (33.3% of total)

ival-cbrt: 4.0ms (33.3% of total)

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

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

exact: 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.1%)

Memory

1.1MiB live, 1.1MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	77.5%	(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))

Compiler

Compiled 8 to 6 computations (25% saved)

simplify4.0ms (0.4%)

Memory

5.2MiB live, 5.2MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 3 expressions of interest:

New	Metric	Program
✓	cost-diff	(*.f64 #s(literal 2 binary64) a)
✓	cost-diff	(/.f64 g (*.f64 #s(literal 2 binary64) a))
✓	cost-diff	(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))

Rules

10×	`lower-/.f32`
8×	`lower-/.f64`
4×	`lower-*.f32`
4×	`associate-/r*`
2×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	17
0	9	17
1	12	17
2	14	17
0	14	17

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

Inputs
(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))
(/.f64 g (*.f64 #s(literal 2 binary64) a))
g
(*.f64 #s(literal 2 binary64) a)
#s(literal 2 binary64)
a

Outputs
(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))
(/.f64 g (*.f64 #s(literal 2 binary64) a))
g
(*.f64 #s(literal 2 binary64) a)
#s(literal 2 binary64)
a

localize34.0ms (3.1%)

Memory

-0.6MiB live, 32.5MiB allocated

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(/.f64 g (*.f64 #s(literal 2 binary64) a))
✓	accuracy	100.0%	(*.f64 #s(literal 2 binary64) a)
✓	accuracy	77.5%	(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))

Samples

12.0ms

256×

valid

Compiler

Compiled 19 to 8 computations (57.9% saved)

Precisions

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

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

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

ival-cbrt: 1.0ms (18.2% of total)

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

exact: 0.0ms (0% of total)

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

series20.0ms (1.8%)

Memory

25.2MiB live, 25.2MiB allocated

Counts

3 → 60

Calls

Call 1

Inputs
#<alt (cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))>
#<alt (/.f64 g (*.f64 #s(literal 2 binary64) a))>
#<alt (*.f64 #s(literal 2 binary64) a)>

Outputs
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* -1 (* (cbrt (/ g a)) (cbrt -1/2)))>
#<alt (* -1 (* (cbrt (/ g a)) (cbrt -1/2)))>
#<alt (* -1 (* (cbrt (/ g a)) (cbrt -1/2)))>
#<alt (* -1 (* (cbrt (/ g a)) (cbrt -1/2)))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (cbrt 1/2))>
#<alt (* (cbrt (/ g a)) (* (cbrt -1) (cbrt -1/2)))>
#<alt (* (cbrt (/ g a)) (* (cbrt -1) (cbrt -1/2)))>
#<alt (* (cbrt (/ g a)) (* (cbrt -1) (cbrt -1/2)))>
#<alt (* (cbrt (/ g a)) (* (cbrt -1) (cbrt -1/2)))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 1/2 (/ g a))>
#<alt (* 2 a)>
#<alt (* 2 a)>
#<alt (* 2 a)>
#<alt (* 2 a)>
#<alt (* 2 a)>
#<alt (* 2 a)>
#<alt (* 2 a)>
#<alt (* 2 a)>
#<alt (* 2 a)>
#<alt (* 2 a)>
#<alt (* 2 a)>
#<alt (* 2 a)>

Calls

15 calls:

Time	Variable		Point	Expression
4.0ms	g	@	0	(cbrt (/ g (* 2 a)))
3.0ms	a	@	inf	(cbrt (/ g (* 2 a)))
3.0ms	a	@	0	(cbrt (/ g (* 2 a)))
3.0ms	g	@	inf	(cbrt (/ g (* 2 a)))
2.0ms	g	@	-inf	(cbrt (/ g (* 2 a)))

rewrite157.0ms (14.4%)

Memory

-6.6MiB live, 116.5MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

2 724×	`lower-*.f32`
2 722×	`lower-*.f64`
1 546×	`lower-/.f32`
1 544×	`lower-/.f64`
1 284×	`lower-pow.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	14
0	9	14
1	25	14
2	119	14
3	634	14
4	5097	14
0	8371	14

Stop Event

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

Counts

3 → 0

Calls

Call 1

Inputs
(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))
(/.f64 g (*.f64 #s(literal 2 binary64) a))
(*.f64 #s(literal 2 binary64) a)

Outputs

simplify9.0ms (0.8%)

Memory

-27.9MiB live, 10.7MiB allocated

Algorithm

1×	egg-herbie

Rules

64×	`lower-*.f64`
64×	`lower-*.f32`
48×	`lower-fma.f64`
48×	`lower-fma.f32`
40×	`lower-+.f64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	340
1	32	340
2	52	340
3	58	340
4	63	340
5	75	340
6	87	340
7	102	340
8	130	340
9	135	340
0	135	340

Stop Event

1×	iter limit
1×	saturated

Counts

60 → 0

Calls

Call 1

Inputs
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* -1 (* (cbrt (/ g a)) (cbrt -1/2)))
(* -1 (* (cbrt (/ g a)) (cbrt -1/2)))
(* -1 (* (cbrt (/ g a)) (cbrt -1/2)))
(* -1 (* (cbrt (/ g a)) (cbrt -1/2)))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (* (cbrt -1) (cbrt -1/2)))
(* (cbrt (/ g a)) (* (cbrt -1) (cbrt -1/2)))
(* (cbrt (/ g a)) (* (cbrt -1) (cbrt -1/2)))
(* (cbrt (/ g a)) (* (cbrt -1) (cbrt -1/2)))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)

Outputs
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* -1 (* (cbrt (/ g a)) (cbrt -1/2)))
(* -1 (* (cbrt (/ g a)) (cbrt -1/2)))
(* -1 (* (cbrt (/ g a)) (cbrt -1/2)))
(* -1 (* (cbrt (/ g a)) (cbrt -1/2)))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (cbrt 1/2))
(* (cbrt (/ g a)) (* (cbrt -1) (cbrt -1/2)))
(* (cbrt (/ g a)) (* (cbrt -1) (cbrt -1/2)))
(* (cbrt (/ g a)) (* (cbrt -1) (cbrt -1/2)))
(* (cbrt (/ g a)) (* (cbrt -1) (cbrt -1/2)))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 1/2 (/ g a))
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)
(* 2 a)

eval0.0ms (0%)

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

prune1.0ms (0.1%)

Memory

2.4MiB live, 2.4MiB allocated

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accuracy

77.5%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	77.5%	(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))

Compiler

Compiled 16 to 12 computations (25% saved)

simplify5.0ms (0.5%)

Memory

9.2MiB live, 9.2MiB allocated

Algorithm

1×	egg-herbie

Rules

2×	`*-commutative_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	6
1	7	6

Stop Event

1×

saturated

Calls

Call 1

Inputs
(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))

Outputs
(cbrt.f64 (/.f64 g (*.f64 #s(literal 2 binary64) a)))

soundness0.0ms (0%)

Memory

0.7MiB live, 0.7MiB allocated

Stop Event

1×

done

Compiler

Compiled 8 to 6 computations (25% saved)

preprocess53.0ms (4.8%)

Memory: 0.9MiB live, 46.1MiB allocated
Compiler: Compiled 32 to 24 computations (25% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

Iter	Nodes	Cost
0	16	36
1	38	32
2	78	32
3	116	32
4	133	32
5	156	32
6	197	32
7	227	32
8	232	32
0	6	6
0	9	6
1	12	6
2	14	6
0	14	6

Iter	Nodes	Cost
0	18	340
1	32	340
2	52	340
3	58	340
4	63	340
5	75	340
6	87	340
7	102	340
8	130	340
9	135	340
0	135	340

Iter	Nodes	Cost
0	16	36
1	38	32
2	78	32
3	116	32
4	133	32
5	156	32
6	197	32
7	227	32
8	232	32
0	6	6
0	9	6
1	12	6
2	14	6
0	14	6

Iter	Nodes	Cost
0	18	340
1	32	340
2	52	340
3	58	340
4	63	340
5	75	340
6	87	340
7	102	340
8	130	340
9	135	340
0	135	340

analyze11.0ms (1%)

sample689.0ms (63.2%)

preprocess17.0ms (1.5%)

explain92.0ms (8.4%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify4.0ms (0.4%)

localize34.0ms (3.1%)

series20.0ms (1.8%)

rewrite157.0ms (14.4%)

simplify9.0ms (0.8%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify5.0ms (0.5%)

soundness0.0ms (0%)

preprocess53.0ms (4.8%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	16	36
1	38	32
2	78	32
3	116	32
4	133	32
5	156	32
6	197	32
7	227	32
8	232	32
0	6	6
0	9	6
1	12	6
2	14	6
0	14	6

Iter	Nodes	Cost
0	18	340
1	32	340
2	52	340
3	58	340
4	63	340
5	75	340
6	87	340
7	102	340
8	130	340
9	135	340
0	135	340