Metrics for Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, F

analyze0.0ms (0%)

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 8 to 6 computations (25% saved)

Precisions

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

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

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

sample661.0ms (68%)

Results

442.0ms

8256×

valid

Precisions

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

ival-mult: 207.0ms (93.7% of total)

const: 11.0ms (5% of total)

backward-pass: 3.0ms (1.4% of total)

Bogosity

preprocess18.0ms (1.8%)

Algorithm

2×	egg-herbie

Rules

80×	`distribute-lft-neg-in`
68×	`associate-r`
58×	`distribute-rgt-neg-in`
50×	`distribute-lft-in`
46×	`cancel-sign-sub-inv`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	45	30
2	113	30
3	284	30
4	366	30
5	386	30
0	5	5
1	9	5
2	16	5
3	18	5
0	18	5

Stop Event

1×	iter limit
1×	saturated
1×	saturated

Calls

Call 1

Inputs
(* (* x 27) y)

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

Call 2

Inputs
(* (* x 27) y)
(* (* (neg x) 27) y)
(* (* x 27) (neg y))
(neg (* (* (neg x) 27) y))
(neg (* (* x 27) (neg y)))
(* (* y 27) x)

Outputs
(* (* x 27) y)
(* x (* 27 y))
(* (* (neg x) 27) y)
(* x (* y -27))
(* (* x 27) (neg y))
(* x (* y -27))
(neg (* (* (neg x) 27) y))
(* x (* 27 y))
(neg (* (* x 27) (neg y)))
(* x (* 27 y))
(* (* y 27) x)
(* x (* 27 y))

Symmetry

(negabs x)

(negabs y)

(sort x y)

explain71.0ms (7.3%)

FPErrors

Click to see full error table

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

Results

42.0ms

512×

valid

Compiler

Compiled 35 to 23 computations (34.3% saved)

Precisions

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

ival-mult: 23.0ms (96.1% of total)

const: 1.0ms (4.2% of total)

backward-pass: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler: Compiled 7 to 5 computations (28.6% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(.f64 (.f64 x #s(literal 27 binary64)) y)

Compiler

Compiled 7 to 5 computations (28.6% saved)

localize35.0ms (3.6%)

Algorithm

1×	egg-herbie

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(*.f64 x #s(literal 27 binary64))
✓	cost-diff	0	(.f64 (.f64 x #s(literal 27 binary64)) y)
✓	accuracy	100.0%	(*.f64 x #s(literal 27 binary64))
✓	accuracy	99.7%	(.f64 (.f64 x #s(literal 27 binary64)) y)

Rules

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

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(* (* x 27) y)
(* x 27)
x
27
y

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

Results

18.0ms

256×

valid

Compiler

Compiled 14 to 9 computations (35.7% saved)

Precisions

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

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

const: 1.0ms (16.2% of total)

backward-pass: 0.0ms (0% of total)

series7.0ms (0.7%)

Counts

2 → 36

Calls

Call 1

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

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

Calls

9 calls:

Time	Variable		Point	Expression
2.0ms	x	@	0	(* (* x 27) y)
1.0ms	x	@	inf	(* (* x 27) y)
1.0ms	y	@	0	(* (* x 27) y)
0.0ms	y	@	inf	(* (* x 27) y)
0.0ms	x	@	-inf	(* x 27)

rewrite20.0ms (2.1%)

Algorithm

1×	batch-egg-rewrite

Rules

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

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 → 8

Calls

Call 1

Inputs
(* (* x 27) y)
(* x 27)

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

simplify6.0ms (0.6%)

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
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 x)
(* 27 x)
(* 27 x)
(* 27 x)
(* 27 x)
(* 27 x)
(* 27 x)
(* 27 x)
(* 27 x)
(* 27 x)
(* 27 x)
(* 27 x)

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

eval6.0ms (0.6%)

Compiler: Compiled 222 to 133 computations (40.1% saved)

prune2.0ms (0.2%)

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	42	2	44
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	42	3	45

Accuracy

100.0%

Counts

45 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.6%	(.f64 (.f64 x y) #s(literal 27 binary64))
✓	99.7%	(.f64 (.f64 x #s(literal 27 binary64)) y)
▶	99.7%	(.f64 (.f64 #s(literal 27 binary64) y) x)

Compiler

Compiled 21 to 15 computations (28.6% saved)

localize53.0ms (5.4%)

Algorithm

1×	egg-herbie

Localize:

Found 8 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(*.f64 x y)
✓	cost-diff	0	(.f64 (.f64 x y) #s(literal 27 binary64))
✓	cost-diff	0	(*.f64 #s(literal 27 binary64) y)
✓	cost-diff	0	(.f64 (.f64 #s(literal 27 binary64) y) x)
✓	accuracy	100.0%	(*.f64 x y)
✓	accuracy	99.6%	(.f64 (.f64 x y) #s(literal 27 binary64))
✓	accuracy	100.0%	(*.f64 #s(literal 27 binary64) y)
✓	accuracy	99.7%	(.f64 (.f64 #s(literal 27 binary64) y) x)

Rules

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	19
1	13	19
2	19	19
3	19	19
0	19	19

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(* (* 27 y) x)
(* 27 y)
27
y
x
(* (* x y) 27)
(* x y)

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

Results

27.0ms

256×

valid

Compiler

Compiled 25 to 13 computations (48% saved)

Precisions

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

ival-mult: 10.0ms (92.3% of total)

const: 1.0ms (9.2% of total)

backward-pass: 0.0ms (0% of total)

series6.0ms (0.6%)

Counts

4 → 84

Calls

Call 1

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

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

Calls

21 calls:

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

rewrite18.0ms (1.8%)

Algorithm

1×	batch-egg-rewrite

Rules

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	16
1	13	16
2	19	16
3	19	16
0	19	16

Stop Event

1×	iter limit
1×	saturated

Counts

4 → 16

Calls

Call 1

Inputs
(* (* 27 y) x)
(* 27 y)
(* (* x y) 27)
(* x y)

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

simplify10.0ms (1%)

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	348
1	11	348
2	16	348
0	16	348

Stop Event

1×	iter limit
1×	saturated

Counts

84 → 84

Calls

Call 1

Inputs
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 y)
(* 27 y)
(* 27 y)
(* 27 y)
(* 27 y)
(* 27 y)
(* 27 y)
(* 27 y)
(* 27 y)
(* 27 y)
(* 27 y)
(* 27 y)
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* 27 (* x y))
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)
(* x y)

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

eval11.0ms (1.1%)

Compiler: Compiled 502 to 274 computations (45.4% saved)

prune3.0ms (0.3%)

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	100	0	100
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	100	3	103

Accuracy

100.0%

Counts

103 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(.f64 (.f64 x y) #s(literal 27 binary64))
✓	99.7%	(.f64 (.f64 x #s(literal 27 binary64)) y)
✓	99.7%	(.f64 (.f64 #s(literal 27 binary64) y) x)

Compiler

Compiled 38 to 26 computations (31.6% saved)

regimes10.0ms (1%)

Accuracy

Total -0.3b remaining (-180.6%)

Threshold costs -0.3b (-180.6%)

Counts

3 → 1

Calls

Call 1

Inputs
(.f64 (.f64 #s(literal 27 binary64) y) x)
(.f64 (.f64 x #s(literal 27 binary64)) y)
(.f64 (.f64 x y) #s(literal 27 binary64))

Outputs
(.f64 (.f64 #s(literal 27 binary64) y) x)

Calls

4 calls:

5.0ms	y
2.0ms	(*.f64 x #s(literal 27 binary64))
2.0ms	x
1.0ms	(.f64 (.f64 x #s(literal 27 binary64)) y)

Results

Accuracy	Segments	Branch
99.7%	1	`x`
99.7%	1	`y`
99.7%	1	`(.f64 (.f64 x #s(literal 27 binary64)) y)`
99.7%	1	`(*.f64 x #s(literal 27 binary64))`

Compiler

Compiled 18 to 13 computations (27.8% saved)

soundness0.0ms (0%)

Stop Event

1×

done

Compiler

Compiled 7 to 5 computations (28.6% saved)

preprocess35.0ms (3.7%)

Remove

(negabs x)

(sort x y)

(negabs y)

Compiler

Compiled 140 to 100 computations (28.6% saved)

Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, F

analyze0.0ms (0%)

sample661.0ms (68%)

preprocess18.0ms (1.8%)

explain71.0ms (7.3%)

eval0.0ms (0%)

prune1.0ms (0.1%)

localize35.0ms (3.6%)

series7.0ms (0.7%)

rewrite20.0ms (2.1%)

simplify6.0ms (0.6%)

eval6.0ms (0.6%)

prune2.0ms (0.2%)

localize53.0ms (5.4%)

series6.0ms (0.6%)

rewrite18.0ms (1.8%)

simplify10.0ms (1%)

eval11.0ms (1.1%)

prune3.0ms (0.3%)

regimes10.0ms (1%)

soundness0.0ms (0%)

preprocess35.0ms (3.7%)

end0.0ms (0%)

Profiling