Solving ../../benchmarks/false/isaplanner_prop11.smt2...

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


Learning problem is:

env: {
elt -> {a, b}  ;  eltlist -> {cons, nil}  ;  nat -> {s, z}
}
definition:
{
(drop, F:
{() -> drop([s(u), nil, nil])
() -> drop([z, l, l])
(drop([u, x3, _ema])) -> drop([s(u), cons(x2, x3), _ema])}
(drop([_fma, _gma, _hma]) /\ drop([_fma, _gma, _ima])) -> eq_eltlist([_hma, _ima])
)
}

properties:
{(drop([z, _jma, _jma])) -> BOT}


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

Clause system for inference is:

{
() -> drop([s(u), nil, nil]) -> 0
() -> drop([z, l, l]) -> 0
(drop([u, x3, _ema])) -> drop([s(u), cons(x2, x3), _ema]) -> 0
(drop([z, _jma, _jma])) -> BOT -> 0
}


Solving took 0.042475 seconds.
Disproved
-------------------
STEPS:
-------------------------------------------
Step 0, which took 0.010279 s (model generation: 0.009786,  model checking: 0.000493):

Model:
|_
{
drop -> 
{{{
Q={},
Q_f={},
Delta=
{

}

Datatype: <nat, eltlist, eltlist>
Convolution form: right
}}}

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

Teacher's answer:
New clause system:
{
() -> drop([s(u), nil, nil]) -> 0
() -> drop([z, l, l]) -> 3
(drop([u, x3, _ema])) -> drop([s(u), cons(x2, x3), _ema]) -> 1
(drop([z, _jma, _jma])) -> BOT -> 1
}
Sat witness: Found: (() -> drop([z, l, l]), {
l -> nil
})

-------------------------------------------
Step 1, which took 0.011509 s (model generation: 0.010043,  model checking: 0.001466):

Model:
|_
{
drop -> 
{{{
Q={q_gen_6860},
Q_f={q_gen_6860},
Delta=
{
<z, nil, nil>() -> q_gen_6860
}

Datatype: <nat, eltlist, eltlist>
Convolution form: right
}}}

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

Teacher's answer:
New clause system:
{
() -> drop([s(u), nil, nil]) -> 3
() -> drop([z, l, l]) -> 3
(drop([u, x3, _ema])) -> drop([s(u), cons(x2, x3), _ema]) -> 1
(drop([z, _jma, _jma])) -> BOT -> 1
}
Sat witness: Found: (() -> drop([s(u), nil, nil]), {
u -> z
})

-------------------------------------------
Step 2, which took 0.010365 s (model generation: 0.010332,  model checking: 0.000033):

Model:
|_
{
drop -> 
{{{
Q={q_gen_6860, q_gen_6862},
Q_f={q_gen_6860},
Delta=
{
<z>() -> q_gen_6862
<s, nil, nil>(q_gen_6862) -> q_gen_6860
<z, nil, nil>() -> q_gen_6860
}

Datatype: <nat, eltlist, eltlist>
Convolution form: right
}}}

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

Teacher's answer:
New clause system:
{
() -> drop([s(u), nil, nil]) -> 3
() -> drop([z, l, l]) -> 3
(drop([u, x3, _ema])) -> drop([s(u), cons(x2, x3), _ema]) -> 1
(drop([z, _jma, _jma])) -> BOT -> 4
}
Sat witness: Found: ((drop([z, _jma, _jma])) -> BOT, {
_jma -> nil
})

Total time: 0.042475
Reason for stopping: Disproved