Solving ../../benchmarks/false/tree_add.smt2...

Inference procedure has parameters:
Ice fuel: 200
Timeout: 60s
Convolution: left


Learning problem is:

env: {
nat -> {s, z}  ;  nat_bin_tree -> {leaf, node}
}
definition:
{

}

properties:
{() -> eq_nat_bin_tree([t1, node(i, t1, t2)])}


over-approximation: {}
under-approximation: {}

Clause system for inference is:

{
() -> eq_nat_bin_tree([t1, node(i, t1, t2)]) -> 0
}


Solving took 0.032054 seconds.
Disproved
-------------------
STEPS:
-------------------------------------------
Step 0, which took 0.016375 s (model generation: 0.015917,  model checking: 0.000458):

Model:
|_
{

}
--
Equality automata are defined for: {eq_nat, eq_nat_bin_tree}
_|

Teacher's answer:
New clause system:
{
() -> eq_nat_bin_tree([t1, node(i, t1, t2)]) -> 3
}
Sat witness: Found: (() -> eq_nat_bin_tree([t1, node(i, t1, t2)]), {
i -> z  ;  t1 -> leaf  ;  t2 -> leaf
})

Total time: 0.032054
Reason for stopping: Disproved