Solving ../../benchmarks/smtlib/true/isaplanner_prop70.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:
{
(leq, P:
{
leq(z, n2) <= True
leq(s(nn1), s(nn2)) <= leq(nn1, nn2)
leq(nn1, nn2) <= leq(s(nn1), s(nn2))
False <= leq(s(nn1), z)
}
)
}

properties:
{
leq(m, s(n)) <= leq(m, n)
}


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

Clause system for inference is:

{
leq(z, n2) <= True -> 0
leq(m, s(n)) <= leq(m, n) -> 0
leq(s(nn1), s(nn2)) <= leq(nn1, nn2) -> 0
leq(nn1, nn2) <= leq(s(nn1), s(nn2)) -> 0
False <= leq(s(nn1), z) -> 0
}


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

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



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

Clauses:
{
leq(z, n2) <= True -> 0
leq(m, s(n)) <= leq(m, n) -> 0
leq(s(nn1), s(nn2)) <= leq(nn1, nn2) -> 0
leq(nn1, nn2) <= leq(s(nn1), s(nn2)) -> 0
False <= leq(s(nn1), z) -> 0
}

Accumulated learning constraints:
{

}

Current best model:
|_
name: None

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



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




Answer of teacher:

leq(z, n2) <= True  :
Yes: {
n2 -> z
}

leq(m, s(n)) <= leq(m, n)  :
No: ()

leq(s(nn1), s(nn2)) <= leq(nn1, nn2)  :
No: ()

leq(nn1, nn2) <= leq(s(nn1), s(nn2))  :
No: ()

False <= leq(s(nn1), z)  :
No: ()


-------------------------------------------
Step 1, which took 0.013950 s (model generation: 0.013877,  model checking: 0.000073):

Clauses:
{
leq(z, n2) <= True -> 0
leq(m, s(n)) <= leq(m, n) -> 0
leq(s(nn1), s(nn2)) <= leq(nn1, nn2) -> 0
leq(nn1, nn2) <= leq(s(nn1), s(nn2)) -> 0
False <= leq(s(nn1), z) -> 0
}

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

Current best model:
|_
name: None

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



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




Answer of teacher:

leq(z, n2) <= True  :
Yes: {
n2 -> s(_rnsk_0)
}

leq(m, s(n)) <= leq(m, n)  :
Yes: {
m -> z  ;  n -> z
}

leq(s(nn1), s(nn2)) <= leq(nn1, nn2)  :
Yes: {
nn1 -> z  ;  nn2 -> z
}

leq(nn1, nn2) <= leq(s(nn1), s(nn2))  :
No: ()

False <= leq(s(nn1), z)  :
No: ()


-------------------------------------------
Step 2, which took 0.010177 s (model generation: 0.010062,  model checking: 0.000115):

Clauses:
{
leq(z, n2) <= True -> 0
leq(m, s(n)) <= leq(m, n) -> 0
leq(s(nn1), s(nn2)) <= leq(nn1, nn2) -> 0
leq(nn1, nn2) <= leq(s(nn1), s(nn2)) -> 0
False <= leq(s(nn1), z) -> 0
}

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

Current best model:
|_
name: None

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



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




Answer of teacher:

leq(z, n2) <= True  :
No: ()

leq(m, s(n)) <= leq(m, n)  :
No: ()

leq(s(nn1), s(nn2)) <= leq(nn1, nn2)  :
No: ()

leq(nn1, nn2) <= leq(s(nn1), s(nn2))  :
Yes: {
nn1 -> s(_wnsk_0)  ;  nn2 -> z
}

False <= leq(s(nn1), z)  :
No: ()


-------------------------------------------
Step 3, which took 0.008134 s (model generation: 0.008083,  model checking: 0.000051):

Clauses:
{
leq(z, n2) <= True -> 0
leq(m, s(n)) <= leq(m, n) -> 0
leq(s(nn1), s(nn2)) <= leq(nn1, nn2) -> 0
leq(nn1, nn2) <= leq(s(nn1), s(nn2)) -> 0
False <= leq(s(nn1), z) -> 0
}

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

Current best model:
|_
name: None

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



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




Answer of teacher:

leq(z, n2) <= True  :
No: ()

leq(m, s(n)) <= leq(m, n)  :
No: ()

leq(s(nn1), s(nn2)) <= leq(nn1, nn2)  :
No: ()

leq(nn1, nn2) <= leq(s(nn1), s(nn2))  :
No: ()

False <= leq(s(nn1), z)  :
Yes: {

}


Total time: 0.057264
Learner time: 0.041704
Teacher time: 0.000301
Reasons for stopping: Yes: |_
name: None

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



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