Solving ../../benchmarks/false/successor_is_equal.smt2...
Inference procedure has parameters:
Ice fuel: 200
Timeout: 60s
Convolution: left
Learning problem is:
env: {
nat -> {s, z}
}
definition:
{
}
properties:
{() -> eq_nat([x, s(x)])}
over-approximation: {}
under-approximation: {}
Clause system for inference is:
{
() -> eq_nat([x, s(x)]) -> 0
}
Solving took 0.032487 seconds.
Disproved
-------------------
STEPS:
-------------------------------------------
Step 0, which took 0.016234 s (model generation: 0.016093, model checking: 0.000141):
Model:
|_
{
}
--
Equality automata are defined for: {eq_nat}
_|
Teacher's answer:
New clause system:
{
() -> eq_nat([x, s(x)]) -> 3
}
Sat witness: Found: (() -> eq_nat([x, s(x)]), {
x -> z
})
Total time: 0.032487
Reason for stopping: Disproved