Details

analyze107.0ms (5%)

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
0%	0%	99.9%	0.1%	0%	0%	0%	3
0%	0%	99.9%	0.1%	0%	0%	0%	4
25%	25%	74.9%	0.1%	0%	0%	0%	5
37.5%	37.5%	62.4%	0.1%	0%	0%	0%	6
56.3%	56.2%	43.7%	0.1%	0%	0%	0%	7
65.6%	65.6%	34.3%	0.1%	0%	0%	0%	8
76.6%	76.5%	23.4%	0.1%	0%	0%	0%	9
82%	82%	18%	0.1%	0%	0%	0%	10
87.9%	87.8%	12.1%	0.1%	0%	0%	0%	11
90.8%	90.7%	9.2%	0.1%	0%	0%	0%	12

Compiler

Compiled 10 to 7 computations (30% saved)

sample1.2s (54.1%)

Results

1.1s

8256×

body

256

valid

Bogosity

preprocess188.0ms (8.8%)

Algorithm

2×	egg-herbie

Rules

2830×	`fma-def_binary64`
1127×	`fma-neg_binary64`
286×	`associate--r-_binary64`
276×	`distribute-rgt-out--_binary64`
273×	`+-commutative_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	20
1	20	20
2	40	20
3	74	20
4	157	20
5	326	20
6	649	14
7	1340	14
8	2845	14
9	3416	14
10	3498	14
11	3512	14
12	3512	14
13	4872	14
14	5464	14
15	5668	14
16	5725	14
17	5781	14
18	5781	14
19	5800	14
20	5804	14
0	2	2
1	2	2

Stop Event

1×	unsound
1×	node limit

Calls

Call 1

Inputs
0
1

Outputs
0
1
0

Call 2

Inputs
(+.f64 x (/.f64 (-.f64 y x) 2))
(+.f64 y (/.f64 (-.f64 x y) 2))

Outputs
(+.f64 x (/.f64 (-.f64 y x) 2))
(*.f64 1/2 (+.f64 y x))
(*.f64 1/2 (+.f64 x y))
(+.f64 y (/.f64 (-.f64 x y) 2))
(+.f64 x (/.f64 (-.f64 y x) 2))
(*.f64 1/2 (+.f64 y x))
(*.f64 1/2 (+.f64 x y))

Symmetry

(sort x y)

Compiler

Compiled 11 to 8 computations (27.3% saved)

simplify179.0ms (8.4%)

Algorithm

1×	egg-herbie

Rules

1251×	`fma-neg_binary64`
737×	`distribute-rgt-in_binary64`
446×	`distribute-lft-in_binary64`
362×	`associate--r-_binary64`
300×	`fma-def_binary64`

Iterations

Useful iterations: 8 (0.0ms)

Iter	Nodes	Cost
0	7	10
1	13	10
2	24	10
3	42	10
4	88	10
5	164	10
6	368	8
7	608	8
8	916	7
9	2146	7
10	3414	7
11	3856	7
12	3874	7
13	3888	7
14	3888	7
15	5261	7
16	5677	7
17	5833	7
18	5904	7
19	5997	7
20	6611	7

Stop Event

1×	node limit

Counts

1 → 2

Calls

Call 1

Inputs
(+.f64 x (/.f64 (-.f64 y x) 2))

Outputs
(+.f64 x (/.f64 (-.f64 y x) 2))
(fma.f64 x 1/2 (/.f64 y 2))
(fma.f64 x 1/2 (*.f64 1/2 y))
(*.f64 1/2 (+.f64 x y))

eval1.0ms (0%)

Compiler: Compiled 14 to 9 computations (35.7% saved)

prune1.0ms (0.1%)

Pruning

1 alts after pruning (1 fresh and 0 done)

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

Error

Counts

3 → 1

Alt Table

Click to see full alt table

Status	Error	Program
▶	0b	(*.f64 1/2 (+.f64 x y))

Compiler

Compiled 7 to 5 computations (28.6% saved)

localize6.0ms (0.3%)

Compiler: Compiled 13 to 6 computations (53.8% saved)

eval0.0ms (0%)

Compiler: Compiled 2 to 2 computations (0% saved)

prune1.0ms (0%)

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

Error

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Error	Program
✓	0b	(*.f64 1/2 (+.f64 x y))

Compiler

Compiled 7 to 5 computations (28.6% saved)

regimes10.0ms (0.5%)

Accuracy

Total -0.0b remaining (-∞%)

Threshold costs -0.0b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(*.f64 1/2 (+.f64 x y))
(+.f64 x (/.f64 (-.f64 y x) 2))

Outputs
(*.f64 1/2 (+.f64 x y))

Calls

3 calls:

3.0ms	(+.f64 x (/.f64 (-.f64 y x) 2))
3.0ms	y
3.0ms	x

Results

Error	Segments	Branch
0b	1	`x`
0b	1	`y`
0b	1	`(+.f64 x (/.f64 (-.f64 y x) 2))`

Compiler

Compiled 29 to 19 computations (34.5% saved)

simplify5.0ms (0.2%)

Algorithm

1×	egg-herbie

Rules

1×	`+-commutative_binary64`
1×	`*-commutative_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	7
1	8	7

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(*.f64 1/2 (+.f64 x y))

Outputs
(*.f64 1/2 (+.f64 x y))

Compiler

Compiled 7 to 5 computations (28.6% saved)

soundness469.0ms (21.9%)

Algorithm

1×	egg-herbie

Rules

1251×	`fma-neg_binary64`
737×	`distribute-rgt-in_binary64`
446×	`distribute-lft-in_binary64`
362×	`associate--r-_binary64`
300×	`fma-def_binary64`

Iterations

Useful iterations: 8 (0.0ms)

Iter	Nodes	Cost
0	7	10
1	13	10
2	24	10
3	42	10
4	88	10
5	164	10
6	368	8
7	608	8
8	916	7
9	2146	7
10	3414	7
11	3856	7
12	3874	7
13	3888	7
14	3888	7
15	5261	7
16	5677	7
17	5833	7
18	5904	7
19	5997	7
20	6611	7

Stop Event

1×	node limit

Compiler

Compiled 270 to 219 computations (18.9% saved)

end15.0ms (0.7%)

Remove: (sort x y)
Compiler: Compiled 21 to 15 computations (28.6% saved)

Details

analyze107.0ms (5%)

sample1.2s (54.1%)

preprocess188.0ms (8.8%)

simplify179.0ms (8.4%)

eval1.0ms (0%)

prune1.0ms (0.1%)

localize6.0ms (0.3%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes10.0ms (0.5%)

simplify5.0ms (0.2%)

soundness469.0ms (21.9%)

end15.0ms (0.7%)

Profiling