Solving ../../benchmarks/smtlib/true/isaplanner_prop32.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(_uz)) <= min(u, y1, _uz)
}
eq_nat(_xz, _yz) <= min(_vz, _wz, _xz) /\ min(_vz, _wz, _yz)
)
}

properties:
{
eq_nat(_zz, _aaa) <= min(a, b, _zz) /\ min(b, a, _aaa)
}


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(_zz, _aaa) <= min(a, b, _zz) /\ min(b, a, _aaa) -> 0
min(s(u), s(y1), s(_uz)) <= min(u, y1, _uz) -> 0
}


Solving took 0.028006 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.006042 s (model generation: 0.005989,  model checking: 0.000053):

Clauses:
{
min(s(u), z, z) <= True -> 0
min(z, y, z) <= True -> 0
eq_nat(_zz, _aaa) <= min(a, b, _zz) /\ min(b, a, _aaa) -> 0
min(s(u), s(y1), s(_uz)) <= min(u, y1, _uz) -> 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(_zz, _aaa) <= min(a, b, _zz) /\ min(b, a, _aaa)  :
No: ()

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


-------------------------------------------
Step 1, which took 0.006203 s (model generation: 0.006109,  model checking: 0.000094):

Clauses:
{
min(s(u), z, z) <= True -> 0
min(z, y, z) <= True -> 0
eq_nat(_zz, _aaa) <= min(a, b, _zz) /\ min(b, a, _aaa) -> 0
min(s(u), s(y1), s(_uz)) <= min(u, y1, _uz) -> 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(_khhh_0)
}

eq_nat(_zz, _aaa) <= min(a, b, _zz) /\ min(b, a, _aaa)  :
No: ()

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


-------------------------------------------
Step 2, which took 0.007985 s (model generation: 0.007870,  model checking: 0.000115):

Clauses:
{
min(s(u), z, z) <= True -> 0
min(z, y, z) <= True -> 0
eq_nat(_zz, _aaa) <= min(a, b, _zz) /\ min(b, a, _aaa) -> 0
min(s(u), s(y1), s(_uz)) <= min(u, y1, _uz) -> 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(_zz, _aaa) <= min(a, b, _zz) /\ min(b, a, _aaa)  :
Yes: {
_aaa -> s(s(_aihh_0))  ;  _zz -> s(z)  ;  a -> s(_thhh_0)  ;  b -> s(_uhhh_0)
}

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


Total time: 0.028006
Learner time: 0.019968
Teacher time: 0.000262
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}
_|