Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A

Time bar (total: 1.4s)

analyze0.0ms (0%)

Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%99.9%0.1%0%0%0%0
100%99.9%0%0.1%0%0%0%1
Compiler

Compiled 11 to 8 computations (27.3% saved)

Precisions
Click to see histograms. Total time spent on operations: 0.0ms
ival-sub: 0.0ms (0% of total)
ival-mult: 0.0ms (0% of total)
const: 0.0ms (0% of total)
backward-pass: 0.0ms (0% of total)

sample894.0ms (64.8%)

Results
612.0ms8256×0valid
Precisions
Click to see histograms. Total time spent on operations: 249.0ms
ival-mult: 189.0ms (75.9% of total)
ival-sub: 48.0ms (19.3% of total)
const: 10.0ms (4% of total)
backward-pass: 2.0ms (0.8% of total)
Bogosity

preprocess104.0ms (7.5%)

Algorithm
1×egg-herbie
Rules
360×fma-define
206×fma-neg
92×cancel-sign-sub-inv
89×associate-*r*
85×distribute-lft-neg-in
Iterations

Useful iterations: 2 (0.0ms)

IterNodesCost
034332
1103314
2247276
3629276
41120276
51518276
61555276
71560276
81560276
91560276
Stop Event
1×saturated
Calls
Call 1
Inputs
(-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) z))
(-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) z))
(-.f64 (neg.f64 x) (*.f64 (*.f64 y #s(literal 4 binary64)) z))
(-.f64 x (*.f64 (*.f64 (neg.f64 y) #s(literal 4 binary64)) z))
(-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) (neg.f64 z)))
(neg.f64 (-.f64 (neg.f64 x) (*.f64 (*.f64 y #s(literal 4 binary64)) z)))
(neg.f64 (-.f64 x (*.f64 (*.f64 (neg.f64 y) #s(literal 4 binary64)) z)))
(neg.f64 (-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) (neg.f64 z))))
(-.f64 y (*.f64 (*.f64 x #s(literal 4 binary64)) z))
(-.f64 z (*.f64 (*.f64 y #s(literal 4 binary64)) x))
(-.f64 x (*.f64 (*.f64 z #s(literal 4 binary64)) y))
Outputs
(-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) z))
(-.f64 x (*.f64 y (*.f64 #s(literal 4 binary64) z)))
(+.f64 x (*.f64 z (*.f64 y #s(literal -4 binary64))))
(fma.f64 y (*.f64 z #s(literal -4 binary64)) x)
(-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) z))
(-.f64 x (*.f64 y (*.f64 #s(literal 4 binary64) z)))
(+.f64 x (*.f64 z (*.f64 y #s(literal -4 binary64))))
(fma.f64 y (*.f64 z #s(literal -4 binary64)) x)
(-.f64 (neg.f64 x) (*.f64 (*.f64 y #s(literal 4 binary64)) z))
(-.f64 (neg.f64 x) (*.f64 y (*.f64 #s(literal 4 binary64) z)))
(fma.f64 #s(literal -1 binary64) x (*.f64 z (*.f64 y #s(literal -4 binary64))))
(-.f64 (*.f64 z (*.f64 y #s(literal -4 binary64))) x)
(-.f64 (*.f64 y (*.f64 z #s(literal -4 binary64))) x)
(-.f64 x (*.f64 (*.f64 (neg.f64 y) #s(literal 4 binary64)) z))
(-.f64 x (*.f64 z (*.f64 #s(literal 4 binary64) (neg.f64 y))))
(+.f64 x (*.f64 y (*.f64 #s(literal 4 binary64) z)))
(fma.f64 y (*.f64 #s(literal 4 binary64) z) x)
(-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) (neg.f64 z)))
(-.f64 x (*.f64 z (*.f64 #s(literal 4 binary64) (neg.f64 y))))
(+.f64 x (*.f64 y (*.f64 #s(literal 4 binary64) z)))
(fma.f64 y (*.f64 #s(literal 4 binary64) z) x)
(neg.f64 (-.f64 (neg.f64 x) (*.f64 (*.f64 y #s(literal 4 binary64)) z)))
(-.f64 x (*.f64 z (*.f64 #s(literal 4 binary64) (neg.f64 y))))
(+.f64 x (*.f64 y (*.f64 #s(literal 4 binary64) z)))
(fma.f64 y (*.f64 #s(literal 4 binary64) z) x)
(neg.f64 (-.f64 x (*.f64 (*.f64 (neg.f64 y) #s(literal 4 binary64)) z)))
(-.f64 (neg.f64 x) (*.f64 y (*.f64 #s(literal 4 binary64) z)))
(fma.f64 #s(literal -1 binary64) x (*.f64 z (*.f64 y #s(literal -4 binary64))))
(-.f64 (*.f64 z (*.f64 y #s(literal -4 binary64))) x)
(-.f64 (*.f64 y (*.f64 z #s(literal -4 binary64))) x)
(neg.f64 (-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) (neg.f64 z))))
(-.f64 (neg.f64 x) (*.f64 y (*.f64 #s(literal 4 binary64) z)))
(fma.f64 #s(literal -1 binary64) x (*.f64 z (*.f64 y #s(literal -4 binary64))))
(-.f64 (*.f64 z (*.f64 y #s(literal -4 binary64))) x)
(-.f64 (*.f64 y (*.f64 z #s(literal -4 binary64))) x)
(-.f64 y (*.f64 (*.f64 x #s(literal 4 binary64)) z))
(-.f64 y (*.f64 x (*.f64 #s(literal 4 binary64) z)))
(+.f64 y (*.f64 z (*.f64 x #s(literal -4 binary64))))
(fma.f64 x (*.f64 z #s(literal -4 binary64)) y)
(-.f64 z (*.f64 (*.f64 y #s(literal 4 binary64)) x))
(-.f64 z (*.f64 x (*.f64 y #s(literal 4 binary64))))
(+.f64 z (*.f64 x (*.f64 y #s(literal -4 binary64))))
(fma.f64 x (*.f64 y #s(literal -4 binary64)) z)
(-.f64 x (*.f64 (*.f64 z #s(literal 4 binary64)) y))
(-.f64 x (*.f64 y (*.f64 #s(literal 4 binary64) z)))
(+.f64 x (*.f64 z (*.f64 y #s(literal -4 binary64))))
(fma.f64 y (*.f64 z #s(literal -4 binary64)) x)
Symmetry

(sort y z)

explain276.0ms (20%)

FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-x
00-0-(*.f64 (*.f64 y #s(literal 4 binary64)) z)
00-0-#s(literal 4 binary64)
00-0-z
00-0-(-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) z))
00-0-(*.f64 y #s(literal 4 binary64))
00-0-y
Results
199.0ms512×0valid
Compiler

Compiled 56 to 35 computations (37.5% saved)

Precisions
Click to see histograms. Total time spent on operations: 29.0ms
ival-mult: 25.0ms (85% of total)
ival-sub: 3.0ms (10.2% of total)
const: 1.0ms (3.4% of total)
backward-pass: 0.0ms (0% of total)

eval1.0ms (0%)

Compiler

Compiled 23 to 14 computations (39.1% saved)

prune1.0ms (0.1%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
(-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) z))
Compiler

Compiled 10 to 7 computations (30% saved)

localize33.0ms (2.4%)

Results
24.0ms256×0valid
Compiler

Compiled 23 to 14 computations (39.1% saved)

Precisions
Click to see histograms. Total time spent on operations: 12.0ms
ival-mult: 10.0ms (80.6% of total)
ival-sub: 1.0ms (8.1% of total)
const: 1.0ms (8.1% of total)
backward-pass: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler

Compiled 3 to 3 computations (0% saved)

prune1.0ms (0.1%)

Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New000
Fresh000
Picked011
Done000
Total011
Accuracy
100.0%
Counts
1 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) z))
Compiler

Compiled 20 to 14 computations (30% saved)

simplify3.0ms (0.2%)

Algorithm
1×egg-herbie
Rules
7×*-commutative
6×sub-neg
6×+-commutative
5×neg-sub0
5×neg-mul-1
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01328
12128
23928
34928
45728
56028
Stop Event
1×saturated
Calls
Call 1
Inputs
(-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) z))
Outputs
(-.f64 x (*.f64 (*.f64 y #s(literal 4 binary64)) z))

soundness0.0ms (0%)

Stop Event
1×done
Compiler

Compiled 10 to 7 computations (30% saved)

preprocess66.0ms (4.8%)

Remove

(sort y z)

Compiler

Compiled 80 to 56 computations (30% saved)

end0.0ms (0%)

Profiling

Loading profile data...