Solving ../../benchmarks/smtlib/true/isaplanner_prop31.smt2...

Inference procedure has parameters:
Ice fuel: 200
Timeout: Some(60.) (sec)
Teacher_type: Checks all clauses every time
Approximation method: remove every clause that can be safely removed



Learning problem is:

env: {
nat -> {s, z}
}
definition:
{
(min, F:
{
min(s(u), z, z) <= True
min(z, y, z) <= True
min(s(u), s(y1), s(_ava)) <= min(u, y1, _ava)
}
eq_nat(_dva, _eva) <= min(_bva, _cva, _dva) /\ min(_bva, _cva, _eva)
)
}

properties:
{
eq_nat(_gva, _iva) <= min(_fva, c, _gva) /\ min(a, _hva, _iva) /\ min(a, b, _fva) /\ min(b, c, _hva)
}


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

Clause system for inference is:

{
min(s(u), z, z) <= True -> 0
min(z, y, z) <= True -> 0
eq_nat(_gva, _iva) <= min(_fva, c, _gva) /\ min(a, _hva, _iva) /\ min(a, b, _fva) /\ min(b, c, _hva) -> 0
min(s(u), s(y1), s(_ava)) <= min(u, y1, _ava) -> 0
}


Solving took 0.029514 seconds.
Yes: |_
name: None

min ->
[
min : <nat * nat * nat>
{
  min(s(x_0_0), s(x_1_0), s(x_2_0)) <= min(x_0_0, x_1_0, x_2_0)
  min(s(x_0_0), z, z) <= True
  min(z, s(x_1_0), z) <= True
  min(z, z, z) <= True
}
]



--
Equality automata are defined for: {nat}
_|
-------------------
STEPS:
-------------------------------------------
Step 0, which took 0.006424 s (model generation: 0.006363,  model checking: 0.000061):

Clauses:
{
min(s(u), z, z) <= True -> 0
min(z, y, z) <= True -> 0
eq_nat(_gva, _iva) <= min(_fva, c, _gva) /\ min(a, _hva, _iva) /\ min(a, b, _fva) /\ min(b, c, _hva) -> 0
min(s(u), s(y1), s(_ava)) <= min(u, y1, _ava) -> 0
}

Accumulated learning constraints:
{

}

Current best model:
|_
name: None

min ->
[
min : <nat * nat * nat>
{
  
}
]



--
Equality automata are defined for: {nat}
_|




Answer of teacher:

min(s(u), z, z) <= True  :
Yes: {

}

min(z, y, z) <= True  :
Yes: {
y -> z
}

eq_nat(_gva, _iva) <= min(_fva, c, _gva) /\ min(a, _hva, _iva) /\ min(a, b, _fva) /\ min(b, c, _hva)  :
No: ()

min(s(u), s(y1), s(_ava)) <= min(u, y1, _ava)  :
No: ()


-------------------------------------------
Step 1, which took 0.006598 s (model generation: 0.006526,  model checking: 0.000072):

Clauses:
{
min(s(u), z, z) <= True -> 0
min(z, y, z) <= True -> 0
eq_nat(_gva, _iva) <= min(_fva, c, _gva) /\ min(a, _hva, _iva) /\ min(a, b, _fva) /\ min(b, c, _hva) -> 0
min(s(u), s(y1), s(_ava)) <= min(u, y1, _ava) -> 0
}

Accumulated learning constraints:
{
min(s(z), z, z) <= True
min(z, z, z) <= True
}

Current best model:
|_
name: None

min ->
[
min : <nat * nat * nat>
{
  min(s(x_0_0), z, z) <= True
  min(z, z, z) <= True
}
]



--
Equality automata are defined for: {nat}
_|




Answer of teacher:

min(s(u), z, z) <= True  :
No: ()

min(z, y, z) <= True  :
Yes: {
y -> s(_vfhh_0)
}

eq_nat(_gva, _iva) <= min(_fva, c, _gva) /\ min(a, _hva, _iva) /\ min(a, b, _fva) /\ min(b, c, _hva)  :
No: ()

min(s(u), s(y1), s(_ava)) <= min(u, y1, _ava)  :
Yes: {
_ava -> z  ;  u -> z  ;  y1 -> z
}


-------------------------------------------
Step 2, which took 0.008025 s (model generation: 0.007706,  model checking: 0.000319):

Clauses:
{
min(s(u), z, z) <= True -> 0
min(z, y, z) <= True -> 0
eq_nat(_gva, _iva) <= min(_fva, c, _gva) /\ min(a, _hva, _iva) /\ min(a, b, _fva) /\ min(b, c, _hva) -> 0
min(s(u), s(y1), s(_ava)) <= min(u, y1, _ava) -> 0
}

Accumulated learning constraints:
{
min(s(z), s(z), s(z)) <= True
min(s(z), z, z) <= True
min(z, s(z), z) <= True
min(z, z, z) <= True
}

Current best model:
|_
name: None

min ->
[
min : <nat * nat * nat>
{
  min(s(x_0_0), s(x_1_0), s(x_2_0)) <= True
  min(s(x_0_0), z, z) <= True
  min(z, s(x_1_0), z) <= True
  min(z, z, z) <= True
}
]



--
Equality automata are defined for: {nat}
_|




Answer of teacher:

min(s(u), z, z) <= True  :
No: ()

min(z, y, z) <= True  :
No: ()

eq_nat(_gva, _iva) <= min(_fva, c, _gva) /\ min(a, _hva, _iva) /\ min(a, b, _fva) /\ min(b, c, _hva)  :
Yes: {
_fva -> s(_cghh_0)  ;  _gva -> s(z)  ;  _hva -> s(_eghh_0)  ;  _iva -> s(s(_oghh_0))  ;  a -> s(_gghh_0)  ;  b -> s(_hghh_0)  ;  c -> s(_ighh_0)
}

min(s(u), s(y1), s(_ava)) <= min(u, y1, _ava)  :
No: ()


Total time: 0.029514
Learner time: 0.020595
Teacher time: 0.000452
Reasons for stopping: Yes: |_
name: None

min ->
[
min : <nat * nat * nat>
{
  min(s(x_0_0), s(x_1_0), s(x_2_0)) <= min(x_0_0, x_1_0, x_2_0)
  min(s(x_0_0), z, z) <= True
  min(z, s(x_1_0), z) <= True
  min(z, z, z) <= True
}
]



--
Equality automata are defined for: {nat}
_|